cloog-0.18.4/0000755000175000017500000000000012555417257007725 500000000000000cloog-0.18.4/autoconf/0000755000175000017500000000000012555417256011542 500000000000000cloog-0.18.4/autoconf/compile0000755000175000017500000001624512413256727013045 00000000000000#! /bin/sh # Wrapper for compilers which do not understand '-c -o'. scriptversion=2012-10-14.11; # UTC # Copyright (C) 1999-2013 Free Software Foundation, Inc. # Written by Tom Tromey . # # 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. # This file is maintained in Automake, please report # bugs to or send patches to # . nl=' ' # We need space, tab and new line, in precisely that order. Quoting is # there to prevent tools from complaining about whitespace usage. IFS=" "" $nl" file_conv= # func_file_conv build_file lazy # Convert a $build file to $host form and store it in $file # Currently only supports Windows hosts. If the determined conversion # type is listed in (the comma separated) LAZY, no conversion will # take place. func_file_conv () { file=$1 case $file in / | /[!/]*) # absolute file, and not a UNC file if test -z "$file_conv"; then # lazily determine how to convert abs files case `uname -s` in MINGW*) file_conv=mingw ;; CYGWIN*) file_conv=cygwin ;; *) file_conv=wine ;; esac fi case $file_conv/,$2, in *,$file_conv,*) ;; mingw/*) file=`cmd //C echo "$file " | sed -e 's/"\(.*\) " *$/\1/'` ;; cygwin/*) file=`cygpath -m "$file" || echo "$file"` ;; wine/*) file=`winepath -w "$file" || echo "$file"` ;; esac ;; esac } # func_cl_dashL linkdir # Make cl look for libraries in LINKDIR func_cl_dashL () { func_file_conv "$1" if test -z "$lib_path"; then lib_path=$file else lib_path="$lib_path;$file" fi linker_opts="$linker_opts -LIBPATH:$file" } # func_cl_dashl library # Do a library search-path lookup for cl func_cl_dashl () { lib=$1 found=no save_IFS=$IFS IFS=';' for dir in $lib_path $LIB do IFS=$save_IFS if $shared && test -f "$dir/$lib.dll.lib"; then found=yes lib=$dir/$lib.dll.lib break fi if test -f "$dir/$lib.lib"; then found=yes lib=$dir/$lib.lib break fi if test -f "$dir/lib$lib.a"; then found=yes lib=$dir/lib$lib.a break fi done IFS=$save_IFS if test "$found" != yes; then lib=$lib.lib fi } # func_cl_wrapper cl arg... # Adjust compile command to suit cl func_cl_wrapper () { # Assume a capable shell lib_path= shared=: linker_opts= for arg do if test -n "$eat"; then eat= else case $1 in -o) # configure might choose to run compile as 'compile cc -o foo foo.c'. eat=1 case $2 in *.o | *.[oO][bB][jJ]) func_file_conv "$2" set x "$@" -Fo"$file" shift ;; *) func_file_conv "$2" set x "$@" -Fe"$file" shift ;; esac ;; -I) eat=1 func_file_conv "$2" mingw set x "$@" -I"$file" shift ;; -I*) func_file_conv "${1#-I}" mingw set x "$@" -I"$file" shift ;; -l) eat=1 func_cl_dashl "$2" set x "$@" "$lib" shift ;; -l*) func_cl_dashl "${1#-l}" set x "$@" "$lib" shift ;; -L) eat=1 func_cl_dashL "$2" ;; -L*) func_cl_dashL "${1#-L}" ;; -static) shared=false ;; -Wl,*) arg=${1#-Wl,} save_ifs="$IFS"; IFS=',' for flag in $arg; do IFS="$save_ifs" linker_opts="$linker_opts $flag" done IFS="$save_ifs" ;; -Xlinker) eat=1 linker_opts="$linker_opts $2" ;; -*) set x "$@" "$1" shift ;; *.cc | *.CC | *.cxx | *.CXX | *.[cC]++) func_file_conv "$1" set x "$@" -Tp"$file" shift ;; *.c | *.cpp | *.CPP | *.lib | *.LIB | *.Lib | *.OBJ | *.obj | *.[oO]) func_file_conv "$1" mingw set x "$@" "$file" shift ;; *) set x "$@" "$1" shift ;; esac fi shift done if test -n "$linker_opts"; then linker_opts="-link$linker_opts" fi exec "$@" $linker_opts exit 1 } eat= case $1 in '') echo "$0: No command. Try '$0 --help' for more information." 1>&2 exit 1; ;; -h | --h*) cat <<\EOF Usage: compile [--help] [--version] PROGRAM [ARGS] Wrapper for compilers which do not understand '-c -o'. Remove '-o dest.o' from ARGS, run PROGRAM with the remaining arguments, and rename the output as expected. If you are trying to build a whole package this is not the right script to run: please start by reading the file 'INSTALL'. Report bugs to . EOF exit $? ;; -v | --v*) echo "compile $scriptversion" exit $? ;; cl | *[/\\]cl | cl.exe | *[/\\]cl.exe ) func_cl_wrapper "$@" # Doesn't return... ;; esac ofile= cfile= for arg do if test -n "$eat"; then eat= else case $1 in -o) # configure might choose to run compile as 'compile cc -o foo foo.c'. # So we strip '-o arg' only if arg is an object. eat=1 case $2 in *.o | *.obj) ofile=$2 ;; *) set x "$@" -o "$2" shift ;; esac ;; *.c) cfile=$1 set x "$@" "$1" shift ;; *) set x "$@" "$1" shift ;; esac fi shift done if test -z "$ofile" || test -z "$cfile"; then # If no '-o' option was seen then we might have been invoked from a # pattern rule where we don't need one. That is ok -- this is a # normal compilation that the losing compiler can handle. If no # '.c' file was seen then we are probably linking. That is also # ok. exec "$@" fi # Name of file we expect compiler to create. cofile=`echo "$cfile" | sed 's|^.*[\\/]||; s|^[a-zA-Z]:||; s/\.c$/.o/'` # Create the lock directory. # Note: use '[/\\:.-]' here to ensure that we don't use the same name # that we are using for the .o file. Also, base the name on the expected # object file name, since that is what matters with a parallel build. lockdir=`echo "$cofile" | sed -e 's|[/\\:.-]|_|g'`.d while true; do if mkdir "$lockdir" >/dev/null 2>&1; then break fi sleep 1 done # FIXME: race condition here if user kills between mkdir and trap. trap "rmdir '$lockdir'; exit 1" 1 2 15 # Run the compile. "$@" ret=$? if test -f "$cofile"; then test "$cofile" = "$ofile" || mv "$cofile" "$ofile" elif test -f "${cofile}bj"; then test "${cofile}bj" = "$ofile" || mv "${cofile}bj" "$ofile" fi rmdir "$lockdir" exit $ret # 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.4/autoconf/ltmain.sh0000644000175000017500000105204412413256724013302 00000000000000 # libtool (GNU libtool) 2.4.2 # Written by Gordon Matzigkeit , 1996 # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, 2006, # 2007, 2008, 2009, 2010, 2011 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 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. # Usage: $progname [OPTION]... [MODE-ARG]... # # Provide generalized library-building support services. # # --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 # --preserve-dup-deps don't remove duplicate dependency libraries # --quiet, --silent don't print informational messages # --no-quiet, --no-silent # print informational messages (default) # --no-warn don't display warning messages # --tag=TAG use configuration variables from tag TAG # -v, --verbose print more informational messages than default # --no-verbose don't print the extra informational messages # --version print version information # -h, --help, --help-all print short, long, or detailed 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) # $progname: (GNU libtool) 2.4.2 Debian-2.4.2-1.7ubuntu1 # automake: $automake_version # autoconf: $autoconf_version # # Report bugs to . # GNU libtool home page: . # General help using GNU software: . PROGRAM=libtool PACKAGE=libtool VERSION="2.4.2 Debian-2.4.2-1.7ubuntu1" TIMESTAMP="" package_revision=1.3337 # 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 # A function that is used when there is no print builtin or printf. func_fallback_echo () { eval 'cat <<_LTECHO_EOF $1 _LTECHO_EOF' } # NLS nuisances: We save the old values to restore during execute mode. lt_user_locale= lt_safe_locale= for lt_var in LANG LANGUAGE LC_ALL LC_CTYPE LC_COLLATE LC_MESSAGES do eval "if test \"\${$lt_var+set}\" = set; then save_$lt_var=\$$lt_var $lt_var=C export $lt_var lt_user_locale=\"$lt_var=\\\$save_\$lt_var; \$lt_user_locale\" lt_safe_locale=\"$lt_var=C; \$lt_safe_locale\" fi" done LC_ALL=C LANGUAGE=C export LANGUAGE LC_ALL $lt_unset CDPATH # 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" : ${CP="cp -f"} test "${ECHO+set}" = set || ECHO=${as_echo-'printf %s\n'} : ${MAKE="make"} : ${MKDIR="mkdir"} : ${MV="mv -f"} : ${RM="rm -f"} : ${SHELL="${CONFIG_SHELL-/bin/sh}"} : ${Xsed="$SED -e 1s/^X//"} # Global variables: 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. exit_status=$EXIT_SUCCESS # Make sure IFS has a sensible default lt_nl=' ' IFS=" $lt_nl" dirname="s,/[^/]*$,," basename="s,^.*/,," # func_dirname file append nondir_replacement # Compute the dirname of FILE. If nonempty, add APPEND to the result, # otherwise set result to NONDIR_REPLACEMENT. func_dirname () { func_dirname_result=`$ECHO "${1}" | $SED "$dirname"` if test "X$func_dirname_result" = "X${1}"; then func_dirname_result="${3}" else func_dirname_result="$func_dirname_result${2}" fi } # func_dirname may be replaced by extended shell implementation # func_basename file func_basename () { func_basename_result=`$ECHO "${1}" | $SED "$basename"` } # func_basename may be replaced by extended shell implementation # 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" # Implementation must be kept synchronized with func_dirname # and func_basename. For efficiency, we do not delegate to # those functions but instead duplicate the functionality here. func_dirname_and_basename () { # Extract subdirectory from the argument. func_dirname_result=`$ECHO "${1}" | $SED -e "$dirname"` if test "X$func_dirname_result" = "X${1}"; then func_dirname_result="${3}" else func_dirname_result="$func_dirname_result${2}" fi func_basename_result=`$ECHO "${1}" | $SED -e "$basename"` } # func_dirname_and_basename may be replaced by extended shell implementation # func_stripname 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). # func_strip_suffix prefix name func_stripname () { 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 may be replaced by extended shell implementation # These SED scripts presuppose an absolute path with a trailing slash. pathcar='s,^/\([^/]*\).*$,\1,' pathcdr='s,^/[^/]*,,' removedotparts=':dotsl s@/\./@/@g t dotsl s,/\.$,/,' collapseslashes='s@/\{1,\}@/@g' finalslash='s,/*$,/,' # 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. # value returned in "$func_normal_abspath_result" func_normal_abspath () { # 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 "$removedotparts" -e "$collapseslashes" -e "$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 "$pathcar"` func_normal_abspath_tpath=`$ECHO "$func_normal_abspath_tpath" | $SED \ -e "$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_normal_abspath_result=$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_relative_path SRCDIR DSTDIR # generates a relative path from SRCDIR to DSTDIR, with a trailing # slash if non-empty, suitable for immediately appending a filename # without needing to append a separator. # value returned in "$func_relative_path_result" func_relative_path () { 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 "x$func_relative_path_tlibdir" = x ; 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 "x$func_stripname_result" != x ; then func_relative_path_result=${func_relative_path_result}/${func_stripname_result} fi # Normalisation. If bindir is libdir, return empty string, # else relative path ending with a slash; either way, target # file name can be directly appended. if test ! -z "$func_relative_path_result"; then func_stripname './' '' "$func_relative_path_result/" func_relative_path_result=$func_stripname_result fi } # The name of this program: func_dirname_and_basename "$progpath" progname=$func_basename_result # Make sure we have an absolute path for reexecution: case $progpath in [\\/]*|[A-Za-z]:\\*) ;; *[\\/]*) progdir=$func_dirname_result progdir=`cd "$progdir" && pwd` progpath="$progdir/$progname" ;; *) save_IFS="$IFS" IFS=${PATH_SEPARATOR-:} for progdir in $PATH; do IFS="$save_IFS" test -x "$progdir/$progname" && break done IFS="$save_IFS" test -n "$progdir" || progdir=`pwd` progpath="$progdir/$progname" ;; esac # Sed substitution that helps us do robust quoting. It backslashifies # metacharacters that are still active within double-quoted strings. Xsed="${SED}"' -e 1s/^X//' sed_quote_subst='s/\([`"$\\]\)/\\\1/g' # Same as above, but do not quote variable references. 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 # which contains forward slashes, into one that contains # (escaped) backslashes. A very naive implementation. lt_sed_naive_backslashify='s|\\\\*|\\|g;s|/|\\|g;s|\\|\\\\|g' # Re-`\' parameter expansions in output of double_quote_subst that were # `\'-ed in input to the same. If an odd number of `\' preceded a '$' # in input to 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 '$'. bs='\\' bs2='\\\\' bs4='\\\\\\\\' dollar='\$' sed_double_backslash="\ s/$bs4/&\\ /g s/^$bs2$dollar/$bs&/ s/\\([^$bs]\\)$bs2$dollar/\\1$bs2$bs$dollar/g s/\n//g" # Standard options: opt_dry_run=false opt_help=false opt_quiet=false opt_verbose=false opt_warning=: # func_echo arg... # Echo program name prefixed message, along with the current mode # name if it has been set yet. func_echo () { $ECHO "$progname: ${opt_mode+$opt_mode: }$*" } # func_verbose arg... # Echo program name prefixed message in verbose mode only. func_verbose () { $opt_verbose && 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_echo_all arg... # Invoke $ECHO with all args, space-separated. func_echo_all () { $ECHO "$*" } # func_error arg... # Echo program name prefixed message to standard error. func_error () { $ECHO "$progname: ${opt_mode+$opt_mode: }"${1+"$@"} 1>&2 } # func_warning arg... # Echo program name prefixed warning message to standard error. func_warning () { $opt_warning && $ECHO "$progname: ${opt_mode+$opt_mode: }warning: "${1+"$@"} 1>&2 # bash bug again: : } # func_fatal_error arg... # Echo program name prefixed message to standard error, and exit. func_fatal_error () { func_error ${1+"$@"} exit $EXIT_FAILURE } # func_fatal_help arg... # Echo program name prefixed message to standard error, followed by # a help hint, and exit. func_fatal_help () { func_error ${1+"$@"} func_fatal_error "$help" } help="Try \`$progname --help' for more information." ## default # func_grep expression filename # Check whether EXPRESSION matches any line of FILENAME, without output. func_grep () { $GREP "$1" "$2" >/dev/null 2>&1 } # func_mkdir_p directory-path # Make sure the entire path to DIRECTORY-PATH is available. func_mkdir_p () { my_directory_path="$1" my_dir_list= if test -n "$my_directory_path" && test "$opt_dry_run" != ":"; then # Protect directory names starting with `-' case $my_directory_path in -*) my_directory_path="./$my_directory_path" ;; esac # While some portion of DIR does not yet exist... while test ! -d "$my_directory_path"; do # ...make a list in topmost first order. Use a colon delimited # list incase some portion of path contains whitespace. my_dir_list="$my_directory_path:$my_dir_list" # If the last portion added has no slash in it, the list is done case $my_directory_path in */*) ;; *) break ;; esac # ...otherwise throw away the child directory and loop my_directory_path=`$ECHO "$my_directory_path" | $SED -e "$dirname"` done my_dir_list=`$ECHO "$my_dir_list" | $SED 's,:*$,,'` save_mkdir_p_IFS="$IFS"; IFS=':' for my_dir in $my_dir_list; do IFS="$save_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 "$my_dir" 2>/dev/null || : done IFS="$save_mkdir_p_IFS" # Bail out if we (or some other process) failed to create a directory. test -d "$my_directory_path" || \ func_fatal_error "Failed to create \`$1'" fi } # func_mktempdir [string] # Make a temporary directory that won't clash with other running # libtool processes, and avoids race conditions if possible. If # given, STRING is the basename for that directory. func_mktempdir () { my_template="${TMPDIR-/tmp}/${1-$progname}" if test "$opt_dry_run" = ":"; then # Return a directory name, but don't create it in dry-run mode my_tmpdir="${my_template}-$$" else # If mktemp works, use that first and foremost my_tmpdir=`mktemp -d "${my_template}-XXXXXXXX" 2>/dev/null` if test ! -d "$my_tmpdir"; then # Failing that, at least try and use $RANDOM to avoid a race my_tmpdir="${my_template}-${RANDOM-0}$$" save_mktempdir_umask=`umask` umask 0077 $MKDIR "$my_tmpdir" umask $save_mktempdir_umask fi # If we're not in dry-run mode, bomb out on failure test -d "$my_tmpdir" || \ func_fatal_error "cannot create temporary directory \`$my_tmpdir'" fi $ECHO "$my_tmpdir" } # func_quote_for_eval arg # Aesthetically quote ARG to be evaled later. # This function returns two values: FUNC_QUOTE_FOR_EVAL_RESULT # is double-quoted, suitable for a subsequent eval, whereas # FUNC_QUOTE_FOR_EVAL_UNQUOTED_RESULT has merely all characters # which are still active within double quotes backslashified. func_quote_for_eval () { case $1 in *[\\\`\"\$]*) func_quote_for_eval_unquoted_result=`$ECHO "$1" | $SED "$sed_quote_subst"` ;; *) func_quote_for_eval_unquoted_result="$1" ;; esac case $func_quote_for_eval_unquoted_result in # Double-quote args containing shell metacharacters to delay # word splitting, command substitution and and variable # expansion for a subsequent eval. # Many Bourne shells cannot handle close brackets correctly # in scan sets, so we specify it separately. *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") func_quote_for_eval_result="\"$func_quote_for_eval_unquoted_result\"" ;; *) func_quote_for_eval_result="$func_quote_for_eval_unquoted_result" esac } # 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 () { case $1 in *[\\\`\"]*) my_arg=`$ECHO "$1" | $SED \ -e "$double_quote_subst" -e "$sed_double_backslash"` ;; *) my_arg="$1" ;; esac case $my_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. *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") my_arg="\"$my_arg\"" ;; esac func_quote_for_expand_result="$my_arg" } # func_show_eval cmd [fail_exp] # Unless opt_silent 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 () { my_cmd="$1" my_fail_exp="${2-:}" ${opt_silent-false} || { func_quote_for_expand "$my_cmd" eval "func_echo $func_quote_for_expand_result" } if ${opt_dry_run-false}; then :; else eval "$my_cmd" my_status=$? if test "$my_status" -eq 0; then :; else eval "(exit $my_status); $my_fail_exp" fi fi } # func_show_eval_locale cmd [fail_exp] # Unless opt_silent 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 () { my_cmd="$1" my_fail_exp="${2-:}" ${opt_silent-false} || { func_quote_for_expand "$my_cmd" eval "func_echo $func_quote_for_expand_result" } if ${opt_dry_run-false}; then :; else eval "$lt_user_locale $my_cmd" my_status=$? eval "$lt_safe_locale" if test "$my_status" -eq 0; then :; else eval "(exit $my_status); $my_fail_exp" fi 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 () { case $1 in [0-9]* | *[!a-zA-Z0-9_]*) func_tr_sh_result=`$ECHO "$1" | $SED 's/^\([0-9]\)/_\1/; s/[^a-zA-Z0-9_]/_/g'` ;; * ) func_tr_sh_result=$1 ;; esac } # func_version # Echo version message to standard output and exit. func_version () { $opt_debug $SED -n '/(C)/!b go :more /\./!{ N s/\n# / / b more } :go /^# '$PROGRAM' (GNU /,/# warranty; / { s/^# // s/^# *$// s/\((C)\)[ 0-9,-]*\( [1-9][0-9]*\)/\1\2/ p }' < "$progpath" exit $? } # func_usage # Echo short help message to standard output and exit. func_usage () { $opt_debug $SED -n '/^# Usage:/,/^# *.*--help/ { s/^# // s/^# *$// s/\$progname/'$progname'/ p }' < "$progpath" echo $ECHO "run \`$progname --help | more' for full usage" exit $? } # func_help [NOEXIT] # Echo long help message to standard output and exit, # unless 'noexit' is passed as argument. func_help () { $opt_debug $SED -n '/^# Usage:/,/# Report bugs to/ { :print s/^# // s/^# *$// s*\$progname*'$progname'* s*\$host*'"$host"'* s*\$SHELL*'"$SHELL"'* s*\$LTCC*'"$LTCC"'* s*\$LTCFLAGS*'"$LTCFLAGS"'* s*\$LD*'"$LD"'* s/\$with_gnu_ld/'"$with_gnu_ld"'/ s/\$automake_version/'"`(${AUTOMAKE-automake} --version) 2>/dev/null |$SED 1q`"'/ s/\$autoconf_version/'"`(${AUTOCONF-autoconf} --version) 2>/dev/null |$SED 1q`"'/ p d } /^# .* home page:/b print /^# General help using/b print ' < "$progpath" ret=$? if test -z "$1"; then exit $ret fi } # func_missing_arg argname # Echo program name prefixed message to standard error and set global # exit_cmd. func_missing_arg () { $opt_debug func_error "missing argument for $1." exit_cmd=exit } # 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. func_split_short_opt () { my_sed_short_opt='1s/^\(..\).*$/\1/;q' my_sed_short_rest='1s/^..\(.*\)$/\1/;q' func_split_short_opt_name=`$ECHO "$1" | $SED "$my_sed_short_opt"` func_split_short_opt_arg=`$ECHO "$1" | $SED "$my_sed_short_rest"` } # func_split_short_opt may be replaced by extended shell implementation # func_split_long_opt longopt # Set func_split_long_opt_name and func_split_long_opt_arg shell # variables after splitting LONGOPT at the `=' sign. func_split_long_opt () { my_sed_long_opt='1s/^\(--[^=]*\)=.*/\1/;q' my_sed_long_arg='1s/^--[^=]*=//' func_split_long_opt_name=`$ECHO "$1" | $SED "$my_sed_long_opt"` func_split_long_opt_arg=`$ECHO "$1" | $SED "$my_sed_long_arg"` } # func_split_long_opt may be replaced by extended shell implementation exit_cmd=: magic="%%%MAGIC variable%%%" magic_exe="%%%MAGIC EXE variable%%%" # Global variables. nonopt= preserve_args= lo2o="s/\\.lo\$/.${objext}/" o2lo="s/\\.${objext}\$/.lo/" 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= # func_append var value # Append VALUE to the end of shell variable VAR. func_append () { eval "${1}=\$${1}\${2}" } # func_append may be replaced by extended shell implementation # func_append_quoted var value # Quote VALUE and append to the end of shell variable VAR, separated # by a space. func_append_quoted () { func_quote_for_eval "${2}" eval "${1}=\$${1}\\ \$func_quote_for_eval_result" } # func_append_quoted may be replaced by extended shell implementation # func_arith arithmetic-term... func_arith () { func_arith_result=`expr "${@}"` } # func_arith may be replaced by extended shell implementation # func_len string # STRING may not start with a hyphen. func_len () { func_len_result=`expr "${1}" : ".*" 2>/dev/null || echo $max_cmd_len` } # func_len may be replaced by extended shell implementation # func_lo2o object func_lo2o () { func_lo2o_result=`$ECHO "${1}" | $SED "$lo2o"` } # func_lo2o may be replaced by extended shell implementation # func_xform libobj-or-source func_xform () { func_xform_result=`$ECHO "${1}" | $SED 's/\.[^.]*$/.lo/'` } # func_xform may be replaced by extended shell implementation # func_fatal_configuration arg... # Echo program name prefixed message to standard error, followed by # a configuration failure hint, and exit. func_fatal_configuration () { func_error ${1+"$@"} func_error "See the $PACKAGE documentation for more information." func_fatal_error "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 "$build_libtool_libs" = yes; then echo "enable shared libraries" else echo "disable shared libraries" fi if test "$build_old_libs" = yes; 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 } # 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 # Option defaults: opt_debug=: opt_dry_run=false opt_config=false opt_preserve_dup_deps=false opt_features=false opt_finish=false opt_help=false opt_help_all=false opt_silent=: opt_warning=: opt_verbose=: opt_silent=false opt_verbose=false # Parse options once, thoroughly. This comes as soon as possible in the # script to make things like `--version' happen as quickly as we can. { # this just eases exit handling while test $# -gt 0; do opt="$1" shift case $opt in --debug|-x) opt_debug='set -x' func_echo "enabling shell trace mode" $opt_debug ;; --dry-run|--dryrun|-n) opt_dry_run=: ;; --config) opt_config=: func_config ;; --dlopen|-dlopen) optarg="$1" opt_dlopen="${opt_dlopen+$opt_dlopen }$optarg" shift ;; --preserve-dup-deps) opt_preserve_dup_deps=: ;; --features) opt_features=: func_features ;; --finish) opt_finish=: set dummy --mode finish ${1+"$@"}; shift ;; --help) opt_help=: ;; --help-all) opt_help_all=: opt_help=': help-all' ;; --mode) test $# = 0 && func_missing_arg $opt && break optarg="$1" opt_mode="$optarg" case $optarg in # Valid mode arguments: clean|compile|execute|finish|install|link|relink|uninstall) ;; # Catch anything else as an error *) func_error "invalid argument for $opt" exit_cmd=exit break ;; esac shift ;; --no-silent|--no-quiet) opt_silent=false func_append preserve_args " $opt" ;; --no-warning|--no-warn) opt_warning=false func_append preserve_args " $opt" ;; --no-verbose) opt_verbose=false func_append preserve_args " $opt" ;; --silent|--quiet) opt_silent=: func_append preserve_args " $opt" opt_verbose=false ;; --verbose|-v) opt_verbose=: func_append preserve_args " $opt" opt_silent=false ;; --tag) test $# = 0 && func_missing_arg $opt && break optarg="$1" opt_tag="$optarg" func_append preserve_args " $opt $optarg" func_enable_tag "$optarg" shift ;; -\?|-h) func_usage ;; --help) func_help ;; --version) func_version ;; # Separate optargs to long options: --*=*) func_split_long_opt "$opt" set dummy "$func_split_long_opt_name" "$func_split_long_opt_arg" ${1+"$@"} shift ;; # Separate non-argument short options: -\?*|-h*|-n*|-v*) func_split_short_opt "$opt" set dummy "$func_split_short_opt_name" "-$func_split_short_opt_arg" ${1+"$@"} shift ;; --) break ;; -*) func_fatal_help "unrecognized option \`$opt'" ;; *) set dummy "$opt" ${1+"$@"}; shift; break ;; esac done # Validate options: # save first non-option argument if test "$#" -gt 0; then nonopt="$opt" shift fi # preserve --debug test "$opt_debug" = : || 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 if test "$build_libtool_libs" != yes && test "$build_old_libs" != yes; then func_fatal_configuration "not configured to build any kind of library" fi # Darwin sucks eval std_shrext=\"$shrext_cmds\" # Only execute mode is allowed to have -dlopen flags. if test -n "$opt_dlopen" && test "$opt_mode" != execute; 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." } # Bail if the options were screwed $exit_cmd $EXIT_FAILURE } ## ----------- ## ## Main. ## ## ----------- ## # 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 "$lalib_p" = yes } # 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 () { $opt_debug save_ifs=$IFS; IFS='~' for cmd in $1; do IFS=$save_ifs eval cmd=\"$cmd\" 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 () { $opt_debug 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 () { $opt_debug 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 "$build_libtool_libs" = yes; then write_lobj=\'${2}\' else write_lobj=none fi if test "$build_old_libs" = yes; 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 "$lt_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 () { $opt_debug # 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 () { $opt_debug 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 () { $opt_debug # awkward: cmd appends spaces to result func_convert_core_msys_to_w32_result=`( cmd //c echo "$1" ) 2>/dev/null | $SED -e 's/[ ]*$//' -e "$lt_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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug $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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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_mode_compile arg... func_mode_compile () { $opt_debug # 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 "$build_libtool_libs" != yes && \ func_fatal_configuration "can not 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 "$build_old_libs" = yes; 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 "$pic_mode" = no && test "$deplibs_check_method" != pass_all; 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 "$compiler_c_o" = no; 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 "$need_locks" = yes; 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 "$need_locks" = warn; 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 "$build_libtool_libs" = yes; then # Without this assignment, base_compile gets emptied. fbsd_hideous_sh_bug=$base_compile if test "$pic_mode" != no; 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 "$need_locks" = warn && 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 "$suppress_opt" = yes; then suppress_output=' >/dev/null 2>&1' fi fi # Only build a position-dependent object if we build old libraries. if test "$build_old_libs" = yes; then if test "$pic_mode" != yes; then # Don't build PIC code command="$base_compile $qsrcfile$pie_flag" else command="$base_compile $qsrcfile $pic_flag" fi if test "$compiler_c_o" = yes; 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 "$need_locks" = warn && 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 "$need_locks" != no; then removelist=$lockfile $RM "$lockfile" fi } exit $EXIT_SUCCESS } $opt_help || { test "$opt_mode" = compile && 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 () { $opt_debug # 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 test "X$opt_dry_run" = Xfalse; then 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" else # 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 fi } test "$opt_mode" = execute && func_mode_execute ${1+"$@"} # func_mode_finish arg... func_mode_finish () { $opt_debug 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_silent && 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 "$opt_mode" = finish && func_mode_finish ${1+"$@"} # func_mode_install arg... func_mode_install () { $opt_debug # There may be an optional sh(1) argument at the beginning of # install_prog (especially on Windows NT). if test "$nonopt" = "$SHELL" || test "$nonopt" = /bin/sh || # 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=no 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=yes ;; -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$prev" = x-m && 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=yes if test "$isdir" = yes; 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 "$build_old_libs" = yes; 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=yes 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'` ### testsuite: skip nested quoting test if test -n "$libdir" && test ! -f "$libfile"; then func_warning "\`$lib' has not been installed in \`$libdir'" finalize=no fi done relink_command= func_source "$wrapper" outputname= if test "$fast_install" = no && test -n "$relink_command"; then $opt_dry_run || { if test "$finalize" = yes; 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_silent || { 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 "$opt_mode" = install && 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 () { $opt_debug my_outputname="$1" my_originator="$2" my_pic_p="${3-no}" my_prefix=`$ECHO "$my_originator" | sed 's%[^a-zA-Z0-9]%_%g'` my_dlsyms= if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; 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$TIMESTAMP) $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 con'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 /* External symbol declarations for the compiler. */\ " if test "$dlself" = yes; 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 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[]; LT_DLSYM_CONST lt_dlsymlist lt_${my_prefix}_LTX_preloaded_symbols[] = {\ { \"$my_originator\", (void *) 0 }," 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" ;; *) if test "X$my_pic_p" != Xno; then pic_flag_for_symtable=" $pic_flag" fi ;; 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"' # 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_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 () { $opt_debug 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 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 } }'` 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 () { $opt_debug 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 () { $opt_debug 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 which possess that section. Heuristic: eliminate # all those which 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_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 () { $opt_debug 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 () { $opt_debug 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_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 () { $opt_debug 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 () { $opt_debug f_ex_an_ar_dir="$1"; shift f_ex_an_ar_oldlib="$1" if test "$lock_old_archive_extraction" = yes; 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 "$lock_old_archive_extraction" = yes; 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 () { $opt_debug 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` darwin_base_archive=`basename "$darwin_archive"` 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 in which 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$TIMESTAMP) $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/ which is used only on # windows platforms, and (c) all begin with the string "--lt-" # (application programs are unlikely to have options which 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$TIMESTAMP) $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 "$fast_install" = yes; 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 "$shlibpath_overrides_runpath" = yes && 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 /* 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 platforms) ... */ #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 # ifndef _INTPTR_T_DEFINED # define _INTPTR_T_DEFINED # define intptr_t int # endif #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 ((void *) 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]; int 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 = 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 (strcmp (str, pat) == 0) *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 int 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) { int orig_value_len = strlen (orig_value); int 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 #' */ int len = strlen (new_value); while (((len = strlen (new_value)) > 0) && IS_PATH_SEPARATOR (new_value[len-1])) { new_value[len-1] = '\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 () { $opt_debug case `eval $file_magic_cmd \"\$1\" 2>/dev/null | $SED -e 10q` in *import*) : ;; *) false ;; esac } # func_mode_link arg... func_mode_link () { $opt_debug 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 # which 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 which 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=no 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 "$build_libtool_libs" != yes && \ func_fatal_configuration "can not build a shared library" build_old_libs=no break ;; -all-static | -static | -static-libtool-libs) case $arg in -all-static) if test "$build_libtool_libs" = yes && 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) if test "$preload" = no; then # Add the symbol object into the linking commands. func_append compile_command " @SYMFILE@" func_append finalize_command " @SYMFILE@" preload=yes fi case $arg in *.la | *.lo) ;; # We handle these cases below. force) if test "$dlself" = no; then dlself=needless export_dynamic=yes fi prev= continue ;; self) if test "$prev" = dlprefiles; then dlself=yes elif test "$prev" = dlfiles && test "$dlopen_self" != yes; then dlself=yes else dlself=needless export_dynamic=yes fi prev= continue ;; *) if test "$prev" = dlfiles; 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 ;; 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 "$pic_object" = none && test "$non_pic_object" = none; 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 "$pic_object" != none; then # Prepend the subdirectory the object is found in. pic_object="$xdir$pic_object" if test "$prev" = dlfiles; then if test "$build_libtool_libs" = yes && test "$dlopen_support" = yes; 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 "$prev" = dlprefiles; 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 "$non_pic_object" != none; 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 "$pic_object" = none ; 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 "$prev" = rpath; 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$arg" = "X-export-symbols"; 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$arg" = "X-lc" || test "X$arg" = "X-lm"; 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$arg" = "X-lc" && continue ;; *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*) # Do not include libc due to us having libc/libc_r. test "X$arg" = "X-lc" && 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$arg" = "X-lc" && continue ;; *-*-sysv4.2uw2* | *-*-sysv5* | *-*-unixware* | *-*-OpenUNIX*) # Compiler inserts libc in the correct place for threads to work test "X$arg" = "X-lc" && continue ;; esac elif test "X$arg" = "X-lc_r"; then case $host in *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*) # Do not include libc_r directly, use -pthread flag. continue ;; esac fi func_append deplibs " $arg" 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*, -flto*, -fwhopr*, -fuse-linker-plugin GCC link-time optimization -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*|-flto*|-fwhopr*|-fuse-linker-plugin) 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 "$pic_object" = none && test "$non_pic_object" = none; 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 "$pic_object" != none; then # Prepend the subdirectory the object is found in. pic_object="$xdir$pic_object" if test "$prev" = dlfiles; then if test "$build_libtool_libs" = yes && test "$dlopen_support" = yes; 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 "$prev" = dlprefiles; 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 "$non_pic_object" != none; 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 "$pic_object" = none ; 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 "$prev" = dlfiles; then # This library was specified with -dlopen. func_append dlfiles " $func_resolve_sysroot_result" prev= elif test "$prev" = dlprefiles; 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 "$export_dynamic" = yes && 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 "$linkmode" = lib; 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=no 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 "$linkmode,$pass" = "lib,link"; 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 "$linkmode,$pass" = "lib,link" || test "$linkmode,$pass" = "prog,scan"; then libs="$deplibs" deplibs= fi if test "$linkmode" = prog; then case $pass in dlopen) libs="$dlfiles" ;; dlpreopen) libs="$dlprefiles" ;; link) libs="$deplibs %DEPLIBS%" test "X$link_all_deplibs" != Xno && libs="$libs $dependency_libs" ;; esac fi if test "$linkmode,$pass" = "lib,dlpreopen"; 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 "$pass" = dlopen; then # Collect dlpreopened libraries save_deplibs="$deplibs" deplibs= fi for deplib in $libs; do lib= found=no case $deplib in -mt|-mthreads|-kthread|-Kthread|-pthread|-pthreads|--thread-safe \ |-threads|-fopenmp|-openmp|-mp|-xopenmp|-omp|-qsmp=*) if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else func_append compiler_flags " $deplib" if test "$linkmode" = lib ; then case "$new_inherited_linker_flags " in *" $deplib "*) ;; * ) func_append new_inherited_linker_flags " $deplib" ;; esac fi fi continue ;; -l*) if test "$linkmode" != lib && test "$linkmode" != prog; then func_warning "\`-l' is ignored for archives/objects" continue fi func_stripname '-l' '' "$deplib" name=$func_stripname_result if test "$linkmode" = lib; 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 "$search_ext" = ".la"; then found=yes else found=no fi break 2 fi done done if test "$found" != yes; then # deplib doesn't seem to be a libtool library if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" test "$linkmode" = lib && newdependency_libs="$deplib $newdependency_libs" fi continue else # 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 "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; 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=no func_dirname "$lib" "" "." ladir="$func_dirname_result" lib=$ladir/$old_library if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" test "$linkmode" = lib && newdependency_libs="$deplib $newdependency_libs" fi continue fi fi ;; *) ;; esac fi fi ;; # -l *.ltframework) if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" if test "$linkmode" = lib ; 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 "$pass" = conv && 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 "$pass" = conv; then deplibs="$deplib $deplibs" continue fi if test "$pass" = scan; 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 "$pass" = link; 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 "$pass" = conv; 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=no 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=yes fi ;; pass_all) valid_a_lib=yes ;; esac if test "$valid_a_lib" != yes; then 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." else echo $ECHO "*** Warning: Linking the shared library $output against the" $ECHO "*** static library $deplib is not portable!" deplibs="$deplib $deplibs" fi ;; esac continue ;; prog) if test "$pass" != link; then deplibs="$deplib $deplibs" else compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" fi continue ;; esac # linkmode ;; # *.$libext *.lo | *.$objext) if test "$pass" = conv; then deplibs="$deplib $deplibs" elif test "$linkmode" = prog; then if test "$pass" = dlpreopen || test "$dlopen_support" != yes || test "$build_libtool_libs" = no; 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=yes continue ;; esac # case $deplib if test "$found" = yes || test -f "$lib"; then : else func_fatal_error "cannot find the library \`$lib' or unhandled argument \`$deplib'" fi # 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 "$linkmode,$pass" = "lib,link" || test "$linkmode,$pass" = "prog,scan" || { test "$linkmode" != prog && test "$linkmode" != lib; }; then test -n "$dlopen" && func_append dlfiles " $dlopen" test -n "$dlpreopen" && func_append dlprefiles " $dlpreopen" fi if test "$pass" = conv; 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" 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 elif test "$linkmode" != prog && test "$linkmode" != lib; then func_fatal_error "\`$lib' is not a convenience library" fi continue fi # $pass = conv # Get the name of the library we link against. linklib= if test -n "$old_library" && { test "$prefer_static_libs" = yes || test "$prefer_static_libs,$installed" = "built,no"; }; 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 "$pass" = dlopen; then if test -z "$libdir"; then func_fatal_error "cannot -dlopen a convenience library: \`$lib'" fi if test -z "$dlname" || test "$dlopen_support" != yes || test "$build_libtool_libs" = no; 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 "X$installed" = Xyes; 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 "X$hardcode_automatic" = Xyes && 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 "$pass" = dlpreopen; then if test -z "$libdir" && test "$linkmode" = prog; 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 "$linkmode" = lib; then deplibs="$dir/$old_library $deplibs" elif test "$linkmode,$pass" = "prog,link"; 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 "$linkmode" = prog && test "$pass" != link; then func_append newlib_search_path " $ladir" deplibs="$lib $deplibs" linkalldeplibs=no if test "$link_all_deplibs" != no || test -z "$library_names" || test "$build_libtool_libs" = no; then linkalldeplibs=yes 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 test "$linkalldeplibs" = yes; 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 "$linkmode,$pass" = "prog,link"; then if test -n "$library_names" && { { test "$prefer_static_libs" = no || test "$prefer_static_libs,$installed" = "built,yes"; } || 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 test "$alldeplibs" = yes && { test "$deplibs_check_method" = pass_all || { test "$build_libtool_libs" = yes && 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 "$use_static_libs" = built && test "$installed" = yes; then use_static_libs=no fi if test -n "$library_names" && { test "$use_static_libs" = no || 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 "$installed" = no; 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 "$shouldnotlink" = yes && test "$pass" = link; then echo if test "$linkmode" = prog; 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 "$linkmode" = lib && test "$hardcode_into_libs" = yes; 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 "$linkmode" = prog || test "$opt_mode" != relink; then add_shlibpath= add_dir= add= lib_linked=yes case $hardcode_action in immediate | unsupported) if test "$hardcode_direct" = no; 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 can not # 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 "$hardcode_minus_L" = no; then case $host in *-*-sunos*) add_shlibpath="$dir" ;; esac add_dir="-L$dir" add="-l$name" elif test "$hardcode_shlibpath_var" = no; then add_shlibpath="$dir" add="-l$name" else lib_linked=no fi ;; relink) if test "$hardcode_direct" = yes && test "$hardcode_direct_absolute" = no; then add="$dir/$linklib" elif test "$hardcode_minus_L" = yes; 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 "$hardcode_shlibpath_var" = yes; then add_shlibpath="$dir" add="-l$name" else lib_linked=no fi ;; *) lib_linked=no ;; esac if test "$lib_linked" != yes; 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 "$linkmode" = prog; 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 "$hardcode_direct" != yes && test "$hardcode_minus_L" != yes && test "$hardcode_shlibpath_var" = yes; then case :$finalize_shlibpath: in *":$libdir:"*) ;; *) func_append finalize_shlibpath "$libdir:" ;; esac fi fi fi if test "$linkmode" = prog || test "$opt_mode" = relink; then add_shlibpath= add_dir= add= # Finalize command for both is simple: just hardcode it. if test "$hardcode_direct" = yes && test "$hardcode_direct_absolute" = no; then add="$libdir/$linklib" elif test "$hardcode_minus_L" = yes; then add_dir="-L$libdir" add="-l$name" elif test "$hardcode_shlibpath_var" = yes; then case :$finalize_shlibpath: in *":$libdir:"*) ;; *) func_append finalize_shlibpath "$libdir:" ;; esac add="-l$name" elif test "$hardcode_automatic" = yes; 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 "$linkmode" = prog; 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 "$linkmode" = prog; 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 "$hardcode_direct" != unsupported; 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 "$build_libtool_libs" = yes; then # Not a shared library if test "$deplibs_check_method" != pass_all; 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 can not 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 "$module" = yes; 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 "$build_old_libs" = no; 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 "$linkmode" = lib; then if test -n "$dependency_libs" && { test "$hardcode_into_libs" != yes || test "$build_old_libs" = yes || test "$link_static" = yes; }; 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 "$link_static" = no && 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 "$link_all_deplibs" != no; 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 "$pass" = link; then if test "$linkmode" = "prog"; 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 "$pass" = dlpreopen; then # Link the dlpreopened libraries before other libraries for deplib in $save_deplibs; do deplibs="$deplib $deplibs" done fi if test "$pass" != dlopen; then if test "$pass" != conv; then # 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= fi if test "$linkmode,$pass" != "prog,link"; then vars="deplibs" else vars="compile_deplibs finalize_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 "$linkmode" = prog; then dlfiles="$newdlfiles" fi if test "$linkmode" = prog || test "$linkmode" = lib; then dlprefiles="$newdlprefiles" fi case $linkmode in oldlib) if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; 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 "$module" = no && \ func_fatal_help "libtool library \`$output' must begin with \`lib'" if test "$need_lib_prefix" != no; 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 "$deplibs_check_method" != pass_all; 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 "$dlself" != no && \ func_warning "\`-dlopen self' is ignored for libtool libraries" set dummy $rpath shift test "$#" -gt 1 && \ func_warning "ignoring multiple \`-rpath's for a libtool library" install_libdir="$1" oldlibs= if test -z "$rpath"; then if test "$build_libtool_libs" = yes; 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 # which 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 ;; *) func_fatal_configuration "$modename: unknown library version type \`$version_type'" ;; 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" ;; freebsd-aout) major=".$current" versuffix=".$current.$revision"; ;; freebsd-elf) major=".$current" versuffix=".$current" ;; irix | nonstopux) if test "X$lt_irix_increment" = "Xno"; 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 "$loop" -ne 0; 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 "$loop" -ne 0; 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 filesystems. 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 "$need_version" = no; then versuffix= else versuffix=".0.0" fi fi # Remove version info from name if versioning should be avoided if test "$avoid_version" = yes && test "$need_version" = no; then major= versuffix= verstring="" fi # Check to see if the archive will have undefined symbols. if test "$allow_undefined" = yes; then if test "$allow_undefined_flag" = unsupported; then func_warning "undefined symbols not allowed in $host shared libraries" build_libtool_libs=no build_old_libs=yes fi else # Don't allow undefined symbols. allow_undefined_flag="$no_undefined_flag" fi fi func_generate_dlsyms "$libname" "$libname" "yes" func_append libobjs " $symfileobj" test "X$libobjs" = "X " && libobjs= if test "$opt_mode" != relink; 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 "X$precious_files_regex" != "X"; 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 "$build_old_libs" = yes && test "$build_libtool_libs" != convenience ; 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 "$hardcode_into_libs" != yes || test "$build_old_libs" = yes; 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 "$build_libtool_libs" = yes; 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 "$build_libtool_need_lc" = "yes"; 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 "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; 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 "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; 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 "X$deplibs_check_method" = "Xnone"; 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 "$droppeddeps" = yes; then if test "$module" = yes; 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 "$build_old_libs" = no; 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 "$allow_undefined" = no; 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 "$build_old_libs" = no; 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 "$build_libtool_libs" = yes; then # Remove ${wl} instances when linking with ld. # FIXME: should test the right _cmds variable. case $archive_cmds in *\$LD\ *) wl= ;; esac if test "$hardcode_into_libs" = yes; then # Hardcode the library paths hardcode_libdirs= dep_rpath= rpath="$finalize_rpath" test "$opt_mode" != relink && 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 "$opt_mode" != relink && 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 if test "x`$SED 1q $export_symbols`" != xEXPORTS; then # 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 fi ;; esac # Prepare the list of exported symbols if test -z "$export_symbols"; then if test "$always_export_symbols" = yes || 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 "$try_normal_branch" = yes \ && { 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 "X$skipped_export" != "X:"; 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 "X$skipped_export" != "X:" && 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 "$compiler_needs_object" = yes && 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 "$thread_safe" = yes && 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 "$opt_mode" = relink; 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 "$module" = yes && 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 "X$skipped_export" != "X:" && 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 "X$skipped_export" != "X:" && test "$with_gnu_ld" = yes; 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 "X$skipped_export" != "X:" && test "X$file_list_spec" != X; then output=${output_objdir}/${output_la}.lnk func_verbose "creating linker input file list: $output" : > $output set x $save_libobjs shift firstobj= if test "$compiler_needs_object" = yes; 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 "X$objlist" = X || 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 "$k" -eq 1 ; 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 if ${skipped_export-false}; then 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 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_silent || { 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 "$opt_mode" = relink; 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 if ${skipped_export-false}; then 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 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 "$module" = yes && 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="$save_ifs" eval cmd=\"$cmd\" $opt_silent || { 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 "$opt_mode" = relink; 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 "$opt_mode" = relink; 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 "$module" = yes || test "$export_dynamic" = yes; then # On all known operating systems, these are identical. dlname="$soname" fi fi ;; obj) if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; 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 "$build_libtool_libs" != yes && 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" ### testsuite: skip nested quoting test 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 if test "$build_libtool_libs" != yes; then 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 fi if test -n "$pic_flag" || test "$pic_mode" != default; 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" test "$preload" = yes \ && test "$dlopen_support" = unknown \ && test "$dlopen_self" = unknown \ && test "$dlopen_self_static" = unknown && \ 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 "$tagname" = CXX ; 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 "$build_old_libs" = yes; 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@" "no" # template prelinking step if test -n "$prelink_cmds"; then func_execute_cmds "$prelink_cmds" 'exit $?' fi wrappers_required=yes case $host in *cegcc* | *mingw32ce*) # Disable wrappers for cegcc and mingw32ce hosts, we are cross compiling anyway. wrappers_required=no ;; *cygwin* | *mingw* ) if test "$build_libtool_libs" != yes; then wrappers_required=no fi ;; *) if test "$need_relink" = no || test "$build_libtool_libs" != yes; then wrappers_required=no fi ;; esac if test "$wrappers_required" = no; then # 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 fi 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 "$no_install" = yes; 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 if test "$hardcode_action" = relink; then # 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" else if test "$fast_install" != no; then link_command="$finalize_var$compile_command$finalize_rpath" if test "$fast_install" = yes; then relink_command=`$ECHO "$compile_var$compile_command$compile_rpath" | $SED 's%@OUTPUT@%\$progdir/\$file%g'` else # fast_install is set to needless relink_command= fi else link_command="$compile_var$compile_command$compile_rpath" relink_command="$finalize_var$finalize_command$finalize_rpath" fi fi # 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 if test "$build_libtool_libs" = convenience; then oldobjs="$libobjs_save $symfileobj" addlibs="$convenience" build_libtool_libs=no else if test "$build_libtool_libs" = module; then oldobjs="$libobjs_save" build_libtool_libs=no else oldobjs="$old_deplibs $non_pic_objects" if test "$preload" = yes && test -f "$symfileobj"; then func_append oldobjs " $symfileobj" fi fi addlibs="$old_convenience" fi 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 "$build_libtool_libs" = yes; 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 "X$oldobjs" = "X" ; 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 "$build_old_libs" = yes && 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 "$hardcode_automatic" = yes ; then relink_command= fi # Only create the output if not a dry run. $opt_dry_run || { for installed in no yes; do if test "$installed" = yes; 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 "x$bindir" != x ; 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$TIMESTAMP) $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 can not 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 "$installed" = no && test "$need_relink" = yes; 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 } { test "$opt_mode" = link || test "$opt_mode" = relink; } && func_mode_link ${1+"$@"} # func_mode_uninstall arg... func_mode_uninstall () { $opt_debug RM="$nonopt" files= rmforce= 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=yes ;; -*) 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 "X$dir" = X.; then odir="$objdir" else odir="$dir/$objdir" fi func_basename "$file" name="$func_basename_result" test "$opt_mode" = uninstall && odir="$dir" # Remember odir for removal later, being careful to avoid duplicates if test "$opt_mode" = clean; 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 test "$rmforce" = yes; 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" 'test "$rmforce" = yes || exit_status=1' fi if test -n "$old_library"; then # Do each command in the old_postuninstall commands. func_execute_cmds "$old_postuninstall_cmds" 'test "$rmforce" = yes || 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 "$pic_object" != none; 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 "$non_pic_object" != none; then func_append rmfiles " $dir/$non_pic_object" fi fi ;; *) if test "$opt_mode" = clean ; 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 "$fast_install" = yes && 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 } { test "$opt_mode" = uninstall || test "$opt_mode" = clean; } && func_mode_uninstall ${1+"$@"} 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 # in which 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: # vi:sw=2 cloog-0.18.4/autoconf/test-driver0000755000175000017500000001027712413256727013664 00000000000000#! /bin/sh # test-driver - basic testsuite driver script. scriptversion=2013-07-13.22; # UTC # Copyright (C) 2011-2013 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. # This file is maintained in Automake, please report # bugs to or send patches to # . # Make unconditional expansion of undefined variables an error. This # helps a lot in preventing typo-related bugs. set -u usage_error () { echo "$0: $*" >&2 print_usage >&2 exit 2 } print_usage () { cat <$log_file 2>&1 estatus=$? if test $enable_hard_errors = no && test $estatus -eq 99; then estatus=1 fi case $estatus:$expect_failure in 0:yes) col=$red res=XPASS recheck=yes gcopy=yes;; 0:*) col=$grn res=PASS recheck=no gcopy=no;; 77:*) col=$blu res=SKIP recheck=no gcopy=yes;; 99:*) col=$mgn res=ERROR recheck=yes gcopy=yes;; *:yes) col=$lgn res=XFAIL recheck=no gcopy=yes;; *:*) col=$red res=FAIL recheck=yes gcopy=yes;; esac # Report outcome to console. echo "${col}${res}${std}: $test_name" # Register the test result, and other relevant metadata. echo ":test-result: $res" > $trs_file echo ":global-test-result: $res" >> $trs_file echo ":recheck: $recheck" >> $trs_file echo ":copy-in-global-log: $gcopy" >> $trs_file # 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.4/autoconf/install-sh0000755000175000017500000003325512413256727013473 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.4/autoconf/missing0000755000175000017500000001533012413256727013060 00000000000000#! /bin/sh # Common wrapper for a few potentially missing GNU programs. scriptversion=2013-10-28.13; # UTC # Copyright (C) 1996-2013 Free Software Foundation, Inc. # Originally written 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 case $1 in --is-lightweight) # Used by our autoconf macros to check whether the available missing # script is modern enough. exit 0 ;; --run) # Back-compat with the calling convention used by older automake. shift ;; -h|--h|--he|--hel|--help) echo "\ $0 [OPTION]... PROGRAM [ARGUMENT]... Run 'PROGRAM [ARGUMENT]...', returning a proper advice when this fails due to PROGRAM being missing or too old. Options: -h, --help display this help and exit -v, --version output version information and exit Supported PROGRAM values: aclocal autoconf autoheader autom4te automake makeinfo bison yacc flex lex help2man 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 # Run the given program, remember its exit status. "$@"; st=$? # If it succeeded, we are done. test $st -eq 0 && exit 0 # Also exit now if we it failed (or wasn't found), and '--version' was # passed; such an option is passed most likely to detect whether the # program is present and works. case $2 in --version|--help) exit $st;; esac # Exit code 63 means version mismatch. This often happens when the user # tries to use an ancient version of a tool on a file that requires a # minimum version. if test $st -eq 63; then msg="probably too old" elif test $st -eq 127; then # Program was missing. msg="missing on your system" else # Program was found and executed, but failed. Give up. exit $st fi perl_URL=http://www.perl.org/ flex_URL=http://flex.sourceforge.net/ gnu_software_URL=http://www.gnu.org/software program_details () { case $1 in aclocal|automake) echo "The '$1' program is part of the GNU Automake package:" echo "<$gnu_software_URL/automake>" echo "It also requires GNU Autoconf, GNU m4 and Perl in order to run:" echo "<$gnu_software_URL/autoconf>" echo "<$gnu_software_URL/m4/>" echo "<$perl_URL>" ;; autoconf|autom4te|autoheader) echo "The '$1' program is part of the GNU Autoconf package:" echo "<$gnu_software_URL/autoconf/>" echo "It also requires GNU m4 and Perl in order to run:" echo "<$gnu_software_URL/m4/>" echo "<$perl_URL>" ;; esac } give_advice () { # Normalize program name to check for. normalized_program=`echo "$1" | sed ' s/^gnu-//; t s/^gnu//; t s/^g//; t'` printf '%s\n' "'$1' is $msg." configure_deps="'configure.ac' or m4 files included by 'configure.ac'" case $normalized_program in autoconf*) echo "You should only need it if you modified 'configure.ac'," echo "or m4 files included by it." program_details 'autoconf' ;; autoheader*) echo "You should only need it if you modified 'acconfig.h' or" echo "$configure_deps." program_details 'autoheader' ;; automake*) echo "You should only need it if you modified 'Makefile.am' or" echo "$configure_deps." program_details 'automake' ;; aclocal*) echo "You should only need it if you modified 'acinclude.m4' or" echo "$configure_deps." program_details 'aclocal' ;; autom4te*) echo "You might have modified some maintainer files that require" echo "the 'autom4te' program to be rebuilt." program_details 'autom4te' ;; bison*|yacc*) echo "You should only need it if you modified a '.y' file." echo "You may want to install the GNU Bison package:" echo "<$gnu_software_URL/bison/>" ;; lex*|flex*) echo "You should only need it if you modified a '.l' file." echo "You may want to install the Fast Lexical Analyzer package:" echo "<$flex_URL>" ;; help2man*) echo "You should only need it if you modified a dependency" \ "of a man page." echo "You may want to install the GNU Help2man package:" echo "<$gnu_software_URL/help2man/>" ;; makeinfo*) echo "You should only need it if you modified a '.texi' file, or" echo "any other file indirectly affecting the aspect of the manual." echo "You might want to install the Texinfo package:" echo "<$gnu_software_URL/texinfo/>" echo "The spurious makeinfo call might also be the consequence of" echo "using a buggy 'make' (AIX, DU, IRIX), in which case you might" echo "want to install GNU make:" echo "<$gnu_software_URL/make/>" ;; *) echo "You might have modified some files without having the proper" echo "tools for further handling them. Check the 'README' file, it" echo "often tells you about the needed prerequisites for installing" echo "this package. You may also peek at any GNU archive site, in" echo "case some other package contains this missing '$1' program." ;; esac } give_advice "$1" | sed -e '1s/^/WARNING: /' \ -e '2,$s/^/ /' >&2 # Propagate the correct exit status (expected to be 127 for a program # not found, 63 for a program that failed due to version mismatch). exit $st # 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.4/autoconf/Doxyfile.in0000644000175000017500000012747312413255517013604 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.4/autoconf/depcomp0000755000175000017500000005601612413256727013044 00000000000000#! /bin/sh # depcomp - compile a program generating dependencies as side-effects scriptversion=2013-05-30.07; # UTC # Copyright (C) 1999-2013 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 # Get the directory component of the given path, and save it in the # global variables '$dir'. Note that this directory component will # be either empty or ending with a '/' character. This is deliberate. set_dir_from () { case $1 in */*) dir=`echo "$1" | sed -e 's|/[^/]*$|/|'`;; *) dir=;; esac } # Get the suffix-stripped basename of the given path, and save it the # global variable '$base'. set_base_from () { base=`echo "$1" | sed -e 's|^.*/||' -e 's/\.[^.]*$//'` } # If no dependency file was actually created by the compiler invocation, # we still have to create a dummy depfile, to avoid errors with the # Makefile "include basename.Plo" scheme. make_dummy_depfile () { echo "#dummy" > "$depfile" } # Factor out some common post-processing of the generated depfile. # Requires the auxiliary global variable '$tmpdepfile' to be set. aix_post_process_depfile () { # If the compiler actually managed to produce a dependency file, # post-process it. if test -f "$tmpdepfile"; then # Each line is of the form 'foo.o: dependency.h'. # Do two passes, one to just change these to # $object: dependency.h # and one to simply output # dependency.h: # which is needed to avoid the deleted-header problem. { sed -e "s,^.*\.[$lower]*:,$object:," < "$tmpdepfile" sed -e "s,^.*\.[$lower]*:[$tab ]*,," -e 's,$,:,' < "$tmpdepfile" } > "$depfile" rm -f "$tmpdepfile" else make_dummy_depfile fi } # A tabulation character. tab=' ' # A newline character. nl=' ' # Character ranges might be problematic outside the C locale. # These definitions help. upper=ABCDEFGHIJKLMNOPQRSTUVWXYZ lower=abcdefghijklmnopqrstuvwxyz digits=0123456789 alpha=${upper}${lower} 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" # Avoid interferences from the environment. gccflag= dashmflag= # 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 if test "$depmode" = xlc; then # IBM C/C++ Compilers xlc/xlC can output gcc-like dependency information. gccflag=-qmakedep=gcc,-MF depmode=gcc 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 -ne 0; then rm -f "$tmpdepfile" exit $stat fi mv "$tmpdepfile" "$depfile" ;; gcc) ## Note that this doesn't just cater to obsosete pre-3.x GCC compilers. ## but also to in-use compilers like IMB xlc/xlC and the HP C compiler. ## (see the conditional assignment to $gccflag above). ## 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). Also, it might not be ## supported by the other compilers which use the 'gcc' depmode. ## - 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 -ne 0; then rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" echo "$object : \\" > "$depfile" # 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. ## 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. tr ' ' "$nl" < "$tmpdepfile" \ | 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 -ne 0; then 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 ' ' "$nl" < "$tmpdepfile" \ | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' \ | tr "$nl" ' ' >> "$depfile" echo >> "$depfile" # The second pass generates a dummy entry for each header file. tr ' ' "$nl" < "$tmpdepfile" \ | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' -e 's/$/:/' \ >> "$depfile" else make_dummy_depfile fi rm -f "$tmpdepfile" ;; xlc) # 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 ;; 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. set_dir_from "$object" set_base_from "$object" 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 -ne 0; then rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" do test -f "$tmpdepfile" && break done aix_post_process_depfile ;; tcc) # tcc (Tiny C Compiler) understand '-MD -MF file' since version 0.9.26 # FIXME: That version still under development at the moment of writing. # Make that this statement remains true also for stable, released # versions. # It will wrap lines (doesn't matter whether long or short) with a # trailing '\', as in: # # foo.o : \ # foo.c \ # foo.h \ # # It will put a trailing '\' even on the last line, and will use leading # spaces rather than leading tabs (at least since its commit 0394caf7 # "Emit spaces for -MD"). "$@" -MD -MF "$tmpdepfile" stat=$? if test $stat -ne 0; then rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" # Each non-empty line is of the form 'foo.o : \' or ' dep.h \'. # We have to change lines of the first kind to '$object: \'. sed -e "s|.*:|$object :|" < "$tmpdepfile" > "$depfile" # And for each line of the second kind, we have to emit a 'dep.h:' # dummy dependency, to avoid the deleted-header problem. sed -n -e 's|^ *\(.*\) *\\$|\1:|p' < "$tmpdepfile" >> "$depfile" rm -f "$tmpdepfile" ;; ## The order of this option in the case statement is important, since the ## shell code in configure will try each of these formats in the order ## listed in this file. A plain '-MD' option would be understood by many ## compilers, so we must ensure this comes after the gcc and icc options. pgcc) # Portland's C compiler understands '-MD'. # Will always output deps to 'file.d' where file is the root name of the # source file under compilation, even if file resides in a subdirectory. # The object file name does not affect the name of the '.d' file. # pgcc 10.2 will output # foo.o: sub/foo.c sub/foo.h # and will wrap long lines using '\' : # foo.o: sub/foo.c ... \ # sub/foo.h ... \ # ... set_dir_from "$object" # Use the source, not the object, to determine the base name, since # that's sadly what pgcc will do too. set_base_from "$source" tmpdepfile=$base.d # For projects that build the same source file twice into different object # files, the pgcc approach of using the *source* file root name can cause # problems in parallel builds. Use a locking strategy to avoid stomping on # the same $tmpdepfile. lockdir=$base.d-lock trap " echo '$0: caught signal, cleaning up...' >&2 rmdir '$lockdir' exit 1 " 1 2 13 15 numtries=100 i=$numtries while test $i -gt 0; do # mkdir is a portable test-and-set. if mkdir "$lockdir" 2>/dev/null; then # This process acquired the lock. "$@" -MD stat=$? # Release the lock. rmdir "$lockdir" break else # If the lock is being held by a different process, wait # until the winning process is done or we timeout. while test -d "$lockdir" && test $i -gt 0; do sleep 1 i=`expr $i - 1` done fi i=`expr $i - 1` done trap - 1 2 13 15 if test $i -le 0; then echo "$0: failed to acquire lock after $numtries attempts" >&2 echo "$0: check lockdir '$lockdir'" >&2 exit 1 fi if test $stat -ne 0; then 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. set_dir_from "$object" set_base_from "$object" 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 -ne 0; then 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,^.*\.[$lower]*:,$object:," "$tmpdepfile" > "$depfile" # Add 'dependent.h:' lines. sed -ne '2,${ s/^ *// s/ \\*$// s/$/:/ p }' "$tmpdepfile" >> "$depfile" else make_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. set_dir_from "$object" set_base_from "$object" if test "$libtool" = yes; then # Libtool 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$base.o.d # libtool 1.5 tmpdepfile2=$dir.libs/$base.o.d # Likewise. tmpdepfile3=$dir.libs/$base.d # Compaq CCC V6.2-504 "$@" -Wc,-MD else tmpdepfile1=$dir$base.d tmpdepfile2=$dir$base.d tmpdepfile3=$dir$base.d "$@" -MD fi stat=$? if test $stat -ne 0; then rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" do test -f "$tmpdepfile" && break done # Same post-processing that is required for AIX mode. aix_post_process_depfile ;; 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 -ne 0; then 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/\(.*\)/'"$tab"'\1 \\/p s/.\(.*\) \\/\1:/ H $ { s/.*/'"$tab"'/ G p }' >> "$depfile" echo >> "$depfile" # make sure the fragment doesn't end with a backslash 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|^[$tab ]*[^:$tab ][^:][^:]*:[$tab ]*|$object: |" > "$tmpdepfile" rm -f "$depfile" cat < "$tmpdepfile" > "$depfile" # Some versions of the HPUX 10.20 sed can't process this sed invocation # correctly. Breaking it into two sed invocations is a workaround. tr ' ' "$nl" < "$tmpdepfile" \ | 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" # Some versions of the HPUX 10.20 sed can't process the last invocation # correctly. Breaking it into two sed invocations is a workaround. sed '1,2d' "$tmpdepfile" \ | tr ' ' "$nl" \ | 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::'"$tab"'\1 \\:p' >> "$depfile" echo "$tab" >> "$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.4/autoconf/config.guess0000755000175000017500000013036112413256727014003 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.4/autoconf/config.sub0000755000175000017500000010535412413256727013452 00000000000000#! /bin/sh # Configuration validation subroutine script. # Copyright 1992-2013 Free Software Foundation, Inc. timestamp='2013-08-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"). # 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 \ | 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 | 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-* \ | 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.4/ChangeLog0000644000175000017500000000236312554423530011411 00000000000000version: 0.18.3 date: Mon Dec 8 11:06:42 PDT 2014 changes: - Update to isl 0.14 - Support for OpenScop loop extension version: 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.4/osl/0000755000175000017500000000000012555417256010521 500000000000000cloog-0.18.4/osl/autoconf/0000755000175000017500000000000012555417256012337 500000000000000cloog-0.18.4/osl/autoconf/compile0000755000175000017500000001624512413256724013637 00000000000000#! /bin/sh # Wrapper for compilers which do not understand '-c -o'. scriptversion=2012-10-14.11; # UTC # Copyright (C) 1999-2013 Free Software Foundation, Inc. # Written by Tom Tromey . # # 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. # This file is maintained in Automake, please report # bugs to or send patches to # . nl=' ' # We need space, tab and new line, in precisely that order. Quoting is # there to prevent tools from complaining about whitespace usage. IFS=" "" $nl" file_conv= # func_file_conv build_file lazy # Convert a $build file to $host form and store it in $file # Currently only supports Windows hosts. If the determined conversion # type is listed in (the comma separated) LAZY, no conversion will # take place. func_file_conv () { file=$1 case $file in / | /[!/]*) # absolute file, and not a UNC file if test -z "$file_conv"; then # lazily determine how to convert abs files case `uname -s` in MINGW*) file_conv=mingw ;; CYGWIN*) file_conv=cygwin ;; *) file_conv=wine ;; esac fi case $file_conv/,$2, in *,$file_conv,*) ;; mingw/*) file=`cmd //C echo "$file " | sed -e 's/"\(.*\) " *$/\1/'` ;; cygwin/*) file=`cygpath -m "$file" || echo "$file"` ;; wine/*) file=`winepath -w "$file" || echo "$file"` ;; esac ;; esac } # func_cl_dashL linkdir # Make cl look for libraries in LINKDIR func_cl_dashL () { func_file_conv "$1" if test -z "$lib_path"; then lib_path=$file else lib_path="$lib_path;$file" fi linker_opts="$linker_opts -LIBPATH:$file" } # func_cl_dashl library # Do a library search-path lookup for cl func_cl_dashl () { lib=$1 found=no save_IFS=$IFS IFS=';' for dir in $lib_path $LIB do IFS=$save_IFS if $shared && test -f "$dir/$lib.dll.lib"; then found=yes lib=$dir/$lib.dll.lib break fi if test -f "$dir/$lib.lib"; then found=yes lib=$dir/$lib.lib break fi if test -f "$dir/lib$lib.a"; then found=yes lib=$dir/lib$lib.a break fi done IFS=$save_IFS if test "$found" != yes; then lib=$lib.lib fi } # func_cl_wrapper cl arg... # Adjust compile command to suit cl func_cl_wrapper () { # Assume a capable shell lib_path= shared=: linker_opts= for arg do if test -n "$eat"; then eat= else case $1 in -o) # configure might choose to run compile as 'compile cc -o foo foo.c'. eat=1 case $2 in *.o | *.[oO][bB][jJ]) func_file_conv "$2" set x "$@" -Fo"$file" shift ;; *) func_file_conv "$2" set x "$@" -Fe"$file" shift ;; esac ;; -I) eat=1 func_file_conv "$2" mingw set x "$@" -I"$file" shift ;; -I*) func_file_conv "${1#-I}" mingw set x "$@" -I"$file" shift ;; -l) eat=1 func_cl_dashl "$2" set x "$@" "$lib" shift ;; -l*) func_cl_dashl "${1#-l}" set x "$@" "$lib" shift ;; -L) eat=1 func_cl_dashL "$2" ;; -L*) func_cl_dashL "${1#-L}" ;; -static) shared=false ;; -Wl,*) arg=${1#-Wl,} save_ifs="$IFS"; IFS=',' for flag in $arg; do IFS="$save_ifs" linker_opts="$linker_opts $flag" done IFS="$save_ifs" ;; -Xlinker) eat=1 linker_opts="$linker_opts $2" ;; -*) set x "$@" "$1" shift ;; *.cc | *.CC | *.cxx | *.CXX | *.[cC]++) func_file_conv "$1" set x "$@" -Tp"$file" shift ;; *.c | *.cpp | *.CPP | *.lib | *.LIB | *.Lib | *.OBJ | *.obj | *.[oO]) func_file_conv "$1" mingw set x "$@" "$file" shift ;; *) set x "$@" "$1" shift ;; esac fi shift done if test -n "$linker_opts"; then linker_opts="-link$linker_opts" fi exec "$@" $linker_opts exit 1 } eat= case $1 in '') echo "$0: No command. Try '$0 --help' for more information." 1>&2 exit 1; ;; -h | --h*) cat <<\EOF Usage: compile [--help] [--version] PROGRAM [ARGS] Wrapper for compilers which do not understand '-c -o'. Remove '-o dest.o' from ARGS, run PROGRAM with the remaining arguments, and rename the output as expected. If you are trying to build a whole package this is not the right script to run: please start by reading the file 'INSTALL'. Report bugs to . EOF exit $? ;; -v | --v*) echo "compile $scriptversion" exit $? ;; cl | *[/\\]cl | cl.exe | *[/\\]cl.exe ) func_cl_wrapper "$@" # Doesn't return... ;; esac ofile= cfile= for arg do if test -n "$eat"; then eat= else case $1 in -o) # configure might choose to run compile as 'compile cc -o foo foo.c'. # So we strip '-o arg' only if arg is an object. eat=1 case $2 in *.o | *.obj) ofile=$2 ;; *) set x "$@" -o "$2" shift ;; esac ;; *.c) cfile=$1 set x "$@" "$1" shift ;; *) set x "$@" "$1" shift ;; esac fi shift done if test -z "$ofile" || test -z "$cfile"; then # If no '-o' option was seen then we might have been invoked from a # pattern rule where we don't need one. That is ok -- this is a # normal compilation that the losing compiler can handle. If no # '.c' file was seen then we are probably linking. That is also # ok. exec "$@" fi # Name of file we expect compiler to create. cofile=`echo "$cfile" | sed 's|^.*[\\/]||; s|^[a-zA-Z]:||; s/\.c$/.o/'` # Create the lock directory. # Note: use '[/\\:.-]' here to ensure that we don't use the same name # that we are using for the .o file. Also, base the name on the expected # object file name, since that is what matters with a parallel build. lockdir=`echo "$cofile" | sed -e 's|[/\\:.-]|_|g'`.d while true; do if mkdir "$lockdir" >/dev/null 2>&1; then break fi sleep 1 done # FIXME: race condition here if user kills between mkdir and trap. trap "rmdir '$lockdir'; exit 1" 1 2 15 # Run the compile. "$@" ret=$? if test -f "$cofile"; then test "$cofile" = "$ofile" || mv "$cofile" "$ofile" elif test -f "${cofile}bj"; then test "${cofile}bj" = "$ofile" || mv "${cofile}bj" "$ofile" fi rmdir "$lockdir" exit $ret # 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.4/osl/autoconf/texinfo.tex0000644000175000017500000116703612413256724014465 00000000000000% texinfo.tex -- TeX macros to handle Texinfo files. % % Load plain if necessary, i.e., if running under initex. \expandafter\ifx\csname fmtname\endcsname\relax\input plain\fi % \def\texinfoversion{2013-02-01.11} % % Copyright 1985, 1986, 1988, 1990, 1991, 1992, 1993, 1994, 1995, % 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, % 2007, 2008, 2009, 2010, 2011, 2012, 2013 Free Software Foundation, Inc. % % This texinfo.tex 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 texinfo.tex file 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, when this file is read by TeX when processing % a Texinfo source document, you may use the result without % restriction. This Exception is an additional permission under section 7 % of the GNU General Public License, version 3 ("GPLv3"). % % Please try the latest version of texinfo.tex before submitting bug % reports; you can get the latest version from: % http://ftp.gnu.org/gnu/texinfo/ (the Texinfo release area), or % http://ftpmirror.gnu.org/texinfo/ (same, via a mirror), or % http://www.gnu.org/software/texinfo/ (the Texinfo home page) % The texinfo.tex in any given distribution could well be out % of date, so if that's what you're using, please check. % % Send bug reports to bug-texinfo@gnu.org. Please include including a % complete document in each bug report with which we can reproduce the % problem. Patches are, of course, greatly appreciated. % % To process a Texinfo manual with TeX, it's most reliable to use the % texi2dvi shell script that comes with the distribution. For a simple % manual foo.texi, however, you can get away with this: % tex foo.texi % texindex foo.?? % tex foo.texi % tex foo.texi % dvips foo.dvi -o # or whatever; this makes foo.ps. % The extra TeX runs get the cross-reference information correct. % Sometimes one run after texindex suffices, and sometimes you need more % than two; texi2dvi does it as many times as necessary. % % It is possible to adapt texinfo.tex for other languages, to some % extent. You can get the existing language-specific files from the % full Texinfo distribution. % % The GNU Texinfo home page is http://www.gnu.org/software/texinfo. \message{Loading texinfo [version \texinfoversion]:} % If in a .fmt file, print the version number % and turn on active characters that we couldn't do earlier because % they might have appeared in the input file name. \everyjob{\message{[Texinfo version \texinfoversion]}% \catcode`+=\active \catcode`\_=\active} \chardef\other=12 % We never want plain's \outer definition of \+ in Texinfo. % For @tex, we can use \tabalign. \let\+ = \relax % Save some plain tex macros whose names we will redefine. \let\ptexb=\b \let\ptexbullet=\bullet \let\ptexc=\c \let\ptexcomma=\, \let\ptexdot=\. \let\ptexdots=\dots \let\ptexend=\end \let\ptexequiv=\equiv \let\ptexexclam=\! \let\ptexfootnote=\footnote \let\ptexgtr=> \let\ptexhat=^ \let\ptexi=\i \let\ptexindent=\indent \let\ptexinsert=\insert \let\ptexlbrace=\{ \let\ptexless=< \let\ptexnewwrite\newwrite \let\ptexnoindent=\noindent \let\ptexplus=+ \let\ptexraggedright=\raggedright \let\ptexrbrace=\} \let\ptexslash=\/ \let\ptexstar=\* \let\ptext=\t \let\ptextop=\top {\catcode`\'=\active \global\let\ptexquoteright'}% active in plain's math mode % If this character appears in an error message or help string, it % starts a new line in the output. \newlinechar = `^^J % Use TeX 3.0's \inputlineno to get the line number, for better error % messages, but if we're using an old version of TeX, don't do anything. % \ifx\inputlineno\thisisundefined \let\linenumber = \empty % Pre-3.0. \else \def\linenumber{l.\the\inputlineno:\space} \fi % Set up fixed words for English if not already set. \ifx\putwordAppendix\undefined \gdef\putwordAppendix{Appendix}\fi \ifx\putwordChapter\undefined \gdef\putwordChapter{Chapter}\fi \ifx\putworderror\undefined \gdef\putworderror{error}\fi \ifx\putwordfile\undefined \gdef\putwordfile{file}\fi \ifx\putwordin\undefined \gdef\putwordin{in}\fi \ifx\putwordIndexIsEmpty\undefined \gdef\putwordIndexIsEmpty{(Index is empty)}\fi \ifx\putwordIndexNonexistent\undefined \gdef\putwordIndexNonexistent{(Index is nonexistent)}\fi \ifx\putwordInfo\undefined \gdef\putwordInfo{Info}\fi \ifx\putwordInstanceVariableof\undefined \gdef\putwordInstanceVariableof{Instance Variable of}\fi \ifx\putwordMethodon\undefined \gdef\putwordMethodon{Method on}\fi \ifx\putwordNoTitle\undefined \gdef\putwordNoTitle{No Title}\fi \ifx\putwordof\undefined \gdef\putwordof{of}\fi \ifx\putwordon\undefined \gdef\putwordon{on}\fi \ifx\putwordpage\undefined \gdef\putwordpage{page}\fi \ifx\putwordsection\undefined \gdef\putwordsection{section}\fi \ifx\putwordSection\undefined \gdef\putwordSection{Section}\fi \ifx\putwordsee\undefined \gdef\putwordsee{see}\fi \ifx\putwordSee\undefined \gdef\putwordSee{See}\fi \ifx\putwordShortTOC\undefined \gdef\putwordShortTOC{Short Contents}\fi \ifx\putwordTOC\undefined \gdef\putwordTOC{Table of Contents}\fi % \ifx\putwordMJan\undefined \gdef\putwordMJan{January}\fi \ifx\putwordMFeb\undefined \gdef\putwordMFeb{February}\fi \ifx\putwordMMar\undefined \gdef\putwordMMar{March}\fi \ifx\putwordMApr\undefined \gdef\putwordMApr{April}\fi \ifx\putwordMMay\undefined \gdef\putwordMMay{May}\fi \ifx\putwordMJun\undefined \gdef\putwordMJun{June}\fi \ifx\putwordMJul\undefined \gdef\putwordMJul{July}\fi \ifx\putwordMAug\undefined \gdef\putwordMAug{August}\fi \ifx\putwordMSep\undefined \gdef\putwordMSep{September}\fi \ifx\putwordMOct\undefined \gdef\putwordMOct{October}\fi \ifx\putwordMNov\undefined \gdef\putwordMNov{November}\fi \ifx\putwordMDec\undefined \gdef\putwordMDec{December}\fi % \ifx\putwordDefmac\undefined \gdef\putwordDefmac{Macro}\fi \ifx\putwordDefspec\undefined \gdef\putwordDefspec{Special Form}\fi \ifx\putwordDefvar\undefined \gdef\putwordDefvar{Variable}\fi \ifx\putwordDefopt\undefined \gdef\putwordDefopt{User Option}\fi \ifx\putwordDeffunc\undefined \gdef\putwordDeffunc{Function}\fi % Since the category of space is not known, we have to be careful. \chardef\spacecat = 10 \def\spaceisspace{\catcode`\ =\spacecat} % sometimes characters are active, so we need control sequences. \chardef\ampChar = `\& \chardef\colonChar = `\: \chardef\commaChar = `\, \chardef\dashChar = `\- \chardef\dotChar = `\. \chardef\exclamChar= `\! \chardef\hashChar = `\# \chardef\lquoteChar= `\` \chardef\questChar = `\? \chardef\rquoteChar= `\' \chardef\semiChar = `\; \chardef\slashChar = `\/ \chardef\underChar = `\_ % Ignore a token. % \def\gobble#1{} % The following is used inside several \edef's. \def\makecsname#1{\expandafter\noexpand\csname#1\endcsname} % Hyphenation fixes. \hyphenation{ Flor-i-da Ghost-script Ghost-view Mac-OS Post-Script ap-pen-dix bit-map bit-maps data-base data-bases eshell fall-ing half-way long-est man-u-script man-u-scripts mini-buf-fer mini-buf-fers over-view par-a-digm par-a-digms rath-er rec-tan-gu-lar ro-bot-ics se-vere-ly set-up spa-ces spell-ing spell-ings stand-alone strong-est time-stamp time-stamps which-ever white-space wide-spread wrap-around } % Margin to add to right of even pages, to left of odd pages. \newdimen\bindingoffset \newdimen\normaloffset \newdimen\pagewidth \newdimen\pageheight % For a final copy, take out the rectangles % that mark overfull boxes (in case you have decided % that the text looks ok even though it passes the margin). % \def\finalout{\overfullrule=0pt } % Sometimes it is convenient to have everything in the transcript file % and nothing on the terminal. We don't just call \tracingall here, % since that produces some useless output on the terminal. We also make % some effort to order the tracing commands to reduce output in the log % file; cf. trace.sty in LaTeX. % \def\gloggingall{\begingroup \globaldefs = 1 \loggingall \endgroup}% \def\loggingall{% \tracingstats2 \tracingpages1 \tracinglostchars2 % 2 gives us more in etex \tracingparagraphs1 \tracingoutput1 \tracingmacros2 \tracingrestores1 \showboxbreadth\maxdimen \showboxdepth\maxdimen \ifx\eTeXversion\thisisundefined\else % etex gives us more logging \tracingscantokens1 \tracingifs1 \tracinggroups1 \tracingnesting2 \tracingassigns1 \fi \tracingcommands3 % 3 gives us more in etex \errorcontextlines16 }% % @errormsg{MSG}. Do the index-like expansions on MSG, but if things % aren't perfect, it's not the end of the world, being an error message, % after all. % \def\errormsg{\begingroup \indexnofonts \doerrormsg} \def\doerrormsg#1{\errmessage{#1}} % add check for \lastpenalty to plain's definitions. If the last thing % we did was a \nobreak, we don't want to insert more space. % \def\smallbreak{\ifnum\lastpenalty<10000\par\ifdim\lastskip<\smallskipamount \removelastskip\penalty-50\smallskip\fi\fi} \def\medbreak{\ifnum\lastpenalty<10000\par\ifdim\lastskip<\medskipamount \removelastskip\penalty-100\medskip\fi\fi} \def\bigbreak{\ifnum\lastpenalty<10000\par\ifdim\lastskip<\bigskipamount \removelastskip\penalty-200\bigskip\fi\fi} % Do @cropmarks to get crop marks. % \newif\ifcropmarks \let\cropmarks = \cropmarkstrue % % Dimensions to add cropmarks at corners. % Added by P. A. MacKay, 12 Nov. 1986 % \newdimen\outerhsize \newdimen\outervsize % set by the paper size routines \newdimen\cornerlong \cornerlong=1pc \newdimen\cornerthick \cornerthick=.3pt \newdimen\topandbottommargin \topandbottommargin=.75in % Output a mark which sets \thischapter, \thissection and \thiscolor. % We dump everything together because we only have one kind of mark. % This works because we only use \botmark / \topmark, not \firstmark. % % A mark contains a subexpression of the \ifcase ... \fi construct. % \get*marks macros below extract the needed part using \ifcase. % % Another complication is to let the user choose whether \thischapter % (\thissection) refers to the chapter (section) in effect at the top % of a page, or that at the bottom of a page. The solution is % described on page 260 of The TeXbook. It involves outputting two % marks for the sectioning macros, one before the section break, and % one after. I won't pretend I can describe this better than DEK... \def\domark{% \toks0=\expandafter{\lastchapterdefs}% \toks2=\expandafter{\lastsectiondefs}% \toks4=\expandafter{\prevchapterdefs}% \toks6=\expandafter{\prevsectiondefs}% \toks8=\expandafter{\lastcolordefs}% \mark{% \the\toks0 \the\toks2 \noexpand\or \the\toks4 \the\toks6 \noexpand\else \the\toks8 }% } % \topmark doesn't work for the very first chapter (after the title % page or the contents), so we use \firstmark there -- this gets us % the mark with the chapter defs, unless the user sneaks in, e.g., % @setcolor (or @url, or @link, etc.) between @contents and the very % first @chapter. \def\gettopheadingmarks{% \ifcase0\topmark\fi \ifx\thischapter\empty \ifcase0\firstmark\fi \fi } \def\getbottomheadingmarks{\ifcase1\botmark\fi} \def\getcolormarks{\ifcase2\topmark\fi} % Avoid "undefined control sequence" errors. \def\lastchapterdefs{} \def\lastsectiondefs{} \def\prevchapterdefs{} \def\prevsectiondefs{} \def\lastcolordefs{} % Main output routine. \chardef\PAGE = 255 \output = {\onepageout{\pagecontents\PAGE}} \newbox\headlinebox \newbox\footlinebox % \onepageout takes a vbox as an argument. Note that \pagecontents % does insertions, but you have to call it yourself. \def\onepageout#1{% \ifcropmarks \hoffset=0pt \else \hoffset=\normaloffset \fi % \ifodd\pageno \advance\hoffset by \bindingoffset \else \advance\hoffset by -\bindingoffset\fi % % Do this outside of the \shipout so @code etc. will be expanded in % the headline as they should be, not taken literally (outputting ''code). \ifodd\pageno \getoddheadingmarks \else \getevenheadingmarks \fi \setbox\headlinebox = \vbox{\let\hsize=\pagewidth \makeheadline}% \ifodd\pageno \getoddfootingmarks \else \getevenfootingmarks \fi \setbox\footlinebox = \vbox{\let\hsize=\pagewidth \makefootline}% % {% % Have to do this stuff outside the \shipout because we want it to % take effect in \write's, yet the group defined by the \vbox ends % before the \shipout runs. % \indexdummies % don't expand commands in the output. \normalturnoffactive % \ in index entries must not stay \, e.g., if % the page break happens to be in the middle of an example. % We don't want .vr (or whatever) entries like this: % \entry{{\tt \indexbackslash }acronym}{32}{\code {\acronym}} % "\acronym" won't work when it's read back in; % it needs to be % {\code {{\tt \backslashcurfont }acronym} \shipout\vbox{% % Do this early so pdf references go to the beginning of the page. \ifpdfmakepagedest \pdfdest name{\the\pageno} xyz\fi % \ifcropmarks \vbox to \outervsize\bgroup \hsize = \outerhsize \vskip-\topandbottommargin \vtop to0pt{% \line{\ewtop\hfil\ewtop}% \nointerlineskip \line{% \vbox{\moveleft\cornerthick\nstop}% \hfill \vbox{\moveright\cornerthick\nstop}% }% \vss}% \vskip\topandbottommargin \line\bgroup \hfil % center the page within the outer (page) hsize. \ifodd\pageno\hskip\bindingoffset\fi \vbox\bgroup \fi % \unvbox\headlinebox \pagebody{#1}% \ifdim\ht\footlinebox > 0pt % Only leave this space if the footline is nonempty. % (We lessened \vsize for it in \oddfootingyyy.) % The \baselineskip=24pt in plain's \makefootline has no effect. \vskip 24pt \unvbox\footlinebox \fi % \ifcropmarks \egroup % end of \vbox\bgroup \hfil\egroup % end of (centering) \line\bgroup \vskip\topandbottommargin plus1fill minus1fill \boxmaxdepth = \cornerthick \vbox to0pt{\vss \line{% \vbox{\moveleft\cornerthick\nsbot}% \hfill \vbox{\moveright\cornerthick\nsbot}% }% \nointerlineskip \line{\ewbot\hfil\ewbot}% }% \egroup % \vbox from first cropmarks clause \fi }% end of \shipout\vbox }% end of group with \indexdummies \advancepageno \ifnum\outputpenalty>-20000 \else\dosupereject\fi } \newinsert\margin \dimen\margin=\maxdimen \def\pagebody#1{\vbox to\pageheight{\boxmaxdepth=\maxdepth #1}} {\catcode`\@ =11 \gdef\pagecontents#1{\ifvoid\topins\else\unvbox\topins\fi % marginal hacks, juha@viisa.uucp (Juha Takala) \ifvoid\margin\else % marginal info is present \rlap{\kern\hsize\vbox to\z@{\kern1pt\box\margin \vss}}\fi \dimen@=\dp#1\relax \unvbox#1\relax \ifvoid\footins\else\vskip\skip\footins\footnoterule \unvbox\footins\fi \ifr@ggedbottom \kern-\dimen@ \vfil \fi} } % Here are the rules for the cropmarks. Note that they are % offset so that the space between them is truly \outerhsize or \outervsize % (P. A. MacKay, 12 November, 1986) % \def\ewtop{\vrule height\cornerthick depth0pt width\cornerlong} \def\nstop{\vbox {\hrule height\cornerthick depth\cornerlong width\cornerthick}} \def\ewbot{\vrule height0pt depth\cornerthick width\cornerlong} \def\nsbot{\vbox {\hrule height\cornerlong depth\cornerthick width\cornerthick}} % Parse an argument, then pass it to #1. The argument is the rest of % the input line (except we remove a trailing comment). #1 should be a % macro which expects an ordinary undelimited TeX argument. % \def\parsearg{\parseargusing{}} \def\parseargusing#1#2{% \def\argtorun{#2}% \begingroup \obeylines \spaceisspace #1% \parseargline\empty% Insert the \empty token, see \finishparsearg below. } {\obeylines % \gdef\parseargline#1^^M{% \endgroup % End of the group started in \parsearg. \argremovecomment #1\comment\ArgTerm% }% } % First remove any @comment, then any @c comment. \def\argremovecomment#1\comment#2\ArgTerm{\argremovec #1\c\ArgTerm} \def\argremovec#1\c#2\ArgTerm{\argcheckspaces#1\^^M\ArgTerm} % Each occurrence of `\^^M' or `\^^M' is replaced by a single space. % % \argremovec might leave us with trailing space, e.g., % @end itemize @c foo % This space token undergoes the same procedure and is eventually removed % by \finishparsearg. % \def\argcheckspaces#1\^^M{\argcheckspacesX#1\^^M \^^M} \def\argcheckspacesX#1 \^^M{\argcheckspacesY#1\^^M} \def\argcheckspacesY#1\^^M#2\^^M#3\ArgTerm{% \def\temp{#3}% \ifx\temp\empty % Do not use \next, perhaps the caller of \parsearg uses it; reuse \temp: \let\temp\finishparsearg \else \let\temp\argcheckspaces \fi % Put the space token in: \temp#1 #3\ArgTerm } % If a _delimited_ argument is enclosed in braces, they get stripped; so % to get _exactly_ the rest of the line, we had to prevent such situation. % We prepended an \empty token at the very beginning and we expand it now, % just before passing the control to \argtorun. % (Similarly, we have to think about #3 of \argcheckspacesY above: it is % either the null string, or it ends with \^^M---thus there is no danger % that a pair of braces would be stripped. % % But first, we have to remove the trailing space token. % \def\finishparsearg#1 \ArgTerm{\expandafter\argtorun\expandafter{#1}} % \parseargdef\foo{...} % is roughly equivalent to % \def\foo{\parsearg\Xfoo} % \def\Xfoo#1{...} % % Actually, I use \csname\string\foo\endcsname, ie. \\foo, as it is my % favourite TeX trick. --kasal, 16nov03 \def\parseargdef#1{% \expandafter \doparseargdef \csname\string#1\endcsname #1% } \def\doparseargdef#1#2{% \def#2{\parsearg#1}% \def#1##1% } % Several utility definitions with active space: { \obeyspaces \gdef\obeyedspace{ } % Make each space character in the input produce a normal interword % space in the output. Don't allow a line break at this space, as this % is used only in environments like @example, where each line of input % should produce a line of output anyway. % \gdef\sepspaces{\obeyspaces\let =\tie} % If an index command is used in an @example environment, any spaces % therein should become regular spaces in the raw index file, not the % expansion of \tie (\leavevmode \penalty \@M \ ). \gdef\unsepspaces{\let =\space} } \def\flushcr{\ifx\par\lisppar \def\next##1{}\else \let\next=\relax \fi \next} % Define the framework for environments in texinfo.tex. It's used like this: % % \envdef\foo{...} % \def\Efoo{...} % % It's the responsibility of \envdef to insert \begingroup before the % actual body; @end closes the group after calling \Efoo. \envdef also % defines \thisenv, so the current environment is known; @end checks % whether the environment name matches. The \checkenv macro can also be % used to check whether the current environment is the one expected. % % Non-false conditionals (@iftex, @ifset) don't fit into this, so they % are not treated as environments; they don't open a group. (The % implementation of @end takes care not to call \endgroup in this % special case.) % At run-time, environments start with this: \def\startenvironment#1{\begingroup\def\thisenv{#1}} % initialize \let\thisenv\empty % ... but they get defined via ``\envdef\foo{...}'': \long\def\envdef#1#2{\def#1{\startenvironment#1#2}} \def\envparseargdef#1#2{\parseargdef#1{\startenvironment#1#2}} % Check whether we're in the right environment: \def\checkenv#1{% \def\temp{#1}% \ifx\thisenv\temp \else \badenverr \fi } % Environment mismatch, #1 expected: \def\badenverr{% \errhelp = \EMsimple \errmessage{This command can appear only \inenvironment\temp, not \inenvironment\thisenv}% } \def\inenvironment#1{% \ifx#1\empty outside of any environment% \else in environment \expandafter\string#1% \fi } % @end foo executes the definition of \Efoo. % But first, it executes a specialized version of \checkenv % \parseargdef\end{% \if 1\csname iscond.#1\endcsname \else % The general wording of \badenverr may not be ideal. \expandafter\checkenv\csname#1\endcsname \csname E#1\endcsname \endgroup \fi } \newhelp\EMsimple{Press RETURN to continue.} % Be sure we're in horizontal mode when doing a tie, since we make space % equivalent to this in @example-like environments. Otherwise, a space % at the beginning of a line will start with \penalty -- and % since \penalty is valid in vertical mode, we'd end up putting the % penalty on the vertical list instead of in the new paragraph. {\catcode`@ = 11 % Avoid using \@M directly, because that causes trouble % if the definition is written into an index file. \global\let\tiepenalty = \@M \gdef\tie{\leavevmode\penalty\tiepenalty\ } } % @: forces normal size whitespace following. \def\:{\spacefactor=1000 } % @* forces a line break. \def\*{\unskip\hfil\break\hbox{}\ignorespaces} % @/ allows a line break. \let\/=\allowbreak % @. is an end-of-sentence period. \def\.{.\spacefactor=\endofsentencespacefactor\space} % @! is an end-of-sentence bang. \def\!{!\spacefactor=\endofsentencespacefactor\space} % @? is an end-of-sentence query. \def\?{?\spacefactor=\endofsentencespacefactor\space} % @frenchspacing on|off says whether to put extra space after punctuation. % \def\onword{on} \def\offword{off} % \parseargdef\frenchspacing{% \def\temp{#1}% \ifx\temp\onword \plainfrenchspacing \else\ifx\temp\offword \plainnonfrenchspacing \else \errhelp = \EMsimple \errmessage{Unknown @frenchspacing option `\temp', must be on|off}% \fi\fi } % @w prevents a word break. Without the \leavevmode, @w at the % beginning of a paragraph, when TeX is still in vertical mode, would % produce a whole line of output instead of starting the paragraph. \def\w#1{\leavevmode\hbox{#1}} % @group ... @end group forces ... to be all on one page, by enclosing % it in a TeX vbox. We use \vtop instead of \vbox to construct the box % to keep its height that of a normal line. According to the rules for % \topskip (p.114 of the TeXbook), the glue inserted is % max (\topskip - \ht (first item), 0). If that height is large, % therefore, no glue is inserted, and the space between the headline and % the text is small, which looks bad. % % Another complication is that the group might be very large. This can % cause the glue on the previous page to be unduly stretched, because it % does not have much material. In this case, it's better to add an % explicit \vfill so that the extra space is at the bottom. The % threshold for doing this is if the group is more than \vfilllimit % percent of a page (\vfilllimit can be changed inside of @tex). % \newbox\groupbox \def\vfilllimit{0.7} % \envdef\group{% \ifnum\catcode`\^^M=\active \else \errhelp = \groupinvalidhelp \errmessage{@group invalid in context where filling is enabled}% \fi \startsavinginserts % \setbox\groupbox = \vtop\bgroup % Do @comment since we are called inside an environment such as % @example, where each end-of-line in the input causes an % end-of-line in the output. We don't want the end-of-line after % the `@group' to put extra space in the output. Since @group % should appear on a line by itself (according to the Texinfo % manual), we don't worry about eating any user text. \comment } % % The \vtop produces a box with normal height and large depth; thus, TeX puts % \baselineskip glue before it, and (when the next line of text is done) % \lineskip glue after it. Thus, space below is not quite equal to space % above. But it's pretty close. \def\Egroup{% % To get correct interline space between the last line of the group % and the first line afterwards, we have to propagate \prevdepth. \endgraf % Not \par, as it may have been set to \lisppar. \global\dimen1 = \prevdepth \egroup % End the \vtop. % \dimen0 is the vertical size of the group's box. \dimen0 = \ht\groupbox \advance\dimen0 by \dp\groupbox % \dimen2 is how much space is left on the page (more or less). \dimen2 = \pageheight \advance\dimen2 by -\pagetotal % if the group doesn't fit on the current page, and it's a big big % group, force a page break. \ifdim \dimen0 > \dimen2 \ifdim \pagetotal < \vfilllimit\pageheight \page \fi \fi \box\groupbox \prevdepth = \dimen1 \checkinserts } % % TeX puts in an \escapechar (i.e., `@') at the beginning of the help % message, so this ends up printing `@group can only ...'. % \newhelp\groupinvalidhelp{% group can only be used in environments such as @example,^^J% where each line of input produces a line of output.} % @need space-in-mils % forces a page break if there is not space-in-mils remaining. \newdimen\mil \mil=0.001in \parseargdef\need{% % Ensure vertical mode, so we don't make a big box in the middle of a % paragraph. \par % % If the @need value is less than one line space, it's useless. \dimen0 = #1\mil \dimen2 = \ht\strutbox \advance\dimen2 by \dp\strutbox \ifdim\dimen0 > \dimen2 % % Do a \strut just to make the height of this box be normal, so the % normal leading is inserted relative to the preceding line. % And a page break here is fine. \vtop to #1\mil{\strut\vfil}% % % TeX does not even consider page breaks if a penalty added to the % main vertical list is 10000 or more. But in order to see if the % empty box we just added fits on the page, we must make it consider % page breaks. On the other hand, we don't want to actually break the % page after the empty box. So we use a penalty of 9999. % % There is an extremely small chance that TeX will actually break the % page at this \penalty, if there are no other feasible breakpoints in % sight. (If the user is using lots of big @group commands, which % almost-but-not-quite fill up a page, TeX will have a hard time doing % good page breaking, for example.) However, I could not construct an % example where a page broke at this \penalty; if it happens in a real % document, then we can reconsider our strategy. \penalty9999 % % Back up by the size of the box, whether we did a page break or not. \kern -#1\mil % % Do not allow a page break right after this kern. \nobreak \fi } % @br forces paragraph break (and is undocumented). \let\br = \par % @page forces the start of a new page. % \def\page{\par\vfill\supereject} % @exdent text.... % outputs text on separate line in roman font, starting at standard page margin % This records the amount of indent in the innermost environment. % That's how much \exdent should take out. \newskip\exdentamount % This defn is used inside fill environments such as @defun. \parseargdef\exdent{\hfil\break\hbox{\kern -\exdentamount{\rm#1}}\hfil\break} % This defn is used inside nofill environments such as @example. \parseargdef\nofillexdent{{\advance \leftskip by -\exdentamount \leftline{\hskip\leftskip{\rm#1}}}} % @inmargin{WHICH}{TEXT} puts TEXT in the WHICH margin next to the current % paragraph. For more general purposes, use the \margin insertion % class. WHICH is `l' or `r'. Not documented, written for gawk manual. % \newskip\inmarginspacing \inmarginspacing=1cm \def\strutdepth{\dp\strutbox} % \def\doinmargin#1#2{\strut\vadjust{% \nobreak \kern-\strutdepth \vtop to \strutdepth{% \baselineskip=\strutdepth \vss % if you have multiple lines of stuff to put here, you'll need to % make the vbox yourself of the appropriate size. \ifx#1l% \llap{\ignorespaces #2\hskip\inmarginspacing}% \else \rlap{\hskip\hsize \hskip\inmarginspacing \ignorespaces #2}% \fi \null }% }} \def\inleftmargin{\doinmargin l} \def\inrightmargin{\doinmargin r} % % @inmargin{TEXT [, RIGHT-TEXT]} % (if RIGHT-TEXT is given, use TEXT for left page, RIGHT-TEXT for right; % else use TEXT for both). % \def\inmargin#1{\parseinmargin #1,,\finish} \def\parseinmargin#1,#2,#3\finish{% not perfect, but better than nothing. \setbox0 = \hbox{\ignorespaces #2}% \ifdim\wd0 > 0pt \def\lefttext{#1}% have both texts \def\righttext{#2}% \else \def\lefttext{#1}% have only one text \def\righttext{#1}% \fi % \ifodd\pageno \def\temp{\inrightmargin\righttext}% odd page -> outside is right margin \else \def\temp{\inleftmargin\lefttext}% \fi \temp } % @| inserts a changebar to the left of the current line. It should % surround any changed text. This approach does *not* work if the % change spans more than two lines of output. To handle that, we would % have adopt a much more difficult approach (putting marks into the main % vertical list for the beginning and end of each change). This command % is not documented, not supported, and doesn't work. % \def\|{% % \vadjust can only be used in horizontal mode. \leavevmode % % Append this vertical mode material after the current line in the output. \vadjust{% % We want to insert a rule with the height and depth of the current % leading; that is exactly what \strutbox is supposed to record. \vskip-\baselineskip % % \vadjust-items are inserted at the left edge of the type. So % the \llap here moves out into the left-hand margin. \llap{% % % For a thicker or thinner bar, change the `1pt'. \vrule height\baselineskip width1pt % % This is the space between the bar and the text. \hskip 12pt }% }% } % @include FILE -- \input text of FILE. % \def\include{\parseargusing\filenamecatcodes\includezzz} \def\includezzz#1{% \pushthisfilestack \def\thisfile{#1}% {% \makevalueexpandable % we want to expand any @value in FILE. \turnoffactive % and allow special characters in the expansion \indexnofonts % Allow `@@' and other weird things in file names. \wlog{texinfo.tex: doing @include of #1^^J}% \edef\temp{\noexpand\input #1 }% % % This trickery is to read FILE outside of a group, in case it makes % definitions, etc. \expandafter }\temp \popthisfilestack } \def\filenamecatcodes{% \catcode`\\=\other \catcode`~=\other \catcode`^=\other \catcode`_=\other \catcode`|=\other \catcode`<=\other \catcode`>=\other \catcode`+=\other \catcode`-=\other \catcode`\`=\other \catcode`\'=\other } \def\pushthisfilestack{% \expandafter\pushthisfilestackX\popthisfilestack\StackTerm } \def\pushthisfilestackX{% \expandafter\pushthisfilestackY\thisfile\StackTerm } \def\pushthisfilestackY #1\StackTerm #2\StackTerm {% \gdef\popthisfilestack{\gdef\thisfile{#1}\gdef\popthisfilestack{#2}}% } \def\popthisfilestack{\errthisfilestackempty} \def\errthisfilestackempty{\errmessage{Internal error: the stack of filenames is empty.}} % \def\thisfile{} % @center line % outputs that line, centered. % \parseargdef\center{% \ifhmode \let\centersub\centerH \else \let\centersub\centerV \fi \centersub{\hfil \ignorespaces#1\unskip \hfil}% \let\centersub\relax % don't let the definition persist, just in case } \def\centerH#1{{% \hfil\break \advance\hsize by -\leftskip \advance\hsize by -\rightskip \line{#1}% \break }} % \newcount\centerpenalty \def\centerV#1{% % The idea here is the same as in \startdefun, \cartouche, etc.: if % @center is the first thing after a section heading, we need to wipe % out the negative parskip inserted by \sectionheading, but still % prevent a page break here. \centerpenalty = \lastpenalty \ifnum\centerpenalty>10000 \vskip\parskip \fi \ifnum\centerpenalty>9999 \penalty\centerpenalty \fi \line{\kern\leftskip #1\kern\rightskip}% } % @sp n outputs n lines of vertical space % \parseargdef\sp{\vskip #1\baselineskip} % @comment ...line which is ignored... % @c is the same as @comment % @ignore ... @end ignore is another way to write a comment % \def\comment{\begingroup \catcode`\^^M=\other% \catcode`\@=\other \catcode`\{=\other \catcode`\}=\other% \commentxxx} {\catcode`\^^M=\other \gdef\commentxxx#1^^M{\endgroup}} % \let\c=\comment % @paragraphindent NCHARS % We'll use ems for NCHARS, close enough. % NCHARS can also be the word `asis' or `none'. % We cannot feasibly implement @paragraphindent asis, though. % \def\asisword{asis} % no translation, these are keywords \def\noneword{none} % \parseargdef\paragraphindent{% \def\temp{#1}% \ifx\temp\asisword \else \ifx\temp\noneword \defaultparindent = 0pt \else \defaultparindent = #1em \fi \fi \parindent = \defaultparindent } % @exampleindent NCHARS % We'll use ems for NCHARS like @paragraphindent. % It seems @exampleindent asis isn't necessary, but % I preserve it to make it similar to @paragraphindent. \parseargdef\exampleindent{% \def\temp{#1}% \ifx\temp\asisword \else \ifx\temp\noneword \lispnarrowing = 0pt \else \lispnarrowing = #1em \fi \fi } % @firstparagraphindent WORD % If WORD is `none', then suppress indentation of the first paragraph % after a section heading. If WORD is `insert', then do indent at such % paragraphs. % % The paragraph indentation is suppressed or not by calling % \suppressfirstparagraphindent, which the sectioning commands do. % We switch the definition of this back and forth according to WORD. % By default, we suppress indentation. % \def\suppressfirstparagraphindent{\dosuppressfirstparagraphindent} \def\insertword{insert} % \parseargdef\firstparagraphindent{% \def\temp{#1}% \ifx\temp\noneword \let\suppressfirstparagraphindent = \dosuppressfirstparagraphindent \else\ifx\temp\insertword \let\suppressfirstparagraphindent = \relax \else \errhelp = \EMsimple \errmessage{Unknown @firstparagraphindent option `\temp'}% \fi\fi } % Here is how we actually suppress indentation. Redefine \everypar to % \kern backwards by \parindent, and then reset itself to empty. % % We also make \indent itself not actually do anything until the next % paragraph. % \gdef\dosuppressfirstparagraphindent{% \gdef\indent{% \restorefirstparagraphindent \indent }% \gdef\noindent{% \restorefirstparagraphindent \noindent }% \global\everypar = {% \kern -\parindent \restorefirstparagraphindent }% } \gdef\restorefirstparagraphindent{% \global \let \indent = \ptexindent \global \let \noindent = \ptexnoindent \global \everypar = {}% } % @refill is a no-op. \let\refill=\relax % If working on a large document in chapters, it is convenient to % be able to disable indexing, cross-referencing, and contents, for test runs. % This is done with @novalidate (before @setfilename). % \newif\iflinks \linkstrue % by default we want the aux files. \let\novalidate = \linksfalse % @setfilename is done at the beginning of every texinfo file. % So open here the files we need to have open while reading the input. % This makes it possible to make a .fmt file for texinfo. \def\setfilename{% \fixbackslash % Turn off hack to swallow `\input texinfo'. \iflinks \tryauxfile % Open the new aux file. TeX will close it automatically at exit. \immediate\openout\auxfile=\jobname.aux \fi % \openindices needs to do some work in any case. \openindices \let\setfilename=\comment % Ignore extra @setfilename cmds. % % If texinfo.cnf is present on the system, read it. % Useful for site-wide @afourpaper, etc. \openin 1 texinfo.cnf \ifeof 1 \else \input texinfo.cnf \fi \closein 1 % \comment % Ignore the actual filename. } % Called from \setfilename. % \def\openindices{% \newindex{cp}% \newcodeindex{fn}% \newcodeindex{vr}% \newcodeindex{tp}% \newcodeindex{ky}% \newcodeindex{pg}% } % @bye. \outer\def\bye{\pagealignmacro\tracingstats=1\ptexend} \message{pdf,} % adobe `portable' document format \newcount\tempnum \newcount\lnkcount \newtoks\filename \newcount\filenamelength \newcount\pgn \newtoks\toksA \newtoks\toksB \newtoks\toksC \newtoks\toksD \newbox\boxA \newcount\countA \newif\ifpdf \newif\ifpdfmakepagedest % when pdftex is run in dvi mode, \pdfoutput is defined (so \pdfoutput=1 % can be set). So we test for \relax and 0 as well as being undefined. \ifx\pdfoutput\thisisundefined \else \ifx\pdfoutput\relax \else \ifcase\pdfoutput \else \pdftrue \fi \fi \fi % PDF uses PostScript string constants for the names of xref targets, % for display in the outlines, and in other places. Thus, we have to % double any backslashes. Otherwise, a name like "\node" will be % interpreted as a newline (\n), followed by o, d, e. Not good. % % See http://www.ntg.nl/pipermail/ntg-pdftex/2004-July/000654.html and % related messages. The final outcome is that it is up to the TeX user % to double the backslashes and otherwise make the string valid, so % that's what we do. pdftex 1.30.0 (ca.2005) introduced a primitive to % do this reliably, so we use it. % #1 is a control sequence in which to do the replacements, % which we \xdef. \def\txiescapepdf#1{% \ifx\pdfescapestring\thisisundefined % No primitive available; should we give a warning or log? % Many times it won't matter. \else % The expandable \pdfescapestring primitive escapes parentheses, % backslashes, and other special chars. \xdef#1{\pdfescapestring{#1}}% \fi } \newhelp\nopdfimagehelp{Texinfo supports .png, .jpg, .jpeg, and .pdf images with PDF output, and none of those formats could be found. (.eps cannot be supported due to the design of the PDF format; use regular TeX (DVI output) for that.)} \ifpdf % % Color manipulation macros based on pdfcolor.tex, % except using rgb instead of cmyk; the latter is said to render as a % very dark gray on-screen and a very dark halftone in print, instead % of actual black. \def\rgbDarkRed{0.50 0.09 0.12} \def\rgbBlack{0 0 0} % % k sets the color for filling (usual text, etc.); % K sets the color for stroking (thin rules, e.g., normal _'s). \def\pdfsetcolor#1{\pdfliteral{#1 rg #1 RG}} % % Set color, and create a mark which defines \thiscolor accordingly, % so that \makeheadline knows which color to restore. \def\setcolor#1{% \xdef\lastcolordefs{\gdef\noexpand\thiscolor{#1}}% \domark \pdfsetcolor{#1}% } % \def\maincolor{\rgbBlack} \pdfsetcolor{\maincolor} \edef\thiscolor{\maincolor} \def\lastcolordefs{} % \def\makefootline{% \baselineskip24pt \line{\pdfsetcolor{\maincolor}\the\footline}% } % \def\makeheadline{% \vbox to 0pt{% \vskip-22.5pt \line{% \vbox to8.5pt{}% % Extract \thiscolor definition from the marks. \getcolormarks % Typeset the headline with \maincolor, then restore the color. \pdfsetcolor{\maincolor}\the\headline\pdfsetcolor{\thiscolor}% }% \vss }% \nointerlineskip } % % \pdfcatalog{/PageMode /UseOutlines} % % #1 is image name, #2 width (might be empty/whitespace), #3 height (ditto). \def\dopdfimage#1#2#3{% \def\pdfimagewidth{#2}\setbox0 = \hbox{\ignorespaces #2}% \def\pdfimageheight{#3}\setbox2 = \hbox{\ignorespaces #3}% % % pdftex (and the PDF format) support .pdf, .png, .jpg (among % others). Let's try in that order, PDF first since if % someone has a scalable image, presumably better to use that than a % bitmap. \let\pdfimgext=\empty \begingroup \openin 1 #1.pdf \ifeof 1 \openin 1 #1.PDF \ifeof 1 \openin 1 #1.png \ifeof 1 \openin 1 #1.jpg \ifeof 1 \openin 1 #1.jpeg \ifeof 1 \openin 1 #1.JPG \ifeof 1 \errhelp = \nopdfimagehelp \errmessage{Could not find image file #1 for pdf}% \else \gdef\pdfimgext{JPG}% \fi \else \gdef\pdfimgext{jpeg}% \fi \else \gdef\pdfimgext{jpg}% \fi \else \gdef\pdfimgext{png}% \fi \else \gdef\pdfimgext{PDF}% \fi \else \gdef\pdfimgext{pdf}% \fi \closein 1 \endgroup % % without \immediate, ancient pdftex seg faults when the same image is % included twice. (Version 3.14159-pre-1.0-unofficial-20010704.) \ifnum\pdftexversion < 14 \immediate\pdfimage \else \immediate\pdfximage \fi \ifdim \wd0 >0pt width \pdfimagewidth \fi \ifdim \wd2 >0pt height \pdfimageheight \fi \ifnum\pdftexversion<13 #1.\pdfimgext \else {#1.\pdfimgext}% \fi \ifnum\pdftexversion < 14 \else \pdfrefximage \pdflastximage \fi} % \def\pdfmkdest#1{{% % We have to set dummies so commands such as @code, and characters % such as \, aren't expanded when present in a section title. \indexnofonts \turnoffactive \makevalueexpandable \def\pdfdestname{#1}% \txiescapepdf\pdfdestname \safewhatsit{\pdfdest name{\pdfdestname} xyz}% }} % % used to mark target names; must be expandable. \def\pdfmkpgn#1{#1} % % by default, use a color that is dark enough to print on paper as % nearly black, but still distinguishable for online viewing. \def\urlcolor{\rgbDarkRed} \def\linkcolor{\rgbDarkRed} \def\endlink{\setcolor{\maincolor}\pdfendlink} % % Adding outlines to PDF; macros for calculating structure of outlines % come from Petr Olsak \def\expnumber#1{\expandafter\ifx\csname#1\endcsname\relax 0% \else \csname#1\endcsname \fi} \def\advancenumber#1{\tempnum=\expnumber{#1}\relax \advance\tempnum by 1 \expandafter\xdef\csname#1\endcsname{\the\tempnum}} % % #1 is the section text, which is what will be displayed in the % outline by the pdf viewer. #2 is the pdf expression for the number % of subentries (or empty, for subsubsections). #3 is the node text, % which might be empty if this toc entry had no corresponding node. % #4 is the page number % \def\dopdfoutline#1#2#3#4{% % Generate a link to the node text if that exists; else, use the % page number. We could generate a destination for the section % text in the case where a section has no node, but it doesn't % seem worth the trouble, since most documents are normally structured. \edef\pdfoutlinedest{#3}% \ifx\pdfoutlinedest\empty \def\pdfoutlinedest{#4}% \else \txiescapepdf\pdfoutlinedest \fi % % Also escape PDF chars in the display string. \edef\pdfoutlinetext{#1}% \txiescapepdf\pdfoutlinetext % \pdfoutline goto name{\pdfmkpgn{\pdfoutlinedest}}#2{\pdfoutlinetext}% } % \def\pdfmakeoutlines{% \begingroup % Read toc silently, to get counts of subentries for \pdfoutline. \def\partentry##1##2##3##4{}% ignore parts in the outlines \def\numchapentry##1##2##3##4{% \def\thischapnum{##2}% \def\thissecnum{0}% \def\thissubsecnum{0}% }% \def\numsecentry##1##2##3##4{% \advancenumber{chap\thischapnum}% \def\thissecnum{##2}% \def\thissubsecnum{0}% }% \def\numsubsecentry##1##2##3##4{% \advancenumber{sec\thissecnum}% \def\thissubsecnum{##2}% }% \def\numsubsubsecentry##1##2##3##4{% \advancenumber{subsec\thissubsecnum}% }% \def\thischapnum{0}% \def\thissecnum{0}% \def\thissubsecnum{0}% % % use \def rather than \let here because we redefine \chapentry et % al. a second time, below. \def\appentry{\numchapentry}% \def\appsecentry{\numsecentry}% \def\appsubsecentry{\numsubsecentry}% \def\appsubsubsecentry{\numsubsubsecentry}% \def\unnchapentry{\numchapentry}% \def\unnsecentry{\numsecentry}% \def\unnsubsecentry{\numsubsecentry}% \def\unnsubsubsecentry{\numsubsubsecentry}% \readdatafile{toc}% % % Read toc second time, this time actually producing the outlines. % The `-' means take the \expnumber as the absolute number of % subentries, which we calculated on our first read of the .toc above. % % We use the node names as the destinations. \def\numchapentry##1##2##3##4{% \dopdfoutline{##1}{count-\expnumber{chap##2}}{##3}{##4}}% \def\numsecentry##1##2##3##4{% \dopdfoutline{##1}{count-\expnumber{sec##2}}{##3}{##4}}% \def\numsubsecentry##1##2##3##4{% \dopdfoutline{##1}{count-\expnumber{subsec##2}}{##3}{##4}}% \def\numsubsubsecentry##1##2##3##4{% count is always zero \dopdfoutline{##1}{}{##3}{##4}}% % % PDF outlines are displayed using system fonts, instead of % document fonts. Therefore we cannot use special characters, % since the encoding is unknown. For example, the eogonek from % Latin 2 (0xea) gets translated to a | character. Info from % Staszek Wawrykiewicz, 19 Jan 2004 04:09:24 +0100. % % TODO this right, we have to translate 8-bit characters to % their "best" equivalent, based on the @documentencoding. Too % much work for too little return. Just use the ASCII equivalents % we use for the index sort strings. % \indexnofonts \setupdatafile % We can have normal brace characters in the PDF outlines, unlike % Texinfo index files. So set that up. \def\{{\lbracecharliteral}% \def\}{\rbracecharliteral}% \catcode`\\=\active \otherbackslash \input \tocreadfilename \endgroup } {\catcode`[=1 \catcode`]=2 \catcode`{=\other \catcode`}=\other \gdef\lbracecharliteral[{]% \gdef\rbracecharliteral[}]% ] % \def\skipspaces#1{\def\PP{#1}\def\D{|}% \ifx\PP\D\let\nextsp\relax \else\let\nextsp\skipspaces \addtokens{\filename}{\PP}% \advance\filenamelength by 1 \fi \nextsp} \def\getfilename#1{% \filenamelength=0 % If we don't expand the argument now, \skipspaces will get % snagged on things like "@value{foo}". \edef\temp{#1}% \expandafter\skipspaces\temp|\relax } \ifnum\pdftexversion < 14 \let \startlink \pdfannotlink \else \let \startlink \pdfstartlink \fi % make a live url in pdf output. \def\pdfurl#1{% \begingroup % it seems we really need yet another set of dummies; have not % tried to figure out what each command should do in the context % of @url. for now, just make @/ a no-op, that's the only one % people have actually reported a problem with. % \normalturnoffactive \def\@{@}% \let\/=\empty \makevalueexpandable % do we want to go so far as to use \indexnofonts instead of just % special-casing \var here? \def\var##1{##1}% % \leavevmode\setcolor{\urlcolor}% \startlink attr{/Border [0 0 0]}% user{/Subtype /Link /A << /S /URI /URI (#1) >>}% \endgroup} \def\pdfgettoks#1.{\setbox\boxA=\hbox{\toksA={#1.}\toksB={}\maketoks}} \def\addtokens#1#2{\edef\addtoks{\noexpand#1={\the#1#2}}\addtoks} \def\adn#1{\addtokens{\toksC}{#1}\global\countA=1\let\next=\maketoks} \def\poptoks#1#2|ENDTOKS|{\let\first=#1\toksD={#1}\toksA={#2}} \def\maketoks{% \expandafter\poptoks\the\toksA|ENDTOKS|\relax \ifx\first0\adn0 \else\ifx\first1\adn1 \else\ifx\first2\adn2 \else\ifx\first3\adn3 \else\ifx\first4\adn4 \else\ifx\first5\adn5 \else\ifx\first6\adn6 \else\ifx\first7\adn7 \else\ifx\first8\adn8 \else\ifx\first9\adn9 \else \ifnum0=\countA\else\makelink\fi \ifx\first.\let\next=\done\else \let\next=\maketoks \addtokens{\toksB}{\the\toksD} \ifx\first,\addtokens{\toksB}{\space}\fi \fi \fi\fi\fi\fi\fi\fi\fi\fi\fi\fi \next} \def\makelink{\addtokens{\toksB}% {\noexpand\pdflink{\the\toksC}}\toksC={}\global\countA=0} \def\pdflink#1{% \startlink attr{/Border [0 0 0]} goto name{\pdfmkpgn{#1}} \setcolor{\linkcolor}#1\endlink} \def\done{\edef\st{\global\noexpand\toksA={\the\toksB}}\st} \else % non-pdf mode \let\pdfmkdest = \gobble \let\pdfurl = \gobble \let\endlink = \relax \let\setcolor = \gobble \let\pdfsetcolor = \gobble \let\pdfmakeoutlines = \relax \fi % \ifx\pdfoutput \message{fonts,} % Change the current font style to #1, remembering it in \curfontstyle. % For now, we do not accumulate font styles: @b{@i{foo}} prints foo in % italics, not bold italics. % \def\setfontstyle#1{% \def\curfontstyle{#1}% not as a control sequence, because we are \edef'd. \csname ten#1\endcsname % change the current font } % Select #1 fonts with the current style. % \def\selectfonts#1{\csname #1fonts\endcsname \csname\curfontstyle\endcsname} \def\rm{\fam=0 \setfontstyle{rm}} \def\it{\fam=\itfam \setfontstyle{it}} \def\sl{\fam=\slfam \setfontstyle{sl}} \def\bf{\fam=\bffam \setfontstyle{bf}}\def\bfstylename{bf} \def\tt{\fam=\ttfam \setfontstyle{tt}} % Unfortunately, we have to override this for titles and the like, since % in those cases "rm" is bold. Sigh. \def\rmisbold{\rm\def\curfontstyle{bf}} % Texinfo sort of supports the sans serif font style, which plain TeX does not. % So we set up a \sf. \newfam\sffam \def\sf{\fam=\sffam \setfontstyle{sf}} \let\li = \sf % Sometimes we call it \li, not \sf. % We don't need math for this font style. \def\ttsl{\setfontstyle{ttsl}} % Set the baselineskip to #1, and the lineskip and strut size % correspondingly. There is no deep meaning behind these magic numbers % used as factors; they just match (closely enough) what Knuth defined. % \def\lineskipfactor{.08333} \def\strutheightpercent{.70833} \def\strutdepthpercent {.29167} % % can get a sort of poor man's double spacing by redefining this. \def\baselinefactor{1} % \newdimen\textleading \def\setleading#1{% \dimen0 = #1\relax \normalbaselineskip = \baselinefactor\dimen0 \normallineskip = \lineskipfactor\normalbaselineskip \normalbaselines \setbox\strutbox =\hbox{% \vrule width0pt height\strutheightpercent\baselineskip depth \strutdepthpercent \baselineskip }% } % PDF CMaps. See also LaTeX's t1.cmap. % % do nothing with this by default. \expandafter\let\csname cmapOT1\endcsname\gobble \expandafter\let\csname cmapOT1IT\endcsname\gobble \expandafter\let\csname cmapOT1TT\endcsname\gobble % if we are producing pdf, and we have \pdffontattr, then define cmaps. % (\pdffontattr was introduced many years ago, but people still run % older pdftex's; it's easy to conditionalize, so we do.) \ifpdf \ifx\pdffontattr\thisisundefined \else \begingroup \catcode`\^^M=\active \def^^M{^^J}% Output line endings as the ^^J char. \catcode`\%=12 \immediate\pdfobj stream {%!PS-Adobe-3.0 Resource-CMap %%DocumentNeededResources: ProcSet (CIDInit) %%IncludeResource: ProcSet (CIDInit) %%BeginResource: CMap (TeX-OT1-0) %%Title: (TeX-OT1-0 TeX OT1 0) %%Version: 1.000 %%EndComments /CIDInit /ProcSet findresource begin 12 dict begin begincmap /CIDSystemInfo << /Registry (TeX) /Ordering (OT1) /Supplement 0 >> def /CMapName /TeX-OT1-0 def /CMapType 2 def 1 begincodespacerange <00> <7F> endcodespacerange 8 beginbfrange <00> <01> <0393> <09> <0A> <03A8> <23> <26> <0023> <28> <3B> <0028> <3F> <5B> <003F> <5D> <5E> <005D> <61> <7A> <0061> <7B> <7C> <2013> endbfrange 40 beginbfchar <02> <0398> <03> <039B> <04> <039E> <05> <03A0> <06> <03A3> <07> <03D2> <08> <03A6> <0B> <00660066> <0C> <00660069> <0D> <0066006C> <0E> <006600660069> <0F> <00660066006C> <10> <0131> <11> <0237> <12> <0060> <13> <00B4> <14> <02C7> <15> <02D8> <16> <00AF> <17> <02DA> <18> <00B8> <19> <00DF> <1A> <00E6> <1B> <0153> <1C> <00F8> <1D> <00C6> <1E> <0152> <1F> <00D8> <21> <0021> <22> <201D> <27> <2019> <3C> <00A1> <3D> <003D> <3E> <00BF> <5C> <201C> <5F> <02D9> <60> <2018> <7D> <02DD> <7E> <007E> <7F> <00A8> endbfchar endcmap CMapName currentdict /CMap defineresource pop end end %%EndResource %%EOF }\endgroup \expandafter\edef\csname cmapOT1\endcsname#1{% \pdffontattr#1{/ToUnicode \the\pdflastobj\space 0 R}% }% % % \cmapOT1IT \begingroup \catcode`\^^M=\active \def^^M{^^J}% Output line endings as the ^^J char. \catcode`\%=12 \immediate\pdfobj stream {%!PS-Adobe-3.0 Resource-CMap %%DocumentNeededResources: ProcSet (CIDInit) %%IncludeResource: ProcSet (CIDInit) %%BeginResource: CMap (TeX-OT1IT-0) %%Title: (TeX-OT1IT-0 TeX OT1IT 0) %%Version: 1.000 %%EndComments /CIDInit /ProcSet findresource begin 12 dict begin begincmap /CIDSystemInfo << /Registry (TeX) /Ordering (OT1IT) /Supplement 0 >> def /CMapName /TeX-OT1IT-0 def /CMapType 2 def 1 begincodespacerange <00> <7F> endcodespacerange 8 beginbfrange <00> <01> <0393> <09> <0A> <03A8> <25> <26> <0025> <28> <3B> <0028> <3F> <5B> <003F> <5D> <5E> <005D> <61> <7A> <0061> <7B> <7C> <2013> endbfrange 42 beginbfchar <02> <0398> <03> <039B> <04> <039E> <05> <03A0> <06> <03A3> <07> <03D2> <08> <03A6> <0B> <00660066> <0C> <00660069> <0D> <0066006C> <0E> <006600660069> <0F> <00660066006C> <10> <0131> <11> <0237> <12> <0060> <13> <00B4> <14> <02C7> <15> <02D8> <16> <00AF> <17> <02DA> <18> <00B8> <19> <00DF> <1A> <00E6> <1B> <0153> <1C> <00F8> <1D> <00C6> <1E> <0152> <1F> <00D8> <21> <0021> <22> <201D> <23> <0023> <24> <00A3> <27> <2019> <3C> <00A1> <3D> <003D> <3E> <00BF> <5C> <201C> <5F> <02D9> <60> <2018> <7D> <02DD> <7E> <007E> <7F> <00A8> endbfchar endcmap CMapName currentdict /CMap defineresource pop end end %%EndResource %%EOF }\endgroup \expandafter\edef\csname cmapOT1IT\endcsname#1{% \pdffontattr#1{/ToUnicode \the\pdflastobj\space 0 R}% }% % % \cmapOT1TT \begingroup \catcode`\^^M=\active \def^^M{^^J}% Output line endings as the ^^J char. \catcode`\%=12 \immediate\pdfobj stream {%!PS-Adobe-3.0 Resource-CMap %%DocumentNeededResources: ProcSet (CIDInit) %%IncludeResource: ProcSet (CIDInit) %%BeginResource: CMap (TeX-OT1TT-0) %%Title: (TeX-OT1TT-0 TeX OT1TT 0) %%Version: 1.000 %%EndComments /CIDInit /ProcSet findresource begin 12 dict begin begincmap /CIDSystemInfo << /Registry (TeX) /Ordering (OT1TT) /Supplement 0 >> def /CMapName /TeX-OT1TT-0 def /CMapType 2 def 1 begincodespacerange <00> <7F> endcodespacerange 5 beginbfrange <00> <01> <0393> <09> <0A> <03A8> <21> <26> <0021> <28> <5F> <0028> <61> <7E> <0061> endbfrange 32 beginbfchar <02> <0398> <03> <039B> <04> <039E> <05> <03A0> <06> <03A3> <07> <03D2> <08> <03A6> <0B> <2191> <0C> <2193> <0D> <0027> <0E> <00A1> <0F> <00BF> <10> <0131> <11> <0237> <12> <0060> <13> <00B4> <14> <02C7> <15> <02D8> <16> <00AF> <17> <02DA> <18> <00B8> <19> <00DF> <1A> <00E6> <1B> <0153> <1C> <00F8> <1D> <00C6> <1E> <0152> <1F> <00D8> <20> <2423> <27> <2019> <60> <2018> <7F> <00A8> endbfchar endcmap CMapName currentdict /CMap defineresource pop end end %%EndResource %%EOF }\endgroup \expandafter\edef\csname cmapOT1TT\endcsname#1{% \pdffontattr#1{/ToUnicode \the\pdflastobj\space 0 R}% }% \fi\fi % Set the font macro #1 to the font named \fontprefix#2. % #3 is the font's design size, #4 is a scale factor, #5 is the CMap % encoding (only OT1, OT1IT and OT1TT are allowed, or empty to omit). % Example: % #1 = \textrm % #2 = \rmshape % #3 = 10 % #4 = \mainmagstep % #5 = OT1 % \def\setfont#1#2#3#4#5{% \font#1=\fontprefix#2#3 scaled #4 \csname cmap#5\endcsname#1% } % This is what gets called when #5 of \setfont is empty. \let\cmap\gobble % % (end of cmaps) % Use cm as the default font prefix. % To specify the font prefix, you must define \fontprefix % before you read in texinfo.tex. \ifx\fontprefix\thisisundefined \def\fontprefix{cm} \fi % Support font families that don't use the same naming scheme as CM. \def\rmshape{r} \def\rmbshape{bx} % where the normal face is bold \def\bfshape{b} \def\bxshape{bx} \def\ttshape{tt} \def\ttbshape{tt} \def\ttslshape{sltt} \def\itshape{ti} \def\itbshape{bxti} \def\slshape{sl} \def\slbshape{bxsl} \def\sfshape{ss} \def\sfbshape{ss} \def\scshape{csc} \def\scbshape{csc} % Definitions for a main text size of 11pt. (The default in Texinfo.) % \def\definetextfontsizexi{% % Text fonts (11.2pt, magstep1). \def\textnominalsize{11pt} \edef\mainmagstep{\magstephalf} \setfont\textrm\rmshape{10}{\mainmagstep}{OT1} \setfont\texttt\ttshape{10}{\mainmagstep}{OT1TT} \setfont\textbf\bfshape{10}{\mainmagstep}{OT1} \setfont\textit\itshape{10}{\mainmagstep}{OT1IT} \setfont\textsl\slshape{10}{\mainmagstep}{OT1} \setfont\textsf\sfshape{10}{\mainmagstep}{OT1} \setfont\textsc\scshape{10}{\mainmagstep}{OT1} \setfont\textttsl\ttslshape{10}{\mainmagstep}{OT1TT} \font\texti=cmmi10 scaled \mainmagstep \font\textsy=cmsy10 scaled \mainmagstep \def\textecsize{1095} % A few fonts for @defun names and args. \setfont\defbf\bfshape{10}{\magstep1}{OT1} \setfont\deftt\ttshape{10}{\magstep1}{OT1TT} \setfont\defttsl\ttslshape{10}{\magstep1}{OT1TT} \def\df{\let\tentt=\deftt \let\tenbf = \defbf \let\tenttsl=\defttsl \bf} % Fonts for indices, footnotes, small examples (9pt). \def\smallnominalsize{9pt} \setfont\smallrm\rmshape{9}{1000}{OT1} \setfont\smalltt\ttshape{9}{1000}{OT1TT} \setfont\smallbf\bfshape{10}{900}{OT1} \setfont\smallit\itshape{9}{1000}{OT1IT} \setfont\smallsl\slshape{9}{1000}{OT1} \setfont\smallsf\sfshape{9}{1000}{OT1} \setfont\smallsc\scshape{10}{900}{OT1} \setfont\smallttsl\ttslshape{10}{900}{OT1TT} \font\smalli=cmmi9 \font\smallsy=cmsy9 \def\smallecsize{0900} % Fonts for small examples (8pt). \def\smallernominalsize{8pt} \setfont\smallerrm\rmshape{8}{1000}{OT1} \setfont\smallertt\ttshape{8}{1000}{OT1TT} \setfont\smallerbf\bfshape{10}{800}{OT1} \setfont\smallerit\itshape{8}{1000}{OT1IT} \setfont\smallersl\slshape{8}{1000}{OT1} \setfont\smallersf\sfshape{8}{1000}{OT1} \setfont\smallersc\scshape{10}{800}{OT1} \setfont\smallerttsl\ttslshape{10}{800}{OT1TT} \font\smalleri=cmmi8 \font\smallersy=cmsy8 \def\smallerecsize{0800} % Fonts for title page (20.4pt): \def\titlenominalsize{20pt} \setfont\titlerm\rmbshape{12}{\magstep3}{OT1} \setfont\titleit\itbshape{10}{\magstep4}{OT1IT} \setfont\titlesl\slbshape{10}{\magstep4}{OT1} \setfont\titlett\ttbshape{12}{\magstep3}{OT1TT} \setfont\titlettsl\ttslshape{10}{\magstep4}{OT1TT} \setfont\titlesf\sfbshape{17}{\magstep1}{OT1} \let\titlebf=\titlerm \setfont\titlesc\scbshape{10}{\magstep4}{OT1} \font\titlei=cmmi12 scaled \magstep3 \font\titlesy=cmsy10 scaled \magstep4 \def\titleecsize{2074} % Chapter (and unnumbered) fonts (17.28pt). \def\chapnominalsize{17pt} \setfont\chaprm\rmbshape{12}{\magstep2}{OT1} \setfont\chapit\itbshape{10}{\magstep3}{OT1IT} \setfont\chapsl\slbshape{10}{\magstep3}{OT1} \setfont\chaptt\ttbshape{12}{\magstep2}{OT1TT} \setfont\chapttsl\ttslshape{10}{\magstep3}{OT1TT} \setfont\chapsf\sfbshape{17}{1000}{OT1} \let\chapbf=\chaprm \setfont\chapsc\scbshape{10}{\magstep3}{OT1} \font\chapi=cmmi12 scaled \magstep2 \font\chapsy=cmsy10 scaled \magstep3 \def\chapecsize{1728} % Section fonts (14.4pt). \def\secnominalsize{14pt} \setfont\secrm\rmbshape{12}{\magstep1}{OT1} \setfont\secit\itbshape{10}{\magstep2}{OT1IT} \setfont\secsl\slbshape{10}{\magstep2}{OT1} \setfont\sectt\ttbshape{12}{\magstep1}{OT1TT} \setfont\secttsl\ttslshape{10}{\magstep2}{OT1TT} \setfont\secsf\sfbshape{12}{\magstep1}{OT1} \let\secbf\secrm \setfont\secsc\scbshape{10}{\magstep2}{OT1} \font\seci=cmmi12 scaled \magstep1 \font\secsy=cmsy10 scaled \magstep2 \def\sececsize{1440} % Subsection fonts (13.15pt). \def\ssecnominalsize{13pt} \setfont\ssecrm\rmbshape{12}{\magstephalf}{OT1} \setfont\ssecit\itbshape{10}{1315}{OT1IT} \setfont\ssecsl\slbshape{10}{1315}{OT1} \setfont\ssectt\ttbshape{12}{\magstephalf}{OT1TT} \setfont\ssecttsl\ttslshape{10}{1315}{OT1TT} \setfont\ssecsf\sfbshape{12}{\magstephalf}{OT1} \let\ssecbf\ssecrm \setfont\ssecsc\scbshape{10}{1315}{OT1} \font\sseci=cmmi12 scaled \magstephalf \font\ssecsy=cmsy10 scaled 1315 \def\ssececsize{1200} % Reduced fonts for @acro in text (10pt). \def\reducednominalsize{10pt} \setfont\reducedrm\rmshape{10}{1000}{OT1} \setfont\reducedtt\ttshape{10}{1000}{OT1TT} \setfont\reducedbf\bfshape{10}{1000}{OT1} \setfont\reducedit\itshape{10}{1000}{OT1IT} \setfont\reducedsl\slshape{10}{1000}{OT1} \setfont\reducedsf\sfshape{10}{1000}{OT1} \setfont\reducedsc\scshape{10}{1000}{OT1} \setfont\reducedttsl\ttslshape{10}{1000}{OT1TT} \font\reducedi=cmmi10 \font\reducedsy=cmsy10 \def\reducedecsize{1000} \textleading = 13.2pt % line spacing for 11pt CM \textfonts % reset the current fonts \rm } % end of 11pt text font size definitions, \definetextfontsizexi % Definitions to make the main text be 10pt Computer Modern, with % section, chapter, etc., sizes following suit. This is for the GNU % Press printing of the Emacs 22 manual. Maybe other manuals in the % future. Used with @smallbook, which sets the leading to 12pt. % \def\definetextfontsizex{% % Text fonts (10pt). \def\textnominalsize{10pt} \edef\mainmagstep{1000} \setfont\textrm\rmshape{10}{\mainmagstep}{OT1} \setfont\texttt\ttshape{10}{\mainmagstep}{OT1TT} \setfont\textbf\bfshape{10}{\mainmagstep}{OT1} \setfont\textit\itshape{10}{\mainmagstep}{OT1IT} \setfont\textsl\slshape{10}{\mainmagstep}{OT1} \setfont\textsf\sfshape{10}{\mainmagstep}{OT1} \setfont\textsc\scshape{10}{\mainmagstep}{OT1} \setfont\textttsl\ttslshape{10}{\mainmagstep}{OT1TT} \font\texti=cmmi10 scaled \mainmagstep \font\textsy=cmsy10 scaled \mainmagstep \def\textecsize{1000} % A few fonts for @defun names and args. \setfont\defbf\bfshape{10}{\magstephalf}{OT1} \setfont\deftt\ttshape{10}{\magstephalf}{OT1TT} \setfont\defttsl\ttslshape{10}{\magstephalf}{OT1TT} \def\df{\let\tentt=\deftt \let\tenbf = \defbf \let\tenttsl=\defttsl \bf} % Fonts for indices, footnotes, small examples (9pt). \def\smallnominalsize{9pt} \setfont\smallrm\rmshape{9}{1000}{OT1} \setfont\smalltt\ttshape{9}{1000}{OT1TT} \setfont\smallbf\bfshape{10}{900}{OT1} \setfont\smallit\itshape{9}{1000}{OT1IT} \setfont\smallsl\slshape{9}{1000}{OT1} \setfont\smallsf\sfshape{9}{1000}{OT1} \setfont\smallsc\scshape{10}{900}{OT1} \setfont\smallttsl\ttslshape{10}{900}{OT1TT} \font\smalli=cmmi9 \font\smallsy=cmsy9 \def\smallecsize{0900} % Fonts for small examples (8pt). \def\smallernominalsize{8pt} \setfont\smallerrm\rmshape{8}{1000}{OT1} \setfont\smallertt\ttshape{8}{1000}{OT1TT} \setfont\smallerbf\bfshape{10}{800}{OT1} \setfont\smallerit\itshape{8}{1000}{OT1IT} \setfont\smallersl\slshape{8}{1000}{OT1} \setfont\smallersf\sfshape{8}{1000}{OT1} \setfont\smallersc\scshape{10}{800}{OT1} \setfont\smallerttsl\ttslshape{10}{800}{OT1TT} \font\smalleri=cmmi8 \font\smallersy=cmsy8 \def\smallerecsize{0800} % Fonts for title page (20.4pt): \def\titlenominalsize{20pt} \setfont\titlerm\rmbshape{12}{\magstep3}{OT1} \setfont\titleit\itbshape{10}{\magstep4}{OT1IT} \setfont\titlesl\slbshape{10}{\magstep4}{OT1} \setfont\titlett\ttbshape{12}{\magstep3}{OT1TT} \setfont\titlettsl\ttslshape{10}{\magstep4}{OT1TT} \setfont\titlesf\sfbshape{17}{\magstep1}{OT1} \let\titlebf=\titlerm \setfont\titlesc\scbshape{10}{\magstep4}{OT1} \font\titlei=cmmi12 scaled \magstep3 \font\titlesy=cmsy10 scaled \magstep4 \def\titleecsize{2074} % Chapter fonts (14.4pt). \def\chapnominalsize{14pt} \setfont\chaprm\rmbshape{12}{\magstep1}{OT1} \setfont\chapit\itbshape{10}{\magstep2}{OT1IT} \setfont\chapsl\slbshape{10}{\magstep2}{OT1} \setfont\chaptt\ttbshape{12}{\magstep1}{OT1TT} \setfont\chapttsl\ttslshape{10}{\magstep2}{OT1TT} \setfont\chapsf\sfbshape{12}{\magstep1}{OT1} \let\chapbf\chaprm \setfont\chapsc\scbshape{10}{\magstep2}{OT1} \font\chapi=cmmi12 scaled \magstep1 \font\chapsy=cmsy10 scaled \magstep2 \def\chapecsize{1440} % Section fonts (12pt). \def\secnominalsize{12pt} \setfont\secrm\rmbshape{12}{1000}{OT1} \setfont\secit\itbshape{10}{\magstep1}{OT1IT} \setfont\secsl\slbshape{10}{\magstep1}{OT1} \setfont\sectt\ttbshape{12}{1000}{OT1TT} \setfont\secttsl\ttslshape{10}{\magstep1}{OT1TT} \setfont\secsf\sfbshape{12}{1000}{OT1} \let\secbf\secrm \setfont\secsc\scbshape{10}{\magstep1}{OT1} \font\seci=cmmi12 \font\secsy=cmsy10 scaled \magstep1 \def\sececsize{1200} % Subsection fonts (10pt). \def\ssecnominalsize{10pt} \setfont\ssecrm\rmbshape{10}{1000}{OT1} \setfont\ssecit\itbshape{10}{1000}{OT1IT} \setfont\ssecsl\slbshape{10}{1000}{OT1} \setfont\ssectt\ttbshape{10}{1000}{OT1TT} \setfont\ssecttsl\ttslshape{10}{1000}{OT1TT} \setfont\ssecsf\sfbshape{10}{1000}{OT1} \let\ssecbf\ssecrm \setfont\ssecsc\scbshape{10}{1000}{OT1} \font\sseci=cmmi10 \font\ssecsy=cmsy10 \def\ssececsize{1000} % Reduced fonts for @acro in text (9pt). \def\reducednominalsize{9pt} \setfont\reducedrm\rmshape{9}{1000}{OT1} \setfont\reducedtt\ttshape{9}{1000}{OT1TT} \setfont\reducedbf\bfshape{10}{900}{OT1} \setfont\reducedit\itshape{9}{1000}{OT1IT} \setfont\reducedsl\slshape{9}{1000}{OT1} \setfont\reducedsf\sfshape{9}{1000}{OT1} \setfont\reducedsc\scshape{10}{900}{OT1} \setfont\reducedttsl\ttslshape{10}{900}{OT1TT} \font\reducedi=cmmi9 \font\reducedsy=cmsy9 \def\reducedecsize{0900} \divide\parskip by 2 % reduce space between paragraphs \textleading = 12pt % line spacing for 10pt CM \textfonts % reset the current fonts \rm } % end of 10pt text font size definitions, \definetextfontsizex % We provide the user-level command % @fonttextsize 10 % (or 11) to redefine the text font size. pt is assumed. % \def\xiword{11} \def\xword{10} \def\xwordpt{10pt} % \parseargdef\fonttextsize{% \def\textsizearg{#1}% %\wlog{doing @fonttextsize \textsizearg}% % % Set \globaldefs so that documents can use this inside @tex, since % makeinfo 4.8 does not support it, but we need it nonetheless. % \begingroup \globaldefs=1 \ifx\textsizearg\xword \definetextfontsizex \else \ifx\textsizearg\xiword \definetextfontsizexi \else \errhelp=\EMsimple \errmessage{@fonttextsize only supports `10' or `11', not `\textsizearg'} \fi\fi \endgroup } % In order for the font changes to affect most math symbols and letters, % we have to define the \textfont of the standard families. Since % texinfo doesn't allow for producing subscripts and superscripts except % in the main text, we don't bother to reset \scriptfont and % \scriptscriptfont (which would also require loading a lot more fonts). % \def\resetmathfonts{% \textfont0=\tenrm \textfont1=\teni \textfont2=\tensy \textfont\itfam=\tenit \textfont\slfam=\tensl \textfont\bffam=\tenbf \textfont\ttfam=\tentt \textfont\sffam=\tensf } % The font-changing commands redefine the meanings of \tenSTYLE, instead % of just \STYLE. We do this because \STYLE needs to also set the % current \fam for math mode. Our \STYLE (e.g., \rm) commands hardwire % \tenSTYLE to set the current font. % % Each font-changing command also sets the names \lsize (one size lower) % and \lllsize (three sizes lower). These relative commands are used in % the LaTeX logo and acronyms. % % This all needs generalizing, badly. % \def\textfonts{% \let\tenrm=\textrm \let\tenit=\textit \let\tensl=\textsl \let\tenbf=\textbf \let\tentt=\texttt \let\smallcaps=\textsc \let\tensf=\textsf \let\teni=\texti \let\tensy=\textsy \let\tenttsl=\textttsl \def\curfontsize{text}% \def\lsize{reduced}\def\lllsize{smaller}% \resetmathfonts \setleading{\textleading}} \def\titlefonts{% \let\tenrm=\titlerm \let\tenit=\titleit \let\tensl=\titlesl \let\tenbf=\titlebf \let\tentt=\titlett \let\smallcaps=\titlesc \let\tensf=\titlesf \let\teni=\titlei \let\tensy=\titlesy \let\tenttsl=\titlettsl \def\curfontsize{title}% \def\lsize{chap}\def\lllsize{subsec}% \resetmathfonts \setleading{27pt}} \def\titlefont#1{{\titlefonts\rmisbold #1}} \def\chapfonts{% \let\tenrm=\chaprm \let\tenit=\chapit \let\tensl=\chapsl \let\tenbf=\chapbf \let\tentt=\chaptt \let\smallcaps=\chapsc \let\tensf=\chapsf \let\teni=\chapi \let\tensy=\chapsy \let\tenttsl=\chapttsl \def\curfontsize{chap}% \def\lsize{sec}\def\lllsize{text}% \resetmathfonts \setleading{19pt}} \def\secfonts{% \let\tenrm=\secrm \let\tenit=\secit \let\tensl=\secsl \let\tenbf=\secbf \let\tentt=\sectt \let\smallcaps=\secsc \let\tensf=\secsf \let\teni=\seci \let\tensy=\secsy \let\tenttsl=\secttsl \def\curfontsize{sec}% \def\lsize{subsec}\def\lllsize{reduced}% \resetmathfonts \setleading{16pt}} \def\subsecfonts{% \let\tenrm=\ssecrm \let\tenit=\ssecit \let\tensl=\ssecsl \let\tenbf=\ssecbf \let\tentt=\ssectt \let\smallcaps=\ssecsc \let\tensf=\ssecsf \let\teni=\sseci \let\tensy=\ssecsy \let\tenttsl=\ssecttsl \def\curfontsize{ssec}% \def\lsize{text}\def\lllsize{small}% \resetmathfonts \setleading{15pt}} \let\subsubsecfonts = \subsecfonts \def\reducedfonts{% \let\tenrm=\reducedrm \let\tenit=\reducedit \let\tensl=\reducedsl \let\tenbf=\reducedbf \let\tentt=\reducedtt \let\reducedcaps=\reducedsc \let\tensf=\reducedsf \let\teni=\reducedi \let\tensy=\reducedsy \let\tenttsl=\reducedttsl \def\curfontsize{reduced}% \def\lsize{small}\def\lllsize{smaller}% \resetmathfonts \setleading{10.5pt}} \def\smallfonts{% \let\tenrm=\smallrm \let\tenit=\smallit \let\tensl=\smallsl \let\tenbf=\smallbf \let\tentt=\smalltt \let\smallcaps=\smallsc \let\tensf=\smallsf \let\teni=\smalli \let\tensy=\smallsy \let\tenttsl=\smallttsl \def\curfontsize{small}% \def\lsize{smaller}\def\lllsize{smaller}% \resetmathfonts \setleading{10.5pt}} \def\smallerfonts{% \let\tenrm=\smallerrm \let\tenit=\smallerit \let\tensl=\smallersl \let\tenbf=\smallerbf \let\tentt=\smallertt \let\smallcaps=\smallersc \let\tensf=\smallersf \let\teni=\smalleri \let\tensy=\smallersy \let\tenttsl=\smallerttsl \def\curfontsize{smaller}% \def\lsize{smaller}\def\lllsize{smaller}% \resetmathfonts \setleading{9.5pt}} % Fonts for short table of contents. \setfont\shortcontrm\rmshape{12}{1000}{OT1} \setfont\shortcontbf\bfshape{10}{\magstep1}{OT1} % no cmb12 \setfont\shortcontsl\slshape{12}{1000}{OT1} \setfont\shortconttt\ttshape{12}{1000}{OT1TT} % Define these just so they can be easily changed for other fonts. \def\angleleft{$\langle$} \def\angleright{$\rangle$} % Set the fonts to use with the @small... environments. \let\smallexamplefonts = \smallfonts % About \smallexamplefonts. If we use \smallfonts (9pt), @smallexample % can fit this many characters: % 8.5x11=86 smallbook=72 a4=90 a5=69 % If we use \scriptfonts (8pt), then we can fit this many characters: % 8.5x11=90+ smallbook=80 a4=90+ a5=77 % For me, subjectively, the few extra characters that fit aren't worth % the additional smallness of 8pt. So I'm making the default 9pt. % % By the way, for comparison, here's what fits with @example (10pt): % 8.5x11=71 smallbook=60 a4=75 a5=58 % --karl, 24jan03. % Set up the default fonts, so we can use them for creating boxes. % \definetextfontsizexi \message{markup,} % Check if we are currently using a typewriter font. Since all the % Computer Modern typewriter fonts have zero interword stretch (and % shrink), and it is reasonable to expect all typewriter fonts to have % this property, we can check that font parameter. % \def\ifmonospace{\ifdim\fontdimen3\font=0pt } % Markup style infrastructure. \defmarkupstylesetup\INITMACRO will % define and register \INITMACRO to be called on markup style changes. % \INITMACRO can check \currentmarkupstyle for the innermost % style and the set of \ifmarkupSTYLE switches for all styles % currently in effect. \newif\ifmarkupvar \newif\ifmarkupsamp \newif\ifmarkupkey %\newif\ifmarkupfile % @file == @samp. %\newif\ifmarkupoption % @option == @samp. \newif\ifmarkupcode \newif\ifmarkupkbd %\newif\ifmarkupenv % @env == @code. %\newif\ifmarkupcommand % @command == @code. \newif\ifmarkuptex % @tex (and part of @math, for now). \newif\ifmarkupexample \newif\ifmarkupverb \newif\ifmarkupverbatim \let\currentmarkupstyle\empty \def\setupmarkupstyle#1{% \csname markup#1true\endcsname \def\currentmarkupstyle{#1}% \markupstylesetup } \let\markupstylesetup\empty \def\defmarkupstylesetup#1{% \expandafter\def\expandafter\markupstylesetup \expandafter{\markupstylesetup #1}% \def#1% } % Markup style setup for left and right quotes. \defmarkupstylesetup\markupsetuplq{% \expandafter\let\expandafter \temp \csname markupsetuplq\currentmarkupstyle\endcsname \ifx\temp\relax \markupsetuplqdefault \else \temp \fi } \defmarkupstylesetup\markupsetuprq{% \expandafter\let\expandafter \temp \csname markupsetuprq\currentmarkupstyle\endcsname \ifx\temp\relax \markupsetuprqdefault \else \temp \fi } { \catcode`\'=\active \catcode`\`=\active \gdef\markupsetuplqdefault{\let`\lq} \gdef\markupsetuprqdefault{\let'\rq} \gdef\markupsetcodequoteleft{\let`\codequoteleft} \gdef\markupsetcodequoteright{\let'\codequoteright} } \let\markupsetuplqcode \markupsetcodequoteleft \let\markupsetuprqcode \markupsetcodequoteright % \let\markupsetuplqexample \markupsetcodequoteleft \let\markupsetuprqexample \markupsetcodequoteright % \let\markupsetuplqkbd \markupsetcodequoteleft \let\markupsetuprqkbd \markupsetcodequoteright % \let\markupsetuplqsamp \markupsetcodequoteleft \let\markupsetuprqsamp \markupsetcodequoteright % \let\markupsetuplqverb \markupsetcodequoteleft \let\markupsetuprqverb \markupsetcodequoteright % \let\markupsetuplqverbatim \markupsetcodequoteleft \let\markupsetuprqverbatim \markupsetcodequoteright % Allow an option to not use regular directed right quote/apostrophe % (char 0x27), but instead the undirected quote from cmtt (char 0x0d). % The undirected quote is ugly, so don't make it the default, but it % works for pasting with more pdf viewers (at least evince), the % lilypond developers report. xpdf does work with the regular 0x27. % \def\codequoteright{% \expandafter\ifx\csname SETtxicodequoteundirected\endcsname\relax \expandafter\ifx\csname SETcodequoteundirected\endcsname\relax '% \else \char'15 \fi \else \char'15 \fi } % % and a similar option for the left quote char vs. a grave accent. % Modern fonts display ASCII 0x60 as a grave accent, so some people like % the code environments to do likewise. % \def\codequoteleft{% \expandafter\ifx\csname SETtxicodequotebacktick\endcsname\relax \expandafter\ifx\csname SETcodequotebacktick\endcsname\relax % [Knuth] pp. 380,381,391 % \relax disables Spanish ligatures ?` and !` of \tt font. \relax`% \else \char'22 \fi \else \char'22 \fi } % Commands to set the quote options. % \parseargdef\codequoteundirected{% \def\temp{#1}% \ifx\temp\onword \expandafter\let\csname SETtxicodequoteundirected\endcsname = t% \else\ifx\temp\offword \expandafter\let\csname SETtxicodequoteundirected\endcsname = \relax \else \errhelp = \EMsimple \errmessage{Unknown @codequoteundirected value `\temp', must be on|off}% \fi\fi } % \parseargdef\codequotebacktick{% \def\temp{#1}% \ifx\temp\onword \expandafter\let\csname SETtxicodequotebacktick\endcsname = t% \else\ifx\temp\offword \expandafter\let\csname SETtxicodequotebacktick\endcsname = \relax \else \errhelp = \EMsimple \errmessage{Unknown @codequotebacktick value `\temp', must be on|off}% \fi\fi } % [Knuth] pp. 380,381,391, disable Spanish ligatures ?` and !` of \tt font. \def\noligaturesquoteleft{\relax\lq} % Count depth in font-changes, for error checks \newcount\fontdepth \fontdepth=0 % Font commands. % #1 is the font command (\sl or \it), #2 is the text to slant. % If we are in a monospaced environment, however, 1) always use \ttsl, % and 2) do not add an italic correction. \def\dosmartslant#1#2{% \ifusingtt {{\ttsl #2}\let\next=\relax}% {\def\next{{#1#2}\futurelet\next\smartitaliccorrection}}% \next } \def\smartslanted{\dosmartslant\sl} \def\smartitalic{\dosmartslant\it} % Output an italic correction unless \next (presumed to be the following % character) is such as not to need one. \def\smartitaliccorrection{% \ifx\next,% \else\ifx\next-% \else\ifx\next.% \else\ptexslash \fi\fi\fi \aftersmartic } % Unconditional use \ttsl, and no ic. @var is set to this for defuns. \def\ttslanted#1{{\ttsl #1}} % @cite is like \smartslanted except unconditionally use \sl. We never want % ttsl for book titles, do we? \def\cite#1{{\sl #1}\futurelet\next\smartitaliccorrection} \def\aftersmartic{} \def\var#1{% \let\saveaftersmartic = \aftersmartic \def\aftersmartic{\null\let\aftersmartic=\saveaftersmartic}% \smartslanted{#1}% } \let\i=\smartitalic \let\slanted=\smartslanted \let\dfn=\smartslanted \let\emph=\smartitalic % Explicit font changes: @r, @sc, undocumented @ii. \def\r#1{{\rm #1}} % roman font \def\sc#1{{\smallcaps#1}} % smallcaps font \def\ii#1{{\it #1}} % italic font % @b, explicit bold. Also @strong. \def\b#1{{\bf #1}} \let\strong=\b % @sansserif, explicit sans. \def\sansserif#1{{\sf #1}} % We can't just use \exhyphenpenalty, because that only has effect at % the end of a paragraph. Restore normal hyphenation at the end of the % group within which \nohyphenation is presumably called. % \def\nohyphenation{\hyphenchar\font = -1 \aftergroup\restorehyphenation} \def\restorehyphenation{\hyphenchar\font = `- } % Set sfcode to normal for the chars that usually have another value. % Can't use plain's \frenchspacing because it uses the `\x notation, and % sometimes \x has an active definition that messes things up. % \catcode`@=11 \def\plainfrenchspacing{% \sfcode\dotChar =\@m \sfcode\questChar=\@m \sfcode\exclamChar=\@m \sfcode\colonChar=\@m \sfcode\semiChar =\@m \sfcode\commaChar =\@m \def\endofsentencespacefactor{1000}% for @. and friends } \def\plainnonfrenchspacing{% \sfcode`\.3000\sfcode`\?3000\sfcode`\!3000 \sfcode`\:2000\sfcode`\;1500\sfcode`\,1250 \def\endofsentencespacefactor{3000}% for @. and friends } \catcode`@=\other \def\endofsentencespacefactor{3000}% default % @t, explicit typewriter. \def\t#1{% {\tt \rawbackslash \plainfrenchspacing #1}% \null } % @samp. \def\samp#1{{\setupmarkupstyle{samp}\lq\tclose{#1}\rq\null}} % @indicateurl is \samp, that is, with quotes. \let\indicateurl=\samp % @code (and similar) prints in typewriter, but with spaces the same % size as normal in the surrounding text, without hyphenation, etc. % This is a subroutine for that. \def\tclose#1{% {% % Change normal interword space to be same as for the current font. \spaceskip = \fontdimen2\font % % Switch to typewriter. \tt % % But `\ ' produces the large typewriter interword space. \def\ {{\spaceskip = 0pt{} }}% % % Turn off hyphenation. \nohyphenation % \rawbackslash \plainfrenchspacing #1% }% \null % reset spacefactor to 1000 } % We *must* turn on hyphenation at `-' and `_' in @code. % Otherwise, it is too hard to avoid overfull hboxes % in the Emacs manual, the Library manual, etc. % % Unfortunately, TeX uses one parameter (\hyphenchar) to control % both hyphenation at - and hyphenation within words. % We must therefore turn them both off (\tclose does that) % and arrange explicitly to hyphenate at a dash. % -- rms. { \catcode`\-=\active \catcode`\_=\active \catcode`\'=\active \catcode`\`=\active \global\let'=\rq \global\let`=\lq % default definitions % \global\def\code{\begingroup \setupmarkupstyle{code}% % The following should really be moved into \setupmarkupstyle handlers. \catcode\dashChar=\active \catcode\underChar=\active \ifallowcodebreaks \let-\codedash \let_\codeunder \else \let-\normaldash \let_\realunder \fi \codex } } \def\codex #1{\tclose{#1}\endgroup} \def\normaldash{-} \def\codedash{-\discretionary{}{}{}} \def\codeunder{% % this is all so @math{@code{var_name}+1} can work. In math mode, _ % is "active" (mathcode"8000) and \normalunderscore (or \char95, etc.) % will therefore expand the active definition of _, which is us % (inside @code that is), therefore an endless loop. \ifusingtt{\ifmmode \mathchar"075F % class 0=ordinary, family 7=ttfam, pos 0x5F=_. \else\normalunderscore \fi \discretionary{}{}{}}% {\_}% } % An additional complication: the above will allow breaks after, e.g., % each of the four underscores in __typeof__. This is bad. % @allowcodebreaks provides a document-level way to turn breaking at - % and _ on and off. % \newif\ifallowcodebreaks \allowcodebreakstrue \def\keywordtrue{true} \def\keywordfalse{false} \parseargdef\allowcodebreaks{% \def\txiarg{#1}% \ifx\txiarg\keywordtrue \allowcodebreakstrue \else\ifx\txiarg\keywordfalse \allowcodebreaksfalse \else \errhelp = \EMsimple \errmessage{Unknown @allowcodebreaks option `\txiarg', must be true|false}% \fi\fi } % For @command, @env, @file, @option quotes seem unnecessary, % so use \code rather than \samp. \let\command=\code \let\env=\code \let\file=\code \let\option=\code % @uref (abbreviation for `urlref') takes an optional (comma-separated) % second argument specifying the text to display and an optional third % arg as text to display instead of (rather than in addition to) the url % itself. First (mandatory) arg is the url. % (This \urefnobreak definition isn't used now, leaving it for a while % for comparison.) \def\urefnobreak#1{\dourefnobreak #1,,,\finish} \def\dourefnobreak#1,#2,#3,#4\finish{\begingroup \unsepspaces \pdfurl{#1}% \setbox0 = \hbox{\ignorespaces #3}% \ifdim\wd0 > 0pt \unhbox0 % third arg given, show only that \else \setbox0 = \hbox{\ignorespaces #2}% \ifdim\wd0 > 0pt \ifpdf \unhbox0 % PDF: 2nd arg given, show only it \else \unhbox0\ (\code{#1})% DVI: 2nd arg given, show both it and url \fi \else \code{#1}% only url given, so show it \fi \fi \endlink \endgroup} % This \urefbreak definition is the active one. \def\urefbreak{\begingroup \urefcatcodes \dourefbreak} \let\uref=\urefbreak \def\dourefbreak#1{\urefbreakfinish #1,,,\finish} \def\urefbreakfinish#1,#2,#3,#4\finish{% doesn't work in @example \unsepspaces \pdfurl{#1}% \setbox0 = \hbox{\ignorespaces #3}% \ifdim\wd0 > 0pt \unhbox0 % third arg given, show only that \else \setbox0 = \hbox{\ignorespaces #2}% \ifdim\wd0 > 0pt \ifpdf \unhbox0 % PDF: 2nd arg given, show only it \else \unhbox0\ (\urefcode{#1})% DVI: 2nd arg given, show both it and url \fi \else \urefcode{#1}% only url given, so show it \fi \fi \endlink \endgroup} % Allow line breaks around only a few characters (only). \def\urefcatcodes{% \catcode\ampChar=\active \catcode\dotChar=\active \catcode\hashChar=\active \catcode\questChar=\active \catcode\slashChar=\active } { \urefcatcodes % \global\def\urefcode{\begingroup \setupmarkupstyle{code}% \urefcatcodes \let&\urefcodeamp \let.\urefcodedot \let#\urefcodehash \let?\urefcodequest \let/\urefcodeslash \codex } % % By default, they are just regular characters. \global\def&{\normalamp} \global\def.{\normaldot} \global\def#{\normalhash} \global\def?{\normalquest} \global\def/{\normalslash} } % we put a little stretch before and after the breakable chars, to help % line breaking of long url's. The unequal skips make look better in % cmtt at least, especially for dots. \def\urefprestretch{\urefprebreak \hskip0pt plus.13em } \def\urefpoststretch{\urefpostbreak \hskip0pt plus.1em } % \def\urefcodeamp{\urefprestretch \&\urefpoststretch} \def\urefcodedot{\urefprestretch .\urefpoststretch} \def\urefcodehash{\urefprestretch \#\urefpoststretch} \def\urefcodequest{\urefprestretch ?\urefpoststretch} \def\urefcodeslash{\futurelet\next\urefcodeslashfinish} { \catcode`\/=\active \global\def\urefcodeslashfinish{% \urefprestretch \slashChar % Allow line break only after the final / in a sequence of % slashes, to avoid line break between the slashes in http://. \ifx\next/\else \urefpoststretch \fi } } % One more complication: by default we'll break after the special % characters, but some people like to break before the special chars, so % allow that. Also allow no breaking at all, for manual control. % \parseargdef\urefbreakstyle{% \def\txiarg{#1}% \ifx\txiarg\wordnone \def\urefprebreak{\nobreak}\def\urefpostbreak{\nobreak} \else\ifx\txiarg\wordbefore \def\urefprebreak{\allowbreak}\def\urefpostbreak{\nobreak} \else\ifx\txiarg\wordafter \def\urefprebreak{\nobreak}\def\urefpostbreak{\allowbreak} \else \errhelp = \EMsimple \errmessage{Unknown @urefbreakstyle setting `\txiarg'}% \fi\fi\fi } \def\wordafter{after} \def\wordbefore{before} \def\wordnone{none} \urefbreakstyle after % @url synonym for @uref, since that's how everyone uses it. % \let\url=\uref % rms does not like angle brackets --karl, 17may97. % So now @email is just like @uref, unless we are pdf. % %\def\email#1{\angleleft{\tt #1}\angleright} \ifpdf \def\email#1{\doemail#1,,\finish} \def\doemail#1,#2,#3\finish{\begingroup \unsepspaces \pdfurl{mailto:#1}% \setbox0 = \hbox{\ignorespaces #2}% \ifdim\wd0>0pt\unhbox0\else\code{#1}\fi \endlink \endgroup} \else \let\email=\uref \fi % @kbdinputstyle -- arg is `distinct' (@kbd uses slanted tty font always), % `example' (@kbd uses ttsl only inside of @example and friends), % or `code' (@kbd uses normal tty font always). \parseargdef\kbdinputstyle{% \def\txiarg{#1}% \ifx\txiarg\worddistinct \gdef\kbdexamplefont{\ttsl}\gdef\kbdfont{\ttsl}% \else\ifx\txiarg\wordexample \gdef\kbdexamplefont{\ttsl}\gdef\kbdfont{\tt}% \else\ifx\txiarg\wordcode \gdef\kbdexamplefont{\tt}\gdef\kbdfont{\tt}% \else \errhelp = \EMsimple \errmessage{Unknown @kbdinputstyle setting `\txiarg'}% \fi\fi\fi } \def\worddistinct{distinct} \def\wordexample{example} \def\wordcode{code} % Default is `distinct'. \kbdinputstyle distinct % @kbd is like @code, except that if the argument is just one @key command, % then @kbd has no effect. \def\kbd#1{{\def\look{#1}\expandafter\kbdsub\look??\par}} \def\xkey{\key} \def\kbdsub#1#2#3\par{% \def\one{#1}\def\three{#3}\def\threex{??}% \ifx\one\xkey\ifx\threex\three \key{#2}% \else{\tclose{\kbdfont\setupmarkupstyle{kbd}\look}}\fi \else{\tclose{\kbdfont\setupmarkupstyle{kbd}\look}}\fi } % definition of @key that produces a lozenge. Doesn't adjust to text size. %\setfont\keyrm\rmshape{8}{1000}{OT1} %\font\keysy=cmsy9 %\def\key#1{{\keyrm\textfont2=\keysy \leavevmode\hbox{% % \raise0.4pt\hbox{\angleleft}\kern-.08em\vtop{% % \vbox{\hrule\kern-0.4pt % \hbox{\raise0.4pt\hbox{\vphantom{\angleleft}}#1}}% % \kern-0.4pt\hrule}% % \kern-.06em\raise0.4pt\hbox{\angleright}}}} % definition of @key with no lozenge. If the current font is already % monospace, don't change it; that way, we respect @kbdinputstyle. But % if it isn't monospace, then use \tt. % \def\key#1{{\setupmarkupstyle{key}% \nohyphenation \ifmonospace\else\tt\fi #1}\null} % @clicksequence{File @click{} Open ...} \def\clicksequence#1{\begingroup #1\endgroup} % @clickstyle @arrow (by default) \parseargdef\clickstyle{\def\click{#1}} \def\click{\arrow} % Typeset a dimension, e.g., `in' or `pt'. The only reason for the % argument is to make the input look right: @dmn{pt} instead of @dmn{}pt. % \def\dmn#1{\thinspace #1} % @l was never documented to mean ``switch to the Lisp font'', % and it is not used as such in any manual I can find. We need it for % Polish suppressed-l. --karl, 22sep96. %\def\l#1{{\li #1}\null} % @acronym for "FBI", "NATO", and the like. % We print this one point size smaller, since it's intended for % all-uppercase. % \def\acronym#1{\doacronym #1,,\finish} \def\doacronym#1,#2,#3\finish{% {\selectfonts\lsize #1}% \def\temp{#2}% \ifx\temp\empty \else \space ({\unsepspaces \ignorespaces \temp \unskip})% \fi \null % reset \spacefactor=1000 } % @abbr for "Comput. J." and the like. % No font change, but don't do end-of-sentence spacing. % \def\abbr#1{\doabbr #1,,\finish} \def\doabbr#1,#2,#3\finish{% {\plainfrenchspacing #1}% \def\temp{#2}% \ifx\temp\empty \else \space ({\unsepspaces \ignorespaces \temp \unskip})% \fi \null % reset \spacefactor=1000 } % @asis just yields its argument. Used with @table, for example. % \def\asis#1{#1} % @math outputs its argument in math mode. % % One complication: _ usually means subscripts, but it could also mean % an actual _ character, as in @math{@var{some_variable} + 1}. So make % _ active, and distinguish by seeing if the current family is \slfam, % which is what @var uses. { \catcode`\_ = \active \gdef\mathunderscore{% \catcode`\_=\active \def_{\ifnum\fam=\slfam \_\else\sb\fi}% } } % Another complication: we want \\ (and @\) to output a math (or tt) \. % FYI, plain.tex uses \\ as a temporary control sequence (for no % particular reason), but this is not advertised and we don't care. % % The \mathchar is class=0=ordinary, family=7=ttfam, position=5C=\. \def\mathbackslash{\ifnum\fam=\ttfam \mathchar"075C \else\backslash \fi} % \def\math{% \tex \mathunderscore \let\\ = \mathbackslash \mathactive % make the texinfo accent commands work in math mode \let\"=\ddot \let\'=\acute \let\==\bar \let\^=\hat \let\`=\grave \let\u=\breve \let\v=\check \let\~=\tilde \let\dotaccent=\dot $\finishmath } \def\finishmath#1{#1$\endgroup} % Close the group opened by \tex. % Some active characters (such as <) are spaced differently in math. % We have to reset their definitions in case the @math was an argument % to a command which sets the catcodes (such as @item or @section). % { \catcode`^ = \active \catcode`< = \active \catcode`> = \active \catcode`+ = \active \catcode`' = \active \gdef\mathactive{% \let^ = \ptexhat \let< = \ptexless \let> = \ptexgtr \let+ = \ptexplus \let' = \ptexquoteright } } % ctrl is no longer a Texinfo command, but leave this definition for fun. \def\ctrl #1{{\tt \rawbackslash \hat}#1} % @inlinefmt{FMTNAME,PROCESSED-TEXT} and @inlineraw{FMTNAME,RAW-TEXT}. % Ignore unless FMTNAME == tex; then it is like @iftex and @tex, % except specified as a normal braced arg, so no newlines to worry about. % \def\outfmtnametex{tex} % \long\def\inlinefmt#1{\doinlinefmt #1,\finish} \long\def\doinlinefmt#1,#2,\finish{% \def\inlinefmtname{#1}% \ifx\inlinefmtname\outfmtnametex \ignorespaces #2\fi } % For raw, must switch into @tex before parsing the argument, to avoid % setting catcodes prematurely. Doing it this way means that, for % example, @inlineraw{html, foo{bar} gets a parse error instead of being % ignored. But this isn't important because if people want a literal % *right* brace they would have to use a command anyway, so they may as % well use a command to get a left brace too. We could re-use the % delimiter character idea from \verb, but it seems like overkill. % \long\def\inlineraw{\tex \doinlineraw} \long\def\doinlineraw#1{\doinlinerawtwo #1,\finish} \def\doinlinerawtwo#1,#2,\finish{% \def\inlinerawname{#1}% \ifx\inlinerawname\outfmtnametex \ignorespaces #2\fi \endgroup % close group opened by \tex. } \message{glyphs,} % and logos. % @@ prints an @, as does @atchar{}. \def\@{\char64 } \let\atchar=\@ % @{ @} @lbracechar{} @rbracechar{} all generate brace characters. % Unless we're in typewriter, use \ecfont because the CM text fonts do % not have braces, and we don't want to switch into math. \def\mylbrace{{\ifmonospace\else\ecfont\fi \char123}} \def\myrbrace{{\ifmonospace\else\ecfont\fi \char125}} \let\{=\mylbrace \let\lbracechar=\{ \let\}=\myrbrace \let\rbracechar=\} \begingroup % Definitions to produce \{ and \} commands for indices, % and @{ and @} for the aux/toc files. \catcode`\{ = \other \catcode`\} = \other \catcode`\[ = 1 \catcode`\] = 2 \catcode`\! = 0 \catcode`\\ = \other !gdef!lbracecmd[\{]% !gdef!rbracecmd[\}]% !gdef!lbraceatcmd[@{]% !gdef!rbraceatcmd[@}]% !endgroup % @comma{} to avoid , parsing problems. \let\comma = , % Accents: @, @dotaccent @ringaccent @ubaraccent @udotaccent % Others are defined by plain TeX: @` @' @" @^ @~ @= @u @v @H. \let\, = \ptexc \let\dotaccent = \ptexdot \def\ringaccent#1{{\accent23 #1}} \let\tieaccent = \ptext \let\ubaraccent = \ptexb \let\udotaccent = \d % Other special characters: @questiondown @exclamdown @ordf @ordm % Plain TeX defines: @AA @AE @O @OE @L (plus lowercase versions) @ss. \def\questiondown{?`} \def\exclamdown{!`} \def\ordf{\leavevmode\raise1ex\hbox{\selectfonts\lllsize \underbar{a}}} \def\ordm{\leavevmode\raise1ex\hbox{\selectfonts\lllsize \underbar{o}}} % Dotless i and dotless j, used for accents. \def\imacro{i} \def\jmacro{j} \def\dotless#1{% \def\temp{#1}% \ifx\temp\imacro \ifmmode\imath \else\ptexi \fi \else\ifx\temp\jmacro \ifmmode\jmath \else\j \fi \else \errmessage{@dotless can be used only with i or j}% \fi\fi } % The \TeX{} logo, as in plain, but resetting the spacing so that a % period following counts as ending a sentence. (Idea found in latex.) % \edef\TeX{\TeX \spacefactor=1000 } % @LaTeX{} logo. Not quite the same results as the definition in % latex.ltx, since we use a different font for the raised A; it's most % convenient for us to use an explicitly smaller font, rather than using % the \scriptstyle font (since we don't reset \scriptstyle and % \scriptscriptstyle). % \def\LaTeX{% L\kern-.36em {\setbox0=\hbox{T}% \vbox to \ht0{\hbox{% \ifx\textnominalsize\xwordpt % for 10pt running text, \lllsize (8pt) is too small for the A in LaTeX. % Revert to plain's \scriptsize, which is 7pt. \count255=\the\fam $\fam\count255 \scriptstyle A$% \else % For 11pt, we can use our lllsize. \selectfonts\lllsize A% \fi }% \vss }}% \kern-.15em \TeX } % Some math mode symbols. \def\bullet{$\ptexbullet$} \def\geq{\ifmmode \ge\else $\ge$\fi} \def\leq{\ifmmode \le\else $\le$\fi} \def\minus{\ifmmode -\else $-$\fi} % @dots{} outputs an ellipsis using the current font. % We do .5em per period so that it has the same spacing in the cm % typewriter fonts as three actual period characters; on the other hand, % in other typewriter fonts three periods are wider than 1.5em. So do % whichever is larger. % \def\dots{% \leavevmode \setbox0=\hbox{...}% get width of three periods \ifdim\wd0 > 1.5em \dimen0 = \wd0 \else \dimen0 = 1.5em \fi \hbox to \dimen0{% \hskip 0pt plus.25fil .\hskip 0pt plus1fil .\hskip 0pt plus1fil .\hskip 0pt plus.5fil }% } % @enddots{} is an end-of-sentence ellipsis. % \def\enddots{% \dots \spacefactor=\endofsentencespacefactor } % @point{}, @result{}, @expansion{}, @print{}, @equiv{}. % % Since these characters are used in examples, they should be an even number of % \tt widths. Each \tt character is 1en, so two makes it 1em. % \def\point{$\star$} \def\arrow{\leavevmode\raise.05ex\hbox to 1em{\hfil$\rightarrow$\hfil}} \def\result{\leavevmode\raise.05ex\hbox to 1em{\hfil$\Rightarrow$\hfil}} \def\expansion{\leavevmode\hbox to 1em{\hfil$\mapsto$\hfil}} \def\print{\leavevmode\lower.1ex\hbox to 1em{\hfil$\dashv$\hfil}} \def\equiv{\leavevmode\hbox to 1em{\hfil$\ptexequiv$\hfil}} % The @error{} command. % Adapted from the TeXbook's \boxit. % \newbox\errorbox % {\tentt \global\dimen0 = 3em}% Width of the box. \dimen2 = .55pt % Thickness of rules % The text. (`r' is open on the right, `e' somewhat less so on the left.) \setbox0 = \hbox{\kern-.75pt \reducedsf \putworderror\kern-1.5pt} % \setbox\errorbox=\hbox to \dimen0{\hfil \hsize = \dimen0 \advance\hsize by -5.8pt % Space to left+right. \advance\hsize by -2\dimen2 % Rules. \vbox{% \hrule height\dimen2 \hbox{\vrule width\dimen2 \kern3pt % Space to left of text. \vtop{\kern2.4pt \box0 \kern2.4pt}% Space above/below. \kern3pt\vrule width\dimen2}% Space to right. \hrule height\dimen2} \hfil} % \def\error{\leavevmode\lower.7ex\copy\errorbox} % @pounds{} is a sterling sign, which Knuth put in the CM italic font. % \def\pounds{{\it\$}} % @euro{} comes from a separate font, depending on the current style. % We use the free feym* fonts from the eurosym package by Henrik % Theiling, which support regular, slanted, bold and bold slanted (and % "outlined" (blackboard board, sort of) versions, which we don't need). % It is available from http://www.ctan.org/tex-archive/fonts/eurosym. % % Although only regular is the truly official Euro symbol, we ignore % that. The Euro is designed to be slightly taller than the regular % font height. % % feymr - regular % feymo - slanted % feybr - bold % feybo - bold slanted % % There is no good (free) typewriter version, to my knowledge. % A feymr10 euro is ~7.3pt wide, while a normal cmtt10 char is ~5.25pt wide. % Hmm. % % Also doesn't work in math. Do we need to do math with euro symbols? % Hope not. % % \def\euro{{\eurofont e}} \def\eurofont{% % We set the font at each command, rather than predefining it in % \textfonts and the other font-switching commands, so that % installations which never need the symbol don't have to have the % font installed. % % There is only one designed size (nominal 10pt), so we always scale % that to the current nominal size. % % By the way, simply using "at 1em" works for cmr10 and the like, but % does not work for cmbx10 and other extended/shrunken fonts. % \def\eurosize{\csname\curfontsize nominalsize\endcsname}% % \ifx\curfontstyle\bfstylename % bold: \font\thiseurofont = \ifusingit{feybo10}{feybr10} at \eurosize \else % regular: \font\thiseurofont = \ifusingit{feymo10}{feymr10} at \eurosize \fi \thiseurofont } % Glyphs from the EC fonts. We don't use \let for the aliases, because % sometimes we redefine the original macro, and the alias should reflect % the redefinition. % % Use LaTeX names for the Icelandic letters. \def\DH{{\ecfont \char"D0}} % Eth \def\dh{{\ecfont \char"F0}} % eth \def\TH{{\ecfont \char"DE}} % Thorn \def\th{{\ecfont \char"FE}} % thorn % \def\guillemetleft{{\ecfont \char"13}} \def\guillemotleft{\guillemetleft} \def\guillemetright{{\ecfont \char"14}} \def\guillemotright{\guillemetright} \def\guilsinglleft{{\ecfont \char"0E}} \def\guilsinglright{{\ecfont \char"0F}} \def\quotedblbase{{\ecfont \char"12}} \def\quotesinglbase{{\ecfont \char"0D}} % % This positioning is not perfect (see the ogonek LaTeX package), but % we have the precomposed glyphs for the most common cases. We put the % tests to use those glyphs in the single \ogonek macro so we have fewer % dummy definitions to worry about for index entries, etc. % % ogonek is also used with other letters in Lithuanian (IOU), but using % the precomposed glyphs for those is not so easy since they aren't in % the same EC font. \def\ogonek#1{{% \def\temp{#1}% \ifx\temp\macrocharA\Aogonek \else\ifx\temp\macrochara\aogonek \else\ifx\temp\macrocharE\Eogonek \else\ifx\temp\macrochare\eogonek \else \ecfont \setbox0=\hbox{#1}% \ifdim\ht0=1ex\accent"0C #1% \else\ooalign{\unhbox0\crcr\hidewidth\char"0C \hidewidth}% \fi \fi\fi\fi\fi }% } \def\Aogonek{{\ecfont \char"81}}\def\macrocharA{A} \def\aogonek{{\ecfont \char"A1}}\def\macrochara{a} \def\Eogonek{{\ecfont \char"86}}\def\macrocharE{E} \def\eogonek{{\ecfont \char"A6}}\def\macrochare{e} % % Use the ec* fonts (cm-super in outline format) for non-CM glyphs. \def\ecfont{% % We can't distinguish serif/sans and italic/slanted, but this % is used for crude hacks anyway (like adding French and German % quotes to documents typeset with CM, where we lose kerning), so % hopefully nobody will notice/care. \edef\ecsize{\csname\curfontsize ecsize\endcsname}% \edef\nominalsize{\csname\curfontsize nominalsize\endcsname}% \ifmonospace % typewriter: \font\thisecfont = ectt\ecsize \space at \nominalsize \else \ifx\curfontstyle\bfstylename % bold: \font\thisecfont = ecb\ifusingit{i}{x}\ecsize \space at \nominalsize \else % regular: \font\thisecfont = ec\ifusingit{ti}{rm}\ecsize \space at \nominalsize \fi \fi \thisecfont } % @registeredsymbol - R in a circle. The font for the R should really % be smaller yet, but lllsize is the best we can do for now. % Adapted from the plain.tex definition of \copyright. % \def\registeredsymbol{% $^{{\ooalign{\hfil\raise.07ex\hbox{\selectfonts\lllsize R}% \hfil\crcr\Orb}}% }$% } % @textdegree - the normal degrees sign. % \def\textdegree{$^\circ$} % Laurent Siebenmann reports \Orb undefined with: % Textures 1.7.7 (preloaded format=plain 93.10.14) (68K) 16 APR 2004 02:38 % so we'll define it if necessary. % \ifx\Orb\thisisundefined \def\Orb{\mathhexbox20D} \fi % Quotes. \chardef\quotedblleft="5C \chardef\quotedblright=`\" \chardef\quoteleft=`\` \chardef\quoteright=`\' \message{page headings,} \newskip\titlepagetopglue \titlepagetopglue = 1.5in \newskip\titlepagebottomglue \titlepagebottomglue = 2pc % First the title page. Must do @settitle before @titlepage. \newif\ifseenauthor \newif\iffinishedtitlepage % Do an implicit @contents or @shortcontents after @end titlepage if the % user says @setcontentsaftertitlepage or @setshortcontentsaftertitlepage. % \newif\ifsetcontentsaftertitlepage \let\setcontentsaftertitlepage = \setcontentsaftertitlepagetrue \newif\ifsetshortcontentsaftertitlepage \let\setshortcontentsaftertitlepage = \setshortcontentsaftertitlepagetrue \parseargdef\shorttitlepage{% \begingroup \hbox{}\vskip 1.5in \chaprm \centerline{#1}% \endgroup\page\hbox{}\page} \envdef\titlepage{% % Open one extra group, as we want to close it in the middle of \Etitlepage. \begingroup \parindent=0pt \textfonts % Leave some space at the very top of the page. \vglue\titlepagetopglue % No rule at page bottom unless we print one at the top with @title. \finishedtitlepagetrue % % Most title ``pages'' are actually two pages long, with space % at the top of the second. We don't want the ragged left on the second. \let\oldpage = \page \def\page{% \iffinishedtitlepage\else \finishtitlepage \fi \let\page = \oldpage \page \null }% } \def\Etitlepage{% \iffinishedtitlepage\else \finishtitlepage \fi % It is important to do the page break before ending the group, % because the headline and footline are only empty inside the group. % If we use the new definition of \page, we always get a blank page % after the title page, which we certainly don't want. \oldpage \endgroup % % Need this before the \...aftertitlepage checks so that if they are % in effect the toc pages will come out with page numbers. \HEADINGSon % % If they want short, they certainly want long too. \ifsetshortcontentsaftertitlepage \shortcontents \contents \global\let\shortcontents = \relax \global\let\contents = \relax \fi % \ifsetcontentsaftertitlepage \contents \global\let\contents = \relax \global\let\shortcontents = \relax \fi } \def\finishtitlepage{% \vskip4pt \hrule height 2pt width \hsize \vskip\titlepagebottomglue \finishedtitlepagetrue } % Settings used for typesetting titles: no hyphenation, no indentation, % don't worry much about spacing, ragged right. This should be used % inside a \vbox, and fonts need to be set appropriately first. Because % it is always used for titles, nothing else, we call \rmisbold. \par % should be specified before the end of the \vbox, since a vbox is a group. % \def\raggedtitlesettings{% \rmisbold \hyphenpenalty=10000 \parindent=0pt \tolerance=5000 \ptexraggedright } % Macros to be used within @titlepage: \let\subtitlerm=\tenrm \def\subtitlefont{\subtitlerm \normalbaselineskip = 13pt \normalbaselines} \parseargdef\title{% \checkenv\titlepage \vbox{\titlefonts \raggedtitlesettings #1\par}% % print a rule at the page bottom also. \finishedtitlepagefalse \vskip4pt \hrule height 4pt width \hsize \vskip4pt } \parseargdef\subtitle{% \checkenv\titlepage {\subtitlefont \rightline{#1}}% } % @author should come last, but may come many times. % It can also be used inside @quotation. % \parseargdef\author{% \def\temp{\quotation}% \ifx\thisenv\temp \def\quotationauthor{#1}% printed in \Equotation. \else \checkenv\titlepage \ifseenauthor\else \vskip 0pt plus 1filll \seenauthortrue \fi {\secfonts\rmisbold \leftline{#1}}% \fi } % Set up page headings and footings. \let\thispage=\folio \newtoks\evenheadline % headline on even pages \newtoks\oddheadline % headline on odd pages \newtoks\evenfootline % footline on even pages \newtoks\oddfootline % footline on odd pages % Now make TeX use those variables \headline={{\textfonts\rm \ifodd\pageno \the\oddheadline \else \the\evenheadline \fi}} \footline={{\textfonts\rm \ifodd\pageno \the\oddfootline \else \the\evenfootline \fi}\HEADINGShook} \let\HEADINGShook=\relax % Commands to set those variables. % For example, this is what @headings on does % @evenheading @thistitle|@thispage|@thischapter % @oddheading @thischapter|@thispage|@thistitle % @evenfooting @thisfile|| % @oddfooting ||@thisfile \def\evenheading{\parsearg\evenheadingxxx} \def\evenheadingxxx #1{\evenheadingyyy #1\|\|\|\|\finish} \def\evenheadingyyy #1\|#2\|#3\|#4\finish{% \global\evenheadline={\rlap{\centerline{#2}}\line{#1\hfil#3}}} \def\oddheading{\parsearg\oddheadingxxx} \def\oddheadingxxx #1{\oddheadingyyy #1\|\|\|\|\finish} \def\oddheadingyyy #1\|#2\|#3\|#4\finish{% \global\oddheadline={\rlap{\centerline{#2}}\line{#1\hfil#3}}} \parseargdef\everyheading{\oddheadingxxx{#1}\evenheadingxxx{#1}}% \def\evenfooting{\parsearg\evenfootingxxx} \def\evenfootingxxx #1{\evenfootingyyy #1\|\|\|\|\finish} \def\evenfootingyyy #1\|#2\|#3\|#4\finish{% \global\evenfootline={\rlap{\centerline{#2}}\line{#1\hfil#3}}} \def\oddfooting{\parsearg\oddfootingxxx} \def\oddfootingxxx #1{\oddfootingyyy #1\|\|\|\|\finish} \def\oddfootingyyy #1\|#2\|#3\|#4\finish{% \global\oddfootline = {\rlap{\centerline{#2}}\line{#1\hfil#3}}% % % Leave some space for the footline. Hopefully ok to assume % @evenfooting will not be used by itself. \global\advance\pageheight by -12pt \global\advance\vsize by -12pt } \parseargdef\everyfooting{\oddfootingxxx{#1}\evenfootingxxx{#1}} % @evenheadingmarks top \thischapter <- chapter at the top of a page % @evenheadingmarks bottom \thischapter <- chapter at the bottom of a page % % The same set of arguments for: % % @oddheadingmarks % @evenfootingmarks % @oddfootingmarks % @everyheadingmarks % @everyfootingmarks \def\evenheadingmarks{\headingmarks{even}{heading}} \def\oddheadingmarks{\headingmarks{odd}{heading}} \def\evenfootingmarks{\headingmarks{even}{footing}} \def\oddfootingmarks{\headingmarks{odd}{footing}} \def\everyheadingmarks#1 {\headingmarks{even}{heading}{#1} \headingmarks{odd}{heading}{#1} } \def\everyfootingmarks#1 {\headingmarks{even}{footing}{#1} \headingmarks{odd}{footing}{#1} } % #1 = even/odd, #2 = heading/footing, #3 = top/bottom. \def\headingmarks#1#2#3 {% \expandafter\let\expandafter\temp \csname get#3headingmarks\endcsname \global\expandafter\let\csname get#1#2marks\endcsname \temp } \everyheadingmarks bottom \everyfootingmarks bottom % @headings double turns headings on for double-sided printing. % @headings single turns headings on for single-sided printing. % @headings off turns them off. % @headings on same as @headings double, retained for compatibility. % @headings after turns on double-sided headings after this page. % @headings doubleafter turns on double-sided headings after this page. % @headings singleafter turns on single-sided headings after this page. % By default, they are off at the start of a document, % and turned `on' after @end titlepage. \def\headings #1 {\csname HEADINGS#1\endcsname} \def\headingsoff{% non-global headings elimination \evenheadline={\hfil}\evenfootline={\hfil}% \oddheadline={\hfil}\oddfootline={\hfil}% } \def\HEADINGSoff{{\globaldefs=1 \headingsoff}} % global setting \HEADINGSoff % it's the default % When we turn headings on, set the page number to 1. % For double-sided printing, put current file name in lower left corner, % chapter name on inside top of right hand pages, document % title on inside top of left hand pages, and page numbers on outside top % edge of all pages. \def\HEADINGSdouble{% \global\pageno=1 \global\evenfootline={\hfil} \global\oddfootline={\hfil} \global\evenheadline={\line{\folio\hfil\thistitle}} \global\oddheadline={\line{\thischapter\hfil\folio}} \global\let\contentsalignmacro = \chapoddpage } \let\contentsalignmacro = \chappager % For single-sided printing, chapter title goes across top left of page, % page number on top right. \def\HEADINGSsingle{% \global\pageno=1 \global\evenfootline={\hfil} \global\oddfootline={\hfil} \global\evenheadline={\line{\thischapter\hfil\folio}} \global\oddheadline={\line{\thischapter\hfil\folio}} \global\let\contentsalignmacro = \chappager } \def\HEADINGSon{\HEADINGSdouble} \def\HEADINGSafter{\let\HEADINGShook=\HEADINGSdoublex} \let\HEADINGSdoubleafter=\HEADINGSafter \def\HEADINGSdoublex{% \global\evenfootline={\hfil} \global\oddfootline={\hfil} \global\evenheadline={\line{\folio\hfil\thistitle}} \global\oddheadline={\line{\thischapter\hfil\folio}} \global\let\contentsalignmacro = \chapoddpage } \def\HEADINGSsingleafter{\let\HEADINGShook=\HEADINGSsinglex} \def\HEADINGSsinglex{% \global\evenfootline={\hfil} \global\oddfootline={\hfil} \global\evenheadline={\line{\thischapter\hfil\folio}} \global\oddheadline={\line{\thischapter\hfil\folio}} \global\let\contentsalignmacro = \chappager } % Subroutines used in generating headings % This produces Day Month Year style of output. % Only define if not already defined, in case a txi-??.tex file has set % up a different format (e.g., txi-cs.tex does this). \ifx\today\thisisundefined \def\today{% \number\day\space \ifcase\month \or\putwordMJan\or\putwordMFeb\or\putwordMMar\or\putwordMApr \or\putwordMMay\or\putwordMJun\or\putwordMJul\or\putwordMAug \or\putwordMSep\or\putwordMOct\or\putwordMNov\or\putwordMDec \fi \space\number\year} \fi % @settitle line... specifies the title of the document, for headings. % It generates no output of its own. \def\thistitle{\putwordNoTitle} \def\settitle{\parsearg{\gdef\thistitle}} \message{tables,} % Tables -- @table, @ftable, @vtable, @item(x). % default indentation of table text \newdimen\tableindent \tableindent=.8in % default indentation of @itemize and @enumerate text \newdimen\itemindent \itemindent=.3in % margin between end of table item and start of table text. \newdimen\itemmargin \itemmargin=.1in % used internally for \itemindent minus \itemmargin \newdimen\itemmax % Note @table, @ftable, and @vtable define @item, @itemx, etc., with % these defs. % They also define \itemindex % to index the item name in whatever manner is desired (perhaps none). \newif\ifitemxneedsnegativevskip \def\itemxpar{\par\ifitemxneedsnegativevskip\nobreak\vskip-\parskip\nobreak\fi} \def\internalBitem{\smallbreak \parsearg\itemzzz} \def\internalBitemx{\itemxpar \parsearg\itemzzz} \def\itemzzz #1{\begingroup % \advance\hsize by -\rightskip \advance\hsize by -\tableindent \setbox0=\hbox{\itemindicate{#1}}% \itemindex{#1}% \nobreak % This prevents a break before @itemx. % % If the item text does not fit in the space we have, put it on a line % by itself, and do not allow a page break either before or after that % line. We do not start a paragraph here because then if the next % command is, e.g., @kindex, the whatsit would get put into the % horizontal list on a line by itself, resulting in extra blank space. \ifdim \wd0>\itemmax % % Make this a paragraph so we get the \parskip glue and wrapping, % but leave it ragged-right. \begingroup \advance\leftskip by-\tableindent \advance\hsize by\tableindent \advance\rightskip by0pt plus1fil\relax \leavevmode\unhbox0\par \endgroup % % We're going to be starting a paragraph, but we don't want the % \parskip glue -- logically it's part of the @item we just started. \nobreak \vskip-\parskip % % Stop a page break at the \parskip glue coming up. However, if % what follows is an environment such as @example, there will be no % \parskip glue; then the negative vskip we just inserted would % cause the example and the item to crash together. So we use this % bizarre value of 10001 as a signal to \aboveenvbreak to insert % \parskip glue after all. Section titles are handled this way also. % \penalty 10001 \endgroup \itemxneedsnegativevskipfalse \else % The item text fits into the space. Start a paragraph, so that the % following text (if any) will end up on the same line. \noindent % Do this with kerns and \unhbox so that if there is a footnote in % the item text, it can migrate to the main vertical list and % eventually be printed. \nobreak\kern-\tableindent \dimen0 = \itemmax \advance\dimen0 by \itemmargin \advance\dimen0 by -\wd0 \unhbox0 \nobreak\kern\dimen0 \endgroup \itemxneedsnegativevskiptrue \fi } \def\item{\errmessage{@item while not in a list environment}} \def\itemx{\errmessage{@itemx while not in a list environment}} % @table, @ftable, @vtable. \envdef\table{% \let\itemindex\gobble \tablecheck{table}% } \envdef\ftable{% \def\itemindex ##1{\doind {fn}{\code{##1}}}% \tablecheck{ftable}% } \envdef\vtable{% \def\itemindex ##1{\doind {vr}{\code{##1}}}% \tablecheck{vtable}% } \def\tablecheck#1{% \ifnum \the\catcode`\^^M=\active \endgroup \errmessage{This command won't work in this context; perhaps the problem is that we are \inenvironment\thisenv}% \def\next{\doignore{#1}}% \else \let\next\tablex \fi \next } \def\tablex#1{% \def\itemindicate{#1}% \parsearg\tabley } \def\tabley#1{% {% \makevalueexpandable \edef\temp{\noexpand\tablez #1\space\space\space}% \expandafter }\temp \endtablez } \def\tablez #1 #2 #3 #4\endtablez{% \aboveenvbreak \ifnum 0#1>0 \advance \leftskip by #1\mil \fi \ifnum 0#2>0 \tableindent=#2\mil \fi \ifnum 0#3>0 \advance \rightskip by #3\mil \fi \itemmax=\tableindent \advance \itemmax by -\itemmargin \advance \leftskip by \tableindent \exdentamount=\tableindent \parindent = 0pt \parskip = \smallskipamount \ifdim \parskip=0pt \parskip=2pt \fi \let\item = \internalBitem \let\itemx = \internalBitemx } \def\Etable{\endgraf\afterenvbreak} \let\Eftable\Etable \let\Evtable\Etable \let\Eitemize\Etable \let\Eenumerate\Etable % This is the counter used by @enumerate, which is really @itemize \newcount \itemno \envdef\itemize{\parsearg\doitemize} \def\doitemize#1{% \aboveenvbreak \itemmax=\itemindent \advance\itemmax by -\itemmargin \advance\leftskip by \itemindent \exdentamount=\itemindent \parindent=0pt \parskip=\smallskipamount \ifdim\parskip=0pt \parskip=2pt \fi % % Try typesetting the item mark that if the document erroneously says % something like @itemize @samp (intending @table), there's an error % right away at the @itemize. It's not the best error message in the % world, but it's better than leaving it to the @item. This means if % the user wants an empty mark, they have to say @w{} not just @w. \def\itemcontents{#1}% \setbox0 = \hbox{\itemcontents}% % % @itemize with no arg is equivalent to @itemize @bullet. \ifx\itemcontents\empty\def\itemcontents{\bullet}\fi % \let\item=\itemizeitem } % Definition of @item while inside @itemize and @enumerate. % \def\itemizeitem{% \advance\itemno by 1 % for enumerations {\let\par=\endgraf \smallbreak}% reasonable place to break {% % If the document has an @itemize directly after a section title, a % \nobreak will be last on the list, and \sectionheading will have % done a \vskip-\parskip. In that case, we don't want to zero % parskip, or the item text will crash with the heading. On the % other hand, when there is normal text preceding the item (as there % usually is), we do want to zero parskip, or there would be too much % space. In that case, we won't have a \nobreak before. At least % that's the theory. \ifnum\lastpenalty<10000 \parskip=0in \fi \noindent \hbox to 0pt{\hss \itemcontents \kern\itemmargin}% % \vadjust{\penalty 1200}}% not good to break after first line of item. \flushcr } % \splitoff TOKENS\endmark defines \first to be the first token in % TOKENS, and \rest to be the remainder. % \def\splitoff#1#2\endmark{\def\first{#1}\def\rest{#2}}% % Allow an optional argument of an uppercase letter, lowercase letter, % or number, to specify the first label in the enumerated list. No % argument is the same as `1'. % \envparseargdef\enumerate{\enumeratey #1 \endenumeratey} \def\enumeratey #1 #2\endenumeratey{% % If we were given no argument, pretend we were given `1'. \def\thearg{#1}% \ifx\thearg\empty \def\thearg{1}\fi % % Detect if the argument is a single token. If so, it might be a % letter. Otherwise, the only valid thing it can be is a number. % (We will always have one token, because of the test we just made. % This is a good thing, since \splitoff doesn't work given nothing at % all -- the first parameter is undelimited.) \expandafter\splitoff\thearg\endmark \ifx\rest\empty % Only one token in the argument. It could still be anything. % A ``lowercase letter'' is one whose \lccode is nonzero. % An ``uppercase letter'' is one whose \lccode is both nonzero, and % not equal to itself. % Otherwise, we assume it's a number. % % We need the \relax at the end of the \ifnum lines to stop TeX from % continuing to look for a . % \ifnum\lccode\expandafter`\thearg=0\relax \numericenumerate % a number (we hope) \else % It's a letter. \ifnum\lccode\expandafter`\thearg=\expandafter`\thearg\relax \lowercaseenumerate % lowercase letter \else \uppercaseenumerate % uppercase letter \fi \fi \else % Multiple tokens in the argument. We hope it's a number. \numericenumerate \fi } % An @enumerate whose labels are integers. The starting integer is % given in \thearg. % \def\numericenumerate{% \itemno = \thearg \startenumeration{\the\itemno}% } % The starting (lowercase) letter is in \thearg. \def\lowercaseenumerate{% \itemno = \expandafter`\thearg \startenumeration{% % Be sure we're not beyond the end of the alphabet. \ifnum\itemno=0 \errmessage{No more lowercase letters in @enumerate; get a bigger alphabet}% \fi \char\lccode\itemno }% } % The starting (uppercase) letter is in \thearg. \def\uppercaseenumerate{% \itemno = \expandafter`\thearg \startenumeration{% % Be sure we're not beyond the end of the alphabet. \ifnum\itemno=0 \errmessage{No more uppercase letters in @enumerate; get a bigger alphabet} \fi \char\uccode\itemno }% } % Call \doitemize, adding a period to the first argument and supplying the % common last two arguments. Also subtract one from the initial value in % \itemno, since @item increments \itemno. % \def\startenumeration#1{% \advance\itemno by -1 \doitemize{#1.}\flushcr } % @alphaenumerate and @capsenumerate are abbreviations for giving an arg % to @enumerate. % \def\alphaenumerate{\enumerate{a}} \def\capsenumerate{\enumerate{A}} \def\Ealphaenumerate{\Eenumerate} \def\Ecapsenumerate{\Eenumerate} % @multitable macros % Amy Hendrickson, 8/18/94, 3/6/96 % % @multitable ... @end multitable will make as many columns as desired. % Contents of each column will wrap at width given in preamble. Width % can be specified either with sample text given in a template line, % or in percent of \hsize, the current width of text on page. % Table can continue over pages but will only break between lines. % To make preamble: % % Either define widths of columns in terms of percent of \hsize: % @multitable @columnfractions .25 .3 .45 % @item ... % % Numbers following @columnfractions are the percent of the total % current hsize to be used for each column. You may use as many % columns as desired. % Or use a template: % @multitable {Column 1 template} {Column 2 template} {Column 3 template} % @item ... % using the widest term desired in each column. % Each new table line starts with @item, each subsequent new column % starts with @tab. Empty columns may be produced by supplying @tab's % with nothing between them for as many times as empty columns are needed, % ie, @tab@tab@tab will produce two empty columns. % @item, @tab do not need to be on their own lines, but it will not hurt % if they are. % Sample multitable: % @multitable {Column 1 template} {Column 2 template} {Column 3 template} % @item first col stuff @tab second col stuff @tab third col % @item % first col stuff % @tab % second col stuff % @tab % third col % @item first col stuff @tab second col stuff % @tab Many paragraphs of text may be used in any column. % % They will wrap at the width determined by the template. % @item@tab@tab This will be in third column. % @end multitable % Default dimensions may be reset by user. % @multitableparskip is vertical space between paragraphs in table. % @multitableparindent is paragraph indent in table. % @multitablecolmargin is horizontal space to be left between columns. % @multitablelinespace is space to leave between table items, baseline % to baseline. % 0pt means it depends on current normal line spacing. % \newskip\multitableparskip \newskip\multitableparindent \newdimen\multitablecolspace \newskip\multitablelinespace \multitableparskip=0pt \multitableparindent=6pt \multitablecolspace=12pt \multitablelinespace=0pt % Macros used to set up halign preamble: % \let\endsetuptable\relax \def\xendsetuptable{\endsetuptable} \let\columnfractions\relax \def\xcolumnfractions{\columnfractions} \newif\ifsetpercent % #1 is the @columnfraction, usually a decimal number like .5, but might % be just 1. We just use it, whatever it is. % \def\pickupwholefraction#1 {% \global\advance\colcount by 1 \expandafter\xdef\csname col\the\colcount\endcsname{#1\hsize}% \setuptable } \newcount\colcount \def\setuptable#1{% \def\firstarg{#1}% \ifx\firstarg\xendsetuptable \let\go = \relax \else \ifx\firstarg\xcolumnfractions \global\setpercenttrue \else \ifsetpercent \let\go\pickupwholefraction \else \global\advance\colcount by 1 \setbox0=\hbox{#1\unskip\space}% Add a normal word space as a % separator; typically that is always in the input, anyway. \expandafter\xdef\csname col\the\colcount\endcsname{\the\wd0}% \fi \fi \ifx\go\pickupwholefraction % Put the argument back for the \pickupwholefraction call, so % we'll always have a period there to be parsed. \def\go{\pickupwholefraction#1}% \else \let\go = \setuptable \fi% \fi \go } % multitable-only commands. % % @headitem starts a heading row, which we typeset in bold. % Assignments have to be global since we are inside the implicit group % of an alignment entry. \everycr resets \everytab so we don't have to % undo it ourselves. \def\headitemfont{\b}% for people to use in the template row; not changeable \def\headitem{% \checkenv\multitable \crcr \global\everytab={\bf}% can't use \headitemfont since the parsing differs \the\everytab % for the first item }% % % A \tab used to include \hskip1sp. But then the space in a template % line is not enough. That is bad. So let's go back to just `&' until % we again encounter the problem the 1sp was intended to solve. % --karl, nathan@acm.org, 20apr99. \def\tab{\checkenv\multitable &\the\everytab}% % @multitable ... @end multitable definitions: % \newtoks\everytab % insert after every tab. % \envdef\multitable{% \vskip\parskip \startsavinginserts % % @item within a multitable starts a normal row. % We use \def instead of \let so that if one of the multitable entries % contains an @itemize, we don't choke on the \item (seen as \crcr aka % \endtemplate) expanding \doitemize. \def\item{\crcr}% % \tolerance=9500 \hbadness=9500 \setmultitablespacing \parskip=\multitableparskip \parindent=\multitableparindent \overfullrule=0pt \global\colcount=0 % \everycr = {% \noalign{% \global\everytab={}% \global\colcount=0 % Reset the column counter. % Check for saved footnotes, etc. \checkinserts % Keeps underfull box messages off when table breaks over pages. %\filbreak % Maybe so, but it also creates really weird page breaks when the % table breaks over pages. Wouldn't \vfil be better? Wait until the % problem manifests itself, so it can be fixed for real --karl. }% }% % \parsearg\domultitable } \def\domultitable#1{% % To parse everything between @multitable and @item: \setuptable#1 \endsetuptable % % This preamble sets up a generic column definition, which will % be used as many times as user calls for columns. % \vtop will set a single line and will also let text wrap and % continue for many paragraphs if desired. \halign\bgroup &% \global\advance\colcount by 1 \multistrut \vtop{% % Use the current \colcount to find the correct column width: \hsize=\expandafter\csname col\the\colcount\endcsname % % In order to keep entries from bumping into each other % we will add a \leftskip of \multitablecolspace to all columns after % the first one. % % If a template has been used, we will add \multitablecolspace % to the width of each template entry. % % If the user has set preamble in terms of percent of \hsize we will % use that dimension as the width of the column, and the \leftskip % will keep entries from bumping into each other. Table will start at % left margin and final column will justify at right margin. % % Make sure we don't inherit \rightskip from the outer environment. \rightskip=0pt \ifnum\colcount=1 % The first column will be indented with the surrounding text. \advance\hsize by\leftskip \else \ifsetpercent \else % If user has not set preamble in terms of percent of \hsize % we will advance \hsize by \multitablecolspace. \advance\hsize by \multitablecolspace \fi % In either case we will make \leftskip=\multitablecolspace: \leftskip=\multitablecolspace \fi % Ignoring space at the beginning and end avoids an occasional spurious % blank line, when TeX decides to break the line at the space before the % box from the multistrut, so the strut ends up on a line by itself. % For example: % @multitable @columnfractions .11 .89 % @item @code{#} % @tab Legal holiday which is valid in major parts of the whole country. % Is automatically provided with highlighting sequences respectively % marking characters. \noindent\ignorespaces##\unskip\multistrut }\cr } \def\Emultitable{% \crcr \egroup % end the \halign \global\setpercentfalse } \def\setmultitablespacing{% \def\multistrut{\strut}% just use the standard line spacing % % Compute \multitablelinespace (if not defined by user) for use in % \multitableparskip calculation. We used define \multistrut based on % this, but (ironically) that caused the spacing to be off. % See bug-texinfo report from Werner Lemberg, 31 Oct 2004 12:52:20 +0100. \ifdim\multitablelinespace=0pt \setbox0=\vbox{X}\global\multitablelinespace=\the\baselineskip \global\advance\multitablelinespace by-\ht0 \fi % Test to see if parskip is larger than space between lines of % table. If not, do nothing. % If so, set to same dimension as multitablelinespace. \ifdim\multitableparskip>\multitablelinespace \global\multitableparskip=\multitablelinespace \global\advance\multitableparskip-7pt % to keep parskip somewhat smaller % than skip between lines in the table. \fi% \ifdim\multitableparskip=0pt \global\multitableparskip=\multitablelinespace \global\advance\multitableparskip-7pt % to keep parskip somewhat smaller % than skip between lines in the table. \fi} \message{conditionals,} % @iftex, @ifnotdocbook, @ifnothtml, @ifnotinfo, @ifnotplaintext, % @ifnotxml always succeed. They currently do nothing; we don't % attempt to check whether the conditionals are properly nested. But we % have to remember that they are conditionals, so that @end doesn't % attempt to close an environment group. % \def\makecond#1{% \expandafter\let\csname #1\endcsname = \relax \expandafter\let\csname iscond.#1\endcsname = 1 } \makecond{iftex} \makecond{ifnotdocbook} \makecond{ifnothtml} \makecond{ifnotinfo} \makecond{ifnotplaintext} \makecond{ifnotxml} % Ignore @ignore, @ifhtml, @ifinfo, and the like. % \def\direntry{\doignore{direntry}} \def\documentdescription{\doignore{documentdescription}} \def\docbook{\doignore{docbook}} \def\html{\doignore{html}} \def\ifdocbook{\doignore{ifdocbook}} \def\ifhtml{\doignore{ifhtml}} \def\ifinfo{\doignore{ifinfo}} \def\ifnottex{\doignore{ifnottex}} \def\ifplaintext{\doignore{ifplaintext}} \def\ifxml{\doignore{ifxml}} \def\ignore{\doignore{ignore}} \def\menu{\doignore{menu}} \def\xml{\doignore{xml}} % Ignore text until a line `@end #1', keeping track of nested conditionals. % % A count to remember the depth of nesting. \newcount\doignorecount \def\doignore#1{\begingroup % Scan in ``verbatim'' mode: \obeylines \catcode`\@ = \other \catcode`\{ = \other \catcode`\} = \other % % Make sure that spaces turn into tokens that match what \doignoretext wants. \spaceisspace % % Count number of #1's that we've seen. \doignorecount = 0 % % Swallow text until we reach the matching `@end #1'. \dodoignore{#1}% } { \catcode`_=11 % We want to use \_STOP_ which cannot appear in texinfo source. \obeylines % % \gdef\dodoignore#1{% % #1 contains the command name as a string, e.g., `ifinfo'. % % Define a command to find the next `@end #1'. \long\def\doignoretext##1^^M@end #1{% \doignoretextyyy##1^^M@#1\_STOP_}% % % And this command to find another #1 command, at the beginning of a % line. (Otherwise, we would consider a line `@c @ifset', for % example, to count as an @ifset for nesting.) \long\def\doignoretextyyy##1^^M@#1##2\_STOP_{\doignoreyyy{##2}\_STOP_}% % % And now expand that command. \doignoretext ^^M% }% } \def\doignoreyyy#1{% \def\temp{#1}% \ifx\temp\empty % Nothing found. \let\next\doignoretextzzz \else % Found a nested condition, ... \advance\doignorecount by 1 \let\next\doignoretextyyy % ..., look for another. % If we're here, #1 ends with ^^M\ifinfo (for example). \fi \next #1% the token \_STOP_ is present just after this macro. } % We have to swallow the remaining "\_STOP_". % \def\doignoretextzzz#1{% \ifnum\doignorecount = 0 % We have just found the outermost @end. \let\next\enddoignore \else % Still inside a nested condition. \advance\doignorecount by -1 \let\next\doignoretext % Look for the next @end. \fi \next } % Finish off ignored text. { \obeylines% % Ignore anything after the last `@end #1'; this matters in verbatim % environments, where otherwise the newline after an ignored conditional % would result in a blank line in the output. \gdef\enddoignore#1^^M{\endgroup\ignorespaces}% } % @set VAR sets the variable VAR to an empty value. % @set VAR REST-OF-LINE sets VAR to the value REST-OF-LINE. % % Since we want to separate VAR from REST-OF-LINE (which might be % empty), we can't just use \parsearg; we have to insert a space of our % own to delimit the rest of the line, and then take it out again if we % didn't need it. % We rely on the fact that \parsearg sets \catcode`\ =10. % \parseargdef\set{\setyyy#1 \endsetyyy} \def\setyyy#1 #2\endsetyyy{% {% \makevalueexpandable \def\temp{#2}% \edef\next{\gdef\makecsname{SET#1}}% \ifx\temp\empty \next{}% \else \setzzz#2\endsetzzz \fi }% } % Remove the trailing space \setxxx inserted. \def\setzzz#1 \endsetzzz{\next{#1}} % @clear VAR clears (i.e., unsets) the variable VAR. % \parseargdef\clear{% {% \makevalueexpandable \global\expandafter\let\csname SET#1\endcsname=\relax }% } % @value{foo} gets the text saved in variable foo. \def\value{\begingroup\makevalueexpandable\valuexxx} \def\valuexxx#1{\expandablevalue{#1}\endgroup} { \catcode`\- = \active \catcode`\_ = \active % \gdef\makevalueexpandable{% \let\value = \expandablevalue % We don't want these characters active, ... \catcode`\-=\other \catcode`\_=\other % ..., but we might end up with active ones in the argument if % we're called from @code, as @code{@value{foo-bar_}}, though. % So \let them to their normal equivalents. \let-\normaldash \let_\normalunderscore } } % We have this subroutine so that we can handle at least some @value's % properly in indexes (we call \makevalueexpandable in \indexdummies). % The command has to be fully expandable (if the variable is set), since % the result winds up in the index file. This means that if the % variable's value contains other Texinfo commands, it's almost certain % it will fail (although perhaps we could fix that with sufficient work % to do a one-level expansion on the result, instead of complete). % \def\expandablevalue#1{% \expandafter\ifx\csname SET#1\endcsname\relax {[No value for ``#1'']}% \message{Variable `#1', used in @value, is not set.}% \else \csname SET#1\endcsname \fi } % @ifset VAR ... @end ifset reads the `...' iff VAR has been defined % with @set. % % To get special treatment of `@end ifset,' call \makeond and the redefine. % \makecond{ifset} \def\ifset{\parsearg{\doifset{\let\next=\ifsetfail}}} \def\doifset#1#2{% {% \makevalueexpandable \let\next=\empty \expandafter\ifx\csname SET#2\endcsname\relax #1% If not set, redefine \next. \fi \expandafter }\next } \def\ifsetfail{\doignore{ifset}} % @ifclear VAR ... @end executes the `...' iff VAR has never been % defined with @set, or has been undefined with @clear. % % The `\else' inside the `\doifset' parameter is a trick to reuse the % above code: if the variable is not set, do nothing, if it is set, % then redefine \next to \ifclearfail. % \makecond{ifclear} \def\ifclear{\parsearg{\doifset{\else \let\next=\ifclearfail}}} \def\ifclearfail{\doignore{ifclear}} % @ifcommandisdefined CMD ... @end executes the `...' if CMD (written % without the @) is in fact defined. We can only feasibly check at the % TeX level, so something like `mathcode' is going to considered % defined even though it is not a Texinfo command. % \makecond{ifcommanddefined} \def\ifcommanddefined{\parsearg{\doifcmddefined{\let\next=\ifcmddefinedfail}}} % \def\doifcmddefined#1#2{{% \makevalueexpandable \let\next=\empty \expandafter\ifx\csname #2\endcsname\relax #1% If not defined, \let\next as above. \fi \expandafter }\next } \def\ifcmddefinedfail{\doignore{ifcommanddefined}} % @ifcommandnotdefined CMD ... handled similar to @ifclear above. \makecond{ifcommandnotdefined} \def\ifcommandnotdefined{% \parsearg{\doifcmddefined{\else \let\next=\ifcmdnotdefinedfail}}} \def\ifcmdnotdefinedfail{\doignore{ifcommandnotdefined}} % Set the `txicommandconditionals' variable, so documents have a way to % test if the @ifcommand...defined conditionals are available. \set txicommandconditionals % @dircategory CATEGORY -- specify a category of the dir file % which this file should belong to. Ignore this in TeX. \let\dircategory=\comment % @defininfoenclose. \let\definfoenclose=\comment \message{indexing,} % Index generation facilities % Define \newwrite to be identical to plain tex's \newwrite % except not \outer, so it can be used within macros and \if's. \edef\newwrite{\makecsname{ptexnewwrite}} % \newindex {foo} defines an index named foo. % It automatically defines \fooindex such that % \fooindex ...rest of line... puts an entry in the index foo. % It also defines \fooindfile to be the number of the output channel for % the file that accumulates this index. The file's extension is foo. % The name of an index should be no more than 2 characters long % for the sake of vms. % \def\newindex#1{% \iflinks \expandafter\newwrite \csname#1indfile\endcsname \openout \csname#1indfile\endcsname \jobname.#1 % Open the file \fi \expandafter\xdef\csname#1index\endcsname{% % Define @#1index \noexpand\doindex{#1}} } % @defindex foo == \newindex{foo} % \def\defindex{\parsearg\newindex} % Define @defcodeindex, like @defindex except put all entries in @code. % \def\defcodeindex{\parsearg\newcodeindex} % \def\newcodeindex#1{% \iflinks \expandafter\newwrite \csname#1indfile\endcsname \openout \csname#1indfile\endcsname \jobname.#1 \fi \expandafter\xdef\csname#1index\endcsname{% \noexpand\docodeindex{#1}}% } % @synindex foo bar makes index foo feed into index bar. % Do this instead of @defindex foo if you don't want it as a separate index. % % @syncodeindex foo bar similar, but put all entries made for index foo % inside @code. % \def\synindex#1 #2 {\dosynindex\doindex{#1}{#2}} \def\syncodeindex#1 #2 {\dosynindex\docodeindex{#1}{#2}} % #1 is \doindex or \docodeindex, #2 the index getting redefined (foo), % #3 the target index (bar). \def\dosynindex#1#2#3{% % Only do \closeout if we haven't already done it, else we'll end up % closing the target index. \expandafter \ifx\csname donesynindex#2\endcsname \relax % The \closeout helps reduce unnecessary open files; the limit on the % Acorn RISC OS is a mere 16 files. \expandafter\closeout\csname#2indfile\endcsname \expandafter\let\csname donesynindex#2\endcsname = 1 \fi % redefine \fooindfile: \expandafter\let\expandafter\temp\expandafter=\csname#3indfile\endcsname \expandafter\let\csname#2indfile\endcsname=\temp % redefine \fooindex: \expandafter\xdef\csname#2index\endcsname{\noexpand#1{#3}}% } % Define \doindex, the driver for all \fooindex macros. % Argument #1 is generated by the calling \fooindex macro, % and it is "foo", the name of the index. % \doindex just uses \parsearg; it calls \doind for the actual work. % This is because \doind is more useful to call from other macros. % There is also \dosubind {index}{topic}{subtopic} % which makes an entry in a two-level index such as the operation index. \def\doindex#1{\edef\indexname{#1}\parsearg\singleindexer} \def\singleindexer #1{\doind{\indexname}{#1}} % like the previous two, but they put @code around the argument. \def\docodeindex#1{\edef\indexname{#1}\parsearg\singlecodeindexer} \def\singlecodeindexer #1{\doind{\indexname}{\code{#1}}} % Take care of Texinfo commands that can appear in an index entry. % Since there are some commands we want to expand, and others we don't, % we have to laboriously prevent expansion for those that we don't. % \def\indexdummies{% \escapechar = `\\ % use backslash in output files. \def\@{@}% change to @@ when we switch to @ as escape char in index files. \def\ {\realbackslash\space }% % % Need these unexpandable (because we define \tt as a dummy) % definitions when @{ or @} appear in index entry text. Also, more % complicated, when \tex is in effect and \{ is a \delimiter again. % We can't use \lbracecmd and \rbracecmd because texindex assumes % braces and backslashes are used only as delimiters. Perhaps we % should define @lbrace and @rbrace commands a la @comma. \def\{{{\tt\char123}}% \def\}{{\tt\char125}}% % % I don't entirely understand this, but when an index entry is % generated from a macro call, the \endinput which \scanmacro inserts % causes processing to be prematurely terminated. This is, % apparently, because \indexsorttmp is fully expanded, and \endinput % is an expandable command. The redefinition below makes \endinput % disappear altogether for that purpose -- although logging shows that % processing continues to some further point. On the other hand, it % seems \endinput does not hurt in the printed index arg, since that % is still getting written without apparent harm. % % Sample source (mac-idx3.tex, reported by Graham Percival to % help-texinfo, 22may06): % @macro funindex {WORD} % @findex xyz % @end macro % ... % @funindex commtest % % The above is not enough to reproduce the bug, but it gives the flavor. % % Sample whatsit resulting: % .@write3{\entry{xyz}{@folio }{@code {xyz@endinput }}} % % So: \let\endinput = \empty % % Do the redefinitions. \commondummies } % For the aux and toc files, @ is the escape character. So we want to % redefine everything using @ as the escape character (instead of % \realbackslash, still used for index files). When everything uses @, % this will be simpler. % \def\atdummies{% \def\@{@@}% \def\ {@ }% \let\{ = \lbraceatcmd \let\} = \rbraceatcmd % % Do the redefinitions. \commondummies \otherbackslash } % Called from \indexdummies and \atdummies. % \def\commondummies{% % % \definedummyword defines \#1 as \string\#1\space, thus effectively % preventing its expansion. This is used only for control words, % not control letters, because the \space would be incorrect for % control characters, but is needed to separate the control word % from whatever follows. % % For control letters, we have \definedummyletter, which omits the % space. % % These can be used both for control words that take an argument and % those that do not. If it is followed by {arg} in the input, then % that will dutifully get written to the index (or wherever). % \def\definedummyword ##1{\def##1{\string##1\space}}% \def\definedummyletter##1{\def##1{\string##1}}% \let\definedummyaccent\definedummyletter % \commondummiesnofonts % \definedummyletter\_% \definedummyletter\-% % % Non-English letters. \definedummyword\AA \definedummyword\AE \definedummyword\DH \definedummyword\L \definedummyword\O \definedummyword\OE \definedummyword\TH \definedummyword\aa \definedummyword\ae \definedummyword\dh \definedummyword\exclamdown \definedummyword\l \definedummyword\o \definedummyword\oe \definedummyword\ordf \definedummyword\ordm \definedummyword\questiondown \definedummyword\ss \definedummyword\th % % Although these internal commands shouldn't show up, sometimes they do. \definedummyword\bf \definedummyword\gtr \definedummyword\hat \definedummyword\less \definedummyword\sf \definedummyword\sl \definedummyword\tclose \definedummyword\tt % \definedummyword\LaTeX \definedummyword\TeX % % Assorted special characters. \definedummyword\arrow \definedummyword\bullet \definedummyword\comma \definedummyword\copyright \definedummyword\registeredsymbol \definedummyword\dots \definedummyword\enddots \definedummyword\entrybreak \definedummyword\equiv \definedummyword\error \definedummyword\euro \definedummyword\expansion \definedummyword\geq \definedummyword\guillemetleft \definedummyword\guillemetright \definedummyword\guilsinglleft \definedummyword\guilsinglright \definedummyword\lbracechar \definedummyword\leq \definedummyword\minus \definedummyword\ogonek \definedummyword\pounds \definedummyword\point \definedummyword\print \definedummyword\quotedblbase \definedummyword\quotedblleft \definedummyword\quotedblright \definedummyword\quoteleft \definedummyword\quoteright \definedummyword\quotesinglbase \definedummyword\rbracechar \definedummyword\result \definedummyword\textdegree % % We want to disable all macros so that they are not expanded by \write. \macrolist % \normalturnoffactive % % Handle some cases of @value -- where it does not contain any % (non-fully-expandable) commands. \makevalueexpandable } % \commondummiesnofonts: common to \commondummies and \indexnofonts. % \def\commondummiesnofonts{% % Control letters and accents. \definedummyletter\!% \definedummyaccent\"% \definedummyaccent\'% \definedummyletter\*% \definedummyaccent\,% \definedummyletter\.% \definedummyletter\/% \definedummyletter\:% \definedummyaccent\=% \definedummyletter\?% \definedummyaccent\^% \definedummyaccent\`% \definedummyaccent\~% \definedummyword\u \definedummyword\v \definedummyword\H \definedummyword\dotaccent \definedummyword\ogonek \definedummyword\ringaccent \definedummyword\tieaccent \definedummyword\ubaraccent \definedummyword\udotaccent \definedummyword\dotless % % Texinfo font commands. \definedummyword\b \definedummyword\i \definedummyword\r \definedummyword\sansserif \definedummyword\sc \definedummyword\slanted \definedummyword\t % % Commands that take arguments. \definedummyword\abbr \definedummyword\acronym \definedummyword\anchor \definedummyword\cite \definedummyword\code \definedummyword\command \definedummyword\dfn \definedummyword\dmn \definedummyword\email \definedummyword\emph \definedummyword\env \definedummyword\file \definedummyword\image \definedummyword\indicateurl \definedummyword\inforef \definedummyword\kbd \definedummyword\key \definedummyword\math \definedummyword\option \definedummyword\pxref \definedummyword\ref \definedummyword\samp \definedummyword\strong \definedummyword\tie \definedummyword\uref \definedummyword\url \definedummyword\var \definedummyword\verb \definedummyword\w \definedummyword\xref } % \indexnofonts is used when outputting the strings to sort the index % by, and when constructing control sequence names. It eliminates all % control sequences and just writes whatever the best ASCII sort string % would be for a given command (usually its argument). % \def\indexnofonts{% % Accent commands should become @asis. \def\definedummyaccent##1{\let##1\asis}% % We can just ignore other control letters. \def\definedummyletter##1{\let##1\empty}% % All control words become @asis by default; overrides below. \let\definedummyword\definedummyaccent % \commondummiesnofonts % % Don't no-op \tt, since it isn't a user-level command % and is used in the definitions of the active chars like <, >, |, etc. % Likewise with the other plain tex font commands. %\let\tt=\asis % \def\ { }% \def\@{@}% \def\_{\normalunderscore}% \def\-{}% @- shouldn't affect sorting % % Unfortunately, texindex is not prepared to handle braces in the % content at all. So for index sorting, we map @{ and @} to strings % starting with |, since that ASCII character is between ASCII { and }. \def\{{|a}% \def\lbracechar{|a}% % \def\}{|b}% \def\rbracechar{|b}% % % Non-English letters. \def\AA{AA}% \def\AE{AE}% \def\DH{DZZ}% \def\L{L}% \def\OE{OE}% \def\O{O}% \def\TH{ZZZ}% \def\aa{aa}% \def\ae{ae}% \def\dh{dzz}% \def\exclamdown{!}% \def\l{l}% \def\oe{oe}% \def\ordf{a}% \def\ordm{o}% \def\o{o}% \def\questiondown{?}% \def\ss{ss}% \def\th{zzz}% % \def\LaTeX{LaTeX}% \def\TeX{TeX}% % % Assorted special characters. % (The following {} will end up in the sort string, but that's ok.) \def\arrow{->}% \def\bullet{bullet}% \def\comma{,}% \def\copyright{copyright}% \def\dots{...}% \def\enddots{...}% \def\equiv{==}% \def\error{error}% \def\euro{euro}% \def\expansion{==>}% \def\geq{>=}% \def\guillemetleft{<<}% \def\guillemetright{>>}% \def\guilsinglleft{<}% \def\guilsinglright{>}% \def\leq{<=}% \def\minus{-}% \def\point{.}% \def\pounds{pounds}% \def\print{-|}% \def\quotedblbase{"}% \def\quotedblleft{"}% \def\quotedblright{"}% \def\quoteleft{`}% \def\quoteright{'}% \def\quotesinglbase{,}% \def\registeredsymbol{R}% \def\result{=>}% \def\textdegree{o}% % \expandafter\ifx\csname SETtxiindexlquoteignore\endcsname\relax \else \indexlquoteignore \fi % % We need to get rid of all macros, leaving only the arguments (if present). % Of course this is not nearly correct, but it is the best we can do for now. % makeinfo does not expand macros in the argument to @deffn, which ends up % writing an index entry, and texindex isn't prepared for an index sort entry % that starts with \. % % Since macro invocations are followed by braces, we can just redefine them % to take a single TeX argument. The case of a macro invocation that % goes to end-of-line is not handled. % \macrolist } % Undocumented (for FSFS 2nd ed.): @set txiindexlquoteignore makes us % ignore left quotes in the sort term. {\catcode`\`=\active \gdef\indexlquoteignore{\let`=\empty}} \let\indexbackslash=0 %overridden during \printindex. \let\SETmarginindex=\relax % put index entries in margin (undocumented)? % Most index entries go through here, but \dosubind is the general case. % #1 is the index name, #2 is the entry text. \def\doind#1#2{\dosubind{#1}{#2}{}} % Workhorse for all \fooindexes. % #1 is name of index, #2 is stuff to put there, #3 is subentry -- % empty if called from \doind, as we usually are (the main exception % is with most defuns, which call us directly). % \def\dosubind#1#2#3{% \iflinks {% % Store the main index entry text (including the third arg). \toks0 = {#2}% % If third arg is present, precede it with a space. \def\thirdarg{#3}% \ifx\thirdarg\empty \else \toks0 = \expandafter{\the\toks0 \space #3}% \fi % \edef\writeto{\csname#1indfile\endcsname}% % \safewhatsit\dosubindwrite }% \fi } % Write the entry in \toks0 to the index file: % \def\dosubindwrite{% % Put the index entry in the margin if desired. \ifx\SETmarginindex\relax\else \insert\margin{\hbox{\vrule height8pt depth3pt width0pt \the\toks0}}% \fi % % Remember, we are within a group. \indexdummies % Must do this here, since \bf, etc expand at this stage \def\backslashcurfont{\indexbackslash}% \indexbackslash isn't defined now % so it will be output as is; and it will print as backslash. % % Process the index entry with all font commands turned off, to % get the string to sort by. {\indexnofonts \edef\temp{\the\toks0}% need full expansion \xdef\indexsorttmp{\temp}% }% % % Set up the complete index entry, with both the sort key and % the original text, including any font commands. We write % three arguments to \entry to the .?? file (four in the % subentry case), texindex reduces to two when writing the .??s % sorted result. \edef\temp{% \write\writeto{% \string\entry{\indexsorttmp}{\noexpand\folio}{\the\toks0}}% }% \temp } % Take care of unwanted page breaks/skips around a whatsit: % % If a skip is the last thing on the list now, preserve it % by backing up by \lastskip, doing the \write, then inserting % the skip again. Otherwise, the whatsit generated by the % \write or \pdfdest will make \lastskip zero. The result is that % sequences like this: % @end defun % @tindex whatever % @defun ... % will have extra space inserted, because the \medbreak in the % start of the @defun won't see the skip inserted by the @end of % the previous defun. % % But don't do any of this if we're not in vertical mode. We % don't want to do a \vskip and prematurely end a paragraph. % % Avoid page breaks due to these extra skips, too. % % But wait, there is a catch there: % We'll have to check whether \lastskip is zero skip. \ifdim is not % sufficient for this purpose, as it ignores stretch and shrink parts % of the skip. The only way seems to be to check the textual % representation of the skip. % % The following is almost like \def\zeroskipmacro{0.0pt} except that % the ``p'' and ``t'' characters have catcode \other, not 11 (letter). % \edef\zeroskipmacro{\expandafter\the\csname z@skip\endcsname} % \newskip\whatsitskip \newcount\whatsitpenalty % % ..., ready, GO: % \def\safewhatsit#1{\ifhmode #1% \else % \lastskip and \lastpenalty cannot both be nonzero simultaneously. \whatsitskip = \lastskip \edef\lastskipmacro{\the\lastskip}% \whatsitpenalty = \lastpenalty % % If \lastskip is nonzero, that means the last item was a % skip. And since a skip is discardable, that means this % -\whatsitskip glue we're inserting is preceded by a % non-discardable item, therefore it is not a potential % breakpoint, therefore no \nobreak needed. \ifx\lastskipmacro\zeroskipmacro \else \vskip-\whatsitskip \fi % #1% % \ifx\lastskipmacro\zeroskipmacro % If \lastskip was zero, perhaps the last item was a penalty, and % perhaps it was >=10000, e.g., a \nobreak. In that case, we want % to re-insert the same penalty (values >10000 are used for various % signals); since we just inserted a non-discardable item, any % following glue (such as a \parskip) would be a breakpoint. For example: % @deffn deffn-whatever % @vindex index-whatever % Description. % would allow a break between the index-whatever whatsit % and the "Description." paragraph. \ifnum\whatsitpenalty>9999 \penalty\whatsitpenalty \fi \else % On the other hand, if we had a nonzero \lastskip, % this make-up glue would be preceded by a non-discardable item % (the whatsit from the \write), so we must insert a \nobreak. \nobreak\vskip\whatsitskip \fi \fi} % The index entry written in the file actually looks like % \entry {sortstring}{page}{topic} % or % \entry {sortstring}{page}{topic}{subtopic} % The texindex program reads in these files and writes files % containing these kinds of lines: % \initial {c} % before the first topic whose initial is c % \entry {topic}{pagelist} % for a topic that is used without subtopics % \primary {topic} % for the beginning of a topic that is used with subtopics % \secondary {subtopic}{pagelist} % for each subtopic. % Define the user-accessible indexing commands % @findex, @vindex, @kindex, @cindex. \def\findex {\fnindex} \def\kindex {\kyindex} \def\cindex {\cpindex} \def\vindex {\vrindex} \def\tindex {\tpindex} \def\pindex {\pgindex} \def\cindexsub {\begingroup\obeylines\cindexsub} {\obeylines % \gdef\cindexsub "#1" #2^^M{\endgroup % \dosubind{cp}{#2}{#1}}} % Define the macros used in formatting output of the sorted index material. % @printindex causes a particular index (the ??s file) to get printed. % It does not print any chapter heading (usually an @unnumbered). % \parseargdef\printindex{\begingroup \dobreak \chapheadingskip{10000}% % \smallfonts \rm \tolerance = 9500 \plainfrenchspacing \everypar = {}% don't want the \kern\-parindent from indentation suppression. % % See if the index file exists and is nonempty. % Change catcode of @ here so that if the index file contains % \initial {@} % as its first line, TeX doesn't complain about mismatched braces % (because it thinks @} is a control sequence). \catcode`\@ = 11 \openin 1 \jobname.#1s \ifeof 1 % \enddoublecolumns gets confused if there is no text in the index, % and it loses the chapter title and the aux file entries for the % index. The easiest way to prevent this problem is to make sure % there is some text. \putwordIndexNonexistent \else % % If the index file exists but is empty, then \openin leaves \ifeof % false. We have to make TeX try to read something from the file, so % it can discover if there is anything in it. \read 1 to \temp \ifeof 1 \putwordIndexIsEmpty \else % Index files are almost Texinfo source, but we use \ as the escape % character. It would be better to use @, but that's too big a change % to make right now. \def\indexbackslash{\backslashcurfont}% \catcode`\\ = 0 \escapechar = `\\ \begindoublecolumns \input \jobname.#1s \enddoublecolumns \fi \fi \closein 1 \endgroup} % These macros are used by the sorted index file itself. % Change them to control the appearance of the index. \def\initial#1{{% % Some minor font changes for the special characters. \let\tentt=\sectt \let\tt=\sectt \let\sf=\sectt % % Remove any glue we may have, we'll be inserting our own. \removelastskip % % We like breaks before the index initials, so insert a bonus. \nobreak \vskip 0pt plus 3\baselineskip \penalty 0 \vskip 0pt plus -3\baselineskip % % Typeset the initial. Making this add up to a whole number of % baselineskips increases the chance of the dots lining up from column % to column. It still won't often be perfect, because of the stretch % we need before each entry, but it's better. % % No shrink because it confuses \balancecolumns. \vskip 1.67\baselineskip plus .5\baselineskip \leftline{\secbf #1}% % Do our best not to break after the initial. \nobreak \vskip .33\baselineskip plus .1\baselineskip }} % \entry typesets a paragraph consisting of the text (#1), dot leaders, and % then page number (#2) flushed to the right margin. It is used for index % and table of contents entries. The paragraph is indented by \leftskip. % % A straightforward implementation would start like this: % \def\entry#1#2{... % But this freezes the catcodes in the argument, and can cause problems to % @code, which sets - active. This problem was fixed by a kludge--- % ``-'' was active throughout whole index, but this isn't really right. % The right solution is to prevent \entry from swallowing the whole text. % --kasal, 21nov03 \def\entry{% \begingroup % % Start a new paragraph if necessary, so our assignments below can't % affect previous text. \par % % Do not fill out the last line with white space. \parfillskip = 0in % % No extra space above this paragraph. \parskip = 0in % % Do not prefer a separate line ending with a hyphen to fewer lines. \finalhyphendemerits = 0 % % \hangindent is only relevant when the entry text and page number % don't both fit on one line. In that case, bob suggests starting the % dots pretty far over on the line. Unfortunately, a large % indentation looks wrong when the entry text itself is broken across % lines. So we use a small indentation and put up with long leaders. % % \hangafter is reset to 1 (which is the value we want) at the start % of each paragraph, so we need not do anything with that. \hangindent = 2em % % When the entry text needs to be broken, just fill out the first line % with blank space. \rightskip = 0pt plus1fil % % A bit of stretch before each entry for the benefit of balancing % columns. \vskip 0pt plus1pt % % When reading the text of entry, convert explicit line breaks % from @* into spaces. The user might give these in long section % titles, for instance. \def\*{\unskip\space\ignorespaces}% \def\entrybreak{\hfil\break}% % % Swallow the left brace of the text (first parameter): \afterassignment\doentry \let\temp = } \def\entrybreak{\unskip\space\ignorespaces}% \def\doentry{% \bgroup % Instead of the swallowed brace. \noindent \aftergroup\finishentry % And now comes the text of the entry. } \def\finishentry#1{% % #1 is the page number. % % The following is kludged to not output a line of dots in the index if % there are no page numbers. The next person who breaks this will be % cursed by a Unix daemon. \setbox\boxA = \hbox{#1}% \ifdim\wd\boxA = 0pt \ % \else % % If we must, put the page number on a line of its own, and fill out % this line with blank space. (The \hfil is overwhelmed with the % fill leaders glue in \indexdotfill if the page number does fit.) \hfil\penalty50 \null\nobreak\indexdotfill % Have leaders before the page number. % % The `\ ' here is removed by the implicit \unskip that TeX does as % part of (the primitive) \par. Without it, a spurious underfull % \hbox ensues. \ifpdf \pdfgettoks#1.% \ \the\toksA \else \ #1% \fi \fi \par \endgroup } % Like plain.tex's \dotfill, except uses up at least 1 em. \def\indexdotfill{\cleaders \hbox{$\mathsurround=0pt \mkern1.5mu.\mkern1.5mu$}\hskip 1em plus 1fill} \def\primary #1{\line{#1\hfil}} \newskip\secondaryindent \secondaryindent=0.5cm \def\secondary#1#2{{% \parfillskip=0in \parskip=0in \hangindent=1in \hangafter=1 \noindent\hskip\secondaryindent\hbox{#1}\indexdotfill \ifpdf \pdfgettoks#2.\ \the\toksA % The page number ends the paragraph. \else #2 \fi \par }} % Define two-column mode, which we use to typeset indexes. % Adapted from the TeXbook, page 416, which is to say, % the manmac.tex format used to print the TeXbook itself. \catcode`\@=11 \newbox\partialpage \newdimen\doublecolumnhsize \def\begindoublecolumns{\begingroup % ended by \enddoublecolumns % Grab any single-column material above us. \output = {% % % Here is a possibility not foreseen in manmac: if we accumulate a % whole lot of material, we might end up calling this \output % routine twice in a row (see the doublecol-lose test, which is % essentially a couple of indexes with @setchapternewpage off). In % that case we just ship out what is in \partialpage with the normal % output routine. Generally, \partialpage will be empty when this % runs and this will be a no-op. See the indexspread.tex test case. \ifvoid\partialpage \else \onepageout{\pagecontents\partialpage}% \fi % \global\setbox\partialpage = \vbox{% % Unvbox the main output page. \unvbox\PAGE \kern-\topskip \kern\baselineskip }% }% \eject % run that output routine to set \partialpage % % Use the double-column output routine for subsequent pages. \output = {\doublecolumnout}% % % Change the page size parameters. We could do this once outside this % routine, in each of @smallbook, @afourpaper, and the default 8.5x11 % format, but then we repeat the same computation. Repeating a couple % of assignments once per index is clearly meaningless for the % execution time, so we may as well do it in one place. % % First we halve the line length, less a little for the gutter between % the columns. We compute the gutter based on the line length, so it % changes automatically with the paper format. The magic constant % below is chosen so that the gutter has the same value (well, +-<1pt) % as it did when we hard-coded it. % % We put the result in a separate register, \doublecolumhsize, so we % can restore it in \pagesofar, after \hsize itself has (potentially) % been clobbered. % \doublecolumnhsize = \hsize \advance\doublecolumnhsize by -.04154\hsize \divide\doublecolumnhsize by 2 \hsize = \doublecolumnhsize % % Double the \vsize as well. (We don't need a separate register here, % since nobody clobbers \vsize.) \vsize = 2\vsize } % The double-column output routine for all double-column pages except % the last. % \def\doublecolumnout{% \splittopskip=\topskip \splitmaxdepth=\maxdepth % Get the available space for the double columns -- the normal % (undoubled) page height minus any material left over from the % previous page. \dimen@ = \vsize \divide\dimen@ by 2 \advance\dimen@ by -\ht\partialpage % % box0 will be the left-hand column, box2 the right. \setbox0=\vsplit255 to\dimen@ \setbox2=\vsplit255 to\dimen@ \onepageout\pagesofar \unvbox255 \penalty\outputpenalty } % % Re-output the contents of the output page -- any previous material, % followed by the two boxes we just split, in box0 and box2. \def\pagesofar{% \unvbox\partialpage % \hsize = \doublecolumnhsize \wd0=\hsize \wd2=\hsize \hbox to\pagewidth{\box0\hfil\box2}% } % % All done with double columns. \def\enddoublecolumns{% % The following penalty ensures that the page builder is exercised % _before_ we change the output routine. This is necessary in the % following situation: % % The last section of the index consists only of a single entry. % Before this section, \pagetotal is less than \pagegoal, so no % break occurs before the last section starts. However, the last % section, consisting of \initial and the single \entry, does not % fit on the page and has to be broken off. Without the following % penalty the page builder will not be exercised until \eject % below, and by that time we'll already have changed the output % routine to the \balancecolumns version, so the next-to-last % double-column page will be processed with \balancecolumns, which % is wrong: The two columns will go to the main vertical list, with % the broken-off section in the recent contributions. As soon as % the output routine finishes, TeX starts reconsidering the page % break. The two columns and the broken-off section both fit on the % page, because the two columns now take up only half of the page % goal. When TeX sees \eject from below which follows the final % section, it invokes the new output routine that we've set after % \balancecolumns below; \onepageout will try to fit the two columns % and the final section into the vbox of \pageheight (see % \pagebody), causing an overfull box. % % Note that glue won't work here, because glue does not exercise the % page builder, unlike penalties (see The TeXbook, pp. 280-281). \penalty0 % \output = {% % Split the last of the double-column material. Leave it on the % current page, no automatic page break. \balancecolumns % % If we end up splitting too much material for the current page, % though, there will be another page break right after this \output % invocation ends. Having called \balancecolumns once, we do not % want to call it again. Therefore, reset \output to its normal % definition right away. (We hope \balancecolumns will never be % called on to balance too much material, but if it is, this makes % the output somewhat more palatable.) \global\output = {\onepageout{\pagecontents\PAGE}}% }% \eject \endgroup % started in \begindoublecolumns % % \pagegoal was set to the doubled \vsize above, since we restarted % the current page. We're now back to normal single-column % typesetting, so reset \pagegoal to the normal \vsize (after the % \endgroup where \vsize got restored). \pagegoal = \vsize } % % Called at the end of the double column material. \def\balancecolumns{% \setbox0 = \vbox{\unvbox255}% like \box255 but more efficient, see p.120. \dimen@ = \ht0 \advance\dimen@ by \topskip \advance\dimen@ by-\baselineskip \divide\dimen@ by 2 % target to split to %debug\message{final 2-column material height=\the\ht0, target=\the\dimen@.}% \splittopskip = \topskip % Loop until we get a decent breakpoint. {% \vbadness = 10000 \loop \global\setbox3 = \copy0 \global\setbox1 = \vsplit3 to \dimen@ \ifdim\ht3>\dimen@ \global\advance\dimen@ by 1pt \repeat }% %debug\message{split to \the\dimen@, column heights: \the\ht1, \the\ht3.}% \setbox0=\vbox to\dimen@{\unvbox1}% \setbox2=\vbox to\dimen@{\unvbox3}% % \pagesofar } \catcode`\@ = \other \message{sectioning,} % Chapters, sections, etc. % Let's start with @part. \outer\parseargdef\part{\partzzz{#1}} \def\partzzz#1{% \chapoddpage \null \vskip.3\vsize % move it down on the page a bit \begingroup \noindent \titlefonts\rmisbold #1\par % the text \let\lastnode=\empty % no node to associate with \writetocentry{part}{#1}{}% but put it in the toc \headingsoff % no headline or footline on the part page \chapoddpage \endgroup } % \unnumberedno is an oxymoron. But we count the unnumbered % sections so that we can refer to them unambiguously in the pdf % outlines by their "section number". We avoid collisions with chapter % numbers by starting them at 10000. (If a document ever has 10000 % chapters, we're in trouble anyway, I'm sure.) \newcount\unnumberedno \unnumberedno = 10000 \newcount\chapno \newcount\secno \secno=0 \newcount\subsecno \subsecno=0 \newcount\subsubsecno \subsubsecno=0 % This counter is funny since it counts through charcodes of letters A, B, ... \newcount\appendixno \appendixno = `\@ % % \def\appendixletter{\char\the\appendixno} % We do the following ugly conditional instead of the above simple % construct for the sake of pdftex, which needs the actual % letter in the expansion, not just typeset. % \def\appendixletter{% \ifnum\appendixno=`A A% \else\ifnum\appendixno=`B B% \else\ifnum\appendixno=`C C% \else\ifnum\appendixno=`D D% \else\ifnum\appendixno=`E E% \else\ifnum\appendixno=`F F% \else\ifnum\appendixno=`G G% \else\ifnum\appendixno=`H H% \else\ifnum\appendixno=`I I% \else\ifnum\appendixno=`J J% \else\ifnum\appendixno=`K K% \else\ifnum\appendixno=`L L% \else\ifnum\appendixno=`M M% \else\ifnum\appendixno=`N N% \else\ifnum\appendixno=`O O% \else\ifnum\appendixno=`P P% \else\ifnum\appendixno=`Q Q% \else\ifnum\appendixno=`R R% \else\ifnum\appendixno=`S S% \else\ifnum\appendixno=`T T% \else\ifnum\appendixno=`U U% \else\ifnum\appendixno=`V V% \else\ifnum\appendixno=`W W% \else\ifnum\appendixno=`X X% \else\ifnum\appendixno=`Y Y% \else\ifnum\appendixno=`Z Z% % The \the is necessary, despite appearances, because \appendixletter is % expanded while writing the .toc file. \char\appendixno is not % expandable, thus it is written literally, thus all appendixes come out % with the same letter (or @) in the toc without it. \else\char\the\appendixno \fi\fi\fi\fi\fi\fi\fi\fi\fi\fi\fi\fi\fi \fi\fi\fi\fi\fi\fi\fi\fi\fi\fi\fi\fi\fi} % Each @chapter defines these (using marks) as the number+name, number % and name of the chapter. Page headings and footings can use % these. @section does likewise. \def\thischapter{} \def\thischapternum{} \def\thischaptername{} \def\thissection{} \def\thissectionnum{} \def\thissectionname{} \newcount\absseclevel % used to calculate proper heading level \newcount\secbase\secbase=0 % @raisesections/@lowersections modify this count % @raisesections: treat @section as chapter, @subsection as section, etc. \def\raisesections{\global\advance\secbase by -1} \let\up=\raisesections % original BFox name % @lowersections: treat @chapter as section, @section as subsection, etc. \def\lowersections{\global\advance\secbase by 1} \let\down=\lowersections % original BFox name % we only have subsub. \chardef\maxseclevel = 3 % % A numbered section within an unnumbered changes to unnumbered too. % To achieve this, remember the "biggest" unnum. sec. we are currently in: \chardef\unnlevel = \maxseclevel % % Trace whether the current chapter is an appendix or not: % \chapheadtype is "N" or "A", unnumbered chapters are ignored. \def\chapheadtype{N} % Choose a heading macro % #1 is heading type % #2 is heading level % #3 is text for heading \def\genhead#1#2#3{% % Compute the abs. sec. level: \absseclevel=#2 \advance\absseclevel by \secbase % Make sure \absseclevel doesn't fall outside the range: \ifnum \absseclevel < 0 \absseclevel = 0 \else \ifnum \absseclevel > 3 \absseclevel = 3 \fi \fi % The heading type: \def\headtype{#1}% \if \headtype U% \ifnum \absseclevel < \unnlevel \chardef\unnlevel = \absseclevel \fi \else % Check for appendix sections: \ifnum \absseclevel = 0 \edef\chapheadtype{\headtype}% \else \if \headtype A\if \chapheadtype N% \errmessage{@appendix... within a non-appendix chapter}% \fi\fi \fi % Check for numbered within unnumbered: \ifnum \absseclevel > \unnlevel \def\headtype{U}% \else \chardef\unnlevel = 3 \fi \fi % Now print the heading: \if \headtype U% \ifcase\absseclevel \unnumberedzzz{#3}% \or \unnumberedseczzz{#3}% \or \unnumberedsubseczzz{#3}% \or \unnumberedsubsubseczzz{#3}% \fi \else \if \headtype A% \ifcase\absseclevel \appendixzzz{#3}% \or \appendixsectionzzz{#3}% \or \appendixsubseczzz{#3}% \or \appendixsubsubseczzz{#3}% \fi \else \ifcase\absseclevel \chapterzzz{#3}% \or \seczzz{#3}% \or \numberedsubseczzz{#3}% \or \numberedsubsubseczzz{#3}% \fi \fi \fi \suppressfirstparagraphindent } % an interface: \def\numhead{\genhead N} \def\apphead{\genhead A} \def\unnmhead{\genhead U} % @chapter, @appendix, @unnumbered. Increment top-level counter, reset % all lower-level sectioning counters to zero. % % Also set \chaplevelprefix, which we prepend to @float sequence numbers % (e.g., figures), q.v. By default (before any chapter), that is empty. \let\chaplevelprefix = \empty % \outer\parseargdef\chapter{\numhead0{#1}} % normally numhead0 calls chapterzzz \def\chapterzzz#1{% % section resetting is \global in case the chapter is in a group, such % as an @include file. \global\secno=0 \global\subsecno=0 \global\subsubsecno=0 \global\advance\chapno by 1 % % Used for \float. \gdef\chaplevelprefix{\the\chapno.}% \resetallfloatnos % % \putwordChapter can contain complex things in translations. \toks0=\expandafter{\putwordChapter}% \message{\the\toks0 \space \the\chapno}% % % Write the actual heading. \chapmacro{#1}{Ynumbered}{\the\chapno}% % % So @section and the like are numbered underneath this chapter. \global\let\section = \numberedsec \global\let\subsection = \numberedsubsec \global\let\subsubsection = \numberedsubsubsec } \outer\parseargdef\appendix{\apphead0{#1}} % normally calls appendixzzz % \def\appendixzzz#1{% \global\secno=0 \global\subsecno=0 \global\subsubsecno=0 \global\advance\appendixno by 1 \gdef\chaplevelprefix{\appendixletter.}% \resetallfloatnos % % \putwordAppendix can contain complex things in translations. \toks0=\expandafter{\putwordAppendix}% \message{\the\toks0 \space \appendixletter}% % \chapmacro{#1}{Yappendix}{\appendixletter}% % \global\let\section = \appendixsec \global\let\subsection = \appendixsubsec \global\let\subsubsection = \appendixsubsubsec } % normally unnmhead0 calls unnumberedzzz: \outer\parseargdef\unnumbered{\unnmhead0{#1}} \def\unnumberedzzz#1{% \global\secno=0 \global\subsecno=0 \global\subsubsecno=0 \global\advance\unnumberedno by 1 % % Since an unnumbered has no number, no prefix for figures. \global\let\chaplevelprefix = \empty \resetallfloatnos % % This used to be simply \message{#1}, but TeX fully expands the % argument to \message. Therefore, if #1 contained @-commands, TeX % expanded them. For example, in `@unnumbered The @cite{Book}', TeX % expanded @cite (which turns out to cause errors because \cite is meant % to be executed, not expanded). % % Anyway, we don't want the fully-expanded definition of @cite to appear % as a result of the \message, we just want `@cite' itself. We use % \the to achieve this: TeX expands \the only once, % simply yielding the contents of . (We also do this for % the toc entries.) \toks0 = {#1}% \message{(\the\toks0)}% % \chapmacro{#1}{Ynothing}{\the\unnumberedno}% % \global\let\section = \unnumberedsec \global\let\subsection = \unnumberedsubsec \global\let\subsubsection = \unnumberedsubsubsec } % @centerchap is like @unnumbered, but the heading is centered. \outer\parseargdef\centerchap{% % Well, we could do the following in a group, but that would break % an assumption that \chapmacro is called at the outermost level. % Thus we are safer this way: --kasal, 24feb04 \let\centerparametersmaybe = \centerparameters \unnmhead0{#1}% \let\centerparametersmaybe = \relax } % @top is like @unnumbered. \let\top\unnumbered % Sections. % \outer\parseargdef\numberedsec{\numhead1{#1}} % normally calls seczzz \def\seczzz#1{% \global\subsecno=0 \global\subsubsecno=0 \global\advance\secno by 1 \sectionheading{#1}{sec}{Ynumbered}{\the\chapno.\the\secno}% } % normally calls appendixsectionzzz: \outer\parseargdef\appendixsection{\apphead1{#1}} \def\appendixsectionzzz#1{% \global\subsecno=0 \global\subsubsecno=0 \global\advance\secno by 1 \sectionheading{#1}{sec}{Yappendix}{\appendixletter.\the\secno}% } \let\appendixsec\appendixsection % normally calls unnumberedseczzz: \outer\parseargdef\unnumberedsec{\unnmhead1{#1}} \def\unnumberedseczzz#1{% \global\subsecno=0 \global\subsubsecno=0 \global\advance\secno by 1 \sectionheading{#1}{sec}{Ynothing}{\the\unnumberedno.\the\secno}% } % Subsections. % % normally calls numberedsubseczzz: \outer\parseargdef\numberedsubsec{\numhead2{#1}} \def\numberedsubseczzz#1{% \global\subsubsecno=0 \global\advance\subsecno by 1 \sectionheading{#1}{subsec}{Ynumbered}{\the\chapno.\the\secno.\the\subsecno}% } % normally calls appendixsubseczzz: \outer\parseargdef\appendixsubsec{\apphead2{#1}} \def\appendixsubseczzz#1{% \global\subsubsecno=0 \global\advance\subsecno by 1 \sectionheading{#1}{subsec}{Yappendix}% {\appendixletter.\the\secno.\the\subsecno}% } % normally calls unnumberedsubseczzz: \outer\parseargdef\unnumberedsubsec{\unnmhead2{#1}} \def\unnumberedsubseczzz#1{% \global\subsubsecno=0 \global\advance\subsecno by 1 \sectionheading{#1}{subsec}{Ynothing}% {\the\unnumberedno.\the\secno.\the\subsecno}% } % Subsubsections. % % normally numberedsubsubseczzz: \outer\parseargdef\numberedsubsubsec{\numhead3{#1}} \def\numberedsubsubseczzz#1{% \global\advance\subsubsecno by 1 \sectionheading{#1}{subsubsec}{Ynumbered}% {\the\chapno.\the\secno.\the\subsecno.\the\subsubsecno}% } % normally appendixsubsubseczzz: \outer\parseargdef\appendixsubsubsec{\apphead3{#1}} \def\appendixsubsubseczzz#1{% \global\advance\subsubsecno by 1 \sectionheading{#1}{subsubsec}{Yappendix}% {\appendixletter.\the\secno.\the\subsecno.\the\subsubsecno}% } % normally unnumberedsubsubseczzz: \outer\parseargdef\unnumberedsubsubsec{\unnmhead3{#1}} \def\unnumberedsubsubseczzz#1{% \global\advance\subsubsecno by 1 \sectionheading{#1}{subsubsec}{Ynothing}% {\the\unnumberedno.\the\secno.\the\subsecno.\the\subsubsecno}% } % These macros control what the section commands do, according % to what kind of chapter we are in (ordinary, appendix, or unnumbered). % Define them by default for a numbered chapter. \let\section = \numberedsec \let\subsection = \numberedsubsec \let\subsubsection = \numberedsubsubsec % Define @majorheading, @heading and @subheading \def\majorheading{% {\advance\chapheadingskip by 10pt \chapbreak }% \parsearg\chapheadingzzz } \def\chapheading{\chapbreak \parsearg\chapheadingzzz} \def\chapheadingzzz#1{% \vbox{\chapfonts \raggedtitlesettings #1\par}% \nobreak\bigskip \nobreak \suppressfirstparagraphindent } % @heading, @subheading, @subsubheading. \parseargdef\heading{\sectionheading{#1}{sec}{Yomitfromtoc}{} \suppressfirstparagraphindent} \parseargdef\subheading{\sectionheading{#1}{subsec}{Yomitfromtoc}{} \suppressfirstparagraphindent} \parseargdef\subsubheading{\sectionheading{#1}{subsubsec}{Yomitfromtoc}{} \suppressfirstparagraphindent} % These macros generate a chapter, section, etc. heading only % (including whitespace, linebreaking, etc. around it), % given all the information in convenient, parsed form. % Args are the skip and penalty (usually negative) \def\dobreak#1#2{\par\ifdim\lastskip<#1\removelastskip\penalty#2\vskip#1\fi} % Parameter controlling skip before chapter headings (if needed) \newskip\chapheadingskip % Define plain chapter starts, and page on/off switching for it. \def\chapbreak{\dobreak \chapheadingskip {-4000}} \def\chappager{\par\vfill\supereject} % Because \domark is called before \chapoddpage, the filler page will % get the headings for the next chapter, which is wrong. But we don't % care -- we just disable all headings on the filler page. \def\chapoddpage{% \chappager \ifodd\pageno \else \begingroup \headingsoff \null \chappager \endgroup \fi } \def\setchapternewpage #1 {\csname CHAPPAG#1\endcsname} \def\CHAPPAGoff{% \global\let\contentsalignmacro = \chappager \global\let\pchapsepmacro=\chapbreak \global\let\pagealignmacro=\chappager} \def\CHAPPAGon{% \global\let\contentsalignmacro = \chappager \global\let\pchapsepmacro=\chappager \global\let\pagealignmacro=\chappager \global\def\HEADINGSon{\HEADINGSsingle}} \def\CHAPPAGodd{% \global\let\contentsalignmacro = \chapoddpage \global\let\pchapsepmacro=\chapoddpage \global\let\pagealignmacro=\chapoddpage \global\def\HEADINGSon{\HEADINGSdouble}} \CHAPPAGon % Chapter opening. % % #1 is the text, #2 is the section type (Ynumbered, Ynothing, % Yappendix, Yomitfromtoc), #3 the chapter number. % % To test against our argument. \def\Ynothingkeyword{Ynothing} \def\Yomitfromtockeyword{Yomitfromtoc} \def\Yappendixkeyword{Yappendix} % \def\chapmacro#1#2#3{% % Insert the first mark before the heading break (see notes for \domark). \let\prevchapterdefs=\lastchapterdefs \let\prevsectiondefs=\lastsectiondefs \gdef\lastsectiondefs{\gdef\thissectionname{}\gdef\thissectionnum{}% \gdef\thissection{}}% % \def\temptype{#2}% \ifx\temptype\Ynothingkeyword \gdef\lastchapterdefs{\gdef\thischaptername{#1}\gdef\thischapternum{}% \gdef\thischapter{\thischaptername}}% \else\ifx\temptype\Yomitfromtockeyword \gdef\lastchapterdefs{\gdef\thischaptername{#1}\gdef\thischapternum{}% \gdef\thischapter{}}% \else\ifx\temptype\Yappendixkeyword \toks0={#1}% \xdef\lastchapterdefs{% \gdef\noexpand\thischaptername{\the\toks0}% \gdef\noexpand\thischapternum{\appendixletter}% % \noexpand\putwordAppendix avoids expanding indigestible % commands in some of the translations. \gdef\noexpand\thischapter{\noexpand\putwordAppendix{} \noexpand\thischapternum: \noexpand\thischaptername}% }% \else \toks0={#1}% \xdef\lastchapterdefs{% \gdef\noexpand\thischaptername{\the\toks0}% \gdef\noexpand\thischapternum{\the\chapno}% % \noexpand\putwordChapter avoids expanding indigestible % commands in some of the translations. \gdef\noexpand\thischapter{\noexpand\putwordChapter{} \noexpand\thischapternum: \noexpand\thischaptername}% }% \fi\fi\fi % % Output the mark. Pass it through \safewhatsit, to take care of % the preceding space. \safewhatsit\domark % % Insert the chapter heading break. \pchapsepmacro % % Now the second mark, after the heading break. No break points % between here and the heading. \let\prevchapterdefs=\lastchapterdefs \let\prevsectiondefs=\lastsectiondefs \domark % {% \chapfonts \rmisbold % % Have to define \lastsection before calling \donoderef, because the % xref code eventually uses it. On the other hand, it has to be called % after \pchapsepmacro, or the headline will change too soon. \gdef\lastsection{#1}% % % Only insert the separating space if we have a chapter/appendix % number, and don't print the unnumbered ``number''. \ifx\temptype\Ynothingkeyword \setbox0 = \hbox{}% \def\toctype{unnchap}% \else\ifx\temptype\Yomitfromtockeyword \setbox0 = \hbox{}% contents like unnumbered, but no toc entry \def\toctype{omit}% \else\ifx\temptype\Yappendixkeyword \setbox0 = \hbox{\putwordAppendix{} #3\enspace}% \def\toctype{app}% \else \setbox0 = \hbox{#3\enspace}% \def\toctype{numchap}% \fi\fi\fi % % Write the toc entry for this chapter. Must come before the % \donoderef, because we include the current node name in the toc % entry, and \donoderef resets it to empty. \writetocentry{\toctype}{#1}{#3}% % % For pdftex, we have to write out the node definition (aka, make % the pdfdest) after any page break, but before the actual text has % been typeset. If the destination for the pdf outline is after the % text, then jumping from the outline may wind up with the text not % being visible, for instance under high magnification. \donoderef{#2}% % % Typeset the actual heading. \nobreak % Avoid page breaks at the interline glue. \vbox{\raggedtitlesettings \hangindent=\wd0 \centerparametersmaybe \unhbox0 #1\par}% }% \nobreak\bigskip % no page break after a chapter title \nobreak } % @centerchap -- centered and unnumbered. \let\centerparametersmaybe = \relax \def\centerparameters{% \advance\rightskip by 3\rightskip \leftskip = \rightskip \parfillskip = 0pt } % I don't think this chapter style is supported any more, so I'm not % updating it with the new noderef stuff. We'll see. --karl, 11aug03. % \def\setchapterstyle #1 {\csname CHAPF#1\endcsname} % \def\unnchfopen #1{% \chapoddpage \vbox{\chapfonts \raggedtitlesettings #1\par}% \nobreak\bigskip\nobreak } \def\chfopen #1#2{\chapoddpage {\chapfonts \vbox to 3in{\vfil \hbox to\hsize{\hfil #2} \hbox to\hsize{\hfil #1} \vfil}}% \par\penalty 5000 % } \def\centerchfopen #1{% \chapoddpage \vbox{\chapfonts \raggedtitlesettings \hfill #1\hfill}% \nobreak\bigskip \nobreak } \def\CHAPFopen{% \global\let\chapmacro=\chfopen \global\let\centerchapmacro=\centerchfopen} % Section titles. These macros combine the section number parts and % call the generic \sectionheading to do the printing. % \newskip\secheadingskip \def\secheadingbreak{\dobreak \secheadingskip{-1000}} % Subsection titles. \newskip\subsecheadingskip \def\subsecheadingbreak{\dobreak \subsecheadingskip{-500}} % Subsubsection titles. \def\subsubsecheadingskip{\subsecheadingskip} \def\subsubsecheadingbreak{\subsecheadingbreak} % Print any size, any type, section title. % % #1 is the text, #2 is the section level (sec/subsec/subsubsec), #3 is % the section type for xrefs (Ynumbered, Ynothing, Yappendix), #4 is the % section number. % \def\seckeyword{sec} % \def\sectionheading#1#2#3#4{% {% \checkenv{}% should not be in an environment. % % Switch to the right set of fonts. \csname #2fonts\endcsname \rmisbold % \def\sectionlevel{#2}% \def\temptype{#3}% % % Insert first mark before the heading break (see notes for \domark). \let\prevsectiondefs=\lastsectiondefs \ifx\temptype\Ynothingkeyword \ifx\sectionlevel\seckeyword \gdef\lastsectiondefs{\gdef\thissectionname{#1}\gdef\thissectionnum{}% \gdef\thissection{\thissectionname}}% \fi \else\ifx\temptype\Yomitfromtockeyword % Don't redefine \thissection. \else\ifx\temptype\Yappendixkeyword \ifx\sectionlevel\seckeyword \toks0={#1}% \xdef\lastsectiondefs{% \gdef\noexpand\thissectionname{\the\toks0}% \gdef\noexpand\thissectionnum{#4}% % \noexpand\putwordSection avoids expanding indigestible % commands in some of the translations. \gdef\noexpand\thissection{\noexpand\putwordSection{} \noexpand\thissectionnum: \noexpand\thissectionname}% }% \fi \else \ifx\sectionlevel\seckeyword \toks0={#1}% \xdef\lastsectiondefs{% \gdef\noexpand\thissectionname{\the\toks0}% \gdef\noexpand\thissectionnum{#4}% % \noexpand\putwordSection avoids expanding indigestible % commands in some of the translations. \gdef\noexpand\thissection{\noexpand\putwordSection{} \noexpand\thissectionnum: \noexpand\thissectionname}% }% \fi \fi\fi\fi % % Go into vertical mode. Usually we'll already be there, but we % don't want the following whatsit to end up in a preceding paragraph % if the document didn't happen to have a blank line. \par % % Output the mark. Pass it through \safewhatsit, to take care of % the preceding space. \safewhatsit\domark % % Insert space above the heading. \csname #2headingbreak\endcsname % % Now the second mark, after the heading break. No break points % between here and the heading. \let\prevsectiondefs=\lastsectiondefs \domark % % Only insert the space after the number if we have a section number. \ifx\temptype\Ynothingkeyword \setbox0 = \hbox{}% \def\toctype{unn}% \gdef\lastsection{#1}% \else\ifx\temptype\Yomitfromtockeyword % for @headings -- no section number, don't include in toc, % and don't redefine \lastsection. \setbox0 = \hbox{}% \def\toctype{omit}% \let\sectionlevel=\empty \else\ifx\temptype\Yappendixkeyword \setbox0 = \hbox{#4\enspace}% \def\toctype{app}% \gdef\lastsection{#1}% \else \setbox0 = \hbox{#4\enspace}% \def\toctype{num}% \gdef\lastsection{#1}% \fi\fi\fi % % Write the toc entry (before \donoderef). See comments in \chapmacro. \writetocentry{\toctype\sectionlevel}{#1}{#4}% % % Write the node reference (= pdf destination for pdftex). % Again, see comments in \chapmacro. \donoderef{#3}% % % Interline glue will be inserted when the vbox is completed. % That glue will be a valid breakpoint for the page, since it'll be % preceded by a whatsit (usually from the \donoderef, or from the % \writetocentry if there was no node). We don't want to allow that % break, since then the whatsits could end up on page n while the % section is on page n+1, thus toc/etc. are wrong. Debian bug 276000. \nobreak % % Output the actual section heading. \vbox{\hyphenpenalty=10000 \tolerance=5000 \parindent=0pt \ptexraggedright \hangindent=\wd0 % zero if no section number \unhbox0 #1}% }% % Add extra space after the heading -- half of whatever came above it. % Don't allow stretch, though. \kern .5 \csname #2headingskip\endcsname % % Do not let the kern be a potential breakpoint, as it would be if it % was followed by glue. \nobreak % % We'll almost certainly start a paragraph next, so don't let that % glue accumulate. (Not a breakpoint because it's preceded by a % discardable item.) However, when a paragraph is not started next % (\startdefun, \cartouche, \center, etc.), this needs to be wiped out % or the negative glue will cause weirdly wrong output, typically % obscuring the section heading with something else. \vskip-\parskip % % This is so the last item on the main vertical list is a known % \penalty > 10000, so \startdefun, etc., can recognize the situation % and do the needful. \penalty 10001 } \message{toc,} % Table of contents. \newwrite\tocfile % Write an entry to the toc file, opening it if necessary. % Called from @chapter, etc. % % Example usage: \writetocentry{sec}{Section Name}{\the\chapno.\the\secno} % We append the current node name (if any) and page number as additional % arguments for the \{chap,sec,...}entry macros which will eventually % read this. The node name is used in the pdf outlines as the % destination to jump to. % % We open the .toc file for writing here instead of at @setfilename (or % any other fixed time) so that @contents can be anywhere in the document. % But if #1 is `omit', then we don't do anything. This is used for the % table of contents chapter openings themselves. % \newif\iftocfileopened \def\omitkeyword{omit}% % \def\writetocentry#1#2#3{% \edef\writetoctype{#1}% \ifx\writetoctype\omitkeyword \else \iftocfileopened\else \immediate\openout\tocfile = \jobname.toc \global\tocfileopenedtrue \fi % \iflinks {\atdummies \edef\temp{% \write\tocfile{@#1entry{#2}{#3}{\lastnode}{\noexpand\folio}}}% \temp }% \fi \fi % % Tell \shipout to create a pdf destination on each page, if we're % writing pdf. These are used in the table of contents. We can't % just write one on every page because the title pages are numbered % 1 and 2 (the page numbers aren't printed), and so are the first % two pages of the document. Thus, we'd have two destinations named % `1', and two named `2'. \ifpdf \global\pdfmakepagedesttrue \fi } % These characters do not print properly in the Computer Modern roman % fonts, so we must take special care. This is more or less redundant % with the Texinfo input format setup at the end of this file. % \def\activecatcodes{% \catcode`\"=\active \catcode`\$=\active \catcode`\<=\active \catcode`\>=\active \catcode`\\=\active \catcode`\^=\active \catcode`\_=\active \catcode`\|=\active \catcode`\~=\active } % Read the toc file, which is essentially Texinfo input. \def\readtocfile{% \setupdatafile \activecatcodes \input \tocreadfilename } \newskip\contentsrightmargin \contentsrightmargin=1in \newcount\savepageno \newcount\lastnegativepageno \lastnegativepageno = -1 % Prepare to read what we've written to \tocfile. % \def\startcontents#1{% % If @setchapternewpage on, and @headings double, the contents should % start on an odd page, unlike chapters. Thus, we maintain % \contentsalignmacro in parallel with \pagealignmacro. % From: Torbjorn Granlund \contentsalignmacro \immediate\closeout\tocfile % % Don't need to put `Contents' or `Short Contents' in the headline. % It is abundantly clear what they are. \chapmacro{#1}{Yomitfromtoc}{}% % \savepageno = \pageno \begingroup % Set up to handle contents files properly. \raggedbottom % Worry more about breakpoints than the bottom. \advance\hsize by -\contentsrightmargin % Don't use the full line length. % % Roman numerals for page numbers. \ifnum \pageno>0 \global\pageno = \lastnegativepageno \fi } % redefined for the two-volume lispref. We always output on % \jobname.toc even if this is redefined. % \def\tocreadfilename{\jobname.toc} % Normal (long) toc. % \def\contents{% \startcontents{\putwordTOC}% \openin 1 \tocreadfilename\space \ifeof 1 \else \readtocfile \fi \vfill \eject \contentsalignmacro % in case @setchapternewpage odd is in effect \ifeof 1 \else \pdfmakeoutlines \fi \closein 1 \endgroup \lastnegativepageno = \pageno \global\pageno = \savepageno } % And just the chapters. \def\summarycontents{% \startcontents{\putwordShortTOC}% % \let\partentry = \shortpartentry \let\numchapentry = \shortchapentry \let\appentry = \shortchapentry \let\unnchapentry = \shortunnchapentry % We want a true roman here for the page numbers. \secfonts \let\rm=\shortcontrm \let\bf=\shortcontbf \let\sl=\shortcontsl \let\tt=\shortconttt \rm \hyphenpenalty = 10000 \advance\baselineskip by 1pt % Open it up a little. \def\numsecentry##1##2##3##4{} \let\appsecentry = \numsecentry \let\unnsecentry = \numsecentry \let\numsubsecentry = \numsecentry \let\appsubsecentry = \numsecentry \let\unnsubsecentry = \numsecentry \let\numsubsubsecentry = \numsecentry \let\appsubsubsecentry = \numsecentry \let\unnsubsubsecentry = \numsecentry \openin 1 \tocreadfilename\space \ifeof 1 \else \readtocfile \fi \closein 1 \vfill \eject \contentsalignmacro % in case @setchapternewpage odd is in effect \endgroup \lastnegativepageno = \pageno \global\pageno = \savepageno } \let\shortcontents = \summarycontents % Typeset the label for a chapter or appendix for the short contents. % The arg is, e.g., `A' for an appendix, or `3' for a chapter. % \def\shortchaplabel#1{% % This space should be enough, since a single number is .5em, and the % widest letter (M) is 1em, at least in the Computer Modern fonts. % But use \hss just in case. % (This space doesn't include the extra space that gets added after % the label; that gets put in by \shortchapentry above.) % % We'd like to right-justify chapter numbers, but that looks strange % with appendix letters. And right-justifying numbers and % left-justifying letters looks strange when there is less than 10 % chapters. Have to read the whole toc once to know how many chapters % there are before deciding ... \hbox to 1em{#1\hss}% } % These macros generate individual entries in the table of contents. % The first argument is the chapter or section name. % The last argument is the page number. % The arguments in between are the chapter number, section number, ... % Parts, in the main contents. Replace the part number, which doesn't % exist, with an empty box. Let's hope all the numbers have the same width. % Also ignore the page number, which is conventionally not printed. \def\numeralbox{\setbox0=\hbox{8}\hbox to \wd0{\hfil}} \def\partentry#1#2#3#4{\dochapentry{\numeralbox\labelspace#1}{}} % % Parts, in the short toc. \def\shortpartentry#1#2#3#4{% \penalty-300 \vskip.5\baselineskip plus.15\baselineskip minus.1\baselineskip \shortchapentry{{\bf #1}}{\numeralbox}{}{}% } % Chapters, in the main contents. \def\numchapentry#1#2#3#4{\dochapentry{#2\labelspace#1}{#4}} % % Chapters, in the short toc. % See comments in \dochapentry re vbox and related settings. \def\shortchapentry#1#2#3#4{% \tocentry{\shortchaplabel{#2}\labelspace #1}{\doshortpageno\bgroup#4\egroup}% } % Appendices, in the main contents. % Need the word Appendix, and a fixed-size box. % \def\appendixbox#1{% % We use M since it's probably the widest letter. \setbox0 = \hbox{\putwordAppendix{} M}% \hbox to \wd0{\putwordAppendix{} #1\hss}} % \def\appentry#1#2#3#4{\dochapentry{\appendixbox{#2}\labelspace#1}{#4}} % Unnumbered chapters. \def\unnchapentry#1#2#3#4{\dochapentry{#1}{#4}} \def\shortunnchapentry#1#2#3#4{\tocentry{#1}{\doshortpageno\bgroup#4\egroup}} % Sections. \def\numsecentry#1#2#3#4{\dosecentry{#2\labelspace#1}{#4}} \let\appsecentry=\numsecentry \def\unnsecentry#1#2#3#4{\dosecentry{#1}{#4}} % Subsections. \def\numsubsecentry#1#2#3#4{\dosubsecentry{#2\labelspace#1}{#4}} \let\appsubsecentry=\numsubsecentry \def\unnsubsecentry#1#2#3#4{\dosubsecentry{#1}{#4}} % And subsubsections. \def\numsubsubsecentry#1#2#3#4{\dosubsubsecentry{#2\labelspace#1}{#4}} \let\appsubsubsecentry=\numsubsubsecentry \def\unnsubsubsecentry#1#2#3#4{\dosubsubsecentry{#1}{#4}} % This parameter controls the indentation of the various levels. % Same as \defaultparindent. \newdimen\tocindent \tocindent = 15pt % Now for the actual typesetting. In all these, #1 is the text and #2 is the % page number. % % If the toc has to be broken over pages, we want it to be at chapters % if at all possible; hence the \penalty. \def\dochapentry#1#2{% \penalty-300 \vskip1\baselineskip plus.33\baselineskip minus.25\baselineskip \begingroup \chapentryfonts \tocentry{#1}{\dopageno\bgroup#2\egroup}% \endgroup \nobreak\vskip .25\baselineskip plus.1\baselineskip } \def\dosecentry#1#2{\begingroup \secentryfonts \leftskip=\tocindent \tocentry{#1}{\dopageno\bgroup#2\egroup}% \endgroup} \def\dosubsecentry#1#2{\begingroup \subsecentryfonts \leftskip=2\tocindent \tocentry{#1}{\dopageno\bgroup#2\egroup}% \endgroup} \def\dosubsubsecentry#1#2{\begingroup \subsubsecentryfonts \leftskip=3\tocindent \tocentry{#1}{\dopageno\bgroup#2\egroup}% \endgroup} % We use the same \entry macro as for the index entries. \let\tocentry = \entry % Space between chapter (or whatever) number and the title. \def\labelspace{\hskip1em \relax} \def\dopageno#1{{\rm #1}} \def\doshortpageno#1{{\rm #1}} \def\chapentryfonts{\secfonts \rm} \def\secentryfonts{\textfonts} \def\subsecentryfonts{\textfonts} \def\subsubsecentryfonts{\textfonts} \message{environments,} % @foo ... @end foo. % @tex ... @end tex escapes into raw TeX temporarily. % One exception: @ is still an escape character, so that @end tex works. % But \@ or @@ will get a plain @ character. \envdef\tex{% \setupmarkupstyle{tex}% \catcode `\\=0 \catcode `\{=1 \catcode `\}=2 \catcode `\$=3 \catcode `\&=4 \catcode `\#=6 \catcode `\^=7 \catcode `\_=8 \catcode `\~=\active \let~=\tie \catcode `\%=14 \catcode `\+=\other \catcode `\"=\other \catcode `\|=\other \catcode `\<=\other \catcode `\>=\other \catcode`\`=\other \catcode`\'=\other \escapechar=`\\ % % ' is active in math mode (mathcode"8000). So reset it, and all our % other math active characters (just in case), to plain's definitions. \mathactive % \let\b=\ptexb \let\bullet=\ptexbullet \let\c=\ptexc \let\,=\ptexcomma \let\.=\ptexdot \let\dots=\ptexdots \let\equiv=\ptexequiv \let\!=\ptexexclam \let\i=\ptexi \let\indent=\ptexindent \let\noindent=\ptexnoindent \let\{=\ptexlbrace \let\+=\tabalign \let\}=\ptexrbrace \let\/=\ptexslash \let\*=\ptexstar \let\t=\ptext \expandafter \let\csname top\endcsname=\ptextop % outer \let\frenchspacing=\plainfrenchspacing % \def\endldots{\mathinner{\ldots\ldots\ldots\ldots}}% \def\enddots{\relax\ifmmode\endldots\else$\mathsurround=0pt \endldots\,$\fi}% \def\@{@}% } % There is no need to define \Etex. % Define @lisp ... @end lisp. % @lisp environment forms a group so it can rebind things, % including the definition of @end lisp (which normally is erroneous). % Amount to narrow the margins by for @lisp. \newskip\lispnarrowing \lispnarrowing=0.4in % This is the definition that ^^M gets inside @lisp, @example, and other % such environments. \null is better than a space, since it doesn't % have any width. \def\lisppar{\null\endgraf} % This space is always present above and below environments. \newskip\envskipamount \envskipamount = 0pt % Make spacing and below environment symmetrical. We use \parskip here % to help in doing that, since in @example-like environments \parskip % is reset to zero; thus the \afterenvbreak inserts no space -- but the % start of the next paragraph will insert \parskip. % \def\aboveenvbreak{{% % =10000 instead of <10000 because of a special case in \itemzzz and % \sectionheading, q.v. \ifnum \lastpenalty=10000 \else \advance\envskipamount by \parskip \endgraf \ifdim\lastskip<\envskipamount \removelastskip % it's not a good place to break if the last penalty was \nobreak % or better ... \ifnum\lastpenalty<10000 \penalty-50 \fi \vskip\envskipamount \fi \fi }} \let\afterenvbreak = \aboveenvbreak % \nonarrowing is a flag. If "set", @lisp etc don't narrow margins; it will % also clear it, so that its embedded environments do the narrowing again. \let\nonarrowing=\relax % @cartouche ... @end cartouche: draw rectangle w/rounded corners around % environment contents. \font\circle=lcircle10 \newdimen\circthick \newdimen\cartouter\newdimen\cartinner \newskip\normbskip\newskip\normpskip\newskip\normlskip \circthick=\fontdimen8\circle % \def\ctl{{\circle\char'013\hskip -6pt}}% 6pt from pl file: 1/2charwidth \def\ctr{{\hskip 6pt\circle\char'010}} \def\cbl{{\circle\char'012\hskip -6pt}} \def\cbr{{\hskip 6pt\circle\char'011}} \def\carttop{\hbox to \cartouter{\hskip\lskip \ctl\leaders\hrule height\circthick\hfil\ctr \hskip\rskip}} \def\cartbot{\hbox to \cartouter{\hskip\lskip \cbl\leaders\hrule height\circthick\hfil\cbr \hskip\rskip}} % \newskip\lskip\newskip\rskip \envdef\cartouche{% \ifhmode\par\fi % can't be in the midst of a paragraph. \startsavinginserts \lskip=\leftskip \rskip=\rightskip \leftskip=0pt\rightskip=0pt % we want these *outside*. \cartinner=\hsize \advance\cartinner by-\lskip \advance\cartinner by-\rskip \cartouter=\hsize \advance\cartouter by 18.4pt % allow for 3pt kerns on either % side, and for 6pt waste from % each corner char, and rule thickness \normbskip=\baselineskip \normpskip=\parskip \normlskip=\lineskip % Flag to tell @lisp, etc., not to narrow margin. \let\nonarrowing = t% % % If this cartouche directly follows a sectioning command, we need the % \parskip glue (backspaced over by default) or the cartouche can % collide with the section heading. \ifnum\lastpenalty>10000 \vskip\parskip \penalty\lastpenalty \fi % \vbox\bgroup \baselineskip=0pt\parskip=0pt\lineskip=0pt \carttop \hbox\bgroup \hskip\lskip \vrule\kern3pt \vbox\bgroup \kern3pt \hsize=\cartinner \baselineskip=\normbskip \lineskip=\normlskip \parskip=\normpskip \vskip -\parskip \comment % For explanation, see the end of def\group. } \def\Ecartouche{% \ifhmode\par\fi \kern3pt \egroup \kern3pt\vrule \hskip\rskip \egroup \cartbot \egroup \checkinserts } % This macro is called at the beginning of all the @example variants, % inside a group. \newdimen\nonfillparindent \def\nonfillstart{% \aboveenvbreak \hfuzz = 12pt % Don't be fussy \sepspaces % Make spaces be word-separators rather than space tokens. \let\par = \lisppar % don't ignore blank lines \obeylines % each line of input is a line of output \parskip = 0pt % Turn off paragraph indentation but redefine \indent to emulate % the normal \indent. \nonfillparindent=\parindent \parindent = 0pt \let\indent\nonfillindent % \emergencystretch = 0pt % don't try to avoid overfull boxes \ifx\nonarrowing\relax \advance \leftskip by \lispnarrowing \exdentamount=\lispnarrowing \else \let\nonarrowing = \relax \fi \let\exdent=\nofillexdent } \begingroup \obeyspaces % We want to swallow spaces (but not other tokens) after the fake % @indent in our nonfill-environments, where spaces are normally % active and set to @tie, resulting in them not being ignored after % @indent. \gdef\nonfillindent{\futurelet\temp\nonfillindentcheck}% \gdef\nonfillindentcheck{% \ifx\temp % \expandafter\nonfillindentgobble% \else% \leavevmode\nonfillindentbox% \fi% }% \endgroup \def\nonfillindentgobble#1{\nonfillindent} \def\nonfillindentbox{\hbox to \nonfillparindent{\hss}} % If you want all examples etc. small: @set dispenvsize small. % If you want even small examples the full size: @set dispenvsize nosmall. % This affects the following displayed environments: % @example, @display, @format, @lisp % \def\smallword{small} \def\nosmallword{nosmall} \let\SETdispenvsize\relax \def\setnormaldispenv{% \ifx\SETdispenvsize\smallword % end paragraph for sake of leading, in case document has no blank % line. This is redundant with what happens in \aboveenvbreak, but % we need to do it before changing the fonts, and it's inconvenient % to change the fonts afterward. \ifnum \lastpenalty=10000 \else \endgraf \fi \smallexamplefonts \rm \fi } \def\setsmalldispenv{% \ifx\SETdispenvsize\nosmallword \else \ifnum \lastpenalty=10000 \else \endgraf \fi \smallexamplefonts \rm \fi } % We often define two environments, @foo and @smallfoo. % Let's do it in one command. #1 is the env name, #2 the definition. \def\makedispenvdef#1#2{% \expandafter\envdef\csname#1\endcsname {\setnormaldispenv #2}% \expandafter\envdef\csname small#1\endcsname {\setsmalldispenv #2}% \expandafter\let\csname E#1\endcsname \afterenvbreak \expandafter\let\csname Esmall#1\endcsname \afterenvbreak } % Define two environment synonyms (#1 and #2) for an environment. \def\maketwodispenvdef#1#2#3{% \makedispenvdef{#1}{#3}% \makedispenvdef{#2}{#3}% } % % @lisp: indented, narrowed, typewriter font; % @example: same as @lisp. % % @smallexample and @smalllisp: use smaller fonts. % Originally contributed by Pavel@xerox. % \maketwodispenvdef{lisp}{example}{% \nonfillstart \tt\setupmarkupstyle{example}% \let\kbdfont = \kbdexamplefont % Allow @kbd to do something special. \gobble % eat return } % @display/@smalldisplay: same as @lisp except keep current font. % \makedispenvdef{display}{% \nonfillstart \gobble } % @format/@smallformat: same as @display except don't narrow margins. % \makedispenvdef{format}{% \let\nonarrowing = t% \nonfillstart \gobble } % @flushleft: same as @format, but doesn't obey \SETdispenvsize. \envdef\flushleft{% \let\nonarrowing = t% \nonfillstart \gobble } \let\Eflushleft = \afterenvbreak % @flushright. % \envdef\flushright{% \let\nonarrowing = t% \nonfillstart \advance\leftskip by 0pt plus 1fill\relax \gobble } \let\Eflushright = \afterenvbreak % @raggedright does more-or-less normal line breaking but no right % justification. From plain.tex. \envdef\raggedright{% \rightskip0pt plus2em \spaceskip.3333em \xspaceskip.5em\relax } \let\Eraggedright\par \envdef\raggedleft{% \parindent=0pt \leftskip0pt plus2em \spaceskip.3333em \xspaceskip.5em \parfillskip=0pt \hbadness=10000 % Last line will usually be underfull, so turn off % badness reporting. } \let\Eraggedleft\par \envdef\raggedcenter{% \parindent=0pt \rightskip0pt plus1em \leftskip0pt plus1em \spaceskip.3333em \xspaceskip.5em \parfillskip=0pt \hbadness=10000 % Last line will usually be underfull, so turn off % badness reporting. } \let\Eraggedcenter\par % @quotation does normal linebreaking (hence we can't use \nonfillstart) % and narrows the margins. We keep \parskip nonzero in general, since % we're doing normal filling. So, when using \aboveenvbreak and % \afterenvbreak, temporarily make \parskip 0. % \makedispenvdef{quotation}{\quotationstart} % \def\quotationstart{% \indentedblockstart % same as \indentedblock, but increase right margin too. \ifx\nonarrowing\relax \advance\rightskip by \lispnarrowing \fi \parsearg\quotationlabel } % We have retained a nonzero parskip for the environment, since we're % doing normal filling. % \def\Equotation{% \par \ifx\quotationauthor\thisisundefined\else % indent a bit. \leftline{\kern 2\leftskip \sl ---\quotationauthor}% \fi {\parskip=0pt \afterenvbreak}% } \def\Esmallquotation{\Equotation} % If we're given an argument, typeset it in bold with a colon after. \def\quotationlabel#1{% \def\temp{#1}% \ifx\temp\empty \else {\bf #1: }% \fi } % @indentedblock is like @quotation, but indents only on the left and % has no optional argument. % \makedispenvdef{indentedblock}{\indentedblockstart} % \def\indentedblockstart{% {\parskip=0pt \aboveenvbreak}% because \aboveenvbreak inserts \parskip \parindent=0pt % % @cartouche defines \nonarrowing to inhibit narrowing at next level down. \ifx\nonarrowing\relax \advance\leftskip by \lispnarrowing \exdentamount = \lispnarrowing \else \let\nonarrowing = \relax \fi } % Keep a nonzero parskip for the environment, since we're doing normal filling. % \def\Eindentedblock{% \par {\parskip=0pt \afterenvbreak}% } \def\Esmallindentedblock{\Eindentedblock} % LaTeX-like @verbatim...@end verbatim and @verb{...} % If we want to allow any as delimiter, % we need the curly braces so that makeinfo sees the @verb command, eg: % `@verbx...x' would look like the '@verbx' command. --janneke@gnu.org % % [Knuth]: Donald Ervin Knuth, 1996. The TeXbook. % % [Knuth] p.344; only we need to do the other characters Texinfo sets % active too. Otherwise, they get lost as the first character on a % verbatim line. \def\dospecials{% \do\ \do\\\do\{\do\}\do\$\do\&% \do\#\do\^\do\^^K\do\_\do\^^A\do\%\do\~% \do\<\do\>\do\|\do\@\do+\do\"% % Don't do the quotes -- if we do, @set txicodequoteundirected and % @set txicodequotebacktick will not have effect on @verb and % @verbatim, and ?` and !` ligatures won't get disabled. %\do\`\do\'% } % % [Knuth] p. 380 \def\uncatcodespecials{% \def\do##1{\catcode`##1=\other}\dospecials} % % Setup for the @verb command. % % Eight spaces for a tab \begingroup \catcode`\^^I=\active \gdef\tabeightspaces{\catcode`\^^I=\active\def^^I{\ \ \ \ \ \ \ \ }} \endgroup % \def\setupverb{% \tt % easiest (and conventionally used) font for verbatim \def\par{\leavevmode\endgraf}% \setupmarkupstyle{verb}% \tabeightspaces % Respect line breaks, % print special symbols as themselves, and % make each space count % must do in this order: \obeylines \uncatcodespecials \sepspaces } % Setup for the @verbatim environment % % Real tab expansion. \newdimen\tabw \setbox0=\hbox{\tt\space} \tabw=8\wd0 % tab amount % % We typeset each line of the verbatim in an \hbox, so we can handle % tabs. The \global is in case the verbatim line starts with an accent, % or some other command that starts with a begin-group. Otherwise, the % entire \verbbox would disappear at the corresponding end-group, before % it is typeset. Meanwhile, we can't have nested verbatim commands % (can we?), so the \global won't be overwriting itself. \newbox\verbbox \def\starttabbox{\global\setbox\verbbox=\hbox\bgroup} % \begingroup \catcode`\^^I=\active \gdef\tabexpand{% \catcode`\^^I=\active \def^^I{\leavevmode\egroup \dimen\verbbox=\wd\verbbox % the width so far, or since the previous tab \divide\dimen\verbbox by\tabw \multiply\dimen\verbbox by\tabw % compute previous multiple of \tabw \advance\dimen\verbbox by\tabw % advance to next multiple of \tabw \wd\verbbox=\dimen\verbbox \box\verbbox \starttabbox }% } \endgroup % start the verbatim environment. \def\setupverbatim{% \let\nonarrowing = t% \nonfillstart \tt % easiest (and conventionally used) font for verbatim % The \leavevmode here is for blank lines. Otherwise, we would % never \starttabox and the \egroup would end verbatim mode. \def\par{\leavevmode\egroup\box\verbbox\endgraf}% \tabexpand \setupmarkupstyle{verbatim}% % Respect line breaks, % print special symbols as themselves, and % make each space count. % Must do in this order: \obeylines \uncatcodespecials \sepspaces \everypar{\starttabbox}% } % Do the @verb magic: verbatim text is quoted by unique % delimiter characters. Before first delimiter expect a % right brace, after last delimiter expect closing brace: % % \def\doverb'{'#1'}'{#1} % % [Knuth] p. 382; only eat outer {} \begingroup \catcode`[=1\catcode`]=2\catcode`\{=\other\catcode`\}=\other \gdef\doverb{#1[\def\next##1#1}[##1\endgroup]\next] \endgroup % \def\verb{\begingroup\setupverb\doverb} % % % Do the @verbatim magic: define the macro \doverbatim so that % the (first) argument ends when '@end verbatim' is reached, ie: % % \def\doverbatim#1@end verbatim{#1} % % For Texinfo it's a lot easier than for LaTeX, % because texinfo's \verbatim doesn't stop at '\end{verbatim}': % we need not redefine '\', '{' and '}'. % % Inspired by LaTeX's verbatim command set [latex.ltx] % \begingroup \catcode`\ =\active \obeylines % % ignore everything up to the first ^^M, that's the newline at the end % of the @verbatim input line itself. Otherwise we get an extra blank % line in the output. \xdef\doverbatim#1^^M#2@end verbatim{#2\noexpand\end\gobble verbatim}% % We really want {...\end verbatim} in the body of the macro, but % without the active space; thus we have to use \xdef and \gobble. \endgroup % \envdef\verbatim{% \setupverbatim\doverbatim } \let\Everbatim = \afterenvbreak % @verbatiminclude FILE - insert text of file in verbatim environment. % \def\verbatiminclude{\parseargusing\filenamecatcodes\doverbatiminclude} % \def\doverbatiminclude#1{% {% \makevalueexpandable \setupverbatim \indexnofonts % Allow `@@' and other weird things in file names. \wlog{texinfo.tex: doing @verbatiminclude of #1^^J}% \input #1 \afterenvbreak }% } % @copying ... @end copying. % Save the text away for @insertcopying later. % % We save the uninterpreted tokens, rather than creating a box. % Saving the text in a box would be much easier, but then all the % typesetting commands (@smallbook, font changes, etc.) have to be done % beforehand -- and a) we want @copying to be done first in the source % file; b) letting users define the frontmatter in as flexible order as % possible is very desirable. % \def\copying{\checkenv{}\begingroup\scanargctxt\docopying} \def\docopying#1@end copying{\endgroup\def\copyingtext{#1}} % \def\insertcopying{% \begingroup \parindent = 0pt % paragraph indentation looks wrong on title page \scanexp\copyingtext \endgroup } \message{defuns,} % @defun etc. \newskip\defbodyindent \defbodyindent=.4in \newskip\defargsindent \defargsindent=50pt \newskip\deflastargmargin \deflastargmargin=18pt \newcount\defunpenalty % Start the processing of @deffn: \def\startdefun{% \ifnum\lastpenalty<10000 \medbreak \defunpenalty=10003 % Will keep this @deffn together with the % following @def command, see below. \else % If there are two @def commands in a row, we'll have a \nobreak, % which is there to keep the function description together with its % header. But if there's nothing but headers, we need to allow a % break somewhere. Check specifically for penalty 10002, inserted % by \printdefunline, instead of 10000, since the sectioning % commands also insert a nobreak penalty, and we don't want to allow % a break between a section heading and a defun. % % As a further refinement, we avoid "club" headers by signalling % with penalty of 10003 after the very first @deffn in the % sequence (see above), and penalty of 10002 after any following % @def command. \ifnum\lastpenalty=10002 \penalty2000 \else \defunpenalty=10002 \fi % % Similarly, after a section heading, do not allow a break. % But do insert the glue. \medskip % preceded by discardable penalty, so not a breakpoint \fi % \parindent=0in \advance\leftskip by \defbodyindent \exdentamount=\defbodyindent } \def\dodefunx#1{% % First, check whether we are in the right environment: \checkenv#1% % % As above, allow line break if we have multiple x headers in a row. % It's not a great place, though. \ifnum\lastpenalty=10002 \penalty3000 \else \defunpenalty=10002 \fi % % And now, it's time to reuse the body of the original defun: \expandafter\gobbledefun#1% } \def\gobbledefun#1\startdefun{} % \printdefunline \deffnheader{text} % \def\printdefunline#1#2{% \begingroup % call \deffnheader: #1#2 \endheader % common ending: \interlinepenalty = 10000 \advance\rightskip by 0pt plus 1fil\relax \endgraf \nobreak\vskip -\parskip \penalty\defunpenalty % signal to \startdefun and \dodefunx % Some of the @defun-type tags do not enable magic parentheses, % rendering the following check redundant. But we don't optimize. \checkparencounts \endgroup } \def\Edefun{\endgraf\medbreak} % \makedefun{deffn} creates \deffn, \deffnx and \Edeffn; % the only thing remaining is to define \deffnheader. % \def\makedefun#1{% \expandafter\let\csname E#1\endcsname = \Edefun \edef\temp{\noexpand\domakedefun \makecsname{#1}\makecsname{#1x}\makecsname{#1header}}% \temp } % \domakedefun \deffn \deffnx \deffnheader % % Define \deffn and \deffnx, without parameters. % \deffnheader has to be defined explicitly. % \def\domakedefun#1#2#3{% \envdef#1{% \startdefun \doingtypefnfalse % distinguish typed functions from all else \parseargusing\activeparens{\printdefunline#3}% }% \def#2{\dodefunx#1}% \def#3% } \newif\ifdoingtypefn % doing typed function? \newif\ifrettypeownline % typeset return type on its own line? % @deftypefnnewline on|off says whether the return type of typed functions % are printed on their own line. This affects @deftypefn, @deftypefun, % @deftypeop, and @deftypemethod. % \parseargdef\deftypefnnewline{% \def\temp{#1}% \ifx\temp\onword \expandafter\let\csname SETtxideftypefnnl\endcsname = \empty \else\ifx\temp\offword \expandafter\let\csname SETtxideftypefnnl\endcsname = \relax \else \errhelp = \EMsimple \errmessage{Unknown @txideftypefnnl value `\temp', must be on|off}% \fi\fi } % Untyped functions: % @deffn category name args \makedefun{deffn}{\deffngeneral{}} % @deffn category class name args \makedefun{defop}#1 {\defopon{#1\ \putwordon}} % \defopon {category on}class name args \def\defopon#1#2 {\deffngeneral{\putwordon\ \code{#2}}{#1\ \code{#2}} } % \deffngeneral {subind}category name args % \def\deffngeneral#1#2 #3 #4\endheader{% % Remember that \dosubind{fn}{foo}{} is equivalent to \doind{fn}{foo}. \dosubind{fn}{\code{#3}}{#1}% \defname{#2}{}{#3}\magicamp\defunargs{#4\unskip}% } % Typed functions: % @deftypefn category type name args \makedefun{deftypefn}{\deftypefngeneral{}} % @deftypeop category class type name args \makedefun{deftypeop}#1 {\deftypeopon{#1\ \putwordon}} % \deftypeopon {category on}class type name args \def\deftypeopon#1#2 {\deftypefngeneral{\putwordon\ \code{#2}}{#1\ \code{#2}} } % \deftypefngeneral {subind}category type name args % \def\deftypefngeneral#1#2 #3 #4 #5\endheader{% \dosubind{fn}{\code{#4}}{#1}% \doingtypefntrue \defname{#2}{#3}{#4}\defunargs{#5\unskip}% } % Typed variables: % @deftypevr category type var args \makedefun{deftypevr}{\deftypecvgeneral{}} % @deftypecv category class type var args \makedefun{deftypecv}#1 {\deftypecvof{#1\ \putwordof}} % \deftypecvof {category of}class type var args \def\deftypecvof#1#2 {\deftypecvgeneral{\putwordof\ \code{#2}}{#1\ \code{#2}} } % \deftypecvgeneral {subind}category type var args % \def\deftypecvgeneral#1#2 #3 #4 #5\endheader{% \dosubind{vr}{\code{#4}}{#1}% \defname{#2}{#3}{#4}\defunargs{#5\unskip}% } % Untyped variables: % @defvr category var args \makedefun{defvr}#1 {\deftypevrheader{#1} {} } % @defcv category class var args \makedefun{defcv}#1 {\defcvof{#1\ \putwordof}} % \defcvof {category of}class var args \def\defcvof#1#2 {\deftypecvof{#1}#2 {} } % Types: % @deftp category name args \makedefun{deftp}#1 #2 #3\endheader{% \doind{tp}{\code{#2}}% \defname{#1}{}{#2}\defunargs{#3\unskip}% } % Remaining @defun-like shortcuts: \makedefun{defun}{\deffnheader{\putwordDeffunc} } \makedefun{defmac}{\deffnheader{\putwordDefmac} } \makedefun{defspec}{\deffnheader{\putwordDefspec} } \makedefun{deftypefun}{\deftypefnheader{\putwordDeffunc} } \makedefun{defvar}{\defvrheader{\putwordDefvar} } \makedefun{defopt}{\defvrheader{\putwordDefopt} } \makedefun{deftypevar}{\deftypevrheader{\putwordDefvar} } \makedefun{defmethod}{\defopon\putwordMethodon} \makedefun{deftypemethod}{\deftypeopon\putwordMethodon} \makedefun{defivar}{\defcvof\putwordInstanceVariableof} \makedefun{deftypeivar}{\deftypecvof\putwordInstanceVariableof} % \defname, which formats the name of the @def (not the args). % #1 is the category, such as "Function". % #2 is the return type, if any. % #3 is the function name. % % We are followed by (but not passed) the arguments, if any. % \def\defname#1#2#3{% \par % Get the values of \leftskip and \rightskip as they were outside the @def... \advance\leftskip by -\defbodyindent % % Determine if we are typesetting the return type of a typed function % on a line by itself. \rettypeownlinefalse \ifdoingtypefn % doing a typed function specifically? % then check user option for putting return type on its own line: \expandafter\ifx\csname SETtxideftypefnnl\endcsname\relax \else \rettypeownlinetrue \fi \fi % % How we'll format the category name. Putting it in brackets helps % distinguish it from the body text that may end up on the next line % just below it. \def\temp{#1}% \setbox0=\hbox{\kern\deflastargmargin \ifx\temp\empty\else [\rm\temp]\fi} % % Figure out line sizes for the paragraph shape. We'll always have at % least two. \tempnum = 2 % % The first line needs space for \box0; but if \rightskip is nonzero, % we need only space for the part of \box0 which exceeds it: \dimen0=\hsize \advance\dimen0 by -\wd0 \advance\dimen0 by \rightskip % % If doing a return type on its own line, we'll have another line. \ifrettypeownline \advance\tempnum by 1 \def\maybeshapeline{0in \hsize}% \else \def\maybeshapeline{}% \fi % % The continuations: \dimen2=\hsize \advance\dimen2 by -\defargsindent % % The final paragraph shape: \parshape \tempnum 0in \dimen0 \maybeshapeline \defargsindent \dimen2 % % Put the category name at the right margin. \noindent \hbox to 0pt{% \hfil\box0 \kern-\hsize % \hsize has to be shortened this way: \kern\leftskip % Intentionally do not respect \rightskip, since we need the space. }% % % Allow all lines to be underfull without complaint: \tolerance=10000 \hbadness=10000 \exdentamount=\defbodyindent {% % defun fonts. We use typewriter by default (used to be bold) because: % . we're printing identifiers, they should be in tt in principle. % . in languages with many accents, such as Czech or French, it's % common to leave accents off identifiers. The result looks ok in % tt, but exceedingly strange in rm. % . we don't want -- and --- to be treated as ligatures. % . this still does not fix the ?` and !` ligatures, but so far no % one has made identifiers using them :). \df \tt \def\temp{#2}% text of the return type \ifx\temp\empty\else \tclose{\temp}% typeset the return type \ifrettypeownline % put return type on its own line; prohibit line break following: \hfil\vadjust{\nobreak}\break \else \space % type on same line, so just followed by a space \fi \fi % no return type #3% output function name }% {\rm\enskip}% hskip 0.5 em of \tenrm % \boldbrax % arguments will be output next, if any. } % Print arguments in slanted roman (not ttsl), inconsistently with using % tt for the name. This is because literal text is sometimes needed in % the argument list (groff manual), and ttsl and tt are not very % distinguishable. Prevent hyphenation at `-' chars. % \def\defunargs#1{% % use sl by default (not ttsl), % tt for the names. \df \sl \hyphenchar\font=0 % % On the other hand, if an argument has two dashes (for instance), we % want a way to get ttsl. We used to recommend @var for that, so % leave the code in, but it's strange for @var to lead to typewriter. % Nowadays we recommend @code, since the difference between a ttsl hyphen % and a tt hyphen is pretty tiny. @code also disables ?` !`. \def\var##1{{\setupmarkupstyle{var}\ttslanted{##1}}}% #1% \sl\hyphenchar\font=45 } % We want ()&[] to print specially on the defun line. % \def\activeparens{% \catcode`\(=\active \catcode`\)=\active \catcode`\[=\active \catcode`\]=\active \catcode`\&=\active } % Make control sequences which act like normal parenthesis chars. \let\lparen = ( \let\rparen = ) % Be sure that we always have a definition for `(', etc. For example, % if the fn name has parens in it, \boldbrax will not be in effect yet, % so TeX would otherwise complain about undefined control sequence. { \activeparens \global\let(=\lparen \global\let)=\rparen \global\let[=\lbrack \global\let]=\rbrack \global\let& = \& \gdef\boldbrax{\let(=\opnr\let)=\clnr\let[=\lbrb\let]=\rbrb} \gdef\magicamp{\let&=\amprm} } \newcount\parencount % If we encounter &foo, then turn on ()-hacking afterwards \newif\ifampseen \def\amprm#1 {\ampseentrue{\bf\ }} \def\parenfont{% \ifampseen % At the first level, print parens in roman, % otherwise use the default font. \ifnum \parencount=1 \rm \fi \else % The \sf parens (in \boldbrax) actually are a little bolder than % the contained text. This is especially needed for [ and ] . \sf \fi } \def\infirstlevel#1{% \ifampseen \ifnum\parencount=1 #1% \fi \fi } \def\bfafterword#1 {#1 \bf} \def\opnr{% \global\advance\parencount by 1 {\parenfont(}% \infirstlevel \bfafterword } \def\clnr{% {\parenfont)}% \infirstlevel \sl \global\advance\parencount by -1 } \newcount\brackcount \def\lbrb{% \global\advance\brackcount by 1 {\bf[}% } \def\rbrb{% {\bf]}% \global\advance\brackcount by -1 } \def\checkparencounts{% \ifnum\parencount=0 \else \badparencount \fi \ifnum\brackcount=0 \else \badbrackcount \fi } % these should not use \errmessage; the glibc manual, at least, actually % has such constructs (when documenting function pointers). \def\badparencount{% \message{Warning: unbalanced parentheses in @def...}% \global\parencount=0 } \def\badbrackcount{% \message{Warning: unbalanced square brackets in @def...}% \global\brackcount=0 } \message{macros,} % @macro. % To do this right we need a feature of e-TeX, \scantokens, % which we arrange to emulate with a temporary file in ordinary TeX. \ifx\eTeXversion\thisisundefined \newwrite\macscribble \def\scantokens#1{% \toks0={#1}% \immediate\openout\macscribble=\jobname.tmp \immediate\write\macscribble{\the\toks0}% \immediate\closeout\macscribble \input \jobname.tmp } \fi \def\scanmacro#1{\begingroup \newlinechar`\^^M \let\xeatspaces\eatspaces % % Undo catcode changes of \startcontents and \doprintindex % When called from @insertcopying or (short)caption, we need active % backslash to get it printed correctly. Previously, we had % \catcode`\\=\other instead. We'll see whether a problem appears % with macro expansion. --kasal, 19aug04 \catcode`\@=0 \catcode`\\=\active \escapechar=`\@ % % ... and for \example: \spaceisspace % % The \empty here causes a following catcode 5 newline to be eaten as % part of reading whitespace after a control sequence. It does not % eat a catcode 13 newline. There's no good way to handle the two % cases (untried: maybe e-TeX's \everyeof could help, though plain TeX % would then have different behavior). See the Macro Details node in % the manual for the workaround we recommend for macros and % line-oriented commands. % \scantokens{#1\empty}% \endgroup} \def\scanexp#1{% \edef\temp{\noexpand\scanmacro{#1}}% \temp } \newcount\paramno % Count of parameters \newtoks\macname % Macro name \newif\ifrecursive % Is it recursive? % List of all defined macros in the form % \definedummyword\macro1\definedummyword\macro2... % Currently is also contains all @aliases; the list can be split % if there is a need. \def\macrolist{} % Add the macro to \macrolist \def\addtomacrolist#1{\expandafter \addtomacrolistxxx \csname#1\endcsname} \def\addtomacrolistxxx#1{% \toks0 = \expandafter{\macrolist\definedummyword#1}% \xdef\macrolist{\the\toks0}% } % Utility routines. % This does \let #1 = #2, with \csnames; that is, % \let \csname#1\endcsname = \csname#2\endcsname % (except of course we have to play expansion games). % \def\cslet#1#2{% \expandafter\let \csname#1\expandafter\endcsname \csname#2\endcsname } % Trim leading and trailing spaces off a string. % Concepts from aro-bend problem 15 (see CTAN). {\catcode`\@=11 \gdef\eatspaces #1{\expandafter\trim@\expandafter{#1 }} \gdef\trim@ #1{\trim@@ @#1 @ #1 @ @@} \gdef\trim@@ #1@ #2@ #3@@{\trim@@@\empty #2 @} \def\unbrace#1{#1} \unbrace{\gdef\trim@@@ #1 } #2@{#1} } % Trim a single trailing ^^M off a string. {\catcode`\^^M=\other \catcode`\Q=3% \gdef\eatcr #1{\eatcra #1Q^^MQ}% \gdef\eatcra#1^^MQ{\eatcrb#1Q}% \gdef\eatcrb#1Q#2Q{#1}% } % Macro bodies are absorbed as an argument in a context where % all characters are catcode 10, 11 or 12, except \ which is active % (as in normal texinfo). It is necessary to change the definition of \ % to recognize macro arguments; this is the job of \mbodybackslash. % % Non-ASCII encodings make 8-bit characters active, so un-activate % them to avoid their expansion. Must do this non-globally, to % confine the change to the current group. % % It's necessary to have hard CRs when the macro is executed. This is % done by making ^^M (\endlinechar) catcode 12 when reading the macro % body, and then making it the \newlinechar in \scanmacro. % \def\scanctxt{% used as subroutine \catcode`\"=\other \catcode`\+=\other \catcode`\<=\other \catcode`\>=\other \catcode`\@=\other \catcode`\^=\other \catcode`\_=\other \catcode`\|=\other \catcode`\~=\other \ifx\declaredencoding\ascii \else \setnonasciicharscatcodenonglobal\other \fi } \def\scanargctxt{% used for copying and captions, not macros. \scanctxt \catcode`\\=\other \catcode`\^^M=\other } \def\macrobodyctxt{% used for @macro definitions \scanctxt \catcode`\{=\other \catcode`\}=\other \catcode`\^^M=\other \usembodybackslash } \def\macroargctxt{% used when scanning invocations \scanctxt \catcode`\\=0 } % why catcode 0 for \ in the above? To recognize \\ \{ \} as "escapes" % for the single characters \ { }. Thus, we end up with the "commands" % that would be written @\ @{ @} in a Texinfo document. % % We already have @{ and @}. For @\, we define it here, and only for % this purpose, to produce a typewriter backslash (so, the @\ that we % define for @math can't be used with @macro calls): % \def\\{\normalbackslash}% % % We would like to do this for \, too, since that is what makeinfo does. % But it is not possible, because Texinfo already has a command @, for a % cedilla accent. Documents must use @comma{} instead. % % \anythingelse will almost certainly be an error of some kind. % \mbodybackslash is the definition of \ in @macro bodies. % It maps \foo\ => \csname macarg.foo\endcsname => #N % where N is the macro parameter number. % We define \csname macarg.\endcsname to be \realbackslash, so % \\ in macro replacement text gets you a backslash. % {\catcode`@=0 @catcode`@\=@active @gdef@usembodybackslash{@let\=@mbodybackslash} @gdef@mbodybackslash#1\{@csname macarg.#1@endcsname} } \expandafter\def\csname macarg.\endcsname{\realbackslash} \def\margbackslash#1{\char`\#1 } \def\macro{\recursivefalse\parsearg\macroxxx} \def\rmacro{\recursivetrue\parsearg\macroxxx} \def\macroxxx#1{% \getargs{#1}% now \macname is the macname and \argl the arglist \ifx\argl\empty % no arguments \paramno=0\relax \else \expandafter\parsemargdef \argl;% \if\paramno>256\relax \ifx\eTeXversion\thisisundefined \errhelp = \EMsimple \errmessage{You need eTeX to compile a file with macros with more than 256 arguments} \fi \fi \fi \if1\csname ismacro.\the\macname\endcsname \message{Warning: redefining \the\macname}% \else \expandafter\ifx\csname \the\macname\endcsname \relax \else \errmessage{Macro name \the\macname\space already defined}\fi \global\cslet{macsave.\the\macname}{\the\macname}% \global\expandafter\let\csname ismacro.\the\macname\endcsname=1% \addtomacrolist{\the\macname}% \fi \begingroup \macrobodyctxt \ifrecursive \expandafter\parsermacbody \else \expandafter\parsemacbody \fi} \parseargdef\unmacro{% \if1\csname ismacro.#1\endcsname \global\cslet{#1}{macsave.#1}% \global\expandafter\let \csname ismacro.#1\endcsname=0% % Remove the macro name from \macrolist: \begingroup \expandafter\let\csname#1\endcsname \relax \let\definedummyword\unmacrodo \xdef\macrolist{\macrolist}% \endgroup \else \errmessage{Macro #1 not defined}% \fi } % Called by \do from \dounmacro on each macro. The idea is to omit any % macro definitions that have been changed to \relax. % \def\unmacrodo#1{% \ifx #1\relax % remove this \else \noexpand\definedummyword \noexpand#1% \fi } % This makes use of the obscure feature that if the last token of a % is #, then the preceding argument is delimited by % an opening brace, and that opening brace is not consumed. \def\getargs#1{\getargsxxx#1{}} \def\getargsxxx#1#{\getmacname #1 \relax\getmacargs} \def\getmacname#1 #2\relax{\macname={#1}} \def\getmacargs#1{\def\argl{#1}} % For macro processing make @ a letter so that we can make Texinfo private macro names. \edef\texiatcatcode{\the\catcode`\@} \catcode `@=11\relax % Parse the optional {params} list. Set up \paramno and \paramlist % so \defmacro knows what to do. Define \macarg.BLAH for each BLAH % in the params list to some hook where the argument si to be expanded. If % there are less than 10 arguments that hook is to be replaced by ##N where N % is the position in that list, that is to say the macro arguments are to be % defined `a la TeX in the macro body. % % That gets used by \mbodybackslash (above). % % We need to get `macro parameter char #' into several definitions. % The technique used is stolen from LaTeX: let \hash be something % unexpandable, insert that wherever you need a #, and then redefine % it to # just before using the token list produced. % % The same technique is used to protect \eatspaces till just before % the macro is used. % % If there are 10 or more arguments, a different technique is used, where the % hook remains in the body, and when macro is to be expanded the body is % processed again to replace the arguments. % % In that case, the hook is \the\toks N-1, and we simply set \toks N-1 to the % argument N value and then \edef the body (nothing else will expand because of % the catcode regime underwhich the body was input). % % If you compile with TeX (not eTeX), and you have macros with 10 or more % arguments, you need that no macro has more than 256 arguments, otherwise an % error is produced. \def\parsemargdef#1;{% \paramno=0\def\paramlist{}% \let\hash\relax \let\xeatspaces\relax \parsemargdefxxx#1,;,% % In case that there are 10 or more arguments we parse again the arguments % list to set new definitions for the \macarg.BLAH macros corresponding to % each BLAH argument. It was anyhow needed to parse already once this list % in order to count the arguments, and as macros with at most 9 arguments % are by far more frequent than macro with 10 or more arguments, defining % twice the \macarg.BLAH macros does not cost too much processing power. \ifnum\paramno<10\relax\else \paramno0\relax \parsemmanyargdef@@#1,;,% 10 or more arguments \fi } \def\parsemargdefxxx#1,{% \if#1;\let\next=\relax \else \let\next=\parsemargdefxxx \advance\paramno by 1 \expandafter\edef\csname macarg.\eatspaces{#1}\endcsname {\xeatspaces{\hash\the\paramno}}% \edef\paramlist{\paramlist\hash\the\paramno,}% \fi\next} \def\parsemmanyargdef@@#1,{% \if#1;\let\next=\relax \else \let\next=\parsemmanyargdef@@ \edef\tempb{\eatspaces{#1}}% \expandafter\def\expandafter\tempa \expandafter{\csname macarg.\tempb\endcsname}% % Note that we need some extra \noexpand\noexpand, this is because we % don't want \the to be expanded in the \parsermacbody as it uses an % \xdef . \expandafter\edef\tempa {\noexpand\noexpand\noexpand\the\toks\the\paramno}% \advance\paramno by 1\relax \fi\next} % These two commands read recursive and nonrecursive macro bodies. % (They're different since rec and nonrec macros end differently.) % \catcode `\@\texiatcatcode \long\def\parsemacbody#1@end macro% {\xdef\temp{\eatcr{#1}}\endgroup\defmacro}% \long\def\parsermacbody#1@end rmacro% {\xdef\temp{\eatcr{#1}}\endgroup\defmacro}% \catcode `\@=11\relax \let\endargs@\relax \let\nil@\relax \def\nilm@{\nil@}% \long\def\nillm@{\nil@}% % This macro is expanded during the Texinfo macro expansion, not during its % definition. It gets all the arguments values and assigns them to macros % macarg.ARGNAME % % #1 is the macro name % #2 is the list of argument names % #3 is the list of argument values \def\getargvals@#1#2#3{% \def\macargdeflist@{}% \def\saveparamlist@{#2}% Need to keep a copy for parameter expansion. \def\paramlist{#2,\nil@}% \def\macroname{#1}% \begingroup \macroargctxt \def\argvaluelist{#3,\nil@}% \def\@tempa{#3}% \ifx\@tempa\empty \setemptyargvalues@ \else \getargvals@@ \fi } % \def\getargvals@@{% \ifx\paramlist\nilm@ % Some sanity check needed here that \argvaluelist is also empty. \ifx\argvaluelist\nillm@ \else \errhelp = \EMsimple \errmessage{Too many arguments in macro `\macroname'!}% \fi \let\next\macargexpandinbody@ \else \ifx\argvaluelist\nillm@ % No more arguments values passed to macro. Set remaining named-arg % macros to empty. \let\next\setemptyargvalues@ \else % pop current arg name into \@tempb \def\@tempa##1{\pop@{\@tempb}{\paramlist}##1\endargs@}% \expandafter\@tempa\expandafter{\paramlist}% % pop current argument value into \@tempc \def\@tempa##1{\longpop@{\@tempc}{\argvaluelist}##1\endargs@}% \expandafter\@tempa\expandafter{\argvaluelist}% % Here \@tempb is the current arg name and \@tempc is the current arg value. % First place the new argument macro definition into \@tempd \expandafter\macname\expandafter{\@tempc}% \expandafter\let\csname macarg.\@tempb\endcsname\relax \expandafter\def\expandafter\@tempe\expandafter{% \csname macarg.\@tempb\endcsname}% \edef\@tempd{\long\def\@tempe{\the\macname}}% \push@\@tempd\macargdeflist@ \let\next\getargvals@@ \fi \fi \next } \def\push@#1#2{% \expandafter\expandafter\expandafter\def \expandafter\expandafter\expandafter#2% \expandafter\expandafter\expandafter{% \expandafter#1#2}% } % Replace arguments by their values in the macro body, and place the result % in macro \@tempa \def\macvalstoargs@{% % To do this we use the property that token registers that are \the'ed % within an \edef expand only once. So we are going to place all argument % values into respective token registers. % % First we save the token context, and initialize argument numbering. \begingroup \paramno0\relax % Then, for each argument number #N, we place the corresponding argument % value into a new token list register \toks#N \expandafter\putargsintokens@\saveparamlist@,;,% % Then, we expand the body so that argument are replaced by their % values. The trick for values not to be expanded themselves is that they % are within tokens and that tokens expand only once in an \edef . \edef\@tempc{\csname mac.\macroname .body\endcsname}% % Now we restore the token stack pointer to free the token list registers % which we have used, but we make sure that expanded body is saved after % group. \expandafter \endgroup \expandafter\def\expandafter\@tempa\expandafter{\@tempc}% } \def\macargexpandinbody@{% %% Define the named-macro outside of this group and then close this group. \expandafter \endgroup \macargdeflist@ % First the replace in body the macro arguments by their values, the result % is in \@tempa . \macvalstoargs@ % Then we point at the \norecurse or \gobble (for recursive) macro value % with \@tempb . \expandafter\let\expandafter\@tempb\csname mac.\macroname .recurse\endcsname % Depending on whether it is recursive or not, we need some tailing % \egroup . \ifx\@tempb\gobble \let\@tempc\relax \else \let\@tempc\egroup \fi % And now we do the real job: \edef\@tempd{\noexpand\@tempb{\macroname}\noexpand\scanmacro{\@tempa}\@tempc}% \@tempd } \def\putargsintokens@#1,{% \if#1;\let\next\relax \else \let\next\putargsintokens@ % First we allocate the new token list register, and give it a temporary % alias \@tempb . \toksdef\@tempb\the\paramno % Then we place the argument value into that token list register. \expandafter\let\expandafter\@tempa\csname macarg.#1\endcsname \expandafter\@tempb\expandafter{\@tempa}% \advance\paramno by 1\relax \fi \next } % Save the token stack pointer into macro #1 \def\texisavetoksstackpoint#1{\edef#1{\the\@cclvi}} % Restore the token stack pointer from number in macro #1 \def\texirestoretoksstackpoint#1{\expandafter\mathchardef\expandafter\@cclvi#1\relax} % newtoks that can be used non \outer . \def\texinonouternewtoks{\alloc@ 5\toks \toksdef \@cclvi} % Tailing missing arguments are set to empty \def\setemptyargvalues@{% \ifx\paramlist\nilm@ \let\next\macargexpandinbody@ \else \expandafter\setemptyargvaluesparser@\paramlist\endargs@ \let\next\setemptyargvalues@ \fi \next } \def\setemptyargvaluesparser@#1,#2\endargs@{% \expandafter\def\expandafter\@tempa\expandafter{% \expandafter\def\csname macarg.#1\endcsname{}}% \push@\@tempa\macargdeflist@ \def\paramlist{#2}% } % #1 is the element target macro % #2 is the list macro % #3,#4\endargs@ is the list value \def\pop@#1#2#3,#4\endargs@{% \def#1{#3}% \def#2{#4}% } \long\def\longpop@#1#2#3,#4\endargs@{% \long\def#1{#3}% \long\def#2{#4}% } % This defines a Texinfo @macro. There are eight cases: recursive and % nonrecursive macros of zero, one, up to nine, and many arguments. % Much magic with \expandafter here. % \xdef is used so that macro definitions will survive the file % they're defined in; @include reads the file inside a group. % \def\defmacro{% \let\hash=##% convert placeholders to macro parameter chars \ifrecursive \ifcase\paramno % 0 \expandafter\xdef\csname\the\macname\endcsname{% \noexpand\scanmacro{\temp}}% \or % 1 \expandafter\xdef\csname\the\macname\endcsname{% \bgroup\noexpand\macroargctxt \noexpand\braceorline \expandafter\noexpand\csname\the\macname xxx\endcsname}% \expandafter\xdef\csname\the\macname xxx\endcsname##1{% \egroup\noexpand\scanmacro{\temp}}% \else \ifnum\paramno<10\relax % at most 9 \expandafter\xdef\csname\the\macname\endcsname{% \bgroup\noexpand\macroargctxt \noexpand\csname\the\macname xx\endcsname}% \expandafter\xdef\csname\the\macname xx\endcsname##1{% \expandafter\noexpand\csname\the\macname xxx\endcsname ##1,}% \expandafter\expandafter \expandafter\xdef \expandafter\expandafter \csname\the\macname xxx\endcsname \paramlist{\egroup\noexpand\scanmacro{\temp}}% \else % 10 or more \expandafter\xdef\csname\the\macname\endcsname{% \noexpand\getargvals@{\the\macname}{\argl}% }% \global\expandafter\let\csname mac.\the\macname .body\endcsname\temp \global\expandafter\let\csname mac.\the\macname .recurse\endcsname\gobble \fi \fi \else \ifcase\paramno % 0 \expandafter\xdef\csname\the\macname\endcsname{% \noexpand\norecurse{\the\macname}% \noexpand\scanmacro{\temp}\egroup}% \or % 1 \expandafter\xdef\csname\the\macname\endcsname{% \bgroup\noexpand\macroargctxt \noexpand\braceorline \expandafter\noexpand\csname\the\macname xxx\endcsname}% \expandafter\xdef\csname\the\macname xxx\endcsname##1{% \egroup \noexpand\norecurse{\the\macname}% \noexpand\scanmacro{\temp}\egroup}% \else % at most 9 \ifnum\paramno<10\relax \expandafter\xdef\csname\the\macname\endcsname{% \bgroup\noexpand\macroargctxt \expandafter\noexpand\csname\the\macname xx\endcsname}% \expandafter\xdef\csname\the\macname xx\endcsname##1{% \expandafter\noexpand\csname\the\macname xxx\endcsname ##1,}% \expandafter\expandafter \expandafter\xdef \expandafter\expandafter \csname\the\macname xxx\endcsname \paramlist{% \egroup \noexpand\norecurse{\the\macname}% \noexpand\scanmacro{\temp}\egroup}% \else % 10 or more: \expandafter\xdef\csname\the\macname\endcsname{% \noexpand\getargvals@{\the\macname}{\argl}% }% \global\expandafter\let\csname mac.\the\macname .body\endcsname\temp \global\expandafter\let\csname mac.\the\macname .recurse\endcsname\norecurse \fi \fi \fi} \catcode `\@\texiatcatcode\relax \def\norecurse#1{\bgroup\cslet{#1}{macsave.#1}} % \braceorline decides whether the next nonwhitespace character is a % {. If so it reads up to the closing }, if not, it reads the whole % line. Whatever was read is then fed to the next control sequence % as an argument (by \parsebrace or \parsearg). % \def\braceorline#1{\let\macnamexxx=#1\futurelet\nchar\braceorlinexxx} \def\braceorlinexxx{% \ifx\nchar\bgroup\else \expandafter\parsearg \fi \macnamexxx} % @alias. % We need some trickery to remove the optional spaces around the equal % sign. Make them active and then expand them all to nothing. % \def\alias{\parseargusing\obeyspaces\aliasxxx} \def\aliasxxx #1{\aliasyyy#1\relax} \def\aliasyyy #1=#2\relax{% {% \expandafter\let\obeyedspace=\empty \addtomacrolist{#1}% \xdef\next{\global\let\makecsname{#1}=\makecsname{#2}}% }% \next } \message{cross references,} \newwrite\auxfile \newif\ifhavexrefs % True if xref values are known. \newif\ifwarnedxrefs % True if we warned once that they aren't known. % @inforef is relatively simple. \def\inforef #1{\inforefzzz #1,,,,**} \def\inforefzzz #1,#2,#3,#4**{% \putwordSee{} \putwordInfo{} \putwordfile{} \file{\ignorespaces #3{}}, node \samp{\ignorespaces#1{}}} % @node's only job in TeX is to define \lastnode, which is used in % cross-references. The @node line might or might not have commas, and % might or might not have spaces before the first comma, like: % @node foo , bar , ... % We don't want such trailing spaces in the node name. % \parseargdef\node{\checkenv{}\donode #1 ,\finishnodeparse} % % also remove a trailing comma, in case of something like this: % @node Help-Cross, , , Cross-refs \def\donode#1 ,#2\finishnodeparse{\dodonode #1,\finishnodeparse} \def\dodonode#1,#2\finishnodeparse{\gdef\lastnode{#1}} \let\nwnode=\node \let\lastnode=\empty % Write a cross-reference definition for the current node. #1 is the % type (Ynumbered, Yappendix, Ynothing). % \def\donoderef#1{% \ifx\lastnode\empty\else \setref{\lastnode}{#1}% \global\let\lastnode=\empty \fi } % @anchor{NAME} -- define xref target at arbitrary point. % \newcount\savesfregister % \def\savesf{\relax \ifhmode \savesfregister=\spacefactor \fi} \def\restoresf{\relax \ifhmode \spacefactor=\savesfregister \fi} \def\anchor#1{\savesf \setref{#1}{Ynothing}\restoresf \ignorespaces} % \setref{NAME}{SNT} defines a cross-reference point NAME (a node or an % anchor), which consists of three parts: % 1) NAME-title - the current sectioning name taken from \lastsection, % or the anchor name. % 2) NAME-snt - section number and type, passed as the SNT arg, or % empty for anchors. % 3) NAME-pg - the page number. % % This is called from \donoderef, \anchor, and \dofloat. In the case of % floats, there is an additional part, which is not written here: % 4) NAME-lof - the text as it should appear in a @listoffloats. % \def\setref#1#2{% \pdfmkdest{#1}% \iflinks {% \atdummies % preserve commands, but don't expand them \edef\writexrdef##1##2{% \write\auxfile{@xrdef{#1-% #1 of \setref, expanded by the \edef ##1}{##2}}% these are parameters of \writexrdef }% \toks0 = \expandafter{\lastsection}% \immediate \writexrdef{title}{\the\toks0 }% \immediate \writexrdef{snt}{\csname #2\endcsname}% \Ynumbered etc. \safewhatsit{\writexrdef{pg}{\folio}}% will be written later, at \shipout }% \fi } % @xrefautosectiontitle on|off says whether @section(ing) names are used % automatically in xrefs, if the third arg is not explicitly specified. % This was provided as a "secret" @set xref-automatic-section-title % variable, now it's official. % \parseargdef\xrefautomaticsectiontitle{% \def\temp{#1}% \ifx\temp\onword \expandafter\let\csname SETxref-automatic-section-title\endcsname = \empty \else\ifx\temp\offword \expandafter\let\csname SETxref-automatic-section-title\endcsname = \relax \else \errhelp = \EMsimple \errmessage{Unknown @xrefautomaticsectiontitle value `\temp', must be on|off}% \fi\fi } % % @xref, @pxref, and @ref generate cross-references. For \xrefX, #1 is % the node name, #2 the name of the Info cross-reference, #3 the printed % node name, #4 the name of the Info file, #5 the name of the printed % manual. All but the node name can be omitted. % \def\pxref#1{\putwordsee{} \xrefX[#1,,,,,,,]} \def\xref#1{\putwordSee{} \xrefX[#1,,,,,,,]} \def\ref#1{\xrefX[#1,,,,,,,]} % \newbox\toprefbox \newbox\printedrefnamebox \newbox\infofilenamebox \newbox\printedmanualbox % \def\xrefX[#1,#2,#3,#4,#5,#6]{\begingroup \unsepspaces % % Get args without leading/trailing spaces. \def\printedrefname{\ignorespaces #3}% \setbox\printedrefnamebox = \hbox{\printedrefname\unskip}% % \def\infofilename{\ignorespaces #4}% \setbox\infofilenamebox = \hbox{\infofilename\unskip}% % \def\printedmanual{\ignorespaces #5}% \setbox\printedmanualbox = \hbox{\printedmanual\unskip}% % % If the printed reference name (arg #3) was not explicitly given in % the @xref, figure out what we want to use. \ifdim \wd\printedrefnamebox = 0pt % No printed node name was explicitly given. \expandafter\ifx\csname SETxref-automatic-section-title\endcsname \relax % Not auto section-title: use node name inside the square brackets. \def\printedrefname{\ignorespaces #1}% \else % Auto section-title: use chapter/section title inside % the square brackets if we have it. \ifdim \wd\printedmanualbox > 0pt % It is in another manual, so we don't have it; use node name. \def\printedrefname{\ignorespaces #1}% \else \ifhavexrefs % We (should) know the real title if we have the xref values. \def\printedrefname{\refx{#1-title}{}}% \else % Otherwise just copy the Info node name. \def\printedrefname{\ignorespaces #1}% \fi% \fi \fi \fi % % Make link in pdf output. \ifpdf {\indexnofonts \turnoffactive \makevalueexpandable % This expands tokens, so do it after making catcode changes, so _ % etc. don't get their TeX definitions. This ignores all spaces in % #4, including (wrongly) those in the middle of the filename. \getfilename{#4}% % % This (wrongly) does not take account of leading or trailing % spaces in #1, which should be ignored. \edef\pdfxrefdest{#1}% \ifx\pdfxrefdest\empty \def\pdfxrefdest{Top}% no empty targets \else \txiescapepdf\pdfxrefdest % escape PDF special chars \fi % \leavevmode \startlink attr{/Border [0 0 0]}% \ifnum\filenamelength>0 goto file{\the\filename.pdf} name{\pdfxrefdest}% \else goto name{\pdfmkpgn{\pdfxrefdest}}% \fi }% \setcolor{\linkcolor}% \fi % % Float references are printed completely differently: "Figure 1.2" % instead of "[somenode], p.3". We distinguish them by the % LABEL-title being set to a magic string. {% % Have to otherify everything special to allow the \csname to % include an _ in the xref name, etc. \indexnofonts \turnoffactive \expandafter\global\expandafter\let\expandafter\Xthisreftitle \csname XR#1-title\endcsname }% \iffloat\Xthisreftitle % If the user specified the print name (third arg) to the ref, % print it instead of our usual "Figure 1.2". \ifdim\wd\printedrefnamebox = 0pt \refx{#1-snt}{}% \else \printedrefname \fi % % If the user also gave the printed manual name (fifth arg), append % "in MANUALNAME". \ifdim \wd\printedmanualbox > 0pt \space \putwordin{} \cite{\printedmanual}% \fi \else % node/anchor (non-float) references. % % If we use \unhbox to print the node names, TeX does not insert % empty discretionaries after hyphens, which means that it will not % find a line break at a hyphen in a node names. Since some manuals % are best written with fairly long node names, containing hyphens, % this is a loss. Therefore, we give the text of the node name % again, so it is as if TeX is seeing it for the first time. % \ifdim \wd\printedmanualbox > 0pt % Cross-manual reference with a printed manual name. % \crossmanualxref{\cite{\printedmanual\unskip}}% % \else\ifdim \wd\infofilenamebox > 0pt % Cross-manual reference with only an info filename (arg 4), no % printed manual name (arg 5). This is essentially the same as % the case above; we output the filename, since we have nothing else. % \crossmanualxref{\code{\infofilename\unskip}}% % \else % Reference within this manual. % % _ (for example) has to be the character _ for the purposes of the % control sequence corresponding to the node, but it has to expand % into the usual \leavevmode...\vrule stuff for purposes of % printing. So we \turnoffactive for the \refx-snt, back on for the % printing, back off for the \refx-pg. {\turnoffactive % Only output a following space if the -snt ref is nonempty; for % @unnumbered and @anchor, it won't be. \setbox2 = \hbox{\ignorespaces \refx{#1-snt}{}}% \ifdim \wd2 > 0pt \refx{#1-snt}\space\fi }% % output the `[mynode]' via the macro below so it can be overridden. \xrefprintnodename\printedrefname % % But we always want a comma and a space: ,\space % % output the `page 3'. \turnoffactive \putwordpage\tie\refx{#1-pg}{}% \fi\fi \fi \endlink \endgroup} % Output a cross-manual xref to #1. Used just above (twice). % % Only include the text "Section ``foo'' in" if the foo is neither % missing or Top. Thus, @xref{,,,foo,The Foo Manual} outputs simply % "see The Foo Manual", the idea being to refer to the whole manual. % % But, this being TeX, we can't easily compare our node name against the % string "Top" while ignoring the possible spaces before and after in % the input. By adding the arbitrary 7sp below, we make it much less % likely that a real node name would have the same width as "Top" (e.g., % in a monospaced font). Hopefully it will never happen in practice. % % For the same basic reason, we retypeset the "Top" at every % reference, since the current font is indeterminate. % \def\crossmanualxref#1{% \setbox\toprefbox = \hbox{Top\kern7sp}% \setbox2 = \hbox{\ignorespaces \printedrefname \unskip \kern7sp}% \ifdim \wd2 > 7sp % nonempty? \ifdim \wd2 = \wd\toprefbox \else % same as Top? \putwordSection{} ``\printedrefname'' \putwordin{}\space \fi \fi #1% } % This macro is called from \xrefX for the `[nodename]' part of xref % output. It's a separate macro only so it can be changed more easily, % since square brackets don't work well in some documents. Particularly % one that Bob is working on :). % \def\xrefprintnodename#1{[#1]} % Things referred to by \setref. % \def\Ynothing{} \def\Yomitfromtoc{} \def\Ynumbered{% \ifnum\secno=0 \putwordChapter@tie \the\chapno \else \ifnum\subsecno=0 \putwordSection@tie \the\chapno.\the\secno \else \ifnum\subsubsecno=0 \putwordSection@tie \the\chapno.\the\secno.\the\subsecno \else \putwordSection@tie \the\chapno.\the\secno.\the\subsecno.\the\subsubsecno \fi\fi\fi } \def\Yappendix{% \ifnum\secno=0 \putwordAppendix@tie @char\the\appendixno{}% \else \ifnum\subsecno=0 \putwordSection@tie @char\the\appendixno.\the\secno \else \ifnum\subsubsecno=0 \putwordSection@tie @char\the\appendixno.\the\secno.\the\subsecno \else \putwordSection@tie @char\the\appendixno.\the\secno.\the\subsecno.\the\subsubsecno \fi\fi\fi } % Define \refx{NAME}{SUFFIX} to reference a cross-reference string named NAME. % If its value is nonempty, SUFFIX is output afterward. % \def\refx#1#2{% {% \indexnofonts \otherbackslash \expandafter\global\expandafter\let\expandafter\thisrefX \csname XR#1\endcsname }% \ifx\thisrefX\relax % If not defined, say something at least. \angleleft un\-de\-fined\angleright \iflinks \ifhavexrefs {\toks0 = {#1}% avoid expansion of possibly-complex value \message{\linenumber Undefined cross reference `\the\toks0'.}}% \else \ifwarnedxrefs\else \global\warnedxrefstrue \message{Cross reference values unknown; you must run TeX again.}% \fi \fi \fi \else % It's defined, so just use it. \thisrefX \fi #2% Output the suffix in any case. } % This is the macro invoked by entries in the aux file. Usually it's % just a \def (we prepend XR to the control sequence name to avoid % collisions). But if this is a float type, we have more work to do. % \def\xrdef#1#2{% {% The node name might contain 8-bit characters, which in our current % implementation are changed to commands like @'e. Don't let these % mess up the control sequence name. \indexnofonts \turnoffactive \xdef\safexrefname{#1}% }% % \expandafter\gdef\csname XR\safexrefname\endcsname{#2}% remember this xref % % Was that xref control sequence that we just defined for a float? \expandafter\iffloat\csname XR\safexrefname\endcsname % it was a float, and we have the (safe) float type in \iffloattype. \expandafter\let\expandafter\floatlist \csname floatlist\iffloattype\endcsname % % Is this the first time we've seen this float type? \expandafter\ifx\floatlist\relax \toks0 = {\do}% yes, so just \do \else % had it before, so preserve previous elements in list. \toks0 = \expandafter{\floatlist\do}% \fi % % Remember this xref in the control sequence \floatlistFLOATTYPE, % for later use in \listoffloats. \expandafter\xdef\csname floatlist\iffloattype\endcsname{\the\toks0 {\safexrefname}}% \fi } % Read the last existing aux file, if any. No error if none exists. % \def\tryauxfile{% \openin 1 \jobname.aux \ifeof 1 \else \readdatafile{aux}% \global\havexrefstrue \fi \closein 1 } \def\setupdatafile{% \catcode`\^^@=\other \catcode`\^^A=\other \catcode`\^^B=\other \catcode`\^^C=\other \catcode`\^^D=\other \catcode`\^^E=\other \catcode`\^^F=\other \catcode`\^^G=\other \catcode`\^^H=\other \catcode`\^^K=\other \catcode`\^^L=\other \catcode`\^^N=\other \catcode`\^^P=\other \catcode`\^^Q=\other \catcode`\^^R=\other \catcode`\^^S=\other \catcode`\^^T=\other \catcode`\^^U=\other \catcode`\^^V=\other \catcode`\^^W=\other \catcode`\^^X=\other \catcode`\^^Z=\other \catcode`\^^[=\other \catcode`\^^\=\other \catcode`\^^]=\other \catcode`\^^^=\other \catcode`\^^_=\other % It was suggested to set the catcode of ^ to 7, which would allow ^^e4 etc. % in xref tags, i.e., node names. But since ^^e4 notation isn't % supported in the main text, it doesn't seem desirable. Furthermore, % that is not enough: for node names that actually contain a ^ % character, we would end up writing a line like this: 'xrdef {'hat % b-title}{'hat b} and \xrdef does a \csname...\endcsname on the first % argument, and \hat is not an expandable control sequence. It could % all be worked out, but why? Either we support ^^ or we don't. % % The other change necessary for this was to define \auxhat: % \def\auxhat{\def^{'hat }}% extra space so ok if followed by letter % and then to call \auxhat in \setq. % \catcode`\^=\other % % Special characters. Should be turned off anyway, but... \catcode`\~=\other \catcode`\[=\other \catcode`\]=\other \catcode`\"=\other \catcode`\_=\other \catcode`\|=\other \catcode`\<=\other \catcode`\>=\other \catcode`\$=\other \catcode`\#=\other \catcode`\&=\other \catcode`\%=\other \catcode`+=\other % avoid \+ for paranoia even though we've turned it off % % This is to support \ in node names and titles, since the \ % characters end up in a \csname. It's easier than % leaving it active and making its active definition an actual \ % character. What I don't understand is why it works in the *value* % of the xrdef. Seems like it should be a catcode12 \, and that % should not typeset properly. But it works, so I'm moving on for % now. --karl, 15jan04. \catcode`\\=\other % % Make the characters 128-255 be printing characters. {% \count1=128 \def\loop{% \catcode\count1=\other \advance\count1 by 1 \ifnum \count1<256 \loop \fi }% }% % % @ is our escape character in .aux files, and we need braces. \catcode`\{=1 \catcode`\}=2 \catcode`\@=0 } \def\readdatafile#1{% \begingroup \setupdatafile \input\jobname.#1 \endgroup} \message{insertions,} % including footnotes. \newcount \footnoteno % The trailing space in the following definition for supereject is % vital for proper filling; pages come out unaligned when you do a % pagealignmacro call if that space before the closing brace is % removed. (Generally, numeric constants should always be followed by a % space to prevent strange expansion errors.) \def\supereject{\par\penalty -20000\footnoteno =0 } % @footnotestyle is meaningful for Info output only. \let\footnotestyle=\comment {\catcode `\@=11 % % Auto-number footnotes. Otherwise like plain. \gdef\footnote{% \let\indent=\ptexindent \let\noindent=\ptexnoindent \global\advance\footnoteno by \@ne \edef\thisfootno{$^{\the\footnoteno}$}% % % In case the footnote comes at the end of a sentence, preserve the % extra spacing after we do the footnote number. \let\@sf\empty \ifhmode\edef\@sf{\spacefactor\the\spacefactor}\ptexslash\fi % % Remove inadvertent blank space before typesetting the footnote number. \unskip \thisfootno\@sf \dofootnote }% % Don't bother with the trickery in plain.tex to not require the % footnote text as a parameter. Our footnotes don't need to be so general. % % Oh yes, they do; otherwise, @ifset (and anything else that uses % \parseargline) fails inside footnotes because the tokens are fixed when % the footnote is read. --karl, 16nov96. % \gdef\dofootnote{% \insert\footins\bgroup % We want to typeset this text as a normal paragraph, even if the % footnote reference occurs in (for example) a display environment. % So reset some parameters. \hsize=\pagewidth \interlinepenalty\interfootnotelinepenalty \splittopskip\ht\strutbox % top baseline for broken footnotes \splitmaxdepth\dp\strutbox \floatingpenalty\@MM \leftskip\z@skip \rightskip\z@skip \spaceskip\z@skip \xspaceskip\z@skip \parindent\defaultparindent % \smallfonts \rm % % Because we use hanging indentation in footnotes, a @noindent appears % to exdent this text, so make it be a no-op. makeinfo does not use % hanging indentation so @noindent can still be needed within footnote % text after an @example or the like (not that this is good style). \let\noindent = \relax % % Hang the footnote text off the number. Use \everypar in case the % footnote extends for more than one paragraph. \everypar = {\hang}% \textindent{\thisfootno}% % % Don't crash into the line above the footnote text. Since this % expands into a box, it must come within the paragraph, lest it % provide a place where TeX can split the footnote. \footstrut % % Invoke rest of plain TeX footnote routine. \futurelet\next\fo@t } }%end \catcode `\@=11 % In case a @footnote appears in a vbox, save the footnote text and create % the real \insert just after the vbox finished. Otherwise, the insertion % would be lost. % Similarly, if a @footnote appears inside an alignment, save the footnote % text to a box and make the \insert when a row of the table is finished. % And the same can be done for other insert classes. --kasal, 16nov03. % Replace the \insert primitive by a cheating macro. % Deeper inside, just make sure that the saved insertions are not spilled % out prematurely. % \def\startsavinginserts{% \ifx \insert\ptexinsert \let\insert\saveinsert \else \let\checkinserts\relax \fi } % This \insert replacement works for both \insert\footins{foo} and % \insert\footins\bgroup foo\egroup, but it doesn't work for \insert27{foo}. % \def\saveinsert#1{% \edef\next{\noexpand\savetobox \makeSAVEname#1}% \afterassignment\next % swallow the left brace \let\temp = } \def\makeSAVEname#1{\makecsname{SAVE\expandafter\gobble\string#1}} \def\savetobox#1{\global\setbox#1 = \vbox\bgroup \unvbox#1} \def\checksaveins#1{\ifvoid#1\else \placesaveins#1\fi} \def\placesaveins#1{% \ptexinsert \csname\expandafter\gobblesave\string#1\endcsname {\box#1}% } % eat @SAVE -- beware, all of them have catcode \other: { \def\dospecials{\do S\do A\do V\do E} \uncatcodespecials % ;-) \gdef\gobblesave @SAVE{} } % initialization: \def\newsaveins #1{% \edef\next{\noexpand\newsaveinsX \makeSAVEname#1}% \next } \def\newsaveinsX #1{% \csname newbox\endcsname #1% \expandafter\def\expandafter\checkinserts\expandafter{\checkinserts \checksaveins #1}% } % initialize: \let\checkinserts\empty \newsaveins\footins \newsaveins\margin % @image. We use the macros from epsf.tex to support this. % If epsf.tex is not installed and @image is used, we complain. % % Check for and read epsf.tex up front. If we read it only at @image % time, we might be inside a group, and then its definitions would get % undone and the next image would fail. \openin 1 = epsf.tex \ifeof 1 \else % Do not bother showing banner with epsf.tex v2.7k (available in % doc/epsf.tex and on ctan). \def\epsfannounce{\toks0 = }% \input epsf.tex \fi \closein 1 % % We will only complain once about lack of epsf.tex. \newif\ifwarnednoepsf \newhelp\noepsfhelp{epsf.tex must be installed for images to work. It is also included in the Texinfo distribution, or you can get it from ftp://tug.org/tex/epsf.tex.} % \def\image#1{% \ifx\epsfbox\thisisundefined \ifwarnednoepsf \else \errhelp = \noepsfhelp \errmessage{epsf.tex not found, images will be ignored}% \global\warnednoepsftrue \fi \else \imagexxx #1,,,,,\finish \fi } % % Arguments to @image: % #1 is (mandatory) image filename; we tack on .eps extension. % #2 is (optional) width, #3 is (optional) height. % #4 is (ignored optional) html alt text. % #5 is (ignored optional) extension. % #6 is just the usual extra ignored arg for parsing stuff. \newif\ifimagevmode \def\imagexxx#1,#2,#3,#4,#5,#6\finish{\begingroup \catcode`\^^M = 5 % in case we're inside an example \normalturnoffactive % allow _ et al. in names % If the image is by itself, center it. \ifvmode \imagevmodetrue \else \ifx\centersub\centerV % for @center @image, we need a vbox so we can have our vertical space \imagevmodetrue \vbox\bgroup % vbox has better behavior than vtop herev \fi\fi % \ifimagevmode \nobreak\medskip % Usually we'll have text after the image which will insert % \parskip glue, so insert it here too to equalize the space % above and below. \nobreak\vskip\parskip \nobreak \fi % % Leave vertical mode so that indentation from an enclosing % environment such as @quotation is respected. % However, if we're at the top level, we don't want the % normal paragraph indentation. % On the other hand, if we are in the case of @center @image, we don't % want to start a paragraph, which will create a hsize-width box and % eradicate the centering. \ifx\centersub\centerV\else \noindent \fi % % Output the image. \ifpdf \dopdfimage{#1}{#2}{#3}% \else % \epsfbox itself resets \epsf?size at each figure. \setbox0 = \hbox{\ignorespaces #2}\ifdim\wd0 > 0pt \epsfxsize=#2\relax \fi \setbox0 = \hbox{\ignorespaces #3}\ifdim\wd0 > 0pt \epsfysize=#3\relax \fi \epsfbox{#1.eps}% \fi % \ifimagevmode \medskip % space after a standalone image \fi \ifx\centersub\centerV \egroup \fi \endgroup} % @float FLOATTYPE,LABEL,LOC ... @end float for displayed figures, tables, % etc. We don't actually implement floating yet, we always include the % float "here". But it seemed the best name for the future. % \envparseargdef\float{\eatcommaspace\eatcommaspace\dofloat#1, , ,\finish} % There may be a space before second and/or third parameter; delete it. \def\eatcommaspace#1, {#1,} % #1 is the optional FLOATTYPE, the text label for this float, typically % "Figure", "Table", "Example", etc. Can't contain commas. If omitted, % this float will not be numbered and cannot be referred to. % % #2 is the optional xref label. Also must be present for the float to % be referable. % % #3 is the optional positioning argument; for now, it is ignored. It % will somehow specify the positions allowed to float to (here, top, bottom). % % We keep a separate counter for each FLOATTYPE, which we reset at each % chapter-level command. \let\resetallfloatnos=\empty % \def\dofloat#1,#2,#3,#4\finish{% \let\thiscaption=\empty \let\thisshortcaption=\empty % % don't lose footnotes inside @float. % % BEWARE: when the floats start float, we have to issue warning whenever an % insert appears inside a float which could possibly float. --kasal, 26may04 % \startsavinginserts % % We can't be used inside a paragraph. \par % \vtop\bgroup \def\floattype{#1}% \def\floatlabel{#2}% \def\floatloc{#3}% we do nothing with this yet. % \ifx\floattype\empty \let\safefloattype=\empty \else {% % the floattype might have accents or other special characters, % but we need to use it in a control sequence name. \indexnofonts \turnoffactive \xdef\safefloattype{\floattype}% }% \fi % % If label is given but no type, we handle that as the empty type. \ifx\floatlabel\empty \else % We want each FLOATTYPE to be numbered separately (Figure 1, % Table 1, Figure 2, ...). (And if no label, no number.) % \expandafter\getfloatno\csname\safefloattype floatno\endcsname \global\advance\floatno by 1 % {% % This magic value for \lastsection is output by \setref as the % XREFLABEL-title value. \xrefX uses it to distinguish float % labels (which have a completely different output format) from % node and anchor labels. And \xrdef uses it to construct the % lists of floats. % \edef\lastsection{\floatmagic=\safefloattype}% \setref{\floatlabel}{Yfloat}% }% \fi % % start with \parskip glue, I guess. \vskip\parskip % % Don't suppress indentation if a float happens to start a section. \restorefirstparagraphindent } % we have these possibilities: % @float Foo,lbl & @caption{Cap}: Foo 1.1: Cap % @float Foo,lbl & no caption: Foo 1.1 % @float Foo & @caption{Cap}: Foo: Cap % @float Foo & no caption: Foo % @float ,lbl & Caption{Cap}: 1.1: Cap % @float ,lbl & no caption: 1.1 % @float & @caption{Cap}: Cap % @float & no caption: % \def\Efloat{% \let\floatident = \empty % % In all cases, if we have a float type, it comes first. \ifx\floattype\empty \else \def\floatident{\floattype}\fi % % If we have an xref label, the number comes next. \ifx\floatlabel\empty \else \ifx\floattype\empty \else % if also had float type, need tie first. \appendtomacro\floatident{\tie}% \fi % the number. \appendtomacro\floatident{\chaplevelprefix\the\floatno}% \fi % % Start the printed caption with what we've constructed in % \floatident, but keep it separate; we need \floatident again. \let\captionline = \floatident % \ifx\thiscaption\empty \else \ifx\floatident\empty \else \appendtomacro\captionline{: }% had ident, so need a colon between \fi % % caption text. \appendtomacro\captionline{\scanexp\thiscaption}% \fi % % If we have anything to print, print it, with space before. % Eventually this needs to become an \insert. \ifx\captionline\empty \else \vskip.5\parskip \captionline % % Space below caption. \vskip\parskip \fi % % If have an xref label, write the list of floats info. Do this % after the caption, to avoid chance of it being a breakpoint. \ifx\floatlabel\empty \else % Write the text that goes in the lof to the aux file as % \floatlabel-lof. Besides \floatident, we include the short % caption if specified, else the full caption if specified, else nothing. {% \atdummies % % since we read the caption text in the macro world, where ^^M % is turned into a normal character, we have to scan it back, so % we don't write the literal three characters "^^M" into the aux file. \scanexp{% \xdef\noexpand\gtemp{% \ifx\thisshortcaption\empty \thiscaption \else \thisshortcaption \fi }% }% \immediate\write\auxfile{@xrdef{\floatlabel-lof}{\floatident \ifx\gtemp\empty \else : \gtemp \fi}}% }% \fi \egroup % end of \vtop % % place the captured inserts % % BEWARE: when the floats start floating, we have to issue warning % whenever an insert appears inside a float which could possibly % float. --kasal, 26may04 % \checkinserts } % Append the tokens #2 to the definition of macro #1, not expanding either. % \def\appendtomacro#1#2{% \expandafter\def\expandafter#1\expandafter{#1#2}% } % @caption, @shortcaption % \def\caption{\docaption\thiscaption} \def\shortcaption{\docaption\thisshortcaption} \def\docaption{\checkenv\float \bgroup\scanargctxt\defcaption} \def\defcaption#1#2{\egroup \def#1{#2}} % The parameter is the control sequence identifying the counter we are % going to use. Create it if it doesn't exist and assign it to \floatno. \def\getfloatno#1{% \ifx#1\relax % Haven't seen this figure type before. \csname newcount\endcsname #1% % % Remember to reset this floatno at the next chap. \expandafter\gdef\expandafter\resetallfloatnos \expandafter{\resetallfloatnos #1=0 }% \fi \let\floatno#1% } % \setref calls this to get the XREFLABEL-snt value. We want an @xref % to the FLOATLABEL to expand to "Figure 3.1". We call \setref when we % first read the @float command. % \def\Yfloat{\floattype@tie \chaplevelprefix\the\floatno}% % Magic string used for the XREFLABEL-title value, so \xrefX can % distinguish floats from other xref types. \def\floatmagic{!!float!!} % #1 is the control sequence we are passed; we expand into a conditional % which is true if #1 represents a float ref. That is, the magic % \lastsection value which we \setref above. % \def\iffloat#1{\expandafter\doiffloat#1==\finish} % % #1 is (maybe) the \floatmagic string. If so, #2 will be the % (safe) float type for this float. We set \iffloattype to #2. % \def\doiffloat#1=#2=#3\finish{% \def\temp{#1}% \def\iffloattype{#2}% \ifx\temp\floatmagic } % @listoffloats FLOATTYPE - print a list of floats like a table of contents. % \parseargdef\listoffloats{% \def\floattype{#1}% floattype {% % the floattype might have accents or other special characters, % but we need to use it in a control sequence name. \indexnofonts \turnoffactive \xdef\safefloattype{\floattype}% }% % % \xrdef saves the floats as a \do-list in \floatlistSAFEFLOATTYPE. \expandafter\ifx\csname floatlist\safefloattype\endcsname \relax \ifhavexrefs % if the user said @listoffloats foo but never @float foo. \message{\linenumber No `\safefloattype' floats to list.}% \fi \else \begingroup \leftskip=\tocindent % indent these entries like a toc \let\do=\listoffloatsdo \csname floatlist\safefloattype\endcsname \endgroup \fi } % This is called on each entry in a list of floats. We're passed the % xref label, in the form LABEL-title, which is how we save it in the % aux file. We strip off the -title and look up \XRLABEL-lof, which % has the text we're supposed to typeset here. % % Figures without xref labels will not be included in the list (since % they won't appear in the aux file). % \def\listoffloatsdo#1{\listoffloatsdoentry#1\finish} \def\listoffloatsdoentry#1-title\finish{{% % Can't fully expand XR#1-lof because it can contain anything. Just % pass the control sequence. On the other hand, XR#1-pg is just the % page number, and we want to fully expand that so we can get a link % in pdf output. \toksA = \expandafter{\csname XR#1-lof\endcsname}% % % use the same \entry macro we use to generate the TOC and index. \edef\writeentry{\noexpand\entry{\the\toksA}{\csname XR#1-pg\endcsname}}% \writeentry }} \message{localization,} % For single-language documents, @documentlanguage is usually given very % early, just after @documentencoding. Single argument is the language % (de) or locale (de_DE) abbreviation. % { \catcode`\_ = \active \globaldefs=1 \parseargdef\documentlanguage{\begingroup \let_=\normalunderscore % normal _ character for filenames \tex % read txi-??.tex file in plain TeX. % Read the file by the name they passed if it exists. \openin 1 txi-#1.tex \ifeof 1 \documentlanguagetrywithoutunderscore{#1_\finish}% \else \globaldefs = 1 % everything in the txi-LL files needs to persist \input txi-#1.tex \fi \closein 1 \endgroup % end raw TeX \endgroup} % % If they passed de_DE, and txi-de_DE.tex doesn't exist, % try txi-de.tex. % \gdef\documentlanguagetrywithoutunderscore#1_#2\finish{% \openin 1 txi-#1.tex \ifeof 1 \errhelp = \nolanghelp \errmessage{Cannot read language file txi-#1.tex}% \else \globaldefs = 1 % everything in the txi-LL files needs to persist \input txi-#1.tex \fi \closein 1 } }% end of special _ catcode % \newhelp\nolanghelp{The given language definition file cannot be found or is empty. Maybe you need to install it? Putting it in the current directory should work if nowhere else does.} % This macro is called from txi-??.tex files; the first argument is the % \language name to set (without the "\lang@" prefix), the second and % third args are \{left,right}hyphenmin. % % The language names to pass are determined when the format is built. % See the etex.log file created at that time, e.g., % /usr/local/texlive/2008/texmf-var/web2c/pdftex/etex.log. % % With TeX Live 2008, etex now includes hyphenation patterns for all % available languages. This means we can support hyphenation in % Texinfo, at least to some extent. (This still doesn't solve the % accented characters problem.) % \catcode`@=11 \def\txisetlanguage#1#2#3{% % do not set the language if the name is undefined in the current TeX. \expandafter\ifx\csname lang@#1\endcsname \relax \message{no patterns for #1}% \else \global\language = \csname lang@#1\endcsname \fi % but there is no harm in adjusting the hyphenmin values regardless. \global\lefthyphenmin = #2\relax \global\righthyphenmin = #3\relax } % Helpers for encodings. % Set the catcode of characters 128 through 255 to the specified number. % \def\setnonasciicharscatcode#1{% \count255=128 \loop\ifnum\count255<256 \global\catcode\count255=#1\relax \advance\count255 by 1 \repeat } \def\setnonasciicharscatcodenonglobal#1{% \count255=128 \loop\ifnum\count255<256 \catcode\count255=#1\relax \advance\count255 by 1 \repeat } % @documentencoding sets the definition of non-ASCII characters % according to the specified encoding. % \parseargdef\documentencoding{% % Encoding being declared for the document. \def\declaredencoding{\csname #1.enc\endcsname}% % % Supported encodings: names converted to tokens in order to be able % to compare them with \ifx. \def\ascii{\csname US-ASCII.enc\endcsname}% \def\latnine{\csname ISO-8859-15.enc\endcsname}% \def\latone{\csname ISO-8859-1.enc\endcsname}% \def\lattwo{\csname ISO-8859-2.enc\endcsname}% \def\utfeight{\csname UTF-8.enc\endcsname}% % \ifx \declaredencoding \ascii \asciichardefs % \else \ifx \declaredencoding \lattwo \setnonasciicharscatcode\active \lattwochardefs % \else \ifx \declaredencoding \latone \setnonasciicharscatcode\active \latonechardefs % \else \ifx \declaredencoding \latnine \setnonasciicharscatcode\active \latninechardefs % \else \ifx \declaredencoding \utfeight \setnonasciicharscatcode\active \utfeightchardefs % \else \message{Unknown document encoding #1, ignoring.}% % \fi % utfeight \fi % latnine \fi % latone \fi % lattwo \fi % ascii } % A message to be logged when using a character that isn't available % the default font encoding (OT1). % \def\missingcharmsg#1{\message{Character missing in OT1 encoding: #1.}} % Take account of \c (plain) vs. \, (Texinfo) difference. \def\cedilla#1{\ifx\c\ptexc\c{#1}\else\,{#1}\fi} % First, make active non-ASCII characters in order for them to be % correctly categorized when TeX reads the replacement text of % macros containing the character definitions. \setnonasciicharscatcode\active % % Latin1 (ISO-8859-1) character definitions. \def\latonechardefs{% \gdef^^a0{\tie} \gdef^^a1{\exclamdown} \gdef^^a2{\missingcharmsg{CENT SIGN}} \gdef^^a3{{\pounds}} \gdef^^a4{\missingcharmsg{CURRENCY SIGN}} \gdef^^a5{\missingcharmsg{YEN SIGN}} \gdef^^a6{\missingcharmsg{BROKEN BAR}} \gdef^^a7{\S} \gdef^^a8{\"{}} \gdef^^a9{\copyright} \gdef^^aa{\ordf} \gdef^^ab{\guillemetleft} \gdef^^ac{$\lnot$} \gdef^^ad{\-} \gdef^^ae{\registeredsymbol} \gdef^^af{\={}} % \gdef^^b0{\textdegree} \gdef^^b1{$\pm$} \gdef^^b2{$^2$} \gdef^^b3{$^3$} \gdef^^b4{\'{}} \gdef^^b5{$\mu$} \gdef^^b6{\P} % \gdef^^b7{$^.$} \gdef^^b8{\cedilla\ } \gdef^^b9{$^1$} \gdef^^ba{\ordm} % \gdef^^bb{\guillemetright} \gdef^^bc{$1\over4$} \gdef^^bd{$1\over2$} \gdef^^be{$3\over4$} \gdef^^bf{\questiondown} % \gdef^^c0{\`A} \gdef^^c1{\'A} \gdef^^c2{\^A} \gdef^^c3{\~A} \gdef^^c4{\"A} \gdef^^c5{\ringaccent A} \gdef^^c6{\AE} \gdef^^c7{\cedilla C} \gdef^^c8{\`E} \gdef^^c9{\'E} \gdef^^ca{\^E} \gdef^^cb{\"E} \gdef^^cc{\`I} \gdef^^cd{\'I} \gdef^^ce{\^I} \gdef^^cf{\"I} % \gdef^^d0{\DH} \gdef^^d1{\~N} \gdef^^d2{\`O} \gdef^^d3{\'O} \gdef^^d4{\^O} \gdef^^d5{\~O} \gdef^^d6{\"O} \gdef^^d7{$\times$} \gdef^^d8{\O} \gdef^^d9{\`U} \gdef^^da{\'U} \gdef^^db{\^U} \gdef^^dc{\"U} \gdef^^dd{\'Y} \gdef^^de{\TH} \gdef^^df{\ss} % \gdef^^e0{\`a} \gdef^^e1{\'a} \gdef^^e2{\^a} \gdef^^e3{\~a} \gdef^^e4{\"a} \gdef^^e5{\ringaccent a} \gdef^^e6{\ae} \gdef^^e7{\cedilla c} \gdef^^e8{\`e} \gdef^^e9{\'e} \gdef^^ea{\^e} \gdef^^eb{\"e} \gdef^^ec{\`{\dotless i}} \gdef^^ed{\'{\dotless i}} \gdef^^ee{\^{\dotless i}} \gdef^^ef{\"{\dotless i}} % \gdef^^f0{\dh} \gdef^^f1{\~n} \gdef^^f2{\`o} \gdef^^f3{\'o} \gdef^^f4{\^o} \gdef^^f5{\~o} \gdef^^f6{\"o} \gdef^^f7{$\div$} \gdef^^f8{\o} \gdef^^f9{\`u} \gdef^^fa{\'u} \gdef^^fb{\^u} \gdef^^fc{\"u} \gdef^^fd{\'y} \gdef^^fe{\th} \gdef^^ff{\"y} } % Latin9 (ISO-8859-15) encoding character definitions. \def\latninechardefs{% % Encoding is almost identical to Latin1. \latonechardefs % \gdef^^a4{\euro} \gdef^^a6{\v S} \gdef^^a8{\v s} \gdef^^b4{\v Z} \gdef^^b8{\v z} \gdef^^bc{\OE} \gdef^^bd{\oe} \gdef^^be{\"Y} } % Latin2 (ISO-8859-2) character definitions. \def\lattwochardefs{% \gdef^^a0{\tie} \gdef^^a1{\ogonek{A}} \gdef^^a2{\u{}} \gdef^^a3{\L} \gdef^^a4{\missingcharmsg{CURRENCY SIGN}} \gdef^^a5{\v L} \gdef^^a6{\'S} \gdef^^a7{\S} \gdef^^a8{\"{}} \gdef^^a9{\v S} \gdef^^aa{\cedilla S} \gdef^^ab{\v T} \gdef^^ac{\'Z} \gdef^^ad{\-} \gdef^^ae{\v Z} \gdef^^af{\dotaccent Z} % \gdef^^b0{\textdegree} \gdef^^b1{\ogonek{a}} \gdef^^b2{\ogonek{ }} \gdef^^b3{\l} \gdef^^b4{\'{}} \gdef^^b5{\v l} \gdef^^b6{\'s} \gdef^^b7{\v{}} \gdef^^b8{\cedilla\ } \gdef^^b9{\v s} \gdef^^ba{\cedilla s} \gdef^^bb{\v t} \gdef^^bc{\'z} \gdef^^bd{\H{}} \gdef^^be{\v z} \gdef^^bf{\dotaccent z} % \gdef^^c0{\'R} \gdef^^c1{\'A} \gdef^^c2{\^A} \gdef^^c3{\u A} \gdef^^c4{\"A} \gdef^^c5{\'L} \gdef^^c6{\'C} \gdef^^c7{\cedilla C} \gdef^^c8{\v C} \gdef^^c9{\'E} \gdef^^ca{\ogonek{E}} \gdef^^cb{\"E} \gdef^^cc{\v E} \gdef^^cd{\'I} \gdef^^ce{\^I} \gdef^^cf{\v D} % \gdef^^d0{\DH} \gdef^^d1{\'N} \gdef^^d2{\v N} \gdef^^d3{\'O} \gdef^^d4{\^O} \gdef^^d5{\H O} \gdef^^d6{\"O} \gdef^^d7{$\times$} \gdef^^d8{\v R} \gdef^^d9{\ringaccent U} \gdef^^da{\'U} \gdef^^db{\H U} \gdef^^dc{\"U} \gdef^^dd{\'Y} \gdef^^de{\cedilla T} \gdef^^df{\ss} % \gdef^^e0{\'r} \gdef^^e1{\'a} \gdef^^e2{\^a} \gdef^^e3{\u a} \gdef^^e4{\"a} \gdef^^e5{\'l} \gdef^^e6{\'c} \gdef^^e7{\cedilla c} \gdef^^e8{\v c} \gdef^^e9{\'e} \gdef^^ea{\ogonek{e}} \gdef^^eb{\"e} \gdef^^ec{\v e} \gdef^^ed{\'{\dotless{i}}} \gdef^^ee{\^{\dotless{i}}} \gdef^^ef{\v d} % \gdef^^f0{\dh} \gdef^^f1{\'n} \gdef^^f2{\v n} \gdef^^f3{\'o} \gdef^^f4{\^o} \gdef^^f5{\H o} \gdef^^f6{\"o} \gdef^^f7{$\div$} \gdef^^f8{\v r} \gdef^^f9{\ringaccent u} \gdef^^fa{\'u} \gdef^^fb{\H u} \gdef^^fc{\"u} \gdef^^fd{\'y} \gdef^^fe{\cedilla t} \gdef^^ff{\dotaccent{}} } % UTF-8 character definitions. % % This code to support UTF-8 is based on LaTeX's utf8.def, with some % changes for Texinfo conventions. It is included here under the GPL by % permission from Frank Mittelbach and the LaTeX team. % \newcount\countUTFx \newcount\countUTFy \newcount\countUTFz \gdef\UTFviiiTwoOctets#1#2{\expandafter \UTFviiiDefined\csname u8:#1\string #2\endcsname} % \gdef\UTFviiiThreeOctets#1#2#3{\expandafter \UTFviiiDefined\csname u8:#1\string #2\string #3\endcsname} % \gdef\UTFviiiFourOctets#1#2#3#4{\expandafter \UTFviiiDefined\csname u8:#1\string #2\string #3\string #4\endcsname} \gdef\UTFviiiDefined#1{% \ifx #1\relax \message{\linenumber Unicode char \string #1 not defined for Texinfo}% \else \expandafter #1% \fi } \begingroup \catcode`\~13 \catcode`\"12 \def\UTFviiiLoop{% \global\catcode\countUTFx\active \uccode`\~\countUTFx \uppercase\expandafter{\UTFviiiTmp}% \advance\countUTFx by 1 \ifnum\countUTFx < \countUTFy \expandafter\UTFviiiLoop \fi} \countUTFx = "C2 \countUTFy = "E0 \def\UTFviiiTmp{% \xdef~{\noexpand\UTFviiiTwoOctets\string~}} \UTFviiiLoop \countUTFx = "E0 \countUTFy = "F0 \def\UTFviiiTmp{% \xdef~{\noexpand\UTFviiiThreeOctets\string~}} \UTFviiiLoop \countUTFx = "F0 \countUTFy = "F4 \def\UTFviiiTmp{% \xdef~{\noexpand\UTFviiiFourOctets\string~}} \UTFviiiLoop \endgroup \begingroup \catcode`\"=12 \catcode`\<=12 \catcode`\.=12 \catcode`\,=12 \catcode`\;=12 \catcode`\!=12 \catcode`\~=13 \gdef\DeclareUnicodeCharacter#1#2{% \countUTFz = "#1\relax %\wlog{\space\space defining Unicode char U+#1 (decimal \the\countUTFz)}% \begingroup \parseXMLCharref \def\UTFviiiTwoOctets##1##2{% \csname u8:##1\string ##2\endcsname}% \def\UTFviiiThreeOctets##1##2##3{% \csname u8:##1\string ##2\string ##3\endcsname}% \def\UTFviiiFourOctets##1##2##3##4{% \csname u8:##1\string ##2\string ##3\string ##4\endcsname}% \expandafter\expandafter\expandafter\expandafter \expandafter\expandafter\expandafter \gdef\UTFviiiTmp{#2}% \endgroup} \gdef\parseXMLCharref{% \ifnum\countUTFz < "A0\relax \errhelp = \EMsimple \errmessage{Cannot define Unicode char value < 00A0}% \else\ifnum\countUTFz < "800\relax \parseUTFviiiA,% \parseUTFviiiB C\UTFviiiTwoOctets.,% \else\ifnum\countUTFz < "10000\relax \parseUTFviiiA;% \parseUTFviiiA,% \parseUTFviiiB E\UTFviiiThreeOctets.{,;}% \else \parseUTFviiiA;% \parseUTFviiiA,% \parseUTFviiiA!% \parseUTFviiiB F\UTFviiiFourOctets.{!,;}% \fi\fi\fi } \gdef\parseUTFviiiA#1{% \countUTFx = \countUTFz \divide\countUTFz by 64 \countUTFy = \countUTFz \multiply\countUTFz by 64 \advance\countUTFx by -\countUTFz \advance\countUTFx by 128 \uccode `#1\countUTFx \countUTFz = \countUTFy} \gdef\parseUTFviiiB#1#2#3#4{% \advance\countUTFz by "#10\relax \uccode `#3\countUTFz \uppercase{\gdef\UTFviiiTmp{#2#3#4}}} \endgroup \def\utfeightchardefs{% \DeclareUnicodeCharacter{00A0}{\tie} \DeclareUnicodeCharacter{00A1}{\exclamdown} \DeclareUnicodeCharacter{00A3}{\pounds} \DeclareUnicodeCharacter{00A8}{\"{ }} \DeclareUnicodeCharacter{00A9}{\copyright} \DeclareUnicodeCharacter{00AA}{\ordf} \DeclareUnicodeCharacter{00AB}{\guillemetleft} \DeclareUnicodeCharacter{00AD}{\-} \DeclareUnicodeCharacter{00AE}{\registeredsymbol} \DeclareUnicodeCharacter{00AF}{\={ }} \DeclareUnicodeCharacter{00B0}{\ringaccent{ }} \DeclareUnicodeCharacter{00B4}{\'{ }} \DeclareUnicodeCharacter{00B8}{\cedilla{ }} \DeclareUnicodeCharacter{00BA}{\ordm} \DeclareUnicodeCharacter{00BB}{\guillemetright} \DeclareUnicodeCharacter{00BF}{\questiondown} \DeclareUnicodeCharacter{00C0}{\`A} \DeclareUnicodeCharacter{00C1}{\'A} \DeclareUnicodeCharacter{00C2}{\^A} \DeclareUnicodeCharacter{00C3}{\~A} \DeclareUnicodeCharacter{00C4}{\"A} \DeclareUnicodeCharacter{00C5}{\AA} \DeclareUnicodeCharacter{00C6}{\AE} \DeclareUnicodeCharacter{00C7}{\cedilla{C}} \DeclareUnicodeCharacter{00C8}{\`E} \DeclareUnicodeCharacter{00C9}{\'E} \DeclareUnicodeCharacter{00CA}{\^E} \DeclareUnicodeCharacter{00CB}{\"E} \DeclareUnicodeCharacter{00CC}{\`I} \DeclareUnicodeCharacter{00CD}{\'I} \DeclareUnicodeCharacter{00CE}{\^I} \DeclareUnicodeCharacter{00CF}{\"I} \DeclareUnicodeCharacter{00D0}{\DH} \DeclareUnicodeCharacter{00D1}{\~N} \DeclareUnicodeCharacter{00D2}{\`O} \DeclareUnicodeCharacter{00D3}{\'O} \DeclareUnicodeCharacter{00D4}{\^O} \DeclareUnicodeCharacter{00D5}{\~O} \DeclareUnicodeCharacter{00D6}{\"O} \DeclareUnicodeCharacter{00D8}{\O} \DeclareUnicodeCharacter{00D9}{\`U} \DeclareUnicodeCharacter{00DA}{\'U} \DeclareUnicodeCharacter{00DB}{\^U} \DeclareUnicodeCharacter{00DC}{\"U} \DeclareUnicodeCharacter{00DD}{\'Y} \DeclareUnicodeCharacter{00DE}{\TH} \DeclareUnicodeCharacter{00DF}{\ss} \DeclareUnicodeCharacter{00E0}{\`a} \DeclareUnicodeCharacter{00E1}{\'a} \DeclareUnicodeCharacter{00E2}{\^a} \DeclareUnicodeCharacter{00E3}{\~a} \DeclareUnicodeCharacter{00E4}{\"a} \DeclareUnicodeCharacter{00E5}{\aa} \DeclareUnicodeCharacter{00E6}{\ae} \DeclareUnicodeCharacter{00E7}{\cedilla{c}} \DeclareUnicodeCharacter{00E8}{\`e} \DeclareUnicodeCharacter{00E9}{\'e} \DeclareUnicodeCharacter{00EA}{\^e} \DeclareUnicodeCharacter{00EB}{\"e} \DeclareUnicodeCharacter{00EC}{\`{\dotless{i}}} \DeclareUnicodeCharacter{00ED}{\'{\dotless{i}}} \DeclareUnicodeCharacter{00EE}{\^{\dotless{i}}} \DeclareUnicodeCharacter{00EF}{\"{\dotless{i}}} \DeclareUnicodeCharacter{00F0}{\dh} \DeclareUnicodeCharacter{00F1}{\~n} \DeclareUnicodeCharacter{00F2}{\`o} \DeclareUnicodeCharacter{00F3}{\'o} \DeclareUnicodeCharacter{00F4}{\^o} \DeclareUnicodeCharacter{00F5}{\~o} \DeclareUnicodeCharacter{00F6}{\"o} \DeclareUnicodeCharacter{00F8}{\o} \DeclareUnicodeCharacter{00F9}{\`u} \DeclareUnicodeCharacter{00FA}{\'u} \DeclareUnicodeCharacter{00FB}{\^u} \DeclareUnicodeCharacter{00FC}{\"u} \DeclareUnicodeCharacter{00FD}{\'y} \DeclareUnicodeCharacter{00FE}{\th} \DeclareUnicodeCharacter{00FF}{\"y} \DeclareUnicodeCharacter{0100}{\=A} \DeclareUnicodeCharacter{0101}{\=a} \DeclareUnicodeCharacter{0102}{\u{A}} \DeclareUnicodeCharacter{0103}{\u{a}} \DeclareUnicodeCharacter{0104}{\ogonek{A}} \DeclareUnicodeCharacter{0105}{\ogonek{a}} \DeclareUnicodeCharacter{0106}{\'C} \DeclareUnicodeCharacter{0107}{\'c} \DeclareUnicodeCharacter{0108}{\^C} \DeclareUnicodeCharacter{0109}{\^c} \DeclareUnicodeCharacter{0118}{\ogonek{E}} \DeclareUnicodeCharacter{0119}{\ogonek{e}} \DeclareUnicodeCharacter{010A}{\dotaccent{C}} \DeclareUnicodeCharacter{010B}{\dotaccent{c}} \DeclareUnicodeCharacter{010C}{\v{C}} \DeclareUnicodeCharacter{010D}{\v{c}} \DeclareUnicodeCharacter{010E}{\v{D}} \DeclareUnicodeCharacter{0112}{\=E} \DeclareUnicodeCharacter{0113}{\=e} \DeclareUnicodeCharacter{0114}{\u{E}} \DeclareUnicodeCharacter{0115}{\u{e}} \DeclareUnicodeCharacter{0116}{\dotaccent{E}} \DeclareUnicodeCharacter{0117}{\dotaccent{e}} \DeclareUnicodeCharacter{011A}{\v{E}} \DeclareUnicodeCharacter{011B}{\v{e}} \DeclareUnicodeCharacter{011C}{\^G} \DeclareUnicodeCharacter{011D}{\^g} \DeclareUnicodeCharacter{011E}{\u{G}} \DeclareUnicodeCharacter{011F}{\u{g}} \DeclareUnicodeCharacter{0120}{\dotaccent{G}} \DeclareUnicodeCharacter{0121}{\dotaccent{g}} \DeclareUnicodeCharacter{0124}{\^H} \DeclareUnicodeCharacter{0125}{\^h} \DeclareUnicodeCharacter{0128}{\~I} \DeclareUnicodeCharacter{0129}{\~{\dotless{i}}} \DeclareUnicodeCharacter{012A}{\=I} \DeclareUnicodeCharacter{012B}{\={\dotless{i}}} \DeclareUnicodeCharacter{012C}{\u{I}} \DeclareUnicodeCharacter{012D}{\u{\dotless{i}}} \DeclareUnicodeCharacter{0130}{\dotaccent{I}} \DeclareUnicodeCharacter{0131}{\dotless{i}} \DeclareUnicodeCharacter{0132}{IJ} \DeclareUnicodeCharacter{0133}{ij} \DeclareUnicodeCharacter{0134}{\^J} \DeclareUnicodeCharacter{0135}{\^{\dotless{j}}} \DeclareUnicodeCharacter{0139}{\'L} \DeclareUnicodeCharacter{013A}{\'l} \DeclareUnicodeCharacter{0141}{\L} \DeclareUnicodeCharacter{0142}{\l} \DeclareUnicodeCharacter{0143}{\'N} \DeclareUnicodeCharacter{0144}{\'n} \DeclareUnicodeCharacter{0147}{\v{N}} \DeclareUnicodeCharacter{0148}{\v{n}} \DeclareUnicodeCharacter{014C}{\=O} \DeclareUnicodeCharacter{014D}{\=o} \DeclareUnicodeCharacter{014E}{\u{O}} \DeclareUnicodeCharacter{014F}{\u{o}} \DeclareUnicodeCharacter{0150}{\H{O}} \DeclareUnicodeCharacter{0151}{\H{o}} \DeclareUnicodeCharacter{0152}{\OE} \DeclareUnicodeCharacter{0153}{\oe} \DeclareUnicodeCharacter{0154}{\'R} \DeclareUnicodeCharacter{0155}{\'r} \DeclareUnicodeCharacter{0158}{\v{R}} \DeclareUnicodeCharacter{0159}{\v{r}} \DeclareUnicodeCharacter{015A}{\'S} \DeclareUnicodeCharacter{015B}{\'s} \DeclareUnicodeCharacter{015C}{\^S} \DeclareUnicodeCharacter{015D}{\^s} \DeclareUnicodeCharacter{015E}{\cedilla{S}} \DeclareUnicodeCharacter{015F}{\cedilla{s}} \DeclareUnicodeCharacter{0160}{\v{S}} \DeclareUnicodeCharacter{0161}{\v{s}} \DeclareUnicodeCharacter{0162}{\cedilla{t}} \DeclareUnicodeCharacter{0163}{\cedilla{T}} \DeclareUnicodeCharacter{0164}{\v{T}} \DeclareUnicodeCharacter{0168}{\~U} \DeclareUnicodeCharacter{0169}{\~u} \DeclareUnicodeCharacter{016A}{\=U} \DeclareUnicodeCharacter{016B}{\=u} \DeclareUnicodeCharacter{016C}{\u{U}} \DeclareUnicodeCharacter{016D}{\u{u}} \DeclareUnicodeCharacter{016E}{\ringaccent{U}} \DeclareUnicodeCharacter{016F}{\ringaccent{u}} \DeclareUnicodeCharacter{0170}{\H{U}} \DeclareUnicodeCharacter{0171}{\H{u}} \DeclareUnicodeCharacter{0174}{\^W} \DeclareUnicodeCharacter{0175}{\^w} \DeclareUnicodeCharacter{0176}{\^Y} \DeclareUnicodeCharacter{0177}{\^y} \DeclareUnicodeCharacter{0178}{\"Y} \DeclareUnicodeCharacter{0179}{\'Z} \DeclareUnicodeCharacter{017A}{\'z} \DeclareUnicodeCharacter{017B}{\dotaccent{Z}} \DeclareUnicodeCharacter{017C}{\dotaccent{z}} \DeclareUnicodeCharacter{017D}{\v{Z}} \DeclareUnicodeCharacter{017E}{\v{z}} \DeclareUnicodeCharacter{01C4}{D\v{Z}} \DeclareUnicodeCharacter{01C5}{D\v{z}} \DeclareUnicodeCharacter{01C6}{d\v{z}} \DeclareUnicodeCharacter{01C7}{LJ} \DeclareUnicodeCharacter{01C8}{Lj} \DeclareUnicodeCharacter{01C9}{lj} \DeclareUnicodeCharacter{01CA}{NJ} \DeclareUnicodeCharacter{01CB}{Nj} \DeclareUnicodeCharacter{01CC}{nj} \DeclareUnicodeCharacter{01CD}{\v{A}} \DeclareUnicodeCharacter{01CE}{\v{a}} \DeclareUnicodeCharacter{01CF}{\v{I}} \DeclareUnicodeCharacter{01D0}{\v{\dotless{i}}} \DeclareUnicodeCharacter{01D1}{\v{O}} \DeclareUnicodeCharacter{01D2}{\v{o}} \DeclareUnicodeCharacter{01D3}{\v{U}} \DeclareUnicodeCharacter{01D4}{\v{u}} \DeclareUnicodeCharacter{01E2}{\={\AE}} \DeclareUnicodeCharacter{01E3}{\={\ae}} \DeclareUnicodeCharacter{01E6}{\v{G}} \DeclareUnicodeCharacter{01E7}{\v{g}} \DeclareUnicodeCharacter{01E8}{\v{K}} \DeclareUnicodeCharacter{01E9}{\v{k}} \DeclareUnicodeCharacter{01F0}{\v{\dotless{j}}} \DeclareUnicodeCharacter{01F1}{DZ} \DeclareUnicodeCharacter{01F2}{Dz} \DeclareUnicodeCharacter{01F3}{dz} \DeclareUnicodeCharacter{01F4}{\'G} \DeclareUnicodeCharacter{01F5}{\'g} \DeclareUnicodeCharacter{01F8}{\`N} \DeclareUnicodeCharacter{01F9}{\`n} \DeclareUnicodeCharacter{01FC}{\'{\AE}} \DeclareUnicodeCharacter{01FD}{\'{\ae}} \DeclareUnicodeCharacter{01FE}{\'{\O}} \DeclareUnicodeCharacter{01FF}{\'{\o}} \DeclareUnicodeCharacter{021E}{\v{H}} \DeclareUnicodeCharacter{021F}{\v{h}} \DeclareUnicodeCharacter{0226}{\dotaccent{A}} \DeclareUnicodeCharacter{0227}{\dotaccent{a}} \DeclareUnicodeCharacter{0228}{\cedilla{E}} \DeclareUnicodeCharacter{0229}{\cedilla{e}} \DeclareUnicodeCharacter{022E}{\dotaccent{O}} \DeclareUnicodeCharacter{022F}{\dotaccent{o}} \DeclareUnicodeCharacter{0232}{\=Y} \DeclareUnicodeCharacter{0233}{\=y} \DeclareUnicodeCharacter{0237}{\dotless{j}} \DeclareUnicodeCharacter{02DB}{\ogonek{ }} \DeclareUnicodeCharacter{1E02}{\dotaccent{B}} \DeclareUnicodeCharacter{1E03}{\dotaccent{b}} \DeclareUnicodeCharacter{1E04}{\udotaccent{B}} \DeclareUnicodeCharacter{1E05}{\udotaccent{b}} \DeclareUnicodeCharacter{1E06}{\ubaraccent{B}} \DeclareUnicodeCharacter{1E07}{\ubaraccent{b}} \DeclareUnicodeCharacter{1E0A}{\dotaccent{D}} \DeclareUnicodeCharacter{1E0B}{\dotaccent{d}} \DeclareUnicodeCharacter{1E0C}{\udotaccent{D}} \DeclareUnicodeCharacter{1E0D}{\udotaccent{d}} \DeclareUnicodeCharacter{1E0E}{\ubaraccent{D}} \DeclareUnicodeCharacter{1E0F}{\ubaraccent{d}} \DeclareUnicodeCharacter{1E1E}{\dotaccent{F}} \DeclareUnicodeCharacter{1E1F}{\dotaccent{f}} \DeclareUnicodeCharacter{1E20}{\=G} \DeclareUnicodeCharacter{1E21}{\=g} \DeclareUnicodeCharacter{1E22}{\dotaccent{H}} \DeclareUnicodeCharacter{1E23}{\dotaccent{h}} \DeclareUnicodeCharacter{1E24}{\udotaccent{H}} \DeclareUnicodeCharacter{1E25}{\udotaccent{h}} \DeclareUnicodeCharacter{1E26}{\"H} \DeclareUnicodeCharacter{1E27}{\"h} \DeclareUnicodeCharacter{1E30}{\'K} \DeclareUnicodeCharacter{1E31}{\'k} \DeclareUnicodeCharacter{1E32}{\udotaccent{K}} \DeclareUnicodeCharacter{1E33}{\udotaccent{k}} \DeclareUnicodeCharacter{1E34}{\ubaraccent{K}} \DeclareUnicodeCharacter{1E35}{\ubaraccent{k}} \DeclareUnicodeCharacter{1E36}{\udotaccent{L}} \DeclareUnicodeCharacter{1E37}{\udotaccent{l}} \DeclareUnicodeCharacter{1E3A}{\ubaraccent{L}} \DeclareUnicodeCharacter{1E3B}{\ubaraccent{l}} \DeclareUnicodeCharacter{1E3E}{\'M} \DeclareUnicodeCharacter{1E3F}{\'m} \DeclareUnicodeCharacter{1E40}{\dotaccent{M}} \DeclareUnicodeCharacter{1E41}{\dotaccent{m}} \DeclareUnicodeCharacter{1E42}{\udotaccent{M}} \DeclareUnicodeCharacter{1E43}{\udotaccent{m}} \DeclareUnicodeCharacter{1E44}{\dotaccent{N}} \DeclareUnicodeCharacter{1E45}{\dotaccent{n}} \DeclareUnicodeCharacter{1E46}{\udotaccent{N}} \DeclareUnicodeCharacter{1E47}{\udotaccent{n}} \DeclareUnicodeCharacter{1E48}{\ubaraccent{N}} \DeclareUnicodeCharacter{1E49}{\ubaraccent{n}} \DeclareUnicodeCharacter{1E54}{\'P} \DeclareUnicodeCharacter{1E55}{\'p} \DeclareUnicodeCharacter{1E56}{\dotaccent{P}} \DeclareUnicodeCharacter{1E57}{\dotaccent{p}} \DeclareUnicodeCharacter{1E58}{\dotaccent{R}} \DeclareUnicodeCharacter{1E59}{\dotaccent{r}} \DeclareUnicodeCharacter{1E5A}{\udotaccent{R}} \DeclareUnicodeCharacter{1E5B}{\udotaccent{r}} \DeclareUnicodeCharacter{1E5E}{\ubaraccent{R}} \DeclareUnicodeCharacter{1E5F}{\ubaraccent{r}} \DeclareUnicodeCharacter{1E60}{\dotaccent{S}} \DeclareUnicodeCharacter{1E61}{\dotaccent{s}} \DeclareUnicodeCharacter{1E62}{\udotaccent{S}} \DeclareUnicodeCharacter{1E63}{\udotaccent{s}} \DeclareUnicodeCharacter{1E6A}{\dotaccent{T}} \DeclareUnicodeCharacter{1E6B}{\dotaccent{t}} \DeclareUnicodeCharacter{1E6C}{\udotaccent{T}} \DeclareUnicodeCharacter{1E6D}{\udotaccent{t}} \DeclareUnicodeCharacter{1E6E}{\ubaraccent{T}} \DeclareUnicodeCharacter{1E6F}{\ubaraccent{t}} \DeclareUnicodeCharacter{1E7C}{\~V} \DeclareUnicodeCharacter{1E7D}{\~v} \DeclareUnicodeCharacter{1E7E}{\udotaccent{V}} \DeclareUnicodeCharacter{1E7F}{\udotaccent{v}} \DeclareUnicodeCharacter{1E80}{\`W} \DeclareUnicodeCharacter{1E81}{\`w} \DeclareUnicodeCharacter{1E82}{\'W} \DeclareUnicodeCharacter{1E83}{\'w} \DeclareUnicodeCharacter{1E84}{\"W} \DeclareUnicodeCharacter{1E85}{\"w} \DeclareUnicodeCharacter{1E86}{\dotaccent{W}} \DeclareUnicodeCharacter{1E87}{\dotaccent{w}} \DeclareUnicodeCharacter{1E88}{\udotaccent{W}} \DeclareUnicodeCharacter{1E89}{\udotaccent{w}} \DeclareUnicodeCharacter{1E8A}{\dotaccent{X}} \DeclareUnicodeCharacter{1E8B}{\dotaccent{x}} \DeclareUnicodeCharacter{1E8C}{\"X} \DeclareUnicodeCharacter{1E8D}{\"x} \DeclareUnicodeCharacter{1E8E}{\dotaccent{Y}} \DeclareUnicodeCharacter{1E8F}{\dotaccent{y}} \DeclareUnicodeCharacter{1E90}{\^Z} \DeclareUnicodeCharacter{1E91}{\^z} \DeclareUnicodeCharacter{1E92}{\udotaccent{Z}} \DeclareUnicodeCharacter{1E93}{\udotaccent{z}} \DeclareUnicodeCharacter{1E94}{\ubaraccent{Z}} \DeclareUnicodeCharacter{1E95}{\ubaraccent{z}} \DeclareUnicodeCharacter{1E96}{\ubaraccent{h}} \DeclareUnicodeCharacter{1E97}{\"t} \DeclareUnicodeCharacter{1E98}{\ringaccent{w}} \DeclareUnicodeCharacter{1E99}{\ringaccent{y}} \DeclareUnicodeCharacter{1EA0}{\udotaccent{A}} \DeclareUnicodeCharacter{1EA1}{\udotaccent{a}} \DeclareUnicodeCharacter{1EB8}{\udotaccent{E}} \DeclareUnicodeCharacter{1EB9}{\udotaccent{e}} \DeclareUnicodeCharacter{1EBC}{\~E} \DeclareUnicodeCharacter{1EBD}{\~e} \DeclareUnicodeCharacter{1ECA}{\udotaccent{I}} \DeclareUnicodeCharacter{1ECB}{\udotaccent{i}} \DeclareUnicodeCharacter{1ECC}{\udotaccent{O}} \DeclareUnicodeCharacter{1ECD}{\udotaccent{o}} \DeclareUnicodeCharacter{1EE4}{\udotaccent{U}} \DeclareUnicodeCharacter{1EE5}{\udotaccent{u}} \DeclareUnicodeCharacter{1EF2}{\`Y} \DeclareUnicodeCharacter{1EF3}{\`y} \DeclareUnicodeCharacter{1EF4}{\udotaccent{Y}} \DeclareUnicodeCharacter{1EF8}{\~Y} \DeclareUnicodeCharacter{1EF9}{\~y} \DeclareUnicodeCharacter{2013}{--} \DeclareUnicodeCharacter{2014}{---} \DeclareUnicodeCharacter{2018}{\quoteleft} \DeclareUnicodeCharacter{2019}{\quoteright} \DeclareUnicodeCharacter{201A}{\quotesinglbase} \DeclareUnicodeCharacter{201C}{\quotedblleft} \DeclareUnicodeCharacter{201D}{\quotedblright} \DeclareUnicodeCharacter{201E}{\quotedblbase} \DeclareUnicodeCharacter{2022}{\bullet} \DeclareUnicodeCharacter{2026}{\dots} \DeclareUnicodeCharacter{2039}{\guilsinglleft} \DeclareUnicodeCharacter{203A}{\guilsinglright} \DeclareUnicodeCharacter{20AC}{\euro} \DeclareUnicodeCharacter{2192}{\expansion} \DeclareUnicodeCharacter{21D2}{\result} \DeclareUnicodeCharacter{2212}{\minus} \DeclareUnicodeCharacter{2217}{\point} \DeclareUnicodeCharacter{2261}{\equiv} }% end of \utfeightchardefs % US-ASCII character definitions. \def\asciichardefs{% nothing need be done \relax } % Make non-ASCII characters printable again for compatibility with % existing Texinfo documents that may use them, even without declaring a % document encoding. % \setnonasciicharscatcode \other \message{formatting,} \newdimen\defaultparindent \defaultparindent = 15pt \chapheadingskip = 15pt plus 4pt minus 2pt \secheadingskip = 12pt plus 3pt minus 2pt \subsecheadingskip = 9pt plus 2pt minus 2pt % Prevent underfull vbox error messages. \vbadness = 10000 % Don't be very finicky about underfull hboxes, either. \hbadness = 6666 % Following George Bush, get rid of widows and orphans. \widowpenalty=10000 \clubpenalty=10000 % Use TeX 3.0's \emergencystretch to help line breaking, but if we're % using an old version of TeX, don't do anything. We want the amount of % stretch added to depend on the line length, hence the dependence on % \hsize. We call this whenever the paper size is set. % \def\setemergencystretch{% \ifx\emergencystretch\thisisundefined % Allow us to assign to \emergencystretch anyway. \def\emergencystretch{\dimen0}% \else \emergencystretch = .15\hsize \fi } % Parameters in order: 1) textheight; 2) textwidth; % 3) voffset; 4) hoffset; 5) binding offset; 6) topskip; % 7) physical page height; 8) physical page width. % % We also call \setleading{\textleading}, so the caller should define % \textleading. The caller should also set \parskip. % \def\internalpagesizes#1#2#3#4#5#6#7#8{% \voffset = #3\relax \topskip = #6\relax \splittopskip = \topskip % \vsize = #1\relax \advance\vsize by \topskip \outervsize = \vsize \advance\outervsize by 2\topandbottommargin \pageheight = \vsize % \hsize = #2\relax \outerhsize = \hsize \advance\outerhsize by 0.5in \pagewidth = \hsize % \normaloffset = #4\relax \bindingoffset = #5\relax % \ifpdf \pdfpageheight #7\relax \pdfpagewidth #8\relax % if we don't reset these, they will remain at "1 true in" of % whatever layout pdftex was dumped with. \pdfhorigin = 1 true in \pdfvorigin = 1 true in \fi % \setleading{\textleading} % \parindent = \defaultparindent \setemergencystretch } % @letterpaper (the default). \def\letterpaper{{\globaldefs = 1 \parskip = 3pt plus 2pt minus 1pt \textleading = 13.2pt % % If page is nothing but text, make it come out even. \internalpagesizes{607.2pt}{6in}% that's 46 lines {\voffset}{.25in}% {\bindingoffset}{36pt}% {11in}{8.5in}% }} % Use @smallbook to reset parameters for 7x9.25 trim size. \def\smallbook{{\globaldefs = 1 \parskip = 2pt plus 1pt \textleading = 12pt % \internalpagesizes{7.5in}{5in}% {-.2in}{0in}% {\bindingoffset}{16pt}% {9.25in}{7in}% % \lispnarrowing = 0.3in \tolerance = 700 \hfuzz = 1pt \contentsrightmargin = 0pt \defbodyindent = .5cm }} % Use @smallerbook to reset parameters for 6x9 trim size. % (Just testing, parameters still in flux.) \def\smallerbook{{\globaldefs = 1 \parskip = 1.5pt plus 1pt \textleading = 12pt % \internalpagesizes{7.4in}{4.8in}% {-.2in}{-.4in}% {0pt}{14pt}% {9in}{6in}% % \lispnarrowing = 0.25in \tolerance = 700 \hfuzz = 1pt \contentsrightmargin = 0pt \defbodyindent = .4cm }} % Use @afourpaper to print on European A4 paper. \def\afourpaper{{\globaldefs = 1 \parskip = 3pt plus 2pt minus 1pt \textleading = 13.2pt % % Double-side printing via postscript on Laserjet 4050 % prints double-sided nicely when \bindingoffset=10mm and \hoffset=-6mm. % To change the settings for a different printer or situation, adjust % \normaloffset until the front-side and back-side texts align. Then % do the same for \bindingoffset. You can set these for testing in % your texinfo source file like this: % @tex % \global\normaloffset = -6mm % \global\bindingoffset = 10mm % @end tex \internalpagesizes{673.2pt}{160mm}% that's 51 lines {\voffset}{\hoffset}% {\bindingoffset}{44pt}% {297mm}{210mm}% % \tolerance = 700 \hfuzz = 1pt \contentsrightmargin = 0pt \defbodyindent = 5mm }} % Use @afivepaper to print on European A5 paper. % From romildo@urano.iceb.ufop.br, 2 July 2000. % He also recommends making @example and @lisp be small. \def\afivepaper{{\globaldefs = 1 \parskip = 2pt plus 1pt minus 0.1pt \textleading = 12.5pt % \internalpagesizes{160mm}{120mm}% {\voffset}{\hoffset}% {\bindingoffset}{8pt}% {210mm}{148mm}% % \lispnarrowing = 0.2in \tolerance = 800 \hfuzz = 1.2pt \contentsrightmargin = 0pt \defbodyindent = 2mm \tableindent = 12mm }} % A specific text layout, 24x15cm overall, intended for A4 paper. \def\afourlatex{{\globaldefs = 1 \afourpaper \internalpagesizes{237mm}{150mm}% {\voffset}{4.6mm}% {\bindingoffset}{7mm}% {297mm}{210mm}% % % Must explicitly reset to 0 because we call \afourpaper. \globaldefs = 0 }} % Use @afourwide to print on A4 paper in landscape format. \def\afourwide{{\globaldefs = 1 \afourpaper \internalpagesizes{241mm}{165mm}% {\voffset}{-2.95mm}% {\bindingoffset}{7mm}% {297mm}{210mm}% \globaldefs = 0 }} % @pagesizes TEXTHEIGHT[,TEXTWIDTH] % Perhaps we should allow setting the margins, \topskip, \parskip, % and/or leading, also. Or perhaps we should compute them somehow. % \parseargdef\pagesizes{\pagesizesyyy #1,,\finish} \def\pagesizesyyy#1,#2,#3\finish{{% \setbox0 = \hbox{\ignorespaces #2}\ifdim\wd0 > 0pt \hsize=#2\relax \fi \globaldefs = 1 % \parskip = 3pt plus 2pt minus 1pt \setleading{\textleading}% % \dimen0 = #1\relax \advance\dimen0 by \voffset % \dimen2 = \hsize \advance\dimen2 by \normaloffset % \internalpagesizes{#1}{\hsize}% {\voffset}{\normaloffset}% {\bindingoffset}{44pt}% {\dimen0}{\dimen2}% }} % Set default to letter. % \letterpaper \message{and turning on texinfo input format.} \def^^L{\par} % remove \outer, so ^L can appear in an @comment % DEL is a comment character, in case @c does not suffice. \catcode`\^^? = 14 % Define macros to output various characters with catcode for normal text. \catcode`\"=\other \def\normaldoublequote{"} \catcode`\$=\other \def\normaldollar{$}%$ font-lock fix \catcode`\+=\other \def\normalplus{+} \catcode`\<=\other \def\normalless{<} \catcode`\>=\other \def\normalgreater{>} \catcode`\^=\other \def\normalcaret{^} \catcode`\_=\other \def\normalunderscore{_} \catcode`\|=\other \def\normalverticalbar{|} \catcode`\~=\other \def\normaltilde{~} % This macro is used to make a character print one way in \tt % (where it can probably be output as-is), and another way in other fonts, % where something hairier probably needs to be done. % % #1 is what to print if we are indeed using \tt; #2 is what to print % otherwise. Since all the Computer Modern typewriter fonts have zero % interword stretch (and shrink), and it is reasonable to expect all % typewriter fonts to have this, we can check that font parameter. % \def\ifusingtt#1#2{\ifdim \fontdimen3\font=0pt #1\else #2\fi} % Same as above, but check for italic font. Actually this also catches % non-italic slanted fonts since it is impossible to distinguish them from % italic fonts. But since this is only used by $ and it uses \sl anyway % this is not a problem. \def\ifusingit#1#2{\ifdim \fontdimen1\font>0pt #1\else #2\fi} % Turn off all special characters except @ % (and those which the user can use as if they were ordinary). % Most of these we simply print from the \tt font, but for some, we can % use math or other variants that look better in normal text. \catcode`\"=\active \def\activedoublequote{{\tt\char34}} \let"=\activedoublequote \catcode`\~=\active \def~{{\tt\char126}} \chardef\hat=`\^ \catcode`\^=\active \def^{{\tt \hat}} \catcode`\_=\active \def_{\ifusingtt\normalunderscore\_} \let\realunder=_ % Subroutine for the previous macro. \def\_{\leavevmode \kern.07em \vbox{\hrule width.3em height.1ex}\kern .07em } \catcode`\|=\active \def|{{\tt\char124}} \chardef \less=`\< \catcode`\<=\active \def<{{\tt \less}} \chardef \gtr=`\> \catcode`\>=\active \def>{{\tt \gtr}} \catcode`\+=\active \def+{{\tt \char 43}} \catcode`\$=\active \def${\ifusingit{{\sl\$}}\normaldollar}%$ font-lock fix % If a .fmt file is being used, characters that might appear in a file % name cannot be active until we have parsed the command line. % So turn them off again, and have \everyjob (or @setfilename) turn them on. % \otherifyactive is called near the end of this file. \def\otherifyactive{\catcode`+=\other \catcode`\_=\other} % Used sometimes to turn off (effectively) the active characters even after % parsing them. \def\turnoffactive{% \normalturnoffactive \otherbackslash } \catcode`\@=0 % \backslashcurfont outputs one backslash character in current font, % as in \char`\\. \global\chardef\backslashcurfont=`\\ \global\let\rawbackslashxx=\backslashcurfont % let existing .??s files work % \realbackslash is an actual character `\' with catcode other, and % \doublebackslash is two of them (for the pdf outlines). {\catcode`\\=\other @gdef@realbackslash{\} @gdef@doublebackslash{\\}} % In texinfo, backslash is an active character; it prints the backslash % in fixed width font. \catcode`\\=\active % @ for escape char from now on. % The story here is that in math mode, the \char of \backslashcurfont % ends up printing the roman \ from the math symbol font (because \char % in math mode uses the \mathcode, and plain.tex sets % \mathcode`\\="026E). It seems better for @backslashchar{} to always % print a typewriter backslash, hence we use an explicit \mathchar, % which is the decimal equivalent of "715c (class 7, e.g., use \fam; % ignored family value; char position "5C). We can't use " for the % usual hex value because it has already been made active. @def@normalbackslash{{@tt @ifmmode @mathchar29020 @else @backslashcurfont @fi}} @let@backslashchar = @normalbackslash % @backslashchar{} is for user documents. % On startup, @fixbackslash assigns: % @let \ = @normalbackslash % \rawbackslash defines an active \ to do \backslashcurfont. % \otherbackslash defines an active \ to be a literal `\' character with % catcode other. We switch back and forth between these. @gdef@rawbackslash{@let\=@backslashcurfont} @gdef@otherbackslash{@let\=@realbackslash} % Same as @turnoffactive except outputs \ as {\tt\char`\\} instead of % the literal character `\'. Also revert - to its normal character, in % case the active - from code has slipped in. % {@catcode`- = @active @gdef@normalturnoffactive{% @let-=@normaldash @let"=@normaldoublequote @let$=@normaldollar %$ font-lock fix @let+=@normalplus @let<=@normalless @let>=@normalgreater @let\=@normalbackslash @let^=@normalcaret @let_=@normalunderscore @let|=@normalverticalbar @let~=@normaltilde @markupsetuplqdefault @markupsetuprqdefault @unsepspaces } } % Make _ and + \other characters, temporarily. % This is canceled by @fixbackslash. @otherifyactive % If a .fmt file is being used, we don't want the `\input texinfo' to show up. % That is what \eatinput is for; after that, the `\' should revert to printing % a backslash. % @gdef@eatinput input texinfo{@fixbackslash} @global@let\ = @eatinput % On the other hand, perhaps the file did not have a `\input texinfo'. Then % the first `\' in the file would cause an error. This macro tries to fix % that, assuming it is called before the first `\' could plausibly occur. % Also turn back on active characters that might appear in the input % file name, in case not using a pre-dumped format. % @gdef@fixbackslash{% @ifx\@eatinput @let\ = @normalbackslash @fi @catcode`+=@active @catcode`@_=@active } % Say @foo, not \foo, in error messages. @escapechar = `@@ % These (along with & and #) are made active for url-breaking, so need % active definitions as the normal characters. @def@normaldot{.} @def@normalquest{?} @def@normalslash{/} % These look ok in all fonts, so just make them not special. % @hashchar{} gets its own user-level command, because of #line. @catcode`@& = @other @def@normalamp{&} @catcode`@# = @other @def@normalhash{#} @catcode`@% = @other @def@normalpercent{%} @let @hashchar = @normalhash @c Finally, make ` and ' active, so that txicodequoteundirected and @c txicodequotebacktick work right in, e.g., @w{@code{`foo'}}. If we @c don't make ` and ' active, @code will not get them as active chars. @c Do this last of all since we use ` in the previous @catcode assignments. @catcode`@'=@active @catcode`@`=@active @markupsetuplqdefault @markupsetuprqdefault @c Local variables: @c eval: (add-hook 'write-file-hooks 'time-stamp) @c page-delimiter: "^\\\\message" @c time-stamp-start: "def\\\\texinfoversion{" @c time-stamp-format: "%:y-%02m-%02d.%02H" @c time-stamp-end: "}" @c End: @c vim:sw=2: @ignore arch-tag: e1b36e32-c96e-4135-a41a-0b2efa2ea115 @end ignore cloog-0.18.4/osl/autoconf/ltmain.sh0000644000175000017500000105204412413256721014074 00000000000000 # libtool (GNU libtool) 2.4.2 # Written by Gordon Matzigkeit , 1996 # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, 2006, # 2007, 2008, 2009, 2010, 2011 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 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. # Usage: $progname [OPTION]... [MODE-ARG]... # # Provide generalized library-building support services. # # --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 # --preserve-dup-deps don't remove duplicate dependency libraries # --quiet, --silent don't print informational messages # --no-quiet, --no-silent # print informational messages (default) # --no-warn don't display warning messages # --tag=TAG use configuration variables from tag TAG # -v, --verbose print more informational messages than default # --no-verbose don't print the extra informational messages # --version print version information # -h, --help, --help-all print short, long, or detailed 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) # $progname: (GNU libtool) 2.4.2 Debian-2.4.2-1.7ubuntu1 # automake: $automake_version # autoconf: $autoconf_version # # Report bugs to . # GNU libtool home page: . # General help using GNU software: . PROGRAM=libtool PACKAGE=libtool VERSION="2.4.2 Debian-2.4.2-1.7ubuntu1" TIMESTAMP="" package_revision=1.3337 # 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 # A function that is used when there is no print builtin or printf. func_fallback_echo () { eval 'cat <<_LTECHO_EOF $1 _LTECHO_EOF' } # NLS nuisances: We save the old values to restore during execute mode. lt_user_locale= lt_safe_locale= for lt_var in LANG LANGUAGE LC_ALL LC_CTYPE LC_COLLATE LC_MESSAGES do eval "if test \"\${$lt_var+set}\" = set; then save_$lt_var=\$$lt_var $lt_var=C export $lt_var lt_user_locale=\"$lt_var=\\\$save_\$lt_var; \$lt_user_locale\" lt_safe_locale=\"$lt_var=C; \$lt_safe_locale\" fi" done LC_ALL=C LANGUAGE=C export LANGUAGE LC_ALL $lt_unset CDPATH # 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" : ${CP="cp -f"} test "${ECHO+set}" = set || ECHO=${as_echo-'printf %s\n'} : ${MAKE="make"} : ${MKDIR="mkdir"} : ${MV="mv -f"} : ${RM="rm -f"} : ${SHELL="${CONFIG_SHELL-/bin/sh}"} : ${Xsed="$SED -e 1s/^X//"} # Global variables: 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. exit_status=$EXIT_SUCCESS # Make sure IFS has a sensible default lt_nl=' ' IFS=" $lt_nl" dirname="s,/[^/]*$,," basename="s,^.*/,," # func_dirname file append nondir_replacement # Compute the dirname of FILE. If nonempty, add APPEND to the result, # otherwise set result to NONDIR_REPLACEMENT. func_dirname () { func_dirname_result=`$ECHO "${1}" | $SED "$dirname"` if test "X$func_dirname_result" = "X${1}"; then func_dirname_result="${3}" else func_dirname_result="$func_dirname_result${2}" fi } # func_dirname may be replaced by extended shell implementation # func_basename file func_basename () { func_basename_result=`$ECHO "${1}" | $SED "$basename"` } # func_basename may be replaced by extended shell implementation # 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" # Implementation must be kept synchronized with func_dirname # and func_basename. For efficiency, we do not delegate to # those functions but instead duplicate the functionality here. func_dirname_and_basename () { # Extract subdirectory from the argument. func_dirname_result=`$ECHO "${1}" | $SED -e "$dirname"` if test "X$func_dirname_result" = "X${1}"; then func_dirname_result="${3}" else func_dirname_result="$func_dirname_result${2}" fi func_basename_result=`$ECHO "${1}" | $SED -e "$basename"` } # func_dirname_and_basename may be replaced by extended shell implementation # func_stripname 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). # func_strip_suffix prefix name func_stripname () { 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 may be replaced by extended shell implementation # These SED scripts presuppose an absolute path with a trailing slash. pathcar='s,^/\([^/]*\).*$,\1,' pathcdr='s,^/[^/]*,,' removedotparts=':dotsl s@/\./@/@g t dotsl s,/\.$,/,' collapseslashes='s@/\{1,\}@/@g' finalslash='s,/*$,/,' # 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. # value returned in "$func_normal_abspath_result" func_normal_abspath () { # 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 "$removedotparts" -e "$collapseslashes" -e "$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 "$pathcar"` func_normal_abspath_tpath=`$ECHO "$func_normal_abspath_tpath" | $SED \ -e "$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_normal_abspath_result=$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_relative_path SRCDIR DSTDIR # generates a relative path from SRCDIR to DSTDIR, with a trailing # slash if non-empty, suitable for immediately appending a filename # without needing to append a separator. # value returned in "$func_relative_path_result" func_relative_path () { 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 "x$func_relative_path_tlibdir" = x ; 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 "x$func_stripname_result" != x ; then func_relative_path_result=${func_relative_path_result}/${func_stripname_result} fi # Normalisation. If bindir is libdir, return empty string, # else relative path ending with a slash; either way, target # file name can be directly appended. if test ! -z "$func_relative_path_result"; then func_stripname './' '' "$func_relative_path_result/" func_relative_path_result=$func_stripname_result fi } # The name of this program: func_dirname_and_basename "$progpath" progname=$func_basename_result # Make sure we have an absolute path for reexecution: case $progpath in [\\/]*|[A-Za-z]:\\*) ;; *[\\/]*) progdir=$func_dirname_result progdir=`cd "$progdir" && pwd` progpath="$progdir/$progname" ;; *) save_IFS="$IFS" IFS=${PATH_SEPARATOR-:} for progdir in $PATH; do IFS="$save_IFS" test -x "$progdir/$progname" && break done IFS="$save_IFS" test -n "$progdir" || progdir=`pwd` progpath="$progdir/$progname" ;; esac # Sed substitution that helps us do robust quoting. It backslashifies # metacharacters that are still active within double-quoted strings. Xsed="${SED}"' -e 1s/^X//' sed_quote_subst='s/\([`"$\\]\)/\\\1/g' # Same as above, but do not quote variable references. 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 # which contains forward slashes, into one that contains # (escaped) backslashes. A very naive implementation. lt_sed_naive_backslashify='s|\\\\*|\\|g;s|/|\\|g;s|\\|\\\\|g' # Re-`\' parameter expansions in output of double_quote_subst that were # `\'-ed in input to the same. If an odd number of `\' preceded a '$' # in input to 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 '$'. bs='\\' bs2='\\\\' bs4='\\\\\\\\' dollar='\$' sed_double_backslash="\ s/$bs4/&\\ /g s/^$bs2$dollar/$bs&/ s/\\([^$bs]\\)$bs2$dollar/\\1$bs2$bs$dollar/g s/\n//g" # Standard options: opt_dry_run=false opt_help=false opt_quiet=false opt_verbose=false opt_warning=: # func_echo arg... # Echo program name prefixed message, along with the current mode # name if it has been set yet. func_echo () { $ECHO "$progname: ${opt_mode+$opt_mode: }$*" } # func_verbose arg... # Echo program name prefixed message in verbose mode only. func_verbose () { $opt_verbose && 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_echo_all arg... # Invoke $ECHO with all args, space-separated. func_echo_all () { $ECHO "$*" } # func_error arg... # Echo program name prefixed message to standard error. func_error () { $ECHO "$progname: ${opt_mode+$opt_mode: }"${1+"$@"} 1>&2 } # func_warning arg... # Echo program name prefixed warning message to standard error. func_warning () { $opt_warning && $ECHO "$progname: ${opt_mode+$opt_mode: }warning: "${1+"$@"} 1>&2 # bash bug again: : } # func_fatal_error arg... # Echo program name prefixed message to standard error, and exit. func_fatal_error () { func_error ${1+"$@"} exit $EXIT_FAILURE } # func_fatal_help arg... # Echo program name prefixed message to standard error, followed by # a help hint, and exit. func_fatal_help () { func_error ${1+"$@"} func_fatal_error "$help" } help="Try \`$progname --help' for more information." ## default # func_grep expression filename # Check whether EXPRESSION matches any line of FILENAME, without output. func_grep () { $GREP "$1" "$2" >/dev/null 2>&1 } # func_mkdir_p directory-path # Make sure the entire path to DIRECTORY-PATH is available. func_mkdir_p () { my_directory_path="$1" my_dir_list= if test -n "$my_directory_path" && test "$opt_dry_run" != ":"; then # Protect directory names starting with `-' case $my_directory_path in -*) my_directory_path="./$my_directory_path" ;; esac # While some portion of DIR does not yet exist... while test ! -d "$my_directory_path"; do # ...make a list in topmost first order. Use a colon delimited # list incase some portion of path contains whitespace. my_dir_list="$my_directory_path:$my_dir_list" # If the last portion added has no slash in it, the list is done case $my_directory_path in */*) ;; *) break ;; esac # ...otherwise throw away the child directory and loop my_directory_path=`$ECHO "$my_directory_path" | $SED -e "$dirname"` done my_dir_list=`$ECHO "$my_dir_list" | $SED 's,:*$,,'` save_mkdir_p_IFS="$IFS"; IFS=':' for my_dir in $my_dir_list; do IFS="$save_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 "$my_dir" 2>/dev/null || : done IFS="$save_mkdir_p_IFS" # Bail out if we (or some other process) failed to create a directory. test -d "$my_directory_path" || \ func_fatal_error "Failed to create \`$1'" fi } # func_mktempdir [string] # Make a temporary directory that won't clash with other running # libtool processes, and avoids race conditions if possible. If # given, STRING is the basename for that directory. func_mktempdir () { my_template="${TMPDIR-/tmp}/${1-$progname}" if test "$opt_dry_run" = ":"; then # Return a directory name, but don't create it in dry-run mode my_tmpdir="${my_template}-$$" else # If mktemp works, use that first and foremost my_tmpdir=`mktemp -d "${my_template}-XXXXXXXX" 2>/dev/null` if test ! -d "$my_tmpdir"; then # Failing that, at least try and use $RANDOM to avoid a race my_tmpdir="${my_template}-${RANDOM-0}$$" save_mktempdir_umask=`umask` umask 0077 $MKDIR "$my_tmpdir" umask $save_mktempdir_umask fi # If we're not in dry-run mode, bomb out on failure test -d "$my_tmpdir" || \ func_fatal_error "cannot create temporary directory \`$my_tmpdir'" fi $ECHO "$my_tmpdir" } # func_quote_for_eval arg # Aesthetically quote ARG to be evaled later. # This function returns two values: FUNC_QUOTE_FOR_EVAL_RESULT # is double-quoted, suitable for a subsequent eval, whereas # FUNC_QUOTE_FOR_EVAL_UNQUOTED_RESULT has merely all characters # which are still active within double quotes backslashified. func_quote_for_eval () { case $1 in *[\\\`\"\$]*) func_quote_for_eval_unquoted_result=`$ECHO "$1" | $SED "$sed_quote_subst"` ;; *) func_quote_for_eval_unquoted_result="$1" ;; esac case $func_quote_for_eval_unquoted_result in # Double-quote args containing shell metacharacters to delay # word splitting, command substitution and and variable # expansion for a subsequent eval. # Many Bourne shells cannot handle close brackets correctly # in scan sets, so we specify it separately. *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") func_quote_for_eval_result="\"$func_quote_for_eval_unquoted_result\"" ;; *) func_quote_for_eval_result="$func_quote_for_eval_unquoted_result" esac } # 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 () { case $1 in *[\\\`\"]*) my_arg=`$ECHO "$1" | $SED \ -e "$double_quote_subst" -e "$sed_double_backslash"` ;; *) my_arg="$1" ;; esac case $my_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. *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") my_arg="\"$my_arg\"" ;; esac func_quote_for_expand_result="$my_arg" } # func_show_eval cmd [fail_exp] # Unless opt_silent 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 () { my_cmd="$1" my_fail_exp="${2-:}" ${opt_silent-false} || { func_quote_for_expand "$my_cmd" eval "func_echo $func_quote_for_expand_result" } if ${opt_dry_run-false}; then :; else eval "$my_cmd" my_status=$? if test "$my_status" -eq 0; then :; else eval "(exit $my_status); $my_fail_exp" fi fi } # func_show_eval_locale cmd [fail_exp] # Unless opt_silent 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 () { my_cmd="$1" my_fail_exp="${2-:}" ${opt_silent-false} || { func_quote_for_expand "$my_cmd" eval "func_echo $func_quote_for_expand_result" } if ${opt_dry_run-false}; then :; else eval "$lt_user_locale $my_cmd" my_status=$? eval "$lt_safe_locale" if test "$my_status" -eq 0; then :; else eval "(exit $my_status); $my_fail_exp" fi 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 () { case $1 in [0-9]* | *[!a-zA-Z0-9_]*) func_tr_sh_result=`$ECHO "$1" | $SED 's/^\([0-9]\)/_\1/; s/[^a-zA-Z0-9_]/_/g'` ;; * ) func_tr_sh_result=$1 ;; esac } # func_version # Echo version message to standard output and exit. func_version () { $opt_debug $SED -n '/(C)/!b go :more /\./!{ N s/\n# / / b more } :go /^# '$PROGRAM' (GNU /,/# warranty; / { s/^# // s/^# *$// s/\((C)\)[ 0-9,-]*\( [1-9][0-9]*\)/\1\2/ p }' < "$progpath" exit $? } # func_usage # Echo short help message to standard output and exit. func_usage () { $opt_debug $SED -n '/^# Usage:/,/^# *.*--help/ { s/^# // s/^# *$// s/\$progname/'$progname'/ p }' < "$progpath" echo $ECHO "run \`$progname --help | more' for full usage" exit $? } # func_help [NOEXIT] # Echo long help message to standard output and exit, # unless 'noexit' is passed as argument. func_help () { $opt_debug $SED -n '/^# Usage:/,/# Report bugs to/ { :print s/^# // s/^# *$// s*\$progname*'$progname'* s*\$host*'"$host"'* s*\$SHELL*'"$SHELL"'* s*\$LTCC*'"$LTCC"'* s*\$LTCFLAGS*'"$LTCFLAGS"'* s*\$LD*'"$LD"'* s/\$with_gnu_ld/'"$with_gnu_ld"'/ s/\$automake_version/'"`(${AUTOMAKE-automake} --version) 2>/dev/null |$SED 1q`"'/ s/\$autoconf_version/'"`(${AUTOCONF-autoconf} --version) 2>/dev/null |$SED 1q`"'/ p d } /^# .* home page:/b print /^# General help using/b print ' < "$progpath" ret=$? if test -z "$1"; then exit $ret fi } # func_missing_arg argname # Echo program name prefixed message to standard error and set global # exit_cmd. func_missing_arg () { $opt_debug func_error "missing argument for $1." exit_cmd=exit } # 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. func_split_short_opt () { my_sed_short_opt='1s/^\(..\).*$/\1/;q' my_sed_short_rest='1s/^..\(.*\)$/\1/;q' func_split_short_opt_name=`$ECHO "$1" | $SED "$my_sed_short_opt"` func_split_short_opt_arg=`$ECHO "$1" | $SED "$my_sed_short_rest"` } # func_split_short_opt may be replaced by extended shell implementation # func_split_long_opt longopt # Set func_split_long_opt_name and func_split_long_opt_arg shell # variables after splitting LONGOPT at the `=' sign. func_split_long_opt () { my_sed_long_opt='1s/^\(--[^=]*\)=.*/\1/;q' my_sed_long_arg='1s/^--[^=]*=//' func_split_long_opt_name=`$ECHO "$1" | $SED "$my_sed_long_opt"` func_split_long_opt_arg=`$ECHO "$1" | $SED "$my_sed_long_arg"` } # func_split_long_opt may be replaced by extended shell implementation exit_cmd=: magic="%%%MAGIC variable%%%" magic_exe="%%%MAGIC EXE variable%%%" # Global variables. nonopt= preserve_args= lo2o="s/\\.lo\$/.${objext}/" o2lo="s/\\.${objext}\$/.lo/" 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= # func_append var value # Append VALUE to the end of shell variable VAR. func_append () { eval "${1}=\$${1}\${2}" } # func_append may be replaced by extended shell implementation # func_append_quoted var value # Quote VALUE and append to the end of shell variable VAR, separated # by a space. func_append_quoted () { func_quote_for_eval "${2}" eval "${1}=\$${1}\\ \$func_quote_for_eval_result" } # func_append_quoted may be replaced by extended shell implementation # func_arith arithmetic-term... func_arith () { func_arith_result=`expr "${@}"` } # func_arith may be replaced by extended shell implementation # func_len string # STRING may not start with a hyphen. func_len () { func_len_result=`expr "${1}" : ".*" 2>/dev/null || echo $max_cmd_len` } # func_len may be replaced by extended shell implementation # func_lo2o object func_lo2o () { func_lo2o_result=`$ECHO "${1}" | $SED "$lo2o"` } # func_lo2o may be replaced by extended shell implementation # func_xform libobj-or-source func_xform () { func_xform_result=`$ECHO "${1}" | $SED 's/\.[^.]*$/.lo/'` } # func_xform may be replaced by extended shell implementation # func_fatal_configuration arg... # Echo program name prefixed message to standard error, followed by # a configuration failure hint, and exit. func_fatal_configuration () { func_error ${1+"$@"} func_error "See the $PACKAGE documentation for more information." func_fatal_error "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 "$build_libtool_libs" = yes; then echo "enable shared libraries" else echo "disable shared libraries" fi if test "$build_old_libs" = yes; 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 } # 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 # Option defaults: opt_debug=: opt_dry_run=false opt_config=false opt_preserve_dup_deps=false opt_features=false opt_finish=false opt_help=false opt_help_all=false opt_silent=: opt_warning=: opt_verbose=: opt_silent=false opt_verbose=false # Parse options once, thoroughly. This comes as soon as possible in the # script to make things like `--version' happen as quickly as we can. { # this just eases exit handling while test $# -gt 0; do opt="$1" shift case $opt in --debug|-x) opt_debug='set -x' func_echo "enabling shell trace mode" $opt_debug ;; --dry-run|--dryrun|-n) opt_dry_run=: ;; --config) opt_config=: func_config ;; --dlopen|-dlopen) optarg="$1" opt_dlopen="${opt_dlopen+$opt_dlopen }$optarg" shift ;; --preserve-dup-deps) opt_preserve_dup_deps=: ;; --features) opt_features=: func_features ;; --finish) opt_finish=: set dummy --mode finish ${1+"$@"}; shift ;; --help) opt_help=: ;; --help-all) opt_help_all=: opt_help=': help-all' ;; --mode) test $# = 0 && func_missing_arg $opt && break optarg="$1" opt_mode="$optarg" case $optarg in # Valid mode arguments: clean|compile|execute|finish|install|link|relink|uninstall) ;; # Catch anything else as an error *) func_error "invalid argument for $opt" exit_cmd=exit break ;; esac shift ;; --no-silent|--no-quiet) opt_silent=false func_append preserve_args " $opt" ;; --no-warning|--no-warn) opt_warning=false func_append preserve_args " $opt" ;; --no-verbose) opt_verbose=false func_append preserve_args " $opt" ;; --silent|--quiet) opt_silent=: func_append preserve_args " $opt" opt_verbose=false ;; --verbose|-v) opt_verbose=: func_append preserve_args " $opt" opt_silent=false ;; --tag) test $# = 0 && func_missing_arg $opt && break optarg="$1" opt_tag="$optarg" func_append preserve_args " $opt $optarg" func_enable_tag "$optarg" shift ;; -\?|-h) func_usage ;; --help) func_help ;; --version) func_version ;; # Separate optargs to long options: --*=*) func_split_long_opt "$opt" set dummy "$func_split_long_opt_name" "$func_split_long_opt_arg" ${1+"$@"} shift ;; # Separate non-argument short options: -\?*|-h*|-n*|-v*) func_split_short_opt "$opt" set dummy "$func_split_short_opt_name" "-$func_split_short_opt_arg" ${1+"$@"} shift ;; --) break ;; -*) func_fatal_help "unrecognized option \`$opt'" ;; *) set dummy "$opt" ${1+"$@"}; shift; break ;; esac done # Validate options: # save first non-option argument if test "$#" -gt 0; then nonopt="$opt" shift fi # preserve --debug test "$opt_debug" = : || 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 if test "$build_libtool_libs" != yes && test "$build_old_libs" != yes; then func_fatal_configuration "not configured to build any kind of library" fi # Darwin sucks eval std_shrext=\"$shrext_cmds\" # Only execute mode is allowed to have -dlopen flags. if test -n "$opt_dlopen" && test "$opt_mode" != execute; 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." } # Bail if the options were screwed $exit_cmd $EXIT_FAILURE } ## ----------- ## ## Main. ## ## ----------- ## # 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 "$lalib_p" = yes } # 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 () { $opt_debug save_ifs=$IFS; IFS='~' for cmd in $1; do IFS=$save_ifs eval cmd=\"$cmd\" 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 () { $opt_debug 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 () { $opt_debug 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 "$build_libtool_libs" = yes; then write_lobj=\'${2}\' else write_lobj=none fi if test "$build_old_libs" = yes; 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 "$lt_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 () { $opt_debug # 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 () { $opt_debug 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 () { $opt_debug # awkward: cmd appends spaces to result func_convert_core_msys_to_w32_result=`( cmd //c echo "$1" ) 2>/dev/null | $SED -e 's/[ ]*$//' -e "$lt_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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug $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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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_mode_compile arg... func_mode_compile () { $opt_debug # 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 "$build_libtool_libs" != yes && \ func_fatal_configuration "can not 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 "$build_old_libs" = yes; 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 "$pic_mode" = no && test "$deplibs_check_method" != pass_all; 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 "$compiler_c_o" = no; 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 "$need_locks" = yes; 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 "$need_locks" = warn; 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 "$build_libtool_libs" = yes; then # Without this assignment, base_compile gets emptied. fbsd_hideous_sh_bug=$base_compile if test "$pic_mode" != no; 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 "$need_locks" = warn && 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 "$suppress_opt" = yes; then suppress_output=' >/dev/null 2>&1' fi fi # Only build a position-dependent object if we build old libraries. if test "$build_old_libs" = yes; then if test "$pic_mode" != yes; then # Don't build PIC code command="$base_compile $qsrcfile$pie_flag" else command="$base_compile $qsrcfile $pic_flag" fi if test "$compiler_c_o" = yes; 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 "$need_locks" = warn && 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 "$need_locks" != no; then removelist=$lockfile $RM "$lockfile" fi } exit $EXIT_SUCCESS } $opt_help || { test "$opt_mode" = compile && 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 () { $opt_debug # 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 test "X$opt_dry_run" = Xfalse; then 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" else # 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 fi } test "$opt_mode" = execute && func_mode_execute ${1+"$@"} # func_mode_finish arg... func_mode_finish () { $opt_debug 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_silent && 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 "$opt_mode" = finish && func_mode_finish ${1+"$@"} # func_mode_install arg... func_mode_install () { $opt_debug # There may be an optional sh(1) argument at the beginning of # install_prog (especially on Windows NT). if test "$nonopt" = "$SHELL" || test "$nonopt" = /bin/sh || # 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=no 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=yes ;; -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$prev" = x-m && 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=yes if test "$isdir" = yes; 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 "$build_old_libs" = yes; 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=yes 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'` ### testsuite: skip nested quoting test if test -n "$libdir" && test ! -f "$libfile"; then func_warning "\`$lib' has not been installed in \`$libdir'" finalize=no fi done relink_command= func_source "$wrapper" outputname= if test "$fast_install" = no && test -n "$relink_command"; then $opt_dry_run || { if test "$finalize" = yes; 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_silent || { 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 "$opt_mode" = install && 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 () { $opt_debug my_outputname="$1" my_originator="$2" my_pic_p="${3-no}" my_prefix=`$ECHO "$my_originator" | sed 's%[^a-zA-Z0-9]%_%g'` my_dlsyms= if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; 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$TIMESTAMP) $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 con'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 /* External symbol declarations for the compiler. */\ " if test "$dlself" = yes; 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 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[]; LT_DLSYM_CONST lt_dlsymlist lt_${my_prefix}_LTX_preloaded_symbols[] = {\ { \"$my_originator\", (void *) 0 }," 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" ;; *) if test "X$my_pic_p" != Xno; then pic_flag_for_symtable=" $pic_flag" fi ;; 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"' # 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_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 () { $opt_debug 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 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 } }'` 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 () { $opt_debug 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 () { $opt_debug 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 which possess that section. Heuristic: eliminate # all those which 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_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 () { $opt_debug 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 () { $opt_debug 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_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 () { $opt_debug 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 () { $opt_debug f_ex_an_ar_dir="$1"; shift f_ex_an_ar_oldlib="$1" if test "$lock_old_archive_extraction" = yes; 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 "$lock_old_archive_extraction" = yes; 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 () { $opt_debug 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` darwin_base_archive=`basename "$darwin_archive"` 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 in which 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$TIMESTAMP) $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/ which is used only on # windows platforms, and (c) all begin with the string "--lt-" # (application programs are unlikely to have options which 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$TIMESTAMP) $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 "$fast_install" = yes; 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 "$shlibpath_overrides_runpath" = yes && 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 /* 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 platforms) ... */ #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 # ifndef _INTPTR_T_DEFINED # define _INTPTR_T_DEFINED # define intptr_t int # endif #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 ((void *) 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]; int 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 = 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 (strcmp (str, pat) == 0) *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 int 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) { int orig_value_len = strlen (orig_value); int 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 #' */ int len = strlen (new_value); while (((len = strlen (new_value)) > 0) && IS_PATH_SEPARATOR (new_value[len-1])) { new_value[len-1] = '\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 () { $opt_debug case `eval $file_magic_cmd \"\$1\" 2>/dev/null | $SED -e 10q` in *import*) : ;; *) false ;; esac } # func_mode_link arg... func_mode_link () { $opt_debug 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 # which 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 which 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=no 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 "$build_libtool_libs" != yes && \ func_fatal_configuration "can not build a shared library" build_old_libs=no break ;; -all-static | -static | -static-libtool-libs) case $arg in -all-static) if test "$build_libtool_libs" = yes && 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) if test "$preload" = no; then # Add the symbol object into the linking commands. func_append compile_command " @SYMFILE@" func_append finalize_command " @SYMFILE@" preload=yes fi case $arg in *.la | *.lo) ;; # We handle these cases below. force) if test "$dlself" = no; then dlself=needless export_dynamic=yes fi prev= continue ;; self) if test "$prev" = dlprefiles; then dlself=yes elif test "$prev" = dlfiles && test "$dlopen_self" != yes; then dlself=yes else dlself=needless export_dynamic=yes fi prev= continue ;; *) if test "$prev" = dlfiles; 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 ;; 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 "$pic_object" = none && test "$non_pic_object" = none; 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 "$pic_object" != none; then # Prepend the subdirectory the object is found in. pic_object="$xdir$pic_object" if test "$prev" = dlfiles; then if test "$build_libtool_libs" = yes && test "$dlopen_support" = yes; 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 "$prev" = dlprefiles; 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 "$non_pic_object" != none; 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 "$pic_object" = none ; 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 "$prev" = rpath; 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$arg" = "X-export-symbols"; 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$arg" = "X-lc" || test "X$arg" = "X-lm"; 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$arg" = "X-lc" && continue ;; *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*) # Do not include libc due to us having libc/libc_r. test "X$arg" = "X-lc" && 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$arg" = "X-lc" && continue ;; *-*-sysv4.2uw2* | *-*-sysv5* | *-*-unixware* | *-*-OpenUNIX*) # Compiler inserts libc in the correct place for threads to work test "X$arg" = "X-lc" && continue ;; esac elif test "X$arg" = "X-lc_r"; then case $host in *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*) # Do not include libc_r directly, use -pthread flag. continue ;; esac fi func_append deplibs " $arg" 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*, -flto*, -fwhopr*, -fuse-linker-plugin GCC link-time optimization -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*|-flto*|-fwhopr*|-fuse-linker-plugin) 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 "$pic_object" = none && test "$non_pic_object" = none; 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 "$pic_object" != none; then # Prepend the subdirectory the object is found in. pic_object="$xdir$pic_object" if test "$prev" = dlfiles; then if test "$build_libtool_libs" = yes && test "$dlopen_support" = yes; 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 "$prev" = dlprefiles; 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 "$non_pic_object" != none; 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 "$pic_object" = none ; 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 "$prev" = dlfiles; then # This library was specified with -dlopen. func_append dlfiles " $func_resolve_sysroot_result" prev= elif test "$prev" = dlprefiles; 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 "$export_dynamic" = yes && 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 "$linkmode" = lib; 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=no 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 "$linkmode,$pass" = "lib,link"; 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 "$linkmode,$pass" = "lib,link" || test "$linkmode,$pass" = "prog,scan"; then libs="$deplibs" deplibs= fi if test "$linkmode" = prog; then case $pass in dlopen) libs="$dlfiles" ;; dlpreopen) libs="$dlprefiles" ;; link) libs="$deplibs %DEPLIBS%" test "X$link_all_deplibs" != Xno && libs="$libs $dependency_libs" ;; esac fi if test "$linkmode,$pass" = "lib,dlpreopen"; 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 "$pass" = dlopen; then # Collect dlpreopened libraries save_deplibs="$deplibs" deplibs= fi for deplib in $libs; do lib= found=no case $deplib in -mt|-mthreads|-kthread|-Kthread|-pthread|-pthreads|--thread-safe \ |-threads|-fopenmp|-openmp|-mp|-xopenmp|-omp|-qsmp=*) if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else func_append compiler_flags " $deplib" if test "$linkmode" = lib ; then case "$new_inherited_linker_flags " in *" $deplib "*) ;; * ) func_append new_inherited_linker_flags " $deplib" ;; esac fi fi continue ;; -l*) if test "$linkmode" != lib && test "$linkmode" != prog; then func_warning "\`-l' is ignored for archives/objects" continue fi func_stripname '-l' '' "$deplib" name=$func_stripname_result if test "$linkmode" = lib; 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 "$search_ext" = ".la"; then found=yes else found=no fi break 2 fi done done if test "$found" != yes; then # deplib doesn't seem to be a libtool library if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" test "$linkmode" = lib && newdependency_libs="$deplib $newdependency_libs" fi continue else # 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 "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; 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=no func_dirname "$lib" "" "." ladir="$func_dirname_result" lib=$ladir/$old_library if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" test "$linkmode" = lib && newdependency_libs="$deplib $newdependency_libs" fi continue fi fi ;; *) ;; esac fi fi ;; # -l *.ltframework) if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" if test "$linkmode" = lib ; 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 "$pass" = conv && 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 "$pass" = conv; then deplibs="$deplib $deplibs" continue fi if test "$pass" = scan; 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 "$pass" = link; 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 "$pass" = conv; 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=no 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=yes fi ;; pass_all) valid_a_lib=yes ;; esac if test "$valid_a_lib" != yes; then 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." else echo $ECHO "*** Warning: Linking the shared library $output against the" $ECHO "*** static library $deplib is not portable!" deplibs="$deplib $deplibs" fi ;; esac continue ;; prog) if test "$pass" != link; then deplibs="$deplib $deplibs" else compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" fi continue ;; esac # linkmode ;; # *.$libext *.lo | *.$objext) if test "$pass" = conv; then deplibs="$deplib $deplibs" elif test "$linkmode" = prog; then if test "$pass" = dlpreopen || test "$dlopen_support" != yes || test "$build_libtool_libs" = no; 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=yes continue ;; esac # case $deplib if test "$found" = yes || test -f "$lib"; then : else func_fatal_error "cannot find the library \`$lib' or unhandled argument \`$deplib'" fi # 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 "$linkmode,$pass" = "lib,link" || test "$linkmode,$pass" = "prog,scan" || { test "$linkmode" != prog && test "$linkmode" != lib; }; then test -n "$dlopen" && func_append dlfiles " $dlopen" test -n "$dlpreopen" && func_append dlprefiles " $dlpreopen" fi if test "$pass" = conv; 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" 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 elif test "$linkmode" != prog && test "$linkmode" != lib; then func_fatal_error "\`$lib' is not a convenience library" fi continue fi # $pass = conv # Get the name of the library we link against. linklib= if test -n "$old_library" && { test "$prefer_static_libs" = yes || test "$prefer_static_libs,$installed" = "built,no"; }; 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 "$pass" = dlopen; then if test -z "$libdir"; then func_fatal_error "cannot -dlopen a convenience library: \`$lib'" fi if test -z "$dlname" || test "$dlopen_support" != yes || test "$build_libtool_libs" = no; 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 "X$installed" = Xyes; 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 "X$hardcode_automatic" = Xyes && 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 "$pass" = dlpreopen; then if test -z "$libdir" && test "$linkmode" = prog; 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 "$linkmode" = lib; then deplibs="$dir/$old_library $deplibs" elif test "$linkmode,$pass" = "prog,link"; 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 "$linkmode" = prog && test "$pass" != link; then func_append newlib_search_path " $ladir" deplibs="$lib $deplibs" linkalldeplibs=no if test "$link_all_deplibs" != no || test -z "$library_names" || test "$build_libtool_libs" = no; then linkalldeplibs=yes 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 test "$linkalldeplibs" = yes; 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 "$linkmode,$pass" = "prog,link"; then if test -n "$library_names" && { { test "$prefer_static_libs" = no || test "$prefer_static_libs,$installed" = "built,yes"; } || 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 test "$alldeplibs" = yes && { test "$deplibs_check_method" = pass_all || { test "$build_libtool_libs" = yes && 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 "$use_static_libs" = built && test "$installed" = yes; then use_static_libs=no fi if test -n "$library_names" && { test "$use_static_libs" = no || 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 "$installed" = no; 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 "$shouldnotlink" = yes && test "$pass" = link; then echo if test "$linkmode" = prog; 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 "$linkmode" = lib && test "$hardcode_into_libs" = yes; 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 "$linkmode" = prog || test "$opt_mode" != relink; then add_shlibpath= add_dir= add= lib_linked=yes case $hardcode_action in immediate | unsupported) if test "$hardcode_direct" = no; 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 can not # 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 "$hardcode_minus_L" = no; then case $host in *-*-sunos*) add_shlibpath="$dir" ;; esac add_dir="-L$dir" add="-l$name" elif test "$hardcode_shlibpath_var" = no; then add_shlibpath="$dir" add="-l$name" else lib_linked=no fi ;; relink) if test "$hardcode_direct" = yes && test "$hardcode_direct_absolute" = no; then add="$dir/$linklib" elif test "$hardcode_minus_L" = yes; 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 "$hardcode_shlibpath_var" = yes; then add_shlibpath="$dir" add="-l$name" else lib_linked=no fi ;; *) lib_linked=no ;; esac if test "$lib_linked" != yes; 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 "$linkmode" = prog; 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 "$hardcode_direct" != yes && test "$hardcode_minus_L" != yes && test "$hardcode_shlibpath_var" = yes; then case :$finalize_shlibpath: in *":$libdir:"*) ;; *) func_append finalize_shlibpath "$libdir:" ;; esac fi fi fi if test "$linkmode" = prog || test "$opt_mode" = relink; then add_shlibpath= add_dir= add= # Finalize command for both is simple: just hardcode it. if test "$hardcode_direct" = yes && test "$hardcode_direct_absolute" = no; then add="$libdir/$linklib" elif test "$hardcode_minus_L" = yes; then add_dir="-L$libdir" add="-l$name" elif test "$hardcode_shlibpath_var" = yes; then case :$finalize_shlibpath: in *":$libdir:"*) ;; *) func_append finalize_shlibpath "$libdir:" ;; esac add="-l$name" elif test "$hardcode_automatic" = yes; 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 "$linkmode" = prog; 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 "$linkmode" = prog; 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 "$hardcode_direct" != unsupported; 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 "$build_libtool_libs" = yes; then # Not a shared library if test "$deplibs_check_method" != pass_all; 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 can not 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 "$module" = yes; 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 "$build_old_libs" = no; 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 "$linkmode" = lib; then if test -n "$dependency_libs" && { test "$hardcode_into_libs" != yes || test "$build_old_libs" = yes || test "$link_static" = yes; }; 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 "$link_static" = no && 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 "$link_all_deplibs" != no; 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 "$pass" = link; then if test "$linkmode" = "prog"; 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 "$pass" = dlpreopen; then # Link the dlpreopened libraries before other libraries for deplib in $save_deplibs; do deplibs="$deplib $deplibs" done fi if test "$pass" != dlopen; then if test "$pass" != conv; then # 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= fi if test "$linkmode,$pass" != "prog,link"; then vars="deplibs" else vars="compile_deplibs finalize_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 "$linkmode" = prog; then dlfiles="$newdlfiles" fi if test "$linkmode" = prog || test "$linkmode" = lib; then dlprefiles="$newdlprefiles" fi case $linkmode in oldlib) if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; 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 "$module" = no && \ func_fatal_help "libtool library \`$output' must begin with \`lib'" if test "$need_lib_prefix" != no; 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 "$deplibs_check_method" != pass_all; 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 "$dlself" != no && \ func_warning "\`-dlopen self' is ignored for libtool libraries" set dummy $rpath shift test "$#" -gt 1 && \ func_warning "ignoring multiple \`-rpath's for a libtool library" install_libdir="$1" oldlibs= if test -z "$rpath"; then if test "$build_libtool_libs" = yes; 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 # which 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 ;; *) func_fatal_configuration "$modename: unknown library version type \`$version_type'" ;; 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" ;; freebsd-aout) major=".$current" versuffix=".$current.$revision"; ;; freebsd-elf) major=".$current" versuffix=".$current" ;; irix | nonstopux) if test "X$lt_irix_increment" = "Xno"; 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 "$loop" -ne 0; 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 "$loop" -ne 0; 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 filesystems. 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 "$need_version" = no; then versuffix= else versuffix=".0.0" fi fi # Remove version info from name if versioning should be avoided if test "$avoid_version" = yes && test "$need_version" = no; then major= versuffix= verstring="" fi # Check to see if the archive will have undefined symbols. if test "$allow_undefined" = yes; then if test "$allow_undefined_flag" = unsupported; then func_warning "undefined symbols not allowed in $host shared libraries" build_libtool_libs=no build_old_libs=yes fi else # Don't allow undefined symbols. allow_undefined_flag="$no_undefined_flag" fi fi func_generate_dlsyms "$libname" "$libname" "yes" func_append libobjs " $symfileobj" test "X$libobjs" = "X " && libobjs= if test "$opt_mode" != relink; 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 "X$precious_files_regex" != "X"; 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 "$build_old_libs" = yes && test "$build_libtool_libs" != convenience ; 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 "$hardcode_into_libs" != yes || test "$build_old_libs" = yes; 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 "$build_libtool_libs" = yes; 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 "$build_libtool_need_lc" = "yes"; 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 "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; 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 "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; 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 "X$deplibs_check_method" = "Xnone"; 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 "$droppeddeps" = yes; then if test "$module" = yes; 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 "$build_old_libs" = no; 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 "$allow_undefined" = no; 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 "$build_old_libs" = no; 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 "$build_libtool_libs" = yes; then # Remove ${wl} instances when linking with ld. # FIXME: should test the right _cmds variable. case $archive_cmds in *\$LD\ *) wl= ;; esac if test "$hardcode_into_libs" = yes; then # Hardcode the library paths hardcode_libdirs= dep_rpath= rpath="$finalize_rpath" test "$opt_mode" != relink && 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 "$opt_mode" != relink && 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 if test "x`$SED 1q $export_symbols`" != xEXPORTS; then # 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 fi ;; esac # Prepare the list of exported symbols if test -z "$export_symbols"; then if test "$always_export_symbols" = yes || 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 "$try_normal_branch" = yes \ && { 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 "X$skipped_export" != "X:"; 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 "X$skipped_export" != "X:" && 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 "$compiler_needs_object" = yes && 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 "$thread_safe" = yes && 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 "$opt_mode" = relink; 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 "$module" = yes && 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 "X$skipped_export" != "X:" && 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 "X$skipped_export" != "X:" && test "$with_gnu_ld" = yes; 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 "X$skipped_export" != "X:" && test "X$file_list_spec" != X; then output=${output_objdir}/${output_la}.lnk func_verbose "creating linker input file list: $output" : > $output set x $save_libobjs shift firstobj= if test "$compiler_needs_object" = yes; 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 "X$objlist" = X || 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 "$k" -eq 1 ; 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 if ${skipped_export-false}; then 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 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_silent || { 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 "$opt_mode" = relink; 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 if ${skipped_export-false}; then 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 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 "$module" = yes && 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="$save_ifs" eval cmd=\"$cmd\" $opt_silent || { 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 "$opt_mode" = relink; 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 "$opt_mode" = relink; 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 "$module" = yes || test "$export_dynamic" = yes; then # On all known operating systems, these are identical. dlname="$soname" fi fi ;; obj) if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; 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 "$build_libtool_libs" != yes && 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" ### testsuite: skip nested quoting test 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 if test "$build_libtool_libs" != yes; then 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 fi if test -n "$pic_flag" || test "$pic_mode" != default; 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" test "$preload" = yes \ && test "$dlopen_support" = unknown \ && test "$dlopen_self" = unknown \ && test "$dlopen_self_static" = unknown && \ 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 "$tagname" = CXX ; 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 "$build_old_libs" = yes; 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@" "no" # template prelinking step if test -n "$prelink_cmds"; then func_execute_cmds "$prelink_cmds" 'exit $?' fi wrappers_required=yes case $host in *cegcc* | *mingw32ce*) # Disable wrappers for cegcc and mingw32ce hosts, we are cross compiling anyway. wrappers_required=no ;; *cygwin* | *mingw* ) if test "$build_libtool_libs" != yes; then wrappers_required=no fi ;; *) if test "$need_relink" = no || test "$build_libtool_libs" != yes; then wrappers_required=no fi ;; esac if test "$wrappers_required" = no; then # 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 fi 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 "$no_install" = yes; 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 if test "$hardcode_action" = relink; then # 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" else if test "$fast_install" != no; then link_command="$finalize_var$compile_command$finalize_rpath" if test "$fast_install" = yes; then relink_command=`$ECHO "$compile_var$compile_command$compile_rpath" | $SED 's%@OUTPUT@%\$progdir/\$file%g'` else # fast_install is set to needless relink_command= fi else link_command="$compile_var$compile_command$compile_rpath" relink_command="$finalize_var$finalize_command$finalize_rpath" fi fi # 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 if test "$build_libtool_libs" = convenience; then oldobjs="$libobjs_save $symfileobj" addlibs="$convenience" build_libtool_libs=no else if test "$build_libtool_libs" = module; then oldobjs="$libobjs_save" build_libtool_libs=no else oldobjs="$old_deplibs $non_pic_objects" if test "$preload" = yes && test -f "$symfileobj"; then func_append oldobjs " $symfileobj" fi fi addlibs="$old_convenience" fi 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 "$build_libtool_libs" = yes; 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 "X$oldobjs" = "X" ; 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 "$build_old_libs" = yes && 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 "$hardcode_automatic" = yes ; then relink_command= fi # Only create the output if not a dry run. $opt_dry_run || { for installed in no yes; do if test "$installed" = yes; 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 "x$bindir" != x ; 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$TIMESTAMP) $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 can not 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 "$installed" = no && test "$need_relink" = yes; 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 } { test "$opt_mode" = link || test "$opt_mode" = relink; } && func_mode_link ${1+"$@"} # func_mode_uninstall arg... func_mode_uninstall () { $opt_debug RM="$nonopt" files= rmforce= 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=yes ;; -*) 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 "X$dir" = X.; then odir="$objdir" else odir="$dir/$objdir" fi func_basename "$file" name="$func_basename_result" test "$opt_mode" = uninstall && odir="$dir" # Remember odir for removal later, being careful to avoid duplicates if test "$opt_mode" = clean; 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 test "$rmforce" = yes; 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" 'test "$rmforce" = yes || exit_status=1' fi if test -n "$old_library"; then # Do each command in the old_postuninstall commands. func_execute_cmds "$old_postuninstall_cmds" 'test "$rmforce" = yes || 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 "$pic_object" != none; 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 "$non_pic_object" != none; then func_append rmfiles " $dir/$non_pic_object" fi fi ;; *) if test "$opt_mode" = clean ; 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 "$fast_install" = yes && 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 } { test "$opt_mode" = uninstall || test "$opt_mode" = clean; } && func_mode_uninstall ${1+"$@"} 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 # in which 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: # vi:sw=2 cloog-0.18.4/osl/autoconf/test-driver0000755000175000017500000001027712413256724014456 00000000000000#! /bin/sh # test-driver - basic testsuite driver script. scriptversion=2013-07-13.22; # UTC # Copyright (C) 2011-2013 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. # This file is maintained in Automake, please report # bugs to or send patches to # . # Make unconditional expansion of undefined variables an error. This # helps a lot in preventing typo-related bugs. set -u usage_error () { echo "$0: $*" >&2 print_usage >&2 exit 2 } print_usage () { cat <$log_file 2>&1 estatus=$? if test $enable_hard_errors = no && test $estatus -eq 99; then estatus=1 fi case $estatus:$expect_failure in 0:yes) col=$red res=XPASS recheck=yes gcopy=yes;; 0:*) col=$grn res=PASS recheck=no gcopy=no;; 77:*) col=$blu res=SKIP recheck=no gcopy=yes;; 99:*) col=$mgn res=ERROR recheck=yes gcopy=yes;; *:yes) col=$lgn res=XFAIL recheck=no gcopy=yes;; *:*) col=$red res=FAIL recheck=yes gcopy=yes;; esac # Report outcome to console. echo "${col}${res}${std}: $test_name" # Register the test result, and other relevant metadata. echo ":test-result: $res" > $trs_file echo ":global-test-result: $res" >> $trs_file echo ":recheck: $recheck" >> $trs_file echo ":copy-in-global-log: $gcopy" >> $trs_file # 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.4/osl/autoconf/install-sh0000755000175000017500000003325512413256724014265 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.4/osl/autoconf/missing0000755000175000017500000001533012413256724013652 00000000000000#! /bin/sh # Common wrapper for a few potentially missing GNU programs. scriptversion=2013-10-28.13; # UTC # Copyright (C) 1996-2013 Free Software Foundation, Inc. # Originally written 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 case $1 in --is-lightweight) # Used by our autoconf macros to check whether the available missing # script is modern enough. exit 0 ;; --run) # Back-compat with the calling convention used by older automake. shift ;; -h|--h|--he|--hel|--help) echo "\ $0 [OPTION]... PROGRAM [ARGUMENT]... Run 'PROGRAM [ARGUMENT]...', returning a proper advice when this fails due to PROGRAM being missing or too old. Options: -h, --help display this help and exit -v, --version output version information and exit Supported PROGRAM values: aclocal autoconf autoheader autom4te automake makeinfo bison yacc flex lex help2man 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 # Run the given program, remember its exit status. "$@"; st=$? # If it succeeded, we are done. test $st -eq 0 && exit 0 # Also exit now if we it failed (or wasn't found), and '--version' was # passed; such an option is passed most likely to detect whether the # program is present and works. case $2 in --version|--help) exit $st;; esac # Exit code 63 means version mismatch. This often happens when the user # tries to use an ancient version of a tool on a file that requires a # minimum version. if test $st -eq 63; then msg="probably too old" elif test $st -eq 127; then # Program was missing. msg="missing on your system" else # Program was found and executed, but failed. Give up. exit $st fi perl_URL=http://www.perl.org/ flex_URL=http://flex.sourceforge.net/ gnu_software_URL=http://www.gnu.org/software program_details () { case $1 in aclocal|automake) echo "The '$1' program is part of the GNU Automake package:" echo "<$gnu_software_URL/automake>" echo "It also requires GNU Autoconf, GNU m4 and Perl in order to run:" echo "<$gnu_software_URL/autoconf>" echo "<$gnu_software_URL/m4/>" echo "<$perl_URL>" ;; autoconf|autom4te|autoheader) echo "The '$1' program is part of the GNU Autoconf package:" echo "<$gnu_software_URL/autoconf/>" echo "It also requires GNU m4 and Perl in order to run:" echo "<$gnu_software_URL/m4/>" echo "<$perl_URL>" ;; esac } give_advice () { # Normalize program name to check for. normalized_program=`echo "$1" | sed ' s/^gnu-//; t s/^gnu//; t s/^g//; t'` printf '%s\n' "'$1' is $msg." configure_deps="'configure.ac' or m4 files included by 'configure.ac'" case $normalized_program in autoconf*) echo "You should only need it if you modified 'configure.ac'," echo "or m4 files included by it." program_details 'autoconf' ;; autoheader*) echo "You should only need it if you modified 'acconfig.h' or" echo "$configure_deps." program_details 'autoheader' ;; automake*) echo "You should only need it if you modified 'Makefile.am' or" echo "$configure_deps." program_details 'automake' ;; aclocal*) echo "You should only need it if you modified 'acinclude.m4' or" echo "$configure_deps." program_details 'aclocal' ;; autom4te*) echo "You might have modified some maintainer files that require" echo "the 'autom4te' program to be rebuilt." program_details 'autom4te' ;; bison*|yacc*) echo "You should only need it if you modified a '.y' file." echo "You may want to install the GNU Bison package:" echo "<$gnu_software_URL/bison/>" ;; lex*|flex*) echo "You should only need it if you modified a '.l' file." echo "You may want to install the Fast Lexical Analyzer package:" echo "<$flex_URL>" ;; help2man*) echo "You should only need it if you modified a dependency" \ "of a man page." echo "You may want to install the GNU Help2man package:" echo "<$gnu_software_URL/help2man/>" ;; makeinfo*) echo "You should only need it if you modified a '.texi' file, or" echo "any other file indirectly affecting the aspect of the manual." echo "You might want to install the Texinfo package:" echo "<$gnu_software_URL/texinfo/>" echo "The spurious makeinfo call might also be the consequence of" echo "using a buggy 'make' (AIX, DU, IRIX), in which case you might" echo "want to install GNU make:" echo "<$gnu_software_URL/make/>" ;; *) echo "You might have modified some files without having the proper" echo "tools for further handling them. Check the 'README' file, it" echo "often tells you about the needed prerequisites for installing" echo "this package. You may also peek at any GNU archive site, in" echo "case some other package contains this missing '$1' program." ;; esac } give_advice "$1" | sed -e '1s/^/WARNING: /' \ -e '2,$s/^/ /' >&2 # Propagate the correct exit status (expected to be 127 for a program # not found, 63 for a program that failed due to version mismatch). exit $st # 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.4/osl/autoconf/depcomp0000755000175000017500000005601612413256724013636 00000000000000#! /bin/sh # depcomp - compile a program generating dependencies as side-effects scriptversion=2013-05-30.07; # UTC # Copyright (C) 1999-2013 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 # Get the directory component of the given path, and save it in the # global variables '$dir'. Note that this directory component will # be either empty or ending with a '/' character. This is deliberate. set_dir_from () { case $1 in */*) dir=`echo "$1" | sed -e 's|/[^/]*$|/|'`;; *) dir=;; esac } # Get the suffix-stripped basename of the given path, and save it the # global variable '$base'. set_base_from () { base=`echo "$1" | sed -e 's|^.*/||' -e 's/\.[^.]*$//'` } # If no dependency file was actually created by the compiler invocation, # we still have to create a dummy depfile, to avoid errors with the # Makefile "include basename.Plo" scheme. make_dummy_depfile () { echo "#dummy" > "$depfile" } # Factor out some common post-processing of the generated depfile. # Requires the auxiliary global variable '$tmpdepfile' to be set. aix_post_process_depfile () { # If the compiler actually managed to produce a dependency file, # post-process it. if test -f "$tmpdepfile"; then # Each line is of the form 'foo.o: dependency.h'. # Do two passes, one to just change these to # $object: dependency.h # and one to simply output # dependency.h: # which is needed to avoid the deleted-header problem. { sed -e "s,^.*\.[$lower]*:,$object:," < "$tmpdepfile" sed -e "s,^.*\.[$lower]*:[$tab ]*,," -e 's,$,:,' < "$tmpdepfile" } > "$depfile" rm -f "$tmpdepfile" else make_dummy_depfile fi } # A tabulation character. tab=' ' # A newline character. nl=' ' # Character ranges might be problematic outside the C locale. # These definitions help. upper=ABCDEFGHIJKLMNOPQRSTUVWXYZ lower=abcdefghijklmnopqrstuvwxyz digits=0123456789 alpha=${upper}${lower} 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" # Avoid interferences from the environment. gccflag= dashmflag= # 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 if test "$depmode" = xlc; then # IBM C/C++ Compilers xlc/xlC can output gcc-like dependency information. gccflag=-qmakedep=gcc,-MF depmode=gcc 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 -ne 0; then rm -f "$tmpdepfile" exit $stat fi mv "$tmpdepfile" "$depfile" ;; gcc) ## Note that this doesn't just cater to obsosete pre-3.x GCC compilers. ## but also to in-use compilers like IMB xlc/xlC and the HP C compiler. ## (see the conditional assignment to $gccflag above). ## 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). Also, it might not be ## supported by the other compilers which use the 'gcc' depmode. ## - 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 -ne 0; then rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" echo "$object : \\" > "$depfile" # 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. ## 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. tr ' ' "$nl" < "$tmpdepfile" \ | 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 -ne 0; then 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 ' ' "$nl" < "$tmpdepfile" \ | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' \ | tr "$nl" ' ' >> "$depfile" echo >> "$depfile" # The second pass generates a dummy entry for each header file. tr ' ' "$nl" < "$tmpdepfile" \ | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' -e 's/$/:/' \ >> "$depfile" else make_dummy_depfile fi rm -f "$tmpdepfile" ;; xlc) # 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 ;; 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. set_dir_from "$object" set_base_from "$object" 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 -ne 0; then rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" do test -f "$tmpdepfile" && break done aix_post_process_depfile ;; tcc) # tcc (Tiny C Compiler) understand '-MD -MF file' since version 0.9.26 # FIXME: That version still under development at the moment of writing. # Make that this statement remains true also for stable, released # versions. # It will wrap lines (doesn't matter whether long or short) with a # trailing '\', as in: # # foo.o : \ # foo.c \ # foo.h \ # # It will put a trailing '\' even on the last line, and will use leading # spaces rather than leading tabs (at least since its commit 0394caf7 # "Emit spaces for -MD"). "$@" -MD -MF "$tmpdepfile" stat=$? if test $stat -ne 0; then rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" # Each non-empty line is of the form 'foo.o : \' or ' dep.h \'. # We have to change lines of the first kind to '$object: \'. sed -e "s|.*:|$object :|" < "$tmpdepfile" > "$depfile" # And for each line of the second kind, we have to emit a 'dep.h:' # dummy dependency, to avoid the deleted-header problem. sed -n -e 's|^ *\(.*\) *\\$|\1:|p' < "$tmpdepfile" >> "$depfile" rm -f "$tmpdepfile" ;; ## The order of this option in the case statement is important, since the ## shell code in configure will try each of these formats in the order ## listed in this file. A plain '-MD' option would be understood by many ## compilers, so we must ensure this comes after the gcc and icc options. pgcc) # Portland's C compiler understands '-MD'. # Will always output deps to 'file.d' where file is the root name of the # source file under compilation, even if file resides in a subdirectory. # The object file name does not affect the name of the '.d' file. # pgcc 10.2 will output # foo.o: sub/foo.c sub/foo.h # and will wrap long lines using '\' : # foo.o: sub/foo.c ... \ # sub/foo.h ... \ # ... set_dir_from "$object" # Use the source, not the object, to determine the base name, since # that's sadly what pgcc will do too. set_base_from "$source" tmpdepfile=$base.d # For projects that build the same source file twice into different object # files, the pgcc approach of using the *source* file root name can cause # problems in parallel builds. Use a locking strategy to avoid stomping on # the same $tmpdepfile. lockdir=$base.d-lock trap " echo '$0: caught signal, cleaning up...' >&2 rmdir '$lockdir' exit 1 " 1 2 13 15 numtries=100 i=$numtries while test $i -gt 0; do # mkdir is a portable test-and-set. if mkdir "$lockdir" 2>/dev/null; then # This process acquired the lock. "$@" -MD stat=$? # Release the lock. rmdir "$lockdir" break else # If the lock is being held by a different process, wait # until the winning process is done or we timeout. while test -d "$lockdir" && test $i -gt 0; do sleep 1 i=`expr $i - 1` done fi i=`expr $i - 1` done trap - 1 2 13 15 if test $i -le 0; then echo "$0: failed to acquire lock after $numtries attempts" >&2 echo "$0: check lockdir '$lockdir'" >&2 exit 1 fi if test $stat -ne 0; then 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. set_dir_from "$object" set_base_from "$object" 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 -ne 0; then 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,^.*\.[$lower]*:,$object:," "$tmpdepfile" > "$depfile" # Add 'dependent.h:' lines. sed -ne '2,${ s/^ *// s/ \\*$// s/$/:/ p }' "$tmpdepfile" >> "$depfile" else make_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. set_dir_from "$object" set_base_from "$object" if test "$libtool" = yes; then # Libtool 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$base.o.d # libtool 1.5 tmpdepfile2=$dir.libs/$base.o.d # Likewise. tmpdepfile3=$dir.libs/$base.d # Compaq CCC V6.2-504 "$@" -Wc,-MD else tmpdepfile1=$dir$base.d tmpdepfile2=$dir$base.d tmpdepfile3=$dir$base.d "$@" -MD fi stat=$? if test $stat -ne 0; then rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" do test -f "$tmpdepfile" && break done # Same post-processing that is required for AIX mode. aix_post_process_depfile ;; 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 -ne 0; then 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/\(.*\)/'"$tab"'\1 \\/p s/.\(.*\) \\/\1:/ H $ { s/.*/'"$tab"'/ G p }' >> "$depfile" echo >> "$depfile" # make sure the fragment doesn't end with a backslash 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|^[$tab ]*[^:$tab ][^:][^:]*:[$tab ]*|$object: |" > "$tmpdepfile" rm -f "$depfile" cat < "$tmpdepfile" > "$depfile" # Some versions of the HPUX 10.20 sed can't process this sed invocation # correctly. Breaking it into two sed invocations is a workaround. tr ' ' "$nl" < "$tmpdepfile" \ | 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" # Some versions of the HPUX 10.20 sed can't process the last invocation # correctly. Breaking it into two sed invocations is a workaround. sed '1,2d' "$tmpdepfile" \ | tr ' ' "$nl" \ | 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::'"$tab"'\1 \\:p' >> "$depfile" echo "$tab" >> "$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.4/osl/autoconf/config.guess0000755000175000017500000013036112413256724014575 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.4/osl/autoconf/config.sub0000755000175000017500000010535412413256724014244 00000000000000#! /bin/sh # Configuration validation subroutine script. # Copyright 1992-2013 Free Software Foundation, Inc. timestamp='2013-08-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"). # 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 \ | 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 | 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-* \ | 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.4/osl/ChangeLog0000644000175000017500000000006612413270135012177 00000000000000See Git's log at https://github.com/periscop/openscop cloog-0.18.4/osl/configure.ac0000644000175000017500000002071312413270135012714 00000000000000dnl dnl /*+------------------------------------------------------------------** dnl ** OpenScop Library ** dnl **------------------------------------------------------------------** dnl ** configure.in ** dnl **------------------------------------------------------------------** dnl ** First version: 30/04/2008 ** dnl **------------------------------------------------------------------** dnl dnl dnl ************************************************************************** dnl * OpenScop: Structures and formats for polyhedral tools to talk together * dnl ************************************************************************** dnl * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * dnl * / / / // // // // / / / // // / / // / /|,_, * dnl * / / / // // // // / / / // // / / // / / / /\ * dnl * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * dnl * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * dnl * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * dnl * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * dnl * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * dnl * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * dnl * | I | | | | e | | | | | | | | | | | | | \ \ \ * dnl * | T | | | | | | | | | | | | | | | | | \ \ \ * dnl * | E | | | | | | | | | | | | | | | | | \ \ \ * dnl * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * dnl * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * dnl * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * dnl * * dnl * Copyright (C) 2008 University Paris-Sud 11 and INRIA * dnl * * dnl * (3-clause BSD license) * dnl * Redistribution and use in source and binary forms, with or without * dnl * modification, are permitted provided that the following conditions * dnl * are met: * dnl * * dnl * 1. Redistributions of source code must retain the above copyright * dnl * notice, this list of conditions and the following disclaimer. * dnl * 2. Redistributions in binary form must reproduce the above copyright * dnl * notice, this list of conditions and the following disclaimer in the * dnl * documentation and/or other materials provided with the distribution.* dnl * 3. The name of the author may not be used to endorse or promote * dnl * products derived from this software without specific prior written * dnl * permission. * dnl * * dnl * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * dnl * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED * dnl * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE * dnl * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, * dnl * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES * dnl * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR * dnl * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * dnl * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, * dnl * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING * dnl * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE * dnl * POSSIBILITY OF SUCH DAMAGE. * dnl * * dnl * OpenScop Library, a library to manipulate OpenScop formats and data * dnl * structures. Written by: * dnl * Cedric Bastoul and * dnl * Louis-Noel Pouchet * dnl * * dnl **************************************************************************/ dnl dnl Input file for autoconf to build a configuration shellscript. m4_define([version_major], [0]) m4_define([version_minor], [9]) m4_define([version_revision], [0]) AC_PREREQ(2.53) dnl Fill here the @bug email adress. AC_INIT([osl], [version_major.version_minor.version_revision], [cedric.bastoul@u-psud.fr,pouchet@cse.ohio-state.edu]) dnl A common file, which serve as a test. AC_CONFIG_SRCDIR([include/osl/macros.h]) dnl Put as most as possible configuration files to an auxialiry dnl directory. AC_CONFIG_AUX_DIR([autoconf]) AC_CONFIG_MACRO_DIR([m4]) dnl Initialize automake. 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) AC_PROG_INSTALL AC_PROG_LIBTOOL AC_CHECK_PROGS(DOXYGEN, doxygen, doxygen, []) AC_CHECK_PROGS(TEXI2PDF, texi2pdf, texi2pdf, []) AM_CONDITIONAL(GENERATE_DOC, test -n "$TEXI2PDF" -a -n "$DOXYGEN") 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 AC_CHECK_HEADERS([errno.h stddef.h stdlib.h string.h strings.h unistd.h]) dnl Checks for library functions. AC_CHECK_FUNCS(strtol) dnl /************************************************************************** dnl * Option setting * dnl **************************************************************************/ dnl /************************************************************************** dnl * Where is GMP? * dnl **************************************************************************/ gmp_flag="OSL_GMP_IS_HERE" AX_SUBMODULE(gmp,no|system|build,system) case "$with_gmp" in build) CPPFLAGS="-D$gmp_flag -I$gmp_srcdir -I$with_gmp_builddir $CPPFLAGS" LIBS="$with_gmp_builddir/libgmp.la $LIBS" LDFLAGS="-L$with_gmp_builddir $LDFLAGS" ;; system) CPPFLAGS="-D$gmp_flag $CPPFLAGS" LIBS="-lgmp $LIBS" if test "x$with_gmp_prefix" != "x"; then CPPFLAGS="-I$with_gmp_prefix/include $CPPFLAGS" LDFLAGS="-L$with_gmp_prefix/lib $LDFLAGS" fi dnl AC_CHECK_LIB doesn't use LDFLAGS --> not suitable for the build case. AC_CHECK_LIB(gmp, __gmpz_init, [], [AC_MSG_ERROR("Can't find gmp library.")]) ;; esac case "$with_gmp" in build|system) AC_CHECK_HEADER(gmp.h, [], [AC_MSG_ERROR("Can't find gmp headers.")]) ;; esac dnl /************************************************************************** dnl * Substitutions * dnl **************************************************************************/ dnl Substitutions to do. AC_SUBST(ac_aux_dir) AC_SUBST(abs_top_srcdir) AC_SUBST(VERSION_MAJOR) AC_SUBST(VERSION_MINOR) AC_SUBST(VERSION_REVISION) dnl Configure Makefiles. AC_CONFIG_FILES([ Makefile doc/Makefile doc/Doxyfile include/osl/scop.h tests/Makefile ], [test -z "$CONFIG_HEADERS" || echo timestamp > source/stamp-h.in]) AC_OUTPUT echo " /*-----------------------------------------------*" echo " * OpenScop Library configuration is OK *" echo " *-----------------------------------------------*/" echo "It appears that your system is OK to start the OpenScop Library compilation." echo "You need now to type \"make\". Then type \"make install\" to install it on your" echo "system (log as root if necessary)." cloog-0.18.4/osl/AUTHORS0000644000175000017500000000044712413270135011500 00000000000000* * * * * * * * * * * * * * * OpenScop Library 0.9.0 * * * * * * * * * * * * * * * Version 0.9.0 Current maintainer: * Cedric Bastoul Authors of the OpenScop Library: * Cedric Bastoul * Louis-Noel Pouchet cloog-0.18.4/osl/Makefile.am0000644000175000017500000001640412413270135012464 00000000000000# # /*+------------------------------------------------------------------** # ** OpenScop Library ** # **------------------------------------------------------------------** # ** makefile.am ** # **------------------------------------------------------------------** # ** First version: 30/04/2008 ** # **------------------------------------------------------------------** # # # *************************************************************************** # * OpenScop: Structures and formats for polyhedral tools to talk together * # *************************************************************************** # * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * # * / / / // // // // / / / // // / / // / /|,_, * # * / / / // // // // / / / // // / / // / / / /\ * # * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * # * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * # * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * # * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * # * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * # * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * # * | I | | | | e | | | | | | | | | | | | | \ \ \ * # * | T | | | | | | | | | | | | | | | | | \ \ \ * # * | E | | | | | | | | | | | | | | | | | \ \ \ * # * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * # * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * # * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * # * * # * Copyright (C) 2008 University Paris-Sud 11 and INRIA * # * * # * (3-clause BSD license) * # * Redistribution and use in source and binary forms, with or without * # * modification, are permitted provided that the following conditions * # * are met: * # * * # * 1. Redistributions of source code must retain the above copyright * # * notice, this list of conditions and the following disclaimer. * # * 2. Redistributions in binary form must reproduce the above copyright * # * notice, this list of conditions and the following disclaimer in the * # * documentation and/or other materials provided with the distribution. * # * 3. The name of the author may not be used to endorse or promote * # * products derived from this software without specific prior written * # * permission. * # * * # * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * # * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED * # * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE * # * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, * # * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES * # * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR * # * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * # * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, * # * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING * # * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE * # * POSSIBILITY OF SUCH DAMAGE. * # * * # * OpenScop Library, a library to manipulate OpenScop formats and data * # * structures. Written by: * # * Cedric Bastoul and * # * Louis-Noel Pouchet * # * * # ***************************************************************************/ # # Makefile.am (or makefile if generated) of the OpenScop Library. # Makefile.am is not a makefile, you must run the 'autogen.sh' THEN the # configure shellscript to generate the Makefile thanks to this file. ############################################################################# AUTOMAKE_OPTIONS = subdir-objects SUBDIRS = . doc tests ACLOCAL_AMFLAGS = -I m4 ############################################################################# lib_LTLIBRARIES = libosl.la ############################################################################# pkginclude_HEADERS = \ include/osl/osl.h \ include/osl/statement.h \ include/osl/interface.h \ include/osl/generic.h \ include/osl/vector.h \ include/osl/relation.h \ include/osl/relation_list.h \ include/osl/macros.h \ include/osl/int.h \ include/osl/names.h \ include/osl/strings.h \ include/osl/body.h \ include/osl/util.h \ include/osl/scop.h pkgextensionsincludedir = $(pkgincludedir)/extensions pkgextensionsinclude_HEADERS = \ include/osl/extensions/textual.h \ include/osl/extensions/comment.h \ include/osl/extensions/null.h \ include/osl/extensions/clay.h \ include/osl/extensions/dependence.h \ include/osl/extensions/scatnames.h \ include/osl/extensions/arrays.h \ include/osl/extensions/coordinates.h \ include/osl/extensions/irregular.h \ include/osl/extensions/symbols.h \ include/osl/extensions/loop.h \ include/osl/extensions/extbody.h \ include/osl/extensions/pluto_unroll.h AM_CPPFLAGS = -I. -I$(top_builddir)/include -I$(top_srcdir)/include AM_CFLAGS = $(CFLAGS_WARN) ############################################################################# libosl_la_CPPFLAGS = -I. -I$(top_builddir)/include -I$(top_srcdir)/include -g libosl_la_SOURCES = \ source/scop.c \ source/statement.c \ source/extensions/textual.c \ source/extensions/comment.c \ source/extensions/null.c \ source/extensions/clay.c \ source/extensions/dependence.c \ source/extensions/scatnames.c \ source/extensions/arrays.c \ source/extensions/coordinates.c \ source/extensions/irregular.c \ source/extensions/symbols.c \ source/extensions/extbody.c \ source/extensions/loop.c \ source/extensions/pluto_unroll.c \ source/interface.c \ source/generic.c \ source/relation.c \ source/relation_list.c \ source/vector.c \ source/names.c \ source/strings.c \ source/body.c \ source/int.c \ source/util.c MAINTAINERCLEANFILES = \ Makefile.in \ aclocal.m4 \ configure \ source/stamp-h.in \ $(AUX_DIST) ############################################################################# ctags: ctags -R --c++-kinds=+p --fields=+iaS --extra=+q -f$(HOME)/.ctags . ############################################################################# cloog-0.18.4/osl/m4/0000755000175000017500000000000012555417256011041 500000000000000cloog-0.18.4/osl/m4/ax_cc_maxopt.m40000644000175000017500000001604612413256474013673 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.4/osl/m4/ax_gcc_archflag.m40000644000175000017500000002141412413256474014274 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.4/osl/m4/ax_cflags_warn_all.m40000644000175000017500000001420412413256474015026 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.4/osl/m4/lt~obsolete.m40000644000175000017500000001375612413256722013601 00000000000000# lt~obsolete.m4 -- aclocal satisfying obsolete definitions. -*-Autoconf-*- # # Copyright (C) 2004, 2005, 2007, 2009 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.4/osl/m4/ax_check_compiler_flags.m40000644000175000017500000000632312413256474016036 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.4/osl/m4/ltsugar.m40000644000175000017500000001042412413256722012675 00000000000000# ltsugar.m4 -- libtool m4 base layer. -*-Autoconf-*- # # Copyright (C) 2004, 2005, 2007, 2008 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.4/osl/m4/ltversion.m40000644000175000017500000000126212413256722013241 00000000000000# ltversion.m4 -- version numbers -*- Autoconf -*- # # Copyright (C) 2004 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 3337 ltversion.m4 # This file is part of GNU Libtool m4_define([LT_PACKAGE_VERSION], [2.4.2]) m4_define([LT_PACKAGE_REVISION], [1.3337]) AC_DEFUN([LTVERSION_VERSION], [macro_version='2.4.2' macro_revision='1.3337' _LT_DECL(, macro_version, 0, [Which release of libtool.m4 was used?]) _LT_DECL(, macro_revision, 0) ]) cloog-0.18.4/osl/m4/libtool.m40000644000175000017500000106011112413256721012656 00000000000000# libtool.m4 - Configure libtool for the host system. -*-Autoconf-*- # # 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 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 57 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 which 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 "X${COLLECT_NAMES+set}" != Xset; 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\\"\\\`\\\\\\"" ;; *) 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\\"\\\`\\\\\\"" ;; *) 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 $lt_write_fail = 0 && 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 "$silent" = yes && 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 which 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$TIMESTAMP) $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 "X${COLLECT_NAMES+set}" != Xset; 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) _LT_PROG_REPLACE_SHELLFNS 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' TIMESTAMP='$TIMESTAMP' 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 $_lt_result -eq 0; 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 $_lt_result -eq 0 && $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 "$lt_cv_apple_cc_single_mod" = "yes"; then _lt_dar_single_mod='$single_module' fi if test "$lt_cv_ld_exported_symbols_list" = "yes"; 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 "$lt_cv_ld_force_load" = "no"; 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 "$lt_cv_ld_force_load" = "yes"; 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*) _lt_dar_can_shared=yes ;; *) _lt_dar_can_shared=$GCC ;; esac if test "$_lt_dar_can_shared" = "yes"; 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 "$lt_cv_apple_cc_single_mod" != "yes"; 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 "${lt_cv_aix_libpath+set}" = 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 which will find a shell with a builtin # printf (which 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], [ --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 "$GCC" = yes; 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 in which 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 "x$enable_libtool_lock" != xno && 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 which ABI we are using. 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 which ABI we are using. echo '[#]line '$LINENO' "configure"' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then if test "$lt_cv_prog_gnu_ld" = yes; 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* ;; x86_64-*kfreebsd*-gnu|x86_64-*linux*|powerpc*-*linux*| \ s390*-*linux*|s390*-*tpf*|sparc*-*linux*) # Find out which ABI we are using. 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-*) LD="${LD-ld} -m elf32lppclinux" ;; powerpc64-*) 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-*) LD="${LD-ld} -m elf64lppc" ;; powerpc-*) 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 x"$lt_cv_cc_needs_belf" != x"yes"; then # this is probably gcc 2.8.0, egcs 1.0 or newer; no need for -belf CFLAGS="$SAVE_CFLAGS" fi ;; *-*solaris*) # Find out which ABI we are using. 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*) 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 "$ac_status" -eq 0; then # Ensure the archiver fails upon bogus file names. rm -f conftest.$ac_objext libconftest.a AC_TRY_EVAL([lt_ar_try]) if test "$ac_status" -ne 0; then lt_cv_ar_at_file=@ fi fi rm -f conftest.* libconftest.a ]) ]) if test "x$lt_cv_ar_at_file" = xno; 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 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" # 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 x"[$]$2" = xyes; 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 x"[$]$2" = xyes; 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; ;; netbsd* | freebsd* | openbsd* | darwin* | dragonfly*) # 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 $i != 17 # 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 "$cross_compiling" = yes; 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 "x$enable_dlopen" != xyes; 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 ]) ;; *) 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 "x$lt_cv_dlopen" != xno; then enable_dlopen=yes else enable_dlopen=no fi case $lt_cv_dlopen in dlopen) save_CPPFLAGS="$CPPFLAGS" test "x$ac_cv_header_dlfcn_h" = xyes && 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 "x$lt_cv_dlopen_self" = xyes; 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 "$_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)" = no && test "$need_locks" != no; 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 "$hard_links" = no; 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 in which 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 "X$_LT_TAGVAR(hardcode_automatic, $1)" = "Xyes" ; then # We can hardcode non-existent directories. if test "$_LT_TAGVAR(hardcode_direct, $1)" != no && # 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 "$_LT_TAGVAR(hardcode_shlibpath_var, $1)" != no && test "$_LT_TAGVAR(hardcode_minus_L, $1)" != no; 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 "$_LT_TAGVAR(hardcode_action, $1)" = relink || test "$_LT_TAGVAR(inherit_rpath, $1)" = yes; then # Fast installation is not supported enable_fast_install=no elif test "$shlibpath_overrides_runpath" = yes || test "$enable_shared" = no; 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 "$GCC" = yes; 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` 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" else 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 "$host_cpu" = ia64; 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 can not hardcode correct # soname into executable. Probably we can add versioning support to # collect2, so additional links can be useful in future. if test "$aix_use_runtimelinking" = yes; 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%'\''`; test $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=yes 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 "X$HPUX_IA64_MODE" = X32; 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 "$lt_cv_prog_gnu_ld" = yes; 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 ;; # 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' ;; netbsdelf*-gnu) version_type=linux 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='NetBSD ld.elf_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*) version_type=sunos sys_lib_dlsearch_path_spec="/usr/lib" need_lib_prefix=no # Some older versions of OpenBSD (3.3 at least) *do* need versioned libs. case $host_os in openbsd3.3 | openbsd3.3.*) need_version=yes ;; *) need_version=no ;; esac 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 if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then case $host_os in openbsd2.[[89]] | openbsd2.[[89]].*) shlibpath_overrides_runpath=no ;; *) shlibpath_overrides_runpath=yes ;; esac else shlibpath_overrides_runpath=yes fi ;; 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 "$with_gnu_ld" = yes; 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 "$with_gnu_ld" = yes; 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 "$dynamic_linker" = no && can_build_shared=no variables_saved_for_relink="PATH $shlibpath_var $runpath_var" if test "$GCC" = yes; then variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH" fi if test "${lt_cv_sys_lib_search_path_spec+set}" = set; then sys_lib_search_path_spec="$lt_cv_sys_lib_search_path_spec" fi if test "${lt_cv_sys_lib_dlsearch_path_spec+set}" = 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 which 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 which 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 "$withval" = no || with_gnu_ld=yes], [with_gnu_ld=no])dnl ac_prog=ld if test "$GCC" = yes; 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 "$with_gnu_ld" = yes; 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* | netbsdelf*-gnu) 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*) if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; 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 ;; *) case `"$tmp_nm" -p /dev/null 2>&1 | sed '1q'` in */dev/null*) lt_cv_path_NM="$tmp_nm -p" break ;; *) 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 "$lt_cv_path_NM" != "no"; 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 /dev/null 2>&1 | sed '1q'` in *COFF*) DUMPBIN="$DUMPBIN -symbols" ;; *) 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 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 "x$lt_cv_path_mainfest_tool" != xyes; then MANIFEST_TOOL=: fi _LT_DECL([], [MANIFEST_TOOL], [1], [Manifest tool])dnl ])# _LT_PATH_MANIFEST_TOOL # 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 "$GCC" = yes; 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 "$host_cpu" = ia64; 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 # 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 -e 's/^T .* \(.*\)$/extern int \1();/p' -e 's/^$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 -e 's/^: \([[^ ]]*\)[[ ]]*$/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([[^ ]]*\) \([[^ ]]*\)$/ {\"\2\", (void *) \&\2},/p'" lt_cv_sys_global_symbol_to_c_name_address_lib_prefix="sed -n -e 's/^: \([[^ ]]*\)[[ ]]*$/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([[^ ]]*\) \(lib[[^ ]]*\)$/ {\"\2\", (void *) \&\2},/p' -e 's/^$symcode* \([[^ ]]*\) \([[^ ]]*\)$/ {\"lib\2\", (void *) \&\2},/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 # and D for any global 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};"\ " \$ 0!~/External *\|/{next};"\ " / 0+ UNDEF /{next}; / UNDEF \([^|]\)*()/{next};"\ " {if(hide[section]) next};"\ " {f=0}; \$ 0~/\(\).*\|/{f=1}; {printf f ? \"T \" : \"D \"};"\ " {split(\$ 0, a, /\||\r/); split(a[2], s)};"\ " s[1]~/^[@?]/{print s[1], s[1]; next};"\ " s[1]~prfx {split(s[1],t,\"@\"); print 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 con'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* \(.*\) \(.*\)$/ {\"\2\", (void *) \&\2},/" < "$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 "$pipe_works" = yes; 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_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_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 "$GXX" = yes; 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 "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' fi ;; 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 "$host_cpu" = ia64; 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 "$host_cpu" != ia64; 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* | netbsdelf*-gnu) ;; *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 "$GCC" = yes; 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 "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' fi ;; 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 "$host_cpu" = ia64; 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 ;; 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' ;; 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 which 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 ;; linux* | k*bsd*-gnu | gnu*) _LT_TAGVAR(link_all_deplibs, $1)=no ;; *) _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 "$GCC" != yes; then with_gnu_ld=no fi ;; interix*) # we just hope/assume this is gcc and not c89 (= MSVC++) with_gnu_ld=yes ;; openbsd*) with_gnu_ld=no ;; linux* | k*bsd*-gnu | gnu*) _LT_TAGVAR(link_all_deplibs, $1)=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 "$with_gnu_ld" = yes; 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 "$lt_use_gnu_ld_interface" = yes; 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 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 "$host_cpu" != ia64; 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 (1st line # is EXPORTS), use it as is; otherwise, prepend... _LT_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; 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 "$host_os" = linux-dietlibc; 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 "$tmp_diet" = no 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' ;; 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 "x$supports_anon_versioning" = xyes; 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 "x$supports_anon_versioning" = xyes; 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* | netbsdelf*-gnu) 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 can not *** 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 "$_LT_TAGVAR(ld_shlibs, $1)" = no; 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 "$GCC" = yes && 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 "$host_cpu" = ia64; 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 $ld_flag = "-brtl" || test $ld_flag = "-Wl,-brtl"); 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 "$GCC" = yes; 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 "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi _LT_TAGVAR(link_all_deplibs, $1)=no else # not using gcc if test "$host_cpu" = ia64; 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 "$aix_use_runtimelinking" = yes; 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 "$aix_use_runtimelinking" = yes; 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 "x${allow_undefined_flag}" != "x"; then func_echo_all "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; 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 "$with_gnu_ld" = yes; 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~linknames=' _LT_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then sed -n -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' -e '1\\\!p' < $export_symbols > $output_objdir/$soname.exp; else sed -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' < $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 "$GCC" = yes; 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 $output_objdir/$soname = $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 $output_objdir/$soname = $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 "$GCC" = yes && test "$with_gnu_ld" = no; 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 "$with_gnu_ld" = no; 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 "$GCC" = yes && test "$with_gnu_ld" = no; 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 "$with_gnu_ld" = no; 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 "$GCC" = yes; 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 "$lt_cv_irix_exported_symbol" = yes; 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* | netbsdelf*-gnu) 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*) 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__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; 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 case $host_os in openbsd[[01]].* | openbsd2.[[0-7]] | openbsd2.[[0-7]].*) _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' ;; *) _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' ;; esac 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 "$GCC" = yes; 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 "$GCC" = yes; 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 "$GCC" = yes; 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 "$GCC" = yes; 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 "x$host_vendor" = xsequent; 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 "$GCC" = yes; 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 can NOT 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 "$GCC" = yes; 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 x$host_vendor = xsni; 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 "$_LT_TAGVAR(ld_shlibs, $1)" = no && 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 "$enable_shared" = yes && test "$GCC" = yes; 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 which 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 "$can_build_shared" = "no" && 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 "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[[4-9]]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && 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 "$enable_shared" = yes || 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 "X$CXX" != "Xno" && ( (test "X$CXX" = "Xg++" && `g++ -v >/dev/null 2>&1` ) || (test "X$CXX" != "Xg++"))) ; 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 "$_lt_caught_CXX_error" != yes; 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 "$GXX" = yes; 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 "$GXX" = yes; 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 "$with_gnu_ld" = yes; 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 "$host_cpu" = ia64; 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 "$GXX" = yes; 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 "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi else # not using gcc if test "$host_cpu" = ia64; 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 "$aix_use_runtimelinking" = yes; 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 "$aix_use_runtimelinking" = yes; 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 "x${allow_undefined_flag}" != "x"; then func_echo_all "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; 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 "$with_gnu_ld" = yes; 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~linknames=' _LT_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then $SED -n -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' -e '1\\\!p' < $export_symbols > $output_objdir/$soname.exp; else $SED -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' < $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 (1st line # is EXPORTS), use it as is; otherwise, prepend... _LT_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; 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 $output_objdir/$soname = $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 "$GXX" = yes; 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 $output_objdir/$soname = $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 $with_gnu_ld = no; 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 "$GXX" = yes; then if test $with_gnu_ld = no; 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 "$GXX" = yes; then if test "$with_gnu_ld" = no; 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 "x$supports_anon_versioning" = xyes; 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 ;; openbsd2*) # C++ shared libraries are fairly broken _LT_TAGVAR(ld_shlibs, $1)=no ;; openbsd*) 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__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; 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 "$GXX" = yes && test "$with_gnu_ld" = no; 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 "$GXX" = yes && test "$with_gnu_ld" = no; 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 $LDFLAGS $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 -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 $LDFLAGS $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 -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 can NOT 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 "$_LT_TAGVAR(ld_shlibs, $1)" = no && 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 "$_lt_caught_CXX_error" != yes 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 ${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 ])# _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 $p = "-L" || test $p = "-R"; 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 "$pre_test_object_deps_done" = no; 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 "$pre_test_object_deps_done" = no; 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 "$solaris_use_stlport4" != yes; 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 "$solaris_use_stlport4" != yes; 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 "X$F77" = "Xno"; 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 "$_lt_disable_F77" != yes; 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 "$can_build_shared" = "no" && 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 "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[[4-9]]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && 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 "$enable_shared" = yes || 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 "$_lt_disable_F77" != yes 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 "X$FC" = "Xno"; 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 "$_lt_disable_FC" != yes; 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 "$can_build_shared" = "no" && 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 "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[[4-9]]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && 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 "$enable_shared" = yes || 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 "$_lt_disable_FC" != yes 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 "x${GCJFLAGS+set}" = xset || 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 $lt_ac_count -gt 10 && 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], [AC_MSG_CHECKING([whether the shell understands some XSI constructs]) # Try some XSI features xsi_shell=no ( _lt_dummy="a/b/c" test "${_lt_dummy##*/},${_lt_dummy%/*},${_lt_dummy#??}"${_lt_dummy%"$_lt_dummy"}, \ = c,a/b,b/c, \ && eval 'test $(( 1 + 1 )) -eq 2 \ && test "${#_lt_dummy}" -eq 5' ) >/dev/null 2>&1 \ && xsi_shell=yes AC_MSG_RESULT([$xsi_shell]) _LT_CONFIG_LIBTOOL_INIT([xsi_shell='$xsi_shell']) AC_MSG_CHECKING([whether the shell understands "+="]) lt_shell_append=no ( foo=bar; set foo baz; eval "$[1]+=\$[2]" && test "$foo" = barbaz ) \ >/dev/null 2>&1 \ && lt_shell_append=yes AC_MSG_RESULT([$lt_shell_append]) _LT_CONFIG_LIBTOOL_INIT([lt_shell_append='$lt_shell_append']) 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_PROG_FUNCTION_REPLACE (FUNCNAME, REPLACEMENT-BODY) # ------------------------------------------------------ # In `$cfgfile', look for function FUNCNAME delimited by `^FUNCNAME ()$' and # '^} FUNCNAME ', and replace its body with REPLACEMENT-BODY. m4_defun([_LT_PROG_FUNCTION_REPLACE], [dnl { sed -e '/^$1 ()$/,/^} # $1 /c\ $1 ()\ {\ m4_bpatsubsts([$2], [$], [\\], [^\([ ]\)], [\\\1]) } # Extended-shell $1 implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: ]) # _LT_PROG_REPLACE_SHELLFNS # ------------------------- # Replace existing portable implementations of several shell functions with # equivalent extended shell implementations where those features are available.. m4_defun([_LT_PROG_REPLACE_SHELLFNS], [if test x"$xsi_shell" = xyes; then _LT_PROG_FUNCTION_REPLACE([func_dirname], [dnl case ${1} in */*) func_dirname_result="${1%/*}${2}" ;; * ) func_dirname_result="${3}" ;; esac]) _LT_PROG_FUNCTION_REPLACE([func_basename], [dnl func_basename_result="${1##*/}"]) _LT_PROG_FUNCTION_REPLACE([func_dirname_and_basename], [dnl case ${1} in */*) func_dirname_result="${1%/*}${2}" ;; * ) func_dirname_result="${3}" ;; esac func_basename_result="${1##*/}"]) _LT_PROG_FUNCTION_REPLACE([func_stripname], [dnl # pdksh 5.2.14 does not do ${X%$Y} correctly if both X and Y are # positional parameters, so assign one to ordinary parameter first. func_stripname_result=${3} func_stripname_result=${func_stripname_result#"${1}"} func_stripname_result=${func_stripname_result%"${2}"}]) _LT_PROG_FUNCTION_REPLACE([func_split_long_opt], [dnl func_split_long_opt_name=${1%%=*} func_split_long_opt_arg=${1#*=}]) _LT_PROG_FUNCTION_REPLACE([func_split_short_opt], [dnl func_split_short_opt_arg=${1#??} func_split_short_opt_name=${1%"$func_split_short_opt_arg"}]) _LT_PROG_FUNCTION_REPLACE([func_lo2o], [dnl case ${1} in *.lo) func_lo2o_result=${1%.lo}.${objext} ;; *) func_lo2o_result=${1} ;; esac]) _LT_PROG_FUNCTION_REPLACE([func_xform], [ func_xform_result=${1%.*}.lo]) _LT_PROG_FUNCTION_REPLACE([func_arith], [ func_arith_result=$(( $[*] ))]) _LT_PROG_FUNCTION_REPLACE([func_len], [ func_len_result=${#1}]) fi if test x"$lt_shell_append" = xyes; then _LT_PROG_FUNCTION_REPLACE([func_append], [ eval "${1}+=\\${2}"]) _LT_PROG_FUNCTION_REPLACE([func_append_quoted], [dnl func_quote_for_eval "${2}" dnl m4 expansion turns \\\\ into \\, and then the shell eval turns that into \ eval "${1}+=\\\\ \\$func_quote_for_eval_result"]) # Save a `func_append' function call where possible by direct use of '+=' sed -e 's%func_append \([[a-zA-Z_]]\{1,\}\) "%\1+="%g' $cfgfile > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: else # Save a `func_append' function call even when '+=' is not available sed -e 's%func_append \([[a-zA-Z_]]\{1,\}\) "%\1="$\1%g' $cfgfile > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: fi if test x"$_lt_function_replace_fail" = x":"; then AC_MSG_WARN([Unable to substitute extended shell functions in $ofile]) fi ]) # _LT_PATH_CONVERSION_FUNCTIONS # ----------------------------- # Determine which 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.4/osl/m4/ax_submodule.m40000644000175000017500000000365612413270135013706 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.4/osl/m4/ax_compiler_vendor.m40000644000175000017500000000601012413256474015073 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.4/osl/m4/ax_gcc_x86_cpuid.m40000644000175000017500000000634312413256474014342 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.4/osl/m4/ltoptions.m40000644000175000017500000003007312413256722013251 00000000000000# Helper functions for option handling. -*- Autoconf -*- # # Copyright (C) 2004, 2005, 2007, 2008, 2009 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 7 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=default]) test -z "$pic_mode" && 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.4/osl/include/0000755000175000017500000000000012555417256012144 500000000000000cloog-0.18.4/osl/include/osl/0000755000175000017500000000000012555417256012741 500000000000000cloog-0.18.4/osl/include/osl/interface.h0000644000175000017500000001661412413256474014776 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** interface.h ** **-----------------------------------------------------------------** ** First version: 15/07/2011 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #ifndef OSL_INTERFACE_H # define OSL_INTERFACE_H # include # if defined(__cplusplus) extern "C" { # endif typedef void (*osl_idump_f) (FILE *, void *, int); typedef char * (*osl_sprint_f)(void *); typedef void * (*osl_sread_f) (char **); typedef void * (*osl_malloc_f)(); typedef void (*osl_free_f) (void *); typedef void * (*osl_clone_f) (void *); typedef int (*osl_equal_f) (void *, void *); /** * The osl_interface structure stores the URI and base * functions pointers an openscop object implementation has to offer. It * is a node in a NULL-terminated list of interfaces. */ struct osl_interface { char * URI; /**< Unique identifier string */ osl_idump_f idump; /**< Pointer to idump function */ osl_sprint_f sprint; /**< Pointer to sprint function */ osl_sread_f sread; /**< Pointer to sread function */ osl_malloc_f malloc; /**< Pointer to malloc function */ osl_free_f free; /**< Pointer to free function */ osl_clone_f clone; /**< Pointer to clone function */ osl_equal_f equal; /**< Pointer to equal function */ struct osl_interface * next; /**< Next interface in the list */ }; typedef struct osl_interface osl_interface_t; typedef struct osl_interface * osl_interface_p; /*+*************************************************************************** * Structure display function * *****************************************************************************/ void osl_interface_idump(FILE *, osl_interface_p, int); void osl_interface_dump(FILE *, osl_interface_p); /***************************************************************************** * Reading function * *****************************************************************************/ /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ void osl_interface_add(osl_interface_p *, osl_interface_p); osl_interface_p osl_interface_malloc(); void osl_interface_free(osl_interface_p); /*+*************************************************************************** * Processing functions * *****************************************************************************/ int osl_interface_number(osl_interface_p); osl_interface_p osl_interface_nclone(osl_interface_p, int); osl_interface_p osl_interface_clone(osl_interface_p); int osl_interface_equal(osl_interface_p, osl_interface_p); osl_interface_p osl_interface_lookup(osl_interface_p, char *); osl_interface_p osl_interface_get_default_registry(); # if defined(__cplusplus) } # endif #endif /* define OSL_INTERFACE_H */ cloog-0.18.4/osl/include/osl/relation.h0000644000175000017500000003000312413270135014625 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** relation.h ** **-----------------------------------------------------------------** ** First version: 30/04/2008 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #ifndef OSL_RELATION_H # define OSL_RELATION_H # include # include # include # include # if defined(__cplusplus) extern "C" { # endif # define OSL_URI_RELATION "relation" /** * The osl_relation_t structure stores a union of relations. It is a * NULL-terminated linked list of relations. Each relation is described * using a matrix where each row represents a linear constraint. The entries * of each row are organised in the following order: * - An equality/inequality tag: 0 means the row corresponds to an * equality constraint == 0, 1 means it is an inequality >= 0. * - The coefficients of the output dimensions. * - The coefficients of the input dimensions (0 for a set). * - The coefficients of the local (existentially quantified) dimensions. * - The coefficients of the parameters. * - The coefficient of the constant. * Thus we have the following invariant: nb_columns = * 1 + nb_output_dims + nb_input_dims + dims + nb_parameters + 1. * Moreover we use the following conventions: * - Sets (e.g., iteration domains) are the images of relations with a * zero-dimensional domain, hence the number of input dimensions is 0. * - The first output dimension of any access relations corresponds to * the name of the array. * The type field may provide some semantics about the relation, it may be: * - Undefined : OSL_UNDEFINED, * - An iteration domain : OSL_TYPE_DOMAIN, * - A scattering relation : OSL_TYPE_SCATTERING, * - An access relation : OSL_TYPE_ACCESS. */ struct osl_relation { int type; /**< Semantics about the relation */ int precision; /**< Precision of relation matrix elements*/ int nb_rows; /**< Number of rows */ int nb_columns; /**< Number of columns */ int nb_output_dims; /**< Number of output dimensions */ int nb_input_dims; /**< Number of input dimensions */ int nb_local_dims; /**< Number of local (existentially quantified) dimensions */ int nb_parameters; /**< Number of parameters */ osl_int_t** m; /**< An array of pointers to the beginning of each row of the relation matrix */ void* usr; /**< User-managed field, untouched by osl */ struct osl_relation * next; /**< Pointer to the next relation in the union of relations (NULL if none) */ }; typedef struct osl_relation osl_relation_t; typedef struct osl_relation * osl_relation_p; /*+*************************************************************************** * Structure display function * *****************************************************************************/ void osl_relation_idump(FILE *, osl_relation_p, int); void osl_relation_dump(FILE *, osl_relation_p); char * osl_relation_expression(osl_relation_p relation, int row, char ** names); char * osl_relation_spprint_polylib(osl_relation_p, osl_names_p); char * osl_relation_spprint(osl_relation_p, osl_names_p); void osl_relation_pprint(FILE *, osl_relation_p, osl_names_p); char * osl_relation_sprint(osl_relation_p); void osl_relation_print(FILE *, osl_relation_p); // SCoPLib Compatibility char * osl_relation_spprint_polylib_scoplib(osl_relation_p, osl_names_p, int, int); char * osl_relation_spprint_scoplib(osl_relation_p, osl_names_p, int, int); void osl_relation_pprint_scoplib(FILE *, osl_relation_p, osl_names_p, int, int); /***************************************************************************** * Reading function * *****************************************************************************/ osl_relation_p osl_relation_pread(FILE *, int); osl_relation_p osl_relation_read(FILE *); osl_relation_p osl_relation_psread(char **, int); osl_relation_p osl_relation_psread_polylib(char **, int); osl_relation_p osl_relation_sread(char **); osl_relation_p osl_relation_sread_polylib(char **); /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ osl_relation_p osl_relation_pmalloc(int, int, int); osl_relation_p osl_relation_malloc(int, int); void osl_relation_free_inside(osl_relation_p); void osl_relation_free(osl_relation_p); /*+*************************************************************************** * Processing functions * *****************************************************************************/ int osl_relation_nb_components(osl_relation_p relation); osl_relation_p osl_relation_nclone(osl_relation_p, int); osl_relation_p osl_relation_clone_nconstraints(osl_relation_p, int); osl_relation_p osl_relation_clone(osl_relation_p); void osl_relation_add(osl_relation_p *, osl_relation_p); osl_relation_p osl_relation_union(osl_relation_p, osl_relation_p); void osl_relation_replace_vector(osl_relation_p, osl_vector_p, int); void osl_relation_insert_vector(osl_relation_p, osl_vector_p, int); osl_relation_p osl_relation_concat_vector(osl_relation_p, osl_vector_p); void osl_relation_insert_blank_row(osl_relation_p, int); void osl_relation_insert_blank_column(osl_relation_p, int); void osl_relation_add_vector(osl_relation_p, osl_vector_p, int); void osl_relation_sub_vector(osl_relation_p, osl_vector_p, int); osl_relation_p osl_relation_from_vector(osl_vector_p); void osl_relation_replace_constraints(osl_relation_p, osl_relation_p, int); void osl_relation_insert_constraints(osl_relation_p, osl_relation_p, int); void osl_relation_swap_constraints(osl_relation_p, int, int); void osl_relation_remove_row(osl_relation_p, int); void osl_relation_remove_column(osl_relation_p, int); void osl_relation_insert_columns(osl_relation_p, osl_relation_p,int); osl_relation_p osl_relation_concat_constraints(osl_relation_p, osl_relation_p); int osl_relation_part_equal(osl_relation_p, osl_relation_p); int osl_relation_equal(osl_relation_p, osl_relation_p); int osl_relation_integrity_check(osl_relation_p, int, int, int,int); void osl_relation_set_attributes_one(osl_relation_p, int, int, int, int); void osl_relation_set_attributes(osl_relation_p, int, int, int, int); void osl_relation_set_type(osl_relation_p, int); int osl_relation_get_array_id(osl_relation_p); int osl_relation_is_access(osl_relation_p); void osl_relation_get_attributes(osl_relation_p, int *, int *, int *, int *, int *); osl_relation_p osl_relation_extend_output(osl_relation_p, int); osl_interface_p osl_relation_interface(); void osl_relation_set_precision(int const, osl_relation_p); void osl_relation_set_same_precision(osl_relation_p, osl_relation_p); # if defined(__cplusplus) } # endif #endif /* define OSL_RELATION_H */ cloog-0.18.4/osl/include/osl/vector.h0000644000175000017500000001517212413256474014336 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** vector.h ** **-----------------------------------------------------------------** ** First version: 01/05/2008 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #ifndef OSL_VECTOR_H # define OSL_VECTOR_H # include # include # if defined(__cplusplus) extern "C" { # endif /** * The osl_vector_t structure stores a vector information in the PolyLib * format (the first entry has a specific meaning). When a vector * describes a linear constraint, a 0 means it is an equality == 0, a 1 means * an inequality >= 0. When the vector describes an array access, a number * different than 0 is the array identifier. */ struct osl_vector { int precision; /**< Precision of the integer elements. */ int size; /**< Number of vector entries */ osl_int_t* v; /**< An array of integer values */ }; typedef struct osl_vector osl_vector_t; typedef struct osl_vector * osl_vector_p; /*+*************************************************************************** * Structure display function * *****************************************************************************/ void osl_vector_idump(FILE *, osl_vector_p, int); void osl_vector_dump(FILE *, osl_vector_p); /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ osl_vector_p osl_vector_pmalloc(int, int); osl_vector_p osl_vector_malloc(int); void osl_vector_free(osl_vector_p); /*+*************************************************************************** * Processing functions * *****************************************************************************/ osl_vector_p osl_vector_add_scalar(osl_vector_p, int); osl_vector_p osl_vector_mul_scalar(osl_vector_p, int); osl_vector_p osl_vector_add(osl_vector_p, osl_vector_p); osl_vector_p osl_vector_sub(osl_vector_p, osl_vector_p); void osl_vector_tag_inequality(osl_vector_p); void osl_vector_tag_equality(osl_vector_p); int osl_vector_equal(osl_vector_p, osl_vector_p); int osl_vector_is_scalar(osl_vector_p); # if defined(__cplusplus) } # endif #endif /* define OSL_VECTOR_H */ cloog-0.18.4/osl/include/osl/osl.h0000644000175000017500000001317212413270135013615 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** osl.h ** **-----------------------------------------------------------------** ** First version: 11/05/2010 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #ifndef OSL_OSL_H # define OSL_OSL_H /* List of reserved OpenScop URIs: * - arrays * - body * - clay * - comment * - coordinates * - dependence * - extbody * - generic * - int * - interface * - irregular * - null * - openscop * - relation * - relation_list * - scatnames * - scop * - statement * - strings * - symbols * - textual * - vector */ # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include #endif /* define OSL_OSL_H */ cloog-0.18.4/osl/include/osl/extensions/0000755000175000017500000000000012555417256015140 500000000000000cloog-0.18.4/osl/include/osl/extensions/pluto_unroll.h0000644000175000017500000001624312413270135017757 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** extensions/pluto_unroll.h ** **-----------------------------------------------------------------** ** First version: 26/06/2014 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2014 Inria * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #ifndef OSL_PLUTO_UNROLL_H #define OSL_PLUTO_UNROLL_H #include #include #include "../strings.h" #include "../interface.h" #if defined(__cplusplus) extern "C" { #endif #define OSL_URI_PLUTO_UNROLL "pluto_unroll" /** * The osl_pluto_unroll_t structure stores the pluto_unroll * that Pluto wants to unroll */ struct osl_pluto_unroll { char* iter; /**< \brief \0 terminated iterator name */ bool jam; /**< \brief true if jam, false otherwise */ unsigned int factor; /**< \brief unroll factor */ struct osl_pluto_unroll * next; /**< \brief next { iter, jam, factor } */ }; typedef struct osl_pluto_unroll osl_pluto_unroll_t; typedef struct osl_pluto_unroll * osl_pluto_unroll_p; /*+*************************************************************************** * Structure display function * *****************************************************************************/ void osl_pluto_unroll_idump(FILE *, osl_pluto_unroll_p, int); void osl_pluto_unroll_dump(FILE *, osl_pluto_unroll_p); char * osl_pluto_unroll_sprint(osl_pluto_unroll_p); /***************************************************************************** * Reading function * *****************************************************************************/ osl_pluto_unroll_p osl_pluto_unroll_sread(char**); /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ osl_pluto_unroll_p osl_pluto_unroll_malloc(); void osl_pluto_unroll_free(osl_pluto_unroll_p); /*+*************************************************************************** * Processing functions * *****************************************************************************/ void osl_pluto_unroll_fill(osl_pluto_unroll_p, char const * const, bool const, int const); osl_pluto_unroll_p osl_pluto_unroll_clone(osl_pluto_unroll_p); int osl_pluto_unroll_equal_one(osl_pluto_unroll_p, osl_pluto_unroll_p); int osl_pluto_unroll_equal(osl_pluto_unroll_p, osl_pluto_unroll_p); osl_strings_p osl_pluto_unroll_to_strings(osl_pluto_unroll_p); osl_interface_p osl_pluto_unroll_interface(); #if defined(__cplusplus) } #endif #endif /* define OSL_PLUTO_UNROLL_H */ cloog-0.18.4/osl/include/osl/extensions/loop.h0000644000175000017500000001657112413256474016210 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** extensions/loop.h ** **-----------------------------------------------------------------** ** First version: 03/06/2013 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #ifndef OSL_LOOP_H # define OSL_LOOP_H # include # include # include # if defined(__cplusplus) extern "C" { # endif # define OSL_URI_LOOP "loop" //loop direcrives # define OSL_LOOP_DIRECTIVE_NONE 0 # define OSL_LOOP_DIRECTIVE_PARALLEL 1 # define OSL_LOOP_DIRECTIVE_MPI 2 # define OSL_LOOP_DIRECTIVE_VECTOR 4 /** * The osl_loop_t structure stores information about loops in the program * in the extension part of the OpenScop representation. Containing the * information about the statements in the loop, its iterator and openmp * directives, it serves to communicate such information among different * tools in the polyhedral chain. */ struct osl_loop { char * iter; /**< \brief \0 terminated iterator name */ int nb_stmts; /**< \brief Number of statements in the loop */ int * stmt_ids; /**< \brief Array of statement identifiers. */ char * private_vars; /**< \brief \0 terminated variable names */ int directive; /**< \brief the OpenMP directive to implement */ struct osl_loop * next; }; typedef struct osl_loop osl_loop_t; typedef struct osl_loop * osl_loop_p; /*+*************************************************************************** * Structure display function * *****************************************************************************/ void osl_loop_idump(FILE * file, osl_loop_p loop, int level); void osl_loop_dump(FILE * file, osl_loop_p loop); char * osl_loop_sprint(osl_loop_p loop); /***************************************************************************** * Reading function * *****************************************************************************/ osl_loop_p osl_loop_sread(char ** input); /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ osl_loop_p osl_loop_malloc(); void osl_loop_free(osl_loop_p loop); /*+*************************************************************************** * Processing functions * *****************************************************************************/ osl_loop_p osl_loop_clone_one(osl_loop_p loop); osl_loop_p osl_loop_clone(osl_loop_p loop); int osl_loop_equal_one(osl_loop_p a1, osl_loop_p a2); int osl_loop_equal(osl_loop_p a1, osl_loop_p a2); osl_strings_p osl_loop_to_strings(osl_loop_p); osl_interface_p osl_loop_interface(); void osl_loop_add(osl_loop_p loop, osl_loop_p *ll); int osl_loop_count(osl_loop_p ll); # if defined(__cplusplus) } # endif #endif /* define OSL_LOOP_H */ cloog-0.18.4/osl/include/osl/extensions/comment.h0000644000175000017500000001465112413256474016676 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** extensions/comment.h ** **-----------------------------------------------------------------** ** First version: 07/12/2010 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #ifndef OSL_COMMENT_H # define OSL_COMMENT_H # include # include # if defined(__cplusplus) extern "C" { # endif # define OSL_URI_COMMENT "comment" /** * The osl_comment_t structure stores a comment extention to the core * OpenScop representation. It is simply a 0-terminated string. */ struct osl_comment { char * comment; /**< A comment message as a 0-terminated string. */ }; typedef struct osl_comment osl_comment_t; typedef struct osl_comment * osl_comment_p; /*+*************************************************************************** * Structure display function * *****************************************************************************/ void osl_comment_idump(FILE *, osl_comment_p, int); void osl_comment_dump(FILE *, osl_comment_p); char * osl_comment_sprint(osl_comment_p); /***************************************************************************** * Reading function * *****************************************************************************/ osl_comment_p osl_comment_sread(char **); /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ osl_comment_p osl_comment_malloc(); void osl_comment_free(osl_comment_p); /*+*************************************************************************** * Processing functions * *****************************************************************************/ osl_comment_p osl_comment_clone(osl_comment_p); int osl_comment_equal(osl_comment_p, osl_comment_p); osl_interface_p osl_comment_interface(); # if defined(__cplusplus) } # endif #endif /* define OSL_COMMENT_H */ cloog-0.18.4/osl/include/osl/extensions/textual.h0000644000175000017500000001474012413256474016721 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** extensions/textual.h ** **-----------------------------------------------------------------** ** First version: 15/07/2011 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #ifndef OSL_TEXTUAL_H # define OSL_TEXTUAL_H # include # include # if defined(__cplusplus) extern "C" { # endif # define OSL_URI_TEXTUAL "textual" /** * The osl_textual_t structure stores the complete textual * representation of the scop extension field. It is a special case of * extension since it does not require start and end tag. */ struct osl_textual { char * textual; /**< Full extension string as a 0-terminated string. */ }; typedef struct osl_textual osl_textual_t; typedef struct osl_textual * osl_textual_p; /*+*************************************************************************** * Structure display function * *****************************************************************************/ void osl_textual_idump(FILE *, osl_textual_p, int); void osl_textual_dump(FILE *, osl_textual_p); char * osl_textual_sprint(osl_textual_p); /***************************************************************************** * Reading function * *****************************************************************************/ osl_textual_p osl_textual_sread(char **); /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ osl_textual_p osl_textual_malloc(); void osl_textual_free(osl_textual_p); /*+*************************************************************************** * Processing functions * *****************************************************************************/ osl_textual_p osl_textual_clone(osl_textual_p); int osl_textual_equal(osl_textual_p, osl_textual_p); osl_interface_p osl_textual_interface(); # if defined(__cplusplus) } # endif #endif /* define OSL_TEXTUAL_H */ cloog-0.18.4/osl/include/osl/extensions/symbols.h0000755000175000017500000001634312413256474016727 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** extensions/symbols.h ** **-----------------------------------------------------------------** ** First version: 07/03/2012 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * Prasanth Chatharasi * * * *****************************************************************************/ #ifndef OSL_SYMBOLS_H # define OSL_SYMBOLS_H # include # include # include # include # if defined(__cplusplus) extern "C" { # endif # define OSL_URI_SYMBOLS "symbols" /** * The osl_symbols_t structure stores information regarding the symbols. */ struct osl_symbols { int type; /**< Symbol type (variable, iterator...) */ int generated; /**< Flag to determine its origin */ int nb_dims; /**< Number of array dimensions */ osl_generic_p identifier; /**< Symbol identifier */ osl_generic_p datatype; /**< Symbol Datatype (int, float...) */ osl_generic_p scope; /**< Scope of symbol */ osl_generic_p extent; /**< Limits of dimensions in Symbol */ void* usr; /**< A user defined field */ struct osl_symbols* next; }; typedef struct osl_symbols osl_symbols_t; typedef struct osl_symbols* osl_symbols_p; /*+*************************************************************************** * Structure display function * *****************************************************************************/ void osl_symbols_idump(FILE *, osl_symbols_p, int); void osl_symbols_dump(FILE *, osl_symbols_p); char * osl_symbols_sprint(osl_symbols_p); /***************************************************************************** * Reading function * *****************************************************************************/ osl_symbols_p osl_symbols_sread(char **); /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ osl_symbols_p osl_symbols_malloc(); void osl_symbols_free(osl_symbols_p); /*+*************************************************************************** * Processing functions * *****************************************************************************/ void osl_symbols_add(osl_symbols_p*, osl_symbols_p); osl_symbols_p osl_symbols_nclone(osl_symbols_p, int); osl_symbols_p osl_symbols_clone(osl_symbols_p); int osl_symbols_equal(osl_symbols_p, osl_symbols_p); osl_symbols_p osl_symbols_lookup(osl_symbols_p, osl_generic_p); osl_symbols_p osl_symbols_remove(osl_symbols_p*, osl_symbols_p); int osl_symbols_get_nb_symbols(osl_symbols_p); osl_interface_p osl_symbols_interface(); # if defined(__cplusplus) } # endif #endif /* define OSL_SYMBOLS_H */ cloog-0.18.4/osl/include/osl/extensions/null.h0000644000175000017500000001445412413270135016175 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** extensions/null.h ** **-----------------------------------------------------------------** ** First version: 28/06/2012 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #ifndef OSL_NULL_H # define OSL_NULL_H # include # include # if defined(__cplusplus) extern "C" { # endif # define OSL_URI_NULL "null" /** * The osl_null_t structure stores a null extention to the core * OpenScop representation. It contains simply nothing. */ struct osl_null { int fake_member_to_disable_warning; }; typedef struct osl_null osl_null_t; typedef struct osl_null * osl_null_p; /*+*************************************************************************** * Structure display function * *****************************************************************************/ void osl_null_idump(FILE *, osl_null_p, int); void osl_null_dump(FILE *, osl_null_p); char * osl_null_sprint(osl_null_p); /***************************************************************************** * Reading function * *****************************************************************************/ osl_null_p osl_null_sread(char **); /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ osl_null_p osl_null_malloc(); void osl_null_free(osl_null_p); /*+*************************************************************************** * Processing functions * *****************************************************************************/ osl_null_p osl_null_clone(osl_null_p); int osl_null_equal(osl_null_p, osl_null_p); osl_interface_p osl_null_interface(); # if defined(__cplusplus) } # endif #endif /* define OSL_NULL_H */ cloog-0.18.4/osl/include/osl/extensions/irregular.h0000644000175000017500000002013012413256474017215 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** extensions/irregular.h ** **-----------------------------------------------------------------** ** First version: 07/12/2010 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #ifndef OSL_IRREGULAR_H # define OSL_IRREGULAR_H # include # include # include # include # if defined(__cplusplus) extern "C" { # endif # define OSL_URI_IRREGULAR "irregular" # define OSL_TAG_IRREGULAR_START "<"OSL_URI_IRREGULAR">" # define OSL_TAG_IRREGULAR_STOP "" /** * The osl_irregular_t structure stores an irregular extension to the core * OpenScop representation. It contains a list of predicates (in their textual * representation), and for each statement, its list of associated predicates. * The list of predicates contains both control and exit predicates (see * Benabderrhamane et al.'s paper at CC'2010), control predicates are listed * first, then come exit predicates. */ struct osl_irregular { // List of predicates (textual representation). int nb_control; /**< Number of control predicates in the SCoP. */ int nb_exit; /**< Number of exit predicates in the SCoP. */ int * nb_iterators; /**< nb_iterators[i]: #iterators for ith predicate. */ char *** iterators; /**< iterators[i]: array of (nb_control + nb_exit) arrays of nb_iterators[i] strings. Each element corresponds to the list of original iterators for the ith predicate. */ char ** body; /**< body[i]: original source code of ith predicate. */ // List of associated predicates for each statement. int nb_statements; /**< Number of statements in the SCoP. */ int * nb_predicates; /**< nb_predicates[i]: #predicates for ith statement. */ int ** predicates; /**< predicates[i]: array of nb_predicates[i] predicates corresponding to the list of predicates associated to the ith statement. */ }; typedef struct osl_irregular osl_irregular_t; typedef struct osl_irregular * osl_irregular_p; /*+*************************************************************************** * Structure display function * *****************************************************************************/ void osl_irregular_idump(FILE *, osl_irregular_p, int); void osl_irregular_dump(FILE *, osl_irregular_p); char * osl_irregular_sprint(osl_irregular_p); /***************************************************************************** * Reading function * *****************************************************************************/ osl_irregular_p osl_irregular_sread(char **); /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ osl_irregular_p osl_irregular_malloc(); void osl_irregular_free(osl_irregular_p); /*+*************************************************************************** * Processing functions * *****************************************************************************/ osl_irregular_p osl_irregular_clone(osl_irregular_p); int osl_irregular_equal(osl_irregular_p, osl_irregular_p); osl_irregular_p osl_irregular_add_control(osl_irregular_p, char**, int, char*); osl_irregular_p osl_irregular_add_exit(osl_irregular_p, char**, int, char*); osl_irregular_p osl_irregular_add_predicates(osl_irregular_p, int*, int); osl_interface_p osl_irregular_interface(); # if defined(__cplusplus) } # endif #endif /* define OSL_IRREGULAR_H */ cloog-0.18.4/osl/include/osl/extensions/extbody.h0000644000175000017500000001575312413270135016704 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** extensions/extbody.h ** **-----------------------------------------------------------------** ** First version: 07/12/2010 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #ifndef OSL_EXTBODY_H # define OSL_EXTBODY_H # include # include # include # include # if defined(__cplusplus) extern "C" { # endif # define OSL_URI_EXTBODY "extbody" /** * The osl_extbody_t structure stores the coordinates of each access in the * body. osl_extbody is replaced by the simple body. */ struct osl_extbody { osl_body_p body; int nb_access; /**< Nb of access. */ int * start; /**< Array of nb_access start. */ int * length; /**< Array of nb_access length. */ }; typedef struct osl_extbody osl_extbody_t; typedef struct osl_extbody * osl_extbody_p; typedef struct osl_extbody const osl_const_extbody_t; typedef struct osl_extbody * const osl_extbody_const_p; typedef struct osl_extbody const * osl_const_extbody_p; typedef struct osl_extbody const * const osl_const_extbody_const_p; /*+*************************************************************************** * Structure display function * *****************************************************************************/ void osl_extbody_idump(FILE *, osl_extbody_p, int); void osl_extbody_dump(FILE *, osl_extbody_p); char * osl_extbody_sprint(osl_extbody_p); /***************************************************************************** * Reading function * *****************************************************************************/ osl_extbody_p osl_extbody_sread(char **); /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ osl_extbody_p osl_extbody_malloc(); void osl_extbody_free(osl_extbody_p); /*+*************************************************************************** * Processing functions * *****************************************************************************/ osl_extbody_p osl_extbody_clone(osl_extbody_p); int osl_extbody_equal(osl_extbody_p, osl_extbody_p); osl_interface_p osl_extbody_interface(); void osl_extbody_add(osl_extbody_p, int, int); # if defined(__cplusplus) } # endif #endif /* define OSL_EXTBODY_H */ cloog-0.18.4/osl/include/osl/extensions/scatnames.h0000644000175000017500000001524712413256474017214 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** extensions/scatnames.h ** **-----------------------------------------------------------------** ** First version: 03/12/2011 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #ifndef OSL_SCATNAMES_H # define OSL_SCATNAMES_H # include # include # include # if defined(__cplusplus) extern "C" { # endif # define OSL_URI_SCATNAMES "scatnames" /** * The osl_scatnames_t structure stores a scatnames extention to the core * OpenScop representation. It is devoted to store the scattering dimension * names in a textual form. The names are stored using an osl_strings_t * structure and their order in the array corresponds to their dimension * order. */ struct osl_scatnames { osl_strings_p names; /**< List of textual scattering dimension names. */ }; typedef struct osl_scatnames osl_scatnames_t; typedef struct osl_scatnames * osl_scatnames_p; /*+*************************************************************************** * Structure display function * *****************************************************************************/ void osl_scatnames_idump(FILE *, osl_scatnames_p, int); void osl_scatnames_dump(FILE *, osl_scatnames_p); char * osl_scatnames_sprint(osl_scatnames_p); /***************************************************************************** * Reading function * *****************************************************************************/ osl_scatnames_p osl_scatnames_sread(char **); /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ osl_scatnames_p osl_scatnames_malloc(); void osl_scatnames_free(osl_scatnames_p); /*+*************************************************************************** * Processing functions * *****************************************************************************/ osl_scatnames_p osl_scatnames_clone(osl_scatnames_p); int osl_scatnames_equal(osl_scatnames_p, osl_scatnames_p); osl_interface_p osl_scatnames_interface(); # if defined(__cplusplus) } # endif #endif /* define OSL_SCATNAMES_H */ cloog-0.18.4/osl/include/osl/extensions/arrays.h0000644000175000017500000001553312413271020016515 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** extensions/arrays.h ** **-----------------------------------------------------------------** ** First version: 07/12/2010 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #ifndef OSL_ARRAYS_H # define OSL_ARRAYS_H # include # include # include # if defined(__cplusplus) extern "C" { # endif # define OSL_URI_ARRAYS "arrays" /** * The osl_arrays_t structure stores a set of array textual names in * the extension part of the OpenScop representation. Each name has a * name string and an identifier: the ith name as name string names[i] * and identifier id[i]. */ struct osl_arrays { int nb_names; /**< Number of names. */ int * id; /**< Array of nb_names identifiers. */ char ** names; /**< Array of nb_names names. */ }; typedef struct osl_arrays osl_arrays_t; typedef struct osl_arrays * osl_arrays_p; /*+*************************************************************************** * Structure display function * *****************************************************************************/ void osl_arrays_idump(FILE *, osl_arrays_p, int); void osl_arrays_dump(FILE *, osl_arrays_p); char * osl_arrays_sprint(osl_arrays_p); /***************************************************************************** * Reading function * *****************************************************************************/ osl_arrays_p osl_arrays_sread(char **); /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ osl_arrays_p osl_arrays_malloc(); void osl_arrays_free(osl_arrays_p); /*+*************************************************************************** * Processing functions * *****************************************************************************/ osl_arrays_p osl_arrays_clone(osl_arrays_p); int osl_arrays_equal(osl_arrays_p, osl_arrays_p); osl_strings_p osl_arrays_to_strings(osl_arrays_p); int osl_arrays_add(osl_arrays_p, int, char*); size_t osl_arrays_get_index_from_id(osl_arrays_p, int); size_t osl_arrays_get_index_from_name(osl_arrays_p, char*); osl_interface_p osl_arrays_interface(); # if defined(__cplusplus) } # endif #endif /* define OSL_ARRAYS_H */ cloog-0.18.4/osl/include/osl/extensions/clay.h0000644000175000017500000001450612413256474016163 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** extensions/clay.h ** **-----------------------------------------------------------------** ** First version: 09/05/2012 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #ifndef OSL_CLAY_H # define OSL_CLAY_H # include # include # if defined(__cplusplus) extern "C" { # endif # define OSL_URI_CLAY "clay" /** * The osl_clay_t structure stores a clay extention to the core * OpenScop representation. It is simply a 0-terminated string. */ struct osl_clay { char * script; /**< Clay script as a 0-terminated string. */ }; typedef struct osl_clay osl_clay_t; typedef struct osl_clay * osl_clay_p; /*+*************************************************************************** * Structure display function * *****************************************************************************/ void osl_clay_idump(FILE *, osl_clay_p, int); void osl_clay_dump(FILE *, osl_clay_p); char * osl_clay_sprint(osl_clay_p); /***************************************************************************** * Reading function * *****************************************************************************/ osl_clay_p osl_clay_sread(char **); /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ osl_clay_p osl_clay_malloc(); void osl_clay_free(osl_clay_p); /*+*************************************************************************** * Processing functions * *****************************************************************************/ osl_clay_p osl_clay_clone(osl_clay_p); int osl_clay_equal(osl_clay_p, osl_clay_p); osl_interface_p osl_clay_interface(); # if defined(__cplusplus) } # endif #endif /* define OSL_CLAY_H */ cloog-0.18.4/osl/include/osl/extensions/dependence.h0000644000175000017500000002707012413256474017325 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** extensions/dependence.h ** **-----------------------------------------------------------------** ** First version: 02/07/2012 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #ifndef OSL_DEPENDENCE_H # define OSL_DEPENDENCE_H # include # include # include # include # if defined(__cplusplus) extern "C" { # endif # define OSL_URI_DEPENDENCE "dependence" # define OSL_DEPENDENCE_RAW 1 # define OSL_DEPENDENCE_WAR 2 # define OSL_DEPENDENCE_WAW 3 # define OSL_DEPENDENCE_RAR 4 # define OSL_DEPENDENCE_RAW_SCALPRIV 5 # define OSL_DEPENDENCE_EQUAL 1 # define OSL_DEPENDENCE_POSIT 2 # define OSL_DEPENDENCE_LATER 3 # define OSL_DEPENDENCE_NEVER 4 # define OSL_DEPENDENCE_ASSIGNMENT 1 # define OSL_DEPENDENCE_P_REDUCTION 2 # define OSL_DEPENDENCE_M_REDUCTION 3 # define OSL_DEPENDENCE_T_REDUCTION 4 /** * osl_dependence structure: * this structure contains all the informations about a data dependence, it is * also a node of the linked list of all dependences of the dependence graph. Dependence domain structure ________________________________________________________________ / source (output) | target (input) | local dims \ __ |_________________|_________________|_______________________________|_____________ / eq | output | output | output | output |ld dom |ld acc |ld dom |ld acc | | \ | in | domain | access | domain | access |source |source |target |target |parameters | 1 | ________________|____|________|________|________|________|_______|_______|_______|_______|___________|___| |Domain source | X | X : | : | X : | : | X | X | |________________|____|________:________|________:________|_______:_______|_______:_______|___________|___| |Domain target | X | : | X : | : | X : | X | X | |________________|____|________:________|________:________|_______:_______|_______:_______|___________|___| |Access source | X | X : X | : | : X | : | X | X | |________________|____|________:________|________:________|_______:_______|_______:_______|___________|___| |Access target | X | : | X : X | : | : X | X | X | |________________|____|________:________|________:________|_______:_______|_______:_______|___________|___| |Access equality | | : Id | : -Id | : | : | | | |________________|____|________:________|________:________|_______:_______|_______:_______|___________|___| | 0 : 0..depth-1 |Precedence | X | Id : | -Id : | : | : | | X | <--| 0|-1 : depth \________________|____|________:________|________:________|_______:_______|_______:_______|___________|___/ (1) (2) (3) (4) (5) (6) (7) (8) */ struct osl_dependence { int label_source; int label_target; int ref_source; /**< Position of source reference in the array access list. */ int ref_target; /**< Position of target reference in the array access list. */ int depth; /**< Dependence level. */ int type; /**< Dependence type: a dependence from source * to target can be: * - OSL_DEPENDENCE_UNSET if the dependence type * is still not set, * - OSL_DEPENDENCE_RAW if source writes M and * target read M (flow-dependence), * - OSL_DEPENDENCE_WAR if source reads M and * target writes M (anti-dependence), * - OSL_DEPENDENCE_WAW if source writes M and * target writes M too (output-dependence) * - OSL_DEPENDENCE_RAR if source reads M and * target reads M too (input-dependence). */ osl_relation_p domain; /**< Dependence polyhedron. */ /* Other useful information */ int source_nb_output_dims_domain; // (1) int source_nb_output_dims_access; // (2) int target_nb_output_dims_domain; // (3) int target_nb_output_dims_access; // (4) int source_nb_local_dims_domain; // (5) int source_nb_local_dims_access; // (6) int target_nb_local_dims_domain; // (7) int target_nb_local_dims_access; // (8) void* usr; /**< User field, for library users convenience. */ struct osl_dependence * next; /**< Pointer to next dependence */ /* These attributes are not filled by osl * You can use the function candl_dependence_init_fields of CandL */ osl_relation_p ref_source_access_ptr; /**< Pointer to the source access. */ osl_relation_p ref_target_access_ptr; /**< Pointer to the target access. */ osl_statement_p stmt_source_ptr; /**< Pointer to source statement. */ osl_statement_p stmt_target_ptr; /**< Pointer to target statement. */ }; typedef struct osl_dependence osl_dependence_t; typedef struct osl_dependence * osl_dependence_p; /*+*************************************************************************** * Structure display function * *****************************************************************************/ void osl_dependence_idump(FILE *, osl_dependence_p, int); void osl_dependence_dump(FILE *, osl_dependence_p); char * osl_dependence_sprint(osl_dependence_p); void osl_dependence_print(FILE *, osl_dependence_p); /***************************************************************************** * Reading function * *****************************************************************************/ osl_dependence_p osl_dependence_sread(char **); osl_dependence_p osl_dependence_psread(char **, int); /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ osl_dependence_p osl_dependence_malloc(); void osl_dependence_free(osl_dependence_p); /*+*************************************************************************** * Processing functions * *****************************************************************************/ osl_dependence_p osl_dependence_clone(osl_dependence_p); int osl_dependence_equal(osl_dependence_p, osl_dependence_p); void osl_dependence_add(osl_dependence_p*, osl_dependence_p*, osl_dependence_p); int osl_nb_dependences(osl_dependence_p); osl_interface_p osl_dependence_interface(); # if defined(__cplusplus) } # endif #endif /* define OSL_DEPENDENCE_H */ cloog-0.18.4/osl/include/osl/extensions/coordinates.h0000644000175000017500000001576612413256474017556 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** extensions/coordinates.h ** **-----------------------------------------------------------------** ** First version: 07/12/2010 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #ifndef OSL_COORDINATES_H # define OSL_COORDINATES_H # include # include # if defined(__cplusplus) extern "C" { # endif # define OSL_URI_COORDINATES "coordinates" /** * The osl_coordinates_t structure stores a coordinates extension to the core * OpenScop representation. It provides information about the SCoP location in * the original source file (file name, starting and ending lines/columns, * indentation level). */ struct osl_coordinates { char* name; /**< File name (may include the file path as well). */ int line_start; /**< Starting line of the SCoP. */ int line_end; /**< Ending line of the SCoP. */ int column_start; /**< Starting column of the SCoP in the starting line. */ int column_end; /**< Ending column of the SCoP in the ending line. */ int indent; /**< Indentation (number of spaces starting each line).*/ }; typedef struct osl_coordinates osl_coordinates_t; typedef struct osl_coordinates* osl_coordinates_p; /*+*************************************************************************** * Structure display function * *****************************************************************************/ void osl_coordinates_idump(FILE*, osl_coordinates_p, int); void osl_coordinates_dump(FILE*, osl_coordinates_p); char* osl_coordinates_sprint(osl_coordinates_p); /***************************************************************************** * Reading function * *****************************************************************************/ osl_coordinates_p osl_coordinates_sread(char**); /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ osl_coordinates_p osl_coordinates_malloc(); void osl_coordinates_free(osl_coordinates_p); /*+*************************************************************************** * Processing functions * *****************************************************************************/ osl_coordinates_p osl_coordinates_clone(osl_coordinates_p); int osl_coordinates_equal(osl_coordinates_p, osl_coordinates_p); osl_interface_p osl_coordinates_interface(); # if defined(__cplusplus) } # endif #endif /* define OSL_COORDINATES_H */ cloog-0.18.4/osl/include/osl/scop.h0000644000175000017500000002022512555414472013774 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** scop.h ** **-----------------------------------------------------------------** ** First version: 30/04/2008 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ /*+**************************************************************************** * THIS FILE HAS BEEN AUTOMATICALLY GENERATED FROM scop.h.in BY configure * ******************************************************************************/ #ifndef OSL_SCOP_H # define OSL_SCOP_H # include # define OSL_RELEASE "0.9.0" # include # include # include # include # if defined(__cplusplus) extern "C" { # endif /** * The scop_t structure stores a list of scops. Each node stores the useful * information of a static control part of a program to process it within a * polyhedral framework. Parameter information may be strings of characters * (char *) when the type field is OSL_TYPE_STRING or a generic pointer * to anything else (void *) when the type field is OSL_TYPE_GENERIC. * The OpenScop library does not touch AT ALL generic information: printing, * copy etc. must be done externally. */ struct osl_scop { int version; /**< Version of the data structure */ char * language; /**< Target language (backend) */ osl_relation_p context; /**< Constraints on the SCoP parameters */ osl_generic_p parameters; /**< NULL-terminated array of parameters */ osl_statement_p statement; /**< Statement list of the SCoP */ osl_interface_p registry; /**< Registered extensions interfaces */ osl_generic_p extension; /**< List of extensions */ void * usr; /**< A user-defined field, not touched AT ALL by the OpenScop Library */ struct osl_scop * next; /**< Next statement in the linked list */ }; typedef struct osl_scop osl_scop_t; typedef struct osl_scop * osl_scop_p; /*+*************************************************************************** * Structure display function * *****************************************************************************/ void osl_scop_idump(FILE *, osl_scop_p, int); void osl_scop_dump(FILE *, osl_scop_p); void osl_scop_print(FILE *, osl_scop_p); // SCoPLib Compatibility void osl_scop_print_scoplib(FILE *, osl_scop_p); /***************************************************************************** * Reading function * *****************************************************************************/ osl_scop_p osl_scop_pread(FILE *, osl_interface_p, int); osl_scop_p osl_scop_read(FILE *); /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ osl_scop_p osl_scop_malloc(); void osl_scop_free(osl_scop_p); /*+*************************************************************************** * Processing functions * *****************************************************************************/ void osl_scop_add(osl_scop_p *, osl_scop_p); size_t osl_scop_number(osl_scop_p); osl_scop_p osl_scop_clone(osl_scop_p); int osl_scop_equal(osl_scop_p, osl_scop_p); int osl_scop_integrity_check(osl_scop_p); int osl_scop_check_compatible_scoplib(osl_scop_p); int osl_scop_get_nb_parameters(osl_scop_p); void osl_scop_register_extension(osl_scop_p, osl_interface_p); void osl_scop_get_attributes(osl_scop_p, int *, int *, int *, int *, int *); void osl_scop_normalize_scattering(osl_scop_p); osl_names_p osl_scop_names(osl_scop_p scop); # if defined(__cplusplus) } # endif #endif /* define OSL_SCOP_H */ cloog-0.18.4/osl/include/osl/int.h0000644000175000017500000002223012413270135013605 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** int.h ** **-----------------------------------------------------------------** ** First version: 18/07/2011 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #ifndef OSL_INT_H # define OSL_INT_H # ifdef OSL_GMP_IS_HERE # include # endif # if defined(__cplusplus) extern "C" { # endif /** * The osl_int_t union stores an OpenScop integer element. */ union osl_int { long int sp; /**< Single precision int */ long long dp; /**< Double precision int */ #ifdef OSL_GMP_IS_HERE mpz_t* mp; /**< Pointer to a multiple precision int */ #else void* mp; /**< Pointer to a multiple precision int */ #endif }; typedef union osl_int osl_int_t; typedef union osl_int * osl_int_p; typedef union osl_int const osl_const_int_t; typedef union osl_int * const osl_int_const_p; typedef union osl_int const * osl_const_int_p; typedef union osl_int const * const osl_const_int_const_p; /*+*************************************************************************** * Basic Functions * *****************************************************************************/ int osl_int_is_precision_supported(int); void osl_int_dump_precision(FILE *, int); void osl_int_init(int, osl_int_const_p); osl_int_p osl_int_malloc(int); void osl_int_assign(int, osl_int_const_p, osl_const_int_t); void osl_int_set_si(int, osl_int_const_p, int); int osl_int_get_si(int, osl_const_int_t); double osl_int_get_d(int, osl_const_int_t); void osl_int_init_set(int, osl_int_const_p, osl_const_int_t); void osl_int_init_set_si(int, osl_int_const_p, int); void osl_int_swap(int, osl_int_const_p, osl_int_const_p); void osl_int_clear(int, osl_int_const_p); void osl_int_free(int, osl_int_const_p); void osl_int_print(FILE *, int, osl_const_int_t); void osl_int_sprint(char *, int, osl_const_int_t); void osl_int_sprint_txt(char *, int, osl_const_int_t); int osl_int_sscanf(char*, int, osl_int_const_p); void osl_int_sread(char **, int, osl_int_const_p); /*+*************************************************************************** * Arithmetic Operations * *****************************************************************************/ void osl_int_increment(int, osl_int_const_p, osl_const_int_t); void osl_int_decrement(int, osl_int_const_p, osl_const_int_t); void osl_int_add(int, osl_int_const_p, osl_const_int_t, osl_const_int_t); void osl_int_add_si(int, osl_int_const_p, osl_const_int_t, int); void osl_int_sub(int, osl_int_const_p, osl_const_int_t, osl_const_int_t); void osl_int_mul(int, osl_int_const_p, osl_const_int_t, osl_const_int_t); void osl_int_mul_si(int, osl_int_const_p, osl_const_int_t, int); void osl_int_div_exact(int const, osl_int_const_p, osl_const_int_t, osl_const_int_t); void osl_int_floor_div_q(int const, osl_int_const_p, osl_const_int_t, osl_const_int_t); void osl_int_floor_div_r(int const, osl_int_const_p, osl_const_int_t, osl_const_int_t); void osl_int_floor_div_q_r(int const, osl_int_const_p, osl_int_const_p, osl_const_int_t, osl_const_int_t); void osl_int_mod(int const, osl_int_const_p, osl_const_int_t, osl_const_int_t); void osl_int_gcd(int const, osl_int_const_p, osl_const_int_t, osl_const_int_t); void osl_int_oppose(int, osl_int_const_p, osl_const_int_t); void osl_int_abs(int, osl_int_const_p, osl_const_int_t); size_t osl_int_size_in_base_2(int const, osl_const_int_t); size_t osl_int_size_in_base_10(int const, osl_const_int_t); /*+*************************************************************************** * Conditional Operations * *****************************************************************************/ int osl_int_eq(int, osl_const_int_t, osl_const_int_t); int osl_int_ne(int, osl_const_int_t, osl_const_int_t); int osl_int_pos(int, osl_const_int_t); int osl_int_neg(int, osl_const_int_t); int osl_int_zero(int, osl_const_int_t); int osl_int_one(int, osl_const_int_t); int osl_int_mone(int, osl_const_int_t); int osl_int_divisible(int, osl_const_int_t, osl_const_int_t); /*+*************************************************************************** * Processing functions * *****************************************************************************/ void osl_int_set_precision(int const, int const, osl_int_p); # if defined(__cplusplus) } # endif #endif /* define OSL_INT_H */ cloog-0.18.4/osl/include/osl/generic.h0000644000175000017500000001725712413270135014444 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** generic.h ** **-----------------------------------------------------------------** ** First version: 26/11/2010 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #ifndef OSL_generic_H # define OSL_generic_H # include # if defined(__cplusplus) extern "C" { # endif /** * The osl_generic_t structure stores OpenScop data and operations with * no pre-defined type. The information is accessible through the data pointer * while the type and operations are accessible through the interface pointer. * A generic is a also a node of a NULL-terminated linked list of generics. */ struct osl_generic { void * data; /**< Pointer to the data. */ osl_interface_p interface; /**< Interface to work with the data. */ struct osl_generic * next; /**< Pointer to the next generic. */ }; typedef struct osl_generic osl_generic_t; typedef struct osl_generic * osl_generic_p; typedef struct osl_generic const osl_const_generic_t; typedef struct osl_generic * const osl_generic_const_p; typedef struct osl_generic const * osl_const_generic_p; typedef struct osl_generic const * const osl_const_generic_const_p; /*+*************************************************************************** * Structure display function * *****************************************************************************/ void osl_generic_idump(FILE *, osl_generic_p, int); void osl_generic_dump(FILE *, osl_generic_p); void osl_generic_print(FILE *, osl_generic_p); char* osl_generic_sprint(osl_generic_p); // SCoPLib Compatibility void osl_generic_print_options_scoplib(FILE *, osl_generic_p); /***************************************************************************** * Reading function * *****************************************************************************/ osl_generic_p osl_generic_sread(char **, osl_interface_p); osl_generic_p osl_generic_sread_one(char **, osl_interface_p); osl_generic_p osl_generic_read_one(FILE *, osl_interface_p); osl_generic_p osl_generic_read(FILE *, osl_interface_p); /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ void osl_generic_add(osl_generic_p*, osl_generic_p); void osl_generic_remove_node(osl_generic_p*, osl_generic_p); void osl_generic_remove(osl_generic_p*, char *); osl_generic_p osl_generic_malloc(); void osl_generic_free(osl_generic_p); /*+*************************************************************************** * Processing functions * *****************************************************************************/ int osl_generic_number(osl_generic_p); osl_generic_p osl_generic_clone(osl_generic_p); int osl_generic_equal(osl_generic_p, osl_generic_p); int osl_generic_has_URI(osl_const_generic_const_p, char const * const); void * osl_generic_lookup(osl_generic_p, char const * const); osl_generic_p osl_generic_shell(void *, osl_interface_p); # if defined(__cplusplus) } # endif #endif /* define OSL_generic_H */ cloog-0.18.4/osl/include/osl/statement.h0000644000175000017500000001766212413270135015034 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** statement.h ** **-----------------------------------------------------------------** ** First version: 30/04/2008 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #ifndef OSL_STATEMENT_H # define OSL_STATEMENT_H # include # include # include # include # include # include # include "body.h" # include "extensions/extbody.h" # if defined(__cplusplus) extern "C" { # endif /** * The osl_statement_t structure stores a list of statement. Each node * contains the useful informations for a given statement to process it * within a polyhedral framework. The order in the list may matter for naming * conventions (e.g. "S1" for the first statement in the list). */ struct osl_statement { osl_relation_p domain; /**< Iteration domain of the statement */ osl_relation_p scattering; /**< Scattering relation of the statement*/ osl_relation_list_p access; /**< Access information */ osl_generic_p extension; /**< A list of statement extensions */ void * usr; /**< A user-defined field, not touched AT ALL by the OpenScop Library. */ struct osl_statement * next; /**< Next statement in the linked list */ }; typedef struct osl_statement osl_statement_t; typedef struct osl_statement * osl_statement_p; /*+*************************************************************************** * Structure display function * *****************************************************************************/ void osl_statement_idump(FILE *, osl_statement_p, int); void osl_statement_dump(FILE *, osl_statement_p); void osl_statement_pprint(FILE *, osl_statement_p, osl_names_p); void osl_statement_print(FILE *, osl_statement_p); // SCoPLib Compatibility void osl_statement_pprint_scoplib(FILE *, osl_statement_p, osl_names_p); /***************************************************************************** * Reading function * *****************************************************************************/ osl_statement_p osl_statement_pread(FILE *, osl_interface_p, int); osl_statement_p osl_statement_read(FILE *); /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ osl_statement_p osl_statement_malloc(); void osl_statement_free(osl_statement_p); /*+*************************************************************************** * Processing functions * *****************************************************************************/ void osl_statement_add(osl_statement_p *, osl_statement_p); void osl_statement_compact(osl_statement_p, int); int osl_statement_number(osl_statement_p); osl_statement_p osl_statement_nclone(osl_statement_p, int); osl_statement_p osl_statement_clone(osl_statement_p); int osl_statement_equal(osl_statement_p, osl_statement_p); int osl_statement_integrity_check(osl_statement_p, int); int osl_statement_get_nb_iterators(osl_statement_p); void osl_statement_get_attributes(osl_statement_p, int *, int *, int *, int *, int *); osl_body_p osl_statement_get_body(osl_statement_p); # if defined(__cplusplus) } # endif #endif /* define OSL_STATEMENT_H */ cloog-0.18.4/osl/include/osl/macros.h0000644000175000017500000002310212413270135014276 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** macros.h ** **-----------------------------------------------------------------** ** First version: 30/04/2008 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #ifndef OSL_MACROS_H # define OSL_MACROS_H # include "util.h" # define OSL_DEBUG 0 // 1 for debug mode, 0 otherwise. # define OSL_URI_SCOP "OpenScop" # define OSL_PRECISION_ENV "OSL_PRECISION" # define OSL_PRECISION_ENV_SP "32" # define OSL_PRECISION_ENV_DP "64" # define OSL_PRECISION_ENV_MP "0" # define OSL_PRECISION_SP 32 # define OSL_PRECISION_DP 64 # define OSL_PRECISION_MP 0 # define OSL_FMT_SP "%4ld" # define OSL_FMT_DP "%4lld" # define OSL_FMT_MP "%4s" # define OSL_FMT_LENGTH 4 // Should be the same as FMT_*P. # define OSL_FMT_TXT_SP "%ld" # define OSL_FMT_TXT_DP "%lld" # define OSL_FMT_TXT_MP "%s" # define OSL_BACKEND_C 0 # define OSL_BACKEND_FORTRAN 1 # define OSL_UNDEFINED -1 # define OSL_MAX_STRING 2048 # define OSL_MIN_STRING 100 # define OSL_MAX_ARRAYS 128 # define OSL_TYPE_GENERIC 0 # define OSL_TYPE_STRING 1 # define OSL_TYPE_CONTEXT 2 # define OSL_TYPE_DOMAIN 3 # define OSL_TYPE_SCATTERING 4 # define OSL_TYPE_ACCESS 5 # define OSL_TYPE_READ 6 # define OSL_TYPE_WRITE 7 # define OSL_TYPE_MAY_WRITE 8 # define OSL_FAKE_ARRAY "fakearray" # define OSL_SYMBOL_TYPE_ITERATOR 1 # define OSL_SYMBOL_TYPE_PARAMETER 2 # define OSL_SYMBOL_TYPE_ARRAY 3 # define OSL_SYMBOL_TYPE_FUNCTION 4 # define OSL_STRING_UNDEFINED "UNDEFINED" # define OSL_STRING_CONTEXT "CONTEXT" # define OSL_STRING_DOMAIN "DOMAIN" # define OSL_STRING_SCATTERING "SCATTERING" # define OSL_STRING_READ "READ" # define OSL_STRING_WRITE "WRITE" # define OSL_STRING_MAY_WRITE "MAY_WRITE" /*+*************************************************************************** * UTILITY MACROS * *****************************************************************************/ # define OSL_coucou(n) \ do { \ int i = n +0; \ fprintf(stderr,"[osl] Coucou %d (%s).\n", i, __func__); \ } while (0) # define OSL_debug(msg) \ do { \ if (OSL_DEBUG) \ fprintf(stderr,"[osl] Debug: " msg " (%s).\n", __func__); \ } while (0) # define OSL_info(msg) \ do { \ fprintf(stderr,"[osl] Info: " msg " (%s).\n", __func__); \ } while (0) # define OSL_warning(msg) \ do { \ fprintf(stderr,"[osl] Warning: " msg " (%s).\n", __func__); \ } while (0) # define OSL_error(msg) \ do { \ fprintf(stderr,"[osl] Error: " msg " (%s).\n", __func__); \ exit(1); \ } while (0) # define OSL_overflow(msg) OSL_error(msg) # define OSL_malloc(ptr, type, size) \ do { \ if (((ptr) = (type)malloc(size)) == NULL) \ OSL_error("memory overflow"); \ } while (0) # define OSL_realloc(ptr, type, size) \ do { \ if (((ptr) = (type)realloc(ptr, size)) == NULL) \ OSL_error("memory overflow"); \ } while (0) # define OSL_strdup(destination, source) \ do { \ if (source != NULL) { \ if (((destination) = osl_util_strdup(source)) == NULL) \ OSL_error("memory overflow"); \ } \ else { \ destination = NULL; \ OSL_warning("strdup of a NULL string"); \ } \ } while (0) # define OSL_max(x,y) ((x) > (y)? (x) : (y)) # define OSL_min(x,y) ((x) < (y)? (x) : (y)) #endif /* define OSL_MACROS_H */ cloog-0.18.4/osl/include/osl/names.h0000644000175000017500000001477712413256474014151 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** extensions/names.h ** **-----------------------------------------------------------------** ** First version: 18/05/2011 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #ifndef OSL_NAMES_H # define OSL_NAMES_H # include # include # if defined(__cplusplus) extern "C" { # endif /** * The osl_names_t structure stores the various names (names of iterators, * parameters...) necessary to generate a code from the OpenScop data * structure. */ struct osl_names { osl_strings_p parameters; /**< Parameter names */ osl_strings_p iterators; /**< Iterator names */ osl_strings_p scatt_dims; /**< Scattering dimension names */ osl_strings_p local_dims; /**< Local dimension names */ osl_strings_p arrays; /**< Array names */ }; typedef struct osl_names osl_names_t; typedef struct osl_names * osl_names_p; /*+*************************************************************************** * Structure display function * *****************************************************************************/ void osl_names_idump(FILE *, osl_names_p, int); void osl_names_dump(FILE *, osl_names_p); /***************************************************************************** * Reading function * *****************************************************************************/ /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ osl_names_p osl_names_malloc(); void osl_names_free(osl_names_p); /*+*************************************************************************** * Processing functions * *****************************************************************************/ osl_names_p osl_names_clone(osl_names_p); osl_names_p osl_names_generate(char *, int, char *, int, char *, int, char *, int, char *, int); # if defined(__cplusplus) } # endif #endif /* define OSL_NAMES_H */ cloog-0.18.4/osl/include/osl/body.h0000644000175000017500000001572412413270135013762 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** body.h ** **-----------------------------------------------------------------** ** First version: 25/06/2011 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #ifndef OSL_BODY_H # define OSL_BODY_H # include # include # include # if defined(__cplusplus) extern "C" { # endif # define OSL_URI_BODY "body" /** * The osl_body_t structure stores a statement body in a textual form. * The complete original expression (directly copy-pasted from the original * code) is in the expression field while the textual forms of the original * iterators are in the iterators field. They may be used for substitutions * inside the expression. */ struct osl_body { osl_strings_p iterators; /**< Original iterators */ osl_strings_p expression; /**< Original statement expression */ }; typedef struct osl_body osl_body_t; typedef struct osl_body * osl_body_p; typedef struct osl_body const osl_const_body_t; typedef struct osl_body * const osl_body_const_p; typedef struct osl_body const * osl_const_body_p; typedef struct osl_body const * const osl_const_body_const_p; /*---------------------------------------------------------------------------+ | Structure display function | +---------------------------------------------------------------------------*/ void osl_body_idump(FILE *, osl_body_p, int); void osl_body_dump(FILE *, osl_body_p); char * osl_body_sprint(osl_body_p); void osl_body_print(FILE *, osl_body_p); // SCoPLib Compatibility void osl_body_print_scoplib(FILE * file, osl_body_p body); /***************************************************************************** * Reading function * *****************************************************************************/ osl_body_p osl_body_sread(char **); /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ osl_body_p osl_body_malloc(); void osl_body_free(osl_body_p); /*+*************************************************************************** * Processing functions * *****************************************************************************/ osl_body_p osl_body_clone(osl_body_p); int osl_body_equal(osl_body_p, osl_body_p); osl_interface_p osl_body_interface(); # if defined(__cplusplus) } # endif #endif /* define OSL_BODY_H */ cloog-0.18.4/osl/include/osl/strings.h0000644000175000017500000001723012413270135014510 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** strings.h ** **-----------------------------------------------------------------** ** First version: 13/07/2011 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #ifndef OSL_STRINGS_H # define OSL_STRINGS_H # include # include # if defined(__cplusplus) extern "C" { # endif # define OSL_URI_STRINGS "strings" /* The "strings" type is simply a NULL-terminated array of C character * strings, i.e. a char **. It is encapsulated into a structure to allow * its manipulation through a generic type. */ struct osl_strings { char ** string; /**< NULL-terminated array of character strings */ }; typedef struct osl_strings osl_strings_t; typedef struct osl_strings * osl_strings_p; typedef struct osl_strings const osl_const_strings_t; typedef struct osl_strings * const osl_strings_const_p; typedef struct osl_strings const * osl_const_strings_p; typedef struct osl_strings const * const osl_const_strings_const_p; /*+*************************************************************************** * Structure display function * *****************************************************************************/ void osl_strings_idump(FILE *, osl_strings_p, int); void osl_strings_dump(FILE *, osl_strings_p); char * osl_strings_sprint(osl_strings_p); void osl_strings_print(FILE *, osl_strings_p); /***************************************************************************** * Reading function * *****************************************************************************/ osl_strings_p osl_strings_sread(char **); osl_strings_p osl_strings_read(FILE *); /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ osl_strings_p osl_strings_malloc(); void osl_strings_free(osl_strings_p); /*+*************************************************************************** * Processing functions * *****************************************************************************/ osl_strings_p osl_strings_clone(osl_strings_p); void osl_strings_add(osl_strings_p, char const * const); size_t osl_strings_find(osl_strings_p, char const * const); int osl_strings_equal(osl_strings_p, osl_strings_p); size_t osl_strings_size(osl_const_strings_const_p); osl_strings_p osl_strings_encapsulate(char *); osl_interface_p osl_strings_interface(); osl_strings_p osl_strings_generate(char *, int); # if defined(__cplusplus) } # endif # if defined(__cplusplus) #include #include namespace osl { /** * @brief Convert osl_strings to std::vector * @param[in] s An osl_strings * @return the std::vector */ inline std::vector osl_strings_to_cpp(osl_const_strings_const_p s) { if (s != nullptr && s->string != nullptr) { return std::vector(s->string, s->string + osl_strings_size(s)); } else { return std::vector(); } } } # endif #endif /* define OSL_STRINGS_H */ cloog-0.18.4/osl/include/osl/scop.h.in0000644000175000017500000002024112413270135014364 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** scop.h ** **-----------------------------------------------------------------** ** First version: 30/04/2008 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ /*+**************************************************************************** * THIS FILE HAS BEEN AUTOMATICALLY GENERATED FROM scop.h.in BY configure * ******************************************************************************/ #ifndef OSL_SCOP_H # define OSL_SCOP_H # include # define OSL_RELEASE "@PACKAGE_VERSION@" # include # include # include # include # if defined(__cplusplus) extern "C" { # endif /** * The scop_t structure stores a list of scops. Each node stores the useful * information of a static control part of a program to process it within a * polyhedral framework. Parameter information may be strings of characters * (char *) when the type field is OSL_TYPE_STRING or a generic pointer * to anything else (void *) when the type field is OSL_TYPE_GENERIC. * The OpenScop library does not touch AT ALL generic information: printing, * copy etc. must be done externally. */ struct osl_scop { int version; /**< Version of the data structure */ char * language; /**< Target language (backend) */ osl_relation_p context; /**< Constraints on the SCoP parameters */ osl_generic_p parameters; /**< NULL-terminated array of parameters */ osl_statement_p statement; /**< Statement list of the SCoP */ osl_interface_p registry; /**< Registered extensions interfaces */ osl_generic_p extension; /**< List of extensions */ void * usr; /**< A user-defined field, not touched AT ALL by the OpenScop Library */ struct osl_scop * next; /**< Next statement in the linked list */ }; typedef struct osl_scop osl_scop_t; typedef struct osl_scop * osl_scop_p; /*+*************************************************************************** * Structure display function * *****************************************************************************/ void osl_scop_idump(FILE *, osl_scop_p, int); void osl_scop_dump(FILE *, osl_scop_p); void osl_scop_print(FILE *, osl_scop_p); // SCoPLib Compatibility void osl_scop_print_scoplib(FILE *, osl_scop_p); /***************************************************************************** * Reading function * *****************************************************************************/ osl_scop_p osl_scop_pread(FILE *, osl_interface_p, int); osl_scop_p osl_scop_read(FILE *); /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ osl_scop_p osl_scop_malloc(); void osl_scop_free(osl_scop_p); /*+*************************************************************************** * Processing functions * *****************************************************************************/ void osl_scop_add(osl_scop_p *, osl_scop_p); size_t osl_scop_number(osl_scop_p); osl_scop_p osl_scop_clone(osl_scop_p); int osl_scop_equal(osl_scop_p, osl_scop_p); int osl_scop_integrity_check(osl_scop_p); int osl_scop_check_compatible_scoplib(osl_scop_p); int osl_scop_get_nb_parameters(osl_scop_p); void osl_scop_register_extension(osl_scop_p, osl_interface_p); void osl_scop_get_attributes(osl_scop_p, int *, int *, int *, int *, int *); void osl_scop_normalize_scattering(osl_scop_p); osl_names_p osl_scop_names(osl_scop_p scop); # if defined(__cplusplus) } # endif #endif /* define OSL_SCOP_H */ cloog-0.18.4/osl/include/osl/relation_list.h0000644000175000017500000002031212413270135015662 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** relation_list.h ** **-----------------------------------------------------------------** ** First version: 08/10/2010 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #ifndef OSL_RELATION_LIST_H # define OSL_RELATION_LIST_H # include # include # if defined(__cplusplus) extern "C" { # endif /** * The osl_relation_list_t structure describes a (NULL-terminated * linked) list of relations. */ struct osl_relation_list { osl_relation_p elt; /**< An element of the list. */ struct osl_relation_list * next; /**< Pointer to the next element of the list.*/ }; typedef struct osl_relation_list osl_relation_list_t; typedef struct osl_relation_list * osl_relation_list_p; /*+*************************************************************************** * Structure display function * *****************************************************************************/ void osl_relation_list_idump(FILE *, osl_relation_list_p, int); void osl_relation_list_dump(FILE *, osl_relation_list_p); void osl_relation_list_pprint_elts(FILE *, osl_relation_list_p, osl_names_p); void osl_relation_list_pprint(FILE *, osl_relation_list_p, osl_names_p); void osl_relation_list_print(FILE *, osl_relation_list_p); // SCoPLib Compatibility void osl_relation_list_pprint_access_array_scoplib(FILE *, osl_relation_list_p, osl_names_p, int); /***************************************************************************** * Reading function * *****************************************************************************/ osl_relation_list_p osl_relation_list_pread(FILE *, int); osl_relation_list_p osl_relation_list_read(FILE *); /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ osl_relation_list_p osl_relation_list_malloc(); void osl_relation_list_free(osl_relation_list_p); /*+*************************************************************************** * Processing functions * *****************************************************************************/ osl_relation_list_p osl_relation_list_node(osl_relation_p); osl_relation_list_p osl_relation_list_clone(osl_relation_list_p); osl_relation_list_p osl_relation_list_concat(osl_relation_list_p, osl_relation_list_p); void osl_relation_list_add(osl_relation_list_p *, osl_relation_list_p); void osl_relation_list_push(osl_relation_list_p *, osl_relation_list_p); osl_relation_list_p osl_relation_list_pop(osl_relation_list_p *); void osl_relation_list_dup(osl_relation_list_p *); void osl_relation_list_drop(osl_relation_list_p *); void osl_relation_list_destroy(osl_relation_list_p *); int osl_relation_list_equal(osl_relation_list_p, osl_relation_list_p); int osl_relation_list_integrity_check(osl_relation_list_p, int, int, int, int); void osl_relation_list_set_type(osl_relation_list_p, int); osl_relation_list_p osl_relation_list_filter(osl_relation_list_p, int); size_t osl_relation_list_count(osl_relation_list_p); void osl_relation_list_get_attributes(osl_relation_list_p, int *, int *, int *, int *, int *); # if defined(__cplusplus) } # endif #endif /* define OSL_RELATION_LIST_H */ cloog-0.18.4/osl/include/osl/util.h0000644000175000017500000001317012413270135013773 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** util.h ** **-----------------------------------------------------------------** ** First version: 08/10/2010 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #ifndef OSL_UTIL_H # define OSL_UTIL_H # include # if defined(__cplusplus) extern "C" { # endif /*+*************************************************************************** * Utility functions * *****************************************************************************/ char * osl_util_skip_blank_and_comments(FILE *, char *); void osl_util_sskip_blank_and_comments(char **); int osl_util_read_int(FILE *, char **); char * osl_util_read_string(FILE *, char **); char * osl_util_read_line(FILE *, char **); char * osl_util_read_tag(FILE *, char **); char * osl_util_read_tail(FILE *); char * osl_util_read_uptoflag(FILE *, char **, char *); char * osl_util_read_uptotag(FILE *, char **, char *); char * osl_util_read_uptoendtag(FILE *, char **, char *); char * osl_util_tag_content(char *, char *); void osl_util_safe_strcat(char **, char *, int *); char * osl_util_strdup(char const *); int osl_util_get_precision(); void osl_util_print_provided(FILE *, int, char *); char * osl_util_identifier_substitution(char *, char **); # if defined(__cplusplus) } # endif #endif /* define OSL_UTIL_H */ cloog-0.18.4/osl/aclocal.m40000644000175000017500000012254012554424213012273 00000000000000# generated automatically by aclocal 1.14.1 -*- Autoconf -*- # Copyright (C) 1996-2013 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_CONFIG_MACRO_DIRS], [m4_defun([_AM_CONFIG_MACRO_DIRS], [])m4_defun([AC_CONFIG_MACRO_DIRS], [_AM_CONFIG_MACRO_DIRS($@)])]) m4_ifndef([AC_AUTOCONF_VERSION], [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl m4_if(m4_defn([AC_AUTOCONF_VERSION]), [2.69],, [m4_warning([this file was generated for autoconf 2.69. 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-2013 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. # 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.14' 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.14.1], [], [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.14.1])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-2013 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. # 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-2013 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. # AM_CONDITIONAL(NAME, SHELL-CONDITION) # ------------------------------------- # Define a conditional. AC_DEFUN([AM_CONDITIONAL], [AC_PREREQ([2.52])dnl m4_if([$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-2013 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. # 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", "OBJC", "OBJCXX", "UPC", or "GJC". # 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 m4_if([$1], [CC], [depcc="$CC" am_compiler_list=], [$1], [CXX], [depcc="$CXX" am_compiler_list=], [$1], [OBJC], [depcc="$OBJC" am_compiler_list='gcc3 gcc'], [$1], [OBJCXX], [depcc="$OBJCXX" 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 10 /bin/sh. echo '/* dummy */' > 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], [dnl AS_HELP_STRING( [--enable-dependency-tracking], [do not reject slow dependency extractors]) AS_HELP_STRING( [--disable-dependency-tracking], [speeds up one-time build])]) 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-2013 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. # _AM_OUTPUT_DEPENDENCY_COMMANDS # ------------------------------ AC_DEFUN([_AM_OUTPUT_DEPENDENCY_COMMANDS], [{ # Older Autoconf 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"` # 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'`; 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-2013 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 macro actually does too much. Some checks are only needed if # your package does certain things. But this isn't really a big deal. dnl Redefine AC_PROG_CC to automatically invoke _AM_PROG_CC_C_O. m4_define([AC_PROG_CC], m4_defn([AC_PROG_CC]) [_AM_PROG_CC_C_O ]) # 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.65])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], [AC_DIAGNOSE([obsolete], [$0: two- and three-arguments forms are deprecated.]) 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], [ok]):m4_ifdef([AC_PACKAGE_VERSION], [ok]), [ok:ok],, [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([AC_PROG_MKDIR_P])dnl # For better backward compatibility. To be removed once Automake 1.9.x # dies out for good. For more background, see: # # AC_SUBST([mkdir_p], ['$(MKDIR_P)']) # 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])], [m4_define([AC_PROG_CC], m4_defn([AC_PROG_CC])[_AM_DEPENDENCIES([CC])])])dnl AC_PROVIDE_IFELSE([AC_PROG_CXX], [_AM_DEPENDENCIES([CXX])], [m4_define([AC_PROG_CXX], m4_defn([AC_PROG_CXX])[_AM_DEPENDENCIES([CXX])])])dnl AC_PROVIDE_IFELSE([AC_PROG_OBJC], [_AM_DEPENDENCIES([OBJC])], [m4_define([AC_PROG_OBJC], m4_defn([AC_PROG_OBJC])[_AM_DEPENDENCIES([OBJC])])])dnl AC_PROVIDE_IFELSE([AC_PROG_OBJCXX], [_AM_DEPENDENCIES([OBJCXX])], [m4_define([AC_PROG_OBJCXX], m4_defn([AC_PROG_OBJCXX])[_AM_DEPENDENCIES([OBJCXX])])])dnl ]) AC_REQUIRE([AM_SILENT_RULES])dnl dnl The testsuite driver may need to know about EXEEXT, so add the dnl 'am__EXEEXT' conditional if _AM_COMPILER_EXEEXT was seen. This dnl macro 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 # POSIX will say in a future version that running "rm -f" with no argument # is OK; and we want to be able to make that assumption in our Makefile # recipes. So use an aggressive probe to check that the usage we want is # actually supported "in the wild" to an acceptable degree. # See automake bug#10828. # To make any issue more visible, cause the running configure to be aborted # by default if the 'rm' program in use doesn't match our expectations; the # user can still override this though. if rm -f && rm -fr && rm -rf; then : OK; else cat >&2 <<'END' Oops! Your 'rm' program seems unable to run without file operands specified on the command line, even when the '-f' option is present. This is contrary to the behaviour of most rm programs out there, and not conforming with the upcoming POSIX standard: Please tell bug-automake@gnu.org about your system, including the value of your $PATH and any error possibly output before this message. This can help us improve future automake versions. END if test x"$ACCEPT_INFERIOR_RM_PROGRAM" = x"yes"; then echo 'Configuration will proceed anyway, since you have set the' >&2 echo 'ACCEPT_INFERIOR_RM_PROGRAM variable to "yes"' >&2 echo >&2 else cat >&2 <<'END' Aborting the configuration process, to ensure you take notice of the issue. You can download and install GNU coreutils to get an 'rm' implementation that behaves properly: . If you want to complete the configuration process using your problematic 'rm' anyway, export the environment variable ACCEPT_INFERIOR_RM_PROGRAM to "yes", and re-run configure. END AC_MSG_ERROR([Your 'rm' program is bad, sorry.]) fi fi]) 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-2013 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. # 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-2013 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. # 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-2013 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. # 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-2013 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. # 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 is modern enough. # If it is, 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 --is-lightweight"; then am_missing_run="$MISSING " else am_missing_run= AC_MSG_WARN(['missing' script is too old or missing]) fi ]) # Helper functions for option handling. -*- Autoconf -*- # Copyright (C) 2001-2013 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. # _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])]) # Copyright (C) 1999-2013 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. # _AM_PROG_CC_C_O # --------------- # Like AC_PROG_CC_C_O, but changed for automake. We rewrite AC_PROG_CC # to automatically call this. AC_DEFUN([_AM_PROG_CC_C_O], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl AC_REQUIRE_AUX_FILE([compile])dnl AC_LANG_PUSH([C])dnl AC_CACHE_CHECK( [whether $CC understands -c and -o together], [am_cv_prog_cc_c_o], [AC_LANG_CONFTEST([AC_LANG_PROGRAM([])]) # Make sure it works both with $CC and with simple cc. # Following AC_PROG_CC_C_O, we do the test twice because some # compilers refuse to overwrite an existing .o file with -o, # though they will create one. am_cv_prog_cc_c_o=yes for am_i in 1 2; do if AM_RUN_LOG([$CC -c conftest.$ac_ext -o conftest2.$ac_objext]) \ && test -f conftest2.$ac_objext; then : OK else am_cv_prog_cc_c_o=no break fi done rm -f core conftest* unset am_i]) if test "$am_cv_prog_cc_c_o" != yes; then # Losing compiler, so override with the script. # FIXME: It is wrong to rewrite CC. # But if we don't then we get into trouble of one sort or another. # A longer-term fix would be to have automake use am__CC in this case, # and then we could set am__CC="\$(top_srcdir)/compile \$(CC)" CC="$am_aux_dir/compile $CC" fi AC_LANG_POP([C])]) # For backward compatibility. AC_DEFUN_ONCE([AM_PROG_CC_C_O], [AC_REQUIRE([AC_PROG_CC])]) # Copyright (C) 2001-2013 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. # AM_RUN_LOG(COMMAND) # ------------------- # Run COMMAND, save the exit status in ac_status, and log it. # (This has been adapted from Autoconf's _AC_RUN_LOG macro.) AC_DEFUN([AM_RUN_LOG], [{ echo "$as_me:$LINENO: $1" >&AS_MESSAGE_LOG_FD ($1) >&AS_MESSAGE_LOG_FD 2>&AS_MESSAGE_LOG_FD ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&AS_MESSAGE_LOG_FD (exit $ac_status); }]) # Check to make sure that the build environment is sane. -*- Autoconf -*- # Copyright (C) 1996-2013 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. # AM_SANITY_CHECK # --------------- AC_DEFUN([AM_SANITY_CHECK], [AC_MSG_CHECKING([whether build environment is sane]) # 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 ( am_has_slept=no for am_try in 1 2; do echo "timestamp, slept: $am_has_slept" > conftest.file 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 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 if test "$[2]" = conftest.file || test $am_try -eq 2; then break fi # Just in case. sleep 1 am_has_slept=yes done 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]) # If we didn't sleep, we still need to ensure time stamps of config.status and # generated files are strictly newer. am_sleep_pid= if grep 'slept: no' conftest.file >/dev/null 2>&1; then ( sleep 1 ) & am_sleep_pid=$! fi AC_CONFIG_COMMANDS_PRE( [AC_MSG_CHECKING([that generated files are newer than configure]) if test -n "$am_sleep_pid"; then # Hide warnings about reused PIDs. wait $am_sleep_pid 2>/dev/null fi AC_MSG_RESULT([done])]) rm -f conftest.file ]) # Copyright (C) 2009-2013 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. # 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], [dnl AS_HELP_STRING( [--enable-silent-rules], [less verbose build output (undo: "make V=1")]) AS_HELP_STRING( [--disable-silent-rules], [verbose build output (undo: "make V=0")])dnl ]) 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-2013 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. # 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-2013 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. # _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-2013 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. # _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}']) # We'll loop over all known methods to create a tar archive until one works. _am_tools='gnutar m4_if([$1], [ustar], [plaintar]) pax cpio none' m4_if([$1], [v7], [am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -'], [m4_case([$1], [ustar], [# The POSIX 1988 'ustar' format is defined with fixed-size fields. # There is notably a 21 bits limit for the UID and the GID. In fact, # the 'pax' utility can hang on bigger UID/GID (see automake bug#8343 # and bug#13588). am_max_uid=2097151 # 2^21 - 1 am_max_gid=$am_max_uid # The $UID and $GID variables are not portable, so we need to resort # to the POSIX-mandated id(1) utility. Errors in the 'id' calls # below are definitely unexpected, so allow the users to see them # (that is, avoid stderr redirection). am_uid=`id -u || echo unknown` am_gid=`id -g || echo unknown` AC_MSG_CHECKING([whether UID '$am_uid' is supported by ustar format]) if test $am_uid -le $am_max_uid; then AC_MSG_RESULT([yes]) else AC_MSG_RESULT([no]) _am_tools=none fi AC_MSG_CHECKING([whether GID '$am_gid' is supported by ustar format]) if test $am_gid -le $am_max_gid; then AC_MSG_RESULT([yes]) else AC_MSG_RESULT([no]) _am_tools=none fi], [pax], [], [m4_fatal([Unknown tar format])]) AC_MSG_CHECKING([how to create a $1 tar archive]) # Go ahead even if we have the value already cached. We do so because we # need to set the values for the 'am__tar' and 'am__untar' variables. _am_tools=${am_cv_prog_tar_$1-$_am_tools} 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_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]) cloog-0.18.4/osl/tests/0000755000175000017500000000000012555417256011663 500000000000000cloog-0.18.4/osl/tests/polynom.scop0000644000175000017500000000731512413256474014170 00000000000000# # <| # A # /.\ # <| [""M# # A | # Clan McCloog Castle # /.\ [""M# [Generated by the OpenScop Library 0.3.0 64 bits] # [""M# | # U"U#U # | # | # \ .:/ # | # | #___| # # | "--' .-" # |"-"-"-"-"-#-#-## # | # ## ###### # \ .::::'/ # \ ::::'/ # :8a| # # ## # ::88a ### # ::::888a 8a ##::. # ::::::888a88a[]:::: # :::::::::SUNDOGa8a::::. .. # :::::8::::888:Y8888:::::::::... #::':::88::::888::Y88a______________________________________________________ #:: ::::88a::::88a:Y88a __---__-- __ #' .: ::Y88a:::::8a:Y88a __----_-- -------_-__ # :' ::::8P::::::::::88aa. _ _- -- --_ --- __ --- __-- #.:: :::::::::::::::::::Y88as88a...s88aa. # =============================================== Global # Language C # Context CONTEXT 1 3 0 0 0 1 # e/i N 1 1 1 3 # Parameter names are provided 1 # Parameter names N # Number of statements 1 # =============================================== Statement 1 # Number of relations describing the statement 6 # ---------------------------------------------- 1.1 Domain DOMAIN 2 4 5 2 0 0 1 # e/i i j N 1 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 5 5 2 0 0 1 # e/i i j N 1 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 1 0 -1 1 -1 ## -j+N-1 >= 0 # ---------------------------------------------- 1.2 Scattering SCATTERING 5 10 5 2 0 1 # e/i s1 s2 s3 s4 s5 i j N 1 0 -1 0 0 0 0 0 0 0 0 ## 0 0 0 -1 0 0 0 1 0 0 0 ## i 0 0 0 -1 0 0 0 0 0 0 ## 0 0 0 0 0 -1 0 0 1 0 0 ## j 0 0 0 0 0 -1 0 0 0 0 ## 0 # ---------------------------------------------- 1.3 Access READ 2 7 2 2 0 1 # e/i Arr [1] i j N 1 0 -1 0 0 0 0 1 ## C[i+j] 0 0 -1 1 1 0 0 ## READ 2 7 2 2 0 1 # e/i Arr [1] i j N 1 0 -1 0 0 0 0 2 ## A[i] 0 0 -1 1 0 0 0 ## READ 2 7 2 2 0 1 # e/i Arr [1] i j N 1 0 -1 0 0 0 0 3 ## B[j] 0 0 -1 0 1 0 0 ## WRITE 2 7 2 2 0 1 # e/i Arr [1] i j N 1 0 -1 0 0 0 0 1 ## C[i+j] 0 0 -1 1 1 0 0 ## # ---------------------------------------------- 1.4 Body # Statement body is provided 1 # Number of original iterators 2 # Original iterator names i j # Statement body C[i+j]+=A[i]*B[j]; # =============================================== Options 3 1 C 2 A 3 B hello, world HELLO WORLD I SAID cloog-0.18.4/osl/tests/test_just_access.scop0000644000175000017500000000122112413256474016026 00000000000000 # =============================================== Global # Language C # Context CONTEXT 0 2 0 0 0 0 # Parameter names are not provided 0 # One statement 1 # =============================================== Statement 1 # Number of relations describing the statement 1 # ---------------------------------------------- 1.1 Domain # NULL Domain # ---------------------------------------------- 1.2 Scattering # NULL Scattering # ---------------------------------------------- 1.3 Access WRITE 1 3 1 0 0 0 # e/i Arr 1 0 -1 1 # ---------------------------------------------- 1.4 Body # Statement body is not provided 0 cloog-0.18.4/osl/tests/test_just_domain.scop0000644000175000017500000000117112413256474016040 00000000000000 # =============================================== Global # Language C # Context CONTEXT 0 2 0 0 0 0 # Parameter names are not provided 0 # One statement 1 # =============================================== Statement 1 # Number of relations describing the statement 1 # ---------------------------------------------- 1.1 Domain DOMAIN 0 2 0 0 0 0 # ---------------------------------------------- 1.2 Scattering # NULL Scattering # ---------------------------------------------- 1.3 Access # NULL Access # ---------------------------------------------- 1.4 Body # Statement body is not provided 0 cloog-0.18.4/osl/tests/Makefile.am0000644000175000017500000001444312413270135013627 00000000000000# # /*+------------------------------------------------------------------** # ** OpenScop Library ** # **------------------------------------------------------------------** # ** makefile.am ** # **------------------------------------------------------------------** # ** First version: 01/10/2010 ** # **------------------------------------------------------------------** # # # *************************************************************************** # * OpenScop: Structures and formats for polyhedral tools to talk together * # *************************************************************************** # * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * # * / / / // // // // / / / // // / / // / /|,_, * # * / / / // // // // / / / // // / / // / / / /\ * # * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * # * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * # * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * # * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * # * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * # * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * # * | I | | | | e | | | | | | | | | | | | | \ \ \ * # * | T | | | | | | | | | | | | | | | | | \ \ \ * # * | E | | | | | | | | | | | | | | | | | \ \ \ * # * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * # * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * # * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * # * * # * Copyright (C) 2008 University Paris-Sud 11 and INRIA * # * * # * (3-clause BSD license) * # * Redistribution and use in source and binary forms, with or without * # * modification, are permitted provided that the following conditions * # * are met: * # * * # * 1. Redistributions of source code must retain the above copyright * # * notice, this list of conditions and the following disclaimer. * # * 2. Redistributions in binary form must reproduce the above copyright * # * notice, this list of conditions and the following disclaimer in the * # * documentation and/or other materials provided with the distribution. * # * 3. The name of the author may not be used to endorse or promote * # * products derived from this software without specific prior written * # * permission. * # * * # * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * # * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED * # * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE * # * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, * # * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES * # * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR * # * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * # * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, * # * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING * # * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE * # * POSSIBILITY OF SUCH DAMAGE. * # * * # * OpenScop Library, a library to manipulate OpenScop formats and data * # * structures. Written by: * # * Cedric Bastoul and * # * Louis-Noel Pouchet * # * * # ***************************************************************************/ # # Makefile.am (or makefile if generated) of the OpenScop Library. # Makefile.am is not a makefile, you must run the 'autogen.sh' THEN the # configure shellscript to generate the Makefile thanks to this file. ############################################################################# SUBDIRS = ############################################################################# MAINTAINERCLEANFILES = Makefile.in ############################################################################# noinst_PROGRAMS = osl_test osl_int osl_pluto_unroll osl_relation_set_precision TESTS = osl_test osl_int osl_pluto_unroll osl_relation_set_precision osl_test_CPPFLAGS = -I$(top_builddir)/include -I$(top_srcdir)/include -static osl_int_CPPFLAGS = -I$(top_builddir)/include -I$(top_srcdir)/include -static osl_pluto_unroll_CPPFLAGS = -I$(top_builddir)/include -I$(top_srcdir)/include -static osl_relation_set_precision_CPPFLAGS = -I$(top_builddir)/include -I$(top_srcdir)/include -static osl_test_LDADD = ../libosl.la osl_int_LDADD = ../libosl.la osl_pluto_unroll_LDADD = ../libosl.la osl_relation_set_precision_LDADD = ../libosl.la osl_test_SOURCES = \ osl_test.c \ polynom.scop \ test_empty_statement.scop \ test_just_access.scop \ test_just_body.scop \ test_just_extbody.scop \ test_just_domain.scop \ test_just_scattering.scop \ test_coordinates.scop \ test_matmult.scop \ test_clay.scop \ test_no_statement.scop \ test_scop_list.scop osl_int_SOURCES = osl_int.c osl_pluto_unroll_SOURCES = osl_pluto_unroll.c osl_relation_set_precision_SOURCES = osl_relation_set_precision.c MAINTAINERCLEANFILE = ../autoconf/texinfo.tex cloog-0.18.4/osl/tests/osl_test.c0000644000175000017500000002354712413270135013600 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** test.c ** **-----------------------------------------------------------------** ** First version: 01/10/2010 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #include #include #include #include #include #include #include //#define FORK // Comment that if you want only one process // (best for debugging with valgrind but bad // for make check since any error will // stop the job). #define TEST_DIR "." // Directory to scan for OpenScop files #define TEST_SUFFIX ".scop" // Suffix of OpenScop files /** * test_file function * This function tests an onpenscop file. A test has six steps: * 1. read the file to raise the data up to OpenScop data structures, * 2. clone the data structures, * 3. compare the clone and the original one, * 4. dump the data structures to a new OpenScop file, * 5. read the generated file, * 6. compare the data structures. * If everything went well, the data structure of the two scops are the same. * \param input_name The name of the input file. * \param verbose Verbose option (1 to set, 0 not to set). * \return 1 if the test is successful, 0 otherwise. */ int test_file(char* input_name, int verbose) { int cloning = 0; int dumping = 0; int equal = 0; FILE* input_file; FILE* output_file; osl_scop_p input_scop; osl_scop_p output_scop; osl_scop_p cloned_scop; printf("\nTesting file %s... \n", input_name); // PART I. Raise from file. input_file = fopen(input_name, "r"); if (input_file == NULL) { fflush(stdout); fprintf(stderr, "\nError: unable to open file %s\n", input_name); exit(2); } input_scop = osl_scop_read(input_file); fclose(input_file); if (verbose) printf("- reading file succeeded\n"); // PART II. Clone and test. cloned_scop = osl_scop_clone(input_scop); // Compare the two scops. if ((cloning = osl_scop_equal(input_scop, cloned_scop))) printf("- cloning succeeded\n"); else printf("- cloning failed\n"); // PART III. Dump to file and test. output_file = tmpfile(); if (output_file == NULL) OSL_error("cannot open temporary output file for writing"); //osl_scop_dump(stdout, input_scop); //osl_scop_print(stdout, input_scop); osl_scop_print(output_file, input_scop); // Raise the generated file to data structures. rewind(output_file); output_scop = osl_scop_read(output_file); //osl_scop_dump(stdout, output_scop); fclose(output_file); if (verbose) { printf("\n\n*************************************************\n\n"); osl_scop_dump(stdout, output_scop); osl_scop_print(stdout, output_scop); printf("\n*************************************************\n\n"); } // Compare the two scops. if ((dumping = osl_scop_equal(input_scop, output_scop))) printf("- dumping succeeded\n"); else printf("- dumping failed\n"); // PART IV. Report. if ((equal = (cloning + dumping > 1) ? 1 : 0)) printf("Success :-)\n"); else printf("Failure :-(\n"); // Save the planet. osl_scop_free(input_scop); osl_scop_free(cloned_scop); osl_scop_free(output_scop); return equal; } /** * OpenScop test program. * Usage: osl_test [-v] [osl_file] * This program scans a directory for openscop files and test each of them. * Optionnally the user can provide a file name to check this file only. A * verbose option is also provided to output more information during tests. */ int main(int argc, char* argv[]) { int total = 0; // Total number of tests. int success = 0; // Number of successes. int verbose = 0; // 1 if the verbose option is set, 0 otherwise. int dirtest = 1; // 1 if we check a whole directory, 0 for a single file. int fileidx = 0; // Index of the file to check in argv (0 if none). int d_namlen; int suffix_length; DIR * dir; struct dirent * dp; // Process the command line information if (((argc > 1) && (!strcmp(argv[1], "-v"))) || ((argc > 2) && (!strcmp(argv[2], "-v")))) verbose = 1; if ((argc > 3) || ((argc == 3) && (!verbose))) { fprintf(stderr, "usage: osl_test [-v] [osl_file]\n"); exit(1); } if ((argc - verbose) > 1) { dirtest = 0; fileidx = (!strcmp(argv[1], "-v")) ? 2 : 1; } // Proceed with the test(s), either directory or single file if (dirtest) { suffix_length = strlen(TEST_SUFFIX); // For each file in the directory to check... dir = opendir(TEST_DIR); while ((dp = readdir(dir)) != NULL) { d_namlen = strlen(dp->d_name); // If the file has the convenient suffix... if ((d_namlen > suffix_length) && (!strcmp(dp->d_name+(d_namlen-suffix_length), TEST_SUFFIX))) { // Test it ! #ifdef FORK int report; if (!fork()) exit(test_file(dp->d_name, verbose) ? 0 : 1); wait(&report); if (!WEXITSTATUS(report)) success++; #else success += test_file(dp->d_name, verbose); #endif total++; } } closedir(dir); } else { success = test_file(argv[fileidx], verbose); total++; } printf("\n +-----------------------+\n"); printf(" | OpenScop Test Summary |\n"); printf(" |-----------------------|\n"); printf(" | total %4d |\n", total); printf(" | success(es) %4d |\n", success); printf(" | failure(s) %4d |\n", total - success); printf(" +-----------------------+\n\n"); // Return 0 if all tests were successful, 1 otherwise. if (total - success) return 1; else return 0; } cloog-0.18.4/osl/tests/osl_pluto_unroll.c0000644000175000017500000001507112413270135015350 00000000000000// Copyright © 2014 Inria, Written by Lénaïc Bagnères, lenaic.bagneres@inria.fr // (3-clause BSD license) // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions // are met: // // 1. Redistributions of source code must retain the above copyright notice, // this list of conditions and the following disclaimer. // 2. Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // 3. The name of the author may not be used to endorse or promote products // derived from this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR // IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES // OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. // IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, // INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT // NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF // THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. #include #include #include int main(int argc, char** argv) { if (argc > 1) { printf("argv are ignored\n"); } int nb_fail = 0; osl_pluto_unroll_p p0 = NULL; osl_pluto_unroll_p p1 = NULL; osl_pluto_unroll_p pc = NULL; // Free without malloc printf("// Free without malloc\n"); osl_pluto_unroll_p p = NULL; osl_pluto_unroll_free(p); if (p != NULL) { nb_fail++; } printf("\n"); // Malloc and free printf("// Malloc and free\n"); p = osl_pluto_unroll_malloc(); osl_pluto_unroll_dump(stdout, p); { char * s = osl_pluto_unroll_sprint(p); printf("%s\n", s); free(s); s = NULL; } osl_pluto_unroll_free(p); p = NULL; printf("\n"); // Malloc, malloc and free printf("// Malloc, malloc and free\n"); p = osl_pluto_unroll_malloc(); p->next = osl_pluto_unroll_malloc(); osl_pluto_unroll_dump(stdout, p); { char * s = osl_pluto_unroll_sprint(p); printf("%s\n", s); free(s); s = NULL; } osl_pluto_unroll_free(p); p = NULL; printf("\n"); // osl_pluto_unroll_fill printf("// osl_pluto_unroll_fill\n"); p = osl_pluto_unroll_malloc(); osl_pluto_unroll_fill(p, "iterator_name_0", true, 4); p->next = osl_pluto_unroll_malloc(); osl_pluto_unroll_fill(p->next, "iterator_name_1", false, 4); osl_pluto_unroll_dump(stdout, p); { char * s = osl_pluto_unroll_sprint(p); printf("%s\n", s); free(s); s = NULL; } osl_pluto_unroll_free(p); p = NULL; printf("\n"); // osl_pluto_unroll_fill with NULL printf("// osl_pluto_unroll_fill with NULL\n"); p = osl_pluto_unroll_malloc(); osl_pluto_unroll_fill(p, NULL, true, 4); p->next = osl_pluto_unroll_malloc(); osl_pluto_unroll_fill(p->next, "iterator_name_1", false, 4); osl_pluto_unroll_dump(stdout, p); { char * s = osl_pluto_unroll_sprint(p); printf("%s\n", s); free(s); s = NULL; } osl_pluto_unroll_free(p); p = NULL; printf("\n"); // != printf("// !=\n"); p0 = osl_pluto_unroll_malloc(); p0->next = osl_pluto_unroll_malloc(); p0->next->next = osl_pluto_unroll_malloc(); p1 = osl_pluto_unroll_malloc(); p1->next = osl_pluto_unroll_malloc(); if (osl_pluto_unroll_equal(p0, p1) == 1) { nb_fail++; } if (osl_pluto_unroll_equal(p0, p0) == 0) { nb_fail++; } if (osl_pluto_unroll_equal(p1, p1) == 0) { nb_fail++; } osl_pluto_unroll_free(p0); p0 = NULL; osl_pluto_unroll_free(p1); p1 = NULL; printf("\n"); // == printf("// ==\n"); p0 = osl_pluto_unroll_malloc(); p1 = osl_pluto_unroll_malloc(); if (osl_pluto_unroll_equal(p0, p1) == 0) { nb_fail++; } if (osl_pluto_unroll_equal(p1, p0) == 0) { nb_fail++; } p0->next = osl_pluto_unroll_malloc(); p1->next = osl_pluto_unroll_malloc(); if (osl_pluto_unroll_equal(p0, p1) == 0) { nb_fail++; } if (osl_pluto_unroll_equal(p1, p0) == 0) { nb_fail++; } osl_pluto_unroll_fill(p0->next, "iterator_name_1", false, 4); if (osl_pluto_unroll_equal(p0, p1) == 1) { nb_fail++; } osl_pluto_unroll_fill(p1->next, "iterator_name_1", false, 4); if (osl_pluto_unroll_equal(p0, p1) == 0) { nb_fail++; } osl_pluto_unroll_fill(p0->next, "iterator_name_2", false, 4); if (osl_pluto_unroll_equal(p0, p1) == 1) { nb_fail++; } osl_pluto_unroll_fill(p1->next, "iterator_name_2", false, 4); if (osl_pluto_unroll_equal(p0, p1) == 0) { nb_fail++; } osl_pluto_unroll_fill(p1->next, "iterator_name_2", false, 8); if (osl_pluto_unroll_equal(p0, p1) == 1) { nb_fail++; } osl_pluto_unroll_fill(p0->next, "iterator_name_2", false, 8); if (osl_pluto_unroll_equal(p0, p1) == 0) { nb_fail++; } osl_pluto_unroll_fill(p0->next, "iterator_name_2", true, 8); if (osl_pluto_unroll_equal(p0, p1) == 1) { nb_fail++; } osl_pluto_unroll_free(p0); p0 = NULL; osl_pluto_unroll_free(p1); p1 = NULL; printf("\n"); // Clone NULL printf("// Clone NULL\n"); pc = osl_pluto_unroll_clone(p); printf("\n"); // Clone printf("// Clone\n"); p = osl_pluto_unroll_malloc(); osl_pluto_unroll_fill(p, "iterator_name_0", true, 4); p->next = osl_pluto_unroll_malloc(); p->next->next = osl_pluto_unroll_malloc(); osl_pluto_unroll_fill(p->next->next, "iterator_name_2", false, 2); pc = osl_pluto_unroll_clone(p); osl_pluto_unroll_dump(stdout, p); osl_pluto_unroll_dump(stdout, pc); if (osl_pluto_unroll_equal(p, pc) == 0) { nb_fail++; } osl_pluto_unroll_free(p); p = NULL; osl_pluto_unroll_free(pc); pc = NULL; printf("\n"); // osl_pluto_unroll_sread printf("// osl_pluto_unroll_sread\n"); p = osl_pluto_unroll_malloc(); osl_pluto_unroll_fill(p, "iterator_name_0", true, 4); p->next = osl_pluto_unroll_malloc(); osl_pluto_unroll_fill(p->next, "iterator_name_1", false, 4); osl_pluto_unroll_dump(stdout, p); { char * s = osl_pluto_unroll_sprint(p); char * f = s; pc = osl_pluto_unroll_sread(&s); free(f); f = NULL; s = NULL; } osl_pluto_unroll_dump(stdout, pc); if (osl_pluto_unroll_equal(p, pc) == 0) { nb_fail++; } osl_pluto_unroll_free(p); p = NULL; osl_pluto_unroll_free(pc); pc = NULL; printf("\n"); printf("%s ", argv[0]); printf("fails = %d\n", nb_fail); printf("\n"); return nb_fail; } cloog-0.18.4/osl/tests/Makefile.in0000644000175000017500000014776312554424237013666 00000000000000# Makefile.in generated by automake 1.14.1 from Makefile.am. # @configure_input@ # Copyright (C) 1994-2013 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@ # # /*+------------------------------------------------------------------** # ** OpenScop Library ** # **------------------------------------------------------------------** # ** makefile.am ** # **------------------------------------------------------------------** # ** First version: 01/10/2010 ** # **------------------------------------------------------------------** # # # *************************************************************************** # * OpenScop: Structures and formats for polyhedral tools to talk together * # *************************************************************************** # * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * # * / / / // // // // / / / // // / / // / /|,_, * # * / / / // // // // / / / // // / / // / / / /\ * # * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * # * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * # * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * # * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * # * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * # * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * # * | I | | | | e | | | | | | | | | | | | | \ \ \ * # * | T | | | | | | | | | | | | | | | | | \ \ \ * # * | E | | | | | | | | | | | | | | | | | \ \ \ * # * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * # * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * # * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * # * * # * Copyright (C) 2008 University Paris-Sud 11 and INRIA * # * * # * (3-clause BSD license) * # * Redistribution and use in source and binary forms, with or without * # * modification, are permitted provided that the following conditions * # * are met: * # * * # * 1. Redistributions of source code must retain the above copyright * # * notice, this list of conditions and the following disclaimer. * # * 2. Redistributions in binary form must reproduce the above copyright * # * notice, this list of conditions and the following disclaimer in the * # * documentation and/or other materials provided with the distribution. * # * 3. The name of the author may not be used to endorse or promote * # * products derived from this software without specific prior written * # * permission. * # * * # * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * # * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED * # * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE * # * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, * # * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES * # * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR * # * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * # * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, * # * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING * # * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE * # * POSSIBILITY OF SUCH DAMAGE. * # * * # * OpenScop Library, a library to manipulate OpenScop formats and data * # * structures. Written by: * # * Cedric Bastoul and * # * Louis-Noel Pouchet * # * * # ***************************************************************************/ # # Makefile.am (or makefile if generated) of the OpenScop Library. # Makefile.am is not a makefile, you must run the 'autogen.sh' THEN the # configure shellscript to generate the Makefile thanks to this file. VPATH = @srcdir@ am__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)' am__make_running_with_option = \ case $${target_option-} in \ ?) ;; \ *) echo "am__make_running_with_option: internal error: invalid" \ "target option '$${target_option-}' specified" >&2; \ exit 1;; \ esac; \ has_opt=no; \ sane_makeflags=$$MAKEFLAGS; \ if $(am__is_gnu_make); then \ sane_makeflags=$$MFLAGS; \ else \ case $$MAKEFLAGS in \ *\\[\ \ ]*) \ bs=\\; \ sane_makeflags=`printf '%s\n' "$$MAKEFLAGS" \ | sed "s/$$bs$$bs[$$bs $$bs ]*//g"`;; \ esac; \ fi; \ skip_next=no; \ strip_trailopt () \ { \ flg=`printf '%s\n' "$$flg" | sed "s/$$1.*$$//"`; \ }; \ for flg in $$sane_makeflags; do \ test $$skip_next = yes && { skip_next=no; continue; }; \ case $$flg in \ *=*|--*) continue;; \ -*I) strip_trailopt 'I'; skip_next=yes;; \ -*I?*) strip_trailopt 'I';; \ -*O) strip_trailopt 'O'; skip_next=yes;; \ -*O?*) strip_trailopt 'O';; \ -*l) strip_trailopt 'l'; skip_next=yes;; \ -*l?*) strip_trailopt 'l';; \ -[dEDm]) skip_next=yes;; \ -[JT]) skip_next=yes;; \ esac; \ case $$flg in \ *$$target_option*) has_opt=yes; break;; \ esac; \ done; \ test $$has_opt = yes am__make_dryrun = (target_option=n; $(am__make_running_with_option)) am__make_keepgoing = (target_option=k; $(am__make_running_with_option)) 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 = osl_test$(EXEEXT) osl_int$(EXEEXT) \ osl_pluto_unroll$(EXEEXT) osl_relation_set_precision$(EXEEXT) TESTS = osl_test$(EXEEXT) osl_int$(EXEEXT) osl_pluto_unroll$(EXEEXT) \ osl_relation_set_precision$(EXEEXT) subdir = tests DIST_COMMON = $(srcdir)/Makefile.in $(srcdir)/Makefile.am \ $(top_srcdir)/autoconf/depcomp \ $(top_srcdir)/autoconf/test-driver 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_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 = PROGRAMS = $(noinst_PROGRAMS) am_osl_int_OBJECTS = osl_int-osl_int.$(OBJEXT) osl_int_OBJECTS = $(am_osl_int_OBJECTS) osl_int_DEPENDENCIES = ../libosl.la AM_V_lt = $(am__v_lt_@AM_V@) am__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@) am__v_lt_0 = --silent am__v_lt_1 = am_osl_pluto_unroll_OBJECTS = \ osl_pluto_unroll-osl_pluto_unroll.$(OBJEXT) osl_pluto_unroll_OBJECTS = $(am_osl_pluto_unroll_OBJECTS) osl_pluto_unroll_DEPENDENCIES = ../libosl.la am_osl_relation_set_precision_OBJECTS = osl_relation_set_precision-osl_relation_set_precision.$(OBJEXT) osl_relation_set_precision_OBJECTS = \ $(am_osl_relation_set_precision_OBJECTS) osl_relation_set_precision_DEPENDENCIES = ../libosl.la am_osl_test_OBJECTS = osl_test-osl_test.$(OBJEXT) osl_test_OBJECTS = $(am_osl_test_OBJECTS) osl_test_DEPENDENCIES = ../libosl.la AM_V_P = $(am__v_P_@AM_V@) am__v_P_ = $(am__v_P_@AM_DEFAULT_V@) am__v_P_0 = false am__v_P_1 = : 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_GEN_1 = AM_V_at = $(am__v_at_@AM_V@) am__v_at_ = $(am__v_at_@AM_DEFAULT_V@) am__v_at_0 = @ am__v_at_1 = 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_CC_1 = 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_CCLD_1 = SOURCES = $(osl_int_SOURCES) $(osl_pluto_unroll_SOURCES) \ $(osl_relation_set_precision_SOURCES) $(osl_test_SOURCES) DIST_SOURCES = $(osl_int_SOURCES) $(osl_pluto_unroll_SOURCES) \ $(osl_relation_set_precision_SOURCES) $(osl_test_SOURCES) RECURSIVE_TARGETS = all-recursive check-recursive cscopelist-recursive \ ctags-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 \ tags-recursive uninstall-recursive am__can_run_installinfo = \ case $$AM_UPDATE_INFO_DIR in \ n|no|NO) false;; \ *) (install-info --version) >/dev/null 2>&1;; \ esac RECURSIVE_CLEAN_TARGETS = mostlyclean-recursive clean-recursive \ distclean-recursive maintainer-clean-recursive am__recursive_targets = \ $(RECURSIVE_TARGETS) \ $(RECURSIVE_CLEAN_TARGETS) \ $(am__extra_recursive_targets) AM_RECURSIVE_TARGETS = $(am__recursive_targets:-recursive=) TAGS CTAGS \ check recheck distdir am__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP) # Read a list of newline-separated strings from the standard input, # and print each of them once, without duplicates. Input order is # *not* preserved. am__uniquify_input = $(AWK) '\ BEGIN { nonempty = 0; } \ { items[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in items) print i; }; } \ ' # Make sure the list of sources is unique. This is necessary because, # e.g., the same source file might be shared among _SOURCES variables # for different programs/libraries. am__define_uniq_tagged_files = \ list='$(am__tagged_files)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | $(am__uniquify_input)` ETAGS = etags CTAGS = ctags am__tty_colors_dummy = \ mgn= red= grn= lgn= blu= brg= std=; \ am__color_tests=no am__tty_colors = { \ $(am__tty_colors_dummy); \ if test "X$(AM_COLOR_TESTS)" = Xno; then \ am__color_tests=no; \ elif test "X$(AM_COLOR_TESTS)" = Xalways; then \ am__color_tests=yes; \ elif test "X$$TERM" != Xdumb && { test -t 1; } 2>/dev/null; then \ am__color_tests=yes; \ fi; \ if test $$am__color_tests = yes; then \ red=''; \ grn=''; \ lgn=''; \ blu=''; \ mgn=''; \ brg=''; \ std=''; \ fi; \ } 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__recheck_rx = ^[ ]*:recheck:[ ]* am__global_test_result_rx = ^[ ]*:global-test-result:[ ]* am__copy_in_global_log_rx = ^[ ]*:copy-in-global-log:[ ]* # A command that, given a newline-separated list of test names on the # standard input, print the name of the tests that are to be re-run # upon "make recheck". am__list_recheck_tests = $(AWK) '{ \ recheck = 1; \ while ((rc = (getline line < ($$0 ".trs"))) != 0) \ { \ if (rc < 0) \ { \ if ((getline line2 < ($$0 ".log")) < 0) \ recheck = 0; \ break; \ } \ else if (line ~ /$(am__recheck_rx)[nN][Oo]/) \ { \ recheck = 0; \ break; \ } \ else if (line ~ /$(am__recheck_rx)[yY][eE][sS]/) \ { \ break; \ } \ }; \ if (recheck) \ print $$0; \ close ($$0 ".trs"); \ close ($$0 ".log"); \ }' # A command that, given a newline-separated list of test names on the # standard input, create the global log from their .trs and .log files. am__create_global_log = $(AWK) ' \ function fatal(msg) \ { \ print "fatal: making $@: " msg | "cat >&2"; \ exit 1; \ } \ function rst_section(header) \ { \ print header; \ len = length(header); \ for (i = 1; i <= len; i = i + 1) \ printf "="; \ printf "\n\n"; \ } \ { \ copy_in_global_log = 1; \ global_test_result = "RUN"; \ while ((rc = (getline line < ($$0 ".trs"))) != 0) \ { \ if (rc < 0) \ fatal("failed to read from " $$0 ".trs"); \ if (line ~ /$(am__global_test_result_rx)/) \ { \ sub("$(am__global_test_result_rx)", "", line); \ sub("[ ]*$$", "", line); \ global_test_result = line; \ } \ else if (line ~ /$(am__copy_in_global_log_rx)[nN][oO]/) \ copy_in_global_log = 0; \ }; \ if (copy_in_global_log) \ { \ rst_section(global_test_result ": " $$0); \ while ((rc = (getline line < ($$0 ".log"))) != 0) \ { \ if (rc < 0) \ fatal("failed to read from " $$0 ".log"); \ print line; \ }; \ printf "\n"; \ }; \ close ($$0 ".trs"); \ close ($$0 ".log"); \ }' # Restructured Text title. am__rst_title = { sed 's/.*/ & /;h;s/./=/g;p;x;s/ *$$//;p;g' && echo; } # Solaris 10 'make', and several other traditional 'make' implementations, # pass "-e" to $(SHELL), and POSIX 2008 even requires this. Work around it # by disabling -e (using the XSI extension "set +e") if it's set. am__sh_e_setup = case $$- in *e*) set +e;; esac # Default flags passed to test drivers. am__common_driver_flags = \ --color-tests "$$am__color_tests" \ --enable-hard-errors "$$am__enable_hard_errors" \ --expect-failure "$$am__expect_failure" # To be inserted before the command running the test. Creates the # directory for the log if needed. Stores in $dir the directory # containing $f, in $tst the test, in $log the log. Executes the # developer- defined test setup AM_TESTS_ENVIRONMENT (if any), and # passes TESTS_ENVIRONMENT. Set up options for the wrapper that # will run the test scripts (or their associated LOG_COMPILER, if # thy have one). am__check_pre = \ $(am__sh_e_setup); \ $(am__vpath_adj_setup) $(am__vpath_adj) \ $(am__tty_colors); \ srcdir=$(srcdir); export srcdir; \ case "$@" in \ */*) am__odir=`echo "./$@" | sed 's|/[^/]*$$||'`;; \ *) am__odir=.;; \ esac; \ test "x$$am__odir" = x"." || test -d "$$am__odir" \ || $(MKDIR_P) "$$am__odir" || exit $$?; \ if test -f "./$$f"; then dir=./; \ elif test -f "$$f"; then dir=; \ else dir="$(srcdir)/"; fi; \ tst=$$dir$$f; log='$@'; \ if test -n '$(DISABLE_HARD_ERRORS)'; then \ am__enable_hard_errors=no; \ else \ am__enable_hard_errors=yes; \ fi; \ case " $(XFAIL_TESTS) " in \ *[\ \ ]$$f[\ \ ]* | *[\ \ ]$$dir$$f[\ \ ]*) \ am__expect_failure=yes;; \ *) \ am__expect_failure=no;; \ esac; \ $(AM_TESTS_ENVIRONMENT) $(TESTS_ENVIRONMENT) # A shell command to get the names of the tests scripts with any registered # extension removed (i.e., equivalently, the names of the test logs, with # the '.log' extension removed). The result is saved in the shell variable # '$bases'. This honors runtime overriding of TESTS and TEST_LOGS. Sadly, # we cannot use something simpler, involving e.g., "$(TEST_LOGS:.log=)", # since that might cause problem with VPATH rewrites for suffix-less tests. # See also 'test-harness-vpath-rewrite.sh' and 'test-trs-basic.sh'. am__set_TESTS_bases = \ bases='$(TEST_LOGS)'; \ bases=`for i in $$bases; do echo $$i; done | sed 's/\.log$$//'`; \ bases=`echo $$bases` RECHECK_LOGS = $(TEST_LOGS) TEST_SUITE_LOG = test-suite.log TEST_EXTENSIONS = @EXEEXT@ .test LOG_DRIVER = $(SHELL) $(top_srcdir)/autoconf/test-driver LOG_COMPILE = $(LOG_COMPILER) $(AM_LOG_FLAGS) $(LOG_FLAGS) am__set_b = \ case '$@' in \ */*) \ case '$*' in \ */*) b='$*';; \ *) b=`echo '$@' | sed 's/\.log$$//'`; \ esac;; \ *) \ b='$*';; \ esac am__test_logs1 = $(TESTS:=.log) am__test_logs2 = $(am__test_logs1:@EXEEXT@.log=.log) TEST_LOGS = $(am__test_logs2:.test.log=.log) TEST_LOG_DRIVER = $(SHELL) $(top_srcdir)/autoconf/test-driver TEST_LOG_COMPILE = $(TEST_LOG_COMPILER) $(AM_TEST_LOG_FLAGS) \ $(TEST_LOG_FLAGS) DIST_SUBDIRS = $(SUBDIRS) DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) 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" ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ AM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@ AR = @AR@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AWK = @AWK@ 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@ DOXYGEN = @DOXYGEN@ DSYMUTIL = @DSYMUTIL@ DUMPBIN = @DUMPBIN@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ EXEEXT = @EXEEXT@ FGREP = @FGREP@ 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@ 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@ PRTDIAG = @PRTDIAG@ RANLIB = @RANLIB@ SED = @SED@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ STRIP = @STRIP@ TEXI2PDF = @TEXI2PDF@ 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_aux_dir = @ac_aux_dir@ 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@ 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@ ############################################################################# SUBDIRS = ############################################################################# MAINTAINERCLEANFILES = Makefile.in osl_test_CPPFLAGS = -I$(top_builddir)/include -I$(top_srcdir)/include -static osl_int_CPPFLAGS = -I$(top_builddir)/include -I$(top_srcdir)/include -static osl_pluto_unroll_CPPFLAGS = -I$(top_builddir)/include -I$(top_srcdir)/include -static osl_relation_set_precision_CPPFLAGS = -I$(top_builddir)/include -I$(top_srcdir)/include -static osl_test_LDADD = ../libosl.la osl_int_LDADD = ../libosl.la osl_pluto_unroll_LDADD = ../libosl.la osl_relation_set_precision_LDADD = ../libosl.la osl_test_SOURCES = \ osl_test.c \ polynom.scop \ test_empty_statement.scop \ test_just_access.scop \ test_just_body.scop \ test_just_extbody.scop \ test_just_domain.scop \ test_just_scattering.scop \ test_coordinates.scop \ test_matmult.scop \ test_clay.scop \ test_no_statement.scop \ test_scop_list.scop osl_int_SOURCES = osl_int.c osl_pluto_unroll_SOURCES = osl_pluto_unroll.c osl_relation_set_precision_SOURCES = osl_relation_set_precision.c MAINTAINERCLEANFILE = ../autoconf/texinfo.tex all: all-recursive .SUFFIXES: .SUFFIXES: .c .lo .log .o .obj .test .test$(EXEEXT) .trs $(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 tests/Makefile'; \ $(am__cd) $(top_srcdir) && \ $(AUTOMAKE) --foreign tests/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 osl_int$(EXEEXT): $(osl_int_OBJECTS) $(osl_int_DEPENDENCIES) $(EXTRA_osl_int_DEPENDENCIES) @rm -f osl_int$(EXEEXT) $(AM_V_CCLD)$(LINK) $(osl_int_OBJECTS) $(osl_int_LDADD) $(LIBS) osl_pluto_unroll$(EXEEXT): $(osl_pluto_unroll_OBJECTS) $(osl_pluto_unroll_DEPENDENCIES) $(EXTRA_osl_pluto_unroll_DEPENDENCIES) @rm -f osl_pluto_unroll$(EXEEXT) $(AM_V_CCLD)$(LINK) $(osl_pluto_unroll_OBJECTS) $(osl_pluto_unroll_LDADD) $(LIBS) osl_relation_set_precision$(EXEEXT): $(osl_relation_set_precision_OBJECTS) $(osl_relation_set_precision_DEPENDENCIES) $(EXTRA_osl_relation_set_precision_DEPENDENCIES) @rm -f osl_relation_set_precision$(EXEEXT) $(AM_V_CCLD)$(LINK) $(osl_relation_set_precision_OBJECTS) $(osl_relation_set_precision_LDADD) $(LIBS) osl_test$(EXEEXT): $(osl_test_OBJECTS) $(osl_test_DEPENDENCIES) $(EXTRA_osl_test_DEPENDENCIES) @rm -f osl_test$(EXEEXT) $(AM_V_CCLD)$(LINK) $(osl_test_OBJECTS) $(osl_test_LDADD) $(LIBS) mostlyclean-compile: -rm -f *.$(OBJEXT) distclean-compile: -rm -f *.tab.c @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/osl_int-osl_int.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/osl_pluto_unroll-osl_pluto_unroll.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/osl_relation_set_precision-osl_relation_set_precision.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/osl_test-osl_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 -o $@ $< .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 -o $@ `$(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 $@ $< osl_int-osl_int.o: osl_int.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(osl_int_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT osl_int-osl_int.o -MD -MP -MF $(DEPDIR)/osl_int-osl_int.Tpo -c -o osl_int-osl_int.o `test -f 'osl_int.c' || echo '$(srcdir)/'`osl_int.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/osl_int-osl_int.Tpo $(DEPDIR)/osl_int-osl_int.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='osl_int.c' object='osl_int-osl_int.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) $(osl_int_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o osl_int-osl_int.o `test -f 'osl_int.c' || echo '$(srcdir)/'`osl_int.c osl_int-osl_int.obj: osl_int.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(osl_int_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT osl_int-osl_int.obj -MD -MP -MF $(DEPDIR)/osl_int-osl_int.Tpo -c -o osl_int-osl_int.obj `if test -f 'osl_int.c'; then $(CYGPATH_W) 'osl_int.c'; else $(CYGPATH_W) '$(srcdir)/osl_int.c'; fi` @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/osl_int-osl_int.Tpo $(DEPDIR)/osl_int-osl_int.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='osl_int.c' object='osl_int-osl_int.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) $(osl_int_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o osl_int-osl_int.obj `if test -f 'osl_int.c'; then $(CYGPATH_W) 'osl_int.c'; else $(CYGPATH_W) '$(srcdir)/osl_int.c'; fi` osl_pluto_unroll-osl_pluto_unroll.o: osl_pluto_unroll.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(osl_pluto_unroll_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT osl_pluto_unroll-osl_pluto_unroll.o -MD -MP -MF $(DEPDIR)/osl_pluto_unroll-osl_pluto_unroll.Tpo -c -o osl_pluto_unroll-osl_pluto_unroll.o `test -f 'osl_pluto_unroll.c' || echo '$(srcdir)/'`osl_pluto_unroll.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/osl_pluto_unroll-osl_pluto_unroll.Tpo $(DEPDIR)/osl_pluto_unroll-osl_pluto_unroll.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='osl_pluto_unroll.c' object='osl_pluto_unroll-osl_pluto_unroll.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) $(osl_pluto_unroll_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o osl_pluto_unroll-osl_pluto_unroll.o `test -f 'osl_pluto_unroll.c' || echo '$(srcdir)/'`osl_pluto_unroll.c osl_pluto_unroll-osl_pluto_unroll.obj: osl_pluto_unroll.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(osl_pluto_unroll_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT osl_pluto_unroll-osl_pluto_unroll.obj -MD -MP -MF $(DEPDIR)/osl_pluto_unroll-osl_pluto_unroll.Tpo -c -o osl_pluto_unroll-osl_pluto_unroll.obj `if test -f 'osl_pluto_unroll.c'; then $(CYGPATH_W) 'osl_pluto_unroll.c'; else $(CYGPATH_W) '$(srcdir)/osl_pluto_unroll.c'; fi` @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/osl_pluto_unroll-osl_pluto_unroll.Tpo $(DEPDIR)/osl_pluto_unroll-osl_pluto_unroll.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='osl_pluto_unroll.c' object='osl_pluto_unroll-osl_pluto_unroll.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) $(osl_pluto_unroll_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o osl_pluto_unroll-osl_pluto_unroll.obj `if test -f 'osl_pluto_unroll.c'; then $(CYGPATH_W) 'osl_pluto_unroll.c'; else $(CYGPATH_W) '$(srcdir)/osl_pluto_unroll.c'; fi` osl_relation_set_precision-osl_relation_set_precision.o: osl_relation_set_precision.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(osl_relation_set_precision_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT osl_relation_set_precision-osl_relation_set_precision.o -MD -MP -MF $(DEPDIR)/osl_relation_set_precision-osl_relation_set_precision.Tpo -c -o osl_relation_set_precision-osl_relation_set_precision.o `test -f 'osl_relation_set_precision.c' || echo '$(srcdir)/'`osl_relation_set_precision.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/osl_relation_set_precision-osl_relation_set_precision.Tpo $(DEPDIR)/osl_relation_set_precision-osl_relation_set_precision.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='osl_relation_set_precision.c' object='osl_relation_set_precision-osl_relation_set_precision.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) $(osl_relation_set_precision_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o osl_relation_set_precision-osl_relation_set_precision.o `test -f 'osl_relation_set_precision.c' || echo '$(srcdir)/'`osl_relation_set_precision.c osl_relation_set_precision-osl_relation_set_precision.obj: osl_relation_set_precision.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(osl_relation_set_precision_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT osl_relation_set_precision-osl_relation_set_precision.obj -MD -MP -MF $(DEPDIR)/osl_relation_set_precision-osl_relation_set_precision.Tpo -c -o osl_relation_set_precision-osl_relation_set_precision.obj `if test -f 'osl_relation_set_precision.c'; then $(CYGPATH_W) 'osl_relation_set_precision.c'; else $(CYGPATH_W) '$(srcdir)/osl_relation_set_precision.c'; fi` @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/osl_relation_set_precision-osl_relation_set_precision.Tpo $(DEPDIR)/osl_relation_set_precision-osl_relation_set_precision.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='osl_relation_set_precision.c' object='osl_relation_set_precision-osl_relation_set_precision.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) $(osl_relation_set_precision_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o osl_relation_set_precision-osl_relation_set_precision.obj `if test -f 'osl_relation_set_precision.c'; then $(CYGPATH_W) 'osl_relation_set_precision.c'; else $(CYGPATH_W) '$(srcdir)/osl_relation_set_precision.c'; fi` osl_test-osl_test.o: osl_test.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(osl_test_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT osl_test-osl_test.o -MD -MP -MF $(DEPDIR)/osl_test-osl_test.Tpo -c -o osl_test-osl_test.o `test -f 'osl_test.c' || echo '$(srcdir)/'`osl_test.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/osl_test-osl_test.Tpo $(DEPDIR)/osl_test-osl_test.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='osl_test.c' object='osl_test-osl_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) $(osl_test_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o osl_test-osl_test.o `test -f 'osl_test.c' || echo '$(srcdir)/'`osl_test.c osl_test-osl_test.obj: osl_test.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(osl_test_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT osl_test-osl_test.obj -MD -MP -MF $(DEPDIR)/osl_test-osl_test.Tpo -c -o osl_test-osl_test.obj `if test -f 'osl_test.c'; then $(CYGPATH_W) 'osl_test.c'; else $(CYGPATH_W) '$(srcdir)/osl_test.c'; fi` @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/osl_test-osl_test.Tpo $(DEPDIR)/osl_test-osl_test.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='osl_test.c' object='osl_test-osl_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) $(osl_test_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o osl_test-osl_test.obj `if test -f 'osl_test.c'; then $(CYGPATH_W) 'osl_test.c'; else $(CYGPATH_W) '$(srcdir)/osl_test.c'; fi` mostlyclean-libtool: -rm -f *.lo clean-libtool: -rm -rf .libs _libs # 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. $(am__recursive_targets): @fail=; \ if $(am__make_keepgoing); then \ failcom='fail=yes'; \ else \ failcom='exit 1'; \ fi; \ dot_seen=no; \ target=`echo $@ | sed s/-recursive//`; \ case "$@" in \ distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \ *) list='$(SUBDIRS)' ;; \ esac; \ 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" ID: $(am__tagged_files) $(am__define_uniq_tagged_files); mkid -fID $$unique tags: tags-recursive TAGS: tags tags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files) 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; \ $(am__define_uniq_tagged_files); \ 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-recursive CTAGS: ctags ctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files) $(am__define_uniq_tagged_files); \ 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" cscopelist: cscopelist-recursive cscopelist-am: $(am__tagged_files) list='$(am__tagged_files)'; \ case "$(srcdir)" in \ [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \ *) sdir=$(subdir)/$(srcdir) ;; \ esac; \ for i in $$list; do \ if test -f "$$i"; then \ echo "$(subdir)/$$i"; \ else \ echo "$$sdir/$$i"; \ fi; \ done >> $(top_builddir)/cscope.files distclean-tags: -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags # Recover from deleted '.trs' file; this should ensure that # "rm -f foo.log; make foo.trs" re-run 'foo.test', and re-create # both 'foo.log' and 'foo.trs'. Break the recipe in two subshells # to avoid problems with "make -n". .log.trs: rm -f $< $@ $(MAKE) $(AM_MAKEFLAGS) $< # Leading 'am--fnord' is there to ensure the list of targets does not # expand to empty, as could happen e.g. with make check TESTS=''. am--fnord $(TEST_LOGS) $(TEST_LOGS:.log=.trs): $(am__force_recheck) am--force-recheck: @: $(TEST_SUITE_LOG): $(TEST_LOGS) @$(am__set_TESTS_bases); \ am__f_ok () { test -f "$$1" && test -r "$$1"; }; \ redo_bases=`for i in $$bases; do \ am__f_ok $$i.trs && am__f_ok $$i.log || echo $$i; \ done`; \ if test -n "$$redo_bases"; then \ redo_logs=`for i in $$redo_bases; do echo $$i.log; done`; \ redo_results=`for i in $$redo_bases; do echo $$i.trs; done`; \ if $(am__make_dryrun); then :; else \ rm -f $$redo_logs && rm -f $$redo_results || exit 1; \ fi; \ fi; \ if test -n "$$am__remaking_logs"; then \ echo "fatal: making $(TEST_SUITE_LOG): possible infinite" \ "recursion detected" >&2; \ else \ am__remaking_logs=yes $(MAKE) $(AM_MAKEFLAGS) $$redo_logs; \ fi; \ if $(am__make_dryrun); then :; else \ st=0; \ errmsg="fatal: making $(TEST_SUITE_LOG): failed to create"; \ for i in $$redo_bases; do \ test -f $$i.trs && test -r $$i.trs \ || { echo "$$errmsg $$i.trs" >&2; st=1; }; \ test -f $$i.log && test -r $$i.log \ || { echo "$$errmsg $$i.log" >&2; st=1; }; \ done; \ test $$st -eq 0 || exit 1; \ fi @$(am__sh_e_setup); $(am__tty_colors); $(am__set_TESTS_bases); \ ws='[ ]'; \ results=`for b in $$bases; do echo $$b.trs; done`; \ test -n "$$results" || results=/dev/null; \ all=` grep "^$$ws*:test-result:" $$results | wc -l`; \ pass=` grep "^$$ws*:test-result:$$ws*PASS" $$results | wc -l`; \ fail=` grep "^$$ws*:test-result:$$ws*FAIL" $$results | wc -l`; \ skip=` grep "^$$ws*:test-result:$$ws*SKIP" $$results | wc -l`; \ xfail=`grep "^$$ws*:test-result:$$ws*XFAIL" $$results | wc -l`; \ xpass=`grep "^$$ws*:test-result:$$ws*XPASS" $$results | wc -l`; \ error=`grep "^$$ws*:test-result:$$ws*ERROR" $$results | wc -l`; \ if test `expr $$fail + $$xpass + $$error` -eq 0; then \ success=true; \ else \ success=false; \ fi; \ br='==================='; br=$$br$$br$$br$$br; \ result_count () \ { \ if test x"$$1" = x"--maybe-color"; then \ maybe_colorize=yes; \ elif test x"$$1" = x"--no-color"; then \ maybe_colorize=no; \ else \ echo "$@: invalid 'result_count' usage" >&2; exit 4; \ fi; \ shift; \ desc=$$1 count=$$2; \ if test $$maybe_colorize = yes && test $$count -gt 0; then \ color_start=$$3 color_end=$$std; \ else \ color_start= color_end=; \ fi; \ echo "$${color_start}# $$desc $$count$${color_end}"; \ }; \ create_testsuite_report () \ { \ result_count $$1 "TOTAL:" $$all "$$brg"; \ result_count $$1 "PASS: " $$pass "$$grn"; \ result_count $$1 "SKIP: " $$skip "$$blu"; \ result_count $$1 "XFAIL:" $$xfail "$$lgn"; \ result_count $$1 "FAIL: " $$fail "$$red"; \ result_count $$1 "XPASS:" $$xpass "$$red"; \ result_count $$1 "ERROR:" $$error "$$mgn"; \ }; \ { \ echo "$(PACKAGE_STRING): $(subdir)/$(TEST_SUITE_LOG)" | \ $(am__rst_title); \ create_testsuite_report --no-color; \ echo; \ echo ".. contents:: :depth: 2"; \ echo; \ for b in $$bases; do echo $$b; done \ | $(am__create_global_log); \ } >$(TEST_SUITE_LOG).tmp || exit 1; \ mv $(TEST_SUITE_LOG).tmp $(TEST_SUITE_LOG); \ if $$success; then \ col="$$grn"; \ else \ col="$$red"; \ test x"$$VERBOSE" = x || cat $(TEST_SUITE_LOG); \ fi; \ echo "$${col}$$br$${std}"; \ echo "$${col}Testsuite summary for $(PACKAGE_STRING)$${std}"; \ echo "$${col}$$br$${std}"; \ create_testsuite_report --maybe-color; \ echo "$$col$$br$$std"; \ if $$success; then :; else \ echo "$${col}See $(subdir)/$(TEST_SUITE_LOG)$${std}"; \ if test -n "$(PACKAGE_BUGREPORT)"; then \ echo "$${col}Please report to $(PACKAGE_BUGREPORT)$${std}"; \ fi; \ echo "$$col$$br$$std"; \ fi; \ $$success || exit 1 check-TESTS: @list='$(RECHECK_LOGS)'; test -z "$$list" || rm -f $$list @list='$(RECHECK_LOGS:.log=.trs)'; test -z "$$list" || rm -f $$list @test -z "$(TEST_SUITE_LOG)" || rm -f $(TEST_SUITE_LOG) @set +e; $(am__set_TESTS_bases); \ log_list=`for i in $$bases; do echo $$i.log; done`; \ trs_list=`for i in $$bases; do echo $$i.trs; done`; \ log_list=`echo $$log_list`; trs_list=`echo $$trs_list`; \ $(MAKE) $(AM_MAKEFLAGS) $(TEST_SUITE_LOG) TEST_LOGS="$$log_list"; \ exit $$?; recheck: all @test -z "$(TEST_SUITE_LOG)" || rm -f $(TEST_SUITE_LOG) @set +e; $(am__set_TESTS_bases); \ bases=`for i in $$bases; do echo $$i; done \ | $(am__list_recheck_tests)` || exit 1; \ log_list=`for i in $$bases; do echo $$i.log; done`; \ log_list=`echo $$log_list`; \ $(MAKE) $(AM_MAKEFLAGS) $(TEST_SUITE_LOG) \ am__force_recheck=am--force-recheck \ TEST_LOGS="$$log_list"; \ exit $$? osl_test.log: osl_test$(EXEEXT) @p='osl_test$(EXEEXT)'; \ b='osl_test'; \ $(am__check_pre) $(LOG_DRIVER) --test-name "$$f" \ --log-file $$b.log --trs-file $$b.trs \ $(am__common_driver_flags) $(AM_LOG_DRIVER_FLAGS) $(LOG_DRIVER_FLAGS) -- $(LOG_COMPILE) \ "$$tst" $(AM_TESTS_FD_REDIRECT) osl_int.log: osl_int$(EXEEXT) @p='osl_int$(EXEEXT)'; \ b='osl_int'; \ $(am__check_pre) $(LOG_DRIVER) --test-name "$$f" \ --log-file $$b.log --trs-file $$b.trs \ $(am__common_driver_flags) $(AM_LOG_DRIVER_FLAGS) $(LOG_DRIVER_FLAGS) -- $(LOG_COMPILE) \ "$$tst" $(AM_TESTS_FD_REDIRECT) osl_pluto_unroll.log: osl_pluto_unroll$(EXEEXT) @p='osl_pluto_unroll$(EXEEXT)'; \ b='osl_pluto_unroll'; \ $(am__check_pre) $(LOG_DRIVER) --test-name "$$f" \ --log-file $$b.log --trs-file $$b.trs \ $(am__common_driver_flags) $(AM_LOG_DRIVER_FLAGS) $(LOG_DRIVER_FLAGS) -- $(LOG_COMPILE) \ "$$tst" $(AM_TESTS_FD_REDIRECT) osl_relation_set_precision.log: osl_relation_set_precision$(EXEEXT) @p='osl_relation_set_precision$(EXEEXT)'; \ b='osl_relation_set_precision'; \ $(am__check_pre) $(LOG_DRIVER) --test-name "$$f" \ --log-file $$b.log --trs-file $$b.trs \ $(am__common_driver_flags) $(AM_LOG_DRIVER_FLAGS) $(LOG_DRIVER_FLAGS) -- $(LOG_COMPILE) \ "$$tst" $(AM_TESTS_FD_REDIRECT) .test.log: @p='$<'; \ $(am__set_b); \ $(am__check_pre) $(TEST_LOG_DRIVER) --test-name "$$f" \ --log-file $$b.log --trs-file $$b.trs \ $(am__common_driver_flags) $(AM_TEST_LOG_DRIVER_FLAGS) $(TEST_LOG_DRIVER_FLAGS) -- $(TEST_LOG_COMPILE) \ "$$tst" $(AM_TESTS_FD_REDIRECT) @am__EXEEXT_TRUE@.test$(EXEEXT).log: @am__EXEEXT_TRUE@ @p='$<'; \ @am__EXEEXT_TRUE@ $(am__set_b); \ @am__EXEEXT_TRUE@ $(am__check_pre) $(TEST_LOG_DRIVER) --test-name "$$f" \ @am__EXEEXT_TRUE@ --log-file $$b.log --trs-file $$b.trs \ @am__EXEEXT_TRUE@ $(am__common_driver_flags) $(AM_TEST_LOG_DRIVER_FLAGS) $(TEST_LOG_DRIVER_FLAGS) -- $(TEST_LOG_COMPILE) \ @am__EXEEXT_TRUE@ "$$tst" $(AM_TESTS_FD_REDIRECT) 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 @list='$(DIST_SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ $(am__make_dryrun) \ || test -d "$(distdir)/$$subdir" \ || $(MKDIR_P) "$(distdir)/$$subdir" \ || exit 1; \ 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 check-am: all-am $(MAKE) $(AM_MAKEFLAGS) check-TESTS check: check-recursive all-am: Makefile $(PROGRAMS) installdirs: installdirs-recursive installdirs-am: 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: -test -z "$(TEST_LOGS)" || rm -f $(TEST_LOGS) -test -z "$(TEST_LOGS:.log=.trs)" || rm -f $(TEST_LOGS:.log=.trs) -test -z "$(TEST_SUITE_LOG)" || rm -f $(TEST_SUITE_LOG) 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." -test -z "$(MAINTAINERCLEANFILES)" || rm -f $(MAINTAINERCLEANFILES) clean: clean-recursive clean-am: clean-generic clean-libtool clean-noinstPROGRAMS \ mostlyclean-am distclean: distclean-recursive -rm -rf ./$(DEPDIR) -rm -f Makefile distclean-am: clean-am distclean-compile distclean-generic \ distclean-tags dvi: dvi-recursive dvi-am: html: html-recursive html-am: info: info-recursive info-am: install-data-am: install-dvi: install-dvi-recursive install-dvi-am: install-exec-am: 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 -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: .MAKE: $(am__recursive_targets) check-am install-am install-strip .PHONY: $(am__recursive_targets) CTAGS GTAGS TAGS all all-am check \ check-TESTS check-am clean clean-generic clean-libtool \ clean-noinstPROGRAMS cscopelist-am ctags ctags-am 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 \ installdirs-am maintainer-clean maintainer-clean-generic \ mostlyclean mostlyclean-compile mostlyclean-generic \ mostlyclean-libtool pdf pdf-am ps ps-am recheck tags tags-am \ uninstall uninstall-am # 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.4/osl/tests/test_empty_statement.scop0000644000175000017500000000116312413256474016747 00000000000000 # =============================================== Global # Language C # Context CONTEXT 0 2 0 0 0 0 # Parameter names are not provided 0 # One statement 1 # =============================================== Statement 1 # Number of relations describing the statement 0 # ---------------------------------------------- 1.1 Domain # NULL Domain # ---------------------------------------------- 1.2 Scattering # NULL Scattering # ---------------------------------------------- 1.3 Access # NULL Access # ---------------------------------------------- 1.4 Body # Statement body is not provided 0 cloog-0.18.4/osl/tests/test_just_scattering.scop0000644000175000017500000000117012413256474016733 00000000000000 # =============================================== Global # Language C # Context CONTEXT 0 2 0 0 0 0 # Parameter names are not provided 0 # One statement 1 # =============================================== Statement 1 # Number of relations describing the statement 1 # ---------------------------------------------- 1.1 Domain # NULL Domain # ---------------------------------------------- 1.2 Scattering SCATTERING 0 2 0 0 0 0 # ---------------------------------------------- 1.3 Access # NULL Access # ---------------------------------------------- 1.4 Body # Statement body is not provided 0 cloog-0.18.4/osl/tests/test_matmult.scop0000644000175000017500000000767112413256474015222 00000000000000# Matmul example, relation representation # =============================================== Global # Backend Language C # Context CONTEXT 1 3 0 0 0 1 1 1 -1 ## N-1 >= 0 # Parameter names are provided 1 # Parameter names N # Number of statements 2 # =============================================== Statement 1 # Number of relations describing the statement 3 # ---------------------------------------------- 1.1 Domain DOMAIN 4 5 2 0 0 1 # e/i i j N 1 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 # ---------------------------------------------- 1.2 Scattering SCATTERING 5 10 5 2 0 1 # e/i s1 s2 s3 s4 s5 i j N 1 0 -1 0 0 0 0 0 0 0 0 ## s1 = 0 0 0 -1 0 0 0 1 0 0 0 ## s2 = i 0 0 0 -1 0 0 0 0 0 0 ## s3 = 0 0 0 0 0 -1 0 0 1 0 0 ## s4 = j 0 0 0 0 0 -1 0 0 0 0 ## s5 = 0 # ---------------------------------------------- 1.3 Access WRITE 3 8 3 2 0 1 # e/i Arr [1] [2] i j N 1 0 -1 0 0 0 0 0 1 ## C 0 0 -1 0 1 0 0 0 ## [i] 0 0 0 -1 0 1 0 0 ## [j] # ---------------------------------------------- 1.4 Body # Statement body is provided 1 # Number of original iterators 2 # Original iterator names i j # Statement body C[i][j] = 0.0; # =============================================== Statement 2 # Number of relations describing the statement 6 # ---------------------------------------------- 2.1 Domain DOMAIN 6 6 3 0 0 1 # e/i i j k N 1 1 1 0 0 0 0 ## i >= 0 1 -1 0 0 1 -1 ## -i+N-1 >= 0 1 0 1 0 0 0 ## j >= 0 1 0 -1 0 1 -1 ## -j+N-1 >= 0 1 0 0 1 0 0 ## k >= 0 1 0 0 -1 1 -1 ## -k+N-1 >= 0 # ---------------------------------------------- 2.2 Scattering SCATTERING 7 13 7 3 0 1 # e/i s1 s2 s3 s4 s5 s6 s7 i j k N 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 ## s1 = 0 0 0 -1 0 0 0 0 0 1 0 0 0 0 ## s2 = i 0 0 0 -1 0 0 0 0 0 0 0 0 0 ## s3 = 0 0 0 0 0 -1 0 0 0 0 1 0 0 0 ## s4 = j 0 0 0 0 0 -1 0 0 0 0 0 0 1 ## s5 = 1 0 0 0 0 0 0 -1 0 0 0 1 0 0 ## s6 = k 0 0 0 0 0 0 0 -1 0 0 0 0 0 ## s7 = 0 # ---------------------------------------------- 2.3 Access WRITE 3 9 3 3 0 1 # e/i Arr [1] [2] i j k N 1 0 -1 0 0 0 0 0 0 1 ## C 0 0 -1 0 1 0 0 0 0 ## [i] 0 0 0 -1 0 1 0 0 0 ## [j] READ 3 9 3 3 0 1 # e/i Arr [1] [2] i j k N 1 0 -1 0 0 0 0 0 0 1 ## C 0 0 -1 0 1 0 0 0 0 ## [i] 0 0 0 -1 0 1 0 0 0 ## [j] READ 3 9 3 3 0 1 # e/i Arr [1] [2] i j k N 1 0 -1 0 0 0 0 0 0 2 ## A 0 0 -1 0 1 0 0 0 0 ## [i] 0 0 0 -1 0 0 1 0 0 ## [k] READ 3 9 3 3 0 1 # e/i Arr [1] [2] i j k N 1 0 -1 0 0 0 0 0 0 3 ## B 0 0 -1 0 0 0 1 0 0 ## [k] 0 0 0 -1 0 1 0 0 0 ## [j] # ---------------------------------------------- 2.4 Body # Statement body is provided 1 # Number of original iterators 3 # Original iterator names i j k # Statement body C[i][j] = C[i][j] + A[i][k] * B[k][j]; cloog-0.18.4/osl/tests/osl_int.c0000644000175000017500000003661012413270135013406 00000000000000// Copyright © 2014 Inria, Written by Lénaïc Bagnères, lenaic.bagneres@inria.fr // (3-clause BSD license) // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions // are met: // // 1. Redistributions of source code must retain the above copyright notice, // this list of conditions and the following disclaimer. // 2. Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // 3. The name of the author may not be used to endorse or promote products // derived from this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR // IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES // OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. // IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, // INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT // NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF // THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. #include #include #include #include int main(int argc, char** argv) { if (argc > 1) { printf("argv are ignored\n"); } unsigned int nb_fail = 0; #ifdef OSL_GMP_IS_HERE int i; for (i = SCHAR_MIN; i <= SCHAR_MAX; ++i) { osl_int_t a_sp; osl_int_init_set_si(OSL_PRECISION_SP, &a_sp, i); osl_int_t a_dp; osl_int_init_set_si(OSL_PRECISION_DP, &a_dp, i); osl_int_t a_mp; osl_int_init_set_si(OSL_PRECISION_MP, &a_mp, i); int j; for (j = SCHAR_MIN; j <= SCHAR_MAX; ++j) { int error = 0; osl_int_t b_sp; osl_int_init_set_si(OSL_PRECISION_SP, &b_sp, j); osl_int_t b_dp; osl_int_init_set_si(OSL_PRECISION_DP, &b_dp, j); osl_int_t b_mp; osl_int_init_set_si(OSL_PRECISION_MP, &b_mp, j); osl_int_t c_sp; osl_int_init(OSL_PRECISION_SP, &c_sp); osl_int_t c_dp; osl_int_init(OSL_PRECISION_DP, &c_dp); osl_int_t c_mp; osl_int_init(OSL_PRECISION_MP, &c_mp); int const a_sp_i = osl_int_get_si(OSL_PRECISION_SP, a_sp); int const a_dp_i = osl_int_get_si(OSL_PRECISION_DP, a_dp); int const a_mp_i = osl_int_get_si(OSL_PRECISION_MP, a_mp); int const b_sp_i = osl_int_get_si(OSL_PRECISION_SP, b_sp); int const b_dp_i = osl_int_get_si(OSL_PRECISION_DP, b_dp); int const b_mp_i = osl_int_get_si(OSL_PRECISION_MP, b_mp); // osl_int_init_set_si & osl_int_init & osl_int_get_si if (!error) { int c_sp_i = osl_int_get_si(OSL_PRECISION_SP, c_sp); int c_dp_i = osl_int_get_si(OSL_PRECISION_DP, c_dp); int c_mp_i = osl_int_get_si(OSL_PRECISION_MP, c_mp); if (a_sp_i != a_dp_i || a_sp_i != a_mp_i) { error++; printf("Error osl_int_init_set_si or osl_int_get_si\n"); } if (b_sp_i != b_dp_i || b_sp_i != b_mp_i) { error++; printf("Error osl_int_init_set_si or osl_int_get_si\n"); } if (c_sp_i != c_dp_i || c_sp_i != c_mp_i || c_sp_i != 0) { error++; printf("Error osl_int_init or osl_int_get_si\n"); } } // osl_int_assign if (!error) { osl_int_assign(OSL_PRECISION_SP, &c_sp, b_sp); osl_int_assign(OSL_PRECISION_DP, &c_dp, b_dp); osl_int_assign(OSL_PRECISION_MP, &c_mp, b_mp); if (osl_int_ne(OSL_PRECISION_SP, c_sp, b_sp)) { error++; printf("Error osl_int_assign\n"); } if (osl_int_ne(OSL_PRECISION_DP, c_dp, b_dp)) { error++; printf("Error osl_int_assign\n"); } if (osl_int_ne(OSL_PRECISION_MP, c_mp, b_mp)) { error++; printf("Error osl_int_assign\n"); } } // osl_int_swap // osl_int_increment if (!error) { osl_int_increment(OSL_PRECISION_SP, &c_sp, a_sp); osl_int_increment(OSL_PRECISION_DP, &c_dp, a_dp); osl_int_increment(OSL_PRECISION_MP, &c_mp, a_mp); int c_sp_i = osl_int_get_si(OSL_PRECISION_SP, c_sp); int c_dp_i = osl_int_get_si(OSL_PRECISION_DP, c_dp); int c_mp_i = osl_int_get_si(OSL_PRECISION_MP, c_mp); if (c_sp_i != c_dp_i || c_sp_i != c_mp_i || c_sp_i != a_sp_i + 1) { error++; printf("Error osl_int_increment\n"); } } // osl_int_decrement if (!error) { osl_int_decrement(OSL_PRECISION_SP, &c_sp, a_sp); osl_int_decrement(OSL_PRECISION_DP, &c_dp, a_dp); osl_int_decrement(OSL_PRECISION_MP, &c_mp, a_mp); int c_sp_i = osl_int_get_si(OSL_PRECISION_SP, c_sp); int c_dp_i = osl_int_get_si(OSL_PRECISION_DP, c_dp); int c_mp_i = osl_int_get_si(OSL_PRECISION_MP, c_mp); if (c_sp_i != c_dp_i || c_sp_i != c_mp_i || c_sp_i != a_sp_i - 1) { error++; printf("Error osl_int_decrement\n"); } } // osl_int_add if (!error) { osl_int_add(OSL_PRECISION_SP, &c_sp, a_sp, b_sp); osl_int_add(OSL_PRECISION_DP, &c_dp, a_dp, b_dp); osl_int_add(OSL_PRECISION_MP, &c_mp, a_mp, b_mp); int c_sp_i = osl_int_get_si(OSL_PRECISION_SP, c_sp); int c_dp_i = osl_int_get_si(OSL_PRECISION_DP, c_dp); int c_mp_i = osl_int_get_si(OSL_PRECISION_MP, c_mp); if (c_sp_i != c_dp_i || c_sp_i != c_mp_i || c_sp_i != a_sp_i + b_sp_i) { error++; printf("Error osl_int_add\n"); } } // osl_int_add_si // osl_int_sub if (!error) { osl_int_sub(OSL_PRECISION_SP, &c_sp, a_sp, b_sp); osl_int_sub(OSL_PRECISION_DP, &c_dp, a_dp, b_dp); osl_int_sub(OSL_PRECISION_MP, &c_mp, a_mp, b_mp); int c_sp_i = osl_int_get_si(OSL_PRECISION_SP, c_sp); int c_dp_i = osl_int_get_si(OSL_PRECISION_DP, c_dp); int c_mp_i = osl_int_get_si(OSL_PRECISION_MP, c_mp); if (c_sp_i != c_dp_i || c_sp_i != c_mp_i || c_sp_i != a_sp_i - b_sp_i) { error++; printf("Error osl_int_add\n"); } } // osl_int_mul if (!error) { osl_int_mul(OSL_PRECISION_SP, &c_sp, a_sp, b_sp); osl_int_mul(OSL_PRECISION_DP, &c_dp, a_dp, b_dp); osl_int_mul(OSL_PRECISION_MP, &c_mp, a_mp, b_mp); int c_sp_i = osl_int_get_si(OSL_PRECISION_SP, c_sp); int c_dp_i = osl_int_get_si(OSL_PRECISION_DP, c_dp); int c_mp_i = osl_int_get_si(OSL_PRECISION_MP, c_mp); if (c_sp_i != c_dp_i || c_sp_i != c_mp_i || c_sp_i != a_sp_i * b_sp_i) { error++; printf("Error osl_int_mul\n"); } } // osl_int_mul_si if (!error) { osl_int_mul_si(OSL_PRECISION_SP, &c_sp, a_sp, b_sp_i); osl_int_mul_si(OSL_PRECISION_DP, &c_dp, a_dp, b_dp_i); osl_int_mul_si(OSL_PRECISION_MP, &c_mp, a_mp, b_mp_i); int c_sp_i = osl_int_get_si(OSL_PRECISION_SP, c_sp); int c_dp_i = osl_int_get_si(OSL_PRECISION_DP, c_dp); int c_mp_i = osl_int_get_si(OSL_PRECISION_MP, c_mp); if (c_sp_i != c_dp_i || c_sp_i != c_mp_i || c_sp_i != a_sp_i * b_sp_i) { error++; printf("Error osl_int_mul_si\n"); } } // osl_int_div_exact if (!error && b_sp_i != 0 && a_sp_i % b_sp_i == 0) { osl_int_div_exact(OSL_PRECISION_SP, &c_sp, a_sp, b_sp); osl_int_div_exact(OSL_PRECISION_DP, &c_dp, a_dp, b_dp); osl_int_div_exact(OSL_PRECISION_MP, &c_mp, a_mp, b_mp); int c_sp_i = osl_int_get_si(OSL_PRECISION_SP, c_sp); int c_dp_i = osl_int_get_si(OSL_PRECISION_DP, c_dp); int c_mp_i = osl_int_get_si(OSL_PRECISION_MP, c_mp); if (c_sp_i != c_dp_i || c_sp_i != c_mp_i || c_sp_i != a_sp_i / b_sp_i) { error++; printf("Error osl_int_div_exact\n"); } } // osl_int_floor_div_q if (!error && b_sp_i != 0) { osl_int_floor_div_q(OSL_PRECISION_SP, &c_sp, a_sp, b_sp); osl_int_floor_div_q(OSL_PRECISION_DP, &c_dp, a_dp, b_dp); osl_int_floor_div_q(OSL_PRECISION_MP, &c_mp, a_mp, b_mp); int c_sp_i = osl_int_get_si(OSL_PRECISION_SP, c_sp); int c_dp_i = osl_int_get_si(OSL_PRECISION_DP, c_dp); int c_mp_i = osl_int_get_si(OSL_PRECISION_MP, c_mp); if (c_sp_i != c_dp_i || c_sp_i != c_mp_i) { error++; printf("Error osl_int_floor_div_q\n"); } } // osl_int_floor_div_r if (!error && b_sp_i != 0) { osl_int_floor_div_r(OSL_PRECISION_SP, &c_sp, a_sp, b_sp); osl_int_floor_div_r(OSL_PRECISION_DP, &c_dp, a_dp, b_dp); osl_int_floor_div_r(OSL_PRECISION_MP, &c_mp, a_mp, b_mp); int c_sp_i = osl_int_get_si(OSL_PRECISION_SP, c_sp); int c_dp_i = osl_int_get_si(OSL_PRECISION_DP, c_dp); int c_mp_i = osl_int_get_si(OSL_PRECISION_MP, c_mp); if (c_sp_i != c_dp_i || c_sp_i != c_mp_i) { error++; printf("Error osl_int_floor_div_r\n"); } } // osl_int_floor_div_q_r if (!error && b_sp_i != 0) { osl_int_t q_sp; osl_int_init(OSL_PRECISION_SP, &q_sp); osl_int_t q_dp; osl_int_init(OSL_PRECISION_DP, &q_dp); osl_int_t q_mp; osl_int_init(OSL_PRECISION_MP, &q_mp); osl_int_t r_sp; osl_int_init(OSL_PRECISION_SP, &r_sp); osl_int_t r_dp; osl_int_init(OSL_PRECISION_DP, &r_dp); osl_int_t r_mp; osl_int_init(OSL_PRECISION_MP, &r_mp); osl_int_floor_div_q_r(OSL_PRECISION_SP, &q_sp, &r_sp, a_sp, b_sp); osl_int_floor_div_q_r(OSL_PRECISION_DP, &q_dp, &r_dp, a_dp, b_dp); osl_int_floor_div_q_r(OSL_PRECISION_MP, &q_mp, &r_mp, a_mp, b_mp); int q_sp_i = osl_int_get_si(OSL_PRECISION_SP, q_sp); int q_dp_i = osl_int_get_si(OSL_PRECISION_DP, q_dp); int q_mp_i = osl_int_get_si(OSL_PRECISION_MP, q_mp); int r_sp_i = osl_int_get_si(OSL_PRECISION_SP, r_sp); int r_dp_i = osl_int_get_si(OSL_PRECISION_DP, r_dp); int r_mp_i = osl_int_get_si(OSL_PRECISION_MP, r_mp); if (q_sp_i != q_dp_i || q_sp_i != q_mp_i) { error++; printf("Error osl_int_floor_div_q_r\n"); } if (r_sp_i != r_dp_i || r_sp_i != r_mp_i) { error++; printf("Error osl_int_floor_div_q_r\n"); } } // osl_int_mod if (!error && b_sp_i != 0) { osl_int_mod(OSL_PRECISION_SP, &c_sp, a_sp, b_sp); osl_int_mod(OSL_PRECISION_DP, &c_dp, a_dp, b_dp); osl_int_mod(OSL_PRECISION_MP, &c_mp, a_mp, b_mp); int c_sp_i = osl_int_get_si(OSL_PRECISION_SP, c_sp); int c_dp_i = osl_int_get_si(OSL_PRECISION_DP, c_dp); int c_mp_i = osl_int_get_si(OSL_PRECISION_MP, c_mp); if (c_sp_i != c_dp_i || c_sp_i != c_mp_i) { error++; printf("Error osl_int_mod\n"); } } // osl_int_gcd if (!error) { osl_int_gcd(OSL_PRECISION_SP, &c_sp, a_sp, b_sp); osl_int_gcd(OSL_PRECISION_DP, &c_dp, a_dp, b_dp); osl_int_gcd(OSL_PRECISION_MP, &c_mp, a_mp, b_mp); int c_sp_i = osl_int_get_si(OSL_PRECISION_SP, c_sp); int c_dp_i = osl_int_get_si(OSL_PRECISION_DP, c_dp); int c_mp_i = osl_int_get_si(OSL_PRECISION_MP, c_mp); if (c_sp_i != c_dp_i || c_sp_i != c_mp_i) { error++; printf("Error osl_int_gcd\n"); } } // osl_int_oppose if (!error) { osl_int_oppose(OSL_PRECISION_SP, &c_sp, b_sp); osl_int_oppose(OSL_PRECISION_DP, &c_dp, b_dp); osl_int_oppose(OSL_PRECISION_MP, &c_mp, b_mp); int c_sp_i = osl_int_get_si(OSL_PRECISION_SP, c_sp); int c_dp_i = osl_int_get_si(OSL_PRECISION_DP, c_dp); int c_mp_i = osl_int_get_si(OSL_PRECISION_MP, c_mp); if (c_sp_i != c_dp_i || c_sp_i != c_mp_i) { error++; printf("Error osl_int_oppose\n"); } } // osl_int_abs if (!error) { osl_int_abs(OSL_PRECISION_SP, &c_sp, b_sp); osl_int_abs(OSL_PRECISION_DP, &c_dp, b_dp); osl_int_abs(OSL_PRECISION_MP, &c_mp, b_mp); int c_sp_i = osl_int_get_si(OSL_PRECISION_SP, c_sp); int c_dp_i = osl_int_get_si(OSL_PRECISION_DP, c_dp); int c_mp_i = osl_int_get_si(OSL_PRECISION_MP, c_mp); if (c_sp_i != c_dp_i || c_sp_i != c_mp_i) { error++; printf("Error osl_int_abs\n"); } } // osl_int_size_in_base_2 if (!error) { size_t r_sp = osl_int_size_in_base_2(OSL_PRECISION_SP, b_sp); size_t r_dp = osl_int_size_in_base_2(OSL_PRECISION_DP, b_dp); size_t r_mp = osl_int_size_in_base_2(OSL_PRECISION_MP, b_mp); osl_int_set_si(OSL_PRECISION_SP, &c_sp, r_sp); osl_int_set_si(OSL_PRECISION_DP, &c_dp, r_dp); osl_int_set_si(OSL_PRECISION_MP, &c_mp, r_mp); if (r_sp != r_dp || r_sp != r_mp) { error++; printf("Error osl_int_size_in_base_2\n"); } } // osl_int_size_in_base_10 // if (!error) { // size_t r_sp = osl_int_size_in_base_10(OSL_PRECISION_SP, b_sp); // size_t r_dp = osl_int_size_in_base_10(OSL_PRECISION_DP, b_dp); // size_t r_mp = osl_int_size_in_base_10(OSL_PRECISION_MP, b_mp); // // osl_int_set_si(OSL_PRECISION_SP, &c_sp, r_sp); // osl_int_set_si(OSL_PRECISION_DP, &c_dp, r_dp); // osl_int_set_si(OSL_PRECISION_MP, &c_mp, r_mp); // // if (r_sp != r_dp || r_sp != r_mp) // { error++; printf("Error osl_int_size_in_base_10\n"); } // } // osl_int_eq // osl_int_ne // osl_int_pos // osl_int_neg // osl_int_zero // osl_int_one // osl_int_mone // osl_int_divisible if (error) { printf("Error with:\n"); printf("\n"); printf("a_sp = "); osl_int_print(stdout, OSL_PRECISION_SP, a_sp); printf("\n"); printf("a_dp = "); osl_int_print(stdout, OSL_PRECISION_DP, a_dp); printf("\n"); printf("a_mp = "); osl_int_print(stdout, OSL_PRECISION_MP, a_mp); printf("\n"); printf("\n"); printf("b_sp = "); osl_int_print(stdout, OSL_PRECISION_SP, b_sp); printf("\n"); printf("b_dp = "); osl_int_print(stdout, OSL_PRECISION_DP, b_dp); printf("\n"); printf("b_mp = "); osl_int_print(stdout, OSL_PRECISION_MP, b_mp); printf("\n"); printf("\n"); printf("c_sp = "); osl_int_print(stdout, OSL_PRECISION_SP, c_sp); printf("\n"); printf("c_dp = "); osl_int_print(stdout, OSL_PRECISION_DP, c_dp); printf("\n"); printf("c_mp = "); osl_int_print(stdout, OSL_PRECISION_MP, c_mp); printf("\n"); printf("\n"); nb_fail += error; } } } printf("%s ", argv[0]); printf("fails = %d\n", nb_fail); #else printf("%s ", argv[0]); printf("works only with GMP\n"); #endif return nb_fail; } cloog-0.18.4/osl/tests/test_just_body.scop0000644000175000017500000000127312413256474015531 00000000000000 # =============================================== Global # Language C # Context CONTEXT 0 2 0 0 0 0 # Parameter names are not provided 0 # One statement 1 # =============================================== Statement 1 # Number of relations describing the statement 0 # ---------------------------------------------- 1.1 Domain # NULL Domain # ---------------------------------------------- 1.2 Scattering # NULL Scattering # ---------------------------------------------- 1.3 Access # NULL Access # ---------------------------------------------- 1.4 Body # Statement body is provided 1 # Number of original iterators 0 # Statement body foo = bar; cloog-0.18.4/osl/tests/test_clay.scop0000644000175000017500000001002512413256474014452 00000000000000# Matmul example, relation representation # =============================================== Global # Backend Language C # Context CONTEXT 1 3 0 0 0 1 1 1 -1 ## N-1 >= 0 # Parameter names are provided 1 # Parameter names N # Number of statements 2 # =============================================== Statement 1 # Number of relations describing the statement 3 # ---------------------------------------------- 1.1 Domain DOMAIN 4 5 2 0 0 1 # e/i i j N 1 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 # ---------------------------------------------- 1.2 Scattering SCATTERING 5 10 5 2 0 1 # e/i s1 s2 s3 s4 s5 i j N 1 0 -1 0 0 0 0 0 0 0 0 ## s1 = 0 0 0 -1 0 0 0 1 0 0 0 ## s2 = i 0 0 0 -1 0 0 0 0 0 0 ## s3 = 0 0 0 0 0 -1 0 0 1 0 0 ## s4 = j 0 0 0 0 0 -1 0 0 0 0 ## s5 = 0 # ---------------------------------------------- 1.3 Access WRITE 3 8 3 2 0 1 # e/i Arr [1] [2] i j N 1 0 -1 0 0 0 0 0 1 ## C 0 0 -1 0 1 0 0 0 ## [i] 0 0 0 -1 0 1 0 0 ## [j] # ---------------------------------------------- 1.4 Body # Statement body is provided 1 # Number of original iterators 2 # Original iterator names i j # Statement body C[i][j] = 0.0; # =============================================== Statement 2 # Number of relations describing the statement 6 # ---------------------------------------------- 2.1 Domain DOMAIN 6 6 3 0 0 1 # e/i i j k N 1 1 1 0 0 0 0 ## i >= 0 1 -1 0 0 1 -1 ## -i+N-1 >= 0 1 0 1 0 0 0 ## j >= 0 1 0 -1 0 1 -1 ## -j+N-1 >= 0 1 0 0 1 0 0 ## k >= 0 1 0 0 -1 1 -1 ## -k+N-1 >= 0 # ---------------------------------------------- 2.2 Scattering SCATTERING 7 13 7 3 0 1 # e/i s1 s2 s3 s4 s5 s6 s7 i j k N 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 ## s1 = 0 0 0 -1 0 0 0 0 0 1 0 0 0 0 ## s2 = i 0 0 0 -1 0 0 0 0 0 0 0 0 0 ## s3 = 0 0 0 0 0 -1 0 0 0 0 1 0 0 0 ## s4 = j 0 0 0 0 0 -1 0 0 0 0 0 0 1 ## s5 = 1 0 0 0 0 0 0 -1 0 0 0 1 0 0 ## s6 = k 0 0 0 0 0 0 0 -1 0 0 0 0 0 ## s7 = 0 # ---------------------------------------------- 2.3 Access WRITE 3 9 3 3 0 1 # e/i Arr [1] [2] i j k N 1 0 -1 0 0 0 0 0 0 1 ## C 0 0 -1 0 1 0 0 0 0 ## [i] 0 0 0 -1 0 1 0 0 0 ## [j] READ 3 9 3 3 0 1 # e/i Arr [1] [2] i j k N 1 0 -1 0 0 0 0 0 0 1 ## C 0 0 -1 0 1 0 0 0 0 ## [i] 0 0 0 -1 0 1 0 0 0 ## [j] READ 3 9 3 3 0 1 # e/i Arr [1] [2] i j k N 1 0 -1 0 0 0 0 0 0 2 ## A 0 0 -1 0 1 0 0 0 0 ## [i] 0 0 0 -1 0 0 1 0 0 ## [k] READ 3 9 3 3 0 1 # e/i Arr [1] [2] i j k N 1 0 -1 0 0 0 0 0 0 3 ## B 0 0 -1 0 0 0 1 0 0 ## [k] 0 0 0 -1 0 1 0 0 0 ## [j] # ---------------------------------------------- 2.4 Body # Statement body is provided 1 # Number of original iterators 3 # Original iterator names i j k # Statement body C[i][j] = C[i][j] + A[i][k] * B[k][j]; # =============================================== Options fission([0,0], 1); cloog-0.18.4/osl/tests/test_no_statement.scop0000644000175000017500000000026712413256474016231 00000000000000 # =============================================== Global # Language C # Context CONTEXT 0 2 0 0 0 0 # Parameter names are not provided 0 # No statement 0 cloog-0.18.4/osl/tests/osl_relation_set_precision.c0000644000175000017500000001005612413270135017353 00000000000000// Copyright © 2014 Inria, Written by Lénaïc Bagnères, lenaic.bagneres@inria.fr // (3-clause BSD license) // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions // are met: // // 1. Redistributions of source code must retain the above copyright notice, // this list of conditions and the following disclaimer. // 2. Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // 3. The name of the author may not be used to endorse or promote products // derived from this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR // IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES // OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. // IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, // INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT // NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF // THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. #include #include #include int main(int argc, char** argv) { if (argc > 1) { printf("argv are ignored\n"); } unsigned int nb_fail = 0; #ifdef OSL_GMP_IS_HERE char * string = "SCATTERING\n" "11 14 9 2 0 1\n" "# e/i| c1 c2 c3 c4 c5 c6 c7 c8 c9 | i1 j | n | 1\n" " 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 ## c1 == 1\n" " 0 0 0 0 0 0 -1 0 0 0 1 0 0 0 ## c6 == i1\n" " 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 ## c3 == 0\n" " 1 0 -32 0 0 0 1 0 0 0 0 0 0 0 ## -32*c2+c6 >= 0\n" " 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 ## c5 == 0\n" " 1 0 32 0 0 0 -1 0 0 0 0 0 0 31 ## 32*c2-c6+31 >= 0\n" " 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 ## c7 == 0\n" " 1 0 0 0 -32 0 0 0 1 0 0 0 0 0 ## -32*c4+c8 >= 0\n" " 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 ## c9 == 0\n" " 1 0 0 0 32 0 0 0 -1 0 0 0 0 31 ## 32*c4-c8+31 >= 0\n" " 0 0 0 0 0 0 0 0 -1 0 0 1 0 0 ## c8 == j\n"; char * * p_string = &string; osl_relation_p r0 = osl_relation_sread(p_string); osl_relation_p r1 = osl_relation_clone(r0); printf("r0 %d =\n", r0->precision); osl_relation_print(stdout, r0); printf("\n"); osl_relation_set_precision(OSL_PRECISION_SP, r1); printf("r1 %d =\n", r1->precision); osl_relation_print(stdout, r1); osl_relation_set_same_precision(r0, r1); nb_fail += osl_relation_equal(r0, r1) ? 0 : 1; printf("nb fail = %d\n\n", nb_fail); osl_relation_set_precision(OSL_PRECISION_DP, r1); printf("r1 %d =\n", r1->precision); osl_relation_print(stdout, r1); osl_relation_set_same_precision(r0, r1); nb_fail += osl_relation_equal(r0, r1) ? 0 : 1; printf("nb fail = %d\n\n", nb_fail); osl_relation_set_precision(OSL_PRECISION_MP, r1); printf("r1 %d =\n", r1->precision); osl_relation_print(stdout, r1); osl_relation_set_same_precision(r0, r1); nb_fail += osl_relation_equal(r0, r1) ? 0 : 1; printf("nb fail = %d\n\n", nb_fail); osl_relation_free(r0); osl_relation_free(r1); printf("%s ", argv[0]); printf("fails = %d\n", nb_fail); #else printf("%s ", argv[0]); printf("works only with GMP\n"); #endif return nb_fail; } cloog-0.18.4/osl/tests/test_just_extbody.scop0000644000175000017500000000142112413256474016245 00000000000000 # =============================================== Global # Language C # Context CONTEXT 0 2 0 0 0 0 # Parameter names are not provided 0 # One statement 1 # =============================================== Statement 1 # Number of relations describing the statement 0 # ---------------------------------------------- 1.1 Domain # NULL Domain # ---------------------------------------------- 1.2 Scattering # NULL Scattering # ---------------------------------------------- 1.3 Access # NULL Access # ---------------------------------------------- 1.4 Body # Statement body is provided 1 # Number of accesses 2 # Access coordinates (start/length) 0 3 6 3 # Basic body # Number of original iterators 0 # Statement body foo = bar; cloog-0.18.4/osl/tests/test_coordinates.scop0000644000175000017500000000056412413256474016043 00000000000000 # =============================================== Global # Language C # Context CONTEXT 0 2 0 0 0 0 # Parameter names are not provided 0 # No statement 0 # =============================================== Options # File name ./ax-do.c # Starting line and column 9 4 # Ending line and column 15 8 # Indentation 2 cloog-0.18.4/osl/tests/test_scop_list.scop0000644000175000017500000000234612413256474015530 00000000000000 # =============================================== Global # Language C # Context CONTEXT 0 2 0 0 0 0 # Parameter names are not provided 0 # One statement 1 # =============================================== Statement 1 # Number of relations describing the statement 0 # ---------------------------------------------- 1.1 Domain # NULL Domain # ---------------------------------------------- 1.2 Scattering # NULL Scattering # ---------------------------------------------- 1.3 Access # NULL Access # ---------------------------------------------- 1.4 Body # Statement body is not provided 0 # =============================================== Global # Language C # Context CONTEXT 0 2 0 0 0 0 # Parameter names are not provided 0 # One statement 1 # =============================================== Statement 1 # Number of relations describing the statement 0 # ---------------------------------------------- 1.1 Domain # NULL Domain # ---------------------------------------------- 1.2 Scattering # NULL Scattering # ---------------------------------------------- 1.3 Access # NULL Access # ---------------------------------------------- 1.4 Body # Statement body is not provided 0 cloog-0.18.4/osl/Makefile.in0000644000175000017500000023020112554424214012473 00000000000000# Makefile.in generated by automake 1.14.1 from Makefile.am. # @configure_input@ # Copyright (C) 1994-2013 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@ # # /*+------------------------------------------------------------------** # ** OpenScop Library ** # **------------------------------------------------------------------** # ** makefile.am ** # **------------------------------------------------------------------** # ** First version: 30/04/2008 ** # **------------------------------------------------------------------** # # # *************************************************************************** # * OpenScop: Structures and formats for polyhedral tools to talk together * # *************************************************************************** # * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * # * / / / // // // // / / / // // / / // / /|,_, * # * / / / // // // // / / / // // / / // / / / /\ * # * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * # * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * # * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * # * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * # * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * # * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * # * | I | | | | e | | | | | | | | | | | | | \ \ \ * # * | T | | | | | | | | | | | | | | | | | \ \ \ * # * | E | | | | | | | | | | | | | | | | | \ \ \ * # * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * # * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * # * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * # * * # * Copyright (C) 2008 University Paris-Sud 11 and INRIA * # * * # * (3-clause BSD license) * # * Redistribution and use in source and binary forms, with or without * # * modification, are permitted provided that the following conditions * # * are met: * # * * # * 1. Redistributions of source code must retain the above copyright * # * notice, this list of conditions and the following disclaimer. * # * 2. Redistributions in binary form must reproduce the above copyright * # * notice, this list of conditions and the following disclaimer in the * # * documentation and/or other materials provided with the distribution. * # * 3. The name of the author may not be used to endorse or promote * # * products derived from this software without specific prior written * # * permission. * # * * # * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * # * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED * # * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE * # * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, * # * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES * # * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR * # * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * # * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, * # * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING * # * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE * # * POSSIBILITY OF SUCH DAMAGE. * # * * # * OpenScop Library, a library to manipulate OpenScop formats and data * # * structures. Written by: * # * Cedric Bastoul and * # * Louis-Noel Pouchet * # * * # ***************************************************************************/ # # Makefile.am (or makefile if generated) of the OpenScop Library. # Makefile.am is not a makefile, you must run the 'autogen.sh' THEN the # configure shellscript to generate the Makefile thanks to this file. ############################################################################# VPATH = @srcdir@ am__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)' am__make_running_with_option = \ case $${target_option-} in \ ?) ;; \ *) echo "am__make_running_with_option: internal error: invalid" \ "target option '$${target_option-}' specified" >&2; \ exit 1;; \ esac; \ has_opt=no; \ sane_makeflags=$$MAKEFLAGS; \ if $(am__is_gnu_make); then \ sane_makeflags=$$MFLAGS; \ else \ case $$MAKEFLAGS in \ *\\[\ \ ]*) \ bs=\\; \ sane_makeflags=`printf '%s\n' "$$MAKEFLAGS" \ | sed "s/$$bs$$bs[$$bs $$bs ]*//g"`;; \ esac; \ fi; \ skip_next=no; \ strip_trailopt () \ { \ flg=`printf '%s\n' "$$flg" | sed "s/$$1.*$$//"`; \ }; \ for flg in $$sane_makeflags; do \ test $$skip_next = yes && { skip_next=no; continue; }; \ case $$flg in \ *=*|--*) continue;; \ -*I) strip_trailopt 'I'; skip_next=yes;; \ -*I?*) strip_trailopt 'I';; \ -*O) strip_trailopt 'O'; skip_next=yes;; \ -*O?*) strip_trailopt 'O';; \ -*l) strip_trailopt 'l'; skip_next=yes;; \ -*l?*) strip_trailopt 'l';; \ -[dEDm]) skip_next=yes;; \ -[JT]) skip_next=yes;; \ esac; \ case $$flg in \ *$$target_option*) has_opt=yes; break;; \ esac; \ done; \ test $$has_opt = yes am__make_dryrun = (target_option=n; $(am__make_running_with_option)) am__make_keepgoing = (target_option=k; $(am__make_running_with_option)) 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 = . DIST_COMMON = $(srcdir)/Makefile.in $(srcdir)/Makefile.am \ $(top_srcdir)/configure $(am__configure_deps) \ $(top_srcdir)/include/osl/scop.h.in \ $(top_srcdir)/autoconf/depcomp $(pkgextensionsinclude_HEADERS) \ $(pkginclude_HEADERS) AUTHORS COPYING ChangeLog NEWS README \ THANKS autoconf/compile autoconf/config.guess \ autoconf/config.sub autoconf/depcomp autoconf/install-sh \ autoconf/missing autoconf/texinfo.tex autoconf/ltmain.sh \ $(top_srcdir)/autoconf/compile \ $(top_srcdir)/autoconf/config.guess \ $(top_srcdir)/autoconf/config.sub \ $(top_srcdir)/autoconf/install-sh \ $(top_srcdir)/autoconf/ltmain.sh \ $(top_srcdir)/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_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 = include/osl/scop.h 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)$(pkgextensionsincludedir)" \ "$(DESTDIR)$(pkgincludedir)" LTLIBRARIES = $(lib_LTLIBRARIES) libosl_la_LIBADD = am__dirstamp = $(am__leading_dot)dirstamp am_libosl_la_OBJECTS = source/libosl_la-scop.lo \ source/libosl_la-statement.lo \ source/extensions/libosl_la-textual.lo \ source/extensions/libosl_la-comment.lo \ source/extensions/libosl_la-null.lo \ source/extensions/libosl_la-clay.lo \ source/extensions/libosl_la-dependence.lo \ source/extensions/libosl_la-scatnames.lo \ source/extensions/libosl_la-arrays.lo \ source/extensions/libosl_la-coordinates.lo \ source/extensions/libosl_la-irregular.lo \ source/extensions/libosl_la-symbols.lo \ source/extensions/libosl_la-extbody.lo \ source/extensions/libosl_la-loop.lo \ source/extensions/libosl_la-pluto_unroll.lo \ source/libosl_la-interface.lo source/libosl_la-generic.lo \ source/libosl_la-relation.lo source/libosl_la-relation_list.lo \ source/libosl_la-vector.lo source/libosl_la-names.lo \ source/libosl_la-strings.lo source/libosl_la-body.lo \ source/libosl_la-int.lo source/libosl_la-util.lo libosl_la_OBJECTS = $(am_libosl_la_OBJECTS) AM_V_lt = $(am__v_lt_@AM_V@) am__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@) am__v_lt_0 = --silent am__v_lt_1 = AM_V_P = $(am__v_P_@AM_V@) am__v_P_ = $(am__v_P_@AM_DEFAULT_V@) am__v_P_0 = false am__v_P_1 = : 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_GEN_1 = AM_V_at = $(am__v_at_@AM_V@) am__v_at_ = $(am__v_at_@AM_DEFAULT_V@) am__v_at_0 = @ am__v_at_1 = 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_CC_1 = 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_CCLD_1 = SOURCES = $(libosl_la_SOURCES) DIST_SOURCES = $(libosl_la_SOURCES) RECURSIVE_TARGETS = all-recursive check-recursive cscopelist-recursive \ ctags-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 \ tags-recursive uninstall-recursive am__can_run_installinfo = \ case $$AM_UPDATE_INFO_DIR in \ n|no|NO) false;; \ *) (install-info --version) >/dev/null 2>&1;; \ esac HEADERS = $(pkgextensionsinclude_HEADERS) $(pkginclude_HEADERS) RECURSIVE_CLEAN_TARGETS = mostlyclean-recursive clean-recursive \ distclean-recursive maintainer-clean-recursive am__recursive_targets = \ $(RECURSIVE_TARGETS) \ $(RECURSIVE_CLEAN_TARGETS) \ $(am__extra_recursive_targets) AM_RECURSIVE_TARGETS = $(am__recursive_targets:-recursive=) TAGS CTAGS \ cscope distdir dist dist-all distcheck am__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP) # Read a list of newline-separated strings from the standard input, # and print each of them once, without duplicates. Input order is # *not* preserved. am__uniquify_input = $(AWK) '\ BEGIN { nonempty = 0; } \ { items[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in items) print i; }; } \ ' # Make sure the list of sources is unique. This is necessary because, # e.g., the same source file might be shared among _SOURCES variables # for different programs/libraries. am__define_uniq_tagged_files = \ list='$(am__tagged_files)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | $(am__uniquify_input)` ETAGS = etags CTAGS = ctags CSCOPE = cscope DIST_SUBDIRS = $(SUBDIRS) 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__post_remove_distdir = $(am__remove_distdir) 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 DIST_TARGETS = dist-gzip 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@ CD = @CD@ CFLAGS = @CFLAGS@ CFLAGS_WARN = @CFLAGS_WARN@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CYGPATH_W = @CYGPATH_W@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ DLLTOOL = @DLLTOOL@ DOXYGEN = @DOXYGEN@ DSYMUTIL = @DSYMUTIL@ DUMPBIN = @DUMPBIN@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ EXEEXT = @EXEEXT@ FGREP = @FGREP@ 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@ 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@ PRTDIAG = @PRTDIAG@ RANLIB = @RANLIB@ SED = @SED@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ STRIP = @STRIP@ TEXI2PDF = @TEXI2PDF@ 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_aux_dir = @ac_aux_dir@ 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@ 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@ AUTOMAKE_OPTIONS = subdir-objects SUBDIRS = . doc tests ACLOCAL_AMFLAGS = -I m4 ############################################################################# lib_LTLIBRARIES = libosl.la ############################################################################# pkginclude_HEADERS = \ include/osl/osl.h \ include/osl/statement.h \ include/osl/interface.h \ include/osl/generic.h \ include/osl/vector.h \ include/osl/relation.h \ include/osl/relation_list.h \ include/osl/macros.h \ include/osl/int.h \ include/osl/names.h \ include/osl/strings.h \ include/osl/body.h \ include/osl/util.h \ include/osl/scop.h pkgextensionsincludedir = $(pkgincludedir)/extensions pkgextensionsinclude_HEADERS = \ include/osl/extensions/textual.h \ include/osl/extensions/comment.h \ include/osl/extensions/null.h \ include/osl/extensions/clay.h \ include/osl/extensions/dependence.h \ include/osl/extensions/scatnames.h \ include/osl/extensions/arrays.h \ include/osl/extensions/coordinates.h \ include/osl/extensions/irregular.h \ include/osl/extensions/symbols.h \ include/osl/extensions/loop.h \ include/osl/extensions/extbody.h \ include/osl/extensions/pluto_unroll.h AM_CPPFLAGS = -I. -I$(top_builddir)/include -I$(top_srcdir)/include AM_CFLAGS = $(CFLAGS_WARN) ############################################################################# libosl_la_CPPFLAGS = -I. -I$(top_builddir)/include -I$(top_srcdir)/include -g libosl_la_SOURCES = \ source/scop.c \ source/statement.c \ source/extensions/textual.c \ source/extensions/comment.c \ source/extensions/null.c \ source/extensions/clay.c \ source/extensions/dependence.c \ source/extensions/scatnames.c \ source/extensions/arrays.c \ source/extensions/coordinates.c \ source/extensions/irregular.c \ source/extensions/symbols.c \ source/extensions/extbody.c \ source/extensions/loop.c \ source/extensions/pluto_unroll.c \ source/interface.c \ source/generic.c \ source/relation.c \ source/relation_list.c \ source/vector.c \ source/names.c \ source/strings.c \ source/body.c \ source/int.c \ source/util.c MAINTAINERCLEANFILES = \ Makefile.in \ aclocal.m4 \ configure \ source/stamp-h.in \ $(AUX_DIST) 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): include/osl/scop.h: $(top_builddir)/config.status $(top_srcdir)/include/osl/scop.h.in cd $(top_builddir) && $(SHELL) ./config.status $@ install-libLTLIBRARIES: $(lib_LTLIBRARIES) @$(NORMAL_INSTALL) @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 " $(MKDIR_P) '$(DESTDIR)$(libdir)'"; \ $(MKDIR_P) "$(DESTDIR)$(libdir)" || exit 1; \ 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)'; \ locs=`for p in $$list; do echo $$p; done | \ sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \ sort -u`; \ test -z "$$locs" || { \ echo rm -f $${locs}; \ rm -f $${locs}; \ } source/$(am__dirstamp): @$(MKDIR_P) source @: > source/$(am__dirstamp) source/$(DEPDIR)/$(am__dirstamp): @$(MKDIR_P) source/$(DEPDIR) @: > source/$(DEPDIR)/$(am__dirstamp) source/libosl_la-scop.lo: source/$(am__dirstamp) \ source/$(DEPDIR)/$(am__dirstamp) source/libosl_la-statement.lo: source/$(am__dirstamp) \ source/$(DEPDIR)/$(am__dirstamp) source/extensions/$(am__dirstamp): @$(MKDIR_P) source/extensions @: > source/extensions/$(am__dirstamp) source/extensions/$(DEPDIR)/$(am__dirstamp): @$(MKDIR_P) source/extensions/$(DEPDIR) @: > source/extensions/$(DEPDIR)/$(am__dirstamp) source/extensions/libosl_la-textual.lo: \ source/extensions/$(am__dirstamp) \ source/extensions/$(DEPDIR)/$(am__dirstamp) source/extensions/libosl_la-comment.lo: \ source/extensions/$(am__dirstamp) \ source/extensions/$(DEPDIR)/$(am__dirstamp) source/extensions/libosl_la-null.lo: \ source/extensions/$(am__dirstamp) \ source/extensions/$(DEPDIR)/$(am__dirstamp) source/extensions/libosl_la-clay.lo: \ source/extensions/$(am__dirstamp) \ source/extensions/$(DEPDIR)/$(am__dirstamp) source/extensions/libosl_la-dependence.lo: \ source/extensions/$(am__dirstamp) \ source/extensions/$(DEPDIR)/$(am__dirstamp) source/extensions/libosl_la-scatnames.lo: \ source/extensions/$(am__dirstamp) \ source/extensions/$(DEPDIR)/$(am__dirstamp) source/extensions/libosl_la-arrays.lo: \ source/extensions/$(am__dirstamp) \ source/extensions/$(DEPDIR)/$(am__dirstamp) source/extensions/libosl_la-coordinates.lo: \ source/extensions/$(am__dirstamp) \ source/extensions/$(DEPDIR)/$(am__dirstamp) source/extensions/libosl_la-irregular.lo: \ source/extensions/$(am__dirstamp) \ source/extensions/$(DEPDIR)/$(am__dirstamp) source/extensions/libosl_la-symbols.lo: \ source/extensions/$(am__dirstamp) \ source/extensions/$(DEPDIR)/$(am__dirstamp) source/extensions/libosl_la-extbody.lo: \ source/extensions/$(am__dirstamp) \ source/extensions/$(DEPDIR)/$(am__dirstamp) source/extensions/libosl_la-loop.lo: \ source/extensions/$(am__dirstamp) \ source/extensions/$(DEPDIR)/$(am__dirstamp) source/extensions/libosl_la-pluto_unroll.lo: \ source/extensions/$(am__dirstamp) \ source/extensions/$(DEPDIR)/$(am__dirstamp) source/libosl_la-interface.lo: source/$(am__dirstamp) \ source/$(DEPDIR)/$(am__dirstamp) source/libosl_la-generic.lo: source/$(am__dirstamp) \ source/$(DEPDIR)/$(am__dirstamp) source/libosl_la-relation.lo: source/$(am__dirstamp) \ source/$(DEPDIR)/$(am__dirstamp) source/libosl_la-relation_list.lo: source/$(am__dirstamp) \ source/$(DEPDIR)/$(am__dirstamp) source/libosl_la-vector.lo: source/$(am__dirstamp) \ source/$(DEPDIR)/$(am__dirstamp) source/libosl_la-names.lo: source/$(am__dirstamp) \ source/$(DEPDIR)/$(am__dirstamp) source/libosl_la-strings.lo: source/$(am__dirstamp) \ source/$(DEPDIR)/$(am__dirstamp) source/libosl_la-body.lo: source/$(am__dirstamp) \ source/$(DEPDIR)/$(am__dirstamp) source/libosl_la-int.lo: source/$(am__dirstamp) \ source/$(DEPDIR)/$(am__dirstamp) source/libosl_la-util.lo: source/$(am__dirstamp) \ source/$(DEPDIR)/$(am__dirstamp) libosl.la: $(libosl_la_OBJECTS) $(libosl_la_DEPENDENCIES) $(EXTRA_libosl_la_DEPENDENCIES) $(AM_V_CCLD)$(LINK) -rpath $(libdir) $(libosl_la_OBJECTS) $(libosl_la_LIBADD) $(LIBS) mostlyclean-compile: -rm -f *.$(OBJEXT) -rm -f source/*.$(OBJEXT) -rm -f source/*.lo -rm -f source/extensions/*.$(OBJEXT) -rm -f source/extensions/*.lo distclean-compile: -rm -f *.tab.c @AMDEP_TRUE@@am__include@ @am__quote@source/$(DEPDIR)/libosl_la-body.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/$(DEPDIR)/libosl_la-generic.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/$(DEPDIR)/libosl_la-int.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/$(DEPDIR)/libosl_la-interface.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/$(DEPDIR)/libosl_la-names.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/$(DEPDIR)/libosl_la-relation.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/$(DEPDIR)/libosl_la-relation_list.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/$(DEPDIR)/libosl_la-scop.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/$(DEPDIR)/libosl_la-statement.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/$(DEPDIR)/libosl_la-strings.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/$(DEPDIR)/libosl_la-util.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/$(DEPDIR)/libosl_la-vector.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/extensions/$(DEPDIR)/libosl_la-arrays.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/extensions/$(DEPDIR)/libosl_la-clay.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/extensions/$(DEPDIR)/libosl_la-comment.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/extensions/$(DEPDIR)/libosl_la-coordinates.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/extensions/$(DEPDIR)/libosl_la-dependence.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/extensions/$(DEPDIR)/libosl_la-extbody.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/extensions/$(DEPDIR)/libosl_la-irregular.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/extensions/$(DEPDIR)/libosl_la-loop.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/extensions/$(DEPDIR)/libosl_la-null.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/extensions/$(DEPDIR)/libosl_la-pluto_unroll.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/extensions/$(DEPDIR)/libosl_la-scatnames.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/extensions/$(DEPDIR)/libosl_la-symbols.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/extensions/$(DEPDIR)/libosl_la-textual.Plo@am__quote@ .c.o: @am__fastdepCC_TRUE@ $(AM_V_CC)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\.o$$||'`;\ @am__fastdepCC_TRUE@ $(COMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\ @am__fastdepCC_TRUE@ $(am__mv) $$depbase.Tpo $$depbase.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 -o $@ $< .c.obj: @am__fastdepCC_TRUE@ $(AM_V_CC)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\.obj$$||'`;\ @am__fastdepCC_TRUE@ $(COMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\ @am__fastdepCC_TRUE@ $(am__mv) $$depbase.Tpo $$depbase.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 -o $@ `$(CYGPATH_W) '$<'` .c.lo: @am__fastdepCC_TRUE@ $(AM_V_CC)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\.lo$$||'`;\ @am__fastdepCC_TRUE@ $(LTCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\ @am__fastdepCC_TRUE@ $(am__mv) $$depbase.Tpo $$depbase.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 $@ $< source/libosl_la-scop.lo: source/scop.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT source/libosl_la-scop.lo -MD -MP -MF source/$(DEPDIR)/libosl_la-scop.Tpo -c -o source/libosl_la-scop.lo `test -f 'source/scop.c' || echo '$(srcdir)/'`source/scop.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/$(DEPDIR)/libosl_la-scop.Tpo source/$(DEPDIR)/libosl_la-scop.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/scop.c' object='source/libosl_la-scop.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) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o source/libosl_la-scop.lo `test -f 'source/scop.c' || echo '$(srcdir)/'`source/scop.c source/libosl_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) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT source/libosl_la-statement.lo -MD -MP -MF source/$(DEPDIR)/libosl_la-statement.Tpo -c -o source/libosl_la-statement.lo `test -f 'source/statement.c' || echo '$(srcdir)/'`source/statement.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/$(DEPDIR)/libosl_la-statement.Tpo source/$(DEPDIR)/libosl_la-statement.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/statement.c' object='source/libosl_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) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o source/libosl_la-statement.lo `test -f 'source/statement.c' || echo '$(srcdir)/'`source/statement.c source/extensions/libosl_la-textual.lo: source/extensions/textual.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT source/extensions/libosl_la-textual.lo -MD -MP -MF source/extensions/$(DEPDIR)/libosl_la-textual.Tpo -c -o source/extensions/libosl_la-textual.lo `test -f 'source/extensions/textual.c' || echo '$(srcdir)/'`source/extensions/textual.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/extensions/$(DEPDIR)/libosl_la-textual.Tpo source/extensions/$(DEPDIR)/libosl_la-textual.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/extensions/textual.c' object='source/extensions/libosl_la-textual.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) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o source/extensions/libosl_la-textual.lo `test -f 'source/extensions/textual.c' || echo '$(srcdir)/'`source/extensions/textual.c source/extensions/libosl_la-comment.lo: source/extensions/comment.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT source/extensions/libosl_la-comment.lo -MD -MP -MF source/extensions/$(DEPDIR)/libosl_la-comment.Tpo -c -o source/extensions/libosl_la-comment.lo `test -f 'source/extensions/comment.c' || echo '$(srcdir)/'`source/extensions/comment.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/extensions/$(DEPDIR)/libosl_la-comment.Tpo source/extensions/$(DEPDIR)/libosl_la-comment.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/extensions/comment.c' object='source/extensions/libosl_la-comment.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) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o source/extensions/libosl_la-comment.lo `test -f 'source/extensions/comment.c' || echo '$(srcdir)/'`source/extensions/comment.c source/extensions/libosl_la-null.lo: source/extensions/null.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT source/extensions/libosl_la-null.lo -MD -MP -MF source/extensions/$(DEPDIR)/libosl_la-null.Tpo -c -o source/extensions/libosl_la-null.lo `test -f 'source/extensions/null.c' || echo '$(srcdir)/'`source/extensions/null.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/extensions/$(DEPDIR)/libosl_la-null.Tpo source/extensions/$(DEPDIR)/libosl_la-null.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/extensions/null.c' object='source/extensions/libosl_la-null.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) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o source/extensions/libosl_la-null.lo `test -f 'source/extensions/null.c' || echo '$(srcdir)/'`source/extensions/null.c source/extensions/libosl_la-clay.lo: source/extensions/clay.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT source/extensions/libosl_la-clay.lo -MD -MP -MF source/extensions/$(DEPDIR)/libosl_la-clay.Tpo -c -o source/extensions/libosl_la-clay.lo `test -f 'source/extensions/clay.c' || echo '$(srcdir)/'`source/extensions/clay.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/extensions/$(DEPDIR)/libosl_la-clay.Tpo source/extensions/$(DEPDIR)/libosl_la-clay.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/extensions/clay.c' object='source/extensions/libosl_la-clay.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) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o source/extensions/libosl_la-clay.lo `test -f 'source/extensions/clay.c' || echo '$(srcdir)/'`source/extensions/clay.c source/extensions/libosl_la-dependence.lo: source/extensions/dependence.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT source/extensions/libosl_la-dependence.lo -MD -MP -MF source/extensions/$(DEPDIR)/libosl_la-dependence.Tpo -c -o source/extensions/libosl_la-dependence.lo `test -f 'source/extensions/dependence.c' || echo '$(srcdir)/'`source/extensions/dependence.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/extensions/$(DEPDIR)/libosl_la-dependence.Tpo source/extensions/$(DEPDIR)/libosl_la-dependence.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/extensions/dependence.c' object='source/extensions/libosl_la-dependence.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) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o source/extensions/libosl_la-dependence.lo `test -f 'source/extensions/dependence.c' || echo '$(srcdir)/'`source/extensions/dependence.c source/extensions/libosl_la-scatnames.lo: source/extensions/scatnames.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT source/extensions/libosl_la-scatnames.lo -MD -MP -MF source/extensions/$(DEPDIR)/libosl_la-scatnames.Tpo -c -o source/extensions/libosl_la-scatnames.lo `test -f 'source/extensions/scatnames.c' || echo '$(srcdir)/'`source/extensions/scatnames.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/extensions/$(DEPDIR)/libosl_la-scatnames.Tpo source/extensions/$(DEPDIR)/libosl_la-scatnames.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/extensions/scatnames.c' object='source/extensions/libosl_la-scatnames.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) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o source/extensions/libosl_la-scatnames.lo `test -f 'source/extensions/scatnames.c' || echo '$(srcdir)/'`source/extensions/scatnames.c source/extensions/libosl_la-arrays.lo: source/extensions/arrays.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT source/extensions/libosl_la-arrays.lo -MD -MP -MF source/extensions/$(DEPDIR)/libosl_la-arrays.Tpo -c -o source/extensions/libosl_la-arrays.lo `test -f 'source/extensions/arrays.c' || echo '$(srcdir)/'`source/extensions/arrays.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/extensions/$(DEPDIR)/libosl_la-arrays.Tpo source/extensions/$(DEPDIR)/libosl_la-arrays.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/extensions/arrays.c' object='source/extensions/libosl_la-arrays.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) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o source/extensions/libosl_la-arrays.lo `test -f 'source/extensions/arrays.c' || echo '$(srcdir)/'`source/extensions/arrays.c source/extensions/libosl_la-coordinates.lo: source/extensions/coordinates.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT source/extensions/libosl_la-coordinates.lo -MD -MP -MF source/extensions/$(DEPDIR)/libosl_la-coordinates.Tpo -c -o source/extensions/libosl_la-coordinates.lo `test -f 'source/extensions/coordinates.c' || echo '$(srcdir)/'`source/extensions/coordinates.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/extensions/$(DEPDIR)/libosl_la-coordinates.Tpo source/extensions/$(DEPDIR)/libosl_la-coordinates.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/extensions/coordinates.c' object='source/extensions/libosl_la-coordinates.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) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o source/extensions/libosl_la-coordinates.lo `test -f 'source/extensions/coordinates.c' || echo '$(srcdir)/'`source/extensions/coordinates.c source/extensions/libosl_la-irregular.lo: source/extensions/irregular.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT source/extensions/libosl_la-irregular.lo -MD -MP -MF source/extensions/$(DEPDIR)/libosl_la-irregular.Tpo -c -o source/extensions/libosl_la-irregular.lo `test -f 'source/extensions/irregular.c' || echo '$(srcdir)/'`source/extensions/irregular.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/extensions/$(DEPDIR)/libosl_la-irregular.Tpo source/extensions/$(DEPDIR)/libosl_la-irregular.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/extensions/irregular.c' object='source/extensions/libosl_la-irregular.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) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o source/extensions/libosl_la-irregular.lo `test -f 'source/extensions/irregular.c' || echo '$(srcdir)/'`source/extensions/irregular.c source/extensions/libosl_la-symbols.lo: source/extensions/symbols.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT source/extensions/libosl_la-symbols.lo -MD -MP -MF source/extensions/$(DEPDIR)/libosl_la-symbols.Tpo -c -o source/extensions/libosl_la-symbols.lo `test -f 'source/extensions/symbols.c' || echo '$(srcdir)/'`source/extensions/symbols.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/extensions/$(DEPDIR)/libosl_la-symbols.Tpo source/extensions/$(DEPDIR)/libosl_la-symbols.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/extensions/symbols.c' object='source/extensions/libosl_la-symbols.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) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o source/extensions/libosl_la-symbols.lo `test -f 'source/extensions/symbols.c' || echo '$(srcdir)/'`source/extensions/symbols.c source/extensions/libosl_la-extbody.lo: source/extensions/extbody.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT source/extensions/libosl_la-extbody.lo -MD -MP -MF source/extensions/$(DEPDIR)/libosl_la-extbody.Tpo -c -o source/extensions/libosl_la-extbody.lo `test -f 'source/extensions/extbody.c' || echo '$(srcdir)/'`source/extensions/extbody.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/extensions/$(DEPDIR)/libosl_la-extbody.Tpo source/extensions/$(DEPDIR)/libosl_la-extbody.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/extensions/extbody.c' object='source/extensions/libosl_la-extbody.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) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o source/extensions/libosl_la-extbody.lo `test -f 'source/extensions/extbody.c' || echo '$(srcdir)/'`source/extensions/extbody.c source/extensions/libosl_la-loop.lo: source/extensions/loop.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT source/extensions/libosl_la-loop.lo -MD -MP -MF source/extensions/$(DEPDIR)/libosl_la-loop.Tpo -c -o source/extensions/libosl_la-loop.lo `test -f 'source/extensions/loop.c' || echo '$(srcdir)/'`source/extensions/loop.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/extensions/$(DEPDIR)/libosl_la-loop.Tpo source/extensions/$(DEPDIR)/libosl_la-loop.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/extensions/loop.c' object='source/extensions/libosl_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) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o source/extensions/libosl_la-loop.lo `test -f 'source/extensions/loop.c' || echo '$(srcdir)/'`source/extensions/loop.c source/extensions/libosl_la-pluto_unroll.lo: source/extensions/pluto_unroll.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT source/extensions/libosl_la-pluto_unroll.lo -MD -MP -MF source/extensions/$(DEPDIR)/libosl_la-pluto_unroll.Tpo -c -o source/extensions/libosl_la-pluto_unroll.lo `test -f 'source/extensions/pluto_unroll.c' || echo '$(srcdir)/'`source/extensions/pluto_unroll.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/extensions/$(DEPDIR)/libosl_la-pluto_unroll.Tpo source/extensions/$(DEPDIR)/libosl_la-pluto_unroll.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/extensions/pluto_unroll.c' object='source/extensions/libosl_la-pluto_unroll.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) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o source/extensions/libosl_la-pluto_unroll.lo `test -f 'source/extensions/pluto_unroll.c' || echo '$(srcdir)/'`source/extensions/pluto_unroll.c source/libosl_la-interface.lo: source/interface.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT source/libosl_la-interface.lo -MD -MP -MF source/$(DEPDIR)/libosl_la-interface.Tpo -c -o source/libosl_la-interface.lo `test -f 'source/interface.c' || echo '$(srcdir)/'`source/interface.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/$(DEPDIR)/libosl_la-interface.Tpo source/$(DEPDIR)/libosl_la-interface.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/interface.c' object='source/libosl_la-interface.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) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o source/libosl_la-interface.lo `test -f 'source/interface.c' || echo '$(srcdir)/'`source/interface.c source/libosl_la-generic.lo: source/generic.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT source/libosl_la-generic.lo -MD -MP -MF source/$(DEPDIR)/libosl_la-generic.Tpo -c -o source/libosl_la-generic.lo `test -f 'source/generic.c' || echo '$(srcdir)/'`source/generic.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/$(DEPDIR)/libosl_la-generic.Tpo source/$(DEPDIR)/libosl_la-generic.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/generic.c' object='source/libosl_la-generic.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) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o source/libosl_la-generic.lo `test -f 'source/generic.c' || echo '$(srcdir)/'`source/generic.c source/libosl_la-relation.lo: source/relation.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT source/libosl_la-relation.lo -MD -MP -MF source/$(DEPDIR)/libosl_la-relation.Tpo -c -o source/libosl_la-relation.lo `test -f 'source/relation.c' || echo '$(srcdir)/'`source/relation.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/$(DEPDIR)/libosl_la-relation.Tpo source/$(DEPDIR)/libosl_la-relation.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/relation.c' object='source/libosl_la-relation.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) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o source/libosl_la-relation.lo `test -f 'source/relation.c' || echo '$(srcdir)/'`source/relation.c source/libosl_la-relation_list.lo: source/relation_list.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT source/libosl_la-relation_list.lo -MD -MP -MF source/$(DEPDIR)/libosl_la-relation_list.Tpo -c -o source/libosl_la-relation_list.lo `test -f 'source/relation_list.c' || echo '$(srcdir)/'`source/relation_list.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/$(DEPDIR)/libosl_la-relation_list.Tpo source/$(DEPDIR)/libosl_la-relation_list.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/relation_list.c' object='source/libosl_la-relation_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) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o source/libosl_la-relation_list.lo `test -f 'source/relation_list.c' || echo '$(srcdir)/'`source/relation_list.c source/libosl_la-vector.lo: source/vector.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT source/libosl_la-vector.lo -MD -MP -MF source/$(DEPDIR)/libosl_la-vector.Tpo -c -o source/libosl_la-vector.lo `test -f 'source/vector.c' || echo '$(srcdir)/'`source/vector.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/$(DEPDIR)/libosl_la-vector.Tpo source/$(DEPDIR)/libosl_la-vector.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/vector.c' object='source/libosl_la-vector.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) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o source/libosl_la-vector.lo `test -f 'source/vector.c' || echo '$(srcdir)/'`source/vector.c source/libosl_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) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT source/libosl_la-names.lo -MD -MP -MF source/$(DEPDIR)/libosl_la-names.Tpo -c -o source/libosl_la-names.lo `test -f 'source/names.c' || echo '$(srcdir)/'`source/names.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/$(DEPDIR)/libosl_la-names.Tpo source/$(DEPDIR)/libosl_la-names.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/names.c' object='source/libosl_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) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o source/libosl_la-names.lo `test -f 'source/names.c' || echo '$(srcdir)/'`source/names.c source/libosl_la-strings.lo: source/strings.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT source/libosl_la-strings.lo -MD -MP -MF source/$(DEPDIR)/libosl_la-strings.Tpo -c -o source/libosl_la-strings.lo `test -f 'source/strings.c' || echo '$(srcdir)/'`source/strings.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/$(DEPDIR)/libosl_la-strings.Tpo source/$(DEPDIR)/libosl_la-strings.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/strings.c' object='source/libosl_la-strings.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) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o source/libosl_la-strings.lo `test -f 'source/strings.c' || echo '$(srcdir)/'`source/strings.c source/libosl_la-body.lo: source/body.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT source/libosl_la-body.lo -MD -MP -MF source/$(DEPDIR)/libosl_la-body.Tpo -c -o source/libosl_la-body.lo `test -f 'source/body.c' || echo '$(srcdir)/'`source/body.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/$(DEPDIR)/libosl_la-body.Tpo source/$(DEPDIR)/libosl_la-body.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/body.c' object='source/libosl_la-body.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) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o source/libosl_la-body.lo `test -f 'source/body.c' || echo '$(srcdir)/'`source/body.c source/libosl_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) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT source/libosl_la-int.lo -MD -MP -MF source/$(DEPDIR)/libosl_la-int.Tpo -c -o source/libosl_la-int.lo `test -f 'source/int.c' || echo '$(srcdir)/'`source/int.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/$(DEPDIR)/libosl_la-int.Tpo source/$(DEPDIR)/libosl_la-int.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/int.c' object='source/libosl_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) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o source/libosl_la-int.lo `test -f 'source/int.c' || echo '$(srcdir)/'`source/int.c source/libosl_la-util.lo: source/util.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT source/libosl_la-util.lo -MD -MP -MF source/$(DEPDIR)/libosl_la-util.Tpo -c -o source/libosl_la-util.lo `test -f 'source/util.c' || echo '$(srcdir)/'`source/util.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/$(DEPDIR)/libosl_la-util.Tpo source/$(DEPDIR)/libosl_la-util.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/util.c' object='source/libosl_la-util.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) $(libosl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o source/libosl_la-util.lo `test -f 'source/util.c' || echo '$(srcdir)/'`source/util.c mostlyclean-libtool: -rm -f *.lo clean-libtool: -rm -rf .libs _libs -rm -rf source/.libs source/_libs -rm -rf source/extensions/.libs source/extensions/_libs distclean-libtool: -rm -f libtool config.lt install-pkgextensionsincludeHEADERS: $(pkgextensionsinclude_HEADERS) @$(NORMAL_INSTALL) @list='$(pkgextensionsinclude_HEADERS)'; test -n "$(pkgextensionsincludedir)" || list=; \ if test -n "$$list"; then \ echo " $(MKDIR_P) '$(DESTDIR)$(pkgextensionsincludedir)'"; \ $(MKDIR_P) "$(DESTDIR)$(pkgextensionsincludedir)" || exit 1; \ fi; \ 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)$(pkgextensionsincludedir)'"; \ $(INSTALL_HEADER) $$files "$(DESTDIR)$(pkgextensionsincludedir)" || exit $$?; \ done uninstall-pkgextensionsincludeHEADERS: @$(NORMAL_UNINSTALL) @list='$(pkgextensionsinclude_HEADERS)'; test -n "$(pkgextensionsincludedir)" || list=; \ files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \ dir='$(DESTDIR)$(pkgextensionsincludedir)'; $(am__uninstall_files_from_dir) install-pkgincludeHEADERS: $(pkginclude_HEADERS) @$(NORMAL_INSTALL) @list='$(pkginclude_HEADERS)'; test -n "$(pkgincludedir)" || list=; \ if test -n "$$list"; then \ echo " $(MKDIR_P) '$(DESTDIR)$(pkgincludedir)'"; \ $(MKDIR_P) "$(DESTDIR)$(pkgincludedir)" || exit 1; \ fi; \ 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. $(am__recursive_targets): @fail=; \ if $(am__make_keepgoing); then \ failcom='fail=yes'; \ else \ failcom='exit 1'; \ fi; \ dot_seen=no; \ target=`echo $@ | sed s/-recursive//`; \ case "$@" in \ distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \ *) list='$(SUBDIRS)' ;; \ esac; \ 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" ID: $(am__tagged_files) $(am__define_uniq_tagged_files); mkid -fID $$unique tags: tags-recursive TAGS: tags tags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files) 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; \ $(am__define_uniq_tagged_files); \ 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-am: $(TAGS_DEPENDENCIES) $(am__tagged_files) $(am__define_uniq_tagged_files); \ 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" cscope: cscope.files test ! -s cscope.files \ || $(CSCOPE) -b -q $(AM_CSCOPEFLAGS) $(CSCOPEFLAGS) -i cscope.files $(CSCOPE_ARGS) clean-cscope: -rm -f cscope.files cscope.files: clean-cscope cscopelist cscopelist: cscopelist-recursive cscopelist-am: $(am__tagged_files) list='$(am__tagged_files)'; \ case "$(srcdir)" in \ [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \ *) sdir=$(subdir)/$(srcdir) ;; \ esac; \ for i in $$list; do \ if test -f "$$i"; then \ echo "$(subdir)/$$i"; \ else \ echo "$$sdir/$$i"; \ fi; \ done >> $(top_builddir)/cscope.files distclean-tags: -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags -rm -f cscope.out cscope.in.out cscope.po.out cscope.files 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 \ $(am__make_dryrun) \ || test -d "$(distdir)/$$subdir" \ || $(MKDIR_P) "$(distdir)/$$subdir" \ || exit 1; \ 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 -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__post_remove_distdir) dist-bzip2: distdir tardir=$(distdir) && $(am__tar) | BZIP2=$${BZIP2--9} bzip2 -c >$(distdir).tar.bz2 $(am__post_remove_distdir) dist-lzip: distdir tardir=$(distdir) && $(am__tar) | lzip -c $${LZIP_OPT--9} >$(distdir).tar.lz $(am__post_remove_distdir) dist-xz: distdir tardir=$(distdir) && $(am__tar) | XZ_OPT=$${XZ_OPT--e} xz -c >$(distdir).tar.xz $(am__post_remove_distdir) dist-tarZ: distdir @echo WARNING: "Support for shar distribution archives is" \ "deprecated." >&2 @echo WARNING: "It will be removed altogether in Automake 2.0" >&2 tardir=$(distdir) && $(am__tar) | compress -c >$(distdir).tar.Z $(am__post_remove_distdir) dist-shar: distdir @echo WARNING: "Support for distribution archives compressed with" \ "legacy program 'compress' is deprecated." >&2 @echo WARNING: "It will be removed altogether in Automake 2.0" >&2 shar $(distdir) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).shar.gz $(am__post_remove_distdir) dist-zip: distdir -rm -f $(distdir).zip zip -rq $(distdir).zip $(distdir) $(am__post_remove_distdir) dist dist-all: $(MAKE) $(AM_MAKEFLAGS) $(DIST_TARGETS) am__post_remove_distdir='@:' $(am__post_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.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 u+w $(distdir) mkdir $(distdir)/_build $(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 \ $(AM_DISTCHECK_CONFIGURE_FLAGS) \ $(DISTCHECK_CONFIGURE_FLAGS) \ --srcdir=.. --prefix="$$dc_install_base" \ && $(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__post_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) $(HEADERS) installdirs: installdirs-recursive installdirs-am: for dir in "$(DESTDIR)$(libdir)" "$(DESTDIR)$(pkgextensionsincludedir)" "$(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) -rm -f source/$(DEPDIR)/$(am__dirstamp) -rm -f source/$(am__dirstamp) -rm -f source/extensions/$(DEPDIR)/$(am__dirstamp) -rm -f source/extensions/$(am__dirstamp) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." -test -z "$(MAINTAINERCLEANFILES)" || rm -f $(MAINTAINERCLEANFILES) clean: clean-recursive clean-am: clean-generic clean-libLTLIBRARIES clean-libtool \ mostlyclean-am distclean: distclean-recursive -rm -f $(am__CONFIG_DISTCLEAN_FILES) -rm -rf source/$(DEPDIR) source/extensions/$(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-pkgextensionsincludeHEADERS \ 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 source/$(DEPDIR) source/extensions/$(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-pkgextensionsincludeHEADERS \ uninstall-pkgincludeHEADERS .MAKE: $(am__recursive_targets) install-am install-strip .PHONY: $(am__recursive_targets) CTAGS GTAGS TAGS all all-am \ am--refresh check check-am clean clean-cscope clean-generic \ clean-libLTLIBRARIES clean-libtool cscope cscopelist-am ctags \ ctags-am dist dist-all dist-bzip2 dist-gzip dist-lzip \ 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-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-libLTLIBRARIES \ install-man install-pdf install-pdf-am \ install-pkgextensionsincludeHEADERS 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-am uninstall uninstall-am uninstall-libLTLIBRARIES \ uninstall-pkgextensionsincludeHEADERS \ uninstall-pkgincludeHEADERS ############################################################################# ctags: ctags -R --c++-kinds=+p --fields=+iaS --extra=+q -f$(HOME)/.ctags . ############################################################################# # 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.4/osl/doc/0000755000175000017500000000000012555417256011266 500000000000000cloog-0.18.4/osl/doc/S4.cloog0000644000175000017500000000074612413256474012524 00000000000000# language: C c # no parameters 0 2 0 1 # One statement 1 # D = {i, j | 2<=i<=4 2<=j<=4} 4 4 # i j 1 1 1 0 -2 1 -1 0 4 1 0 1 -2 1 0 -1 4 0 0 0 0 1 # Scattering function # T = (j+2,3i+j) 2 6 # t1 t2 i j 1 0 1 0 0 -1 0 0 0 1 -1 0 0 1 t1 t2 ############################# # T = (j,i) 2 6 # t1 t2 i j 1 0 1 0 0 -1 0 0 0 1 -1 0 0 2 6 # t1 t2 i j 1 0 1 0 0 -1 -2 0 0 1 -3 -1 0 cloog-0.18.4/osl/doc/htmldoc.tar.gz0000644000175000017500000404550512555415063013776 00000000000000‹3¶Uì]{ã6’Ÿ¿ûSpîæÝ·Ý=z?‚Å3I ›d’q£DÊ-Œ,y$¹1üݯHêeY/K¶»'i#™¶%V±XdýªH©›tÈ}ý∠>¦®³¿²©KÕ¿ù煬躮ɺd¨/$YÑåÒ)TþY%)Žzáà$VAk¹¾û_èç&ëÿ§ôþH£`ÿþWuÕ|îÿS|¶û³®1®áë!ë`lhZKÿkŠlªµþ×%ú_:¤mŸ¿xÿÏê¦~®£$˜]Í~Ÿ]ÅÆ\AÓxå¦è'êј†.ÝœÍìÐ`-FÉf懄Þï¾Ý½´Ùœ­giêá…< Ùú¡¬E¯þñ*/t=»ºyõÏW¬èÙ»(€º¢XHB|<ñyQŒvxÏ®¾:›%+'kȯßã£o}DvèÜ×ï£û‡wÑb‰Ýôû”.ü?Xk|ø†Îü0Eë™ã¡ôaÙpuS×OXvn…N&It—´ßu£`µ; D«t¹JÅwâ/:JúáÀ‚Aäâ`HÁ%½Ò”Æe~¿Ð2Pˆ/齚 ¼ÿ 6‹‚ê6ò ªÞZ%qq3#i›s16¶ÈBzŸ IcŸU»zýž¦Ø(AïiâÆþ’³;ûù†6Þ$DYžE1MF«±ÈCyÙä}Ÿ"ŸÝûqvõËìêøïjöÔ´ðCJ‚?üÄÿ$iòìÞ¿Âes ô*ñÃ90]à4öïÑÝ Ø¢¼|t40Ô¦¬^àO–\`™Æ:á±fÁÝØ¡¡Ê‚“(žãÐO ?D)ôÀ~¢;V]s)-¡f_‡ˆ~^áÀO^C½ÙW”â9Ð! -(ΖÕçF1ȹŒB×"„K⊸èÍ$]"9£õ…:A%{0u(sÉÀZçFÔó|×ç:€&²…q,h˜p ÷p©”GçÇ Œš^ôQsÃAçô:®û8´‰á«çSr±‡ ¥iµ”Ì r­aÑÅ«ÝQtƒoi­ýðÇ>fÖøUZÐPôß[ñ¤r« p§V .Ê×è_`#Ñ-™T«¤.H~Ë´ à#Œ·ò#œS@óùõ%ô<ÍAxµ$‚Ò ]°qãÂÀw ja@YL1œÂ¡¥æ~ê…Ä:ùß³«zX¿p0z?»úfvõíìê{þ¾¿¿,­¸®ì&>?Ï®þwvõÓŠ+ÀÊükvõµ`[0D‰‹S`ɺº@´A,áî;Îïgþ\ÿ)ù»Š¼5Åãý5çýŽ_’¯Qé.J?ñžiÒç\qÊáÉ’ÆzЪ1ÇõYÍ­ðØ½Ü ”T8©³}¢—‹·ëŦ á¿^B±ß»C$.C!Ư@ôÛâ³4 á<½YÏb~“&Ÿüåf--S´ -tw±iõØ[»)púj±ÙŠé~ǪbJ–å—x¶KLUÕ,ÕÖªhÄ°,ÙÜœ±~cÀt¹Œ 6™•pr·SñP™ÙÝœù¿æN’;:©E rÚ|<&D|¹=FñùÅe[I7ˆB*¾†¥ëJ:( 8¡V…ÙŽÂ^LiÞ%  BGÑ9ÍúŒk6#">Y-–]÷ÄÆO'À᧪ÃH—y—Á¥‡( —y î?#º¡î§®â‰ø›ø‹e@ê=äýÚQœ\&4FºJ. ˆÜ®1Å]µLXì{<¾ÓQ:¦ ð¶ûªZ̬³ä2À.ݧ£¶Hz-)ÉÇo1[ê*¼\ÆHõ뤩xvÇ–}´%©-œw•^9CÛ»rè= ×ûšz‡—ZÇ!)iX;*öPˆ»NN>ì‹Æîå‹jÁâÛu}bZø©Þ’#|XÅ0ÆfþªÎ®æ½\k¶­Û.5dÉ“TÕ"’£Ùö4EV,¼9û±óà¹%V°Nç†ÊN¯5ï ¾ JA8· â)—X¡ëFÜ'æGÙ:E Dá÷Ž–ûaõÙÃ>{Øq6e“É.­LðÁ[>uëJkË(¥£¬/Ðî¸ÖÁ”\mÕ\nmÍõš–­¶î)¶E,Õ‘\K‚©¤¤PϱmS–«®wg½¦e*(MôÁcœ$ƒ„ê`Ý«ðP«ÙËi–ž0…JœUJ;=C¯ÜËs|ÁPŸìê-ÓxgƒŽž]ДCâX0ª=ë)!¥þhŒSN£:«Qm Œ$[ÃŽçê–ìÊT§–ÿ`™Ê’æJ®éhU0ÚcÉ¿ §ä©8uªÀ3¸=ƒÛ^àVÆk°bQUÔÎ#ólÛƒvºíð:¼íð­á›Ž%Í´TÃ1 ø_‚˲%WÁ¦žKYªF‰o;OPÛV<ìçhë±iÔz÷óäþ F|G›.ｄaCÇø…ó§¼ÛåSœR&`Í.Šù ØÅ Þa›²ÙÆ:…2C¡„ôJÓŽ#è)?ü+\ûŽ5À7TË”=Ý#šæbÙ³-˜bcÕ6l[3u×Øš]Wr8ZâUõééŸQö˜(Û‰›;HVLG {Xc)£%ñÒäj(3­8ýpŠóÚ IM׶¨J,•j²jÙºf*.V4Ï#ØQ½*B1ú¶(Ô|Âéc¡ý…žŽ=]ÏôóÓ±§ôtløÓ¬¶L‘ÑWH^mÒøe7ðO,a¿ô]åµ1¾ŠÑ óQÝ[ ºRy%5çElƒ²E(ÕtKÕt¢xŽŠ‰§Ú’  œ×‘éX¤“J–¿HºßÝH€Î,6 ßC!ÃE[T>ÕóÄŸõÖÞþî>îqúbá~±„~èVc¿‹xü˜þ`p›f¹òùÜí¸‹Ö…*Þ®Ë-c.6Þ%ñÄP¾dT‡BÉs±îba“˜†çXº,ª2Q¨éê…9iêò¤np7ÓÞÏáý—Þ©Éoç=8{Òhÿ¯Ÿç…¼ {=ÙUü?eZ9óæo×|Ïtáå*×Fø6N7Ñ­q5渲«SÝÅŽb{ªé™0³7ePÕÀ”JÆæìcÇN½6G¦?5ô¡ãõ˜Ëâã°X,® Â_Ð1L¼N·|S²¹>ÁŸ#Åãc2¯æ9p«$~»f' T\@Œlþ°ÓºÖ§zJÕ Krúäùó¢éüU>íù?Šf(råüEœÿ#?ŸÿsŠOqþOǂɺè[#Íçþ¨r~îO…àmõG¬ùq<ß®BþmÐa<ü™íEÝŒu?°yî‹~˜]}“Ã겋¨²ß—ˆ…½¥ÁÅÐzPmQ—{®zæM3¥ð¡Pé~Ü»KwÕÇ⨮"žø—ïÖ˜Î_D6PÁ`¥³“ÓµŸq{WWœ¨ÔLÁã½~¦rïRZÈŸJxÅL¼»‰EaÑ ÃYÊí·å@ŒVxÙ¡æJ<Öл‡mìËáe.H34Ub¾..cNߨw\t^Ä, å^æÊ…ÎøuÝÉäË®TÌÚfs±Ù‚n˜ ›®§°s<ôÒOEÎdøD±#¤;!Ô,¢Žã¡„ìh:QU[Õ][W<‰8S¸h؆bêj+Jð&µƒh’ü̳4;­ÃÞK<mϽ/‹à">îÏ…:–Q’øNðT$‚€e<0†96ð*ÄQ}âx9eOóöÜ`~ð‘CEË(Ù‚‡!ÀÓˆ4œY'Ò4/¨#¡ ˆ«§-tÚ¬NDA=f;€ÃTÃ\F,1ïr9„ó–÷±ae¸ùìX¶tÛ¤D¶¨B Ý ®!Éžf*mæ+Ön¿¹g‡ÁJY6 ³‡ô.ÚÅIqÆ{„S aíW³×w~B/.‘‡ƒ¼”ˆÙ•)ž\. •ñ×àJ{mRÉYÀð‰BÒÃc·/35¹2w±®Ò§i[#ÃSžœÖ¹³9]›‘óù^JôÒOÅÎd²sg\#¾×¨CLM–eæµeIQtÇ0 ì@¸¯™’CÛLŸËÛnùì¶pÜ<"ä«Ä ºˆâq¶ê¾·_‚Ÿ±3¡÷w£ŠbQåw…»þxy‡©Få&döO3W(ØbÜok¾l8Ü-Ûź¢kºf{pÁ2›(6‰bš®MÍ6{ô{Biâ'Ë?$G‹žYN+Fwø*ÓHa,“<Ú]Á`ŠÙ‘Å;‡e‹ãܳ3žI¾J$VYѹXle<ùqÔŒÏ]Çýr§— í&'¢ð½‘•Hð«Ü“,1ƒ‡‚Œ™P~8¿äËSeìöG4Ë: åIhí+ ‡¼œI+hëœ}Ð7œÓd,8<Ô·¶ÌÛSKJ®‡ã—j¹ŽN±a蘺kšG`Éu×Á²îµãW!G;†¹1…@"ƒŒ¼xiJå!ÜìtÍÑ󌞃Z]rôÙ¬¿s®¹*ñ8¼ûð0Ü6ÇO¾wÓGv§eí·w²è›&öm·ÒM¶î‹‡P÷ód“-“¯Ö!ˈ5’" ‰P¯‚"sîC¯=L!L›½g©z`c©€‘±9ÞCQÁ€Â&šm:KšmxŽL)54MÒت¡©x0KoŠLˆv”È'bú‘M:¸§<õàƒ3a¯%ðážW“½i ]è+ !8uvŠ~åFm¢QN¸=hS¥fïÉX,ùK2êA% Äd¥ë‚ …¡ÊÖþ#ûúЪ8ú®x Ãñæ,ªÍ³gè=æ<ˆÇTsÎØ 3gö”¬ž_ÖÀí1V$[1<ÅÖtÉ Ý°,Ý„x¦eÛšç©z›¡gŸòé€H+DçšÙQnÙF½/)ðÑ–(_ÏW=ù´àpG®ìwÃIÖ ¦ìó×,ÔZçP“*Êšr؇Š«ÔϾ%ØËÏÓ€ôÔÏ9Þ´Z:Ï€é‹~“¡‚s9žãçü`ÇN&ÈÄ“öX$–©`E%šEe⦧j®ç`Ë°-")­ë‘BÄ®G˜¥4˜O^Å¥©,–ÁCeÑjúµÜ…-¿ï'MÖôsñ¶©âöâ¡Õ’ð!«p%º2ì™x;boLa=°ÇرfæfÞhÏVTEOfpµ%U¶\€N %_£_Zš&„½c ElQÅ¡TôÐÓ%vá´¡¶¡øfN]9bÒĉó?wóµÓæÿʺ¢ëZýýŸ²¤<çÿžâSäÿúý¹¿Z‘ûëç.×?@Îïn e±w$ß.Tìÿ˼Ãj¹Œb@¢ :gÔÅí®ÔÒ‚) ’jlÛS{÷gÏЦ.W=½³²{0LJwÍ_ñçô¢Ak?øIº™% ]¸ ¿gÀÆOòïJL$ÌZf§ í|½çN⨿g š>šˆ]ÚÅIâÏÉúÝͶ-J•Û–6bò=´¡9oôFÐna¹ýÕŸÜLFíhß)}‡Á· ¥GÅfM¡qþȪwt‘hÅÙ×€l(ÿ`u7È.Do zŠAt7º^¿ÎžŠW›fQîMûŽ¿òÃañ¬éØíeÂÇ7og÷A{Qehó?‚DUÄOÆj7 8>‘G­ôš´ÝkL ¾ärˆþÊv¶œ¢E߲̞ô&žîzóýHC"¥=Á~ÀÏk¯,JˆéêijÎï&B‡SM‡ÞˆŠ[†Ð` óŸžñÕ¶»ì4 ËIhBLÅBïÓAÿŽäÑ %ô jèÕìõ„¦bÒ쬑 ;ýÚŠöµÛê`¯‚gÔSÔq°ix߯²6wÏY:±iåü©úŸYä°X*…dR§êä˳Š¬áãMƒø·â ½ª¬á\ཛÿy`»ñÀrÎP¥|m`ô9ãÃõ ŠâšB>¹ÊàÍ9ç*¹8¨NâI:‰K'1 5ÜbŽ¡Ï‡PÒÎÀyjÊd·V)Eç i|’•{#žÕaÐr¡ßÏà°ãñSÑED&ièK?P5n³ÿê$vd·ï¢ çâŸb†s—µû–ÐÈÛtÙ4ÕlÇ«è{ر%'ÏEv±ØÈwLÜúI‹#øã[güø‹–Ë(™º‚sä™QNxäi7ñÕì–Æ"°ƒfæ¿UR¼üª0© š+;6u_˜ÍEÃ4¢(âgÏ)œdW”avÕ¢A5êÉŠ=\`¢ ¥{Äw*G–Ž§ÎûñÕ#KÝúéX¢£ŸÇ?î:Î ¢ÿ7oú§<m {îÚôrZ›¶Oñ\2¤¾BÒxíÏO(é?&Hú£Ó‰úæÍxI£)Cz„ ÝK’‚.N-) £…å‘;QúiÁÅ9Ç ³9Qÿ¸”“QÍjtXåÅÞÕhZƒ§}e¼»Áá\Ĺã<å{F€6¦ÞºZÅf½¼Þðü-ÉÞ´9¸ƒç׳Â^ò™ÊÛµ˜°嶮¾ôE¢´ßš$-Ê }-Pä‰3ïÜ0q‚jqexs §=zvÃ÷ ­¥k•'k§©‡~ð€~’þ¶Ùl%ØýŽ]ZŠI©îQCõ¨åššä:’†©£É:u[rZm­Ìiõ›òYw¶ÛS¾j>}Sòàu—ˆ+ÝX»3¤+Eɽ:³\f öíL¨ðþ¤ÛX"–j™º§(šC\ݶˆj[VeCÖí¶ÄcÉ0GõRwð< •¬—”Z÷•×vž2±ï”Çî:ìˆz®AdC5-ÝÕ,Jˆë(.5]ìhzkשÚÁ»Néî¹ÆùÛuãå†m+C¨ú{½™nÌQUFèûŠólÙÓÖ¼¤å"Dën¸¦ ƒSBX4l“ R–¬¨Ô0UÙvdŠeÝR]ˆFm×R‰n±!Õ»jÁ\íÈ­g• äoèC=((2z¤È%dL¾.¨Òͳ¹2t[°5¶lU©—S"üúŸ2Á±A–agÛI²Ô`}ûX!6@š6| ¡e9dhÓf9dHó¸–Óuª];ÕÀã혹Ù2ÁŠê’màz +†¢ižãi®D\¯fnÕ”ˆ§kd ¾¥Ù{g¶ñ{€uÉ¥qqÓ`Çß —#P¶È³£ïƨnÉÝÞ1i^âh::¢X©é=1"ó°«®W‘4¼0n«Bq¹(»·G.“eZ"¿Ýƒ3C¹ŒÄ‚~*þ䌞<­èÎá]þp1±£{K²©*šG\UuLÀlËu1Ö5¥dü?ÂTýw1Œ]›3odä7MÁe Úêã¡M‘¹…9Åí"?´h2;rq€ã½A‡o‚jD ±=ª júhGŒ †-œÇ+ÃAº„Ùq$l™Ä¦&Ì<™ØD·ÛÄö.ˆ€<]Éz褿išuomÚ/:h)¹ÿûúözëÞ!^ÐzŒw­ö¾Ûî‹}%éî[9×|SâŠM`ÝC9ªå$¤æ,N Ô×z¶çI¦këšã†‰ +ŽkÈš'+TUkˆ;d×ÓÅcÑûBªj)£ uçœÁr¶ÏÛ}›Þ‚Ýjx¢Îý¬­Кì¦ÜÕÒau9Œ±¾’z’þ?{×Ö$Çmõ¬_1ʃ‹J$ ·~HÙeG.UÅvb*•<0åàJNyvg4Ó+ÿ{tOwO}ÝÝ!ŵʻœiôíûpÎÁ¹Tb>)uɨŒ[–e`­µÒŽÌc2% Á¾ØhD]*Rn¤3Í®YÚSF{6cvRÃÆ ½‹l(z.ó R +k/EÌÃä…¬aÀ¬¶gÀó§ñ¸ã‡$ö¸Û0”qˆ`Ni®„Ì8æ6Ë€²9B*À¸Îɸî>x>¼/ÿXSȽʋ¯^øj™¾I·#@á_žý׺OgÏM?ùÑÿyÚ×f¬»DÌpëÊ%}ºŒÇ6«ÇÑAÔÞ2j(MC$L„~9zB? k) .ÄϺ¹bÇ€H¨’@2š %&Ï°¥’Sÿ®Ä"«n`~® ‘Þ@aë)¼)ŽÁ½»â°«–HƒkÙ!–Qç/•ñªÚØïÅCùöŒÞ‰ÔŠâ5Rw+…ýéR'ñADÎ<}àZà2­KZ<2ÛkÉ\édC•¶Ð­Î"·2k¶õK^Eo ß°Þ½=݉¢0cÐ×­8¼õ‡\.F‹ü×MBëºoußЪØæ#t)Kô^žd/ ûñâgôókÔò ìu´GÓ´¾êø7éæ§ÍO)wŽ™‚R7lÎrm~údÖihMÎ!ÎŒû„¸EKŒ3kCtÑHù¼@'èSÙ´04Û˜¾C8͹v?ÚÍÍ0Ž!-ž¼žìLÉS`—4kùŠü[åÉsˆs&VX«.8GR3©³³U~QàÙIãS°£sô|Ñ ©:Ýò£µ!¨RÖ`6)MWSçYŒ¼Î—ç°Rò-PYçý­±Ÿq:‘FLZ,!2cT¡­ÎÉ !D{T劙÷~è_ή‡•UyO>FŒU£€Z‚Ø3Íh*!y)òzÖzBºº9îÉ´ <—™uÖµŠ`•çć…)mBb%ˆži> º =ޔǣ‹ËŽåŸ'É 5nÔ§v6¿p›q?RÂ%ΖDc“qEœÁ“AÈSLù Á/¯+!?;´:£ÂûŽ“h’TÏ;‚ˆÆ¾Ó!;úqêNŒšò>Ï ïx‡e…/´,…ÚX·µ0!A3  ”eP˜Ì¥™Ê!9M¥x\]­gV¨dö«Õâ'û‘®a<ë †>¥F£¹êy…gÝ#…í¡2&!½> ðe”¤§Ø‘od%¢†úL!"‹ÀZYCã†,Ñ1äÙ×Hò²–rËG/sp\63p¥ÑÅ&ù6§“úFH™ŠÁI}ëèžXCÎmŽ‰ Õ,3 ¡`(Œ´Ïø5FE$B]¸¸õnR,ç`xICQé´c¢»‡çÓt…ž´|Ò=Iãp]%çÅðXwvH`z „)x®GÏRj+1ŸTh¸T<70ÇÆWG28g€R«Š p ÿ—Ïá]áY,îç#fݷĸi [ÏÆ×úI¡5#Y¦ò ar@aX©!ÕÊ*Δ •ÃºÚ1Þ.LÖõŽ ÂÓªmu'V‡œ›üví †šã1RÍÚõÒWô¡f„¤©8ª%ÌT%궭ö\t•eÀ0je†B)¹¡¼ˆ8¼Eàdžԥ¬Åx.#è ·Š®c!½»~’YàMY}ñΔCÁ<^òlp´1‡€üÌÍ1`_­#-¶^ïÄDa•‚j ˆr6iæé>cy,ÉÇا»Ž…»]3’zz•G1Û×ß>4œ\=¨LyÏFs·Ûâ( ß$áÙ7vH‹¡³LãBÆG`G979¢!FÛ 8p« LÐÒB`uËöUn½Ϲ'gù´ž2w€÷µúK·éKg÷Ô 0Œî>ÄÐä>NÁ01j ý¸9«¤ƒ«¤eÔ÷_n÷UÜSf`#spCwý×_€îº>×9C}·_ôq«¯¡ümdþ‹$8Ó#'t¿ž›`WT~ŒJÎäÌÚ Éœqšc-„ [Y¦±¢¬Gít®¯£Áv4‘,×üÖTS¾¿.JS”[6ºe×WÒK)ëjdE'?6&,Ñ0£À3AJÂdc¼FT ú:ì:†Ôë£R€Ÿ,s DÄÌâ…ky Äs5¿¿7ïZôëÜ»‘iK‚ç6gFCÇÜ0«(URÊÜ` Œ°!BäwoÅýÓ D-!ôZ»9öÆ^Üïïw/?„)ÿp¹†×7òRÜ;q"µËé´Øoµ¶‡.›´ÅîÖøLF0!a·,íÓEÒ‰P­w»LýH=±ÔŒ‰,ßP˜C5BÊ,&™»-ýæF1µÊ¹¶TiÄC«!ƒš¶m}Ë{ÊÛÛ¶ó¦ØШ/¬#í%Kö•m®ìGñ¦ã]{ëãCR¨Žv§X?¯ëŸ«îŽÅo)å'DÁ—‘DõÒsMÂ~Zä0:¨…Äœé)•€‘&µ˜Yh­2’ ’ £EŽtNVÂ6ë÷ø õ˜ò—·‚àåeˆ÷‹½ïÍúáýù/߬îv?×wj}†ß‰‡°«[$U⽜ãE|¦âƒ³>¿ö¦Œ ð;ÖLshØôÕ¼ÏN`RU¨u÷;3@Þ›ç±Ùl¶o X’LÐX|£©T2a¦¥‰=: §ÍŒH•F…q6 ’ù|l™[JL' °7ž°h8^³Þ*±¯h4\;ýu‡^W_ïØIZÀÛwêîó ÊjGßá膽yFW_Æ ¸Ï¬E¾Ò+̈à:Dbé "w^ko{·.Oßù¢×ÇÕÉ·:ô/éŸwÆ z¥¶»Õ¿—©Éή¾NL+i÷û–ûcñÏ2ÕWBG—ö³›ÈÍ0ÐkXœÎÙoWüëñâiû¥ï°s7ý° G”o7!+$½gR~3-«äÐwüG‚ªCúye”´éLSËX€r*a÷ ”S 8P‚–ñ9Ýí>¬^\%[ù=£w>¡úì›@òów³ùzÌ9,x Õ¼ ïVŸ„r—{õbÚLý£úæÞùÕ‹+×ùúÞQñró”u}W/F=œÐôøÙîÚø¼ù©Óû×±gdP(†M½‹¨ãâýÚ¼·B™¡—^ (žØY·icýË&ATü°úýVüÚ,ÎÊë0ºùªçQ4TöŽgu­óO•ôUó亩1ftHœRÒ:ö{æ`EôÎáεñé0sã¿ mr†(X@*Qšg™ÕZF8†–5öW;N¾{ãXžÖ}Û¹Ô¾X½ö´õ¯ÿéý÷[;îêV/|©Xí¶ámߎïW\iq Ñ0'å¦1ÃUš÷ëgRÎë oÃ4Ž¨¥‡å“ËÊÿöjžp#KÃ):éàêò(¯-ü:}x7ô׿VÛÍéîltÜëo蕺c÷¡â÷‰ïý¹˜±>¬g¾{÷¨[¶BÇú–v=v³lÓñ1‡&½2“ⶠì ÉAr–¤È pŠ2*i™üÞG£I‰ƒ& åL©LXœc+rM€TðM†Ëëñ+ ïÞ.ïlê%¼š^÷¢©Î®6†°û8‰‹²|%ubûÉÖË€™R ÁûáÔÌ$5Âk ÂEÎQ¾4²´>Á:ikÖçÒMÏjo[”¹£Åá5u¨íÞ™™;ß¹ïþML EOª~¯gëuí=GIßv|ºsi§è Ãí³ŒÎ÷ðgûEJÜ–OâÕÂôU¸~tê˜Ãuéõ1Ñô—ÖÛ=ÄÝÝRùv̧Mù½{úîÉ>,EHWMi;ŽBEƒe-IB3àF4ÀÞ÷e!ÒÂb`3ïLŽm.­ñUb ±\@0LPy"Ýìs6ê ¯4ì‚ 2ʼ /´»©žxœôµñû‰AS+ßȲ§ˆ÷™{Ÿ}Zo4¶ ¼ÚÌ §ÑÃbÍÑîdÍÝîøС„…Ó)Oí`Blnûä†îÝôY™š¨L `õ†&Õ§t]å%Íá·«RG á·Á²–ä·Qe=)q}ŸÓµÅ#„iB%"–©¸qÿ PQó,íÚZ¶ã¶ôÊ¢/ š3:²­²G§X…½ˆ`rN÷uÚœgÓuFDyþîˆu¨)Öºˆ`/³ì—Ī#""NÇuù×AØJÊÞ­’ÏÑ®i?`a“´(]Ž¨ž0GœSb!„ŠŽ`Kl6§3k ™@sˆ™bV©4[ţ‰uÐÝoïjÞóy›‡†ÅÚI{­¨³ ep}A#E¥ w;V»3)ú’'§Úb9QÑÊÞWC¹/=z~DyZW¤Þ®Â_ ëÅùKr™cµ\yTƒì‚aÿê¿ùf‡=º[æ£6Â|ØÞÞnîïÔ÷GħžåÆÝÞÎôyN´S¦E’BŽž…Íв ¢h‘YFAÖÁÙ=ë½qØûûûÛû3ÛGÜ~XHÏ{?=Þñ ø8V¥SÖ#$¬¾\cëä(ªõ&’wu„NàÃz> ¤ÇÕ~/ʘÈGçYÐÄÛ— ɸ=:q»)HF`Ú’‘×ÐÉŒ¸>'IFhä/ɈîódDG0‘p©d$îðª|‚¤K'T˜¢qVΠJVÞA¡dz‚<~y[õpKñûŸ»ùË!xö§j3+àqõ{5ËÕÏQ¬Úü¸ýÕÝmîŽÑ¸»ù ŽÍ9îÞD˜rÃ$üa‡xj_c†ùšü€«Iê¿Í=4v÷5h¹Fß{;ÖøôûþAÃ4wxÃÒS*Òéñá–±>*T»¿ÇŸ§t7¯‚N×7ºz4ܸ0ùåí„x·˜ò,yï«|ŒlËÆ€ôYmžOÓ[)¡m;ñᘹâø?¾rüÁ Ònüðÿ·ÆuŒÿ{üÌ—ÛÇ!þg~ŒlTø®ùǹøŸ÷M¬Îÿ|h7ýó~–)*É‚Ú’¸ÿs«ÕbþçN_ùŸ[÷Ol¤€ÿ¹U#Ãÿœ“Ú{Wo;#ùŸGˆ.ŠmÕHF‚æyH˜²vHÖÈ¡›ü&îÒ‘½ßáäÆŠÚê¡·nÝ™¦·Ž:~æ÷w{ÿÓ/ïÇv£6 ¶f¹n<³ý×ÁW;ò£€cRÿÑU~€áIÈ0Ä)ÞÔå9ųóî«Ìƒ4¤'ŒW³¥5_NÏý©µlG´Շq,™M?µl˜w 1Ë•Œ)(¬Ž#hg )ç,®ŽN®­äÉWÞx쓳aìà<å^q*{¼´æÜÁY„S¼Ìlê‹#’Ð\i¢•ãž* 5'²f³Ê Í Ë¨Ø÷±ƒ¦ÇÜ T3çÀÔž;ˆ•Œ)>ù®Ñli,߇ Tõ²®ú®Êþpxð2ßSõýXG!Êrb ÅbŒ¨àÖzê óªI!=hëÉÖY¿Õ^O#B¾Þú9ÇWNõ·q»íþšos×BøDŸö> Ú—qªtx%§_fFšVçµ6¬·½Ù•îƒåR],ØÐ>èôž·t_¹rkÙczn$ªÈyMÉÿ§ÏÝôy‚öaÓï;V›») ‹p@£ $ÌÕêé¹-]µì‘?Wå§(.&V!Œ…ñÌ`êcZy¤HNq/”åҞƖ;! £a·óAáV;! j°Ø MôY}~Væ2íO’tŒ€Îyì²PÿÁús•ò>{$åí €€«4ÝãáZKŒ‰÷Ž*óÀZ—ÙÙ$uŽ¶Ù÷åŸoFIfæ^âàtMÒGÆ*m—¾?ázPÛ swò±”ææž7P©/%Pì¹'Y)b*üR 1Ç‚dÕwêÑW|Á3åèúe<¯((°×SZÿÍ7•±T¹Þ$KkÔ§tÙ1Ä1]¼­Â”¶~ëÒåÿ_gŸºåäŒYOªŸëøŠ«‡Z×dé¤ÁEeCØ7X.òMN§‹¤\bQ‚€ä#ë=#fE"Vج7a¹c r†ÉL7Á„eÆ´d4Sž¹3ÃÄ „Ê9ý?$ªåt¼†€u•<·‘SÜì~Ç,ÖÎ\ÐÈ žkAå_[ˆÅ3l(¤ÒX‰=ÐÎá€2ÊaLjÉaKö ì§*Æõ…º¯·'Üý¹÷U6H+jŠ¾$Ü´°&+7™bË“0ìì³j¾/칃ÉTtª0¤tæÓ1 ¾iw„¹z;= ³ª‡bN:@¥ËÌ(¤&.FŽ qÞÌuY‘ÓåI Kú*®IË9K’¢Ö‹þ—à¥¬Ç -µ8µàL+µäñ2Ë›y©CaÒ7 B}¹¤Ù®ãeÒ­,¡Páµt† ÃöŠÎ…F{ï‚@©v.x¦Ë/s@˜ó/I/·è8×næ–”ŠVÄTa±[0_QŠ¤˹⡮=f˜8Z÷‘Xþx™±à± ïËéû>øo6ŠdÌŒ½˜óí`ïX`E—5#;A‘áÖÛÜKÁ•ÓD[Aˆ“Ü2NÜkª¡ž‹åž%J‡>€"s?€yleÀb¹lÕx cUh —€y® Õšc¨aÜTn¦X2›-kð?«|¶ØJ^.£ ˳Ù7nÏd½¶NDê·(›ì&Ô]otÔ]Q€U‘Œ¹uwî«»…ƒ¬bŠ¤r|«²s!âÊK„¡,üƒ! ©fÔ HQßî⸫ïÏwU»-Ûá‹/àxŸåàVHðŽRàH'pâtº¯œ&ÍšáÙ6øêíᎴ讆¼ÿ8Ë5Úæ!Þ¿°]ÓÉhÏÒH.:1’ësß–M7°.QÖN[X, ì³^w¹894Ýgê r‘Œ¹ˆ¼s>DÞ5°\¤ûôˆà8A‘‘4¡  ‘J#Ô:*ƒM ìä¥Cta¢tè;(’1÷;˜}–aBÚ%¶þ¬WŒ (\G€°·’YĵÑy£[”Ù©¯è¸êY†©8ž{×>Ë0êÁ¤Q“fâÈæÖÇ–Û·nÕè;±ñ3 ÉêÔbé°„ÙH:ù¨Ç² u¥£ë So5H‚•¤"Ì…”®SJ…é2›8RzÔcŒBg:ê16+õ˜„»UŽz<|Ã<ê11ÛL?êƒßÛš©V§Ý?»‹§Î&H´o3r“dÄÊë4œzפR÷ì¾Òõ§œ ðÿÄüO}ml£Ÿÿ @ âó)½ò?­qÙíêýÍæuø>ßí5úõ¿}±Ù8û£ÛüÝC¹bTûöõ¿»Û_ÝÓÖ¨×oª·ÿ~„àõ›z>NÞw,9ÞüÃ?É•OªHòãzï¾}pæþÁÖ5ÿ+Ô„›¿×r¿muùÍ«fµoÁ×è͇­}º ÿ"oÌýíý÷¯õ­2?½~Sáñíþ§ÜGNÃoOoCsU‘³¯7UZµŽí¢ÍW:tÀn«òZèþf«~º07[‹£§Øµ`ÕãMhá;ó§-û×›FÍg;Ý1öé>Üû*z¸7ûë~ûúËJÉ!øºÒüÄÓ¡ež®š+~yGñŸ®¼~³®þ“¯¶tÉ6ð:øO8%Wü_ã2D#æ$"Šxì8šA@\0 ßK÷ïz÷Šõàuù?B„Çç_ù?W¹ŽüŸÇõ‰¹U÷|P€?uXU¥ïÚ~ªÖÆ•_À«Ÿ··7oÿa>¾ùò_¾¬n¨Ü~™ß…Ó?n·•÷(_½ýc°ö~ÞÞíÂpêè×›4ÑûÉ·|x1ÕUõ3W.ûèù—ã´?ñÕ®4e÷íÏøn%¶ûè)—`½ßTTdw sÓ¼ŒßùéÞ‹Y©;8{QVê4æ_Y©£%&ß)À‘Ę1饄‰4\!C03Xgc”®¬Ô/˜•ºL›×e¥ž¨Õ/’•ºR\Ë™q^CbàØ ÃÀh+µÀÀeÓ?¯¬ÔWVêÁxâ2X•z¢ò¿hVê ¸GÒB&¼Óc´9GHXŠ„çY¸²R¿@Vê2¥]—•z¢âþX©+õ¥B°uj'…“$ÌáJC…˜Á++õ••úÆÝ?KVê2ô[•z"ò}¾¬Ôõ¢D@®…A,,Oœ ‹!¡Ô{é„6›>ze¥¾²R/§äŸ/+õDÐxñ¬Ô¶0Á°$”k‰ FµŠK1Ps©³Gx\Y©_+u¬ËJ=Qo—¬Ô;]†ÀB -&CM&gw®¬Ô/ÈY’ue¥¾²R—BüEY©§BþgÇJ]áõ••úÊJý¹°R—Çú¤Äãó!%®€âJJ|%%¾’·°n"@­OJ< ~7¤Ä¾aÊ ð”pB6Ž8ã•ò\h眥\I‰#T»’¿@ð}Y¤Äeˆ¼>íDD~ d´ØÂç;€=b9V 8å-µB±+í•Œö³Ë—OF[ˆ¦«’ÑNEÒ—AF[ÇšIÀ54À =ªÜv\a!=Ô1`²‡ú^Éh¯d´W2ÚåàÿJF;ʹtfúõZãŠù0X—ÿQ Xƒÿíøßð•ÿaëÈÿpà`ê#Àà@þp¸û»ã¿º´5ÛÿcàKÈöäRm¯æ˧R·Úü> ]ê¢Æžv÷nò&~Û/UÇI=œd½/}¶¹4±™E7¿ÙËšm dátóñä]2³(¯?)/K^|ŽcŽÐ"ö‹6ÜÙ0Mø”s.t8ìzÅø8º…Æg<…kaª…ª½Ju¾Cyxt¿% û뼪[JàhjÙܬX¶^¨A|úÔšªW<·Zqk<¦F0O™âˆp€¥2ž‰Ì*Dðâ¸ÿ”|‰)ðp‰/¾Ôã;kzé¾rÁ¹1®úí”ÃÂ2m1a@!N‰1>÷ÊYOh?ùHáÀt·@»XÓ7@Cu'Ôô Ó†æ$vÕ·Tê‡ß:fM_©ú‚n9é†ÀO¼×N3Ĉó`©ù†_©ÛÏÕIšl¹‹1ì4&¹ZÓï®Æ=Ðn­ÜO#øË;`Rœ® ÚÖnmÒŸ\¨Þ ýŽ©×§Üý5'ªöä€þ¶ˆsóÏÒr!„Ó"c ¢‚aà)¬”œr%°<©å³YÒìÖû-¸ªðóåh¢F ™ ST9â(Ô½.@×þîÓ¾¡ºõo2q@GÄì94Oн³/ ÒB¯½ä\*+”ÈSf_"­C†J%[ÑGÝçOÐþ*/ÈÐ×FÓôx^ˆ‹±ú»ÞLÛI}ï8út½¿æDMŸœ(ß±®±L•6Á:¦Êi©Ã\b‹´aI^.9>9ŸÎܼeþNˉG8Z->µè¦‰v™}Š1Tw¢jLO+íÈXÉ “MZi•2 i­°È£±h á†CšÑªI©¤Ë¤×$Ò%,â¤õÒGÅ™§êdåB•HwL9¯{¡«PÆT;Wšd¢‰RŸ*BJìrÁ œ‘fÆ3$ÂÙI˜F¡3%HÖ tžìȶè¡>hÊÚôyžT”Ûš‹6“ày–ÈBí²»E½z?\{¢ÆÏÈsòŠ/–áX©9ÔLc†Pî¡Ëbœ )DRÍ—LoLÛ Ï*·±3}/—Ø–Mçuûক8xVÙ8¥ŒòBºE½J9\{¢RÎÎ$éŠZw¹­ðH(*§Ôhè%ñœJ)œaÎJšÔÕ²GÊ— «æÌõ9/˜1ÒuÉê?$#Œˆþ$‰‹îZuS:%ýÊ>PwªªONuš~WJr¨ä@›`nSlx°»­ÑÊZC€@ˆ®=N+|a†CGeΔÞÐÕŒ•sbÅ\%±¡þV/˜ÕÐ…Ãé) p¼¿½ðX˜.Å;ýjÇÛíÃ;i… Æ"Ì`á’Ê{Ì‘B–†9úwÖ½wBèèó?ƒ Ù5þ{ X¢ª…–„Z ‰• k,d¡õ^2°ºtÿ®×y¯8ÿCâgqþ/¹êÿõØ2L¬ÒAﱌÐWZI$Á`Ñïàz=¿+Ö²rþÇóîù¿€ó«þ¯qó¿ö ´C)`ä˜Ö¨ð]ós%‚í›X=ìÐnúç½j¤¨dÒEKâû‘ÍýÝc”fPý¶XoS-´ŠNÍMë}:%óc›xûöŸ¾h63æ…užl•|½˜U¸$§®óŠ³öZ÷Ol¤Xþ!morùäÀûK”™6«Û»Þ×>±i‡¹»Õs¨÷®ÞGÌå(v[Žvéj{ÿ>ê<ÂKt¢Û‡Á!8Sæ5=ôé¥+ïvpY}p?ßÿºïhEÓw‘æ‹m|yó‡³(E7:–§fâTÚÖ;bÆbi“Ÿ2ü;±ÓéàhZ¤­µÇÝ·_ýííW Jç—Ìßû¯&²Ú£><ËÜÞßÿôËûá‡hm: ߸ÛêÝ7º[®nÈGy¥‹è¤§D¦hØl^(×oý“`È¢Ò¡•µv]»å^h·¶-¿×´×2)éï¥ï—¼'žñm• Õ™œÂÏëUV/}Ð:”]gÒMñGµÿ“øOÞõVÎì/†/Ub¯)§M5V4P¸™)&Y]íWhbly·wYõÆ_¿®¶Û¶¸´ýkµ1¡ïfËëוݣÏC­këi9Úw ¹íÀ²tw«¿é»/|¯ÿªn"uóñ¨SÙO 3]óGkŽF4(‹íjHW¦0[;œ[ÊÄ°úsñq Ò‰½C`–åÀ5–ñY s…vrx­.•tˆî [–žq¶”èBqÎÂœä„yS“„fY@PF`àÝ©¡¶:\ÜŽ¶e ®ÕÒaÊh·–Cœä+Ý9É@·\ER^¬Þ:pH™ OfÀ›!÷Œð]¥`HÈ?˜¼úiŒâõAñúp’ ^¸‘|uä.Mj‰ö„¯_«×gß½ÍØÜÑÝ%k³¡ÿqüôKê¶þSp«?uƒÁÔˆ8Öy6¥ƒõçéäèe*Ÿc/&tÈyH3˜@XŒ³8Σ”&ŒÂØ…HfÉ̾¿8ÿFjZ3d=äðÜâÈ&gŸtëH)Þ†Ó Ëa¤é&›o£@ùÜ U¿&b@×)Ç%Ñ÷|˜E{.vXHÎÕȺ$ÇjðòëzXCg³û‰B帼 g@FdÁ(ØhÑ8!0!  9É2ðaõ-,u·%ì¦n¹»˜µ~Ï·«‚x¥Q¬fÆHýл:òƒG¬´ÊUMS*ǯB²X©Œ×³ôOÂk9CæDŒR­Ä‹†ÐìªMÙ}Øæ@´*øS²ÚÏë7ëlz™¡!»‡0ʃÂ\$šh²Kæ¬Vœ9'Õ‘-§9 0)eQ’LY‡(ÎqÔŠõféÈ “KÚs¾†Ð“ ƒRؤ·ÌsíH÷×»ÃlÕƒPNV)Û6+?øìÄÍ«Á¯SÏÐ÷ÖÖx–ísMhÞ]W8E ¦¹¸YñN3¬–…Úö´“¨f„)d2t‡QR°C<Ë9Ȳ܅•Å°<¬iS“ÂCõ*#ã”eÔé¼]q“,ÚöXWlÇÛßuÀšÃ½®÷£Kêqª[Utœ'{Z¥,T¶OUñvmõUlm%vÊ —±y&MVûºf¿¢­=ÿ¯;¡OÖ`ù>Jï?0xnÛZÿy`03{®ï )¢žJèX' „W‘H³ûØ‹õb™y·_˘Š×œþÚWþÖ¡ZÛJ-¦`w™Zž-^4æ.3£ß{¾@xT¤ÒÁ@èÃIœ¦9 Ö'YÑ4Jˆx9N,Rÿ25BªSa~TAR-&ÆÅ⤢Øã bºw–;‡y«˜ºÖëvƒÔtyÖ—]²X\ag/så¹ 3×d§É|ë?Å2a‡1–‚Œ†8Mc§qêñ¢Ç~ ݶÞ:•ËÀÁ_…[î\@+3|£z`*NƒnœCª’ï(ýÁhÁw,Æ3._Áˆ»/a S˜}cD`ãÓ•oPãÏá€DsDhpÆrŽ§q’GBp‰X‰yFªùñÇZ¬|¢ ÏŽ~üåù#¥3ü‘µ{ÚPÀg#ƒ{¿Ó+ñîj^h²|«‹ Pýe°ÉÝÀ#E­8[Ä€,& IH1à, ˆäÔ.†Fë…gEÍUñê«‹ÝvóqEö{i”/@éç«—¿Û]½üIÌŒ¤«ÐãÅ?.Â%={mXêÛ”§t# k1«€[½ólkëÏEÉQÚýlž¡ÚGC'܇¨Pæ° <Ä9….#ô'<" •7ÊY #N]Øàà½s;¬ñ®ÔšGië틱ßkò¿nw÷KuÒæ´4”µÚiž:ò¼TN7}‘£™Ùm§æ§ÑiI êíWïÌÑ ˆÕ…Ò½~·Ýí…þ·Ü-•r¢špª/æMññ¸Ë*]‹Gë\µAäîö¸ý9’wþX8óŠ[ËÓ‡cU!@Iq ˆ¬©+«v/h¦e˜R–æ ñ˜E,0”±Õ“(Bõf=¼!ô”eJY{ °9—¢r¾ÚŠ¢ä¼}œïî¶ìRÙf÷ûJ°±ç·;y!ù²Tû(9ðb£« ¸¢Ýìj(‚ÌVº«³H›=«qžXôô °{{>O å– €†Z¼ÈŒÛ®ýÜð ÙÊ4¾ØjYµJœø¶´ö¥s#¾ ¦8¸xxИ¿\(2³·ÛšÎÉBG4âINr Å1ͳ,É`LÈXÎd|­ н ¨Q5á_û"Ú•Ó\dƒàÖ’P©³³c9|Ϙ@÷ƒ‚ãöqÀˆŸÚÀSú%ÆÈÑîýÈ&ÇË5¡ï‚ŽÍù oóÜuÏŸ+Â5­~A¬Ëù‰õºËˆzƒàBB_Sür"ǘæ$–qbpâ, 1f(I9åYš VÓþ;5ÃC¦ÿR¡ ¶÷3bBÃVö“CQÆ7=¶úþp¸»QÃ’Ê߆WAlZÅ&Üšª· û0Mºä3;ÔÙ¿K°u|Ø”ð 04•Óí}HhÄɽўj#ö„u²toéGDRœÃ(KALÆ)C@ˆ!s'Ð#òÉUÞ §Òµ>×ÑTÅFp•ûë5½;¬Læ"¨"§HruNrë‘ÿ˜lCJ¿Ê" ãwGó^usxU¿ ñË«ûÒ·s’ñ³ºSk$`íΟ¿·åH÷rë>j„ôº8Ó"§1FæfI¶PûŽ=IŽó £(‡yÆqžŠmÏÓ aRB dLnѳx h¥üðyò&ž¥iÌê?¥;a2e‹uË7Y)ö¸Pç™RÙ[¹p84¯‚f»˜Y’»¡c˜Âlà8ñiÞìÌ˧6M§q bÎÒ°3¨Î%?wzڧω?ÝüÏIðŠíŽK¶1ÿEÀ’ÿ9xÊÿ|Ž[¿Û“ÛëÕs¿”Q+)þìÓ³ÕŠ³w|õ·|·=J¿›7ÏÿÀ7ïùqMÉóKùãaýßâÇ0x~©Tk¹êIUøïÿ,(«ÃʇkrËßì9Ý홪ù£¨®þ¦è¾1{}yÍåþ&x.ï×ìx-¾¡KºÛìöožgB}~)׆MñÓ»=ÿcñÛáøq#Z”8{¾’}hÕªš«—¿-ûÀÖò¹"ZfdÿënO¯× v¢[`äp-Z¸,ú/¾9þ"8ð?þr{Ü_mÕ‡ÝÝžrùÃóU£éæ¨+W’у¾¿ÚggÌ—ýóŸÞ<ÿV"^IX° ,3hyÖ\˜<¡b‰?´hÎÜžoÔvò©ï,?{alÌ^5We »ËW¿ú“ôõzöú¯yÀC6›UÍ :J¶_ó|Åøî×å…Ð× ëO‘eZ“TVÏ«âpú Í5ŸŠÖ*SèÃêáÓÕ-y'ZÏ•M3Žš¡qZ?÷ì}ùŸîþ?BKʾüôËEД†èIþÏñ©ä_ž7É£}Eº2$ É«Ï"ôP•¥ßVßÊ#Mî~Rn^?W7'[6a3÷¼†Õ3kºOI¿+þuÕf›EÖz¯ÆzsŒªF-¿¶Û1D¬9d÷D|ÇV¦õœòut5© ¯.:Wå.{z)oh_xÑŸBÞ²v;éúGbj;î"=­K;g„í÷2¡iWËshÑôV~s¯òt¬.æ¾B™˜¶Ê˜w(uûÒOÎU¼ˆ1æÕñ “¨“LzQ—Ž®b:›T¯ ékŠr~Ç™â«D¹ã:Ûðº–ЙmTÑ6·YQ¯>½ÏÇQ/£#ð~MW#Çã~Ýyÿ€ŒT2î»_¶ò S‰UmWš"@j2(AªT?$È?^¸Wàv–ïB½p$ù¶¨DßØmxÆ4»Òõ®®ójÉ¢„ÙüfšHî´›Aåæ¡¥=þBPP8dŽ(¤4Œ!ÇQÀ€ºÒ°‡a ¢kíýä9óGë,Ú¼Û‡ëLœy_ÿõYÊ©9çi€ò( fAšã0É!HK8 ³,uÍyã¢TcÎG%¾÷|3íŒõí½ïíôÕ›ø†¦f·oQ}¯À¢¦ÈÛ‰2ú­¨äôkIÚß?[¥G1É“‘`T¾«­Œ©·º©]™yª.Y€¡… v)m&p—mNvn¬º^퉃8\ŠŒOÈÇ…ØíÏ؈0òúµ>ijx–ç÷òáã÷r+$Q²xÌÖ7‡Ò`oïŽÞÅ÷»ûƒ=WA'RƒfËÎÏ-ªíG•%çÆôĬžü7ßï\Yv†+4[¾Ýsº>¨5Ú>˜zŸcõïÊÒKDbô] 6m}ÓèЋèu§âòfªÿ~KwrQ>/èR3LaˆÂðŒ‡9Í¢<  Š ÇAfÝéwoäŸÎîÖ2iAÛU¾†Pñ/[ jºÖÅvwløÓ˧/t췪탾Ë\ûb;B¿ÿ¸;~Úíî{SAB½l󸻂£˜¸¥"NhÃ[¼ƒ×rÚ–sFÏïÄê¤_ESûsÀ÷»ã ñ/€A“Z‘°²$YžmÈöÝyLJ´åÞuZ7 OÝ5 ÚŸ›æà¾ä4®Ú`+Ö°<,/0XU 8`÷½ (ùq,tùÛz³¿æDØœœ²MâçmN³8å,Hàg$@Šó$I 9Ïì:÷qø‚|Êb¹/M…>é=1®_0Ÿ–Ú®Í6ïÌË´è2?±nGûÐLŠ™yÐSâÔ†UpôÑFŸÌ Õ(uºò¬}¢"1[+ ½¥øË8ÏPæyq#Ä"Î9©Ðh×–QÇ#íÌþŽ—{¤ãýN1¾X¦ÖZ!"—b¯´‘Q@ËÒê®b¨Lw¾ÒvÛÉfÔ ïH¨äˆ ˆ`Rã³3B ´Æ¸º(èåÕwrˆ/&¦jŽ»^¡Ø¢O¯èhëÝç†ê`)ðHUyÌmÅ"uþÝcý5'‚˜ª;Ou$ÎlÎ" ˆ Hȃ$ÎXçA€P”€4J±›T7Ý+ùø`$œ+Rß©¤wúÁò[Ù¡ñË2Ž;gd t|<7tž·¡ óØ@‚îóq@0hž'î–#x« ÛŽêûÀ`݉Pa#59,—’vÊùz£Òuï*)íÉq7\Pø´Å³¿ ²§öT)\J]y$’pš = !B, a48‚ÒÔ ‰¶ùTÞdâýîîݵJíÙœK•-”|XßÜÝY4ë”ÄZ„WÍm™äîZñ#­"ŽiEìW/ÿýêåŠ=èÕËÿPÿÿó¥Ì ª£>h ¯ÃA¨ŽLw¤j_êïTŽ4`5CuEƒ6e 7ä£Ü3Ýt†wüØ&z†!u²¡÷W*xCsVšó,•Z„P˜ôËSAU'AZ­™œµÐv÷ò,ä ›½—éR×…[þv×-{ñýÕ˯^þ ßžøOLÖÿ€(þùYmÝå«Dz”š?½«ÿQ}ÿ¡jJE·—‘ùåÐ%©›b[d4R¶0=ÛûÝ-ß?Êèl5S‡ëÝ݆½2ÖØBg—€¿•f49ʲ® ãÐjÿªHÈùV 蜰rͱ€X¢ö„›ï¤Lýj?ßmÛ|ÅþÇêÇ*Ëd#ÇyÙÀ8•X´éV?O¥[AU›n}D±õ¢?¹ åÚm¨Ÿgoc£øõßJ¹2…ÀNØKƒJÒ1mƒ”óÀÊÀ^iÁÛÅ—8QR^rì2=¾“ýúˆE~¼ôÚ™«ÿXHβõ>ﾊeIJ“…Œ'§ˆÂœdHZ}ú•KïÇ& ~·Ùe!tˆqÒ¼L¸Àñ¾Œm4ÔôBÙ†»Cj)3ž6ž¤³n<(µÂvßõXX;O4Öƒ‡!Cu' êzóõDÚ[éò'ô¿ØÆŒÑ7t.K³Y–=ô¶‰Çi6÷&;Ûnõôbú,ÊSßFk–Nf£x^e Y”`ÈxÍ,„Y ,OI³¦Šì¨nëö“—æù¼4!Z1-¨Ø¯¾Ý€º9šhè(¿ÄtØßØáYäȲ×xnD¸÷Ií±d¯ânkמvEíSxIjÒ}8÷ÉÀ¤* 90Hp†Yšò˜ÀpJyŽSj°¢=·KŠÓ9½u,NètÈŸs:}Ïe½V®EÆsr·9VFÀ¿HKëº'ïi}N¨š8äëbXå5Õ€&[/zrà Ø̾x¢n$Æ{4úÚ‚êRçÙÝa¿„U9:ÄÈÐé ʨfE})µ>†êN]y v´oÛºHŸWG8 uP眲(JgÈÈ1%Ì®#é~ºFm0Hqš#RˆTQGŒÐˆT²§ÚŠ½Þ¾ßmd¶:µ¯ÕƪҺ³ÔÅ…<z!•ŸkòžëÓ'Ýͺos’àð:¡„‚´zÀƱL=nÿÔ7éãUƒÍÊÞôH¦Õ">âÅÖ`¨ãÀußÝ.ÙÎÛñ½H±PSÅIpžÎI÷¼‚ óÁ $€(¢ÃH“˜³Ì~°îî»vnvLž]UWgwôºØ™m6Íã¹ê0]#AéLX›œõ-¬&B]Æ”L’å©ôI” vh²íÆ)0F^²ûVúß³í@™ »Ýéé) áÙé7¾ÛMUc,ä#ï®õ]L3¥ÊÄš'º2¼36•«ØáA‡³éÅ›ÁÚS‘D×öƒfl'­óBEœgŒPÆH#Äó0eabÊžbb‡ Ýѱ'e’@ë(©¸:ﺡ´€2âVüôã2û¸ü}¡ÃhüHJôhº5rÖOú#¹ ÔÑerŽ»!»À­gv»Ñ§a}ÙŽ:ÇbÕ5ÛFT–Qš4I2Ää1ve<‘Æ0Â<¶Šäm+çÝê¢6}V=Péhêß_ 'ÆÓkz ±L’¤ÏÉš'dëí‹år&5$袻›†/^áµµV¾xµ‘Tõ¿Ók×w]‡ÑÚ¶ëãtx¡”yx'D’3åw¿z‹þAŽáFFäßíYcTä=Yoä9_ólZõØ©‰¨ÖÎÉJ¾æçÒ#¼b/Óo²@ÝéN +®m~œ“l 17Áš*ŽÕÀ4>€5žûi¡Í»ézÛi§ÿfò¥XKC:A¯S‡l<í¯+U¨ÁôSÅ&¹·ŒLQeËOUµ&•UùÕog>ÑÚfæŸ6ž ¬Èýu'¯ÈþÙª]û`ßÕ罚K9ȳ<)à9Ȳ„ƒ(ˆò äbƒl7îÏO^m·éOq@ŸÁú‹pñÛ,ƒ0m‘{ýZyÙÚ¬÷Ý#„ t_¿–‘$–8\ Ǫ#êËðº û[°Ë®IîBÌ®þ¢\äÿ,„Ê]Ö’О~ÛfݸçtÛ­N‡š6…t­¼îU Ulx9™DuÎBÓ¦´ÀªÓ"øè– c¢$ˆ£çb!«Âg‡€ŠÝ{ jëñ¬G?+j}úÇZŽ`8bñ´ÍZŽŠÝO™¦¥!³*7¥ZD&;ø,¶†õ4濩ꮆ_Ðzç´<-ûkN\·Nf±œc°ÜíFØüAŠ3ŒX€c‡ !š'E" b±'².B-ûbwÙßùÝ­ß“ ×~ŽWLtD¦Br+/^<|º}õ {Åî,Œ8ŠH„Yž‘ˆH`€,e!ÅaVüå·Gmö¹_×8Kó“ºqy¸Ý~ùí‡|û~½ßmÕ)À{²_+Þ®2,]‹÷Çdžq¯®ºÎ‹»¤òhe+”,~^T±q-&6Y§ðRÎ…”úV¿ãŸ9ÿ~sØ=|_VêÛ³«Oƒ³7rî®–±²E‡Cá@?Áx^¹>“Q²–6YŽr•¬ñ«"Z½³ †GÆxس#ô#Ñ|ú“ñÊNnž²í ºp,„á“—ê·î1d!˘Ç1äA–“,Ç£9Ç™ÝË5Þ¾CP]£y¢R×kXâ•®­¾¯•¿RG*$¹:ƒhZ¿KYyµú£ŠZ®d·>º(/ˆWí¸Xbhu¸j_먰V ¾4ç7(]¬åFâã %ˆ*6¸Ù»zxå èoyéÁu½¦×Êé´"Ù< Ñ3kÙÔìPP´Ì¸Ž I(OÖÖíÆÑw¯£îóÓ”ú–F,&~º:}èX× ™2©—Ýr›iÔ~ýºR÷ÅðOŸÿ­›ÿ¦çÎÿ'Ô§nþ¿ð)ÿß9>Uþ¿‚Á¥Üõ¥„i™°Qámó3àÜÄuÝ[¶teÚ¼ÒSSÔ*þÖ¹‹ôåQßvh¶jKúØÓ¶A¦Ìv7ŽúÐHœ9ô¦ Å«1·Ýa©nô—î›ã"û]ã•èÿ+_ˆÁ\\•±POŠ™Riß>—Ìy½ªSwhÁ~ 1¯-Ÿ Ù[Ý©¦--:{~³{_ô~»cÝL€çîʨ4¸·Ðfæ¿~¯¬’€ƒ£´›/°UÑõñdeO9stwç±´|ð%gÏ1Ù!1æàÛb×8ÞižŠÕæh{õ»l²àUõkÁ±ú»É·ŠÙ†—m½wž ïv§/)×|#ßJ£ãz·4„”Õ/Þ™ÒÀ9UÅoœÈÛ0ét@¹k!Sû›²vµÕfêИbô1‰Œ¶ñØñVQëWK/~ñ³ôÀôÂ#@B“,C!ËY¤3$$0%a38TgƒÉâŠ+¹Æ­.êP‹…µ§«øB›wJPQé`÷z/®Ì鈊[~¯iË8†ÛßË;nÝtNK‹Ÿÿ©¬núŠV,rÀ‘bŒ?*ÌúËŸ¤U\]öp-ßZÑH9mª±v’9eZ!›‰Éæ`#¦xC<|l1nØÏ_û|7k‹‹ŸaÄéK8ÕdÀŒ3h¨´8:Ú|6kÃùXè3Ó+Ytøó 0§'k21¬‡þ\|œ‚t4 qA’'9J‚“¼h!šjESœ=\jÔB× ÍŽºdˆãpªrT\5ôS\Š¤&Ó%Ó¯ÙµeÈå`ý¹R99Pg‡Ê)¼SP%šÆ1ÍaÂiòöbýÈÌ2·ÕÚ#ŒÃôÅ¢“£Åòth±ð¢1w±˜‘óÅ€ø^÷”2¿(Ó „‹’$NÓœ„A*Ôâ$¢i”ñ0rX’¿üeTò…ùQ%€±˜Ëƒb3ˆé~“îPš­bÊÿ¼#Öí"©éòÜ Mny:$Ï^4æÊó¨Pçn“ÝÄ(ç Xÿ‰y„a„2˜âb"š„ICŠ°Kħ†;/—®IË X#Ÿ7;°TðóÞQú>‚Ñ‚ïXŒ§K¢PµûpH=(Ì•ÂéáY»d©R$ A # 2@B0rëÒ§™sã5?TëX‹•Ž±µºÐÀ™-JkO8¼¯Õ)át¨ÅxzB¤“ ƒ{¿Ó+ñîj^h²|«‹ Pýe°ÉÝÀ#E­Œ!!–… `(ÈÃ4§rNs%1ìE­žÑzáYQsU¼:Ý»ù¸Òá«PW/·»zù“שÑãÅ?.Â¥fð˃i¬§t# k1«€é°ólkëÏEÉQýlŸ#Ùˈ•¦…€pÌxÈKrä ʃœá€!§F3tÑÌ×RÔ]6QKMÞL!ÒJªÝ±4”µÚñÇ:ò¼ÄÁÚ_ª+VÍÂ;5?þKKê9¨Ìº?VNTNõ•ÙéYO w¬kñè ÃØN­!ú£²købáÌ˧-kLŽU…|q$Å% ²¦vZ¬¬ÚyÄ  óà,á!Ç8£”e(g)OCÌŒ`Òšõð†ÐS–)eí1Àæ\ªœX[Q”¼“qòÝÝVE£]ñý~·—?íùíN† ¸,Õ>J¼Øèj®(G7»ƒŠ #ã;ë³H›=«qžXôô °{{>O å–´L†Z¼ÈŒÛ®ýÜðEÞ$ïE /6‚ZVF­'Žc }é܈¯"J .4æ/ŠÌìí¶¦s² .€ZS¼0’,¦€ M`IJ(Ë‚Yž¦$ b±{P£j¿öE µ+§¹È-À­%¡RggGYùž1îÇíã€?µ§ôK(Œ‘£ÝûQ<çfð¸$îÍs×=®×´ú±.ç'Öè.#ê ‚ }Mñˉé„3’¦…,Î(‰ ED†Ã_~ÜfcvYи²ùÕ ÜÝ×!Nƒæâ~A=U«³|ºŸð7MÞ“Ú9¡MÔ2X$3LD)Æ ç1ÄILQBËŽ ¹2Ç憭ó‹Z:®LeÕmd™ZÁxdöP·-tŒ Q þØ y©»(T‡oûm #¦X6QO‡´Ú/‡€&!‚2:ÏA¢y-Ÿý³à‘ ¶¹<"Í:’áÄ0ɤ¢,† œ'$¦“°Is:I—šG-K³œ›`: ›N¼b&xî<™áú³ bzrè•3ZHçd†–(ˆ¦(' Ï“(ƒAÎÓAJsì@I‰¡—³•~ i¡‡±ö3'„NƒÇ¾9´æ^v÷XQp[å<3ÞtæeEfÊYt×k¨¿‘ò|*›3§œ¤!D9'Î9†£œÅœ‡8Ì8rá\Õ Ÿ‚˜ÍøvÍÈîm;K¤uR½–‡A½¸ö–´Ó{—¸N‡ÈF•JG.Ò¡ê?Ê“q¢“¾·ûp!|(̆ÉÛ Nßë^R”ˆ­NSä¥Yqb±J"–: Á’ù÷85ó¯K#zT‰»6áÅòþ>öõ¿Ø‹ŠÐ¹7Jì;1A»ÄÞ‡Â,±ŸQ´Kìüç;9c€S’à,‘ ‚Ð$΃, @Œix°@4Ñq£³Æ²§8aèPÛY˜_äP=ç´©ñHý §µTµå—œŽFF˜Ñγ!,¬?‰&‡(õÑ?f(a˜‰pF8Á 9ÍÓÉÿ9>Ýø¿ŒßréÔAù@ਸ®úÖöco àºØÈXÀuŹါè'j…´»ÛÓþ"‚Þñc·Èžçý4ª. bh*F°ñóñã­+†ñžoˆÞ¹û4Mgw#ã.!ݱB -”ÑÝÝñö®šÝ+ ÷Ó6'à™þü¡Œá}sìöq™fÏ4™9ñ¿»aº/§ŽÔ=Ô»äʤÑÙ7ª]sÃoNü˜ Y;v¡&)É¥=zsûy¥Ð‡Jbý«èi™³CR­ëÊReFi ¯äf¼úI³y£“Ïž­¾+Älu¡¥û…`?iQø¶`þÕ…Ž[Vý¬ø%Yu%­1RY;l„ öéa¥§Kÿ¿¬Ðüítÿÿzûb X‰ÿWÅ&š›&ý¹a’S ´ñyVýÛáËò`þòk! åŸEœ[¯§…ÀXÿ*„ÆúWV·"Ö}þ¼¯|"G|Õ¾† £ Btõò‡bµhñ÷êÿ6¾Ée¯æß×^Oºß΄¦§Žù<\|ž–F´ñè¨/ÄðmÐn0ª/‹?1üÔÒ?2Ã_÷ïGx»¸Ÿ<±ü#oé‰åÇ`¼û?±ü#oé‰åu´¯õñcw·,Xù¬õçË«ï®^¿Ù¾;þ?ºY“ø¨9ñ‰çOÏó«@qiðê•:ëQÁ¡«º?í9åÚÚmÁóMþ.åÀÅÿ6Yh¬ÿòí˪kAñEuFÖS]ûBÍ>O¢òx¨$ô]órÝð}ö°²}.ÂÅP~åT~ÁúËETüÿ&/ªÕÂ3{â°Ô~ÕíƒêiyK‡Ê¿Q"÷ö“>®ê·~U)Û†OÜMa]yBDÔÖ9ûkM¦åð ! hŠâ<ˆÓ€% pžf!dá0¦iúÐ<âQQ‰ÚBöÍ·ÃɱÙCùw÷š´Y¢{Ú,aña7‹Xòª›Ej'vQ²*ÒñÂ4«•÷­-éþ†9H™ˆ³è㚇ڿOå"]{Š'yçìÖÅaº ƒÅ"æ<ŽY‹?h€HP±C(l±Øínóñš³½º³o¿ÆÏÂg+ùÿ@ŒØq¦yû©ë_SgÓõ)=‘i»„fÃ`—¤Á¯)ãAœšPÈ1"¡ ÊœcÌrˆPœ¡ë"ÀO¸ßiJ‹“ —+ß¹KÏ绂В|W4—bÆ€æ ’…iÌq”ç,%8À¹@NÈ|=ñÝ<¾“~Po?)o¨:gsýÛDRu=c+xm™ÁÚœ¥2˜ `Aœ¦ä0È2ñ`0Š`Àæ?<û©¾Ó( 4½{ì|Ö¸d3ÏÌ„¼_ðÂ|[ÏdJƒwKo¿†Õ4Æ5üñÞ~2X+v,9‘ÉM2³aÒ$hðu§1ÊažÅ˜%A&ˆÝKŽ‚„ç‘äëâð®tò”^†š7Ë»xú’Yáx#½Þœ›šø [ça«Ëh‡­¥œÌ<‡æ2lo§}Ê­–W Ù‰)檯 £Qš"Œò„ļµ&¨+«Z|4Y—ˆDK¨cÓ9¬ÔM'ý.߸JÎ冥tE“ ñ"18ci‚ŠxÈB‚³…0 g,Å° ‚Åqä Lž@p!ìqsïp£/Χ¹ ÛFì뀹»OHÄYò(¨'þaLâäP’Ƹ‚…ø €àzÂyåí§±÷_*¾;yK¹ql3³Azlƒ¦Y²<ƒ™††3á€ó8‹k»{Ï5> ÷âf‰È'åêÒD>öZØx®žÚÒ©¹z”y ®vûS”b”„XÊa¦(ÁˆTìØ’¦¹“«ÏcÕ´\ÝwûÑÎl½÷%{ùzá¶äìÞvNÂÚ½-¼¥(’9V£€Ò°ˆ$1H…úåŒÓ ÆÎÀ‹O~¼Ý¤½·‰'ðöä¶NÎÛ§„íÞMÜ ²œq@DYÄQ†!ŽÓ4pòöã3Ž·]W‹c9o×Ü:¥öTþsœHμ"íbBg³·A Ç,\—â(%1Jã ÉSñó nm +TÕ çl ”GÆhÆåó&«˜÷Ò-Œ6¢ölF3 ž‰ÑÌf;¾'yL!úh¦GŒdîAÙšBlíݾÞé2Z¼ÄAØ£`´‘!(Þ~³¢bÊ“·4‘Ç63{¡Û ‰œIÂP˜9âD"eŽbgažf¤IÆœû«Çç$ðù¹ºT džrÏÕS[:5W/¥~ŽmÐt}!ADišÄq”P‚ó ó, Ò¡ 8¹úñ¹\•«ûwò££,õòõÂm-ÈÙ§µŒnÑ´N#Nhž„…¦1  BéK¼>ñ¶{'?:ÙÞžÜÖÉyû”°=Æj„­yÂsÊpyÀœ–À ,‡nmd úKáí·â‘ Xó`ýÛT^‘uç¿IÅ< óX ç<Æb‡„CžAã$Kk4o¹ëKò¾Y3ΘΣQìÚëm%ÛUÆUÀÇúŽÏñ߯^þ¬rÂÊ®^½üáêå¿^½üIýÿÇòOñåwê‹.óWõËÏê—¿¬ÖHe²‡+±–WDÁK»¹+ý‘üx×ʶýC]FµP΢ËÖbij*SŸÚCZ9–o\b԰ΙÖ “å_÷›¢mëbdËk˜âafL¬‹öè4¸mº¢k’M½Ë¿t¹1þ…d ’„yÄr¢2Ung ÅYØH—kŽ©™"÷/­¹„^¯Å {Ð×B«¯ŽÞï æ;´’œËr{~¸ÛWDfÖÝòû¢Üê¢E㆓¢¸Ì[+Xqÿ±Ì&Ó¨³.ˆ–WîZe‹2ïCýNÏÁ k.ÜV"\•÷ö}Xæ¼Í×ûñ$ Í¦uß›‰nu=PÖ¼¹³áQqzžñæ¤^®èn/æûV´ZäÓñ¿D¼Sä‚Ƶ±ZÜœ)r«„²f¼‹žc}þúuCï±<•Z‹qöP?|_7Œ«&¬ºÁ§¾ƒ 6æ\pk;!Ð5ÛYô n­Ê 6?ÃðÆ8¹ÕÌR’  Ã$c §‰L Îâ ,O©ãZÃéÁ;ÆT>p]®Bš÷\0î¡:L‘Ù°D…<—BÄ?Èg’§%Ì ŠÞî•ìëˆ šän»ùXÓ8µ6ükú«Õ¬¶€Tã«:ŸÑG62uW1“³~kê%’‰-² [°h·¬uKm¥@ÁjúÔ蛳x¼­&Ow{'^Iµ&èÞøãa#jÖH<,˜lݽº€àwÛ/3ånÙjj#ÝŽCµgá ¢àÞë¶x [ÇZ Öƒqàçr¤20WÂâ§,h…0HÄA)„”SãqC›:¯×!“ò­NèçØÎ5²õ]èa°$w4R•|\è‰¸Ý ÖΰŽlww´«[~ $ JQf«ûk!nFCñƒ gèÔF´=ï¯w‡ÑÕ5y¯Ü‘2;i¥^!ÉÔè˜ÂšŽ£¤T©ÇAÓÛæ~9®?KR5‰ îh"wç…³8ŠqÀ¡,À ÐœgG¤)åNyÕ£j ì±%°Õ–jÇK÷µÖ¶Kˆ‚Zß„H]®r²l½?ìï×>kÇã»Á™¼˜‡r# ›ÛÔéÀÛ:s!hûmŠ'PœÎmZ3·Fmjçצ’8á åIN3’¦T€-‰² ‡ ˜tÛÝÞ…åÈ4Æ6̵ïÉFì”.X®2škñL[W7*hƒµíЇÉ7òˆøv³Öš8iœ‚ú˜…»zMAïcÇ6l=ú¥;žçkºV±²&CIßl W9ßû«=xÔAM¥öÔosýåáÞö*7·^ú‘YØr{bév¤ŽÔxS³´§TÀCHP €å,Èć§)cÒ&…SpÜZÔ§‹ZCÐO_2¤Qm?«J5Y©†]™·]Š™Vi<\U¾^O3ÑK:¶•ª‘äƒÉÞ½}ÿ—³\|[ô^­Q`ÞdQÔu ­¼4ÐÖýug¡´$p*„´ïù~€ƒÁ0OcLc9'$¥8Æy€ ˆÃØãrLžžÕ¢èqOèãt®¾YoÏá]ݘƒÑÖÍù»(fHz/†/¯¾S<ßµhm”çu<ÍÔ¯°åKQA;ƒðÔ½@ÔtÓéÎÁ.¹¹Ç¬Šç7â牲œ<Å1ʳ gQˆÁÀ˜±ÐµÁíöÜ w¢¬D,Óz_»R+§Ä=‘Dª©£Ëíª"ýæMðJÓÔàV¤*ûi·ùxõòOël¥Ï÷.ÕÞ+G‡ ö²Öˆcq³V'¢7;¶Î¥öÇÖB@ŽÒC»Ö›Ûméð½wW„€ö=Ç1A&ÓG½{7ÅÕ†Óv°'WîfÁC}1qHW=!bíe`¢Ap1 ¨iž*…8$$uõirÐ+ 5qC$¤ ‡‡AŠeJfИFAœó„€‡gUÕB.È~O”9äÂX‹Wÿ«µø¾Ð%Õizg½´äZ²Þ¾ö¯Êa©ð϶¸T–]IdE¦:ûñÊ4z’ɯD& Î{ûÉT +ù,9IVM"îo´ÄÓ¤gi˜Ìò$à "FAŽa*„4Æ„¤Ïê Iý¢0zþ,´ÝÕËŸ\âŸÄã+9µ5Ç«QG0,ef‰„¢°”<(b†0Ä,NcDrJ1€ˆ#Ê"„²BÂdÎÖZL}ÝSГ$|e’ÐPÓº{ÿŽLô–ž%c•<17½z]—®!-§å0My–†a°8eLÄâãüá™M7“zÞÛ}ø¸çyC1ýtûêÁ_sTÊ™—b†Ÿäí+“·zÆjj˜¨:7P~–Ì5è,+t †ÔEˆÇ9! ’ ¦³0ÏRÊC&T¹0TK]Mûõ–ÜAŠ£(SžP@„„ðá–PåA-wƒ™Êƒ§…îk¼Ú¶\ RÃÞܼò³¯Ag)…°AÒT C‚3†BÄb{ aÈÅŽ)AAÆÀ ©ÖT<5Â0xÚ}-’Ò\jlK’ãù$I˜¾ôô.@î…gpqxÖYp*{žuIjŸ‹X.#ZÎO§- §òáÕèD |„"ôòD¶^ñSšÈå>]ÿôqäOþçø°$Eœ,Šs‰å²#˜’4óðs÷ïésÚEþá+¶;.ÙÆüÇêú=ÉÿY>lýnOn¯Wϥª]­Ÿ?ûôlµâì_ý-šÑ–Üð7ÏÿÀ7ïùQ(4Ï/åÒQûÍó0x~©TJk¹êIUøïÿ,(o¥k„åÃ5¹åoö\h’LÕüQÔ WStß4{|yÍ¥Šü&x.ï×ìx-¾¡KºÛìöožgB}~)5ŽMñÓ»=ÿcñÛáøq#Z“8{¾’í·jUÍ‚ÕËß–í³µ|®ˆ…ÙÿºÛÓë5ƒAè9\‹.‹¾¯Þ?_5h7‡$T±Ñ㹿ºRg8—ýóŸÞ<ÿVe$O_II—ãikI]ùGñyý?aДÿ0@OòŽOåÿ¹Ùín‡²?¢¸ôù,K¿­¾-ùQÒmìp|s0ÖÕDù‡gÎǺެÖ^X\=uô¾«“¯ÍM´§œ³ ¹kMt\O×ÛÛ»ãÊUÞH¿iµf‹\t¨j+­¿Š/ghkDÝ~uYeEóì7é$,l?þ-.ÕP»”ºúžÊ§°*éÍB¶,œyï) Y³ñš%º»”ÎÍRy-€ú} ÆÄöÔt]sýê}£Z´@¹íÆj»ê”û©- £o£6§_ÆûVoÜ£lg|ãÅ¿!š‚,#ÊóœœÄq†Â)£ÍhLía¹·éÂdñf¥£2qiË+K©d¡QA.wwÇFj}ú§f8ŠÒþ*›÷|$‹4TßÚ×WMÅÀ¦Ü4Åqíü\2 óž©žäׯ·üñ¶å{ÊŽÂl«h4ï“Ÿ¡ºeHWž!§ÅÛ.ÊKH—¿°¤‹ÂçqJÂ0ç Ä¡aNãÁ0Ê°UXt?Ýâ’Ý­eL±fH²º’ÚÌÿ»zþéAüËT2·ú§Õ… ƒZÇ“O_è+à•kp·Ç“wŒ*¦>¼-|]±±äÖh `[„ÔL,2LO¬l©h±+¸ÞQgP¦É¨q¢àÒÕŠSÇ©Eehžä‘þªE·(×ŠØ Œ¢6!j*'ƒŠª‰óbƒÐ,dà Ä8… ‚ËûŸAÆ3ûktø,àQ‘m7ÊKⲎ¯ûëÝF‹ø Œ9Äœ Zf@ œ²ìëÐë÷ü²ûLúZ~®]AnŽ‡ÎózÛ:-+‹ýù{r,Xí=Ù¬xöúµ$^ ;øAYqî;Æä¦ÄŽ7j»Ò Zu§B”ª<ÁgÇ 1yF(ö†2€a’¤„G! Š9F,ûÿì}{“·µgþÖ§ ½Ù[Ò^ÉÐtkW)»â87µ‰“|ïݪLÊ‹Æc†×’b“’'*}÷Ðïn4ý ‡R4q4vãày~888îG^#E«•–¤{Íè ›¦ÍÐ$y~¢,?†»°¶Ø•ƒZdõ±R¼·”†F=âDaÁ0šZIµZZ@3ÙKNd¥ÉI¸š$ΑkÖ6ïcFåÑ™pœøã1„\ HŒ£±od·N’­£KrÚ­yçí¤ßÒê9§Ì´3¸¶HU•E°,ÓUi#§Fv©"›—{r©ÚþßÝð5™ û°?–‹³M¯•ŸÉ‘ùÚydÛ Jû •È€“s϶HÌÝËH\Úö›ŽQiF” /ˆ =Èbìq?†4B1‡¤‘• ÝŸñ9gõªT{H:”¬µ“‡öGU¼,™5@RVRgb³ÉTfÅ®•Ë£šL–%vMud¶”d±ø/„ó uEdÛJj—gN9’ŸUŒr4“H’‡fgç`iŲ-Çg˜ÙI;–­¹ìèÌP$K§KÎ’N7pªÒ Oö²HÍK”K(š5öC‘›Ba<µ97V¡`ƒºÅ4çÁ¼âÀÇ„$$ Fžá8û³†¡Õ±‰àW)Ç#`½c&]«<Ÿfâi…‘ë—l+KzRuJ¾Û½ãoy AeóT‘)óÀáÙ›÷'‰PIÕæů¦1˜†~f×¾7áT´¸’ã¬zŒüd6=[©Æ›¬Hi/9'''o’¸¬ò4TþºÄ1ê¡È÷`Dq ùáDØm¤äÇQIÉ·mî›{Gé¬ÇœŽÜó'$}g’SÎÊhsD•vîðÖ+» •ÈpÓó·h\H×1'Ó¸âÕ„‡€²îG>C‹ã ±Ÿ$ ’w¼ÚÍ3ÞdVVfÖz8ë;Ü“Ÿ+5ø'¡pyä”àñ¬;ƒäqyœ,ÜázΉ³`´(k†ÃÒžÍ §Ž4¦ÂjI`ÊMq×xÏV… yß»#£yØCaXDTpJ|•ñ.>‰|³S5¢ég¦Z©“¿^q­Ù?Uqv˜´~s¼ÖG¶{Rs=Eй&iw5ŠÝ9¹5½W›Z£Òñ<íHõÆg‡ÔŽ"xÜ5«†³jí…šóiŸso³ïeÊÞ<aöÇANŸœš‡ ÜßÉiÙ~dåûáÒ9~F̺˜Ó?e ±yŒ„ `#* ‘ðàž¯¸œ ‘ÙÜÕrr K³\t¾–`ÑH¶]ñûýñ¡säQ É•çi7ËÕÜ]ƒ¹ÅcÈmK33pURà یœŸ;€Øpc¸ôDÜÈKÛÞ—Õ}p €Ï#Ž |æá ‚¾à~Â’°ç<•7ô2wÊYÀZ•[Pñ%gÏ »ŠZ„ó"Lyv2™‘óvìédœýWÞ•üîM‹KÍ~èÜ<ƒ08Å‚äR¥¤¸*ŸŽëüSJ/Èä&pik²9§kf€Ñ¾cVt(;›tásˆ4š²RuÜådk´ÇÜ„‚¾i%4‰$òcšH°J¨`J@³9|Ö>Û}1¹èø*¤âÓûýæ¡vªéEœ–ilC¢‘Õ¶YùG­F‘£°Úˆ¤.ÏO{V߳ߥkçx—•ÈÛÖ齓Œ­'wE„"¨ºX@Œì‰󽘺9›Ã( ËE;‰@ê>¨£ç^ý{O/³V¿Sº²;YŽgÓ´œ½mÐ U¹¦ âëYÃ)±BYÕÕïßQ|)›üÇ…ëGõÿîúÿ‡Áeýÿ1 ‚NüágÿÿKü”þÿUÀµ aPhù¦ùçÒáJâ5M“«—~«¬,WOüã Ea¡ÊËÕ7kÚ*¨ 1ÊBV¢úÕŽ§²KÍÃ}ÝA æµ­ú¯ÑÍÊIÁf³N®¯ \{8,Ðuº'Gzç´&î;Ý>ð ÉäÏl#M«×µs“Ùõ¿K{`t²ÈN£Ó½™(4¹—Ye—i[oÓv»e*p žÑ*cŒ ± “›"+t)JªÇ”Ü ·ÐF2}/:©—³æckè1¸s,´ÞF×î>¢æXÒ€†wláEÚ;´äØÛÃúø÷ðŽÓŸÇ/ÿe/%žKëeÌÙò¬çÞžò>¨›á<³us'‡+¿ù3ÔÙÀ2øš"Z]i¤¼Ó+Ǻ1Œ}’NKšR+&']mÉAèj;Bg*ÒÝ!¢já+{6Áq%-UKíåËlΞ÷<-&ÜÊ>/_òÍqà‰¾7eg䜺½šœ6nß}¨ªâ úÇp¾écº)Æ÷a áúT§s8Þ,$,BD0$Hp…!ò 8Æ”øq„°ï{Pžs¤#õuŒÄ*͆Sô‘éáù|a,Àww»t }·¸$!˜'v"”LãõvУªuÛ¨,Ãï“Ù˜è,#¹õ;ù_wôôW\Ëb¢Ä‡ùÀãÄ‹… ÄG„‡¤Ÿë§†8)ɤæ#NÓï¿ãæ¿zªÒC&¨•qHxzÔrÂô£`Ëã¾Z>ìÝv¶7—ígŸf~öéYüìÚgïù¤ÆÓÒ¡§ï…–©“Ή¶¦µug‘†žW2R÷MÓ_DŠ*ʃ$k/ÍEÞ–Ó¿áé0î:ÐXu'0Ðy,}[DOø~D˜©è)IBa,Bî³8àý`:;À€ƒ,5û´8AU6-è@0GyuYh*´è6Äê8ÿ5iàñÎt%eçâŒáÒ¶2L7¼ƒ(4»†e0ÊDyÈ2]Ášqªc¥éŠÜþfíºÜþbíêÜþbíÝübãJÝ‹E4AˆƒL„Ôó=Ž<‚ ‹}B-‚­i:Å\¥ü;ìN·wÚ'²> ÚÇ’ü²¾?Ý爅®¿TÕçÝ0ÒÝiZñ#}ÖQ~µú·›¾yñŸ7/~wóâ?ô¿}®´•™³A¶ƒT^º5RÎÌc^P"õ­vW>ؤîÐ*++Tè¢j¸':ÖEšûßòc“¨¸õŽo6«ìd«êCSl¹¥¥*Ö–<_4¯Y3—Ò<ýöæÅ7/¾ËæQþ'GìKT•¿^k½‹ê›ÿž½¥1SÉü ?WV%{qà{¥±”ýW¤îs=Dî>¦Ï6Ùv{~8>ÈÖéÔËrS¾Û6¬²¬8˨mu«ŽEj ´ nQw )UÄšŽyí™Oç¸ÃÙo¨s…w}ž wZ…pw 7#zT+«¬`ášeRnùõTº%µ"Tj~ù0&×Qb`³ýõ òMä”ßþ©àµ6O˜ ;Éj8 KVkÉ\M±É€âNBVO¹åd®‘¨?µ õ‚rš2'sŸ´Õ™»l6†êÂò˜¦9Å£a‹çTÍ£Ùr$”.ˆˆ€# Ã0æa?^ ²¨ç›ÍwPØIèׯ¶Mζ·¤œò{FUñd¥YÙòµ¤ÝiËž¯~Ð;¹ÜÕÿ8AEyc±M"R¶¤^¾T¿N™ ¾o7»ÝϧðýF¼ÜÚÝ^Ýa™ú†Šnó5ýýÄ -B@ౄÑD@œx ã 1æŒ1‘€È-º}qƒŽ*›Gz:vŠ •”T‘Ñ–·ë·RP·CKWïÐ*¥ÓÏÛÝ»VSÊÚ'cËÝ®uzVD­jtË ip0KŠ*䤘TNå[,åCy€È>+s.¶´]š#†•ep`zM¡‹_çω¨©qA BFA„IàÑÐ#ûŒ q?.L «¹ôÅþåÃlª^+&¯mη-øþZí ;üæ%-¶–»ìðkž-‡žWgϵ1ç„Ó&ã{¥AÚ®ŸÝ&TçÑÁJ5ÁELALîmØ79à ï%óëXh§1‘ž/kšÈžó¶@>ò'tß~)‹&I€h ‰ˆ°z±<Ñ‚È-Û©Û–0¦êyšíu3^ùNeªÕÑ e×jþH…InfzÏKÊB»Vzz9ÇÌÈ·zž)Ôe1g]ò='Û¼™ï”±ÖÿfôT»åïµPFâŠð3½§¢6(ljò¡ 6%ÿVÚrd«Ðr¼¯‚Þ09YTCþ9ŽñuÿÕ¢áepYÉW í¶«)ž.Ë—cW®ªÚ(Ê-N1§‰½kÚ½ -DíiÔÁ`ÊFX(,úwB»mŒC³DyÔ‰tý…ïÉÍõÏÝ;ámχ·fYœi×N½¦ÏÆÌkx™ñOA¬:Úf™uë%eWO_Ü| 5<­·jìî°C·XxÅ°eU÷Ä6qóâÓ£¤›Ô¥yz^såí¼iÈæ0ªÒŸDÍ#ÝmN÷Û숛g‡°_ž˜Oµq|Mâ]Îæ+ÛõÇœûŒÆólwé^"¸‰¡½þÜÃÃÔÏê|s´Ù»ï»m3)’–½EqS8d/-³“5¶Ç¡í¨ñ²ë7£†%w¿&åŶÂÙOf_TqÇó²ŒcŒ`Œ"”`áqX.„L£rÕ›ä뛿Ýݼø‹œÕÔÏûäöI]Õm×ä}Òd&pؽsÝJk®5†“ʈ=wʦYgÔl@óÏ•Kœ©)¦M²ÿí í˜KŸñZéçLv?* íp“Û¹ëÝ÷Ž)îFop²@•…£¥˜/rŒps÷AÁñXàPÀ‡”#Â¥¸.³ìe¬y«§•ž½l†Î“V}ÿ¬7µžÛN–àÜV)ä8¹_=­o]ëíR±Ûêu ïÅŒ”Ù@•öKb¸ò$©%(OWOs³pi}»ÝÚ±)ä«y-îÊn‡(®/– /lºœ˜‘ Ïfé¿L;Tc ŒõïU:W|nGÑÚE¤Ñ ZûÞ${®àž7ÍvZÆ dHç¨Õs¡²æ/¥Ò{ž;~#Ï)òHè“8Á!ó Eù@]X”ÌOËüY3·Ð‰Ã- 1žáâW×ÙÌ»äæ&þ9ÐX. ûÍýv»¶€„@ iˆ‚ !4I08J"H,ÑáòËÏüÍiý–lxf6pÃdk\ØEê§Ï>¼ßõÁ]”\ñ_(ß3éá)|–Ƕ)D&Ýïr—¼æC¾}»>춚½Þ’ÃZùè)o…üÅ;9§\…GKÖý¬*ºy€eýÁcq–mšOѳ2eŠA\SerÃUmÔ–¯fÆÕl¿æüÛMºûð^~XéOOnÞ» áȼùP“²Šj{Ĭh¬3\ë¤Ñ9*·ž—æcù°+-„mÒPW¤ª¡’j9}¯³—/«РYícçz5ý4óÿ²õ᧠ϣ2Ÿ€c"|$9„Pˆ€˜ŒÏlÏÿ  ç¡fþ_„€>çÿ½ÄO•ÿww:HœùN'ûV¶ÿÝì¿.«£Ì ÜKîžTß–žŸ«ÛÙßeÁÔtYÉYÍôÂE©5wJ0ÌÊJôN[žäêš÷NÑF:c fN5iÔÓ•èp0Jbè>ʆ=O×¹¤a|’á`Ïs­ÆëyVœ2W‡ÐžÐõ=jJ¦çÚÓ©ç©BâžGoõäåûæë±9ëãøéæ÷ÑEó¿ÃÀG!hçÆÿKü”øŸ¡Ì-ó» tÏ_þ¦øÐÎöþJuöº8‚;åi«dÆŽÆÙ|Øs)þ9UuÌÞ]õUÙý*×*¸SÈŽU}„öî„ô•^ëþnnÛL„KjµF·ÕØuS“'Rv‘Vܶõ"4ŠË2ê¦.ë^§­£C~(8íUU®’m¯íÉ„KR*\E‹˜)3¹ÎÜëDPϲú IÖ C÷Ì0T9±nR¥LÖ5*%ÔÔ±läé#ª¤ª%—U{ä³²¦lµ•Ñײ2ozÖÛ³5Ì6€$M×·Û1CØ~ËÌÀ®ý)u¯ò( S;’'Üt=®7#¿Öصµ¡nºjç¼ñü}à9!­|×Û’Bµ4˜]¨½Ys¦/i… 嚸Š•½^}ýuôJ¦+x8Óa«“àïo^üéæÅ_–éóeùàÜ]Kß‘ýœYœ·¼–µ×‘6¾.醓Ã96«Út€æt¨*·:LÚ¡3Áœ¡ùß«+Ç»ÃüÍ,»ì(œÙÛaM5)Œ³Ö‘ùeÊ,›RšR²Ư鬽󹞎 ZÍßhðùšÝó,ÐjÉ™‡ünó ¶¥lÏýלÜƯ¯?/n¾žÑ#ÂzÄœ9}9g¡œ@ù Íéñ4Á­çÓÄŠ¼cv)ÛŠ§äc›GµpgÍäýió±õ9ׯÌíö•.à¼wÓW1[¿Í>ð_d©¬w™þèz§øì=Y}½J¦ š›ÝîЀ7OçuóŸê!x¶è>Ž18è Ð,)8à£ñf±A¹ž¡ST¦¯§ož¯ÏVéIgßбR_U£ùF駤ûû8’l¨^J7ÿ}˜ÜÒ¤·ÅÜ+eƒlôêi–ë-=j—'Éýí:Ýže‰”N2}ìöû]:ê86A —{fè~I’^EO~}ó–2qFö¦øËÖ+5¯°W’-_Yç7/ Ióomi/£˜UÕ+½¬ªt…ì nfo ¸pw °÷Ç¢1áoÆh×^qR¶|õjXj¶´ÛÃûkÿóÚ/Ñë×9çþæ×+0}doÏزÿ5£eÿà‡ÝùšöêÕô–íÆ-ÇÑ ³ëƒ, »?wËt ¹‰ÓÊkúx¬üTó²Ð/?^N7¸uÛ€Úv0,ù«t{G¶·¼e ŸûüuMÌe•E9ˆ?ôí}fOꆅuÏê»=)Ý))ÜÌÖH_X§ª.ØÔ?mHºž$KRÿB5¾kQeò+¤åædâfu“ &YÝ|hýD0 ðÂ!‹äQŸ{Q䑘x±Já÷%Ó©BÐæ£Sù œû¡)qåa:3çó,“èb“Õž3’ ‡ 1À Â>)# áÃôÍZlÎŽcmr÷œFg朹zy.hôמ-AQÄQÀ‰Bä”ø>Œ}Áè›-0i¶†@ÏG§Ñ1[ç„I @º¡¢çSYäƒ8$Š#SÁ„ˆ^T„óæÌ8ÀÖÙé)1eü^á¦=Öˆb_0Î’ÆžŸø@qÎcî±€°>þˆâyc}4œ ·†JLëÅ`©g” ( J©#(G1ìSè£{À!ördå¦ X莗ëš/ÓØ*…˜e>,¥¦Ì‰*7%$@€ƒ£ïº‹ÅÚÅT_hêzKölKª¤<®¹y«%r@ƒHp‰‚ PÂŒ R8TKfPm¨ËDçüF\“¿´Ï7»ÂˆeÀ¿h¡"òmYJg}ÈtirÚv¥²Îµ·ƒôÔ Ê¿þ£²õ4´Å-æ%€í]žŽC1˜‘˜ÉËÞ¥Ô$Îa®Nô}œÃ\\ä—sà¤RÈÝbœ„< Á(L" $a’ÕpBƒ„µØ­n4s½L–ê+:Qª¼ã¸ VÌ¥YCÅðvo‡ñzq¹jw™ø$•gàÏ^ùìÖßvâîTòÏn J¥H:٢ǕöN™ãe§ÂìëòÝz\G\É[±îAŠâñθR™ˆ;eù¹øSºz:ñN`·õˆ=]`/–Û7‹"by„ø£4bÄ£^gO/ Ø>)„©ïß%Ä(r}›¹‘ÐÚ4%•)hz‡6¥ l;ªGñ¡öØ49Q²!‡Ñ £½¸ŒH‘ùwÙ f¨ì$€ÉŠÎÃMã#€w!q B!`!G(Ï(b1 C?邈ä‘ëE|†.*øã¶ö‚:qiÃAjœtÐó¦Îì“#‰^:V±-¸»ŽÌQÄIÔy}­9ySy Ì>'²ý¹X‰*²c¹% ‘ çÀµö3ª„µ‹˜M§l/9I‹¬KÎBjMâ’@편0` .@qB?IäóʱEq q]ü箳y1j_o¹Aª)’Y ±ù¤£5ùN‘)Áhͺù5댗Õ9ŽÛJÍÄ7•“…ë)Lᾪô,,É|Râ–ÌŠ¢%œÇQè…ôOS¢$i3oÝÿëz™tæ±k–ô„í[ ‡sRíŒ?šõþ+Fîiz¸Ø˜p,­IìØ$1'´Ü3»yÇžoÆó%_$qgc€L=‚(ø‰²¿ðã8N"‚`LÕb­¼†šŒ{ÐÚïó묊Dę̈dõôÝúx'ÅiÉO*ã‡gµhždžƒ7ªôÿ9íŽk>V]Bf¨u“%uº8Æóî\JƒÅîÍ­í àBa"ëç¥'$,íRYp#~ÔËs …/¢H _#(€"Ïó0GT[7š¬@¯`~¬ [¨Â&ë«'½R$‚é±ë`Øó• ›TV¬òZ¼“/:ç¸Gµxæâ|S¯’×W yÖ£ï@ a¾ŒüjˆfãýéT'áΈ1‘8b–pH=† yZ=gIžòè Wsòq5Y³©åÝtÕÂ#<Óp¥–´ÇºšíN}#¨Ìb g§¾µñN¬FçB—cclBCŒbO=áÁ˜…~H`” à d< »Ô—éÑ™b¢-çÆP”\¹Â ']M²îv÷§é3=i餜6ÆñuéœgâÇ*Y‡…§)Láçªô,¡¶$óI™†'†>Pn†añÀã^òDÅò=£iø¿~6 ï3 °`aÃpU¿™cÖìf)7ÉÖ³ùk}QÖ#–2$ñ’Ðã4ÂóXpŠ $ÿèã\_>Éëe“uÕâÑTžIœã»wO…c™QŽƒ1ÅóΚ×RjRjèkj\ó.)Ë_á.†0¢ Ž¼€Æž ò Eõå¿„'XÄ5Ùõ7ÿ²ë:Íú9C|w_ôq‹¯:ü­‘ÉÔ+sÚKNbÐÃz®ƒ]!ø‘œÏÎÈÚ€1¤‘Ï‘GbÅÈ, bžÉ 1ën¿Õ"[§û²® Û•–Æø¡tPU9ã²Uþ4ëù>3B|X¥G&e®gFc»LXÃ5ßñ²Ê;’ª}1áY¸eÎêVvCÖy9¼ä´:%K8ù±VaÎ 3<ûhBH¢TW6Fkt¦PÐ]³k§vß²1üdšS À@f.té-`ÏU¾åïZ ËÜû‘nK@NxäÅIH!F±`qâûG ¹Õk ÄßÞ‘í-o¢æ,tÃd.ãýáýþ«º ¸_Ãî@6ɽ#[m©[HÛÉ>—8Öºj&i3ÖxOF0Áa7íd’jAìŽP­µ»þ:BÉ5c"ʘ/”}¨FP™…$s¯¥?BߨûJÄÜ#D¾€œbŽ @ߨGçþ¹émÛþNSÎÐhȬî%³æ•­ïìGr›—Qª½õñÁ*”oË&–ïä×õ?ÊìŽÙù7™ÏZÂÊÕK×5‰÷í$Ýà "bR Ø«XÜhÜ|Ø( ŒÕ°3¡Ø™G >÷£Ä 8Aˆ'8hÆïQU<¥º·‚૦‰÷’ƒÊÍúá}ñáÉ»ìÃê~ÿj¤Ö[]üž<è[ÝÌ©*#/ᥰQ ˜²/ y~­Ž2B³ß±Bš´v¦/ë}t;KT¡Öè;+3@4èç±Ùlv·, &h,£©P2¡¦¥GЕÃ9¢$Œ„£@„‰ç!°Çq’^AWpÞ¸Ã"w~ £Äj~E£ÙµW_—ªúËNb©´}©«ºO%(«}éQ»}DUŸùˆxÄăPýp OÌc`Rõ¥Cº¾<½[Ÿ¦¯èôú¸:©T‡j‘þyÏ%¡×t·_ý1wM–çê{"É´œv¿×n¹?fæ&¨*²~;??ËŠd ŽZì9…Þ.ûëÑzÓîrÝaïmzº×oä/ï6Ú+Ä~gg(’?™æU’Öè±@BùÊ0®Œ¢6i* @NIìãÃœxr£# “XDœŠ ŽTÀ>„"<&ú±§êt?)—÷õýz#»,9¨’X%§£B¢³ª¸™'—  >?ÖÁGø¿m,ÊaKrk5¯9ÿv“î>¼—VúSo×Dmƒ.Šõp7uÁ~–K»Tåí4r‹z`å8{ÉIÜ¥KÎã)Eb'Íç§^ÅÛý  a€1Ê}@Yäy” âû(Ïå'Y町º*gˆ¼Õ®ù‡êdL”ûP—q9Qç…•îz~[é踗C§ñÊ-¥d+Fj« Ø8÷zÖZ[íH&Õ 3òš~beÓ¡²“5+:Ç&#q¹=o ¥ !‘R¾öLH™'|"9íV÷ëRLzõì9t¸ÝžîIA¶GO´âÉrŽgÜL %–ñíH.<%F6:%Vþë/5‰ód¹yä)¹z›Ï³»W ,|OxqÄ@àû ±ˆsc%¨ø&gÉÜZô*\­>Mè02ÅVm¾ùÎ" õ]ygö´£î¸Û!é-l¢§ïÈÞò{+¾ØÊMBUpÄH ˜~¤°•À§‰Üây„EC\%`G” ¤üGµ”_«þÖ8=¿*:u ÍÛß7XZ„j­CiÍÚ¯›m(îòÓ°€³2ž¬±6•¢ú?–½”µ‰MÔ÷6ö²–›Â^ºàÁY¸FÛqFLCÆ‚`ê ÊTHl¿áaõÉ›Ž—VsŒÇãiÊßûÓ¦'–} âï›ÕŸá¥§ÀºÇ™«ïuk¤^}õ¡¶Üwº0.`’ͨ¶h]ráWŸý¹;ÞoØŽ~-ç—ÿòµBœ(üŠíŽKÖ¡ŒVCßW¿!@ý·þ !þDAø0¡÷+ aø«X²}?§ô(ÏÆ«_%òÈ¿;mzßzþ‘þ°õíìïV_JüInÇÝO§ía·Ù|ùäý“ÕŠ³[¾ú›Øm[¹u¼úòßøæ-?®)ùò¹úR]Ÿ¿ú‚/ŸëËø^ù¤|ùïÿSRÞî˜åôŽìù+còÀtÉdI¸ú›¦ûªÛîçw\mú¯ÀWèù»5;ÞÉOþsºÛ쯾L6„þüås…ü›ü«ÛÀü.=>ldêg_®T+¥j•¿øMÑ ¶VÏ5ÑüeF?ïônͼNW²Iïd Ïó¬¶ü—ã—+IþÃåá­Éÿ²7?%HxÅù„á#) ¡0ù‰ñýW÷,p¯cˆÿšüP ¿úÌÿøAÌÐG1#ˆx äˆø~&*¡mÌâ=vû>ÿœ÷§»ÿÃà+ùqÉ:øcßkïÿ Ïü‰Ÿ›ü<]§õfš}ÌvÔÕëãáD«òp$jÕÚ'ü…o,Ï>¨3š:B r¿Þ<¬nþ[–öEÇ·é¼­t¿þͯU™'¿•“dw ¹%‘’Ì}q;ÔSÛÍ‹—™"!ëõÿxÿ9’Õ÷k¾aͨÊÙMèñòX/·ïü€¿zR»1[éþüú`*øÇuzüp“ªx÷º¨:ßH¾:*Y!ÝH àý°’…ï×[¢<¥!"O>+%­Êslƒ\Ö†d·Ûd•ÿ¹w­[N!WghY¤{l¶ÕvÚ*žèÓµ ¢Nh®çk(+d­)Í–YS‡Ò]/áW¢“kKÔ»«›÷z¤Ÿ‘µêCOÃZ_–«áI}½ÿŽÉZÊŒ«ïxJë\óã·.D­ Ze>”qÝîüuYðxGŽ«¿¨¯µg¶¶Ë5Qåcä!­í¨÷A³Àê»=©ã<)ô]sû‹lt¿yŸ/˜’^ëû/Ú"ü\´97Å_c9[qâeN·u?ˆ ‘r‰"/ò„4ÄN0¡žØ\óOzb€@‡)êQHõ,'ºÙmyCÓóbûnèEury¯tz±Ê5ôfZZZ6ôC}o·¯§.Z…ß¼×°^.ØÚws«&â¶Tk–ö…ªi¶–©Ï) X¤BÕAÉ3O"?æ‡<Ž…N1b?êYÃQü ­aqàN:k]îß¼WBD¹ÒËoæ®sEÃm™kqƾÀ±ÖúÆ(BÆIà{  <ÂI챈hg«ÌÓ‡ÊàZÑŸÎJU²Û7ïµ´W®ÕÚwsW«&âèæ&¥:·®¶µ°Á’iD½8ŽŠˆ‚ˆ2aŒõ¶J²} } ûãƒà'ZÐguÁ9z¡Œì³ÅòŽ¤«[¾UªŠ‰qØÝk1_Hr»wÊ’^M‹\ÃçO½ìŒó×X±žÿ»úŸ0¼¬þ'Ä¢Žþ~Öÿ\ä§ÔÿÈa8êÛhµ˜Vß+œ0+|°Pø4Š|Óü³Ù†žåuqØuÒµ‘¶¬¤f>Ñ)_¯øLJ=g\8ÕxÌÞ] ÔÜ÷ ûó8š\]¡ÑGuïÚßïs§k+3k½i?¬žv"±=jïsuÄ~æ^ÓäŠFÔ‘9ÚMìNóu,J§4ar F÷3”Zœ±ÓD†ÆC9&94NY¶¤˜ÃÍ lV#úÚ° õ<›êêéˆT’,±Ü’ Œ Ó;ÃR¤ò ×ÝœÎRÛÜW sn1D³¦p«eݱ˜U¥cî#¦¥p—.,V£Émñ…PšÈms#òBs•.Ê?•%ÞñxX'§#w ¯»R2Õ¸Ï=«(Ù±·T¶Xq ·ëŽ\¢ê¹,° …_ôV_;°wZÖ½ˆSú‹ª }BªÉª¸CÇM=à(ó¹‰|b·J1ÅaÀ)ŽB‘`ä~ìG^ÈaÇì6^ýݯÔ2Ó&íØ?즀cJ/3i®:…äþötQŒ‰à<€±H<ìAA ¦ !Èp"’ôMî®Ö]áο$'J9¡b”18±ƒ–™\EiŠ/M—ŒƒÉ¿›Ü$Û#== ½N]&ÿ{5n>jmù£(žŠÉ •k †|Æ1Q-ˆ‚¡Ãý‘!äÓT‡¡ÉˬnÔ5Ôÿ»ùòý‡ŠNùÕ**ÕÊ,s¨JnÖ©œ„ÝZ‚Mj”ŠAª¾1†£±ù,4CƵÛcÊȾhOæwWÄ‹16ò«A†‘p *jQùKîss©B#Ë÷ûèe&ö/_VoÏÄr-mö³m&Œ²¾•eØ?£åCÜk­c>:Lãp1SÊLP ä4ô Žßç±Oû9ØdÂB v}JŠÅýò¯Ô4-^.®hâÆF«œ¨ìcâ™FóÎnDý0wúnå ’`T$Y¶×¥ÕоQ•Qqr·;Qñ³ß­aà&:~„?{*csÇ b×gB)NYÓ8ŒR®4Lâ< 0#ÕãÙ·}-ÖNTb íZ,ÍBŽ*]ç ú]]‰K÷呯láqÌ»’剖|—¬Ùù%h÷½ÐøÚå3½µÃfO«œ æ{gÇ«—@ŠØe¨MÉ檂Ñ×׿3òòÕ&hçÇ]F„`9>¼}‹0¿V¾²\%‡[ÄulËUY07þIkÒõe‹;ën,F~âºÐ°m-MK|àÑ£´ÄèÄW•Hˆë$*O’ì4Z‹¼âЙò€pwhøA]Iʃ”%è<–Ʀa‘8‰CLÃæaF`§,B!B€©µKÅe%AÉ“`$ b·ôö 9;ÊR+Md‹”e1ðæ¬5êëe¡©¶£!ÖÀ)Q¤‰Ë-^Õ ý¡‘¢¸g '›vÈ0ƒN¢Ðêü`”‰²È2õ‹`½ZvZYx·²×TËæh|ª¡\‰d{;ÙPÀÙn¬¡–¸f†:å1‚Y0 Na’I˜Ñ¸À4`IÈìXlz“bî+þóñpÿîf³=u…ÙWoÑOÛÛû*±Qs²PïóM÷½fzøš6ô„…&¬ï›Í¿^¿þ÷ë×ÿqýú·×¯ÿ—üïŸT%€;‚Nul`M¥®ÀÔhšA‘úÝ‘"‰í7h_)¿w÷§þ½¼C.¢Qê§r9%ÝÒØ'ã2þÝí6J³å˜O´©éN6gi%}ÏŸ×;h)ßHÎ#—ĆkûÓ–kG.ÿò1˾¹º.|¤J3¶½úÕõëo¯_ÿF½Ç­,ð?9ªö’‘ÿYµ’“¨L2ßÊ¿ÓtÅŸâHïG™á\º­ìTUºMU3ápG§|t2agÊ7‡ûy£ÛÕk]F°Õ=©ŠJŸ™V·} í¤(:bæñáxäøåÓ®Qqþv†ÉÎ{R«Ù¦éÒÃp ‹^¾m̶+«é`áŽÓN—nóóRº ét[N»á•È°¸õ>äÏ+ÈëÈÉý·z¯õ÷„™°“¬–vƒ^XVëÉ\¶ÄgÍ‚u²,÷ù“¹fv ¾J¯YršðçrŸ¤Û—»l6‡ªgyLÒ\r”«9Ã9uóXºeY’ Ř8 c$Rœƒ<ÈYJä9|ƒ‡~Ù´(y6ÞRRtÄ7MÇ‹fÍÈ·"Éûýž¼Ú|+99çêX`"Ë¢¹Ø&â¡å’zûVüë ejû^Sw‡Ã÷ ðvÿV‡Ý:d¯î€à§?ÏP1ì`½¥ßNü±Ð")¢£€e8Žò¢Â4J¹V„³ €™Z ŸÅ :Ú¢åýñxÛPHI-qø·y·}Ïõqh1U³Ÿ¡µF§÷‡‡ÞPšÞcË÷ÃG‰Éa.^Šì‰ë­îÙ´\«mz',Hû:Öq8„VìTôâ b ç}Sð×4/Y߇'Nc"½^Ö4‘=çi¿BºãK‰.ÞuñÎU‰1—BiLcl@*Ò” ,IHœ/°ÓcÛ¹‘¼^*.Ñ FàmZŸdiŽØÈ­‘€E¢hùB3=ÜÒMýüµw+ìôü5 Ь¥¹® êü6g[ò-Eûj˜" ˆ´ÿ*zbÜüß-ÛbEø¥äiµ¨Ô>5ÕT¨‚€¥çÈ^ 9¼•_P.lþ²°„üs¨ñ]i1¢iÆ2¹¬xÃßÖS»ZŠ—ËòÍÜ5«ª3‹œ…€%î4yô”¸Wm…è#ÍR –0ÂÚ`᫶D‡1Nݨjñ5µ(þæùœÜÜÿZv¨ÂúíÌ© ûŸdyŽtü°µŠØyãfT'clm†/;d’Œ‚4&i‰Êó0`0 Hå‘éTà v«¼q”å£òÈ‘Òñ ¿åãGO¥<:–^¥ÒAeHÔŠ«Ú¾‡›ÛS'æ¦çƒÓzÉAhe’ÇCQ»½;}è"ºB5œ’JdïȹäçãÏc†‰>˜¢çì0Ò;Ìi²ž ÜwýÄwË f?P·wŒËs¤ãbö—ÍÛŸ!6o 9ïÝQŠ+Ó,‡AG!B9†qe,I)É;Jí'Âõ|FëI«ª[NFs¨˜Öe^«“a Ÿc±y꘽&Ö ‘¢xL©ÝÉŸpsõúú—@"÷v/AìÃËUöb-¶¯ž6Õµ%ŽØPóÏÓw{˜ðQ—ø¦®·á°¥‘w{už‚ÕZAT•žh™ÝèxBfEl½£Ú‰å§M@ALD’8„0RPñWeHÓ¬Uãž}VS)N{U–ƒsG6ÏÍb°âhlâYÝA. ×€œÀ!7íÎœ¸µw½ýQ\»ýU‚½‘´C*Íßtæ"7:žr)bNÏ¥Ç<>ÉK(7ñÝP‚qÌ"š“D¸ãdÄEÆ; T1=KO§\0¹|m½ÿýŽò}Ç—þF$ýÜãkôÕ’¨%Iñ¥†Ñ¶ô1ÿsw»WžUeÓq3¥9t·S]ö ˆwÕæ0Ç k,‡ÚuÅ]ì×7mhçø|¸­¥Û¶ì¦G¥»Ó˜géÝpl}™Bywú´WZ8ZßÄ ùád{œbGZcW·¢ŸÜO§ìjd6|Eq$AÄQ§yiFAT,´M³ò¤™äwׯ}¸~ýGþRÄPŸùäød˜=)»òb>i:;\Yiljݠ©Ìà¹K˜fw£ª ­þnƒOLC11I{ë qLß:ž°áp*™4|šû¹PñÄá$­óÚÝeç`pƒôîü†#ïƒC·ažoKÕŸ+/ƒ0DE”@šÂç,‹Ë‚‚s³^&¹aVW­½ÆF4ii2,!âì\)+ÄH§G.Èo¾Ý\uY×vï+KR·iîP¿‘úniýâ.|¶÷›æ–›«ÊSd>Ù¾ÛŽ2»Ëùö½ÖçÍ ÷ƒnëã ©üL‡Òµ§qÁ/ÑÙþãUö/‡Ò"ÄÎäz”¹Zä«K;j atÂ7 ¬ö÷§í®?®Zyq÷jhcêŸ×)sœ£UÏ…Š/Ì÷eÒ{‹ž;~‹h¹d!" "DƒœÑå4‚0¡pL™4Ñ=[æžRæ»(]LÓµÙ¬ƒqÉÍMüs á. û­ý‡æø"Ç#¦,‰³˜ID1“ ŽH’G#nÆš¤6ÜéüoúŸ÷Û÷hG•ÛÀ5á£9R6.R_½üôñîÍ'5¾ø.EÆqŠæ,MÈÒÓQç, Ÿ6ô'LïNJz¸/«,µ(#s=”w‡*øE¿H÷ï·ÇÃ^n¯÷è¸Ñ0Â/¸jxÃß)å2z¶;y­½u˪TÂûƒˆE‰bšWáË&=¹A\÷T.b¢Uí&¦œ1Ú·ý¥¿Ú•‡Oùù׋ënS8sEËfµÔÝZĬlnØIOӨʽëMDe5-õJS‚ð˜44©ZA¨¡Ú¼>C|ÇÛ·­4éÀ¶¬þŸ¡þ#¸lýÇ0NÓdXÿ<׼ħ­ÿˆÑIfÄÞ­ÿšúÝ[¾Ñ¿öë?®.KX¯ö¨­Z ¸Fïå÷5¿¨‚K*’нwO7= Ã¥ ¤~wYWœßÇÔãýVò:Uÿ•Ö?}¸UÉÓï1WÉ;÷lX*³9tk(f¦ße©Ñ6$ ÖYhyÜ©mb¯ÕÍÕ»q+6U›h :¾ø®4mz/‘|•/Ú!Ù Í(”›h-’ʯs´ù®x}úB+¯sÕÁˆ†€…$IYšEœ&I‚’¬ˆÇ(‘fU5 û"^Ïš*¯¢_£dÏ^3{ßçúz×¼xæz$Ã.Í—aØ)CÖ]þ#5‰š©}û¶â®ã`o°éuâÀœj˜˜‘JÓýAM?¥…A˜~`fyRŒ!³˜ý€MƲ˜A®)Â@ækBŠYÊ•Ç´°ƒÍú}ØZfÿù–¸è#˜²$Ánqa¼Q¡ýÖÔ¢0‰`“›Û‰ŠŸí½¼¢…ŽIa¤¢…©¹kE ¾ÉS…a(+`‹ŒEI–±†I–†$À±oòÅ-†«¼œªØЫjá³n…‰gϯ`1AåiÕ²aæAÖ°KmA†G$ú% ì$Ø8Ðð5ËË8 é<–Nƒ$!$ËÓ<`â„Å(I#d¨ @#;‚x,ã`•Ö–qX¦e,+ä>tû¾lê<¶$­3'7¦?[sEê;¡‹‹ù«R߉]’ #\@â$ U´#(Kc„ö]½,õgÿò©ïôÇö‘øîÌÇw®ÚÆ#ç¹Ëò³‚b«å¸¢¢9Üù³&5‚{ÉxAçPó„¤ ½%–Ù¡õ|²™p8D8Àœeáÿ 1#Y ì A–Ž@`3’‘œk²fH…8uóv'¶N Un5]ÚhÜ5‹íVX:Fí—æΚL¼CúîJE2wŸöÞlk£µa50”¨Jœc×M™-†Ôñ3Ã)|(ÿI+êÌô‹X 3ôX¦ëÓãHÇ´¬I¯å|âã/½gi‡Œyç Œ‹Za2³¹Êkz-»¸õ´Òkd‰¶@7/ÌBÑb†Ü0 _¡Á=Vmùrà8mº>½åéøÙòålqXY9zŒÓ{,ã Ha£,ˆ’0 Až§9Ä9⊋Rd‡ƒÒƒŸõ¥KÉΛ+µë)19WŸ¸ô mÃk¬ýŒCOõPbš !péO$u;§¼ :¯…§l]±ÁÆSö½¯ —ÐÄ…Š',YîÅí,=”ŽnÜ_/>.éîå&"w' AÆ’‚aPð¯1å* h6"[”žÜU8qÿ©è¹vÝÞí>tt+.ô|M4áA8H›¶YA×VÀeÁFÒxwJµí¶ÝjŒÕ†o6òoäÄ£Ö`ÃïY·b"'§žUܧªNÀÚªJ+­Ñj=ô# Å*QU)²ó¢Þlþl™õ¸†ˆ;o~&´^ábÇVk\d´¶Qt5ùÇéEý¿£(æÿíûiòìÿ}‰Oãÿ]Ç…N¹ÇiíþݽãíÛ*çoÓ°Å»O´ÁZvBÿOî†~¹½TŸšâ—½ îƽ{=9y€O`²çYîîÖþÝõû½ôÜŸj×—Kº;Ò²l¿ïª@Ä«M¶z/Ÿ„έ´‰¬Q_ëaË“ú‹?:#(92P—µ¨°Ù} ö'P—à”¢³t_ÜíìÍ‘˜šãáAý!ÀñTÿy¸Sî8Ϧ¯†“S=¿C\ƒí5/èä8ª©zß÷vYÍU·\d¬¬œª°Â‚a-~o”©RëxÙëeñBS¹€º`Îx]ßÝòÑÔbÊøu†¡má±Î*CÂlv5µŒëDBó9ìEŽŒ¸/×Îz½;ì>Ìœdwü[3¢Åk`rx5«izÜŸnª r"Rå¼`èG*H-}¦'4±Oo.§Å·z×JQîSë8¦þ”ž}€—ZµóíŒióò&çÊmòšqñßÄ8,¡xƒ±?µŠÂv{8ôD^/ÝG}ž­Ç>/¹X÷‹¢\ç÷àö|>ºY/^^W²kP·ôDˆÝ_ªä‘>F  À½ÇI|nê¯í¾Ü’%F§>Ð]1[{sàò„6á¥kÙs=Š&è,MÙïXÎñF9Çœ&«vàq¿=ìß¾=ëaï÷nZõ¬ñLÎÄ‘ÞíG¡÷ŸÇå’¢º¿i¦¾õl—×ó´TÞOk@ìèñtÑ1­ÙLJ=Fçí²‰+vhÿcÉÖXŽ–v«ØÝÜžÕ]>^Œ8€}-+g[C—yÜÄæV¾ˆ'1 òÝ-Ž¾"@õï,ä¿=¼§s–ÿ‚§ëvâ¼Ø«|曕bär”4TÔ}ï¿.0ú_ÎvHaJP™³Úœ¹û³têh)†+©ãt:n‹û­´%ÿÕų+S n(+:é):s7º¹”÷°¦´½­TYÝš¶À_åÖP¿yÝ3 ÎÓxöi(¯ý웕Tó–èr£7ú@õEáB½³]ôô|?«Çšç” :÷8ïŽ&£S³aë ‰\×óQU'âô»õk¡:˼9ÓÕN1áEá8ujׂ~Q.—þEmþ}0rôTçq_t͇¸0 Ü;9àæîN^ÿ+%ëìKÍb8õP úù)†½Ot„&‡RøJWS~3tŸúÂÒ="]?ä¡ñièÊ<ïþ/šQXºL.ÌC2KbÔTf@X,m¢Œˆ=[Mÿ&ÑÚ1YMœþ€fi±Ò,,H–!L‚¤ °ÈBeÝŒTà œ"Ò¹¹¾es%­x/…ã©pc¥Â´W£n¢<^¥ è¼Ù|{ØìéCÛŒ÷¢â<É ×R8µþX6iq”;¯$[ÖNÆUŽš.¹o_âWUöéN&é*M³”Öyeªœ?ê>½½UóàPɤŸ2g”„[‚«, ‡àîöóÏ5˜k»ËPBý¡ì*c;¾ÛÎ=Ñõƒ*I/Ó¥¸mdµ¢šóZîÑÍ^üŽÚ(ÚËŒ!ì&Δ¢ ŽbÆŠ( ¢"ŒI)Ÿ,ËpÌÆ H› 8ºº¥h/Ó'ü_ˆ*›]½ Û$œ|ìí—¯þßëJÞѯN7ÂÀ#ýÚ}Ö¹©Xó‹L‚A¶œqŸvªpŠRG<¹UDØÅ© zcD¥#½|4y×a¿û°‘ª>j(i÷@7HÕPß/$¦bŸjÓ©"\ß.‚¶»Ý¦²*j}nà€~Â4Wyx=ìSÓó’"¸0vÃÒ´¥Þ¾½(¯W:æák¼]ú¥“Ú e¹}·7_kt“r«5¨wõÛ·yÖ8,Óõöî’‹½XöâûUÁdŽ²Â·Ñv5ÅÖ÷àK麱ŠŽÉmq®Ñj‡|$­Õ¯‡øÊhýë±þ1xÉÈ¿Ó‰¡Û-GÆ¿¨ÿõSŸ-ieYaRDEŒ2€1æ ‚aþ`he Æç”×¾—]QÏ×,ï+EÜ—Fa½-ðªÇ뱌‹²b“H•ú-ý¬GÁýáÔ¤u»–d%~þûõëï¤\*žDʨ\RýÍõëß^¿Vþ0ßÊ¿óªÇìªTCÎfy±aÉA–\á˜|8Š ÔdË*xk#Ëg&X&Eú}›¢ ©ÇÛ¿Ú€y&uvUO–AŒîÍã•„þzJo|„[~QU˜y@³gÙA ¯öÿú¿d¿*×Öâ0À Nö©²1È–âu5kïáFð(Ã,ˆ-Ý×X”ý2qá”cjƒÉ@¾R‹°Ÿ.¸àzÿ@bÿðЛ_^Ò§~ŽÒëâLÚˆâ5®N· lêNwÝuÑÊ˃AÂ<yN!qDr–gŒ„!É‚FÐ…åõ_„;ãSiýDÍì&ÿ\MDW{zÕ¿ÊÃmw;z.—îÕ²1\æ½4|pÔŵp–ý±|òNw+\Ð4E4£0 Bfq1ÄQ3B@ØyÏ  ÎéepôAô«à(ñŸÝïv••ßÝæz„ð^z#¢Ÿ±<ÎàÙfdjãjôRÌ‘øëP܆Ð;*Rÿbªßc-æmñû¹cÛMðfiÓ–Ÿê¿m¹?±†Õ)Ç Þ¥ÖÉX±ïÎô­ÄΚ^;]ãH8lúñ…ÁÒgGåaŸgÕqf 7‰â‚$)W‚'€ë Y‘eÓ¤íG¸¶ç²byé̱¼¼Ç7­v¢Šë §ãw1µ½vÏLªóÕÃC9aÅ0K.=o¹®¨ŒG¯¯ 6âЬì«óÙþ:~Ö¼œÁõÎʆ¯\½Ü}ózÛuÌ•FÞö§6Wº:2ë0μ€Ç> Ø)æHø­‡¦“Ñæ]—´9§WZúÓÉñüª›†|Ñ–#*«$œ×1ÞAŽ;/&™d·«¨û`²Cª³L†¦±S=œ‰›šr@ÖIŽ wqv¦ u÷ysS’ÓÂe D ÈÇ `˜QX9BŸ•gvñÌ.¬ì"wqç}RìÂYó˜’îWpmƒ­f+F“欛C_§ÙˆŸ~¼° 3é³ÚèÌ}záç ¾È@ Cœ„¸@X„)Æ0 Š³(Âh„'˜ŸvúF¦‰æE¨Ds~°)¡R;6•æ$~Ÿp™Òl,¥à‚´¼¥ª‹! ÔìýÚŠÓ±½)ƒMšõ¯Ý1T›£*Ø{ +3´D½êfŠß+‚*\SÛꎴ¼ß­)qìU3nm…‹ã1üÙÆ:ÌN<¦Ôå+´Íüp¶;³êz:%¡ÇÓiO#ƒ){±ÕH}3§ääMîüf˜óÅ#ƒ™ˆk1ä›™ÃVæS÷ÌLfÅάç#XãÎJJ£$)ÈE_œg, Á"‹¡4qb%“q4#\Dí›_о1rŽÒµîkã¨åu5˜¶§Ër½Äˆ;Sy¯ßèËr^†Ò}S“³íÎb‚0YãŒ0ßo .[ivÕDOµ§{u¶‡'±xš‚¼]\£{HæºGÀuX†0çK2ŠQŽRÈD…¸"ÅI§©,'êp[êÃÙºÕáêN¹=Äþ][ »S[E8×À¶šdne¿Âö{:RbÛ).3¸5XáPºwƒ§G™Ùɺ•UÞ§)4p¡á!7@ dž¶6Ž8.ç((påE”E8£”Æ$Ë3l¡Ô³MÛaùf§µ'±®tßï·„¯BML’»°Žñyµah'üPGR=MW:Ü7J©öÈ›« E__ÿR<1g×Á"ïêhwµT;GÄ„^’¸y‘ÃòÚCìqwo4뮽›kc^‰í¬À¶¦ŽœÚj9“(7‹š¼k©-/ˆk#yV—AY4gݱVùò8ÊÌ0ÁA8,¢ 0 €Äb;$¶ìp>ÕVº¬‹ª HÔTdbw–\Pyš™¸AÓU.x:¨úU­è @âï¥}‡¸—^¦ƒÁ$UaŸÁ§yÄÕT E§º&°’“¥(.)÷þÁÛvFy˜,– ÝCh$dvË’Í‘# u±¼Amõ]½(¤ÔÚÏáuýx…g´gWK7³ñ{Û–õF=Qد‡ÚEsÊ…ªÞ_ï6¬ýÖ{á;Î7±O×…1#ür 9ˆ bšS` ¢†\¸€>‹³X‚V@\ƒ‹:ÒŸò%ôîØ´›:¢:>ßre(Ǽ•Êø±ö[@ûUêó{æÿkvMYkˆ;Yý*/ðú‡Gé™ä2é¥E@›âpØQ´¯“€ZýÀ÷œ‰Ô#­ÓX(e@±zurYvdîÍÕ-úÀu÷ª:´CN¬õ+ëHš´o¦'æOz¼‹åο|g\1âj=Õú;;«ß›«‚2—u5¨rÛ?õj®ìé;óëw‡Ò|A«OûÓi C4ÿF‡Y qÀI×°Â~¢Ñî4ÈI:Í×P÷ÂöTÏy 6ì ÙÞºë$a‘ažÆqše@’ÄyB +†cÜhðPvF¤—½¨ïAŒ¼Úîï¶ïé¾c éd@2à© ýô§òñ¥¯Æ¡ÜÚZµ„7è8 ¾¶ÛIv§âdÚ™íQÛ¶°µÈJ±$*+3ï'P75]·ãëÜ|«Üú67|áQ™×m/x`CD<î¯Ê­È=!ŒW9%oæƒå·ÇwÒB½ÏÀÜÞLó©Ç™f'b1B¨ú“'ETÑ ^Ò=C p4ñŸË:héî!æÑ ½é9´iÚQÅ)5_iIÍ×CQ±OVÝZ ÷âÔf·ý­/ Ÿ.ã¬dÕâèÕÊ>eM¹)v'Ï úçÔþ 3¼ÌFúEÓ¼H †ÙÂËÈ¥ä?¿P4W£S÷µŒâL·¡j-£ì Í4š~­KòqPŽ¥L¤9ˆià˜„)!M2 Ù³ †¿ñ”d/i8º{¼Úlùëã˜$28on/†MZ¸q£¾ƒGmy‘ñŽ¢£o—Ý ¬­aèx_õÔέ]\܆5æ&Þz•ïV©î>7w½b‹Ó@º”² íÑ<§¦ßÙlˆ]íWœŽ®2Š=È$A‰ÄüiȲxí ݯ|9¿§"ßJã2Ü*µÕ´J®Ê?ß³ ”\6Ø©ãQ=5‡¨ëé²ÜöoLk¨ŸB OÝÎüt[ÏfÞÿ¬3Ó‹ÃɧõQõmPFy:õ¼%ƒ¼H/¿.ÎbýLRð*4W5³‚•¥ÚúéÅ0Z(¯ö4Ó}a3à àpçqŽQåaÊñ1„@Ùö,áà3(„Né¥ÁÅËýI$1?Š¨„ÊŠv²ì^×üìœaWåEߪláub]Dü|µUeJ¶ø~‡ŽÕÉÝ‘Jòöx¤ïÄÏ[™ó· ˜PƒóiÒmXv^Oxô&h1ê~o™mM”æXë:­îHœ†O­Öˆ‹I“lßo…KºåHÑVp¤wbh—yµr¾ÅzC©Æ »ÇÐ |ÜSÈ»ÃaÈHßV¢tg&Ëè{e#-Ùõ¶ ÕóhvÜ»—w( «lE¢•âàô¾TïèI'ZŠ‚ºÛÉàÉŠAv'¨;å24“« h×Mld­ì•óÞ½,9h{õ+Å Õ{ÜJäòÉtEÊæ«z4J2ÙÞVP’÷W!•óMUS@ÕAáÍË‘†æM¯ÐA%Þ(—g©b $˪p†zEFLy•ßýâŒ:›>"Q Yj%»¹~™Sá;Ì€ßÒŸG¸Ù+:Ýæç¥t Óé¶ö~Í[aY üé}ÈŸWïUªþ§Í¿Õ;¬¿Ì„Ý"ݲxqŽîÏôx},ɃY‰ò#?ÎKÔpÍ"¥{½åÐËBiì¸ËxË*s;c¼u Sv¡áAPÜzŠTÞ>B¨òÀnÇñHõ¼Aâ  Ë“4' a9 " Y)ÿ¦4¶Ê^Û‰f²-ïvèCy¾ ee¼xà©2ziUFHÈ5|Y… 0•nw÷„Ê$vbÕU5È7rÂ6WòIóp$ÊXúp8þ¨l"Ò±ŒË Ú3—ŸeÔt94m¤®”ÎV…Û¿¨fÄ ·˯ÚÙ*3ßìãÀdEJÒg²9Ö¾Ž«^jk‡Å•[¼Û1?²ŽC7ç{ë +}ï”*ÆÞ:€‰Ëó|L†µLµ¹6ÆFÛŒ+çØ!°ŽÝ5ÍhÏЧÆ<Ú†=Fÿ¬~êÕ#8³é8 b˜fŒÂÄ$ÅQL €qHJ£p„M>¢}«ûêMuóín'4wÁ…Áµ¬"kéO| %«á<‚äW[U^\Ddò÷Ý j[½|³ùë×\ßÿ“ÔÞ•ÿ? RÅ*Í[YHlÆ™s•2oJ˜W²u’­^uEªº±9xPó,ŸC¾žªÁ /X^…éì5ƧJ1 =]<—8w æ9EÜõB^ØÛùÀWP?ò ·‹3'6˜a–fŒA§e4 (bE“„É 2{—‘‡s\Ùv€¶þÀöÌð(†ï‚½„vTäW—@"ôPã` úúo{Ä/¥†9ëÅǶ©ÊÒ†¶³ l }Ïà5¯Vµ+j·<õä=j(«åʈ1M"”âŒf¦9`M²„`Šíµ:MS1 n­,éUtl+e9áJÛV„Š¸ÌÚ·­ª, bÒûÑ“7[|£âUZ9•vï=ÝË€|­þ—-Õ8(õp̪v~¥Úº³Û¤êïÌhÞ–ÿžÆsõž”zôÝ@,PÎtgy-àQ? Ðçã3Ó…,ígò›åýxç;s ¸óžG-K°N¬ˆrˆACœ!E˜%(qå!Ì æÈr\JÔl§Ÿç¹¦N t¨{†ÛšöïW›ò$\»Ôî9ÄÌ47W²T¦LbRÞŽ'|êœeÌÝALù‚ ’,ÁKyB¶Â3Ö®£‰‰›“›uŒ¤_ȶ¬ÒfsnÍ{`¶Q^i.ù]B/ÅC+½9þÀÿ÷J’¨öC™`û5ó[ËõÀð´¤ lrðo“Xv¹fA«÷åtx3­iÛ]®íúm󾪺¬e‚°D°Ækà³d‰–—ªéà=t`HЉ-:ÆO­£î™ßΊ¢reµ_¹a·…1„¢ˆÑ(Ž(AQqˆpîÄm'㮆Æ+cnI§˜,ç­G×6æÛHu,º•äææñ¥>͉«Ç±rÛ^øÂz¾;ä$÷ÌpH^šÛ´ÏÜØO'K Vy‚¸ºI-™¦—2ç z|Y,Çf]táz,aÇ|K¯ ²›ˆ>V©pŽrÓ8â2n§ÊWs½aˆÅg6và|k{ðÂý tW‡É™¨žõT†þtÇ”V Õ„ÉD»GÓm'§»îºxæåSò¢ˆd@Hƒ IHÁ$I„íåAŒï`$îY\/Ö! ­[`—ÎüÂŒ?X‡`Ωk]neÆdùôµ/¼ˆÅ»â+JrY•ÏS]Wáü6g|Y!©Bdº!ióTô—åÿr–‚á—{n*¦Þ}¦òþîîÐúõs9C¦âì+MvR5qh+NÒ8LËd¡{éó_ì8À ¸‚Òý†ð7‹O ØÙûGÎ𴦶3•ï¸²OÔÇ6nÍ{¯a¹Ç£‡Ð†qcÆBl±&7L—àÙ¾W¦ÿ²K_é¨Ì'[8‰’®´< ŠØ’|3Íݵ`7éy;&:~œ¨PDAšåQ–B2šâ$¥(¢EHø*Ct줺Ȉü$Ã'«Ð€ºy`4f´´<1[‘|,‹¹ƒ:÷WCSKoèÄ">O³sw_å¤ tª2îT¢©äWÀ69¾²qV‹¤çošŒë¨½yi•P†îw§šê;_ÇkqD_;hͦeUØ¢S\¯Šjô'S Èœ…IHç0 i†ò„¦I B’ØGüt†–¦’AÇ^TOí/Skui¡!‰ØkÍ.™4UÉ[®ÄRç 8ç£" ýÍ°êÙ@ÓÑÔœI÷%Ò>ÜȈ`Z=¢P»¸ž·®¬[_4ÍÄ¢ŠnY¸B¦ž'ïÌ–Ìü¤™”¾ø³ó÷7 ¬µ|ZeGYUÊ8ÊÌò´«$LBÚðgÐôÓ›G05PŸU£È_‡]<žöüªB(ˆ`äiBHÂP^0DA \„9BŒŽœqÙß­9°©3¢¶rCk¯Ï˜Ðš«ÎzÐõ\àE*©@k;‹°½ KÚ~Ô¡ý Ƀ%Q¡jß­WTå«ä¦å_èVôÇŸáJæ¤â¿`T*ÇÃჾlžÔ¡µhw–\]Bì¦åIeéNŒŸºw­zZÁ±:+£ò=ª»ã^Ʊ`–žÏ4ÓcóÍ°š4¬øt¦ðŸ5Ké V~ .Or7*8HEéœyeUÜB!¿¾r,k‡ý‘:³"cA–¦4‹aæ LbBã& ±GêT£ql(ænߣUÀpMøpŽ”Ù¦¼q%úôñîͧ¶ðËÓ(¡Ñ ̈ )cEFbQ–Ó»S•Ê@«àÖcúEº¿=ö·ªÛq+.š¬Ý²¦MômwòZ{«–¨‘¤‘þjí{üŽÒ_íÊçüüëÅõGÇ ˜ùøן:øW÷kËûJ5«Íýi»ëÉÝàøyEÞ«óUX#3¼XAB^DpFš%”êh# LAª({À|”ä3(Í2Ga3p, )—D­¤žÊŽ@ïè^äÆR ÙªÚ¿Õ=U±.±Ï;駶û÷‡Ý{¾Dez”~A±³œnª ™C3Öv€k $ªg­i’ÎSò«u%©4 çáHg•Ö£šÐƒmi•œ˜ŽswØ}Øm‹ÉL¡Ã[ª+øp'ï_‡J ®ëÂÙáeÐt¯VQ÷dCª«˜CšcȤ!¦I&!DÒˆ²ÌROADÒÄîŒbx·tÓí‘zskYù:Š„ª«²ÎÃHÐ5‡»Þ ù ;^•ãÙðˆMêj{‡®•¯ÐõÄÙ¶;Ôì§Nw*`™nñ¤ÐJ>•CäåiTr¢â}¥sêkª‹³Z÷æ„£8"qšqM C$ŽYh,Èq‚bÏü[=††ÊMq¿Ý‘²WÄ£u|ãÿYPµë-3Ö7å2ÄÕ—µ·Š:VÞÙeÏ®'wøe+/ÉÇw(h=¬?Ú:™Ãáúl®Äeé—‡v•¿Ÿ´k)G¾vêj1T’u 9r.Z"Ísr<ý«‡áÚ1—®¤WÕzð¶†w9ƒ0HãìÙíê±êšNI"\ãTï±â¡«X–X²ê/iì·r^»I&¶”®¶Ö'¹Z¢î|ŒèX 8‡ AÁ! ¥#œDiž+ë?¥ƒÌ}”ùá%Ú]ÙZ¡QÂV)3$Ðó^mÚ‰0Òö`â÷Jš•G>1VÁ¨Øâ"CG‹º*É4ÙÇêu^ÖMà®ê®5m¸ëò{Ø[â€f»&2Bm7W"éG(Î/eEò…þ QþÌ|Ö3Ÿ†ÃXUœs°ƒÊ!n;˜8,ºs‰©W•–riPjûŒSaániM·;T,xwêgF4[OmŸféåI¯÷IÃíòx·_—.ñÕß­ÕÖÒú‘KA+{±]Š‘—§…!'*>D!Ei}JEèñj‹Œ× 1Ižÿ»[} Eiþyš¦y„!bI¡€¤° GjìŠ0_맓`\²aYKB«2?:BKk‘ˆÎþýŽrŠßáÃÝFÝøû¨¢@-éÈsú¡|Ö¤ •%¦¥;Þ‚4 \.OHŽXŸc- TìWÑݸõqpZÖ1š•zQ‹q®Å˶î°§µuDÒåô½a¬NÖàjTŸ4úT×Îø÷§›Fø¦ F¤bþ ýHE!>w gicTäYšä$ÊDˆAFQÄBɈiÓ0»OÕ¿»~ýëÃõë?òW»-žq}.®[T{óú½MÝ;\²úMŽŒ$YúÕa$Ú"^ÏUTT[õw'Öзó“AÃiæ2û N#´;ö‹«ÓÜĆŽ! Õ<)zXÊ/˜×v0w d”¥Q¥!ƒYçA€r€ ‚E h—WcoÀ÷ª=ÎooRclùM'RH8_tb65´ÈÁ¶ÆÚíþeÏQ£±buSܬÁÜÃAwãàEÑ­ LMY ›G¤;:-ÓÎrzhH·lLÆ4Y‹Ä4»[â¢ìÙwK\9esqH8‹:ÙŸ´†m ‚À+õWÇd…jóXÍ‹ÏR­vʪT_Ö™P‡cÕiÖpœQ#Ž›%ȆŽãÉ ôV w–ƒšˆÅ”r ˆ(â:@ç$á(‚#,gʬólÍ9Ôï()ç«$e?– ½ÒèøžmÛ¹!Àº¾P¡CrVÕ$L´„Ÿ `Ì« š8C$!MB1ŒbBó€ptÉÐÈ9zo  UK‡%ÎÐ…¯•¼Çc å•ži³‡.uêËÕbîAFN‘t‹ƒ”Þ/A<#TÓC¹^u|f‡ÒMóu¢âsÊó+¿¥£ö+È nБ ‚ý—¡„á,‡A‚"!¸(`ŽHœ3’$M‘9J ðüÀqÓ1¬E Ó( 1F²ˆÀ@È[fÓ¤`z¹ôБZ¸fjHÓ˪„»hXWçÞôZY31áÃg›ùdsâÃaº*KúÜó𾞶XÕê—>oI7n¼‰s~»µ¦ÍÀ2é¯Ö ì–Ó÷ƒ:Ùóc¢ÖßcääžHýY|› eA-´QyÄdhåîCGtú­ôâûç¼y*ÓHnJÚq3'¶æÀÆ$€[çh‚‰„¡²²avÂ:«¡ žßläÒ©Ê?t‘UsÑ]Kî¹¢v†ÈÀ¬)zk Upt$y}³ù³åÙÔh ÖÅ¿' )\pûl!=…Ô’¥¥tµ~ºëw¥Ñlià°=ñ`»•ü´‡i XæÙõ†ugf3 PÒ„4gEgažEiDI1€HFí^ š^àCäW«­—*iêÜîç“)J®¨y?+OÔòÔ®·37KÔ:hU‰ÑýÜ6s†ùT=áE‡¢¯”¥:Y?¦M“œÍ ¯ù¡(Fa°"#AÀ×3ÍEdP â„ŽHÛ½ç U2t-7¢‘Rü»²ë/Äóÿb£eRª$Ç_ð±Qª¨øÞTGá÷|ÛT‡Û\iyG™*G* ©‹†í´}©UèÙÊ4)'úN&Z¸2ðþñ`ûT¡¡ýSÖB]!¸ÊŽ- ôše]]ê £Ž#íIÛî}/köU²¬®rpÄ܉‚HJ¼9þȦݾ'ôΤ¬Êe£{†[˜Y$¶Ê­¾ ªhWR¢vµÜþmä^³0×4yû¶š2wñÐA:¼óa€YŒàv¿©GXCÝ gP]4>$ê%-ÀÀÒR xFVùŸ²<1LS.zFá¼å)gx 1ðËNjyÃH9ÕöO•I'J’®+jJ­˜?¯zÒi3EõÞ*RÕüTA™ ½59Ãd±µù3-‘픢Ùøñ'sÂ&‘à{ìÍ¡ëðI¿h'"–Ïu³ M$Mƒ,*(*b.Ûæ\‰ƒ4È Q:’Ê«ÿ(î 'Zÿ ÌÙ)î}[ø lžín×T•êDÿŽ ‘ù¨óÕ“ð³Ðö‚fÒ‘j%zÆ-£" sÄbB( €%Ì3hOm‚1•·”ªÜ¯Øc½|†ÔØ“É#ªrÃì›ÂòÊWQn*se§áá¡ýòÕÿ{ý@É;úï¤ÊÁa‡0gEs`Ê‘ÝVFûw´û9y«z –¿æú`qO\iµl¢JŸeHwr•OWµR8u…àsà>‹Œ¤²1XBøã4*õ…ô«¶óøËú¾¹JEÖ3CQTÏ”*W¿GuÕ¹Cý°Ž§à¨ AF£(Æ,‹pÆ¥ô#\ ’̧T³àÀNæ»™ßÔã0pj í¥jÒ¼2†aÿþÙCÕÇ“¨æÔUø¯ÖE°š(y>ø°Ýítj}´Ÿ­ZÒV­b ÁÓgƒ­ª%Pg"Æ»…íºÇÚ‹ïÝùÎ0ÇÑ*ÖQ+VX¡ÝÐv’u¬¥ïu˜È®gªçͲnõé±48YÚ \Š,íîºhçÈ’…»)B˜DŒ$”‘0R˜Úá¦ÙIþ.óÊT„msç\IVðRK‰‹ºe'8/1²šÁœ‹ Ôã°*3ôiáž}°¿,D?ß6)« ‘Ý¢9®„{ËH§«Ž"—í­:¬¼¸ˆlg‘jÛßè6I–¯+Ë1î_6\êÕ+][|ŒônnZ÷+{<h韅4äŸY É’"H ˜‚<RDÃ8Fq¦(Θ½vãè4¯â J?xšŒAî™;¾÷¼wÛs'íýWÌщd`¦Z툷oe›¥í9£Íóã°âOwaÎúV3Ù°AþîÇJ¾ ²¾ª¤w9uµÄÇZ«èi[>ò+77;ÉýÝì„+"·K/)ˆMp^]™(}4yç"éÀWßg’ôNÎ)Dh==žDñ(5˜P3† / c98'¬àŸóoŽœŸMNäg*©ü¬ŽÙµ”þ(­Ò^Tø}þïý/6W÷euôH·¼ëMåvè»ôÒ# D9˜é¢÷t¢Ÿ¯ˆ£¡Í³¼ÓÈ:ÞJ¸XË–y’‹f‰#‹¤ŸE=ø–qÎ*Öü}J24e4!QL“$ÍpŠ³,ˆŠ$‡¦ň'è*'© /ZáÈgÉåç'¹¸šêC°*'ý¤¬~Vûº_^1qˆèxéBÅ æ{>ˆô}9ÃÑ2G0H’,d HÎhÈ¿!VÄ ³ŒÙ b”Qž«Ú_W ')1ÕäÒS¾Ÿ>;YÅê1½[;Ï#ªÑ ÂkµdñŽ`“®¬¨ãP!½_¬¢U F³ð·À^Ç4”á'°@kë/Ëé{쬺®`¤uqV%®pNçÜZÏD+¥¡ûLΛ@Ã0Í Da˜G ¤,*XH9DÒŒ¦ö*c¦)œÄIáP--u²wW•.PW¾ÒB”zÕÄD2]¡¾бW•¬GxMݳUé|ñ Å?ªtµ¥Âr5.™©VV3Élù2¦o^ÉJb'™÷–î÷ïn*¹ðÿÃàF B•0¼*(ÄŠß¿ÝmOj€ãRœÌOF÷¥À×úËRôɹF»]ß»ŒË0 "«^È‘*Áqû"ˆÈ Í;“Ù<ѯv†tKË_ÎbÅþ4‰\dv?p$0–Ú0ËÅj;™(o9ÀŸ¶lË'¶¦¯Z¯ç‚jN*^Xjë­‰‡©/y^ »Âø²êØéŒø=F¬Mô'®›–µ¯¥Q“w¾S~;VJc[—“—¥å–ÛÛ»í>Õ˜…ì¾° {ÜNæ5.Ãâœ4ê4©QyQÆ]šç,]NÙ³X2?­ÿ<™Ä· µO‰!Íâ³"/@À‚²"A8ç „ò4X0vêÖ{@'µjUYÒÆ€ìZ€´o¡B§³[¨]u²4+Ã}¾"?Ñ<ãü”×äY¼F«¹•/u¡á}Î^ƒhuéÒžÞE0Ä8`$„˜b”G(Ì@ŒQ:bîö^‡¨4"š, úó)DT+M>ýœJDqî¡"éüRD®U}YeÜ«z.(ºŽº/ðÑ©ž‰´î.K4Ä È£”%¡$”ÈsP`–„šž–zBýšŠÈO£lspN¬hÁ*S°¥ò¥*¢UVûF¯¬"“ØáHÇJT¤êEÚ‘"þc&–¨P,ÃrŠ/Ò’’ˆ¤Äaó= í@SÍÂH¶¾jO²PÄ·MÑ­×׿älîv»—u¶PmêjˆÉ‚Ã{ãóë:Õ¦¼—Ö¼N ‘¤¶>úïg”: efÞúþª&ÍðhýqÊ?×úù ²ˆ‹‰Ù·s#§`¦{€µ­o•äepe\®Ïí‡oL&QÃÕ¼ßÉJr½IkÊ9ªzœYˬñètÐÜîš‹ó‚~nar´v#d3KF2ÍÕ£“yHr–{"†ÅûŠÜDÞõ^»i¹®žÙ#é! ƒNñóÍážå ‹bˆ@ ³8), ..ŒCFŠ€Ž$ÌíÍÀHæ†û‚C&®,“YÖkŽå)Óû¢¤í/ŒIÛ¿¼d®öºäg={ü)ë¼ë‡uiÛ;4©ºÏ%u  ÉÚ[êM§K’¶§3¥ÿ·IÛ›kŠRnÍ øì5²¤ÈaQ`Q1Ь(r iD)$E’‚AmfÇJ…¨#%ÔÏô]^8Ä0a2Ù\q¢\g{Ù!Ì'ë(T”¹u¤ô˜"Ǻ==Pª|å»S‰Îøûª]ßlþ]Î5ÚñIÝ ƒË‘òÕÉ›n;¾Vß“þö«ZÅ8Ì—EÛÁ¼òObnŒªhwÄÓn)•¯v[Pª.U[9qtwÜvù¦Ý¾§ÖJÛ]ʇ»šðù£«^ üøûA{•ê°‘5¯öô—?z¼Ú*Ýö¤—rÕYtÚ)ÍšOMãÐ¥­{ËYA†áEm¾¬Þ›“ïLõ]ͪoWÝ×e2ëLý\UœÙ:>ÿ€îjzÓ%­§ù¾‡>|ÈFÂôBݳŠ  Ýõ¿!Œh–8Í q‹ $È ‚„Œ¤ž1>éˆÈÛsÈx8l´™©Ý=…¬ýrÀKkäîXú(Ùñ…bÃA>¬Oyu{ Âu‘80 &¹bÍÜê¹q NåÛ€ÿ`£êX¦7xj¹š[]Š¿ ¤#•ö+FÉ«“¸çBî)Bç<6VÆ’G¨ëŽi,Š $$cYÆÒ'I‘fqžÀEÀnÓRÏfÇ°â~»#B»õP›3q²#a¡ú¥4ç-ߨøÆº z’E@jKT…‚I5.ªnK)œw"dfTá.Ï÷ë¼ÏÓáÒä}è2wkLs¯%[añÖy§6cFœkæí”kaèÌ”å«N°:Îè-ð®.¬tsºÝ‘þ%¿Jú¥X®Yöæ–ÄÿàñÉ „â_ÆA÷_õÁ?€0Žcâ ‰þ!0M‚Ø>aûÜ }n³ù‡‚+\‡ûµÝÔõÏô$8(H)1䚀x;ä8ŽD=¾çÏy?ÃýÀ7üOŸ}Lìÿ0â{^ßÿq‚çý‰Ïu%¾µÒ[’ôôÿØ4솳ÄV¦ ৾p9 mCO_¼èØb¯ÿ‹4^ºùê¿UµáÜíæ«ùŠ·¼nEÊþøtB›ßm)q4ŽüëÃí§ßsAmû7Z‰l››ñFŠoõZÆÛ¿Sëðãoè q¦K6¿¡%>n+iNˆý‡R_º^2ÒR[vBÞd¯ZQSî-G-áH…]…·iOE䢈DúÀéºûNŽ`L†ÙžLufTÊ Ýç“S¹ùÍßßÖݵû‹ü¢¹4ˆ*\šËck¢¯>Ì‹ø5}4¯æíÛš˜¶d@‡iœEˆÄ8Oò˜" 0f4â—¢]ýúnEy‹wTÕ›õ. õ]XÌmÚšªd³W–Ëô?ïÑÎ~yJ»ºáööË·h·;`ûuKÀ»ÞFùmËLJt[eÊVñ¹]øì¾£{áF$œHµEˆø>!M‹iä/tzïw÷»˜ïOÖ-ÿØû¤>:ÿÿ7ô#3î· þ’tø(ø?H“gþ‰ßño9#b·hÿ†¼ß¾xqW6ßïJþ•°ö;aâúáaêå—º¥éŠ¸§¡§uõü?wåæõ¡íOIÛkwDÿxW†ü§á=Ýžøýo7XuU¿ðÕ½¾÷lÞ”§/þ‘â›ÃæË?Ýïe œ\þoÞ¼ùòÅ?Ê?;·õ›ÞŠTJ‚ç©æÍ×ú–-io¡Ç}sòÎ,ï÷§¯³ÍÛ\¿øLJÁ?è;.#l^—›_HR›«? ïéÿóÿãòÄ;zÚàã¡,¹fßØ$³|ù‹šöîðnóOÿ´ùË櫯:=l^¿;m‚Í_7ÿw³árØTm6öq7Í7›þô/UOò¿Å¹Q¿ï øߎ÷Ô6ƒIz¡¯·Þ’Øßói ;‹â_ú˳·(ëW_WõÏõ,WÕÛÿx¼Ý¼f›mþY¬7þ_tÿÿïé€ùùCˆÿr6Éÿ»{Çÿ+ÞÆ?¿9ÜŸø‹£¸µ¿Å®»„/¼ÿ ú_~aý/‚aßþó¬ÿ]ê3Ôÿ„ýöÏÒxiQýòê§ç%ÛN¨|[_ê”EÖÁ“ÒõÊ;ý‚ü¼BÚ+·w«5·®žxÛ¶G©ƒkÞÔÇ6Ö¹²×j㾫 wwôØÆ´Í÷»]£ð _ßäî›|Úš¶Õw©Ô™Þv_™ãmÝô¸öUéSôö-'¡­ºPAP³"Œ þ)„i†È3¢< Ä!Êo÷½À4¾:,Õ# sç01·|"n;S}wž˜[׉iWj_Í­æçv0?(iÀŠ8JŠ$$M²4 “¤ Q–AòåúGéVùëÞÞïNÛ;Ç銞øt‰më>QyfDiÁ4Œ2&Ä [3Qñ²‰*ùÄ”‰ª¾;OT9kÃÉäZ½i*Óe8Æ!Ÿ'”  ! ÍH‚Ód$Ž¢O/¾ã2¢ã¼F¬±(xôl Ø>ôÏPþé…å¿ñPþ‹žå¿K|†òŸ~R,÷G8ß÷3$¬n&â⨴8lÞ /^üšã*ÇÚá ½;¢[‰!#ýq¸X%wNx©ÈËtwjÚW¶Î±Ûä4hb§¨GàSð4MCÿƒÈ» yŠqe #V./·ÆÄffÒßå2¡uîû‚¿‘o>Š×ÒÐj~‘\¶¾ç—õÚg¿‚Ê9]œªeûVô£í½PHbœä Åqg0a8Ç ‹iá(ÇT$¯øÕ¾V$j?9õ–×5t­3¼.'¿áv‘ Ï4¬-…™È©åð ÄÖ’? _¿nMÇëy´ ÛŒ„§ß2÷§Ñjí}ÃkK¡·§*Ý¡ÌXêt£áÇÖ´·«¢”«¿Û4‹Ó¥JÌäøJu›‘»:ÑÏdK­.÷àJDøÐöŠlË;tÂ7]ôåà!Ðø›“øèü¶@$×à/7v2V#Šì¸)€ëÕ˜2Há*EEFŒ( 0H£0×ô£“t üé4c†q”—Ř}¿pÍ3= 8:¸åó‚­»ûòfÂÓŠqsŒnÞ”ÏJóÏðcÐÿ³KŸÿõø¬ÿ_â3ÔÿEγ9®ögµ¿¹óÃo£J~Ój¦nßÜçW¥o’ëTJ™RÈ{ÉÀVkäÁKÀ7ù¶/c¡7!¡ï'¡ˆª,‘VˆÊðY²å\EšnU7[.¥iEfÞt*`¡zhds_ÊB{ˤuFe(¡[þÞŽ„ËŒUQ•Üj˜‘·k%ï°I‘m„¶~–ÙÆïÕ¥z)×*@÷W©LíÜ/_b:è/Rã¦x«èkûV¤áP˜D —íÃ$$ŒHÒŒåÎѧ¨Œ;õJ°¯ÛËÉF^ŽE²ïmˆ¡@ßk0¹{ âsïúPúí50È®½†ò ýAQȦµiò§ì]ï ´#j/ñYüÙ|†ò_|Yù/ŒÓÎ@øìÿs‘O#ÿuâ o¸àÄqÛ,÷ÅÜ×½C ¾©ùœ&Œ}W NÙ¨‘kD ÓúýžëЄ2§Oªíf¼ãQ«Ûi.±îyõHÀñYWE;=¬trëVrÆO›«ß]¿þ½<úm5ØW£}%ŽØ_:÷³´›¦‡AÈå–NŠ­ÍÕÄL›ØB¸3ÈÄVƒlT’Î…)Qæäxús¡e)^:O½N¾à¦·+Éïc;=õŒ[ú\^&®{—r•ëÛvÑÈÎ5Ç%Ö„ßõf—‹€uíˆÚÆ1zêÁÖ—Ñ—õ(ú› Cá‰sög}"oÄ'ŸÅË´)}õ“Hwò»d”Ý÷§ÐÂ+©b_n õ‚´;¹ÆUÜÒ´Ít{wØ‹ôt9ÞK‹‡€zz§²»ºëNαËÀãr@„L¿±™\zÅã©ÌGsùáòÇ?Ò»ª‹S׉–gö®gôž¹Óùþ¦ÇÓÙú_³Òä‘¿Ç‘-›”b‡ö?VDZÒYmiO*¡™ïÎø^{¼…ÖÏžÿDV™°²ŽŽkéÒvö<¨>Û {Äa˜Se:-ð™=éíá==ÛŽí’?Ï6ÕߘÌlèùmyBeŸËÉYâ5Ô_ò,ér_¸;“óÖŒý²dç”C4õÝYÄõÙõ¥z”õ¡çmá©wg®}îOëÑ«y”Æ >‰nSÓ5†ÌøÛ"I/‹J°Q¡ViCۺ̨SçMkÞ炵×Dá)-]åãô§]4ý”¢¶Û ÇÕHææWSéX¼9j²o†GR¶LºwVOí»É ºc÷¶™s-‡cÓ™s]C:ÝN›œ›´¼µÙâ0 ³{š®âèkçéÜîWµ¢+‰¿—öiÊÙNnƒI’¾Ô Áizõ*ã’IX;‰>U¢×Z‰CÇí¯òÚ|¸Bí¬^°<™ ÎÕ3%'K)P\R>;ƒ·íŒò0Y,Œ”#xÏ1¤Þ9²ì$*ª*•¯†Ú~¸ÚH"Û¦¡w u/P< zNÓß°»³Â5ÙÞº1)C I2.™Š”éIšÁˆ€… !ÁˆyÏðPv@VÕÆl}ªÛšÄ¿¥RjßmßÓ}Gþûý©èÂu£†ÝäµyØrHF£ôÕ8ÔÉ}‹Å¼A×Uãp”.ÛS]+°ÍÛÓÚ‡´eëííP£9&+Ù÷¨›š®Ûñun¾½çÒ2×]oø£ÒYä¨n‰ˆÇ=ðU¹ÝóïÒU‚7 Ç#o#Ýù­GÄeWÒŠ±>] {3ͤgš'ˆÅ8péOž xþ+A×p,ਣ»Ë:héîÐæÑ fñ줱ÎI£ÍÖgqEŸst7Ë‹c$õx­&í…©j·ý­/Ô‰ÏW²jao¶²O™ÇlŠOSðÀr%õÖ_Aæq|ÓQ€‚,H²„„$Kh˜SþOŽBLã€_VF)‡lgâ²bŒr5ʬê·ôöpü 8ш»yc佬 ñ‚x—4Zá¿6i,é'œg-™¨‡e:Z±¬ô“•y3ÃêÔð2riyÆ6Šæjtê¾–Qœé6tB­e”=¡™FÓ²uI>Ê Òæ)Å J)¢¸ q΂"ˆ’{Àö`ø‹OIö’†ã׫͖¿>ŽI"bqs{y4ÜÈV\4·dXp1xt‘шw}û)M`íh²AÇûª§vnír®?L©6qÊßKñ¶HuŸ¸ëå œÒ¥”½iæ9í0ýÎfCìjgª<ÈÂ0Å, ‰E¸(¢2’§y{€ã`èvxåËù=‘#ŸT«ÔVÐ*¹*ÞºgA%¸vÊ&¬ÙhpˆºÇ{‹×Æ}¨ŸB ÷¤Îœ“Zw.Þÿ,Cq¸Æ`¦+©A¶4†Z["¦E8õ:çÒQô3IÁ«Ðœ®Î V–ìvS`è§Àh¡¼Ú]ÂL÷q„Í$*BdiN QHA”S a’S+ZÂÁQ¢©ÈÅËýi˶ªnàeΰîtÍÏÿ~ýú;éT&:”y}¾½~ý›ë׿½~­ü;•ÿFx¨\?2î°ØI×$Dü|µUi9¶ø~‡Ž•ß†¨g(|¥ŽGúNüÌ¡…–­—¨œO“nûÀ²óz|⨬7A‹Q÷{Ëlk¢4ÇZ×iuGâ4|j¹5\Lšdû~+üð¨ÙªiK°Ñ4ø=Æd^-!§o±~^¥p³ëÛøñ¨÷SNþM:êÎL–Ñ÷ÊFZ²ëmªç;ÑlýwMÇ ã-ù¥#â²ÇdCiS'ã åyÉXC_;óBÈ¢Dø“Ê㨈Œ B"@ 1¡öˆ=Ó»˜d„",áx¸w#O9»ó)°ùý´½½¿UØoüÎK7Lôð-mè ó½­Œ®Ò%c/û•‡'›½~ÍÀHˆÿ_ò¿’™òºI­ZUTø–©15C¼öLÜWž¶çý{y‡ÊD·œ3ts_ªƒÀwô¤-…×äÝídÄHÅ »ÔrÂU´ë&B1²À@ŒVöÊyï^‹´½ú•â†ê=n¥ ò?ùdº‹"eó€\}8p•JI&ÛÛÊë[òþÊO´òœ9ÜqÙýàŸ¼yys¸ß‘7*®¥YK•x# \ž¥Š)@.³ è1åÒÕ¯Š{±‰3êlúˆð©³:ÔJ¶Vë9ˆëWôñmsxÝ®§†þ<ÂÍ^Ñé6?/¥Û`˜N×Tbyq üé}ÈŸWï¥ ÿ§Í¿Õ;¬¿Ì„ÝÜû³xq¶¡Ïôx},²Õ¬Dù‘§ŽÅm\ó„HéSh9ô²P;î2Þ²JÀÜŽVmb³\hx·žÂ³¶Ÿ5ð€ÛqF¼›q´Ó,fyJb£œ \ € Cœâ$]öÚN„m‘my·CÊóEj)ãÅÇH•›è¨ÜìdÔ=_VG¾Æ÷DX ¤Ývw÷D6œ}‹ðªÈ»œ°Í•üGÒ<‰2–>Ž?*›ˆt,ãrƒöÌåg*VŽDŠ©«¥³Õ;$xEA9áÖÛøU›êG[p˜,¶!?;ͳ¶ðu\õR[;ÌfùnÇüÈZ»„à{ë +}ï”*°Ð:€‰Ëó|L†µLµ¹6ÆFÛ0ÈŒsìØÎ GëÔM2Ú3ôéƒ1vàaÑ?«ŸzõÎl:Ž)"%¸È3 ƒ …y3@£4b$Ììlzôíì[ÝWg¥¨›ow;¡¹ –( ®eNDâ[H(Y çé$à¾ÚªtÚ" …¿ï²“^¢mõòÍæ?®_s}ÿOR{W:üÿ0Hª4oe!±gΕº»IÙ]MÈÖ!2¨®A§HU76jžåsÈ×S5X áËóÉž=§öTR¹¡£‹ç²§ñÄü!ç"¢6[Á {;ø êgC^ávqæhÎþ€9Í‹qŒs€!ƒ¨Àq¡DÑH—‘‡s\Ùv€¶þÀöÌð(†ï‚½(L;*öË"8B"\¡P¸@_ÿmø¥Ô0g½ø8ÀV=ÆÔµNç@ÙúžÁ«&ëµ*ªIdf¸G e½\™Dy„Š€!ÿ¦ HÂ(ƒŒ„@š¦bÜZYÒ«èØ VÊr•¶­q™µo[•XED÷£'o¶øFÅ!ª\:*×Ð{ºßŠtCZ&g.[þj·kºÓÂ1«>Ú!ø•jëÎnDª¿3£yý¤.x®Þó€Rœ®‚Õ©¶ˆƒÊY‚î,¯Ü" ògú||f:{²­ú<~³¼ï|gn–fwÞ󨹘׉Õ$EiˆÄ9¦(QHQÁ`–Ñ"¦yÚË%Øf`šíô“[6ÀÔ ”uÏp[3ÐþýjSž„+c׃Ú=qŠ™ææJ&ýßÊü-7‡ã ߟz gswFS¾ ƒÌ’GðÒGõ40Q7í÷Ì6Ê+Í%¿Kèe¿`¤6$~mG™`û5óóR/R?-i›\#üÛÌ]]®YÐê}9ÞL«@Úv—ëC»~ۼ“a™à,¬ñø,Y¢¥Å¥Y{tb‹ŽñSë¨{æ·Þê‰~¾%@IF)ƒ4@L0É®Þ q‘<¤yìÄm'㮆Æ+cB-§˜,ç­G×6æÛHu,ºØžæ'/¥>͉«Ç±rÛ^øÂ¥ª–jÜw0Ã=< yi>lÓ>p㉲¨œ-su“ZÒk.eÎ5@ôø²XŽÍºè*ÂõYÂŽù–^d7}-`góX™Ï4ßîAô;zËÉl1I aÛ–k éåŠn9¿ª8ß¼yórnG¶}%:ÿmýÚGr .í¯·!-Ý)ûúÞôàCGÝš* Ã?›ØläÎR䈖¤ÜŽaðØÚø߉d¿î•k˜©|Ç•}¢>¶qkÞ{ Ë==„6Œ3Îú`‹ˆ5¹aºÏö½2ýךhüJGe>ÙÂI”t¥åIhTÄ–ä›iî®»IÏÛ1Ññ㌲ŽE¤Ye)d £)NRŠ"Z„„¯2Dí ÚŒÈO2|² ¨›·Ñ FcF{@ÛɳårÈh2su¦–ÞЉ;D|žæq‡Þ«œ´N•œ*»0•üjØ&ÇW6Îêc‘ôüM“qµ7/  ÊÐýîTS}Çáëøa-Žhàk­Ù4¢,¢ê[tŠëUQÞ#%?E¦Œ+myAA  ŠŠ,CÌ2ØóVõ?¡ÔBcÇ^TOí/Skui¡!‰ØkÍ.™4UÉ[®ÄRç 8ç£" ýÍ°ÔË@ÓÑÔœI÷%Ò>ÜȈ`Z=¢P»¸ž·®–M_4ÍÄ¢26Y¸B¦ž'ïÌ–Ìü¤™”¾ø³ó÷7 ¬µ|ZeGYU c%8*ķ—º< †nT<€_EéœYüT8¨ Yºd¹X»G:"I‰) B„AÃá€‚Ø ˆÕèGŽ‘J‘õûí¨2—\>œ#e¶)on?}¼{óI0ý,O T „b.†14e¬ˆCÂH,’àczwªGeÞ‡J»éC®~‘îßo‡½Ø²‹Louhr¤Ê åiƒÞs-_^koÕÒbDÒ; }ßQú«]yøô‘ÿ±‘½¸þè83ÿúSë~m1™¹¯Ä~^ÜŸ¶»ÊuBçÕ¬üVaM»êzVÄ6Ä uÔ=`“êjálHóq4bšäaB (‹À, )"’ŽÄiÀ-^k*ln­s»©3\ájUue©Cè½@É°ãU¹ë ؤä³wè(u¥yº.¾;>짴Öòn*ƹjQ­ÑÃîÃn[LækÞR]Á‡;yÿ:´’OeÇyy•œ¨ø@E霒‘êâ¬Ç”sÂ*Pš…$ ó(…ÄqaÂD@&Y’ÚÃ*ªÇ°ÂPÙT‹×’·zü_" Eu]>d&Î& °¸úR¯ó®¼NªTž%wøe3ÊËÇŸ>ØiH¶0Õ:Ï Ý|ûl®d5TqÞˆvÕ9¦ôßP”íÔ‰ZXU¶SéêJ9«V¼OÀêa¸Êõ(y8Uµ¼­á]Î Ò8{>Nz¬zMS’È#×n2Z~W±¬^E_+×éµ›dbKéz`k}’«%êÁ§]Ù›`’‚DÁˆ+‰$(§A‘ÅAZDÌž’¢ÿ”«j|K \Véû÷JšÅHyÍë0*¶¸ˆÕß­ÕÖÒú‘KÜ){±]Š‘—§…!'*>D!Ei}¨¥"ôx9“õ{dRíÎ òûŒšN)‹ƒ<ˆ H²,Çü €Q–°r«PK:â‹A>kÒÉÒyÒ=fI-Ôp¹EoS÷—¬~“##I»´v‰¶ˆ×så­[ýÝú¿6ôíüdÐpš¹ Ǿ‚Ó-ÂŽýâê47q áƒcHBg5OŠ–ò‹ÃÁæµÌ›#ƒ€Â˜Å˜˜¥ /HœEQ‘gi†r»k…{¾Wíq~k|“c{Ìo:‘BÂù¢ã‹®¡­xD¶5Ön÷/mU¤»¡»k0÷pÐÝÀ8xQtëSSÈæéŽNË´³œÒ-“ž¸M4¶˜fwK\”=[â.c‰+§l.‰´P'ª]kغ ¼RuLV¨6Õ¼ø,U¸¦¬Jõe u8V^¶†ãŒqÜ,A4¼pOf G°Í8ôÂQƒÆ4Hpà8Î#\LYáH­îi³Î³5çÛÌ'›ñÓUYÖæž;õå¡Å"M¿tZKº9¾äMœãã×Bš6Ȥ¿Z7°[Nß êdωZyD4ˈ9d\Âi’ˆb pLF¤"óøVËeBn´QqÈ2„i÷¡“»ã·?Uu»ÿÈû—ÖÏ͉«<ÒUJnj{«v·…±EÍq™Ü³qÚÊVÐ Ÿª†6x|³‘K§JÙEÖwtO[¬'Y‘{Sd`>½5‰.eÙwÔyä?[žMöÁ Åÿ=Y"àšÀ¶gKÄy,–¸ãÒÕÊànF¸+æ‡í‰«Øí¨äï¤=LSðÀ2Ï®7¬³MÏ`|Æ€8s@aB„ŒF WbDÒÈÊø4½À‡È¯V[/ø?ÊRŠ(‰ÒÁ,ˆó @9@Á"‚ ~F¹䊚÷ð³2,O Óy;só¬Á¾ ÛÈžî7uÀˆ5Ô½àÇ€êzÃ㨗 «ÕuÙò€8ÇQ‚’´(f,H` @,µ'2<ÐX|•h,ÜwÛ÷t_—ÖIÂßþé#ŸýD"ûu‰åM «Ô7õ{–«\Þz 2¹‡ÉbÃgZXå̵Æzî¸NØäR–w)]Ï€ç§ênây nVy’ÙRKÕ#3j}¸œ2Rªô –¼”Ó,Êÿ! h 1Ic˜¡(Ë@0eaœc8Óøß>ÙXYmau/{Žp•)ÃîžÖú¤ä“§$‘lºÖ¾…%#Íðe82þ•x ½:nòtA̹ᣇa/q$6¸áùµñ·I ù ôåÛ ¤§qÈp“;ÞyëÑ'šè{DCy¢9š’Åœãá4ÉSX“€fyÆAh B@¦AÒôÀv¸|WËȵ/°5’£¬³òVFò¦]å˜#Šw’l°ÍžŠü1èøaœŒf Ö« ºˆ;B-LV¥øYŽy°JÄ1NC…håŽF3húÄIÐ#À¨º­gTöå€Ýµì(〄¡(v‹ 9W²³8år ¢aæ eɲ#F£U×ÁÅ*þÍpðVÅÎu÷•Š=Q_m^uÛZU–q·=*o”YÝÔoà¨ò¥ÁŠ£Á&VxÅnÈ%[:¦¤u¥ãcWÎÊJ+ÎjUüÏD"´‹å¯Ì<›'IC1ÆŠ¢`)$9È`‘Ä¥ö¤òqSÏVᦶ´$¯´0\9.u‡Ç¢dÍŽB‰ç…´V“è£ ²UaM³JUÙJ'Z›·­é:Ñ›ˆU’)|Œfå½m+>Ž–pôÜÅôüSP¨5vÅ×=øC^®gÖˆ˜\¤(@…Eˆc–ç8NBŒpÄcáˆöezà'дN›ÐŒj ¦¿—CU)¶e[EŠ#k‹ö¿(_mn·ûû²#n=ã{ß{Þ»í¹“öþ+æèÄ 20S­vÄÛ·2ƒ«ÍÒöœÇ`Žùq˜O½ƒ;""e´Ìˆ˜É† òw?VPCõUƒ²Ë©«%>ÖZŽ­´e{°rs³Ó‘ÜßÍ.ûRõ-ç(¹n½$x›¬=‹]kw.’|õ}&¹AïäœB„ÖÓãI’á>'1‹"DYAIœåqÅEà„˜EÀ^ªdz"?SIåg-pÌÎTÿGiô²:6ïóï±¹º/«£Gr¸å]o*·C߉íI ÊÁL½§+ý|E mžånœÀ@Öñ– ÛZ“\4KY$ý,êÁ·ŒsV±æïS’I‹Æy˜g0¦IÁÿ Â,EqíµzŒs÷$„­,ϳäòó“\\Mõ!X•‰xRV?«}Ý/¯˜8Dt<‹t¡âó=Dú>‡œ\`Á4¤ä)!1ÊŠd4`oÆöDdåc?¨öוÂIJLôD¿ç€ÏN.ÙƒzLïÖßÎóûÛ»Ax­–"ØlÒÅè°lj~ŠòV5ÍvÀßCxuÓhšS·: .4|ÈÙ“¥®®±0à 1"(Æ LRP$‘8ÏIL²(†"Œ‡Ø+v•Þ¦–¦Œ© % g9  ÁEs1J†B’¤)úeL-‡)S'Ÿ~NÊT.…¯/0?gª£\âH4©j´¦n³˜º/ðÑ©ž‰´î.K ¡‹AGQ "ãúbb,ŒY#çóç%m Ö•nyÊe›ƒÃpf%kVI/–¢-—JÝÌw¥úc"-R¯Ý4–,¤ëEz$=xIë?ßK(Š4 Qq†PZà8ÊÂ(ÊaNñÈá[oF«ï‹ÓáJ¿šL‚TowO‰˜åTzaÌ©ôå%S)ÕUOêÙãOY§E:¬ËªÔ¡©HÕ}.IÓjÈ¥ÔRo:]’S)žXßXN¥æZÇåÖÜ€ÏÎãdcZÁÐ]=oÓ™X­§¹ƒ‡>|p #aüÂD÷¬Ñ5  ÝùBŒ Æ Š²¢ÈIó(ÈYpÊ÷% ‹pDQ6>éwàí9?6ÚÌlù{£o^ɤ /(s‹NÇíOo*—Κԣ$µ€ÇA>L+{u{ [¶¥ä¥CJÐÅÒV8î”SINÛ¹q NåÛ€ÿ`£ê˜];xj!Ö-Æòr(B)7X1J^Ä=pM:§ê¬„¨GH[=ãü€æaŒHè/J§²¸ YšÇ1L¹îJ{¢õlv +î·;YóO¦1®‘AÖý“°PýRšÃË7êX²{/§.ˆždîžZB­PP#©C7¢j¸hÐ9Ï”¢ä1߯?Ê2y\8¹±„#:34xUå^n„l÷Ðöow¡Í˜çšy;ufºŸAdËëçI!‘L_û:Ú?œïssºÝ‘þ%ï˜þôK±²äÍ-‰}öÁ‰ „â_ÆA÷_õÁ?€0æ ÄAýC ÊÚ&ÿ° |Âö¹/Oè¸ÙüCÊÓá~gm7uý3ý 8Í 0¥0OšFIJ’‚ä RDÅcïùsÞÏpÿƒè ÿÓgû?MSØÛÿ1àóþ¿Ä纒 [ÁP¹?}'å7 㼶–@ô©/µÊ»¾é}ÿ$x§`õ Ýnw6×ÿe»Ç»{B7_ý÷¯d !¥~õ/_‰v/~}Øñ.ÇZ/Cï8“—nPf%Öª‘ÿóÇß ÚünK¹Œ¥‰¿>ÜÞ!|ú=—·£•Ì¸y¡ËŒj%¾Ê«ZšG组Ë:æÝTbtêæœqk?gàŒ[•xG4îÏÕ‹îü =!.çÍoh‰ÛJ€ÒšÉ˲ëýÂ7ͱR¹Å‘Íëj]5nvÍ´½êʼoÞ¼ìdáòš¬(ÍQJVÄãKH‰Ï=ÿ±ºþ$æPÂFnkÖ ÚºO,—Óæ7|/Ž›jG$§Eÿ…šÜo>V“ÜÜ×û]¨?ØöM_o«îY¢¡õÀ`7UŸ´þ‚E açƒä¤À$IŒ³%  ÆElq_õ>ÍSX¦ÚrÞYD•ôëèˆß¹V¯Ûõ­pB²]lKeÍðSœÙ¼ºb ¿UM¾F½ë=B­­bj6;î›-f5ËÔxuÖbmo;Ïzmé÷—,*` Ž(M!ÿ7 (Î0åÊ;.‚O/~_Ý:ºj£ŸÝª5yp¹ç$KÔWmYr¦V‹^c}ó±ÏšE8ÙrÖ‚ìß|žeÙ亮8£Q˜e|=FY†Ð$OAŽŠ`š’âÓ‹?èy~G×hüٮѱD&õ:u_R­ÈðÍÇŽØÖ,$ËõY˧sßyVN§ƒÞ¢¡JYœr…ˆ¥†0!I‹(€ Ç Dk¬r£Ë%ül—ËH»ÿìÉìß|ì ñÍê›l9köo>Ïbì÷Ò[‘Q†HR¾0qšŠÌz¬@A’ÃÀ4Œ“üÓ‹ï*]ÁÝ° ~¶‹ÓË^H]‰tµ‰*)²Šªö*‡´Ú ãZñáAÌ¥˜ þ~Üf&?Yu<¡ÿì?ðÂöŸ0 úö_þx¶ÿ\âc°ÿÜïvæ84ÿð›¾Ñ¿ŽxƒÖö³Æš#N²ä‚AoÕö¤¢ÌAe‹8ÔHV —PõåEtŠWó ªÇ¡õmä¤ÊDµS€Š%:jæ‹#½ãÍk„žiU, G‰ííŸÅýc†Œ¤œÒ\ª^hÙ0¼Ï/æÏð7¼•f4êO±`ãî3àÔÝx´XŽµôöí‚Þ´]úJ2PÄ4Aœ¤ ’Š¢õe! hž`K¶ÍËèòL¬ê}œ‡=–†ü?º0ÿ†ÃóŸà™ÿ_âÓð|8Év/äÄŽã˜ï~3ÿþß»é›þ5„j¼ý»š=:ñ÷ Xt%¦ÓÍ׺þþÃ%”9õyRm7“}Û/UX½€d_=AùÎõ¹W—sypé¢:ѳԌ>m®~wýú÷ׯÿpýú·Õ_Mù•~~9§·5ýt°¦îª¢á7WîÔ'[Nö)7Wƒ81](…•÷1kî…þ|Ù©êü¬.ñßÞšþç=Ú¹³¦ô–M´¦ëƒ67¨w⦆Tf‘Ý'±ø‹‘눾†§ês)|ÑŒO˜U ÔÜdjgÈuEÜOü¡$9 CA\° "gi”e ¢„Kر-s[+]÷¦¡µ@®y™§±WaÊ<2—‚Ï—éšyÄ#Kî¿Æ€Rd\ðDq˜2Èb#@q bÂBÛkŒF^cOå®ýï\‰˜c¯KAªÃKw¤äóå+ŠK¬Ø&Þ2ÑÏlßsüµû¼nžåb‰Á,…EåEœÇLäUGE¥)LÂ""!ëf¦± ~Ú¹¼“r u‚ù¿"ãîC'‚òJDA£*˜ñ(¯¾ì'´nœ¡wKÕmo*ïºßÆ Ö´ÐÓÑÈ'_áÿÝïGNd“×ËЩ³ów˜Ù6¿Ýý[›Ð·o»É"yŸ¯œ ]õdo*¶ø~亻Cm³‰þÄCï Ä"zŽ§¾°‹GÝS¹50)Ôˆ1l“j†H:Ññ ‘’à’øB#% hZ¼w±Î­A7a2ʘDaHIœ œ°ŒqÈâ@PDqÆ`R>Þš ^À$ñê´iòxI¸RStw(Ëm±ûÀï$‡ûÓKGŒ7·3œ\Ý}3#±¡ l­è:ìË÷WB_cCðµ·¥~7¶)•è°»)ùÜߊâ‚C3%_BŽ=ÆÎrƒc˜ØåY‘à8–Þ""à,CEHC"‚"Ûåê!íÛ¼I:z¼§"éKgÜ*ú­©órUÃëë_>lKúòÕ†¡]Yø¿ôâ‰KL·%|úpzÑr™¤¿Çû‘r“·Í›€˜6¬Âáp85CAwv…§(Èÿž„'»x¤¨ÇŒ„o ñ¤ Ð:èøNIЋ`$(=¦r˜ÅaÈ ˜’˜°ˆÅQÁ(B1¡g0ÃC9v;ŠËJè‘R8‡²·ôöpü On]ÅŸó«zb  r $«Õ°ÇßÛ)b몜8Rò¹ ·þô“í£)(ƒD(;úžîÜ7pH0æ;¶@¬@¤HCH¢8 "Ì•TŒmàí„ÞB¶åÝ}(Ï®ªˆìÃhó€>Tiùø^ µºq¿BΉs2áq"ý’*_.9.Å9•Ž"§ns%ÿ‘4ù(Ôþ8ܺCsZ$±€Ñ0€(EÅÄEaÁ2–Àtš›±Øá©D ‰‚uó:ŒIGº(#]B¥|×~¿–£QÛ¶¹;ågéÁ]?‹“õž¡c¾Y—o2ðà·Y’ÆšBIm uŸ†mŒ Ÿ{«ÛÅÜÝ»¥I H(C÷»êË‘¿}þf?ø$5°1쨜D È™–OªHžÿ´Puä €bQ@C4‹X&»,$²¼š´«ØѧVꔊW)vR™¥ÞÉ-³AmE*>éz¯$µjEªò4*Õ^$Rn{ ^«fÊaL X÷n>Xz{wú`Âäpª¡ñ¡Š;úƒs=»ƒá³0µP˜r@õŽ$5%tU€êßs,-\ðÍ™–O|[]ˆÇBñ1M[icÄEŒY‘"ÎÌ ׎‹”©ÉÑ?Æ‘ž§ÒcæÈSÃ#\dFw‡Ã÷w.Ãé°?]qù‹•H:–ßèZ-ºìÄ`õp¸ë‹¶K›Dd´ntiÌ ˆ8 óH#U9~Òä¹P@–¢,‰ÂdN£ˆf,‚&Qž ³¹¥B¨=jkžr|!]Ü™Z5_ˆË] _ˆFcÞ éFr#Æàµä!ŒR–…4NI–†A9È¹Æ”å ¶½àéµtdµÎüv%¸áK™¾gá+é’˜¿E¯¤Cn|oÀ,ÌIò¼` ˆ®œFaJ¸Kó’[^Bš{z ]•£3£š&2| .w-| o¢KÏM£ê¿"8OIœ" ²˜%IèH*`g!´½¢Ø×+êqÃî„÷¥áU͸{é+ëÓñtߪ&nšIÿ¥…°ˆI`BsÆ¢‚"L·¢,Ä8fqb;h |¡[_#³Ï»éÐxÎÝ~Þš—T îúiÿ}¥AÈ0Jã"-p“˜1€ ÎQ† d4´¥I/!A³:t¦[·F ß”Û} ß‘Ně覑}y5@¼.´qÑ !g Íâów‘óíÃ4µ"^æé]h&ªÎœê¦«á»p»oá»Ð‰Ì{­CÅà]hdÇe…8‰aG”o–q™gi„qA LsJÛkI|½–Ž­¯;»] á¥8ܵô•tixÛ]ª&ƒfÿµ €#B9€yÈRPž$Aq˜åÌöZRëk™•ße?B„ØyŠ0QMò¤I ~ø’ ´$hHf¶«’Í*'bx¶åÉ4NþÚ>¾Û½T ¸N d9‰É ãR'dW  ˜¥AÒ-‚lxØ¿NBz.å{Qñèj{ÚÜ¢Â3©‚ž¨Ü<ÐÝî¥*Ô^×øln³Ý\‰–/Û²¢’:Àv_Ò£8­Fª8;‡“¬©êèä$šÖÇä†!‰¡ò§GÕ3}{ýúÏRÞÿƒ<–. /‘6©¥>~¯g¦"Wz«aÎÎi`ÙéösíÎë|ûvOêžÍnc~ãoßÊ9ø×|<ºÛG´oÜ8-Õ‘:ápAÐõ;Z†iýSFì$®9QñƒmË3T ¡i´õз ÂHs’Ä(Í‚à¤,KI–‡D˜™2”Ú!l˜—êûKä¥êë)˲R ¥ç<ÓâKÇÿí¥ë¹™OO»5Î:vÜp9Œua …dvï-î¬K –)¹ë{/ƒ”^̳áê4 8Ðð'‹£¥ tÎ*í T Å, "”æ¿3Ã,Š‚qmÕ*˲8 ÃÀß»iqŽN¿k’;ÁÈ*ÏŒ-yD¶ñ’¯)^ ƒ\MËöi?·’éòôNu¢âg¯.ÎÌd¢ã—½Û³3Þ昣IÚ—Š4N â8a\C. ÉRÆÂ(ÊhŽ£0²ïग़ «^ÏÏôj~h˜Ÿiïï¥_2²^Ûfí'aš¸y~ ¦v”’¶÷&eQ¦ÐltÔw$g7«oßÊ÷o»(Ýl×$ÎØ.*{¨íª²ÐY¯ Acµö¥É=Mè²E¶©®¯ÅÌ^R%ÃÕiÄt á/'d2Ðy,m(¡asåaaã €Ê`³Ü{þ1ÙEµÜ8]S(U™)RMXM5c¡Ý0WÕ¨£-Ìßy°»øÜ׃|í–¹Tçh/éEsyÊ|öw¶HØex1n²£À„{Ö$Æœ©_?¸4ÑÉym;ã{È1 P+‡)YL² ,ò Ã(Ï#!¦yÈ$ µ/ÞtÞ“SÇÆûãþð°ïÂÒ•ÐÍ8ZU[l#NvÊWUê(7ÕXË—½ü'㉾éÕ]Ȩ̂nvðA¢Ü½)̽iQȇ±ëx‡Æ¯n[Ø°5 ¸ošzGE`T£Å[ñ05äÞŠAD‡ºÝ¡FAóím]Dóu¾Ãê‚v÷ûãa¼±^`ÕÜFT¯íÖq57êÁµ4éâ³ÖDƒñ*rÐlŒå Yš±C€Iƒ$ã<ŽYŠ‚AuQÂAßfµ¿»dƒNF¾‡›-¾q v¹¼ƒ6ç-G}¾>Lçe0(ÞžŒ•êÌÖŽdU(Å$ :Òñ‰±ó ´ª/úyÏC£ãÆÃ/V Ç)ÅŠ š'f)f,¡q”’$ €VbÇüH&Kƒ©Pb Ú¼Û¾§ûM5è6{AÝJ «f_ ±uˆíiC´Üÿâ¤ò ”÷|ÿv½Aøaô†Ò$,():âöÚfõÆícOý^*ºõN/¨´SŠ¹•eÇÅæP“…¶êïHÿóž–˜қúÚ⦠$áÓ2C´îmýãU­Y9h7–™PJîkqùÏx}éøÆ™ÝÑ[Ö@éP†³0c˜°ˆ0€©H$Iv03ä ü~VÎ@'¡ïI% 4ŠRþÒ‚UàðäÎJìÎj—9Gy6¢tðÚÇ#}w¿CÇ12ÏÆ«±eWÛOxîéøájûKø&îÏàœ8°}ìÝcÆ €’’“$Aœ À($Œâ< Gìû ú+ ƶ¯dVº“ö¼rÒq†‡õÀš0Ó{±_WSÝ×ÄöUAxh—}¿ÇÍÕëë_),l÷’]êÛ³e{­.g=mªëZ1K®ïVéüüYw#ÃÛ/R]œ¿Ÿ_‘iT×¾\æ#`­ÒLƒ¾O ¯ˆ­÷J«6ù#ùY4-KSI˜³½(4n`¶(êþ¬îø™Ø]G;oÝóÇÏg˜ÿ1ßÜ’Øgãù$ôó?Â4Žžó?^âå0 Bšg9 #JH ”ƒqXÁF=¾çÏy?Ãý'o.›ÿ5 £p˜ÿ5xÞÿ—ø4ù_¶¡©<°\J«$cã­ß˜>W^ØAgçÌë8‚©•æ¿˜¼1—‹eµÙ]wZÇ?™)Ôrçꎛ>;'Ôn÷V%]ú§{rlï8 Y)a3’ø×kwN©J-÷S–NO׌¶»aBΑ%'çL”y?mêr1{áµP»Mõ·P³åŸç™OsVÒéIÙ²“Zîé$'œÕÓü 4oHçI/Ev÷„Âõ½Ô¿U7¯ÞåC£¼°¶†_YTgñó/&¸c³ÎÉÐʶ†ÚòÊÕ(§D“ÙÍJÚC ¶!'ŸÇÈ?iBØ(iÄ‚¼È!9’@d ¥”®ÕY³„æmöCãô´öU¿ëá4ýMùöÖP;Ûzð’’o¹àØ_ °@€f Àqd ,/@EB¡Â©m%ÀÉ•0+ß•ßõÒ?Se“ÎëfÕ³­ŸåG¸v¡Â©ÏÙ†;ýu8nrÅF4 Pá(‰Sc†A‘¥8‰3þw‚:£c?𙆦 :šÜš½¬4¥ØBK ø`<õ­7h¯ç‘P§¿ Oþ[ÍámÝ»¬re»Sf”¢’ý×ðNÞ¾åÒép÷…yû–¯üÉ6ÿÝN5éùXè"ƒ³ÎQ¥j<¬hÚ»ç\,½ö3¦ˆ;ô šgƒçÅ1F#ôÎjt&pQ† LP(A9ƒQB1#(BÙ48/Kç³wÀ×AÒ ¥[~Ÿ¸ì#8h.âCûâA©?¨•ÓÂñ 7ý$@£FgÀ™Eõl³8ëÐ=¯ÒZC…;ìdQ&¦ráÈ“ Ìó<¤(…8@lv–æ n/!ÕèiˆYˆ^ Ó}ÏiµwªÑðn„¤TÕb.›4]ÿ@ñ]’‘2Áû-¦›÷€ÊÔJâ2LâX{ËI/9þhBb=¡U=Œ÷|uô'_wH÷d1ÏÕ4¶½ÄI:kR'!9}ÅÔk[”9)OX*’$•dú4eHÝ íˆÃMû™0¿¼ŸóÛgÐöÊ q‚Æ4.HR¢ˆpqÉ"’“ Åq¦äL'¡—M¯ y’ä¼êfÐ<Û “Ô=j3‚ÞyíHýèàÁAœð>åÈ„8ˆªûTqææ®ö˜Ž·”Ù =h®(v_˜)€”òÅY$yeE0‹b\1 ˆ†OK(rîFÒ…m+é`Z’‘nRç¨&b£æ€óAþÀñý ê´‹F‹U|›Ôôø§äþ‚v-ªÉ—(®ŽÄ5I¤zÁü럻0[SŠ@ðXìš·ó©YÀÚÞôžÁTO?8Òj˜ºÓ<˜.Ív8Bï©ås à8â²¢Èi†â<£¤@,ÈHìok³!ŽYgÃÖ«Ãýi>tÙZÖg>Ì<š\Ü4Cš‚‘··ÈÔ\çHtéä*E?ÕX3wô™Eõlø³<ÿÕÁG7N¯É‹¥lGQ˜åQœÅi˜G¸ Žòñ¯\sÏP7 L'˜zIJ,Ëô2›ôã'Çú™Åä/—TË/ô.&$câ®Gä uHÞxعóˆ%ÔÏÇ+š.<' ˜êÏC6ê,LéÞiÈàbiHÈ#ã  –GÛM§´ÕꮵH‚Ç#-ï{™¹Ö*#6)mû m_ŒûU˜;H3ѳéK*¦£ÌÇuËé†M>}W Óñrº¡ûÃ(g~Wkó²úªçv.$¤âmçŽ3éž ýVdÿ²Š®ŽËÊþÁ4¥!HP„4"”Âyœ’FiP€iü3d;ÍÊ 6Oð=_z° 5æUäýå Kþ.Å:gˆ·gušDгÀž‚óixªb¸œao&ݳÁ^Eß öÚê׎lðé˜*cŽ‹YCˆ“Åq‚YJq‡!iá`ª¬žç±ÔTÑæJ!!%/ëÜÿ~Gù ¾Ã‡»M•þl£Ô賸 £ˆI}^ì.\=Wåö"Egý¡¤é¡.2¬õî ½àÙ)ã\ )0ØËd„©;DΡz>€”ä/+Ê>°sª+Ó,ÝÝŸÜ‘1, 1Æ"L£4†ˆä¢ê}žÆü.È(;æE‡ˆÙFä+v<Ün:(p{·ûÐÑŸ­àÖ‹×ФB>†±ã¡*ß5Ÿ¬N–m~Ïý‘‚d­ºJ…"MŽ$qG5ÐÁƒârulÅÃ×hV%õwD¥^u“º»3°&q·Ì >qP¶ù³å‘Õ#<ë²0Ä”ª·é-*dÔ$;ìÖYÆî1!sÄýi[ýÕfÉ3"LíĬ=Õ ‘ú·*~Ú!ŽS¿aFŒèÚžÎ?Úëh 7ê¯ÏìÓ«$ïΞ¢˜…aFQ(JBc§0b˜ÆA\P“üÓs†¹‹|†ùŸÂð²ùŸ@Óä9ÿÓ#}šüO-ž¨\ÜUR&Kò§0üÔßê¾o¿|Ü\È9 Ýnw6×ÿ¥:²Þ|õß¿ªÚüüê_¾-_üšc *GT¾£wI¤²O™óUC6©ßIsžKú¢&‰ˆÏþ*sÔ jxi_¨­”Lù<´ ·u6­8Ÿß²-=ιKkCt¸GÔDšuƒ\ààKBè'íri›¿<Ä]nËbT}êŸÃw—袷\PQ@BǬó€%9)@Žƒ84L„€d–€ìúŽËšG”Æ•­^çÕÕŸß"’Zö7•²Ý,#í×Ù IÝv.f¦¨÷øb”¡0"´¢,‡ ¡0Á0agt2ÏW9"Vgù3›»‚”Ư[:¿Í^=3´w2é÷ L`DsH Î8B€1Ž‚<È‹FÒQºý{tÜŠ•WMXòˆŽŸÙÓp]Ü—\06·fU4¿Ì^â&÷P±$õFä’Q¦ rÀ€ˆÂš! ª¶Þ—\\!âÍó)½--jyh] ÂHºf·Ê7~[ÖIUPÙZl•ã,Ø}à/øAÖ ætùCL›…•ý´À'«ùò±­÷ë?ÃóŸ »ìù—TbØ?ÿá²îóùÏ%>ÃóŸJˆ?ÿ ²ÁùOuß7ƒ_FϪ63ÏAgÝùÏàŒCX·-g&–ôìÝâw#g#õTœõlDÿ g#]¯K1Q’cÝQ5Ñ•‡þ^x|Ò×׿¬áZðóÚ§ª=Zá°‹0¦2pU¸ô÷ïTI¹vz¸ÙîTð§ zŠü\*m0TEêÍæW›zeŠÎ7hW ¿Y‘MåæýV–§üÿ½²ÝINÀ9Ëò•Ÿ¶"b=j]I;KsÙ9}GÈs uΣŸÿT¿I?¶¡Lç>+X|»ŸäÏ'm§ÿ€¸èá(qé ¢)„q– .FDdiþ£îÿ%ˆØ&8´N°KEÑ¡´§]Þ?Þ÷Ä=\Çy7¢šíZûãn[ eº¦± Ê¢UΡ&Ï(â,‚N”¨!ÆÔxuöÂ8[ìggÉ´}ôÖ ‰i ÂiJb EfRHh‚cœ®Vþ¾ÙçZ\úÔŠV­¡~]óÓÞ½Ö¤É1ã]»X›æ¼×µÖ¦šòô­MâÂ0I¹ØÏq Ï£$˜3”daÓ˜Â8 Ò¼¤IýÏûÛ”i0^öØ‹ž5½âÇ·‡÷Ãp'C›JÕ䬬rÖ¼¸¶Ó™øŸ³¶óüé þàÂú_(Š½ô¿çú¯ùüÿ*¿àqÿ?0ôÿxW·ŽÚ#þªM«ÿ­Ñça3•+œìc¥¦5¥-td¡×˜uþ¾P|ó±zöœAÿ]ÙG^Ãà¤AÝ77Ft` ¬=Ðß¾­(j+E°GiNbL³ ¡Qž‹¼® ƒ(ƒIôé…MySœ|ŽEïü•qÁ¢^ŸSÚEÿ…Xd ÙCíO¨»Æk¬ýHwHÅA©ouˆ…PlG–wÍâî°ûPi3š´Û½†Qwi„~exm&)J»h°w/óIEwå½`!#†fúîeÏ4rupôÓ½ZËAö†C€îeÓ!@÷ºÍȯµé$ü¸¼±º]ë3Å·!ÿO/Ìÿäû/žùÿE> ÿ¯â/EÝXÕç´aü¾é~éWx^[P¸"ÝÙȦj¾*•ÞÈü®ê»ªØªòâ¹öë¡[‡2ÂÚ–âÁSÔÇ[õg+ÜØ·Êõ8Öî0–>Û$˜‹íNu7¬k«Ýa®fÛ'ÊÀÔBbáÂÒ±úZR0v¢â£ ¾™æŽˆjxCy.…/ê˜ñɦi ²ÄlÚq#ôg‡_öhóñU¿¸Å^¦\/r˜F¡iƲ0Äyˆa@Y”yAÃNjÀ/Sjqoyâ~eE;¾0 J=oæôÏu>cÒgUCq,óçX¸ü¯¬EÏHAÕÚÅ; Þo@æŒÛ´yû¶&9¢L™¦k+Ÿ‹½dËC¦<“÷¯E‰Åy˜TΑ|ÙZà,M)ɳ OSˆ! ó$ÏaDX&̆«kÿõöý ™RÍ…êü-‡‰óe4îÐqìôÜêúuJ¨ÎƃA ¿¹;·_OÏ Mì] kwïâr{C*8¹Ý‡3öpŒ²‚¤”†¨À! "ZDqÌ`øÀ¶‡—Ò,åù5ô ûUÛ¬jo½(w¶›FÝÁzõçFo™_{ŽÉ?Y8§úÜ¿¯{@8ìleaÀ;tlÊ2—wo9‚Þ ÷Ûñ/qäòÙ\Õ¿5i›8*s¢¨æ{²e:NïugíÑ#ˆñ†*æ ó¹|ç¼` ‰ð|oÜ]4ë ΂âG»z%v†ùtOÞ¿¸×ßPy ŒAÆu.È`ˆƒÆy”€<³<)ø¬®«3)\ÍÞ«zæ²¹:•’pĸÈ7! ?«MÕ¯c°lNl+ k7ÖòÂ2C2ÕhÖ”Ž{$$(hB²(Ç€¥˜ Š$NŽS„r«UdQõŸºÍã׋ù™)WFz—«“ƒK¡š±&ËpÏP Åb’žÂ?wJ«qð\Ž³æ^<”  –E€Ò"O)ŠdhMg"ÍŠƒX¤KI­ v¦)õ¶£–²(/ùö³”Ž—EPw¯ãÎÛdÓ%P†–rûå¡/Ä@ʳ_ú2Xì¸cÇŠã»þœÅKæ‚Ç Œˆáêl8ÑX +êŒôdšÑ7ë (pÄˤ% ‰rb‘d‰ãE–%,!6 ðYIÄ*¯~È8Úˇ‚ü “Kñú H²—ç° ÃÂí<(a¸:µh¬Ýγëglún‘rak 9È’4ÂyÊÄ@”€— BLò0‰­¶_…1æj9 Š`x;þ]sú2*³J` “®ÆáÉ÷Uƒdëk»ÎL\+<€G—w±±?îwdÃõÔB7‹tOÿåu§ÊµI¼ðþ‘ŒRýbË“p]— Çö}~þ˜üÿóð 9œ|ö1ÿ„é þ/yöÿ¿È‡lßÑÝÍæËC›SêË_l6”¼£›¿0ŽÝ{·_ù¯t÷žŠóü/_‰Ëíßø øò•dmÆvÍ•¦ñ_ÿ§,sv¸P.oÐýúHñáHäßò;Áæ/’î×Ú_ÝP!|¼ _=lÉé†ÿ_áÃîpüúËb‡ð_¾0¸«~zw¤Ò˜ÿVž>ìxwâ%_nÄ´»:ý¾þ—zd+®K¢Uc‚Ž?ŽøfK¢ÁS¨*ox¯ªÁËÈø/7 ùÐ3ù6ãìõ^òÂÓõ¾NÞ~½—YµÞ»“ZEƒÏžÔ‡.& æôÕŸÿô‡¯¿üªÊ-%§Ô¨~êÐÓS× ¦ól‘ölm ïOÛÓEç]2ž&¯!ÿêÿwóÑù?_E?Ð ãü—F³0ÏΓYž²æYø…øBïÞܒؽ þ0Ðù’(}æÿ—ød ‡4Á0F¤E ò¹À#\@Œ’’Çßó缟žü¿ßNBïõ<±ÿ£Æ=ù? ásþÇ‹|šø_™jã»Æ_ûÓ‹’Ú‰YºªNãŠã–² i³d”ƈõ?l˺¬ÔuuPP ãÄǪëO½3•‘áÓæÓÇë;ôŽ‚©ôSàÓ§sèòaH%œIïJ4—Š*;$g:ˆ’Vâ€uH,žIŒsr*<ÀD,hŸV2“—ÍžÎ$Ô¤ÊìÊfÚšæ;ŸO¤Ž–í‘Á\RÇ#}w¿CÇ!©¹K[JR™»´…ö=\E`îÚÞß‹úñ}*s¶¡$}ŸäÜå]§GRš»¸õD+"•èæÜu^bt²¼¹+]hóC*s—z)8¿¥Â¹K½N94 4w¡75û„æ®õæÀ°OhîjOEÑè!j½÷Âéï{l&?òÑå?qNPúNÿ2%ÿ¥ }ûo”<Ëù4òŸÌù¢–«”üd’å:i2ÚíäÒY?%ïÉóàÁ®r„ü†ÄÍ„#Ö áÅ<G`¯FàçBÒ4ÀÉ+ÃDŽø]I©ÆADŽÐÝÒ0ŒÃµ;B®y,Ž ­Ó1ŒÇQHiådópW©FÆ0Ç•ZIÚæ¡8.Ö–†aŽëµÍk‡ã’íæíÓ€Ž«vkY±ÐqÅn-«:®ÖFE0Âq­v©Æâ¸RÃ<Ç…Ú¥b‹ã:JŠyŽ‹´"`ã ½Eøx0o}è¸@¥„n|ŠØqyÖ†cˆ¨P°ÌCp\¡ÃÜ¥_óýŽËr Ü™Çqyš¨Ææ¸LkÝÎ<$Ç¥Ú!b‰ãrj™æ19.]#¹áèÇuÜè«ÆA%Žk¹KÅ0Ç-^ó0tEÀ0ÇÝ(Ëæa8®ä.ÃXWp›ýÓ0ÇÜÍ : á¸~Û’Y†q8.ÚnÙ­>Ôq¥v=L4×iKÃ0ÇUzÚZá¸J+†8®Re¬0Áq‰6$ £H>O›Çó§ý ýÿ’ ׋Óóÿ‚gÿ¿‹|ûO‡ŒåÿMšÂo¾é~éçÿ,Ng6×G®lÊö”¥Z·ß !Cè»ôXwåJýûw”PæDû¤ÚnFŸÊüse»žIʘ[X£x7“"çeÿ¢üÍÛhM=è9èÛî–Þ8+¶‡˜ÛÅõõ?¿èv3gÂzOæ´þÖ&ÕfÇ7e·î'$îM‘L¤=–ÈYk¿°‡´Ù†\ýƒlË6ªS£®©-öh«Ñ±åã^Oº¢Ôf˜s“øFi`ØNöÄ+㈽Úh­ø®YzÅÓ ¦²))ešÂj¹dqùµ¾}e„¾¿é¾ßLòâ”ÑÐ8ȃ™ÍP".–Ÿ¡ER>”£Ir X”’Ãq¥ôl»“1f¤€$LFìpÏGâ 2±é´ç‰ØA{UJ×&÷ûÔý«÷ûÒ*§*aèŒRÅ0 Òš¦yBLDâ”· inݾ몜6›NOZvNcåÿÚËJ@bt J™æ •ùyœvPY¬Ãd×ôøQ!åWüäÃݨq@H[VëHé –kU]2ÛµöÇݶ¸€4Pû^Úvxã›9ÎtÖ¢ECè|6º‹Ù þæÙö§AÖ}¡u2ÃàB„@–b’ç¤HÂAq!°8Gˆ…6liÀŽ/u»Á££Éÿ¢÷¿hšW§šØ9ˆQópýúÿÿkÏb+?nÞxϲ\xÒ£¿ÅT×Mifù­eýÌÄ(^Éõ_]Ewß–G­&‚?DMþœ6Ã#¸SÒ2ŠcŠJ_T¡ëA#0 ÜÚú‰×€\¿¢ôðâ¼9PX lËkRÉ\ôDfMMjr˜„Aå„.3ÅIcHBH0ãÿ±žÓÌ©I-_w¿>—œösö3˜Ø¦ŽÏ“-=mtp‹Ð°Æmö†{¨¡Aw Æª×þÅGS­jsƒI„u§´iÏUõÚÜ‹‡b¶&AV9 ˜£$MYŒ F। Af…É3U½Ê)>«^lJ®‚N<Ï)mºêµ6“ÁýòPmp4ûåI'sÕk½Í«^ÏAÅjÃÕ)Øp¢±0VT½vÓ8½U½–©<¬`ÀŒÅ´à8)H‚„å\ز…¡êõ÷K«^k„ŸlÕkƒË_Õëlááõ¢ƒé¥hÕ:ص˜·¬uµ-س4B娗Ä^œŒT™¦°:båè^R{Ds-¥ýžu((‚Œ¢€„†yQ€†Y–ÅQÈ ²:÷®/¶mŕʵNl '¿:CÑíÕŶk¥ëw­ÂÕQ¶Ô¡ÿZ»‡›C9G‡só²KLñ‚®*Q%u¸áÕÐÞ»V+;ø¨µ|9²ôª;®MáÊäýkQeqmh7ı4´ lÜ¡ƒ2LIFR€"!8Å §ijƒ­&tÿ´»®=äçUEh…] Øî_ú+ÝQRZ÷¿žéøž¼ùä6}iEHÁp"W”gã5—Z¾Ñ`@䌬®óõ_áÈíTò¶•ø£ò´—ãè4uhE •âŒ0&Ù@C¦Ž™ÉûׂŽ$âËGzWÌ= wK|±@„‰QBÒ¤$0"!-²$JIIE ˬñ€ò)\µC"º“ùoËZèøöúõŸ%Œþáõõ/ùÆ¿•éû[Ǻƨjµ„œñŒOUEø÷‡5þÈ«ÐdxZ¦{#-1òíÊŸ bR¼†TføŒø ÔÙ’[ÕêÝq{ªcŸn(þÑ®ˆ!²Bœ°\q$Zl¹2X¦r4­ÂÖQM¯tRh¬ÆØ9ú¢8K¯’ŒQ{ ?¨r˜ÆuCQ&cHP˜ÅIcjuª.ϯÖX­ªï›+Ö”˜”A]þ;+ä.ˆ•7uUÏ×qè=œugåÍá~GTtV²Ïº ZMC” ŸÔ;©Õ*âV*¶«¨ìUA]„1½ã8ö²;„V;áowDJ½Õ3sí\áK5mЃyå)Û1ANŒ«ºõ³îí®S…ßÚ¨5\º­ÃëþlyH5ìƒV½ö{ç#^uxÎÙ½&è ½«ï5σðÄÉ‹#¯hl#ÿçüÖÁeë?€AýÏ NŸë?\âÓÔú8TE,… @ð©/f™ü”ºNN/^&ÂÐí–ó×ëÿRyn¾úï_iÅï¾ú—¯DÛ¿>ìxw‡#ª\Ñ;õò8ÝäñÖPuâwò´Ú%Eþ ¹üŸ¯_ÿéúõï"::}¥üWÙÙ”ª%ásÇtR·¯”[Ë -Ö6í¥Lin®¸ˆÞ¾rÌ0ß |môæ2ÒÈÜXGôÖ*7“¹¹4–èÍUðôhuNÚìîkØso¤&‚žšî7”Kl;Îß~ÓV¦Uf¶aªé¶¿&Ù4_щ€ïöcåÎQ­ɪ8 ´Fβ,¤{ØK¦Â|µ9ÿ‡h³å’+m2äÕbâ1‘8IxÅʃ©Ø,ŸµðÙŒX8ZL8ojûi˜ÂOl Kþ>ÇÍüE•¬—,LûUhp?LaB_¡ZžõK_¦Fˆx«¨k(ö Â(-"E4¢ Ήh#”ƒ§bÓý±õ$\æ‘'#/Â"†U…PmæÈžãÙÐ iuÕÓä«^«}ÕQ«Ž»¾þ*ãB/;ƒöë¢×?'ÍÂì˜_¿¢Þ{ýa²@œ‚1cqf§Œd gµ×¯ç9°¼þtåëŸ|»þúUà«"ÛùmÑ«Ÿë:ÂÌÌ/^Òî½wFÒˆ ˆ I‚"D8d8IB,œ†;ï] Iµ¼öxåk8À.ëSo¼Û¢®õ«B_7z›r`Ås]7U¬P/®HûuÑÚ™ 4&É™W¢Þ[>IÈâ¤@Æ°È#Ee!Ëa@F Ö¹†½bY?`þúyj¸P»÷”{¿/zÇ+<{ò±ù-Wô{¯9 â„9$ç4ˆÄÿÓY*¢ X@µ×Üs¶¼gxÉ÷¼ iìLûÓñ°sjKÚžœÞ)ÙJé)´Y¼…îðÍG©A4 ±óÛ¢E(ïttûWsúg•ÚZ”ÝôV"LŠ„¡8Åq…q‘gyœR@".Âò•ø-¿«9Ò5^›Wb¶z%öOÕ{—§XÚîpøñ~ŒeYÍó—@}LÝ?Ôîý¾h)Ì:µ˜×@E¿/­f1˳"-XŠ0Ày”É‹ õ-« üüùNu¦×;ÿÓ~]öŽ—äiË–Ô{/)eÎa”³œ¡”„Yº†_ʉ®Žè§l–÷­”KÛ'és ­Yio÷Ô–KeÐùæcmåk–ÌàÊ¢eSß¼ÜsE['Ò0$ öUDCHPŽ2L`^@ÌUV‚1äR)H¡gúó~ûŸ"㞈¹Þ²-_5Õùœy©+—Ê;˜¸<¹.¦ØÉÐÕÊÊo|HNçWÿGµDt¢û’Ïråh+Ì‘¤kz«â:_éÍ*;É,äq¸J$ÂGö ÞxA|]8V5ÖÞ¤½(ÞcD<å3<ÿ â Ÿÿ(Lç)x>ÿ»Ägxþ‡‡#‘gåø `N;÷~cüuô°Ó®=ôzª'|š«Ûº*®à}ˆóµpkÀÑsxv÷·ûQ Ý&F*-Š‡£.Ó¬«NÃÓ-Q¡§}Û «ªýd°H.Òq¸:R®¶—5ã’‡XUëR‹»CÅá^¹?}wýúׇë×ÜÈ€äŽ ÓKC¼Ûݦ<Ü1í$Ê—ôj#'Rp;Áe©J¯ ÞCùK5—å«a*™—¶“±Ö4Û[cËÎƦ—ù½þÍÇþ hÏ̦ZJÔeg ÎÒz„d¯ÖÑÛ·}Šü€‘ª5…MRœ‡idüï,D맄/ûߪ©èÔŽqÍ"©ÖFçm[^hGP5½P‹¨:ØCØ ÉP&4Jƒ&©rÐÆ’¢bØ®[µtYʦ/7…^Æ¥imíey*R~¨¢Ù[¢0HÒ0O0#,EÃ9¢“¨¢,øôâ»xÆiƒO#Ë´s"ÿ¼Lç,S…ìß|¬¸b{R¤ÿ¾xéU÷¯_o¡Þ"£QÄ¢4*8¦b$bZpÅ—îÐéFÔ¢z ;»²˜<¡…5°x?¥÷¦ìÞûx6f¯ÿ í¿a~YûoÁ0íØCaÿAôlÿ½Ä§±ÿâú âÖTŠ.³Å7Ì?5ŽÞªõ7Í_5G¨Mµux'C­LöÖwçFÝdÀŸ6Wƒ K*}™í6~‹ø"Ì„§Ê<èÔݪÞ^ZMφ{*Í•+Ñ‘vÖ>¤Áæj ,£5×P®üå6WnÓ*]pÏú¨Ê¹ß½‹Æönh«<ÅÇiñÕZž¥wœ<ò@­‹œd·“zßYl؆û…m.»¢_o– 6qç{¿= ÃWß¿yYdHç½Ø(ÏϿԡʇ%¾º…Õ‡ù(e„¡< X`–g$ ÌPÀ‚8ʹDÛ «ïsºL«¿¸¼a'%•ätÕ¥HôèlqI¯.»®ü ü[« ¯÷6#s[Gÿ¬Ö±5仚C1[6xûVåêCtè*‚ŽÛ»W²£ÇüÆ6÷ø ·öâò:‰s¤„]µËEü#0HpŽ"Œs½5Yˆ¹¾J 1îòÕ5Ö»ûuðGrÀ϶ºz5†0!É,HñK¶ò „ºãÞë+î c»oêÞ…ûoqqã‰Õ<Ô^Ö¸ßÒ±¦±Ø…±P-1 2”3BÂ"Éò§qU —õyæ4ÖWå«ã^5ã>_›ÜZýRÆ#f×1ƪŽ1>Kã0ÍæîßËqÚ^‰Ðž>4¶×Çï\¸ÓÕI\VXNP’’8…AQŒH‘"LX ã8aE’&À¸Wâ§+'Í–’§»-úEãúÖž±1uï­±¼È\Æ…ÄÐ5µåÄ®*Ò˜k¡aÁhÀHp˜¸@qš¢0QÐÆ]5§°œgô¹æœ‰ø± Ì™Uk»y‚,CÉV7 ]Ž4–BXCÀsõ6C*2  QŽAò,ÁI¦A"¤sÌ’0K3@s3ooá·n›Ü@­´Ï¢m:igÙ6 Â%º©áðY×l,׆ÇÍ}u×xÍtÀÜ\4dŽí\4Ö0°Çÿú¯Ìæ¸ûÅÔú—F÷ýôÝ wüŠ¤SVqo…×Ä6ER˜dN H1Iƒ0Iã,ÏÌ:¸¡êÚiiÕ5³ ò¤J®õØ·Çzkál×<®;7–keË&ÇM9ÈBß¿4º)§ï^¸)Wç­ï“º¬ºC„æ Ê@Æ(#E%qd"Y–q¯zÈUï®&\4KýZ›³Ç„ô}“œk†b8Cˆ˜‘lþÒFƒ~æöÞ•ñÍ>qïÒ­¾8AÄû½PŽwÉœIœ†iœ'¬(øNY^„ÿI- Ró†wLðÞÛ2gÊîÞßΫ>ܘIª.×ê#æQïÃáŠ$êómøºâá˜Û-ïbŸ¡ÿg–¿!‡“Ï>Æý?ÀQhÿŸ<Çÿ_äC¶ïŽèîfó%ß?4iü¿|ññÅfCÉ;ºù 㢉øñë/ÿ•îÞÓÓ£/_‰Eš¯¿Á—¯$;1¶k®4ÿúß8e™õØ…ryƒîè×GŠG"ïü–ß 6‘t¿î úÕ øüuð&|õ°%§þ|…»Ãñë/‹Â?~ùJ@Ì®úéÝ‘~Hã/E¬ù‡ïP\¢äË‚vWÓs¸yý/õÈV\—D«Æ<ñÍ–DƒçP=TÞð^UÃߨqo:ôµ'SÕf?×à  õêÏúÃ×_~%™>x#ö½x®g_ù¿ïÏÿá…ó¿À £aþ—äÿ/ñiüÿ›¬›SA°Iû¢ÝòþÕw8@/)謘€Þ½ü¾æÇè€O; 3/üÒ]ú˜ºc¼_[As¢Ñ”Âüé–úéÓ)¾À½úò³cî)ŃQÒƒn{Îœ?†á¹gÕˆŸm¡~ØDÓrFz¤'e2íç?2]v@`*žðwqf%wxMŽ%cä«; 3F³'AHäH’E`…Ž²câ%®)û’£ä‘´ê¨¼9ÜïH x›Ã~Ç×<ǧ^'‚mØðÎÙÛ7â”<ÉØ‘/_DÓä¯HvJ”<ËôÎ`mµMœ§;¥Ã¬Ï0ÿG’^8ÿGš„°Ÿÿ€çúŸù4ù?ªdCSÙ?’´Îþѹá›îß™?*Òû£kê íN~WõÝ1ç‡v·‡n²}hwZr}LQŸz’šª—Go=öpKʒΠ_‘7>äzêN©I´;Œ‰IÎ6»æ„$S݉leµ†>ö(|û»Ò®_§È:NNý­®;O"Þ»¦^Ñš¯ ú¤]´çίh6¬<+Áô¦Ûß}. û讼B¾I{“8/ˆŽäz•®‹Ìë£åÂWËôŒ&íyÉ9bå‚_XWrG,ò¡>çî/ê˜9²IëÐXâ¤Ô'2ÛÊÙ{Ó|ÍnÖ•ðÁ¶nšº©ÞI*Toœ –f1„8K PÀ Ä8EÆŽ<@][èàÁj-ûM¿QÉŽ;!h•ÚY™-ë×±.5pE¥ñøV_ç”ù«&K# §øÃñ¡6Ãœív™¶jgéYõÓä Ô²¦ÅÛ·êÏÖ6wÓõ#] Ìrbã9PX»ù–ÇÈöqr„¾¿é¾ßPó<É ‚ò0bZäYŒÓ$OHRÆBÛ~Ó#cû;n»&,v°‘6wÇÃû-áj?*Ûâ+ªLíÜõe®¿ïW¶6 ƒër˜-ßÌe›Ýj}æ¬ÎѺ’um›TÁ½æ¡ -; á§çg£Ó˼3µ2|â0g, “†! Hp¡€ATØ6twŒö}]Ë›=}0³ê.Ž°ß•P§ôÈ•hs¬isnV«åæ¾ä7‘í‘¿Ç݇5;Ý&ßw,ÃÆu‡y‡_æiêø7È?Yœ¤ž ŠË;‡‰F‘‰Ä‡Ì1pŠš %½rƒÝi >¦)¬†Œ¥¡çC*>t{ع¡±cйÀ°ˆÄ¡HÚ™y‚8$a@à8B2­8²0ä|°Kæœ/‡†^tùëA?ØÜŠÈPóR…š—g 5²ô& zá÷“¦Á™aÊ·Áˆ4óOàÐäýkQHq¡®uÝNìi[&¹hB”ƒ"J‚ŒB2†Š0¥Q†pfC#ùd6C‰¸X~†IùPŽ&É1`QJ_Ä•Ò³íNƘ‘B’0±Ã=‰+ÈÄñÓµƒöR0 ®Mî÷©ûWï÷¥©TÃЙ2‘<ÏrE,Í G(D Î äªJh=X¤l8ÍJÙÐl:‡~žŒ•«³4„ùBe~§„³u˜ìàÚ‘îzꪢ.NîF͈B%>ÜUë¨.on¼Ö/‹Þ»Öþ¸Ûê3TÛoÎX'P™ÎZ´hϦQw1Û Q=[òÏÇš$a–°ŒD,ˆ"€£”Æ &£<ÍsjÖæìøR7±<:šü/zOð‹¦yuê ¬‰ƒ5ׯÿñ¿ö,F±bñãæÝ÷,“À“ý(¦ºnrÏÈoõ(ëg&FñÂH®ÿê*ºû6“A5ü!jòç´©ÁÕ˜’®Q|SÐñˆ>ÔFñƒF`@¸´õ¯¹~Ò—áÅ)xs °Ø–§‹’¹è‰ÌšD1åò$Ž#LX’<†9„8-`‹f JƒØ†rsÒÄÈÅ×ݯŸm˜'vö3˜Ø&àa&ÝGÉó¨¡aZ…ì /öPCƒî@éXü‹¦Ä)æ“ëNi5Òž+õŠ¹é¤Õ:+Šœ„ ÌQ’¦,Æ # pˆRRÀj':WÚ•¡œâ3éŠÁ¦ä*èÄóœÒ¦®hÓip0œØ/ÕÆG³_žt²1'YÑÛ4Yö8'}BÞÑJ)­RSÔšò»-'üa x ò«®NÁ†µ€±"7‹›Æé-/‹Š(O +Æ$0c1-8N@ ’ a9&V×;ŸYY4ÂO6'‹ÁÆå-#K˜-<¼^t0½­Z{£V³â–5·ˆ{F?Èðâ\8PX sRˆŒèq®™Có.ˆ0ƒ)ÀNŠ´Hã,Ê3œCF óWœÚf}V+®\uêìº*w½è÷‘Œ"ó”®ßµ WGÙR‡þk}ìÎS«!IV¨D•Ôá†WCxïZ­ìX à£ÖòåÈÒKq1¸6…+“÷¯E•Å‰1ÜÇœ6°q‡Ž8§g(‹PŽÁ0‹A„q·RX}ø´üýÓî:ûÅŸW¹/t1`»é/FGIiÝÿú±gg°æä“Ûô¥!É\“Ç"^cp©å : yøú¯pd‡ö?ª?yÛJü9ÜÊôãè4uhE •âŒ0&Ù@C„N€ÎäýkAGñå‰#½+æÐ;…À.aH &9 2˜¢Æ(€ḈD6’Oáà¨ÑÊRR ß^¿þ³„Ñ?¼¾þ%ßø·Û}÷L§5ªZ-!g<ãßS>-?îjü‘W¡Éð´L÷FZbäÚ•?Ĥx ©Ìð%ñ¨sÚ´ªÕ»ãöTÇ>ÝPü£]Cd….8a¹âH´Øre°L½}kê«£A|·*tc6Òpu_]h¬Æص)' ÔÃ*Œ)M1ˆCŒršBŽ¨)MiQœÄ0CV@=¿RXK`žÓLú‚ܱRSM.Ç`õi&‘n*ÇâRS™ÉùJ;S3µX`çjâ¥à5¦NÚ²6Î¥°¸Î¬’®ÉÓ( ÍPJ!¥a&YœÒ„²8MRDb‚¢ÜŠ]ŽY­zi³Sý)¢ýÍä4e‘°4q@Ð9Ôññ—É‚ƒ ‹³4CFƒ<‰sˆ–d8L@Fc½ˆ”qvD™“ËÂ.n=­lÅ_> `9 Ÿ#ZÌ&ákÄ¿Ò†«¶ü0Èt}zË;Òñ³å×™è=–ñ$΢ Â*0f¥qRˆ£8‹¹ôB–ÛáÀGÑ¥ë²FÞNH|F™l½ÎñEçµð¸$®8Ÿ¦2ˆÐ1\v@*ž°dy¼³ôp©˜áBaŠŒH‹HÀÒ( ¹%8+C#`âõcØçŠû1m³K‡Ý˜Æð{ ªÃþÀÉ©g÷½R™£û'`mlüåÂvšñ˜á:&´^°û8¶Zã"ã µ¢ëcIüŒ?züÙ Aâ€F³0Ïb–§,€yV~!þл7äprïc<þ'AõøŸ¤0zŽÿ¹Ä‡lßÑÝÍæËÆrU~¹ùøb#’(|óµðCàß÷B7á<ˆ Çۿѯ¿Á—¯äW±m¿þò_éî==m1úò¯ÿ7§äh.mïžæ7ã\þP#Â\‚à –d²(Â) ¡˜¦ˆÁŒÀXŒ(ä€7uß_6Å;|ØŽ_ù_ÿPÊûäÌ´ú­Ø!üc=Š¯¿,÷GL¿4>È«þÓþùOøúK—½ÛêË¿òQ¹ì¨Í_ÊtG¿æì«Wçu¼âlàÃŽ#øŽ1,þGýˆ”3>b3Ü©TÃÓÿéŧg¸ý;úèø¤ìí/ÿÉá?ŠúñŸq<ãÿ%>פ |À;T–9=p1—п~,‡¹<ù_7äX‚ÞqéðHÿó~{Tbá2ç;ºq}_Ò;Õà#F;üIû¥j¥ÿ(Az‹Ò~ýËý‰e•ÞÆaL¿ãýH·ä§Þ÷;ŽÑ‡á×ãáAÿUèO‚é]žÄ)ö_?þ$AS>êï8ÚoJºSê¯Öø{®k0i  îtswºí=—f9Rý&þúñFòý.̹Ζõ¹¢P~¸-ô….ÎáŸÿÈ…fú b๜ýñš¡ÛíîCeÀåJvÉê¿_\s‰¼RáK1æÿ•ãúµde”÷Z~,ð§kõ˜âGyUNÂG‚Ž?ò÷óáÓ}1èP¨¼IÌÒ§…4åzâ‚Á?I–óº\OÓ—=p}î(¸þSö…àg‘ÇWâïÓáîëðMŒoå·âp:n;?ì(;u¾J%U}—u:ìèqäkŽA\ac÷ûÛ× ¾ãã¸)ÙÓ²TW:Æ zK|%ã\­¡'|ó飸á“Ö†kÖÊâÓÇß®U¦‘7¡¼&Ö4â—O\ÂéÏ´PÑå.©fùP§:b©srzô§O_ƒ7òßêŸÿ*…¡ë½°H9«úSæå+˜za×ß}÷ U¿-Ó+ç¢ØøXôñÊáTÔô©‰’¾"bõü+W$…×È?qÑì Ô~mñ0þZ?ܱ¯îf ±Iýx·C[Dª'ò—?üö¯¯Ûk¥¡ª ïMÜÿI»á׃ôë!(–ä-ßúøwûrÕoùõà–Þ FHöŸJÌ aôë#O-¯=u‰Û;)?oþGS¬ê°ßüÿÿÿïýn¦›óú ˆ®_¿… ÿOœË#·Ží‹3›ß(6²é |äIÏÚñÈ+P3b¼ÞCoÞðx¿£[rº¨%šè0W DFH±„­Kn@ñ#ÞÍÇÿ8aÓ¦U{sx—\QÅ*¨š\o8 •¿'[aú§M±-vÛƒÜҴ͵G'~­ÇC·ÃÊ¿~<ðîÀ*@äÌMXoÄ„Þ‰ç‹ô ¼ÿýýmu-®6¹4n‹¡üšKd‡ÛMõ@|ƒks²£è(Ï8Éážóo¹ Õ3òfâÛÇÎÖ— ?©›:íå3¿ø¯_‹Ïæ×›ß|»ù~ó[ùßï6ò×µÁ®–Žä$}/žöNñ¯ï¿V £2Zn÷ï>|Œ©ïT7濼—¹ÿü1•Ø¯®c*æ‚åãõg.ݵw}ý@úëõN^Þ\¿Îùÿ›OÂÂX‚ØǪM»Ì;ë¼ÉÞ$Ú=à‚â®R˜í ûï¾ä=¶X R}é>‘é=pÖ*Dª«ŽÍJ[3}Ú8ä[,&øõë×›ÿ[LN§¶]MkÃ/¾¨·ÄÇo…¥PžÐÿ^,y6ÂEÇûúwar­ë©Gzw ýþ Òl’Î 2ù‰ÞLO»4Û ‡%Y®Ø¤©}ö»  õ¯‘þê_cýk¢Mõ¯™þ5×¾‚@ÿª è£ú¨€>*  è£ú¨€>* *ÔGê£ õQ…ú¨BØÅö—êCõ!‡úC}È¡>äHr¤9Ò‡éCŽô‰ŒôQEú¨"}T‘>ªHÔGõQA}TPÔGõQA}TPÔGõQÅú¨b}T±>ªXU¬*ÖG룊õQÅú¨b}T‰>ªDU¢*ÑG•è£JôQ%ú¨}T‰>ªDUª*ÕG•ê£JõQ¥ú¨R}T)•Äâßî‰ ‰•ÈÀvÍv9ªß =gÜe­=#Bê[Ä1”>}¬öߧ5¼VîÎ’÷K.ÓrÜÇ6ü]|†ùߢä²ö?aœöí<Ûÿ.òiò¿qqœ ó¦S à8ß©\Qô{¾é}?W ¸¶—O—Î×éÚz¥r ›OИШO÷byàú;'‚Žx2\ÿ–å]9ä‚ëßdI7BÛá jškaªáÔsÍL;7»ƒ;kú _ÙS~»þMÆwç›ksŽ»‘þ†IîúÍYîL›ËçºåB›CŸÎkyþ¢NL]<©½©\þf§’û PÏv¿ ¦ù…ý¡:ÎÃnè/¼ÿ‹Î8¬¬Üä:$å!c\‡/:²ÅOš„ò‚ƒ(ÍhË2X$aqÂpžäÀ"¶9Ë¥mvk}Z/ßÅoð4òLñóî÷ö½äü›#*õß)&iJ’<Œ(Ãa'i³D•ÄÖwÙßݬ¼‹ß0ÇÏ‘w$Ðuú-OÓðö¦±%¡ú:³#A¬ÜB–œAÇ“5€ìÎýáaÆ}ü£61â0.Ög*‚[qš¡$)H…ßWZÄ Ë êV 3ÍÔHYe"ÝÅí#´_Š-€6ï¶ïéž¿2ÊË'Beì¸Qo:Æê.}©¨µ|½2ÌC†tðK"üß+ùÂd}‡îã(ÿò²LåÝÜ­q8Ü)WâÏʇ¸¹K­s ñ¹áî꧉NOM2"‘KP”O>Ò[Q•OCsw©×X{Ó]¦==d¿ ò_†ü%‹W£h¿§Ç~SÕ¶R}‹-(\¢‘pè^̪I/)hgUN&Â"ý\ –›ç°q™”¨ ä,)@ã(['ÝáõöÊzõp‹¶{ëe¹²Õ·äÒò$ÄNÖ–BÝ°\löÀH‘´áuü‘2§7í&†«ÈT²PeéRêÆÛÛ*‚T,Ëõt&^‰‰ç`w÷'2š‘šÀõ3äLgÁxÍ;¡zDZDr؇;:G†nÖ¹•¦I»—N×tÙA¾p¡âMºXœ˜×DÈ›‚>[ŒFˆE$ šY2€Y‘¤i–!Æ  ƒä¼ßÏJÎë$OŸÛ†áJÖ$(ž£í$«LgÜ=ïÎëçË5^wØ{nt¼í¾å¹w”AÓ]“~Wl\®ì²0‰p’%KX  d”¤ RÄEðéÅ¿”Ý[ÆAtÌg*_˜G„Ŧ”éY0_£;¹PïÇ*”©yënÿß4i{Ï£*»gì•àø-BÝØ +¾¼“Pz'6ù‘³^‡ã«&¯åîÿøAX×9Sæ¬W¤¥åwˆ@#„oè›7çÊ|fxËÃÏ^†ot» ~pQÇYCÞΖ°¹Á³xÿ¸â}yº=u§¼BÓÑᎮ=vdz q˜ÿúÌrŒ!kµµ‹<3‹ž?¹æ\™°­yÈZ+ò<*h‘`X€0(²g ¤! Ìp.Â0†â7vç0ë<É°M8Û×ÖZø‡éb§mZ&%n´Á8_ß ¯ûMÚ”×ö&*sZ4,ÀÏ’{1ö Z›8 Ž+%ox³"=öP¿™Z"ž †`Äaò"cqYŒsL£ ŠDdj ²¿Ÿ•!ÛM³9_†ì}!H B¡/Ä+Ì!`(= …ÁÙè¿@¦ï ¢J›1]‚^»yÅ\Àa¦¹JZl¦ŒÅ,ðù6ÌYfA΂à @0Ç ±û È‚¡(;CB–Ö ?s†‘Eßôˆ®îŽÁçÔLëbÕC9îù{Ÿêö¼OFSdÐy'»¾ÜÝä,8y³_(g‹Üè8I@ œó#FA(ƒ ئ)z}÷“¶¬ÿ‡g»µwfWp3y›µxe ]2‚ÆpJ¿¥Ý¦3üý92]Æìùa6#&Þ f±w°c641€\†¼ÄÅÈ)¤I†iQ„1kû~M=¶;~ëw®ÞuÂâvÝR÷›ŸÔ41„”wâÉUxchXÂÈ '°„øéÉáy'¯êS™ÏM×´ø§Ïÿ‚Ëò(Jÿ ðŸ>ñ]àSóÕz·ùSIÓe!ÁGºE¥›îŸÅTÇ>U½wûe¤˜÷ù~. Œþü/Ÿ‹bŸ}³ÝpùÛ½ Ë Á)~/7—:2ùL4pŠý—ÜKrá¹Ò’ѵsTUT0¼ ïÅVzq®D«âç蹺 ßR¾¢Ùðwò·TÑUËʵ;–Æsk«ážªµQªåÉG&£ùÚ©âÔ¡}™XŽ£®·åo´â_k:ë}‘ÜX8ò§#Îþ^ß~µC‡:øQZ9U%²Í©§Þ´äwæù/(M ñ ˆcQêã…á( ã,ð3?K?~öCõd}l)‡ùq$æÇa±T›yÐíh®õ£:šk½xŽæR?’£¹fˆáh.öÒÚµrìùÌÚØRÐ’õ¼U@w— «b=‘n>4@V+¢ñê5l*­¢…xM ˜d„D1 hDäË”$Îi&rnL[JØ ‰Yóà'ͳ:‚zZ7Ì‹ïöű;J~*¿3ë¹±”Ö{ù|Ä›,oCsnVT92½÷èÐ"+®_`ŒÛ÷Âq(:×2G#¡ÒŽÖ×ùs[nË|úöšLËî8þ±ÿ}?èñÿ˜|²ÿ/ñ©ó?Š·@å*þÓgêŽÆĈݼˆÖ„ŽÍ•º°L2¨rI:HVy¹‰ºÝç²æ÷¼¦ïý_™$±Óç«;*3=×Á•Ì«Â¿EWZJÄVæÄw{ú”ĽìŠ2çc§VÝpà]ÿ¥ê7œùu)´,,]m÷ä®ÈÃÞm¨rt¸ùËÞ{÷òZ²Û7ÅQpòýpüHûÉ"eÈÏU†‡VžGuËÞð‘È[ú£€ã¿Á§ÿAtaÿObØ÷ÿ|Âÿ‹|úþŸGþ·­=@AÔó©j7úƒ^ Ud¢HU:×Tó ·CG´K»ë¨6S]ÞöÇ%ý?ÕZ=@å£*Ô&¸²Ò¡òãvÃMóï \î+Jå^ç&ôþIæ’GÞaÇïžÄ»§Hl¯ùÚû—ˆ¾®eç²wX6'VPHÐÄ=ð¾ >Üš÷€¬*‚º…w=xr5ÄWÞŸÿìQÂ/KÈS*õUþÄùõ²9ѹ~ƒ¼û=zòª0LTíA4t7Ç;^ Tlªx‘ó+ü¦$1›qØì48ÏdÓúWµZÝ´‚“êúÆ«r!nŸFúb¼©8c㪞Do1ùý ŠFQø9 ! 1ʤ/¼}”'ÙÇÏ~¬ªVN>¹*äϧ$é<Œ{ã´ñ·,û! (ÏÛ71@N#VŽE÷Tò¦:–æÏÁZ²=kyW‡®U+]´Av}ïBûjϿоØ÷0t®œÚ¿?mœÊí >‹öu>fÖkGô®u³zžcéNŒ2ëäÀ~óAÂ{=%[¿Mœˆ²ÎYsPJЦ_s>ÿÂœ…qœd,"IÂö³, ` „ãõûzC¶„Nì÷|}štŸ&Ýå'Ýã͇ÇfºÉ¿&N´Ç¹Ç+SM¢lfà£>ýPœE,HP„£g9Á9C~>õ¤"_Þוy§UõâS'ØF7=Ö€ŸfÕïV=ƒÇ»QÊ?ºÏûÓ§ùü?Éeý?aùmÿ óÿOùÿ.ò©ý?å†Êü$•Û§*}SÓ³ý›NÛ'5åRS'àlÕxñ‡ÌE¦È¨†a5õÎjÍ­ kv¸¥Û¨Þvr+õüíIõô}å^†.»ÐrÖ6l‰çdù9’’Íuw÷×½Usf9{ýüiZœÂˆ,X‚™yÕZ³yNFµ‘tM4zeK-Ê¥=Êæp/·º¯dË<4EŸë•ç,k:ÏÅ&yr0z[*ï–Œr C’_À”Ɔ„Æù8K!Š2†mg7Ñûiå8Z-¯I;¸Ò-£É߶ïù[dÅ_&G?“=嫈'y#%÷âÃöáúö«òÈZå•aŽ§n;;µÀFú;Êïõ'qJí»ïÑþ錌)ò)™“¥ÈÈÐvš>ËeIa§ÍFŠ¬À²¹ór¤„a/8Уß_ì…3µÂÊF"­´È¤V°šCÎÀõdÒߎ½€²Æƒâb£¬f· AØpÍ™6›q¶+b „³° %9y…IN „AQŠb,0bYüõè’BÅJ-JXu¿ò=ï˜=e.”Jä"@Qâ¶v˜ÉÛ ùxŠ‡6.) ºÛ:å.¤âª5Iu:ÚãÙTÀh9”&Ï?=]‹n^ ÍÀ±º3çàì”.šˆ³­{½¤c1!Êe0"0`f€@² øaÆhnœ‰sS·p bå¬ô,/×NÐÒµH-ŸÅz¢–^µ)6„LÑ‚UŠ¼JŠ–0žŒî„ÝF(}Û‹ÚÌi¥¥|ÐÖ«C5\s&>ÍN ÑqÙÅLÀr–e 1L3Q?OrF9ñSLpf^Ìô’?'%³&Ïý+nÌZ'ˆžN‡~ôSo<[Ää™W‹œ6ñô|ºshêÕ9ùæç„Ðd\ÈD?'„4ÜiQæ4† ƒ(J@Œ?eaFó¼í§mèNܼNâ°¸±îž¿a©l â^åö`oá²^0JUúÃÿjâe$kìKá‚KI|@TÞ ŠÈD³éð—ç@¿f!ãGΑqîºÉDoò B¤£Œ¹P¹ͼ¡‰XŸÚE€øˆ#…0a Ç:þŒcóâh-jy9g»|ÏK‘ÊwE»¯¦OÉ–oîEöt;§ùlôðŽ³¿Gá®_œ÷ãµgÎø3ˆÞÛ¦‹ý¡.4Í! à M3'|†Æ~ †,Jb@ÓÜ@ë~œDë>jë¬Çè>ŒíÚâÄÁýîøTZ ¢õ²'¼g¢€ÞGè²3÷! ú[oôóOÛß×=|˜<]u>LíÊàd«;sªÎ']Öd¼¸­’$¥¥ !A”Y†0!¤EÆÉÝ'Í|ž½†êÀQËQ©¬õ?Ì¢Âm¢•·fqÛßl÷ÛZEĹ‚¹³¿” B‡ìÓ¹SlfI=1º’€ŽÀ‡%%H|d4ËAæ3Âò1’;–tïëåËO·×ßlo¯lŸfü7ÖdE¿ÂùØb5cÉ]¦aSª[¿4ˆAãµgbÍÙ„Þº¨Ënv$!¥)I )Œ†HÓ faŽŒ°a î^*ÊÝÒ/Ô ‚æ&ãMŒ ñy ¢ˆ¤8a”$q†âåiÌXÆ(ŒãÓÔŒ@="o=ȉÀQ} Ë“R­Ô÷»ÍSË‹i-µãÁàÍêSó­<Ï¡jép·=m¸B>HºM9Û›9Ýíy‰/jøyË•Ü€ ­Vp '·0YEÂN…Ÿ4íÖÁ—"Då´ËQ™%á(÷E›0¢ÓÓÞ0rÈ“å!&ĉ~U@UNëÅ6©•Þ”àÛ镲Öd–>úc}íýl¹CÕç÷bwMŒ+¦T©Ærq°š‚ M¹zâSé…¢_-Q-í'q:Ì^hLHŸMКIÆ!㌧¥ßµ›ì¹c]üÓ?ÿç_˜ÿÛçëÐçÿ ?ÿ»Ä§Ïÿ´Ùò7ß û“ßçÿ•nº2?‰yŸD•sYŸzØ:š*~WŽoÙdUñfº怠È;lÐáîÃGÀíƒý}ñ _:Ìz‚ÑÐÓ5)qÚ ­*ƒÈ¨i콩­ †jy]srËAm»}ûM2ÏÂ<€¦.|]±4„Ï åÒa¸½ÀíðG.Euâí{1ø4¸ B„Ìȧqp{Š ½x¤®=hŒÅÜ^ÿØÔVA!H×åÐ µ]äïårîtÆHð*.É+¦f’¾ê.YÅÚÎ+>#¹ù%Š×:¶ÛoåÔ¬ià«òÜØ·›§;šïõýï°…Ê*k+H›G$fÐWõ}Ý|h´³®k¼*)UÌh¬/%›J3Ž”hü¦ÒyA—RHÓá$ bæ'$ó}"øŒ2ÄQ*ôÖm}f‰¶ÊÌCo1 ¥—›ªê«¾»Ú’ac…úAÍ5ƒQÜ\´¸?Z¬´ïFE“BqºwÉÞËß&(…,?ßY©…£iK€aŠIˆ ÈrL"Ÿ/.aP"™û;Ö¦ñ³«E/ èjLÇø¸ùеEj,5A«ºÏ€›® MÁ²¢€@ŠâP˜Faˆs€ù°¤ Ñ¡`ãö“M¯à³ëÕËQ>I¹6³¤Q•æ·)Š!Ê»éƒÝX²®éÌ %˜ŒÃ˜&€!@øë) "`ßæ@`æã×y³4Å°]Ûž´ ?MW~ÇÐÓ3ù ª¾ hQ¥:”ž qýÊç¿íú25­ ¸žÁœfGÌO!L€ A’RÁ0F_}ڂƆQé³cÔïA;«Þ›ÝEpC:Tj‚Âu+:¿ûlºÖ§é™f0Í2%)A  Ršƒ$¡Q’=[¾Ût+ùw×­gàä«Fz=F¾¾ÿ‚‹ú}?úüÿ>ð?ù/ñ©ý¿]VP™e•+Þ•Ø\÷Æò»Î'}¸?U~('?®Ñì·6à4ëôàíÓŽæ”95}Te=×.Œ–Pߎó0²ÙÚÙ¹ŽÉ¹ü}¶XÙütâ1ûHJ¿!‚6[Õó›žÓj;ðnø²ỡáùÝ{i:¿Oç>*•u¢ü.l¦Ò°“).4^]õvé<°Š:ÑÐù[µ5ºV{N4Ž¶ÊFRG=[øD’´‘n¬×¸™vòòƒ@¶õÙDÝgÖ²ø€ò|B_.Y§ÃÝEú´4‰]Ωݞ÷Ò¿TCû‹ÝåÆáöéŒÆú4±¶ºfÒØE' {gLig'õM&­êü3güÕñha«Om­ ÅŠØt›Û¯]Þ”36Ÿ DÏË¢[}ûŸŽô0õÛöÍ„ïÎÜÄåâѲÁ?qiüjü®ZGû÷ Γ÷ªºô‹ìêèÚÞ±n—îæº0ž¸.þØqmü‚@ì3 ó,Ï}$˜%9Na )QÌ,;E­4/æ!j¼Ô‹ëÆÑáYšH'oMÝpÝ\Í+£kó1Ëb–%ˆfiÈ@˜ÇIâƒ0åºB#Ø´ŽkÅ$ÊóÅu‡›¶O[Àîúã.sMòçü7ùtÞ¨e&ˆÎìô©¨Åë9’© õõã(„‚ØOc®ÁYI ` XÒ:f3tûœ"¹I+£(Ä$!0ÓÏ ñÖ!/_¬ŠëÛ¯fæ‡p°“Eࢃj2KSÄHÈÚ…¬ËepРòaF‡(1vì'ÚL£þæ Ý­é «2"ÖËZ¨Ž´êìñ;‡˜ û+Ò-vüRNåÔºÞ@ÆÐaWxèå“X­å½¹ÀªrÚNÀ뉒WElÕÄÅ![6»0f_À Ì(†ažC ²4‰YDRþ?ˆ¢< \^ݺݦ¬^Z…šeYÓKˆ3êʶáó—Ö 'ΟtðÙLykh1ßjlk›Míîìéá´9ÊØ¢*ܨ7E¸¿ ÜA<ó—qÐN| (;=¸áÍÉÈ(³ŒÜuaìäÌGÓvýº ~NÛ2JBÌ×±q˜1? #iH}Š„4L³;!Îi¸¦ÎÂçÒC}` ÎÔ!I&UÛëf)Y“ÜHFïñåã°=ØäÒð6wi6¶¼íˆ[ÎN·×C!g\I¢ÿè,ãpVþ̱èv}þÝá¢êûpôÈdq"nH#X蘂 Éݘ™¸ëñÞ,Ž­åæ¤ VÛ˜îø:]öš[µ±¤s±”¹ŠƒñNDá8ã,_¿‡!EY“ŒIQH Î2®Ûºàlu3v¤=ˆ„(Ha‡…JÐAXkb•È¯Úï\¹wt/Nñ*|®ÚØîhÉ°}¨(ydý+¯à˜¾–ž>ÉöÃ!wó$SœðŸÎôìÉ1íûöÄϽ%µìN‡§¦A×éž;â%‘T>¯ýv·.6ì·.û2’b*Lº*ˆ.ð ÂIšcêgQÈÿ,Ì'¦Å1Ê0pAq'«Â€h Á€/vüOQ¨‚þ÷ŽÏ¹Ò`úR‰Ë£Àß&V®=},¶\GÊ~V¶–/ZƘÊY'ØKEö¹úå ×ÿ²K<ñ­:¡ã´ÌÛmGÒ–Œ¼VÖEªn2¦¡bSj‚ÔU‘jnN¨!k!/¹'‘²,y˜a”¦ “,Ï HÄü0dE±^n¨·.,§.[ ss¹öWŽ3ií«Î•XÒÃ¥§—Žh$p›²ÓpÀUæº(°4¼k% £”¥ X†¡`0)ÌbHHè#ßÅZ9­l¬œ:¶ ÿs£8Š¤Ûš[./ÜL~øÊBQìšÕ-‚ãi²!’,¾’és+ Z!®Ëép·*Öè ¢ËMÀ›ir×ĜٹªþþöÍB¥4 R%I?¦)K@ìÓúq‚¡Jõs\¿uÊqÝqÜŽäº~ý{Ú(“¹¥ë­®5rKC—h©uBÊ!õ´æî%–^ÉTÔ‚ä”Çܱlªä5ѬlâÒÁªÙå7áz¹wåùgLKâ( )óó ‚A;âû¤Hd8p±¼Ê;ßšC¨%úÙA‘+±1~ܤe·4&™\¡½+éƒ'îñµ£%‡Tñ‹÷ÃíõOr©*ºu{ýööúeš¿V¿|}{ýüﯲäOžê»0÷ž¼_ 몶DÚ ”_yï÷|pyÇò÷{Ék×ÕÝȾàîé+ÕvhÕù¤ ˜EI¼)ïxv4BàeWTŠaAn_w±,Ôg×mB°èJq²¢ÚÌ“OÔÉ´t7BGüfoÞÈÁsÇ÷f;pMˆçvaqœz¼Oº*´‹–\Ëý¦gŒ› )D(KSˆm<,0ÚÇ0Eqž³<˨ :‹[°œâòAKçYf•ùD]\bu`­š \†Ü’¦8¯)‹YÁ®Á¶âŽ¦¯g#½@+QaÌ,û~;5TõÜ8…º³k—á`©꘎£ºCÛrm® |¦ö–ÄAƒüµ-ÙÆ•XñÇ6‘ c%[ùS† 8àóâ~´ €ÆÍPÁV¼P1Áñé³0ÉIP„ü0æ&x±4öÓ 4txÓ³µÅ¯øÏûíéÝägo¬L+~+îO÷eúåž›±­†!ï?/a8iŒA»òrº£*#½Hl$6e¤Íù·ÛknÍÿKZêÿ#ÿý§ Q^MõÆjr%ÉŽzS­û'Ü ïäI4Áø‡ÚY“´º¼A­¢…{ô$6LNµyG]¡Ògüžò—œÚ\‘™Ú£Ö~üz TPÒw]8jõ"µ¦Eåèé¹M¿é·[ÛÅý²_|-Cý¾UO˜ÿÇì¿9Fk« ŸU)9†j/ï{ùýÛº)™µj·ÝËsuÅ}¹£%IÝËÃ2U&ÝEÒLñ¢¼ý2AÖkͪ=–{eüÙ RE>’ø?ç+Ûê¯J¶…ŦÜ^ÐÊŸ‘ppùÅ_»{DŽ-E©›òu=ò}ý 5$ÕjÕò§ ®çRWnýó\¹5ÚuåÊŸÕ*“_T©!f·Qe· ùóâ»ðÊýG5ÙôYaìd&Iúm@¾OòÚê¯e¥ŽÅÄ8Œir×´¶ŠÅC1Šç‰Åèù7ü]µ™d–â€Ñ4@‚`ò< B”Ò$¢ižÂÌž¡ßyÛ^ù–/76èé0qíé}aØÞuÊZýÚû‰R[[íÈM6Jþ:ãKdÈ*÷¸žL:+à£z™õ·°'†}(qòAw_;$ S¶­ú!ßÖâfe6IQ{:¨þ?{WÛÛ8Ž¤ûsÿ n>$‹NZÔ»‡ÃºgpƒÛë6³w8 _(‘êc[^ËNw6È?VQï/6)Kv²˜ Ñq,Š¤(é©*VÕSþk´««}Ã:'­>d ÏàÒGª¥‚}\\<ᨳt߀ú¯ûú?“g§ó%ÿ¾áRmÀÉ…&pMè×ùÛ1[OC­\û¬M]Wõ;q×ò‚ vL#¸éÆ¡a‹‘‡óÍÈ&5é]ûáýM<žÉò®]†JÅ1€F ¨¸ÀŠx€FÂay±á,]A5¹ …9”€!,ž-LèVfy\š¥â4e“lÅé:Ÿí7à­G3JöqJà슓Hv|„5r›Û­ G²ýFȹҸ“õÜ„Œ\.Û5\“ö)ô±æˆÏøŠ ie×\TøóŒ"B!¿ ²†èÔ_£é(ŒÈUUWWÈK\™“}hur|ЋvWL½,U'nyÙ×KWTعÏïöööºÓ“Ú cýTÜ÷*;O6«>ŠÝ·^ÄÞ¥­ÝyÓpíé·žs=ÒåX>åûZ{J°1‘Žýu‰@Ò2Ð;˜Kyd ‚;§dVWt{žS ȇ8wœ‡ö6ð¬‘7m…–çrf„aZ¡k›†G,î¦C¨gªXù|†%dá÷“{ª¹ï@|QÄzg¸•c‘_eÀxL÷Ë]¹Óöìo&»ZpHËÁWù#q2‰Tù@¯6»§¶Ì€iäSÊ©ÃÚ“R"kj¢…¹¢Õ£ \=¶¶]Ãir¨‚é(À ò®«Ã”N¯sBpn€‚AO4VÐDÙj¤ñÄE]ê[œ’ tlÏ·¼1Ûó|õ˜ á ÎzÄJb1´Â¾@UE!ߎVb³Ú°_Zî±z31!ºýº—yMÃ/µÄÀ,‡AeÍx{,*¢2ÛÐ ü`ëBчkŸ†Õ¦M‰«U¥¢«õ«Œ©òž”ߨ“ÛXmÎ&›Z)z£•^­Þç¬,ÑʹÕÓÁÛæU¤_3Ç°-ÎØ =Û4©¶CaÌô,Ëõo3söõ¦‘|ý:“–æÊ­>F¯SËç*æ› ;þÂB«Õ „[p­ cÎÔ6ìX•°SBAä=œÑÝ ‚X²È”jö<+Ê!¦tÊ./’Å=xf£0ÄPÁßNEêQbZ4 <—¸ÌHì2î@ˆ”IMßQN¹*‡ò¿ùn÷tsÿñ„DðÊæUð1Àõ놋®î"Àvt×!ðå³ ë6èHx‡øü$΃s`CøK‚ft„ÌHo¤n¸nRzo÷ò•…pÅÝ7€ÂmŽÒå~%&Œô”f0)õ-ª˜E%p5+ºÃ6Šólv’0uª4e¸UéLìÏ?Ãù…†Ò4¦,*þáÓñcR–»Dbú;‡¸:” F+ˆåù±k^ÒÈpmÂmj›!W¡XÓX[=V²]Î*Ãîîo>¥˜W÷˜a!ÆnK¶|F(·Ó8ù5Dˆ9¿(V-×,ZýÎ*Cp„³{K`Ôi$Š´¬D‡Q’ÉSU}%>ñˆÏb/p,Fâ8Š '®iRyá3€—QâüUå_,ç³€&Õ÷×}©‘”õûTš@Ÿ¦ˆóÌ'ëëVA«ÒIÚˆ5ćãôíºßÊä9oœ®ŽƒcuK Ÿq¹&m_Ìɵ ŽÔ=©d'†¸–q¡°ôêÑ7öÅ”ÝÅÃv€ ™iê~—”­in¯íÞÚ={䎲ßEס£Õ（=¹7çbÎu´ö 5Ià¹Ôv|Ï%a¦ëû1Y~¬¤±õÎü:eÎÀÿ;JŸVÒ-ÓœÚGr¥qŸ=¨ …h¦@½Î ?0À¤è#:œ-tf4a€¤249÷㈛¶eù‘éøŽQÀ"ƒ6C•0C\ƒY£n`€Wv£”ÛwAüñ×â\ õxee¤NÅ#ÀP¨J2ÎúPDO}Rݹ¨q[ïCŽ¥™9Ò;´3•»Ú!$Žç4bmßåïQ¢ßþÔXÿbÜ»Ç\Øïþø™øça·Z²4ú(–šÿ(Ö­ø8å¼¾¶ ¿‰çõßâ±qÞÓq›8†k½3ˆC ònaL9‰¡Ÿ½0¶‹Å»Phdé~9ØîØñ7úsŸK~éÉ ¥òUP]!²¼ñрċ ‰'þÓóÏ9æ6ÝŸÒÕ†F»_„°HþÁs±±xbLMêHj­ÅUGï–;xÊúÿòlJš£ëó˜jâ1ÃwJ¦™J»y#xCúÇOí‘Õ³]‡¼ÿà·ñ—÷ÊoÁ„S,ÇW>KuŽ¸=54G¸_¥)2ק¦s ™óP,®ÆÜWd´_\½Šû'·ÎEôµkxÌÛ}-k¥ëˆî´fCt^CsÌÃ"ÐNgFòÉ?üÐS¡=1é5P> žÎÙ+ÝŒ›ÿ8Õ㜃mÏzi²ð‰‚ P;_®;ÃKª>¥^jBMP“²R²Â'U Àá¶Þ¿á¦7ؘ' ¹ 6úºçzÑóÚ`§Ï+öO~¡Êe¿Ö(#m‹¾Z£.X¾š}ÕºGkåºkUºk•ªƒ :ðëj¬m€¾¯[­¥ÑºøœFHÉB‹}Ñ1ññMo!¶ Aj«op«÷ÙÚÌ>jÚëlfCÿSnaƒ#yŽÈƒ¹«‚‚£("ÍL‡¸®ÏBβÍ N]‡¹±¨DÀåok‹£Y‡m'w½ñu׳Çe&º¯—ävñ%ÅÀxHôaQ Ö+ƒÝäß³²ìhU*.+yŽzŠ…¶©¤¯.çXÛ – =)ÖAV/mE:)d:»>¾²iX‚JÁѹ0­$„Ö”:îèõ;'öÈÎ/€£^ªÀŒM|îgÄŽcš7‰Ã7,pÍ0ðTòŽå5 Æ]f‹Z=š]èÐYrsÿ±Š¿’{ÕX’¯À3_…¾ÃÑkå¨MFw´º9•#NµbLvºˆ÷x¿\6¨ãZP¹n^“ù™s¦ŒÛz›ƒ!ï£YÔô¹+q«E‰¼ã°´jÞŠ‘_ç×8'Z㵩ÀªÜoÒÀkÍžgEl9ÄÙ!‡}[eæéMâzÜ2ÌÀ ˆåÚ<à¡Ïâ˜×DèJH//}X§,µÂ–fYFÞûîZI«Rô¨ .²œ%³NþvªÎISÚòl¿D6ÿ’å­³eÍzuŸš5ø(5yKôÏ e{¥¼¹Ï¡d:ýÎ c{å|ŸúþZÇ—Ô-¸p“uÅ'7¦.§ŽçÄ`Òš®ª°UÊk8^¾?“]rs¯Ó5è™7•)Yæÿ íqóQ» ;Lz(¹þþȪ;pK(]^…Ôë®ÛÞÛb#¯²Ê' -ÐîNR­^öX1‘élÍý& (XxXÔñU¿ï91¶cÊÍÅ¼Ï ³cLyzÄŒ<(šçú6£VÚ‘i$6-Ë1p¶¸˜9s”Š1Ó”>,’Û’¼$JW›¥€Üå–^_?‹éoU’Ñ—Z¦v­áL§/ivçĆ­Õ7:z5PA£×Yñ`«L!®Û‹óƒ„„!1‰Í£^dó0r™2‡›4]Î ¼’Ya`Û`¿ÂphTÀƒø{#Þ¹\aº¾|.ãY)Äû·þ§5ñà`ª:•l:¶ª¥¼§ó"•Zý^ͲÀ:½ÎŠTS×¾LI`-»1"D¼ŽN,¶¡ÔòíÐ3F|êö0D§èïdJõ~/CÏ0 3±'MüOjÕkOCµWVTûœ¦× ­=c,ôêÅ6µ\×CÆ,Æb3 *;Òp!³*+û†®"þ\&°a+·­«r¯UM}ø²øT =— Ρˆx“[2ê5ä6•E 6xV¬ÁPd±¢êx£×#G˜°¼5vøöüf®Í‰gDaàÓÈqÄG3“F1ÝÀóÃdŸIäkΫV»hš y#„œt®Ä`6ÔW­~„Íø£Xšek GZ/øÔ,&04‰1wnaèo|]wwÛ^ýˆ¡~ŸåÿÄ‚ý—Àè–ô7Ù ×Púò¾àçÏåP;Ø_Ú¤Û]žW—¬rrðæÉ2¹¯¶ÀwObv (Eóì!Ý/ÙmK«È‰4A`¯!ÏÖ3ÑÅ}þ0dýå}Áâ#ÍgtJ5‹ƒæ—»[íjŠ|ÒÙŠ;Ï7 ô¥ŒÈ¬­²½ŽËw©ÙoùõØ~K´kö‹_K+SäëL:@ÆQes üú„î›ð*¾ýïâek¿ý+逞w±BLtÀ|×Ú7:.--Q ˜H4ã0ôúSÛJ&ÅH.‹ÑÙ;D:; íû}ßF)MÄ(Š)qY2ƒr¦”™žt"5> scIŸ2ÝzW=îÝkµp àt«^ö² Ä™0‘!uG“¥jfÒIÃ䯚a²;¼ÑM1°¡i!Ób(­áb‘çÎÖUÿ5ÚÕUÊ*þU×ùÜ‚Üù\úX~T°±H‚'uV€îpBÿu_ÿgòìt¾TåfR:­CÓ¤tÖ¦®«úÒ¹O=2+Œ=B<û&·}? )fíî]ûáýM<žÉR]†JÅ1€F (¯ÕñwPºEX¶Ó/y« s(CX<[˜Ð 圊ãÒ,§)›d+N×ùl¿ ñ’¢%ûƒ8%pvÅI$;–U¿Ej±K¿³ýFȹҸÛŗ½‚½Ù–G פ}Ê}¬9â3¾¢BDÙ5þ<£ˆPÈo‚…âl!.Щ¿FÓQ‘«ª Ÿ—¸2'ûÐêä 0ø í®˜ú‚†â¥h•L¼béŠ [#÷ùÝÞÞ^wzR{Á`¬ŸŠû^eçÉf5ÃG±ûÖ‹8л4¢µ;o®=ýÖs®GºËg£|_kO‰2&’ñ_£.ÑHZÚ`s)’,CApçÌ²ê ‚nÏs*ùçŽóÃÒž58y¬Ðò\ÎŒ0ŒC+tmÓðˆÅÃtõLª``åó–…ßOî©æ¾?4FxñEÁ2°•‹5ºòädÆcº_îʶß`3Ù-zªÚ¦-$N¦Qç0߈àÕf÷Ô–0|J9uX{Rªb§&Z˜;!Z=ªÒÉÕck•Š¼žU08Aæhu˜ÒéuNˆÂÎ PX[ï4cM”­Fxlz°ÒÀ·ã4ŒãÈò¸FÌ$¾Š— g= b%±˜ Za_  *¢ŒoG«¨ßóKË=Vo&&D·_÷2/°Éaø¥–˜å0¨¬oEEAfšl](úpíÓ°Ú´ #qU!bW(Ôh•ëWSå=)¿Q'·±&ÚœM,6Æm”2¡7ZéÕê}ΉoåÜêéàmó*Ò¯cË° îÓÀ²m×´…òæ¾íS r5-G%ýz3söõ¦‘|ý:“–æÊ­>F¯SËçj”]\ÁŽ¿°ÐXEÜ·àZÆœ©mØÑ%e·IT*õgO‚@t7¨ –¬C£„š=Ï ‡rˆIKjËR÷—Èâ<³Qqb¨àouè |'ð¸GÏõ“xĵ'4yhE̵#•˜×|UåóÝîéæþã ‰à•Í«àc,€ë× ]ÝE€íè®CàËgA×mБðñùµ_j4£#dFz#uÃmt“Ò{»—øëG ÷«#î–¸ns”.÷+1al¤ï 4ƒI©oQÅÚ7u+ºÃ6Šólv’0uª4e¸UéLìÏ?Ãù…†Ò4¦,*þáÓñcvÊö©‹'?ö¨cF®ÅB<¡É¼˜z6…‚ëv´sÉhl.I ¿y«AX‘˜„å3b¹¾ån–;®çú”›¦4Åõy2³ÏîûC`^Z`ªI;çbY“š5ú舴/LPžfØÇúË’E«ßYeŽpvo Œ:D‘–UY`[C84¤ÂâqH‚84“Ûu#NLÓö,[Eàe”8UùËù, Iõýu_j$eý>•&Ч)â|óÉúºUЪt’6b ñá8}»î·2yN৫ãàXÝ’Âg\®IÛsrm‚#uO*Ù‰!®e\(,½zô}1B'ewñ° CfZ€ºß%ekšÛk£A»w„6dϹ£ìwÑuèhõ;/bOî͹˜3GóÍ)ñ˜å1ŸRƒûŽGÌ0²<+à.‰y¤¤±õÎü:eÎÀÿ;JŸVÒ-ÓœÚGr¥qŸ=¨ …h¦@½Î ?0À¤è#:œ-tf4a€¤z̓À'1#®cúŽåÇnȈå`â‘áQ›¨T?Á5˜5êxEa7J¹ýpÄ-ÎÅP?€WVFê”Q< …ª$ã¬EôÔ'Õ‹±5ñ>ôèXš™ÃcTMÛW§×9ì"†ï)vošªcRè9žÆŽe˜®Cæq"“ØŽaŠ_*)ò Û¶‹Iâ3ÿû>y¤K.â֖NJ{W×/Ï›Ûus|Á¿G|³“&Ü®aO"oK¶I×,«½ðùA¾~L¶éU©GºM(̤J‰{Î!ñ‘&Kr°Il{Ä#âYŸ_ü\!( ôzÂed>¦p9GŸ¾0ú$qõQ1ñ˜ï¯?ý«À½â—IØ/ê_ðõòCUÃ%7L\‚MßsB?v]¸PK¼˜x¶i#â%!ȇǜì/o^‰›râ‘DÙ‘¥¯yssù üçGHž?Ôý \Ç{´è05ENÊm «Æ%aÔb>NL2¸G¹Á„dæT$ÒI3znîd:{M meŸ;-‘_Ú¨þ}ª÷?x½‡]7ñ]Ï‹â˜Ä$ RÏŒB×NÜÇal;ão‡úïLÓuƒêýmyÁóýÏ£|Šûyó§5”c‚Ä°Í{ã!o…zà]÷vöùEùk!‚?ï÷hwËè‹x¹yå#^[­+\ô"% ž»/½M'û4ïCë g‡%ûÀËqíæý¯ùŒÿñÁkŽXg ýPÝl2g/>½0 ‚ßãmšmMûúì¯dó‘Ö :[Á9Å‹×g–y¶b´¡µ]ñ¤hüë2»»Óœß¢yMÑ4ÛcöæOôMËxËྮ yuK@ðzm^Ù«û5>ÜÒ¿ÜU’m²ýë³xƒ’g+66â§÷{òxô·üð°¡ÝÁ#‚Ï @å­¢_Û¸ü£¥ô9*c´ÿí“Û5v³à=`”SiL,Êë3ƒ ÛPÀ«Óš4§û[JÙSZý×?|}ö- ¶i_¾—sräœìeæT·o¶äw¨DfJe’Ne’Pÿ}û>_~ž¶UÌó_˜t/òiÒÿÀ}\ÿŸª:Mú¸Ïôÿ1>…ü>Å UñµvŸŸÀ•Òl}]ü%•c)ýY¸jjÉbàQq5iquZÜlÐVrÐÎüÙ8o8ò¯ þEÅ-¦³3íÞе ò± ~%öwpÌ5À:«UvÀ©ìiûSÁi{8 O¼•Úz˜î¸;déF{ÐíGt|—úË´TTczŒNiõX˜pó¦`8JI :´¡rìÊ(«€:…; Ÿe«)Á4Hãà^~“ƒe•õNã?xÉÞãn³†:)WF]Qåo Óf¼—Þ‚)Xé>ß¾ë´Ùô}.ËûŠÅ£,å°>|¨]{^ô¤çœ(™S‡k\ wûFk1«qïš7ð–€ú m On ^é…4¡€b¼J$î;äà(Ný4Mb‹¤>Bfà¸~B¼ÈIÃÄ6-%¾¤w4Ýa%2±K5šMÚÖ…í\#ÌmnŒ[#ÙŠÚSŽíµ§GýœõVéZ*NQ2掕­ÖåŸ+¥«ß”^?óã k7¬è®Üïì¸Á°:Õ1^›×ß][×ÕqžÓ_/”±Bƒªu©&fj+×JÆtf”61D( §mSij/Ò ]Þ¼¢ÝßQ€p}Þ~Ô&§oc˜"V“xvèSy^?Ê÷)¢è—p íQ"סÒk‘rFØ¿Aÿû g`ÈÄuP=YØêzàFÝ¢µrÍ6 ª-Ï;‘ ·šÀÞ qÙ$”f;†ö5º>ç #D|â ©^M7ñÛý˜8F¡ÛÊyÛæØÍpe¶1CM]ÉßRHhœeÂØï@j³•à †0JlÆÕZæ5—Y\œÉÃËÖ•á|dV†ßÒº sXŠ%•KÂâ÷Ö 8Šo>$ –”Ž¾{Ì OâÄJÆá©ÝÄÐÏ„,E^0J{RÝz[}àªÏËkÞoštªbtn¥$U³tm k"=ª™e–¨€Z†µÉûôœéS„JeìÀE–‹ã8¶L3ŒCâ&AlÛ.N[©Mu"*im·ÌR™m¡î%Œü¥´MT$ç—ôß—ÂÓ¾ƒ,y»NnY¢ŒFÂCãœüŽ’%?ð˜KÅwÆÝ‘U=ž—m/Ê›*ä%c“”s<_§µñ]èå9ƒ]Ы"|–ÁRæ¾­¦=Û“tCO³YÌ›ÒmI…œ].¨;1«Œ!Àœ‘h×RíŽÖônÉú¤/]}d”ÉÅy—Ý\)ºž%ã‘P½«IݵnR"(Å‘¢Iåá¶ÒÕé&“„¿ùŒÒ¹C&Öq»Ï6›®†úù¤F„—´'5Î(¦mªk8ƒ=Á‘à)ìÆQAéB›Í¢”%,UUO„W¹¡gºn”bÇ!ŽEµ&ß,BœÔ!–Æñ¯b3iaVœþ< fõ†…‚‘Vu”WÍ°ˆ ²bBG"2 Á½—ƒ&[f€áÛ·æù"¤Ók¾sÛ)™£ì÷ṮþlæÈ·`aîÈ€Î`¶í½ìq&láE•Ñöó£\€ïûåÞ-zœ` ÄÙÜ@ÀY–||xaØQ„¥‘ïÅqhÑÿ…ØtíGþGsiã âÑ“à §£Òr3OG§ûz˜M©ð¥iµ4ÔÌPfBëë¥ÖýÊÌUcˆ~/,»S!h€À‚»˜½Öƒ5›ReÉ4H‚OƒF[QYö"Çò¶-;´‰Iâ98ÅÖ°01 WZm”šÍ”‡tîïxíø‰™¤!ºC1rÃWÅÀMIηÿö-üøí¿½x´þo‡Ê•6›€¸ù¥A½i¥3`ØD§ pøSv§  Ê,(2ÂGN!® ž%n€^¥YFá¬8qÝ ü–_¿ÁxÄ 9ÜèÅI`t%x›N=+Ü8dGqÛppúiɲò Ž­Ùé¸['øÙ¬-àÂ| `²5Gñ‡Ü³ž0g«$Kª0®FÏ•¦y­í,æ´Þ r”õF›=éA[€AQ(Ks¨õf"‹Òg>Øã$tlEV‚R‡( "/ŽB‡* .ëpÛæy>°Š‹ºÞ¦N<{ƒXËns ø¤òHçí;<ýó’Úžï§=ÄÜ$´"ÓÃiû6JŒÛ|['ÛçîVQ1;VÝF䈳]!ÑÈ/Œ #ü$D”š×ªø¿I¡D ¼"Î(ý­S£6=è‡ §ø:ë{*¡@£›ÙÂA±pBgùb9U¼”@…³†ÈîðÉ´i% íK[q-gŠÒ Œ)+TTÚ' IÈih0 ¦Ï|Æ@]„ñ0H˳ûe˜›6ÓIË%a`;1âYŽey(õ3B¾e¦ÓaSÈrø21<Ü|ÌF=ÀiäÄÍð5=-éîc6ƒáë5…»ðˆS±:……w:ßCð”ÌÙ./ÆðåíµŽãŽr›ë—ý´*.‹XÙÙ,@OM§}èÃ\„üŸFéøJ4ÇƉÌÐwbªkx®ƒB›D$ MŸª!Ò þ3ÔsÈ=q¸(UŽ¯RÝV5[ÍxãËÚG©_ƒZáD“‚Eƪ G·Ñä¿.ÒJ©¹úˆÿ4ˆIμàŽ:¸qa”ÍÆ•ÒƒUzžï“jЇRlúþn„˜o"Ë¡$ÞŠÈD>ŽmdÙ‰DÄ$)Fí®Öùuú$ÛBjæJ£^Óñ—…“Ù/|ü"µueñÁìµò PugXfVÀ¸ä¸‡`>rpIÌ.ÛÇÇ”xNÆcù€®qQáÆ=êr‡ö¨pĉòžñóY E³²i}D›#QÈ×ÌjÕ˜—LÜU‹Uc’À÷H *=G¹XÁd[!ÙûÀ—!ÊfÀWÚ½í‡Õgï’Ë‹…º5â†C&•f5ÅÝ«ù0Ù ž‡ü§çyÝY¬Ù¦‘ Ù¤êûÜ|^5Ù4Ÿ¯)"¼?nо³…âòÐ|XËÐRÏ¡µ…`-¹†›—ÌgÄ»:ÍËÖbïj®Û,è¶s%ªží!H%-ì /ŸÂHµnÛ™¡^n®^¦{òÞ§2h=èK(lz]-®Åõ`‰‘ëúv‡©kúŽçÄ®iyY)f–º¨qëÍ­tGáÎá-¥B߀Vü Û ^#é”\³•(a¯¤§8<ÌùSæ ~%ô¨È^,‚)6Ý,pÈA¥Dlˆìcˆ::!Ó)ïÈ$9†ÂÄé±ÎúÂBÁi+>íôWÎÿÔyÈ‹×èP ÝPã7—?³í‡¥½¹üûÍå››Ëÿ–_é£_n.ÿÉŽU”þ"@SÍR–ÐéâB$L¨²]¾m³ÞòaIoýÂEF$è‘Ã]HÍ<‡=¦œo³P5„®G¾;Â]ʵf_Ýeÿ™bU”·l®Á,å •Cj¬3^¿_3Ÿ%:|mí-ò·¬ 0µ#-!G ßj<ípSl#lÄ»Ö2!N3jzÒ´sž%ß#ô?•õ-Êû:UÖÅØÞ|ßLb».I\L\+"¶íù¦ƒ’0¶b35‹´s¶Ñ¬M*¢ºÌk2…+ÉòJXò£Íƒ´\1{&ïcU%ÝE´TA± ƒÄ-‚HBVªW2ÈóbÌD ”æåÍ^2¬„«rö}‡ö/^F,C„]I‹Ù,µ…~ÓTŒz‡.‚ºÍ¶—7¯Š¹É™‹2^Q´ïÞ{éìPʳŠ¶ð¯FvYÎvªÆÓsöÍÁ·§’<þö"Ò<¥K¶Ô,¤cÉVb¡Øòc Çô)2#ðé‹]¥±ƒlNo3cé‹VbÆ=”‘†ÝCY%l/2AÁéŸ*â ü.F1DrîÖ_M”­ZG©›xÑwªg£¨`Óh;Åh,«'émŘF&ß>Ì›q"66à,—u £3 .wÙI"ÅvXAÄIì›aHL×2رL†­òFcüÃÙS‘‘RvxKEEÝáØ T~wD s%/¼øµ¨z¯¹¢hy¸‡Û%y•õ²ŒyY$š“^É',¢õõ"r™ø‰è¹=¤8‹«_1óy·z÷<‰â&Ë>°Hʬ_¨Ð¼Ô“ ÞXèÊÖ±ÒwtZsŒ|é ÿ¿?-õß"(ìeEŽ"9NHÒ0‰#âØ~%‘÷“ÝÕöôûªÿfºf­þ›íØÖsýÇøD¾%IYD€]‹àÀ´c”"Ê+/MCò¥Ç÷ü9í§‰ÿ•¼ÛNš>ýD(MÀF6ö¼Ð¶R†ÿ£*Ä ÖóëõmËy®ÿó(µþÛ™uß 62ÈF¯û#)ªµÕú_F[õ6Væ‹—3š¥ßVFg¡8ö"ÎùP*XSK§Ø$°!jC¾5â÷¢BØ0ý¨¶£ªSµ˜(@&²ñœµÎdUŸ.«-¦U•ë˜Ïnu·ÐOšöÍç¬ãP/J8ÃÐÖ[^‰o·A` üý`”UÜT8C¢ƒ„Cå\ #[È’œŸ•‰5 ¾ÕKõ•{2Э2ßÏìÿÏEáŠO³þ›ã=ný7Ïr]§^ÿÍ2Ÿë>ʧ¨ÿV:î€^ÖWÎñd¸ê;×µï³*µ”"ª»±jöm%ˆ¸ïAÿËôÅò'^ÚiC>’M_-¤:ŒÅúÓ)³Ú-Ûkw]¦vo.Úû”n “ä:aƒöŒ7mÕ»˜÷4ßÚ¢N1˜™£`÷#.ÕË®¿›Í¬¨ V)Ý2ñ\Ì.•ã²­nß|É[ª1]÷Ô…¬¿@þçˆ6Z`-Œ·Çl$ÂX§g~ Ùå¬Æxëmv?@5Wl×ßÏ5·!ïØ{vÇ"í­/ÚsDY¤îÜ?ý¦oÓ”›‘¶-m^²Œ‡ñ2žNnßvÅÒlŠG ëÍÓÉ®ZØqžð&;ÚÚïAÈCñ£Þýã½CvXAà†Ä'ÕAC#ËDŽeáÄŠ,¢¦Çh[)õâæ—ª[f1jÝ#†«cr8î‰q®à'˜öå…¯étNâ‚ûJ(a`J YJ§/áɶ—]±«æø—³J"~îª6éÀÂSu aÞY¶ã0ÎáOqOZ¼%‚òDì¯ÚD6,¶, Å=< €*ô°,_9²-ÞVï“h£+õ˜Ö„]+|eF¯lºÉ°5öG²¯î+iJÛýq—+UÄì £RWþûï·T//|'S"Æ{èç˜ÃÔHÎb‰ƒÓ£IƒT¡¿—(§ú„ÃwB7qúvè3N¬ØñBÓs"”šö>äNÒ‘ñq½Áy%PT­lCÿÅÌ-Bq=;çn_ÒÝž^ÿØÎq ŠH¡Cj帼–uq+òÜegêÁJr@píz ßwf°å™Qƒ«Ö _mA¦”;'«ç[b»shC)d÷WvJHª'ÉdÂÊv=`ºø0YѲQaЖsÐ2q'’L<3ÂȤ,L JýضlÏIýÈ ã4!>î!0lnÝ¢‰(–¥8‹péb¼¬Bád¥´ÀK­-ë¢ÌÅf«Z˜nØs„¹î8Œ zpÃnB§V@ ñPk$fØú`'µâÐ$ĵlߤr{&ŠR3ò]‘Œà3Ô(R½‡]á tŸ)G3og¼ )óMd©cS´œ´et¿¦±p¡c¾§'l°t”¢21k¥òì?X0Ïʪœx²£PùXÁHsp{–N‡¼ï-‹Í½ƒº¤x:«ÆV™deåTºSÑ=”îY„Üõò6n±BÜ“°]YdpdgT‹ª°ÆT×0Ë×çàN8Oº§ß·aºôiv‡ÖÛÎÇìdóyv܃½|¸%UƒÞ“CgKP7z†ô„¾6ŸWÁïIª5à¢ÝÀp9˜ªí \eãõpœG Díχ3°%mp(Û ¨ÐÀˆøÎ_!m8Æ3i…ôÉU¼®kÀvdŒ ]œóN˜ËKÚ`Êï ˜¥X¾Ð²˜tÁ -!i ÅôÑb´ Îw~Dõôˆjå‰ç…‰gÑ^âùnä›=Bx· E-«Â%[§,ðJGž>µ ËugÚ°Hç9=1°J_RÇ]¨§kM-WÎbØ·^LÑ]!M·QVšùŒÐ±Ó¬ÔC8 l§N'‘Oq×L‘÷ùÅß³\nȉb>ãÑô`² @‘>+¡gt#²ƒíEœ!Êк©èÿ§u¾Û ‡if} U™×¥¾G?ÜÔ%bÓßP%è¾7žUˆS¨•Qƒ( õÉ …ÿ„†<3 ÞrrMrÊÅ`Ó¡d¸£>ÑG³î 3>F‘“ØOÜزÍ8 ’в‰l3I“(p{ôˆr(=©÷„Ý”ó"é¢y)J$Ùžrõ]&ª\5®Ï —ïÊ¥áÌï½—eí½I¡¡­mûšïZs-üâ‚l”M«M‰ëmÐÏá;wÞ›’¯Ñ¤µR`íDË®úˆQí•‚ b’¢ãæ …ƒ÷kº¡‹Ð>ªB!܇©Ž.¤Åè€wj/ÞÍB¤'ØôlÇŠâ0õBÏ ½$J0N‰䢾›?1Ž·¤"1ª’ÇŒ'TÑ7Zð,kä&ç7¼„Ÿ!Î ÏuÊ}¶j<8ªßÎ×’wõé fðʲA_ðf˜C¬YDéI( ÚFÿ 2½*ˆrlXÄÔUjíÆuò¬M];9»LE-s{ayÊÎ{¯))©ÕË×ÓoS»fs¦©j“h‡iݭݦé³7õYÿyâúψÞÔzô¾ZóÂt¨ü¨m¿b&g4 „‹c±—IzÔÛšCØ vc7ImL—sýÐòmä:I|Fº¯œ¨z¼coš3[ó¼ëb7ñg”‚‘¨$tu´\ØÔíM¶ý}=—¥?pŒ>͇]‘Ÿh6èÕ†’Æë×\Þ¡5kžÍ@véâÔ·¤LWÀwدƒÛV<¢ÀŽýеbÏvCxNtíN.*PéÐD[ÎðîvDZÓvÕÕ`9+—xÓíðšî{ºÁzÔ'¡iÀE\ãÙc%ß:6x¤©KÝ1^4¼ ý#q¬œF©ùf#×”„bÇÜ= §×̽±ÎGëu ofÙÃä‚WðrÛò¡‡<èY¡o[vã8Àaâúiâ…Û¨k.ÓTYœÜÞSL `µ±ák2våàÞïhÍ£3Öèß½öØbL\Û·]Ë‹Òz â.Ïܪ­¿¯pjªèQ•æ§~œFuOœKä+.9–4Ö:ƳjúLS›ÆLÎx€sƒfo{fÀQ”Z~`a'{a䤶‡Â Ž1Z:§a´xs`»Åß{OÑB½§¼µ#°Ty|AAÂ$ônES{Œì.cðøP p Y!f´9xµÃº˜ë CèA๠HclG†¡4uƒAUbý¢X}Ý»¸*$¦-ú¾ ê³ab´Œ%(š3¼ÚõŸ]¯Kò÷£½¨(q>7EçAÿÃñøüß–kËüßD‘|æ=ÆSñW|ØO†|'ÎlC^o뺯X:Î첡ðo ¼Ù9¥k/jµ¤lØætÙ;Ѓ?Se?õ§ÍÿíúÇåÿvmÇóÛüßÏø”§âÿž-—øê6ƒKz_Zý·ë—ôß$çÍ?eòï({Û¯³£ 8ßÆ$¹ê«L¶zÎÕFÆ¿=,0©QŽkwÒ“³. pzì,NI½-I]˜Öw_–u)_-ɺÌäÛ*/£Zîb–R ÎÈ€Ç\J£¡1×Kî‰×“›ŽÄ{ñFtÝR%[÷ª¯æÈÖgÖ&{–âªÙ±ýï(Õƒ¨ºyy¾^æFkõ6VïG.¾Ÿô÷ÏQ²Ñ^Ù±mo5¤L„‚ äò–1n•w1¯h˜¼;§Æ/µ5\_­Ê·}g»¤þ².‚nªVùÌZrÌf†3ŸÙÄ·m(@z0HÒÀCè¤äWL²ò,Çrܘ¼vµ·g××O6ê_{>‡}µµ¾ÝU ‘»¤ç«™.:Ž¤þÈßËr£D>Ž¡‹cº¡c[²-ºKû½¬Hû½vbÕöUe\×¦Ö ÐûÍ÷=Nh‰tÀ½…ø¦Ùíì/ocÂåF})rµ¶ÔÚU£½DÙÌçN{räˆA)‰»¶!‚6Äx ì&@{··£ìÉz?´Pß7oâ=¼Ò„‘ú,á:_Š»¥…Ùïͮ꒗+Åwé‹Fµˆ¾8Ê©"Ö_ÌšQT³Ö‚ÛGÖEyuŽûB~C¯2½Lý2‡…]¤Ž Læ‘Ѐæõ¯ >€£ÈJ@ ƒØq#€Z~”:ØÖA@õ O j‘CW°zÌaah#C„ ùH@Qç86\Ôö¤ 'Ìá öcßrüŒaòW솩gGD.t0Ö-QûÁ3<)8„+a½CÞHÊ8Ãzøró<ì4¹jèÖV¨ñÐô ¾£¢4¶ÃÀŠ°çØ)#” ×Iu•Å>Êñqñ˜¸lPK7ßžìuåyñ*\s\œ”lÄ{mèòb_"cã³ÝNžñò±á¥žüKãf7CY‰ßXÚ±2ÆAØÁìÈ 9‡8.;Îú’(µ¼0´×±¬4tm Â=ζȋ×&Wu!¦Àk\Ü—[Æ0½Èbiâz#e:fdÎ äæüŒ-ÿ5,‰‘YM0j±p´°Z Î×ùjÁf{$»‡Êþ”/66 åÛˆTÁýCÚHÊ8ƒzð}F*9£¨F‰þ6#etÃËŒèЩíilEž!€~bYÄÚ‰†~Çú¡=ô.#ÅXõ]¬#]gt&ßTH¬f”™\ÊÁh¬'ÒCJ-FÖ‰|×PO¢Ý/Jø¥CÉA.rý㺭£:¥WÚ*ÕçQ…¤{V¡ý¸i cÔ|O‹BÎç²'?ò­8“ b;„iFVÅQ’èÁpÏ;ZŒžãX‡´¨»+Ž£^Ñ(¢qF ô/6æ¶ÛãµÌä«gTÁý€d$eH~yJÐÑí³}n®¡h/>rcìãÐŽ¨÷:MÛEÏôhÖ¾s¦©Ú¡êšZjæ×ÐêÒ˜'`*2Á¼ß¡¿TgþÅÈŠ$"rŠ„³ù¿§Ãäš¡úîÓ@8ê,ðŒô» ½ò2Ί‹;tQ f…]¤4;ê ]>#ÐòSXGØ ¬AÛqèb'AË #ßvÀú.©qê0÷(ä[º»3$©¯ÂÐ{ÕÛ¬*OIW„Öå jOœ‰c_£& 釛Ï0lh]¯¡ ïGC9ãàÁWt´Ô¸ž5D¡ø(m»À!öª…\LT¾ÄvRϲ==ì}?‡™Þw¸û9ºáDLMŠŠoëµ6E SŒ”Æ—‹fº| ¼gÕçs©>ò&ä. llQ4ŠXi¯Y@Ootn± )ÃûAØPÎ8 ¼7“šRÞçò':a"? üÐõbw;(žŸ8©ë„vè =@+XÔŽ±rZð³½ä8ŒÑ×%!Ì/0)į”†°•fuJŽ`Ûî¸oEÍ='TŒYÿ#ìdÞ³/tœi¢ŠÙÍi÷x]¦2-œ*ØM¤Œ„¿ƒ‰åÌuà}hå*°¸ ÝßòZR@†„qâbyi„AXžçÈMAãÀë°Û,sòj7¤û•¸Ö`Ëe<Ùƒ`>k±UÚ~ØP‰IÞJŒbKÒ<£Õu~›¡ð&ùxæÿ9Æãù¾…}€Ä(J¥)AFQh…0þÜå{~û´ù±’aˆzéMúdL¦QÒCü1 Þîì`}ü¶ëHü8Öóø?ÆSñÕ*Úä‡Ù’¼¤ÎÜ6˜I)ùÁºEž÷e¹ý¢~[³>Dl ZÐóßH,XD3bÀbz3Ràr VŒD¸˜dðA”ßPåFš/Ñlδu ‰À¸T“j‰šÐ†Î©Ïò|¡ šßf™&ˆØoë¼0«çDµÔÅ[}Œ2yê*·z¸‰óLZE¨Žwçs‘'ý´õ?—ÿÑv/ëžØÏøŒ§Âÿrwr?z Äö*úyýóPœ,ƒ£ó=ò\U/ _ùNb”TW‚´£ñ; ys;6ÊÙËë(Ä”†Ô­GŸÞˆQˆ¯¤B±”¥x{r2ùçûŸßž˜ärFÇ /ädbT¬‹Õ5\à·Ä” ³ÎýºÌ´hgATßqšRÑkK!õÉ—“I£nt¾ÉŠ7¯É”qB&·‡Œ45 ÀH¨rï9¯ºÊÛ/žOa<ÑG¢ÕéúŒô™óè;ÿáú®€ÿ6=ÿøþ3þã™þ‚1Zý†ÿ÷Gf^o~†ä·MO¼ã{æVï®À+¼)úQw_LŠw+º!€)†ÌH`HÃ4Þ/¦ïñÿÝΖ¸LLTõ5=0!¿¦Únû5Ñe“öÛ4Ë¡BÆ,%¶À¼ýþ/c¸žÝ´B.ÖÔ¿r¹¹g8ÙNxOÂi-_WÏä'j8ÌaÆûAê²ag¼GŠO^K1€çøc‘lCL‡= CÍæuyAЕ[-WËüvñ‚M ¢mÉÜìçÛÍ)ØwÔÒœþy>=§†f¡#S̈YóX–qòº•‡*SGäc©“þyNÿ÷brM: 3ÇK|7ËINŸxŒOœÓäÓ"tǪü‰Ö–XOE]·RãP›êg:ÁýH„-µu›M·^>°ù¯j¹MYp¸$“ãELÌráã ­¯_» "„Ç qnàL# ýò"»”r«š—U–uμ)ô˜Zs̸çØÿ¶Uáñün¶ÌçÔ·ÌlÂð*©¿¬ð¹7n[Za¯f³­î¦þúëœUA¬Îvc“¢oÛ=„T~…¹ëAJÝ«ÁN×7pIJ±3û ÿMiˆ (| Ú˜üS4¾KÑ4$:óêž‚KÒNeK ^ϪåVð3WÝý§äÿÜeÁèKþ[ê, Ñ ¦«†˜r¨ˆÕ¤m¦Q——•­­ñ¯¶/Z¯bë/RYT³ãQªîÓü4Ük+6?‰r çW<à-ðëiœ®ðrFàôԽϮ¾]‘9mÂ*kÖÔ¼Xêî¿Ý´»<-mœÒÚ ÝXºïøF€½@ý ›&ùíšÒö}¾œˆ@÷bòÏ"Ñw þ:9;;›|÷-ý©)ï–¸è+êuÆŸ,]§|EþœÓ‰*£6/}•ëyBÍšë9IBÿPæû= ($“†ãH–³Åš‹Ü»øÞ,¨ïÿ¼ðÞ׿èàŸçÌQrŽrêof¯µÅü‰‡%(ߊEÞ5 QN~Us”/”yýN ™iž¯çùWQ&s­ßu¶ÖUEšm»Šô­\Åâ(ï¼ ¿)ª¬&/oWtùõ«×§_MH¿ü.ÏÊH~}­Ìþ¿ˆ¾©©Ì«ø[Ì]|)fßsj-gþùÖÙŒü‡@ê+VŽÛª·ºr”gé6rò¶¬ÊP¿K@T3ÖmÙzXŒïP•'ÒåùC¸ÈG'æÝ|Ýø¼³D¯hO^óÅ.ú«êpä7w žß¬’ê-ùMD¼d[>éýUÜ}M7®8™¥3Œ4tÃWŸéìŠÌ­Û‹\6À9ÁTW«Æm1r«·ÅßEâT‰ŒïkõK^zñ7¼ÔÍ2Ñ=#s¬”ð·2TR'ke„χŠU!­œn××̇Êß+už,l„ WêîIGåþògó;2ÃùZÝøeè9QÈTfòK>JMùJ]‰w$€Þ-7FKuÈD=Rô¨[,ÓÌxEè9-1Ñj?(³yÏ‚FɃ.ÿðáR¬Qi2dËDûgHÐ=Q¢_iÈ9`|Œÿ–­òr :ÁJ‡e¿ó°rù—t7–2—ÿáa£À ÷ hÐ…ÖùÐ8æ¦þ¦ÎB°@ß*ªz@–¡r Iw'[p¸ÉÉ,ðƒØu›Õ{c™¤m/ºËž¼¸\Å/æ ZÃY¶áû<¶âû ®Öº0vè5†hÓxÝx#Ú–ì†úé7Û"x# šÞÜfëY’g·7ó½ÝÐö¹æákŸ4fe)NÙº û¹‰“-iþ 'kúrʼZD0îŠ:×&§öv:½øþ²4@‹ÞBý\Œm{ó鯛)éRWÑ>PæH¿îv±±Î€'عŸJ+¶ýи¡Õˆ\×TÝ ŒðÙCÓ\a¤8ÁZÀ2kÉ8 ÉZÒBUK>†ªRo§›Û³€ª¹·|àKæDÕÝxPørüE¶èF™b ݇6£î‚bŠÀ~d‘+´¾ÚÈuà¤u(šì>ԜƧ/Šw˜/œ½ ›Ø~PÄ> FÂ&ÔÚìÖOi‚ÙØšaéZÌx§§€o‚<%ƒZ¥wŠ,ÛàÔ1=öw˜ýÛwCÛ´g±®HóáÁúùŽø>Á‚?Híô*ã<ÇGûÉÐ]Ðõx#åö7YØÇýüEÛ¥¨ƒÙ¶sýg”xÕD«®pÿvZZ΀¥Áu¾è%i›C¬.‘²–ÂäÕYÙŸ™¹Úi¿ªlS¢«%7»/uîÜz“õšn¦ªVÐ: TÚ(Ërmé¥?o¯¨g/–˜m_&¬s”¿šàur¦v¿Çé.­%û`±Zçú¸F ÃõJ­AKQ÷Gg»èš¥¹à®l±ˆu išjEô´2D¯‰Ð.BÍ6͸¼‘„6êXGïo ñùfùÂ@àç#Š¶åŽ|:> ¾fb¼jn x÷÷_Y? uXOéúv:=ì¯é[ö‚H·¬i³²=/Zmúüï©Ä_Â4°BHȦ’'™4XK}ûò|ýšÎdz#-ðýzÊv9-o3ãã/àk±²­isJÓÝ7[Alm„ógÃ|ˆlB$õ.&Eæ<—fÅ)™¢„³yŽü³iÌkßliþäµÌÙ^ ç°b9è§b{à .8ü.§³«y^l˜YUƒåvÎvi;ÄGzPäúa—¤½>p‚~5±¯Óf/¡û.m/œ1ê=“—쾞½¡WSº×‚Dßœ:Û¯e`_=Ì×ð~rMZ=£-ÏΈžÁ\µ)˜á·›åUÌjüÊ:³è¿Ûf¼øác¾DU<ÇÓÇ£4—U\'|Eò@ïrUÅO³üc? 5 è.–9iöU¾l”˜åÐΘeìTJÖ(:`Åi% ªè4²÷îehv5+Ûðv{ZŦ1åös¢¡]G;˯f‰$·Ý4&-q£¨EÄϽgşÍÿþÿì][o9vγ…¼1™ÀöðR¼ÁBÁîb_³Afö!€‹»±’Zè–Æq ý÷uëª"Ùuí–<«~ÔÍâaU‘çãá9äw:/ÿ;˜>ÿ;Ïù?Îòiøß¹Ž2À3T3À·*\¶¿œŠ¾jâì<ðu»ñŸ«/EE¹ ;ÏÆßiu4#|ï^9á;×Ïl¤‘ß"+:V£Jܧ^OI=zÕÑvŠt˜öõòïrÑ£Èì;5¢tö«?rœÔ>ÕŒOR|äÊ"8$lìØèå=äÅ~¨æâò}¯ÁxŸÄÈ—‰i[ï=axæ}lÍ—uÃqœŽxïIX~½†¾1È÷Йo>H"ÃBòŒ$5DC2Õ@ȇ‰Ø[} $˜Ú9w©WcÄ[siç¬Â?nŠëw‹†$·:3DB¡´Lè\cEhf dt»eCþÔÎë3ÝGàl GHXÚ™ó9óûØ}DþdNܾvþZ?Û82 ?T 4™É0iŠ(±ÆrÎÈ5#vè©#7|vöüîÀïñç/`Ðiô,ÊA[§\>;[~ÐðxÖ2Š#Êœ¦¹ˆ7sDsÍ»wµÈ#Dñ¼Í<3)z]¡å:€ƒõ—¢Äl¢¯@Ê)˜¾V@ F˜Ÿë•B'*×[hÎ4¶ÒR‘D‹Åtö=½x¾ªòo—Ò¾@!â,%°Çb>$öS5·XH¤T¯\e èî Kµ·”2N}ýÂ鈔fr '(²Et‰˜%ˆ)‘\a e2Ë„ZÒáòÁÒJ\Oóž™Ä·)æ¯ÏÛp(WaW¼÷œ¿ßU*ÿæýŸ7{ã&+¯ö¦dÉó¿Dõµ£¬¥nƒfîöw±¹ó 4e [×Øç(ŽW™4­Cÿ,,æO‹†´6œß—u|[&-ØùuîjË¢8þääæ“üm³Ýõ-Žm¹]é»ú·*Á…r¨œû ûCT½±tÜ9 ,ŧ (·ÏìVçN˜?~åƒQ%§g hï”Nˆ@§ëññ¦'ó ø‘Ì®^.‘Щ5݃õ—÷ìœ$”ÇXiÊ(T nŒd„*¨°‚æ0*An’»¹¹IRÆÕ¬S×T¥…ãï{†}ƒ2ôM)UŸo8,R«–*Ö|æâPÌYW4Kø‹½Nr¥µPp€!³Zij j̸&¥“³Œ×\Û<³¯¼¸zdÎbÏ…j5qÜã³îÕB’ÈÕÄz†ðo¼¤Å8ØHšãC]­¬À3\€†Æ䂉ýn‚'9Ï%„på“ÝGÈÔÎTÃnÔ—·Ó.ìÊ4ee²±îŒojŠÄŽwxã3G=¥ñ¦¼‚E¥¶Ç1š¦d½þŒ$c=åéâb—.ƒÅ3©â¡[ÛÇóiu¯ñ1ôBã“8Ò{!MMU\ò3—_v®g]¯}Yx¤t6FÉX  ÈÈ{6ÍÑž] (væŽ$Xj ÅB"Å”È^pN-Mz„Ö¤$OAOŠ”<Z–!z®¹~’Zý8d˜©Î%ü¤T±Ú$4 Î£d,UçJÌ8uöÍj/Å1iáj r rB(àTis$5SæHa&qJÑ«;>g§r7~Wj³Ñß—”žæâo·ÆÝÀÏj{Ûhc¹6X/ú»$ørSj'ê!+Uï‘ŠÅT2ø;Ö7<Ø_5FþôþÍß‹÷˼ÄõzÇã¯tàò±µDlŸ·÷WúÂ-Só®§øíÛ·Kbrgê¼ö«hbf þ‘|R '¡´ØK9„ÆÃcq!åt–U!Z¶ÓÆYÕ¬=FæÝô˜œQ’c›s2…,¥Æ`”!`9¢J(#“:^Üç1—~ÿMD î_yÀ¢ëÛ«/­eZ`{›y:Ö•ÏMÀUh)›Ù*´¿B¾2³´ßèÒkÂÏñ]/ Ñ­n©@bsãÉR«[«ÜL[§¨îûÍ¿½øû­.¬ÆêýÜn÷•š[ÿøŸ½ŸÍû¤rcÊ·¾Þ^ –EZ‹F"¶½ï‰ìzìÃOðžÿâ¼ç a,<ÿÑóùŸs|šó?þø\šÕyÄ (úó³¯tÙýúàÂ#¥•×>Šÿþ_«8ÀÅ«ÿxå/ðò«?¾ò—½øÓöÊÉßîdÀðüv×Åò½#ÓA@äpQE4âüKs¡¢!l ‚#%Wòæ㽧œ,è&$­Ï«’ÿ½KÔ)X³7ª[å¶=·ÄjõÓÎWõšŸÕ'jÿØ”[l&¶î1¢öÛºßïŽÞ*D§ÊMù¢Æ²øsMÔæ-~QLüMæ×örÏ©j±¨8E_¦^ÞÞîß^üÅÇHŠlFÕ~þ»ß{Õ‰þ‚ÅUtên{Õ¬XœM²ÛÃÓÍŸÕ‘Ù2¥xÅæt»½úòÉè·7|çú`Öۋƈè4t-¿øeC•­Ñ‹÷#ѽôjŸ(ú¾<å\Ì×_nMé ò ©¿9+ªX1øwðþÍ/ïßüÏû7ÿõþÍ_ê_~.~üï"êé–õ´Ôò¢êé®ÿé‹‚ž°àâ»V'Ïoü¯Åÿ?Ë[øSi°µì¿«M¾“;O5ï:ÄïÎv8ëºé?<ÿÇ/†šÛm½;oŒ"`~wÁqqíÝ¿Sí ??v= çÕgÁDC_s¥Æ¤ð(Bñ¸ñsGðe—_kdhê%~µô!£ý%K]eÎò$®>¾¾«¥wÿƒ$ âLa‹°29 (J9Ï$Zp-ò‡á7nËÂG³-G‹ÚºÑf=‹›Äû!aäÔ>ô2ʨǡ,yŠšÐ‚¼sz™ßß%³M7WÖ9ÈÏ™¨ÆRZeîÅÜmîªÌèê“QÿH\ËÍÝÆã-½òÃNÿÚëùã#º™ .ëÐ莖NÙ‡JsÆvö †öA|op+ž3‰–€CÉÔšePr*­ÉˆÈÁË«‰ä°ÊK äìé äcƒmÜ9z’C­´7Ì®zŒúåoµvùµ±ÈšÑ)›0Öš:óîõ¸jDõ‡•ÐÒ"Dk(–ÈÌ-x”Ö(gÂÈÝGŸF¢pñ].Õ?œMô}b¶ßÆàú즘~o:³rë· #éfüdœ6ŽScë&2s¤`Bià ·hγ 0‚¤T öðâ'Sl¦®ÖuTÃÓãTSRè•0‡†˜ïâê_oÊßmò+ ÄS›¿Ï1†ËD5É^D7OÂÝ…cù¾Æ*ÇÁŽ¹üÚZ¢6Š’(Ÿ 4­Z'™ë[ò{Úc4ϸd9ájA`–3Œ3aCÑD·£0oÞÿàD\on ßlAäådØœ…ßP?úÖŽˆË¯K¢\‘² «©³ò.ºz`5ò{à k Gš ’ “#ÉTKD4ȵxp_C®ó[fdÓdr,áßÁXJ‚ÇQ«¿ùãø j*_~=øÇša-0°•æŒ¬ÐŒ¬C½¡%$·ä‚’I·É(DJtž1¡‡?7S}íñê,¿ =OökOöyàæÿš·á³wyßÞjs|j@I­'Bk‹Ôí~¿»üê]¿Š5¿LP+ùøÃ)3ÙKéÏórŽ±[gå9Ršd(å†ä XsîC¡÷{³ss|Éü§KÇæëƒÒýÔqC™Ž;ÎË+çeBÃÈL «»klWTñŒË¯u`£é’ dB×ÔUfœV®û¥ÑëÏâ“j2«”b~‚Ñ Rªs­ˆÊäË*T e]ŽÄꘟy¢ÜD3D{ñE­Ðmrµ©¼È]¬ ?Ë}ZÕE¿Â?ºÝ:)Ÿ½cÞ?š{©Ãq®2DT½ƒ‡då_‚üï›Ý-r“(0’‚HŒ¹±\9s#*„dztøxü@”ánüAúÿ=ϧ‰ÿ¶,Ò?ovîG¿‹:ŒÿŽ!}opTäåP“/¿js[$cU_.ŠÌg剧¦~ö –£"ÂZêR,îö…„…êJ~I•,¿ÉÒíNËÇ”èæÑLâ÷˜ùV§šßìœiíIœåWÛ ¢›û««D‘õ»m b÷7»mò:oàܸ¥pêáö_®óíUª´½3/ ~lù]Âý?½½ÖdÍ6ð€ ôöÿdŒ<ãÿY>D Á˜•S 2C Ä@9£LZ“»^â}ÏŸÓ~BýGô¼ûÿ2q{ÿòûÿ#ÏúŽOcÿÌŸcô߈ÖÆÝáúËÖÿ§"ÿ.[8;÷wÕlô×òÿ‘Ìßµ (ým[ÞÙx¿ÛŽ¦ýîÞé ëwûòyMŒàünWHP~'d»èX#ù¾G ÅöÝ®%û^÷aãL߉6B¢ïö…qžïþšñ0ÕîÉOS¯iªë<—Ôz𩜄×ííœ Ú5¾âcM4Nî{ëÎß^×ê;¦ýU›ôk¾ÁFcÏ;Ÿ½RëÓ³'æ°—ñ'jùK»OnWïeÕftQëV_ø»š–FÌJ#àƒdÐjÃ’J[MÊÆLi‚±å(W"Å4s9ùàäžÔ!w‰;Í=®Þ¢Y…‰}ŒÁÑï !r" ± EsrÎejjÃþ¼õéO§+&Ñ°Oê0”‰Wï!ôx§¯»¨ã¼€ŽžˆÉ'í{úõkuç©ØF·~jAª+*PxÔP?NŒò©Ë°Y‹Qž³SÁ24G­3 ýg;B¾¡‹óŸ7æóÅor·ñœ_~„ù¸…ñA‘þûá5óv­åáÊò[÷öõVoì—af-?a–RÚ÷ýožfl¸r9õE«û¢Ùç2ë 7 Û—¹*B³nH¼yÿ¼¸6òfav»ín4éÈB%OƬ»ýÝ;?è"?®Þ^¸«UšŒƒýLPïgYmÑã81\VÌÏÐг¸ÓÒ×’ñÀÀÉ(§:sB‰ 6˘BÈÜJ©ÀðHÉ:“áz¹ºèÒ'õ‰€Í)32ôÛ›Àú‹O¡ðCÊž€„âö8µWÔÌoo~˜!=ÆÒÀ q@†j/‚ÙL§}!§à9]Œ#XQ DÐÚÜ0Á‰Rì¾! µI‹Ó6t! ý)‹¿Ý¤ ÃvO!jN¶†YÖAérèåj˜¤¡ý4 ¡—踎×_¤¥³S4BV˜ËÓ ÂkGæg(æ|Â&¹P  DŽˆ2+ ›ôu‡&|ªééú£vzv†_Úíì=ì7ži8%ÞYÊŽV7QR ·§×ÂZßWÉ^_|Ú~6¿™’å³Ì#`7^¼ŸØÊ+ëƒÅõ]/16zIÂù~ú9ŽŠ˜œTB–I%䤤£W%ð1W%g²BzùúE7T{¾ÍÎdÐrþ¥J&”k£µd0Ìrk•dØ: £Æ&`kqƒ˜A¾€+jÚb£•Îß錴„ÿþn(F’P§ÁÐÊqE=U«‹|PúÈê­@ѬvNè@0)B¬¢6Hf9ÁÚ¡ÂyNS1øli8)m~W«¤‹iü¢7¿äÁû–ñÄü¡i_è¢yø»–È×å-:ÓáÕ_u0bŽg3ƒl>¤Ð96……Óy -kù„hTÈ? Ýìꈴ$$#% Ò!“ÑSÈ„Êc ÒŒq: ›Šç\‚N^À“À¥v¨e­0Ë9°©•s6>¼ÒOç” €ÌpýEP1?T åŒÒ%y Š½©nIÝ_N•á,9Ç2“<™•j=_és¨µœµý <õÅaô˜åº«ÇXž§hù@Ž–³ (O•+*ÚÈ ` çQF ˆ3k$ Ö¬Hf53˜›,…s'ÊU)çiEõ…vŽfd–ñàÿ1®ûdiÀ°‰ö$J#„íâ}ÈqÐ)®:ÊÈ~u’üP“p"Hì Ä ‹°aAZ¨®s¬»W‚‘qd °J‹2‘ j$q6†È“滇UrB¥,¢'•*ô ¯—*‹l}Zóÿq`K'’ŠàÌLµ@……j?FÂ"µ_œ>*vþø¦Y†9É‘P ,!$îÖáÈlÊY»Bê¨i £³&Žš³¦8aƨX,l\nŒ>Íi÷w›ê¿½´5OÓÝÎô¬Mj=é]^ƒS•…ªj.dË›†F½HAÙ Ö_†D³“'±?–¤N*2òŒG#%a¦°p_4ÆRÑp-A€É,Ë9H¡Ñ¸¤IaTùTI“B—3)?$:jH1}f€ûD:£Mí€n¥F ÞŽútQŒ—*ù‘_5&Ul+«EâË1"aSìÙ/gS8 ,IÙt’í8ðŸQóJú-•*§ŠI£ÜkPƒnÝzñ%rÎ^ëÌÖQŒúbe®®ÊÝš | žr |}]í <©aëÞÀofW,o›··ØÎM¼<ýÝ¡ã·4Ò“8Ñ'`hG×jÁßgu•g›õÿŽ#HœÉýØä&ÏŸÁOÈÿƒùyù0C¨ÏÿE Ïü?çø´ùk–Ác@˜·Øë —í/§¢ªš8;PÝnüçʘ(*J¸Ð‘x;Q¢?Ñ/,~[ínc-tĶš›w÷Ñ·’zˆ©M¼ÿï/ÚÍLya½'; ?SçF4õ^Ñ CSçú™ŒàhêÔH4¥¤½êh;yš&ˆÅÔÔ©¥jZý‘ãlM©fBZ£Î•q¾¦`„Íy¤!ÞŸîàïÿŒ{ß1R¦˜rÔ²PrF|9 aZ«ûQ€ºNÑÊËúâ³}Ì0Jî ¤9Ýi¤ Ùøþбv>HH8ÐXA!L °r® ,‡©]U‡XGëu|J ˘¾›2,ÆÉ[qœ®×ÇÚýNæœ0˧ ûôPT0`1Ô” ŸbEØT'““uò݈N‰Åœ—É[±“WáÚißö»S“çÄ"d7F™¨Ü(©”a*—\§º/îÞ1ø;ڗɛѽgAî#˜=¨¹0(C)Œ’)J¢IBH®p’’.[·““=1ØGj.í¸SôÖQãªß9„r”Q"Ç€kx–ad¡3ë³h _à*s—zÅ1([si笋”GÝýnQ«Ü:+&·šÊrC(µ’XÆ R sv»eyàÔÎëræþ@Ô^Ú‰ãY»WúB&Ç¿úŠ÷ëW㿇R¼Ÿó.rTÅßì¸`™0F•Y2©…¢Jëìc ÂT+š±V°,x²v„ì—>‹`±×ñæn÷嬶Ld×Ê Oû„ylšN_šûz÷®|ú×Ѳ:Ðâ­„}Qëºâ½.° z„u‘õü0,añ¼?›ö®ï¼8"­‘?~0+AYÆÝjÎff‚"”32Mæ`QÀÔ`~$æ».–¯G}W¾µ8EÕæù¨ï‚'pßÅ–Ü£p Ì¥Ñ\Ó)Í,?bX K2Hw•µw¯LE¤ÞÏ lë/E£Ù‡D)§8$º•41‚ M@žå„3?¿æÌ2àìd “Sìb½¾{ ‹çøvyô:0gBT›Í¢ÇæÁN¡°}½©Êڧ ‡Ôu„„¥ ;›P/”²†‘¦Ô‹\<’SÏ+.•Šp›IIåDHÎ '4ãT[¡)¡)ÅKªL•+³êÅäÓê3Öe7±ë½.¯.f¿ªÆŠ,{¦Ç²1-1£O³w\Ædž=Sòì™ñì‰'g5§PŸÁÓ#Û Ê†t°þRüœMØH9ÿ‹rlsmòû»¬Æ(( &‚·æÂY Sö™¾ž.:'0m´œ±Æ¼Òk«n÷m?1­ìSÍ„…Cz9BÂRÍœOXŠ9ãbd cMáÍG91GPqb¸È \Z,`¦5¤”zeÍತ,&­9ãÊè‘)køÓ3l6Q’šÙz\Úz ¡«‰_0¶ã%-ÝS‘ßÄ[YêÂc¦„”2ÎVBfÚ™CTIMS¹Ð*‰™'¢¿©­“à¿YDŸp’ff4g„»5¤À LÎtiH‚“påÆË#48ÝòGçÁ™Š‘M¤t5FÉXŠ qÆ…¯V£Ä)p‚#¨ ©‘QRƒs7í ‘°*R8±&'NÒäzR¤8‘u׊¬8LZÇŒÄ4E ›æCE@~)‚ŠQ2–BÅbˆ´óû\Œ¤(Ï¥±ZQ8f€X7 3©Ò&Mht¦ÅÎJ£³<þ³"‰NÑþ §·ò‰X6Ç8vž”“©Ï„ÂÒ°„Å 4›Ogœùr&FLZIŽ8ˆ”K¹VP2ËËHÒq4šR'´ NÄ© Í%ÕIˆúç`Õ‰<üãÑê„£g¯±]²ŒÕõ*sô"v,ùÎJ8þØçáÿÙ>!ÿÏÞêíÝšmç€0Öç,{æ8ÇGo>îäí§‹?8åüpµÝÞþáÅ×ÿÏÞ³-Çqc÷î¯)zª$mh »•Õ–\ë¤ÖÇIٻɃéRáÖäÄC33¤¬¨øïÐw4ÐwIyz·äa8¸4ÎÁÁ¹®¤8—«_Ru|é83ïŸÿMnnåaÍéó×ú¥ÎÄòþ9ž¿6Ç»³^YRVþõŸä«­yA¯åûÔáŒLËUK°úÅÀ}_÷õ…Ô§Úûà-|ýi-êWøšo7ÛÝûçlCùoÏ_›ØEù«óüáçÚôäóFõ•…5z¾Ò½7ZÕ:}ó—¢w±Öåh^YÐÝoÛ¿X ÔšBÖƒ û ÕÃë|ä«+Eÿž¯ø»‡'wüŒÿ€@þãþãiàÿNnŒñ£ö½xJ„ 9ð'L2ðpaðrÓ„îZºÑ«öéBÝ [‹öú?ýðþù jðú­¦.Õª¡bZp™i]Ö&…“R<åòó k>páù<ĹЦÿ7þ„nÑœèÿQž2þ×ÕÍf£¯§]Á¿0,‚µ?”¿ì°_sãi¸5Å«+.Qfâãk¦šè?L€—Ì4¥+xLÕnVob!Um<ü@;êyûðA2R™9Å@ªª; -:Uwð#íðGU]wì£,:w‡cÕ6~3ðÑ°E=>×Ä}æ[ËšTÛ^å¶P|xÛg¦gép ÂíÆS¤àïâƒÔâ¶3c€ÑžŒ<ódä÷âÉk>Önü½#Ôòë³î2]HÜÝr" Oöl‚8.£ ŠtbÇ(àIÈÃX¡NÆ$ 0£’KâÄÌÙ¾ÝåLã†Q¬ë4÷?$°ßm9[ÓµãûÚNÜóÓýë,Gbç8ÖitI`Ê9¤X4„1‰dBÓ$‚˜ucØöGzÕ-ÃBžüé–àaÚ›®ï*ë#6N'µ…h‘ÃÌ%ë¤IaL¥M÷å†æèbßM^$p“€…˜C ¡ CBaÀC‰Sà&/÷ä€f0Ãç}6/ûzôp6“á×DkÖk¯„ÑSÖvJk2Bž¢¶;Z[Êä,Ü»“9Õ*”ÞËû˜ Äþ–[˜]Ô‰÷ý­'bü G²>ôb.dÍÓ€(âé„vBr¨½A@$Y¨-¯!v¢ù’þcnæâQ9Yçòržc ÆÓ.*á÷Ôr!î8lkyVÙEØÖßz"¶ÍöŲA÷æKe@ þE<á2@ð$¡„!@!Ž'.à5œ±?ª÷Õ\¹î‚¾W¶Øk(bÃ>îà>.嶑UÒš=m§"æd¤¾SðHžH=Iš¤ E)’DIAÄp‚4ÁºÑs˜’½ÁïÉÉÞÇGvj£Ñ1<†2Ô{@!›xÍH¼'i¥æè[ö_ŽüŸÑ‘ó„§üŸô8òvš¢¨ÿ“×ÝZ7tÄ[hg{¿æ¡ÏÙ¶‚1Íêô~R$Z°—O”Øe#8þýdK\jöƒr&Z-‘9q%[„­Sm=á²–ÍŸXǧ<¹H†Zš#\Ê^ÑKe4GŒ›ârÄèóá#Lò$@’cÂ¥$Ø/îôÅWßÿSz¹Þ|^ýSn/³zñçY ùÅ_^Ü}ÓôÿN».ý«ÑÓ ñ/]r‹®f/÷âºßõZ”E-‘U'o?Ìõ;y ê/VßÉ=ß­sÙ–mX Ò–z«}e̦6JK{Œ‰t!2Ã(„7•þZ›Dçrâšxj'5?YØ ½]ý‹–èhF>A³Ÿ¹˜…f•ÊÔ:™É•V™ŠªI½Ê/ë_M˪™ú©^¾u;^Öü­ª¯mîý '`ý™=À½;ìÙZ|ø²® aó¿µ8÷£[ÚrÕõPñ©ÚJ¶F§ø´ïÞ)( <ùHS‘rGIœD $M˜:xyš"’Þ}ó­ùà[këÖmà}‹û×#T©oA*šBžzY[%X/m›HÔK[õÂÒÒÀ|©¢Áö²0Ÿð6l[VÔK2©z±CûÐ(všU4Ðu[ê'ô]¬®Mèßžæk~ø’Ñ“*OýíÈ­š5«€ôoÚ žµoà !Šaš$0ŒÄ‘Ä4˜@ÄDÀ„wßš};6ùºv¬žëW¹gë_TíÒÆ™Zíá®Zc÷t£ñ?°Úvn€²¶5†4 h cE"% †€F1„! ﾩ,S;wrôuíäÚûU¡À7†)uV#·H\ïs¦lõI1>çòJKéÔG4ÊAÍ¥[5ÜOšÒŸ]í´~®Ôp’Õþ¸ór“Åÿ·ï÷þGp€P;þ8ÝÿŽñ”÷¿½º>ôÿ"¨¸öµ?”¿–û¥áÖhÈÐð[U3ÕDÿ10ÞWÕnVo¾ü•ú )+ú`dç•uÉßGç4Šb3çÑßGõr³fK/\£žYü²A=·Mû ;çl§(`|­¯ØsFäÐv;ì @jUugµ‰ŸÚ¬*› ±×U‹7ü{kmY~ZûÃpd#¦2amÝaàü]´CÀUuÝñßš°ZÁßšÅpPGz3Ÿïև’÷Bòßšƒ•ÿÔDû°fYUÊp}‰ŽJî²`Û¯+ó¡…6o†áZÀe¾N!DëßO<Ê7ÃFRN–OÊnC~F˜òÞ­Er•–fWá^¡èA¬/…7v¡a`‹ÃxØD¯´ñÚ¦ÄmÓ§Ô\ø oºHè@òÌMÙj÷Ó&Åk !‡µ{fztpG.;ÎfÓ)~ £MÉd\{û–”|@3:Pý9ÌÆ“ u gi„‰úC (d‚b¤îæ,bAÝ9¸9¹×aBoëêµ8j¦uBMûój9º¾1fÂsSßÄÌìüÌ¥½jQ,Cõf¦ÙcP[>~+„¶þ(†’G ÙÈËÜh¾1¾~ßZó ŠP$ÆXuk¢&憋- ƒÜhIÍB±ØÍ•$i Žõ&NTpuaèýõ:¿@ž øqå ™$8 # @Dp‚PŠ ‘"4B7–˜„?H¨i¼Ï,rsZ Š+äý$7™aµuŒþ¾rB Š°EÔ*Í´zÛÝÊÄâ¹Ò. [5 ËÊàW(œçƇÞATÁ¥µ@ ¦ÏɦÊåÐK¶°6 u ƒ ñ¢(q¡¿Û:y¯N`C¼´Vl/©"~UéNnhþÕÞ]zÞ7ØìgÆŒtÖVöúæ0¸únû©^¥1ê+ž¶·ëuj³¨¼_ÚbܲäÿänÛ(éfèUë=—WUßd*®Ë’Ó*kw ®»îûu­ÂгÀ Ek_Á:)zOÛ©tyrèÚïäƒ|\¢KÒD¤€Æ"@†pʆ‚!`ÔMt[Ñj­¨oK†«uîVý§¯VÓÚÛµPûQÑÚòÆóvõãö{]hjw³ßeþ¼šÔë>Û…8f7XÄ ÚòýhÑëeƒÜ¦:µH#Ò­éг )8AxÏ ƒñÜtRÂòöì(ÛЫóz.û ¨Ñ®¬ymóÙ¤²~ÏnW¨È »Ü–™5 ›»Î×ZØÚ%»UX‰ ýdÕCvoD½Ç’N+VU³ “pv·œH6'ǵj‚¸˜V³(¨º‡Æ8† ™¦ŠšbFE bÚH eÍdŽWtÊámä"“£ê¶iÜq¢ÜÜl-ÐÂÅv?&ìÔ°Hº±ó:ÚEÍ A±cèÄ8;ð­-ãí¹¾¶±nr \ Äl®Ä"×®90>®¹2ÂŒæ4ä!$P¤N…†NÜ›WChÆÃm…¿]½t³r¯¶ïPlÛ[AfÍoa’FÖ®5>rì>‹»¿—ȱ$zì|EÛVÆâ+Úš|E»Üb)ë`ÅŸmt’±î–‰ØähµMG¾YqŽ˜b¢RÒD4ˆ$¡'0Ä1vÒ¦VŒÚ¿ŠQÛÃ,¥™‹GÁ#'-Ó8‹´Ê›¤ UlQ‚vù8BÐ+ž‡î=£‡]úÈ.b0îDRá5r8 .AHšs«‹ŠKeÛ]³¦¾í®XSåvW¬©uÝ*Þá$Q$!¡£Œ!AˆLÔm‰&˜$à  9I¢ký{™·×êõn{s~aÂÊÕ×ÒDª£¿¯/o.ón…ô¤@áUýC;¹ý…VòÀË@S#ö·³7ÿqöæ¿ÕôìÍ™z­£×eñV2^b1Q˜„;ÊõoR„tëw›êc—‘L=˜rµ‹ÊÆ.Ñ¢ ·|=nIª¬àÏ¥Šb¥ ³Cr%•köa^Ïߤêí¿xe#ðÀpÕcm½”Waå!À]¼§ú%cò:A.Óa4ÖÍ8ðg¿³@?sùÈYR ÀǽWqNhLqÂâÇHB‚ HD"Á’ÅÝL„cô$A&‘{A Î7[¦(D ‚QS¯oÕ©§N¯¿nÏÞüçêýß®¶Ÿúºž,ñù{Ï”ÌÌ@O¢D©A \ŠøÚ¬Ç;o‡UÒ‰Ô}m'"êô<Œ#)Dæ$øÐh $FœÅ, ÆHXÊbÄ D@¹Õ$“²{,£yœy=ž„næÈ©;’Ç.Yn»5ZÒ¤v…&Ö.·x.G…£I–ðmÕi.ó&7!v96tÒôY§R|¬Y<™ âq™1S‰p‚1 „D„4aa€u>JÊÜTÝ5ì“•æñ¬4Q¸$ÅtPÅnömì´×ÌѦ†žúK\Aûí=–E×Nÿóz¹ñ^M$[ùNì¢NBØßz"±›‘!¥Nü6Z äFÑŒN‘ä1À’DF¥Pr.Sœ¸-f'FécVUR”Œ -–‡Ñãã×d—Ze7ûÝLTixè% VJ•$Çâ+é$}m'1Q]º\ç} Ë#):DŒ GQ*¹ $¥ aŠu¶6'‰ÉÆé§0EÀ£ÍÉCÁåm4Q‘Æþš{}u»ÝܪÝeîµ™°ªî,¥°x©ÕC¯4ósAoe¦}ʆYmN:”lšU¬•j–Z¦š÷ð<(ÉáUm›£éÀL§D|„E×`±ã)€ÏûÖÙ^_ÝNJ±PS)Šà< œîqI N1 åÆ©â_`ŠH,…ŒC7‰ñŽÝOv.·Bë®J×Ùý ¿Èof›M]=W*Ó3JPV"çÌ «N¡^R! NÒ£TÛ$j`nhº‡ÌŒSÑí 嶭îgÛ"e îÕ6[ž\ÞZná»[T5FB>Òw­Ë1Í2TÔ,“¨œhÊ4Ògl$U2[ÅM²ô¦·õTJ’µF6êáJ¼°ŽìeKÂÅŠùÄ(PǤ"Š ¢%ÀÃd«)Óª¤ÜuÞç¡´2Â+~ººÌ=¯á¶Ð€Œ¿iŒC×V*1«¤ƒúÚNÄŸëÉ©ÇúäדŽÖ†µâ¸¨Õ]ÐR‹•n¶#4Ú€ÈP–2J(EEê‚À1Hݪ±ëFþ²ÕËJôYŽÀ$—ªÞ¿ò&9ËÐ2ßØ•b_d:Ëôdu ÙúêÕr‰Ïjô½Ãö²f‹—[m­-^e_¤Yý?egןÚ;ª·«¶Óþ•a"´òN¡¤ÆïÓZñ-Ù =5[®SÈÔfEoéz£õ|uØ jÕ¡°3 Q©ÖZ™ÈœðŠXÀ,¾¥6¨¥ÔVë—ëõ"¬Ï÷g\RúÀWû¹°/·—m7™SÝéF -×æ~œ“:-„c<Áê,ŽSÀ4>@C#ØÊ™Ö*͹³yž®×­~º•0“beAT½¡óÎ+yìZv·œxnÝ›ÄrŽÀr»~%QPB Æ@0JP†„áaõN† 8¡†|±}ì¨ßòoÖ·t#3;Ç3¡²“©WèûòÕÝ—ë·wÃÅž+ù;—ׇLìó¼ÊÝ8 ñ“ñ¸Ü_os»üf¡¼º]ï¶WF pKwk#ÀÛ–‚¥ õýäþPîUM×iîKªÝ@KY¡Þâ/á«26®CĦÛä¶QÆø"·Ê‚¾Ußøg)¿Ýì·w_Ô•ùõÍÙ—ÞÕ¹vgw5ÉXÑ£Ç Ž0 ï‹ƒ`•—¦ùb[+YŽ2•¬èW ´üf1ž(ïâáŽßM‰æßL¯Üàæ1Û¨ ÇBè×¼”ï†Ó?%9‚@Ð8‰ J#LÞ°4ŠâÔCÿÜóíR‚f-ꕪ]MoxílâkõYå[£Š0!É¢.ý.påíê{µÜàn¥º(ÄË~ö5ºXj12v¸ì¿ÌQUçà q~ Ò˵¾H|~•%ÿ¢=ºjz…tŠµ¼¶àút±æÆè´Yׄd+ë¸TÛ!‡èXñ,J@ÂX²6¼Gû^“æóÓ˜úGl§ÅNï[Òu §lèÅ°<Áfj­ß½+Ù}5ý‡NMuzŽð4ó¿‰õî£CNBŒÆ$“MîüQtW]̽gVÖÇýAd>3ü°Ý½øó‹Uþ"O7ÿâ//ìôRuyX!Ëä××­œR\ààhS{¯“M½r òÅ#Ýíµ…„¦æHÿº½º•»ƒK ’A¯®òÜiÞÔžZcfzbvŠ«¬ÛEò^•ßæYïÂ}hͤ½¶Ž+ñ hÏìã¼øúZ´Ñí[|ÓÑ»w½ý¾ ÚwúŠì¿éž] ü¼EFúx8¤ôr½ù¼úe}¥/+¿ÞÝ50ò#!f$êæË8”˜ Œ Œó0‘2ÆXoŸ{ØÁzSN5ï5ɯ®†Žf¢í™¹öÎb /Q«b6Æv¾ï½‡ReOóFÕ>ÿ1>îù¯¶+ Ûçx:ÿñ”ç¿¢ž廹Úm7›¾dЊ°äƒ³é÷ë¥ÓD·:É…c²8{`¨ö­’Ù¤=ïiPåH´axr´}‘%z~ßC! Wž@¹6¡ì_c&~?}J®ìiëÌ´{Û4â\sx7×(;&¦ŒÞ指ׂ¡iÜ(ÿ¡Ll.r34¢‘iÃÌ5µ›ÛÓ-~—ƒqGdìT·ÉM“cNž?¯˜§3¹ô¢5—Ǭ\þ,ÖÕ9ÏÒ;ºÌàµ*üäsß¿ ±-D[D¨>³5 ÈÜ ž£™X=òö¸ˆ¼8 @’‰HŽ1IËÍ5‚€¢hFšçÕÑì&ñut]ylµŹ[Ë[\X^Šø~h7Dãl;¨5cózn 7vD<¯ 8‹¤î9Ñaù|ò6µöx åá°Ca 3X(ÀqšPŽ!ÍJeeB’àtvbùÕË„5™ {gÅú{vø©”Õ•¬ZSV£-%]˜µZ3q5o£ÛɈ16ÁÃQ¨ƒf‚ãÏêûKú>WE]g¾9ifé&˜ ÿMÝÔ 'ÄéMùuŒB¯€;>dÒpÕ<¶åVx 9kâr3|ùÑ 1ƒ±U:gI¶d!¡ ©­áyô5îª`H_ s7@7Ò7´!µ¼}wï=|wûöô][‡w¯-Õ¹ùÊœæà kRª9Šp’S Š,•9ÔG?Šç„¤’ ¹Ì|c7½,˜dƒÁ³æ§a=5–^=‡j Jô);¬ßB@«¶ªÃðÌ·¥ËNhÙÍi&Ñ,sý˜¶sBê .ÿ÷çþD<° t絚@­ :vÓa°UßqC8˜†ËÜLcã½zä},®P’*–(.³‚0,`f âH*%¤<Þì±÷‹bÄÞxýv‹akÈ£ ]¾îêð²(Ýp£f—ÝŒCyf/ÊÁ×<µ ©ä†œÉ—-}IÝ âc3ù~p—àšNºâR©æ\ä"S^þ§å¾=ËûŽÂëSËÂ)Äç üða>sW¤Süå‚Am ýŸÊƽ ÿô±¬ MHÞ^L_#b¤ï·V´UÄœï¯s×·A êJ’,Ï' 2L‘,MRL¨È lÞíZ4òÂD±®a´ÉÞ!‰ãɪ zº§ýsþ£!˜ðf»+mâxê §—±ÇØÖààZôï-ç3ÇtHÆÑc~ÿ¹Ï|ÆðΜݦr·ä‹“@¹‡`/$ÅWòæ ÇÀ…rwC¿až&M×ÀÏj#ü#Œ)$€9R`žä˜‹Œ2Éf`ÀâoN|4¨e†ï~±¡fPÔÊ»‘ß,fJþ”f]0Ä÷lº¥º ìmªZo¾pØ[(w7Ø;/áÌÕ§+õ5û0¹‹«Ra’±Lå ÍÉUšòŒa&K¬¨4Á<4ž×“醸æ®ÕOD¿®PÉnÝ=Žo´Sĵ}Ž¾¤Y÷«¾l`Lça§Œë¡¾D0¬=<.Ö—£ð½@Ò"«óe[‘K¤îÑœyñfá9NoôLÈJݾ¹_rˆ“i)‘$`$qV‚£ \™! €Œ3ôzMdŸ}UGçhQàõ6á8|ÇCǪ@{-ÿ£¾˜ôæVC²ÙºŸÎŠÔ8[‡æ«:꨸*aÃ|^hºó š•Ý2$~›QUS]Cò aµ7õT‚æ»ò”~žèrÕ…·ãP[ÝÅ÷ºdã#d ô¹ßÄw¸#<Á$&È»|zÔ6¸ªÿ¡ßô.ùß#|iþBûý7`_Þ_ä×ç©íðzeùÑ@ÐÄão„ßÛÖK]î»Ñ_ÞkxêY¼üú îðÕÿ|UçÑd _ýõ«÷†¯Ã¿×±~0þ†÷á£÷ÏM BßG~¯J³ûºÔùïÕYÜkcá§þͬZäxÏR~wªÙø” w¹lµ«ôº-ÓÚ³Æ~» ¥îguFi¢qÞ*q,Ë ~VCÞÉs9~úÛAžTuƒøN÷š6ð»ÊPúÿµ\+œgjßao ð ž‹êM³ÌÌÍûã6©ûêÒ£m[¿ò}B¶½Ú¤ÄïØÛ™|þ¼6øÂK£bNE^ ”J(Yi!”ŠBð÷~x38ĨÍ®ç|ûò/åªðúxS9äªHDóA'çcb!|†c¯Ò y|\0H RÇGƒdÇ ½5Ñ\šÞýù<\ô!B÷4ÿÒ‡Féý~ãõ?Ïäé~Ë:fÖZn¸F뾬ÿ—øÉã¯wüöêðDã¯^ž<úãÑá ä¯êðïâtcÂM¼xòwuý î‚?yªÿ¨^<àÉS˜Î|mJ›ù—ÿ.%ë—/A’ÏWüV½¸S:x£)ùϲ$<üÛÈ}ѵ÷é•Ò ÿ]PwxHUz¼«ÉøñL%ùI¾3ž¥qRmôL¤šK$S)•A1‘þš‹»Óy"ÑÄœH+‡x"¥ÙÌ$7gh穦סuœImdÁ©ô–sÙ‘ªÏò&’*æç:ñÏçÞ›ýý$»ðù€hìÿc_â¿\ä×â‡>Òg’5ßåÿ®÷ï÷jeúŽóÿô²úOc¸§ÿ¨â§_ôÿ¿VÿSŧý(m´¿Éý]û/›ØÝÝÿØò¨†Åƒ1|ÃÛƒZ~¨…öÓ»[%UTÙ}•÷0]©ãoõáå!N:öNÖíY¡ÏdÈ‘U-tÉî˜,n±s œ þòå>šî‚³«7aÖÿÊ@]퓱 l.ñþ°ÎuM|—9F|@.ûDÔ§)Š´ ‰Œb0,Ï ’$ªH§:·{àÁú¿w¢ëéá|™È}/¸ÊÖ´‡¼)KÇ•*š‚aš«‚fÆ äS4*YìÏšP½A7·ÆÓ³­üES9/n³ 6R=H0rÖ‡ (dYQ$å^ÓÒô¿ºÇƒÇÃPÅ-ÁñäÛǾy$Sý~o}÷ýg÷ fQ‡Z..„ùKFX4‡èPĬ¡«°L"$' 0Îi’Ñr‡y–RZ8±lu„ >(˜?Œß-(P<”4Ü›?t¼›=ÎÍ Ì‚é6û¸TÑÕ鼄Ä3,àíâæè©Ö'PÿìÈ:¶¿Î§se#u0:ÌŽ%bµµƒu…k¢B*IÀIÁ1ÈR„Ê¿ !‰4/2æÔÄØ 9¥„£ÆÈ…Ä9|m œïª×©mÄu.¿ßo>f;£Þ˜¯l^‹‘äfTlqL›VAmÐ.Qmèb<7 ¦m„úAé¦6B'sFYÑ † ^„ò—ŒÄ§è@C—ÝÌd ‡œ)2& JÊG¸(8)Wœ ¸ÕÌ5A ü–ÀbÝrÂ,Ø'Ä…$ÀpäG»„êÍX¬y­ÈeŠgû[)^Õ›+©|ñ,ÿ–Œ ™èkèûJ*"Í LcE^šïiN“ R”¥™So£èû·1Ö/OÕ¯ûj8Z²þÏe¿à”z9Vþñ Þ%ЯÛÈÀ߈¸b12Æî›\|öŽT?Dʈ…ʽHîUlÀë¬ÑŽ¹Šr@p’ÌŠ$G°ü7yN¥ív¢²7:;¤pîØëˑ׷èg¯Šß ,WÉžoΩ&câÛjpk—Gó|1]bGãJ¬Xb,} Ûß…H>PûGLîv’WïçKGjü b÷¾é2=©©y"0NsÄTšÊJ EʤD‡Žtªù–Œín[g?’v?V89Ú+‹a;2ölå9Ä@%G+zØrí¢éõz„Ë/pYäVŠÿ"×LÙØ ] ¸È§ö1¡¼ã—=j€"AEBI¢™Ô X@( +×v•1Æ…S¹×SŽo·}±•5·ø粩;„ £[ ;œZì~7‰Ü ‹æ:ˆÕþZBuO|ZÙæq!JêÄJÚ>?:,I8KŠ,ÊT&A QHÄ‹„1fàí×Ç,?¾üöo§—ßþ«CÝ®?#¶°ý ë±eÒŒi߯×2ÇŸY6b£ØI^ š/‰5«C¥Ø¢.{Ø‘2’(Œ8 O5µÎZä á \äNØØ ìI8TD7ÙæB•åÔx{uW µÚ¿—YÞ$Ò³ÏD}ø0™êF˜Ž€þÌ Õ–+w†Ÿï4õ/Ç+ðˆ•âGŸ™²±Ø…d·q¡X#x®9t`’è3š\R(pšÑ…2+Ü÷­£‹X*¼S@[5G7ÎW§7×åyS9µ¶w:=ly/Õð×±AÎZ›u~McÞD;ÒÊ­MÍz[]?Ù'vÉdä’Z­7;¤\2ðÅ¡J6»k}`k“Pún¿NÜj¹üöüF3aLgšÒz©8¿G@’å«Aë&3ücþ”^˜ÿêàÿF_ø?.ñðz°O‰¼jð§Ç®®_ÉãëóË›´^Þôé8ùÝw®9zMV[¸ ¸ÂaË0û…×éóü9øß.Íÿ„t°' ÿ!øÿé"¿–ÿIekùŸšÜßµÿÚ‹ÿIË¿8ÿ“©Ôñ·Ú³Dˆóp'ëbüC]•“üC.6œ~KMÀYCDT]4óÑÏtåVÕÀKÔ•™à%šêÉ7YÇ¡Ù¾­‘ÄêÓew²úlÚUs _ýÓÅñ³}] ªs uyÍ­¥Àvsèý9 ¯q«Š†¹†GL: ò{I—ÔC!]RÀ×Ê¥œŸ]ïUZv}4!âôf®7"zr,…]Uöœ¡ý†Œ¨óe›š‹¯ËyÚ/¸u‚YÕfµ÷«áÏRÂD&¥©Â*C‚s&a‘!†Ò)ª :®‹¦¯;päï£è:<›/9ò›VÌ%ö˜Ã¢H),ñŒ`ÅsYp€(P%§lrÌ‘kÌ‘TÎL‰ ÎqÖhá›_¹ÈÒEcnL $,>ȨÌ/T ·»^qø\D”q‘‘¡¼`‰P:‚%MËiÊ•¢ÿ\dØ-ϵJiNtöþ]I‡óþ|¿2Ê÷µyØð¯ÞmH#U× «?¼Ž0 4aÚ6l|uÖYv,æþíÝ_¨?ÀiŸv5ÈU¬ëŨf“´Ø¶”OæÊFêP<ÁËàÛž’¼…v…+K–˦´`‡°(1“%\ÀB0(1LrêT–‚—Mù]گߵX4/æ nì FmO)û 8T!3Û:U«kªk+nð¹/pa:j«Lí”ü6+º4¿DûÛ§U¹ÛÍâÁ"ik¢“²T´U\3$æHäPæH!Hi†S@F)`ä*w/°Vƒ/]]w/¿n®ôõŸÓu¥âß„`Ì^s1hY)8fÙ¯ÔÓqš>rüù&ovù¯ïÏ£tý/ÇùtSøöîøÀïëOí^Z6ù´ð¡¤÷í†õ ÇÀ˜Þ§»ñÆìའ5S6¢Lá‚KÄjäY`Ø Â%ÉQ¹©K3®ˆ 'LQ"sER,‘wt+=l1¥6Ü´¯ˆ[æ–ú M”=iË/Ñîz[ªÎ4M¢­ømiŸUN˜ã {êd±* ¼Êä/©JÑl C{<Ü„½ íÜíI*µD3i'yõ~¾t¤Æ¯ ©ì›9ÓS¶‘šg@¨ä ‰‚Ë…‰ÖrY¹SÍ·$©tÛEû‘T΀…“¥ÒÞòlÆWYŽõŸÔ°oš¹k’ ÀAËpcÄ*e'yqc¾t$n¬æ¤²E]Ö÷¡@ˆJË 3 (H!)ÉežLì§6चØ]9Δ/ÊIµtw²# •í %¡Š¹Ar)„2@Òœ@µi>>ªOÇ9dóNY)~tš)‹MÑœUs&Í…8«*„‚„0‘šŠ<%™ÈK°Ê)Ô0U@÷uøs i•¥ã;‘VÙª¼yT©ØSôQ5¹Õvîæ`þ¨‘ŸûHÙ€¾†@*û¸AÖ±Kô°AyóTLP3™ªÉÿ”àÚz¶ì~ui=mö¾ÛŒû¦ÓðöëîùjÖÚ¥  ~¥“Œ@6#Ç°¥† ÈÇÿÑÏWÅUÉ0“OB˪S6uØÞH‰}¡}wrõlÛQ.Pðk~7SÛ6#ñæúÒUºhdìjöåR·©惹ç¿6¶µ9¼:Þ¿ ý~B%/•;¦Ûégt3 E ¿¢cóòÍmÄð3±Ô=v×ÚÛs [3Þ·„•{\×é\h]{”añ ˜gêÕ+`ñz?°ôqx’P˜cJ!S¹Ây! €8. ‘‰ùè¢]—»Íå¢ ¹ŸX×IEX¹U² Pˆ]bOÉH!Ì‹T!˜”3 ŸÉÀœò$O ñÄT¤™{*ñ-š°!» ÿþIó—]5qá AÞÅeJöâ½¥x¿üñ0ýâ`œ7ðÍþp‚€”H `$—3^ÐêÊ›WµWr·Îó«9LGß8¹Þ[ã¨}° ÔšË4MÛûNÖªœýX  `¼w¶?¨OÇ7ŠÊáø¯²E ܳd ÞÛ>ÿÏÞµõFncé÷ù£Øˆ»#‘ºÎlÅb²‹™ä©ÝÈR"e+]–jKUöx‚ü÷åM©+u©²m?tÛux‘øÃs­>M…Ù!ÏwÞgJN§Úõ]–•»¡õ¬o>Ìä. ¹»|4±eÄfÐ\ n±ÚÏ  '¿Ö†?³œ†1ÆÇŽïAÙNLp'ò0!^àÅ Œ½~ŒÓ¦3€w"Qšl'AGîæ=a5-*_ca£GIÂ6Q]ï‚Á¥(àí‘ï}á#HòR+]ŠS[*¬éð'º»âŽÎµ™LE¯l»s﯆˜ÙæüRZ‘E¦PAÉÊOtÔǸ”ó% VËÇg¯®âi pW-ž6‹Ÿ«x‚9o.Ê,Õp¯n@¿Ûìõ`f#£¥%FDZ§áàì8Ž&‘Srô€Ÿ9ʹ0 ¢À‹B׳º‰»,n# rzP®·ñ“‰›QϹ¤íg$aÉ({Å )†©#šDÏ®‚˜d 2Ã,‹ ¦ FK­«e'íÒfNŠ¶ºgxŸŽ?¿h§ÎÎmÑ"òrO^1 =L·*D¦[„¡o;~â…‘ãžý:7ÇEuìRb‡;¢¹œxL8Ë¢ DôÃI¢ !„³¸xÃ}ãYp#è¸ykdc=½h[Ï]nYëh1»¢ØwüÐ"‡„ ÇF e¶ºÈîÙ­­æŸ&…0²ÙÕ÷†WÉõ–2Û¡?kCÅ[‚ö§ÙS½NO{²Eâ5‰¡d/GmQöY6Êg3Ýf|rëÞÈÞ~ÑîœçÜ¢rFyI´3WØ>ˆlË €Ÿ> ‹ ú’Ķ€Ó'6·ãÿ­Šp>…plêÌCqè#Œ·oÙqŸ?‰ ÙÑ*}[¸*Üï~b§ßâzsK\G€6waæòúîÝ©‚§ÿPòþ3QwYr p–½¹¥JTíVCTQgäæ1u>ðjvå>ÕÏ#P<ƒâ2pÖi-<éÔÎ/MEQÈì”. *@Å^ÄNÜÐõab»VèêÃ?Ùå ¨©ŒUÔµ<´²#éìø`.ö¸“ 5•ØS¿Íôõ˜pwƒÂÍÎH>2£±ÌûõÄ"Òn¢Œ¤¼©EÒShÛVŒ cûˆ~|„˜‚Ø ‘àØuˆO—µ„ î^ÍOJó "Õlù¥šv¥ÞîÌ„HcàªòÇ•ˆÜy*zFGb[)õ€ÜKPÙ÷`ï;bÃÿ«·Ý|w0ôA©‘bÞl‰‘>Ûƒ¶,°e­‡Ÿ]„ÒŒÀ©šÒ~¹ö}Œ „®o'®"Ï‚‘kCH|lhƒ¤Ï³šÍÉгš6=ìQü2«ïÓìÞÕÊLv°V×ïR®ó^´ßÞ|Ëx¿kÚÛ$ÏkžªŸcËkA[‘l}ñ:­ˆ·‘¸ŸÙt—ŵÈ-5³¶(ž_‰Ÿø8tß³\ÚЃ®BË÷‰å'Ž•D°àÚ#ï‡;Ú–!VS{_»Rs§Ä=b†že†›.³MEúý{KV¨à&óüüw¾}ºyûCÉäB×ül(ÒZµ—µ@œ7kn½Ï1+FÁjU°¬3ÌC»–Õã6søÞßòÈ)SÐë1°2èövŽ«!´ç`O.Ü-‚‡:„vl#+Á¶†1‹ö:0¡\ (jšç‡ àZ°Aaâ£EÇ^ùz6rV;wlì냅BüÍwo¦†ý kž/äÉã¹³ª¼žŸvþ×9oþú‡m7óÿ°ÿ¾äÿ9ÃO•ÿ‡î¤±ä?®ó{Í–¿üþ%Ø+ýiïžwÿC«µÿý/ûÿ,?Õþ¯²82>„,Q@{äƒþg3ØÒtUz½«„kìX!ê ÏJ$|0‡2è4(¬Ôù„»µ)˼Ýiq˜3Š±'ïWi±&Lª3-–ÉHÛ)‚O óË,Ú‹V!ãùù§ô+>Àlî'÷n¾¢Ý žHÛ>A°Îô·yþù¸3¤Ø!JVìŸoÞþnæu†1\«El³´T#Yuñ÷«(Q”8ÓÖ}L¥ðU=”>¾Ð¥çè 4GµÑ&3Y›Ñ­,v„;¦ÏñDëe+³Ô»ðûÀ¡BÁÐu<Ù}'Œ Pì†0Qt!“¨/ÓP¨…XÉðÍezØÜ£'¦ @|o0Ã#Ùn¯„u‚_¢çüê±¢ÇUè’µ¼~ŽÌ¤Á©§LC¬®¬õAT9g'wY_—ý6R`°¦UUˆödR$çôãÍÛŸ9sþy>ò‚4W-óOýn6eõreô£ÕÉ»íæ~m7×vIÉ«V^ñN´kÙŠ5 | ²­XjªDYU„KQ—¨R†)—ÕÃT{ö "~?„‰a÷ëp£cºÅE£Öà cæÿssñÛïôÌ·Ô—6—Ìå¹ö%bw¯š¥p£8l0K]<EÛƨ 4\tj|é,ÌF¶ž?š¾¦£csÏFÛ™c*0 ¡Ð-ÉÈ>•o@ƒšDÆ@f׬l5R´]'ÀQ@1 ±œÌËí sŠÀÜ•@Å ];ü(„Iìù.Œp#/ñ?€V?¨Œ”MaÓB‡V n}¦šÈ¦ '3ƒXÇd›‰å´z|‚B+;ͼ}ÚL3ÓynÝ©FTÖÙ«³×tÑY—½÷»¹ >fèñÆvpºÝÄŽp`GDÐ,bº{}kÓžÔ¦ã«of¸i&†™™ò¦^FÝ­“õömÖ¦?ÚÈÃÓã<ëQrZwÜX”Y‘Ÿ XrÞ᜽ûxñç?ó÷ßw“iûîqœé»)Ô–}wE…ÅÞ»LÐX|úÒ䞪Rql#ï/ÅÌFŸŽ»ãˆi@c¼œ¨ƒÎs†è19$° ÈÃvDB+ŽCH¹nÂ~Øke:LÊ4tÀ©E|n,º];)´E¾'¸tpéUÕ˜\˜§p½ËšûºUe¼ÞÒ·ÄAF½u /˜éõû:X<ÑÕß–YÖ9 «„úQ`D>Š1'êw\éä´ºáÎ×(rNQ+t|d.,…V£0@ 1 Aâ¡h@ =2¼~<‹é[†š•:ÞÏYþ˜©°tÉÎf­äÛ°R ŵL?Ä<ö*Íbq¥é‰RvÎ~èÕ\RÂÇÍÀí÷è©h,¤¶ñ£? Ý·hø¾¨<:Ü$ßÓÅc«?Ô “a©ªS\g+úƆÜøbšQV=ÕÌ«ûÙqÛ$¤Ý§;¬¬œxÌöùpãfŒXW›‚2׌²¸ÁÕÑê9ö4QñYk¢Á¸¬lÛj6Är^ çhæ£ëº=ÎŒ¨¬ƒêó3Üu:».mIª;®¶=×vâô?B0p=‡0ˆ ª>ê‡üv¶;Ùq•ûÎH&§V3Ow΄uýz=¡$¨t{B VóÉ•ƒ_¤ä{¼Kã;bçKEg[Ö}º.•ýü§¼ßsð^IY)l¶ýH&=XFÑÎ:(‰V ¬r>oxh(n>ô¦üpÌÑó#˜@ÛK‰`m?r`y$ô!²Ckå” T–ªBŽ1hs›>l#]— /[qaµÛƒ}ȺDzØàœÙ×Q¾8Òý«zƒÌðÃh ¥*;_´ë ÔÍÊÛÄžò½HºåŒ[ÖKVødÏ˽æuJä ïÒÐÊþöä¤`Ê”ÆÒ—:³“€^–¢®ß4¯jÍŠV»¾AT’ûR`l¥‚é¼?Œ†tÖÆÉeÌq<ÃÌ„=@(ˆà×ñH"Çslù¶ƒ]wÀ€ºb⽡bÌ£ñ3á-Ö-J±ÁÈÉؾæÐLcôíEàðâl%ýÎjç±£|Q¢¨xu‹ýžÜ·h?D拲¥WÙ²ˆ«e#…™¡c¢!u¸ZvßÄìΉ-ÝGfΑ% H7°c仡ï’ÈÃn'pò³3ú+ò4;ey™/vÌq‚‡uK›0Ñ{‘­DK²ÏÚ9ј‡vÑô{Ü\¾½ùÖæÂBšqvù4?¿ëO¼˜Æ²‰®[ÇŠIr=àˆuW2|ÿíŽÔ?gçï§?ÈÔNªË@Ÿæ`-bÓÆAߌÎJ /ˆ-÷J“›ü™ü,¢À cìZÐ#±Åt)”G¡eQÝxÀÏBŽÛLYS#YeW)¦(gÖô¢Ð¸A°-@Qó¹šã§×ï:úÜñÐÿß~Úñÿ¡ýç‡5ûÉÿ=´ãÿ­/ñÿçøÁéííî6©vøÅŸ~ûÓfCð-Ù|LòŒŸÅÞ_üÙ>C£‹kv‘eáya[ׄ;ÛUwªÆŸþB)ó=ÊÅÚ‘÷{Ós5òGú¤½ùÈé¾o úúŽ0ŽõÞz®S|¸£¿9×q¾Í÷ï/¢-Š?_\3ÔÙÊK·{òä»ôZqxÚÒÙ-‚/6lÚSJÏo¿+‡€SvŸ•1ÚÎ÷ñ]Šak¢ŒŠ;Úõþ†)M.6y°2yS)´Ð:PW®<‰ÿÂÐ{òê=ÞQFÞZ¼ëŸÿöÃû‹7ˆïñw ].ÚÓ'Y=¸2y²Õ©w-Ý VÍk¬šSN ®3­{eRŽ6©tÆ6æWžOßW°ÒÂù=J³›Œ©¤¨¨’f·JgîÊUŽkZê;’盼§ ñž¼rnî:s«$=en^óû“-ÖßUVß켓|…îÊ‹W‘_;ÑV[þóÏœÿÉó¨ì×”ÿlËý"ÿã§ÊÿÄÊ¥~ò«ÔOeëÕo‹>)>Ü*uu%¦ˆ†œ:q?Ê°fœ)úÓ2)}‡ýPš"¥OãNêí>ÒVvº‹ZEÅ”Ö&£oÓ7Y¾ºa79KW츖Žè<:îy²Ú™v•=¾ ÷É3Õ®²ãÖ‚ÎI†ÏÜ•ßWÆhê[müðÎF ©¶íº¶0nd‰*ö±H×%þ¼{¼Ÿ4Úæé©xc:Ÿâ áQ %`ŽV7Ó¾ón˜þïï|ón(¡m*«Ç4rI‰§Æ§]­n${[ý(W÷—¿ ýfÿ7ÁÆP¶Ò–ó¶õÛbÇø4Þ 8eº,=r£Ö+s:ÓßùGYÅZë±& †ÅyÙ”lÑ?K{|‘3‘ 7G¶Â8L¾¥æR0ÎK×óx¯q|Ík%%ë ¾2úúKÇàGÚ6œ¬Aõ+>Úy¦Ëx2Hi† eˆÞ ž_>üAF‰—$qd“ÄCˆ^t¼˜°lbA ,[±Œ ŽÆÌ@R·—…F™)Ï°’é¬2¦CV µ'N96Úë@Æf W)ŸP~ECͦPÑŠÚÑ]e˜–®fÊ ;̵zƒ‘çÇ¢˜Uwùöi›F çEaH]u³j›¬!¼ ±ŠNHä-C³nO3ah¦ )ÜobÆ^Ý_eI=MTÙðêáo¢ønî¸ÃçoÖ;Èý“‡ݧۧÍG1ÃO¿7¡‘D p’Øvc q#Ä~`a;¸Ð8¸ ªÎ§ÙîxPܺµ?£³*¢Òœ-†Òr—”¤…¶¾U/ºJ˜÷.„kÕ¯¯;ªƒX/õõñRŠª<%iTW˜¿sÿoùþ÷ØËÙ×R¹3é«S©Ž\`¤—eX9èÃm¾¼þA˜s¥¾— §1“W€Y•œøirë˜]ÖÓJ0«Ñ4ƒY¶÷¤l?±ƒÕa¶l sÒñ/ÁQˆa9Nzqº%‰íyjjóBÍÝ–Ç!ù½º·¸# `ÒF"Z«Ä!ÝHh+o¾ÓóÈ*4)Èe~µFÕ=zî0Üý˜Óyâ-åSx“ìó{Ýåhxì@Y)‘Ïœ_®áøCúAÁf*•Ö]Ò{WÊM™ Ž WBÙçÊ÷G0Õ•YŠéïè°3Ú¤9±f}”ÁRÈΣ‡4ç…%‚)=ÄtE"eæ"l­R”öhÿ¤a,½™r ϬŒàÝæß¹ï'‹ÑeÞ¼[rØÐn™¢$åá·¬DY¢›·ý˜~óë§oÞß¼ýþ#ÜOâÿ›·ÿúñ×OQV}ÚâÈ÷¹¹ùMa¯õ¯×JW¿*½þ.>ײ~&{£åûÎ[ÌVGãëÃ7ìú8/éÕ+e¬¬2ÚUÙqN±‰o„y¹àÂUdáÛ›oi÷÷<è÷|j‹ê´—«YGHÓOLç¯ÕçG™Ý(Æ|Ô À-¦ ÃÚqgŠâ¨uê×UÎ`Ôãýw2Q}×Ó>]¯3¸å5NKãݼö3“å&„ v"Aì;²@Lz±C"ÔÉý –eÊÉ©~jõcQ±¹=Ò%ÊŒK1Heα*v•2†ÉÅú”G2T’ ç’ >Ñ)0ICåkͱw2›’¯¢í#K™QçÉØT~òýÇô“*°Ž³¼Í^é(£ãÏ¥E¡â•*ÃуXèïìí•ëW¬ B  ³ýõH…¨øŽÄŸ+Y!FKÉÄãX¶[)šÜ¿kåîÙ“hËô@¢ü€02œŠàÍòÅ]7³‰äD'¢[6’~då{^íízF¸Â™µÜ¢L-@³bJÊp¸/ã„Úaªêä9]&­!Ö¶„îLæÕEjN¢¢AŠëd,\§¶úõp,n4?r&(ˆÃ(‚^„0„ô¢LÇ&ˆ^G'IØÉtºæ8š\ Ð+ŸRP6Êó-áçΑ|D×eé)²á3f~¹P¸¦XY“go©L‚®ý ès©µŒZ¦¿w˜Ë‘üÙdK¿f©«át°hJ_Kr¨L‡:º­~‹BèM.+ßñšâ$ãýËR¶cÍÑR˜¹.©L)˜¦åhÛ•ëüí{­\í&M ún¼‰\5éϻѦX'ËhßëI„anÙßµMæÍÂ6ýæô]§=}8­çdöÄ>ɞ½>Í”)µÅ,ŠSYÃD£“|!¼ €`+ôÜß÷' !tqˆ€ëÇð*>“f%ðçE0«ïÅX(™Òkºþž-"%È,82]¥(ç#ot[ZV¯O–>”™@e¾ËS2DzßS1Çú‹™£x+sGNt{À{½ìq!ìàEÚh‡ùÑ. ÞûrË@3N0…âbn é¬Ëä~|!ÁA;1Æ“Ès‡Ä^ŒóøDnŒºý=[séâ òÖ‹à §Céòež§‡zXŒÔ’øÚX]*jfûõ¢õðafÆQc ¿W–Ý©4°,ºÇ ¯Íh-FjFd]˜f’àËÀèø(ò#˃Èw}Ì|ñr!ЊqL4L!²Fa¼©ùL¹ßS¾¿-Ù%a#¤©(¹ÙŸºôÍ¿ðhª7ß½¹zXÿŸ=›€´‹É‰ Íň΀ï&:¡S.ðÇüP/ÅʵRæÑ“#§¯7,'Ñí»kFèÛ$Ï)k®[TÜ ¿6éÆl­U¦Œ×Ð+ °§éÐó±V.¡üå4-Üõ¬OÉàøšŽ»õ’_ÌÚø®Ì×MþA-9‡xcá/˜³ g×ÓzÌ°·€9Õñ¥#|E D5cUs(/f\ ­uùWMø¤l¬×hËöÉ—@ 6±½( ,;ˆ-ßqm€‚±sˆ2Ù!× ídrÜñ4Þ²ôÓöTŒ°üƒc7Â/‚³5¼”‘æ/\ò29p êÕÓcýps:"Ö¹ZßSñƒnó”jáFøJç2ñ Qæ¸U¤’’¨´ñódC8Ù!¬ö;g}3.džsW;)ÂDÓŸ·õù›†“à) ̙Ϫ«0Ni}¶ÃÈ>Óá2f:@QBìÐ’„^” 7€DŽë‡Ab¦Ã§:“åˆeâûpû™ õ§)'v66#Öô´<¦¿Å F¬×î"²ÍÈÕaTø§p-‚tö¬s°+ù®¨Æðüj>™þŸ]²ßÀ駕g1 0;&L;}˜Ó\þOsèx-'ß ñm'ð@ä#+Œ<+ÂÚ¶K@2f /g:û/Y:¹ÃU}äx•Çñ£Æ¹g8b<¯ÊjÒÑâ5+`8+¸nê±¢å5þ›áuHÝÊ6þó(΄þe1MrÓ"Õ*ÌÆ58y55V ¾u÷x?AÌGaâE ˆ0±Ü…nèý{OÚ¹å~î_¡TÓÝí¢(Q¢·±Ù$“ Ì3léA‰”]érUMíƒùïËGR7U’êðÑÛtÛ.‘Ôãã»H¾ƒ‘DHÛÃãk AoÌoK1úù ¢fyU;Ã"þŒûÌ7y¾8#]‹bxÅ,òq³å½„J6KˆÎr ûkÆÙEûx“¦YˆTœ=øq^C²"çŽt¹eËÒ8ÒBy©tƒŠ‘ÏA(b§T}º’ø,±«2•ë" µ A\¬Öà²R  þUq $Á[ÅvId/¾ˆ (-†ªº·j 1¨Â Õ„s+Ê3ˆ ¢¶W!²©Ð®#•-Ëy¼ÍK¨ù°([g{X®Yg}^÷1j¶iä©j6©ºÌ6ŸWlšÏkUê,-J7å͇µôT‹ž-ŒÚ°¤°ên^(Ÿ}û4/Z›µk¯ygÁDÕaÀ¹r´X»~QveØ/ÏîV¥{ô·ïª û~ˆ [¿W|7ÔññÄMHÌ'1ßòÔEA`w|è9·Â‹AI_Õ«plèÚÕ>˜/à :›šéR\«ŸªD­TÈÆ8s0†‡ºÊŸö!>+UgRó¼’šÞ¬Dº™V‚òàÑz¾y¾(Æ9„øš=¡ÚSšêºPg{9:«wdÆBQý¶ì ‘ØJÿUêöJˆónT!ÔùëûÓ¿«åÔ¾?ýéýé×ïOÍþ”Þé‚mïOåFéû,Y)(Õyª’¾ysf+ ¨Ña›õLƒ•9yçž&od¯a¥f×Ël¶=Œ½üÚ¬ˆö©U®®JiýÕÆ ²³‰ÜQ7q°×æ 5ðÌ'×åê"Áï½{‹ºÜôªLU‹Ù"UJz«ñ´Å»©³ @ÚÙH¿º×ânLJ=0ìšçŠïÞ¿«ê;¨îkݲLíííÒLjF)Å„Ò€ ñ<Qä{!G„‡Ä¢ÞþBeѾÊMïdòMl&–OÌ©¢b~6½ÏN®Ôyf–²"ºó ›\bçjj }"ÈŒ(Tuß3ù:Ÿ‡:"IóêýËWŠ+…Nøêý‚-_¼ŽÎU†‰ÖÉNÌöÚ³Zäw>ÍÒ¡ÞºM Îæ³Ó÷ã|nÙÌr¤ ß(ºwï[ålW&ÞÊnáS»*¾]ªéLû[…fgï]Ežî}k^ ÕWl• [!uc¹Âgyýç¼ôèjä@ñg¹¹Y€<}»^nD^²Ù©V«tl%œUL];ÚiÖ>)¾³v” ]C”He,Å2dÄ)% Ç^HQ ?KS/Ä sB(vS°ãè~¿9ñµ©³ù’ˀ  inU«‡uGGÖYœÔ§ªŠ‰öÆT• õa'ç7]ãZ*Š¨ÒZ4jš–Ëž¾ò“¦ÖùåàvP*ŒúýüyâŸfýWòÀõ_1A^P¯ÿŠÂð³üˆO^ÿu¶™‚ùv³­þ+Éë¿f­ÿ3ÿ­^ÿõ[¶fP­p“HûQôª»R­k5ï`üÒ~¨ÑµüÎw÷ ÁEÚëekÝÖi©å;³2ˆµ_1Ö¢ïÜÕÓµTo,^9á›Û…­^ãÉ(U¡ÂmÕ!‹Æ» ߣøaÑ\û5ÈWô¯½Iûðp2i«ºÏ º’YG…Í¢¹Üm‹£M0™Îg=GoÃ,š‰nØtë0½V¼Ú$¯ß9‹¼¥Fj¿â•FB´Ô®´Hµ/lÀ—Ž¬ÊSjžzu÷ùB½É"GmçZåŽý²ºT§|úwE\1„‡Iˆ|iö"ŸrLRê†Q 0F”‰–£Z¤ßͦZFöDüÚŠDÛqcwŸß÷q/õRG9òÜzB¨QÀB,¿L"îóˆrÛÓ6”6”ªæÚsa”D±"ZËšm ÔÕwÇ…Òû-ÖÚ6r3ß-,õÕÌš-Ǽ@AäFaâSßM…g)ŽÜÔÃaìAlc9 ±gûÙn¼™LùªRÎ{.ruûQºa~­ow3¯xúƸÁØÙá`®2#p3XÍ1²ùÁ£âÊU&¾GÕ¡Ú 4³Ä.•·õORª kè¸=¢n5l€°hÄò=OO£ÍÊ„ÊšÛÆ¿Û{îȽªï.^!Õ!ãéx@Fv]O20r]ÊiÊGÈ b’”z(vC+#«™tÖ,(]¾lcÉ‚S^ëùÂÃ7`ÝÏ;Š!Äëfï‚eÁДÍR=½2ü]¸Um¬và=eH[YH›ØÛ¸¯«ïŽü§;ïÓ¿6ľj2qûòa‚ûsaJIêA"N˜@(á Š(8"»IǾ• õ|zÔ?_B˜¹Ñ»›×¨R×YTÎpó÷Úpìéû1”Ý}sâ¤l ÉÈÖûâMÜ‚å”÷RMuu±–Ähví)$˜|Ûƒ %®2<Ü…ZQâ~ÚÖkl6¶z^F…žÝʉj3¿‰·÷Ü‘…UßýT( ñ°†nœ ßÇr_I½ãQ?ñP˜ú˜#ÏÊ™ ÌvÆ„Ç&Wxî»`<衾L§¢ÜÓépé °î ¯¢èè}ÒjùM:Æ®¾;Òüävãä ÇFɬ©ø(° Lj¦ABˆKBÄ‚P)°1+»L:ìI>Y-¦Pvðð&¤®˜uÇîu4ÄZÒ&ÏL¾¤•%ÔHä,†0óÖYV~S6‡g§ŽÂ’óZýPcΗ\sÕÝ|ùA'8UZcåT'»ú$lXë šr 4ïæ6–ÈŸiˆ”…©q”«3H=H£„ÇpiC»¶²mÂF›Ç5ÆÉ¢¬¯]¦äGÅ[eRÏ1v•Mù»J5ÏÅ·½b›øúWñ"D|)\bŸ$X`,|?`%¾ ¨çÚÅKÄ–Èú¥Pñº”“i^P}2_JKy1Ÿ•kä)ÎÈ=#*ÇVØœn=Ó±¿'+/Wº¿™I¬íÛÄÚf';'­'Œ-ÏÔ6¤åX-&óm9e²>l ".5ÈÓn´Š€Úܯ…ñQæ"e›©ùc)—O.Íýܯ'`e[sï¶ï»{ïÈñ¦÷1ΠõÐbóTÚ ˜ÓÈKcJ¹H îsCû1¦.&V67´óx‘£²ªcgz™Ý:–V¬½å°‡ÕJµ²Ñ-t í¬ìõËêvv-D³CV”{CFðÛÅú¾®—& £ÊHQƒªwA²£:Ý&%Jº´ãã6-¬übnæ·q[wï¹ÍôÞÝÁ¿>ÔÃî|=žPœ¢€ ÊÓP’q}‡ièÜ~&e}˜³á,ŸK›ý&sñ/U¯]K-ªŽÉ”=|  Ÿ]Îu·s¸=t¡4µkØïÊÇÅ]ÖÁ16助íÜ¥ÜZ¶²fGß]Su>†T#ïÖ«± `Ï”zØŸ„!ò}D¸Rì²(æ„ÚÙS§OëÌ$X#p•oDz»˜ÞÛ‹EWÙ­v•[Q‚"S£ãwy:ºEÆŽµìvë›R zK»ætä¦R-­I~gòÒµ°Ñ‡jzõŒ|¨€TÍQ´êüÒ2) æ%Ñé¡nëÂkÒId§[©}îÛ;õóçØŸ¦ÿw„În99ä;:âòQÍÿÛ‰ûÙÿû!>¥1ñ‚ب‡˜K{“ !?áìÎdžïó縟ŒÿáçøHï içTçÏ ‚ÿp*„Ú>ÿÏù¿²þ þƒ@„ò[å¿+7¹¸¾þ…ÞgùÿŸ‹/¾ýë7ïþ÷çïXuçç_þëǾqF§ãñÿxߌÇß¾ûÖùõ¿ßýô£ãž!çÝ’Í´á̦ãñw9£›õzq>ßÝÝÝygóåõøÝßÆÀX.t6¿ž®K=Ïøš._\¨þq;­ÞZ†q£(Ò½U[i(ËrcÀh Çà“oGßwðëeGoG°/Ò¿‚½ŸÜx¾ýåÝŸOéhlä×Ó_¾>UqëI<-óÃwo£¢U¹LÙz¾,µÛ]~/‘DÏÕa=‘{ÝKتÁFírÉ­(¤¨GX]ŒuÛÒÊÿàÜ,E*'ÀâÕY²Zäaúv¤b@W7B¬Gx–›BxÙ*YNä.ºôäwö‘éoGJ÷íè÷nÄòþì÷Õèòb¬ŸôëÈïgfs¿ª÷.ÁË5úìÌc³¤7Vþà“΄ËFó…|ǧ§Ÿ«¤Kq;ÿ(ôNS6Réä¯Ét¾Ò›óê/œÓÓò8€S&÷W@=k¸Qv1Âù¯Ü%¾¡‘ú{Á87_¾p.ÖùË2‹»½°Ÿ=wH°øã+h$òì¡é~:©l‚Έ¸ÕmœÅrþ»ÄÐÎ(§hñ§—n€¾ºÍ* ÕõíèEgè’MÍô€c9¢zýxÍÄñz© ŽÕ,áÕPá’gžåvTU§T(‚ßk"Ö¬P¯jS‚Æ>.çw®D×”­Vš2õ‹Í´ôít²Z›òÑtryÁ q¨'f|©æ{ù›Ìôüf×ÂÌòbÌä?ÙÑ6àÏ$Ö,ô—üë>ƒ°™¤(•ûº<D*j`ŠpÅöѲ›äÝ£btؘW¡F·u1ÞLõbf«ZÅ7®àD¸=Çe¯>¸ºžÎc6­Žò½þ®ÏŒÊó9•‚õ&ŸüBý­CŸRå31· ©æ+1e2‚Ù}? |B¢‚Ú“0%(¢>N|ÊccÏ€kGr‡¼¢_xÿå|5͇ÏfŸÍ]ýP|&ÅY!—Ìë4CŽòU7_¯6··lyò*[ƒ—3±’ÔzªZÉvµ Zäö¿*u2¡G§·$‰ì•…ÅÚ›Ãñ]Ñ63UkôY™€’°£êÔÌwÛ”ŒWPIŽ)=fUFÁ‚Àyq±(1²2T¯VóÍ2fA¾ŸçÉÝÕ×R;s¶‡”PºB/Ø¢Ðú-zò\$Ó•ÒËòD¥x—´²†Pг·#É78ks½œoÙ’^dFB}áàÍ/«wƒ/•4ײ¼ôb œ\Ÿ›7ç_BTãR׌6\KXÔaëîÕŸJ{š3£_ÔøAþVíÏ×ëy O®1*¨þ*_]Nü+GÊÒFjÌàïÙ“Q¡e`õ`F}¥Ü¢–ª`™Î5bI²TâFiì…ž›27”ò»<ŒSÂâ±?8|a¹üfOø²ÇT+p\õ"‘ÁìMC–ÅŠbDj¤qˆ}âG>õáR—‹¸³XΗGY®îÉV—kÑk¹†¢ðɱ|Uã)~/©½n†gn{q1‰8]&âÇŒÄn(¼˜àhÜ‘BÝÐV‰@yŠ)¢|ýç~üÎùò¤• ÷#4R¢“܆b{é XÊ!*(õ¸Ÿ¢_¤RÑ„z©ïÅ»‰ò£­l7´U¬?ÔÂv¯éP<ﳦ)“û…ÔÜHî˜Kbê¹ÎÝ4 žÖšvC[C¸r…yvm—¸f\PØ~Ä£HPÉžL®mBIRAC=®ÚÊ÷¥”¡«·¥F\âR̸‹‘ÇŠRÓH©ºá‡O‹Rº¡­-âCJ÷¢Eô>‹Ê<â1—%®¤SÄ}‘0ò|A…ëÅœOlQ»¡µ±ÿ•Éïü銡«¸Åø>f±G]ßuÃ%¾&QJ=–RË·íD1ÇYŒãÐ`çüë‚EØýHÏ÷Í;°×"JS/,á(@¾Gq’”5—;# 3®ß^ÆE%^Ê™¦òÀ‰ ""/úÔi¥{þUHê¤ÒÈá}VÓO]ŸK™z®´=0ó"ŒR#îy‘÷©¯f÷ü«h×B½žÝ+9»û¬dâÀã$ 88ò#L¹¢0õäKA<-­ß mï祱þXÜPüîÅ•"Ä”† }—»‰›2¹sÄ>DPîºO츥Ú*ÂçÇ\ÊÇ4ó‡.Ü>D’Ä8õ8•šò˜Ç¡6E<–º !øÓ"’nh«OtRËcJOãj(ž÷âr{è»D ƺœ§ò=ð[äQ¹¯Ømë&gyÞ léÚÏã‘¥ø@ﳘ±HÓÈ—Æ9#žÔœ¡"i<šr‡Hѧn[uÏ¿F*¼ó püÐ…ÛëüÝ yJ2LRùGør“è…”ø¾ˆüÝ̶gD$Ýó¯é…cÓH£üK¶yPÊX˜„)"‚`/”æ8 â>åß<Ž¥º­â[%v8.¿? ]·}hÄ#I(_!ßÆfà‹„&£AÀC„¼x·™cÑH7°µ»ÙÙZ\/'ëû«äF$ž€vŠî}–6ˆåÛ’Ò&r½Ä‹âaùr&¼„"äïv0{¬¥í¶Šôk!u~|%gªÐ³z\©>Õ{)}/"̧(HŸ%¡Dq€© ±ÜR¤NŸÖÖ­Ú溲õz9‰7kqÔUU ûýö=ÔùÀÅØKT{ˆb7ˆ˜KI¸´0Ü &nzÓPÔÚÃ4cÌ4¥) xO ÏM1‹ ¬HÄ5 NõG4ôº§Þ¤"éq¥ÂÐêùõ¢ÍuËZ¶C¹j½(pÁfÉ ¼ ¼Îû8©ßWÙÙØÐå¨ñíb9_Ï Oûº{ší0Oáù²øCG‹ÔÛîí/øå‘L9[’>.¦R /©aˆÏã¢mÉ[ÐjÙûåbÏ¥b‰¨"ò,ÓA¿ÞŸsè¦ü¼«ùm´ÒÃÿôÓJ7©ìîÕû˜¤JR G*-’È^/e«(êq þxä•eÁ­ÞH8ÕÕU]/_[¾ÌÆSd€TuÜRñÞƒžÕ…¸½T)ßÔÚÈ?Nœvz݆'5æq?º´aä12%™ ÿ²õî‰oZñÒì1THHѤÌ,ÛP#Ý W©”òÆÎ(ÿuòƒ Ò$õ*ÚAIÚ£¢!GáŒÎ,ħœ‚Ï8__‰ŠäÖò+®ƒCË,™µ‘a´¾>|"eÊo:»Ñ?ê6fi b6˜ýšó¥X­²éè ÿØfR¼5çxæ”,®.x¶ÁR¢$Ì»ÊË YÏS-Y^¯½ŠãŠ¦Ãu©ë~Cò¿~J´)…¤¬—¥ìJ­cùuP\”]ôBô÷yE!1Mzœ®>žî8’¤·q?=}´ŸøÍ9§]|NjVë€;ïÊrse/6Ê«:Š~•íÂZ½/GRÜÇ —b•­Šs(U‡K±Zò¶B¨Ý çŽiáfÊ‹õi¥Iš$ Çz²&k\>Óí¥Ç `ZñÊ¢ƒÈÒË­˜üïáeiS¬G œ™Ü·-£+=Þú¯1WÂúÊ2t¯Md·cÄ“²òKÉó–¬iÖW/:A}wO£¤;zëI‘ºJæ»kWå¡$æç½ç'³÷¬Ô‘’f»b •2l™ß³úâ“0›4U—,¦a¥ph zw3_ ƒåX{RIê£Kùß°£PÔˆ5UA†Ú:=ü9O˜r”uÏšçmè()ê~V'øë‘jѾEDóþ+ûæ¯ZV´QEÔy 6«¥®Y ô`S¿VYŠžŠjú®(8Ò,DàÁt®* ]Û´í=‡ÙØ«’§+]òtÕVòÔVðô [z_²ŸüïáU‘åö®. ÎÏY"ÇXu9*6F¢u'¹ós>¿e“Ùà‘¢zlÎùy^lø`¤1ØLŽ¶}/jž} TÖÑIreÊuDb‡µq°Ÿq,ÅTD=j`TøûÖB’ù˜ü2éu/úóóUÂÖRvMf×:+ ËgEý8õ!ÖXX¼'µWåzŸ¿5öxú•zÇ;U;¶ïIŸÐ}çî§óº‚òÃÜ7Â9yŒ3òÏ µŸBµ]̆å‹Ù]t²Ÿa(Óɺìæ@•ì†ž[Ó¤½Æi‚ƒ"›F.öôÔ( QI°ºïvU~Rz¯ê þ©iÀG¾Š~>?‹¯%•öL§PŠy¦3P¢…OnŸï ÀÌš>ß°å’Ý_Mø3>T«‰ÖŽÓµùõr¾¹¾Q•… !p¢+³?&·›[SÇ7s¾È”ëÿ±w-½m%Ù¹HƒÌ*@‚$¸­lÜ€eÕûá±ôØîn'n»1vgfVJ=evS$‡¤$+Él²Ë*»ü† ‹ ù YåGä'dŸeNÝ/"ïeK2¥Hè&i^ÞSU§êžó}§NUebî7Ÿ¿ÙœAÉÂÔÕ¤6‚K_½ùÕ‹¿~ñËü‹â¤Å¬ÏŽ`ÌËÍz±(·..ÅìŽòcÓÓ™å¦yã½PHòÈ©„csž¦ªŠ…&f1HaÕÔÎ|u%€sG^Vm.ä$ÅæÕ»é®P7'fܧ¬F¿VçUw¯nbo ®µ¬Ìë|Ç‹ô@Íl]Ë.¿á—Š¯¯]]ñ §¶Tü Kgð‹‚]aUÞi©*ùµ«¯ÅÌÔ5øº2/‹fà¢ò¯ŠÂK´^î(ü%²îåð³ât£Î{ìî¬WJµŠõ®»{üWiÝà¿[Ôz9Ñ@.mÏ—ï°ÚW·Xå¹{9ç[/ï]AÒÓÅÛFϯ5@]+qã47à“ü‡‹)Î7QM‚»÷uK®dú¸VS<Ôðdàd¯¿}õêª&ŠUš,„—kwŠT-»²2g œNÒÀ£GÕ*øKŽD¯3¶Ë!`!BÀýáðû“-2©Zì³±K™T‹›”ÜYÉh%ç”ÙÆZf4âd<&cˆÄLHÊ;ÍŽz§@¸¯Óš¶ÌËœÍÓ}?ž-´¨nÄ•ÑwËÚ[R^âþK~èò «ä‰mð`8Â:{È—Ì4^œƒš`ŽN¦‡÷ìf[ú³Ss;½»5;eÈoР|¯‚pú78þÞ[»:Â÷&£¾9Ÿ\\7àNÎS8\ ˜@_åøƒaw6#–Úò0{™â»ù‘°y%ÒÄåÎY®úì~þ–ËŽ}‘br6Ÿõ¦ï œ=ÉR#“¿¨×ÎîK™[“ñÅíX±}]Êgi9ìš %B%ÊRóòùÁ…KÎüšÂŽùR ý6*¸!QÇž8´LùÐbÖOcíL‡P(‚-.Û º¸BóÐ9i;ðIWŒü²o}¥ù6ÐNË1ÔYϦjûv¯^£µ¼Úo‹ÈéæÍPw‰Í/ì&{ÛÈü ÀáÃXlð‡Ë‰I7. ¯‹àa~uR ¸æNð›½<7!¡†à÷2ðKÎKq×áqÈ*U“ý½”•1 ÓäÙЫ¯IpÛ|VÁq0ƒ²ä³ùaž PÜ”ªï½ØsÅÝŸå0²ŠÅ juVÙ6.Há8Ë—ú òTÐØqtl€‚¡?] tv4vÕäM¼4|vÑ8/kñ¢ê²ÁrºÀՆꮬl£S' G¯jAV:ó ^î`àeÃ@rñDB1‹0·ÍöÔµ]¤ëcàÓµS]æê9[\áµ`È·X4Æ1oU»ÉKXšázÎ;!ÔÉá¤÷·;œô.)kÖU­ï‚6[œ§·{óô—º7\qþàv¸µ¬æuNø”Õ½pËr½V1ÑS®ÙÊ£Wn ‹Ãt’g´æk¼'EèʇhNúÓ:Ëï]ÊÄìM[½-,ªš­Ë‹^F+72K8ìx4=o‚‹Tµ²š“ƒŒÅŠ^¦£å(-ÔBw µv6Þ²AÞ`â·Ú“³µqïºK]טãK'Eæç,ww-Îïºånbp+÷½aáÁ Žd Ön¡ºýªyúÃüÞÍ“ 6«¶Qþˆi®¾žÁ »¤®+s0WÖŒü†iÒ®)´—ÝßÇ9(ê rXpþÙ•¥ŒÌmÁZuVQ© ·Ù¾Dä’¼ ¼Ü!—]E.+öl©tÅÄç`@ûâJ,&Í·´¼Bœ‹Uô»•´ Àô*b³3Ä{õfÆ+6ÅÞb¯•Í'æîÒ OiFoò¹VÒ^ª°cnæl»¶Å% åy7ngôî'L\IÚæÅ^²÷•à^àe'¼ïÅÎé‡G& VÈdžÓÊš/ ¢/ Ê?ö{¶»±†qiÐ^¤¥GÊ`nÅžcFpŒb×’@Gy{ï²@wÆQì¢>8.õ‘NWcÚp£Pè<†pæ8â.UnS”¯áÛNù­7˜u—ÓÅ{n‡éô|ÿ¶Þ®\Í›Q¼c–iŒ;â®oëŽÜÛ×¥øÍpBú¦-0L`,˜4¶Ü°r<(Ö}¸áq,®kcð´^v[Ü*fÏñrµhÚ¶žý¿¬,‚›ô_³ ûÌ»» \m2_ š“vZ^ÎNšp»­ñ$“+ÓUZn_¹å@á¦Cºyƒ¥adA樕º®ÿߨ̥‘Ž¥¦S¹ø45¥uZvF9M[æâ4$=£Ðcš² ¦Ö+ñqÃ;2ŽŠaÝ1;æqÇ<.yÔÕî0·Ï†ß¼J5º# wä¢ÀýÂ˹õdUó2ÎÓ˜Çók¢2dy]\µ#t±5Óräø:’¡¯††Ôœh%q(úa±G^˯ b1k{ÔI‡·P\êäƒaŒKfK‰cÒ騨‰ Y ·?m.Ï7¼ãs f¬T0a–{„œ:Fjƒq Ĩ"ÎñX%\ä SѸ°Ž‡#0ãó®Ž-òý`ô¸^á+o.ÈŸ€ïßß«•¥+{Ÿ-g¿a›‹8{P› Ã-ÇÙý&àï våD¶%d߬ô¥¡åÙ(o””gI*MÛD ²ú9šd÷ËÍ8Òj½£Áp\`w)Ui ÚfâcÝë‹›WI›×süªŒË|íj½Æ4¿ËMÈóÐáe'XÂÖˆ|!Ö1à !ï»ãLŠpfê€Ã­’ôèÒ²»$Î’þ»€7º|ÖkÚ…ÇLÝûkÎø“K0 W-=™öú…Æ–‚µÛƒ@FæA`C}W`¨%n·#mžË±"Æc‚¨ HÇ@¢hl÷‚ÊwY,;K¾©Øi}òÆ]ÖÆ­ š^U´2÷×ðrý8duæƪ ƒ-2­v4zÃd\¡4¸ÀâÔ M?î†A×døH1†áðú3ÉçÈä¢A„Ïá·'½SÓÅ2§‹Çc©}K¹Áˆ+lIÐQŠˆ•.`€Fä×,ÍÂFÓ‚<ÜÇŸ•çåT,'?Õf2–û)Î_ ƒÓÞx8ÈÍé÷òa6¬9ÊûÞÑûÔÍœš^?¿6»µËC{Òr8Ÿ¬Að*»OŠ:\ÀúÒ=å2ñô«j©x¹ÀlõòôI…IBöy2¬ úß]j“bw¹Ü+!Px¹v›Ç–s5¨\Œhµ‰…/ ¢j)4–öÁ.»ô°Št')ëL_,i™Ÿð*/%ç'©võÞX­‹Î錎|6¦Ã(}Î/½WÕ).í€ðìÁdáÂÓÇ“ÄŸÞû2qß|Çå_ÃÿyÒψÌÂ<Ãô¸Îg8k(Œ®4Ù¦lòûétôèààììì¡~8>ýp8>:H;µ~(Gô½Ç½ã£…Jd“±{²WÝ1íe¦?­¿ÚßËŸüP=ð±¨2|U4)]MóMé=òôÞ'ÿÏþR«Á_å­?ˆÓSê¦å­I™—Tʇ3KïXrÔ|Ïÿ0Ÿ`Â9g˜#A>AXpÄ?ÉÐ%•¿öï$=Yö‰…vOúþnÓõú÷ß¼þò§÷þ8ûŸ¾üêù/áýgðÿþäÇðú_ÿú'oúòùçï>üèþû?ÒÿùïÿûöÜ›úðÙÏ~ò{öãßÿçO~ô/çô»tíå‹×Ïÿíó­9wÿæžÿ£þКþäÐå÷ÒÊXÿüA1i<ÿ4=ÿäîù¿ž¿ÇŸ>óìÝo¾y‘¥.Ͼùö¯^>Ëöö~EŸ<÷<ûõWï¾~eïÆf0ÉѬé¼x½—5ýöÍ]ö»_|H²pº¹ü¸?mÜùÐO}òæyŽûƒÉ“biëâîü·€äàí8L0Ào÷s²ôdïYköß%2X¡œ'{ÓðaZÜüs÷ÞŒ;<ùöÝû*ÇKB~½ÿíçûφÇ#3M‰6ä¼|ñDÏîIüñÉÞQw‡¯÷¼€ÌÈo˜ö¦À+Àó(û²x´€8æî=.ð}‰}€KNºÉd/M,ƒ™ž÷Ãä}Ó½,‘ܲ9éIòÄ{‰»Í®|d«ø¶ÄCßýö$ŒÏ~—‚ZÅ•v7úóAÉŸ&‹w7ê[Á­VUÎrVö_‰µ]Nñép´WàÓrëÕq8ž†‚Ô|Ñõ‡“b ,úÓ¬Ör’N  ý4TÊÀGè÷Óf½ÁÑ“=´—ÿ{¨¯ü7ùÇÓ¢6)’å €a€¾Ne\Œ>ü|¯ýùêbyû~?Dø zÈÃqñ›¬®Èh<üôWªÎO¿(Ñ.Ôh0÷Ã|•ÅÞSôP?D l¸\,|VEFÊؼUhu.þP úl"éyϧ 3€œªùoõ˜Óñð ïU(;Ì*ÐyÒo|›ˆú,ÖÔï=­|±çí}úµé ŠöcŽBÙÊ„ÊÀ«däyFùvýs‚^×_·b0¢R«çd<7SSTæmY^#­j±;ežîͤ'.>_»tðÂjQNúe@´ìÕy}“9}“Ž _]“¢¯à®mZW9©µÛ¢…t‹v«Ýçý~›AQ!œw›×Yu¦G)ÉÔÍIInȇ¸’Øœ’hÇaÐTÊŸçá¡©ªeº4Ê6EØJ„ýèē¥HW‰t]jå›"|%Âwš"B%¢•Aª‡MSD¬DÄ."Žš"Ž*G]Dôš"z•ˆ^ý¦ˆzøvz„Ž›"Ž+Ç]D š"•ˆA£¦ˆQ%bÔEĸ)b\‰w1÷ØM*ÝlISÄ´±Æz/‹8iŠ8©DœtqÚqZ‰8mcÏÑFÀu3€VY‡2¹0q•p¢íÝ÷{O¿JsŸ½´w^5 `Òæÿ•a~PO7ÀÇbö>€P“"’:-o±»l«õôEî#Ó§ó̆þ0?AàQYo ´1×ÕœŸ›,hø~æ²}@²ðãÔŒ…ÛΫݤî=º8á]—s 2úhÒ6͹¨•çĺhPDœj+½Þ{š$Aû{kr‘P)QR^2‘ÅhƒL‰”!†XÊ{_L$æ7Wõ⤓55¯KRJ«0qž®E‘ãT— käå\IkRÿ+MjDô § uN`®ÑX§ˆôÌÏibEͽ™~;¥ó]p)££÷‚ab…ÒÂI.q)½©›Ò£ZJm¼&X“È)tÓ>ǵÑiOÕõJ/æNÚ(ëu ‚ ?¹ c¨ÔÔÃÈ]•.ŒžK†4 Îx+ó‘3ÎE´B ¼Ié½ã¥.ÊJƒØPÄX8¢³†Kiˆ¢A¹®J7Îk-RFˆ³Ä!K±aÒIÌT±ªêÕŒS»ê£†îU $%iи(ˆ‚ñ4îZý–ò.¬~•rצîØ 0/¬¶NFœ–y:/’+­:÷–ò.¬û¨ÕPQzk¤w‘r§DäÂHÂ$X8zÚXȤLÂhÕ¹HE`ÊZ…XIŸ†U¤‚+¤ˆ%±óØd(e¸cÀÅQ³(¹Ö*8|Z"µ¡îÅTe«¾…Ç—€lx`-Ô+m‰‚¯x°Þ8:Û2d AN„±èáõì"D2i#ÝTõi+ß!¥s!½Ú†_ya=eh sn½—ßz×”R/Ê´nÀ5â T f&Rf§Z£4­[Û€ÕE+0[¸sŠk#ç ãáqˆƒå—ä¡È+ÂaаBèæ!¥HUµLG, Jâá!ˆà`±ÆÒHéLäº6löëõrpËx~`wš“ˆ|ê"øRh½C·i‚¶ARJŠût’o° hŒQ¥¬oׄ;nƒ7Q¬¸–Ácˆ\x°³82pwlц5“äX:èSFX“¤½ÄÉf#×® ›=}ÕϯdãÔü=OÙXX`mØ¢ Fj¦ÕÒ‚»Œ ´õHçÜÙ® ›]~Ý¥]ÂZ),·JZ L:€Q§›¶oƒc–•qÒ{@Äxʳ„ˆi`–·lC+ß_·ƒ¾àÁxË O"f9GÀ: ئíE®kG P7B{=o bÉWà‚` ±ôhƒEqx›çºµÈuX‹ª¢0x…§#X%Ë(8 0¯QƒO¥lKlWT LPë i""ÑŒ4ó¡Wà £Tœ9@’-ôåmLãFƒ1¡D K‘ã`Ý €¾´x¤U#6‚ƒ™ñJC¨g*`ÜŸ‹|"PMD¶1"„ˆ€’p <Ko(øð„þж숵(¡* ‡£7‚€ Lçrb‰Ámô|ƒÉ´X>^|\7ΈªX(ÇRƒcÂàê¸Ur~U ¡4Î’ÄM¶*Š{Ñ"––Pð`[FÜ£mWÔ:MÖEA‡a¨?8+‰Á¡BáT„"Å"ÂèÞXT Ë´Ó$­Ëðì©dŠ±sï·j Ï‘çà—-NGÿM[Ûª@h”Œ˜‚£Á+À+2µÏ ¡=Ø#»¸v|Ö(‚µ<Âè`\NdE²\k”oS`½)üFŲš92XÄ((Œ … ðˆ£%€‹ ‘Rh‹b[Z”–[ ¨Uuç†Q„,Wf„7] \§Øº@+…ÕA¤s±#X|/9‡N”`6!³6¦Õþ-”ZÙ ªŒ )<(ê°E6Ts°þ:ç ŠkU±ÀüER’8UÎk" šÈ°0m Z«Ä°:¢ ’¶§W‚€Ï´Œaͤ2 즂ªCô6+QT„æð}ä$-~WÐS†Ž¥Lé¯0É…¶(¶U sL¥T+(c„r$P<¥@®l—×)µ.Pz怫ڀ@©ÚœXøX@@žÍ6˜X›ukC*i€)̵ÔÀø ÁyÍyVŽ$ÓX±¼Ù“Wô˜)É,RÚ‚ª[g¬¢R2A,õð0Ì‹ÝԞͬ jŽ%)@Gcn–ƒ}Q4‚½dü=Ó[6‡Ãö@õƒçiTÁ#Í5 BK9ÂÝšÓ‚lVíH%ÆŒ;ϱ¶@Ûh,,(P¸¸m÷( †V¦ 8«)Ð4§¨.H Œ;«ºµg3ñ¬ËÅnÁ§ÙD•}¤‘Sƒ1ÜæÀ­®*wMs*-Á­ÐJ3@mÔÍŸ BˆUZº¸9-HhÝ=Xa¢ƒâžYïY /­tŠ>€×Æ+ nÑ=ă·,·MqsÂ<ÀC ¡±Ýº§%!­ —VQ `xÀu1Ã3C‰…a/˜Ü²º‰ÝÔGmÈimâÀ @`|°* 8Eœì²$¼Š­ª½8—ó–“M%vÝ^]]¹˜Ä„"¹iYÿ~»g ^$0$@‚ UeÊÁLwO¿§;}%²ƒÈÚK+Œu‹²È÷@—ˆAU2‰î¨½²Áš…k; Ë‡N[–†`®‚²›1PeèÑú7· °Mm`¶švlÛa0øl1—ú )nÜÆköb+ÖC=[ŒK0W©† @àG¨êîºq-Ëö]âÆÀÕ\Ï°_c40øäîjÚj(¤¯Ôcºœœ8˜’,¶A©uˆÁPÒØÜòJT?ŸÜ9ŸÜ9ÌO!ÿ?Léò[óÿ Ãru¯”ÿ{Îÿ?ÄÏ9ÿÿ0ùÿ¹À£†ù¹Zv ÷|$à|$à|$à|$`G:;_Ï%0ÖûlApÿÍo–™”¹ï°¤^}í:^|Fs¬'C‚6 |àÛfdû4ôCÓ’ÓO£ÉŠ²l†*¯¨ï;5-xø H[T£Žã›F,_vA6|ºúv™°bCŽ2¬ËËÉêá,ž_¥8ønÊ ÖK~ƒm‡¤ªå©d@«iŸ{HæÁ^>0ä$ðÔúTBÝí˜`»¾7w‚Ü–é³°ÎaËÙ¼âÚ6a‡ãÕä ‹1·$ céŠõFæŠj±àÅO³¬N"¿ Ò™ÊÆÍXh¦q%6_K„¬d ,ìö ÏN^.ò ö>Õ“f(=¦oG°ßÜ›é=w‹Ùjž¢ôMª$”Ç-¼ öîÍÛ\ñ¤Ü‹e‘Ÿ›Ñm±0Ï{¸ød ÚJã;˜Ë…ÓHû"ÿäÒS”ÌÒr5qªƒüV|.œ-—³ {amèkª_»®8ëæŸ0,¸:Re¿§ßŒ ÍOV &ÅY쎪õ–iĉ,à 0©–0Ãwb× #Ó =BBÛŽaï„D9- ëó]¼ê—Y¶\ó¼9¶Ññú9æìàå…(·ôšO -¼l"eµ¦‘d8®cûŽÅˆ§{D·ãÈ÷\ÝtB^À˜¾2ЖÐ^õ„Žæ™óÚ/¢¬yŠ‡f¨‚eØ!afìÙ ¼zŽaê¡cú–ßs?ô†‚æ™sð’¥)M´@*XöAÄÕÝ Äv|—ùŽE t<»áyû³¤ÞPÐ÷{ ËJ¾{‰cæ…4ö<à ]3ˆ O;y&Í(í•õb½¥qãd‹ð ÇE¦*€÷A¦‡qMFLçwußG^Æ¢À2wÛ˜'Äb›×_¢î€ê“>Z*ઈۇH¨oÔuˆç›!ÜЈ}úhXFàï¹Ióú‹3éFZØgŠ(ÛËÕ†µŽ¨­c%ÓB<†Ǧeù,ˆ,Ó”@hžlÞÜãÙï~?¨âma,ò L=põ(ö"“Dqì2Çò¨ëa’çÎBš×_œ‰hÙÞ/݉àm3¨ân: l+ÙP_7Ã@÷#ðã» ÌËÁ<úêâ•–‹SC”;wSSl¦eWº'éX•Ñ×9e4õÒ*§–ª†©tøkð;>ÚxLUËE7ë›ÇDžÈ3¼i ÇGžÈÑÖ¹ƒÙqÈ ´Ù†ƒBšL°Ü’[yL:€ÂvMW;Da‹HîñQ¸sPýUOæΑiÅÀŠðqhbi‘¥qÂÄÒL+»ç¾“Vt¤•ƒkc-Ò@O+y%:MtMs\) ÀÄðüCc¬Eâúñ1†n„ci‚þp´0^»Ââ­E¶ûññ–ßi2«¿”ÐL¼y€7¯?¼mðL¤g ®‰ ÇÃ5ß…•Ü”}ZÎ÷•Ñ¢ÚÄ~ÂOòÂ^k›iuŒøx²§Ñm4Ž UPäT&ø«îé&˜Ô‚àåF¸TŸPeÀªT™6»¹‘‡VÓ½ß%Ö HïÖ°E³v1^j{Ú¤MsH¢=²Éä%…]÷ÑÉK4Ø__Æ”Q¼“‘a¡ ¼óå•öñFfbt˜Àxš°V þ…'k±ž?QËøØWš8MK'¼`ò*]ÞþšŸ–p‰Šê ù-Þÿ"ÅJ=Ž©K¸”o/­ W $4¿|úðAÇ°”åÓË+-çÝþ®-å^¸†¼|ü¡l)D| @$ñXHÍQGu.Ý"›ñx\zŒ;¤šWúŒ”jãÌû‹1O˜ù âÜÄýS#ØC'Šå㬎³ ÖÉËÒ„^kR\\>Ž1™$L›Á÷ ¼pxsÅ(°æx¼H–›,U¦o†;eškóØݘ<âe½J®5¯gVBŠ^Ä@‡¦éƒéc¶ ›öì³+oï››ì˜Æ¶üê@åã77ÙµœÊ@éABµqŒÊ8YµµÊYè77ë¥j#•›77"2¬>RÙb…‘Њ;²ƒ´ÆôMלš¾²¥Î.V«ëåÍßÜ@J¹·ÍGBeµ"í?#}èðNFÀM2¿ßѼø5 5[<ñ5žÄL@ ê…ÇŠþ²î˜-Ê•C†Äèx1ºý¿ñôÿË/v÷Fæ|¦a¦‚>!·´Äd³³÷)“}¾TÝ‹Ž§çøëŽc˜N!Д:·ŒáT—#™N‚uÙy§Øü@[…F6–.‘˜<=„³IÖ{HUn´8ôÌã]uÍÝ$“œô!¥@íä7I…Hd)åBšTðçtö8ͳù tí÷—{Ž÷³H0A«Ì§wZ\M^‚XãyÐÆxù¸e6(¸áãà<جòG²6²X§B‹¼ílÅô*«JY0ïíÛ~ –b¦U7‰Â@–Q‘u©ÑTÓ‘¾a¬*ÎÒM¼¡¡`ÃxÀ»¶´Ÿ(›³)E¼) W¾+-–´·rë±6ä¼Tò¤Ç©Ìɱå8“ȪÖrÌ SØOW“‰Â@UjO+ÜÍ'«åìójº˜) X^¢¥§~ä›p§}ûÁÜ*¹ºA*Û ï]£@`núvZ¨)m½Û~¬ª•éE!_k›ÒàUVj¥ñQlO„‡K㩪l!=©EÄAÙ×ãsXxP¾cÂc\(®Ò.ßš}a“iŒ·´é8™ƒŽ“lu„(±Ñ5B´GòoÃbàŸ”§ê†L[ª±~6¥¸–+íýRjÔLæ:ÓôôÆA¯]ð_|LÐ{„ãq¶øS{/ï…TîÂ*“ãDÑE(%‹¤ gKM×îI ƒ>Cê÷ãè~¯wIŠ—ïù…†C#At\ƒ1aIr\믹 Ç=7BÉW:Jس©GÇ^vüä’”4j§Ri'?š›>‹àpÕfÇ´…Åuž¹»E伟¾ë'’Äù=Õ©ó}z²¢]PcºBM„ŸËN¢Ý¿°©PHƒë;¸#ªþÜr‹ô Íx©ÑK¦ÿ±„wÀõd‚ féx§…Jk‘By¦%Œ,¢õê×·Ä$§Ü늕ÜêGÆsSè1QÙKÚC]‡œË‚ýkÅÛæќƬ:ô(â™ø„@>‘¨Ž¥—„;?ŒÜ"q¼:”éºÅ¡’òX[×­äSªéÒ\kû™Ky‘Ir2a9ÝMGvÒ º*2Î NßbD"&l‰álÌÊðèC2jƒ5Wèf6E¹²>TŠ`¯#ùüÍ»[ ‡c@`ñ£õNRN€÷—§Ü%'5 à¤ð1NzN;`òØN§kÿ‚Ihç â9ˆØÁëCUVéÙi=üÅ‚Ý­&d¡0±sTò•ì8*ÙFónÑ'á™kÞÓgy~ÿÄÂgÓö¯M{*_€6ÌTúkØ„Çõ“ e ZoG1}¸¾˜‚LÁ‹6-¼kš›°œOR®’ ]\ÜÎO¹U©ðÓ7M ¾„,1©Š“¯{o×]àãl>k°«Ä·zBc§q¨¿ 9yRŽY^U¥¦ÈÎÕ=š»­ éܸ ÏL›;¨oW‚°M¼p-ˆ³ÔÃD%F8èQÍk³8ïE¯hØŽ5 ¬]jE.#ñÛËË´4J¢]^Âu¼k],As›¡"9Çÿó¯î³î<â«Ñ5lRJ,IJ_ܾIP€Ý¾ø Ù(÷ý~†_M4ÓÓLÝp4ú±Ý'à:â?ælú;hÈúå&%r÷ËåüæúúñññŠÎ¾>k¾š-î®1÷ì«\ò‹7ㇻÒ$´d½¥O̧wØ|i™]Ù¿àà5®ü+þ+¦ —Ä’ð[tjáo|Éí‹oŽõƒ¯&Á§qÍ}&_w—ïÐqXÛÆ߆çèùßÜgdÛÞ7†é8Žm8ºk}4tçMïr›~VH‘šöMH’ålµyÝMߟèÏ›oßýã‡ÿûëb]ûõÓ~xÿƒ6º¼¾þë‡ëëwßiÿüï?RÖµ 2M8ß!“ëëiù ôhñ½óñ·ë¯8–Ëÿ^.sO^Ñ%ÅmÅ_øõa2MÞÖ cA žæ÷‚ª¿@TÀÎ…{/Á^y;úAÓÀ~Z£”ݼ¡×L<ü=¦%lùöÓÇÿºôùƬ òÏËO»üaö0'Ë1ðöÜ8ï|¬ŸAIòvt'øŽè&ï{'ö½Øïüåx R"å<7Zæ±¼º×x¥L#‰Âï}ñùŸ’/I®¢$™€LY>MXrÏØrÄŸÉâ ø²$ZŒçËü7/D\•¼ê­Øâéê”»×â›vÒ§©”hIùéÜ|SVØjÊg¥’¢Ú‚ʨèV‡’‚Î4ôš,ØÃì  ÜôãÁc ³D(óòÕß A’ƒ0% a#õHu‚M°e[4žÞ½é#þ÷8²üDú›¥˜ j_P&Ã>v7šãο~?Ú M¿”_NX ·èW{÷hÙD@)úà'´”ð)‰°‰\áF®Œnõ«àJ`Ã×b@!\µTï• üJ%IAÒë5‹Âî9Y‹_¬…'@°@½üžÜü§äËböhŒR ˆ”™êb«Iî*j*kÅ2¾Í„l^šòõÞþLÆS±þ_É“«D‰ù欃ïžv\è—ìr›AÈ( W]ãY1™ß³¢=›GKW­°}—£õè¨Hg‡½~¨7׫‰Ô!%V‹ð6 ð6^?±Æ<9®Vw“YH&ÅQ~×Ú¬(¿žK`¬÷Ù‚àÿ›ßŒÏä€ ß¡2^o¡šÿ™ÚväÚŽ„! YäÅŽø¶Ù> ýд25•Ÿ#Èf¨òŠ€ú¾QÓò|Ý…Ÿ€€ è™Ä¤Žã›F,_ÕNÃÓgn–I‡`m¶Ø€Y¦QàÈá×'Š³·¤0®ªÙÀ4×ÜO¾5íçÒVj¬ÈâiÄbVßMyVà%¿ƒÁæÆ ¡å÷h²@<¦ý}î!ÙCãŒLàWIÖÒrÃíh[®ïM›Lˆ›K» °ÎÇKnym›HÅñÖ´˜AJŒYUj¥È¶kvÁÕá¢ôÓ,u‹Ë PéF ¦q%6_Ë̇ÅSM.“ù…‚‘½FsmE7µèx“ª"eÄq7M{÷æm΄­i9»SGYÙѪË°†¿Þ[ë¯gÝü×\÷íÓÚ;¦*»…£j½eqDB#¶b+ÒcfdÑ °"ÂtJiì{âMVԑض=ÙFÄt‰~iy~×b©Å€eQà^=œ-Ã¥NâÚ±o…¾:†íD¡kc 2vdNEt‡®æÅÑ5o….UnË%ßï9±×¼á#_÷¨í„†ébØû™¡ºC(ÁC\úN4„§¢{!‚æÙ–òvÒðš–õ=í‡Ðr}T·‘›*´÷á%ZažûÕ¶ôØ ˜;‘K =Œ†…ÙæÙ¡~(Ä6ãTÎûàÔñ-ÝŠBFQlÇž£{ÌŽ,ÇwHH‰;á´r”­;¬6Ï·òu W»8>Ua¼>)³=âF‘nS0ÿ¨{`ê‘m¹‘’˜ì„Ï~× }4¯¿Diø^+6P܆OUïƒÏØñ=Ï1c¦®Ćn=výÈt Ÿ9ñnêó á³yýÅ™¬³V´‹fLªBwL†Žš†É‚Т„Æ ñBäó¶j½3,éÙ<Û"ÜÓô¥ãqYUøîÅe=#Ðä´iGžmaÃÆ7â0 LÐÆŸû®l^q&YºÝñÈCeûèmVªó#×%Žk˜° Ývhd{žÎÏ©“G1u¹;\6O¶ï,ã±/\OñVÅÛ^â€VJ1"ø|˜QL}Ç6ýêþn4Ò{‚X‡¦qýÌ´•íªVuÄlìD-½£ ¨[øŒŽ—ȸ·ûîUOûy¿ÜBÅ|4·rv'_F«t´r4&RNzmvŸ0­4“ÊîNöc’Š¤Ò®Ô×N¤²¥~[VÔBMÞ¡»ýøˆV£«ö‘¥Ý™ß*K;·­“¥]†`_=ss[ûð=sÛ¤lç ¿ùZvS±—`Ýá³nR·«­tóçÃj¦³OövÍh{f˜ízfÏó@õó`5ÜØ÷K;ìæ&@*ǺÀ¨w?µ*JX-`¦ó’çº÷hð»Ët-¤Eˆâxb"+¡\ îœ+(FÒiê)6֭ʬ|QâìúP:붑oýW Þ]Ên«ýµè­‘ X6>/é*SÉjï–òv¨uÛì;þQË’òèðÃmÍ{`@œ^KÞ21ª¶ä­ádÅ–¼¥Ž¼¯Ð’·Ÿ®kÔ»ÁÜèF0Ô¶ïm~c7foß›ˆ¶½‰¹auï­Ñõm°$àcøÆ–¢…”…¤…TÓ`u(R‹pô ,¤¾š¸þe¼^4q­5ÈÇ_ƒ•Ñ—g«·þ¬5YG_“~¾&5ögA‘ý­ûŸûµHK÷;·Øç>±§Ùb«Lþm[luãÍú+´Ø:ewÚïí]i»¿vxº6xÑüà¹ikç`ZF¸êÜ]0ÌJŠpëv]}[f͉aÃKqè ®p ðÞÔ£nÆM Ñó›rœ+š-,™Ï¦¼ïyÅTÉʔڠ×Ä\ZÛë'ÜkÃ{;vᆃó¬ ynÈ!¨I5Ùa$»ÌHó®$¥‘ôÊœÖV™Ê@Ûc5¦%( eUV'ÔíÆÇ §öšÎm…NMiQ¿ÂþîØò³ìuóyÁîÆ°ŸÔEF‹sBÃfÅD¨Êt7 ‹¦&PÛ윓èUç„ëµ Ô6d´M>žÞÜë¬;¹Ô¢QH,· lqŠùx<Ïî¾Òê$Õ9¦±• ì9çI Ú…`sŒ¾LË gpe7MxBâ¸é+IYHø! ðk´oòÀã^¯Cåùr>†ÎõU½%†e½%y=xhÑ— ž¹ºÊeÜ>¬_ƒP¯?_-À§ùr7§!§WYVt¯ñc°‰q¸…(zµ™Ó½ç\– ãLg0œX)>÷Zt/§ea—ðEà%}åäM@Y‡pÞÉ<‡ñ+íÓ8 È=b£ !c‚`s¥VZÖÎ¥C…*1| _Dí(Š‘öʤÝînšî„ݹ?Ãéôgèû§ÒÿÁ²ÝÿÁ5»ÜÿA÷Üsÿ‡Cüœû?¦ÿC®ËòUtîqî¡;@œ;@¼ÈcõÜ"iÑ?!4cËŠ<ƒÚÿfïÚ{Û6–}ÿΧ`Uà¢õµ-îòíÆÎIúÈEÛ4)î¹@aI.µ²ä#Rv ýìwv—¤H‘wEJ¢)mSÔîìììüfö1CˆE™˜ €Ø(Š,!?ó/¸©¼U†ª»`€Pà "ì¹6%‘çDºé¹>‚‘¡aÙ6RgùŒ•r½ÊŸÐ6D·\„=êZ¡é‡,5 —ψ"Û¥Ù½E™ôßHPË|É‚\Tƒt‹¨kkÊöVÛ6½cÆétšë®™ÄÆD·ª5‰Z wxØn±)µ9D™j?´Š7‡AùX†éz^ èÃ5"↦îÈÜ.ÐóÎú¼™ÚÕž8\—K„¢Sä}«˜å% MÛÇfdš~àQøÃFºžeo7¶»è÷t3½« Ò{¿ý«Êóv):"Ý×#×ö GwC=tˆ¯‡2œÀ‰‚`»þÝw#1¨HL%È7Ÿ5—èXEf·Š) ZA§ž¤ \?¢ÄÅ!2#Ïg{ÝÐóïØf¬Ò¢í[•Ãmz3pMjÀs‘O}×ñýȳä£1ö©½¥ÞÜ6S»ÊùæxßûUÁªün—cÁu°­ûA6Á4=ËŠÂ0ÐÓ3PÔmèÞ~ŽÔF¬Ò"|¿£Ú‰mÚㄈía-äù~èQjN‡½ˆ¾t·‰]å¾DDðö}‹viÌc _M±ÛÈ‹ãÛ”DzD±n‡˜ÄÒÍÀ$ö#7:žilð\›Û_ñøU£ƒ«²¸³èàÛÄämVUýÛÎÕzPÖ"È.vóvˆ°R{Ä ìk§X•ëöŠµÎ[¬éñyÓÝàE¯TRx¬Qxk j³ùɨÇsÁ+¸Hm~Z/ͽ+o2ÌÚ¸è+Rsuúuq;Ñi¸yTMynub0/ïR.Ñ«zWW"þ€:unMY¬ÿ¶kkÓÒ¶k©[õòÄf´æ d5bfâuÞúv»ÈªUVÝÌ‹cáÍ“´=Y³:å}ŠYÓ+,?¦ð/QÚê˜Oð‹}ŠîxOÂï+âÊf3d­Ý±»0ÅUõ‰L0àrC BL4nªXÂQ?|¨âÊôɳplú®xï¬8¾€ÅU‘T Y\«×Tƒ—’ÅÄ pâ1 V©a_¾d]üⵎš,2ÔÆ(–)µ7”G)D”â`?QŠk xlj¸œ\Ñ/ÂÝè@*º£ýó%Ö{æ=î*àó¡]°=O§vöy u4Ó¥; í\3¯d³éK»'Ó—G¦£$¶›öLGÂ2÷O¿žB3ïÙS ÎÜÝ|Ü— ù'7UпpÊkæú\¹è '¯ïäõuiQñIﺵ™0»7Ð$6%õo£O‘©kÙ×óX£õ4wºˆ ûO][sÇ“LàÒ‹å'¾)¦vŸTSÏ5³šµóéêeqo·nÂA½¨¦6%²š6w¨†¬G¥dZ2½†²Bì¢Í ^9xy#VKœué”t¾gô(¢V×Ü.nõ:ð("W×ûB;]½FÃÁå䤜œ”½;)Z#ŠòÞÎU)‰“Ó}*^µMN+g­±®MpqµYÎßrB0›v<|$ñ=œUà®\N(üE ð~Î*8133¼]$ãÉ(&£jæm_O*HD¥ø|»/"Ä{µÁMAÞë¡c7aÞÜ}-øc˜ö"Rõ4Lû{¤Ó@ík ¸œðÿ„ÿJø¿—©ìª!L½`H°ñ0’L•X- c{µ,ƯÛ$§ ü§ ü=x1Ζâÿ»ÎåmhuZ”º!þ?[ÏÑWâÿ›¶~Šÿ¿——-' ©‰¨ç‘ÐS÷»6[÷²ÝàÐô^»}UÆ¿éî7ÿÒ-dÕüÖiüïãuÊÿ±Ÿü“ÙìîòÓ)ñÇ)ñ‡vJüqJüñ¢Ø«§Ä±DZvÐÊ6-Ëó}êÓÀ‰,ÝsM˜nè»>6RrÓã9…*Ux¡ëZAˆ ÇÕmxy$Š Z–‹Q”VþþVŇ£y&žE Ã¥‘ø5°íywˆÄ"SظàOPÜl@hűþ96¿/|‰éôFËÌÄ5ï yÉ4í,k‰éö8kÉjŸñEªJÇ5f/Ù*ø©˜´ÖºŒVŠðrXXÇ NÖ‘¾Œ;Ú6¬èÎ;©2Fx/-JsrE®…ˆ‚¶0 Jü0":¶tbÛ2Üí‚צd¥‹k':kû¤ËNO½Ìo$Z™‘0JdC™m­rH¸¦¼Š 3Ä®K êá€@Õ(ò°ƒ]ï]Ômn‘¼“šÛ™w’ÔèUf\ï†wÛÌQ>µõ ´©NMx`„žgùºgú¾nEÛ&©è:­AÞÿÍÔæý¯˜2jkãµR’(U–·Q ¦±u|Ó©‡0Ò‰ç¸.¶XRè>uo3µ9ï÷Ù»Í]ªÊæ6]JõH7© UºŽ¥[º‹Ìˆš~èÛ[ŽØîóAå,o¦7g¹L"¨]w¥*{Ûu%2M'`Y­ÈwM/ð¡ZßB¬ÂYݦØ–q;’Š¦¦/¥bÛdOªìm—¥MGH·Bâà "¡ ìÅ,u§¥›$Œ¢í,°ãèÊæ¦çD¨¥wRåi«Œ.ËE30° ìZ®ç! ~ WßÒÉÙP6S›³¼9¯Ó®5ª*k[er2|ú˜bdYžáºîY–îºOýí’bÇ0lnzN?{4jÌß´kÁPí¬VúÙm¼ÈñBøàŽM±üͲýç µÍM/ Æa…Bµ£Z)}äX¦ƒttq"Ýv Ãu<_e…(ÙN[tœÆk©ó‰ÍùÍ£ìr|“ É»Z”*“µK±ËÚˆ‡‘a¹³?ôƒšvd9(p±GñÝ^‰G3±eñx~¢¡Ú]mDÀŠtߌlÏ3ˆ…"ìê¶nYıýÐÔÍnáÄÎ!>BÈ·0ñ ÇÖ‰cY&v"G>2°ât³²8“°ƒl‘y÷5·~9W>ËèÙ‘À5Ë…j_µ’ ×p Œ±CôÐ%Äöõ€˜ÔóB泸Ï6ÑßR2Û¿œ UÍð§ÊÛ6ýh9$°ÍÀÃ~äØ¢€X®ãø–KhÛY;s›©Í¹NÂp—öÝ.tÿÙDbR]µÃZ¥‚6IhúØ2\×#ÔFÓ¡–úÔt÷Ê.h&viýÏ;œ}•èDUÆv–Ã3]WHá)±px¸#»mVnϺÁíÎ*ž:,ï˜á§¸t–I— 1¾ºáFlðQ=Ð-±öœÒÑ,[í£8¤p`&rGRU…£»ŒÁðv8Ê#½gÆ.bét1§&_œ‹zOcÅ·°¢”ùp|AÖsù[n/ä!ØsÅ0z ßQÉ6ª§±p&|ƒrObL–Àßâëq"Á¬5±TLñ¬Æµqñ¯ÖÇÙRæ›_<­ÄLÙI¨qÓYÕÖ–£^ÁEN[;5ÚZ=r@fèËáuu5¥Ÿåˆ/ͳÜý‹ø²½ò)/0<xÈÉî‚ÅXÖ}z÷\,í±•ôîñåÞt ´FªIcTÔƒ‡OûžQSÕ—mb©TU¡É WSÖpݳ*lË\iŒáèuËÓ[e®ÂFýÄãA˜›W¬Ÿ¯ÚT÷6ª{´õ=€RáSöEöÓ6Ÿf¡ ¿[¯ÓD¥÷B•ïZ…s­gÚšÕ=¯¨Â¡ûÓî"/Õ•cË¥7W/Â.¡‰?Š“Û$n(¦ÊW\D¹àOuĸEbîæã{’ÐÑ=™ÇWSœS,Ž5l4ãnÎÔñ*~n‘ñ´yöýpà–åY_.T7Mö DŒak³~ƒš›æ™ÅØÉa, é¸×©®§AºAˆß62§SH°X <¸ôÒªïÀ׋Ç=JItÔ䢔]FEãIÛéˬú)ojü†£› ߘhtc<þÔy(âçûweòŒöÃÇØ}Э<ªk£ÿ¿5¾ ”\öŠ/*òÀ¶Ë“ºêÊ[b»gOÌUŽsGm®tB‚„ô­2Ÿ:ó¨D1ç‘<Ì„šbæm¬‘TaÆÀ íÛ*.Æ1ýî\‹È$¦"Ý3»s©}`_ο'*‡rÙ”Jš…$fÙÆÄŠkfN§“-¼n ÞªÝHŠž~&A’&šNžÎXnjh Ÿÿ"ÑiŠMpýÇrSûJl$•0iDÎìÎ`‡ k¡ðrfÀÕuõtã&!ÖÏñþ#x³ØèE‘éÔb\zé@©LbY%‡‹ôv®’iØ«>W/×V$Nöô Ï~5ä„éGŽé–6âúr…_Ü‹uÄ Ðã1@r\_t¼„ŽîEô&ó9yä1ŒXHÕtϹöiö@ï©ÈX=fI.ÆјÎ¹ø“· @KIqß1½´p´k`_WÙ3BwŽep9­˜µZ1;êµ®µsÈJÆFsLŠ¾Ìü²Gmhì}ÛçØ:`dÆ+9¯oEÞí4ãöŠ2íÏ>`µMðŸLyfmÖæ=M0&ŒN¸ZC·Ö¬ê.ÜqkÕ®Ü8‰è†}ѬãÓ¢ZPá\(º•£›ùFû¥ö6ÑÒHù¼f‘ÝP¬ÊqVCµ<¬*+SxPÎÃlþ—ö0N> G#ÖÊMëÉÆõ£^lQ¡!iËÍ3"G4Z6s<½9çfOËL=™)|Ò;¸•òÜüÈ/Ìhâ«é¥ÍÛMÑwf|I„Héáù„Val´*߶3éR"÷ä£.‰]‡ÇÁœòô̳‡—j;˜Íç4¾›MÃBÚo®Úó´-¥c㤊R»ãëkg:»ZaÇKyL^á²W%]ÍÛ‹ðªÜIî(—ߥ­´.¸~ ¥¢—^š/Q/cí&žoÕWØ ªª‰±U –Ä#Oo¹PZÍÐìVØ MF!Èb’Œæôf ãëQ]éK„Iî¡Òo(MHË1(û”ÒµQ Ò‰H1-™NFrk9›’¬õǘdÇ”mFOXê'Ê’qŸ()+jAc¾fÊR.O˜­Ì.gBy­ÛE±P d)y¬ÌI2òRRtöè*±°bÚ.'3ÿdæ·0ó7žNVÂîMv~çP%ƒÙ.‡,ÛÙ¶‚맥0äIy¶“#"®«ö­@~—ŠÊ2Ìj,Û.ß|ʧ¹˜nïÁ¬\·;ò•Q2åZº–ûnE–ñyÌ=œ=æ&3:ôA³4ªíü\WˆSñ6L×…,’ñd“ˆ²8Ì`ä=ïƒÐͤIäz–N·#Ú`lš¢IyJ§ýB#oéúý“¤.T\4ŸÝ.¡/˜ÝÞM óoko%¾GÉû‚JWõü¾6üÐî2Pdçw!÷ÑÒºîf±Pþ)êŠo¤”U|ÅÌãk$bÎEÊÉûoÙ9Œ>nzIå¢×¥v¦‹i3À/¶/±²yGûc ÓØò$[zó)}¾Ÿ#«&G-Ý=wàrûÞý6 U´G¦^@{&@£ñ6VÆöj9LÔ¶ ÈE«‰{2?äòšsVôÏüh“§¤àqæCŽ×Õß¡ ³*?âɯ/.2>Ö..à>»'dÎÿlÆ çŽýÎ?ú”ÇÞ †À®0œÓ8^ùàÕ˘©¤W/~¢S:ç@ ô+¼ÿg1Ñ°£aY2®LûÊòølunÁÀIyFRþJ’»«áðááá2œ}~¼¡ÓËÙüfȶü|NÁæÅËñíÍ Z<®Ù7î¦7,B’ßê_p B—î¥ ¿ ’á–hûÔŸ…ì'«äÕ‹¯N¯þ½X×€„ó.òÓ>|»—‹®êЙ’2Mö9–^ü©s}nÛ_!l¾·Ï6¾Ò‘m"ý+MM¯­šö•Oâd¶Xßæ¦Ïôõòë7ÿzýáÿÞý ±×ÞýñÏ_Þ¾ÖÃáÿ¯‡Ã7Þhÿþùï¿À0×µs2†<™ ‡?ü6ЊÊåÁàzåÃïÃϬ,ľœþz‘¾y&!S9¼ÂÏ·“i|]S ò?I+SséËÔüÈîÔ~õåp1Ig4Ò^-ó—ø¥¾=³Dk…2jng^Ä ªËüU<" J`9šÓVe™[2^•nóѾâv¥÷V•-«¤¦NQÎj¥™=¿Z4h22 þ¼ú™M~ãBDYeÉp±ßŸi¤…T¨N¦K¯ªþ…˜™Í *«î“9—’‘>ÊÅ„ÞÓi)7ÍžçÆæ'ŽF<T ½çcLûQœU:9'gàä ÈY ‡6þכ܇vš(Q3ùo&3ŸLÊ¥ü$îI™ö…ö\€fý”7nð¿ùÃì;¦Âg,:aýBØ}#G†Áòu™„XÔ!‘‰ ˆ¢È"òSr… “˜Q·[·cEÇ·ð;HÁ‚¶¼´M?Ͳuì°˜ÀRl[cû ‹/y“ ¥Fsrs+Ä´p—­.r HcëszºéTè£ÂsÓÙàë_”öz¶"³ìå …â†Bq©P.FÅGÓƒWóÿ¾hû:;ËåVŠv£v£ÌZºù°:;Óê_¹§ðËØŸðgÖ¾Ti7h7åiß;ß­Ú­Ö|¯XcñÝn Ýî1ßÚV|ÿ‘‡gc±eù¶/Ý"}Î³Þ ßÝÚÝóÝk Ý“ ]©F¤o®é2ÜR«²]’©ò¬Ë—ý @†°ýÚÒ!|_ˆØFºØ±ó ¤»Ùäñ çd€?›ð ™ü?o(ÕÌUþ0CR`v@þ7’4®—ÎG£Ñùùèœ_‹ïóÕû£â½Š†R£¿Ô¨qú‡ü ×aù]¹ŸÿÅ®Oç+MP¤¿Ø°mM>û÷± ý à†¤À èúûï¿Ÿþ×â»î~á:A+>¶ ¿àÀ1úµŸ´§×OÚ;øíÞ¿hü÷kþ×kq/}_g××ÚÓGF}©éo9$r‚þßµ§É“6Ké¤ðžd´’zúY?~³Ò5úqdb)ÈäôÿƒÓ9IéLà½ÈhÖÓÏÚúÄP!EúðËá¯&¤eº¤?m´†%ú៶¤_[i€"ý ø‹%ñèø™Só(¨ãò#è»ær¥¥÷súňa¿ÔŠ P¤¿±þ2zÞæ”eôkZµÂ{õZj€"ý ø‹eñ÷IûP¡S–þRéoÀ_,‹¿OÚÛÓ_l€"ý ø‹eñ÷ .OgüZ|ŸÕÜ/Ý ©ùx–5@‘þüÅÒø«ýK{ºr?…÷{xÚÓìI»Óž.„®ÃÛמæOáWëÃLí S§¿±,þþ×7†÷=8‰âgù¯u?U¾³á¯%ö¥·ó»Š¼hÀr,‹å½Ôè7°ÜÄò׳»Gq´ëÛ×ß »ÚÓ1ŸáHµwd>Ž/Þ/Bðm¹‡÷ö·ßßþ£ú°ÜÅòCñ¿Ë I,ÿÖ¸€»‹˜jÿ|ÿF›Œ:éw{ ¿Ë I,ÿ†,ôÐØ_$YÔ0Ö˜ñT«¿å§DɾÏÓà›sþs¶H¶£¿Ë I,¿…ãhð‰Ôsž™àŽÎoÇ [T¼›ÏîÇ!;È#‘² œ³ÉdöžÁÇ"“Åvô7`¹!‰åŒâ[š\µUú°Üö¥»z)Ò߀å†$–£Ë•!À’¥²ÌB*òŽÌ)‹Ø &ùl'@ëÝé,Q®J–²X®¥çˆÓM€¹f·,ôÐN(b|Kç—­ù߀¿†$þâ*ÿÏ}“ñs¸hmlA¿Ù€¿¦¬/­å°M?d¸ÕéoÀ_SË ¹@ít»HÇwK:“I¼Ô¥\ùóõßB§]ªÓ߀¿¦$þâÈ<+8O/´Xb´?ò­;,ît,NÓi8›³¬FsÖžÛYÂB3±Jbeúð×üö®…·[ÿ•Ù-Òµ“ 3$´XÅVŽí+ËÍ(å¼ZµŽ•+Ù zÿý’3’CjÎZ²Ý»¶[W²©3|œïððûx°{iÓÿ¦‹ÿ0Ö÷ Ô“h1«.¾èåiaŸËÜÂœ½ÆïÜÜyu‹æö;öøËñ¹ìñÿÀ_ŽÄßÉÛÑItrôzò~0FæçãñÑO£ýá~ôêƒùp N'oÆÑ¿þ581×»•fË28Ü7ÿ|ˆ†ÿ<ON"óK!Ïà0GâðèÝñÁÈXmc<8œŒ†'»&Øß;8ݾÙ^N¢Ã£It0z7š˜_›íÖOçþY_ûæH>z½Ž÷Þ#¯F£É‡ºƒ_&‡¶s_›ÞDǃñd´wz0Gǧãã£3n>wƵˆþVCÞŒnwj>wÌت'€¼Û|´%Oñ¶ùÜcYÿUèè  Ï6Ÿ{Ìëmœù›ùCȲÍçŽÉÿ‹l¹ÛÓšÏ{¬®¾¾–²gó¹o(–¡Ö—JgÒV:ã$i;Èg0ˆ²3}þ{Sƒ½WÿŠdBúøƵà‡Æì>Nâó—÷å%1!@Š0-p¥aÒÖã<q=ÞÚÉz\µÓW¡KÏ 82â:²Ž³X’”æ…PI+UÆ,çUÆ2aÞ+E™´v¹×›åf0ÏžÕ™?h¯üDÓ"ÉSUé$‘‰äi•«<­’R²œ©¼´‰‡òlY…d¹bÐøᶴ×(à]‰ë]Ï̺Gw¡4ÎËŠE!bYêLRVU™NãœfB«ª,Hƒ-i lqžšöðÔ‡æyÜ4 \%40„íLTBÁ(¶dô @]J¨/ž½?ÈÄ£„ú‚Ú¾Æýˆ€2”P×Á#ãC@³IhÛacÛ^[K‰kpx´íðÖ.ôº6©^„,v@YH&Źùå sÝà}--@ HXÛ=ÞS,hüHK㇜ù€òŽ´•w¸FïԖáíÔX NR¨¬”Š ¦2-e¬˜ ÏTžS›™!e¢>I!V¨±­“”œR›˜M©¢b„hÍ$ÏDl¢Di‚ÞŽ ë-úæR¦=²L€,„ð6nýIÚƆ©éj >TEI‹8Ö©ù)­tZêD$ISIS‘IßpÖ•ÑëU^ößXHÛ{(d³.¤‡¬nrËVl^âJÔz뤮縓¶·P¨½ÿ4ª©ç1ÞÑ;®ÔÍôO{dÙú'I]׋=3´^ý˜—“ˆ¶?Eg[¬ÏöÎà”O"Ü}2‹Ê²Š1‘‡Ÿ%„PiL©® üë¸ÌŠ¬å¸¿#n¥v—pŠœ…§”7Ó¶•ñǧFûQ9@9%—À»Çó €½J„?‹7ÝÙÁ~€!—‡Cn0–)¾“áeL³ÙíbDðù0Àû$¢Øv¸©ºu§ÎX'*.Hô]?O6Çð‘€Ë—m— 8KyÛYb[<” Å ¸’4ë$ç!véeA¦aBV)5[óLçqÊIÉ5§Y™Õ–Y†ß¶vé²:¡yÊòJ(g´•æÛK‘—*c»t[ñÄG=Ÿë??.òÙç³iæìÚ‘Ý8»µ¿Få‚7èHz³.Š•þ½´‹£ôE‚¢/ÞeOp‰ÃaDõÅyöq>û²0ƒQ#^¼kßÉgg—ŸÎ¯ßÄYHÖ"ƒˆà+ í=¥câÕ»X»ý.E‘ ×ÚøÉ,<¿·>ÁÚÚíË©Ã’¼kkW7Ð8 (@}¤õñ1äo(@‹¤-ò±åo(Àœ¤sÙl7€P‡Ýx¯ù P$©C‘ÜJþ†\Iêp%qÍìHJÜPxm÷cxñ¾ö\u`±ˆ,|õêl€WI=¼ÊÞIe Ð&i/Údx®ŠIêåHþurU YRÍòaŸj0]Ïå$OÊ$×U& ÏsAŒf©.Kë&-ì×}öÃÑÑÉÁG[]÷ãx8ØÇwÄÏ¢ÿ+t_¢E®dÉ ÉJN˜T 4×”Ó«¾ùq$­zà²c ºRÑuõºÜb“Q ³R£¾z PG)qóú¾gŽvúå°xR<‹ÈËõ@tU.¸l®¹Ìçõ¿ûu,¸úìÕ𢾠»Rê;ªXŽ[kÛõ #—+Í•J̧$®bÆdg\I[—•P©ë‘[¼¼ži1’¥™HÍ?q¦”TqNµñÝU^æemïìòâóåÅÇbúiOÄR€lL=dã^3\~äÞ÷ãÑdˆF^€$M½$ésäØÛt {û& Õ)4ô|lêåcozÚ5õЮ½ý{ž+‡vÞÛ“Q]5yò‰_Á÷‘€/°9ôÿ~S öS‡Øÿ|kð}7øЀ­õhþíQPGDábÑÕ¹„…eý#¥Þ è)(ƒ#ë—¯@Üî] ÌbëÂ,´Wb(¶.†Zs`öcd'áë:b÷¼þ¿F@U'ÊüQŽÙBšK”ùâ dÛ@=$Ê}ÁÅ# žQ å.Vc»@4î9¥Á5  wQ X„pE( ø¢Žâ«åûzå«]å>oÞÞñà¿ píÜçÚ}nÿ€Ÿä¡˜ÊW4=o ØÚh?Ÿ[Dß-^"Ž÷EÒ14Y—¾¾}ðà°ˆ°l ô M6qT Ôg¡É=uVhò8Š£ïô§Ï/ëÿ{Ø ã>NlZ24YsÜ K3*!¬éJŠTL®MDY˜í3Û^iÆ-Zçö%»–Åv ±K ¥$œÑOò24y¤Œ~ Ô•¡I0’_hŠd€ø–zÄ·ý‘lÉ.Ú0”"\êˆp](«—nŠ]€ —:*Ü0Ä´4½'0ô·ÔÑß~³û?äÆÔ‘E³ºÛ4s4Î=\7 t¦ŽÐù±  ¦Žß%šyTÍȆ4ë¥g¾á¡ÜœsO0 p¦^s }§ÿÜØ fºFÁ|n¯ºÏ¯œÀ®V@/L½záþÀ ¨v©Wµ»èô¹t>÷+øÞÿ)( t¦^¥óW6À¤WÆF@kM=ZëÇÀ˜›:bî>Ýà¥#èF· ˆµ©#Öƶ à#«Æñ8«_Sé"ÏÃIÐ) ꦲ `Ø1ਥëƶ xNp"•€W‘·ÏÑ»JеÆM0ãÉEJÒ"V¤J‹2)ª\P]÷ƒ±l›t%%JAÌ÷ E‰ )WIFËŒåEÊót½½F‘û¿#ŽruÚ)Wo¿:LÞÈõp’ÓmKÉ) %§* FÔ߬[ýý@^èÁ™£l^¨Ä™«Ç5ÛÌ©x§}¦EX·Pè" x w3OÕ›ž•ÍžDv&›þíÙåÕ,7{ñ³ËöN<ššÿ¡gE7²1WÖ „ßÝ홧²Í&z-Ú@¯u{fÜ`Α7sEÞÝ+i³RxˆÅ™#Gx¿M\5{ó’â>÷Å1@nÎZrs\üÉ}9#—–2@,ÎHÀM¬SP†ˆ?%ÑÔÆ~š'ÒD Š4•²*;>g²ªãOfUiÛŠ?«RQ0QH­ãR&‚Ð,g‚©2%U™ûgÏVÂOlHÇy£A @ £¿Ú~lsQÖ×`Rry8´ZŒlß SbSÖùÅFË:÷òç€ Šµ«pxíï*«]¿,ûÌà2TQ»~õ´€Ë–âgý›|õ*«ÍMc Ÿa, ¶1ë$(#¢ÆÈ¢*a©ª¼"%I)5ø/T,‹Ú2Ërn#E¸WƉÎtl|Z•Ue4¡%:ÍKB)VZâƒ3Ÿ=ð±Òn\þ…8_(â*×IUD…H«L&$.’’l-Enœ£1 Ÿ.Œ=Ö4ìDmæµQ„L#0€ÌÍ2÷Ñk€ÅüfÍËÖ*ÌÝ* ˜¡:Ï>~ÒèŽ@˜¤P@g!|íî¦&4ßÎú¬º|a+ëÚ%ÚokPÇ™Coº³3Ã#ØJD)Ͳ8MJ•Ç¹,¨¦¹Îâ’ÅTªͤ¹¼˜žÕ è·C¨&xBæb¢:ã!ÛR€¤Î’:– a{°.2#³,éœyHçö¶œÏgó§p²à¼üÅL¢?¼ó*äà„$u–„`1@Jg)}í:œÍr}ѨíÙdóÌWYS}^D‹ =¿¨W” ânfú­0€ÂÎ »q˜Kš.ÊYÆDZq–ÙêŸ)§± ¬L¬T@ ª}®ù“¶=P/6ôÞÙ¡y¯_ 7 ¼5Å¢i³–Î:ÚÙ™¢ R3‘ÚöÁæ)£µj.fR”º4{wZqiF1Žµ"škž1žÙpó6á*êjœâU„6|ái^&ŠU2¯¯#¿Ú&üRÖ‰ˆëo@ûW€Ê(vío=Ýb&Fî4J&‚ÒÉljt2@-d" %HL`r¼/þ¾³Ái¯m@,d—ãõ%›ß•Ÿfó?#Ýl‚ÌœzQ”×ÿ±6_ÝÏ~€¾ÈZôÅÇ—£x’L†laú#“!G¤ªËR¦Â®±L‘{ÆÔ»ÆÝX,UÀ¨ ¦hñq¢^9k@AÕFA›Ejzõé¼®üðþ£‚†Ÿ7[í+Ÿµ_oX¾Ç"£QµóæÁ7Ÿ,ˆ}ÖfwU{ßÃæ^æ>6°®B` †21ôn[8€ÊZÔP\dÅn(6¼ nò8Ã8À¦äq†ñNÃJi6JJ³wÈÍD¬s’¥R'EQJ•ej{Œœ‚”櫸Jó"N²¸(e‹ É ÁcáeTó²VL…y½þÙx"hØŧÏȱØhœ„ÌR€ŒÆb'¨¬g“rëSº”6î©v‚ôYØžèÆ|Nò8(ÓÁ2ëŸé¶¬³îážW8Pƒ{ ` ‡{{õdÏÖ £Ü[lq!¬¹Œ&T+.’JW*æ%å¼àšÄÊIJ\ùª­ô 2vã@Õî©úaüÐ'É9PRƒ{JjØîî£qà@U ±³×1ÜäS.6ŧ䟕£ø¬˜«â¡•· ­¸F¯Õf™¢í¼ªçÓJ1jÉJMT–ØuEV\§¬ µeö¾Û{ÍUåqbElJ2RȨªœ‰’gyA‰,}Ÿ›Æ à?õ™¶L%¡ƒ#àþ^îÜß{—¾ò¦xÎË/«ªO·sçv`d³Œ¡(¡N¬8ïµäPî»éîßGCiàË”#/¾ù|ugbF×FÅ¥º”%göV& ‹ž³,—EA’6×&?›7K{ç(«Ü¡¬"c€‡Ê‹Ñ§•@cŸ@ü¥ûÔó€Œ!˜¡<„Ê;YUËTÅò*+5{Œ<'š¦‰]1Ïã\äµe‰çƒí¹¨’J‰¸JJ“’’¤²ï*5‹Ì«È¾Z4÷•ÄdÜa!›æ‰CÀºÃóÖ¶ÄÂÝÈFõ ÿÓÙåb‘X³twX(*H5×{C‚\]‹‡Ðµ8@×â=èZÈ1Ì-î¹EÔl³yL° ŸçRû ÷½š^(o<„òÆ«1¹çjLTÀY¯QüôÛ{‰æÊ  pÍž /£+gh'ö{_í¹þ2ºé`û|à_=b"£àFKî¹Ñrý¼è.¤äÞ )W¸•ÃåÃÜ`ɽ7XÞ˜Û{ì^Øs7&v^NL„81€NÈ=·2>z:øŠÜ¹ÛÇ€£ ¡,r€²È{ ±›¾ÚÃbüb7l@ÞfâXCß•L§Ê,eE‘’ŒŠŠ*)’ŠçÒü›ÔgkM‚òÞÉt”¤ÂÊ.UªKyi¬”EU±È³,UþÝì<×wÞÚÜuàáq‡‡×ãuû):Ä8{Üåìm/Ѻ•çvÊ€¡B`Ùq‡e‡;'=ÙqŽ;Ĺÿÿ½këqãÈÎzÖ¯ y´c©îŬ½É'ˆã‡` êÖÂÔp–䬬dóßSÕrHv OU±‡’а%7ÙÕ§OUëWçœP‰K¯”Ù€:jÚ1jÇ* v»3HjgPHº¦"ý¹gÎ à¼þÇøTn)½p.ž×|PÖ1ŠÄô£„À9Pý‘¯þx$:©|ïª tÄÒ’|PZrÃÜ'!¾tFŽ«>(Eù4œ>Ç)Õ (rÉQÃ-T¯äƒê•çÍNq F%?¨QYæÃp H%G x r9n‘ûG±`> 挊`¨wáÀítJR)äˆP¨“=e$S´êÑÔB%˜ÚaÍ<á©°·!¤À8²(‘0BgÏÓïOõU^Egå<¾ t|¥+Õñ*e=€¾ãdèx%3|Ý™äEzàË^Š&X*–loÁæq›ÇÅ _õï1#¥ãú¥©B#Às¼¥B#müÑV4èÑžõb…Ë :£T9Â9íòˆkûЧOXµi…;'ŠSÕ ë1åT‡à4ýáˆÌξ[^Ÿ,WR‰¡²0zÞóŠž÷'Pœ"ñŲ h?Ïíç‹Å>yZ™¤åÖgzÕos›c[ý¬n-éÆH·Ézøª¤ €o||+a³ü6àcœµè°ÅYC¬‹-U }ô§h¨£V2B¢œÒŒcŒ½'’Ҕ쌔¥úZgwQ”Ñ”1AXgi4œ™2É2#”6ËZ>¿EXox øÿ:²Õü¶ ¿ÊÚ[|P{«pX@E P%òv-Oj.€šâ™²Uk6ÖHGãÄ3-–7ÒqýZ/¿XLFñL‹åÈŸ/|t›È+>@^ŠtCÅEÃÑaà™øÏTˆQJ UpC¥Üd›h(FË-îÆQt@IÒ”2Õ))HG˜ë¬ <*%4ÎQlpOY‚ÝÓ‡zãD”V6င$gáQz…Ò74}ú„èÞ‚>áú„· Oø©èceŠ˜bÍh¼ˆ:…:ìˆ Æpn´E=e9ôÉh!Œ­Å3½‘Žë„—ÖÇeo¢`ÏŠ¿8·×`Mø˜5Ÿ¾:I ÀTxLeœê'ò€ªpÝdhX®[ -yÂuƒ¡%Ž¦8 äu¥Áh-¤DRFXª—õŽ&6Q&ÐZ¸³'I”PÌGŠ,s$P:8°–a¹ZÌ?ŸUD q*†Ýˆ=nƈŠÔéAÞgÏ}/$渽 ÐÐyjP!ȨÅX@FV´ddPâH´”8§¦y©eÑ%J0)s˜ÕIÄq`siEOYUš·¨˜ðv¡°DÎjeçñ¯2xb¢ÃG„–2¯4Â_îÌlLêyÒ¼HóŠæ4ï‹4ï:Ûÿ§Ç×m®—SyÜ™ pZ3²«Œã†‰ Ã#åÁœÂ“ŒH"‹A¹TòÙcA}sd§mâ„ÆtÄ® ²NRm©¢.Zh2p¯´´4|Ød3<úY¼Ë¸ Æ?àWºÄ­Nr§àJ—X±Ül€–ä¼JÀ’éÑ£Šgxìظ Ì2 ë'ôpÅúd q¡ ‡áüB£è](Zz ˆuÚTñÅ.ÿqÕó·¿WR›Jw.”m.£X¼o) è …@Ù°€b ­µ>JUÞQ\O" ¥˜‡€,‚¶H9j"hC1qjú^†ø2Zwœ .zÕ¢³ˆ….µ+q¬‡KŠ\ú~,;:¨DƒPÂzj;‰±”Ñ®L)k£Ç³dã‡ÅtõùÊ]÷ËÉujw\Èm`¹gÚuð:•Ûþ&ÖaÇwÆÝQÙIãœÄT˜RL Ú›1…o ì­Lû­‘Þ6üzÜ*ø«{5¿[ÝÞE/{úqYJ7°{³mºF§{zSK6 2p„' ûÖ,"E«°X»`ÄA•q«Ö‰P "ƒZØûén¯Åß'ùÒ·VŒ{),—ÛúUmIHˆî“bQ¦jk9fÁŒ…Dהŧ êä\ÌÉÖ')kR¸)Ô…ÈT®?i”>0Ý2gàÏiâ l1ôòëHª–\ØCdªÄÔQ´#”Êå ½²EcÆ6»¢2"ST¦ÐDÊÈÑbMcD¦`ÌWP)CÕhÄ M!*3B¶x¶@õ1¨þ2¶ËToÕ[JyH¥–Ê-¨Ü"dCrS¨cï_à29Ú1n:¬RF`gˆæØ3ÚqÚ)‰ºž2EŸ.©d袒ÕQ§G‹-£Ò«À­×]§ Ë‚r–auµ1ÿOv–¾€ËR,ö°UË:TÀ:Tçì}e€š¯²cDñÛ*SÚd¹˜thÀúU|LÓ0^éòl5ô, ¥¾ õu 0t£Áp—ÆÅ-ª@| Ý€<’Jè†Jòh]‰’h$g©I2ö©–•*x„±pÊ$ˆµ%=–Z¢Œj}ÚTÄ;"±WØJ’þ§ã6R…â*d˜9šˆMgÑ]9_hRU/d¦êEñçëU÷¨›!Qƒ…(ü”â§N(§<¿ý|–²åýx$ô’C Wûû¯7JðU‡|$€þ’ô× ·.¤ð¸f”hÄΫ…Y^Ò@Ää°^É毬¹-L™lÁ”I mž¬h›·o¥÷{´ÒŽ•@ï8 œøP9}¹AyQŸÈnÔ|v\òÍ@´å°J[¡æ›–¨<Þ¤ò(´ö³,X¼Eé-\S ôpG=CÎwNf0åV*Î:Åq\É(О2™é þ¨H¯„uži„ƒ³Ö!«¬cØ,œ „CBÈé¬aueV«ÅÔÞ­ÂòŒiN ÈŽ”y¿ñø§(Åñª$Ã)¨’¸ã‘¥ÌÅ™ÕJE‹†j¡5“QˆGe²‡f-BK TùØÙ(/ž0Á‘\³š/ !Á¨0$UÎ+Ü¥‹«³Á,  U ̼œÜÙÜ™Y ¹€jU-¨ôBrÍba>_M‹«‘H‘'Õ¡B-"¤gÙ>6|²NVüüã÷?üá?þð}¡À}²Ü÷8}Û3i¥Ðñ¸_}Û­ÒL` {uôm÷F3}€11@¿Uз٠ëÔH ÒT‹U Üäáö¤^€‹“:ãEÁ™Yé„H´Ž¨ÕF[ýtOÇ\IÊ —ŒÍòO6IÕ'+{ö ÙŒP,¥Ð(ƒÂj5ÔÔ@¥4©ë°lûÄÔš@59hXCL­â ³ÉLKÀBb¶j½TÀR_óU{?Ý=fùó­7«Pu¦Rþä Ãßdò*g-|4¿¾Øÿâ2g[³晎¯rF†¬‡­3ɘ…T) CŸBCçáUÎ4ØPõ°‡&C¢˜ªãZA Zü­©ª6Ó$c>Su\.«Ag¾HUÎ è©Ú|q¹þ¦i«) [Ÿtëû*i @$«"¹,8¤È¯B-­Œ€ùUp³¹ÕÊ]L¦~c¤\%¶^™äökJ81)ЙN#úvÊ#ݧÙöÆHõ¤å p¬=ƒg“S\ÓºÿÜt)š îy±wåv²ùëËü@]$×¾ÿ>tÓ›iúÙÛïÞØ>ð´ûWËùÝÂ…õ‹ÌâªKiãÍÀ¯Ý[Ü牷´BÜÕ÷ÜÅ.Ú|VSå1Š*¨¦²ãB eB2¹»-ï Ž•‰_Ý.¢Op-¿e-§ïñ‡?þé‡É«.Û—¹_Þ½Kߤ·XÆ+ýŸ'ÌŠ>˜„Sàuï¹ij¸j˜+¹T¶ã r¯¢áŽ`Ɖš™ÇòkŒ?>%9çÇÙLÍ|>&³i: |ÈlšŽÿV3.t^ÎìSŠ¦×¯ÿxã‹ÜD¬ÛŽe÷AßßkÄyè{ÃÎö—[É<`q?<ú¤Zê S¥9“ĺÎK»‚y؆’á±v™óöm´uóO€ŠÂf²ýa+Õ@l¤#[a~ý#ÙÀ<§ ÓšGgZ`Ô!1²L+Ó±¸Ç•©a<Ö€yn>»ûxSÆ¿íoGd¡:`a‹Ð…S9år`œ´PµDØ"+ÖŠ0Mš㶹¶ã5m.í¸,›K;þBik—(\úôà¡pÙ¦óê&7,}:ëo ŠKL¬£2Šf»àªlx¬ ãÓ5Ì¥^ʧ;‹ì›Qõ+ÉéWÒ¢_áö¬oo•pª-‡y\ÙŽªRˆb R7e«´œQ-× ðX­°Ÿ«ÃîÏÇÓ é(Ù®nÀ´‘ð9–rFÂcí3rsBæ8ÿÖ¿Q¥ò•Ê›L:Ĥ¢ÂJÿEVk¥‘#&¾hç‚+Q©;&4Ö`ýí”+Z€{¿‘•ú€•ºAŠÂçèË¥èigòO¤ë‘ã$-çQM D3¦ªÛ™€êå3q Ú½Ú’†§žÈx`»+~ÃlVµì7@j;Je\ñŸÔB Dˆé„¢Ñô² Õ\„ÇÚÝ5Ùl·€½ö75Föƒ„„µXo®#ñ„æÖŠbŒíºhìf'XUyEðXÃÕ™cH4Î 6;ꢧg…Ñge³èáSÓå‹þ”ØÇfþ¾3Ä¿‰Jgaw–vºÐÀf¸9F9›[mT°¸¿gÀ^<”/dL^3Ê÷yÍh…%ø°¤‘R„8/µÇ¢ÓQ—¼·h8"—ª–48ÖþÒôwp(Æû›Ê¤xš¨Yøk˜Èöhö²}é-*ü¿­ðfÔR)‚GÖ& FRiÀáØHR|¨ Ž5ºÍl6wcˆïõH/F qhœ qèŠLš¤+ÅkÛ‰¨Ì,0&.ŠÚ)GP‰À–tc¥€c%îÜ­¦³>Üw»ˆ\\Æ7(“&ÃûNài|ÿÃØE*Íž‘B¸%P7d®°7Ú›;W×ñ¾3…‡$Ï„‡d‹{îQç ï¼WFz)ºÈ'Œ<Ñ6#Aº¡¼uÏá±öÝóŠu»óÓrqà”W¤¬âpë3ðRT÷§7Õ²'°NÎtŽÒÛ’$F#’-½®pX¾'À±†«Øx üÈžˆ÷å÷ÄìÐjÙ8¢§˜.òk&nwJ“©ØI™vZI¡=U˜E{/²‘RÚycDQ {c¾ÀceÊ«¥›ßΦ¶ÍÝÜÝè–®mœõH7«ë¨½ÓľêÌ/!åŒFu^:p^EÅ´aYº??]õ8£ ^H ÃµˆÔÀظ~«šP;`#Ý ÔÎiMyë•äúÞó(J2ŠRÔıìh°zd…}J%ÊSÍè~ óÄyÂx–Ý¢Á£ (ÀS=Ô¬ùcéøCò«ËÆ£.œD]xKø\uÒpâuÔYâeg$3,Z‰AÛªD<Ö£¨Áu´êNܨ\¡ñZQ‰£êÖ!NQgv&Ö-;îT¾3OïµT®Ü¿ûøÖÜ6Óé[í_:hB4ør§Ðà»#nS΂£ñBÃ6…{t—oÓ“ú}WÌêÃyw¯Cä¼Qãu0]j¾2}o¾~4n1_69— ("ZhLãLé`•ï:¤³Vè*Û+Wè&ê³QŒ›~¤/8õ,QdMEG± ´CNÅíB¢Ïˆs•×¾D²n#ŠðXÛÈ`l_YϽ`âæ–=eç®ÍbòêU´öÇŒ.â$Ú¸IªÁÝ*Œ; U[››Ï è{> šªQÑbœîøã½-t’ÎqÖï®õ¿76FAJT`4 PœSÄ™£6î,Ëüï͵7ÕµnàÌ8Os>I‰}O!]¨¬tµHv¿Zz™Ð¢üÆÖb‚™Ç>ú†,X'¼´>ºå¦³eq½íÙp¬L@dS‹¤,ÎGÍ)5^£Ô*ÐûºNƒHY‹ý öÆ®°_Çé³]kÉuR²bÿksN†º$‡m5Øæ‡8(7ÖD—?tëÎçCá&„ɲ³¡Û8(8V—?Ò!¹ÛÝSr½õ´—ô5åÍ2¾ ­±¤ðF Â=Jƒï%ÕA\{ûö¾`H±*ìßÈÉ\<p>"ÚM;Œãüs§µï(ÆÆPŬDÚcebEȘ‡ä4V.q]ŽÙÞxös)˜eŒÑx±å\JªW«%Ôㄆv®3Xxm=2Á×eUá±2â½™ó8iÃúq Iƒ)@*ƒîUàÞ{üA9º`Ÿ{§y$;@Ôh£8D4ºƒqª©$S‘k 3ÌRfY•Wµ/Ú*ѺÝ?¤=žö¸T ’iÀÜj¸ÖF¹æÇÊhžM)Çù½\-î\ƤK û›GÔCyõP“8‹wWˆÃS ak_n;ù‹÷ž%­Ù—i?~Û²êU ׊k$ÖRHM°Ä‚imPK¬ ~¼a8<Öc‰«r^_CÑ ’Kf‘\2ký?ß|ûí¤[˜©|ÖäÛoßï\vóèoݬ–éòóþÊre«IŠÑ š$ÐËú«ëņìõWoâ¬x¿ËåÁï¿[&àêûçÿnR7DfÞLþ%þûÏw³ ‘‚0Ÿ`ú–‰·\Å'-&ÿzn~róÛ‰ý<Ùög]sàzµº}ûæͧOŸ^ûù¯Ÿ?„›×óŇ7Ó~½×“Ï¿›~üp@Äd¹pï.6wÜÞ|¸˜˜Ùj{%Rÿ™ÿ!LþÜEI°.nõOaö×°š:sq™.&ô˙±a–ýÝö›íÿëïãÈéüQÑÈËksÞEûk¾ðý?Æ;ñäÏý¸ïöH¾¼Ó׫wè5¹ü4õ«ëø7véæ³ùâÝ…÷ËÅejÃ2»¿ôa>K¯-WŸgñqé«à/&‰€½»¶Ï%“oßoðÓô}?èý½Yü2_¸ë©§ƒ·X?Á›åu|Âå=ñɶ ‹Î¸p1¹ÌñbçÁ»/üp[í+ºž®Âà/þ÷?½»ø»Þ¼9_™ŒóÊÉàƒÞÌæãÏüßß¾?í3”ÿìõGÏG} ÿÓ!ÙCù/ýùŽÐI£™p*šÉEÃ2%kôÿ±÷¬½qãH~ϯÐô~XgÛ¢Þò&f“ÝÙ¹ÁL‚ p8EÙš´[½’ÚŽïpÿýªHQ¢ÔÝn©ßöºtÜzÉ*²Þ,ú!M¼8Ý¿—Ïn?­õ/T«1¡ Q°6_ÿÄöí®þçù¦ù²þ÷ñyûÇÿxÇ2Hoã×/ýôñ½1:=?ÿOûýùù‡ÏŒ¯ÿøüÏO`™ÆçœN aÒñùùß~º!vo ìóoçßÁ—«?OKíͳ¸ŒÑ< ~¿OŠw À0 åÛâYNcøï–—`³§ü_³ôîÝè½4TO?cY}e¶‚ B_¾üL¿)xùîËçŸOaàÍùzúå§Ó÷Ùí,çh¬Ãùø·waóŽÔ®¥ýšåÚs¤ý(íFñB™–c~©,Ø ãïBËþ$–ÖÛsy÷ÕÛq:ùVY´%Š3V#LCx7Ú h2” gVcÂ|ÁòtZêwþ wT^­¬Ü?þ5ãùÃÙ˜ÞçòN¿ã‡IÁҪ辭õWѽºlú"beA£ËAe6I¯CœiP°ÛìŽåMZðÐ#-Ý YÁcôTMÿ ]5Ä)Í9ÅùØsƒññ¸˜R–N®ßÌ‘ø=[¾ú}ùÊx[ÊÞÀ¹RŒ¥Z}a¸Þôû_ð!¸«›Õë§cžÀ#æ™Ëoå3FÝ‘ižýø“>*5ð ý¼%ýÁÙm„ó,A‡+fcœðUY¨ÛROfˆÙ¼¥§· ±«P·0Þ[.<à>o Äsõ}nDÙw^¨6i„F· ÞPaë¹åtÿ+m4^ýdÈ8¾ù€a(`,BC*ÿG-l ìßߤì¦1'ÕvÄ™!m¨ :Bª5DH .ähQ€– Ë9ƒ¦«uÚZ £s&Æl²°qÿ^!$P£¥@|MD£UÖ—˜%J±/„¥U€=69%¨ÆYY«ai‚N’8ãRMNàv®"m1å,MRÑM"ÍSÞ G˜©Õ„ 9è0Œü‘Ò̪·kÑ–#˜3:Nÿn-Ò]k»%âå=-¾¼Ï_ï`[4Dƒ‡Ú­àlZ¨Ý,€„Zôúœ¢Ðyy:ËÁ\5dd±0_‰%|T’z˜Û’ךN4‘ufÔˆÆD”RY3ˆò; zuNŠ×ð;Ïf×7Úr™fé¤óY®æ@’›îÑüêôþ#Û½oæéh£d§“BRŠNbÑ|GýÆYF‹ê±231ɳÛUc¬Áh‡è¡­~Ó4Ù™žÇ“™>³Ì¤vügœEt\\%ÀW®Ê­E€VÄ,k.þã[öKþÏ^>/ñŸ=ÅäÒz ý¼„~^B?O&ôS»)fy.[ÍáÛjáÛˆðÅ=‘cü$ª÷ ]¥´ ÖlÚpQo~7˜ÐpÚ8ƒ ‚ïõ™Z ²ºC1OÖC’ÓB’½’š‘ýI¬Ä+ªúF‡ŒLh€‘'Rp¢ÁpZýa  'ÖáÄ N<×á(áe/ÎÔ‚s­Ã¹Vp®ÃIu8©‚“†3ÖáÔsò‘u²ÎD‡3Qp&ƒáLu8Sg:N®ÃÉœ|0œB‡S(8k±ÿ–R·Tpa¼KàÌt83g6ÎçNÁ¹ÛBš‚–3 Ì+PÍmìFõØî7¨#Wkð-<ãô@xX90›ÕÄWõX^¿º0X|¬Ÿ/îufXHBâø¶s?HðôƒÐbŽÉÛ7È[Þ@ÏDµýWo–ƒ´ÔÖGÊîØ~Hüس<7áIø–žˉï4 EùWEƒØ‰üèT{x ±ãrÆ,'pY»vB¸;±ÐÄ çÚ{d +,ð}‡ú¾Ãn‰Óèì8ñÍ8t¼¤‹•ÅCãz‘E&a4qnцbÚ<²]7¡H²|‹SËO\Ëg¦ãFÌöó|ê8! Iâ~dG;õ"CìáA°Æ™kú®ãz0—¼0 ½ˆD![ƒ ‰“'q,fÚŽÚxÂ’LøÑ éꩤ$^lFÜ‹;d$ñYsy®Ÿ0ק4\g5$d¶˜6ñ“€$Và8vèq“8Ahò~d¨÷©ôG`ΣÐçÔF§k¹uM× `r¯3ŽÞ ‡:m£×š°uÔµCÓãijCj1Ÿ…4^âÅk ¢?ÈÇQÈMª½V…’€š‘ëzfà1<Ï¢±Ï;°˜íS{UË7ð|›…~âÑ„ÀŠ Œ1,‡x{¿UQˆÝù½Æàxnd'Q|„Y‰çqn[Že‚´€ÎÐO0œÁ&Ž Ü”×sbæG‰øXEÂ81Í8X2†ÿõ¿ëÎÚ§ñ™ßÿeÃþ/×÷_üÿûøP—„¡xžc‚¦å‘ˆ0´Ûö@IìC÷ïå³ÛÏÜú÷ü-îü’ŸG×?!6±Îúmü%þ·—ÏKüo?ñ¿¢ üº8czçßxÂs>aü% ø| ¾" ¸µ >žS`«7õ€à‚ø-®<ÁÚ=>æ·£ËEÆxœæW‘•Ø6óIìPêrŸ&ŽE £I—&$ªº+ëbÕT½Ûh'^1»½¥ùò…£?¡³ýô–㊅E¡Eée—¶-àìç[.&ÖÝÛ‡¹íÂy­b„£Ë¿g˜«)òDÅej±Ü;‡L'Ó™Då´á¥²9ô˜³±ØDXæú0a@H`–,C¾;y7Â*¢7–zæ:ÏfS…ì·J¸¶Q*)^o¬KÁÿ$÷Ó„7Ò’ß^ÐÐs]›ÅI`Å¡ë„ŽÃüÈ1Èwbûx šèRýÖGxë°oôV¤×ÐÉùýȸ«~ „•ß*~-ZŸƒð[û¥(+ËlÉ4ÖTì?õè-ú¿ª9ÑI5ZÕæ–¶(7wBHäZÏ,6©j¶åÃÊI"b[Ql™íVd Õ¯vÙÔE˜/8&q‚64÷¿«WG­9¢cz)™‹ÇE†QB?4š<³/0 eÇEçÕ½Õ)°2¯¦íP|oB[ËåÜgĵ ¹ï8èhõ¹é›¶ë¹N@×¢­<…e'Ô]Ý_ñE]jÒ89,M‡âyšš6KŸ0“y‘ùn`‡ $Ž˜ 2À?®õºº·-´7=ž;á›×u8·Ë£4rð€qŸ{¥zW”&»²©­Õsd(Ý6büqX:fàøÔv\ÌÀ4æF6uh”£cü+ûÛ2€¡#=gIèš,ŠXx÷L'0‰Clâûžkr†œKÀb±7ª‚ø5P¬ÅøFž0ŸYx*²9nl90+cbz̶a&™¦ýÌmëÕ£o±” £Ób&Kµ5.“¾Œ}(ª7bìA…±å9!õ|?qYDÁ$Ì¢`ÎÇæzÚÚ2t:Žr=;‘›&‹9ŒÓŽ8e1.LÕfnâVgÕ©ø;$ìêñ·BYªG}-í¡èÝÈÒæžg^ÄvbÚ6a¶ÏÝÄñ£¡|çy¯ÐÕ£×û¡Ê6éËs @Óï2t8‰®ú[ßñÞ›Æun̒賊0ª¢MÕÙŠ7–ˆöW¯è[ÛúèŒb€“¯æ×hî*Ö/ÊšTŽnˆ]æUwñ~ÞüéHÝgë“Ê4\%é/^ž,¸¨ ‰Ú<˜ºµó¹ûHûÕ9oüV%F¼=‡¿ßtS%C­Dù?Œ.!£.æÌŒõ"ƱèÕUcYØõ×KÇ3ÿ†Þ@'k¬3/ãŒÉÚÐÝ©”Tëå¬JQËîaI)–MT='ùšª1§²[Táçq G˜ð——¿ÖE¡ W%\ŠeÚ¾,Ôó¯’ºøŽSX×ÿ•NÞd³ò¿»R£H=­*\}nzYÕÖšå¢UÍMVµ¸ºµabð¤áHk³¦”HŠÅÆ2¹§9%Р¥Å—›IÝsHMۇŠ_‚Í0zÑóu-Y ß–E¿±CuÒR1 # ÚÏÛ ¨PXîXl9ZxµêâBá½é¥žFµŒÇ÷pöŽÇïÄžó¹>'©Q/»åÜr[LRân›Œfé%LêœÁš{#+±àœ#ãDÔ…¬jýåââk\›t2Ïš°øá]ca¿¢)§·G»1sEÖ'ðÕãicªÓ+$ʱý&þn†MJj´R‡¹ÇØìvø©¦|œŸZ½(²©8êÑ2fm¸";}tkõv•—ƒñª Äã£uçζìŠíÈSz{AñÈK¥1Z.€ô(Úæ)àšK¬g oˆLë‘ÇwDv fBn"‚dFÆP¡köàvƱIϧh«ˆé£ÄîEG ‹¬=Y¢ºÊ–¯d¬¡ÔäÔÉÊ“ž Ð×%s?‘Ù~ÓLß}€b°9^‰–sY“¿¢Ï÷7<çU½Ý$ËoeàP!`\—¸‘¥¸·h÷¬Rd™ãU½Ø•%DH8º„¯ƒKn3è¤ VÕ`†²úÞïgl¾h¡ƒM$È\ÚøPÏ­}È˸ž²=Œ ¿_¬‹ëP4ŽngÐÆÒ0Nð™\Ís¹“(-j¿OU%˜(ëã‡ca‹:bt ¤hœ­rmÇTùi Mªšòعl2–¾ÔÔo׆qlÐøáëàœp… sLƇ庚ñQU*ʱ{$Žcc4g.ÝãÉû‡È‹¢h°ž¬Ž/§á2q'ù­8)…ãQâô‰ûlžËÊ#V„¼¬'•IpzŸüõ#¡cŸœjb±ª.:Ø›æ]oZ Òá¼i=R„'°eÆ_KfcÒõ“Ù/‰G!xÅ\Zâ›ÅKÀ0»S`thÀ@9*}~1ÿ^ùSJoŒ®LA©+”Ãsã¶+KÑ`‚¯7YÚG¬ô؆vDAܼ÷œ„Ê=vuËl¼)W§ðzˆr](ËD ßÆ-Ó’¶yÕ1Ø&ý\þðNJÁý`¸{rõ[!h¥ðµoÞ³oå›8šò-Ëâ‡ßÒãá½€t;‚>%uؤØ4/NÏYÃ0çbë}zåÙsŒßR;SX6½š6.»!@,´€ˆ*ëCØ„tˆ?Çitx§GVö3#©üöýÇdýÁÍœöÞÂ^=orþŸ¬qS“}™pV,¥ia›?7ùsýd•†áwc$‰ýõë¨RË¿~5®ñ0gŸKxšg1Í¡c¯Ú¼(k¶'²t+ÂÌr¬pî³ü›qŸ–72LjçXô‹ãÍ\œ£ª ÔîúP­–ª¿4ZŽ¨|-"ªV…½Cœ²¡KìÉ¥"’ƒÃ'O>™È¨ššsFKñâ1_×Æf5Œ…¨[O[«ú¹?·xÓßeB–å\ß(ôÔúý•ç¼˜f“¸ ­-Üù¥íÀ!¸(e¿— ¸¸ È„÷°ßL,øÚ3ãu8B­îD\wÇ™ØC7·r 8A§Ps¿ü“Åá‚nØf8˜Çòúug[;ûˆÝ-ÍÔò_ã×$ì”[ÛWZÎÏ.;˜cs×¼¼ŠyBgãò*ç×)´û0\4ô¨àz|¢akÞm9sžˆT¨:Ûˆ„ÏíâUT†L«@©P‘e¸tùÆ.‘SÈK”xÞ Ç Â>ª¦ÖЙq°‹@ùŸàTJf4{´+ÓjEÃk *t&Vù°(vŠ]¬º Ýǧ»Þ¦¤l¾žyÐti"ÿ!$˜Ø‰±d‹ÏÐüÎ2mOå P+´ó]H^{ÞVŸzpDT!n_<¨GáA}ŠŽH9¶¸Áy^¯ÝÍ*Ÿ³>G\úâŽÑuøsã6Ô\†r¿Ç>÷9ßßdÅ0¯å®|uÄe¾î¬{ÔÙ\”‡h¢¼WnÎ ¾Ù2(7gx²Ïy×ã‘gl¾ Žp@ñ¹GÛGŒtY²=Þ,mS–é#Š“ë<<¼¡p;?h²š™ãQ½bW`U-7YÇäI[Ž­fW¸VöóeB7œ” .÷×m=qdI%,GŠ8—dݲ ‡»±àëðŒÿuÿq~êÏñS3¬øé¬Là·tzéäÛ€¹‚9Žõ\‹õDÊZ™¬Ã¤ÁÒ$ÔAÛÐV—/?ªmhbgÉ.w lX8þ‰ìh\¹ó¹•‡Ç+ãzPúû/_>}:î{›Nôµ&Ľ”%Kï½Å`ÂahÀä¿M²{9"ÀÜÎøú|b{óÛÎBAÈ›àk'ÜýHUïÀB}'rÑ«KÛÝÉ°• sÉŒ^X»aã⾸ë<-®Ø gßÖp_úÕ›Æt‚n+Œg»÷'î·<\o“èÛœOœ8Ò'~qÑrîdWlºFå°NŸÀÝ?óˆ{Ù‚¸ž±u'¢2ü”Qþ6N¤Üäñ¼ó°mo>-íb“š…ƒƒ*µí-<Š<ÎýÔ9Ü ¾nJ>šð×ߊtTR…´"i £kòãÝÆ(×ÑeæÓþˆ=·‘²'¨Ý‡=oÁëk¸GWŸ™ýŒÝ£Å¦þÑê€ò¡’Lh¾w9Ör‘Î[Ã+\¤5gÝ–O´Ë|?‹”u@Œjª¸ÉfãX–t¬ºhqœe;¹\H%iÄ`O”w ù7¾Ê¡SûìC\”1>‰ôZïBã¨ÅÓXØþÕˆ§Y!…BÕŸV§ç° ÂOœveÐÁa¿”X:¤Û`UÕ—jŠj¢½5ÌÚ-,J²,,úe Ö$îzrw töïS®\ø:¸"°fZä¼*@HKxÔ£|\zÁ¹K;.Ö@ܹÒmk¦Tm[Å°ÜŽ¿Êõ.%ѧ§Ê*ŒÓS¸ŽWŠ’æX$éÿÙ» 7Š3-Û€u†ÆœÛ2Åáµ´ÒÌèi{kµ²W°/$­íÅvÖ#Íì®°¤Òh½KdcL\Ž œsç._ C®x‡ã.æ ø¸\ |p„8„ 8áH€ëîFZ­ºg,Ö\ÕÎÖHÚž™îïïþûÿúÿg¦[B]1‹~ãCÃÚ*wÊ!«’¾ äÄ|¾ê@ëŠ/ÃÙ„ç‘Žÿ?Ý®éí^=wÎ|ÔWç†;Ú#ðûKp?sÖIðógw.(¯sÂíØè´ÿ}ù^tÅã÷ü)zJ¢çúÑ•àK³Nøë“N¼É2mïØY[ѱp¨»ý®¶M;Ž›8S›Á­¢ÿÃáó€_ðùÜ å¼>§n~~pó²<+¸Ý>–ÄlsZp(ƒÔÿ.§®ÿs'Ëx\î©þ?›Spñ ÁÇù™8ïós¼àd=¬Àƒƒ~åøãojû|·Šþ=—~¨Ü2ê÷ëtsUü»?;Õÿ'c[±¨½'ëï ÔÜ ·¯­3V»Ã±– :í±v°®#ÖÕ GýNËñ%ÎÁ§ŽP·è}-v3bÇ(Ê‹A«?í²îÊfA‚ M§2ù–Ù0~¿_¹Ÿ ½3ø•eèäÀsíâe…äH‹5¨NýCË’gÖbEÑ:åâå(ˆ™å–¾Ø*»û0ã2Ygï ؃R: ýÝxJŸO8Ôâ/_ƒØ«úÖŒ²ì¸z^»â")®¾@NÊ)±µä¤-CÙæaÅ= ¬RFħÌY‘Jf6«ž›ÌÇó͉|Þ  ÷ÝbÍËc)1?,Š² \ €ÊÈ'rɬ¬?r)?Â+©ª7wée17Ö|) ²9”#t c5•¯¾Z‡·ä,RAØT[RõQd…êe)kU¼kAÂ3çÄ´4"*Gx’ ½w—Dn³”WÂ"jÑ‹W[ËÕ)}y¤4jìPL¡ÅáÐËo±:­øÿ,ôYÕÿ[瀲‚…*¤ˆÂšË€Û“]nUB‘Bé z¹=%ÂSœÍn1­œ4 Ùœt)¬?%ÜXRt†ê«£åê+NÄO Y[Íþf'¬lxXÉP ?€R_ ¯’¯]*Wâ(¬,n¯‹F åð¬Á ¥Åçèðgø‘œ´…±–bH3K×BJ—ŠâÕåÛ"©d«†ÐÇ°¼­]|2£Èßˉª”(¦°Â/¬•ŽáyN*2êÖ’i2á3P£Ôy´ó2¯€‰j«€Lœ[IâD!—ƒ]ÞZÎE<+Ñ¡î];«ŽBJùª­ZYßlE}³+¼6EÆNxM] ¥¤8ŸªÌeµ’F#‘^;´§Ãš@0ÿOF×è*CO&Ö¾'†œÁåJÀ1Û‹q1át;ý>›pù„¸/Îr*\u2$ ¡‘"H~Z´ãZö%éLJ¡9+Û%µ8¥CZµV¯HÆv«ê¦£š†™CÉ»\ÍZQÊåÕe•B”V|kTîu©b¬–J· àà¯Ö¦Â·Ð=¨8ÍXP]®ƒ9~(­(¿.Ý0ÀÕªÐc Gt”;«Š•Ó—‘¬­HkU—J·˺S'S–)[‘)VNý©jäÞÚêhZj?Ö­©Ië TØ9v®²BjâƵ© ÔÞ´xpg2žãscœ†³0†ÝEÀî¢Ç>éõî&`ws½ÃMÛÕÛŒÂö`{¾ÀUî%`÷S•¯Â‹\ˆ¹<¾ÍÏ0§ÛÁ:gCêÝGÀîû×»Ÿ€ÝOÝP‰Œ³~‰Œ“¦¶ŒI †¡)²©‘›1ücX*ü ìWFu+Ø¡yðã)y|‡0+¥Æ†E!ǧ ×K)üàˆÌ§6Ãï!MýˆÕ~1Tc¨ø ãwà~:*÷qéÚè³h«Á ~±1TÄÖd>úÛp,ø äÆP‘Ä_ܶm[q›ò©ßk¥ë>PŠ Ç€Ÿ@p Á!ü`5(‹ þj{'À¿[ðA%MÝ[JŸAPÜ€ÐW´€Aü’chHNÁÅTH*Nî©V¾6~$ã†ÅUÃÏ(“¥¢LŒ?€q¦Tœ2Ü %¬™Úø‘¬E,€N… â'ð/KÇ¿@Ñ–L^‘AÁ*Tà‡ ŒT `?YJþ…8:0š1Ö_ Ö+ ¦kø•ƒ~oz â'ð/KÇ¿OXCVÂtXn¯þ¬À ~ÿ²´ü[±q8iñW`?YZþ-‚yüz â'ð/KË¿EøQlŸú½©FzEšCÑš M% â'ð/KÍ¿ ³ŠÞgà…{¥"È‚¢]±õI¸ÇA1W<þ„}ÝQ2; ‘ÇOà_––Ï[Ìù—C'Qù®üo¢o#×Ôù¯Ì}j²–j°.\ÎÒryÃ6cø9—s”\”²cÊ3ôç—À€Óú2IáÇ@/ŸKæíÑ‚}[ìá…»#á@C𸜣åòãUÿ.ç(¹ü|ÎS y´EÛA*™3yqÉ$à'p9GÉåQ@“ß&ãå~¨#<ÓPžã8)žÌðÊÊ‘é¼M]þ!‡¿¥‚l?Ë9J.OKBr0™À÷lÊ´lhB Ý¥Ì椑¤€^³Vßq”R)i‹ú¤Tær3‡ŸÀå%—#ÄiQ^vÌêo?Ë9j_ºQ›Aü.ç(¹œi®êxm5U÷’[§Ç“ö–^±âãèÑ‚„fw3’ {½Í(~—s´\”[n¥¿tz:n¥ÒC9aÉ´˜k>æú'ð/GÉ¿ìøú‡õ¬³7¥ú‡Y($ÄšM`¿‹À¿.Z_h `¦JïÉÇOà_=ÿVÞÃ…hжãÕ}@š—Å\’Oå˶|ëW×hÍÆñø×EÉ¿œòf"ʸôö"_€´„°ágÐÊGyå];1#H9Èn(¼“Ò’Œ^¹Gj%ç ã'ð¯‹Ö—†õ«xÄ/“*o€Jƒò^¥1l>+&Í¡ñæÁeªËç•0ˆŸÀ¿.úXöq±ÿ.ÿº(ù7ÖŽ‚hϪØÚ@$àïÞHÏšp{¨´õÃ!è‹uôDÀ¦M(<Œ½Åe t·Ã½„ÖõFBÑ(€'™‘ƒÀÃ.Jwõv†!j(F$Ð ‡¢68Øvöµ‡»WÛ@[_ t÷Ä@g¸+ƒ§ÅzlXºñ—ÅOàa%÷¬]¡H°‚´…;ñ~\Á«Â±nT¹«`í@o  û:ÐÛéí‰Âæ­ÖŽ;á®P» ;Dàa%‡»aý‚КPw D;zåi ÁŠ´u†9 Ò´‡#¡` 5Qé—Ù~@àa%C]Z+¿Ó¢½¡`ý­ AýDúmH»ƒ=ÝÑÐÅ}ð$x´º«¡ºœ_¥eñ» <ì¦äájå†Ý8Ø u¡ö€ºík‹Æ±¾X¬îéiǽ5Š¬ CÑå ³õßU /2:ŽsxØMÉÃíX×2•‚BzÓ cõwÇB‘H_o,ÜÓ½tô¬…Š$·ã~ÒÓÕʸþ¸ <ì¦äa¨í=‘~T‰HÓq¶µ!˜A*O,@ŠEÂÁ˜þ4(i¬'3¥ÿn»)y¸¬Æ ;´º3¼:Ô !d=H‚µáhh ´5á(:!¬TöÚ”·«êë°-ÐO£ø <ì¦äá ³aC«@ }M鈊šÌhX5¯¸W;ÔŽÜlÒþ¸ <즿§|\Ænÿº)ù·ú:à¡/ “Ìâ•7ªg½Wü—ysø üë¦ä_m·|3X«/ãcfÂñø×MÉ¿AQÈÁñq›òž r^J^®$7«É+ öl¾ 4æÎ’—ãŠovS²p§THæíÝ’˜½R!1,ÊXŠrrsVI^™Ì@¿¬$Hƒ¤ð¸ØCï7h3ˆŸÀŞɾËaL{ªÈ˜.SCz83™hËS‡¶²8˜“óy)gm]œÌâ è‰v ½ÃXèÇS‡~*q”Š­ƒ­³6 •À4ž:LS*]±‚ðЄš&5°BÌ¡p…Æc}‘p~™1L£ï¡4úveªé¼±Â ¶ÚCi«í½Ce¨h/ÁÀz) ¬%,š`½”~ šÀÿg¬t‚aóRz¨t)'àùƵº—`½”~‚¨øš`É‚ÅôRôí@•kÁNz)‡év€_`M&Œ•N0}^ÊA¶Í k¬d‚õóRíåez•O°t^jK—ÌåÄ!èA䌕O0v^jc—)¤R†ŠöŒÚØI°Ã¡YÎO0x>jƒWšÊÌXñ‹ç£¶xÚLj)ýK˜T6ÏGmó´ ØŒ•O0y>j“g¼õ öÎGmï´™ñ•O°x>j‹§Í$m¤t‚ÕóQ[½üX:.¥ –N°y>j›§N›j¬t‚ÅóQ[¼1!KÆÌ­Ÿ`óüt6Ϙ×è'X:¿™÷eýûå¯c¿ªÝ&õÅjÊ(¿@®¨X·Û_~IÚ‘æ9)Þ\æ[QˆÃX…ìž¿ŽÝ3‰Õa‡#³À ÓOïUS÷ºtÀÑ”¥f‘ì­ŸÚ§E®Nt­ /Mk<ÁXû©=sZð¬<Ì›EN0ôþ:†Þ¤ÂxtÈ i;&üuhÂv·¾ÖKÃ*³è 4ã¯C3&ÞY=šqÖ'+x¼áfÒUi&‡Ê,üú´§=†0M<Þð¥§8Þ®zjÌ¡Ž}ÌVN} „Ç-7ê°Æ¬õo¸‘àjËü_³BÔ'Gx¼áᜠ1R¼Iªa³JÀã 7xh”挚•¤>iÂã §{OmI”èµY1êó'<Þp­rMÔŵ˜¬YYê³)<Þp*š I´0›IIÓZ0õ¦µ0I ôuÕu7+]ëÍ•aR»&h‘r¼Ý¬(N¯7m†IQ|µEQ#÷få pz½é3Lv’ äHIRÖ¬B¯7‡†IBŸ@¯²©‚, 29É4±&Ô`ª'Ô Ë”@´õf¹0ÙÌz ¢Þß1[#n­7Å…ÉQ‚§" kÍÂ'pj½.LÂ×s* s›EN`Ðê¹-¨2%L8ÁTO8A—)YêÍQUÇ’ƒÚP5ƒ©Ž¦qOmèâ«ç=qåËrB] G¡Ô¹.+ÎP&n]Á׊WUĪԩ ¥¸=´¥hÆn¼u£+Êå¢-Jsæ«yÊrXêrØr9FJàœ´%hÞRÙ=¢+ÂKÝ.ZØL2£+ÄCÝ"š-)ÛÊ"¨Cóɪœ0Êú¢nmP[1Š¥lxê>©Ó*ft¥°Ôm¯yzw²ãS‹¢Å6+ãš”‘ZÍmªò“([†Z•5WsœoIYµFkq«Š@e½ù©ë­tsKc‹²sR7Ž6ªQ CÝ9µñbÅX‘ÒP«€vkª|[Š²ê¶×b¯ÁVÊf¡®.-p_#hOi8j3PŠ^–Õ”æŒÚÒh÷®ŒZLušßYv4)»=u_Ñ¢ Õá…Ê‚”Фܥé«ÑÌܺä㽜Ÿoj9¿©í¸mãÖÿñsW÷"oN§Áõ¿—ÇÉM­ÿ3›“X.áå8<žðù¼ ô } Â%²¢8èæŽ7¾©íóÝÆ­ÿ™–¼ú'¹ÿ{Øêõ¿Ü3µþç¤l5ÖÿüŠ¥´þç‹[7\m±L»D]ÿófæ¢?¯üÊ“W$¯:Ô¶óÿ|þð¿ZCóNœ7sÞ9O„œsâß<*ýúÎ#/ÞñÊþë¿ú:ð}ôæ)ûŽWAÛb½W¿³ñòÛÚvqWþÕÉWüêµ]¿¹õ–×<õáÖíÿñô4!üÆô»’o/¼åî q“%þÀ™ÿxðñ÷—ZÎ~húwŠ=¶óž™¶õ½ïlxfw—åì'¿¿xû ¯ï<ÍröªM¾|ëÛÓ^Ú|ßÇ{ýé‘ õ»›-ë¼/YòÖÎè´Ž®½+ßyíoZû|Zú±ëÈŒŽ ÷îÿ샥;/ž'ůûX·~lÙõå¦ç¶½uÄ7°”ë·}÷~óȇ³oØÝ{å[÷Ÿ½ô«7|²õ¡·ÿeéèÛÃÏÞØmÜkßzü{¯ìûª%rê’MÏ>ºåY¿åŽì//³¿ôïï¿ôwœüò3OþÓŒ«=géxzÉö¹\»+¼sôw …Åæ½oÿíYÛç¦O]¹æ/Ÿ\pÉÓ_’áì÷m@Mq\O×ÿ©Iïÿ^§»ºÿ³Þ©õ?'e£éÿוÖÿ]Þ±8°à©£’ëÚkÞñ=ßú×/:íšoì8|úì]onKýСÙ#/~ïú ïùáƒ/þüÓßÏÚ±àöf¯ëŸý埶M?µ(Ì85w_bDúö¸çå¹9ßõ…Ügo}ÿˆ–öYøÙû–»™u¿ò]wMæâ«->ßi|ðü휥)73~ôîïÿÙ~î•{w|zó¾Ýß²ô2ßûó·æ=Átl¾è–³æn™qϬ•·Ýùô.¼ý¤£…Ý¿9œøpù®üáÚ, >YÚwJ`áÑ{¿}pÃ+­÷|ôÉé?yöÀ3ÍÚ8máÍ7õn¿üÐ`qΉÞý­¥ÿ=oßÐY'¼{¦ûŠ™;ã³÷$Ý3þrNÚÒu߉ßxãàe¶_$¾ùþü#Ò ûæíYtÿü×ÿ0ÿŽ÷n´½÷îþ¯=¸÷Gý¯Ø¶_;èëØøî­7î>ëï¼?ìøÃ}.~ã¤=‹Vmßæ™öÚáë/蟽?pòÊŸî}´yåU÷O‹½~òýï\{àw÷æþþG3|Ï5ýÛo[·_ûægÌß~Ú 3>~‹¸Þ3ó£¡Æk€Å7þ÷9¡—)7@³Ê¡ÿãÎ^5þ÷2Þ©þ?›ÊñÙa`•ò©r$Å:çks…!¬”2²ró¯CLˆr2Á[m(1Ÿ¼&2N«-ÅÇÅTÍó´#ÚÉ—ÏA3î t9ç‡ù¬Ø’RNÀWvÃ+°çÛRÚ¦,ÛØâlfm[’‚< ¹l )%åZ¬ñŸØlµ¡µÍRjÒPNóºašº°#:$ V€0T\¥Í{k ƒDÇq¦êÉŸÛ,åÃI'ˆR‚Àç‡a 6?,8-@ 嬜ÛÁ Êì•(Á lµjI‡G_ZØØpMlNÊ⸊°õE:[¬çâ ¡_lcj"#ŽÊ$i¹—É'ÐÝbr©ú:®ˆ7¾žoU=k2s“WÏ®—)¦(Š¬UÉŸCýzªê×]’ÕÕYÓ$IÝ’&?ÎêôW éj°†”¨AUÒ|2-d‚—Ѥ¦(¢]§Á´gÏÈë›X½Éö94³¯ª™½%=X{0„$°·Z§ÕËß}«iHÙ;yšíip5Ó”É4xàa¨7¨Ìœ8XÚ(Ì« yJV‡BåÃcÜ:uGêØ· ÿOæãñ†‡ˆñÖÍTÇ—sÊÿ›Œ­FügÜÏ5~>uæSëáW¶ÿé:ù*pzèðS?÷Ë8¹°éÕýûÖ8Ÿ[¸çÉ­Ëä™Ûýá ùŸ¼~׎û?9P¸íOÅ]£ñûGö·~öì=ËŽIr¾ÐÁØ€±¶綀¤ínVf½5’°›’·ºÛ${4 ЛU™%q†¯)’Ò4Ü;€Ÿ|ôÁŸ Â^}ñaÀöÉÀÂðÅÿ‚/ŽÌª"‹lvef‰#Ép³A6Y¨ˆÈxä#2â'„ÿéw?û“ý:øíßôþý_¾ÿÍñ?ŸÿÏŸþÁïÿýüê÷~=øößýÍÎþúÿö'5þþ?ÿõ¿ÿìßþüO~õÃ~#ü(³¢ÿ^kúŸ¿˜J»³gTë?vˆ½9ÿãr»þûA^~ztÚêuÖF¢ÉÑÙùÓãN í4¯ìV£qÔ?B_¾è¿˜ù“UÞç™j=jd'î<Æßæ>àvg‡±˜‡HE7Ivž ãÄ¡6ºrrÄò,NÓyùÌ7ô-ÍŽæA?ß|·àéåá73/ÏèÝÈ.Ç3Ë¢›w—ð-bŠ´PF2Î(o¿< H„v‰€¯ùdº—a±‰¬ôò‘¨ "K(ÀEûh0G]5õ¢K”?ú§YDÖŽà)M9¢Üróáp6¥1ŒïY{ò÷”2–ÿ~r=šgØÀ—´od£•‡Èõ¦ß..‚“¬8™ß~0ä \bº|”]ƒ–ˆLÓÉ7À¿,Z­h|qEy'DùÂÅ(ñbÖaxXìijà5ñeΊyšý+B²$•Ex[¶ÆÇ >¯­‰«(4ààš¨ÊkJøéÛtòï-ï@23ѣŰtTÎ}e'àÔp° Í+‡¥IzŸ¼„Î}Fÿ}½J¾&õàÆm0dX:4žˆ.:YÖBÇ Q‚ê5GtN3dV•³o†¶ÜŒ²HÓ¬@zF¦Ø=G¶‚zÔX ³Æ,ZußdßÄáÛ1Éh<.'3 .ï¬A]Z°Ú5(4îYÊmW!E'YŒãužÁi÷L S·E¸!Æ“zLrÖ˜dŠA™)w¥^Ð-jBTT "qD\€ˆM@°2V€`& x/@h ¥˜”A$ˆÄÄë2ˆ×ˆ×& eƒÄÀÄ° b)®F*3*ƒ F& ÆeãÄø=,T>TÉAN S¬Ò2ˆ´‘š€XS»YÂÌ–”AÌ Öû:ˆEÄ¢±0ñ¶ âmâ­Ž=+…ÔC¿nÕA[îçÌÂì÷6‚ÿÅÆ­á$þvïÉ žrÑÛ£Ëlt8DIa˜÷Ñ[šD·¾f;Bá ‡.ü“Úrã›8ýÕ™(Ü · )¾]¢ˆ'ã×pâaŽ7 .ì'«í½t¿}{a—WR„ z²p± [°OÌu—·i^@GuÌïÝ¿ó­òáÚ^v7ã0¥˜“(ql×cóxL'HNHÄ0ÛØ îìß ×Ëá:6÷-ÎpÛžëc7Nb~ì¹|÷趥w²FÝJ[Œ¦ÕOÆv@£˜Q‚9£!T%Œú8J°Mi°õÉœŠ­˜X„Q‹'²m' ®K°E-‡»¡“­œª F}t¨×H.pˆnQ;ð\jc7²HÌy'<ÏÞ$I»‘; ^s`fÀ-?ÂÆ»„S߉-š˜6’$éB){Kñ]¹ˆE‘[NbÌ›…Ìòc×òýMÙS>^,Óè14&¶¹ÌJ€EXÌq â+`>éfë1ÔÇç@Uä…–DljíÆQäbN9qbcŠR®©ÇNÀ}F] ð¾;–OqèJ'˜awSß´) ä»>X'‰¢Ô Î"š³\SŠjE.H²eqÌ8­#ŽA³Ðoý0Ú®pZRo“ ´Áù$´ãˆƒ ] ?mž°Ùøj’ŠeF=©Oˆç…QèP0± ÅÀX0*8´4€ŠœRõì“!\¥}û°&±¦ôù>'±Å¬ˆp˲©Ù4]ŸùŽí[®íEÌà*›jªÓ@!ð.±$+Áê‚F3 ž–páÍBî+ñlš‚ˆè Gè¸@m@0^D]׋ŸÇKÆüh»ºi·Ðyd¡å€Ä4igð,Ð2,² › Ç,[£G’…PX ("ðH×ú }~Ÿ6IN&¾ = Y6a6X¦ v)·XàÄ,Ù„«$i®å²"è0ƒh8ÂIaWxÛÅ–oWÞª‡N.ò4zÌ´Ý„—€Ã! bê‚"$1w-7âÌIn~¾ì'B;NÃÛ§·¯üu-þÛµóÝ­V¯ÿÁ(ÅÝÜÿá9Þíþòº]ÿû0ëY6Ô“ª…Ä ýíRàíRàíRàíRà'±¸³¥¿2=`Pß, ‚ò·¼8ŸA-ãC>Ú{²­Îés`Xæ¸nE<ⱟ¸V8$v)ræä—š<"dAàÆŒØ~`yð i’ؾ˜ÉqÝ€àd•å±x ÌqhºÔ¶žqr›xaCëU³<½éò)õæÙ3µß[ÊÖÚai7gà³cEº!|Ëœ~vÕ¤þÖ$FÏ'Å xt–˜ø£®¨ôÞü\#À…ÿ%ºþ÷ õ¯á©‹ÿ†ø+ü/Ñõ¿W¨]ÿ2†ø+ü/Ñõ¿Wðqõ@~–߶_;ÖȤæë†ø+ü/Ñö¿è]M3¹ûï]M®Ð]d¶~ï]¥WˆÊOÐõFav2GfŽ¿Âÿ]ÿûÙ];ü‰Ùÿõ_7ý7¹§â×Ê÷凗G y¡ðåD×—ïìe†¿­ð嶦/oM¦—©XØB÷Z÷¡`è|<3óKtFÓÁì ·`0¶•#¼ÎI·ÓÜ þ _nëúòÅ…/·5}ù=ûŽ.f=í¡á æã¿ÿðWør[Ó—w9ˆ¸©h!§ñ…Œbc” y(ŒÅÌ°˜˜ígáø“TþŸ,æõðWør[Ó—&l b¹±hÊÑ”§£Á\¬ˆNÓÉÛƒ/ó7tžm˜ ‡“wƒñk±ÒÏdø¬&ÿ¾ÜÖôåãŸ?|oñ7Å_áËmí±ô®^†ø+|¹­éËñᆠÌÄRV.û¢2-f"xaNA'„ ÑH„1ÄK»;žÌAë÷MñWør[×—£lÝ­ØaS’k¹…fMèN1ñôð½ù¯ð¿¶¦ÿ%×ù|.Ù›‚ÿ Ìló­MPGáݱ4Z @v@¹P™ã¯ð¿Ž¾ÿ]_Èl`Û'rŠwDE^6:œ­l©4þrý·Ôh‡æø+ü¯£éíCÔdàl ¤cnIà~)ãŽ".<ó×|Ì&)x71½NF“9G™XÍgÆø+ü¯£;–þ‹ß‚  ” Ñl’Ìß ÏPxØÙ”ÇÂͺáxSáàÆ™«›Í²0Ä_áý¹ìbÿ…ÿu4ýoÿE§‡z§Ïú¯šÝ6‚ïgÝÓ/:Gí#ôô+8ÙFÍóþ‹Ó.úÅ/š=8-G+Ù¥yrï¯Pû˳n»×CpQ:~ØÑô×gÇÀÈè6Oúvo:û­ãó£ÎÉó}ôô¼NNûè¸ó²Ó‡Ëú§û’ºë·™â¯ðÃŽ¦>}†^¶»­€Dóiç¸ÓÿJ2øY§"˜û ¸ÛDgÍn¿Ó:?nvÑÙy÷ì´Í­vÔ鵎›—í£vHá‡M?Ü9þ¢öí“>ê½h—…çiß|zÜÎè¡9êtÛ­¾h¢â[]=PøaGÓƒ¬€Ôó÷Qï¬Ýêˆ/í/Û ÍîWûBº[§'½ö_œÃEp5_6Ÿƒ¸ÜÛ2Cü]…v5ýð¦pƒ·Î»í—¢=@¶zçO{ýNÿ¼ßFÏOO¤¶öÚÝ/:­vïst|*ô÷:ïµMûq®Â»š~ø¨ÙoJ.â ô€”›ó^GŠç¤ßîvÏÏúÓ“ûèÅé+4h& |$õäôDŠ•¹ü¸ ?ìjúaöÓîW‚‰BÒ¥ï£W/Úp¼+”„§ßm Aïõ»V¿|PÚ?íökÉ¿«ðî¦^‰1:i??îÌÿ|q0-Øa’Šbî’ñ;¢Bá…]M/|Dg“Eü†Ï%«Ã‡ÓìðÏc—„ìˆ Oá‹=ý1ñŽ^†ø+|±÷áã»f(œ±·áŒõ€*<¤gתp[^…ÛšÊÉ‘z’î=¹;HÆŒ'è´w|qr~||ñÂŒe ÿãUøŸuDŠÇV šg©©«Â×x¾f;®zU¸¯ÂEl2 ß!­ÒlΓÃ7™á£0ù^…ɯÂgµQCÌÛ–7};Îj¯Gc™d"ÛÓmŽ¾ÂÖ{a }ò¦×¯0½×x’ärÊî]\ÄÓáb&Þ÷ˆô¦Ô¯0¥jµú–_¾›¤,Û“éÂÖw]d›ù‡¸€BË}öÝbî<ûgFŠÂ¨ú›Û?þR®Â®ú#Í&ãc6H̨R`_Û›=Van}·Žð+좯m×,ôy·#­tÑ™ÈdG쵨#E #êkQ³Ç*l¥ÔàwP%¹++*ï,YQ\XQxn`g»Ùn"y©áÙ¸b§£‰Æ%}!ÚH&–ÐTÅ J”Ý¥^€#—‡»žŸ8,t°œ„Z<ôĶA²säb9Ñb“´Ø¹8_Ú5Õ:$ô[~1âbO±ÈuÂ3±KøâMÇ`'jº­¯Pá`]…© ¶J‰onƒ|cá]jÙØlFÁ–G}gâ+\‘|‹$nž¦Øå©·z–É&R·ëꎋ¹I UÙ V‚ Ä}ËIÛrFÜ$À~èqB¬€òŒ•þ§Ãʬ4 jÉì© ³6¨ea}Ä N1TôCáyãÁÏv8¼5òe¡¢O¾oÈØr7“X›žéå2×èN¦BEG2Ô›*ßåËlz!TôXÊëšo{;‰›ËìÔPbªšxqàÁÀ= <›‚>SÏç^B<â„´¤Ä2¿¡@÷Þ³Îq=ØG+ýÞ×r¼÷uKÑ—+úÒ;â Æ6çž…qÀ‚„y -ìEÜŠ“À¶"±qhI|[´ VtŠI“5‚E.ž‚àFÛ,Hžž4¶¢Àç u±Ã#?ñ9%‚³¬’ä¤*Æ¡WÇ+¡_¨Â…:3áš3ë¢ðyáN"²»œŠD=*ËnnÞ±Uí^áü§mÞ±"yœ_#`¥KúJ Öˆ8žÝ0Çõ¡'æX.³¡[†i1±”³RZ‘ÖRꬦõx ©ÑX‘ÎΛ+VäÙ€óu€Vû8ÿIwØ°" œ¯­Ñ/ùh’^"™WÆ6_ý¸Q» ñ¯¶ýpþS×èj?çßW£è}„vã1!QD±Ï#'"Ö–@³,ÆR¥µUµÚ¥Áù½c%ÜÁ¡eG ;"ij'¶-?qj¿$P¤¯×ËÀŠôp¾†ùPdÈÀ›2ô€*œ„VŒh“90°nŒŠ×Y6W[îeÌ*.7Ä_áh>B 3›¤H‚7’`Ô°I^ˆCè`N`LDMHˆ›ø‘ c„€•TV–稩³Šl¸*ÆM3½†Æ) ÜÄñ¼Ä·˜H·mÅ,†a€Ë,Šc/ŠÊƒ YbƒÒC?¬È¡7shÜ<“g•fò–kªÙÔ›í<¶\'ð¬Èqc áŽãQbÅw,C9V3t#ç£È¶7³mèUx´Íz@Þ£*/Å°ø‹y&pUž‰­k]ýRóÉ ïT•!â½×T±"¿®ÊïP+Ò2઴ DKš—³ð7øîëQ,håêÐ4ŸÇYy¥Ì.\ä™F×®ÈÒæ>¢J ’­Jˆg¬¤áþèÉ‘@^î¬zø¨ISSô(ç:¿[LÅ—B>Š©÷å´¸¶¤åB£©¤ö}z¤Ûù²Ž1Z»¾ì kóÑ%›|ÄbzGæ)ŒâЀ‡Ð$šò°ŒÒÙˆÐ1l+µcÑo«ºNêæÛð–èúý÷vÙlDÄ7çÍF\¯;Õs>úì¬3TÍʼk¹~Û=1±$f”v)ÿ"P¿שÁHõÒ‡>#ë,£è‘¬®Ô¶5Ñ]²T.½æ,«¬ºÅÚeëjs} ìëØEžå‡EDŒ‘L¨§_ôe¢ÖTŽ™v…¬v©W"¥Ð+zbÎCå Ê€‡5d7³ô­_Óàm—_dF(,¾í×±øÊ¥9‹_g™ïfŽf†mÜócuyÈÊwbRÇwªCVô9iþr3óXâò2?§;5ŽþÊ8Ö‘Cõ<>÷êÌ)™ÙƬRì¤Óxå) 6w•ñ…ºÎT'V±àÂÇê¨Åj󩺇ÒꬤµN÷NÁ¡/­5¢At{w7tîvj7q©«Œ·ð2û!ê]…!DÑ‹Òá]O/ø?\OïZý7lï®ð[þ²¬ªúo0Îô¬Rý7û·€µ–oë¿}ˆ×mý·SÿMÚN¸–‡¢.OxÊÇñm¸Û:p·uಥáùw_n¹¦q­rÛ.ê­ }:uàvK—|âe[`e?;¢­µ¸UÄJÜ÷Ù€™^ɹUOР Úl1Ñô²\¹ìîtйHS".PAbÏz[­A¯¨«Veø¼:µÖî<š>y$–ÊŸÜݾ£y£ˆ5.÷¹¡³-Ð)og– 5¦ëË¿ä]ëÙ»Öå¶qd}~ÏS ’ªÙÄãØð’9“ZÅVU9¶W’';µÙÒ’³F–´ºd6u\ó짒u±J²ãdÅD’MSÍîF£¿Ðlô»Ý(î³|;‘FŸ†Ñ{§ò½\1ö9Û Êá²—…Ù*êÕ8égͲ(n·ÕNz2’7ÑÚFÝ'»Q‡« ¼;p:‡ç™Î×*²ÏÙërä^MBuº•QMŸð‘q»°â*ÁeBó©ùèw²ó¹¦³_”¢ÿ9µä‚XÎ^ŽMÑlè ±®ÞRo<,› ( ÀXT´~y¢ ¯ÝâšOÃþdP´ØtÉxΦ'?ÌöµûJJ'¥;+éXÞ¼Œ$‰ü„ù ;‰©Ka|)ü˜8‡\ÒØÉyš~«ß: ˜Ãï»åÌÒ8ø´ŽHoìš®ª:·i:œHâX \×¥Bz¡Ã(1—¾ˆ¿ï¦3K¯²ö»öMWU[ù˘Q‡ºNˆCsáQñÀ‰<ì8qò}7Yúh8Œ¾X:ËŠª´n¶é0·p„ªµñ’äŠ_²Ã±Ñ©¾ƾ§2›Ë€°QGBóñ»üÏ8cýˆ ^©ªÑÓP·3žÀƒŸújCDUJús4Lû“ÊâýgÙG?ASœ9D³háèèè9êI•/—WýËg–$Š²Ròy…çR @]÷ozë#¤cv5˜Í¹£hŒT6 ² d‹øÉ«ëQp«Æ±–ßžKe#ˆls‡êu؉NË%ÄsÍOïõøµ2½dbaF*¤-·[Þ›Ÿ, ûãþlÀ¼xg34?Ló±õôÊ,={ÎZ§«1;ïÙ¥ñÔË¢»éùž‚ã_ S> âŠ>W:¼ª)2¹MîÊ`<0o7£¸™Ž‰õ|Ô¤œåì§4ÂÎUŸ+Ú‡¨`UóiFE§EV&âªÇÇfDŠ¾\^ŸÊò«ªËÄæ43KÅYKÆ_$à<Ën(»º·vFDÑQ¾vÓ¸:ÉP寯#Ù«³ í-­Êº·ŠB'Köȉ¨âö„H±,=#4ÏUaºå©›;}˜yÜðýú°ÒkK7ÖÈ)íØ“ðddïɾ{OF(Yt;™ÍÝ [™ÜžY=èE2½³Y"çÁjr›»‹AÓ÷ërÊÌ-}Ι"…€”ì©mSvìz¸¶w=ߨëY×É+»Ÿ*ÛbùûíÜåÙö-;÷eAjÇÝúAàî»õ7Ú­"¢øF.³æ߯£)¯0léhZŠ”f[ùÝO(AÁçнÏùF}΄×Ãc=‡=¿{£JàȶÌrSþˆFÓYh1›žmE©Lëåÿªô›<™§ªeY&Wmd<È4/ÂΨ«*`e{Tú s±pÇçD œÄ!—X:ãH?zLÛÌ.¨{0”"å r;uWUÁVÅpæyž+—'^$ ˆ+yÉƶ}_.ÄÌoEeWUÀ·’V?Š¬J­W“#ÓÑ“Ú6[A÷õâ‡kf3÷ª­ G¨1Ö³tQÚ:H —Õ ÙLëèYÚSdÒ!RœM¢î‰çÙòŒZ¿FSg¤f¡FSŠ [Ÿ§z6eFü)ùVÜtÊXÒ5ʃ~}–α7’½–½(¯£›¨'‘ƒ=ýe„Ñ@Õ‚áÉÉ_\;ÀlA¬D#fL¨%t8ÎAà\y#ï·Ù#ó˧Åîm¡Ý#†aé}v[£x¹lÈã)ô±š“LÆ3øÖ&ÒåÀÕ©Û@B²•„«¸©u»[¦#œy¥HlL« ¢\ÝCB&›)‰Î)‰l¦¤™dOuOìDoQÉt—éĸ29~xA‡W¦#ÊtDAGlky¤›Ó•]+O5GçS™Î§‚ΧÊtÒ2´ “V¦Ó-Ó™Úèš~s^™N¯ Ó«LgP¦3(è *Ó–é :ÃÊtFe:£‚N% éŒËtÆ5Ž÷:“2IAgR™Îç2ÏÏ;¨£Tª=”Ìš“Ò¬ByªvÖŸàŽž ÂÅÅ\„šQCD£æµž=ÿáîpâç à8–¶N†â†<ô|ð'cz®Ãp˜ ")á±zrvþ†kd(Ôâ ÇI”êF‰Ë(÷<`Æ}á„^@ð¢ZVËM»Ù4bÏs(O\Bb7‰ã Ž$öàÄcoƒfà‚É0sb³ÀWmÀ|ÏK—‡¶l†|1Ǧ¼ˆ³ ¡QäŠX ¨ÍI(<æmÐ q ã‡jÃ2JžÈìÈgÌ›œ0»fÈæQmš!ïRà; Á|ˆˆ=âÁ¥Ï}S.6h°–$ t0Æh…RrbÂÂÀc%Ô®R{S ˆë‚â%‡ƒÊ vB̈C½@RD=‹]YæÆLÒÀÅè!•  o„jÜ“˜YÊ öiN`¸a'G„=Ï|¸ö¥CÀiâñHx!´E(ørØ“\'G1n%„çHè >øBWr=IbÎ¥ëa7LছaMrÅì»MÇ–‘çÆàpß¡ßa‰Ú&#Àw¢dIm›‡º‚á# ¾j:±Jhu<߉]ÇÎçümdÓÿ»Ýì9 q 8Žü$ð}Ê–LØ#pEŽc_¸PMÄ~è2‡”ìœ ûIÿïnÒ¿tÌÍÿ+sñiy%h'÷X?ÿï1ÇsKóÿîÿ8Ø£l_ÿûAŽýüÿÃÌÿOÆ) ÇQ++·¢fèöKû¥€ýRÀ~)àQ,ìlê¿,Ï p¨×Sà„þ]_œÏ•þ¦ê¨¬®¨'ÒaGPÊ!(`aËXr?aNP—Ó@ÄAì’"m%«‚=å°Ê-`,0.\ˆ‰Ž0J⻑+ƒ¡d’ßâù)ùBú­Š«‡gбy•ðY7Ðá].ÇÛ~‘æ7Ÿ`ÔO2Ÿ«léHKZ¢š £O7™õ—Ϊ ÀRYï®ÎêÈkj7Wº®×òJ™ Ω¨D83ž5D]QwŽ¨¶Îò¥¼“1|ðÓ‹mƒƒiw°âx'ó YÉ·î­hõ1¥ñ0~¹ã2M¢ïÔÀ;µçýÁõÎ ¼³­õ®<¾[TåÝ3ðî=b½ûÞý­ôþFÕ±DŸåPU…,8Æ᪀¹½ÞƒG¬÷ÐÀ{hÁ{¥;bgý±c£­j·4  Æ6·<ØåQa׊4^Î"Ø¢ZíM4ÎÊÌ úÝ/×R £.~¿›U§‹º¿Ãç' ø?Ô†Z˜a+0ûŠú7¶4í—;ÎáaçP¿—_‡‹ç;åsKªÿPÃV ¦ù?Ö/x?ž-Ÿþ¦ÞoD¨È¿Ø°°l̾ú÷qþ à†­À ø¿ýóÏ?oÿÌÞ˯UçKïÇâãü[œâ½E·'·è~ú^gHÿü‹þí$;—¿~)ÞOÐíGÅý\ TäßrØä2þ›è¶{‹ú9Ÿ^Ý‚×h5ÿJÆO¨Æ¿k€L× 25ÿ5Íg7çs ¯IÁko5ÿJÖ[-@É„*òoÀ_×Qf-½ÿ£L†ŒW1Ç?üC3þÑ‚ù7à¯k‰¿ÀÇ;ÍÍ—Œ;m?¿h»Bùù)ÿYQ?De*òoÀ_×?)gÿ¨Ä+*½ßç¨È¿][ü½Eí%>mùŸ "ÿüumñ÷Õ7ç¿,@Eþ øëÚâï-¼Ýè÷òë`Åù¹sÇ™Õ|<(¨È¿]küEèvÙ}^-xqtÛ¿Etû"óõ)¼bt;¼E‘~‡¾~\¸ ȪóoÀ_×|JŸa˜}Îÿv×g•ï¬ùm†}ùééÙŠº0`¹k‹å;;ªñO XN,±ü¤?ø¢w§AÏNžCà誗êŽñt ÓÑ‹ÖDÀØVðçÍFm'ü°œØbù×Ò¿ˉ%–?#/àìd$ÑëÖ)ê¦\öFòùðoÀrb‰åM)RU™>ždæƒ(aÒ^±Å‡>§=53¬æF‡èõ„¨?û“ñfü°œXbùM_¤‰z¬¸?Ô[Ö äð&g;êô?§B&¸ŽÆ Ï7sUØ@/So¨–K,WßÈñË­Í¿*ÿ,'Öcé]ù7`9±Är|´ÐôÞ åímn&#•V 6^Ò6Å*Á€Oýn¯?†^X•–[,GÙº[Q™£dתãÎ=È $Ò9<ÚZÿü%–øë.ëô\ò7…þ¡3‹ —+›`þ©©íXM `“v(jNUç߀¿ÔçrÛcðí}=Å{å0º£™/ÕÎ_¯ÿ–í¨:ÿü¥–øK²ÍÒál ¬c°¤xÿ¢3‚b©MW§‘=Ѻ©éíaÿ¦?–(3«ñ¨2ÿü¥¶ciÐ?¨øó¬ ‡*ÒÑOÆ(d(v4\Á°›*à*€ëeP7e P‘þRû¹ì¯âÿ©©%þ¶ß5Z¨uñ¦ý¡Ö¬#øù²yñkã´~Š^ÿ¬£ÚUûÝEýë_µüYV²!Kíü^¿¡úß/›õV ÁE›ÈaÀaj‰Ã÷—g àÄhÖÎÛzë‚ý“³«ÓÆùÛCôúªÎ/Úè¬ñ¾Ñ†ËÚ‡Zºå¯Uå߀ÃÔ‡/Þ ÷õæÉ;`¢öºqÖhÿ¦ü¦Ñ>WÊ}Ú­¡ËZ³Ý8¹:«5ÑåUóò¢Í­vÚhœÕïë§ø!SKnœƒ~Qý×úyµÞÕÎÎÊÆ󺊯½>«gr€Ñœ6šõ“¶j¢â§Mû‡©%ƒ­€ÕƒòÏQë²~ÒP?Ôÿ^û¨5;TÖ}rqÞªÿí .‚?¢ÓÚûÚ[0—g VV‘fÀaf‰Ã‹Æ ÝøäªY¯Úl«uõºÕn´¯ÚuôöââT÷ÖV½ùkã¤Þú]¨þû]µêUã8fÀaf‰Ã§µvMk£¦”Ý\µÚüçíz³yuÙn\œ?Gï.>€¡AƒÔ€áSÝO.εYU·fÀaf‰Ã`íÍß”•¥ë|ˆ>¼«Ãù¦ê`<ífMz«Ýlœ´Ë—¤í‹f{#ûgf–8<3ct^{Öx[??©+Î.”­úsð5–º ‘)ûC ä½Òæ¥ú:´…ú±*ÿf–8<‡c‡Ú¡ÆT;ýµ¡l$ç\f«‘»WÝ+NÞåùhCÿà 8Ìì×”¿JÁ øË,ñw1‹îPoœ%ÔAäyõÒÁ¤ áôìÊ"ÛBD4Ž6ã߀¿Ì§»'ŽÐ‡<¼Œ¿l2-Q‘þ2Kü=‘bññëìqÍÈÝñÏÙé£üô_'/£‰8J†?~ÿ¬¿#) (Ì,Qø¬?IG/Îû²‹.û~-ÇZŠÙé£Avú¯iÆe… ;’Â3`±g?&ÞÑQ‘{Ÿßu\M{ `lGÔ€Ù„¨¶¼5°5Г9\ŽFýá“WOÓ¤'d‚.Zg«vã¬ó®šÊ øã­ÁŸyFŠÛ®a†ê Þ˜WÖxk°f5¯v·5@„·"?)¡½Òh,Òþѵò@Õø1¸|/ØÄ Ø 7 ꢿÆ!.i.É­G<ëtø ;©×óJšó Î_ãàÌÆþ»üòG˜âNÏü³Ù&Æ]½áR÷É«ÿ=éÈfÕD1¸:ñ¡Œÿ³¤kðvþšñÀb“ÉžH“jRÜ¢oí«ÝÖà}¶‰ñ¼•oü´C4­¦ƒÛóm³=î>®ÆiW-³'E¸]F3¾ÁMúv‘ñ.jÑŒopÉþš 8÷EêIàl‹÷” V¨å¹'Ë©=âˆRÏ â ¡þ0S3áDŒY”×èVÏÞtF¿§ƒNÜz¿w`8Ðɧ7Azö¦qVG‡È’³ç–+0 J°Uæîþ¹ŸUìàkzÁÒ¥Tr*$Å¡t]æ9DÕd±“8˲^Ö)ÆR!ö1àZ°×ænŸöÆ3…Øh$Š ‰ëÓSÇ1fâ@RîÇ®KERÒˆ*ÂÒÑ7¨nöš0Àb°f:n»>#Yún Uë&ôXþ¡n(BoQY$p¿Ê0`y°Ë·S ˜Ciþ‚H‚£Dz®¥$ ‘Ø âxQŠ©ûU…!°ÖÛ©BÔÀ¾€^‚™.vWâØ眑&U1ŽîÙ( ±N°fÀ·&´»ßh’ø@`ŒHЂ+GnÖqAà´çß Â²ÏÜÜ–¡?Ûs÷Ѥ$êÌ6šd4 ]RÉ{¨“‘/# ¢ æ;hqWãìkšéñn²ÍÎËô]©Â ’¯LnÜda…ó“*â /› Wñè²,§SPZ~^\ÚŠ’ù¢5yÑ=¶oÀ¬d²RPjV²¬–0+~ Y\Ñå[Û↕»pª¾V©WÌ:Nõª‘ÆÅý#7ÕUÀ?–O›¬±é•#úIMö&T¬Úc¨Úe<"¿e-®âR­tqå²k˜ÁÒæù"]’ÈÛ´ÃÁ]º õ.ª’ùÉb“óKZ µó»|ÄÕ^¶û¨ Y“˦mºJ[VÈ‚©R²¸Gq[ææÞ Øré<ž0Å/Ûžr4d­Ø[c’Ó¬2$Çïš+M”ëæ+:Í8áJ – -Ì – #,7p{Á Ä ¥{Ô j•]x“Š•É, #£1ŠÜlhÀa…ÌêbÕ’ >ÿºíJÛ¨òØFu¹ŒòûÍÄU¹Z\‰0Œ]¼ŽHLË5"´R~xöZ¡o½„šÉ¥k wÕqÜ¥ªeâ.þ,q%—Í%è²KnÔÑj㚬•i¡ñÇ>Šë³šq”Ú R “ ¯Rß´5Õ·=‡×Ødk†l²?Cîðmokfm¶5Û¼ÖÿšØÿm®DŒ¤ÒgHÒ²ýßÈr¸ÚÔþoºªI›ýßÖñúÃÓãgßûR«?n>?lÁÿ‘÷¾Ÿÿö§ßÿ!ü÷ÍÃzçëïýç¿^~üù¯þàþéÙÛ?û‡Ÿ7úà«OãÿHâ_øË?ùéÿìþë—¾÷ù¿¿ýæçþJùÝ?þýNíïÎÿñg{ü7ï>”ßþÅýýO~ñë­þå'÷ÿü—øõ?ëÿKžÝlþõ“¯~ïÅÿÿšÙÿÑR^’JŸÁ«ÿ†jäê¿ õ_3ecSÿ×ñòÃ7‘3¸@[$víx¼uïwî!„ý7}@`ÄúãŸãî;œ„ž³U#ãð·á ,mÕºŽ‹»sÏý2:ùÇî‘•Ö|±;ÇÎ?†ö{?òé•Çp¥Œ¾¤÷}<ºÆöì{,í*µ÷¡Ÿ\À7­æõ»ýèñD£ÞÛ­Ùת›zá+S‡cé®~ä'ìo!aâªÜ“ìgüüNošžì;ÑÛ~ä]„¾:#{‚ïÄð„Z õð×ɪÍS<ó›5ÄZ3õ_W«Ûø5}-¯ÿPësªþë’©oêÿ:^›ý_׳ÿkoØ%ûƒ‘ýQ 8Â=o³ìf ØÍ°lÜÉ×l¶€Ýl»õm[H› —mUqlÝQU –çÚXU Ûöl=½=Yµ£Gº«âÑS*Ùh6^^:ÑU~GØOz8†:ñ€ž¡r“ òuÁÙ'ÞJÑå.">ÝÇÁƒKLü\ÕaœNUŸû4[bž62ŠÙÃx¯ jv•R À_+¾e«kYÀߊ⺎lbWsK¦»p~WK‘/ú°Ó÷X1ò˯¨NW)?7 SÚ$ÕuA‰–ê*Š!Yš§Jf )¾¤Þ-V䣩<ˆ0¾5?ZT««” aË6TtK“``ÇwÅ–U1]œ·å‡k _ô¯ÛïÝž=-£•<²¥h.ùºƒ%Éó=ɶt_rdÏpÝrÑ%7ãC¹`GªÆ¿5tº7T‚·2-¨UŒ{’®A3ËÕtOÄXÓ G‘< ëÌó¯ÎIhÙ˜fEsA Û 4;ž/’¦ZŠçéžÎʹAOÁ—Ü<ÎàˆÒuQÝÍ”Ü[”êHS•è0¿© MmÜ+ÄéyäQtðº@R‡äIò9øÔ„¶fŽ¢~Ò÷pM§sX—ê½l=æÏh(ÿéÏœ»JVm§ú œöäf€÷ÆLuæNé…NÀ¥ýãññÈI™AºåÌhy²Æ¢E×Õ ½¤Cðê¬ï…\ºKû;&;¥‡@ZöÃ4¾m”Jqߦm€ë´Œ±¾&Kp6AÏíÙSåîM†šhÒD(ˆýí93„.Ùza7|/yxª|¹Ï*|ÉX8f¦ÄY­@%˜RY¶´ÿôÏ639wv}¶wW„“aDöùE[NäÓ}‰·Ð6Šä AŸr7=xŸT §7.•„íû5Ú{‹,‰@º‚ýî„HWŸìŸ’ïnƒ òÙØ¢¼ÝeçßËLnZ¡~çË°÷ãé`&§n¦êTËdwÝLˆ´3›ü>MŽR]í¢\ Ó7íZ÷©Þ»Â¥£ÄR2![L™# ëÓgÅ’nõ;‰d—=ˆ=§¨CSf&““‰º ›¡Ë÷hÊæå=Ú`4â .€B¶fs6$þ›{c:6«€„Y´;cNÞ^„¥í·çUGk<Œ:&Vñƒ¬;£¨ó"¶CW -vPˤ¡÷{‹¯¶öùNïî»ðyò41WðÅP-P«YD´{$fΉ šõóco¹½CÝ'}‘}àêU¶Ég <]‡n÷ ÎöûÃäþ¡f¼9: ˜ß_`âûáÏ°Çv²$º¸pbâ¨]Ì´‚ý)R¨”fYˆ>RŒ…VfYÖ¶öáãvÙA²¬éNôâÞ[ çs{Þ;›?N·}ÐQ¬'ohÀS>L`Ö·ˆ²V8$LV &ž1yߟrSÐJH½f ú@Û)añ˜Nl&ìÆ&삈 u*fØ{S£v¼ Êžkb^šs±n [  ñÒ ÔD†’qn6anÀƜܽ¾ÕÕÆ¡Y½• RkŠÛÇ`ùt/°§~5;y\ñ½~áxMs²¤{>ÍBžè ç%³…ºÿæ?ŸÔûÙGVÜ'eëÌðj³KZËÊ´åå;— œß¡9Ù½]â&ª9=þ±øMhãe¢Yü Sß…€,ì]-t%ïAÙt™r¾XÖ'&Þyå:{g Iµf\YäÚÇ3ì&ç~Býº*Ñ}ÀŸp÷Ü~Cj˜µ|î>EºÈ×gé–¬IS44âZ–¨¡–ã„8w²–&Ãah`š;ÄPCàØ#kðŒÇÉL%RÆù!úÔ’L‘¿+`cJ®¦VŠ/Å ØÉ©Óh«¤ê^d²#ùm'i*qýËÅÊ=ˆë˜x{®‡LÛAS´°É/q\©ÎndàÛ4m3Ÿ‚}š& ·­¥MV£=~´¥}GÕƒ(ìcS­u;àIðŸWÍ¥¬al¸dåbóÛÊ~ ÌýNFQÔó¯âÓÈE}YØ “õ:3*éâáN<]ƒ¨9vV^ÿrнÊ5¹øª©aÉá ÊÒg úl%ÎÌO²+Rd3ÂxˆNÏBN@n±%S8†;Òá—ÚDιNȘf_ûàm@½¬¨vÑÙ-1¹ß“,6Iк³B^Ï(éiV˜ £BL¢9øØŒ•Î9ú»³Iˆ½Ù$dóªô5³þ·ªçkL%ÏXºþ·ªé²¡Líÿahúfýÿµ¼6ë¯gýoÃWŸðÕ®‡Úlѧ¬ox³øf ðÍà›%À7K€óÐv•@U=Sö5ÇѱéšâÈžcÈA ;ì¦pYüRj‰n,Yƒ`UóŶ HÛ $Ͷ\~¸é%º¹ _çi¤üz×k]«™PãE®ýü4ü9Ë\çîší¦¸5q”´:s«¥’^^)6Â\^î¼^kŸ˜œV–šÙ&sÞMÎM•‰›RKÍŸšnL¹µ¿·óëV}í쌪†v•ƒ]TÈ\Ü´æîì ù¯QCñ(t#'ºZp½E1ì»&Ž}íz×9ØõUõ>ö{¹úzQ…Þ vãëÝä`7WÒûS:™éŽbš”•”=ÉÜS$Y©ÄÞ-vëëÝæ`·°z¢,-¢,‰h«Ø#9ì"Ë"Ü©òU ?‡ÈdE?78Û¹™ŠÐ`ý 1ÍúÝ« ìGN¿ß¥ƒŽ§ûþƒÉ`jj¨ÅðsÈL"³[Ô?‡Ðd!B£~©v~~^«×ègþ]›>~ž?6ã¡Šáçš,Djÿ}ÃçÞä{æøè/òy]›¡ ~±ÉBĶS>ù÷zür“…È ð_ûí·×ß²Ïü{ÞñÜçÞ9Hñzü‚“…ŽàGÏÐõÁ5:…oá}„è÷Çô¯v,}?Î>Ðõk‚~¢ âçœ,Br  ]w¯Q?ʼnáÝÍ°:óñ_2%@1ü ‡2!ʤøëg7Å™À{˜aíÍÇOd½¦äL¨ ~ÿ*bü‹˜µôÆøc&ÃêOà‡hŒM P?‡AþÏ)š+†ŽÚÃ÷˜ÚJð³C¾¿Fy âçð¯"Æ¿Os„,ÃrXQî=ý9!@AüþUDù÷ufpŠâŸ  ~ÿ*¢ü{åñç(ˆŸÃ¿Š(ÿ^ÃÇõýÌ¿wæŸ8¶Ç¬æõN&@AüþU„ù ë³û¼ÛðöÐuÿ ÐõæëCx»è:ºFý„º¾—¹FdÅñsøWåßO?QíGÐHdÿOþµèÿ"×,ùkÌ}éáÑÑ‚ºàp¹"Ê啽ŠáW9\® rùApņ^m܇@²ÐY/¤Žä :Q?h}hÛÒ^ó¸Õ¬W‚ŸÃåª(—ß–þ9\® rù¶JöXÆ=i¢nèá^Œï¯?‡ËUA.oaŸÌ Ýa’Mã#„½lKzÈ {[Éã2®¥ª#ú˜”ÃÏárUË/û~„턨Ñu|8º Òo9ˆúïBŸŒÖ£³Ëɼê~·ÛŸŽiöéPƒ¸¤þ9\® r9A|‰“‡+›Qü.W…ÛÒU½ âçp¹*ÈåòîTˆé ôÜ®—ØÎfrÒ‘°ŽKx#¿Ûë'PëkEñs¸\årÄúÝHO/Až³kRq'ä„[„—8Ú]YÿþUùW™Õ?è9ço2ýCeö‡ž[%ðkþÕDÛÒhdeÊ!^]?‡5qþìÈ´{àÛézèÒIp:ÝxìK©ó§ý¿¹BÛ-ŽŸÃ¿š ÿªl@;¹q6Å-ìWttYK$fC¶qÏïGdɽˆÈsÙOÈêĬ’¸0~ÿj¢miÐ?¨ø¤£ÿ©Åý yï¤3 ÃÆìš#³}ñF„àzŒêb6¾(~ÿjâ¹ì[ñÿ‡5Aþíê­W5bÝ'ÇíÆožÁIð#:¬¿¨?sÙž²²‚øuë‚<z~ò ¤€i=99¦fUÜ~të‚< Ö~ÒzE”H,Vàzù¼Ç[¤r€ñtZubèíN«yÐÉŸ’vNZRö¯sxXäá±£ãƳ£æ³ÆñAƒ ;!¼l¶÷Á×4Ûä„&SöË:È{FÍ‹Ôu( òµ(~ë‚<<Ác5êˆPó)ª~Ñ$6’b—Ùn¦î•ÖŠƒçiEÞ-étëâ}Ê·GèþÕùwz] 9Ð`ê ò¼tzá`Ø…pz|f6Ú‚´èÎ0¥ðsøWäßñšÕ»èe^ºWeÒñsøWäßìG?ap(O»É#vx7=üùðÁ ú»Aôé›äU|ERpXXdá£þ0Œ÷qö‡ÞN¨ãûvøó°í²LŠ¤08\lˆ·‰+zÄÏábcýã»öŠ À!ccŠŒÅnÊaHc ChÞÅÃqܶö?Ià¤6'>ø·Ý b€Å„ä0ž±„ñ–ã ûeàpÌXB`KáYäeðpÉXBHKðŒç2¤æÄâaöxýKÇ‹ú1Û¯8tK¸¨t#·×â^ œZ8‡„Œ%$T¸‘NæçS=‡|Œ%äS ½nåÐG¸K‡%Á›Î1—pN9ðr<2V9‡mÌ%lS ¹™·öavËç°Œ¹¤ÉW ¸š·öóÊI¡6S-Á—&ǘ"é^¥QD±0ÈäøsÕ¡£QãÙbàãµ`*‰ã,ŽO°ÄâÐJ_Å9‹ã¬2óØ,N½µÊD‡ÿGÝÙøÆu ü_ÙÔháÄÊáñó‘)\ÀhœCÔ œ¦> )~ÆJôu+©vï®ÿû‘ïíjWÜ7$wµr„6þX‹"9ä̜ߌœkt³¥‡ïL·ô3¥•õ˜Ã'ž{Þ©{g{Š”ÕLwCÏ$ È]BûÅýëÃÕÒŽ)žbñ…Õ?]Ìè¶NFe±íƒëW—¿¬ BÕê@±¢©b­×/ðU)@·¢T·O*©ެíZãfàR4…KË4.O”7\Ãô˜÷~(!N²ÕëÀ:ÞßS}YmÊVá¬æ;Ö*4&ÞßY¹&¿Z´õкxêÎÉóæÃÙ­yŸñù¾nÛ¡[¨gJ"ß3Šœs=C,üßiBz&´´¤ã2t>.ÚØßbïà0N-ÀÜÚØå¿|ÿíéo¾~ýÍŸÞ¼þzñUµØ~xóýë¿&hîlìƒ^:õËêß—Š0?85?5³ðõëï^‡‰xóÇקo_½ ßZ?ñûžÇÖ?ÏÍÈa'0z8gôš&ãÝ«·M“¿ï¹º¼={üÉØPDê'³“Ѷ2â÷=¿º»½¾»ÍLÇa'°ë$w&jÜ&m+#~ßó¡v@niv2„äN`­:ãôû?¾úö»·úÛ0+…|¾4(©MGŸßu®"ÝsöÏÇà✋³»«ÒdkyԯûË_.¯>\>ö~|'Ò|ÚT4ERË| r¬Ó&|"ò4§M€ãDä)O›¤‰è“6üMñ˲FíN|Ú ‡Û÷Õ  }Šã&€3"ú”ÇM€UDtÿãæ×Q”_-~k'ëùdQâSÂq#iï»^vVXìœÔˆXEêM|vÎpä+@µO)DzFÕN¥Ú†ѧQíˆèSªv€ûCìÉT;@ô!–8 Ô;«PïoÝ}’Š!½€Zþänk×-ÀÎ!öšâ{JMÐnˆí¯É7’êüdô(Þœz/ì6 ~Yz£¸þª7¨—=1x=³¢óHY$ÆÄÓN8º¾çtS~¡ÅD1E˜¶R0a¨C)¦= .tgµ2®ëø3Æi«±SM‡XƤ”5 ˜˜ˆƒÙ*€TClÿ¨©[ gˆ?eàÀ•!¾àT£­€1ÔŒ!C0 Ûkõ»ûÃÆÊZm`—Ú• pcˆ§†áñ­@!ž„#®[@íóTí×víûµ8çJ»ó@¤u]/”†8F²„9Ϙõ„Ò^Ä8Æá§m‘â)sÄþítÓä×ÛiÀ«éS¯æ×¼ŽÊí4£)|\Ö(`üEæN¶Ó[ǺZWÌZi¬¬ À‡xc-BäâHŽe¬àIˆý1¬ßÚEîm׿p.Dî’¢õú7øäªÓÞ„<Ƣ㚻°QqGPØðRvëÊ»§—útŒ ;µg7§öêB]º¬pT€‹ y©­%åFSÍ;c‚ãJôX"‹´·Îèd’•21WFͨû.r±±­£ÈQá„óƲNt¾³Ê ¢)ÖžØßüa¥š÷–`›E.ÖµYVØ;E˜ÈÞ J:¤|à®QÕË °¡"÷ÀÚ¼¯$•ŒSJ­ta(’ F]gˆ×ÁÕ–~{ž_uÞ(* Ø?™»‰o±>Ò„ Sa0V– Ë4Ö¬s®×ñÆ7;¨jIIÀþÊöÎîo÷d{G”š_€ˆÄ 9þŒ¿wÿˆNÙƒ;žÐ• ëþØ ¿¬(ì@Aâ„‚,lPƒ ÂXvo4UÊ'kÍ8$+blVŠ;ü÷ð'‹/V?°ð² .qJ\–Ê Pª 9ys¹rˆãŠ:–ýŸ_ý×i¬… gÂò³Å›» í–±ÈñFÁkÎr®'©t0€rNˆËÐA£nï7lüµøg 8( ›”j8½¬ç±ÔéèAœ£÷Þx踯x.K‹… hñ ÂX‘!¯bŸ$ÎrMÉñ¾*ì`J2ìãø‡>µš»Sî=Ð`…º€1ßÿ°{¶êó!a€–ÄZ²Nb“r•Š ÐéX²Rl19à³1;`“ðC'/<ÀndÉfá½{õ¶Tx€É@Š•Â‹É ŸÙ ›„(÷ ,øÂì@ÌÛCx¥;àp€«^Üy«ì‹-âP4ÜïÒéÀ®á »¶‡â,Ý{º†3èZµâŒ{oÌÙ$=@µg9¶ÃKÐß`m³wŸâ±TŒ€bÏðcõöo“wòكēMRt~†ëz ©Š=ÃPÍ÷áaRËRáŠ=Ã&_îãÙíóÒ(J >XìÒÔr Â4¨88 @{pKÅ@  98‹æì úË`ƶ#IÏ.ÃÑ÷b¬)[098Cæänækwc–g×C Ì4)³S8@½Î ;‹¢G=÷ãeòìZØ;@»Î 7e½ûfyu‘dŒYœÙÌuWaõ:ƒÕ”õø¯W 6¿WE<Ì”õwH¹hï ¢gЗú0B‹¥óÍý¨LÃB5 ƒd‚ –5 ‚$‹”ÐYéOÎQ ¸óX÷Ÿn¬v™Ë T£ @…$©V4+—z•ÏæÓ:²°#-—w¥HJq§d¿¹Z.œ2ï£Lƒ„/NqÀ ´P—vqóþÌß®>ÿ>†ãÖËй Š¸[mlç4:“†-bú•øÃ_¼(Ö¿…H2b«TÅrû‡ ¶úÏâH2ˆc‘u\y&•ÆI`Ü8kwH•ß>H"É ‰ÿ.|Œ/3’,d¸óá³vÕÍ€’,r¸‘×£¢´û€Qʈ…ž€’9,m0-5œ@ç‘„Î+uñ†ýXÚ @/O@»ÒùÔÛ„+lÐR-P 42Òv÷ƒ~ÕX| pgtÂå°øb±ëëÏîâjù¯à„1âã#ƒ¿»4Ãoò_•˜WftB·íÀA¿ªœ. €p´kÈÜA„Œv Î,eb ®­`² ô õÚj/Ø¡ÐY 0:ÔÍRmuŠ€e‚š–ɼ¹ Ÿ—žyVÚc[w„SÐúÕr{ø1:òÎ3V}è¡hÞ†Ï'ÝÝJd½§µQhùûÌßü!à®Ö®yC=‘Ø.N½ Ú¡ d¼æ}/„ò^Ç;ÕØ3™ÞågÚTlºëÂI‚Kì¹ § Û!¥3ŒS‹+M.D#Ï=†›­6+xšò:}‹‡×BÉЭ¨øáýÙù}äÄÖeø⳺ €24­Þ7ŒøA¥´§ H ŽCgNÌ÷´Rº) fXIÚ3¯¼ì¨ÃÁ§*¸¼ÑK{@+ݯîǽÛ)}Oø š\å[¨®WNfˆ&e·mnX@5;p¹’Òƒ…V(&H'ÅK[\Öð@‚|”µx@%<ÊK‚ž2Š¨œGyYÂÎ(ŠðõÝò*ú×g—?ÝÇOÜÌýûÊúw‚Z}‚QBEy‹“pJ”7nÑY–cÆóºY@}çqoþŸ½gí‘ÛF2Ÿý+”¹/ödERÒ¬màÎv²9$Ù qp{À‰¢Æíéžt÷Ø1`ä·©W·DNW‘Òx³Àáy¨¥«HÖ‹õÐgoÚ¬‰²8-2Î2Yäê滋NùŒQàFWb¹^MÖÆ©@è $²P£ßêý]€kt4‘ÐÈÁ‚ÍL€ñÍùÑsчgÁJ=[‡$¿¯ÙlF M†&>Q@6 5²Y°úªV6öšj]˺þ¦>Yé èóèYðé“_oâÖŸ=Ã/$@öZškiºÿi ´R ɆZúrij•säHi”ôGõÓ ‘’|¨¥ Ø©½OÅ )/— )@÷°4둪cNÜPqdÁ"èF’Ñm ¿G©:‡> xXz¤õÃ?Œ/qDÃ9v‹ -mÕFè´…eÜV•sø @ˆZš«õèìõnȸƯ`Q„«%j€ŠÏ¼¸°`QDº%iϳj_DëÏFøQ²P&I.SIã’2‡ŒŠ¸iYF,ùQöŠé#ÕªÁJ` «ŠZ²ªöÂêH…£äš®EP8,)]ºme+'t§Gp ÑòǨ%l/ôŽZ¸¡;=¨‹. ¤XRÎt½fwrœ]@¥±¤¨Y³q¬8îÝ©¡Xl ÈÒ©ï8¶íÜ:b;5‹-  YÚúY–òÔ¹‚ÅП,=cë5·“F°Ø*–¥o`m}ås $;RK³¿þ÷ÛWœ' I}r!) I- úðIéXÏ ™µ‘^ç¡C¢Ê€¤Cfm©×¹Ùôìaßs\Ž0{¼½ëÎåUÇ™8³ôœÃC1 Ù³4{›3UŸ=à˜¥Üžˆ’«ï2-Ç93ÚÌVÀãáEà8{cF?;üº:ÎÄXèÁÄСŽ…&[|õ8ШŽEÖn¢rö á±hÌëÓ$ŲÈ#TŠù¬,ò-¤X3oì †ùT7d@š*‹<ª2 í“ù¤}²£éHˆÐ²” &ÓéÒ›±2QIœK!”ò1.¢¢¨G¦sš>ß'Õ bµ§8Icj1ÓCÌò*LˆyÀ9Ëù&Zéò§˜Cg.çú¡SÎ~ë3Üóéc@–#>ÕFôĈGµd1â#œŽcb6ã”ÅjO“X&´Ìr5W¥¨²‰X;äõÈt„2:fóà”±T’2®"e£JI#ÂÃ(Iª"ÑM‰ÃŒS©Ï^FKEþvŸ/§í¢È;1?( zÁÒÌ'XšÁÒÌ!XúÀœ*#}¶­pCÿF¯V{rW˜%w%ð”ñ( äDøhÊ*‹‘jãFçCe<à£)è]Ìt¨»Pƹd‘#e<à£)(TÌV‡Úa7¹–ps¤Œ|4e ‡Ù4ìZΑ2ð±”RÏ·#AŠ·;¨>Ó )©I@¢¨.F'®¼¶5§9´ £Û–Ãœº·¹Cðs>C)üœº ·ê&è9Ÿ§9ô nÓ' ̧ ä oáç Ü*AÑs>*ÍœcÑÄ·ö(Ð 7›ÜpØèÓ+’}ù‰ ¦«˜Âïó阸ìs ‰3š¸9L9 6ŒlŽò|r¡6ôŒBÊÈru”æÓ+Î9Í8 §Œ4Y‡„†¥ë›ÓŒO._‡žq@DYÂ9Íøô:|N3H)Kr-zƉaI{u2!'õÃÎ8êÊ,©®.3>CuB—r\™Ù–ÌS—Ùž^æ­¸I¨Ì’„ê2Ý“1AºÈäSfI>ÛE$Œ²Ô'ÌHÝdFêæÜ!@Â%K}* 1 E‘¥>AN@" K}BiŽæ& "§AóˆGi¡„KÎY”DIÅò*)X”feÕ#˱ÚIÕ+e=qqÊRYäQ˜ÇQTŠ(‹ddØæe9%pê4ت-½;C‘—IÜšta~yuµþ€éqI­™³Ô£„ r@¸‘‚;^ó®ÕÇLnÉA é´^q®Ý'9^Â-é%Aн˹n(²I¸5›äT-Põ²æ­Ø—Ü’ù1oK¤npKêF ¦QáúìQÒfÜçê¸|â¡ÍPhçê±ðÀý¸ä–<œÐæ@ %¡ lÕHq¨Ò´Ÿˆ:ÅÒ)ÈŠY&Üh½öçY@. 7rY° `˜^é)HOá>é)HOá>é)|jzJL„(yÊãŠq¥FaÊe’RYÂyQTuCnKOyPt‹¢/i\VR™ÙyĨˆªB¥‚¦²,+e—EmKte‰t~ŸC/ï¶hq ¤¢p3ÅTLØbçXLFÔ„­îoñ‰ÃÈ5áFƒ,—”²ÃN Ž8Æ›íȦ4ÜhJó'Èvä@·nt›A²G Ó 7:½`=jF°¨¢pÔ‹ ¥bBô á£$8 G3Y0>€,‹ YpA‹ˆ„Ešˆ4"’ä$•Èô¡Šué^… Nñ¹©r—¬DxD#ÎÙ¿£–hF$àp3ÇeËš¯™msWоåXÙ/wœ!ÏS‘FåU, ª¦F—\”$¢%ëÊ~íGà^#“ DÜL ¿‘R£;álw›òþîiOÍ@ùéÛ³¦OÎOß^¿~óã›^¿ùáÕ4~€(72W†o_”÷·wº0ÉŃÒvºtÌ,)Y’Ë(eç… q‘乚8–’v)× ¯«Æ£ ïV’2 y)5­i\’)2^HÖÒa¼?4|i$Öp:V)†ÚÞmÔ$…g4e±Ì“0ÉCZ‰4á!aEIi’IÙ.è$žDaRUIšPQVÏ%Js YVe9Kʤ0³w›¸ÐPyŒ<¡62/±«(s*ò<‹hFª„Fy–eÂ4sd$ÍZlj$Š²¬R«(”\ )YšÅaešE)i!‘†ïB!@3†j8’B‰ˆrfa”ç”)Ã%e\ˆ,ÏBQR’t"£‰'Ñ„ŠÄXʤ‘£3¤‘î-`WMI•<ËŠJ™­<ŒXL’2J˜ÌHY–Yƒé°ˆ|»Õ é¤q#}hHŸ¦6’>\qŸ$W0!eªS{b™V1-Dgje¥ .5H<ü+,`)hàFÔBuvšB¡qR¥D2ADâ2Ïd¤öG˜„iÆEƒL O!ÿœ=,…5yTdá@Ê7šã` Ÿ~z°Ô*»½v;q,Ên^®õ¼\#˜ß†R=¶yi3Þá«J)¦û$°ÂxúÌAí¼çÅËײZ¬:OïêùeQ['‡ÃoSY,t18íÞ¿âB\Ñ(:%@[–´´…› ´ÚPéaºê#ÜÀxæéàÊ]ÐýêO^E!y£D»:ÀŠ¸úžº!o© Çf‚Ôuˆó®º«+(îóaÂk¥ùøÓ¾ ™rĆ ùÝUÄ|H §=áI Óz˜Ruœ°‡÷ÎGFík’‘¤x2ö¼6å’TTDjKŽ§!'%…ˆ”2›¹ðZÖ˜qv–‚%Œ{úõ·ß½ N«ÅRž7†ÌÈ„‰öx˜0Ñ>n,Ñ£ðºqÕ€$µ;u¦JÇØ„zFzàj¥™Ç>„SÉðû†e°¼6M `mõ]óí=íÓî=íÅÆ’NÍDC:XíIçoB[îôéipðij§ÍUÿÝd[áhý9±_p{üúƒaן¥uÎqµq»ËwRwwSLÊxx¾ʳñ å›»—p^:øܹÉõÐSC4aB1¡ã>›ô`Y6’}€£Ó¤Àžü¤x{QÜf¥Wã?™ëFÌCK‰ú68ëÏX`Xc9žÑs\Þ}xFM>64ùØc=Ãõ.Ì}ÿÚ™þæ~ú¾Ï´W%˜`ªZÖw×wâ@vw¼<σµégƒÇ©~pžØ Lp±(:Œµ{Ú¶×G”r¯cÙœ—3|†Œ_ÎÓΣÝhkƒ2« «Ž,Üþp߉1Ã!*xÆ Ã3æ.üåaânw›{±Ñ48 š'gÔñ +„;(ÐœbQN[ct+Öwï¬{àøÓ3ú R3R÷™Qª•$bQU&¤à)Õ{—¦jÇ"qÎ0¬±ðìcÏüý ŒŽQ,VŠä_àn£žßNR‰Lñ'c3+N̬¤óh•…$-”heYž±ŒçLÈ8¦q™ås:‘tþ–&Ùýn¡Ø@^I|+rìÉàø±ŽÐåV‘¹ù}» ÅOß}¸õ'vbø êfåzÚ “:¸azõ®éŒWï}ëCÊçðC³o•ÎÃKTNCÍ'4f5__ð u¦)!¢L²2âU&ÃXЪˆ‹D]“ŠJ.´†a (ÒB»D¿ÔÝ“ªYÜKù^.g${éJC‡ÖwÐæö't`­‡:ÖâÒZG+)-Ï((¹!( zŽ­Û{U¼ªDÉŠ+Í7‰)ŠÄU*Ê ê96 «g½µ’ÖI2;1Ÿ›ài4¹2ÓçÝ-WV¿{èpð,^çðÄõW9>‘˜Õ0²÷µ]ì=–bÍW–¶ækÏŒܽY §ÄàÍJçôšã|¿5*ÛûŸµ<ÿ,hLΚ½Ïk`²‘é N :Œ‰†1õöÝ$§7¸g¨‹&õÀu‰Ã†§šµ¸Üæb³Þº,@ŽvÓðÎMs€Ï‰*˜Ðîp¢ê™ á3VfµõüÉàVÜ…[õbVBŠ"äLf"iIr"ò"”qHÒ2+1ÔíÅ, «—µ¿ tÇ$l÷È@…l­#e+Í)r#Ý[¯¹õñ¨À‰@X(5ÑÝ¡ò¸ñ†³˜9°í^ Âyx1èžC $uîÕö‘G <ÔehÒÏGÛ&4'%e©Lî‚Se‘.Ê\ëÈ9¹“¶ Ãîiµy«ôÁÜøÁÏÁt…ÑŽ¤>Çü‰²§K%~”äE)Ôn¦ŒV ‰I Jœ‹aX¶ÿ6Œª±÷pNìmn…0;à†ÕÈÖñÞ½*y®Tµ0Ub^{é"ÂâŠg,-*!¹S¶ k$å¼"£§þ%ñÿZÝÆÿG'3½* e¢ ‡TR%çI‹C¥\Å…ÒÊzÕû¡`Xƒu‰´-Ö±ùøç8ØOyV%œŽ§îÉäÈÓÊî‘gS"æ,‚4 RŸ8¸q žÑð´õIš;þô|¼žÙ^ÔÇ­§Àóú ….PJ‹ñäç 'F| q‰oÙ§÷€9ëxÆàœÿ~tÙ¶L¡½½S±;oÓ¼9>Ñ(ÇÇG„Û!8D2€°P¡øî âqOŒÀæsTwYĆõ°ÎKª}„p¬Äˆ_òÑ煮+K8£a‘‡/EQÐL-´¬RVWÚš‹~ÃjcÈx…‡¼ÇŒU0µ<š ÏuõŸHÂ4粬"ÉSeÏ©ŸIœä '!"ϧˆpÖùàSLE „MEc]sŸˆ2¸=­ƒ‹„eØÄfÝïž‘EV·K 8‹ÐG^Qk˜èÏœŽ¡žÛ.€,#ìá<íƒù]¦ÔHQ£f$ïƒ+%¸ó-…nãÈ  + ˜–‚’cLÞƒ°†Ñ.‘#£§ É0Ʋý}–àn¨ÑaÆϱÄUæ°Oökìdê°†AX8ãÐ= óqã,©ÁÝ©OKYÉN9 õ)T‘ÈTP¥}°4—¤t*ÃsµwZ—P× ô*Å.„éò;ð³…^þÁØÅ?¸w}—LMa)¢<+tn/S¥N“*Žc¢X¯SmÖxÑßoí¥1ƒú¾MÃÅÁ¬î6(AéOjKË0T+W…1ÍY’Rš‘XÄ¢iFÑ® [ø¬SuL쟛šh‰‰ÈØ0&"sP«ct¸BÜ…+Λ‡§®‰÷”¸ÖšDÅå4·?ÎYä¨OâS®ËëÀº½küºâØ5”ü{³è(&Ã32bØ™OÊ7\ÐÖÁ­ê]×?Zдùg•ŠÜHHà/`óÇ—ççAµÉoj¾x~þòà²X«m²Úmõå'õ•¦çTµ^«íÜéßëÞmº17\*Z—åFÖ£^>ßê“‘—O¾‘+¹QìR­ÒUð½úÿß÷Ë€$Qü#ˆâ+ʯXªÞ´ þ¦ðøY¬ï‚âcЗ£oзÛÝ]]^~øðá¢\ÿþñF®.Ö››Ë…Âû÷–Q>y¾¸½ "ØnÄ‹“ÕÍI/wý5ú'šZAt‘^põk3du©AIZ¬Ëú§~ÉË'_üÿןèKÏI¹õÜ\¶1‡;d–wÔ ¥ú§’tááO]LN·Wü""Œ1±“/td?c_á,o¾îõ6 ‚/Š|»[ß?Œ0ôù¿é×ó/_ÿíÕÛÿýñM §;øñ—ÿúîÛWÁÉùååÿį./_¿}üý¯o¿ÿNíï0x»ÉWÛšµæËËË7?œ‡\åC\3”·?]þ®aEúáö×óÝÁ“å®Ô¼¦~áï·ËÕö…Œ4Yót}¯êÇ­Ü)v¦î=—¿Ý/Þ¿8yÕpÝó·ºOOǃ•4P kóð_´ÜØÊÝ‹_Þ~}žÖÜÊò÷ó_þóüÕúöN™nÅòηo^dûgšâÂ7 3^oî{Ý0Æ Ö컥|ٱ㫠‹Ë ~®7WðuÝͧ¹ëÉóåbõÏ–Mïòb{!¶Û¸ðâd»û¸”ÛwRîNêB-núýš­Ø,îv‡Ÿüš¿Ï›«-ëþõ·{¹ùxñëVÉ“Ëæ܃åÇÕV =gÛñÓãí$jÈA--ÚÉlÅ‚âZgÙ­ïNQZ®ƒÕZ¢Ü®ßË`÷n± ÔMJÉÚ -#×[% •€k_ýe#W{8š¦¹ÒôºQÔ\Ê@Èår{—‹ÅêæÅIxRÿ}§Tû÷Ë'Áó]3õË&¨PkR.nÞí®Æï~ÿ‹¾I}Xv¶Ÿ/e¥n /˜¼mî úÜmÖ¿*ú5êT·ô‡ýÁo¼¿-´Ô/²‹®|û“}+sýË®ÔC¼Ümš`­±ì””FùPêL é©CƒßSº[aüºÎ$Ñ@­É"߬Õ0ƒ•Š•Š{mÔÔgÁºj¸®^M5®P;ûgh6šøC ÷r ;0XìYÐãM ‚Àlð9¸U¬o›Á_ž~u>õëô´ß¨±ï£ÞiÖq7KOhTÝÛß-ŠM¾ùøPCk ÂmìÇÛ)Åý³Óýxc« `“鮿zïè—ëØ·œ þ'¦ûñVPAL¢û׋Ív¼—}PrÄáeH/ut÷,t?Þ¤)Ò?1Ý7O ‚ 1v§7M¦ƒq“i;µÜ^ H—Q ê^y:ç—ÛøA6êTýÐøƒ½‰¹×aƒ\iÿÕzs›ï¶µ[ðn½üøN–›|©þz¹­Å~¾ü§úy#•üßÔ Õmü€0‹PÂì_H@ E(Vó¥³ëëë³³ë³úûáÿ³ñõëÃk‡r? ÔÆ ¸Œÿ²þ¯¾_ÿ×û¿ô÷Og#Ƕq¯ï‡Çï7|ýïSÆ·%ÜÔø?ýñÇŸþh¾þ·]?ø~y­°øÇ„ñ.B 8=þà›àÓ«OÁê·ÿcïj»ÓF²tί¨vŸécg0X`lœÄÙ‘A¶µÃÛ‚ÈËÙìqËHØêÄH"Žw™þí{«JI¶ëVÉ8=gI„EIHϽuë>U’xê–6aë§ìS“—ÅËiòÞ$«/}¦ñ#$§ÉÇ? «éŠø1N–i‚Õ~?µñË/9ÔðWʬJQ&ï3œÓgË2Á:?µuÅ H…"~„«rüKx´Ì7øCnÇêdðÃ?²ÁOr(âGø·*É¿€ã’¡¹çèXüp|§,®H\¾ÆÏ[ ]ÿBÒ(âGø·*Ç¿¹F–à')¬$µäß3(âGø·*Ë¿+b=À)‹?c€"~„«²ü»"Fqüiñ#ü[•åß¼­^³÷ôòú‘òLY…G͗׉Šøþ­Jó/é‘Õ‚Çý–!,c²òWdAVû<×{°\“U°"6{‡¶^IÒ'2uüÿVeù÷×_j'oaÈÿf?=õWå;‚Oî‹‹×¥Š¾@¸¼*Ëå[{©á¯!\^“äò¦¿¸èM'²ÛÜ#ìRÆhî±+Ñ=éÛî—ŒmÙÏìL}+ø.¯ÉrùŸå„Ëk’\¾[Û‡Òeè’³a‹L½±;ݽï€áòš$—\Ç£×KvŸÆ5Æ›Ç{VtíÍé•az} ,‘;/º%~Àþú˨~„Ëk’\>óoâcÑH;pÉ f^DïV.ÿ«çÀJtkGìžÅÄŸNý;o~CïÃ;ìá‚° ÿ.¯Ir9EÏ©ˆáòš,—~ßÞߥÈSqMn6èÁN8„7sƒò³ýðoM’«ý~Nå›ÄÿИåØ}´ à?Dø÷Pv,MÖP¤HTêøþ=”çßì\@[Üî³K¼3;rÏž†›\Ê’?»ÿ›ª´²:~„%ù·V&€¡æ÷ !:–@Kû={&èÚ¥ŒæÐë×îÜñ`7zy;ðg~äVQ¨ŒáßCÙ±4ø\üN¢ÐŸDw”† î˜ÒÀõ(ñ”àæœêÂW€"~„å¯eÿ)ùÿáßCIþµ.Í!öέúÀ °Þô>˜-£EÎ>ÃFƒè#ë²7 ¿ý¦a3­ð!‹ÞmÁò™Ÿúc8$°S;>”äa³Óo›€Ìè]Ë4†%èì7Û£–Ù½(‘³‘Eº=‹´ÍŽiÁnV¯Ä¬{ø5UüJòpïœtŒAó@ègfÛ´>3Ÿ›V—:÷¼«“¾>°Ì樭H4è÷†P=Pk-sØlëfÇhÈCJò°ÙÿãƒÑµÈðRo·ÓÁsf€ãõ³¶Á퀠i™£iÑ*JÖŠ¶„‡%yb¢œß.‘aßhštÅød@|èƒÏ%ÝÍ^whüÇv‚¤¥wô —Ý\”)â¯#<\—äá|pC3nŽF‡ÖÄÖpt6´Lkdä¢×k±Ö:4̦1|KÚ=Ú~ÏÉhh¨öãê×%y¸¥[:ó2‡ P4nFC“…¿ÙµŒÁ`Ô·Ì^w\ö>B A…è¸ÅÚI¯ËÂJ=~ê×%y¢½7øLH#5àùxi@ù€6k Ó@Z³i¥wK­ÞÀ*ÿu„‡ë’<¼ cÒ5.Úæ…ÑmYZðÑ{kÌ!ÝÁäÎþ¨ƒ½#^´­C]ÐUUü×%y8Ãc%–ˆˆyNôÖ“ÆHŒRæÐŒÓ+kÍ˸!— æŸ:ÂÃuù{ÊJ?¢Žðo]’óOÑ•ˆ cþ@ô~Ò¥Øþ"^Bäb4‘\ŒÀKÃϳ^>8ÝJãUäYD[FiË<+òÓôõÞ1ÀŒ"d‹¨Ëh"u™­Y X5ÆEôe4‘¾ÌÖ,8u›ô1ÍB´‹(Ìh"…™ç4.„sDÂ0"·°®k~PËsκ°@ Bt`4‘Ìóê™”ëÕr âÂ"æ ¼#’…Ù†9¹~.·€±¡3‘HÌ6¬Éu|¹›Â"!Œ'’Ù†E¹%·€°‘ÑD2Û°%׿ä°Â"Æ œ+Ò“Ù†1¹þ&·`]XÄ „‚E3ÏHÿˆ.Œ&¥ Syý×->7©†aMi]ákdñçæ;ì±?ñ¾Šøú•Ô…ÙæKé¹U †ÑòÂ0rEhQ¤Ö"h»c ÿwç…4È5¿ \(lÉš°àøä !/jB~"•'L lê#œ’9ùëàéõ-™€H­h"©•'M˜°Ü'»aä¸APâÉþ?ýpú_¤É"ŒüÅ!» ÷Ê_æ|c‰x%ru5YÎÇWW{o‹ƒpžHwå cþEîn½©KvöÔ  l%’Py[!Ê'šHùDØó³»³ð¦PbP¬D„°Dâ'?H^@ôO4‘þÉÓyaBv×<¨EÖI èJäPˆ•(àNeV&ýÞ¡~Îô:è†M7<˜‰\¶O ÿÜþøwÚκÏ‘ÉM$ï ë±)¥¥Å`ÓÔÛôªÒý fïûŽí͹ý}ûÆ]wáhO ¾øØ1¨ÿhå¹aæ@Ýu±ÌAì9Dµ:sŒ–ÙÌp=gÂÓG[÷]—AÀú®ë£O 1gÑÑæýø¡ÞU–S^™I­fý]Íø»ªèðÇ‘pÛð-_ÝLýk{š=Ê/“±(mÏ>$ÕÛµAPÀ>³éwRN…mîÔ1§ÆEî4‘ w¼àÊ9<ÓŽÁÉõµ{íŽ'õƒ“Æau|Øp®×ÕZ 7V4_#T9ʼnÓhÔÇNµvÜ88‚׉=™ÔŽ«vÕ©×UmŸÂ§ëÃ'Ö?!@:Ûä¥øt¼Aî¬k=SÌòÖNn ÃË6ôÁO°ñõú|üù&ãzØôH§Þˆm¹ðé”&lÀÌÔlþ=H¶4žÊÌÚÔQ“ÁOvHõp(y€ˆþl„T”ò1žV?(‹Ð'†žÝîKíçˆÏF%Aøó@úzýÔoó³×<}N;¢EG¤~šÉOüÝýŽèЩŸe ý¯T/OôRÅŽˆÐ©iþ$¿# tDjJ£'ý~îaDØ éþü ©T+lâômø‘±#RÓýI~GtîˆÌ$FJgDD}ˆHÔgã-µS"ì"Òéy¡ßZ«áGˆL¤ÒóØ|eoȦË&ÄJf%£×þôþÖu{ „ïOCFûöôð÷ÆeÕ9š"Òèù!üšH¡'§5Pººº*•®Jì=½”òåWé²J ?Bj"©Ÿþ [*L<½<(_¢ï«RÎEü±‰´²ø‹Á§ÿ¾<?Bn"±Ÿ þÕü±úƒ¿§—ÇÊSï•+°âË3ð#'’÷Éâ'dÕ\‘>¬ÂÒ&lý”}jò²x9MÞ›dõ…¢ÏÔ€"~„äDb>9ü²š®ˆãta™&XíÇñS¿ü’3@ ?"àCD>9ü:Ã9qF°,¬óÇñS[WÌ€T)âGøW¤Ù“Ãßg8ü!·cu2øáÙà'9ñ#ü+’èÉá¿dhî9:?ß)‹+—¯ñóC׿´Šøþ•ÒúáøÍ5²?Ia%©%ÿž1@?¿ÒZ?+b=À)‹?c€"~„%µ~(£8þ´ŠøþÍKýð¿&«×ì=½¼~¤ ·Èns°K£¹Ç®pD÷¤o^¸?\:0¶e#<³;0õ­àG¸\¤EôCøár‘€QfîøÚ>”.C—œ [dêÝy(ýÁçàG¸\¤„”Æ?p>gz½d—ñiŒPc¼yü»Š®½9½2L¯„%rçE·ÄØ_Ãp¹H)æ;ÞÄÇ¿µ°—,Ü`Fç0wÈ"ð¿z¬D·vÄîYLüéÔ¿óæ7ô^¼Ã0 úár‘R?EZÙÐ&h Ù×ô!ƒñ:ïÎýZ}I?Âå"y¤œÿÙ}7z‡—"OÅ5m¸Ù ;áÞÌ ÊÏö?¿"¥4þêCÿƒŸSù&ñ?4fg9v­‚ø‘%"YÊù? €"õ@â RÇð¯Ha)‡?{#ÐV ·³I¤ÉÌŽÜÀ³§á&—²äÏîÿ¦*­¬Žá_‘”R­L,CÌïACt,–(ö{öTеK͡ׯݹãÀnôòvàÏüÈ%<¬¢P?¿"ý¥¼ÿÁÅ_à ñ ýItG™!aØpáŽ)Í\o@ nΩ. y(âGøW$äô#äDʼnˆTœÒø­KsH†½së£>0¬÷½fËh‘³Ï°Ñ úȺì Èo¿éCØÌF+|È¢w[°|&Ƨþ€ÎX“L¡hÂÃ")§´f§ß6õG:‹B×2a :ûÍö¨ev/Jäld‘nÏ"m³cZ°›Õ+1ë~M?ÂÃ"ͦÌ=©sÒ1ÍK¡Ÿq±eêàsÓêR瞃wuÒ×–ÙµõéýÞªj­e›mÝì­yáa‘ÐSÆÿ]ð/1>]‹ /õv;úàs‰Fw³×ÿ1‚`#iéýÂe7eŠø¹¨ÿåîZ{Û¼‘õ_š/mN6áý’]›mÝÖ@·)rÙâ|2xmul_zÁÁþ÷3”dY¢¤wÈW¯ÒàHœÈz)òápærf8*µÞÿZ¸aõþÍÉ?Ë|€l½}ÿ·ïNß½w2ûöõë¯ç«õíÉ›~uòö¯³ï_—õûÍìýÛ“^‡ÔŠš ÕŠZïÿׯ޽š£ ¡‡N¹yÿöt.þ§?¼;yóæýår‘/fß½þ  &ätøëù:yýÃ\¬úå) 5* µ©GO^¿ùïb‘ôù~6ûé»xÿMY劌7¯Š —ú_½[ÿŒôÝë7ïFÉ?Rj6TjÃ_‰ñ쇓o¿?ýö䇯NJÏ^—ütúöä Ð5§oËN`ÿô Æû~.^e­Ã\”öö±ÃCe¤öÚ±gsE4;ýföêëYöTæÛÓ¥z¯Š¯¾[.äç#õRj6TêSàH½ªÙP½ª]1QtÏf|E@0Ïîòüúþèôã'¢-ŠÝ×Äþ¾Zïÿí*äùì§%½ôŒÙ–èì?b‡ª^m샦xüø‹´›yGJ’æâíçË·ÿ~ÿ—ëÛûø<ß̳[ ð±ÂC…¯ÖGñýÕýùí_~¸J³¯îÃ/én>ŠÇ·Ÿ_/Þþûù%øe™hHí«ÙPí«Oa-#å®fCå®>…»4R$kVÉjk±u ¬¶F³Õ^”êÉy¾Œ)ϳyßœ|ÿªPœ³ïú`ClP{y©‡¯èîzöñØþ"6§½–Tß×"¦¢½êÓ“Ù2kb®nïâùÕó_Š&êë¢úÛK?möç1[£ìß~¶–Å ØcFÆ‹óË»EÊvÇmßS<ª­ã’®u|žß4²ëHѨY{Ѩ֮kµÖõ_S¸»ºÛwD½×Õ¢ÚETn{ý¦'¥hÓB9ÄÏÏÎÂõÅýmùÓU‚ 5˜fí5˜v鲧?~»º‰Ÿ}™~¿K7—Ël¦»,ªÎ\œÃLÛò†ÃþÍRiVU`šÍþ·±]DÝ·—Ez2›œè¢¼Û+õ}-¢¼Û«mX°÷oNWVlYuú!)eÌŒ#½½ºPÏ×ßùý¨™æO®i&ú ™–ׂ»/÷÷nµp~Ò*ï`¯Ú£kjïìÒyÉ‹6)¾ Ôç 2Éà<³™ë¬]šæ˜¸r)•¡å…âÕ°«ä·åÀKZvÉ•¼[© lä-=(­–ìò`QZ (E’ƒ“9FãtÔ*{#)‰2qYÒA.PRGD ﬌p~»Ÿ¿ŽBiHy4 $Ö$ O‚rc¥Ð,8&rŽÎó¼@I%¼—þìæê·ÛâÔˆÒöj@)X'¬•6$EI&œ›H¼°ÆeÁ(3n’9"Jx¥puqÿárP( ‘ß&Y"B®¼Vð‡xk%9Ð 9¤(Ù£ÊÖ@éêþîúþî,ž¨jCi0»­%m,SVff ˆ¼'Á¦ a)CwuId[Þ{4”ðJç—»AjEiˆÑ7 D¬p>ih I&Ãà/GXó@‚öb="Jx¥‹«à.@iÈ%h@IqfLŒÁÑl L§ãVY+´ j)Küˆ(á=”®Ý ¼Ž‘(DŸ8ÒmLŽ!f¢æ\n…OLDeLIÝ*(mÓÄÙÄ®‘@€ìì®<þôi fx>Œæƒ‰t-ë. eˆÏLË©§1³LW2iïÁP/°êcM¿^Ç凛ðÁûp{³‡\6¢t kŠV61%! 2²ì¹‹™[bA¥.XmeMS¸MÀâݾL¿ß-m©ØZåÝý§õ’èq6vYÊäI’sþÒ (·æ$1æM œ\z>ïÛ¶±»g§H18Ö;·T&œÂ!u³ó©…Îi…tœA^A*Ó Ø”N€(—–ˆl+îàÞ˜…eÛùO…thUtŒlôëБB¹uZa[£HÜ:ׯ­Q¤jmSÞ‹§ÿ5á[×F’€G›ðö½VõJtìõ…ûcVnl›ÇÕî~uö©´Û˜€7å«ë€“"xt(o[X·ëø:vA™­†Õ+¸@ÀÒ’Tqš«u|ï?Ì×òçßœ~2{úl¶¹ÌŸ5qä/Z×R}(ÁoxÀËËÚ*g©Õ ØTñ‹“ž×9“!d[Áƒ ÓBhê¬Õ¶FÎДJúbÒ]•.Ûˆ¤ÒÖÒá×›äÊý؆ÖüÕÙ„e4¦NùêÛÕBrHi•CZí´°h0j$ ™eÈQM­ Â9Xmœe[œæjCÙLº"ReœöÖú(¥`^-MÂSFˉ+Á¹tQ׎h5ØÖa ‰§´J<1Œì3¡¹L’cÐwp«%/FÂÍ£õ¤Ý®Òº!3í¼"™¬´ÊdˆÕ„'cÄŠ QÐJGád¢AÆ-ÏhÈÆvÌŸ Â:ªÙ~`N%ð E]”œh¸NëåÝ/(Í#EèE•LÛ?R“ɼpÎqÞa¶4ºœ™ÌŠ‘­-¹ÑÐa"ˆ¤¤Ñs¦à­ ¢ñ°Fš¸æ9–øäý-‹ÂXuk°ðx”€µ “ifÞÙüÎs" {t!ÔëLÄ'­¨ Â…MkD͈Zâ5cΊ`œÓ°. ÉÎ0έ°)lEWÝûOQ„Y›ƒ™5HÆ4xŠ”*N"çÁ{ÎEŽV[ÏcͬKmñuÄŽ¨è BÂÍñIxPÞp.%ñQù ˜ Š%ÎKÚqÒ¾Öb ñ½‡0p3:Dgñ:¦j5¹6Ç'×Q;ÍBÁ†äÀ…bÉù,ŒI^‚ãÁj÷bi€¦™9„yÐÌuâªiv§b!† 7Þ›µåÄfCƒ¦V æÙÖ!öo?áÀÇ ,ÕŸ¥Z®¨PY¹¬¼\Í45¹8܆ƒS´¥¼>\ýš> ?5?5Ç秖dª¼ÎN 9%¤ 4ÿʺ6{Kp>3535Çg¦Rñ$ˆåΓL¼¼)Å€ãF8ºå®Ôçª$²MólJ¼,Â;íÁ{°Td%4a^¥ ¼Ü¿À„¶’#¡:Ûsé cjiÜΕE8¡m=>ØC¦ÊGNàÊŠH²ÍnüÔ¤ !ÀöøXŽ‹`)Kƒ¥”(™)“Y{«œ© ðmº;sw‹‹¸ÒíÙž£³ÆÑ#ØF€?ºdLjÜ-B±íñ)¶Ï œÙÌAG%ã•}NLN$Ç B£ë-òMÑø4ë´S‚u{|²®¹d’DÆŒó"Dk$ƒ£¨ U.1S‡æ”)y(zzT*jªnÙ ¸gÔ >“41Çå6!”Mn+öç"­77î³ó]G¢ÍG8¸måàãî\–e²>Q)² ÙqoŠ„“Ií£œßž¹P‚tÆš‘a& ¿?úJ½¤˜à’püÚK‚@5S¤QÆTSíŸQåÔ8òaV ¿m³šd£1×àÏû\³ srøý¡ÎX„Uá¨Rw¹@\i#x¤Ò1#ÙòMK‰ú˸,Äzl…ÉÈ0‡ßo® ýé’d³æcºÉeoy¾…Þä²zN´±Üh–$é t*Q%@St[Û?«o˜#Ô<ÚažËÈñy®$I0™ºPã  03iG»,çF!ì¦è=5ãæþŠ’ŒT¹Ãd™‘ã‡L€h(«xn)’Ju:P¿4IÊ2£t+› ¼…þW8N²»Á ±8FÔŸ`ƒuËK£=7Ö~9¬^úÓ{¿ÁlöŸÆo¦5Œt\9Ó}ç¬f ßN›oyøÚþÍ»7ÛõÁµ˜íÝ·0Íãñ.lüî.|6;«ì¬¬²³¯k³Û¿cxp‹^o~a„Õ¼P#³§·Ö9hÉê¯/v·Ôíoþ˯ àóÍ_þí…Ÿ›²µê³Û«û›ã¼(¡½ ±_÷<¼,o¬ Ÿ‰³…E¡Ýq\½§†‘hU„r*úpqÑK#ÚG±!|³±]„Æn\î—˜ùÙö3˜]˜PVD©Ú´.+‚Ëv”)i••ÝÔì qb[\ìÒEãEb:ä~%1xÊO»ÄŒLêQ5å™ÚuN@¨.Åפ¼1T<Ä´ÔCÃU{ÐÝxxçº|ˆÓ™\R-MB:–æ yFò1:=ÒîÐé‡wð«Ç?"ÉâåH`onM;Þ‚µ’¬Õ««ûU;gÏkŸÑ±ùgãTØüñ#Z £6—LycÀxŠZ;ÀãÒÝzt<‚gÇM r‰†ßÙgD-AÆ/¬ÃÝ•öËïÖáxùrí*¼a­´úàXôLíý̯\¡÷ËËÕ­€}ÞZ¤¿ÃûYð¿‹ —‡öÖwž–’/j)¬ ¨Ãaðùvˆ§ ·ï|GXàâÔžÑü2‘ .Éz6-ô~ÛR»žÀÛªôÄò§ýÈ//×Ylöt¶xn:A+A;t†V­Äduùú%äÝ«;qéY5œÞôîo¶ðñè''bÓË-oŒq½ÐÒË®×Áeœ÷£_ªÑÁJj`'øËúºGÙ“§Œnª¬òÆ•…ß2Û®²ð¶¶¨ÍZ°:ÊnVŸà˜ŠàtxQM í 8‡$£v2ñ?c’ZQ‰­cö ñòtº{t©»qžå²Ïu\’Õ¤’Ù„DïéØ„}Í(µ<¤Ž§DšÖþ%íñ/WHãÑ•íH©Ù±óµþèñ6J˜®¹¹ÅÍñËÛ ÞÖ–¡Û¼6µu럛ӊ›9xÃÓLzXÛ¡)+òZ=ý‘c(¤ØTåèã÷ u°|§Ú8μlà#)ibèæf9ü ËCÁ;XÞAå=ÿðܵ³a•X6f‡¿T¾];ãmmiçÍëêQí¼þñ µ3¯´ó˜óü¾…Ò6îî†q¬¸<ýpëÔ\¸’ÏòÆùô™$˜%f3×YÃÂ!‹€†+åž{äokS>rŒ†Årñ© ]cY¹ÆcÜ40ãª÷¬éñ˜©híùQíQO˜«N˜XÇ&±­çˆÄnF‘?ζâǵ]ÆN½ÔægeÉ9Ó<Âb¶0ל Ã­ð‰‰¨Œi µ]Yr¼­MKþ_¥Å™¿+—ɘԕ4FÕáw±´¯µÑ÷ºŒÓqÕñÀ¤Þ­ÃMìpñ²&Q}S”HéÕf›-|ìl*¥7­‰R1+Ý -¡z™Y ÷è%¬p@I×´kËok‹åŸ_v‘üõO¨*H¥*Æl©]Ô¬Dl$Iaa[""x= è$˜Vmºx(ÞÖ¦¬‰Ø©[˜NV°1çxU¿Ž¨+ö…¡­=|lBÏTu¨ÅÔ¨€3’ƒ“9F®¨U>N *N#K:´$A=œ¡mmê€F:YÖÿÚG'ôïUåß¡ä™…à•´Îi©‚ͶD•+k¨Ñ"ŠÐµ]Š·Uí,,·8€»NRŸÝweÐ"É\Óg³EOç'+Sîµé 5fð+HÚg`ìu&ãxÚüñuGÝä å1Û.è­÷Û.h[›ptÝm+è*ân_„öñ#ïTu¤ÀÔÚßÞ!ø#ïÀ´vV39ºÜTÁKÜŒ ^‹Ŷ£;IáÙƒö»ÚCã'Í2S›SQÞ1ø5$íS1Í•&£·z?9$UjXycŒ‚A¯¶êP0ÿÇÞ³ÅHr$µÆÜ=Ø`é:!8Ê}ìZ;3ù¨¬¬ZÏg{}¾Eöže¯å³8kÏ™¶{ºÛ]Õ»;È'ÃI`à>îÄÃÒIF|œø¸|ðø²þ,@H'NÜ'/è>ˆÌªê®î™î®êéy¬5¥ÝéȈÈ̈ÈÈÈŒ£¦Éjf‰Wß>áøT2u:A²Ô$hqžÄ}~Ùœ‹Ë‰œîa;WÎgÎ&ƒr\Á2 Ì 3L4X`^E¶Š%DËiî{šÞ·›ìÛÆ´öa-´âf÷ÆÙ‘í <¨†­ìiYÊm‘pDAºªQZªžG\‡‚¬˜nƒ»Öd»¦Î ªW7×.›€s±˜÷­|è†Óóp©yH:Ä2L¥ zE$X k ³A"Út¯†ß‡²{¥îz4Åéh©¸‰f–R‹h,ab'LR&9RDƒ¸£¸QÄîbXóB>¾ßj Љï»B ž< ~/c,LíÑÀ>8jš¥t–û¤õESÑÑ¥¢zgsn°~µŠÌÐKNÀ:n«-ÆSÖq¼Ô‚ˆ E-C ¢!Žâ8Qð‡4ŽlÂ-m$Ã:ĉ´œë©ŽËi¥Ž¦é}\d¹}\VZ„­s ‚ð#F{N*Nu³¥ðÅ°±HŽjÑŸ%ç6#†|©ÍˆŠ’ÁdØ HÅH1–P%1˜}’IÒlûÖbXS®¸ezóœÎ¼Òþ›L;J“e¥‹“Ñ5ЕGOl×(Ö`êý™‘+][DSn;Ü{s±±0u]±q”4xK,âž@H&™Þ–HšlK˪¡SFaıŒ\Q60…….2¦™!¸ÖÁéËg?Ç1ëaÉ”TfÉ2œ]œ…¸>g”Ѹ‘À½yÂnO>u,³ÉÖ„QŒ¤%aœP,±¶ÄbB#f¸”\Õ —o²]k2a˜ÖáöcnYÆ‚4†€—Y7fl ‰LØBC¥+ˉQˆjÞ,~1¬Iw¯;Xc¯3‰…úíÀÉwgE"¬ròͧ\O¼‘ç ×uW2\¸+ bã‘P¿ŸO¶ÆѼ¢‡ÄÈL…Ò.uBêâ´X fË˧ØjãéÞ;n#€£©s8ùR'ÈP©0 aˆ?¸ÖLÄ’áØ ›0j•j2·Ö”_mÙƒ69gc¥“>åû„‚eâfàip„l>óm¬Jj¡ƒgøWº»MNÌ\ÁAÞæ?]_ì@ì¸dÁúúv¥&6™“ü®xÍ—¤™díõëÀŒ›ßÚ”(ç·Z›Àa­]ÛÔí­Ô…¿o¯=cºf 2»<ÿnØ w9ÀX€é•0ºÂb¨i|¡oº/ª^?ûÁ(ŸSNýn–õ¯lnÞ¹sgC÷îîï˜îFo°³Ùîjs·¾k[í½)$‚t ®¶Ê7úÝV :Ù¨°_sÜ ðF¼Á×e(ÊIrweOï»OWÉöÚ…³y9ätOy$7…_DÛØÓl¥u¸=6QºO̪~æWˆ.` 1C½€`žˆÐ…­‹×Ðõ× ¸ Ešõ†™Ï-º^nER›È؈ñ&ŽqE,¢Ú§Iž6~ç×ñ^Ç?;ã?<ÿ'q1¦¬4I‚ñBЬ6± ø—8Ä¡6§ßùu¼×ÁñOÏÆø'çãÿ$.a0;‘2Ñ<Š%MD„…¡á±à6¦§ßùu¼×Äøßéô¤è¤·ì°«n ýìhuÌÿ˜Œ§Æ?'4:ÿ'qm=zí OÝ|åù§×ÚÁó/=ùìõ§‚ÖúææËô©ÍÍk7¯_üüÍçž…‰. nD7õ.ÑÙÜ|úF+¨N¯ïP?³¾ùÂæ] »—‹¯ëYåÍ i7éöÞÝëtÓ«‡€ÁI’äoûgÐð±g2˜×óëæÍaûöÕÖS¹ûaý¦Ë¼[:#®¶2s7Ë_~Ü9®R“]}éæçÖc?m?ä‹ë/=±þTo¯/²¶ìTá\új2~'ÏŸº“{%zƒÊs×r¯@î ð/dí¬c¶K¿Ä•à™|hmmæ7Ö¶:íî…‹"2ÝPiÚrþò«­4Ûï˜tט¬åOô*Èq8È©´ûYõÎëâ¶ÈK ·ÅëoÍ`ãõ´µ½µ™ß©÷¢Þï¦F¹fJ§ß®à[zEj¡xOIÑ~…KÄù¯œ—.ëõ[¹I÷‚n/ ò¥Û Ûm§î‚›º¼Y¼¾Þ1AÌìåÏ#DúƒÞëÀ¿ÜX6¾{¢šG·úàpO:ÚH6Ê”»`î~s_2íPÜÌùGéTòT–ºÜñfº:p|žp»¹c?pp¢«úg*øwÅíAïn¼‹Ð3sƒ­a§RÚi§YqnuÚcoiÕ±æéÝ~N´»9ýÏ‹3ÊÖë\ðâa0ü’ 4ž[w©º1*®Dt¡G9ª'`\™È‘yÑo¬æA+)VÃÁÀ'*A·íÎvŸs%‡‚ÚÚvòÆ,[u’ßd‚ߤ!ÃÇ$§ñÙö(-z#ê C`êH‚-A!=…‡aóD§s¼…3É3(ðr¯N×*¡8Q7Å©!mìrL '˜D—cÒ˜²Ïø‘xK”¸‰&”y PVáÈŽl gUÂQáè*]ÂÑá˜*S©%™&àìTáì”pvÃiWá´K8íÆp:U8£>9gœÌ€Ó­Âé–pºáô«pú%œ~c8ƒ*œA gÐNZ…“–px'«ÂÉJ8G´ÕWwXÂ6ÆïvÎíÎí:B©²²ÆÙØÊ* (Vû@å f LsêÐ(]µë,c'ÕÆt@ëÁ0X;v:äÝ"ç0kw|ñÙr—Ö®c€¦Óª,crZ®pëDÚÈZ%±±‘p'Œ”a µ±".¶ƒ¼áOàZ»<^Ø žY˹7AB[[Ú¶mîÄí]30õè0>¶ÉXŒ%UšêX‰È(#é6AÇüzÓ¡LÁfµ™FqdµL4U2 e)Ç”2*¬u‡ì6f"â&±BĆSÆqîHsa%¢!‹´;]n>;âö}½Ž³Ú*¤Õ£1+)µ:”¡Ž]Â:,Q&æ4R¡‘b+‹½EƒÞm¨Yϯ³¤8N„‰ ãÌÄÐU4 ã„Ä‘4”k‡Ïá`Iƒ±J¤¤‘.I³q{I°P.ˆ¶îxØù4øÍh.&£Ç”Û'$QÄL¢Š5D ‰ E$Ö‰æMÛ_ \ Üi)%F(–± —„„Ú.j=Ì3kŽ`4Ñ(‰˜„s‡6ΫAWq¤š¢Æ …abó†baMD86†ZjpKY ý4ƒn´S“€Z5TZmdÚШHiáÄŽ`J4b†Å 'I¢ÖñEÆþÅÐ/I¢“¨™X€}Y›sÐ`®¡Å13Ú%÷"K®£Új¦›öý„p!9tG*8óp-n3'EJ˜×êû™hwꡯ¡IUL]@/VÂF:îœ ™ÄŠZÌö³L»òlD#ô%Æ6À0èUP 'yÈ0qã·„E‘;%16UŒŸIEFÄ‚ë…jkD„íÔ%!­ÁÀ)+II+XL5‘!ãI'º) Šã„4A‡ çcŠ1–qäV"GµI¨ßÜ¥0€j㈸ô'‰Œ@ú%ÒÕlˆm,7(Ñ AQQ ìg!0£bAKÄ {R ¢ÆÉ %jÊmý(’$–Ú  K"†ÒÌÑ\oƒ¸À0$A"Ò’LTăŒÕb¡ÜNßh÷‹ÃQDW»pà= \kJ†ÐÛ†>£2D˜iA »ž4#H»Ô RBÀøíèÀÈ»9_Œ¤KQSÖ.`$6&,Ž#Æ"E©€!‚5“³¤iÓ`Cþ¡v¡œ†ÀpGT¨Xb·ÏWa³°i²öëáζpY>„NŒnP㉑<Œc°?°»Dœà`ÂÃ(qòU†`#J*Ü>«ù¸Ã€¾UL8jÚ³óDº %åÎßc–JƒQC‰’õ)Œ-I@@qÐK ¤DbDAT °1#ÀO§ÎP|dry~͹&Ömv›ìA3gÝž6®QWSÇ¢øE•õ_rÁä“ŸÇžÈõkÏßxæáµwÃïá럿ö|>ÿìÃß¿üƒŸx >þôúµ'nÞ½ï_¿ýèûŸøÔûÿñS_ç;|é÷¾÷‡^Úûìk|ÈÚýÉ×þù‘݇üÊý>qá—Þ™¿úéå{ßþÉû~õ×úß÷7zö¿?ÐöÊÛ†ÿ·ÔÿüÐ;¿øöŸúæWßÿÏÿ¥·àꟼúµ_yï[ŸüÒ“¿üàÚÞwýÏ¿zõÉOüÑo¾ýä»ßxüxã›ßZ{ù?¸ñÙÛû_ûà¯þ6üî?~ïþýö«ñO¯üËwß{ë¹/ßÿê‡ÿp÷Ó‘xèËÿõqýwïüý+ßÿØÿýþö×ßzëGØÿìßlÿà[÷ýΓ­ûßý·Ÿy×Q{ýé×¾ñäk_9=~Ÿµë@üIV÷Q^óÇ?m5=þâì|üŸÄuÿq2ñ`=ío¨À-Í/k¦ë6GƒœGƒœGƒœGƒœh•ETéY™º;" üoÿp± X¹g:f¯µ}Ø´\··$±”Âd\‡B0Ã… ‰ÀJDØZ&,–ºù6Ç‚Mj0(ËÃÐP¹$(X#îø(&±Äpƒ5øti+RÔRò Þ*j>,[£¶/ŠÓáÞžì;©U¶ÄgÜzîúžqr†^%HElO÷  à^¶¦6Çæe34‘uÈ2pnÎ:ðÚVr«,Iª[M[ÛÏô€ ÄMƒÖÔ&èÙ\®»þº‘ó±?×y-9ÝÚ¨NêEù J#È^hIǪçD{÷jË“²KÊgv½a¿äôV©¼'ùé7¦î’m/bs[©Þhgfq«‰´YŒ#Eb¤¤`œ S«¥Ñ[×á­gAC8ïH{8•Ò n?½Îs{× •àk?á…É—d/Ëz3úqÅ„ÿL l³Íuˆ[í2ÕdP åf¶Œ¢ò0%k¹–‚ke)SqdY$8 9¢‰P6Š+UäàÝ×<1EÇÀx¼t8ÃSãò+ƒ‘Õœå/–¯¶&ºF•Á3›×PY¢H%‚*a–’à˜¨˜pê³Õ¼‹±ñþ$[wq“6eóQš” Ø‚pyÄplÕÅÚÒˆÅ(& S–jÒü4„ciÔÅøŽX>>·!¸xZMÙ”½GiJ¬'œ%‘•*Áq"I EÌH-”?è»yS®œqÇÒ+“>îå‘^Ay0—Ï»¶¸)›²÷HM)#‰”Ž)ÆRq‹MŒ¹Ò‘ˆ³8qK+ݦ\Hú‰qÉàbökÈÓ£´ŸKÆÝÅ9l”Ð’ ¥- sKÞ<ÂgKQ.ÆvÄr;0æt%jSÖ¥Á°²"!ÈBDZIœgÌÈ"FÉuò†‹I!1J¦qz¢iC¥S0çŠWÅ"±ZÃ4˜Hw,ˆâ, ‰BËÉf0TŽ¥#;â·ys(:ÇÖŒøXÌi²¸k4m®#Ó"Q˜à$ŽT„8G‘« 0'1±I–û³Ø–q$”L#Pm&±–JE(¤0_P xxàü¬c‹éO¨«'ÕQßMy[»GÞáΑÒ\ë©¡‹u*Ž!Ü%Þ¥Fö×G>&¦â2*úPë@iÐËzcgæ´(÷žwÝýÁøGîŸ~võÃpR”nø*Û),Ñpí´çBŽW7Ω¼`ŒÙóÞ¿­MøRŽŒíK‡‘3YV,8”ß«‹ S©{ʵpJy¶ècW ¯_Ùåä°ÝÑi º:˜l8èÂ÷ Óç×ëï·‚‹n!HýžO¾ð’sŠî¸U²@‹LiéÂßrg¢îL0Á9üt¶ý¼ûn˜ËBA‘ÎWvªý®|~­ìrÓ Õm8?ßî¾:-`*ìÎY]pùæ®Q¸CÝý1Ò®Ôój#¨ Þ ¿½sV{¾w&ˆ+Öè æD¾3sDá+wÍâ½°Ó˜läåõ¸¶Ÿ,ˆ,pú3Uݤó×?Jomß| Yïð­ùzé«v¯nø&uØŒ|Öi,:0¯r2Yl_öoö¸<˜e*Cºr%_¡_b«$Eä0’ãY‚¯:èg‰çþµÓÏ£“ZGŽÉ£ÔÜÙT ºNè¥àå`¶¤›G‡÷†Ùom/–žg_öâ"NJøl]²Z¥â{Í,â½¢i.Øòuªƒ c,v/>æg`nE¢ŠÆ‹§‹¹{¼ßKÓ¶ì8Ѩ{ÃìÒÑ+yç­èó·éÐÝîÚÞ`ÏqÁ®HÄ—&çŠÑSÚe…Úí :óUÖSgGV3˜‚€‡?§«fЄûί©5—Þ5&t§'½ËóßÇ3ê{ÛÆçj@‘{S ä½o–(§ @$ævnv§7%¦`ºQHÍø\,Æúvj.]¬è¤`%Ãý+9# ÀuÚ ñ?H³CløÕˆy2QÌ5z]=¿²ÕÌX°k4…½u®ÈüfB“M´ÂÉ ‡ÑNR«Ü›SŽ«geÊá–xîm¥uÒ>ϱY‚ÖÝÌ­m?«ö‘¥¥7Ø÷[ÏfØÝ'(J/ƒí¾Z?#ù„ìZâ²WŸs ´HÕˆ;+¨}îõ8Òó4¹0¹Z o.yoZêí¹þÝNûðTº  <OÜí‚°Í@"éÒ2ìjP(”ùàzO«ÎP_µÛªP¬}å¡©ÁÅ¢å+,ÆHQã ¿ŸÆiÍ|ŸTd¶»;—½b„ÚõZù„4º÷ÅÝ)…÷ÄMxjë,´£aPcaýì-V-ø!8È·åÌÉšgŒ‘¥+ÔÀÀ£×åÃc¢zƒIû½®Û2a¿6íL¬5·sê×ZO=¼~'OV¹ZŸ„4Oç|Š ªŒOGȕü¡{eÒŸ·MÅo6‡1Óoß‘9kÌ ÄgX{EŠÅæP&8›§i®!…Cz€(L¦%L•²¦êâ`4> ÂÜy ÚX1ìd·f§ ãk¿¹Ø¯}öÄþ b”òæ¹Ä}é,Y_º“rçRáRò–Ü<Ç’ïß©ÉœpwÛ ‹/ò{Ñ¥\ÔßЀ¡i×m)M9~Æþ,_ë’š¢ p†Î”íO¿WÀÝ=:íJÝÚNRÁŸ¬ ºí4×mjÍÎÈ,ÙÅ›­NO¤¹ÍFSšëÜÏÞD <;–À–ü`Úÿgïj›ÛÆ‘ô|ž_Mª¦¯c À—ÌLjYItåX>IžlªRå% 2Q,y%y2ÞóÎo?¤(Š’ØÅ8s{aJ²B‘Pw³ÑOl!µ‰lnžiì‰_’û³™O0`CÇlR{&‚¢0oz©NÐå+¥z–7ä¼wÇéE~¨ªûMðÚ)Fƒ°!“Nü°å+ÿjïÿ<$¿Þ7’ßo[½m‹ÿÓ¡Å®ÑÈoTòbb¹.)óÿRöíù¯²}ãÿ|þÏ…x?ù„†)Ú«ôöü7òÏoäŸßÈ?¿‘~#ÿ„¨99¥‘H ˜†qGnÂ,ߣ$¢½Ø™¸Y=W-öOŸ{‹8±]ÏrÄæIb»$ œ1à$û 1Fh–ö$ìL¡£>Cç;§C·h9y‘öa1g¡Õd|¼N½¿°WŽJ ›•Ö¥3ci˜+7=z!Ýgδš Z;OE£h”l4ª¼³xhö(ŸG/ZG}vèvt”w-Ùm@v{Ó ;åV½õèíÞòñßÙ8œó»=‡©&Ìd§€ìT_ö·;dgÛ]mY~W½™Êî²;b»»€ìîAv¥Ö¼ýÏjÒÖ¶ZmËò±»Èîý‰íî²û²ý"¶ª[:Ö2ûI]0ÖùÉ£&73ù ÃDK~´^ ZEîŸÞoX¨iÁ›ÙäîSÌçÁDþl¢j½—ÁäWñ÷c,kØ•£šÉ€Ö³¯hа ©¸t|uuu||u¬Þ‹¯ãòþ«â¾­e&?jX Ô”ü-õï­Í×Öþüòýþ¸¤‚¡ü°a-`;ª-¾ü÷áùpÃZà&ä¿ÿã?îÿHß‹¯]û ï­+¡Å‡äkœ”½F÷{t!>ý,^gH}þYý¯“îË^?¯Þ;èþƒ”~ã Ê€Ö¹TþºŸÜ£Y&g,^“•¬Ánù¥Ž—0“ŸI´ SÉßVrN29—âu»’uº[~©ë½R àB†òøKôð¥Þ2]Ë¿HuHeåò‹h-?*)`(?€¿D…o”4w©tÊRù~V~…²ý¹üi‘Ÿ? ¢†òøKôðWÊÓË%[É ²¢Â«ü¾¡€¡üþ]ü½G£-9uåßPÀP~‰.þÞ£n}ù‹ Êà/ÑÅß{ñv¤Þ‹¯£û7öµR¯ùp´RÀP~‰6þ¢>º¿Iý~*^CñŠÐýìÝ ûgi¬‹Wˆîç÷(P·Va'2sùü%ºøûÃcÛÿQ Ó¿›ÿÛ÷×䜊ÿ­±/Ûï5´€åDËÛÌä·,·5±¼3»¹KK³žtž"5•q9«Žåºæãųá-c[5ÂëzíFä°ÜÖÅò¯eËmM,b?{o1z9þnÞÈÒ¶DlW4%è:XÆóq0Y¬c© þêþoᢘËà/ÕÄ_;-x— ¯VÔ·–¤ìwª"HR¸,Ò’îxÊgsÉÌ8—ú\Ï–’ÔCºÕra,?€¿Tw,-ì/Lü›P­PN´˜%ËÏA¶ÀS"ìâ&Ž$ÌÉEKxçà¦)Ô-R®Sùü¥úsÙ_%þS©&þŽÞô†hØ5z×t‘ø|1èÿÒ;힢—ïÅ—]Ô¾½éÐ?þÑŠ¯Õh%²´ÏOÅë=êþýbБ8¨ŽSMî½½8ë ©…ƒöù¨×‹d¿svyÚ;}Œ^^ŽÐy„Îzo{#qب¬´Û>ÍT~‡©&÷_¡·ÝAç¢ý²wÖ½W~ÕKã¾Öm£‹ö`Ôë\žµèârpÑŠË#®ÚioØ9k÷ÞvOkÄ!‡©&÷Î…}Q÷—îù ß´ÏΊÎó²+ ß~yÖMõNsÚt;#y‰VŸêö‡©& _^/ŒvŒ†ÝNO~èþ½+ü£=x,½»Ó?vÿûR$¾D§í·í×Â]ž”¼ÌP~à0ÓÄá²s‹nܹtßÊë!|kxùr8ê.G]ôºß?U½uØüÒët‡?¢³¾ì¿¯Ðå°kšÇ1‡™&Ÿ¶Gmee!¸pz!”ô›ËaO¹ï|Ô ./F½þùSô¦ÿN8š¸ m!ð©ê'ýsåVæþÃfš8,¼½?x/(=]uàcôîMWìÈÎ!œg4hKGŽ½Î¨x˜ÐtÔŒjù?p˜iâðÚÑy÷õYïu÷¼Ó•’õ¥ïzÃîSkzCy@/5ö»¶Ð÷R¹—ìëâZȦò8Ì4qxÇŽU B½W¨}úKOúH&£™Ã^^U¯è¼É:òIÍøÃfú÷”¿JÁüešø[®¢;F ¤u"ó¼¦ã›Û‰H§×G®ª-äø@=‰¨–üþ2Mü]S›Ÿ wYzÞÕ™–0”À_¦‰¿˜ÏE~ü2]n£ùa²ü1Ý}’íþÛí³›Å-?Iæ?|\þ¨ ß 3M>›ÝŽÏÎgñ]Ìn£OñRi±Þ}r“îþÛx*Æe+EÒ°ØÑ7´Ê`±óðõ]-30vJ`¬×(€Ž]§Q¶ØjýµI[›™À-G·ð*bå7b„ø²+pWdýý·m1RÀ÷HdÝA[楯ý·YÅïÉx*˜ÑlšŒ?Ê5ÝæΗ£\n†Þ@—ãÖqLO¯N£@xw*ÂûšºŒâÅb6ôâñ8™ò8AýáÙÕ°Ó¿¸zcd2ˆÐnE„Þdõ³¢J.1ÑtmYhìVDãݲêý,CÝŠMÙÙº …Á·ÓñbÉO>IÀ5ˆ¿nøëñ×­ˆ¿—yÐ=ë¶Å8æ‡ÞΖ?ª5…éG3ØêVÄÖC®<ÝŠˆXuå×+¿äý "óÖ«»Zóx¢fÐåš«à…¹›ÑЭHäëIOiAúœº¢®ø@Üu+òøšâ[ñÕêj‘è׈ï®~|×Þq Â/ä"S È5Å÷Tð¬Æ·Wg)žgÏ$8'YäâO®®¢›ÉíB¾žšYˆÍ^Å쌧¿ÆwŸgsþè…¤tžO³C6¦lD“±8 îFÛN ëˆàm"Bÿ£Ù.Ì=í`þXÞ'fZ1ÝÓŽéf? c¯NjêW5ºêÌB¨À~*ÄïúnºˆxŸÊ¹Ç¥Ó9ùò¨½q(o\rÉ¡‰"æÑt ¿*æƒ =8¶eNL“(Š\+ñHÌ#ì8<ä‹hªìm©\ZŸ›)?!%ïgÖ:dk¥ åyM#Ua‹†‘"Ÿ !– ·9,b', Ìu£'q”É72’$7YYéHÇN°“`úñV‘3lJËHتB0 #±Û4²bGqÈüÈŠÇó( ÷=î‡ÒHâGvi¿òˆ¾Z%wᡆÉ`‘ÔZûß—¹Å4MU…˦Š¹G½À ™‡1÷¦¡kÛÔ¢vìXŒ3žš ™Ê*äÁWY*¦o)X¢›o 2–¦©ª² Sù—ÄVè{"H~hQ‡ø,²ÆCêª i*bd*bî*ñÓ7,SÞhj+MSU%B¦²Y’00ÂœÐg¡‡$p/ ãVÈýÔT¶Y,šªü¤ SÁ2­ž`æUU‰–N@÷B7°#;)vàZ˜s—âÀs‚$¦L\ÑÔTô; ,QþL’U°Ò4UUìy¶-& IÄFbDcFVb…òY ÒTÌûä#õŒ°âv1ß•èé ´ð±ph+ð]?â–¸–Ï,'¤Ôr ‚ÈQk^¤‘¶ÇÝF:4uÔ2),ò´0VÏ@ˆï7Ôÿ·^ÖŽ+™ö_gõ &ߢ‰“`û"_0cØKlâSî Ç Ã,2nço»/Žôa1êÝ9”lè V†äòWéUÒ3e%僆)iB¨ès ó9‘Eᜮ븖mEiäÄÛYÞW3eUg0Ð*7ö‰±«çop™ìB¯Ñêù\f Ðk´zkÑB4{/Ñd²´Ø€b÷–³t¬žy¹æænà¶9h!°&-D“›ÑD ðBà*^ˆ½¹Aápÿu9ßË— hàر-†x1ñìüÙªÿª'„IIŸ¤Oâ=Fë®}¬5©ñT·OUO`á*ª‰ÃM‡®sL(‰CÇ’Pƒ”Ä"žçÚq†“TXD[Wø«h)×5ŠI&.ŽHœ0ÄAàÅıœ$$‰P<*†ïù8•¢lõ­ \æ°Ðj –ÀZÄ­vfgã­HqÇ“ñòΨ+¸Š"âðkI]F1õ,×IX"®¨¸¬”1Z±M",KF6¯¥ú8‡^S€W—y%ôPµLö ×(uZ ­F¡Â̽¨Óf`¨ÜÙã1”®ÕÖd`hr3ƒj€‚—(Ö}I§ûFQhEžRž!õœ0öˆã³@tÞØÝè¾âmtÛzóPÍ¢6@ð€KfÖq‡ŒrK>šKfÜÄ#TŒ8hD\Z딌£->€MeN­F¢\&JÐk€-ö‚¯8äØ °.{ÁŽímúÀÌì!–"zµx¼þÏÞ˜f(?NšìMnfq  /À%ú³ž*GvÛò˜åãÐ÷c7°GQœ0¿˜R¦ÅQ}U·—̸Š¹àð+¸Ø, >%‰å¹!ÝDÖ"9ñE¤.è&ŸÉ¬43Ϩv\f7ÐkÀ®2å€^£@È×âøš‘ˆùº<ÛEZÄQ̨‡›Éð`M€&7³Hà*"€FúbŒëÆ<¢!§"V‰(EqÈíÈv?Á./tç€óRo®7Z˜psÀ†Â‹ñ¿â«eQe,*‘Opä<°\J¹GÜû[Äb+‰fAáôÑ5#À/€Küfq—³È¾á8Œq…Nâ‹D×qì˜YÅùõäº: YÅ1°¯¨Gß5mÂ’Z~’¸NÌm‡r'ŽÅ@ÞŠ{\–QäÅÿ¼ &%%k¹&­U¤‡+L¬ÐñX 4v)Çvˆ]›z~`%ܳýP ¬'"Å(æã|¼¼»Š>Åѯu¯/€²U܇«Pj‹±KDÛ¢6OÂÆŒ†ŽˆáÌæõUJ^Eù£š6æmjè $Uœ‡ëÍCÏ<Ì1½“0Ž('8²å€WzvAïñòj^m–ÏÔQHRªHÇáÇBÙIJ vc×µc+º&ÌâQ³ÐٸʂŽx~µQ°°Ñ«ëóµ-¤CUt $×DŒã£PÄ:[F_î‹ôѲ"Ÿ0Ƕ£È/¹F°L |â²_ë) p7àwCUŽ·ÒQ§«éMº|½ãtàŽÀUÜ t+bc²X8KȬÀ²©9œYÄ÷DFe*WªOdº´ˆ„ÓIJd½f(ø&p™oB¯Q Y*“@ìv!Èö`U!fX -‰l7‰#î8¹EB1ÎeQÀ‹aJµ\N†åm+™U™5B¯Q {©¢rø‹30@Í€«¨vÖþ#ôoÍ_¾ŠTáà5 DÀU”õ×<`€ÃWq””V:çE3{¦,¶——¢õзŽNËeôH=C.-ȹ’ÝòJ£{³ ie™Z5Ý«þüüy¡º;•uógxË¥å(?g×ñ‰*,<ØûùO­P¦b,Úz”·¬¬O—œ?Ï àUë€ýDS©ýà±"h¿ƒÆÕÆËbçæiEXªoK»lKGÎœ*[Fϛհ%œÉêÛòà¬x¿ae:*ÎÞ%’å& îI–‰ÌàžCõ Ž­«ì9”`×Þ™óï7†t«Zž¯ÄÕÛ瞯¯ ¥ººäëyKky5m¶ ˜p½³~À„ÛZ̬ŠpË#¤Žk0@²B€4èÔ¹½àeúö‚ÛZÛ«¸x¡:Hº'ZŸÕ  í‚ í:qŠÄÅÇ5º‘q×ù_{|jç¡Ð§ul O\ëÛ¸Ö$ø~«¦ñ¨tΗBqY-ºBqYjÜááÅúnkÝá‹K,÷S®íQr}pcý\-eÍú¹o€`¹ Â÷~õ]°Æ}dÝn-ÿBÎÇ\+w>æÖIÇá)>2]¨kÍÍ37RGKrRmÿŸF“ÉÜ{E2YÏ}Á¦oææÅþ‹ í6ñ…¼ÜuצvÝ:¦†+ùôM]§*ÐlЩNÛ¨ÿ-d\Ê•›´.•5Ò™u)Áu¬ Þ(4°îA75ý·tæ—r[{=ÜtmƒáfnX¸B߰敺Y¾¿£ÉLËZ;ªcÕqT¸dÕ g5/5‹… ÐhÊ@Ö³NŒÔ™u‚Ë õ­X«4ÑÌŽéyOµ¡¼c¿²!uõmÈ<ÝÉ—œ n“Îtî¤Â0˜{ÛZ-6+ª¯WN/€Šg58›€ ³ QƒhOúíæà8hÒÏq¶'ý¼‡œôó ú®£«KN$W"‘3´à"FƒH[cA¤.v©v®žl8˲üuØõM¦mí©ç­{Íy ÃÛ(z’jXz_ü…×6Üû©±NR×+Ô »à5èD.3Í‚`ƒ¾LµãRÎh¹Áf©÷+–6RíâŠ9솇µÓór%êù¼†Ø —6_¬ëz{âQ“ž‡½ukÙ.…Õ·e²ZÍaž:~_ n“·p#×­sÏæ ÔÏÓà¶ÖyZ°Ú¦ùåeŠíq5ûk’ʬœæ9ÑwBSΔŠ{)ÁËêpt„Šg6—ÕâB®3ñ ¯M70ßëÜ09Ÿhü²ÒÆëicƒ™wh˜‘J¿CÃm­;ô,ÚvÐiÓ%BnaÀe08ÆÚƒ”Tš‡e»Þ¶´8ø~žSèõ2¸¸^¿—Z¨¯‰š[ç~¡éQ¯p Ú«u ®5™5¯¶­ž×ÈÊ}Ñæy[ºM&vþÚ¢âs°³ê‡-¸­uØÒ˜4ɧ÷Ö§¨pZƒá‹Â16¢¾‰6ÉÝM­ÖØ7 ÀyEHàiP‘¶µvÍzÂÍYÃÂI :-8ÁŽÀŸþç/Ïž¡d|”.ˆž={QØ­Jo§Ë…Üý½Ú#œu¾DÉl&bªœê\¦_}š¯¤M¿zÔ†ä|/¥/^ü´sÙ/¾-už/²£)z+^ÿu;AÄEÄ aû9už3O>pýlÀðåkRÅ?-—7Ï[­ÏŸ?ŸðÙïwž'³ùÇÖxÊãß3÷üþ§ñõÇ’h1~~´:ãfúñ &Ë|þ{µÀŸx'Žø˜Š,v¥*Éoÿ“å¼øþ;µÉÏ|©}-yM||rÍÙwMn–ºÔTþÅ.³ŠÓZßa"òVŠEŽe'$Zø;d5*ÅžíVºBß…é“÷}ÿtó™Øž®¹ºŽmy¥~DcfEåD_[¾oÛ—Ý6ú?ϯä UG "ý0ŒE¦ë&Ìò=J"ê‰48$é\·ÙoýŸ‰N¿Ùÿ f®ý­ÿ?ÄöÓ_NûÑû‹.’×]\¾<ëuУg­Ö;»ÓjŽNÑßߌޞ \±ÐhÀ—`LZ­îù#TD³Ï¶²Ñ õ»lëÙ»¶æ¶dýî_EN­%‡’‰+ÛRÙ›œdSåäl%NÕV¹\ªf Á†.JÑní?ÝsÁ… €¤$*¦(—žžî™éozzz |Y~=)jožÒ‚¢ãþqLó³%d ß÷ÅÛüYF(üƒy˜Qxö„ýkßœéß kò·O*Ûø°‰xù5†Qæ¬8ûýÃ'·’-"ÿ<ùýÝÉwePUÎOÿ{æWïˆ-V—¤Yí¹ï…Æ—¿PÄEÂÎ xUž&õ}œ±°ÀÄL¿²ˆelŠ›ÄÃÏÞ$ñô‹D  òÓ0Ïu ¦ÂxºÐ]Âò+Æ ]í¢²Šø––‡Y<+êw>“"®Jäðù_s–Ý~ÎùÎ+~§ß‹ônš3‘¬eñí¿ ˜ôbYã`EêT¢Dˆ‡‹t¦ $GSmš@ì:½aZqç<4ÒâB‹¢¥91ÀW²è¿XWÒA™’Œl> Í„i!K’|FÂxzy¦uþ{øHþ>¦½)7ð%Óx i²øòªx¥9îì×øܤê¦|ý$a<2>uصxF+™eégŸ€êªAàõíwõyд~Îí“›ä8A€ñKA‘Å—E&þ)\Çk©0²À¾lJ5”sùâ Ê‚Í—?SãJn²ôÖÐKl-STQ{𷺚Äy!oÀ­$®æ%ulËë{þ3‰§¢þÿà±Ír+ ¢}xq >‰åá"hÐ/åå>DÈZÖºAã{RÁL™ ¹µ(N¸ù¯,}õÍËy"”WM¥tO`ܹ*Å øoþ0¾EÖ]ëµüå,Q{˜{ot;ñÁ¨äP±×ždAo¬º•,R´'½l$˼Ûé s]qmíˆ%VÒ)D9Ps¼…r`¤*y« ¡ ú…Rî´ËŒÌ®øüLòòjĘ́Hú äC6³Aœœ‰¡±‡È/ |1] Ò xã#ÏÌÿäÆÂ(êè۽ᣛþì?`Ú½dÚÇF1 ÿ%7¬ˆC¢ð"nõ;Ó±>JHÀ’¥Ï•wʇ?½ÊÓ”ö£œ_˜6À †“¿ù ¼ih9ݳ:Ç#ÒÏƧæè6¦Å|³G0Þ¥`oƒ„„_ô‘p-‘—.3v7qàš„ñx‹Q]Ãòo•ÅšÚɹ*m¸Ï‰Ê‡)ɾ¤YxS«U Q%0¢R&g`tm´LµëõŒ ­äíXÃVG¿ÿúþLÿ@&—C Ìÿ>á!ìð·Å_cü/çXÐåøú–ýuŒÿ0ØOÆÿÉÁÿ÷@ÿßÃøÿJ?æex`ÈÁëwðú¼~Ë\l¥ÇežeÜó'õ¶äm6ämx—pDíÞÃû[‰¾V”QŽqÈÀÚ@rý.I¹ž% Ì^ßÔ¸JgßË÷»Þ½ºÂ¹‰Ãh¤òÏÿÎ2†ƒ!ÑPZá!ZÉ¥&ÙÔnãâJÃÑ:‡‚`(eµgóÍ1zF’f#á•|UºE•ûY†aVœü¢H/ÂÙìèøÙ+m™C 瓉  5Àµ DAh2ǵÇ Œ mŸ1ÏqJ§Ö3!¬ºúà€zTËÿ3Ùd…ýßZüoXcüÞÄÿÎxbðÿCüðÿÃàÿy'§¡†Ðà°ò˜æOpå5ÊÜŸ9ÀrNú ÿŠÆe’$iRùQ\{Ä؆ÀŒ,+ÄŒ/„8lB"Û$FH\#ŠJŸÀÊwÚϯ¯Iv‡ã‰’Ñ788‘H[¯OÈù¢nûH¬°›†F<{3kn ˜46®èç?¦j^ .k˜§|ÄÅ–t*ä8{€ÿ¦<ù¤ &ÔÎ52¦¡:a¦Ë¨CÇĶüŽ(´±ëN6Zð9wµØ_ƒ×ßôàg]Ø$.ò/ñì"HÈôË™Ò ™z]45¹!•5Ò»0S;îŠ,®ÞaKTC&¾çG0ô<×Ám¾ñ½±mMèØ¡ž®~¸jp“ê½(¦›ÛJ1k5#´ÑOCE´:BÓ4ƒ`ì: ß{Ô$fHpËðØô¨O7ë)ñ´¸mt3[jóv]È„#ËúE?M •Î6š0mbR;¤Ô¤,píº R€4ŽOœû6fuóÛT†ðm§¡2ÚJ¦gÒ±ï¸hN&ÏŽ|Ër¨OLgzð-µ1PBÛhÃ7'$˜@W´ÈÄ™PÇ·"“8–eZã0{ï,z7¿MmdË®1T@Û(cl’ b†!0}7ˆˆãYÔ l,—çÓ}SF7¿MeÌgE%ë5¢¾ãs=Ö@‰mÕU&®±‰a{®LÈØ\°]~`†ÃÌhï®n~ÛÚéè.ê;Î&ztÛJ9‘Å,Û‹|BMƒ.îÌ7¼p<±Ã$ÞÞYùn~ÛÊaSº[ý ”Ù6ú±™1ñ22À·ïDV01™OáJì›~ºù-õ:¹úœd°:†Šh+KÊwÓ (Æóß Ç,˶g¸Þ~Í»¹­f‹$b‰CÒPÆ šåÔ= eÆü«Ûë&f ¨¶QËÄ3Ï7˜M¨?“fÃgÁÄö<íûÕKºù­Sdt>«éºL^¬s¤o”åáP©à;\&ç+ªŒˆ ŸÿÆçN0–ÄÐbØ©VåÎèS»ŸÓŒž ^½ìÜ72XÁÛ4&hžAäFQ,r Á”í.Né¬È Íñf&ñ¾\ÝÌ–- S8Í2Æ*—ŠvÔÝ‹‡ cÁGÄ ý °Ü€PË 5‚1è®Ã,;ŠöÌ×Ím)y‘¥n–¥71e´ DpPUwÕhËÝîÝú*³môÂȴ=F`…Ô¢^H\N¼1u©m1g#ý`¶¦8Ôî«tó\j ¤?-â(fÙEœ_\±ŒÕ-!ûc†Ñ-Ðu”†ªç…ùrb·Æ†Jq+¸âDeEÔlêy¡kBë0CæM,7´Y°™]¼guó\j,!ÿ¾]¥ ®Öôw/z*Ë­P¿ë¹ |j…m¾x¡c‘(2Ü aæ}¢þN~—õ²|ä0ÌÍ‹Ò­RYMgy Á@é ß…ºb½P­ jß×ùá³J†d^aY<ÁZûÊCk«¨²•è­«`BŠ´Zy_\¡ò.ÞϪ"zdñY•² T´Gýõó£%Mž8Rf„“mïüx‘æ5M¢¾767+OÓ%2[w´Hêæ•\@VªÊX1Ϧ9_i®ž–ÇŠcJó›ÞÄY:å¹ÝnHs§ê zlNnHœðÕ{q$„0vHR?ÕÄê5MªF\g êç¿ ¡Òü¦çuôÏÀÍN°PŠb¦‰X…¯’ài¤Àˆ\¶:v¶}æ æ«wD¢z\œG<ÓóuR€¯žrA 7eh—ý*J–ÓJÎëJ¨[fT€é,?,ç ­$åø-RsáÌlŒh¹èEl²@Ìp}{XuòÌ@JæxÒf9êØÂ’N?9µO–º˜¥Éfcî ¸â¢æIG]4ZíÀöÜÅŒ uBdJW7Ï1C;yªSM¶ù²jïùò Ã;ߎ›Ë8ÀL…6ïòpÀ]Ú‡ jkPôf¶c3—`–në®Ï+ñæ%üi«Êºzrª_Ø~Þm¨v[:”}ä 4a~?îPsÆ—½ÙÅüR^WC…ž˜¡ŒO]Ö/ZƸc z]ìRK®ª¦_Fòµ2–f-é,KºNj1Ðð#öˆ§³y¡é ÁF”ÎaÀ³ŽˆxW]›¥"ØÞ׫î¢K:"6b¤µžÈn㜵Á ×z.@Ê?ê‡t œòlqˆQÏ?Sz_lA4 ý1ž~ZœÔÚW½kKí(«_Ý<Õj¸}›òê=±^^y£“4ý‚›qvWªèAµ•VUU»å-E²±ÀB£ý£Rî9«VVU{±u­fpLj}uÄy¯ˆ8ÛŒ¸žÙ=­ŽzL^oBˆÖìÅR[_¯ôÁà¿ØÂâç{f9‡¯F[XmÁf îÐòôº>°ä8€àÖ“…]Ú$ŽàësvJH"ožj8Tª}§uš0:Ê5’±ÒÙ®‘Ë"YFîð¹”Ó¹ãOÊ·¨eéuÍÒJnø.V¾y•Ýj¼Þü²þ6~«ãD\?‚oǺ£c5ñéŒL¿ˆXöæ˜*†Î’Z DÕ ÑÀ˜ÚƒÜ;B±@|Zó.¤ÁMœÎ± 94×J¡¶A­Vœ. .2’Ý5 ÜLç…¬z¢:§ÚÒôÏú_ ɱ|ž(c¥tžP¬P~;~ûí[ã­¤~?±¼ôZßo“å-ù^1L^–ùËïïߟ@u¯¡PÜnµ¼ÍÝ–x'ºŠTž€.ØP 6ÑEÙFÁ*C'Ú-ŠàÆ>v"ò¡Xf üïr,©—éôXéå i ¯U] rz¬¥üi"«”p@I·È£ƒ»§àYÙú;GªwùBrír:œ~ZŒä@¨DA˜è$ãÓ`øvË´ú¢ESèêØCpZ‡K‹|ÌQàŒ$·ä.¯‘¢ÈþîcüI$§iAù@-äR<ðJGØX |Gqªêælš3ÝÏsÎá ¿”2$ôFœ*¦qõZ€Ñ÷×ø&IÐÓ~Ç« ç”òð0ZÊy´ *š2ZE±ÈÉ~ã´Çu4q)=„—iåÜdeÍïÕÓ¤z?z$áù4ŸglLj‘|üYýJ=ÅϯTêº$\nœ$‚ì†jTýSU€á“Dw<âqÏðQOˆ²ÐbWþ¦FÓÕ£xðBš0îï‚ë|Ð9A¡0çqÜÁ\™¦óâx$á„&7rk\^ 15N¦eº„2!X>c!Œ¡8«v?¬ªèZRþ<—DÍ0ÒìZä|»"Üg0!3+³£Wu’ºÝSšSÚ€²yÁ;+V6nYæ;åræ€ÀÐ )õÉ`¢:KòÔÏÞn¿¾âLôsøx`;ØŽ1 oñ„ð>~‹çv¯81|°í±OâõTƯÔ~n¸ýòiš RÝ•ñÁK¹XK)0dåŽ*z®â+Ïáÿsy.þæ Ìqx_˜Za@ç±vÄþ aö oȉ¡˜â#0rãSÇûhw>ðe£Êö¤\RJPG0ÁP•<4þÀL¯c‚·­M'øZ.ø,~–¢)ä¢ùŒòy5+J`f%WG8*ÝGE¹S¨)\]Ý÷2‰û Ëã~´äcSÎÛn§l†=ÖÏáãqøc¿¾ÉjEÒÍ<î†Ñ𸯥=ÔàšíhGªÊׂò~a¡æbX(–K˜ÿ¯«müÇr¦ÝBcïÉÐ’ÐàI;4x¶)-cÒ¢ÅG^ñZ'Ŷ¸Ô=L¡Ü[bö±Ëµ¤$”Ó/¤·U=Ó”DfɼH/æÓ,M’ã¨íÅ€eG=ëØÛ^}2›(n³è`Ç\Œžõ vÛ+„zw¤I£Á”=òÖìMÈO™ªç+¿XÉõÝ•Â\?®|'ÊÇô»rã É›1$¨+ …ñ?ƒyµp3”îr©Åt´ð<§wÚ5¹+ÏDY\ŸŽUy\»”‹­q¬ÐùY^à}#YÓtõsø8 ÙMì¾AÐAàl7hƒpGwöÂýÂr 9 ¯yH·±‡¼qðju£)‚GÇËùØH²‰ ÔâÍ}û·0•|PÁãù·vïÚ:¸?‡DÜ­û p.w@_ *‹`pÃD`k8â{ƒÒ욟@Ç/‰ÐIÆOmáñMŠ×ø㯗ÅëãÇC?=MœI‚'+3ÏÛqo>8 ã"|@Ù¼_ÒB…tŠê` '—f/‘"är¤±ÓËÓ'ô2JS¤3ö¤%6` Gr“”8§Gò„ü)ø2Tm:çµÜÊ°’‹õ}Rà‰‹ÿ±‘Ó&¶†M\Wˆ™°<Þ®ïÝ—‚{dá〚6I¬³SHp–‹Ãëôa¾MÎtÝ&¹¼IoLéÎü_0¥JF}@+› •Çg}(çøí ­Zƒ]½Ù¦á™ÏÐí2¾aoThLýàЂÐGƒ[ [ÈIc3·X’Ù4ãeÈý µÊ myž°j*Õó¸g-3[RS`gs‘‹n^«gÁ+d|6×F&Ž¢{xU•Ç€¡·Säe#0ÇE^–e¯:?eg˜È·1Q§'é)A«çÃì´B€Õ׬ÄqHOXñ溬âo WòTrºM©j<](%T²8j'[ƒ(¡ {DP¢?×%%òV9 Ž€¹ð ·çE:ËK~ÿë|±ÀÇ£o=¶ž¥…àfÎ*Ë7—‘,ÁX/O÷¹hûJΞ¯“ü œ={zŽò‚dÅqåíy2žžu^ž'ïáÙïÎã-aÝ“Wç«ðèpë 2΀ÝEƒœ&Ý'îKŠ•Zö¾íóÐ 6”4/ž¨‰Ï³ðÑ9çGpeüêöúiB“zK]…LÂtŠiÆxˆ~=&´¥ÆhyÏ3•¨€ŸåÁßàÑ61—r’݉üfá<ÃÜjZÿ»õù£Á<ŠTÒ3€xªv„Gîh·mÓ5ɾ$†È8páIŽË2«Dh7$™³šñ{@€ÑeÜy'•êTVZ “²¼À µ´ÌG¸g*¨Õ‘ÑaXc-ÎÀ^'Y©§Ô´Ž?ß‚Þc–×U‹PBÊ\À 0°ýº &f…ö,‰°µÝf„m#kKÿý;†ï×÷ïô£ÒZ1lµ'!}©XÆj*"°¦/¡vØŽÚ”ÔØOÔX{åµ»êG«-mÛ_ØÞP[àŽ·°Õ‹ÝnG* :†ørž¬/©våÔN"¶º•öQW†·¸•=ŸmFjì©´F‹¤úž›Õ&éþz’ÍtGC*n­ÃÂfK2( áÖi¥ZQ¬sW[Ç–ï"i|O5·ãçMåÿ,ãç{§z°<Žc¡fºŒ:tLl›ÁÈ»î^Åæ¯Müªý¡_M¤þ*åëžà]½ÃÕˆð*áz'¾!݆*áÿ±G"¥\ã½T{ûñf.îòíûÐGq–KpUf¬Áóy΢yÒHCˆ·Š4cå)G„RL+•ÜÑ •O³;„†üÑj—ºš”€¸‘…Ó)s8Y¯7r\¾¬2ßÿï·÷?¿ûçÅo~ýé—µ~¦?,÷øX Ò¨¢¦Ë*4%ªÔ eŒ¿<èTq²¯ŽÎ#l€¬E“.ÆÝÍ3jþÌwRÓbãD¥CÞ šÚ®µ+‰IAâi¾D÷æ$»­@ã˘ïúíÖ?È£Üý{Ø ¸vâц)–²µ%¦è— hõV<%úY‘™¬µgi8ž¢‹e†ÉÄ3Ï7˜M¨?¢À&†Ï‚‰íy$"ÛèP©“Å™q‘ÑùlkÛgím°ôûâobx†š&ü5‚Öm‹Äú£|ø@>»Sײ:€f÷b–R«å‰SÍÍbFOïò/ÈNÙÃà=.÷÷—®M¤µ­ÏtÐ ¾Ì˜øi¸&3P­ïDV01™OáJìÓ8íNWÙvyâ·sm==§ÜÓô«+¼ëü4¢E€¯š×Üb¨‘.‘Ä4Iq¤Â±DL`=¨oãaq‹1K*xêy=÷ÆóòØòÖËòO/±âµztÞ1ÛÃL]ar0LÓ2RŠòá‚ØnÅ‘Èxx›Ý@0>yebu xÏÿ\Œ"œF8F4BÉSžRá“©×Ú-Ó•,Õ{?Ÿß>ít>~üx '¿}zgÆ“黎[®ÔöɳáÍ»{ 츚ç;Õ7nÇïv AÌë-€þ‰³,:à >aS¡’Ýkg¶ïö$‡O¾yàa÷B sGuÞ&™Í®mšºVÞCßkóˆmßûŽR7ßí¨„cò ”R‚hÌ’o`/FÉ7Qü'÷=Öa¢è›LÎæ“ÅÃúúöÿ?}<ûÛñÙÑàçó^d[;:¿zqÒ?Švö;·ÉQ§s<8Ž~z=xsžGƒ©«ÊQ§Ó;݉šþý1q®=¸èüfe!ûåòãþ¼ñÍ=×ÖëÝ »gÏ׈ABˆâÛîXè²Âp »oþ½~x¾sTÄÿþÀVU6x¾37¿Í‹/ÿ`«™™?¿¼Üç.n>òÓþUwÿhrs U*dᆜ~ï¹X~ÇæÌç;`kÑú¸ã",‹pt_p+MV‰áiôª-HônÇ“gOÿUæÈý³5›í@vAªŸAM`Ì|'²T©Ž=ÀJž©éðvÞÜó«ü ‹­eÞøõß 3ýtð«eáN±'ì‹úÓ¸$šÙýo7ðVi)räRUÙ~eN²”­ãç“Û"뉫1¦æfòÁµ䪡MГYÑ©)Oý·"©×r¬Maecj3Ù+o@†Ïwâ÷ÿ-dÇò`Úgó¥ýÈ)nhìz¼O#Ênû¡\ØZW;˯»­ŸFñ57Å1Q ú¿‚ýŠ² j|{DÉ n=ßæ‹›ÌRN| âr-_'° º¨ªÚË:Þª¬¾R’Ìg¯¤Z;¯ðžÝ±$2°àŠ«ºcøÇòÃtòíTld=³ªÌ£ÆV»ÌIJÏ4Ö„×d6§ïá¨b ýÏå;S/\,á _\'ÃÚ¯üU¹)è´Þ"DŽÁ£Ü€Ï¦Œc9—˜Ëùt¡ €Ú$­Ò¸§º³”në™Utv©½õ¢žu£²´+[uÕÞxÅÞ¸¥Á×#)t<Ú¦íµ+ ©uÛBÃä‹4\‡¦;}b®ÂYµYÙ3 r­JŠMu+R, i“og$²b¤d;#-5ûÖE⵬°É6š¹ 0kÊÉ*9Ù—ÚýzŸªäªÖøtSŽ®äèÖrLSŽ©äeª9ïšrÞUrÞµ–3lÊVr†­åŒšrjÝ7È7åŒ+9ãÖrn›rn+9·­åL›r¦•œik9³¦œY%§UpræM9óJΆÄû€œES΢’³h-çCS·J·¤ÔèZCq¶¬²ªÀ.»Û‚ ‚®ùûäpýUÚe|á«íCÛZðõ¸q(ïìodOžny^¨$Ó\çRà8Ïb• ®)ÎT.ã<¦‰ÈR-v­ÄâÚÁ“ «ãR^œ#rž ‘“<ÏLÆb$Q‚ÓÔä&/å½/.';«­@׋›ÛÈë3qÎMÆVš`ÊYçÙÑ”#ÛUMgÚ4¿”gÉrMb¦„L”bˆ ƒâXqœj¢W,±9ô}ä(ÌèÔöÍUs)r­A8c\0•RF°²b·3zžå"M…Ô#sš@3¡ Vö–>;|³Ñó©Ùì.õ™¨ÌTœ(cC{Ri2;‘A’ ;Ó’bmÎ$K5MI,£¤ÎR©tN ¥,ÏXÊÏèC¯¿Ô§ÊR ÎŽ³ÜÄ9BLa«LÒ4•˜'†«¶F—Jâ,Ëb®ÁCT–€¸8K$©J½gŠuÐ퀒Šï0øX … y9S,NÓ˜Y§Q9ÃüÝÔ~ ¼á߸ëëaØQÆ ½hÈ (SiŽ G©ÒiŒYJ¹à­ý=Pރث!ò!/Iœc.)‡¸¢*C¹ yJ…àF1£mëñ8æ9t)“qHˆÚzPž0ÊcŽ3œû<¾dvˆ, X!–28â"Ã6Q“i©°ifâLwÐD¥à&¢GkH㔤Yžl2{y#’Ÿ™TÇ«ÃCËæAK“ÇZÉ$ÖS† œ­êW—"‰ˆQFDŽR 1µLq¹2ƙ̒ÏS.€áò„nÑ:Ë­—*Dx‚9Ë’XQH¹Š ;shHKø®>!ÆÌ §˜üY£TË*y[ @u“oÑDóKœh Ò(ò„¨<“œAï(ÆŸ%‹û:,ï“ àº¤2œ“2(%bu…ž^$¨páZ°¿=H¥ O ”"£‚B|CÅšñ$M Ôë9Y»¾M–úø“U¥N†m œàl…RJežð$—zW™r·în¥NįŒ¦ &çÐK…ªL ‚²„ƨ:XéÃpB„*M‘È€M!ÊÈœÒÝ¿¸•> nšÚ_h3‘{(ÎÁtçXJŒ2ÞN?ÖçEÞç™ep¨=¡Ã½")©6Dq{?üççÝt×x)¾jÄbÛç~‚>)Ä ,<2Ã[g¥‡Õ àƺyGX(‰H¦5! GÁ…-Š¸1h퉚k¥À.t¯mÏ@‘õ"Rà„2k×<×mo¼v®A‹_¾¿‡àPÁYüÑ«èîè.:‡OÏáy¹ÏÏÝGŶòù¼z=Šî~±èWZ %~É¡’+ð_Dw£»hRâ4ðUXåzüVÇ_¾½§@;üØC™8ˆ2þ®Ã9*qÎṨ°Ž×ã·ºÞ9.Ô¿‡qÿF…·Œ—øg…V½‚þ¢%þèž-ñ{øò/àxíÐ|*Ð9ÿ)ð=w~•ÛküEÄØÏ¿DMZâ÷ð/ã_‹§_#«ðG ¬QãyÿuE–ø=ü‹Cù÷.|†3ÿŠ-ñ{ø‡òï]ÔÛS–ø=ü‹Cù÷^îvÝkó¹»fûʶNá5¿ìV ´Äïá_Ì¿ÑYtw[øýž—ðTÑÝä.ºîö‹\?„gÝMï"é^!Ö;UÚ)ˆ¬=~ÿâPþýû·‰ø:‰Åûê½·ùΆÿ–ÜWn®·¶´…‡Ëq(—?Ú£þÄÃåI —Mn?Mí¯NÑwGßCóèjkßÿ$´/ ö0õšÁné›|þÑ2CÅ°³[£,ÍÜ¡%Þ©%¸qAu³YÑ-ñ{ø—„_ËþSò?ñð/ äßÁëþetyörð¶{Ñ‹àóùÅÙýãÞqôâgØÙ‹ºWƒ×gÑ?ÿÙ½„Ý®·RtYº§Çðü9êýt~Ñ»¼Œà môðð0 äáþ›ó“> 5.º§ƒ~ïrŠý£“«ãþ髽èÅÕ :=D'ý7ý68ÛsÚ}þµ¶ø=:;½ìý×;£ãî›î+p—ïîyYKüÔÃÃ4‡ï;7„ñÑÕEïmð­Ë«—ƒþàjЋ^»h½ì]üØ?ê]þœÙø}]]öÚÖqÔÃÃ4‡»ƒ®³2§PÖo®.ûÎýû§ƒÞÅÅÕù vú}ôúì-84H»89;unÕÞ¨‡‡i ƒ·Ÿ]ülh=Ýð^ôöu¶_Øàç\t­£Û%ÓŽÍÃ@ÓÁÙÅ`+ÿ§¦<¼tãè´÷ê¤ÿªwzÔ³Èάoû—½ï!×ô/íýÂØo» ï•s/ëÐöc[ü¦<¼Âc{.Eý—Q÷øǾõ‘#¤ÌË~™^]T½.ù`ËüC=Ö&w+ªVk”¿ng5± ´Š¥:í´Ð[ÏAô—Àõ0ÛÀ8ëá†ÖClQÜ·AyË„ËMË[#ìÕÒ•…ßÉòö‡N==@qgµM[íà{x‚ñm¼Ø“¶Ù†´ý™MòÒ5ôw××êv´˜Ùç÷­”L= 8Ý€ýžü/óéãdªwÍoÐÕl¬«÷:«Œ†p€„–ûû¿ Ñâ­*ž\œ®æâ(úï@¹ž™nè¯Üo23ÖüVž\šnèm|A즞l›’-œŸoj¡eT»o6¢:æeTÃy9*nkzHåÚãŠê²­ý`ʨ…ÛyÊôê¦ô¾É;¼:}+3„•$ÈHA´Ž™4)!”3©8O4“…Öø3­ïÝ1Tê]¬fe—¬­bm7òêÂö,†û•_ ‘69q€‘45Œh©ÒTSE”H°Î² 1ÃUÜN©k”¬3҃ʣ¸Ñð5W\ߺÆ°™S-´0\ ©6^€©fiŒ14¤ ³Óߊ\2Ž5Ô{íËšŠúÓ#ÄQúQBZÙÑS¢ñÕíBSئRêáæ!õË‚çv®+iˆe‡Æ*Lj3;e‚2T6 Lrób.ÿµ¼úx-x/â[ ¸.-и› ÆãJ£$Wy“é\¡H¢˜(L‘¬0nú4î®×¸-”lšÿ¶ù7¼æÏR– ÃâX°\ävåvʼJa0v·²Xóó¿”ù‹¥sý¾ÝBÉbÂ(»] lê 4‚I6ÏI¬b—Ä(IC™”D¦´hñ—j„*Ö‹w¶¬ø[Èof€-Õ&LĦ.S@ å J3ša*5'A¹ IÇœø¢âñ_ª…ʦÃÃįäçaÒª¶ëJÔø0ðE’g4—'°CK&¥°¨e±TE#„v6þØFxœ0ñ[àóÚ"XJ“à´Í ’rHiJøä´P\'449 M PHŠû>3»3û™73ZÙÕêì®vfÞ{ï{s?ïÝw¯Æ0xµù.‹Õvîâ8¬²£ÏÖKwb*]cLRjñ–Å:ùJ6•®1¦;µˆéζî{Ó$MÛÁmA3-%g ²ii*/©62Rø°â#Ù`1¾KWŽ®YzzAÈnì˜_@Ž­‡ß™q.Æ\ª±æÖÞ(‚%[È‘„¢-J¼$ª ò´q’VÍ@.§-…yÍšØD3æzµˆ¹ÞŽmÚ’næÙ°l(å$USs¶Â‚.JÚbÀ ‰ZçM5ÏEÏ(£ó1©ÆYñ¼K{=¶l2Òn¢m@ÙÖ$Ý€6êfŽWM7¨®ÔÉNGnô¬3:Ÿ\ñŒüAè|]”–—ÆÖ à',8…êl¡Æ3²¡ó <†UÅÌäDN0T=g 9Þ”h!Æ*–€cÑšÆp¾T&aÐùŠY*;£c:Ú6@çÓtr´ÂFçÓÖ¢è|,+¦“¯dã-Z‰¢óXu‹T¹6`’[1<##:h[1<#-:" ô8Åyž5MpMhi¶*i¶fššaÃœ±{.7xç$Ù6y~cé ĸޔSþqE#‰ßD(1tlè’-™Èb“âDè–bˆšh+š(µàO¾T„‡:±!ëQò1¤˜–l"ÓÖ¶$¨ZŠÅ "ÏY®(¢ð8¾.2Ä"_ ,0ú»!mRb¨—mÈ#“™q¦šƒÈq—eAPlKh63à@Ï0s.ÅÊÐÀ‰âehàXÙ‰žËÏ3²ññ³5½Ö©’; H5 ²K+kÁú¶Š3!þ e3;Q'_É”%#=•ž¨#Ö1DŠSÑTôôë*Ï[²5ÙɢΠªØ8×­[V³£“Ö&f¤6â£Ru„vAÔl]Å”Ê/㢩ÈÃÏiЄ†–“ðbVXâDÝùb‰æÝí é‘ø¨ôHáÌ馬š¶að‚$áÅ)E@Þ¾…gÚ9gßiæAKòcš±ð„yZœ(r–’Ë©È&E>bN15EãD ò8ª8’Õ!tÇ&€¡Á£/u¤gEU!äMdøq¢® º¥Ê†ª"ÐÌY&Þ‹¤WªJ?‡ÁÈÒÄ7fiŠ”¡±S'ÅÊÐرòDÍÈgÄÇÎgÔþ5F#þ‚îm%âò„ø34vÌ|F|%ÓØŒ„F|TB£6sàfÆ™“•™3C–U^–,K “—5¤Ã!ò‹Õ†ù,ZnaO6CI óôæ r9Ù2lY–mÅRÍrg›R®Á[%åÓÃH`ÄG%0êHß)¢®@hñ¶në:g+ª)ˆ¹œiœ.ºØ uH5ÄfjSšŒìG|Tö£Ž/®.K*g™ ê[9žº˜ÓÑøEú¨A!Mê•üyëGkä·\GîI:C‹ÍÙô£_ñŒËìqÖâcw0C G¥WŠˆþM2ºEÅTMÑÂõ% ¨ « W•@ØP0 ;ÜÁN©´mºÜjxšÜeX# ÉŸ BIÇQD|34A5s‚¦j¹d‚ÀË¢Õ8m7 ‡1eêÆ…ž³aä–âsKÅÊ0v>ÅÊ°@¢²0-Àž‘U‰ÊªÔrŸŠyg†nʇ4ï})<#›•Í(ý¾ž‘„ˆJBÔ@4¡¹ŽÕÆSh¹ùÔÎ4dU«f†¢OoÞ«aºSLHg=ç4B ß# áÚÃ#’j`0kÈ°à~¹`!Å%~üi`çÜ€*JîÀ E¢´äc,Ú2©íôpk™*hF›äÔ¬µFÖ xŽÛ/Ïb¼”‚óì ¡øœO;¹”€Õ´QØ‚ÀLÆ–èé$w%œ6¨Î]IRpWŠûŒÖ6 6l>MØ‹ìÉŸø½˜n")A’*é öTHX ú-•Å°aç Š?lRç3J±ÕÓb1ª£K(ä­–ê‘dfJðHÎ/Q·[ó«í ³CYK3ÙÍxDi³£%3‚ê ^@Ö õ”‘Jì tñY›j3^•‚Z@UBhnUN³ÒÊÜí`¥5åΉøÎÜMŽTªº[v©„,8PÆÿ“S“®0=•É"ÆZ– +•†Ã<<ܽ ã¦ãB¶¥"X‹Þ›v€ ™J€$e@Îá*2õ’2Æ,ðB-}Ú'«Õò@6»cÇŽ~«´sÑÛ_r'²…¢wzvC÷`aj¢ PqÍ¡Œß¢\œÈÝ©ÖŽ ì»1·ßŸëWпetˆ’„Ï%kã› ww-¾Þ/ÜVÉ$Ýšµ«3úH'ï­ZE’ð7¯Ê\ð¿xQºxA–e‰—9EèB„$‰]€ë$í^Óø  Ë 5…Ú^Ç:ÿ[úºflݪc»OÁô±£«GÖ£ï“Ñû¤w…>ÿùS›¯îêz×7FG–ï<ì?¿´öã.<ùÊÝ_®¼¥ŸÝ·é‚¥c'Žœ }úC`ÙQé-Æ1ïQÕ?Y½ò±,âé+.ûîþ½Ù-3¥ÏvüÕËÆÿÕöëÆnýè{¿öëŽüÝ—µwÌ/öÞqÖw½0ûÜE¯\ðŠ¶aãý›Ê‰'wM\#ž±§kݾGîrî¿/oÜ[¾õ•—~ýØùW<ÿìi·]~ôîç2_}öªM—[ŸüÁ‘{o|¼ë÷yôû—íÚyýî[_\»÷– ß?øÓ cÛfÌ/LþýWîúâE7õ]“?R»·ý/'íúó÷>r÷w^rÿmûÍGœø¹[<ý$K‡çî~û±g¾8ðýž¿Î?÷Á÷½|EᔳG¸ ¾o¬çœÃÔݽôÚi§ßÿÂñ®ò„«”Î5~~ÅÛ?þ¯×ÜÑ?{büêßÜóÙ»w¾úúÐÍo~å®Y ÏzñÕG·ýo×÷¶üüáçþï{ߎÜøÜîÎ=[ÿéâu»¾:÷Wüø›‡}E¿W¹ðõMW-ÛöÃ7{²·œx÷I×\þøŸ~âk·î?ÿó—ÝuÓô_mýî0¿±»çÄ#¿}Ù·ö7väªãþäâýwgWL\rÌîïíÓK×>|Åùo œúòC»îàÿð ¯­¿ë„½7uݳ÷î^û„¬<ø§Ÿ?¥ïúãìúÙ}Ofÿýåûo'üÊ•O¼s¼gÃÒóí£r¯kÓŸ?ö™ÛÞqó›¯ê§>ôƒ—xÑõÇ>þðMà…›Ý;_üöQÿ3õ›ýù]gwݳñÑ=o,™>ðÑëF¾~ΖO̧ìÐ}…ä?¶¬eÝÉ{DËAPT9 ÿE,ÿ9UY”ÿâ5xúÈÇ—blÀ½ÆÎ;gÍèréËf7ŠË³Ù‘ñ°iõøÚ5È4äÀ¸«+Ä$×lvź ¤;Db‹Ž¯ÏîÄ°xÜØû·¯hÙoU-l¦’îœrŠ•¡`xMÓhkr-Ô-ô5«ÈF×öÁíÓ…™¡Ìrj°÷ãm}¾ùŽ¼¸³J/|W`uè¼ñ•}9bè6ÙÔwÞ²>?£„3ºbH«·¡;¥&¨_r×P;šÚϤAµPuà°oÉWhš¨™—묇6ta¯ Ñ‹»Bq›gèWu£ÒoV*àBršu`eÂjà-Œ‰ø|·ŠéÊÕà™­úŒNzÆÿÖíÓÐíßZ!»§È™x ­ÙbÒT­øú¾E,”ñ7¼>õ ìb·Z*g¨3f•HÁw:ÙK+©£‹zA¡ ØË*á2ðÈEòn}:õÌjp0Ouêxø n:˜Ðq*eÝ,'†2\†ü.#Çû=Ü «ô hhÂÂÄduÈJyçGðEè¤åŸôš÷9ÐF—pý2œ¢×€"e·´ñzßþ€ÀWwÑ/$Žrf˜ë×úý}~ ubñ?U £˜­ºôËwÍ•¾›KÝWX´æsÈyÅ'êÞ(â`hø’køõ·´ƒÏÔÕtO ½ÃkõB‘Ò?¦OÀÚv>ì°£†­``þá΃• uµÃíÔ¶N».ÙzXŸJ(¢†¹‚9¢WuŠ\--wô:4»à4`·iÙt0;íÐÎô{5Ìo!Äo!!Ã;K¹ce-`ÑŸ£¸¯cqËO ÒîÊt¬XÌ Là éQ§èøÏÔ˜ì®LOMéî,>JKÊÓFŸ^­º<Ä1*ÀÇWÒ÷U:‘6™†Y;z,Ròc€-è @ ñg§Ð}ºËÃx³úð’ÖÕ¡ÜÆ®*Áé²Ì0Å'X»‘ÀÌ–ÃwD²¿Æ½å%ÇÑ’K“ÔY}ÂÕ§È|U“—†‡xLX¤dx¾Š¨Œª&Òù)t't_"§§+pJ/£îÁ7òî”7:ù<:îMe…ÑC¸•'ñ¤œ‡ºÎSßm`à'¯õ)Ü/è}Q„¶GC$8‘9sam‘[çéqÝôfö'kãÙæ!èi( t b`AÓ©íåR7ˆgH!1¬¡ Ná1)ø×L¸¥é²ßkµýÝ¡‘1é ïIa˜¨ªTwD¨ªpj@—uC—ro)"g*¢.ºÅ)Ùî¯[d¶ãTk5ŠZ­AZwOaaéb5š3ÞO¢ç ŪŸŸß¼ Àúp£T­–¦2Ã톹ç»,‰lÙ…f¡‚† •,­H¯@¤2±¡—œø ~ÓL¨—‚´¶e´¥Xèf¢e‹²¬j¶dªª×B5MPdšìÿÐa4ÙJáb‹ÇIéžuY“lAÕ%CR Í2 ËÖyÁ2Ñ}L’<ÉyÜŽY’à¯sk¶iš’&ðÐ2K•L^dUTÉn{¨ÔâÆèFKг ]Ʀ}&V%åaìþªÙ±¾ì²óU@¢iÿ5 Úˆ½r2nG uVȃŽ„\XA#ÄpJæ6¬<<> š,_•ZMäù#S èÀÓã…"R{STÓŠÈ5`¬äÌâjôXŠÙ·RE&xÕ“:n_)#©cL0õ"ägöƒ“Èð®A¶¾¹μáoxq‘½\íE9Ò´â9AH‘ ÙBu _Á{W`¯¢X;‹µ<ºÀ»Æ®ùŽ×Õgnâ<õE²·‰Å‚ÅIt‡oAÐË :ƒ¨‚n? 6Nê«w±“â'µ¨<‹J6ÀvuÌÖaÓ¦Ÿ4Ô¬j3TˆD9×õÀH©ÝP/š“xؒتk×à8óÄN¦é(òøª¥ºßhP—±»–fŠø{õD[¡§‹^ë/ºzÖØ@@ËŸÑoš­ƒjp0´J&F»<<æC‚ûÇ´M ±ˆWé\ß˨ïåõ=F§fn_·,YmÀ„×$/ªÀ…8HÀc-ÞÔ£÷Ƈ&:!h¶[šJ Ž×¾œ Ë1L Q V¦˜ÐT¹i/ˆ,]_‘ˆ 4ÉWLÝÑS $ŠbÝ\ ¯©!0$AGb($º&…n#IN“æO¡’ž=r.jjÚI ‹—Ã<*×7Â%ì5Ì&4 SPƇ)«êy_-úÐô¢•"'6A¬«Z Ó?AϾJ‰aù:*…ÚóóÔ&ë¨]ä»g…`#©€lNéô\ÐBÏ‹:dQ‡,êEòN×!1¼ñƒ§C:=3ÒÒH3óVGË|Ï) ߯™Ñé*$4ši:¥w’BZÔ ‹dQƒüÖiI7Kf;­à¤YÉ#AÞ–“zLÔ¢°¡Iæ}ìââRI±A¼ë­ë&gtE—®æBQøÚÿ£(ü¦ø¿ð@ëÀñ¼Š„´Úÿ­HŠºÿw ^‹ñ&þÏ{&Ø@.€#ƒÿÿÿ0ð¯³qíÃÀ¿Ö˜P×j•]"y5á” Ý CYEÅŠÆ ÐÓ‡Dêd t€ü&{vcà^Il=W`ܼ!Ø¢hª¼%éº UÝ–7u…·mY·yÃC—Ú.5}ìæ)È ñó…{úx¾ÐæVUöˆYUBh«;lª“%X$ qo÷ZPý­­áí¿Íå>éåQ´.÷@C¹æоV@£ëIÐ\Oªm!Á¾ù¾’ä¸è*QDT‰ªàïžvUkNÅš‚áêîl›Ëˆd¸G×`@Šûç{t$➌æ;~ÕL°ÈWRÜ£ë0«èäAâ{t¹'bœlË÷•$üiº8ldˆ\–“²Çå:Â÷èÒPD”†:è|..@Dq©î‰îÈG”|DA©:·’Ý’¡]øˆbR TÍ4þ EÆG)V“­»€u“ÌôÑHÁ ™k*—œÙIh¹ºƒ~É©µ¯;ÛÐ÷Dúß%5þ eÆÇRf‘ÿ …ÆÇRhD.õæóùÞÞ|/ù ¾{çƒÇš$T2üJ¥ÔþYòFŸÙð»éxíþœëm !!þ ÅÆÇ®¦œ}ü·y>ø3”¯š2s—^zéÜ¥ô3ønu<ð™Í#*6φ‚ãc)8Œ?Xæ–Ï1ôßz¯äÿ!òk9=潇üÏå`n3Æ>Ô ñg(9>Ž’£ø¯sÎ(yxBôv|\õÖøc7/i þCe ±T&ÁÁÓñð¬¢÷´k±5þ˜Ö9B@`%ÄŸ¡…xúÐÑR¬ã_¡4P\­þèÔñ $ÄŸ¡…˜úᱚ`3K±#ã‡â7DÆðŽ×ð§O þ3†þâé_ŒÏh 3ÀÞŸ!âÏпB\ý;Æ›ðŒ‹ˆ€„ø3ô¯WÿÎéñ†þâêß9ô1×C>ƒïžÿcïZ˜Û6’ô_AvëRr"˘ã\®––h›U²¤#©xS›-/ƒ˜9‰Ôòá”÷|ÿýf> Ý’·*ªr"‘à°§§§¿îžîž=¯ï¼ö¢š_¾[M !ýþR4þz—Þ—»BîÇæßÀüK¼/“/Þ÷åy¡ëGæ_ì}™~ñ¢ü¿f¯¿X©ÈšÓà/Åâï·fêã$ÿßýë¾ÿ7ùLÍ_ì[¾¼~µ!/,§X,?ØO3ú€å ‰å§“»ÏyåŸwtúÌËC×ãQá˜ö®¢éhö|°Ho›{x½‹~¯sú,gX,*þXÎX~Äž›W3í½œy7£DgúÙ#Ð`9Cby_§£™­Á^y„FFìdFc¯8¶ðò—âÑØF†m|`vìý>šô&Óüÿ“ÅÜ~ËËo'©­^Ì!Ž½hª½;=½ÍíiâÝtòi”š_æ£y)S(™ŒÓüðæÈËË-Å·zþòÁâß”~ËÚ—>ÔOCú,gH,''¥-0³GYKÙ·(¼ÛÅÌüÏ£eYmÛ€d­wÇ“¹ÙõÇMé°œa±Ü+ÎÝìù«¥|K®íÆÝz3O3ÄèÖ–Å>”ÿþ2$þÒ*ÿ Ÿ·ôÍŠÿf3§‹Dï]ú9€¿ëK{kpY‡U­vsúüåxüÝ=È5Ô¾° Tòïm4×ÓQt3ÛèÒ\ùçç¿[‹vÒœ~9Ù‰góFíÀ«2àha`ÉÒþ9ÏÙ‰µE´ÔƯõ8L ºÙðötr;™k¯«ù¬1ýþr¬/møoXüi“ÏjÓ]'Ùüw‹ +„]éßMGx§àÆÔÍfÅ4¤À_Že?‰þçþr$þßöÞàòõð}§ßõÌïWýËŸzgÝ3ïÕÏæÍ®×¹¾½ì{ÿøGg`Þν•Âeé\œ™?{Ý¿^õ»ƒgr™€Ã‰Ã½wWç=Cµ™F¿s1ìuÇÆØ?=¿>ë]¼9ö^]½‹Ë¡wÞ{ךdž—ÇùìªkJ?€Ã‰Ã—¯½wÝþé[CDçUï¼7ü9gðëÞðÂ2÷µánÇ»êô‡½ÓëóNß»ºî_]Ìò˜U;ë NÏ;½wÝ3=à0GâpïÂð×ëþÔ½zƒ·óómáyÕ5Œï¼:ïó0BsÖëwO‡v‰V¿¹î‡9‡¬©7Ì??öWÝÓžý¥û×®‘Nÿçc+ݧ—ƒî_›‡Ì›ÞYç]ç—£’”5¤_8,8\n³O¯ûÝwv=Œl ®_ †½áõ°ë½¹¼<Ëwë Ûÿ©wÚüà_ÚýûÚ»t›ÚqÀaÄá³Î°“sÙn„ÞeåæzÐËÅ¿w1ìöû×WÃÞåÅ3ïíå{#hfA:†à³|Ÿ\^äbÕ\~€Ã‰ÃFÚ/û?[&ZIÏ7ð±÷þm×¼Þ·›ÃÏ°ß±‚>ö{§ÃíÇÌL‡—ý¡“ü ‡‡7bì]tßœ÷Þt/N»–²K;ƒ÷½A÷™Ñ5½} W0û}ÇÌ÷:/»×ÍZØ_›Òà°@âðŽçŠÈë½ö:g?õ¬Œ,i4*sÐ[ª×|Wœ¾]näGý#ø3å'±#€¿‰¿å,ºã¼[R‘Pg,ÏÛh<º[Üszóä*ÛÂúöna7úüHü]w–šxï—æeüÙ%,Ñ~Ouj/"zU”Ää„Øî“ÅË'Ë—ÿ²x~7[¤'ÙÔöžÊ Y(,(|>YŒfÏ/&úÆ»š,’zžÏbóòÉ]ñò_Fcã—­&r YxŸø@? é°8xüü®Í&€qPcÜ BÌeP¶‚غ˃9¶ŸÛdú§Ýf±³yj”æÉÇ¢lÎ0ÔÀP==£‰ 9ª5¨RCNbk—\È@"."hî Fs×ÌqSla£¯;­ÔæÊ·Q2̶Û7á ®ƒuíDºä[¤/æ£GÂ% ¡e†vã9Ý"|4ž»Ò hfY£™ÝlÑ]m-Ý„t@'K,,]t²t²Ä¸/¾ûþ€ð׌Ӏ—u%ÖÙÎ6v}w}öV ßb~H@éKœ+qÈŸfæ‡`BºÀ„`B†ƒ†u |£òOVµÂŸ#J$‰0*³PFaèkê3©™ÎˆOmlÜP¶º`ô¾5ûýù÷É4µ˜\ÜÞ¹|Ô«QKbu-k"µ0#†)<ÒíŽ$E¹´É å&(––å Þy‘ÝqÍ×Ð-¸Y÷Éû8{÷OÄ(ùÕ?ÇóÀ ÅJÄÜ[ÆøÂÛTq¨ùJŸ4R @ÅëÉÙáN6™®Ùó›÷£gžÿ-Gø‚2ó×÷ß?CÒ ˆºì܇P0`©¿žçV¤þß¹€æi*¬_F^Çg¿ŒÝðl”j®‰_¯ÙÍû‡Øê?6Þë(7ï?Ù^'@Õ¹yÿ¡{ý?Ò’4Ýø›2Г®Ç(ó¾‹øÕ#y|gKÃsÛ@#Ô#@]¸yÿ©¶B=´˜÷¡­€ÐJÎ{¡NÌû.bQ¯…ÍûÖÂóܦ[¯„ÍûÓê¥ 9ˆnMƒ²Œ´u P©MÈ>ÅŽ°@2‘e‚Æ¡TAhŒCªd'Æ`I Âdcä’òX†GÓá‘÷åüí·¿cE(-'¤ŠVÍ·“ÛnªÆ ©ú=ÿ‡–r=7nP!H!šòñïnÆ!ê§ )c–€z'eoá~Ťof«\h]à©â@‹~1ŠŒI©Èø±übZÅÇ3€Ê`B«ú¾)iÖ3¶ñ–¥ªuÜB@ 0¡e=‰ÜB@i.)—æâô-Î÷î ›bm^-šŒ7Û@Ñ+¡e}ø8ö2PËJ(Šis3ê”–ÕiSÂ\eP´¥òS¬äú²\ȉ¨®$åêJÜ uóG:–…qÄJ„S%2’“f”ú/( [v£µE¤T[„Ü(@Å)Wüàð¬\†ƒ3TmÌÓD 6†¸×Ƽӷ“ég/ïúŸ—[½Hõæû£Ò@.²6æ?¢ PCÊE1¸AX-Wª ­M¿E`‚"ÄOBFŒék1êXé0áŠ'‘Î)²Š z¡'•² SN#šf©‹8ÖJ¥©Õ”Bí»½"×”¨³ÜuÌyþlcGh؉‰(»îP†• ÈDÈ0L!¿Hæ%åd^Ü e?írpþayÉÉ:õ 9ß÷ËK\œ¬Öš œ÷ža!ÈÌ%AÙïk+ŽjÜû+–l‰ƒrì¬Õ0§¡}ý7vµ.ì}–ƒùåÔhíä“ Õk%¤ëI#Xî88ü€|b´ðIP øUÔЗ¥N«ù[iË[÷ÅçûØX‰SmûGÇë5£×h娈όŠhe®²¼::ä9¹/X‰8ÿ‰3–qRÆ&}Ä‘Q¼>O‰D(#ÃF{±Þ‡™6ÿF¹³e»|ÝÞýÐÎÍèï ÜL ©šÈ2#w7ñL$>ëmªç‹éx%¬' Eš”R¤±sð¤œ#‡râ2jаNw#< MIF ‰š§"’’f"KvŒŒIaËÞmÃÖà±<‹0¢,¡‰!G‡$Jh,ó¥Ù ‘ä" ôî{ ‹FŽB€Wˆ¯û}£÷jØÁ–ì`©Š³ Ë’˜è,ˆ"ó-Ë„úË+,m¥È‡_õ¼” ‡U!”aÅ%Bnä6=É-E›/+v®…ÊE]9ÍD¹8Q@ª2qIU&µ›˜àt”˜Ý¨ˆY¯0æZe‘âœD™c""e{‡ NkMyš„~’ˆ$ãA¬ mÚH‹É@S‘V.-ÔCûñh Û“T²=êÆ Ä%¡“ ´’ÐÙb^;’8éž$ÎäÚÿj<»zcŠîIu3±ÛKÜB›íHÿ¤~5Ui¸ëLe™/%¸ÁÍ@FÆt§qžªWGWÖpOìM{¹nh9e«U7 {È¥¾ƒ=K$Wº'ÉÕóòûž[ašõѺ'gP •úÕrˆ-v é¯ZIhÅR_!Ôw1(JË÷÷à° |CnP@£®ÍyºãH $@Räµ9{Ž#W?WE}u~ƒöòrVóx³ãH ¤YRäµ9‡üitI”NZ¾77( ­Ê—Ù ­ÍjBx”& —ã቎(Ïx¤ZaP£”sÊè£ lh%VQÈcÁÂ8 u2û©Œ¹Ÿf*Ù5JÓ³$ºY¢¿»g€=Ì¿ mY]´’Õ…s#Ž·OUͳs¬¤`Cq\:ճŠš"¦\Á(F™“§³ru~\9_¾4õ7œøåæ=}†´ÁÆü”UÝ){:¢§ÓÉt7Ú¶7wp4NÖ·’/÷K~]œ½{Úâ†Kf!šñÓr3~Ü l²²3²ÂkÕwÀNÀMV>û´Û¿1í ñ¹G°¤ˆYîŽ@LV¶ï õS=d¼ò‰«/)П2ü±ì×gšçS¶§äŽ1Øs‘ˆ’8ö£P¦JK¢âŒ¤*Š*©MŒÁŒ3úu¼÷\°¹6Ο:ÔäåÒy¹k–Ë(Ydí°×j…>UB’LHjö5‹3À´Lm¬šf…o"÷ôZméLIØU’))ÛðUG‘J„™Ï•¶•ÉÖ¨³Eü5û&!`Ù„N-W±¾I˜(a%tЦo¶Mèr†8âqüоI oXEß?|“¯Î7 Ì «©VñMŒb›O£ÄÙ=©­N°t»d/™ù´’™ÿ‡{âæž…´AaÀ×ëž4ÜSÚ†è HQ±/yD3Mtp#FIL0$ñÆ=YÙ¸'_‡{ÔrP—Z ÔrPåz|‚¶{€õT9Íæ©r9:ZÆSåptÂjsÎ1)oÂ)1b™Œ2³Ó$P±LY`#Š•¥ŒÙÄõ¶ _xÂDl^ u&„s%©ÎÌÖ"³Œ‹²Ûµ úÕ(ýÏEdþóÝ°~²ÌY¥óךEEvRàÙžø&vÙræI4^ÞPnÖõWº˜b H{g•´w̹¼$iª4 mËã1§„^û!ÑéÊmJ¤ÿ}ë-|MÍïz+•ù.ñ $ÿ3ß!Ä€ÌæÒˆšÕö[E(ÜL¦J„2ð…VV°7Ð+¥öeÆý,f9e¤Å6xYÈÍRš)!yÇ"7²S!ÒÔN¯¤p[Ý-dY¥…쿽ºšÓ²=ÍiŸJÝ­jY¥UíêvŸºÅv¹`@Ç]F]ì[ôÛe.ývÐo—Qû¶6¡n¦‚4¡)U‚Ùn'a@•’„Ë̘¹KrÊXûv+TŒÐ¶"–FÈ|틀ǾHi’i£ifÈHt©éh®i¿âˆ;r²Y%'ûw¤U3—´j¤U³JZ5®ú:qÎ"‰ŒªJê2Þ“Fæ¬3 ©˜1 HšeÕ¤YäÂaü¯(ŒÏ€Ô\Æ«ö V|±’$ò2—öÀ ÈËeß ê« 3 M˜qàbÅûv)ÂðóšqšEMâ0±E–""õuJÓPÚ« W†ßX=OñÅ.,Ö|ßéÁ÷%€Ùåf̸AÌæ®Y1X°š)3îásæs— HmÒ2Â*WIÈ"ê‡2 Ì^¤±Oµ #Æbž°LZŸÇP&öAÚIŠa™Ÿe¾b•ÜxL ?“aDBê+a|†Ýîl‹›Z·RcÍ€|mÖjÇeä³Jž± 祦ñS{ ód‡Þ Ȩf•ÞÕÈa©’Síd"=­…¤3³J:3®ÞÒ˜?Fp9"2SŒøahäRjBݪ·Ì5ΨeÑl»|³A2 a›.ñ) ë—U:c·Q@È€4aVJFÚ#@ê/ êùË\2™|`ã—8Vš’@0ÅE@f^ šdB É2"üœ2¹§ñË¢„ÆÒ)ÏÂ,‰ liá'4æQû™‘J?-]Ð3;L£´]!9n½[°k ŒtÀT’N©ÒŽ ‹™U²˜ï¤©Ì,t žÉ,<ˆeÐf³&)Í*™ÒH‰úaH°4* A•ŽÍ*I-tÆHªb¹ê-m ‰ééä1ÏZëÕ€] é÷&‡|S–A%·ùÐA I™…NF¥ÌBÐ(˜Ï“?y£t% Ú}Â~_þŵpVà±ý‚ÝO§:3ŽÿëLgö"#—/ÿóEœ#ñ6ø˜MÓDbhææ[¹)F>ùø2ä[ó"ŸÅDŸwpží¿Ÿ!Éh×ð*Ÿ=2¢è9îÎRQfiÞÇÉÒäåºá>†§KÉø€ÐÚXÙÁ À†//_®Ðà~–®xvP) ¶¥°Ç6Rš“ ¤ÐÙ4­çÚ¾OíHèÒJ= 4æ~ÂZ×=†·œbõ§K=efyò±ÁêØoXº-)q¸ß<^Dœz×ß/6ŸÍ+}¢mÉÈ/Øè©U§ÿFz 6“ðz k[Oí˜_õÛnëÑj,±­±Dƒ]E–¼ƒOá}çzªë©âÙ£þçï$“ñl^\<å}ŠnÈÞWé~I$†kæ3ù¾yÊs^ÃÆÝ%!ùmÍVa^_ªÜhEàJüŠ4®B(‡åÓû%/QÑtÅöãÃ,W1š—¯1^âÎì^*.pÚIðUøus¸v¹rùóصC­‡ï½xáÆÉÍ"µ¼íŒóŽÞ“©÷æÝÕ!×(mk”G1°kä+,—¯µ{£cL—²Â¶’›'/WÉ|^Æœï¤CJÚÖ§ðºÂ>8B‰ÝhWìòUˆnFÿZÞhÝ‚ðÙ~òKá#M\T¶\<øî-Øò;Ä=^0ìV?wô›•9)l­ƒýÃJAœ0Rd™ ±1*‚©‰4ÂLŒ‘Æ’@…I#ŒÇZ‰ëÝ´V#Tv@þüÑëÞy×û.­Ä»ÞY< P•YnóÍ ™å”9x+pGE¼·âÒ±yLÅ|°ä³,Í ÷ØnLÞCsíÀ¬›]6â2œ0ç²kòEsNßm…¯¶„º•h–ØñE/qÍd¸ Ïd·ât\&ÿÄ£Jq^î± Ð0]ßšgðnàpR5q°¥D‡Tt;&¶¾Ý¤Â\xt)ú‹-ZDËü&¬-óK¯ÐËv/øʽ¸’édÖ$€¸ŽvÁ§vøh<Öv´ë¼½ ;æ;ïÓA£\r;ÊÕ@÷¯÷ ÜÜ¿O7ŠDnk¸ ‚¹ Çïœb9ÞûD‡Ô7C *’/ðþç¸OÔ QKŠAí­^~kTÙœ÷ùˆ;–7"½ ™îÜærß„áèm±x{{[°½Ÿ“k:,xþuÑÚôg4ˆ²÷Þ\Ï oåâ;FÃë1ûá4Ðï±}J¡Z(ÃW‚¸HxµçÙü™ï½zª/„¼Ä`ÑJ4¾ t—yà“²®ã¥b”’ÿáe”ÕRù•Ô`èŠËWPÀ¥ŠúŠ”v bÕkŒKÈ«ž„ÞxµÜ¢ëÏôõþ—“óF÷ÛE“`©“‹Ë§­É‹_µF±xÒ=!¿î~9S/‘®oæ^Ì~±Ø<Ë‘d»ÕXÝ궋?1-oŽ¾†‰; vhcµcþô‡ÁÑ’dp•<¿›Å¥¦ ÿ4„š q÷ÝG¹w@‡]Üï»#ðˆôgÈo~gݘ~@ãËîÇÃ*«¸ ‰ü~xY?lLÏîO¤ÓjÕf÷ðm)×Ü/y~"Þ ÷ Ü°B7ìÓãØ3½…¨ôŸ…ò|:iS‡úthÑ÷Esï}ßþy­Ðì+rħ}Œ€Y–ïŽÂä•?Ì&<ÙÿSRø#ÀÝ4üŠÜödPöä‚`þîÞØQJA&ÌyFyI$3$ðÐå8³ØÁã#}:ð~PÞ¸HÀ…ÐÇAÊð ð÷QÖ¿pš™¦ƒ:5}j¢í„¬×cÑ~?™–;¼>Ê•rì÷ŸÇï‘÷!G_|»¤îõMø–åÑÏw .ÚñÅèöÃ>u J©`ÐC¦@F¾÷è·-bkÀɽɈãAI°T¨â˜,AÎÈø%´b1ôù¿˜g˜”1gs.¦C› žSLŒfÔ LÙ.‹“À?4øÞ­’›65À2¹ˆä=Ðñ,´ïat.õÝYC*ɵLÞã/¦;äò_˜×4’’·>àÆei þ°ðhJèl,“;¥N¥qb†&Ó ý±Žýu©Å[cªo˜h/bS-+úò¤ÞÇ}^˜q©¦õ­¦ô­fTør$\ÆS¸KFW×}¯göÓ©|âa2%å9·z3ØoïI(®Ñ>ä{èi?ÞÄi»þ•­ëVY7ŒZ¯G{Ôª8¸‰JW-½ =žžªM·ÂàI:E˜%‹š]­–­j•j© ¯šé8ZWFUUœÙJÙ’·kˆ:ªY3LM«R§jõjTS˵šU3¢äÁWÒ!¶öƒi.±ŽÛæà4gÞ/Ê•WûÜÔ¶¢à`<˜þ½b\Ò¯‡4€:qÈbP¨ÜX!H².àïU—¸ }:t:ýÜÕå+¢;ã¡5‹û~…±póµ %óã¹¹Þ[M¨˜Ú̧zâ)Î+*îÁ@&{ïGéZÊœ;þ䮋(áÁ7Ïáô„Õ®À‹k4cž z}ý€1’Ÿ( hÅò¡†G9œ­ºQã8×¾7Å:Ý;_l˜óÞBÙݨnj18_$2DnHo£œ§-<>Ã{ X|$ÀŽj±ŸŒ¡–CÌa,ý…DÚéûz^z+*[ƒžÜo•-Wæ2ôBÃ6ØþN|%—Rg*O,"Ì{/§…šÂ jV]„%d‚ƒ°W2ªvÊŠE˪C ŠÇ ³ã‚²a‹DE™µXvYôQ󵄠 WRæ‘YyÒö³¤ ËrT˨9†Uëéš©VÌZÕ©µšÖ«h¶óEĢ&‹j$UTYÕ÷äªzšåX=OP¸¢›–®–œªiUl»BAj¹¤[¶CE£zÏØÈ~pñ^L@Œ6iÓ)$Ú̯4åmŒŒ –¾šZVMoã Å`­^Õ°A"hþ©¥24ø§\ÒªÕžý´JUŒ6©ó‡)TqyfÕñ6åi÷Ë4TÝ0k5ÅÐÔj¹§áV½¦Vª { LöòÄQª{rÕb¼I…Óý>É3•²,³êw›²TÕ2U¬RŤv œ‚­TlS3)Ûh)êfŒ}j»ËKŸ² øŽ·ÖqYfÕïV~ÖÖk•ži–ôZÙé)”Ò²®—tªôôŠêXÊß»,ÅÒ'qÌv@‘} ïšQ³Û”¢Y©é5«ùY=ͩ♺f—jŽ‚ÇÑÊÓbK1Ú¤ÖãÃH˳fÕí6å¨×J`tEU«šj›`)ˆ¨öLÈ[Û¬Óúlj£Xú$«ï Õ0²Ö6†á8ÀêŽcYËVK¶®ê´ì5»¢8eµZ²62 h²ÜK9ŠÁ&µ=Ýóx?åøXë¬%¶uhU«gP³\6LjáâUUÑÍ’e©VÏ›¹ÿUjÓãa*tùìRɲiÍq´…–J :„ZUµ,Ã1ÊÓå=ÔwL‹Þ£ãËŸêTLjd™<«z³±ì­#‰Æ;ɉg:;°‚‰ìÍtb­ÌŠ-å’ Â–äX~dE¹…Бï…Þl²l~ˆÏÎFWñº?ûÁ'|çãn9(wp/59šŽagbÌÍÏi‡-Ke³³åcÄ ³¹èÒ‹|£"Ήàtˆä݉ɼ»À&PÒ]«¬Dbx÷ÙZ‰ØH60L#gÊO™¼#Yá}âQØ îG¢Iôx†uÞƒ,´HIÚV”ãý%1äŠ?yýž[êkò4DÇÓªßcšŽš;sBmW) N,êΉLîm49[`oìö퀘C›ðs–á;Éݘ>Î5Œ&9²ËžL2ò¹³À7XUÌaª„Bbã\oÏõŸv¶û)mà<„_àw é GA6_Ê”´Ä8þ^l„óšµ]¨Jÿçÿ¾Í“ÐûT瑺»7t*J4wE™AÇ Li’hR$tÏ&ómVý”ˆÑÒ´H“\Ô6×êTÎúBþ¬|جý0žÏ*«»[<\ærþNYîﬤ¿OW:™ü®žªQoß&ˆ&ÏÌ1ƒTŠ¶l8 ÛŸK²ef’¯­jæ¦siHL <žŸ®ÿON§lãuù$LV?‰FÉœdž¬v„ëbéýI'¹c±s}.„±ì^‘>–Š¿špvÎ<Ì|V›× "§ÇÖ<-e•™WÞ?ˆBßàœªœÄ¼×>ß“2ò‚Àíõ'pƒíÃ7O„¸-'ȇa¾½¡H3ðÓ:ž?àÇ%Þ˜rBrÝP{ŽvË‚Kie,G{[s‘¢ÁÇCsÑRµºdm@vß.1.õx¾=Þ5š|ö-jå…'P ê³¥n†«8"î‘€‹WÉ[Èá­·è» Ó9Ô´Bö#F9¼uú&O³@®ûòD¸­7Å ~.ïì†ÔTvÐWñ†¶0¿Ýtz,=KaízK]_X¥tAí°óSQ óSQžvççiõW$¦hŸP'´Ÿ=§=Î(SÝ*?ŒySu¬ÙN-HÈó'l¿óêFûzÚ<´úïc$e ±Š§¶ÀÇ‹ƒÊà Ä+gŸƒr_FTžŒs}L]¤×‡HAg‡>Ûv¾»v,ÈvƒQßœ»þ8ãÖœ@NàˆCpSv<º2Ú@9!´EQŠi…Ñ#,(€ûƒ£9~²$ÙçLbšžos¾¸õü?É­ÞðÖj@ÒO¤ñ7Ú<Û¨ÊD™ž±­ìÈ«|‹6 ²GºÃë‚[±6 `ôŠÙz@Cä–Êdvó‘îPõ¦Ëžã›Riz˜£¬Q OÛ·¯÷˜‹Ï>Õ«ZâÙ¬éÐ+ÐðóS\2*±gýoÜe\¶“ÎÈê—Ýáhüð^™ »z5Œ‰+õ—¸#Ç÷3— ×GýIb|c…Ç[ôŸj±â™¦‹ž¥ËFŒA1dûc<ýt<²YÓ6Ênäñ“uc‡ÏïˆÀ-ˆdݶG’˜&çóÓŽVû¶'2ÙG‚%RbF#ì8LPò´Ì är…®¸ô·8Yãð=Jy?ЄE†[Šd‡Ä‚VøxÎÄòLv"<ãñk/Ç㿼ֿÎÿ/—’µ`'y¬=ÿ_Q*jIOœÿ¯¾*)»ürþÿC¼^Îÿ˜óÿ}Úg³þWxnwá†tø Âùz—G¼<àå/xyÀó|@,ýV‡ó ¼ŸãÍOºOr_.-oo'ÉXrÀ}"ÕøÁ`¹T(vN#÷YCœq—ˆ7ôrÇh?JdUñÈÑÂcÞ–%ª US‰23MFúu¹ãâÁÿnû:8˜Ö )ìš»–VÈRܬÚå¯iÏïÔíù¦?Y%‘ ».À®Ëcp½ìÆÖz_hííLïeöòÖ{E€½²•Þ?²í|?¨°¡ÜRµ¨”ŠjI)íDïUöêÖ{M€½&=SŽJi}ŽJIF[Ù²°‹¢Èdy°ËW6ü"ST)üdÖáì$öêB'€OAl@päõ'7ÔöÍ>¾×g«ÐC³ÿ'ü¿¦¸ºžj6ü2S¤Èìõ/ 4EŠÐ˜_Ê_]]åóWyö™|ççï’a *~©)R¤ÆðÙ>‹é÷Bøô~ÞåçDȈ_@lŠ±l ÿ¾oƒ_@nŠ¹þ»¿þúëî/þ™|/ O|¯@Šï[àœ"EpˆŸ|"w;rߎà}JØ÷#ö«Áâ÷QüÙ wß}ª2âœ"Cr›Üõïˆá¤ðîÇXÍåøQÆï¯çȆ_P¦*E™ áìG8Cxc¬ÃåøQÖ;&@„2âð¯*Ç¿„[Ëp†?à2p¬v ?ü‘~2'@FüþU%ùp|fh&³ŽïˆÙ‰Â§øyÁïßIR€Œøü«Êñ/âiM‘ÅøI+I¼ç?SdÄ/à_U–ïHw§,þ”ñ øW•åß;ÒÜR€Œøü«Êòï|Ü°Ïäû`Ix*¬È­æûA,@FüþU¥ù—œ“»·û!¼;ð¶ÈwGFäîûzÞ=rçß“}B]/Æn‡YvüþUeù÷××Zítùÿô¯Uÿ³Ü³æ׌û¢àihF]¸\•åò½²á×\®IryÃMøR­ýÆh”ªär貎pB.Lß ;cú¶¬‡×:k·ê;Á/àrM–ËKÿ.×$¹|_ç«ŽJ>tNHßµè0 o¿€Ë5I.oS÷b¹½qï±DaÜaüøZÔs‡&?Wfä£ö>ûïÃÍð ¸\“äòg»Žk±Ô<;ÃjDýâ¤åÈ÷~¸6®ëcÇ àF{¯ß÷n£eÜ6[jl¨—k’\Žˆ4|»µùgÅ/àrMº/½«WFü.×$¹\)ÌU€Fxtó`°=df´rÖìáJkêw‡^µ>Ÿ¿€Ë5Y.'|Þ çy®±â¦ä„$Üõ [ë_À¿š$ÿª‹ú='üM¬¨ÌöØ¢K‹`üº€uÙ¾4™À&å/ÇÎŽ_À¿º<ÿ¦'rm|;;@… Ìú®Ùf¾”96ÿ›(´BvüþÕ%ùWã à1áx÷9ZBì¶4— øân:´=ôQžâA#hVa¿€uÙ¾4èTü² ̈Ï oÍhÓ(2l0¢ÒnpBâõ‘à†œê~LAVüþÕåDzÅÿëþÕ%ù·û¹Õ!óݯõv“À÷‹öùo­“æ ùð .6Iý²ûù¼Mþõ¯z.³Þ ï²ÔÏNàý4¿h7;‘6‘CÀú$·¾\œ¶5ˆÑ®Ÿu[ÍNûÓË“ÖÙ§<ùpÙ%gç]rÚúÒêB´îyžI·x[VüÖ%yøü#ùÒl7>ˆú‡Öi«û)øc«{†ÊýÚ­“‹z»Ûj\žÖÛäâ²}qÞâR;iu§õÖ—æÉ~HÀú$·Î@¿¤ù[ó¬K:Ÿë§§IãùÐÅ×?œ6¹`4'­v³ÑÅ"Š¿mZ<¬Kò0Ø X=(ÿ4O:ÍF ¿4o‚}ÔÛßòhÝó³Nó/!\$'õ/õO`.ûsV–¿!àaC’‡çªqã²Ýü‚å¶Õ¹üÐ鶺—Ý&ùt~~Âjk§Ùþ­ÕhvÞ‘Ós¬¿Ée§™µgxØäá“z·Î´ ÀÁèÚÍe§ÅÌ¿uÖm¶Û—ÝÖùÙòùü+HŸ°zr~ÆÌ*»ý6$y¬ý¼ý •ˆ–Î*pž|ýÜ„ð6V0žn»Ž†Þé¶[n2HÚ=ow7²CÀÆ$Ï̘œ5?¶>5ÏMDvŽ|mušoÀ×´:¡Å•ýµò^2óºe_³âð°!ÉÃ)Ë3GDZIýä·ÚH„\f§¹WV+Ÿ£Š\ØÐÿ6ä甥aø×äßùUtybB_€/¨ƒ–çÀº£qšÓ³˜ñj ì°ç4m„_À¿†$ÿÎNm/¯Qó²7ÙdX"#~ÿ’üÛ ¶íã|òk?|ǃ Qð?Ƈ£`lÿ×ëðSüŽ¤°°!ɧÞØ Ï<Ú'Þغ¡!“b\ñà¸Cè—Å‚ìHŠ²€‹Ëò}â½2âpqùá×w³ ãòË%*`Ȳ¶I¢Ú*¯¡­̱hx~îøµë ñù—çÓ«vó´ŽMœ«ÓV§{õ9›îDT^CDiDq¶k0ãÑMôö ìS^Ã>ËAËe+ òÒ˜×D´‰‚ù© ´]¯pƒ>) ”×À:<³Í8’›ÜÆmTg4ŠñBlþÐÐìèο\Û ‚U¾¸RÚ$Qƒ¬¬q zv¢J`ï_]Y£þ8À÷›Lš«ü]eMçC\gÿ¤“[Ï·sÇx˜§?Œ¢¤÷vð“!ú.D0Á~ý÷؃Fÿ—M—­¤½,!ÿ‘LWàh+òŽ‡?]'›T§ZÉìT岸ÅJy㯮3þ™§`w&<…R‰<ä[Uøf®U"O-.~˜s$ôJ74MÏHíaG#HÚHu]5Jö÷¬YåšcFÕ¨þ—½k}nÜ8òþ¬¿Q¾$>=æÌ(«­Ê­'W¶Ï•lêr_©æ)Ñæ’ IíZwkÿí×H‚˜ˆ]9U •$FwÏL÷¯çÑ“so¤áž9A •Æ YÉNödϲÉx›dU*¡¨>RXrÓRG;à7Qa]5Aa˜dœÏ­µNiA¨÷ZqdpAÉZa´Ma²º|ž¢Ù8ï3°—•jµ1bÛHü”Ú^»ŒÀáBZ¯TüµòX{ɼ,”“‚zD-+ Œ¨ðš»<,4 ¼ñĽަ½Õ‰Œ]Žíêà£ÕÖí©ÊíB€ ÊE ƒ­´cTh_X-¸åFA•bŠùJ¹Å/P¹]¤‡xûê¿ï£þàbˆƒ‹àP1‡Ê•)}—ŸÿÛˆ1u/(!#W;Om³„ªÞ0å)‘Ú}2‘eZÿü˜G¿> Ʋ£ƒ~Ýö«œaߦ…ˆ7a%4ñN°ôŠçÈÚœP%\‘;a—ª­ —Ù⳿©¶t:ËZšùY«}Úl!´fñ·©í+‚ïe¾?F=Dx)‘¥R+!  ieØb#÷˜Z´ª'E;ÉrG@ƒìˆ,Ž‘[çÔ ¤±†iGÁÈ)¥¥@…ñ&lMÖ"T™Vöç2¡rvL´á˜ÊL%•ÏHVY$*’EGµ$Uj¤ ¤‚cnÁ¤zn³Þ„|¢CeϪ­H—ìèã:F[+‚AS*gô%±%\ï z1€=Ûµ•¢¬dÁ#ØBÁ2‚-dÊÇåeö×Wóo¿šè¬N¤5™NV}ü FÝ€®˜ru3*%¦…𜀵ÐÊ žc—«œh§; ‡2¡äF-êñfiæ÷Ó‰Ž6Dmtø¾€ö?ú7ÑQ=$Ž¤oëýë3ŽäUëCˆvûr¸ž„•Ç<ú5­nŸ ×ÇÿûË:™p&÷ÇÊ8’ø®ÿ²±2Žd?ë[´˜Kf.°°¾ŒZì½ñØaNˆÂ¦HØv¥¶e³FmâÝ. ®!wAÁ ‹œRºJH\ êIÎrW˜"Wš¶É½#v²@Ýî®0/‘Œ)x7cJшIʉò|ñ=ŽäDÁ©9QZŽ¯«M‰Ö»A•¸´îéËAûÕ“ÿˆ#z†œ(ýlV$) ÞIŠ2°íæTÓ‚;‹´öšjžÃÔ1DV†´µÝ*ÍwÙzSÛm$C îÊr\&ã©'¬)¸Râò‚Jt”Áš ŬõVJ×&mØ0¯”uxè€# Vðn‚•4¢§¶›õ$hÄc$¥"yN³qÉ©HßVƒ¯M¨µì¸½ÿ‘T$81ɘG?³ÉE‚wr‘ 4[ÄKª¸Ô),5Ë A mm^„¬¡Ô’¶†<›W)I3hp5µ©Gr™à\&Cå×ÒS㵓ÄȬg(kžd Ó&¹Û±–,’êï¤:(žtJÑr¬Iá‰ó¹ð“<·ykñšù Ä!ùÃþH&¼“ ¥ËLìÇh=â>»œŒè>1Ë)wŠZ£vLP/CåÈ./ÚŠEY{¨L ÚI?â>wò£|œ"‰xß®œ'# +œðƈ¾„!L0®‘‘Ö ‹r§ukK¹XÞ_& °“3å#µ“ˆ÷ßI^24ÎKKCžê"‡ðI™3è¬%¥\´ê|~Xå©âEr›à®Ü&#Ö9IsáEÁ Dùàƒ8až"Á%ãÆP¬pû×òG°EWn”åWºV;,s '‘Ó‡ ÑN)ƔԨUþÅ( .º’«Œ¨@—”¼ê|æâ)&¥2FñÖ.{ë–«ÅüqDHW‚–Ýi{&(E:NÁsæ¹Á ìpv9ǬмMåîG"”H~L‡#”# o$k îÊÚ2b¡ŽÓBJÏòP3¹×à½sšYALÞ P®b·‹ÉêñÆÜ9óñÅ*t(TÙÒD‚úÒ:’Ǽ+¹®DSW†™˜¡>gÊ#§…PE$Ã6§žQpn¨u*ÚÒ­n»V’qXtœÞ{ˆž©ó؆Þ0ðlΆþ*#Tpòš´zs?™®Üâ#i!‚éºâl½z9ù_wÓn]R:J ª!bTzœ#$ ;å9wTHÛêóÌüav0"M•?’Pw%Ô3öóÔæÈ„É)*W`Сª°Ü †¡ÈµòÜBsQ«*™[iY#‰yp~üˆ|R½M£ëq_¢"à/ßßnå™\Å#®+çÏX>…#9|pWŸÖÕ9YöSâ›#8ª+ûÎÑ«’p$gîÊ™Ó{©gÉ^Övcc¡c=höÔ1çc_üÕʬ·/­ÜM°r7 V~›FÐ]©Ä±=FÅñöˬ3“Úµ€õòÙVOÓN,쥮û_½¸Ô匭ÆjN¹»)o@ôö;æªÈ‹ÏɺŽ=öÐõQ؇•Ý†©Qú͘z¦a~ý®ž©ÄôŸ`—®ç0Yï°ò`i JÓëžÛ˜Mw–‰1Ë ‡IÄ»å…%P^ñiDéåuÔ”¤c›EIhS$#+œ\¼×@î­ðø`bºÂ˜¢‡Í?f2ƱF¿$ô¡QÎZÚ@Ά´ø‚tÅ1¡w݇猗·Ž›Œ¨|FZ#CN|à.]ùGö.€õ³GÔ7Ë5võÍÃþV&º´‡•9baieGPΨV=tÿíYõœ¦ë›‰›õ>é1mnÒSm§¦êkâ}á=lØ(ýê½ x›Dû(øúuàvàߨKE‹o‡“éŃ‹ÔZÐÉb°PP?ö°û^/ÎÝ•Ò‰_c“^åŽY¯s,\it ŒÚ2žíõd€¦ã)JÒ5=8ÝIG÷o•­eï¹ìó6;=j]Þëù…º<¤ã7¾’;]ÃG­ ïÅ¢ÐQë4i«Ó¤GÆ4Ù"î­8>Ê2Üj KÂC-`|Nxz­9n~ùÑ![I©Ýç~è@®mX!4¬Ÿyœ^ÇÌbî߈áÁç åhKÍè8:¾”­Ç¨ÎËâz«?<øÁû+PKŸiŽ†tšÆ§ö^ãLO<¬ò€Ê£$‚ý?£ÆÔa;†½˜:ìÁп;:ûºG/ö3¹ûÇÔðà‡ï½`mžõ±ðë8ê&!Whj¤•’wtO3WWëT¤‰þö>+ïðîá/€.CBŠø‚‘#ºÃŸ=žûQêo›¥`},æɨ·m¹çqÀWìõn¡¼ÙÛtU&«é~£Knz€ßáËwô#~Œ*S´tز¢G‡íÆäÅ“ø¦›¼8­“WçÔP=<¢Üë˜Ø£_öiÜ!ºX¦Ç¸Ã1 oúB§òÁg‰ÔxÛ¨4ê_é®ýcWMô¶ õÃQë¨J߯ñ ôAU>¾¬¢GÜpÔcÝ~Eé£è¿@-ú/P‹þ«/¿:?ÏüB݆éÂÙùùËÆi3‡¨g¶Z†Ó'å™åJ-V™ŸÏAšì>|./Ý-j¶«K§—P Ö.Ür¹sáå‹e˜éùòäK7s vBŸÏ²¯á÷?¦)2‚0Ë0½Êùa²§=Éôc¶ž4]kànµº¿º¼|÷îÝ…ÿøxëfóÅíådfÝkXròbòæv‡‰l¹0קõ÷³ÛÓLMW›3ÀýIÐV†/ćËpª)\Õsûþ‡—¼<ùìÓñlG(;7eI\†&!8T†Õ¨ï@Á’äùg%4a¨ùÕ×0a±1Cœ~†p^ôY†FåâÀñe–}¦«}äÞ»þ/zØÉíBÝße§Á¸ÞOVó›‡Ùb>žžüßI–9{ë²x°dÕ?¹é[·šuzN†•×§žM•vÓÖû6W67ÿÏïNÂÖê6òòNÝ»ë…3ó…-ŸüžÄÙ?Jº×û|ŸÝ¹°sü5º gï&vuŸò33ŸÎקzªÌ§gx”éúÔíÂ=|?ëü8…w†KΞf‹­§/?Ysa'ázIt}³U‹æ s7±tO”ê V-ïà gk JÐ|šµéÞùÓµ[íÿv:×jº¼±¥õíÝí;#;íŸL?µÿq¼øÕÿùêõû‡,yöíßþý«?¿ÊNÏ//ÿ‹¾º¼üâõÙßÿôúë¯À›£ìõBÍ–%–RÓËË?|sš51Ä;Z‡×¹ü1ÐÂááõÇóUãÉ »²Y”/üñÍt¶¼n!ƒ¥”ÕÓå½NYø÷Æ­¼À½çMÞ^Ÿ¾ª0Öùë°ò¯F\ÿ EUÿÎÜ© ø뿽þã¹(±É‘¿Ÿÿí÷çuÚêi“Οÿp-Ÿž©çm½æ‹Æ}_TЧ‚<å«Éjê^Öàë*û²jZ/.« '/¦“Ùk¶Rzya–ËÓlìAi%ÀB80 !îX‹n”—f1¹_5¯|¯Þªêì›}ÿÏ·x¼ø~Y.?+¯¤=hgKWå“Û}ºÁo ý’XÎJ8¸.¿5î @=„+«ùýi…•í ˆ½™¿uÙên²Ìà&@÷«l@ð| PìúÕ¿ª€ó†NЩZ8ª hsê2ã¦Óå½2“Ùíõ):-¿ß]y’½XUÜÀ‡Emû+×q•1~ÿãïÂMpÑÖןO‡[Ðsoª{² #÷‹ù÷ ¿*’ª ?ÜÑ\®Ø¼ñá°]È‹zuI°Š1‡• ,^®Õ¿9—RÖQH]¸™Í‚ž·b‹pá)X nUÕòžÿ3õv1‡O7aÔÌJÄìOgC`´¾—¦“§°±=”ò¾üZMf•üߪ[·Yâ)x°F9J…†ê„¾ÙœN!¢fP£‚Ô[4¾P+U1³ÙÝ¥ƒZ-±yX,Êõ ê€v¸ûc8ÓJêÅåô*̺T·õM¶ôMz*¼“JÆ¯Ê eý¥[-ª 6@B:@Â~Üý~:M©5 i3·uVçÑìC%˜º-*¯«Ý®†))ßRíY šJùuÙoTÍ–ê#”n’Ð5 ݇„i’05 sDM\CÒ5I[“´}¸rM®&‘d6Õ¦IÂ×$|·M·5‰Û>$&M“šÄ¤‰i“ĦúöjBoš$ÞÔ$Þô!1k’˜Õ$f}HÜ7IÜ×$îûX4I,j‹>$¶šÝ²&ÑÏ–4I¬jÖ{ŸÄC“ÄCM⡉·MokoSìY£çpÝ@«›öº7ôt§ëp¢žÎ!~~ù'·pí©¬LšûŸý)ÁñYöV-&öÀÇ*)|p¡àŸì³Þjp™½›¬î²€W—À €I—•>2|zÌ äžÏnáÂÕšo.hcÏA53wÛ»üdm@p©Ù9 Y¸9ÈÔú¬˜gÝ̸rÎoO®¹lÜ´™É†²ÍBŠE.w˜çL8­0Rck°ÄŸ¾|¢zQæ89;L•×}ô&W˜c¡Y!gÞá™ò…fXH«¶©–×NªÂl¥ZÓÕ)LýZ‘æbÔJMv„*g òÌsƒµnym‡0µŠ8ºTω i DYx‹TÄ·¨è 0åR’¤‚a…B‡4š`Â¨ç’ íãvXÁXdPZäJƒb@ø¢,V†sÇlpH/˜j80©`Œ2Ì uEn%Ô/i—ˆŠPÎÕ°‚),õX ä\Ž GP}˜®'=’ÿ}ŒMø4àÓT€_ÄT€Ñ†þ›òœƒA½Û'ÊïåÍë”Æ57uoN_¶Ž)QÉšÝ ¹lìó‡ GCÿ‘ ˆ—…G¹Ã¶~Ø2ž¬œ(°~K­ƒ´q°ªYžnÊ~ëti½vGȪs•©ˆ·Œ¹UÏw ºm­{ kq¾œ×CdÂ"†ráC|+-o¨Q¥¤ ªõz‡í$ûÙÜÜUCg²¹gÙÎnYû+[ÚˆvoBeû›Ü#öüØ£ßÞ°uo3eI[B‡ãóCÄnz"¾šè…Z<¸­$Ñ÷î- ²¬cK‚]Þ?ºÞ»75ȲŽM õþd.×Xo,½wo‰e["<»Þ»7ZʲŽ–ôþÇÉb¹ÊÞºEÐûUFÄ%â—BÊQôÞ½÷Q–¥ìCý\zïÞ±(ËRö îõFܽGP†“vî÷ʈwÁ{1~ ªûñqd¸c+ÅæFáOAæŽ-'ÄøùâZ-ËêûùôñÎÙ…š‚ßO«™1júü¿uàÿeEíÇÄ™á$göŒú84œäÐJ»tvsssvvsVþmþžíž¿ižÛ³Pýø85œäÔJþ/Ë_ø{¹ý»w~ó-ü}¶#BOþ#Ž '9¶Ï³~¾;†ÿˆsÃIÎ øÿóÏ?¿ÿ¹úÛüm;ßø{yR|wÿ‡“\à?û2{ÿê}ö-|º†ß¯²òóuùíUuný{]ÿ}•½ÿ.p¿U=ù89œâä*þÿ’½Ÿ¾Ïæk>üNk^U;ÿAÆï~½#@?þIÄe’$—Yòÿû’ÏéšÏü>Ô¼ÎÚùÿö®¶¹m[K÷s~êÎtìÔ¶ð=±=W±•D;Ží•ä¦™íN._@‡¹²¨’Tïzÿûâ…”(Zæi¥íά2Ž$„žç8xYïE*&ÔR~€‰ÿ"i-³•ü™,ƒ”5\“ŸýC+ùQ­-åø—(ò/“ã­æNJ'ìGÊw,ì ×—òËÃ?ÿŽªh)?À¿D¹<Ã¥d¥ü¨"+ªüÕÿ_+@Kùþ%ªü{&äT•­-åø—¨òï=t—¿Z€–òüKTù÷žýwÿ\ü_ý{¾áúÚµž´šßŸ—h)?À¿D™Ñ%ºŸK»Ÿ±¿1û Ð}ræèþ@b}Ìþ|tŸÞ#OüÏÚz¯„Idíåø—¨òïÏ?éîKÖI”ïëß{oóL÷÷——W[êàr¢Êå[{µ“_¸\WäòÓd~—ò‰'´{º‡x :ºžÅb„#¿CW^gãEÈú¶¢‡7¼ û[‘àr]•Ëÿ*ý\®+rù®~À®.2Š^ÏÐ4è,£{‚ü—ëŠ\>¢aœÉ3ø0>·^˜x†äÔ—üxÆG†ùø@¶/—Ë$©xOy7ù.×¹ü6 ã(Ä$Ä>òRŠæ4½s>c9O“/qÈ>䟼\.ëI¦Óäk<»á3ñ¡/È:êàr]‘˹ķ4ñdóo+?Àåºr_z[¯–ò\®+r9>¬5ŒOe¶ÏOG·‹Œäk܆<Ÿ‡KÜ%9kõûmå¸\Wår$çÝÊp»KÜÖŒž•“eßÒôðÉúø·éˆûªüä¡þ™ž+xSêŸ5æpÐUÐA~àˆzÔtD}Mÿ¥t©TU{ùþ5Ôùw}"—IÛcØžˆ!Þ[/§iìM³– ðó¿•J;l/?À¿†"ÿê‡h„áË9hf FK\ö;äSÎh!¿¦³0I»ñáí4¹MrŠ¤YåYkùþm:ÿ½®¦â/LÀˆ‰$(K¢ü+g†’a³9 8Í1qcN¼)'¸™¤º,“ÐR~€›Î‹ÿ;à?pêœ| ~=œ\på¾fÚí£«þh2<½>ïÐÕõèêr̪‡ÕÚÙp|zÞ¾œuÀ!€‡ E^0ý¢Á¯ƒ‹ ¿íŸŸWçÕ€)¾ÿê| ËÁŒæl8œNx•Ÿº¶€‡ Ef¶Â¬ž)ÿ|¯§CþaðÛ€ÙGôaŸ[÷éåÅxðï×,»‰Îúïúo˜¹ìÖ¬¬¥ü&Àæ"×›5ãÓëÑà¯f[ãëWãÉpr= 7——g¢µŽ£_‡§ƒñKt~ÉÛïkt=´õãL€‡ME>ëOúBËLpfôL(n7×ã¡0ÿáÅd0]_M†—{èíå{fh¬BúLà3ÑN./„Yµ·àaS‘‡™µ_Ž>p%rK x½;`×G¼q0㙌úÜÐÇ“ÑðtRMÆJ:¹M:Ù¿ ð°©ÈÃ+3Fƒ7çÃ7ƒ‹Ó—ì’—àýp<ØcX3óC©ì÷}VÞka^¼­³ºàÛÊð°©ÈÃk<¶/€ _£þÙ¯Cn#…Œ 2ÇÃ^E«8}[4äÃŽøc?WU<Ó®õdÅÿrp€–è‘ÿ>ëV ò»¶²Âè4£íš àð»ÎVtÄkMàjWÈéºí kÍ€Èî«bŸgWs¾­1m…YX„Íî?³Ž[ƒ–q³ûha`•6ÖêxÚV°n6ŠØâ\ߊ\ÿ£˜k3š²û],¿Ùý™6.ØSð51Ö)µX>NèD¡eWÖOµ rtÍç®_4j|?_Óv\ÛÖuâúVdé‘ë¹T}âb“% õ â(nÓÕTu1°¢ãÄúükYZé&kªÍXOˆkë ›°Ê×Wù©eÚLŠ¸¾ôN)ÓÆõ ÍC‡DšåQÇ ø~Ë4òLlPߎlà !_¢Ü<øÞ[eóx®b,u1ÖØÿzàTÓC¸.ÂÀºa:nÅXä°ÂZ¾s«Ö™`¢â=mTÈ£é$k”)¥Oªj€iÕW•¨eÚìa¢Ò¯lö¸UkXiõºOÕàU]qâQ…Ÿøà~+¯ X0õºW…Ðåø¼Ü‡\±æ›ÆÖLisB–[ü_4)Þð«•ÌöTáXru`žÇ‹ýÚ2›_¯5&àʉâ{¿kâ­xDUfÀ³Óëž"IËp}ùƒZ¦ëêÝܔ拴 U‡Mõ~U“G«ZÍ¢×cäÔ2ÝTb¬xˆÏ…žÑqKˆBÃæÃ1GÔ_ܬÛÀÆá›Y"Ô’¹ÜÐåÞM§ Î ›u·Zã[ô€81lÕ=jEŽâ·p=~K-SM­Æ˜ªóÿjOåJ.Q™ËˆÉVàDca«îPŠß:V°Hó,òó=|Ç i@ˆï{ئ¾áóÍ'– {ÁTMÛÂõ°-µLœ³=Öjå\ÏC\ËkGBÀ<!0h—~¡éè°¡O^†|Jgˆã·ÿŒofIJýv}9 F [õi)Ò/ÇÜh¦tVÀ”²ê¨¬Go©e @žU‡’²ÌaOÙV€à b4Ï¢De"˜Ùo&ö|å;òɪŒýr—©`tãá.U{R®z€:=*"<°·©ïí§–)@FƃAÕm·>€·j;å©ê À¶úþuj™XUßTN)ÓÆ(6¤fŽ¥ù†J5 Ë#Z`P3Âbï~‚†hóÇ©E«PËrÃõ®,Ñj¥B™{«™ɇA2 »qd|™ª¨¬Í]‚Ç¡Pè—Cl1TÙî…㪗…e'MFG°´Ý‘öq³àÑèù®4Œâ‰½]yµ»1lR¢VS¢ÖZ‰ê*Zû©¿£•÷aIžÞ›|¼Öj=`´)‡Ý'TŸ^¯>ÂOî^é4xAøQÝ­ìv«7‚Ö.¼b#(žØÛ•ˆ¹ÝVÀ7¤«¶ÛV×â’eà~†:Ëté³4ÛeÁ&ë•Ê”«¶I2|_I2åB;%’QÆ”ó7OâóAÛÒ½(CE½ƒ=À#êöÐeôhXë»»ÈíNjÞÇ>÷äŠýÿ¶h#bÇÆÂFÊ}[)+¸S?¸]‹{2þohf<ú½lfez+è‡ÇêÔ¡¿õ¸_³…À_¤ß+,tIZF¹]0k$ÐFŸ®²+Tn`]ݼº¥áû7©~‡ T•­¶\!Ü‚p–J…»íêJí2ð¸V9ú®§¯öy”Cõ+Ù¦ZE¨I¡ÖeDH+€¼Õ¦ýà9Ôñ.Ëâ‘ïÒÅâËžÖp¥EŸ{ið” ºuv^l×ñY~«´'¦|K«4»¨ÚUWg‡abU‹¾'jòu+%jº-ÆOle7}yêÁêă–O|¨#HûIÅîiùÈÞSú÷°Ã©aG ?y5ÆŽr·ãj;bÞHk…òŠä%ú–.Þvºpm  w€ xÚC6ºL¡´ëpˆÇ¾'|ˆ%ã6]8]>–§w¬ŽëhiýðÌ ºõ·eTêàÈäßÇõ¨ ‘Û ^~ùñàE©w×۠ƒƒ“Êå a9ÌòŒ_~&®d¹—æ(J¾Æœ·>¥¥ÄòÖN©1 Sšeµ'GÌ“go茦^NçÍÐ;ö÷o‹)"6_Qg"¬¿0¬¦Ã´[nçß¡eü•,ü§<Ÿ¿èõ¾~ýz&ßînèì0Iozñ,¤ß ëyvßÞÔ„@Yï”OÌg7;È›æË+Lúg"† :‡û(Ef—d‘ø]? ïø;ÿ‘“g?üÿë /®Ã0 „.{Üž5Ùô·ùÃÁ±»zFΙßHðLÒJº3 ^´ÄyœOéI Ÿ/ŠEï®8úhDS:ã]<™ôÙÑ4žý«ÀÖÜó³Ã ËvPJ§<øünJ³O”æ;ˆ¯ü( ÈðßÊ‚4žçÕ;Ÿ½/ž¼Zàíç?4½;üœñ¹~yGíÁðn–Q¹6µþtEÞΕDFâ‹-°œó.÷!òd¾#ù/LDP}Jo“/|#¨8C,Ñ>ŠssbK2F_Œ•ŠŸþQ’á2®S/¥7¦Í)EN³¹ij›ãmG|Ÿ3V)¾ŸzÔ[Lee–µº®o²¦oÒRáÛ-—øÅZÉ6ä%¿y]+i«\ñþH¾¯c: •”Wñ™z¬` Ð”´ÿ¥’‹ËÙâöÖKï8<”"ý4_ø^ž§17q. *¥`þh­®Örh³SëÉk ¸Ï³ÛP ™e½ew€ýʳ£ùɃ{ì,F:­FÈéZµƒ²sÂ¥©žÀ(r:êÍW@)s¹¥‰X¿iš M«ef¨ÇêŒ!apPïð‰öO¤Ls“&‹y©úe¸Ùš‚¹ÏÖ´ü‰œt“ØVùE&JœÓÛž©Eºoy4p=lÒÀ0=âÄt|—úÄ‘¯\¦åSCöÔ9gÞLjo˜”âä¯ô¥ø*èFŽI—±{ü÷ä1ZÌOþ—½«ùmdËêšYÍ´ô+$b®Ü3Cwž;q}»òº­qwbH'Áv^Oë5ò«/'¥¶]~e;ý¢É{ VÀ ±Vh$À’ #ÄÍ߀`1Ò,@H¬#X çÞª²oUìº÷Vlw/ŽìØõqêœsÏ=¿soÝ:g2 ôc.i•W’å.l~#4 |‘èc<7Ž6Ä…o'§–R­D ]mI;¹íøÐìÄ#%?¢^¸¤‰ÈA€'^$tmÒ é>!€Ýœ7@lTÃ5’îÑÌp·|"ʽF¤x(IWos`ï|`Š‹“zc8‚d’ÛFMŒýÁ¨ $*O`Ð9ð‡ìâ*¾ˆX;îFó‘=²¢ÚJˆ¯Í–*DkPÐ#Z8Ϧ;ávÔõ¢î¿D»¤ƒN;ÓA"h¬ÜÙ嬡s‰[šLÄpX î|tÓÄ]¬tk+Ä%“`Ž3Y6’$%OIT‚æ?Ý[Çâî¶5køÝݤ°&9ogN'Ùd؃±+æyTÛǶ´ÖxÝ-*¬ª+iyÌÌ H<¶Œ’lÞ¾#cÌ&žx|ŒI—EˆUŠHt£Sœˆ¢SDÈ adeÊŒF´>Fœ¹B™/þ£B’¶Ï¨Ä«ƒc*8Ϭ¥”v£å_éÖ§áOæí¿èÒ}ÌÄ‘Pä#Ñ[0ð‹Yß ƒqŒ½¤}Kò Eî>ÅaRt šflEÖ{4'iÞÏI®ú•šÿ£Cý^#þO–4ÃÈÎÿ²v?ÿ·‰×ýüßfæÿÈ@g^ö<'ßOýÝOýÝOýÝOý½WS˵öÿs*9‡·Øw¾£7F:=‘oI¦$ûÞÔn½T«“;¢›l&”Å'í•j{Â'í—jûÂ'€Ž„Oj”j á“KµCá“š¥ZSø¤ãRíXø¤“RíDø¤³RíLø¤V©Ö>©]ªµ…Oê”já“>.Õ>ž/zIp8ÆÎ^øÃ]$UXÑÛKâ=!®|pÿmh>šÍ×:Þ ÐÞúîäòYÉÔ¾SBvB›y.°ãù(ŒÚàX“ ÐE³¸ñÓÐïV<Õñ,pµøb©)*ë2™q>-úG²$(™Š¥œž ¦¿,©Éë¥SÐõœ–†ÖõxÞˆiÒ—T–½NeÙ›R–L) UkQ•³NU9›R•B© Oq«Š<ýxaœ‡zÅWÐRW€V SÄëéî:›ÜÝT“ë”Æ\2nts óÖ©0oS 3(…á[^ëò(ëÔÖŦ´U¥´E&W|g-Úòש-SÚ2)mù«vŽËSˆ¬ðtdâÃóbÚǵU×Ðâýu¶xC-.ÑÁI?FkQÕpªnJUtpBæVlº‹’¬¼)FëlŠÑ¦š‚³Fýé$èN‡a°&•…ëTY¸)•ÑqVèõãu+5`cÁ%ºx:q-Í2^g³Œ7Õ,t|2v¬É:‹™º†€ç"/Ó°>ÆóëWÉRêx¹ÍŠ•$Ó@8¾ØA=£¶É:Ív²!³•i,Ä7àâ„+×ÖÕ:µuµ)mÑÈ~å9“€;"­Ñ›fÝOòßOòÕ&ùïŠýò-K­ÿº­Ñe·ï(.èe²¢kä¯ÿª¨Š”]ÿ¥k²|¿þk/×'ŽJ‡äß1iûÒƒ<@Ès/<ôIºr„÷G^ÿÊ›øŽU*ã¸Ðò³’T)•û–íõ7Û3;ø÷?ÊÃÀå£<¾´FÞ³Ðs ª gžÀ™&ú$Ú!Éçñ5ž•šÃK/ôÁ-diDËxžU¶årt±²­–_Ûï÷ „xù½wmhÀ@tÇïÊŸa÷-çMiÆ”TAOj {®ÀûËñÑßb6ìþÔ»%dtqÐ÷c泜ÑWY$ûÙÔîûΞ5¾E›_ø”XåóÖñ³Ò·‰ó›ãœ)³µ>™¥…2wÂéбîÔÞ1Ÿ!¦A <£œ•WÉmb× ß€Ù ÜAVeqû†€>p´®&¦ég¥Vs¥îù¡g‡¾óF½‹Øê±ý+h‡µ =£žYÛH_Ö }>LÖþ¯À´c76¿¦¾ÉôÅ=ÖŒúOIVÓÚړ϶¤1sQú"ƒÐ^,յƗ¸ böSœ/—ÝÈ“½³9É«Lg„Î¥ï*|ÒºÓ±çîã˱4P]l×ãØómÙ1Ù™è_¼ûxú—í•Šÿ'–ݵð°fµ×`ÄÿY¢ó¿ÈøùI­ÜÇÿ›xýÉÙÉá~wœšG-øÿ5xû_‡ÏŸüÚO>ç̓zçó¯ýç÷ÁV~uÿ·ƒ¿|ô§üÉ?ýø§ßù×ÏñðŸÿê¯ÿíßüßþãÏÿëGßzù#ïáÊä›Í_G¿©|øgÿ?Ÿ}ùúW~ëÇß2ÿö_~úïþöÅßýÃÏñżúïîÔ¿®¾ú‹Ÿ}¹h6NþfïÓ?z‡ŠøŠ¾nåÒSùæVrüþ¯ªœíÿºªßÿ7òºþk3ÏÍnn_¢6é_?#òôþ°ûGÀî[ß#`›z4êýyl1'‘ŒÇd¥[WýÀ¶úi*‡Ñ6®ç°(yž€W½œ ÈorpœŸ€Úçõ½%iu`ÛuUÕÑUM3mÛ³=Çèi³ªÊŽZuíª=»á'Ešq(r Ó­V5Ç•£ZÑáeZ½žbÈ–ìjZU–zó»Ä…È»&æ\2Ù25KQª^¯êئ§Èºi:f²fŠ¤¼c¯;»J¢ãõ>éF¡Ôp£Óãêɢà Éß“Îmô"÷ŽÍv›ˆKQMr㦳ß.be¼ aqC„ÒÅ„¤1^D4¿/BÙ¼™"ñó ¥ÚÎÖ‡OîúÚÚšõ<.Þókä"”®‘»˜oⶶÐâ×ìöê±o‡Vx½ä0BBŒ÷ü ¶©ü¼o\ïù5fÒî¦÷¹kØ¡CÊÕè=¿,Bú{¬÷ü­wÒûs?OЕbÕC°§ìHòŽ\‘¤•è=¿,BÕ÷XïùÕc29xº¢TÉ¿¢TáÑ–Ø%è"I<—ÜZåKŒI2ÿh>œË$V/ÖdLVÝŒ‚þõ¥ç†V?è ì[ý7ðÿÂü‰¡ŠñÏ3‰ ÌÞ¡þ€&qñKån·[.wËä“~—³Û»ô¶[JŒ¨I\ Føß!oøÜI¿omŸýŸ7匂ü3€MⶭÂìã¿×wáŸn¸ÿ7_~ùåÍ—Ñ'ý^´úÜ邯ïÀ?à$.€Ãü£Ct³ƒÎàÛ3x#òýùµm‹ßÏ’Ï}tósŸjAþ 'ñ€\Ä ÝôoPóéÁ»Ÿðj-æËøúaF1þedÊ\Iø¯>û1ŸxO^‡‹ùDzÞ(䟿2þ¢ÈZ†sþÇ‘ ¯nŠøCsþQFAþø+sâ/ðqD¸¹Ž¸#öñ÷ŒØŠ·Ïøz þþÑòÏÀ_™1?Íg ÿˆâQïìgJAþø+óâï êÜâ“—ÿ”‚ü3ðWæÅßÔ(Î?-€ ÿ ü•yñ÷>n¶È'ýÞZ°=µm'²š×[‰‚ü3ðWæÆ_tŠnF‘Ýá݆·ƒn‚4B7O"_ïÃÛF7á ²È'ôõÄíD@&Î?e^üýîCÅü‰Ñÿô¯eÿEÎÉù5Ǿxól« .X.óbùÊ^bü+ ,W8±|?]“løèÑþcˆ*Ut>ôÉ ÇäY¡?~Òžº0¶%#¼æI«Y_ ÿ ,Wx±ü]éŸå '–?RžÀÖéØC{íÔ÷o8öo€–+œXÞò\?æiO£$ê`#Xˆ¢å#ˆl²ý!žÆóã2zëO.Q’ÿÁtRŒ–+œX>\¿ç;ä&DY¡‡F8]üß…Á•ï—ɥ5ɤÖv‚¡K2Œ êŸå '–cŽÞd÷Îæ/Ê?Ëî±ôª^‚ü3°\áÄri;ÓÆøVVlû¸¦ LÇxÃÄ‚>mȲñZgæw‡Áz}Y”–+¼XŽ¢ûnøF2朲kÜqÓFr à…ÛwÖ?Nü•oëôLù›DÿЙݩã-l‚ü« üUyÇÒhfEÚÅF%Î?U~üMßÈnwÀ·dŠw`M¼Ð·úã¹/%ΟÜÿ¥m[œþªœø«l#\hŽîAƒuL–0ï×dñ‘íaDsñüµ7tƒÐ Oo‡Á ˜x(2«ÉX˜þª¼ciÐ?¨øj^ׇz“·„<ðëcà 1À #¨£䟿*ÿ\ö;ñÿ*UNüí5Û¨}ú¼ó²Þj ø~Ö:ý¸yÐ8@{¯`gÕÏ;G§-ôé§õ6ì&£•hÈR?9€÷+ÔøþY«Ñn#8¨ˆ V9q¸ùâì¸ \ƒ­úI§Ùh—!Øß?>?hž–ÑÞyœvÐqóE³‡uNËDºÛ§‰òÏÀa•‡OŸ£Öþ0Qßk7;¯ˆ‚Ÿ7;'X¹ÏA»utVoušûçÇõ:;o¶¡y ÕšíýãzóEã €bà°Ê‰ÃÍÐ/j|Ü8é öQýø˜6ž½(¾¾w܈ä£9h¶ûÜDÉ·¢ý€Ã*'ƒ­€Õƒò˨}ÖØoâ/ï7À>ê­WelÝû§'íÆïÃA°Ô_ÔÁ\e¬LÃ'gºñþy«ñ·ØVû|¯ÝivÎ; txzz@zk»Ñú¸¹ßh„ŽOqÿ}ŽÎÛ Ñ8Ncà°Æ‰ÃõNh£¦°Ýœ·›Äü›'F«u~Öižžpqm‚Bü3ðWãÄßYÙÆñ6z‡—öu‘i Aþø«qâï¾ç†ïE÷Fp5Õhóv¼ù{Ó'£ñÔÝî…¸f*QüŠ¤` °Æ‰ÂÇÁÔ?9 ¼>: ¦Î¥7!RÌ7o¢Íßó‡0.KY‘:‹uþ1ñŠ^‚ü3°Xßüú®1`¬gÀ˜(!u¥Qlé9°5"“9Ž7a©öÐï ]¯‡NÛÇÝö~½sRÑhwÄôÆ!=„ÒÜ$—ÍáÆë= }7†¨£ç Îb†ù.Ë =,²Z kV'®l_F…¨Eøa8=Çùçñ3nÏàÒ U*AàÎ,36]G[„}†××s¼~1öu*‰éNœ³ óÃÙ•nÁ`x`#ÇßÒH/îiî£n×õ§cü~,&$á9£¶cxã]¿ B7zÐ'Ƈ¤‰©ïôÛw?›•DÿÄDa¸q#íÆú']†'7ø=9ž_õ{bR1<·!ì¹ù.Ëð¿†^ÄøÞÕð®Æœ·šsœI£È€fŽ±'†ï5¸}¯Øe>Ó0 h¾š§ù¹7%g.J ×­Ñ3zËDžõõ¸vs"ôRW½<ß4oϬæµSª‡–­*–¬+z¥êɺìVU¥ÒS-I7ª=ÓvL+’»zKn„–Kµ(=t—¤¹Î9I€£™’>J?…š£%†AUÓõ§I™yð¸\ùñs’ ªÔSzŠSñ¢ äËfMà#ÊÀ–¼Tk¸Ñ,1RHy© ÞMCè Î+3°+/©ÀïßJŒ”R^J€âw%Æ“üRÞ“ü¡‰Ì³ùý%ȾdÍšÃDÁ&§Dò«F¢§iMe&ÂóTw³{¦çp¾];À'ÒvŸîØÄéÐËbèlñ“ûjÔ™]|mv†,z•W–Ù‚–Ôb¾«ÓœW™­úɬøá”F&×érLÞ±å½ûDàâFvüh&¢¸E'ÞŠ ›Š.eMEÂÏâγX:»’bÐ.âøµ{'¸\®à x£%D­R»2^eFkWÖEzb¢]vüȯݱh¾féˆxuš°,gLX–LX–xѲêÚÅE©ÞvÜåMw«RcaßÂâ7–·Ö žÉö=|ÖòhÐ5Wi.isÇDËìá ¿– •–k—I[p{lµÊ~‰ÏLõKµÊ¯i‰; Y¾z£¸0òm«I9è›>&–¥Ë±†ŠWZžõX)}ìî2Ô2óäÉÂ0Ÿ°BV3:°‡y¨Áœ 5 Ϊ ¹7|ÒZñ¯’Å¿J‘Ž=ί×âsòE£ŒˆÂJƒ7 ¯xK…Æf)e±xI|¸Á¼Q.0Ü(zÓ½¨# E£é­•*WË„3’¶¾¢¸&LR7†¡6'EZ楠pñ» êÁ$U%ê2LXŽv•v@Å®zãqfGí黿ڃyQ©`ˆ^Àûw¦}$H摤ìªú®V% âgÏ1Û×h6ýIO•KŠŠáZpt ©OýÁE†‰¸XY|ÆhxQBV2ÛBʤáùrRã ¾F,æH$¼7©£…/Rû •‘MÕŒË>u'««ýˆ_•J^ýGIƒ§ê?*¸þ£,+÷õ7ñº¯ÿ¸™ú³êi÷õ£(à¾Þã}½Çûzï´ÞãréîXÿñ–„J Ÿ«÷û×:—8¶Ç~yÞ 8ˆ…ž@$ Ç…‹Él`úì=koG’÷Ù¿bVÎ"’úýÐ:r¶sçC’5Éáö ôSb–"µ$eÇ€üU÷ÌÇÄ’¶h›4d’Ùêªê®GwWW™~µÕüí£³FTÞ¬ø¯É9Nê•5f’R¤ŠŠ§‰c(D*‘¶Ìcô$/K?úînÓ¥DX`Tj,½ ‚Ç•’Y/yÀ)UG 2ǯ<*{q‘†¼Vx/ u{’KÅxpŽ0ÅõœFˆgžF…^jïj®8%eðZ!-%s,-´fÔG‰¼f".re5 åVc«npag°(b,‚h°”óhR/à ºA’`ˆŒœH‡·Ž ì„4Œé 1Ž¾]7äM›VÝà…R àZpIθ€±$tÔÂb«ÝÝYXaqˆ2® -¹˜,å«kÓ ½õC©n l^Qíp”Îû€­à2:.Ñ›Hƒ ÚQ¤Å2*‰bŒjfJ£Ð®a9mèP‡`µ †¦e-N¸âVYÃçÊ¥-Üît´yõöT+™ À:éF"`Aµ!N:Í a¥D~"Úƒ¼ˆ›6âÀ–Ð@ÒLÄxŒ¸A€L2b†§Xû6MUo­øb­„¤NË(LÄ )Øaè$â<È!ßD‡piå\ %œWØ-Ò1ªˆ£ÒЖDä­ˆVJ„ ni´ T–#Qˆ(aaeâÒ¢Jw]ÅAÁ2ï¤M{²´Rt#äU;%2i¥1·Ñ³À ÖÀt#µ·ž:.huñìʾËmèÃÖÈáõ¯¹ý“wjv»ùóoëö$‚.ìÿpŒû?ŸäuØÿù4û?É®ù_}¸P¥ã)^…“ÞA ?ì ö…ûBm_èî¸]ìíã¾ÐnéÊ-.P¶VùõEêëVܪ÷î€ûc/ô}+æ­Y},ÇÿÑ”ÉÕåñíõµ½Oê¡Fé››[{l&©B ñ„JQc‘òÎ÷Õô¬m—7Ëkkµº‚–ð=K©žÜœ?I‡Ï¿Yz~ÖDE3²ìè|†S3t†÷äôf¾U°S.>öûÆGeºß3—#sg0󔞭ˆû8 ¼raPN›Ò,&›„²Bå¬Zƒ¶³Î¾‡ks]•k´vá­‹ ø­šäÌ£ 8Þ\¥éZ…ÜW™ô{à$i¼ûçÔWðo%ò çJ(Tpuþw¶ÌžP¸(¯W]P~IÌÿ¿é8¯UˆV–«z’iðÁõóRúdÔ„`†€`šÅëû£:}Eê{.GÃÛ›º§cçF|ž$Ï û+ržÍMil-*½I¸>3Ú$•qÊÑÀ™Ážò9÷‘2&UÎù•pš>õžú ¬eê¦Þ%`™«1o«¯Ùþ÷“ú`wj| À«ùgìp2^ß5ô«yÍ7-…1ú• ”JgõãÖ4ùÝéÿµ~ôh®£šäÞÉkC´$.RÃŒÅZ.bô:- F¯$ {ÅëõÈ–¼†)Øe˜´âuWú·á5–Z²H£•Ü+±ñXQ‘Œ ©Å^ñz=²ðL—QÝ•úm8Í åÖkÅ•c{l¸ S…|ð^çZ]ûÃéõÈ&NwÓ]©ßJ¨ œfúQ#¯< A[L½aK—3]î§×# fyrÕNqt$|&k%g8„ 9æð,¥’+«=EBï—’^lšº·3„éކǞBcÔ>|qˆ™(Í}êÛÌ鸋Y¼>ùÈ‘Di†#šŽÊznPÀ‘3ed `úÙç,A}”^[O¾^à »U¿uååVýF¬A6:ð˜QHX²Q #Fçôùû#ë‘- êÅÀ^ o'7·“ ß»_tá}G~lÃ{«™p–YœÄ £$Ñ`pl„ …Mé8öˆ÷ë‘]Í{ãRV¼ïÊmx¯p`*€ãä<‡YmD´ŠñŠZFl¤~¯x¿ÙÒ½ÙbÜwåÇVãž'‚q“ 0X(BµtéÄ%NŠÎíï×#»š÷]Æ}G~l¥ï5ÓÉ82æu€4SœäRȤ:îï×#;Ó9)Ýn¿»ºïÈŽ­XO}Lyˆ9aÊbŸn\Oþl‰»k7veíV¾£&p/=±Ü #™–HEDÐÉî´Å”{ViÁƒ“JD+ ŒRðò©XaŸVFëdgZ ƒÉGìÇõô'דZÛö`W®n·Ì¥£`M™Â:p¨ ÞJ$ˆsó/¾×ÓŸ{°Ŷ=Ø•«­{p€Vø01½þ¸Œ¤¨¿”±€˜Îöq8º6eñ c‡·“Â>IÌ`ÖA‰¦?¯ƒ¡é cz<ÅH=Íc³çÆõ]¡'rR†àÜC¦?”S®ªå=W£Ó|gqZ”¢\<.W†¾->åÐ(÷Õ…<(Ò<¢øGqqQ|¸X|µ¹rßï€Gø´T"qODåw°#Ëßáß?àˆþPSÿ¡(-Ϊ+ùÓ÷Šøé{Æ×aFéi + ù0÷íþëÞëÏ@ɳª÷*ÜŠßóßü¶ð©ü[búÒ×p *¿ñhéêÍh8Î"¥c*ËÐüGu=ÉqõÅì«_º·Ns݈v=«¢Qrl~ýèé ÔBxþ†~èŽí}?¼ ý“r€í ¿uêo½ÃþN8MØó9‚;áñEt8U‹~Y}|?5p÷1ÓeP¹Rù¨êzWP ã%P³¿aIºkP%Šè ‹b¹+ñ½héZ 1eÂh•¬èƒúüs³—›éwIk‹ ’‡“Ö²ô²,ÿÕŽÈîÀÍ°ÿþ*øÑp°3-À`PÂ_ž`L/*siôÉg¨OZDÕï—õŸ?7°Ø©çÉÔó/OÈ¢¹¢ÙâÆ>Šf’ÿÀ¢)’hŠƒhDó#ˆf‹½î‡Í̓ þº$Òåîÿ–žöËaÎò•ò&xÍ5øyÛ´ ´/Ò®—]dã}wA8¸í¤€ä2^7U²¯®°Ö©®jL¤õÄo` ÇÝuX‹“‡ûå^4OVn­‘Ê<9IYTÛ£ZØÓ.XÚ)4£‘y_oy¥]ÅÝ­Êä›È}ÑVßä‹òMZp}é+„wD¿íÎIú¡Òe;Ó "Í[ľÌ[ÖIa—qÙâüõþÙ›]LfìMµý)íJöFíɘ:Ø›/ËÞ´ˆ4ýìÍŠ0ÝÝÚ›JoìÚÞ$_Tì‹/ºK{Óâ Ú~Ù›{OÞ=ìj*O1,|—1,_£馣×Y‘N²°þ<ìg »Øøß,¤}þîì%²Ð"žÊªD+ ,M-Øajñ¹ C‹¼8Ÿƒ0ì‡e`É—fûâK„¡«0´8q·3ÙíNÓ-Ë×âIÅÝMb«Ó)»›Ã¦ˆk±/×_‰°´8ÜøuKóPèW|ÊÕžÝ ‹L¡r_B%¾ai‘f¿Ü¬{óá<ðü;íñ}Ù!;xYÃZ×g©ú da?f< óCúç* -RDî«,ìßZTòÚ࿃0|¦ÂÐ"Wíç {b’›Ï÷ÅÍ?C稊õIþ÷Lrù‚ÝÉMðΊfîŸ"Ž†×õ*ÒlŠìÌ °©VÊŒ ÷{çÿõ§‹gÏ_>ÿåÙó_ž>¿xó˯Ï_½¥@©‘"g%êõû¹â8L¾›J^óê‡ß …w#`÷¸ø9’iT—ñpåqìßÏúön˜¿ýðª3=¿rÚÌc3˜ôÚ]‡èôÚd8¬ó5aßÃ5øÖ—2àœ© 7­cÌjCo¯çhÒsô ç±m%–z}ÂÙ‡ÓÂ)eïò‰­œKwK5üfF J¡ï¿Ëõû=;2£÷©&àhœ·½ ƒ^–›]­Jò´Ì÷ey³0´”îu²/ÍÔ;™ÌwÅ;3..§5a³IKF)ü»Þà2Ó~65d›2¡©ee;몖³ú´©2÷¤( Ù7J×^MV5îO•²\ýÂçOÊröf•nìŸáï¿oû‘î-0=câŒë̺8oê•*»a]¼±Q£º®tœ U7 Û>ʵ+瑨*(WOäZ–¹8eu%×nNc+Þ…%Êp©$)ýZ÷Mœ?Úiýïr®þ»R'מï´|²óÎúïðbh¡þ;Hê¿ŠZ"aY²&œ8éµÁ=•ø¡ñ;¼>îkNþ/ûCkúã‹T–ùâ2ë´]´q¿üc!^Iˆ8Èÿ§x=ù˳¿?}ý?/Ÿ©·‹—oþã§O‹£ãÓÓßèÓÓÓg¯Ÿ¿ÿ×ëŸó„Š×#3(O ™þééó_ŽŠ¦Q|G³=|ýêôÏ §‡«Ç“Æ“'~â“©Ì þyÝŒ¿_k­Ë§ó½à{ÃÛu˜€5†{aêÒ{›*ü7weF0sþþÍëU6¶K@~?~óÃñÓáõ ¸Eà‚6à¼xþ½ž=S&4®<¤2ruß³Ò–—6SdR 픥û¬àâæÏ¿•ÕâavSýX=~Üq’R–òp]ÞSL‰ÔÀ¿rTw~º£r%suðæ·©˜÷Ñ9:Ñ'¨*ÿN«Ì—ó¥j¢oµ+87Y*Ýep²‹2ÓfÃYN?̼_ààÜPÍ÷4𘷣á;|T»°idV3?pûWÓ!ÀÙ„±œ ”ƒ£égzÏ6½AIÿKs¦EÎë‰À ‰©óÂxÐ/ÓËm€˜Œ¨DõŒTÙ¼Dæ×:‡ö=ÐjŠÝíh”Ó¹N¡§©Ð"͹7È(l¨6´BòÄåõï»ýªAå…–Æp#1öéH®6Vj‘4¯A^•KêÓý§&ÕFÃ=4L´: ŽÀ{¢ð‚hGAÑ1żgã¢f‹˜cAMT‘id¸Š‘‰ #œ)ìÅ"[î ax›¶"ÚôƒÐ˜8Ž1 ií×JHë¡yèãX»ËM£6í)§¥t–9B7Á)"ÖÈú ¨28nÐï‚xˆ£@#e˜Q)b†«-Ó:.uÃjª=´64è 9áÑÀ5´CÔžJ`È¥SXDw¨!¤Ä~Ñ…t„*å¬E†YCQ;ÊlkmH@Ž°TÀD1Œ;NƒVA`d± v€ï4ì,ÕˆCŒ—ÜJ…vÊ»tè± Wf|ñæÕ‹vTP¬]”Ä{”J×H2‘Bï6o@·D¥“iL"ï±qRšÖa ¢%½ö t2Œ(D(7ÄIÄ8hE¯”%¡@6 AÄÑêÈ a´z-1“‘ƒÀ·£¡?þó¶%"•äZB{:m¸GÐõÒXëíœv*\>þ¸*vnˆXÛQo©µ’ J0KIPC{Ê*á´€áÌBÎÿØ™ˆö ï#¢\]hG32€, f©%„€Lò@¨Yd4vŒo@„ã‚£”Õ‚K 6²À5XÚÀè¾vDTÛãm쪋 uŠpëc ”Zª(L ‘.ßv)PÍÜáû¤Ÿ¸#iˆ-9؉vf.Óp1Ì•ÌÆc7¼é÷l»~±ž˼ŞpF£…é@$UŠxèÜ/ºÕ²€("à倷£°ã`…0ÂÂÖ²_Ê”“mºEÌcÀÐ!Ð  ƒ.rBDôšŠà6è–´“BéHd ÜŠ"D$ݳ–ÝRt´#C ç¹}=8=^xм3Jh‘~t'ƒÆ”kL8·Û2àIÐ\Z*R°H;2Ò¢i;"8±”.Z‹ càå A@\<ó$¡¡¬t‚P¢Þ k £6jm’\"Ù…ˆ‹T5¯`pk´0 ÖÒwÐàúiñÿ³w-ÊmãXv?…•Tuu{œ„xÝ›Ô8¶’¨Ê±½–Ü™®J•†$ÀD5²èÑ#=Ùõö·ï©%›HYL¦×tI–Išº8¸¸ç\¹±  ÿaÑVÙÏ|Ä"`sЇԱŽd@ƒÀ­aL?ëQµ \}!Õ AME ˆ]RH 9ƈÕ$ á´&Âç ”±J]Ë•b,”¡[mLkDÝ 1wÉPnÖkÕ,‘àU:ÐÑò¨¸IÔ•H¢c”“×E:¦*‰µ@!PËwȨ¤î!JJ ”„…†Ö-¨LdË(¼PGaHÙС €5âÄ9Ä[ÈÁ¤Œ47BŒ"pÓepQ¡I]BšÐä䚨ˆ)Òš€ž&MJ âCV91e*Aæ%‚Äeuñ8»ç{˜Ýcß6Æÿ×C úÕãÿÔÐÄÖø?#‚<Žÿ·±=Žÿ·3þoÆä¼|8îqÀã €Ç3vœP×2—6À2Ž´| ì‰ÝY[ÞºIa±¯EÍõïùºüãV%ϧ'ÙíVáÆSÚ3$½ß‡³Ï^4êÄSëGÒO¾{§‚N M§“¯…0tß‘IV÷Pñ°ªzýE›ÁÕõí`±9?SYpNf_°É :3}æ©Ùç—OýžE¯—O06QwÝ@fa¶9+óª  =X]Ó;5Õ^’4`–_|q¿ÕË'ƒ©%O^eë‡Oó!‹g…BDŸ,öf1®ˆìÞ ¼ϵÁ­¹‹hq?:†á8 Ù§³-ÀTÀQßUhk®"[ÀFÞ œÜÄUØ]…øû‡ƒøpÔwÞ–«Ô6¨›ô:[­¬¾·ˆ}z n\H}‡ ZsÒ<¤ žté$M¤‹Ü§ÓÐP¡vTê;jMï’ô.)Ñ»…;^hÞ}ŠÞí{s÷‚J‰è½{pTZS¾¤åKJ”¯ÉG›‰_´OõKZP¿¤Dý.!ià2­)`Ò‚&% xcô­>ûTÁ´LKTðÆg=HZS´%LK”ð°‘ Fû”Á´LKdð°‘F­i`Ú‚¦%8[ô9 › ™}J`Ú‚¦%x Jƒ¼Ö0mAÓ<œLô§ù(œ4p¼OýK[п´Dÿ®Aià6­É_Ú‚ü¥%òw”¦7M­IaÞ‚æ%Rx‡³¦ÉÙ§æ-Èa^"‡× 4p›Ö41oAóMln\nâ1ûÔļMÌK4q†Gƒ‰y­‰bÞ‚(æ%¢xýxÈúC÷©ˆy Š˜—(â5( ܦ59Ì[üDOg“áøSb¢ûTü5ÌKÔð’.Óšæ-ˆa^"†§_¯£tÔÈeö)ƒE 2X”Èà%$ \¦5,ZÀ¢D›æa“κOù+Z¿¢Dþ.!ià2­‰_Ñ‚ø%âw>6ò—}Š_Ñ‚ø%â7ã¾³°ÖįhAüŠñû%»×¯É).ÊͶPùèŒJ êW”¨ß*ŽN³õ<¨ìñåM”ù ¥«‹ì¾ºÈÆúwgâ=È•ë |J ëàÿðœýøüŸV¶Çõ?ÚYÿ#›dêõòGSšÛØÿóqÇu@×y\ä{xÈíûQ(Ï3ˆ§ŸW‚ÙßÙÉ‹%à ÇôÈ<˜ô>E ¢o (9eLF‘Žt,æË€â˜* "¼HÙ^ Çñh®ôÊÂ:_!U`V ÆD>‡M†IB6k³£dñét´ºü²ôû]ódq{BãõN6o³Xãmš=¦úÎ#AÓ$¹Æ•žg-\5™„Ÿ®sç/ì5ÏSÍ`Íéq”‰º'¹›dQ®pÞ8}òÊx ZøÒ"|§â¢ØrQ¼qÑÌ9‹§.îv~òêÅÁ_žíº¬Zƒ“íÄb;Ùä^»³ÆzpàÝ¿­’ÓÅqK·º¶S‹íÔÝöÖqgÛÙθç[.覆º¶s‹íü;Æ]Xl;áþf8™Î¼/z2…˜õ³‡‚¾xù8zÜ‹íÁwŒ»´Ø.l¯õȯþFä» Uï+-ì‚ËW<äVÏ~ ‘!ìd¿·N.×6{ }’N®ÃÙ4듺IG_?k5 G@øéhšÑ~8úüþ¤ÿ'™£Ö³ßBfȉ̾!þBCN„–Å¥ÃÁ`px88ÌÞ‹¯Ãíýƒâ¾;ªžýRCN¤–Ùÿ"{Áû‹Í×ý«¿ÌûíáVjÚo!6äDlÍ7?w±ßBnȉÜÀþÛ?þøãöü½øºoáýÅJñqû-‡œÎØï½õno½ øô^§^öùeö×q¾oñz¹|?ön?ë7j ¦ý’C.$—ÛéÝŽn½ta§†×hikx¿ý¦ŒŸn žýØB™Ø‰23û2;G ;gðš/mßo¿)ëmV€‚ մ߿ؽÜ[Ækû§yr[Õ†ýðã­í÷¶ PÓ~ ÿbGþ;ÞeÖ|Í­Ëü'·ïeæWÞbÿÊþ¼Å˜Ï½bjÚoá_ìÆ¿Æžîʲ¥ý^ÁV¯ðÚ~ß(@Mû-ü‹]ù÷Öëß±ÓÕþÔ´ß¿ؕo½Nsû‹¨i¿…±+ÿÞÂÛíAö^|ܳcß‹Ük>, PÓ~ ÿbgþõνۛÜïÇðêÁ+önÓ[ïÆ»}–Çú!¼"ïvrë…Ù;´õË°“Y}û-ü‹]ù÷‡§DþIbþ{ó¯²ßuþ§â¯5÷-v¯öÖÄÂÂåØ•Ël«g?±p9qäòãôæëÄŒ8y?ÿ À¼«ñ0ëá˜}õ.ÂÉpú¬7WÛf^÷ì²{ô ö[¸œ¸rù·ÂßÂåÄ‘Ë$Ï`ï|ª½×½o4ŒõxªjÁ~ —G.¿Ôjhæ Gó¬ßøˆ)Ìpìå“9¼lW4›žaÓ?0=Ì—5O'Ùït>kf¿…ˉ#—_§j˜ ãlâÐ 'ڻѓëáÌ UÞLÒ/CfŸÃY6f‘¤£QúûpüÉŒÀ«lZÁ´!þ.'Ž\n,¾Ö³Ÿwvÿºö[¸œ8çÒµÕ´ßÂåÄ‘ËÑó­&05CY ßSµ3ŸšY³Ú„ñ¡02ó âUܧ3hõ‡uí·p9qår/w[>| àצán:=”.1¼Ö“ç;ãoá_âÈ¿ø.þ€s!Þ,ñ‡Æ¬æ±¾· ØO-üK]sioåMêÁ[8U}û-üKÝùws ¬}±=ͺx¯Ã™ž ÃÑtK³àŸÿ*íy}û-üKù—<÷ú`Œ¹p> Þ1Z2¶Í&EÚ0š2ý×z¬Ò °›éÞž¤×éL{¹[ͦµí·ð/uÍ¥€ø ˜€I¹MÓdö»a†%ÃNotlhÌâ‚çT7æPÓ~ ÿR÷¾ìoÿ©…©#ÿößu{^ïüMÿÃÑeǃÏ—ç¿vO:'Þëßà`Ç;ºê¿;¿ôþþ÷£β•ã½ï\¿#Ž^wO»ýß2€ßtûgÜ7€î‘wqtÙï_]zW—ç=¨¨µ“nïøô¨û¾sÒ Yx˜:òp÷ ðõ:¿vÎú^ïÝÑéiÑy^wø£×§¼à4'ÝËÎqßTÑòSÓv`áaêÈÃà+àõþé¡×»èw͇Îß:àG—¿ï>>?ëuþë N‚ƒÞÉÑû£·à.?nyYMû™…‡™#o;74ãã«ËÎ{Sà[½«×½~·ÕïxoÏÏO²ÖÚë\þÚ=îô~ñNÏMû}ã]õ:uu³ð0säá“£þQ†2NF¿¹êu3÷ïžõ;——WýîùÙOÞ»óàhP!G`ðIÖNÎÏ2·ªï?ÌÂÃÌ‘‡ÁÛÏ/3 OÏð¡÷á]ö_šÆÎÓ¿<2ŽÞë_vûÅÓ ¤ýóË~#ÿgfŽ<¼vcï¬óö´û¶svÜ1–›|èö:?A¬éöÌ ÝìGPޫ̽L[‡º0ëÚoáaæÈÃ#,TTÒ»>³h6êÇÁ ¾ͧæõS={,qQT$)v¯ù‡þú{:QÙƒôd¼8eó|)ÑNGO^ýðÏy â"ÿU¯(–h,6£±çýãu-Y¸ä&~j âvvûڪƹ¾_+ûÏÂÍLþb= Ì2™ß•UfÝÊ9æcÓ;¾4oum3DtïµÓéh0ϲ»ìë0¨jíÖâ< I³‡ˆ„<ÄÚçJq( †Å̈18ðïxë~§E‘ÍM¸æIãO÷¶ˆ³²‚æ'yVl\ Þ+ñ«ŠWÀE*ŒXaÁ TûH‡’dÓv phÀmœeÎn¨ªœ%°ÎõéîÚ ¨ µb$ü$b„G\"%x 0æp$mã –ªâðn̾¹¹ÿó ûwWL›Éœ¦8¢³Šx, ¨Ÿ„~ µ–š(*?ÇÔUµ„éÓå[¢~SuÙL­=9Æf‰ÀLûaÀ1 qD)’@Úa¢pŽº¼«Æ¾êq:žÎ<¹FùÌå³ËÖöxÙLЭl#$¤"ö‘ ¨/yÈ‹b$2NTBY"sìï ºoìñ÷_9ƒÐ.k~ÙòÊ©Õ(ª£CÅ„(UîGHú"‚jƒ¤ ì' E<Ì+/“7Š¡È^¾ÍFQ ûfúxe›N¨W2Â$¦ô( eH$ãŒ/…E·ýÃ4 {á7+¦AÓ°¨t¹¥ÒÝ.jéX‘¬ÉE-ÊTºŒy¾8øËŽ“Ô·Ò"n¥ë}<ÕÛëp:Œ½7óq¼1Oü¾­¦ý–Npé6æù[½q*ié—²¾W"¿º¯Ž7¹huO6·†º»=\®d •bL‘TÌg8¦\’„Š‘HøJÉxMÄÃé²®xh¦r¦ó››t2ÓÊþ£‹I?¹¢QÝÝÇÑ(ä×î*]êEW‘ÆTJÐì<¡€kH3~‰†š_߬ñÈPxÓ=íx‡N]ÎhTwÅÃñ=¢!¤**$':æIBˆ’L“81]{H ¾1Îœ=áÐÛÒvÎ`T³ßc•P¹”Qs Î/‘’ÃO'ABcÍ"éBÍ›UhÓøáý¾šEáøk:”, ƾâc"®}(rŽYB£uéá:ÃOãæu}¸·´ÍèjeÇ÷t (B¡|MB$ÌÔ"š  Qì3û–xM5¼†;ýÞY-gàø9Š , )!’$‡ Œ‚#‰Wš’ÅOuAûæÎX-³à¸#®*G#]€Ö¥dÂ{‚•"‚ P„Ác¢8W˜D›¸ºSýwkµøƒã{lã\&‚' È’óˆã$R$rÄE,–IH7iÓ4ôçpjY# U­‘¶3ÔÒd¢P”hcë˜é8¢# µpêï(¦Z–zCUK½íŒœOã(VDŒ#0…µïÀ z0"YJ¿"¢ßÛ] k(ö, É¡ª…äv÷+¦”HtbÖp`>ŽTµ APìž4+rï_úZ–¥CUËÒ팆Ð>:ä>ŽB¢ HìÓPÌÄOÂpF2Ѻ0,y@Õw»»†Ï²™Çà˜È@ Áb+Î  š[=VyÇdÑMX+3ü"º%©Z‚ogxi@qH°/C*™ôc3_ë !I"´,Œ“M×ø–›`°4áߧ,JÕ‚»7öˆ€¶æAŒ"™’}M8Æï•lWÀ`ö¯?g%X2žª…wÎxbâÇ\KLϧ‘ˆ¶Nh"|]¨„iŽ÷ pÆ¿il¶$4Uë/îì»:@~…*ˆ}_©XS?VX¬AuSá«lÚš ·Ý;n–Œe{ÝG§‹ZcDÛ‹1º]Ô"[VHüv#3ȲB"r^!±|;š gŸ¯õl›;é&¡el¦¦ý)è¸BâCnµFfe‰D´½D¢ÛE-¢e{ÝB·‹Zˆ¸j1ÁƒYÊ’¢q®x£TahIq„}Ó3Zмóè;­‹oÜœ,ë„¢ªuBw‡Q„RñD!_K KBÌh4NÂÈ÷£ÂhÁõ|ôX÷ÖŸEÑW­“º{GºMNÈØ!$ç‚hPkQÄCD¸ÔJòúûÿ- JÕ²¯»W‡`"†BÇÚ̉Ì4Wª”ZFÅùLPˆþW»+9‡ižw+Í3KN´µÔlUòYØþÄMÞ’îU-m»³)r.AeE‚*ªB•°ûH«X«Â¸y2JÓIæiÿü.¼Ì’Ïn-¨ëèej?³d¥UKøîÞ£˜ÍyL9‘ WA¤y,ej“0ÿ{ÏÚܶm?ûW°ÚÙ'­màÓµ=³›´¹½ÓîfÚtîÞOmueI!©$îìýï÷|ˆÔ EÅ:ÓÚ2E€À9‡ç…óX§3ó³ÈCҙƾ\)üLgHSªí*U¼¿ *8w9óƒ8‹ÁSJ€Ëy!õpêãüìД֓ô45“ÑJÍdcÒ{Êħ©ÓŒvÕiÞÿÀa8\VJ©—ש /BAë¼ñvfî: sÓT…FÞz«Þ?+]i ]õ§÷gj$Šeežï%iB±&<%@W4öâ]]³‡AWÀ³4ž0]i”ÿ]uµ÷wú‰ÀE)ã2³² ñ‡Èf ª5rW+€ýë~„òÐ’Ùç¦,ÄœPDd⥌Q涢Kg‚]U£Û®¶'¨ uà I"ŽÓ0Æ4ä(6fD´}Ù ª{µ?ðj`(J½4ŠRì¥.GJÝÔ!¡À¬UØÄ8«<ø{í@šÆÊXía6©ÆÊXmfa6©ÆÊØÕvâ!ÔšþhWÿ CƒúmYíVvfM ª}Y®_£‰îêxñ jM ´ÚÃhRMc ´ÚØÂlRÐßÕ¶bÿÜe°Å¨ˆHœ … ¢x,ÙM!œ‚Òß*r$+%t«[ çgj¢Æ@1eˆšhµE‡Ù¤Ñöh]„42M§Œš› Mï dÝ;ÃqþÏðÉÑšW(·ï‚B cmK”>VÃCãDeYö¦ºéÁ¹Ö4ÊYòß>[* 6rƼæ>ï%÷yoP9¡;‡„‡Ì0UÊuvÁÕ¬ÔéÜßTl€Ï%£ié`/6Ï”ÂZ“«×’Êó}~q–¨²¯­å£÷ùl‘1Qîb"7Dß;eç&­ešU#hÔÞñ†† m:†¿Ëê¹["¿Zð6DÀŒ®2çҡΉ“Èn©Ô9s’΀؊‚[QÐ[úòoæØêSJÎQå€ã†ø;Ø?¶#à#ÍÆ 0ÀÃxHÈcY(­„WÖ’=ón ɸ³…’ÙJ‹ª?ÒÉB‡ACR·4Ôí}¨[_´Å'= À˜ò–fб,°ñE„lˆ!ö!y}¡Dsðö(º¸²eÕG§3âØœ’¶ßˆÂ)nDEØã)ÈÏrÖÓAù·Ô¤+þ-•fS¸q­çh»ŠiQ`Ñ¡¬èù9×ðnÙÍQ?ø <:jxtÔ‡`õõë,TmûZx†¬@Ý¿‘7±b×9;«º§J·˜œmªüc³ÌyóóÛ!É—È&t%ù’÷@ˆ¾”¶9BìËrâCÞn‰Ž%édü‡PLÆIn>(ëP9X%ìUº•5ìõ§²æ°·>áÝz©ìµn¶dÛ%»–=ƒá=ÚH¹ž*h+7SR×Õ÷°!uËZ!†”w›é„½•Dä|#áAÕĨÑcü^bAß„ÌâM°khflþ8­aÊÓ¸‘§qÀé3~Í×;{ØÚËòá@^–@âê)‡p±à†Æ#lA㢨o‘i®(êçjÅ[ •+½tn‡¥j¿¡j¿ïP®`á;´}0“Œòî^¢ñòÒ9ÒHGØ‹Ɉ½>\D_*ÄÞ}ÊŽ2r€©|4u*™ørX¯`è7jyè÷QËõñ†}ŸXS±¸t v&Ž•ÈÊÊ•SÐícpjÛçXœ=Zñl‡c£N8ÝQÇ; ÷KØ5ÁRÓú(ÚúLDs˜÷Éj4d'å€]°'•¯j@\ÄKÍ:î¥Yë{jšã¢WN;FòÒY›b@V‚VÒËU¢Mܶ°m“À iî>nýjv;_%ק8Ç×™ …Èå³nAr¸Œqœe/œYêP‡N¹“ Ê–b¿Qsb¿–£¯[k¡Uö«kìï:ÔùÐ7ŸÉ4¬Êð—Wö¢B›Km!*ló²M}2I> þSaâ?Cš.r‘í¢>z’¾Ú‰9"¬+§˜êÿ³C17˜YhüÕIeYØoXîcë YˆœþÅ”ì<4Ë¥ãß: |ò»E Àæ¥ ·ùL/TEq£ GqYßÕÒB)ëÑ!Ó”ñ©ƒË !M•péúûèúL^ ¶g™læg6z™ìÜNHzöú#Õ ­>‘Auå5wxvzÛi„÷½õèkºZøÍúÕ‡58ªÇÐó®|îƒzÑâæ€5Œû°êkȘãgŸz4Û‘T–eq6]Å•UØŒœJFÍÈ©<¤üC®ßÒ6ý>Ú¦¾’9bzôV2“÷WÁ`íh0£5X…|T>ºAí.ÒÈ=Ÿôá\ú,{sXgì› >¸¹_èÁõà¡­Ôë€Eß<ÐBÍèшДà˃/þ¸¤b¯ë»ÑYð÷í̹¼ªflD >qK>öaäÚl} Fn›ùoþ=Îi‡=¦ÅËcŒû[ß¿Û‚i÷ên¯'‡ h:Ž»1•ãúLÕï:Hd¥»Œ¬tûèËYù–%ŒLƒû1-¿>€iI¢¥Ä%}ôÝk,¯‹àÜ÷ã(‰¹ïú˜yAªÚ2$ ]Îí<ú¹çM¾¤zPBçóYVͱI[Rl¿=ª¹p›¸pf¾ÌÆ‘Ú`šø$H‚ñ0ˆBŒƒ áÀ¡½›Þe6Žv.ãlœÛùï‹áÓq¶õbÛ »ˆ4eb‘ Ð$@—`¾`‰‡0òÒÐ*=D?תÑ.G¤5jï21_Úãˆ1|죺4=¸8¡„‡^D˜ëQâ± &nJ­Ž»õs5Q_™°‰º—·[ærÿC€M7' ƒrio:éõŠœÔwI±áÒ{t\ée€Üá ;lœA´<1Ï}‹ÓÄÜ¥<Š„§ {SpÆ"N #–áÅÚ¹š¸9Îí˜V9à ‰mß ›Ø&% òQÊ?¾>9qÒŒ^ËvçääªuvRÀÕ\^>RWò‚fðÓY!2g.?«¯àu¯[~5:¼pž‰<_ùâê"—™SWGoÄT6tØ©ó3üÿß‹‰ƒC»Èw9÷‚s?RœûŸs1ý•ÍæNrçT¥ ë}ßÅüüììÓ§O§|öùîZLOgÙõÙxÊÅç*íèb|{½²'ÏØå¨1Ÿ^:)š+°ú# -F§|,— —Ê-Éo“¿“¿åC®Ž¾zþ÷tÿIÃëªP}¦Þ´@ÑÖÏjàyò7 }·ýÛ•1\¾ç~…°¿‘ïõW²'UH¾rÜ!±íßB¾õŽóˆb¶Ø¾oÝ÷ôßÅׯÿùêÝÿ¾ýÞ‘XwÞþö÷Ÿ~|åŒNÎÎþ‡¼:;{ýîµó¯ÿz÷óOÀ.\ç]F§yÕ³êììûŒœ6“úDz÷ËÙg9’ƒ«'Ekä)/¸d]êŸo'ÓürÃ4(Žãr´ºWP¿nEÜî=ã—£W%?y'«#×,¤Šø\”ƒ¿“Á. …_þöH1¿µIþuòÛßNdô>(Ô °Zóüøýe¼SVŸ½.yû,kÝ÷ºä­%OUŠq1W5w?wÆY&®šÞ8?ŒA*þVG&¦ 4ÖòÞ£‹ÉxúïŠ÷4ÉOYžœLL.Gyq7ùÅÈ‘… «ÊäÃr–çEû›ßéGZ^­äÁï"»;ý=!uV~c6ßMsQS_ÝZo-nŒ–ì(T¡´’5R%JS1›JùÌgÎtVÀd·³Réç2±”ŽÂKÁ;ËA¼‚Ô¬ýu)¬›y$Li&¨¤žBé!LL&ùœ2°¡.GîHý=©Wý}uä\åjàCæ¨ eŠñõMqîøÁüówò&ø’×_VÃO&"…[ÜS_Ü–÷8ÍBæÙìw€_©ÏÕô ïh&n߸¸M¤*ážÆ§uõt5a©×È—K<+²òW-­Õ.kͧÔhÄ”;Î}F~±TP‚êU÷´Ö?¥³Ù'4j6 Ìr‹Î(5Ë«“q^T_ÀW“ñRymk,j¿W?Óñ´Üÿ[z-š*ÉR‡ƒ›æð“Èyg¢4—M&¡S (¹ëίiAËÅüZd V,²]³Õ;f x£emèfö^ëîê䋾yª‹³Å¤DfÕ.¼qÞØà›WRîñ§qS~'¬®'³„Nº³¼)¯™ì¨½Ÿ`¬7͆à‚ú[Ý,Ç´€ ߉‰¸U@­.‰I]§Ÿ³÷Ü»ßóý8ID"X˜úny˜yO¢“j¹¥³D4+´yDÌeÐ0Ç$ŒÜþÅ4MIˆ)æ¾a”.ó@zMÏc¹r«Ú–”H¤KbApÇ,ö«éWŠ©t\æÍSj¯[8À4—ܯzjùÚÚª.ç‹Û[šÝI®Xcú/S‘Ã;q¢îðrËÂi¿ `-ñ`ï»Ö ÉÓÁt;¹’_Á¨wå…-·ËŽË{¨ûs¨›WނέXØåµ]"Uη¤ÅR圫 ª-AxÌÑÅ|ÅèÚ†çèêÍ  ]úÔeGv’(Q@*Éï´DØ|)wʧ”››{’+™”µ7 BH ›I5½ÉŒÊ\ßsÍó¥M!üUÄÉ'­aï_)™QJŒÖƒaEãBÜžWOn.þ‰& Çñ5¬%“"p$Íxõ§’ѹzB-ÅÔük“üÒ—ÌŠb¶åÕ°F¨cUc·ç¦õç„šÔÄÖvðkýͨÐöbËÉ*¡ypL­½- UËWF‹#êzq„b™Öï‰Ä£^D°rì¢Ô“Ùæ^/$VËr*dÚ#fHôW–ç_ ¶ÚYG]&h7‰XИ†6 KD> Yâ(¢$…O @Ùw‰K¼.ß²œ—A—~³]tÍÐe Â÷Êw%žzß[bOÿÂ'aè"æ3p/ˆpÌB”€2‚=P"â^4$½!ýj»D0–ñ™Š(›ÐÌÃZí¥Ö›-´÷áAè#§®E.óˆë¦ ò0ñ—&=,ÌêWÛ…ú—B¬§¶pÞ§$b*Ú;ˆ¼€¨‚Ó ù#©G"Þ §e¢ÖA°ª_oäË >çø¾ði ã}ðIDæ ûi æZèú> ¹Ç<(T}©íñyÀ„>ôû_¡:£Ù©Ó”õø´…ñ>øŒeyZ.{5%"ˆû.÷p|† XVÇyÚøÔï¿»’eÝHçXI[èîƒIÄ!#`ð(*pDÓ$ŠÝä4cKzêWÛ…{Ãr\Ö¾ûàÒ9ðiœPž&8 ÝXø§(Š9ãžç>õ·R¿ÿîJؤJ8¾?ò°EÙ>äRì…iâÆ>fa„hÀ\7H‚„0I’ô"Pc‚Kýb»ðtrH\ÞŸâm‹·½{kå©@,H<ìÇ–Müù<Ä1hùO…è÷ß]‰Œð’ïlv`âëV«)ÿ2Ð$,ѹ—ŽGˆþé2”Ê®n^ŒdÓ17ˆS"ðS'ýþ×IG|Ô ìK7¶¸ÜK ‘væ’ ©n"/J}s{”ñÔéF¿ÿuº™g‚™,Ó|Xê‘Ä/ }~¶x܇f¸ðC7åÙU…!e®ÅA>°?Á«óì½Äç®Ë¸ˆÓ”$‚2î®t—0æ§þ2ÇAd)eâ€4£ßÿŠ¸^“© j `Ûó‚£mÿêÏy=c f¬²2”ƒÿh :e7òQ*.ÜàhCž´¨+:­]g³b¶ŒY=Ô(ÃŽªoå÷Ùò2’iõÞ½O™^Hí¬âžê¥Ÿ-·²ú´!Œ®ö—æ-Ù,~ÇR×+=€iƒÊüyÞ/ú ‡wBäøSÐ äØF,Ç–˜Xô´Òÿ0øiÅVÜøp´²…ÕŒÌÈ@á¾?ú: 'q¶ZDN—pÔ¢®Ž7\¬—%eÈ­| ¾€·c%´¾u¶Óý.p«)þ-îFW›¶o¶ûJk,Ëí:ôR×µ«Ýt¯nÅøbëª×GšÉúë#Éè ~˜1Y“em&;¿jbs+~¿ê©=?—QÙ:/Üz*y°6pZ¥¦æšÉ¼õɼõþü|yªc·,²¶¬iÒö"ÙͶÊéÔlµcÁnªÕs+5•)È6àqãÒº¶«Ý„!—Ë t)žu®=A[N꤅$§’ÝŽlÖ·ÀînmTUÌŸ@•„ü¬G<ëm©ÏzÄ=B6ãóË>|Ïzijñ¬GÜ·aà—ÿèKø=k{ˆg;‘÷ˆt‰?‡t‚pt?ž¥ó³t~–ÎA:>q鬢0·P¾·Kîxq5 »8è-€ãn‚`ZV;ïTòt}x•,Æž+"ÏD±È¦ðÙù*3ðæw#çX¡Î|¦˜žºX6ûž®`ªp¸Ì†ÎëlhYN&fóI&2?Woåg3Â;^pµå.UÖ÷Õ¹¾-ØV`}'«îV ®2È››– t>Á´¸EnëÔi…"´€­rÛ¹ú¤³ŸªVK¸r_¿”@l6õ·Õ…È'Õ…€7,ê´|Xù¬½%:‰Ðè ~óþ´†e ÌNë>"¾Ì}µÉ’*i|ŸvèCÔN…±»¦æ("Zj9EGËQ µy%Uš-*ÌR98~Ù\!C\g )ñy,~ b=—1î`Ÿ-Š_LÝ)鶥é¨U}ºÆS*Ót–Ý–õªoh.õŽD”|EDZW«6êQ7³Üî¹[t«½õä…£+øñåõµ¥¸Ñæ: öìÜ ÃçþØyÓ ›kõø-6†ž…C üˆ¥BIŒÛÄBmñ'þUÚdŧÙ&&fqÅ_s€Œs\‰‘“Oã\¼øÖIéXà ¾Ïä•Ó®•«Bëcìeþ/$3$1w$F–Û¬OCñ É¢5%ØÂ3P«õscV#‰.†”*Ïðnܸm¼ i]{X.ðãÙº~¶‰Mlb[»ÓÀ.~h¦§AAƒezÊ_W¹Gï²à6ç²ü²´º”ÿEÕ@†©fÙêÇ°ËþzTÞc¹Ï/dá¯+üx¼2gƒÖ_sÂÖ¥Yžeב]ƒûsŸºÖ Èგ„ãg/샒â(:J.þÿÙ»Öç¶$ŸÏþ+Þ‡“S– ÞŠíªœÍzËɺ6vÝ^]]©˜Ä˜"´¤ÿþºg ^|)T%ŒÇ`þu÷ôc¿ñÉ ÆOÚÙ8™Mèc2¬ÉXV§¾§ð6R`Z,³›.¦h-HKâX.´©ªJÈE'°ÌƒŠ8ÕÄÔkgâ—h3ž3)ºÜÇó¯Úý8½•p¢•G™œlÖ½WQ¿zço¢¬Jg²\´ ¯Q펧7¯„ôËix+¤¿IŽÂ í±àxøNß ŸØ-ªï"vrزôØ!ÃÊ:þm” §*fWדIUOwi Yöx•ιˆ1žÝ¼Ä¤0†¶’Y<¥‡k¦‡¼LMÉ[oÜ´õÜÉ3­¹M+Þ;¬õ\|0pØ= ™Õ®ƒTI²ì1ÔÓã®Á³Kbw¡a7k>™5Ö$ê1÷nèé=íA}´zpq»Ö)™@}=>NÌZ&X‘o»?ï¨ùyøÎÛrI†«î®²fg6liÑVvl!á·Z³ &6ëIØIÕá„ kwµËƒ:,#_€ÃIK9i)'-e™{ge­þx)bð›SiôoL„ >O»O ª]%ÛŸpС¾Êþ„L_ñƒÖ$SöÊ7/ÔnÙI®¢úx&ñŸ3aÆF³‚ȇnqÂö¹çö­:÷‹ÔäáüSbP /Îœ0Ÿï*xK(6p8^Yè´Õ’©žhЭb,O5¸HÇ“ë„F›Cßþ*¡[Êt=s›§63ÖÈj†rÁ²øu4~¸ã{ÄÈWûªSŒÓnÄËhß-‘?Œïf“Ç‚ yðW‚¾Kvxs#¾ Woùšä6^LX•Z<EbAëøþÿÇb¢W# }h†ye9W¶/ÌÛ9ˆÀè¶R5ðÛ4]]^Þßß_°øáñ†O/âùÍ%ú(=(6ñâõøî¦Ò -™‡oFÙ³é Ö_Ió3Ðû‚%Þ…Ê.Ã)9$¼Š¼ãKÞ¾øîÀ°—€ý¢·—‚Zt1=C¾ZÕËÂ߆këÅߨQº!ßĶmË°uÇüÎé®þ¦Ù‰U? $\Mû. I ÂÃÊûÚ®éÏëïßÿóÝçÿùô³†«®}úò_?¼ÓFç——ÿm¾»¼|ÿù½öï¿þõ#P¼®}žSZÒéäòòçßFZñ;»7Å'öù_—Ø–«?ÏÓ“,eøõ‰>ÜM¦É›†f ß÷åÓâ^0àˆ_ðýçüÏÅøÛ›Ñ;V‡ExFWz3ByO>ü#ŠÞ Oß|ùü·sO|¿µFþ}þå§ów ¡Òt òS¡?¿ñ—Ï ìöft#Ù“,¤î{/Ùƒd âtœ‚$–1¨+M<5/nµ¿¡(“snÙÄ/^ƒ„ôU1/ã’‹0IF YM@jK'<¹å<i¨O¨ñá øª$œgiñÊô•gCûãÏŸ?^ü’쥼ÒíAö8U2cR}ºÐߌ_vê²&x¨ZPÅ,QA]SVµB8a±†Ižæü.þÆ¥ð7½ÂmÈ1"GœHÐS¯þ^¢MÞÎ)±iG è|‚UžB­ßŒô‘ø÷ ضú7ͯSÙ”Û51 KŽõ®®4Û™=ü8’ò>Ë.ªÇÏ'<‚[ô ›ßÉ{´¼# ïþó'¥þŒðWXwªt£pÓ½Õ/ü ~ñ²lP"°–)¡Jä‡_Ü””; ÉY¦Èxa‰°0ƒ%Ú÷ú?¥ßæñ½1Ê`)3Ón“ÂÙÉ8I—zýdü6Gâ"äŠñ¾ýt39þOô†«Q"¬¾¾„›ÚÀù“~«¥†~ËOwi„N¢pÔ¥6ÞÓ”ÊÎüžÇU¯n-q¸ÉišŽ–­£†Rî~èÍM½¾\L”–¦Vµ<ߤ4ߤç„7÷DŽñ#<Õe®n&q@'åV~‘續¨8žs`«·ù€à„ø·¸Ÿ)L*\ã¾¢šϯ™e…ŽeÛ~ð€‡ndë¾g‘ÐòXàÄÌô?锞÷°Ï+|æyvȈézº?>"Ó%”0Ûöˆ©W€ðœ7Ÿ¾.%;[ò%õº¬TS¶ê™f¾¸»£óÇ‘°ÂÉîüÇ”'@­ç⟒ªV¤RDaY‰õcá!U’ëüŽ#'Iòút+nG[ÎòÞ¬~”¼¹BŸ¥[±ï©s«¡[[ÒH>O²ÅêDe*†Ê"»üŒ…ZÖø‰3c…< È̸ÜA{tãB.×l‰¹é †Îx8IVÌ‹Ãæ®Ê*®ª½õ:ªË&¬£µµ»%o Æ›†’‘kU„T…؆,á¨{Kš¿Vk+'³©÷ËŠŒ›\Üú:Õ¾±PËÏ¥u…¨ç{sMN¹™:·õ0"†çXŽï˜F`¬W¾¾cM½UË2hõN]ÑÛZèE¡ßäÑ{ò6©¾J=Ý0£0 tË5XD¹Z&nip×wBk½Bò.T).q¸¥jjq©f–ªïôm²Të>wÐ\ù‘Í\Ûv|8RŸ¢Ö^– Så¤[Y®öáb_Äû{~_}'r£Jê,t¢ÈÒ¼Á£A-RËrŒ€R‹ºö~¾¯í­Zûx‹™\½nŸZß™ÜdÕ"Óp; 6ežåNhSÌÌ TCGèþ>µ-ñÆö×?¶nËÖw*7Y6bÁmP/°#j†Ç¨C©ïFaè4Ü˲½òŽbSÁœÓ¯hR˹½O±}6êkÚçƒì;Û'æ–5Ç”VXµ®aò+•ŸØAj_6&ô¿ãéÿUMkÅ¢¬‚ú )k£Æ¹`˜ïWNÚo_>~ÔÆ‘¬†ô²Sù×.ýȉ¯Ð•lµD—T7²Àt’Ïd{Òážbúµ´ªÈ}áÐ DÊ/Adü¿ `VvººÊmŒm[Tõ¦¬JSSþÐ’b·>3Žã7™Þ;¥›m¨~ W §WWj˦ožÙzOmKoØöm+šSo‡XÏ­B›Õí8µTþ 4Év0LézÎo€œùü:ÏÆÝe zQD[/Êsczâu ðtؔޟ8²ñ¡F‡&àl‚ê9wÝ^¦þòÜ­ª,ÆX+¯œ[tKç˜J`ö8ÒÎ0×æ2Ý>ž|Y(ô“ëÃ4f»Ì—¿.˜UrØgØV¨çÿÑ©:1y»É¥/×)«Ö#Òý׺¶I&ý<»ÆѤ©nÑ]]ån@}Р) ?¦X.iòôì„¢5`13Cðrû±u}´\Ži€«ŠÖqÊβ_,qjZjêIØ«O ­¼î“Ç» ž$¥ÆzYÛÓ$.ÊmmR2©/¬àW{ÒšŸÖ,Èg­j{K.ÖÚSgóJ{‚½Ÿáñ`O’ŒƒÉ#<ÀâESMö½Àµ¤e5¹"E¬*usÛ¯¾Þv´ßB›X¾xG ¯a>ÂaÇ@]ïH^Q½”%i ¾ÞîD¹?¾ŽE/kŽ¬Ç®|<'ŒÀi G ’ W×[“Ê°(ŽFAä˜é}\ç] ß)†šÀ¬¼Ò":I@í€óûq"j¦ÚMÄÖö˜ë_Ù\¢É®a6ÿ‡Ã4ÅÚj²ñk ¨ Ý29¨Á¢Àã£ñ9Z¤?¹ÊÆÉlB“áö?á¸ãž>›ÐKX0˶S4§À´pÚ‡TSeDEÆÂâ-÷%Ťkgâ—hSš¿¡ûxþä‚ôV‚Q¢•Gx(VñU°…ÍW¹°Ë}×ûÛ8ÙÕþ¯úlT/~YªÛe-ax#tB½u<½y%¬0œ†·BvØ‘Á¢O8Þ€öŠ0zÕA¸i?x}™Fl{W=$ú "¹YEÈãNÔ´ùÜEm©Í—Zê§Îç®Õ™:¿ö>zk“ýJ3?hu™ôØíÄ'%~¯¢"¢ÖðÚ¦®@ß‚¾ŽøœVƒ[š5}üº³p›qª±˜'ÓÿL¡}8Ÿ,ÂÛ¥!þ@p¼Yí#TU±–p:—3’Ý3³Uk@\6­Üs!Oઠ"žnÅBPßãWý˜ó?¢*w‘$²`¦m¨ŸÃá8·¿ÛXaDi0Ò %D ãNŒJšªÆÚFƒI4l#ª»èäåê¹ètÃÓë fklÖûfMéóf>N¯Ã[~íߦáûµ(­îöªZsÄ«müÌ6´ZuHýŒ£¿døÅzb£êâî¶óUgWmègÛøR@Q[ùB¹”ú« H„ O@ ½1Ç°-!Ò0ÑÅ$•föD„?OQJYÆsU6Þ—®âÅu‘¥wüt[D!7íécUw¡ûxwµÃC⬈ÝÃ!Ø䇊q5ë{Û²¶Qÿ¦œª·H·Ø…Ï5`¢SQÏ“r¿ú0¸ɸgcZæ.?v5vOîNjòº¨oÓ¥õ-CÒ¤»Òv šX“aS*"|"†TUˆº'RXCê:¥ûþôý%{`ʽ…½^L«½æïí%ŠAžö‚ߣÝMÒÏãáZ€Î$ãìeƘþ9ãÓßAuÒäÐ0öS¬bó¦ n”Àaﱊ†]1,% l~ýЃuÝ[¶ HêZ UMh'€:”ú{-€ªÑSÀRhJˆN´³x:yÔè|Ž>& „~úˆí Æþò„AŒAÂZ‡c©óö̃AÒR ‚zo”<åá¹9ž êeÙ¡˜ñ3¶W£ì„c•`§<àbR-}§BîZÍÊ­6‘Q‘Bµ–4šÇw¹ŸcÑÃq<} ZÙÝlòˆ –Úȵª”?¤"µ€€ Á•–Æ÷èã¨Ö#î+w²§Âx>çÉ,ž2|a=iÀ!ªpŸó´kQHc1Ý… ÁÝòÁÐsI¨…N¬šzK¤ë(úKŒo¦ñtäÝä¦ËV°(SÈ\°è-‹ÒEÀ¹¤Ìa-‡¦­ÞÂaïÚäÓyFŸBr·µ–¡ÚZ¤ã‰ÜÌYÌÒ˜OYJo†Âs‹”ñ|­¬£wÌCæGÌâ.s˜NLCgõß1[?w¿Þ0ñè ËOX®¨èi<Ç;26» opx8Ò¦p+½ÁëQ¼˜²W `>çxjÎg1æ\•éÏ!M¸2 KWKîʼn4ƒ+.6›¶…ó¥êãIx8Náa벺IÀaï²BKþØésRå¡ÝÂ:Ò/d9!–MM;¹£ÔÅâxUñ%—[ú´ÓA ꟲ¾:Ê«+!¨mY¦Ú_^x[§¡í‚ŒIJ°&C1,\¨»Ä<,“¿Œ%>4Ï™#­T#¢@zwý˜C?ù,)¹@eœUªÂ{‰:%Á*7T„Q*ûòc v%BN*»8 $32>•aÃÔüNŒô"Ñ "bÒ+OÆ1ô5ö·§3êÄô#êbå2[7ìÀ0l›YžÏCøž…îê‡b¨'¤8í.?1ÔÝc¤Êš|’ƒN5¦N)ôŽþ—CŸêfñ§Š¢Ø©–sÉ´Ÿ’dq'æmž—u+ݶ«\È—­ë˜Û À³ª!ƒ¦å{*›P³(&h#œ›Nà7ôˆïúÜ0!†m²g^ÿJDil†d{ƒ—Œ =TðÚ©ºAóHLÒÐ*#t8ç"*­\¬îÉ3ÍŒ´ûÛqx«ñ»8ònQý Î'ª9*ãP¶~%i«y~G¥EZ †ÃÌd[ "õêùtuÿPvZ¬‘Z_atߦ€h—o\Øã~œg³éiµí•b.²£À¶œÈŒnG¾Eù¥ñi¸ß°4•“²$†šz‘\ÛfKŠ&˜¤GTDyÛï@øk7¿P‰"mÞ©Cñ;5•—Ï£HÈV ÆÛRåE›‡3½†=¯¸“Ј_ÃCºf˜ÄŠpš—özY³H¶a”eÍjŠèèäÖ⋇ÄåÌ\Ëü0ôƒˆ{Œ”Z¶ýÌ•‰MýSåÆComBìŸÔ‰çáÕ’¬ã¢ZàüÊ"–³ä>-+œVàý \{阱Ìæw.fL$ÀP¯›Å‰då [åªsµ¡dÍÇ7·Ð››ÃÁf`Òˆ;‚ãWñ"}Zùß_ÍcE 3÷YYÍjkw¡}Y1grî½;þ’Ž.;÷’ΩpØ»õT²­í$Ù 1˜­WM“Ý9ÖÌ™ÕGB¡Xà˜Z‘:¾a›› PÉ Lߌß|îæÎ!ªÎt["H‚'ÎT–•XgäǕ䦙Ɍ ­V–T=šx®O?û]$EÊÒJÒÞ =´$>ÀÝv»¸qÕ'³›[¹âs¬pÏ_ïnÖˆ@óYpTKojÈ-Ò#@ýs®Ü¸îÔ-ø*H†C‚%v–%yeŸì!ož?û¾ýƒ6VgàUñºk0­!ÂùÜå34¦Œ¦É>±M´ì'ÛLb™Ï°N11Àë´zͶž!m—DlÛ–Lzæ{óÅd¹oÙùèöú‡“‹ÖàÃe±ZG—WÇÝN Õ÷F«Ñ8œ _Og]Ð fÞXø\Þ¨ÑhŸ×PÖê|2¸ÁôŸYY˜Ý=Xd‹Ù"þÀÏw£ñühC1Øu]q7¿ì4|€‹ æ®= ,‡ÕZñÂæP%6ú¨Æœuqó+!ÎéâèjðöÀáÖìQ!¿\5Zàù{‹!xe™r:í#wusj7ÂX³(>½îDKa$ù ‹áü»Ä\²È·~‹xö– Á äW= ^×ï±Çp^æóxk#ð÷#:¿¥tQC,jŒyc°Ç̃ÙpºÈžùÍûÓGcÓþÛK:»¯ÿÆ<ý†8£vcx?N’å¬ß¡7A%’G“¸2cØ`ëYL¦5µá'‹xÒŸˆzà¢}–îxÈ0t2NDüèî¦å0™‚ïí±v0t4bY!º8ªi5þ{ ÿ7üõBPÃBÄ€6IYluˆˆ5ýüª&â¡09ß~0¢\¢Õ ½× ”élòÈO„IK`WÄÀ sò´µ7ZÝ­k l8- ¾Jz*â >àÍ…ÌÂ919ç\vbåk€sí–_“¡ìý9›|µÄa`-3‰þ–£ÌQ ­ºžFÃ7©O’u>8¿oμáXðéÝИKæ`¼nÀ›Ê`ò 3å :O«â¡E1®se°)A‚˜~šµb{i ÇÁr껨­JgQOž:¦è›‹zÝXŽâ¸/®Õ¼¼õœ¼õ’ßL‰à±Ë§Ëeu3šøÞ(_Ê;qL…£,?`RoS†àÿÍ/f÷d„ çXªÜÍb£_‡¦X&!®ïSŸvD4×1õÀtBßñu#&7^´-¥°Ì#ÜÐaK,é†íhl®E†­³Å–ˆ£ã(~˜ò´ø„ûÇñ˜³•]Š'²–Özî0·[k»ñ±ÍàÁµ’zúdQÚú£“ð¥&¢±•bp—/—¿›$ â0à\HŤ ÖdÔ…¦ß#¤z„ôÈÿ·s³ÐwòŒBÿÉžñÿuðÿájû»ÿÿ5¶ïþÿ×ñÿã'0ã}aSߊÌ߀ïÀ÷à{ð=øg¥8påØ5tÏ%ža84rߥ†n¹nà’¸øtFÉü+‡)FU-rq…­= (ÀÕ\Þ¥+i?)2¥F3ïæN¨Yæ(Ÿä`<â.¤˜(#ìiæºñ¤ö†µO·ÚdrꕪK Õs…r5È^Lîñ½ÿŸÝ÷×_g=²Påè—€V5Nƒïð¿‘ßO±ÿûk,”¤_lX Øö*“Ïþ>>…~ ¸a%púþú믇¿Äÿì¾éxæã¸øøú%‡•ŽÑÞ¡‡Öº„oG°wÿ~ĵıx?Jþ·ÐÃGF}®JÒ/9¬r‚þz= IL'…}”Ðêm¦ŸñøñÇ5ÊѯK SW‚LN“Ó9Šé\À¾Lho¦ŸñúÀÈ4¡’ôKðWWÃ_$ZËxEÿ\ð h sôÃZÑÖ(I¿uEü:N95÷‚:Þ~}G¼]¡øxJ¿Ðöý#Ê2P’~ þêjøËè餔%ô£ ­(³¯ÿÏ1P’~ þêªøû€èT¥?Ç@Iú%ø««âïjW§?Ë@Iú%ø««âïü{Øãÿ³ûÞ†ã¹c Ñj>î% ”¤_‚¿º2þ¢ ô0í~ {ö=LÐ=[?„ÝG³äñÿ ëÄì +O¿uUüýéGÃ}A¢øÌÿÚöYæž‚_+싧GKÊB‚åº*–ïl+G¿!ÁrCË[“é½xqèEë%xšƒ®ÆCÞñ¸G—Þl8?è/Cˆmy„×9ïuš;¡_‚å†*–+ùK°ÜPÄòÆ]Î):Ñ0 ã9}ùè—`¹¡ˆå=²÷¡†þR¼6m„13'†ø!8f=ì`¾> ·l9ö9Y.ªÑ/ÁrCËï&á0|bŸ¿§5¥³»á‚ Š¦ Íø«S|­ŠÉh4ù'• ‡" h5ú%Xn(b9£øŽ.ŸÜüËÒ/ÁrC9–ÞÕV’~ –ŠXŽëk*ÀÓ©f'ËÝ-ç|á/~ÓóÙL† µ»ãÉ´~¿,ý,7T±‰q·ÕJni»fŠ›oôÀ'1¼ck²1dHv>¥ƒ9–pïŒÜX@Ý|.* $ýü5Õû²¿‰ý7%øk*âïà´ÓGý‹·ƒ÷Í^Á÷ËÞÅ/“ö :þ'Û¨y58½è¡ÿü§Ù‡Óè´ûûàì·ºW'ówûèøj€Î/¨Û9ë à²ÁÅ>çîñmeé—à°©ˆÃoÑY»×:"šÇngð ømgp΄û¤ÛD—ÍÞ Óºê6{èòªwyчêZ;éô[Ýfç¬}RÁIpØTÄáÎ9ȵiŸPÿ´ÙífÏqß<î¶ÐhN:½vkÀª(ùVU$8l*â0´hõ üî>ê_¶[ö¥ýkÚG³÷aŸµîÖÅy¿ý?WpœD'ͳæ;h./ÖZYIú‰‡‰"¯7nPãÖU¯}ÆêÚVÿê¸?è ®môîââ„kk¿Ýû¥Ój÷_¡îÓß·èªß.ëÇ E>iš\Ê@84z Šµ›«~‡7ÿÎù Ýë]]:ç/ÑéÅ{hhP!M ø„ëÉÅ9oVåÛ‘à0QÄahí½Lˆ¬¥sÞGïOÛp¼Ç”Ï ×d ½?èuZƒìeÀéà¢7¨Ôþ‰‡‰"¯š1:o¿ëvÞµÏ[mFÙãà}§ß~ ¶¦Ógt„°ß7ß+Þ¼˜®C]°¯eé—à0QÄáŽísC„:oQóä—k#1`2ûؼr­hÆŠ\¯hˆ‡‰ú˜ò7ñ#ˆ‰"þ®Ï¢ÛçùÄ„:ð<ï¼ñpº;½º2™mÁâžµ»ýü%Šø›]ëû}ì^ú÷Uº%JÒ/Á_¢ˆ¿-²t9ÇâÕNÈO£Å+q¸þyy0/Ãz4ûéfñŠ ~G\HP˜(¢pw²ÎÎ't„.'Ëà–.8«Ãõ©8üóp qYÂÈŽ¸°$Xl)bñåÌ›{c[·ÞâÖƒ_CÎÆ4>þóšºÔ‡ãbò«q!AdëoÞ3mIÙRCä]nr H ÙZƒdµB%8i™U •€—U^SÞ%Ðù|2«½ùqC¡‹~÷ºÿáìø¢Û¿>-'5 Y@”§%ylµ(d™ÂèSÈ•àŽU€;›ÉU{¬.¬¸X—Aüz 7Ml­îIý–™£rôH ¿U`ø‹èY½wÂú 7d”䯮4Vk|Üò|‘eÉ·%ß.°øÕÈ'N†üñNǪÔK,½]`é+ _ËPŸä¼«H¼ÄÌÛzƒfKL¯] =’H[‰ðÅõu0-çlYŽI‰Õ¶ ¢¹QûÞšÌBñšÕl_’yG$¢ áêí§?–ð ÅG9V$Xa籡ÿU,Wb÷me»ÿ#ëßF帒˜qû˘q[bÆíf<eW½Ng‰ï%j:~ŦJµK ¼­làK=Ö)Rä•}âwfì“®Çö (s ñÎá6êRí¡_ú*ÅVã—žI»È³e(¶t§ÈHyúÑ£uË4¨k†fà8$ôp9FèêØÕ\_pm>âzíu¾˜o‘·41«M*ZXùŒ”4¼QR‘™Q’…M¢™¡çŽI|Ç75Ó\ÝôµcÍ¡BHä«INËMò{")E!ÙL!E¡A1ÛרçyKÌ ‹qÍU4#{ªJ-Éq„×s©*ÁËõÄCj…J`F)Ð7ôâ$Ù€p‰l@ëÛ½›Ìî_öŒ7Bºú±UÁKÒ/1ÿŠÙ€v¹•Tj Ô¬¥ª ÔN@´Á¬ÈÕ¬Èöâû¶}Mwlxy¥ËÔq­VÖV °eÚ‘«¥CàzE–£z„uÃÒ Óc.ø¦ažÇhFiuC’@¯'R+TNëY}” •¤ÚÁJ©v¾¡q’¤ÚÁÊ©v¶o—bh;ëqÌ ./I¿qSíìr+gœ$¹vpQ®ivHMÇ4½Ð6ƒ€†N; #B±ykší…ácÅ®KI2õàµL=L³ï›Öm/ruƒ-;_,=ÄÄ·Hä`¢ç™ku>æo·³$¿^ËïSkà =Ý0œ ²šB‚Ç©‘( –ï±9Ïõ¦•Ù‘àkQºùиšWm1";2]=tM·<Ø11°aŽ¹Ö@ÿXz£M•\} 6¯e ªR›†Á†û©oú!h*uíз‚¹>ñ±ŸçN,]»± WîS–‚²×rUuˆ¸W–øìFÏ÷*¤‚(_[3Sb!‰Z*‰÷P”GhGÜ bXF@0qƒÐ5"ͧÔ_Ì£µÌ /€º¸ûÙqƒjÚ-I@„×mågæÄ®/`¯Â¾Kâ–gD lÛ#8ð£(Òt¬yžã¹k=¡ÉJùÙ’lEx=[‘Z¡e=…Z¡¿¡(¯Ï˜Á‹%yzpQžžóú¯â“%hZ”açÉc±$?.ÊS}Þ'–¤µÁEimÖ˜æ<§£‘[”/‚ •¯[…­Å"¨ñECÄ`çu¼öHî Æ1g]>,*ž¿¨†»ýÌ‚÷‡¯>77Y óh}s6­6M·˜ÌååKøÀš*›íá“8Ù°R;›‡•yûã0™2¥Â‹-x¹Vˆý¥Ü>±a³H‚¡ˆ{Ðú-kPWY ×“7YwXÒ4‚CuyBõ(¶ôåµwÔžëÒµÂ#UmS™®”‘ùáaš¼¬œ&÷Ϙ‰Þ¹Gfæ<²lv7 Ü>­ y8Sñ‡Nx–OXWW¶ª“ß·W¾ ÑãÛ¾œ3©c#çôàQÏJªÒ‰;%¤ZeP x€;áqâ5ÍœÏcš%|žT¼òYêâ­:C´ Bˆ»wÚ}d¸9ye:ÖWˆ+”Tq«Mpª"N~óPrrHf¥È]þ¶g‰ºòoŽ–ì@Z»‡=I¹¾c·Jß±|¾ º$«Î=¬ÒJÇšéÎýn“äÛ*©Ôá)Í£Q¢ÃSZVÎLt¨vÔÅ7ìÐ'ts>a‰ÁøÕ¨š4¹F‰Q5iY9ù­²v¨ 0¹c‡:®åt|Cè'~üpp€¢™wÃf° ƒƒ7™ÃÁd̨š³ÃÏù‘ù›-P4™,è MÙw~êv–Ð+NÕ Ç0œÑù|íÄ›×s»ož¿KFÑdŒÎ`ÿ÷r„té&‡¦uH¾pzšßÛ¿GéÜ9Áúíb1=l4>}úT'ŸïAœõÉì¦1‡ôsìï?=¼»Y#ÍgÁQ-¹c:¾©!o´HõÏùd;\wê|$Ã!Á;ëOÂ{öÉòæù³ïÛÿÃÕm8 x7˜–"ˆÜå3Xhj™&ûÄ6ѲŸL­-Í°žabb¢YÆ3Ь϶K"¶mK¦î=óE¶÷­×ÉÎÿC·×?œ\´.ÛˆÕ:º¼:îvZ¨vÐh¼7ZÆÉàýz:8ë‚ÐÐ`æÿ½gmnÛV¶Ÿý+XõK’‰m¾I¸Žgz“¶§wÚžN3·wîÜñ€h+‘D•¤âøüú» €/=LR-97™V–HXì.ö.v3)žéäüüÇßGF]:Ý;R0]ÿyþû²°±þzš×Zžñœ£Ì’~žNfÙ›5ÝX„ÕZ>+(‡?S‘ƒX„gOÅß‹ñ§7£·JzŸ^c8u!ËA£€ªQ¿G>ù›÷×?†Rê­tò×éûNß&Ó9ÍÇѤÞÏ/?¾!Uq©CD’´öÜ;%T•0• òq>W…X¿@݇âôìÎøi<ÆŸ"©˜al€zòär2ž}Ô"?§˜TY62R1Át´‘Ý ‘ä¾”ž>€Ce,ÏóúôUWµøð÷B¤g2‚)ïtkÈf™PÇ´–[×à-´L' ©y4AµŠAcm›<™”Z扬æöÒU3xŒØÜ£¾M°:(K=ô·JG—ý Ni*(ò`0ÎÄd’Í)Ïnߌ̑ü=e§_—¹‚¾¤†œð¥ÀZ†çÏ?ÁM^ÜÔÍO'"†GÌ3OLÕ3F Èþ”ÙUp>QÅ­?¸˜FhA˜g䬈¥—*s¿äA<ÏSõ§PÒr–…Á£ 1ãâ¹aÆàÊ. 6xW>SƒF?¥É½5*M5àL5Eãl™ê*–0Ô7àÖd\Ù˜uCEÎ÷ê7:ž©ùÿAoEŒ¦4\×â‰'²FG¿——»tBgÀQ8ëFïhN0eœGz+£¡i*£¡ËÞcXÖMèp¡¯ïêò|1QÄ,¨ÚÄ·ÝÀ·Ýáë!QsüZuÁÕí$‰è¤ÙËÏêZ—Õçs bõ®œ\¿åÃئ†T¸'&b:ª¥Á“âø§7Üu™ïz‰" ÄžIB×fnÈ£0²2NV¦e/!ì3áaè1n;AhúðÐ8v›ÚÜóBð.«ö­ºç!·ˆcSâQÇÿ*dŽíˆ§»—ž–hÌÊQ ¯:6 4+é§GUË~Tò–¾œ-¦Sš> T,(ýÝLd°&Nå7.£¾ÀIæ±Ýïktn³Ó©@y­®Õ… ãYßêÙŸŠ“¿òá¥UИ€”ã£%GX]Û¬P±·ŠK<©—U¸0ÈÉå¼é;aÝá]ýœ`U&¬Z/õ+ ˆ‚NÂew¦È5¯´ŽEM|âI&5RZŸ&¨`P+,A 5{3Â¥;»xæ6Mó‚ åÁe²áÈ'+´»³¯¤ÆPú¢60@4ÎÅôB\^ü.þ ú ½Åñ-À"‹åŽŒOú§ÔÐz#¯8¢„ý¯tòg³]”äy²aaÈwWAíÝ•¦­Bæ:è3 m°øÿUÜ5ÐYUu¦æàtZY)’PÕri¥¨7‡EqYQÌ}á‘ð|?¦^–Íbs+j°Œ"ÿ`O²ì“ôÚãü®ÃDkPÜä]Ø£7ò:óÏBy~hšL09¦ïÅ"t]<ÓSf±ÍÈ!e¼„TíS­“jÞ‰T}Ñ· ©_D‘ÛvLB!˜ˆLeL,¢!?©@eù äjŸ.Â"Çï¹¾ú"r¢…DØ®m™„Á ˜ï›6¾‹òî5Ô:ºvÜÈè‹ä¾{f'›6½ôË[ã]ÂQ.¸ËM®“ 'tÆîp(²ßa{wÌê š—F+Wçi’'UäÏòÆž 5;)SÉÊ8±*³l#êٽ쥿Ò[êO²“ZÍÞRÜÖxÂtˆGuÆÀ ¹i2zí©"u–?0æ£cëZÄ ¶>“Q"ÍhžMÜÓaÛÿÙsÏÀoUÉ1àé«œOÇ1ÞÊ>sŽig˜ÝÞy’a`ç‰ELû ágË0UÓnïÛÉ1.pŒû´Ó!ZçsÌ`P‡ä0vÕYý§ã’áwÏ–KÚ™dÛ€ÆC2 àÄŠI68TE¤@ªƒów8Æ*žÔ|f£IYÙðêÅš‹Eoè¬NU™÷~_ŸÓ+¡Ø¾½663écè‘~£«u¨è†‰æfg'ÀåqîçøDÌnó; ùº¦mЯöåƬ¶è+|@ö,ó|Qãí¸–G$ŠuŽ÷èÌ€•ž>ã™j¦á¯ÇegFmÓº†yyöK LÔ'¹5ÕDÿT8-gùÃòøŠ:òÛ`ÎÔXj¨µùþí°ãöê ‚Ú_’ˆ…ÑßOL?‘¸ßÔ•½ª ÝUµòðÕÙ£ð¬’É]zù[%™DùÔˆ(O¬÷Ðü¾³á­¡¶—zk³<"£SwÑF*¦µ¯þÀ{pSû¸és4Ý%ólRÈ2H6SºAž^«m+}õâ•ÄÆK|«›€¦–Rý~¾e“eãh‚…'‹üå‘heÅÇ5¥,a¾¿¨~áçx'éTîRw4C] …Á—ôò>m±j ÈA»™;ëgYiP–|Zý¼ȲfÕ Ç{Ëôá=‡“éE¥€FˆÕ³÷0¬¯úÑ`?[å Øp“v(|4QkÉ¢´Ìï“UÏÜ8-L3ÀŠñBë’Óûq&^¾6b:ÉÀí€û)^9kn eò•Þ˜ƒ&ØØ{f(H5IŠy´CÓ”>¨DçÊ&7ø8AôÚ¸KîÅ'tPÌ—Åô²×:-$·ºÅt‘å(ö‹9‰îÂÖÐ\)€¹ÖqÛ’²ÙŠÚÆÛ³j!q…%‰"ìÇʬ3Ó>VÇ_ÖÁœVÔœVU0çËö5;œV8"_Ïv<{»ä;Ÿq›4)ÞTn–Ü]‘éú £$}ƒñõɪˆ}"ýó|µ=ïjÞà ¯$ræOäÑØ>¬%øø-¼×H\Ë­I\YDû˸őÀÝÝ;eñìB >‰É³õ<ÇîKòq6ŸÐ‡¬e+R]í´‰‘ ´ÒŒª%!Å‹½¾Å ÏÄ!ÎâÌø%7tÚQ &½ÕaL†DºñBþ‘}*Wú¹OÒÆý|Ié›dFs†Ù‘x”Ï|7tû!õrÑCþ.s3£• rÃ$aÞz¢ãÙíki— Êî¤òDŒTùáWïs0ïS)m¡ÚFóQC–³&=M'8µ«:º<¾˜ ÝÎÆkQ·µ¦á|:´‚w“še©¡yRÉW2˜%i*²y2ÃÍ°·hQE¤g¢4°›4B±=©6+õ¥4‘‹ÊMîòz&rT˜?_` §t‡4{a*ƒ…Èð埘aé—*ti?±Ú"•o©Pê½âþêtž?¬ÛªD5¸>>½ ð^£"Q‚ÁÇWÿÀAðÛ[ç{ÓÑ-¦y_Sÿ1UÔG˜wÈ[x8aŽû^«šûë+«-tFÝ`Áp‡JN þ²8TVÈÄBb2Eî9ÉÙ¾Cõzk.7D:Uƒ¾Wir_±âGÈŠà—F2||ÕUCmGY¤ ÑÍ VÌz7ÔŠd‘'7Å pXPG¸µµÏý¨IY¿`¯Cj÷]ÔžN~ÛWSgóEþäšJNvsœ"•§ÊÖ˜÷qšL+MÄ’é|òPÛÌÚ ˆ–N¨5üxM@œ —SƒdwÉb ém$³ÉƒÇ®–†PªtCWÉƼÐxX&s1çÒ'ÒÏU‚µP©ª…a=ìÎYè cw©*  UûTVÒ>ÆÐÍk5Mܘ¦~k•€fšñ Ø|¿m ÷ø._sEB(>zšƒxk®…dŽ'zðñU™¥Ìí"Ñøê>àà;œ«Fåš5£¹©ÏÞ"¨*fE«Š¸*¸;N’¼Q,÷®Ì;©nÎAIsž©—n\]fˆö«“ª¶.¬¹ßàÿÿ\L ;0`y†å\¸þ…GäÆX©H`îZ£Õ'kå°‹ÚÊX»^J÷är<½]B×lÖ-æ³[Ì'š—Wdµh\˲Ô/|U Ã%5%¼‹èÄ¿8ÈÕÉ¡«“ý7ô?¤3˜O’Þç¸Ú|UEwŸc˜Ø­ëâ_+ðÌú_:¾eÙßX6†:[Œÿ ¬3°¿1Ì}±éß—¾a|Ñ,#lãsm÷Ÿé¿Ëoßýóíõÿñ£T7þxÿ¿þòÖžŸÿ—óöüüÝõ;ã¯\ÿö+È Ó¸NéLÙBtr~þãï#£.©î)¤®ÿ<ÿŒ}YØX=Ík-ÏxÎQ~É?O'³ìÍšnÀÏ%ªµ|V•‹+D$<{*þ^Œ?½½Õ‡<0%ï¨ëºØ¼lü=º,™Èß¼¿þé4”p¥“¿Nßÿpúì|šÁp«õóËoHÕFUººU^¥ÖÏ5j¨Ë²JqYñýÂÈàóŒ­Ô*VaìÙG-û±ä÷˲Xt°±Ö|v'D>2Ð Ó“ÃpœŒ¥ãy^¿ó~¢êªÖþ^ˆôá샬˥îtkÈfÚRÍ–[×à-ÔM' ©‚45µ®)j…«|å¨yb`RTL“OBy&ðÐk|4FÅ›dÊbÐC[•¿–ý N)˜/²¶™r2Ä>3ðތ̑ü=­§ƒ©~™+hÐ÷0ä°ú?†çÏ?¯jiƒË¡oêæ§Ã#æ™'¦ê™ª˜ûþ”_R°>¡µ=¦ n<(ÌFWæ93/U™uÙaY [ùÇÚÑ€?…¶n8ÇÊ¢`®©üj5{oT `°Á¸òc¹½Õ(Fß³}ÝbQUäWÍÿz+.;Ô¢Gü©ˆ»FG¿——»tBgÀQ8ëFX/[S/š½©·bÆl‘ÂòÍGUïè5¡Ã…¾¾+UƽNÕ&¾í¾íž_‰šã¯Ðª ®n'ID'Í^~V׺̨>ŸS©wå„à‚ü-–Åì+¤Â=1ÒÕƒóÙ±ã°Àâ.¥žhìÚÔbÔ·âØ£±ip•«PX@·ê€¸1–«Á ªþúb:¥éÃèjØ’ötÄÞêÙûNÓE?ªzö»´„ç°(ŒÓŒ"Ë"Q…³„ÉMbóÀ>Š’ Ú¸þ®´èÞ"C¬VTÁê‡(‚ÝØvÍØô,y>s3mk'üÀtLfÖ†PÝãWYzAE¬·`è‹òŠ£xNè…6ñ¸cY"Žc‹šÌö"ÊC+¤Þ‘‘·Ú÷OIÝERz¢y§")1@:6s‚X0îû¡+¸iG®{"¼×z7žU¬<D.¡ MZà¶OmÏežé±X[{ÒæØ­›’AÚç^’O‚¢8äP\Ñ—R»pE;Ìñ}˱"›QÊX€L±V´]¤Áz;´«â¢Ç°Òûâyš¦çz6±ãÐ )M'²¸pAĘ”ø±eMÛ¡mÒT~Œ£ã¡m_|ïTìÐò…ëSË´@ýSŸR‡:ÈÂ-æYñvŠyQÚ§^c”²€lÙñJ•­¬9›ñD‡bˆ=‰¹ ãÀ$Ô÷m‰H}&íG^àxpM¸«%ï¿ ÆiŸz Ä ß$I;û¢v2F>£Ž`¶c†žI¬ˆðÍØŒÙ@ö[µð¸ÈØ>õˆ~E‡ûât§š¤Œ9˜ùkƒ´¡„û±°‰±]/Ü® ø`º¹Úå퇇VÃ}Q» ½(6‰K`R`ž3Ë6©qðæÀˆ‚ÈÇEÆvhK„·–›ÜžŠ¯ä™PŒ‡³Ôú’m'+Üw'§Mp+tL‹86åAè[fà:ÄÚÎßÎÆÿ7{-@\Ùá­ðV>²|srØÕÞ½; í˜p,!'à«Ù‘ãÅ‘ïÙõˆµÅW= µÓú¶CÏ÷ÇcÔe®-¸ï™Ü#ž jng‰í¹ºxµ¸[-ñÝ¡´ød´þvyÑ“\»°·cáxüp ?²b¹0Ÿ@˜Ì4:*Öh¶z7Žïm:ÎnØ`»Öû"y·µˆ8œ9n ,+ð=â8±cûÂt|îvæÞ`k½ØJd#oX‹ÓÜ[;Ü~Z?lï´ŸÆ|RDaì…Ž°#ׂù¡pâ‰(<*ʶ[â³Ì¢›ò|Â_iôEó.$uÀq™c[œ†$ô8ðËó©O£8Âø¸|³vhk›S¸Ï(Ò›2ÇÊDl»´üÝÎ6}I¹“Ò&®OƒˆF‘Ρ "Ž)ñ|Â=Û4)sŽ‹mÚ¡mˆšçé8ZäþÚTà¯r§ºh–´©]ÊÆÇÓÚ%Ü$˜Ô.ÉÜñ7cÞÁ èIÀöˆkǶXÐ1µÃ8¶…;$²üPpºÇÅ,íÐV®=}›à.ƒ¤ÀS\‡U}QÝ™¬eçþÊävØ_:‚¼¶ÅFßvØì]Uo'<3ì;90-Ÿ]šÙ’ 7&:âxdXJ c„Ÿ#pÍ\ÏMàA—}ÉùÄ’GÅعó*4[|1¼øÜ…$VHN¥$„}Ï"Þ­ (b5¿í³ûr--\\Œš{Q&ŽˆNY öX”Z¾@³5…3,å¦P…Ę•gs\? n$]"×ÐlI\äðMT9UQ(…ì«zÞ†cŒP "äÆKU/½ájn…¥{%\i©Zªr¡g+"!.÷Ë”`¦Èüv&M‘S+X{‘±ÅD·“½R% ¯ðÕQöª ‚æÚÆc.„ÆËa(ûJ8¼O^œ*NÖhØõ"³’¡øÉ…hþ„¼•.n“„ä>Óٰ⤂¤Ä³ ºŸEÈ'ôé%7ž"‡f'eö%UIl_Qñ )ûÓdµ„ðjEM®ÙIa@~XAv0­y–¬üoèaXu•w,2%ŸŸ?̱[Ôâ½Ro]À-;5öœ•ÒæLÒL_fh¦f±4Ó:Æÿ,~E²¹´T¡JS%7[k‹¥¶tÀùðÕQæ'Ñ‹†Š#È\]nLáÙ%êpV`~YKzBË»âòÄñl÷µNpÌeÀUØWxWgJƒøì!Jfa-ç  ±@ëÍõ7—z± ø¬sHžìÍŠ'æHŠª2 p1Š¾1<»öHÃԾ⠬°™e®ß£µdŠ×¬åøÅ23¨‘ƒµžÜr°!FåàTeÖšÈÁ¾¸ØƒSAJÈÁ¢,)198 &¬,Ä%Øtzlf 6Eli·H°$wy3IV‡Ókå @nº±¢g^Ñ5Zn­©×µši2š‰HŠ;¾zt±é¢ì»%øt1MÙÐ&1ý:È ²˜PR;¬I1Ç„Tp’DQIªuSZ"šØ~ktª²<ó{Êw 5‹/œtm)ÅS‘µç±@²e:„ þdÙŽ —Y¶#¢{–çü`¤å©ÁŠáÒyTYkár¥T›œ¢å‚Ã]´î0ÚŸŸ®M{x}ߟxs¡fú£¡_\Â᪔œdj¢Ë·]9ú£;höyVP‹qßJ[´I.ï°&ƒ–ˆÞl²‚å~§P¸æVì]h„°‘¤…i4KŒ5—ÕŸšÄÕ(P—8PPÇ_fh e¬ÂãÏ'ˆ.~û¬š2G7_ Öy'áiÁ0Òì )¶\¥¶ªùK>Û¿i|„­ü·íŠ5k¹m;·Lì½tl|t$€ý«àr©Rõ2÷ç§=‹‘W“º„°É¬”ʸR…Æ W³’hƒ1áÇSEæ®H¼IÈ©Ÿ_¾8¹6\ÔŒÚiXU5“˜¹*luK±Ð–À6WU ¯a£ ô¼Ï´q1âéõcœ¦Ð!禱9ƒ~´»ýåK4Ü[¼æCd+Ñ|Ã=“ƒ'˜Tµˆ] ÑŸDWè½ÅïEƒ†x=Ø꣒ø¹oÕþbIì:‘NáëÄسzm'µºwXŠÐ쩦Ç]Ò[€ì&'eÁ“ÓôØÙÌ)ò?t‰‘9‘8ãÄ9;¥KMNß¼S ÈÅ ³b(!v“ùOæëÀ%íÜ\ÚÞ=!S{‹¥™ùz¿(fÏ]óÌX„Ÿn§©S—ÀW÷ˆ¹g³¸œ†§ÁFQU_,—¢BG·èÕò=GÇ.ÀÊK¬ÉœqªYžºüœ.švÞ-ЬÛ¯L‚~‰Y/¢ð›í;)Ö@Š®V´Içiq¾hj6¦M“òm^šVˆëgµÌRÅfv½™Re/7“¯N1À÷‘±¹=·ÐãjÍÛäII•¿˜ÐŒ—jAˆN„–o'Ä´C’uü4z.G]iZåã¦ÕcnÛj0¿ Ûj*H I–ÔXäx:@I–7Ô¸›RÏå¨Ø&i\‡ /Ìã;EæÔ.ÆcÑå=Q<Ë›¼^º“;Ý ÉË_'S° b¾0ù¾ÃJå .·AŠ³eÐhâ(hD¹9ÌnR+Óì<óæhÊ,‹ÑœÙ©†Ÿtmô ˜Óì¤6Ei¡2)‹Ê^½ö:×!*éõ´eBÏé—é©=Ç_* ÎáþËRpÕ¥®4ªÇe»T+T;ó.büÏWCy6b¼ §cÚh’‚fΊì% KŒ&’^y=t1¥ñ>¶“HÑØ}ø:ˆÔr—\—»P–Ž†Ss+Ý&Ö©R8’7’ˆ"ÕjIþ²P­ˆ»j-¼ät‡Ó‹=)3 ýdSÖŠ|Ròüè}œï½A¨'H˜„È…|nòÅz©P‡ãCµèÌìë2»Ö—¬Ÿxú­!òåªcæHÈÆÝì"¥ƒòæÔoÏÍnÌ=¯1Éí%éÔ?¾:IÒ>Á­ûiÙ¹öçcaHTSä¦.:Çñ[ŠY;ÛÖ$‚)’íw‹»Y¥‚ê΄º›Í`+L>]²‰Wb‘Ý­YSžÎ°P»q>à úñø ‡–6Œôû‘mSôƒ Mî’°~‚æ¨6‘´À21–% L;‘ !­kgKOãb‰M´ç—“˜ì”~BÇ« âÀctÖ§íIƒÛ•ê7©œ3¤X.ZViÉöúÖ±¨Æ.Il›*{ÐüeX—Ž`°j¹!’ÁpPHd!lβyq²¬7!?D¯DG«¬¤ÝÈÙgªÇ±ŽÍ'±ÍÉkÈ …¯¥ÖÇ5U]er0T,«HàÓ1‘Š„$MÃ,Ep–ÖõríTÃÓó㌺ÒW}¬SÑPn.?‡ÎP¦ýåèÔÉ6@‹úsÁx8r'·&I­­)E©‘‡bfx°RšÜ;ÃŽùâŽX' ³„m÷l3Ûʸ¸“rø€°hr8ê€Kœ1è@gB˜| zPš…Ízq™y6ÛÑ#Jœ!ƃ%£Ô µb2šÐ]C'âq ôÛ4 v&²»@Fcµ¬RÅ ÕQ¾@^ÈŸ²KHô|þ¦tf®Ÿd±ÛV6«qÊCíûÛˆD‚uMañ<Ï\²ùI³½D~méJèІúÒØúñXl…YœX”DBú˜o.ÕŽ@þ’´¡öøê(ÓD>òYZ{`÷®Iº²JJ,‹|Ø"ÞH‚™Xâ|ôÀÄdóršÑµ¹ Îb¥·—•øŽL9¼„ó°(ëDÙà¦Sa$Á(10 ë,HQ0DÆŸŒ–4ZønXµj¾À¶cHŸŽäüœZ¹Zª¢ÉTÊü„jŒ×ÅÈðˆfÆWñ¿ÍAÃVæ…Ù†‘¶$UUlCS´²%cÞ±si=š¢j éÉFK¬¨Z†RÙ6ÏæïkzZH½¨®%KöOMµðÕQ«I¼t†°…{x˜¦ Y€gVv×79amÈ”ÇÐ “B_ËËNL*°È£ª7ÉôÏ¢3Þb‚}“To™Ø*OTK>GûVe=Ê}Ã9šØ½clÔ_(•öÖæþJü82PÄÿ!½×‡ ‰a¯…¥å„ ª;‹. ´Ì¼’)!ª–˜¶(;(¡! 2Eº™jP‘d¿E ±ßÌ÷Å72Í»š`X1‚aÇÿuNGÚ%2Õ‚h©ˆ†è貎ÃK¦`cÙ–ª#ðÝƹû^L=¾ÇÁ/€ƒ¶Ï’qò„‹ßè1ò]ÂÈSWIøê1ò=F¾ÇÈ·ƒ‘}u|„‘Ÿ(•©WcÚ(ÎÅbìÕx¬m¹‰{t&‘‚V»ÓõD…ŒS·XfAU£`R =Éá¸$Cã ¤ª¢BxM¤J¼,«¦¢I \ò)œ¨ÎUKä[U*uÔÃ3âDg’á7ÞWË×Q³Ì­‘š7Ýó{â5 Oäð~ —«Ì_ _Xã¥)÷}hFq·\òR©Eoâb=_)©ŸfUòtK•„©üäv«!×–Æ«yÇË•NÒœž2ä”õ‹¬-|<È;^¼4`ób¦KÅ9B´]Œ“¿cnSÁ-,þmŸU2§ÚºMŒ‡ðÕIæ¹m‡š8è ÷?èå-ä„ïïÓ±MH”!FIé\°o³›m%[º%‰‚tCW%GS4AQa'™Ž¦éN)ØÔãÊD GœûݨLꬫlðúòT+5Ù˜­Ã"Ø£agÓÆ[!OAªL"Ð×rùA¨ÂOÖe¸Ä†Dîš%{–ü%l\Ù×û,ÃY;`,è±Ê îDµÁÓã-“¿‚¦ðá¿ä§,+JŸ *Š" àþ>^PEIéãø¶õ`ŽOgŽë3‘[-ÕZz¾ûËô³þü‘m›w]½}”#KÎmß}É–±Í\n`hèJióÐÐÈ®îªËwmÝx€çvU:–ahht<Ç…±ÏŒDÏ®Cû ,¼ìý¨†Þ´«6ÁI´ÁýÓ…¢»¡ Á0 ö6}(ü& Ð<;@u@r›vØE„ WoÈ¼ÎšBW7ìÞué€N±ZÈU»7 l´æ!8c£ŒÆ;„ëÚó2¹A6xn„!M†,é Õ|¸(ms—±£ì½±r=ðO{= —;h¹nŽ„ÈlȹÕÙv§0®æ8",yÃ!È®UɽTãÎTG쪇Õ÷ì«aàË÷övˆÝI÷¢=[ôtCnüíP}¢‘ªË%$ÞúyƒÈ5D P-•sŒÊÚ%ªðªàéÍÑ¢ <´ÖÓ…Y…’Ë\˽¦Ïg$7€Cæ·B¶ŠÇµãB$(AcCŽÏÑÿ/!…ý?ð·ë«¬7„Áæè`âüäTu˜SÔòþu9&ØþMïõvà~PÁÓì.èH¹RÚóÇØsñÉ͆#RsHn#?h ò0Ùp›dlç èw|š_‚%"óáJÈ›3Ùªô™Pÿ‹¨^)Í9ŸW ;Óyj…ÐU"S5.…üÆ€ ót¼·¢|‘;µÒ‹„·X?/6ƒA´ºAÐxp9 T„EF1ü>ëÌΠʲ54ÄV ×b5×€Nä—hï.%Wš‚Z?T+x•·ªÑù#ó-fœðæ=acÜo-dt#`°ŒPZÀ³õnS¡fSøÑ‹DçÌO|“ Au(„ ÙØYØ$É‘I’2nƒð¤¬¦‡pùÝBYe†A˜>3 + ÂòAXY@Øa¶Â·A`D*l“0Çád11郘Ì"‘÷Aä³€(„AÛ5Ó‘™ƒ˜öALgQ ƒ(ú ŠY@”à Ê>ˆr•0ˆŠ¢’D䘹>ˆl¸# ¢êƒ˜['AÔ j>ˆÚq |Oòó@Ö}õ4ø,¤3¾®Á ùmzz”˜õ†ð‰f¡díÍm¼Ü«8ÝPP“DnAF²µ)~2Ë(üÀÀB¹LTõ/K!MøÕÀ4Ki$ùEŠkJTù<ìõ„ )dŽ©ÓàêÜp²ð07Y¢QªWª0 ×ÊáÖÖ4ųk˜¶„QpTÛuÞ”-G$G3EMä-…¸.0ˆLß¹rÕƒˆ%Þ’y]¶yÛâ5Ù´ICŽbš¡ë¼l§˜E.`²ûÄ9­€*sÂoS-KÖTIF‚la$ÊŽlª6ƪ®Z¢a©±6ç…?/D%`H—MEÒM[Ç–.a“'©syÛ!‰é#óÒt¬úLšUP%‹7MK·5C1l‡·4UxCÐmI–,Iʾ Šä覮š†¢ ²h(Ž`)ŠÉ–èˆ"ä4«@ó¦[K2TÛmhIBª -‹†¡ ²æ¨† £Ë¾Š©©šÂc^Qe“WlÑr°)*ª€-œ˜’¦`–ï4 €±(Û–Î[–b9²jb¶m8¶ŠEÅ^À K“5ƒDÏ覌 ²,ÀA€••$¤Y€|†diXvŒ"# ‹aÚš%!¤Š¦¬Iböˆ‚&š¯ê¢æ肳‹E^Ò°„åT;(ï¦:Æþ tMǶìèŽe"ÃÀ oAç‘jòŽ¤Â±[À LÓÀ¢ *’!ÃÄÃ|˜¦ˆG1Mr’½aþAø)ÒœhÌI˶‚4MtÇT© OüS³ž‰’%Zë‚ Ñ Ðªf"MVŠÓœƒéZ!Ó:Hï8¼!©¢&Ã1– …w4 ºÈŠmêÙ×Áô‰DX'š¼ˆ I 6¢˜fÊi@ÒUULI!åºL,™Ž%X‚˜Orˈ#¢æ eYqCx ¶-’dA㱄$EÇ°ëtK6d áì+nÀ H6s Ñvl  ¦‰ Ðf’&bþwkfº¥æ^%Á14Å"g#X+ES^–DMв/µtÈ€§ ˆÊK&pÖl^”ÑIEÿ«ifæ×±T 9:9â°Â¢Á„CaªŽ&H©B“ŒÌ嫳éÖÛ!ÙuMål’ ØV4xM‚áȼcÆ[M±ÞŽSíØ¢“&;¦©˜@²@QQl[ˆŸ¶–ã4ÓHD…7EA4$8ÈA&²- Öš-©°ûid fÅ„+ptKeC±#™! °½š„òí=gÏÄÙ³ÿ9Õºè” 6®0;™³6´1·ý€-ÙÿÄ>’¦XÒzö¿N|nÙ>~Ùé+?L¶öéc—쀿gÿU§þ|ÿðÀµŸêë;ihldÓ®ý+Þ¸në¶ç.>ûøëÚ ·Ê×ýòä\}ï¿\·ýêÛF7êZã“Ÿ˜}öÈõÏ?yì¥OûÎw÷¿õòŠ¯læ.}äÀï|ýÓ[Fßøæo¸Õw¿ûÓo~ä;g>=9¾®ï¶K>}P}󽣯þÒÍ¿¼øögþóhùÂsî™ÚX6ú¸íž££ß?üÕïïó¹ûjy¨xÊÁ vä~ïÆÇW­ÿ³ónþùÍ¿»}¼úò·œuäýú§û£õÿýáÜCâ}·>2²ïÎ}wíá¯ýÇ=ïCwõ}æóo:vð¹ç¾~ß=¯ùµí÷XqöêÑ—n8÷Æwõ<÷?å¿}½ÓÈÌȃ§Œ¾oý뇭ÑW]púåö÷ž\uÚ·¿xÚeŸ8¹ïúÏl¹é½o_ô•[ž\ÿÀæsÇùÖºÿm×5öcùë6¾ö‹#7ÝðƒuWüà!½ºªï´>»rß¹w®®ÕÕ¿ðã{ÿÍ‹õÑ—‹7þéÖ¿¿ôªÉ'žr®ùÐó‡¾úèã·|ôÞ3­?üoZn›p~ø3þÙ6†ÿž{ø¿Ÿ&øÿTøwÅÿ<8q:àÿ½þ?ôï{Ïüý³þõéC÷©Æ.¼ãÁLñBAQÿŸ½kn´¸îfS(,yRJÒÉà…ÅëõC3ßÛû`µ¶vW[¯íHò.Ûnj¾§W K®$³˜áúGÒ mNJÒ÷9´(šBrÚ< ô4Mò ‡” ]Ò†BBèÌ|z|’¼ºó}–¼>=ûùH–¾ÇèÎ;÷wï̽3ýù/ßtûiß}ø©ùÌÍ{ì›>÷ëöϯ¿íÖï}ÿÐçûͽﹿyøå½s¿•¾xôŽ¾ë_|á©›þúô³^}çƾùË3oyµøõýâ'~FšýYßÕ¯¿õôÆã½?½æè¿þYÏŽÍ=»€.;ëß:|ٱן¹÷Œž?¿ñÍÓ6>tì¼û·o_ûÉG?õÝ×nY÷õï=õž}òÃ}LºÿÎKžxéð¦ëÞ~ã£úô¡/Ìnßk­ß1ûóç²ß¿õ½oÞÿÔ³¿qÚ©wþð¥Cï{ñÑ{Þñ'‰ÏNÿø³Wn¾$qÝOzçüÍïì÷ú¯ôôíûù!UúÑÙÜo­ûÏ-o?,ûðóǶ½þÛ/ãž#G¿÷ôß=tö­û·<1þé†Ë7jûÐç}ݼ yó)›^~ùÂÁŸ=vÎ7ÞìyàŽsÿ@+'÷aÿŽ=ó Ëûý=ñø ;·¾z׃ٹüÛŸyüì[n|Wzãüu·|gìÌOmøÚéÊ'ï¹ø«ò%¯Ü}ÿÿî[÷Á£¿öé;ξïfï¾~IùÊ¿Ÿõࣻ'œoœýdqé¿oÿÒÆ_éÕ6_üÀù=;ÎPnÙýüŸþæ>ö›žÿÚÝ¿»å~ø‰?’NºØûÖLê/þÓŽû É/üèB&›'±£ûGƒþoM}îÈo´Õÿ˜Äd™4éz·tRÿ¯Æq2þouâÿxHÓÒ¼o¡]þR('cOÆžŒ< xâc;û¬Ï Õ¨‡k¢'øw~s%„"pí °|^¨“-ÎXÄ“$[èw5Ó“‰‰mSÅž§˜¶ª™b\½Ö¬R'¢âw˜ÞZ«4œæz¥9xÅ?WÑí~éËÄÃø´ ˆ1ƒûJ¬R—Ý…Z2Á^`‹ ø‹UñlH–ÛI›vˆW5PªW4gç|ñ œeÉzœ·>„å¸á凵øz(p_¾Ð»µ+®´v5+¶Þºm %@¡¤¡P.>Á[íÂœOüpÿæÁ•ýý5y¢]h—²,ݼ;õ÷£åÚÇxÖ*šÅÅãÜÆ‹G» Ð.‹Ó¾ê|WÚ••ò½ž7<\5Ã:Åw ]]Ã|×Úµñ}ß­®²'ýÂúpL&1Œ;Âw ]_Ã|7Ú ÚCýbu%Õãý"Ž‰p+ÜO肱ÈOöwòG?d˜Ñê`ÝÄäÁªþÚ“þ¾èó…Üâa×)ò=„ 9?jÕÌ]AÿϺlß&.¨áèÀ Ù ä?hXи^˜™™˜àïÁ×@óù™à¹ Ž~Ô°¨qú‡ù‹¾7¾ZÎ×¾±÷¥¦*„¤6,lý‘Ég‡VB?nXÜ(ýK×^{íÒµþ{ðµÜùÀûð ­Å¡Ð8F?Ú–F—Ðý´¾Æÿ¼õÏU^Ûªï£h飾¡BÒ€9ŸþZÊ-¡B…N—¾rUZÍåégu<´¡©áè'd!ÈäôÇ9¹ eúZ¨Òš_ž~V×%^€…¤À_"†¿È—–|þ’_ŸV§~ú‡êô£¦ „¤À_"ˆ¿”Ž=œšEŸ:.?>}Û¸\¡Êùý~aŸ¡`BÒà/Ã_FO²FY•~ ^Íï I?€¿D—P¦…NQú*’~‰(þ.¡DtúƒI?€¿D—èÛR?¾ú—9ßpnØ—šCýÕ „¤À_"Œ¿h-ÍûrŸ§¯4}Ùh©°„æÑÒ ¯ë³ôe¡¥â2ù;íëÃUµãYxúü%¢ø»qƒdl¡N¢ÿ¿ñÛñþ‡y¦Í·:öUN×Άä€åDË;v„£_°\ÄòÑÂüb‘Í ¡¾ÑMÔˆéh:Ÿå#åE4e³¥Áô‚C}[îá%'RÉxGè°\ÅòÅË%A,ï“éÙ…’‹v¦ÇP.k»ù’»iè°\Äò”ë°̲ւ¿†•‘¾ú!òg-?eeóld˜”üTÖ‚¿h_a¡~Ë%A,Ÿ+8Y/k›þ2l'éy·8—-³ÉÄêJåþrÉ<å¶ËŽ°um¶Þ#ŸGŽÈË%A,gϹå‘‹Xú,—„}éN!é°\Är<ÔÔJ|Ç{_öí‚C[g¡ÄæýËfe}JÓbvMïæ eÚëÂÒ`¹$ŠåÈŸw«f§䚧Ÿ7=­'-";ç‡VÌ%Aü%­ü§|è›*ÿigvlwÙ&ˆ@¿ à¯,êK£šDi‡ê&HáéðWÇßƉ\Jí0Õí>Ä;g–ÝbÖ̕꺔+>ÿh´¡ðôø+ â¯4„Øú²¬àꊼæ…%Fû"Ù±\†h¿vóN¡Xâ«ÞÓúÌÊl‘{&VåRhúü•E}iÊÊâ+)•e†Ù’ù¯|„!CaKó®Í`ŽíÅ€·È.ïC]©ä7@Húü•ÅDzOˆþ—ü•ñ7³'™FéÉ]™ñTÑÏS©ÉýɱÄÚy^L øtfÏd ]vY⩃LºG''Ò‰OÓ›èE4ßßMÅ¥¯IÊBÒ¯8¬âp³pÓn<:JìcíAe+=½3If¦3 ´{rrŒ÷Öt"µ?9šHoA㓬ÿîBÓéDX;NpXÄá±x&ιL §BO‰br3NrñONd©ÔôT&99± í™<@6Hœ<ÆûÉä«ðò£8¬â0•öÉÔAÆD&é¼ {ô|Šu*<™Tœ z:“JŽf‚·Ñšf&S™Hò¯8¬âp]ŒÑDb÷xrwbb4Á(›d58L'6Q]“L³’>³Äi}§¹x±¾NÛ‚} K?€ÃŠ 7àØWD(¹ ÅÇö'™ŒTh¤*3¬¨WÞ+F÷T:òPDý£8¬ˆÏ)Ÿ;BðWÄßæ(º¾b˜PG-Ï93Ÿ_ÈQsº~g5Ú‚ùlÅÿhôø«âom#ÒÒ:P1/­Å(Ã!éðWÄßQ×)Rûx§Ÿà ٘+oñOUNïXœ/-8C^qãly g|‡j °"ˆÂã……lip¢àæÐTaÁ>ì–y-꧇æýÓ;²yê—U+Ò¡Z¨«â>q‡ŽôX¬®~|×p¸ `¬6±X¡Bªmrž»Øn©T(önßÍÛ¹Çå2Y*;T¿ f®’â©m¯==ÙBrSÛX[rØÆ›QèIU£È€j”hSÉz^)mØíĨä J¹á9Ó.JþBáù„Ú "‘®êÒ+û§F¥€µ ,D¢]ÁÚý°òh”kh±R¨úY‹’Ý¡:Sq`†û7wPé‡ã4 ž5ñÄåZŒ/±Ï™‹õý×:º Î51¦“G8ÐÕД(R hq-Š×ÛiñºRàO¶*… ¦«IŽášé¨X×lÅ"’k¨ÄöLâœ2]óÕŽ×fW¸‹G EÇß0‘mIY¹µÑJ± šÃ‚¨-ì`l8ªê¹®ÉÖXÕe,9¶*›ÁÍÌùª§Œ”>`žY6ÐæW°T×}•2üŠùçtüZdóÕD”s¯ts›Ðï 6€Mz#6!1.]t#‚Œ€â7bíªTW¨Ã¨ž)èOÒqÖ…êšௗ+éÝNí*û.GÛ½ûr¦>]ôÛæÍ›©ÇhÍ'ôøÖé^_E†ƒúF.[v‹&Þ¿·P(oY:Tö?TJÚ$Úz˜R‘4¼! ·BÖ«5ï•è‚mhbz|\”ó€ª6”s~óà ª+ò¡|´vÔ¿¡ ³ÌÍ•Üp°õ ­#LbÍæ«Ö¨<”§¡G‘U@'ÆÊeUp¬½*¥×[â¸Ê4Ž¬œ™¿‚opJ‡b ¥š^oO…˜Ýæ«ÑÍ8„"Å@b6½ÞBÚª©R d^Óë+îFÑ:òªéõÖ+¸½z¥×ÅvŠ±‚£?Û £°Pª,6NvÛ«Qz½• ãûõZuemUQ$ÛñtâŠlȲͶs-MÖ±¤Å*ÛßV<ÿ€ê7+¯Æ w¨!S”í‚ajž¢)8æiX&²*G³¤˜Œ Û•-ª æ»<³-dy7B›–†öêž^_ã<’MKV°cK®«Éô¿smÝvu'†±n3ñ^S.TYGí¡†^_ã<’tÓêFÅÉÖ4—èس̘jÈ–5¢°a¦’m–Ë3Nv.²µGNz}ó{®DtŠŽ¤BdÇU ¦e`ÛÕ«w{®`›¹•ðÈYÇxD_S<’-EŽI’!ê[Že;ª¬*¶3UjŽX^ïv³X4« Eèk@’=ÆÍöÆ5‚åÆBsò»X¡Èãf?.Þ± Dz¶ÁBÒÊ1÷¯ û,Œud‹c¼rg+ªm$‚cÜl¬’e$xã¦oQÉЫ9íZ¬P@Ý7çB Ú6ÁN`€ÒV±Cb¦gi¶gyžªÛ¦c»¸X®%Il¤™-rÑÅJ›þYŠ$ÅÒÙŽ’lY²Š]c“m`\ììø¤°W $bÒ2æØ­qÙþ  ˜h÷pSâž`Òéps:X¡”5縉 à˜PâÙpGçKB¡x†EÏÚ)×dKYBSUáç«0x†Ï:y„š¯Â@ænÎ<+@Ôæt0±B8ÊÑ:qS³ÈÑÂ!r´š}î\¡¸ˆøc<ïfØqë_Ž+ö!éT­`ŽV'p¢$iáæ$-±B­Þœ9%ThÛ0vËGREÃDV‰nè„fÌT¨5³HLŠé§ŒÅÂ7[>áÍ {¦¦^¨¿K7„m h+-óz­*ÑÖ0¹9^¬P(•fßr2=^Ýe²:eºÚËOs÷n/e¯v Õ ¾På–Y¹›DÍ; ž+ÍÎlWÇS‘?e#J;€¬J³ÇÛÍqN’vÀ•f—¸«ã!iì¥y»«ã‚!il¥ÙëÚx7ÂÑØÍQëB…AäXm@Ò0šUtË Å|Õ}£ÐHpÜ .èdáÙ8Jx6³qsx¶P¡mƒ"ÌÕ$Ø°(öÇ,Û ™~õˆBmTªU–{ËV+$]Œ³dO—UÃÔtÃu‰D\Kr¶tÕ‘TÂb‚ëÅö÷æöG×Ç^€XM¬µ.îltw‰µefá¹ͳ©[`P¦³ý`ÙNϦILÕ6Ùó "5ÎEÔ8ßU5=€@N¬-3}½68Ò4f`h‘¦ÏWƒ!aí aŽ–†i²|58ÖŠæ`¿h‘¦ÆW¥Ó„°„¹XDZ‹H,"½uÖ˜qÄç†(å:`ñè§]uÀæÑIKJ€Tbôè"êr”BPÑEò›Oà¦`€¾òu¾¦ü4¥àp}©Íí!é4¶.–ßÜÉ#Ü&#€õ(³·@è?ŽúOÚFÛ 8 º‡M»¶£(1C“-MRÏÓ,ËÓ MóÂBöVe S!’áêÔ±L¢P[B³m;æÙ¶¦{.ÖM#Xhe÷¼Š!ƬörI– »;®sĶ¬ºý¨fýÎÌÓje¯L]É[3u»y@°í…“,'X‹ªÅZ«„p-j¶®h%Úw²\äš`%jVf覨ۧ‚µbËÈr±e‚µ¨Y†¡kQ·)EkÑÞ !-Ñ_âµàÖ\]šÚ>ÙX ßõ¬ iFpsXzÔq´­›“1‚Z#Í›²ˆÚÞ#-!m]@hÇæºË⪔ê§;’GÝ lKš«x²ŠmÓÐ ÃmtY£Ea7¨bá†hoi’–x»®Î>t›g-ðTüÂ,koÜ’–8À®Bt›e-`Ô3Â< ¼ª“-ÝæY ô5€š0Ï3 ¯ê$O·yÖ´uå`‘á–,<¡býoY…©%lbCH”©%l-Cš·–*´mP¤€C³dÕ–,ÅsdËS=‰†ìPrt×Q½˜Í)“V+(EÕdGñˆŠ •d“zsŠ%;šç™•nÛö‚…Ú¹B~uæ„$J¤IJðê„šÛ%@˜)‘ZŒX±bkQZ½0Dr©u¬ÊÈovQœDj¬âÄw1RFUL"†jXŽi#¦¸–¡+¶¦ªc×óH#ªÔ{áZ˜$@Œ+‘Z§ÃB±ÛÇ‚Që¼[b¢qÚù·¶Œ.Uî¬O-Tnlà¯Ü¿¯ÜÚ:Š^¹50H^¹µÑƒ®ÜVq¡—gí [­ícô<ß5fdë°Å½¢ ûgüm‰üV¨ÎØqV Ù#µ™5^< ª>ã{`£×VÃlX SìWj»nâÂÉ +yüÁ¾à5ß)ìdã1ï¼ÖxU/Z¨ñ´ [a7ï á =c«·û¬mx¸¯ñzåStS¦41Xb™²U©µG$–+Êb,UX Æ ‹CÙ5i°·E¹x(ªœâf6ÆX¬Ž/§‡GX\Nh1…×·ÓˆkeŸ,.µÕA} ôA>áØ~qùŒ’' ,Ÿ< ³»2É5j2YM¨ÇMpí†ÜŒ²„0;—׬ ¼íˆVme3_9¹Êf=JχÙvXV ç×ýcÑ^_}¢ƒ=^ ôø^†lˆzµí‚[„ìð€½xGˆ6øÖ˨$ûvT¡(¯¢–0BÔÅ9P«ãW>¢Àá€ÀáÝ]ï®pYîÚ8h+ÚeƒOu‹r€‹rÃÎâ7Ü£e„„°Ûk`ÝU§’ ö91Bè5é„'¸Ä¥.+ óf¢Ò|ªƒÒIÒÆðÁ¢zª¶Jåg¢ô0Š&Dˆ‘e¥yì´it³ó=Cfé—õž!k˸þ— ‘W4gYnÜ8mòez¶ÄN¯çgJe³XF^¡@åIbÙ¿t¸X%Ø¿Ô;L¹î8E·Tjº°}k‰áìöõ»+¡j#öÑ×Þ…""4–FduDÑÙ¦|õú¬ET‹hñë~¸\ž>räÈS¸j‘ry¨PœÎæ÷ªŠ´­ßš›m"•Šö¶ÞêóùÙ^dæʵ3”úõ|öéC*ýè“LOùUbW­‚³Èþ³Ù¾¾çÿõÁêèl^×a“[ CsŽÒÑ߈1)–eökJ,øß?äÿcïZ€#)γ0 ÆâY)Ç> 'w²;Ïݹ;É’îNÉ¡Sé9|g1iŽÙ½™Y鶢£»PØŽ §0&@ &®8€‰ Ä&×—«\$©c\ vp‘Ø<éÇÌîÌ>43»+iuµs·«ÝÙ™î¯ÿþûÿþîþ§;ÕÅ°‚ ðȹ.Ô1SBHµE£€Õ€.…î[X÷º¨ß7顳â4™C"]Ö¡ÄJšÆóPI+:‘Ýh|cmªöŸf‰qme«·V´ô‡ï´ÿõ8v]4¶töÀÔ8Àµ¦æ.Ù71 zú?ÉŽÍŽË÷Î^ºñe ÌÚrÎ!~ŠlŽOö€ K/s„ g§â´|³÷±ß Ü9 ¹æn’áѬ™s†j$ÃH’Dï&×BYCoŒÜtm?®¬ ÇÎqz€ M¼nrÑ„Î"„nÀ]yåÃà¬Õ6ònð—Ãò’LÏzîÐá#h;8äþïF­˜s }θòî^ßÛŠÌ«PÏÕÂ^1î¸V¾‡º§šr–‹ËZK¸‹†ÐEÈ«výNËAÞ%r½¬/¢¾j),SÙ†2Ö$M$qš¦“—Uä4õ¤zÈ÷0M?ØM3ìy䙪"/’¢@ªi]HIžUùŒ¦dÖ,õ6p-!L’…¤e2‚ª±\:“Ñ!ɺΥY™Õ!Ã2zy<¶¡ä5 #g$Ž•%Aæ¸ Ô3ª"AŽ%I•/yd+!âKduK¹ø2®îà#£Y¶~^®´Ù÷”tË;í²YÙ.b«è×ôÖtP›è'W@Ô¸qƒÁ¶€:ËHyX~gà&lÓ5¨÷g!¶Wè®Yz¢Îåx±Šòµ»ý¥+he¸„ @ìxOÅð=WŸPqjeM,ɉ¦X)(eÒ½+OJ³Á‘—žáò6‹ô4ÀÁ˜ÀÒ)=áf7@«+_fš -ºUÓ!Œd‹‰() ¢Õ •êÁáD‹¬Í‚mò~…–B+« çÜ]Uw‹ì0a ÊŒ"Ã…Ù^Î¥“èä>ÄgxÔÄX@XÈŽ’=`ÉûJÚ!9øFÒ¯Jd:|Ÿb¹®U§a`Y³Á™¯n©0k¡w )E>Xþÿ—ž8ƒPiba®y=UµRQåæYC²ÆŠ®ñPIÕ$9-iŠÆ©‚ÈCȦt¦¡*ô`¯*“VK+«ÞëqnQÐ ºXn”z$^lý©QQ‚,¥9IÎðdQÆ)AƒPL³µ”,'[×½¢@ïšTUtQƒU•UUIÅ×vM=Ìr¤¨.º¡gTM“T.•IqLZÏ0:›áyNaŠá3R 6¤?xönMT mPJ1,À Ké««ÊÍ(™vÙ©jI%ÝŒUH i\UeyäY*šÀé d5^ãtYÉŽ¿mT«Ñhƒ2_ŸJ®Ï¤2nÊÊKLFN)‚ ¦2¢ªe•#­ò\†U¹´Ì5TŸtêpmLu$Þ À²}­Ó©Ë¤òm¦.yQP8]ɨ)^euQ„¨#Æ#· ʪ¤âá£êr-Ķ&š]úf؈ï¨bPmí®Ë¤òm¦.UuYऔÉ—UӪijB&“uQ;¹ë2ºôAå@:°-º“J¶™ZÔÄ´˜–DMÊ@UH¥^@šÂŠ’.‰ £Hj{±e4Ú ÔýP«²¬IeÛL=22ä!Ï¥%&­‰¬(èPÏdÒlJÑÒ¤+ªŸÄ­1ºôA¥G¼6J1’VVSî0 e6­ l‘‚ ¨œÈ¨bZæy J £7f¦‘˲6Þp$Ø ´á¿Ó½&õ¸aÎuÂkF;2¡"¥¡ÌáØqŒ dYH BF%+·Îlð¼'6–W-•R5(é:§@YÕRbŠxœª ãý~°Ø’A[—U¸††#ºü¡Nµ(.“'oÒ!–îzc$Þx'³ÔF${ï‘1‘î²L䜺ˆ³"±¡1FƒðKp,ßÓ¢žª³yÛr­òdYå8íöWÍÞE¦VAù«Vum“ƒr½kÒ’½©aö`¹³ÃÒÑ,Õ›ý(Ç¡™n¯½ Ðê0c*CžüÅs"x:$æÝÉ|÷™@ OtÕÓ’û›VK¢•¤ÑóTdcècak¡$u¬? ›ÀüÄp‰6N±ÖÂz€*„u…@Ák¶WôÁ§èªÐk쩯’¿'!˜.5%ôÙ§iÏÝ©(Tsµ‰jÙùÛ3ìð&‡} T †©9@Îi€.]ƒ>ƒžEÙÆs ùb؆Þd·¹““ÛqS‘s¡r†çz®wÐigÍ IÏChîðTð¹Òh(SPýë»}%¬”¬f ¦ô)#w¨Òç Ƚ$sOܳ‹°ToîÜ»¤ ,£ÿrÎÅá €€k¨2©¯‘º0CEõBÔ<‰Ò"OSé–Ê;R‰ƒÖ™½¯j€æE³JjöªÁañÖs¬Èų{Lm»§í^~¸ñà$ŠµF‚°ëˆ;X-“s!”ØŽöª”„›ÅÇʱLw—ÂMâ'Ę Ø8s^zÀ.8­ÒŒõ¥“1Ií%VJb,û@}ƒ¸ZHzWÁbÏp´‘Ý,ÄQëÞ(yÔ,~}âi9õ©G@d~Ç¡Æ>Õd—²uÞÖëÝŽçV-ÄMÄzm£ë ä-Ç1³ˆnЬ‚»½Mxˆêr€„æåEdˆHÑœnÙYºü¢ì`NP • Ô*ø§µlXM«å]‡ûš&$²a=Ù•~ƒ )%Uy²tEr=Hµq? Z5P¸ÙÝké»iy‚ªa=¢ð»'ÈN!{é¹ÉËVµC=Ϫ:H*`›G+ýˆ·÷]6äg£ßm|f£¦‚lÇ­íçGÚz/A=” êtXÈ]ŽJ±5½×€Î]gWx* ì@'¦¡ÊgÀ,þý'xÝ%'UÝ®ÀEyÉ°ìÊn”•'©lóÏyëCùˆë ìÈeÐ 0†‹ˆó¾šÞIUJVqbèBCC*¢œ6ñ.Z§Z±²c7PñZÜÆ]F–®e¶ž~Çfî»Æ˜¶o£¾+rØì®ÍÑÕ³ÈøGÚm##6äé=”eÉBõ;pëh3ûP°å£ƒ´{„‹¿^#²48Yÿ»c¤â©Õmd¤ŒÎ[ÛØ”E8n(t²bæ¦íò«Ž j†“7å¢Óºá@t ºbY.¢œ!v‘™ÒüѶBNC´ã¢. .Řp÷ä.€Ÿ÷fjé2¥`]­§iÙåŒe˾ ,î"íô žJ¨„N»ôN’ñÈÆóöÚ—ó$Yç“+}~åˆàåŠzŠ}Ä©²ºHÈ{ˆŸ FJÌÉÎûdð·r ÖàÚºÑÁiírÑ\ !¨)ºÆçúuWÊxëñ‰jCÔOñ¬¹qÙШ–mC'oåðó–•€Ò¡X £Ö S¬éÿÚ°•©™kk‡=H3áØõ¶,ïOz¯}øÐu³_»pêÅâòÝxÁίŽîòÏÞñÒ]oÿø?¿ó±Ã#çv¿â´®Ü̻Ǯ‘ºöÞòìç·¬|üµ'uê™Cóßê¦kï¿þÞSŽ`o×ÎoÙ9ðò+—Ü}×õç…ß>åñ<þÂÍןùõ¡Ûÿòø§t‹ö<ýÄùK?øãï<óü_9ãÁ›¯{n÷wºŽ¹ð^åìC¿zß9é×þ¶+µýEíö¿ï¿û_}ôØ”þò=ÿ|àøÛžùî'Ž½õʯ³ÿòÎs·ž÷ú[?™¼yâº'ŸþŒúÓ'ýè=÷ÍÝôàÄCÙ-ê_¿ñ›_þÉcÏ=uÇ;ßþÙ·¾ëJO]üðiÿwÆþW.ïýŸ¹¿ùÁu?ýàÖ;tßþâmû‚O˜wýzê={o—,øé-÷~à[·kW<`¿úÅÿ8Ò5ñÙßè²;ÿ׳?ßç~ãð¹ìéì9ú»ï_ê?mß]Îÿèæ òݳ'&»Þëèzíñg¾Ì˜ýÌ«o}Íú´šÿ‡w{{ËÛ÷CåЗ¾{ÍÝ_ÛuÎõò»ÿôgߺå¥gOýrñ–{Îþºô…7ÿüÍÿÂC^óú¿õŸq§þø³É®>wbüž?œ;ö¯Ÿþ­[y>wÅÝ…—>xÿÜ ëYÏÜ÷ŸÊkwN>2ðâUñüáÙÿûèG/|øÿþ;Œo^vâû?þå×o;ó{onéúöö7ßÛsê5·ýòýþÁ韘ýó£_ÂÊ41>9öÀ%W^·‘ Ý9!ûO|õP§%y¬jÿFäD¦Âþ‹¼Ð‰ÿY—£ÿ³>ñ?Ž9 3`†´/°›® Ó üéþt6GàO)x¢`Û$¤¢@UòfCòf ¼6ZÆ}è®8²Z0-E6éì¡ç:¡M¡Mëtà&"ŒBƒ²þ ÷Ë$F nE%ÅX!õ Å ¤ªÛòB–6ÀYü@L æÅ$ z¡¶.p]ÎêƺÃxå¬U…0ÕJ”H” %JT4x©]Ð3<Øû±þfÞÞR›ˆ…‹ÀÎ…R7i²½½ öQùÛg(¶lë\F’H†ÀÎÇǾîr"° MË„ܼՎ¤ØÅìbË==Ý”Üw“Å×— íGB¹Ô`ŠdS©LK䞉Àžic¹KØ¥ØåȤVÏ‘IÅ‘V²,#Ø…aâdÙÛÊ#þ"cØXøA¹£9Ø–oAž3vÈ„PÞ2‹‹P³e¾e’UF]Ù¼ ý]€d%¬¨ÉðG‹Ì6Pþ„ÆÄ"4b—úæççûúæûÈ{ðÕWy~>x®ÊB%ÃAjL,R#øÉ ½†_UçKßðûJ_Eâ 6&±õ6 ÿ;Ø þrcb‘¿rõÕW¯\M߃¯Zçïƒó¨›ÀApL,‚ÃøÁ°2º¦Ð§!ôÚÈç!òm”žó^Cþû(X9ˆÑ‡j !þ’câÅ? VÌ`y8!z™>V¹6~\ƃ[+ ?A™l,Ê$øGNÓÃé¢WÁÇš«—u…  B ñGð/Õ–\¿CË@±j!üè(ãHˆ?‚Ù˜ü‹pì%hŠÑŠoˆèðΗðÓƒ?Á$ÄÁ¿l<þÅx&JÈ|ü €^•ï¡$ÄÁ¿l\þ]³U8ãâ !þþeãòï o° ñGð/—WÐÛJ/y¾zkœ¤Zs°×/@BüüËÆæ_°¬ä©ÞçÐk½T°b­€o5H›üµ ncø#¸œ‹ÉåYK3tC%“}d#È<´³†‹',ó¶µdhx-1² ÞHÅ2MkÙ[œS3èJ–áàr.&—cÄYèîhZý“âàr.v_ºUGBü\ÎÅärf ¢ 8dŸªû8d Y\öVÁ•e –ìnÎrQ«ïKŠ?‚˹¸\輞âÅÈznXéQ9QFÚMË?‚¹˜üËVËÉ9`o|ù£Æ¬TX³ ÀÏGð/·/ J ÐH=øK+'ÇÁ¿||þ Oä"´ƒxi`2Ä›•]h²é”m)1þdþ7PiÉñGð/“9º&NØ_ÎX. ZÂØ‹$,oæÐ%aN³l¼¿´Ë“µ\¼î/V+×IŒ?‚ù¸}i$$â%,.9€~#s³{÷Oƒ+¯™A?“Þ í²ŒLŽ¡×0~ùÔôøÌ @5RŽæcòðÄ¥Sû&jTŒé‘ÉÙ‰ñ™>äìî››˜Üóÿì=ýoÛ¸’ý9…Ö¶{M,J¢>²iðÒÄmý&¹ÄÙîâp$‘J¼u,¯?š-ï¿!)É’l‰”¬t÷5ÐÚ‘ÄÑp8Ÿ$gøZ{{;Ò..GÚùðãp._óÞm6kŠ¿Ä[Švøòöqp}ú8y;<Ž~ã~7]0â¾êžhW'×£áéíùɵvu{}uyãv6¼9=?~œµÐC;l)ÚááÐWü2¸i7NÎÏóÌóv„?y{>ý¦9^NGlˆÒ_må@b‡-E; ¼\Ä?­Ý\ N‡ìÇà×ðÇÉõo¯wŸ^^Ü þó‚›ÚÙÉÇ“÷À.?–¸¬!þXb‡±¢.37ˆñéíõà#à­›Û·7£áèv4ÐÞ_^žqi½\ÿ2<Üü¬_2ù}§ÝÞ šúqXb‡±¢>;p*âÀô€ã›Û›!gÿáÅhp}}{5^^¼Ò>\~Fƒ9„ϸœ\^p¶jÎ?Xb‡±¢n¿¼þ‘q:à×Ú§¸~Í„˜gt}Âýft=<僞Ž.¯G­øKì0V´Ãk6Ö.ïχ阮Ù%ëÁ§áÍàèšá {`(ˆýéú{ËÙ‹É:ŒûىƊv¸`Ç^sE¤ ßi'g¿ $8‚ʼ&ê•KÅé‡DZê,±ÃX}Mù/ñ#°ÄþbEû[ÞE÷Zó!êÀó|ô§ãÙjîôúÉt·‹ˆ¿ôÛá/±¿XÑþf…ÍڧĽ ¾¶™–hˆ¿ÄþbEû{JÉüã·"ñ†#òÉògqù ¹üÏÕþl±"Ñü÷ËŸ9á;ê…Ä cE+|¯Æ‹ý‹˜N´«x>Ð%ïÅúòÁL\þçx qYÚ‘ŽzaKl±­wôiˆ¿ÄÛß~W¿Y$ÆØ.c5  i›m€JÌ–]c¶f|2'¤‹E<ï¿GSB#íòæüîft2â.Û݇ft“!»Æ±I_[ƒ/;‘@ÄêØ5Vg;Âj¯• »ÆX”©$Npý´X’q|ðÀtQ3|$Êß®Qþuø¬6Ø n¡x»NÊèÏé„Ïy‰Ú ͱ—(}»Fé·ÃÞÖ·`Ǧ[vÁ‘h|§Fã·”ëB®PsÔ%ÊÞ©QöíP·¬êÙÁ"mÑ—¨z§&îj‰~žyx^*8F-‘—˜§&èªDþU\‡¾‘J`Ò¤æ»å¨Û-eÌó“ÆýB-Ä6ýX<·0êŽÄ*9ÊV ˆ%v’üxwÎ&«û÷ªY'%æÊQ6WÛÌúgúõ)ž1,óiòH1õKœY5Ã>  ¨Ó6ã%±tNÑÒiÚÿ(奯 § ¢S2ŽõÊ•˜WÙ|4{­Dõ»m²ݺZ 7o™WK©VeïuEžgU—3ŽÁv–¼R­ór*û.ËãU³ùíãi¯^úF`Gnä{¢ÈŒB uÌ@÷±ƒ(²Ñoo£ßšVÝ+dçz•y1³´>[=-TP"ñ£?ž2xih¬F,¯Žˆ…#/ðˆg؆ºÈµ}“èÔ ¦vàQ6S ¨xú·$–%V‹‘-òNïS‚)«NˆøØwÂÈõ‘ȳúÄ Ï7‘Ãk b¡fÄr¶‹ùÇê“ãå‡Lk%ÔR$V·§@,‚\lËBß°á—DF¨ƒøFˆ(3ŒXF#bé¹Pè.ñÕÉ$Ç(óvÖ‚¨H¬:ïRX–Z”è66];°¬À2ºáSº‚Xæ6bmÑÖâôÓ/ñ˜¤ÂO*ô‘#±ZÌó**÷Q$S ¨@¦ÐÒªëQˆí(CÓêZ–g˜¡bvN##V$S'FM‰²r¼§Àz‚´Š””ø½^Ñïý·¢GáÕ¹¯Õ””Z€Ž:ŽQPÒ^˜Ž‰"9!1 Dœ ¾°½â€PŸƒñ1xä[ÝÜ.Ç°Nålov'K‘¨íÜ´Œ¨^àz6¦¡ã÷8†…-ÏrM›"‘ÚhUGî[µN0t­HöY²Kâ Ïkîr#½>|€ûm€Öp_a ÿÓt¸Ð$¸A’j%pÇE˜,ç›íà›Mü¯ëC±;X„A’Š%pÿｃ$eKà¾T1lú yë.—d…xàKy4äS[à˜È¡fÀ¶l%yLV\š|7<h?½ÖJ’þºÆµOÓ*O¯TE¬~ò î?;…¨‘ÈÑId+Ò[4Š˜Ëîš‘eA™B2)w½ÞU€ûÏÞuˆA0ŽLêy`}„×D#Ë@Qdo¨ùÙ|,ÌH wT‡TfÎ(ñùza7” V?‡÷Ÿ`ØÇ#×€˜ÅÐMŸê^D¢_–ÑHÙÆ=dôRî{ý¤Üocßê-1ÜW±o}íæ4¾:ZZÊr</¿6R”’ .¨®‚KWŠÒĦü±„Ä2uìx¦E]ŠÌ€¸öæÐò±½[„ñl2jeB‘o£TR¦Ú*où<ŸPJ É r!5 ïTݥߩáoÆλߠºKõçZ )s¹Ä§!þ«¬XÝ¥ËO3ÇKRÞ•Ê»”VI]X–ᦋ,„G-Ë ½È5ýÈÕP›–†« %jd2½e«ÃB.»u¿$edP©ŒL :Ešñ-'²±‹‰n›4¤ØÖ±Il¥~–Ȥ܉},דQ*±å"/J@%•WRå•¿0¨”T^AÊ•W6>é#;lØŸLb‘„Û'týGµžkˆ¿Ä`)V^éòÓL·IJ¯ Ré•2kEÈ"àø8˜8&‚(ÁðMÏÐ#ËЉi²9õ"ÐG>J\jUåURÕÕ_éÈásÃ6 ¶±Ró<Ã%–î9‘ ÝeŽ`¹—ÑœòÚ¾?¶tá%%[P¹d‹P‰¡+×QQ*± JÅMþJ%1ÊÅM*?Wb»AÞýZÔ<ÞTEIìŽbA’.?ÍT”¤" ª«HÒ‘t[Ô1\×1]ÇB…(ò¡˜º„G-E1ö Ù&Ü;„ì’²&¨®¬IGD#2‰ þ–K8 ØuÝ#x`:¥””‰²>\n#D·~§¤d ª+™Rñj­!mFaªûÄÆ"$º°_žéºÈÙˆ÷Å »Idîl¸Ež±‰M0bÄ׽Р‘íP¶X•úNâéV£ÖñpK¬}©BK‹žƒ³B"7ÔßÀüÚ–®‡¦ãbË¢žµaÌ+;®Ü%‰5¯+ÚÒ»®ï;¡é˜bÃt@áéÔ°1Ûdâ“lô™þ±ò'Û»-$ÞG]å—Žˆ`âо ˜~·-º¡é»¶M]7ƒø’…Ó÷óñòë]ø@ÃÏ߀÷%ÎT]u™Žhd@%_ùðš^èͧf芴õ"î)¨†àŽoU]ÆóÅNr"ñÅêŠÓtµÀczØ·\ÝŽBËËöÛp)À F¶m뾿IèÖΫqŸäQ{N‘–¿°T(§Î!ÝøtÜ!ÅçT¹HRb•KìTïT3rSklÛ|²MMYݘºk Ûó‘ë〉1ØšPHØúYäÐm¼Ä^³‹Iêó r}5 ¬®hÎ3lÐG’"8¨®ÎÖýßšöoÅ7Kœ“ºò5;ï{G’â3¨®øLã|CŽž¶íÁ\Ø^‘”¨­c@9›]_.Ã?š)9둉ÓÂ>£" F7NÀ®ö, L‹/!4g[­ m´ŸÊžÒöö`RŽ‚ã3FG^¸ë𨔦/wù2Ý–;Çå0Ý:Æß ¡(Òï’3³dôÚ¾¸PM …¾XÖF_X²@.¯í0Ýׯҧؗ,®”B§öCO¸P¾O[ŠIƒ=ß:<\o¯æÅ-{е´]‡ü‡Jü‡ZÐR¾™[–rX%Zö‰×“3Û¥®åuHK£DK£-å¿Õi)‡U¢e²§¼šŠÌ!…ÈŸëpf‰pf ÂÉózÔ '‡U"Ü:eHQ gZÚ¤;22ý›'cýkºªú7ŸŽºÎAU{KæÈ'­Ô}€ö`õc•ŸÚa3@‹ôªý€âò€â¢rq+í,ÏáR 9¬’`ÓÔ…#߬C=£—ôŒ®NN¬, Yˆb}EŸÎQöé*“Õvòël}S¯ u_’j‡nN̤^¾ëV]êÛîà•Ø¶ÍF•»8;”tdëEIGvÖ\ÓW:!Þ€¾m'×Û*Õ­:µK"Û†[$²m4¶ å`«:§Sc_ Ý}ÉF¾¦Î0í×Öª9 jÙôòVÏÉ&Ø1JV×iàÇg¤•Ï¿«“¶‹¹ü&D.·Nr;¬džÜÆ-È-ßÉ­NîÝw…722ÅæÕI¹ÍÚ]€á–Ô¢ÑJ•È³$Ô uÆE3º³Vߺ›N‰ÅM§ ‹Ë÷®5PÖ-÷Á5"0kô¬šºlÐqƒžÑU¾¼£N×]–Šê'±nµEQ³ÏIe×,q¯k6à^d*Ç3I);¹Lmc’’qâKÙõËj¤ê£5åGéî†ü¸ûN‰&ŽC©ù³ÏØÅ™Cpé›L®i¾lç¡mîm#Õ:®‹L;'3¯p‘'3«hјÊòÄSu*·Obmáš}s— y^i:Àk0•›\¾WLà­÷5Q¼‘|£Z— Ä*M±ÚV«‰-én£/;ï\jÄâÅæ[56cýê¯NƒA· º | ]yŠv[íªÝV÷Ϛfn@»ùRù~vu¶j¹7¾/A•½ô]†¸d™0nbš”»¬rò–ªÉMÍ 49²l™hÙvŽ–µO“4;EË-"\h#.Ò¶âÒ:®-m„;•½ ëmdyÚs÷¸m u[²Îr<+TQ.¹ºsOÙÂ¥Éc 7Ù¢lÀ¶T³V\ÆDÊ˘i¥õ\•uŘßVŽù·U'Ý-ìw7œiVi½{È 0)»†²KQÞd¼S7ŒnèÌ5£}ØÄ)ʶÈëªoÃ*mHK*VKqÅÖKÑ°­|nÙ€K[ÚÌÄÊSìÔâéz|³¤]í”LÒñÇûûZ4÷ïù@ìïç.‡1¨ÐérÁ.ïñ+q¾Ô¢8ÕªÍØo~ëažb&nõú@Bæt±(Ý8>Z0x¼÷ž¹Ì>;~;žjáß¿VÍp4CGXCæ¡eb—}µ>+øªe)‚ÂËåì°ßzz: ñŸ_Á ?ˆç÷ýñ”Ð?1Ý;?Þ—ÐóðM/m1›Þ÷4²Ì®ö{+&'šö"ç‰U>'»ÿôsôÃÙåéè·«ÆF]»º}{><Õzûýþ'ó´ß?i¿~}<ÓµÑÜŸ.¸f÷'ýþࢧåÅúÉä=ºîÿÉ`!Ö8ù¹¿Ìµ< K„¿ðÏÇÉtñf äyžhÍŸ¾éô <»OÿX¿¼é µ·?b)M©¥ &J4þ9|ðç º|s;z·ïru±ä×ýÛ“ý´hÚ$g8xã­Ûˆl‘{¡ ãyî¹3¡„â –ã儧úðPËÍj$å:µkÑ9²Mÿâé½£Éxú9Ñ—K?X„‹EOG‰[ñuB”.{ËßJúÈ`¯[„óñl™¿ó»ÿÅWúû+:ÿzðû‚§‡ð;j É×é‚ŠÚ åÖ9|S­„²ÆÕv2¨‰~f6“™õe<ë ›Fb~Ú÷œ>²³áù1Úð˜Ç¥6fÆ*fg€ƒ¥I^ýƒ0pFSB Æ?@Í ÕB:™,À䎧÷ozzÿ=K‘ü}¼§-6ðc®ñoRv"ý¡†íÙŸ?³‡à&Io&Í÷'4‚GôLÅ3Z†ÈlÿôGÊì‰|*QþA¾Ÿ¦w¬xi>(|öcIŠýå\|¥Ž÷2õ„@§Dct.øìÆÚ¨ üËŸÉá?õ¿Ìã'ÔË<àLÑEíõU6ÿ’Ü€[“ñÚ½Ê[yÞßãþx*úåßÓ,_‰yPÐp óÀà±À'è"»\ $Å1\Íç<»jí÷Mà 0Ïü¥/Ë*ëÖ@_C‹Æ“vïØ•­Mú«‰ÌtT‹ô6 ô6¼Û~ñ7–z¶–øsÈÆZ‰ZiÅ– ¸ïÆtB”ˆ—óƒA{¬Õ@B)Áÿ½ŒÈÉåÅêñÑŸeê!Eéålì‹©w`q†Š–bÁ’S‹cU€ÎµM¯©ˆkõªŸAÜÒµÜ“ÔˇíÍŽX~ìñË퇅ÑI¯r6¼´.N ãÀŽú³â+Aûgô;'?ˆç¢û÷sÿ‘;þ¹>n‰ÙH‚z‰D!ŠPƒyþÜÚ0d]Cxúð*x1WÕ«}ôg0BìMYÖPÝÝÁ$*("ØÍX|“ Ï%6¼ ¿Š{lpà¾Î¥LQ -À«ù¯Œ•øËïÄõ„æâFðÿθ:– ˜Ø)ô‘2CáãdÁmØ<Ïr`t€l`ˆEëM­=<é3÷óx5KG.Ku-ð7Ãd¯ÀäÆ17.´äÞ¨Œ!>=ôÄ&LD}Ï"D·}êXvm?t]“Ø~‚SÖj­ÎÁ6²ß–sfL{Ú—äOníE Sš6ÍÞ¿ãºØ,ˆ—Ëø±w\ÅîIóR_vN³Ð.Û:¾ `6™·×¼ë7iÓ^aŒòݬ$3ÁÔ¶;/‚àÐ =Ó A ›Ú!]âµ"s¥n°Ò++ÀD×CB½(2ê‡ÐMÝ2]# q„í­•0ŸeØäý/¥ÌJÆ®)=w;Ë°Ý0€K<Ï´l[^äÛ®acŠ©…õVc—ž8QO¸ÕÓg’*y׳‹’‘iJ-å‘ɼáT÷ˆáÆ J¹–OÿŽE…Ú<ã‹|FEÈçÂAIÍ<˺›Äág6;=м5¼[®Ïa‡_1x\ëY2~D<;²<žQa³ÚÓxùa6›Óý¤šž4y<GÌ3ó1H>fA+„G€ùý|SwsÑžÆü6å`ʯƒ© J&a)¨íDKörà×E _Sp´8‚_·ççûðäãxÊC ò¯Å’=4^hÜÍ`.Ìz²Xó—ìyZÉã úbŸgî·bë’t Üá}U0·‘)…+6ýêçx!{£? còÙisÁìož“ÒÛ¸ ‘á2^{úe/A„–{Y ®KÊäG<Ë,îO¯íPØAY¦ ûk@¥à²„‰C†ôìø*aºeœ1bwƒ bî] 6Ã'sÃy\Ìô6³@böºØ%õŠAÝŽm{E8“8þ¼šÉÙæFÂJWiA­$»è1*É2 `Ly¨tm+pNïA Ðù]–è/ ¦Ã‘€ªdJÁŒÿu2õ<îUQHs^ÏŽ’:Ì´;ÈêS<ÿ,,O÷Rk‚Ôš©å9yic{£Ël½ì× È&,Ë-É?OÏh, .Ô_'-×’qîd·Æ‰ÁL]’îØTžký?bw¡„ñJn\žÏdÖˆÌ7°¼[ðISßR@bµ¢¥>нmÀ]§æ}w¼sÊçåø¢I"‚OþB»Ïfý£yüÈÅ Š'“ø‰—Ðn=Éú¿e#TZÿw Óø¾þÿ->ß×ÿ¿Íúÿ{!Zß—ú¿/õ_êÆ¥þn—À«7ü}–ú·c"úxÎKO5ï]â f¬EÍz¸ ›“Éd‡Žq§H³t3‚ k¥Pø¼|ÊHÞŽHVHf;"­{ö’KâŸâæ7é÷ƒ<œ …4†SÀ'Lá„á<’Â!áÐ<šÂQÒL8÷y8÷)œûÆpÆy8ãθ1œINÆ“;ËI $p§)Üicüfy8³ά1œyÎ<…3o g‘‡³Há4ÒÎ2g™Â©Q¼pVy8«Ϊ1œ/y8_R8_:ØI•Û$ ̸æfnª ?/¹æxã¾6ÕöÁ„‡Ó †u¦¾¨3÷jï°r®§i.¶c62ŠýðÙ»ö߶‘$}?ï_Ñ؉׉Ùovöf°Ž­$;'É3;À^ökFXÇòZö.‚óÎß~Õ¤¨-³›´&™BC²MQͪÕõU¿ªášYé}a)†ÿ|½6ªìDüÃã=9‹¥Tß™fÂPͽeÚ OMn˜õLØÜYá3³±Øê‹þ é˼­Â×÷2[’^Kãµ÷"7…Ì4å\;M©d›÷j~¹è~4§Œ„T º((Ó vc8¶ï]Gc›ðU÷Y òR3Ÿ3¡ ™+ç 2[‚u.,Dä‘ÁJ«œdÚ(ø“ae<áÖ˜sòǯ{³ÒÐÏ}H æŒåoU€òzF£Ö»¢à`!µvDٜؓaßU‘Q-è21ÆŠ\PÏ…‡¢³\8©´c ¯öv£Ô­ªÜ]^¦øOZW:…•4 Ì,H¶ðDaO‰ÔÔ<‡†ãu€ÔîL^XL” F‰5ß#µÑZ²ÂQ½(ok¢Ç+@}'p;RRJ”ðR…rÔjžÃE–š;µH^#1–Å6÷V0¢2, JŸÓL‡º†ÄÉ)¢ÛŒh«2/0-ˆ‘‚Á#7™Ó¾ªÀDwÝçJ„\»¼paDÙd*ä(°Pb¢Ç~-9T¦´ÌŒb`6j]–)•q]8ãDWɵwàæ3ªun P!"Ë™¡™ôŒØŒÆ$Op˜µèŠ€+&EÈ~ÊH.¤S…W’ðB€ÍÚåóM˜;÷Âä"\A-ŒÌ q¢€¨ˆŠ^¸§UTg2ÎàfšqC!à€03Ã÷8¸kEM,ïÑŠšâìë{y†Ø\Q¯óÜ:CÀ?X:Í4ÉË x;Ú{ZyB?_̈IÁØ4'>L×Ê™äÒ_ÄÌié%D…¬+î…SgðN2.£¥B‰@ÜŒ‡ÑÌvÜçe²„$Ø…W>ì΀a©2‚Y& ´ÍÀÙ+Ò tƒ‚'‚͈ ÉûeÆXp´2'¸PÚò|ì_Gþþ¿ŒüUǃõ¿››íä­ãBØÚøù/àaÆø×ñ¿Ïq|ÿû<ãk;c¡qY¿Pè¦ÿ:øu<ðëxà×ñÀßÅxàÎÆÿÖõy^õ—¥Bp¢ü¿¼xѼö™»t,?²Ó› ˘Œs¥µÓÎHÏ¡ÕË4K­Î5©“U/–Ã.%ìr eóœK ÊÍÐfôÐ.ˆåâ^¿š¬º,¾ÖþIk‘£‹ˆ7vVì»fx#ÝÑrÓÆ·³årùƒ3_9Þ`P/Ku×J­ÓmæUz¸±*x‹5VÛ7VE¨Ç®¹YÖ¾k.B›»æ–&úÈ6«~ñÔcooY'’doßa¡–v—r—Uvom?–Í“©¾)n>=rYYD7ÙÛ÷èE¨eÞ¦ìŸ÷ö~jÙá7w8Öã¼–£«ì""»øã.#²Ë'áþfz3¿Eÿr7aEÑ+„ùA&4+w‚{‘=ÿãÞ¾K=B*AöNwÄí»Ã#œ¥ Õí–vÁ8å–{»<ºÉ!2ܲýûšühÕÐ\…±åâƒj¹ð¼ì»ž]~úÅÙ›âv9/i¿¸üüþÙÿß”†ÚMþ™á$2û‚øG 'Zé—ö/..ö÷/öË÷õ×~óüÅú¹ª›üRÃI¤VÊP¾àý`óõàüò¿ð~¿ßP¡£übÃIĶ×[üðóÓSäN"7ÿþ×_½ÿµz_m;¿ö~pZüôù#‡“.ÈÞ¢û£{ôþú^'¨üûÛò¿£êÜâõmý~„î Òo<ŽòGH§\%ÿÝ_Þ£ÙBN¯ËZÖb»üAÇŸ¾i(ÐM~¡L’D™¥ü‡¥œ— 9oáuWËzµ]þ ë}©Àš u”?¿$Qe-W+ùç••¬vC~øA+ùQCŽòGø—$ò/Èñ®”æS%]i?•|ß–v…ç—òW5&üýZW £üþ%iüä.%«åGk²¢µWó}CŽòGø—¤òï=š<3Uþ :Êá_’Ê¿÷hÐ_þu:Êá_’Ê¿÷ðv¿W¾¯¿ö¶œß8wPYÍO{µåð/Iæ_t†î¯+»¿‚×^ÝÏîÑ5ºQùú)¼4º¿¹GEùuý v;‘u—?¿$•ÿô UFbõ{ó¿Ç~wùNË+î[œ^žíˆE„ËI*—ïìè&?p9Mäò£Ùõ§2zvô"€,GçWÓ²‡ãöúPÜLç/ÆwÚ¶e ox:îDþ—ÓT.ÿRøG¸œ&rù3úÎÞÍz=>F—Sã®æîùg?Âå4‘ËGÎNçÕîae °‘ Ìô U;PyJO¯BÏpè˜ïW¹_f7åïÙÝm?ù#\N¹üãÌNýÔ”ƒûe‚²ëQì6 X^ßÌþ5µ!%Ú/Åm#}™]Ùi•Õ¬Ÿü.§‰\$þèn_=Ùü»ÊáršÜ–ÞÕÑQþ—ÓD.Ç/U`†²¶’Ü¢wó0·à¶€:l¨Ða–YúÝ«Ù-Ôúý®òG¸œ¦r9ªÆÝê¬ykv*î¦ÑƒžPÄôcÈÎ÷Tü#üKù—<Äp^ó75þP™íq[AùY„Yj[-  Ïs@ £ê.„Y:ÿnä‚´!GsÙÅû±¸u7Óâr¾ò¥«Ä_kíewù#üËù—V©.CÁÕ4XÇÐRýS9-H»Àh6ô_»+;»v ÝÛ7³³[‡*³ºw–?¿,µ- øÄÿZ%Ù 9xfþößj†_;hÄâ½ wUQÝ|^=€ŽòGø—¥÷eÿÏ"üËùwòn8Fã³7“G}?<£×?‡tx>yw6Bÿûá>.[+U“åðô^?¢Áß>Œã1‚‹úèáa–ÈÃÃ÷N† 5¨1:< ã}öN·§o÷Ñëó :=› “áûá.›œí—Ú=üZWù#<Ìyøì z?½!_O†“K€ß '§Ü7€î!úp8š ÎOGèÃùèÃÙ<µãáøèäpø~pÜÃEx˜%òðððEƒï§4~wxr²n<¯üáë“A¥Íñp48š„GTÿÕ·Dx˜%ò0Ø X=€²ÆGÃðÇào°ÃÑûÁºÎNǃÿ9‡‹àCt|øþð-˜Ë³†•u”ŸGx˜'òpÓ¸¡ïÃóÛŸ¿O†“óɽ=;;.këx0ú~x4ÿœ…úû]ã8áažÈÃLJ“ÃeŒ„ vs>–æ?< F£ó“áÙésôîì04x ‡ ðqYOÎNK³ên?<ÂÃ<‘‡ÁÚÏF?ƒ¥—xýðnçG¡r€ñLF‡ÁÐÇ“Ñðh²~h:9MzÙ?ð0Oäá•£ÓÁÛ“áÛÁéÑ Hv4øa8<_3‡ †Ø?‚¾ç¥y…ºÏ"üÙUþóDÞà±ýÒ¡átxüý0ØÈBFp™ãá½–µâèÝ¢"¿ìéx„‡yú˜ò‰#x„y"ÿ6gÑí£ÚÕ„:ˆÌîÌ/î¶Ôbuúåuuú¯Ó+h—ÕŠìH áb‘Þ&ÞÑÑQþ‹Ï?¿ë ›2 2N+4‚ö)4B[¢…¶®ËÎœ°‹Äìæß}3õWÖyt6>¹(Ãœ7‡Gƒ‹wÝp‹h!¡Miê۶ȋª6ž&p„uD ël8í¶²-dÑDa}±ù­Î^þRí ÖEžˆóyÓŒøbÑâ‹(éOÛ>»¸0×—wóðzÞIIñª²Å«ÆóîÓ¿g7öß…nê4[› B?ÝÕÏ—S¸ ¸üãwúçÝ ˜±úÕM•ˆƒ•›¡ÿM,7â÷dK#¤ùÈÜ•únZE¤liB<¡2ʈ •¬‡ñË6O¸ZÇT~sÛ®†b®¤å²p8ç^mÕ²(4<p‚d‹=×ei“·U†ÃÚ(ËÛz¶·$Œ°ô¤Üþ"dø¸ðAœçèÙ›áÉíí£mÂQªljiöª­ÓSmóØ ÀrÁYΩ+d&‹Œy“K‘®-cR9—UÀŠ~À>®pXмT/7X©vkñÏŸ%•ŒQ½$`Td3E¡0SÄK† %µ•“Ls’+_a$wц®5F!‘@„Z0ÚÀ6¤6ÎKI\ˆLe¸(ÂQ.çÂU¨ÌXF¤\ÔÐüs€Tey †”¬|7'(Ïr’c+”Ò^`.2Ì)‘Kî±6lé”W¿½{Š  ©“jïÔfI½j[ÞW$`)À É"”›k#)u¹§LK•*çzyö9 ©LI©mý0j XR0R„Qés⸴¹$ÔÊaŠDu¹¦Â÷Ãœ0Jµ·¸ Ç2ËØ’“ip× G¢¹¼O+6iyŸVlÞÏál±:Ü7ÕÙÔ[-BÄGù²ðí½Êô@‰Ñ´êçp}ÑŽ0°¯"JQš`k + Ã’YRê­:”‡DµOâ|4 "léýJ„©ŸoXJ(ˆçBƒ<œiE¥ ª§W,¿j™±L}jQ¿øÛVj‘Ë°&ÂÙVëà$ ¦ÊµÔ^‘,/¨ÁFQ‰KµãU€¬H?8ãÑ÷z`\â™g\äªÄM<álów pâL:ò0Rå•/¤%ŒYNœÌá#e+æR´œñ@}-†N¶Î¸Èe‰ý¬³­±gžq…IØ›Õ(—Ñðrk`â°^æ*8Y?8ã!ýz´jq‘«{Yg¿n†•w'Ø[I]&0õ–XQÐÂ:@ÄdUì©v3$ÁÙ56GIÖ9”Ød¤D8ûu.,e3¢0…Ôç$æ(,ú¤PC©‘Å‚Šv.$Áo'¬…ðÉ•=.rYb¿ÊÞ¯bå×5ñ3#qf2î='$/Œôê&-Q¿zØ‘g×H> θÈe‰ýàì×c±” „Ñ*¤/¸4<£À»*W\:l)˜ÁÂw>ì±ØOî$’N Aãr×ûÖÿ%ÉÈЄÚšøOZ3gOì ñP9D2&çÌ¿W¡·w¤ øá&»ë ØÉ3L¨Í=’«‡•ê»âû7P{v|‘Šñ´­©Saoï<€Ï»·óq$‹|Þ§Ðöñø!¿Ø7ë‘/t”¿} >ÿ}ÏöÀ‘\WðyÔ1<ì¥[=ã5ÙBDŒ3—ˬžacË @áŠsˆùê †W5yÙ=°kkÔô¶ÎIJ%\J™Ø“ˆ#µàóß!Í(÷"£…TYhÔû°?@–iÁ0¤pM„b%«Þ*Àç=\V$çnæÜJ+´}RNʪu°ÓzØ©F²jáÔ¬ZíÇȶÜ6»Ýöðƒ‘¬Zø dÕêæ#iµp3­VZ¡vkæºJ+4B9I ¨¾ åGPáäT÷îãìæ*{”Ê…„Ö­þyÔì;ÊáƒÄT»<:šzÄ«·e Ú¡1¥=fÌ+K½UÖB™Ïrm4Ëe9u“± [ö¸>kðب-’Æ 7ÒX5oœÒ@) íšN8ž:Í€­­–™#˜… Ýš:®:BSg2àH.+Ü–ËjGOR8¢Xè-'2³*Œê˜`b;Ï2–?ÞêþÉæ£LV9B”ÍôWi…FØ«™“*­Ð£$%Šú‚~:’( ''ŠzüøPÍZ\Iæ-—w”?“‰‰¢vytóÓ‘LQ¸-SÔ#mž 8SNjë¥Ä\ ¢¼¢Ò(+‰õÄxÍv²T»A<©~Gص‘^ª‡_νƅ Î*c9”ÁU†µ)@)g%<ÖÕr  ©ÓnÛ™‘dR¸‘Lª‡æ6gÊ ^Èœhk„Æ>—6­oŠU^Ȧæ*žªR$¿nË/µ# –ZriYƹð$WšÙ\zO(Í248þMÝ–#v_"$ÝHRÕã¹:gò‚j§Df¼4¤0Þ Ç©´Bfس¦Ž—³Ù?î®»ZôÆì™då#tÝÈpÕCyÅdsnóŒh•å¦Kö–§ˆ…öMåv·ÖùâîòöâÆýò‡|êtE’^áfÒ«´B#ÁB[&ªß`½Žd–Âm™¥¶.G@è?‰wŽÐv[N¨'/ÃÀ‘ŒN¸-£Sÿe8’ˆ ·%bj(]ê¼~y$¨|dùZE(}»½5Õ>êÕøÎÅb/ž+‚Î¥ò)#AÕ=6 Éáûú»ã A™ÜèÕèr2ʺwXßð›zšåÚV¯ê9“å"º@q¡œ‹6‰jûtfÚŽŠ™–ú¡-_ŠSY ih"¸Ðæ%y¤ã>Ò‘îc>ëγïcªzÍë³ÐÝV´îÒ ÈFHÐÅ“.QŒ÷¶¤£Ø¿ç¦¯ÅV%<´Ø î6ãn4éw|R:Ü4µíÂd×?_†]•A?Õ l1_Þ0_Þ#ˆ/¿Jâe5i<¦]C-.ßaÐà,Õ‡²âóÕÒ-²÷Ü·NQë´­U°s¶*§‚oD¬Y‡Æëæør¹t˜»/½{ßÊSÖtµLcñô„tõ]ôéH‰ÐwèHé9ØßÉX× 8í2˜¢¡}TñµÁé~4^VÃ.–ÇŒ•×íÐ}6:¥TŸz°I7È] þô¦¶•÷l§AT.ATÞÁ ,5¾ª5ÝXãe5Œu¹`¶åEä—ïÐjiÃjû´âËc;ôüw^j›ØxZË…³SÊ<Ô§C?>®CßIï©u}+zUÂN«6ÁöÁÚG˪_Ú^µãe5ªvbÊb -.ßaÕnDHªW„] Û!B꺰¶u0oQ­—×1fÝÀÜíxS£e”wh­b¢èòô1Q´¬†-ƃÍÕŠ{T]¼CCl4ÍUŸ¦y|­o:|ñ²ðÕˈ;w1W_Ü!” ¶QØf5òÍŠÒaä3ZV3àY&\‰D<‹Æ#ª¿°CIÄÿcïZ{Û8²l>ûW0ÚO Œ¤z?<¶Ù$3;‹d6X8ØÙOF=nÉÌД–¤{~ýžÛdÓ”,±É,°À ‰E±›·êÖ}S]Uœ3õ6|†Å„‡sÏÃ5ó¶¿ýý,ñs–‹ /¸œ0S4wñæ\Èóè£ß”ÛȵœóPnxò„Gô³×;OY”³ÿÔ?tŽÃ=ZåÚý__^¢¦^¶¸¼|uòv¹…ˆõnËo?ëÞÙîÒf·h··½¸ã×Ý¥·›¾ËûK×àZ7´Ý>¸ðêÅ–±ô«g¢5mCæízñþÿ·÷«…ò …Ô°ú¹qÏm௧øü]ùÓâ°þ­×þínw÷üúú—_~¹ª·?ÝÐúêvss½\WúxXTöìÅòÝ̓N€c–—ý'îÖ7‹´ÚßAïŸuÈ«påðrße¼µW‰¯æÛú‰s#¯ž}õÿ?ÿk?<âõ¶t#}³ºÍiµ}ÃÛGÞl;“ÿm ¨„3†£D‰Óß]º0Ö|%•µÖH+œþ W•ñ_-ÄoÑøÐÏ{ÂÅ⫼ÿ>‘'ïºþôçÅ×ßþû7¯ÿëÇïlíÅ?ýË÷þfqqy}ýŸú›ëëo_»ø뿾þá{D¯X¼Þ¤õ¶Ë›iu}ýÝ_.§9ãÝ¥‹×ÿqý‘eIþðáååîä“WuW9“t ~|·Zo_>"FÆ÷Ÿîî¥Tñëí¬pï%XÜòÃË‹oö9õò5/ªï3,R=Pôþÿç¹Û-í^þôú—¡ËE_ùëåO¸üæöÝ]Ú-óêTΟ¿{?f¿ÂøfŸjo7'÷}»Ouû×}`·Ü­èUŸlŸ/þ´­×û Ï^¬–ë¿òî.åíUÙn/ZñÙþŸV´}K´»Xðfƒ:|KÞ–Íònwzåçô!íß=äâŸÿû=m>]ý¼íÖwWÆ}°~Zoi¿sìá§OúÛ§úQ]^téÿ`¿Cžç¢ÌÈcw{w±¯õ¶ûbÏ ½ã¯í¾17ýn±Ü-–\ônùë>Q±M½/”G9<¦iC‰]£¹¢E¡Õj{—Êr}óòB\tß¡âþ~õlñb·ï ^lpCâ/Ÿ}¾°îîãïù&\¬ýÅÃÇ/WÔp‹¸²ônÏâØ‘»ÍíÏ¿=(êÏwœ®4?½±Ã.¯ÄU¼êwït÷˜‚_ì*wñz·Ùÿê+e§e:öh‚ÖuÁã|Kð…Ïà#xÏU»{Nú¿N6·¿È‹#d‚gîU\¼ øü.'îá.­–Ÿà)Zèô}õCZ®÷úÿ˜nè¸àñ>ø˜ ?6mï úËñí1BÒÅZß“ñmÚ¥}gŽgÙœ‘v\ìÿ~³éû¥·åêAïþÈï<*êÅõûÕÞ˜½Uï·º7Þjâ€?Þ“½ŽßãSs´;{Rl††úWiøXoþ°Zý Å:„sÌú³c\«—©×û3½æ ’¹7HzÞ }Ö쟺H|“ú¾¥)šu0ŸÊɽœë¤r ÞÊ9Ã$%_ÍRù”´ä}€Ô¬ˆ ž&­ãMrœO§M®RQL’%ÀøG•Vƒ5*ä*‚Ÿ¥Í¡çµéW4ŒQ¥Ùà½UDt66)L ¶RN²mža¦=¯ÊþñÙ¸h±A ]rÊ¥4Ó¼žLÑ6X mR-ΊéM6:ð’w§dDÔðÉÅp妽ô2–nñÓ8£””¥©A"(›ËM(Á[ˆ-Á9ø1ù<£T2>¹R„©­é*š×^Áß´+!£¸ åö®Û$wVÝÝŽ&âê\‘J Ök²:y‘}æd,o¸÷ÇíÍOH¶×ÍH$¢]‚ƒùz÷dÇË[*{SŽójÝ»«e§ :’Úx’ÒçµnZ9‚[¤æÍdm’áõ¥¨¦…ѵålÈšŒÂ‚TVyûÕ€6Ãø¤ïºk±6™B•¤Êڶ쬪YËheij×KõÕ-tŠ2ÉV2šàãr&Ô«¡®׌¾çð–`ƒŠ¶j)©ñ©á¢(›"#$«&»Pö‘ªTýv"¸â ÁÊåÁž@ GQÁ:«µ-É#N«³¢Ê¤Qc ÅÔ®k³[óŽ*ÀeuD¤U„!†Gw)EgŒ4@gR&Åêò(üÀ¨ÊNöôTuÒ6©ˆ*–köŸ³8XÖE;Ôs^†›v»Í2¿ßÑö¼Ç6U TƒkàXS#`¸PÀ:­K‰÷Ú<£C?&5°xÀ0ç(ÂS´.V«„HEß“'tXç7wiƒä  1 Fßl).ÁÏ# ,J©l¤hÂ1艖r˜jŠšC,AVY ˆBe”“ªdÑ·¯Ã†L1îõ]—dQ‰CöBä,eÌ-]PϪñ“CL¨4^`‚gWNjÒÈi¤‚6Avøîf³Ü}Ú×qJTÍÛudrÎ󲌈´Òª&¥zª•ÏÕþËFW%E¶Q>Kâ£<Ùè ´¨Jð*æ „Õ&À²«JIËgÿÌ¿Œ¢DœL² ¾üH16WCà3ŠÂ;ž(óçÄÛLTA»¼N–ÛôA[kTÍÆIÇŠ©¸q*ꤻíûœnœ&ÂQŠE6¶*£r­Rç¿c²šÄP2€w¹È„x¨Q¥&ð#". ;R“aÞ7(dÕÀÈÒh ²` ŸZt.#P¤\6xF‡~X¤hšŸ?&YCŽ¹\U ;~Ft’ÌÃay\‡¶\ŒkŒº$”½eÖNðnZÊ `Ÿ§ìæÄuð!ûˆ{©éÈR)”Û45Ö Ã“GöR[ÔWD(ÞP‚@T­Çmäã +x €ÎIk$=%"?|v%V—U_d»ÇU8lâž8½k¡ê&´–… KC –}Œ4' €.2"!ÖŒò“LÑ°Im &¼s–AH{¢³à µU£5µÂg#Lö¨ÚŸš~´î^?…=­“3¬·‚ã6ü32=\Ø7*CΑ‰bLÎûf‘>”& øá+/ڛأEžs©1ôó¨L-·R¤óh¨whÐäçD(¼_X„ãEžSb 25U@ä#‚ñIw‹°•hÅf  ,2à 6¹ê#x0h£®Šrp]G@#õ…0üYFz,Öü%™xŽè¨òQ1ÎÛBsŠµ²D¾H«¢É Œ'O(Dº;½4´Ã°/ oˆÀK\s°¨Ô¬w`¯ð_gB¥”¼š‚. ÞcÑwTM ©êg¿¨žtøô.ß®Fðˆx„}*jí\l1 ƒl¨)ŸT·^UgÆ7{‘ƒøã±Sd‚1H¦ô^j­øaŠSã#Ðz‘ç4æǵÛh DÃËn+Ÿ Žß:2Šj2ª@ÜÏf A¢.ñ1Ðdr¨­•f¨à›ŠU:DUÖJp\Ù+gCó#U¾ûmÈ ] é”b h0f)ƒi+8“3\ÉšÝ|3&Dþ—V½è`¾–Çu†®ñsbõ™×Ïÿ{×ÞœF®ìïßçSè:U[¶—Øó~d7®Cl’Påؾ€wÏÖÉ)Ÿyhb6˜á0°)×uíg¿ÝÒ ÌÀ€4~d/¸À0 R«»Õ¿–ÔjP bw\•:&ø˜ÔqÜP¯ÑðUí@×Â(²M×"UÓ-M7†ÇêÆË[lU\¢1bvV!h¿Š{ÁX+ ±õÀ àîÀÈȤàÔ:5ú…å¨ 8¯*øxŽâ@7ÓUdŠê0ltõ%‹·¢ rlV)8¦Xžy&8¸¼æGQ¤hªâyŽçÖ…|‘ëd‘f ggÁïwlú†:g,àŠ¡ù¦¯úr5J¸Ì³°çŠ«b .¸´¶>ç}p f¯†øå‹\'~™e“¬Fp›†m˜TÀ="§î| è0Ù GUÙƒóêán,û*†iÁK 1å–9*[”O¼! P.šÀ0K |Ea“ ©éÿI3&áÎ݈ȳ ¯:-¥†çQY¡fûïhQà«z Ù†"uªè‘fEÎéª(fèx–œìÅþá¿``d7âbXŒSsp[8yÀÍ:ž‰é*¶0c,±«ÃÀq#tP `~EØŽß”—ÌÝå%{¾¶l–ÿ µKç;â¶Y‡ÂBWåÿ2°#¹ü_Ún(¶ºËÿõ]þ¯§Éÿ•|ÌÎC:4¢c:ăyw Áv Áv Áv Á^@B°­%Ë·ç5˜ÕÛYƒàûÌnN3Áä¾£z·wRæù†ýñ FÄënìð<“˜ÇÐ<5ð,5ŠL/Rý”\ž¾wF`•¨c&…êFi®cC¹vCÇWá 3­a¶=$™Õ’ñ@.‘ï–{3Ù§—“éÝ7¾G«•Iâ¦ôy}GÑ.@×Ëå)óN5¨P8³{ÅjÓk«ÁK+IÄK\“ èo?ŠI u5ŸEyïäC |;N ¿ €RGÜ´£ÊqVŽæ›×›Ò`0k>Î7Ì/Lr£u¾Ýã¢nµìž/ãx:ʘýsáE–²±QŽ¯·Ú ³²ÜÆæ*„_ô'ôî縇ǥ˜x@¯®Â0Î 5ï±íÀÅíiŒ¤Ù¯Úð«s €ô¿‘cD•=òGú‘Á¦]OQÕ¾TB§ø#?žL⪜sä_IPËNá:1?¤GÜ¡lVFõY.£ºL`º‘¸>Œq5ÛÃhÓu1ê"ŒŠµðÒOìÌ<2 Ð7Ê9ŸPÜÉ >WuÞw³Ÿît$Ïé•rV1#w1œ W¶}êQ¸h¹–f›8?ø’ä,¦6/§³X¶Uù½‰l§}\FœªeZŽc:àÎE¶ãºFéf-ÙòƒâEºbz󌟚AöŸW¦Uù¼‰L <$ÈÓôÐp¨ú–!ûžc¹N¨h´–Lƒ}¢!âÖ4$;GŽd‡C÷‡£©„@«2yº¡áÚ¾çfE¾J)µ C1Ð&ØZ¨mŠ[Ÿ§c~,ÙK±*g7ê–Ôm7á‚IWM3Akpk´¦¶â×ë–£bjó\ÏÎÉzn3[•Ç›ÈÓ·¡!¸ ‡&غ¢)aàéJèh¦¥Õs‹¾›^)n}žŽÙÁAÏ­ U…¶‰‚„^dáI²¸qSu¨ð‡¥¨‘a‡&Õj)ø3"O1±y®³ ˜Ç”§úXN¸&Ö‘ªrÛDGt'ðMêY–éÑ@³U •§øžjFõÆЫ87?ëÔðÍPQ‚ºà|Âð"K1tG 3Z>’êñ̈¸ý…QyF‘,¾We¯´(gÍ+&Y²‰rS¤ÝÃOlVåos¦äóD˘&¶|›zJÕhoéêhOâù¼èâLŸˆO¿ÅïÇó|nñÞGéŒK‘ÍëçI9Ù/¹˜Ã2ÛáÊÊ£#çšúSÑ»lFñçcxŸu”“ƒ²F¯¥ëÙûüÆ‚`Ã8@i–Ñ•D©Ê½I'3 ô§ýA˜o’1LÇCxOö`°ƒÓ…£û=²KLŬ{±‹8'é šÐ›x$ÉÖŽŸ¦ nàTb89¹šå„vLàRÈ—òš˜Ýÿ·L 9ö¡+ý³?ü×¢ÕÉñ}Æó”ݽ[:kJ:ךÞ2'¿`L;"¹Nã=›ü ™ …&¦Ë€)'yS;œ«³v6—êgòa³¼%ÄñºxU(Úù¹|Ä›AûÅJ;ºtJž /¼ƒElNYòç¹qüõ/4›OÖ€òòé¿EðÍ›™¤¼“SÇ ­Âè¦åa"@)¡lI¯Bñî* )Ö_XeÆ%fïžÏŒ³CMç?7±º|Ö´ªD¥dF²AVÂu bå}¥÷{'bãú½FÙoEü(mþjÀÙ:ò0õYŸmÏÎ.ŒÑ¿{ZÝá²Aûn!‚«á*ŒÈF$`¢ÀTryò-^¶]0hI j\!û)¢¼þÖOèAƒDÞ ¾ã•‚ ¨½d'“òÀv@@+Tc•x ëÛΠGEé*óëm½°”¢ ¶8ø±UüØêËü¼¬ñŠÄ’É ¯àBÓwiÏ3KÄX·Êã—ÜUgk Åã{¶-eµÓþ„–¶^ÿcÌaÛŸÈ#Ö4 ”æî ”¼’u{Aª¿›Qy1Æõ9yQ\§•"…~~·~~í\&_x÷Éö¦à¸ã›w5!ž€™ ³Ù•é0È™€/Š­8"í Ü ¦!eà^ŒtEŽÇÛ’}v‹eÆããÅ·xü•|ëOn¹·šb “2Æø Ì?Õ¯6í2i¥lÛâ*ß …¶§í¿4˜/C½à–áöa>›|rœ¿:ä³É¾Å¹aŽö•W{¶è=HD¼¼UõÍ5H)ëêù$)O7J™Ó» J‚1…áIjȳ›ç6&ˆÇcšŒâ!îŠYôûg;– Ëáý²Å©•ÞrÐʔֺåÙì&ðòìÓëlÍy) !ëû§o–æk”ƒ£¬Å¡oõbÖ­T"gÝâu•‚Tc! /ËR¹ {¡ei±±6ôåÖi‹Vh“Åùå tgÉÌaò§FÞt0I«ßW‡‰àï— [ ¸âBúNP!%v$dsV|+·b> `öŠézB'ˆ¸ÿ’b¤óùSõˆÆ)_Ú!n»Ÿ‡P-L-ÍçÍXÅ5%_* Š5¹/q¤‰)¹@>Þ½HðV‘-¼üÕ}Ø­™À­ê¯³×U,žÄ.´ç³x¸ÿê,ÃÛnº¿–ÉL™÷ˆÁ9<í*Ùç†lú œ%±Âl'lõ—Í@¼ “Ç•©læSÞ!ë=°Ë8RÉ3ŽÍ4=MÀ(s*áåeÛöõÓ^rÙÑÜXØtÒÜ$^D1›1àóK •ØKúvD–mbäÓ»Uí2ÛèûäV™5vu4Œ‡‘ú%æ(Çws“ ß÷¹ùw!è¿à±bþ¨eËÒc3ÆÀ2Êì1fššŽBæÚ¦ÕbžÅ,3øü)qKM n Û¥D¼‹ó„%«mÛ YNNõ#‡…f¦3ì1Á£Læ2;"×+xÅ[ÿ +pÞ§” ü‰ö ,#\)%[tZáå{–ïd'Â.‹é†YL—òªöçÿTmCµsù?užÿÓÚåÿ|ŠÇ.ÿçÓäÿDË6¦¶}ƒ¹ûO7¸ËºËºËú$™@3—swn#3èK̺Ýv±ZVRÿØFYKqkUT^î{6×/•ttk)7GSÿµ7Ѫ8’B2*êçÜ”€²obBÍ“Wi´ùa0ùiåJqÈQ ‹?ðÃøù1+2–Î+$˜ñò4 Â@¤]œ¡ìÇÅÝùŒÝÞåû<O¥ ©þ ¾Ba#6ç·$ŠÂ¢XÈ ó1ì_\ŸŸ¿Ët×2_¸*Æ`.ŽHVL9\q†­ˆW|bKÝ;qäv»I Ÿ[JwU^#´z’ItÙ—·´±‘ -ü7ÌÀm¸ŠÐLÚž.Ôâ”.“ÜÖT :ž#·(­Jò¡¦»´€—·;ŸT@Æri¶±(«ÔU™ŠÃç–K³4¥¬4©hÅÚ½¬4Ø’êÅŠ[ZœDd mYàI±0Œ¿ã.ÑtB“êÅ*N)Rñ•%â0ÒÒÀKü2îOîo‚[|­^®îªeåÊEo.§º¥=ba7^£öäƽû›$ˆGƒ¾_£³T^i`†jK7Jµ}”­ ,§TÛÐ(œ“‰²ÌeI¥¬MpœÏwôÁŸ˜·58‰½˜çƒ¬<ÈÃ2lâÞ݆àtU\lÄ2­@‰¹pÄï­ŒrÃÄÃYËüvà÷=ŸYNæ(®Ñä2Žêå\˜&·2 Z™Ëôv|ÌËa~\˜nƒê'éx™|óòe¶ÒÂ"š¢Tê†Ô “‡µrt&aÐwG¼îŽx­ôXŠÿÐì¼’m¥ŽµñüYÖÂù¯–aj»ø§xìâ?ž&þÍÌQ@ºüð»÷þ}Þ„~¸©Ràô?üùçŸò×ü³ìzîõøZñyú§JÒO>‡ÓrïÞÂóœ°÷oÙ§S~-}¾Í^OÉÃg¤¾ Šô @N•9N‡< HœÒIá9ÈhõÊéÇ6~~µÐ€jôkÈÔ¤ “ÑßdtR:'ðœf´ËéǶ>°äT¨"ýüÕäð—pmÎéOx8­a~ø#súÉB*Ò/À_MŽŒš{NÓNß[¦W$½>£Ÿ÷|ÿ™äP‘~þjrø‹ô´g”eô“­$÷\|-4 "ýüÕdñ÷ô–蔥¿Ð€Šô ðW“ÅßÒªO¾éà¯&‹¿ðòpÈ^óÏÃ’ë…kÇ\k>f ¨H¿5iü%—äaÄõ~Ï.<ò?yxÍm}ž>y?½B_?Î̲êô ðW“Åß^éîO0Häÿ‹ŸVý¯ò›5ŸæØ—^ž]­È –k²X¾µG5úu–ë’X~îy2—ýÓð‡\ûl†crO®¼q?y݆0¶e#¼öE§ÝÜ ý,×e±ü¹ø/Àr]Ë÷õ×pušPò®{Fý€zðô °\—Äò 1[+ÆÎeY˜±1ý!á‹„]òûCŸ3»;Œ'ÐëUé`¹.‹å„¯»e{Úrz·¨ôÐN(¢GÇGó_€¿º$þjËü>çìMÆèÌá4 ¥"¨A¿!À_Cv,Mf PGY¶êô ð×ÇßâB.P{ŒûäÙï7¡ã¾7H涔¶þ›ÚQuúøkHâ¯ÎSäaÁÙÆo °„´ß³ˆ<~&áéßè0ŒÇx,åÛsOð(T«IR™~þ²cià?°øy.ÆçÆÑä›—¦•F„MF4@˜Ã¨¼c¸!‡º„dP•~þòsÙÏbÿ þ’øÛûØî’îåûÞ¯ÍN‹Àû«Îå/í³Öy÷|Ù"ÍëÞÇËù÷¿›]øšVø¥yqÏßHëWV·Kà¦:íà°!‰ÃíOWçm šÑi^ôÚ­nœýÓóë³öŇywÝ#—=rÞþÔîÁm½ËkÝòϪÒ/ÀaC‡/ß“O­ÎéG ¢ù®}ÞîýÆü¾Ý»@æ¾î6ÉU³ÓkŸ^Ÿ7;äêºsuÙñ€ÔÎÚÝÓófûS묆à°!‰Ãí à/iýÒºè‘îÇæùy^yÞµ€ñÍwç-ÞPš³v§uÚCeïêö’8 ºZÌ?oîUë´oZÿh~4;¿5P»O//º­ÿ¹†›àKrÖüÔü겿 eé78lJâð¢rC7>½î´>¡<@·º×ﺽvïº×"./ÏXoí¶:¿´O[ÝŸÈù%öß÷äºÛªêÇ™6%qø¬Ùk2.á ô@êÍu·ÍÔ¿}Ñku:×W½öåÅùxù+(¤ Ÿ±~ryÁÔªºþ˜6%q´ý²ó25uàùõc ®w°s€òô:MTôn¯Ó>íåoƒ–ö.;½Zúo pØ”Äṓ‹Ö‡óö‡ÖÅi )»ÄüÚî¶ÀÖ´»xC›3û×&´÷š©öu¾­J¿‡MI.àXƒ"Ò~Ošg¿´QGRÁdvÛ©ye½âôcÚ‘jÚS€Ã¦üšò³ø¦MIü]Œ¢kÆ< <Ï;oØMàNÏïÌ¢-p|b£Zô ð×”Äßù¹îGä×Ô½ôïëLKT¤_€¿¦$þžÒp þñ;¾†‚¹Æøå£ôòߧ¯GÉ4<ŠÆ˜HŒ1~K­ °)‰Âçñ´Ÿ¼¾ˆé€\ÅÓà–NX+æ—FüòßûC—e ÙR+,[òcâ-=*Ò/Àbëé㻎«5@ÆÖË*@HK¯S¨¶¬5°5b“9¸)8ï¼"ùÜ€É$«ytËýUa‡¬58$ ¨סG€+Ö\YO&»¯C(¬5@±Ž wSÕ¡G`ø­5†=ó­8{[8ÉÎçâ8¾ó‚qœä³JV¡]`î­5æ¾í¶‘£P©I¹-0ñö_rËÉQε·.Ûm}·×Ø÷š*“gû,ó]òÖÝ^3ÔªG¾–ç=ÛjP“r„Øu Ä@ˆmÔ)T¶ÌpäøðÇ-ºÕ8-€ {Ãe¹îdΛ©Pya‹BHÏ‚ùV©àjYz»Ny´Vt‰-ç굓}šQ4 ìñáx ìÖáx Lƒ5q9qW53ÿþ:6O‹`˜q,±[@‡ã÷›%ŒV-ˆ”DxOsæxára¹´ŒZÕäŠ2‰<ÔjSÚW7ÿ@Ž (Š1šõá¯æ]ã¤ArjJ‡:"Å‚ˆVMýBe2P5Mi_[`‰Èz:°¨qÃÒžö¥ý­ =âú·‹Ë¨¦´/æÓí’1V PLiß|¾;›¨í¥´/¡ïÈ"jvi¯fÉû@%-íWÒâ¤Y¿¼7è®çGDyJ¦Ié„&ZÆs©¬¬„âÎæBT…¬š™Ù#FytéI)Ë×e¡”bBõX9é\U±µÍ!ƒˆ7( #õ–Ìë±­HõÐ7KÑqw"ÕCÍ|Ï,±cq.`è¡·ùÃM°Ì!|ËÊýâã7‰ìc=c†^$Òª1€â0)ŠÃŠÃì—9¼«dc†*æ^-Ðc¹JÐ-¦ïBb9P/ŸñMYõ€"1ûùé*@˜¾þÀ¾@üš¤díN {ìÚœ’¬ðÚÔ¦ø_;±žWÉh¡„ì6!bl¨NWd¿G¢ïH^lrÄØŒÐݳÈê¡÷dÀN`[àªQð­î¾ ŒY_cå ÄØÀ¹<`Dûû06TIžÍ~Åy ¨aƒê‘ûÅ퇈@ ã}É@ K)Ba@ ãxÊÌ/nf“Ž­ÂbgèÞæ7X‚’·¿% nP@Žõ÷‰Á ˆ¬þæ-¸Ay…ÚQåì ­§Ú"çH<ìŽ*»¾÷®Œ[tm¿v;nþÀŽ* ¹£Ê!FµþbÀ–*¬¿¥ nP@Šõ÷9A º‡È3º¼(ƒ\V*öùÊKI n¬Ô*Ø~Dëª. eÌÝÏ3ŽNó!2ŽÞ&וŽ·uR¸ÒȪ²•WR–¹7ÇYàÞ&áˆK,<Î.'×7 t\ r³;-ñ9.S À ¾-+5: ÂÙ~¬<,€õfý~Û¨A 7S˜,ó L:ŽX8SÀ~ËP tÁ¹É™öÆ’°ÚsVT‹7å•Ð’ø5^m}õRÃÚøœ©-ñ{ÜÀ€Í¦¶¶+÷³ZýÕ½c&˔ƒ÷Fµ˜`@l¦öÀ/‚1–çDIo R˜’9¼tâyå¥íð^µ#EãEˆÒåI+û°¯°Õ¿70 SüÝúú::¶v÷<»¬27ù0ò‚U ÃØGÏŒm±™Ú:>bȱ’Â{f˜ –…(s#µW¾ "F»R–.Z¶«¥Ç¡€ÐW[À½¸‘®ØLíôö v…lPøq/^:·JTyU”*a*ésƽða†ª²ÁÀÜ|é (Ca:µ¨“µ(,¥¡5ªJØ–ªXÐÅ·|>JªÕL92@½TK,¬õ’X%sÇ´ÖFT–sYZlѨ¢¯–âÝSõP7Âú±qƒ’KáÇ­¯êËÉÜÏË—5N•lK%Ç1ƒü¸…OtÁlðÑH.d<ؼ,)‰Æ¥#žžo.|?)Üõ¼Þû¨æñn ªƒ ª:R¨Õ`&XÌ€â 6(®ÀFã{ÇÎœ½2 ,¹¡iR„&P'ÁLBÇQ0s¿w`@13É»|íßNg²Z×ûýž•~õÇ훌œ? ^Í=߀Ì$´Ba@u3)A‹¹¡@8&fÛzßE(01@5³–álÐ2<-º‡}s;¤4ç@¥TJ¬¡ºÛ½Æ>óv”÷ª=bØ:†…ms &ƒj2Žé8…Ÿ1±]ÔlðAÍÆQ­¿±“ßmp’`p ƒ£j0ö³Ÿ8PpÁ{8û‰œ$x2(Zà)íºùNÈ0B©Ï€:!ÊÂê¢* ó*÷Žñªr‚2›³zfw|¬–¬*+k™ç¹2¶ž–ºÌy˜5y‘Ûõœus5l€èA4/†ò\¤xœ@v>hÃŽ ÏDÂÎ0&z-Õ±äôRJûs´?ç"E¯ìD?"L” .”*ƒk ßTD ª “W1£f&Ç´ZCsbô…+¯”(«”·¤"¤°6n;¢IUùrM_ø¿Þ¸«T«„&uleh¥ Fù0ŠÐÕ (Îl Ùóçñé“´î64'r¥S$›¸OÞÇ}"G¤í·‰¢îÃHߥQV—SÕÿº³H÷úûGÙßÿŽœ$ º·€1³ìaûŽ·Î¡›Û#JÐ2×ÄÊ”R’þ Á`z;èo‹`{Û·#¢"¿¼¹~¸|žZ›ýøý—Oê£áÃÅï¾}ùGô“&‡í››÷­÷éA!º’BN¥Õ¥ÔÎS#+LZÆs+·”4¬µê!/ªZ¡"ÖDʆ·XÚv“íÛM›´išÂ iS·W’܇Éë°º«"„ɼB[ï[&n†Ä'©¥6–:€ cû6L:±<Ë9Ž8Q8g©°¬Ò‚:«óRKÊH.™±UKºâMœ”ê,m[Éöm¥MÚ4 It‚"–Pç„4áÕJUÖYR”‚iÝ®ªfH¥/.{›ôdë>Ú~mP±Ïò/}u9¹Œ³óggyí³¬Ïúb>½™¾™|W·×Žÿ´8¯Ëô–“èIÉEã>€ÔÚîhÜNÄ£ÑK¨–ƒ?}sn,þY”Á>‹2í³tT{ƒ¿K˜tðdç‘®%ng½¤Ï?|œ­]ñèaóm:×m{U¤÷ªÈh"âI´q«,щ >‚‰P”iQ_üpóxûé¤Z®$H«Ä’˜°–Äp$ñˆ˜p§ÄÏÏ7£ÃX*¯_•HGf†k"x$u€°4ž†¬cSB´6^U¦ ÎXÁ®¶Až« |•÷1’Òpe$‚cm+›´[ç6û›­5`Ñtª¸“FlcMÕâœFãh²Â:ž¬IÎþít Û²ÇYÇ$gt:rÚúUð–œp(ëû‡w¯ôµPh¶m„=,°@‡¾·6Y)¨`ƒÅ½LF³) À³iRda7I[~ì]·!‡¼YW»·¼¹,JGCp/ð4Üc_ñQ’´»ðÎ$jćt"@°Û–d†s$x2§æ[Æ €Íëʵu¬%ç2U5Ê—€#¯x_btéK´W&¤;Þa¤÷vk@¼YÇÆå|ñ$k>ÏgECéÇoÞ½M'´Ø­"Fã•Å˜°á’­áñl¶Kãí$Žg\,²þEµoUL'óÅ*ÌRÿu”Њ ÁYAGPyiÀ)}¼y0°›‡[ã =ÿQ+3ždéP³ía Ù3d‚õ ç¤ñÖkJ~{œŸuHí¶ÅåŠ{ t.—L¡&Œ ÁS3g‚uµ¶+µ5ë êlHa²æŒò,:HnÛ ù[W̦£ÒKI÷üÄKò½ú‡¦€kC´ ¥9rPIÎ7%9!É—f Üïo–$öŽ¿¾‘û—l,˜V*Ò ¡±Ž¾5C¨HñŸa\^AŽÇˆAÑÝÎn/9J6.bÝ7ôbŠûGxQ M7©\çZnMaEUæ… ì€áΕ ÇÚXÎ#2×ÀNÊA]ÁX3·æ ª*û?â©œº“$*!±yÙñÓ4î4·F]>"×£ÑeÝe”k‰“’ù‡±€xi3Wˆ ×u—<Ú'Ó±EΘžœ‘*^®¸É~¤5L!fêeGçýº[ìˆgLbn-ùaßÆ$?Æãè`ÓbuþFŠ“nÚâì Ñy¹Êw.›ŒbW¸¾Ï®‰µz0e7.éó+èÆ=H¼?qkø‘1؇ž DƒŽÀSE–î¤o+QÛÓ;ó­‹qTE{ ª1p4þuø·&WàÇÀ„àý˜ÔÍFP6ÌæewàÌÔC·ÎL½ ôxˆîJ@Š‹N­ jGJV× û:ùÍS0p%ž  U ØøÔÒÐ8!c×çŽtD«M°âÓ§+"ì…Þ–à”«gR¬R—žýËrÇuY(¥˜PΪÊIçp8ÐU¬kù2dž*¡HåAÁ l ÆÆàÁ:Í Wÿà5÷ØJ"Tv¢9ý8q—`]o!`óÇǧ§Y5s¯c¯ÖìôôÅÚ×Å4Œ0YÌã×êoæ 7[dÕtFήãçúЛY7ãæÐÉY cYF$kïÀ‹góè¾xð{?‰@¸k’}þýáæ*c:c´åçBKî4˾½ö“Šià°ٲƺyø7‹ÅõùÙÙ»wïž–Ó÷^ûÉÓéìõÙå¤ôïÛÿàÙåÛ×½IdóYñü¤»âzòú$sW‹å7aöê:eúÔo$öé«Ø±“ßAø÷‹æâßFïbîÏ|õߧ¦–tƒA~:ýñ³Óϧo¯Ýâ2¿ZçË/žÛÕ5M5ÝëFOgkç½li#@ë —‹+ÿ¢åçÙKøa1»)7A¦>;kNxð,¸C¿´Ò}áòà¶Ïç'ÙÌ_Ån7®üü÷‹“,vl+žï0/f—׋õ#?»_]óm+ñþëŸ}xúó<Öþ5Gp–&sß´Vï_½6ßN¡ ¦œÕJ¦}­6‰š?Z1‹éõI£ËiݺgæßNõÙâÍå< '=É.ÙeT­ÓyP A/¶·þ¸QÇËq"M]ð2#Ëj^ù¬ðWWókW\N^??!'õß×A¯µ¿x=[4³ â.Çá;úË×oç™T×ïO Ëî`{ù镯Â)ä©ôo›s²åD®gÓŸý«c‚xÆzÏõëM²O^§öiWØ[ØX.ñâŒS<[Ìš_>®Ÿ²³m›ÅOÊ,ÒyÃb‰V&H àËÖç¬Íâ~MßÑ“¥]8³yÄìY0[þ½«y$Éî;k›ÁkXãÃâˆUÃЭÑGE~§zZlµT-ÕZ-ÉU¥é»¡&?"[å)UÖfVu¯¼ÚÁŒÁ`ŸüµWÁìÁ ÆÿÀàóîÁÂf0,øâ‘•U™©ªŒˆTI]»D•¤ÌÊÌ÷^¼x¿÷"^¼˜í÷âÑäœê÷fÞdÖ'aüî>uzƒ„ÿSçEºsoâ¥Á…óîAåGĹO/¾IJ£7Ž"V”æ@æ@.½'íŸ qÙNÊ'‘†yêžÐ#s/ý`{ÜO3mÕ¼¼•œ¼!ߟì1NçÜ+ù·IÛ^Hzé îû¤Gú¾03^5'Š÷›èöCÝCV°Œ+óéÃâéÃЫÞè¹QÈ'‰¦²Ú¹7ù½¬H]f ß¼3Ó6Pµn­;U6òB€]jàÒƒý> $£—Ê ôI&t×€<tþh k(±—Ö…ÚùÂ…qæ²ãéeŠví²iQÒÏ톜ú€(Nô|­“~’>Ÿ¨˜Æ õTTk“£Ì\fÙÆÝ[äÔëg.Û«Ài /ä´ëD‘sK3¬ÜY;ßœ{e1÷³1, ÞÕÕnlu1»p<»ÚÔÔZ ïÉ6:Òìë«ÝÚzÇa%`µ|ÿ6Þ F7‹À'à$ûd®(“€¹Úí¾¼ºÔ ¨b׬7¨Í­Åì³@ºçI³o¯vƒÛ‹9îU0køî<µóžÖ¦YÀ{vɨŒVÛiÃ%N[‚²ã¾É3ý9n¸Äqë‡áPžùÕöÜp‰çƆ,ä~ƒ|7\â» Æý 1Ùj{n¸ÄsöÇ£°;Da¾ß ß —øné;£iÙ¬¶ë†K\·”ç.“gü òàp‰{Ψ¢Á[m'—8q´Fˆü0ÌäÅ)%^\LG”+…çÊj{qJ‰7ɨ•gù òá”.¾¼pÃ~þWÛSJÜ8:D?Mù–aYÚ‘ƒS£‚ žß¡ Jœ¹—lâ@LùyÈd*7yH&cV'ËÊ~›e5{åòÎËn@)_î3ÊóhGÄ™üå+ÐVÐoóîâõ§§Ç_÷ש®}½y¸ß‚ßïÀÛú¥¯Âç¿úµ‚_7÷ëï¿ó_?ùí_ùCôË/þâïÿäçôø‹‹Oþãßþõð7¿ù—Ãèßÿyë³Ï¿üìgŸÿío´ŒßE6¿ö¿ÚøóÏôßÿñ÷íË¿ùQ¯ùW÷ÓŸýçwjöÅ7¾Øþüô׿õñÏÿûËŸþ‹ÿÂá7ÑOÞùÊÿ\R‚šãý¿üñg¯Q&ÿŸ^ùü¿«ÞœÉ­]Ê3Jû?Æ*6µBÿ7´·ýÿn^oóÿî&ÿoZáµYïB4MèmàÛ,À·Y€·˜¸Ül¸Å¹v¯; GIÂã«äËêE?t~þ.É1¡T¼ ?›`Sϧ Áö?û2½&#T8Gúäbmn¨ ±d××4ÏÐtÝv]âÏ ôšmiŠ§Y¾k¹i0¿Ûxý±O¦Ê<Âö-K÷|E5­š/Û ÕTÅ×uKÁÁlQÝôö)÷·›†˜Ù£râÜ7B 3I> ½1ØcÃÚ( ³KÕi‹1›¹kºz*¿žìú¦35ÎF=Uب§ÆÙ¨!ÎŽÈ“ü¢µÝíõ÷7oúZ_Ÿö!ÚË÷öA¨°óç\ºY‡]_Gó_Óq£ž9Ñ傯±[ÈÑ^¾ƒBš8íw.÷ò½ Òo,wúš9ye/YÚËwDÈXa¹—ï ˆy#¹?éEñ½$Ý?dau»fn+R.Eîåûö!d­°ÜËwÖCÈ ]ꉸ|¿:„k"Ò’{$]0yäú2_rôs€ +Bô£Y9sb‘îFÎ(fÃÝðyNüÈéà‡ý˜Á¾Óÿ~¿ €ÿST9ú9`†…Àì5ÊŸhXИ]Úèv»Ý ö™}ow³Ç®Y(9ú9 †…@Ñ¿ÍÞð¹_;>ý~^mX¤ŸlXØÖ+“Ožß„~¸a!pú¯>ýôÓ«O“Ïì{ÞñÌçv¸x~ú9‡…ŽÒÐÕÞ:…¿Áû±¿±ÿö’c“÷£ôs]=§ÔçZ@’~ÈaKèo¡«þ 'tx÷SZùôSŸß+0 G¿ÂLE2ýuFgBçÞã”ÖÁ|ú)¯WŒŒ IÒÏÁ_E Q¢-ƒýqÂCB«Ÿ£~ÐŒ~T`@’~þ*‚ø t2j.ê˜þ$ô=bz…&ǧô'=†þýe¤Ÿƒ¿ŠþRzšSÊRúQ†V”y?s HÒÏÁ_E¯Pç¢ô礟ƒ¿Š(þ^¡Fuú³ HÒÏÁ_E¯àãj}fßësŽçŽm'Zó|=e@’~þ*Âø‹NÐÕ0Ñû¼ÛðöÐUx…†èj3±õ=x»è*ºBû„¾¾šÈäéçà¯"Š¿ïÝSí‡$&¿óÿ-ú-sMÉ3웞•”ËQ,_ÚKŽ~•ƒåª –ï…ÃˈÎ:¡û{À¨YèlÐc#£KtêD½x³=ö!¶e^ó¸Õ¬/…~–«¢XþºäÏÁrUËï«›ptô¸½ú= bòàèç`¹*ˆå-â÷è(¤;fÃøTG(3½J’:;äötd˜ŽÄI™0b¿Ãñ¨ý,W±ü"ô{AÏc“¬0ÂD½®FáËžŒÎ›³Â~?|Õ¼ 3ñ>K/ˆ+ÊŸƒåª –SŠ/ÈhçÆê/K?ËUáXzY/Iú9X® b9Þ*t˜NeMtß }hqL3 Fô ªCŽKs ¼©Ý„#èõ²ôs°\År”Ì»Ñ ^JyF¯iÇÍ+=ð ·è]hëÆòçà¯*ˆ¿Êuùƒœ3ö&•?tf쑹MP~ƒ¿šh,¦ P¥ÐD©äéçà¯&Ž¿ù‰\ vl{Ȇx/œ‰zN?žÙRfüÙüo¦Ñ¶äéçà¯&ˆ¿êê1ôÆÉ4hÇ`‰Ò~É’‚\Bͧã×dà‡ ގ‹pDP¢V£Xš~þj¢±4ÈDü €¤D‰â0½¢È"l<$…9 ·G7¢7H .Ž“¤Ÿƒ¿šøXök±ÿ5Aüí6Û¨}ò¤ó¬Þj øû´uòas¿±'¨~Ö9b~ÒìSá>éÖÑi½ÕiîÕ[èô¬uzÒ†æVÛo¶÷Žêͧý vˆƒÃš 7A¾¨ña㸃ڇõ££¬òmì5éï6@?ê­6¨vï·¿s_‚“h¿þ´~êr¿ e’ôëÖq¸¨ÜÐ÷ÎZ§´=@·ÚgÛfç¬Ó@''û¬·¶­›{öCttBûïtÖnÈúq:‡uAÞ¯wêLÊ@8(=Eõæ¬Ýdêß<î4Z­³ÓNóäø: ǽxó8$}tŽ½s2b\Ìo “Ãßî .KY‹ ñ˜xI/Iú9XlÜ}~׶06 `,vSBj•›r`Ë(­!ÌñH‡ÑÚî½^0ðI€NÚG]ê´»‡rRã@QAyZÒÇ–P Ñz·¾ ¹Ä1Jg>¹bå…QEL–L0Ûü^¸uNí=Ão”þ2zfK5èèm¶t¦Í–clg¶~¡Tȓϱø†]¡W™l–àk2 &ªêßïv½aÓ÷)&MŽA5K *¿g}B._…‘¿¶K¾m1˜|%¿ö"Iï÷à ´Ü{߇êÉ/9V8¦Õ,.ùà}9ÖÕ,‰?ŠMF~/ãŠc†Ma3,÷XŽÅ5…-nΞžµš©MEIOÖGTioŽ•5oÇÊš+kŠ¸ãÛëlL{ŽØêXº¤5î] û—cŸmŽè8ð€-ÑdU¿éHøÛ&Ññàœ»l :äº7Po‹l¡“M·P“­É%Ï_¼Ïˆc¢L%{1Ñ]_ÉQÎ1ɦ Þƒ˜l¯Ñ)‘ÑyŽ_œ…“ ´¬¶¤ˆ³8¦Ýó­åüI«Ì~Ï€’]9§´£k²é"Ú¦FM§ÂÕWP¸ë\áJ0™Û#[Füe^‚€øM_óh·%5RslGÁŠn(–©Ô4Û׈­%â7VJü^8ˆGº-Ád²'ܶZ(ó™AÇ:(‚ãx`cÕ1<¥ؾbéĆƒ®›4‚¹Röù·g²œRÀo!¾²$i)©nRæ ´Fé3-Íö UÓUWˆiªekžnëÖ¤…¬•j¡¤›HX)>“×»‰T#”¹·`ë5PÏÒ•šQÓ¬Öh!-ÓÐkÛ6!I#Ø+ÙËé&| \o!ùÎbs<}»àé‹Ý”3cW)ŒasÆDl‘¹ßíõ÷—8^.Þ؇×ÏÁšÿš.¦ÉnÃ>ÖéþsK™¯°9£7¶ØÜï2_rñ¥Í²KÆrÝß;íÈBŽ÷´O{àÿ©ªíûX7ÝPuOó• æk¾À‡‘‡¾^ºŸûdödö©5Þ(‰ñØV,ŒÂ¢Ý‹3e— A-I:ªáBÈå趪ئ¥RÏÙw5ŠQ3¯ rá³Í³K†ÀGÕRl×<0í¶fâÀ­YtÝ”â;à¦î/Ïv<Œ&ûìܯÆ0gÄÌ.1[R;;5`”85_ñ5Åv] mY–î;D 4Ç)DHS~oÖÐœñ6»Â®•£'œ¯rÓrô„óB@·Ì—ŒÅœ Vp~ó-âÐ…<Œ“:Ì©bçWè0§”œÏ1ëNb=¢7Ǭa•Xªç¸¦¯«ºQ#¦çÚ¾xfLVmÅz°è ¤`§ÆœÂWpþ¦œ’@ÈQ]W3}Ë7±áCÿs ß3½À3éJö¦SFS%ÌF9öÂù*f¤ÙàüJû˘S  ÎW6#OÉ-ÜO'm’µxÛ>™ý³Ð¤HÒ_8p~Åͧæ.Ô¼ªÐ¹TÛÐ7ð<Œ Í tâ**ÑÜÍlð•óë‚5ë^¢‹SC —ÕÐZ–SkbU×ÔšYs|bš¶ŠŽ@ LfÁT!•};Ì)¹…‹%·ÄnÊC¡:X¯ÑŽpê`a‰:X‹^§Éü{Ö‰K¾.I?ãë`-ó%iG8èV(„UÁŽ8š–kŠgDñ‰^³!Î lK·ÌšN …×7éd\-«‹µ$›(˜Gƒ`‚±C,¢¨¶jé:ö\Å‚`Šäùu|ÿ:·eƒY_L`,SdÀSX¸Ð/+Ú•ã!îý鎮‰WD¸–i¹¦í€q®Ù$PmˆU5byDªB=ÎœÁî Þ ér\’²’b †—¤êÖ°¯ù5U °¥yFM ,Õ5UL4·æ;È÷&»TÅ[©çr*’ᲊdKR.Ý1|ÓÆ1|…¸–¡š¾«ù†ªbË*ô\úœ)÷sGú…Yç8B…bfl°mAô纎‚ —¨ÄómÅ jŽ]óÏuŠÝ&“P% ³Ëq„ŠµÏ²—nù¼›Ûã9™a‘ ¶\ˆ‰C³Ã4D..öZݧ!NnÀ7»‰´°“Ë)”† …Òª´­¢9ÀŠ jû®¡èŽæ©`ý@·@£<“D¤v©cÙ˜Sz K¯‰Ý”ã‡롉ݔã•)»…jÌ):†ËŠŽÍMDE臂Oæ Y¹°§&cN.\V «z.æÔÕÂeuµn£ù9u²pY,éÅ)ÙuÉfŒ²ë0§..«‹UBMbÉä©áâb•+±›VKh4ÍiV,VEÓéScºçLšÁ¶¢’c ¦Ä²g1§l .”™ŸôJ„^#Õ”¥_¸R¿çXŠîBDê¸ë)„Îôꆋ]ÏÓlB,º ™’?/o7ù;;“î,XÚÙ™éc ZK<;—ÿ‚±H&Ro?)Å3§1§d .”¬aþ÷œÖúá+ЀiêÏý}ëÑ=Œûýáhꔼç\ ²oRá' ‰^/Î)Ç[)·™Ä yÈh<[ŸT®N÷³Œm’Ëéê…Z6eãf³WNÀïßb$?u"9µnp¡Ö åBÐÕáT¡Á…*4åÍMúqjÚЖ¥ óÂqÛ iÄeÄqÈ •bïÊ©ß‚Ëê·ÜÜÉäT_ÁeÕWnàdrŠ¦à²¢)¦ÏÓ Éì³ËÁæ-:Î,ªÂÖhä­±M×’ ¼;Ù»-÷ Ê1c¾'¨KŸ‘¿Ð ×»»û”~Voçƒm—ÅùÙu¹Ù d凉®™º;iZ*{‡Ãb¼t’Ÿ¸ÜÞ0‘j¾H¼^2RŠ—,HÇ©,XÃ, –W¦›Ny;lxRZ®üq¹Þ`4g±p #Khî-î/S®5ƒ3¹jÔê‰ÊÕ4'rå{™\¹Êy¬;;óÝÖÅ’-€Ê bÎôõ.iEñü&½µÝ½pð’D£ìýè¢Pž+_¹E­k=…Æ+ÓíÙv¦‘…H‹‚A´¦Ó’…r’=’¿@J¼GVXlU¦/l@¶×Qáú¥5[L7k²tÕ›ˆ$<‘$]&W’k<3’Hõ¸\ž“EÔ(ýîe—SwKBÛ§ZÈ_'&®…•×œIéb²¼dî–(Y#'Y£Š'ÃÍx‘ðd*eÏHx2ô’û·æÁ(v΃Qì* ÊT\ž§_  ]»¤|¶v‰òUéjÌ™|Õtݤ”|ùÙâò­”™!¡®pEQ¸ÌÊN–ž±_K°™sUSÂUœÀ”8][Q·TÆs† W1lÜtE ÃV1õ±<Ž˜Íë^¿z©!„b©9ÃF«5HË“?­,.ÏêSÔU$š^?qq6hM˜¥Fh¦ž‹ÐL ïp*^þb3qñV\¸&aÙz‹Ç–.^6b3o¥ñþLˆ„òÞlV¥‚¹¾È™œÞv‰–×ÎYÞ*Âæ¯7vŵ+UÌ»xb#Ö—:2FcŠÌȘ­U*¿€¸P+—¨¢»sÔv¹ kåÖªb¸ÙpÖá&™uUÔ6s‹‰ò.ÛԜ렩U\þšY‰˜¨âú[ÞÀº~ÙíEš,u'cÔ*.?^\ªsò«è+»øöD«*V.Rª~V¹DY)C½ÄÒ²tfT¼ènM=çñªz—_YH\È•«É/Ïü°ÛôÀÌ U$á¯Ù—0 ÕÖÿK‰±½ý JÃÈ]£Êp)…±¸d«­V®bs™g;Yå¼Ìq=?`ªW‰ø©Af Rš‘”­¥‡JVx,ÓõÂy× Ïq½’¾µ¹‰‚ÈyAs:Ðæænæ0Ð5‚£1=ü.;œh„‚0‘ éßìÔy”œœZÛû~Dâ¸pb÷ƒ˜ŽQí¾{0WÞ<@Oáýq)&RjXGXÝьݢ[‘Ìö%q/ÑtGÂûùh4ÜÙÞ~õêÿØ»öç¶q$=?Ï_ñÔ^Ù[">'ñÔ*²’èʱ}’<™ÔåÊË”(C‹Z‰JâZïüí€zP$ÅiÉÎU]²$’¯þÀ‡î¯ úv÷‘Ñôc“#û¶˜güñÅèöcF4›ú§Ë_LÆÆ«3\ú%…7ì†É?&"óSI–ÄU/ îÄ»xÈo?þðÿÇ“¢&‚È—5ÒÂ0Òb'ÏÐD_ÓuñŽ-CK¿s…&BZ?`b$k&ùÆn擧Ç\tN„~ð’˜2[ÿ=^ütvÙ¼¿ê QÝèêúåy·NšÍw´Ýlž ÎÐooÏy¯ÖÐ`êŽgR›ºa³Ù¹8@i]ò•J52è5¿‰´°øñâãIœúe#ˆ¡aä¿Ý†ãÙiA2Øqœä×ò^Ž¦üí–Å\‰ñ{OØ?ç£/§íDמ ÄF¨¥æåÀ¾ÅÉŸ £|ÆâÓëÁ«[ê¨\"œ\·NÚÑíÄG^˜N§Û9uÖ¿Iƒ‹©íhšºï,Q‰ê“?ˆGqÈ~[*á_Ñ$œÇÑÍ|<°á£~‘øÕ(äp˜Üûã‹p4þs¡¢c×ã4› ) EÜ„»Í>1Hgå‹ŠÄÃfþt4‰ÓW>»_ÜäìBmþçœMïŸg’D(¯¨ý0¸ÏX²c?û딼KTPI¤XTéz ;%Ž& Œ‘Œ÷:e·":° ¤Êo:F#épžiEXn‹Gÿ”`ê*Q¦îT £ye¸¼Z‘ÏÂPlÞàà~z ÈïN‹ï¿ýˆ^ĉ4üÃÉ ð–ÉDLâ_‘aN¾=7ñ‹Áòââç'!ò[´†Án“{ÐJÉ4úÌË/1¡–íAÜ‘&“¦oœßzñµ†ÓX’me‚‰ù!>ıO“·%¨Ê\. ”Äð`ã‰rÞ0;Ä…µÁKp£õÊ{RòÝ/Óè+>XÙV¼e&YD/¸í±>+B%/.ðKáhm/¦ ™ßßÞº£q’ÿ+÷ãzã‰0µø‹ÒXí¼™m$t±:­’ˆ;æ-Jäz#37vaú«¨iÛS[ñyçÓ©äó®Ròμ)èÞÅI½hÎä2—µºYÞd£¼IÅ/–$Éãùhµ+¾´¬>†‘熛©¼NΩä(Ÿ®X?­2ÄOÈïòfñ›T¡òk,d·éD,\înFÓ )õ-ðQ°Á,—ç\ì»& wˆ½…¸‰³°Ê˜fs+„QÝÇ6¹I2t¬¡¦;¶‡ùcñäf,B5ÏVOY–A~ À•ÚZ;-žšt˃UÝoœ–Úë 3”KÎmIòu©¯ž™¤“}èrh"’N„Œe¶^G‚—)ão„—±¸¹Ú-«!sœJu9Ú6¸÷!TÇí-àM¡l( Ìf‘´ ž“‡]ÞžôRò¤'ŽgÛüïd#YnßbTUvÀÝ-Rr”<øÑËðt‹”\m)÷µjhf¬¾Ý”;à‡)…8}¢rœÉ"¥ð¦[Ûû«Ñt£/l*JÿWD̦f6‰†õ”;à)¹Û{¢r|»"W{•žøÆCX)@RµGèRæËnO~ÀªÉYÖ9ÝùÑzй¶gepÜe„b1=8‰Â»O,˜º!ü(”Û1b7ü“¿dÿ§²¡V“3%?xOYþ Uðƒw|sss||s,ÿ§_ÇÙó7és9 UM~Ôýà‰7å‹ÿon¾rçWßÄÿûãL*ÊVŒÝ]W|ñ÷á!òàVæ÷nCþû¿þúëþ¯äúUt>õ¿yÃsñáòWæZnS~ôÝ·ïÑÿtÊ_çH~>•ßÚɹÅëtù¿î?é7j ¢üÈ•9oËÈßC÷á=Šr2þ —²ºÅò‹<~ø9“jòÞ×P™÷µŒü-)g¸3æ¯ùRÖq±ü"¯÷2©&TQ~‰þ¢¤µŒ×òÏ’<$²òó?´–e2PQ~³>ÑJä#¥¹K¤“í'‘ïT¶+´8¿’?é1âó”Î@Eùü%ªñSîQw%ÙR~”’¥^Ùÿ¨(?€¿Y§d%òrrªÊ¿‘Šòø›õV"§¾üé T”Àß2WkùŸ¡ûgòúõ¬àüƹfÒj><[f ¢üþ–¹fËȉî'I»óWŸ¿|tÝ£ º?Itýˆ¿+¬‚òëþêªci´juê-UuùüÕÕñws!—KÛäº=’S¼·n̸1ÎÖºT*¹þ›ª´FuùüÕñ—6Ѐ #NÖ yë˜sX²ßI~Ç¢bþšƒhÊÑMLoO£Û(f(iVñ¬²üþêê±H^Ä_¸€C.RÒˆfÑ0þ*a‰°³ óÌqqGx§àÆ ÔÍfIT”À_ýá1]öªÿšHWÄßÁ›nõ/_ ÞµzÄ?_õ.ïžuÎÐË÷übµ®o.{èÿhõùe9ZI†,­‹3þz:\õ:ý>â7Õɀú"wß^w¹Ô<½ÖÅ Ûé£îEûüú¬{ñú½¼ ‹Ë:ï¾íømƒËc™»üϪÊà°®ˆÃ—¯ÐÛN¯ý† ÑzÙ=ïÞË~Õ\ˆÂ}ÅK·…®Z½A·}}Þê¡«ëÞÕeŸW¯µ³n¿}Þê¾íœÕÐCëŠ8ܽàå‹:¿w.¨ÿ¦u~žnx£9ëö:í¨¢å§ºýÀa]‡y[á­žþù1ê_uÚ]ñ¡óG‡·Vïý±hÝíË‹~ç¿®ùMü":k½m½æÍå0ÓÊ*ÊøEeþDÓòg7ïÆíë^ç­¨Þ¶ú×/ûƒîàzÐA¯//Ïdoíwz¿wÛþst~)úï+tÝïTµã¤¨Ì#iZþ³Ö %K™ Î=J´›ë~W6ÿîÅ Óë]_ º—GèÍå;ÞÐx…´¸Àg²Ÿ\^ÈfU½ý®MQ™kÓM=ڹ콅(ZºìÀÇèÝ›?߃7žA¯%ºphÚ¤oã9\öµÚ¿à°¡ˆÃëfŒ.:¯Ï»¯;íŽìRäà]·ß9⺦Û7t“Â~×âù½–ÍKôu^âcUù6qxÇŽ¥"BÝW¨uö{W´‘…Œ\eö» õ*{EûÍ¢#7jêÀaC}MùIìÀ_C³,ºcäò±@B¨ã–ç­;M¤?€õK¶…nìÖ“À_Cg+&H½[˜—Þ]i‰Šòøk(âo›Sn¿L6áHA„ÇÐätcqúïó“Él4†2N†,øå@aC…Ï£ùhvr±]Esÿ‹e.Ö§“äôßGb’w™‘å°ØTïè¨(?€Åæãó»*ÅyÔLŒÍÑG5@H³FLÍ`Ë,­Ò°1WšOUÇh&Cf alêÈÀŠY#µfºÞT-µÎä?çQü¼Ñh.N4£YØÜÆOþ”Ü]­ ýnª¥*•ùÖõ§Ñ¬žˆ€ò6ueºÔÒê$ (8KEÁ=] aÍô›¥J Ùv¬ø¬bvrºw[#‘× P¥ÖãX«Œ¨m«FX?Ít¯U#¬Ÿt¸²5Ñ[ÃGæÒ!>¥Äv¨aq¨ï1Û§Žáò¯Ô¶«KÉ–~\¶ÕÙÖ`Ã/¶F×Yl”úÙÕˆø~ÀÎntL,§6ñ™ã-Üi¦õëÚéãÂ-ˆÜL¥SHz\+«;Efû±=sx¹ ,'z›*}J-% Ùªz’ŽKsédr©$Ãçc^ÒbcÈ)ÂÇ(Ù_{Šª(z§Ž¢wEm[«ú&Zï×K–Êdy7*) ÐÚNvÿ\Q¡'!”øwY臟yqó»?KC+‘‹ûå—#E©]ì䣛 ¥S£á¡ìV›R&†^8ŠÙÔåí;±"î?Äæ„bÜ+Í´¬SGË:€–u²Aö×B*–[ºÇŠ°l×ç窘¸N>ºWÕ øåäåTMüa\¯VëÙÉÆ Û^€©ˆaŠÏ´³“×ÎuÊJÔÞ†®[T€šujXÄX"‡išrùý$Ýb”µaÕÐÀŽc~=W3{Ôµث̯—‹³­Ÿÿ$N½T€Ð‘Z^¹î¹\€Zµ»Ã! ìæ× ¯GÂ" læ×ëte ü¢–¿X#Çü7yåÇ‚”õ·à(£Û–†›rÁaµ¼Jþ·jIE €ZÖ˜•¥¸0TU« Øf‹qVë*Ç—vÓâìnZµDý‡•}54Q y¡;þ‰ŸWÓ6ÀFUŒ«DÎݪkNeó ®¢n€=¨)ÂÇR6ÀSŒóº°ªhõ, lÅ8k¬*& (B Ä¡M7׳ŌU¼ ³I"ªÌ|Mg0 Üp^¹ÕoÀ•š/ óp¡Î{¤æ ì¯Ä$¯+kXéË*ýým–ð4ØÉ€ÎàdÌÏ®Î|×l˜¶aØ6RæÙºÃ\ËdŽ3rC?RdL¹ ÕNrÓjÉÊTPî»ì-À¾HLv©î«ô`Ã#&O©ìÝŒ˜<\ÙóÞòÙ½åe´“Žb{èb0×Ð)%Fà®eP—¹ lá5›?­R?P…ÔC`Ÿ"&O„*ÀþCLž U€Í€˜<%ª;ý0Ý ª ]?Á”Ýt®‹5×Öt¦=ªÙÔ¦CŒ}Ó2,Ïr}êóú“¬Ò[€-ƒ8»eP-QShS6æ‹NkOàZžëûbMÉq<êm_³ý€CaâX\“ŒÙ7ér_5e·ó©% ÀÍÃÇV=rÁóSc$l“Ã4õç­UÞÀÞ7Ló3ץɀmm˜ͬ<¢.€­2Vî÷šc<`K¦yPœê6‹a=«ÂUÓ4bv—Z¢€FÔK—ëÒ}^l¬âgëô{`{Ö³&õãt/`×Öóñ±º°¡ ëYMùH3'À%œÙ ¤Úò=—Ý6¤–( ²{y”-%X+Q¸Nt=?p fë uj2Èíì 1u][Jf쑈âk>ÑH ‚饺M ƒ`ÍåÆáè~¥‡²#^ˆ2JÌpld±fߤœ¤69.šj7â8ÃWìFcgÛj‰¨”¥Q+%ZJ]TèFŽnhfè¾é¹†aúC‹‰€¯vXž!%³p…n$â>,»Ñ3•ÆèîXó4ÛÑtÙ¶ëXÔ ¸X¼YaÁÊ5žu¨ÃÃGî=Õ[9+@-Y×-\Ï•ÿ³’Û,[VTb髶9í­,Ú«5o>²é_öÏoÞ¶þ¸ûÙ.^ÿí_HCÿV• €{+GçQK@k+;´áÅë»ña’'3âgt%Ú#zÁ[ü[ê\œ] -n¬üЦrÙáºÅ€‡•Ùìx¥Ú`ÆÎOaU.­fÙØZÙÙµ Ehµj×S 6 @mõ‘ JQ&@OÚY=©Úlgç'j¨£îb2[>¸n#Ô¦Ÿš-†_‰¨è!zÈÆ‹ïG*²·ë¥ä{QuFgC0Ôk´†ÿtoë¶@Éæ¸å»ißéÒ@kÇuhí µã­½Vx%W&j¶€ìŽsd÷ï©ìcÕàÙc§ÎÊÀÇN~î{\µ8ùØ©±ó ¼z\À«¯ÑIÄzNÝ. CŽHÿæ;À°Ç ûG4àB=v –&vj€}OrìûÇ4â ÀÂ',|53ž„z’#Ô«¦[®IŽ!¯˜l¹b$9ž»˜…˜27 #ÿPq¥lg^zRæn"‡6|„Š'k’¸ÜѲ7—È’zÄ‘rû(W´$G²-wr§^"‹ªŠS®¢‰V‹÷CZ=ÉÑê·kˆ)‹çÓñRG$™UÍ\¹&%b¼j)×€D«±¥ˆäv’!¥–( ‹”¢D5wºÉ»ÊÒ+(ôD5JTùÑc®l í¯—GEùÍúQ¢*m²'EŸdÃD©% hÀlì&¥DKys ‹2ÚÄ':ñˆE-CwDZ¼Àá#OËð±\”!‚|—]”©½¢°L£ÛÎx|Ó 4Jê0Ûæ£a¦¶îC£h™†#h¬Ò(!ã34OæÊÛé@$9 à‹*-‘€“GhéFóm–üvñ-º\•&„xžfÌñ5߈K|×ÓÕˆ8•dpBaÞ7Ëe4‘·ãeñŸž ƒä_2Ó*-òñµ@óÓ4êšu}Ç°K§–æá‚B½•–•|òÑsUÛà$’'±~uOÅPXµ®ÅJ뙬ËäX†Ê3ÚÕ¦± À5$9®¡j﬽ºàVJU2[LB ) Nv?q\Ú¿V}š›šcžK,˲õ¡C©8.áêØ6ýlŸÙÈujÕÆ X©LÄ­•"§F«Ô `Ë •ëDy"W­Jv¡fk I’I²¤F–Ó”*àR=?… \)UæU¿¿zÐ(ÇXàÕjÀœôû´03 a»´B#TŸ½~kH±LPÎÑZ•gàb*Ñó°,ìÄ=”·jQP®g¡\µ (ÔsDIµd”ÓU|mÍFMË p O2®áK pØN²ÛÕtlÖ‹ºZ¢€îTrmþtÞ àÚœ¨º6/8Þ²Ûhz‡¤:’akš[Ù:)UQ~@u)º6ßåQm" ðmN²¾ÍÕ´XÖá¸R¢¥žm&¢`,ÑI Hö{ˆzÀªZ€‡]bªóä«0‘«Í3>vI»ð±K¬ìˆC,–%E|¸Iã¯]$Åki¹Å°ÉKËBy ð L¬ìèg¿D3®k+5€­Nrlõ½r¤¿¸b‡îzí]5sŽç8óû¦þ¨»"…žä(ôûååTnW„×qMLŽ=ÉqìU ãtÙ©Ê q†H¯h#\xbÕØHG;±ê@ÀCÝD;:ö|Í7,j˜¼çx³]Ãá*Îs‡š$+Xût­ÛŒkO7p†ºE}]³\ì˜Ä%#8À†[€ Ã)cO°¥ˆ^’#ðîõEÎ.)àìî¹Nö«ÿTÍ€½Kê°w ÀÞ%ì]Q,µŠdçœv{I±7'ýÑó˜À‘–äV+*k€KK2\ZÕTä¬Cm%µ•8u¤•8*°žpš`®G=ô¶ã*‰¢’æëÌJn¯(? ƒ³Î¢¿·i Pc©VCYÒRjš‚aba1Ëð<ÓѨíì©á{ž™ËˆîKÉ¿mon5=#ІŽx[†Æ\)tnYLl˃à( wh˜¨E¾ _â<,m9”È?[Æ…>ïR«€Û(²7-°Ýˆ¬¨æµÄh{ÜÊyõ¢(¬W>fV õ¡X2FU5ÿ(@¤9?½{·H)@þ£þywF¡IøßU*‘¦Z½HÊQŸæ|ïŠ#Ík߯©ÚõÊÍ Zàê·†vI‘î7 ýé¸÷ð%L | ¯ø÷{®¹Mªœ¡rƒ…ú V5Ç)àD˜8Þ1‰~{iÎoï¾'ROE«ðL«x®Î¢€`Zàøæi“/ª%`OÎ]ðn÷˜QÀ#0-ð,ÔüWw:æC“MµU¸½¬ÐâD>ÿÕ8Š‘ü"CàäË:»Ò(àÞ—æÜûªªJHI[ x祤Ƥ--¥:ª,ÌRfi,À¶OMÆ?ô±g[¾iØü³éJÉè#ïp1#ÞP§†xÉ|bëö0ÀŽÎñ¤í‡Ñø)&])Àª¤9Våcm á’æ—1¾¿3Š?H•4ïdó1(þ [Ò¼ÛMµd`É•)þµÖP€XHÿ—½gímIr>çWp´ÀÁb›l¾=‰¹I2›½L2È$·{¸;M²isFµ$Ç8Ü¿ªn’âKꦶ’#±%’ýªª®WW{…ªNÂô ìMYº,Œ¢$‰_4{ñ‹~ªvª®G"0{q“{^Ϫu˜’ M³´©Ê$Á˜¦Ý7kŽ°b‡)‰þ4·‰þ4%ÑŸ¦-±\F˯5d\UºJ"_M{À{ÌÐnSêjÚ=ËK±_‰ë† ªu*‘pö¶ñ+ªvª$„Ô´·²$õ‚M{ûgײµÀÕ‰ã… ¢b\Hwš# …­P§1ŸÙ¨²µM‡º|ÇÚ†gøFÌtjzŽMMÃt2æà ÇÁ$ºÞŽeÿ\Ò]qè.Õ¢eãH6hnWäÖ”ì™JEn{Üœb2®My?Ê S¦gö+ݪu+a?ý"µÊ€à~š¡³Åü—4œ*€tuIxÞˆ˜½ÖJ¾ZÉ‹ƒ®DÂ<û¥sÕº•pÏ^ù[UŽ>/’ š½j·ÁoÆ¡IJÝš¥nÕHåIÙÄw€aº1%å{Í^ùÞG„÷Ðf?Zo‰Èì•5~|x+3Ime³W[Yyuxœ9[b‘ÏAB§:ý@$Q5zÅ¢Õ} ’zÑæ@½hÕIKÄÿ@}çµ"åo#e%Å”MoËr™ÊĨ~\ T£Lê‡C†}e šôZŒ¾Z, <7‡Ï÷ŠÔQçÈcð:Ê+yÔJ‚×MDÅØ‚¦$ÈÝrß/bÇøìF uDŽÁA,TIø½9~ÿ˜pÝZÏ1ÌAõjI¶ÙË6xDxï¢WGëà-Q‹*šSí…vp*z6% ¦ßW¶í Gu®W]sý¬›?¢Ö©D=é•#W縊((þ6$©Ö6©–¤ø·¥oq&gm¬7¬à¸‰ãøoÕE@ÏuM›DÔðMË}ƒb¥fœÙ¨À%½áöNæ`ª"ÅÔ£–ä3ê¿»°Eœ¿)ÚÑ–¤¬²eŒˆ9Ú¸èšçâ)­eÓѤU×¤Ô =bÛrÐ0¶ˈWgÄ°"ÛÖ»3_ÊÊ’$šX½DÅn7kFV/§c&ó"‹–‹“z=œ+úðæ¿ ®}ûéãûëOï>¼‘§ºÂÍJƒÕ˧hÏ_•‰úNŽ,«Šˆ1 Ûw#Û¥ÌðìØq‚˜`bP@í‘2"†wys½Taìò~OUmôV/Á£ #ñ²EÙŽmy¶É¨«»T·âÐsØAdY®ÏXIÔ¢Ku íôKU(mÖ.¬^&JJX‘O•’¨N­Rß°|»–A±µkDlâùq %^äOH»T‘V…Ñf…ÆêåÅ´a$8˜"ŒÜРŽî륖í9̳0ô©¯‡‘E\·Üm¢Ë@Ú%DJ›Õ3«—wÓ†æpkª”dyÄ3"ôÕØ1l”Y“¸‘áÚÌ'Qùb=ØåBÚº˜€*„6ëšV/A§ !Ú¬ !¸K=Ç$$ò‚Ð5MæŦ„°C€ºÊxÞ¥:ˆv‰ÇV…ÑfuØêåü´aÄc"”aä ÿØ# v‚ç3¢>3Là¬.°Üª 2ïRF»r(ÂH’¹d‘m”{IJ’ÕKIR5„j©ND¢fuÒ‹† ¢¢'ZU˜¹FÌ\+0Áv8%>·}3T1ãö` “¡@›~ŠLYít¸¢Ïƒ«—,Næ –¸|~p«¥¹ˆë<]f!k©Êú59/ë*|| Œ ýZXRÛë¡¢°Ëê®GG¯Ýùùí¥ç«¯ºô"g¡ÒÕnÏŽ×Ó–Оž<Õ-NOÄÕí‰bˆzˆú‚°• b]ÙN4a;ýåx‡yê+Z±©ž0‚l¯sHd°ÝÉi%;퓧x<ÅÁSj€Ëµu€ï¢Áìƶy7‰žØA@Á§ÄÍr—œîîþÙ þ†ËJêay pèÒ6º‚V¬}?£ [žk¤NØ;ä-æ$ÐNFÈÏ4¬` ñš!ÚSñ§]GEÃò%å¼4 z[Äײ¸È>÷zJ»{Á!Ïj¥@îÃPW FûC•‚²Åé ÇÁÓýjÖÚÔ Ü1jbEùòØU½A%¢K«——«Èˆõ ]ÎóäfÎ"N˜Uƒ‡ÓŸå©?â)mŸZ †9t´ßØ‚nå^\uºíÞL·%Õ–ÏŸž¼~óö•öô™&hš3†ýR°Ý¡`{ –GU©S°¼¯>—1[ë!ËÙ+j ÍÙ’iI,˜/¯–¬¥Å-Ë헄»¼Hxë]‰K=$:‰¨+0M ´›:…­oûVHF‰Ki_=W?Œ—Ø®¤iœ øP4ì¾nØÛplyL«:½ËûêÓ{1»úBØ•µ¸ÖÐüéÜž%sZ c/î|Ú+É{]Õ{œ ¢akÊ7ÆØšÛ”ìfúðn*eD¼¯iŸ†&éÛ9õ»LU íšµ>.{•Ú»¾Ôj= Q é5iñ•Ày±ƒêìöl ›à È:¬mTfùᨺê1þ UÆ0*¹lrO&µµ4g ,ÓRçÀò¾ú¸Š[P ¼eXôö?0eÑv SÆ›Úÿpnü¬ÒF¸ý¿ûUCH_ ÙÆj—‡÷¨óä]C…ÆùD†ûÙëIçê0ã:újׄ«sñ‡êŠ–vÕät÷Ò¿ð:üb„Ÿzu|!=Ýq|1ö¤t£+W>^qÜÊàÛï†Ñ9Ãa;×;^¬¤¾ãw |ky$cMá„›²Ïl¯Vˆ>p°ÕI€< J;WI­5mÒÿo¸]×(pî6ô/iPû.árå¸ßnâtp#{u8ßüÚ(‘¿«[Ý(Ùö½ßJäÞnö– Á²Ÿ¥eBÈ•º‘ò02u96$MÉ'*?ŒMÒ ‘p”4ñåû³3-Îè æêiggWËa =Ì‹/?áWò‚f…§)ô¬-ð3¿u›U3·&Æ(ÊXžwn\=ÏQ«ºzò3›£{†`›k¿Àÿ¿-§q5 Õ óÒr.mFÊ´÷ 6ÿ-La ßkup¿XümQ,./.îîîΣôËý ›Ÿ§ÙÍE2Ø—2îàÉódvÓ™„–gá‹IÕb1¿™htZÔW`öOx`¼qî;ðQL.‰%áÝ îñ/rõä»Ãÿà@`Oñ/éŽà¹ûCÇn- ÿâcó/Z—–«ÛßĶmË°uÇü®ºù¦ïsë~–H{šö]@ó"]®_·ìþWúóüû—ïúø¿¾ÒëÚ¯Ÿþõ훟´ÉÙÅÅßÍŸ..^~|©ýã¯y D«k3:Ï9· Ó‹‹Wï&Zs«Ü™|—|üpñû2°qùñ¬h´<Š7ðËl:Ï_ tcø¾/ZógABÀŸ+`³g ¦“Ï/&? Vrö‹gUŒûRˆÆ? ÉYñâÓÇ×gß‚½NþqöédzŸÒÙ‚I0möóæÕ ÕFDÞ“fç^Š.v6oP$Å”]U<æ9\Áž‡ÚkoÚ³ŒÍÑ"Ï>yð’4ÈÏÃ<Ÿh›b¹ìû)Ëo+&Ö +Wˆà`y˜%‹¢yçwú™Š«%WúýŸK–ÝŸÿžc˜¤¸£Ö0ºŸçL¼S¨Ûº1ߊé)MY㌰DiÉñP:¡¤-ÒÅDH‰(åe¿36K?3­¸Mr —h ²ÿ4&¼»ú{!2ê~¦ ¤€&@Û6Ùr …ú.¦F`3“¸Ad3øXfD =°}Ó2 ÆS¿Æcך„k!i5ÂÜÀò©M=y†Ë"«¶­ÐÖí0f^¹=¹v" x²‘ƒ O>A7O+cñ· ­D†ABß2¨NbÇstÐõ84ñHàÆ&3õ#“%òÙQÏuöç4 þQÑXÌîBEÄ´œ˜Ô±b®™@¸4$”XºíÃÅã¢"ùl;H}$GñX°ï‚bKtŸpªòt‹‚žùÔ }#ötø@vQI†iù¤;ºg@)ÂÛë³ ŒÁÑ«Ûˆ'ò#ºÄnx°•Cª{̦vü›±)E3ñ]#åøQN¤š)]zŸqJÇÂbÆ¢N™LêØð5±—U|¥ö2 —8Wî­áÁ–OV`¡óðÇâq nŒÜlF¤–$:é]]di‘®B™»¦"v¾¼‹÷³ÕŽß}¶Îlnù¸ªÐùfÓ«“‹UœUˆ÷²Ê3ÖÀÕ†9”)„lvUyÒž_À—g•9R8ñ>ÿ`÷“«!ˆ<&@Æ‚£nÎá1ÔZ“Aœ®…K¿Es€NF‡ÌyÝŒÅîSf\nÀË2âºÚp/×芇h“ú#ð낇lc’ÕfçðØ[[¤¨HóIE8“sM„qGÓL1Ô:*®~­¥#,¡€K‘HyinÉêù'D»ø‰à)ÿ™ÌŸ¥Ëâ¿»<¾Á1—ý±Lî,—'¬3pIƒk<×|N6ŸMsiPR9™­ÁŠ‘Q…É ]ãžGèGœ¦"ö~•e‹8ÃDçõVj/)ÜÆ“jøÅùÀO¿›·² °ý9G=N©Î*È×÷ÕKÿ³¶Üµ˜ÓvÙÙªëfrÂ:Ù¡àQy<Ùq N?àà:>y´û­wÎzö¹?®) ¸â››|3ׂe2EÖ ¼Q¼XÙèä–f˜Œ²¸Ÿh'˜\HK™ñ‹§¸½è¼ƒªB‹h,¸Ì Ó€â>'°Uškµ1ñ€\u<«YåøÔLíŽiwT07O5–ÖXd™ZÂX,öƒ€w½Ò»ã ÔõØùZ¸F8£½ðR‡€™¿ž—öÙºßÛ‚â˜ã{çr|í½BŽi¯˜õõ@×*œZ!.n4§îðè) Ø4/3k³*Á¶}—'Øî“É7b-;Û½Šzü˜ó¬8^3açÈÎÑ–O|=*+¡Næ"yá†Á$ýÆêÝ2pµ¢ê:=W¼Ii5FÇ0BØÖ›bR=,™z….x"Kg f« Â.©ä@:ÿÌæ òþ8a(®Qþ6$B-s/1ëŸ})2b„(Q00„AWË’ù —÷x‰†!Ú|4¼–i†EØ o¥¦¦NïµdÞ‘AÃRž>Šœ—YOb+w· —›Öxice”Ñ$5âø¾jLcdË‚Mú8ÏÓL`£žÕ Æ“E§dIñwLóI?´ô®ÐßÚc——‚f±óM‡˜ƒU£;=‰Í!éIï÷D˜íå%››»²ýnW®åñí0]Î ¡„Œê­Êej÷èƒ6¾;^mt ;|ÕQÙédê=¬xÒVÚ\¿DªÝËÏàqñãU:…ÔÝ£rÜò·ï Œ‰ˆï±Úò†ãUžþô±ŽU`ˆÖ)/<¥-¯T’¢ô58VÚÁÉÓÕ±¦ #pqr"’Siž'hyü<=÷€ ê†¬æs.µøšÌã4› ©} Š¬+`>,z0WëÝmš›Ë¡4 õÉü:ÞÀ•zG …(¥ÇUMÖNÔØ7`ŠòËAŒëIåi®^’„,µ¸KW¬-vr‚…Y2àœ¿ä®û^¥¼µÌ3a&cù;t^,/JãéD ÒwK°àÑÝŠîMv¶Ð` ±£µãìÇm .sC8H WÚI©1œ!¢NŸiú m{v][°ýàןÆëš9uí#0\¿fr~¾<¶³nDúêE&ëû1{–¦]MŠ× M²¸¸Ìbu;ý«rå׫ZG½ 9D2}•z[C’üñh¬èþ™ˆÛ<QŸìÈ¥ÑƲÊG7É7 =ÞÁ5à: o K”'8ó ­ÐUšÝóšå›lÒ£òLo{ 머< ¶ã,øOª&P‡ÜÿÞN&[„*™Üôû*‹dÃ5Ž$Uêç«tF÷Ĩíê 1ºšë¹§Tr¯´ð­IÀÇtKð\Š±Óo%r|µKh$9}¥+¨Ód¾ÚÔY=_ç ª$¤¯Ø©Öa­ïÆ|déòæVKŠ¦MÄ‚Ìè—d¶œaîÐ’Õäu(Bc˜“vÞW‹¡h¬O{Ñ!çÚ_ßÿýÕ¿¿úÀ_B±\D´(•õº¥WKb1n=úìn2F¹þ{KçåiËbYtÛ (‘q„½Ç#%¾ètcS»Óˆwl:ÕÄñ(ÃQ M ‚õ³Ï°Üi'‚>?×P;çt¢.'q³ÑqÎ|ì»[Æ'œ1ázì?{òã»—[ðïý¿>ÓÞÿööúÓ»—¯^¿y÷êeÝÓÿ±÷,ÐqT×ÉCpLùôð 4d¼¦A6–vþ!‰ËÛ¨XÆ&Èóy+­½»³žÙ•,’@ø„BÄC€âPœ69’ð ””C ”ðk‹‹ë„†&§!  IpßgfvfgW;³Z­Vb÷Ø+igçÎ}ïÝwï~ ’È£0ÒÅ#uÊp°Šã%3j™y`&àÑ^¿nšÅŒÑ ôu}¡È²È!·*'ΆÊÎ2ß,ûB|04±ºiY@/´Šµv‚å_WBç è)­2ëpµ´¡JëáÑèçûäbèñÞµé{¼O¨…ï 6ƒß æÐ4¢â“N!TðµéÇ¢$a ֺ쥜 T{þt™ð’ ÍJøÖ6áhu‡ÝϲP”ØuDtIr%«·2ØÖ³eEñÙ¿u`]¡íj(9W¶ŽoWGÈ!n½ÜªºÓÈ+éèâ\3Ï›ê ö&±æ17ÔOðËSyfFeÕr¢£ÑH¦åøØ›¦4”Pf1g,£ÖmX³fºŠetXßš.99,Êœ˜%(tÐ ôô¸Õ쉞ŒÙ†]À¢XæΘæ¶b‘TJ´R$Uye6—œ"— Lfn™+™EË23@†D N€IAƒ»™Ü4b\féœn[Î/‘7ˆia¢CáÙ M²ýCr¨qŒUµ!´„µQÃF˜Œ !6Í”ŸAA3A†Va¾ˆR¿²vl¾X»ÿ[Kí¤Û9-ÅÈgØ ;³uEœÅþ÷ô¤Ù(Y/£NØMˆ@ÎuŠ“ ä‡"²@Ãñ‡ŒŠ³dbh,ÝÔjäßÕ3E`$P;a§BiHIu’¾”¦i$ÄdÜ´¶QãéÂ(ѳm É ¯FD‹X)œŒUs#£~\œ½v»â&Ïð‰)ÓržŠ=üHæšpH˜7ÉíˆS1Úi¤­86ùèò¨_îL W(͈|™ã2 ê= h3íøä*P¾³¶È£ó6!Ú„}¨¥•E>Ôè㮜£Îö‹oÍG¨àÛJÖ|Yä¹fÌÏ2°rÙèÙ¬–‘W5õ_µ‰ç¯Ý¿“À± HkF¢Twƒ”‚ȯԶ{ØŸFQ6(H%ÒuTo Fdšsž<Ž*‚àHrBþL§P‘t÷¬Fº¾ÚÍÎrƦBB‹Â©>9Šg,‹ ¨ÃõÔE§”Æ®<ĆégÕèÜÁb¥»d¹p¸Àô8†¼¥ôÖ·¨ö2¸¢Ó•…ú†Á·¶Øh5­~@Nµá'ѺêótÍ„~:é‘Dœ³z/Ïð*cäu$ å:/QUãÁCº4ÏxgÞHCµ‡íôE-ô.q¼_a­4úX•õj÷$l½sú†Ö@%=ëÓ[4›yàã [µR³“¯Ezœœ-쵨™¹E‹AÁÆ­N)4ìº2@J-f ^”ߊÄL|%MË’ªJYcøÑam%vÁN¤‡eó… ¿rPsдV2Êm¤ ÐA*|k ÚVõ·ÔÃk°øºjO×_^«F5Ö¸>‰ÆUëRM+i†à?ç –¡5Aáx†L]N‰*ÀZU aAÃ’Æ+ª Ê4 ¬ˆ’¥uFÄe'ÇÊU2øÊ\óLYîQ³¥ð(Y¾j2+˪“$”ÎHäf2¤Th)@:33c9àÓ§æÇY4´ïDÚ÷dáªc€$†i(}šêx;Sì>ÏðMv¥L‹ÒÄ7V!ÀÁ²ð­é ª™ÉÒ¢Ÿ¹3SŸÔÀáì“¥FÕY< Æí­â (“ÑOƒ‰õ Àú*Â6¶w#T¬´ãœÏ€L¡võž‡åËÅå#MXܲ7-à•i˜ÑnF(…û|Ðbe[˲¤<͉†H§$I‘XFaeV“Ràè–kè<l[mË£my4Ìòð¶UëX ëW˜ƒkFm¤m€LÑÁ¡&ð­m€Ìy¤RöN™fŒ³w,s¼I¦ Nw!Š„aÏq3r€¦Ç ñl¢Š†!ôaR6âˆ+by²R¥¸±¹mP4ôðAã•;‡ÑX ¤$1ÅÈ’¨VŒ¢¤hcî‡Íá0û¶M˜`žw&˜å5Á i݀đâ4 ê-Ò<'³º.¤Ü€ 0•RuPŸmÈ(¬‰ŸŽ:âý õèi"+g¯€w€§ïw&¼AQèJbI8@5jTwJYf–”^"Þð–,ÕéWøÓ¹ViDÒìýH7L[.Q¹ïI8Jj¥¨:bŽòö‘Mu:5¨PëÐôHδœ¾­ AÅG´þÀGoÕË{`¸A›Ó”$!â—lðJ+ úklN¿‚o-a%Ô­‘‡5DÏgèjˆªaÄ×39ºLÏD 0\WÊ6'Jb)×-ŽòÆ…[œ£âsjAmrÄŸRÓw¤ÅB:Cf,䬭_ äÙ 蛾˜‰‡rh ëË;d9^ÔYNy¨–I¢Á±)QÕY¨BÐ(–°åÚ³µ£XZË—<[u§Éƒ7ÚQsÒi:]ÞJ,¯á[óõ¸)±róR4­©ŒÎè"+¢h¨ª®i«ÉŒ:³«›âd˜!ƒi6?’<`L–3Dø;Ø^L©@ÒœªÓ£3ûµTU«&P`‡òbK_½‹ÎY1ôéÁ•ZujpÃkV¯ ]ÉäFnE2904@m:khíHŒ45d©9 5“L®\— ü[`œÃÔ?tnr‚Å ›_» ¾;»‚6~àŽl&g÷U…–BîÆß…Lþ€VÜ{ð»]XïèK¬ ,¢kéU.ÃèKÀŽ¹ù4}Tµ îÛ0´ªKÆ[+dS׆å]+ÌlZ Pøûà¬^Ù§”îAªX_©ñÔaï{dç’‹o(¤ PÕryGåSë±mHy jeø« z¡ Ýæ0¨¨Ùݺm'ת…‰ °G($(¤A:D_@ϲu+£Ò•­P“!Ÿ:Ìfëö"°&º·"‹1I®D»Ñ˜È9ʉ]~·_——EB™ÂüÍYQ‡‘!]3Ÿ Ìß)çk¬‰ªÜ ½~i™£ŒéÓ&N6çÑ‹ˆ$ðà 9U¡(õ•»™ *Š—Îô%èþ;Yªó7Ô’{ dgPx0ª†ÔC b~ÇiN,ýèÜŽ‹cõPt·²ä;”‡4p¶Âù#Z¼KèŽ(ÁÕ”ü_Ä!̉~º[é¦JJ ‘Ž”kv8Š=üኂ€rOÄ%€¢Ís@X¢ %ég0@¼ø;>üsê˜eŽ3 W„!Êt½ÅŒïS¤— ¹Lºß“’~qˆÇÛ¿VMçÈøÕà•Ráxc%ø·€Zç}\ˆ‹£^„B®(UsÂÐ,`¨• ·ÞuãL½ )ºAìP3Ê·ö&‹ÇÛà¬jp¾ÙÀ|³1'¼±ãÂO,YXäÏÕh­#Í–×…¥2ÜU¸¼d”Éó)Œ{”Ø€3S„þÞ$»W1›U­‰ör”ç‹Z)¶I¡B¹X¨ýåk€Ž¹M™sÃùl¾ÀUY> WN{¨W7 пØi‹C}"S8-Z˜CmUópaÐcHˆ•Q†Ÿ:*s5ˆW~)ÿ6ð{ŽÐ®í·JÐjÀŸðA5Xó. ³„ Ìfpðc‡ÉçÎ$“?Ð$Æ£a˜ƒ\¹¯ ²}è¸#’?>ƒ"&A|¡&’`¹¾ä½£¬ûË,æÝÕêuõ”5c\€¤GÙ~ŸÔ÷DÇW×£ªº¨éŠ®ó`¯§DhøJ‚FWE]‰þ n5¼k * —&=±$…QMXü'‘íÕ,G·°‘bM`U“DZ• QÀJ)žMi Çjëd‘’Ñå'aŒÎ "¡™…‚™­Ž‡cþ,Ž0ú@cå¹´òáÁïÄŸÍõî­‰À²ûÇZuåã‡ÑiA yU9]Õx…–QEžÛ+W{ô`GÒÎ |Í¥‹;‘—ÎÓÙÜ=k@3# YfMîDüUÙîøKP‘D1ǃ‚›;(ŒPÞŒ©oƒÀòø¸Ä ZõŸVA ×BÅ4}‡)¤q1ª–‰`UÒÏW¢F±ßù ( Ojz$ -;ª4±T§‘¶ >›™Àµ¯ºòÐ|†Xâ@"äõnAâg Ré“/\bšEDtÉ—î*õÅQ6š¯9(†ñž ²êî3‡L$Æì¢fCy],8EBí´Êq|¶1Ý£•b¡Qwæh'BÕ%7ñœ9:CÊÀŒ*÷z-¤ê#ŒÊÇ:¨¼u¦À|JÚKŸ!Lñøä—K{ÈGÒ"" ‘Ô"Š¶ç\;Q ¢”æªDP|@Àv¸ÃëÂð> Q¼üa^´7†©­Y«ø§$q#¯€gÊó êRrB`Š•ìȉ¯fHüê,‹^[›š³Ìʧw6ŠWù[Â7†A‰AE;l3¨6ƒšfÕæçTw žêÆm–ÔÒ%»G­$¶! ¿néTGAÄÓ5®Ú¾JñžâŸ2!ÅãFÌ+ôô"_žãŒÉˆGxÛ§ÆužÎS…1ê è óìü}s7>Ùñg=þ“Kwî¸n×m¯®Ýwëæãz±~pÛ˜~óè?rÅί^øÙî}YZ°åÐ?vçß|ä±Ý¼fýçö[>æ†[Zt¬¡‚³w½ÿÄ _íùÉÒ¿~éc7îýòô §¯>ø&päàÒ3æI»~í­“=°÷¨K|Êͳµ_]þþÏ~ó–µú¯Ÿºê÷|y÷Ž7ßî»åÝo|âêNpê«o>¾í?Þò«G_Ѻo¼ÿÈgço|iœ¾kÏÖ¹hÝÎ{?ûÍ+ö½yßPï7¿½éÊåÛ~úîÒä­Çì>öêËžü«Oë¶ç}åÒ»o*þÝÖõ3,=fþ/ýþž#çŸyÄ_^t`wråÈÅ wýx¿j^óèåç½×sâë３9êä£ß:÷î£7.»©ãž}»?yÍS‚øÐ#Ï¿rB×uG=´,ûËûŸNþ×ëÜDý;K8殡¥ë;ÏK"¿­¿rø w:~Ë»oª'Ô÷Ͻ?wû†/ÿÉ;Ö}§>ùš1ð̪“_Ÿ·çŠ;>ôßo¹èýŸ~ïíu7|ï•oŸDÿwÇç†/|êÍý÷­ë»ªc,?´ï;k¾öõ¡K®úõ¶íW>—íýøžþééç>¼éŽ7†ßß{×æ%_8lË¡#¿|L=ñÄáç—þüyvË)}×ÿïwW`Wîtð½ï?“»¬u_¡ø…íÎBCŸQƒÿÓ4O—Åÿð"Ͷù3^"£§ å©TÀk¼Ì«)5%'¤f¿ökz_ýoæ‰fÙàgÔÚÿL þëÐènïÿf¼*臡ÿXÿÛwÃ!GÂg8úßÞG»Œ^8ÿÙ—î}açÌû‡Ë8åfmÑqßT.þìoV÷Ÿ¼ø‘W¿ûG9¹ûñ—/úBò™~ö‘ÍO¤7,KÞû¹Ì{æ‚…¡üëýè‘mÜB¯ügšÿË14ˆâ…öþoÊ«ÿÛ¼øߌiæÛñ¿íøßvüo;þ·ÿûÁ‰ÿ­Â÷›ÿË—  lÿ‹à5 þWækÄÿ¢çL-þ·‚ÿ[v¡ÿ‹£HSKk¢¬éœ*ZexCÓy¨:­Ñ¬žëŠ"EêX õ}ÊqŸŒ÷Y_æP=âEF[;ptvµhVô2¦þ h ¢Mç°ìu£.ð‚QT‰EÀ`­iîîn<ÍJÖb»šS‰?VQeu¨‚LQæ9N3h ¨œRôº('XίqdSÙœ6l²…Iâ¼=Ò‰7ò8¤³n’vr˜¥¨6± (î¢N…€NeEÑxIÖUš£ueuV-I€—¤z hš8Omtý §($oìqHh9ªÖ  (á{:•–$ ÚXÄ& ¸‹:bS*-@5>ÅÈ¢(¥h1¥Šº t^äPߘ֒]µñÍ[é1¸jÃcêd 'Å›€úe˜WM…‹÷“Pmb“PÜe I<dNÕ$‰RŒ¤+ £«|^Ö„Xéöz bXpµ¼Qš™‰Q`X( l"\_ŽŽ>WøD¿ÂGŠ>¯î™Ž«ÜgæÒÜNìØ¡Óã“SÉ2@‹Y›é7jݸîÑšSÖZ÷èY|8Ößk'~%”u¥¼rω>@8ó >@^¯ (Ræ@…a±þaEËCadÿ˜¢'…!±n^T_"Q·ÈÌíHdp,õíIâ¿šêvœÌ Õ¨(À-Éõƒµ9Þ¿#U#loæè•ik»¨ZE¼–|ŠSÝεƒÚÔp­•h9}¬MÝÞU[ÓÖ6ëfnCÖcIû¥11n§º}§´' |›ñM)6e„¶$¶£[)¶´¯ãô©gv 4SÎÚ’¾µKGpë¨íA×}cÕ÷2ÿ{£D½ E}´&«,QßÞÕÓ¹«#œþ?{×ÞF®ä÷ïùº¹gçض[ý&™ä\b“„=Ž<¹s6{|û3ƒÁË#>>ëϾ%©š~ ©iÎÀ 7 ®*•ê§’TU[¿'õ|GwÕÍÛ–­jLƒøêb9ƒöcz?¦åÇôFÓB«è>-ÄÖŠ ìÏÿ2Ì ÇY†®éø/¬˜ûø¯M<öñ_›‰ÿºïO'Ûé`8wr‹HhÈ>l¶ÛH Xµ±Q1ÇÙˆ²Ý‰˧„ñx¿‘Õ·þÐuú‹­|`ׄ³üƒm½1èßôËÑL?ñ)PžüÌïn|]÷LÝ0ꮸg…†R·uÕÓmßµ]U‹ÈB£fÊÜ¢îÛ¶áùªfÙŠ º†š¥:ªo¶ŠÃùÆ@©æý:¡×5Õ©Ž¦ÙAh{n=ÐT³^÷êFÔüìÔ×xv—XÆ•‡¾ ’žû˜~#ˆ£ß’c<PUø±é~³à%øU—](ø: ù›÷}¸JtUWŠ°sÞ¦a.z›†³òöô2ÍbÎÎå‘ú˜@;’JO­;Ð+ÝwóX¯drã½V9ZéñRc>¼n’,rtÕs¢kï¬Ì˜¡½58ü°<Ýup`›Ø3,ÅÆ.ë.6 %p4ðš¯\lLDâí‰.ë›*•ÀˆËõò¹M“r#vâXVŒ+ÅÃaK •º[×\ÇX|E׬0|l׳\<\]VíÁðY§ñùÍtÚ½P§É rç†ÿ"Ò±ŸBþà·5Mµëša–Z×<7°= æð§faÛÑKiÒ÷aÏ_‹ð©Íè]:§ªyÀªd/}¯¬n5R¬ù_þERæ«>ÚŽëùŽŠß©‡ºf^è;vC¬9%ƒŽÖÖ¿|j3‚ß`÷ò{VVÚ+a€n(¾b«äð“é:†az¡x¶¡Ú¾o¹ÆŽD$ΥΥ7#u¶×Äzw‹½*+éUzUÁ¡­zp+Wk`èŽ_¯[®_· øËÃåzum²[‹¢ðEU”¸ô<:`|ÄïUYI¯Ò«ºeªJ䪢hŽéjøå–o˜•’{Ï«Wù"ÈÃ6¬Y·òûSVÆ«Ù^ìz Ìô5ÃÔC×­¶cÔíÀwP±ýr£tm¨Ê§6#zrha쮜”W ÎÂËp]³®h¶«b/Ô Ïu 8ØýÝêQ>µÙíEÚúz´†¨ñõÀõ˜ #úO ¹ÃaEïIÄ}Ëï{ÙþXÉ:k¥æ<Í4,lx¡‡]ÛòL˜¡{¡éü¬3WbèI«­ÛÙ¾[ Å ×7]ßu5OÑI¬­ok~ÝW,ÏP,Ëß… ¼å›ùìÈÛÚíÄ6F²W*›«Ùªi{¸‚ØÐr±Z¯×ÕÀ±tOqÂR>±ù ó#+‹l®¢,šªª¡jšŠëŽí9Ì[C/0à |ݬÿ5–g}Èç>»,?ŒéÚ: ÉöÝ*zª¦IyÐ5t€%CõM7À˜9J¹íšÂS±zœOJw _Q’wÙa|röi–rm%òòû 2"Ûïþäígò>€¶aV þâûì|oR]ãïÿkjZÞ~ÆÛõÿž;%zc±'¢NèÒ,hŒ·è@YÌWòû‰üq$áéIbš’èzÚͧ½Ô_à9:À‰™ñÞf"Ÿ1î¤iaÄÄDѬm¹„°³ûÊšÍLybMƒ98¼ˆÙMc‰Ýô ¢ÇRFÈÃò9ò%?:$»SC˜Ph8 ¯5€¯ñ¸çöáWþp:9Ü äg:ž@|JòÃm@à<•ŸõÖ¡9UÝ€ )ðOÐЯcþQ8Ñ $¤(˜i¬ŒøØ3/[Aü 5Š».5ë—Uéíg¥Ënüþ³—XîóF¦“E{`¾À 2Geò0\4nÄ‹32»c’ïô  ã‡Þ88¬¡ÐéÁãÏGäÊ êB#óß1" }ây,Í6|mÓ4Ýý(ûbä)Ñfèt÷{Ï Ðw€Z¤ ½Áw@´ÒUüåÁÐ'yÁÇ4âuâü "„óh32¡]`y7°ÍIÛüÄŒÌ+Ã0wánàÒA¶ÙÛ­Á5ƤÓÚ—îr R’ÚS©Ol /{ŸxŸx©ó)ëï ç)p^b'7?‚ë_~šñ,&bãHà@ã®­à5¶g?†r—A¶9°2gde¹‰ìßK[gg~¾W– ¡[¦~v"Yz1š—ÙÌ‚ÝÇ—¿¢»!ë$,s9V÷èfhþÆz‰ü ›×Œ‚çïìÄa *ÉBÙ¦ Ý[¥™Á µáè‘f.uE;ÿÈÚp:©' v<à‡Ö¨£²ØÐƇJ¶àeGìl•+1œ3’çr·dæÙšW·³¼;ÈR\ùÚŽ@"Š]³Ý½ý±‚Ä-»p²ô÷ƒïÁó;1Ï_¹~o|ßwÇü³ÒGH0ðŒì(MÀ úñÑ‚éÀ@ž€5#¼œ ÖEÙ)%$Wgœ½ŠÐh›lÏ ÚyŽþ`ž%u~Æh‘Õ9uùC½(O@4‚¢;'*ÆѼ©À2H!b»7øV£¾ÀñnédfC!zæbgæAûí­*¦TôTOîá°™R DŽí^ÄÃjQ~9“´ø å&j±öeçD¡«7 À‰ -þòÜÈzÃÑ(ß>-”žãÎË®'z“ ´ ®Ï§‚•G)ºqµ'èè—m˜X]˸[XMë§XÉ›+dRYyÉ„ª–ñ)+<”(E÷X½Lk8WfⵇrèSóº4§‘p%ªŒjvÆ@~ &7~:Óþäf|ëÁ8},sƒ›Új÷@e atL›ž¨D!J¼0Ê–I£ÅQ:‡Ž—H—zqdŒRyB’„$ôzP‘Ê‘àúi0¦G¤ÈÅ<&.µ‚9_¡¥w/HÉFtеÉcáÚ(!3"X ?I]%RQë/{gàr*Ei!O`m #¶ÓÆMCº=˜—¨ÍAìýf[XÉr#AP,±:`ö>ðéRizVoT^¢èér×n,Î.‹‘¥Ó¼å0‘u(iŒd槾`RptU3:£¿HWµG§Ðx¼û‡‚¼Ê׫² ÿ%\ ŠÉ«àT”wZú0çà~:ÙœPŽ‹ãŸŸú ùÓwZf7aêîîû‰U¯”HååXðAàæE‰ ºt_ä„îc$!qMÓ{Ÿz,ñJÛÕƒŒ‘Šý"¢0Ãœw æ‹fBCNH±~ÞѪÙ;x$%Ò—¶-ðmD ÁÚƒ¨‹Ø ëá1a<->²}åÓ…¤)Ú½ÊRS­sHféð²GÊg—d•UG+³€‡õˆÅé¤×¿!Šv#¸Þ˜mKUÍt[D-w6È@ ËÝ›¬’Æ4Ç/š%}þë'i}š×ŒŒ+ÎkÂ’ZØà²ÒÊò‰r±·³¤›QÑùS«Ÿúàí/¬¾üOóê²`ã?Áó?¦}¤ZHU°°öJ7_uºj:›|À€Šd—^LT…Ž« “ÒÐÉb²?ýÒ»û–""ªZýâ~ðäRÌ®ÐzÉD£h±[xËH†KŒ%òi\P—ÜäíOÛ.Ò½Æap¡þûâ>I%÷P”%õßU¬iØLÔWÿMÁ¦ïë¿o౯ÿ¾™úï3¨?ñP‡ÕŒ}ÏΦí+¿ï+¿ï+¿³\½ûÊïûÊïùSrR7ÝUCMó,ìëŽc–ƒƒ=ÇÄah8!v#rÙôeF`LÝJ5Ó¹•Èö½|Ýñ_’5Çõ¸’ý¼Ø¸ŸÌäœSn<Ñj8r¾Ý1M\%.m¢-qî•è8 ³E‰ï À%$}‹£ý™y/iTå4ª.4JU(ùÕhEïÅÛÓ£—Ç«>ŽŽf:+D»Æ¡][H.ÝtH¡üÇÌå¹è¹#gôXð5Ú„í:‡v]œöËÝàÐn¬,wx$çaK²´›ÚÍ–»Å¡ÝZIîïiN0’ûŒn[`ãT±NUãJänsh·wXîuíuÚ¥îH"ú—Ý+"Ò’»%]0¹åQ•9ú9@†U!úÑÜœO3é 5ÛiÓ•°ûaÿñ6ðGNاÑH§ÿüû- ¹‰¢ÊÑÏ3,f[”?а Q»T»¹¹©Õnjô5ù¬¥¯ß$¯e,”ýPÃB Fé?¥Ox=]|f®Ïþ"¯Oµ ’ôs€ ÛQiòÉ_W¡ŸnXÜ€þ§?ÿüóéOöš|æ]O¼žÞ_W ŸpXàýèz:{BŸáÝx^ úþ ýëŒ]‹žoâ×3ôô•P¿Ð’ôs@‹€£¿žúOhÑÀ³ÓêäÓOxüú÷rô«ÈT… “Òß tö#:'ðœÆ´òé'¼>Q*$I?U1üEL[súÇŒF«¿@?ü‡æô£’ôsðWÄ_ ã#¥æ‘QGõ‡Ñ÷†êŠ®Ïèg#†¼ÿŠ’ HÒÏÁ_U  =­e1ý(A+J<Ó¯ HÒÏÁ_UŸP7C§(ý HÒÏÁ_UŸP³<ýI$éçà¯*Š¿OðòtD_“Ï£œë ×N™Ö|=Š¤Ÿƒ¿ª0þ¢+ôtÏô~Ï<=ô4|B÷èé˜Ùú<]ô4zB}…±~›dòôsðWÅߟÿ®Õ_ƒ“Èþ]ü«è_™ß,ùkŽ}ÑåÙUIYp°\ÅòÊrôk,×±ülxÿÈŽ"œ @±Ñõ GW8&è³3ê;S|[êáµ.Û­F%ôs°\ÅòmÉŸƒåš –hÇpu:лÎ9ê÷¼`07@?Ë5A,o> ,í¹ÓI[N˜é Û¹@,Í|oà°ÔkwãZ”heDÿN'åèç`¹&ˆåwC¿ö<º Q£ÉðïƒÑ]oB6ïGÃï=ŸT¥YgH•a¿?|ˆ",|z`\Rþ,×±œP|L^­¬þ²ôs°\ö¥«zHÒÏÁrMËñIjЂ‘î{Czg:¦Á¯Nt6ÜqÉ)ofwà Œúš,ý,×D±±}·¸(bB¯ãºs¥>¡‰Þ]0:YYþüÕñWÍÊ䜰7±üa0ûS/Èí‚ôëüÕE}i4S€2ýÈÓÏÁ_]7rÚS°í¬\Ì3 F=§?žÛÒYþæd§ÈÓÏÁ_]5âAŽãœ)À¡ý‘Û!9ÆÆ,Z!øÃ)©3"üÜ '$ÍQ«ÉXš~þꢾ4ÈDü¤q1T‰ÆÃpòàD‘îaÇ÷G`Ž„à€0¨³Ü,²ôsðW_ËÞŠý×9ø« âo÷c«ƒ:Wï»_í&‚÷ŸÛW¿¶Î›çèÝoða5®»¯Úè_ÿjtàcê­0—¥qyÏßPóŸŸÛÍNÁ—ÊðÁÁa]‡[Ÿ>_´€j`£Ý¸ì¶šLöÏ.®Ï[—jèÝu]^uÑEëS« _ë^Õ(wÙŸÉÒÏÁa]‡¯Þ£OÍöÙG ¢ñ®uÑêþFü¾Õ½$Â}Òm Ïv·uv}Ñh£Ï×íÏWèèµóVçì¢ÑúÔ»ºì4ÿó¾¢óƧÆP—ƒ”–IÒoppØÄá´rÃ0>»n7?‘þÝê\¿ët[Ýën}¸º:§£µÓlÿÚ:kv^£‹+2~ߣëNSvgppØÄáóF·A¥ „ƒÒQDo®;-ªþ­Ën³Ý¾þÜm]]¢W_@Ñ C@ð9'W—T­äõÇàà°!ˆÃ íWí߈‰¦Ó\C_>6áz› Pžn»A½Óm·ÎºÉ¯§Ý«v·”þ6qx®Æè²ùá¢õ¡yyÖ$”]¾´:ÍC°5­ùB‹ ûKø½¦êEÆ:ôy+K?‡ A^À±5D¨õ5Îm‰h“ÙiEæ•ŽŠ³Ñ@>)i â{Ê[™Gü5ñ7}Š®†ðØ:˜yÞ9ƒÞý´Óéù7ãÓÄ?ð‰SŽ~þ‚ø;‹˜Ÿ /ÑôÒ},³,!I? Aü= üÌß±ÀJÈÏýÉkvù$ºüéñýxꟄ£Ÿ¿M^SÁWÄ… A¾N{ããËaÐGŸ‡Sï6˜P.æ—OîÙåôà—ÅŒTÄ…ÉÁbSÜ'®è!I?‹ÍÍŸï:•c€Æf ŒÅå ¤¹!ï麋ŒÇÃÑ‹·sSO|°o'·Då˜ä ž¹ñ–ÓÓ–!‡`æ[J .CÌ%€´„žyYÔ\?W££ýÃqÿt–ìu|¥ß8¹¥ñÃÒlppÉ\‚K¥ØР؈vY68ðd.§RlZ>ƒi¿tWpÀÉ\N¥x0 ºbì94úl\’‹ƒOÖ|*ňjæ3âŒFÎci.8(e-A©r#C/ÑߢeYáà•µÄy,ÇŠRÀJßy,Ë­r𸄇¥òp |’Σ,'`µÊëä(èñã;ì—V* [幘 ½ Cz£Qð |¶QYF8HnUäšÏ¼%‘¹eÙà ¹U5’ël„‡eyàÀ¸U9ŒèÔBƧ’¼pàܪΓý%¹)I»ÍAp»rOҾ °9 mW ÚF’ðQЧ›³e‰çÀ´]5LëÉÇ<ȱ$õ€¶S-Ö(+m½L£ä²EÖBO^V¸þ 'i`Ù«ž š…›ÅÅÆæi«Xÿ±9He‹­…Vù[ÿ±90eÛe´’ƒv]¾Q¬,3äsÃ@™W,ȯ«>VÛ²CÓÓ±ç›:ø©ªQ7ŒÐrH4*‰UXÞ„¢>û#x|†¥N#%£¯¢%–I‹°<ÓÀ*M^,×ÑlÃ4ýºæ©%!]ŒƒV6!ä°"ˆUº+¾NLŽ3Uf×P1G𥘡¨äÝÿ vÎr°‚ÏdŠÄhø½<“ðé7‹jÉràÏ˨Þr<€Ï—q7·³§hžË‚#£R>‘±˜“ã>uØ>¼x’ LÔ¿ƒáÛ¿SœetÁ_/_ RµˆàóU…4©yp\ø!›òõIÞOôùçÿ™'¯Ÿ¾NØ›¨¥CÑÞ[Ž1ðy•Xnøásá^è…³N˜WÈúÛty}q!*ýåV>_Yú/Ñ¢]™¼B×í¨Í¿¿z¦6·6ÇtòÅ3Y`@Õ}‡äòôõº«{¶øž§;`ª-݇Q ÷", ÷úr ÂJ]¸ƒ‚þ8¢œD8•h lw™K:Õ¢râd(Àé br¬0Nç¿l–c‡ñR;¼Ð§·4û\á¸>N€>Æik,h þFOœ ŽùÅYó»^”âÎãTà|AëB*NH<ÆiËÍ›B+NÄ;NG¼‹5Ê1†8m …õt}†^9‘êXÍÚÜRÝ ¿yN0È €Çjzb¾¼ç¥¡ÀŽÕl&´Š»å€*QItäįc58ýŸ`ËàPe€C¾[8x¡æáE싉ZNð6No‹5Ê1ßjÖ|çÉ-‘±0Îèô&5\I‚Q¢8F;&-Ö(Çh«Y£]ˆè—À +f.¥&œa¬ejI?Gt¢Ã Æšœ=+œW¼a ôa™É'Æk™»’“ N/Ö²æLž¸’¦–ž‹µ¬A\¥g¥z•c-µÜÕ(€Ã%ùN÷÷ðD^Kòa ñZ‡¼>ã¡¥öUå·«¾Õš&Ëäë¿óÖ-ɇnqoÆ“ 6v¢Mœc„Ømö~ç‚ç ÐçyXˆpƒz=«ãÿõöQÐ$€Æ%ùxœðëï^žÚÅb¾¸G fóz[kâ«fmpØjž8Xÿ¨¹-*¤€qIŒ‹kP¡ùØv;jÎJ%“«É*j ¦‘Î믊Ì*É4q~_„Nçó/s\‚~7p›Àë’|ˆô e±ùlú>™Ï6X]M'g“7vÖðß²6ßÚ2ŽÓ “ᆢmlrví ’Ôpw  P€rQ1 *h*vÝ:ª9=X+@M¨±­$¬¢pF v¥U‚)³J iDʨ(T®„´¤d&Ó®ÛÝAí+MÊF)›¤µ¿ndX>´ÓB7CñpëC:H ÷²°kPD .Ð ÜjLr7k3‚Œ€€UC‹##Ý™†áé Ml»»E&íe`[Ý-3iL:Òh«¢;!³žjgkäTPç>WÌ<ã¤,dj)á¥ð5ïüi'tèÀǹ™ã îÑvÃçuü©6¾°Zˆˆ`:Dïéïcgs·ò ýs»pîìtòõV_CÕ{[%q$øÙÇÝò›Žâ~7?ã`­åäïí¼3YÂc>µ6º´N)€¦„ð ‚`ݧ±Z°}ß­e(ék™à¾g´Yáz*x¡gŒW9­ÏS^•Üxd]·M·î;nkŽ0e:€)wžæ¢Ry!‹JÑ4×Ì£˜$õˆ ëeÒ²Þ¾o­—Îd: wž¤ÒV©Qœ©JUZ–”;AJ­ÌÝ%U×ù…Õe å˜0À„ƒ;Ÿ§BªxYeSæÿYAŠ\ÒŒ«*uº’ÿ¡”üc¾^)©JÉlšV•´Ì4Ó¥e67YFϾªÖ¶ 6°ó€ Œƒ;ïlr£eÁHÎ\—‰PºdNü0­3R»k¦ÎÝb@Í @Ìá ÖzN¸‘$5©¨œïAsmdU:‰ÉtæxÞþt©§[GöЦtpߥоZ6YMd5 «¯wvu¹˜uR¨ñ ©iMt85íß„jHÓþ™J¸F÷ÜËˬ“³^KP™–Êkjãs€,±Oy®šžÝà^^ZUšÛœXFuV’ªÔ8=k5)„¨üDl›gðŒÝÌ Þ£v”°£ñ»qØIØsˆ:½v¶62è'øt Ti Šl°,§ÊÙ¤Ú”Ž M›¨Þ jìÖÂú;–ÆGX+åcQW/?npX¿ÏR>Ra«çèêŸlt^bçpP> ¨N~þsl　æqà~ ^A{‡W [Ž” ý#%p’³Î®Q@ö¡_øÿƒÄQàðŠ=|aÇ盦øØ&ús¹ãöÀþò yøÂ!?A8 àÀiÿô\£€@뉀jt'ú“!`eQVRQdTUŠI£JIËŠšªà¾Ëþüá à aEy¦L鬆Ì^΄P²Pij}®B9°¢g—ç…]|X;@¨Òl€!N3’ÓšÒ>Ð×( ß2¼?|(Ë€ŽÒl¸‡ØЭwÊÝ4’Žo"½šU¸©ŒÜsêbS‰÷M¶# ѱ£Tr¯¤5vl€¢ì™Æ5 h¯~½gT£;‡9Wѵ¥—–îµB¥¤0Ú jk£M¸Ã£?ØΧ&EUÑŠ‹œ-Ô¶ÈJ¡Lå P«°³Ù:»·äFV÷›¡E€¹¤Ìeäj´QÐñAxgùmû2,kêiÈf$†=´0 …±Ëéfƒ4Ñç cǺ[)²ª¹j¼/‹)Ì.#P)¶Õ…Xµ²B–<"«œ/]ð2—nË­2ÌÃ(]Ï<4솶cr% %Oi™“‚Ò‚É<ÍX)s&­ñÔm~YM{¯Q‚ÃÞ3áÆF †Ž}öí.EË=ÇbÐs ¨ÊBÃ2ÄGÀ6ÆŠì`ŒŒÔÅŠ:äÉ( ¨ýɵ?‘ÍÆÈ l'ŠÜ÷z†"¯¦`ªôQId§e6ZÐs«O£áÑ>u}¾e@ŽÔðÄ2zá ŠE»aÐ’ –öX®æübc>'݈ÁÒHúOð¬ õ.´fÕpÊ¥õ|ü$‚<o¸§€Zeƒ²ª‘ô ÊŠ¢OÈð¢Àß²þ6’>AÉIQô xCÿšy EŸ ü§(ú„¼!€³aqEŸ «(úàß"ŸÀ2,GÐ'(‹+Š>oY_€©5ŠŽ“Ï!‰bqòÿ¬Õ¹ȽÕ ¸±úô6 ·íì0oófÌ›ÅÀ¼óf10o™eý"³Q.?²+{¶°Ö8c¨°*KM% Õ¦ª2+˜,3™’Š7ã )lqˆò`‘A’¶èäµ!)óZ¯«ê?ð•¶Ð± €.‹) Ë€º,‹rî7 롇¨‘и×¼Õ‹Ùdv†¨zÖÌmR͉nNVtÝŒ)nÆ02ËúB)}<2 À#‡—/bô˜@±¨³˜úc *³ 26öäûssyp[£ÛHƼò“Z€`mdÍ kˆ¤ÛšÛ¹€X6“1@Y39æçµÕ·BfçÐ)Ÿ r3{ÐÜLö¥;¶]@V˘­B HU»Uˆ/»ÀvÙö}ˆÚÂ*C3³…Ôpf15œÙN03”S\j’‹2Oi¡ÒÜh•k牫h•é¢ª{æÑlãîÑvÃgvuZÚJ_NW§ {æäÂâ}Æê-»Í†Øí¸Áw½ *,Â|6ËcxF³0z<ëñä$yá9ÓÓäÌÎìbb–R€ifLóMcǺ9ÚU“-“]ø3/ UúXžó[d%L¡)³Ä9D²,J¾òojlÛåÕîÄÚ®$š Ñ·D´#O Ñ6µB»·gÊIÁ*+(q¿ë´(DÙ¼©˜—ï£éX4õm X³PÁR™+'cxEr+M&­f¶ ¥±Îªl“ vZM#À`Q1ž(€~fôóµ2äù»•-}Rw˜ðŒš6ù6̼$ÝÞ#ÖÊOwê9‚Š\y¡E*Dnò`¶r–饞FO<`¢  Í·D¬#ËM!¬Î2¡­¡’H'8tj u‚–ˆª%QËIÑ$´ÿ}H$hŠ3©ày–\j)µœgš¦†[Q‘ÔÇý›f—ÓxìÀû6Ð'ëX¨( 3Žš˜¬ß ±5¸È¬®ÒÊÒ”k©¹“ÒÜ1£E•W_K"çÐNfzÍH€Þóôþ6‰ªuJ§2„•g&K¥tË™©2šËœXÕJ#×J¬µÇžÞFku M*Å ëH BÓ"—&'Nj{]%Û…VÚ ;+í̯I¥ÝöæDÜ*e)kœ”iVia¤Ô‚˜¢ªª”’Të\·UV–ïÏ‹ù4~¡í¶^yŠO¢ÿ€ŒÔ¹ šd™t>ƒM‰ôÀ’ÒÉëÌè2SÒ5ðÆ¿ÉÙŽ{xVH?áém´¯¹\L2J©Ôi™k©qŠN9R9žw"{:Ÿ_DÓg·qÍÓÛh\‹NU4ËT¡¸# ­4‘LÐRÅœ!©ˆN[ú\L/WóÓËÙbmAòt·…í®#ÅÁÐûîoX¸¿/§zqukÓU¼gÉÓÝ6¯»î/ót·è®G†Ë»ñ#ûAKŒl[b¸9'€áB"vˆøÎ8|£ ƒ8 ‚0²Z™£dRvÞê©_P§ou» ߣºk‡õ|›þn¿ª´f2ˆI'£MÜ»?Þ€“<‹§Ïl5™M|(êÑã“¢Žçoöþt9¿\Û ¢K;n_ñÐ<ª³Œ×=èJUKWب麷HÔ­ç÷ ¨£A¢u­oß‘³Î—Å’“³–œpÒHÎý°®§§/Ó1òн>7R±’k¯ÑxÒ;zõIïÓåÖM{úw©mú“ô´Ù©;¾‡t=Õ0ƒáýÁ¤~èj0¯ùìX²;–,oÇÒn‚<|‹È°oYû–Mk%äUY'k`×òܘ0q3hb‰“ $ŽðhÈöŽé…? 8³/tⳄÃÈÚoázTg&%³C ›ºߦ°Y—ËCÑc—N Ø’ó /€ŸßØ£ ®Ÿ]VB2|èú =èLú$¾­™dVC« Ö©Ú:˜ÄV3"ÐôXÝ…AæoÿÑ#„iP‡4üm§UÒÞ~8}¨ä¶> 1U™h)Ç÷ài¸vÐÄRGâ:ÌNؾ¢v„cd9œêƒ—ñiC±Â ia šl"Ÿ3”<ðPÿCÊ„¬'ê×)V(vF’²3$;§/@ÐSÙN.Œûƒƒvûbævûù}‚vr0sæêÛ÷“æ!­ázÓd‚PRe¹ûOÚé»,+3T;ŸH­¸­mò¬K@9XõS÷¾xñòyò šLíŽ(]ã>Oí;=äz!r²¹^H@ú¬ÿ0‚6ž‚F Ù',4 íûl¯+cОY@qÍØð~'ž±#÷NƒØÚo:öÉý úÄ0$²M 2ÄQEnY¸m1QÖ>|\~rãÞ Ùkhžú@¡¬gã¯O.BiÚ.æƒ÷`M»?0L8õ[ØGÛb \8fhÞàˆêþ *zËv[í‹Bö5ЋPt‹°ÃÿG­B¡„S7²È©¦ª2™¬(ÑY•U2gA1¸­íéŽ2ð–ÃA%«è-G"–#Gsï8g T‰ ÖÂ¥»ð®=ÜVϵG˜„õþ6çØ··Я'=¿>Àÿdè½ÖílàzC抡£kŒ®ßÔ`%BÄ m9N€ξiaj`ûù=”€£A_¹úÃ}û^¯Š,ÀîïY=Êd#|ìsFB6A¯ ¡`!|¼~€Ûê;Eëû€WTßçÝ¢öjÚÓ !™7h‘Â;‘R¯ƒ§}f]ôyŒ9ò¢æ‰¨Ï|H29>~ºñµ™;jÌVKÿõÝú›åJ/VI5Ÿ;*%þ÷úÒëEןæÒщëPY.ìrÙ»ðôñÒ#ÀžÞý…¯$æôC™ÌgÉ—îß_]N*š‘öˆgD^—…ýÚá;3¿HŠ÷ɺ.]3Ø׫ÕÅ£““·oß>,çïÞŸÙÙÃùâìdâÆü®%ÁÝÇ“ó³^'œKmžuO\ÌÎŽ=]­¿q½¿ë©•‡ùÃÌýÚtÙ}Õ É_õúÀÿô/yz÷Îï?O·rnjúÔè‚ ·èέߙ]žV—3SÏß^ïð໌sÿ“H‘nþô.Hv‡P!'"ÍØ”¦YÊï$éƸósé—R’Ü)ôr5¿¼~ ÐõßÑÏãŸ}ýù«¿ûæyâ§9ùæû¿|ùâóäèøääoÙç''Ï^=K~õËW_¾tk0M^-ôlY r==9yþÕQ²¹òß²zÑ¿úöäo‹ø‡Û_WO>,W¥—õ ßOgË'#Í¥Tót}¯Õ¥ûqnWNä¸{íO—“7OŽ>o$ãñ+_=¼““N;_¥yøSc^ÚÕ“ï_}qœ×eÐȯŽ¿ÿìøóùù…ÓÛÅt³ÏŸ¨«gš¬æ³F`Î÷=kV#¨êV“ÕÔ>íDæ£ä«ni%_6këñIsËÝÇÓÉìÇVŽ®táìôåò(qV„/Ôý~j—¯­]%¾>z;0ƒÇÒ,&«Í+?è7ºù¶•­?ütiïþ°tÿ¤¹‚{°|?[Zã'lÙz£¿èFu9©Åy;“­ÜöÔëÕÕüâ¨Ñuå<™ÍW®±óù›¬^O–‰»é“d²J&^‰Í—NU9 Ô¾úãFñ­Ûñ4Õ «=Ó8jNmbìtê)?™=9Jê¿/œiÿ~z7y¼jzã~Y$õCÚÉÙëÕ£Ddï>õ7¹‹ew±}üxj+wKúPØóæždÝ‘‹ÅüG¿Æ(èØÀß±y(ãæ5æèiúP=ìJܽ:Úÿ²*}OV‹æG§ùêQvVDc8[#ñtÞ² ü…+eï(¸Å´õ=ýŸé7‹ù[r´¶og6CL;áê[Çj/¸KÓÉ•´©ýëñ>ýROfÍø¿Ñg]ýóÆr^µÑ5o.‹ºź͵†Zn5¼^]ËëÝ0ÍfŽÃ<¶Úx¦WºéÜwuärkÍ£&¶{ó…ÿfôÑÇ'—Óf2»Yݦ7Ý¢7 $8Dœft/Ýó{‘¾5v½c-ã"hÀCƒ±^~6bäWfÑzÆÝ«­’š;F¼aØ;±w%¿º÷·Æ¾_++üÓ~›{Ϋù©¹¸¸wÿî£ò3vºUü²ó¯s*ŠŒ]T…¡VdL8ïÆpem.DíÐù.ßmúÜô÷ùê÷þÇM}¶ìÿ Jò€ý/YÊ6ìzÇͼì÷öÿ‡øüÓ7_ý⣻ê9÷£¿|ö­ûùÚýû³?úC÷ÿúÿ}çΟüó‹gŸ½z÷³ÿýÍû_ÿÛýç?pñç¯^~ô7ÿúÍÏžýôïð/ÿCÈü&×ÿÇÞsÀ7U}EŠâ@”%<JAZÞŒ²¡(SŠÄúfH“¤t0EP\LQQ¦¨€,ñ²doAVe¡  ìQùî}ï%Íj›t¾ö÷#¥/ï{ï¹ç}ΞR¹ÁìY‘ NŒå*ŒL_sæm™õÁ×IŽ»|l¸­îóÕ>ÔêJ$Û÷½C7îú·m¾|}Å̾76ßèµóÈÑ%ûš4ï»òÜчöîÝkèú˜!µÒîÇ gËvÖ«î\T»¬agÙ*†¬-e‡¦ÖÔÞ¼‘ˆ`h7²ìЄ“’îVXuùƒ¢éƒ«§ï¨d˜VËpqóŹå²¯\[~(ÙøZ¬¸îvxuêÚÿ=9üûzü›2á•®Ì[‰`}Ÿ˜X!]þ°x<«Æá1ì½i{¾ÛåáûU_»¼s¹¾‡ãªŒÜÚ|Œ„lœ^fÌè¦ãæc26OòÇ”#ýç¥/Þÿݵ¹=OHn£3ú.ìÝ.½iyCĘU=O¿ëØÛüü»Ž7ñ'»?¸õTÊYìSñí^ç?ôüî•Ñ¿ýLkÕ±çå+Õþ÷¹vl¯ •—ø=®Ú_‡|Ž¬8R'áJïSûOInþ~ÿ3ÂþW¾hž’õô¨©«~)óЮa÷Öí{ëöm7ø—&,+;fÓ„¯/¼>¿ù֧Θ7í¿zí؊ο|ÿóÃóž7Ķž™Ð2}Â&sÆòóvßBzOê³ãÒ©§;¨JTª™Qõ@¦uÏÿê5Ï ePû S»Ç¿ýŒhþ¥ö–eÓ_™1m½ä˜¿¿ñäêX³Ÿ¼{êI®ù'îŒHïWó`ÿ27}Ðfœmõ¶ _&íÿÛúÎÁwø}·ÛöÛ³8¥üöA«Ÿ<àr9CŸ¡§\}¶ÊºåSÛu^?çï^†1ëÒoÉæ.Ýo½Þ¥÷1Æ%%gnX%3žÚ6`ÖK{̈üjќںÓÿŽûµš9cã )n½ý—¡Ç‘´á¼8sí÷û­õò¯´ìk»0íÛ÷®~uõ1Ç–7ç2®]µ¾´ðä†JfEÛJŽŽè9w×ï›·\?µ¬ü¼¬zû£ºž;ÿaZ»è)æ>PvhYsyÛ C¢ÏŽ¼8¡Ïefœ]—Žq+þœÛþï›ÏOºÝï‡ ·Kÿ}¤87¾o¼±þÔØ—,»v¹kßÇÜKEwñÖš&«ÍÚ7ñÄžMóz/¨~è5ã‘FM+¾£ÍÎc?¬¼ÝjÐé´mËćßúüÝf½^}hüáÄÏu:Y×Ü»ÉËOTþwþÒ;Û‡¬ûnKƒ—‘»Î=×êöžÐiêEM~ïP®ÌPìÌ•ç†MºVîÁ¥""*^«1+RÙžÙô©*UÖîØQé258}uÖOS¤ígËíóÙ‰³OœÙaÇGN§7ù3¹—i‰|ú­M‡ögü¯s­#çÚÑ­j¾9¨,óÞŠoÊh¸¾_&båQi±o¬n8ö­Ï/)·mnˆo.±ôÒ•jz¾H¾é¨vêÝ—,Ø¿ÄrtÆÅ9×~`L»MÓ,?÷ïÌ6«š?u¹ég›j¿Ó¿o*º±z§…™æ?~XÛ¡VFê]éÓ)‡¶ÞhÛ¶üŠ–ßwš“Ð`Ko´ý›98ñ­^Éߙ߿WÍ”ö§ÞkÖVúÙòûO›2÷m4O¯7ËÖþÀÓ}_ü(óë5sgµf¿ÿä“_â6ÿ0ÄÎ8ŠLŸÕjÏ¿Ý×oÌê•2dã§ÚNßr¾³63©òõo6ÎøÖT¹[æ¼Z¶Â¶*Õöð™¼ìÂù{zo£O^~ðù»ïý^Eìgô¸Î/Ùç¦oŸ¶ã¬ò(#e\úþG/œ¿òvâö”óWîÕøý Ã[ùé#:×F’>ÿ:d~íø3‡ÖMzä÷ktÖåVÔßtþìwsïdš{iðŠI·²z§¯œÑé“ /ï:¸ü[µwo,wû$n|fïn+ûù’mŸ\@ˆ'ø‰dÚNøgÝêäOŒï¾uEÓâ@jwþ{ùÕ×æÊ“—nèœ1zàŠ&W—¯T«ÉÇ™Om”ž5nùàêÍËŸY|íªù+g6,zb_§NÕ_ÞxzñØøÊ[3Û¾½£wù!]W,{ýåwvMÓaå‘o­Ï´mÿì²Èám».üx`ÒæµON¯1öpÃ3f/_ÞsᎣËgþÞ÷pÃ*}íôåÛnŽè“.?<ºÇŠÌˆ‰kÕ‰Œ5+¿ ?ßs=kÛ’röYŸ,Û=hüø”ë'uî犫‹›<ùÐâ­Ýj|ùèéøµ'ÖLœô©m÷®+ÇV¼ûóÒ3'ÐçæãkU\÷ÙÍëÏœ~­n­õkŸ»¶n£7çÖ}æâ#ø‘¿“ŽtŒýhjECÄiF쫇6ž|yåŠW~íùåKóøáé b>ŠÑ9.2«f•uÃÞêþj»y=–±—ÚþwõR¥C#¯dU³HMæÌg'¾Ùº·áf³-g«&ÍÝÔxØ¢MŸ•ÛHÍÖþytÊÈzô º|4°÷çw=s¶ÿÇßì=ט¶¥×…´š¿<;3}F€7æ ¾~b›Ôì§ï6I2 3ñ×<ˉ ³Rf®ýú×—¿><ïß8×AZ=î|Å´ú绹Ì~¼qö‚V7´HêúÛ¥”>æ†ô;ÈñÄ×öÖúBšvýØ#É×’ÖÚæGO<>cógÊõWM7¹ÕŽEoˆ§&4èo¨8-mˆáòØ ã{Í­ÖüЫ“¾@÷tžÞåÜ°IƒG]·`IbE±}ïLZÈöÍøäè[kú•iÑûXÆø› )zÑ‚¿FíXÞc…eD¯˜Þ•ZT·üSùæÎI¶¯zM¢ë<:”tž³,h]©UÅŒ€-óÄ€~×_zjë‹jþõÙÌïÌøœN®ŽÇvgÌç\ºr¡yè¹?ÒøŠß]ýÄœùcVnêøÖÜ)g/}¹´VVZôªƒ+?ìUó‘äF½W~dê>èf¥Éc~”±‰ýÞï£xáëÙ¦qo6ë»ó«5¯O¾Í’¯R“Ÿ‹kûÉÈÑw‰]ôùyzJœ=ºÒ…¾ÛöhêµÅK&í»)«ÚŒ)[†<ýTlVB…݉—ÆÅÕ=šÖoiú³l«kŠ ý&دŒ¾ñååSîþºûâgz/jÚŽÚÕ-âŸØ–ÜÉ£K.Üùð±™åØ1¼Ù_³«ýXu]»=xsÕ‹UzÜ5ÿû}Õúç>~ìíG&Ïýðò®ê™kW­Ú¹¢lûƒ?Uý«a’ñG¿˜võÕÌŸFÔ¨ÜÊ[‡8]öÆÚbãba~÷wvkGßÙÄÙ¾KŸ…mÓï l}ô<#d½9Y_}{Ïvåîü_7ñp›£§ªæiÃ7ÝRÿûî¢õh–lèÚâïãõ7´~¸Õ¯ÛÐÑZvÛõwùáׇõ«c®ròN;äõoÛÕýîBì¥z5úí°î¼6ùôÞ^ǧ>|üãÉä—SGݱU;½ÌÏõÆEOí3jít‹ÎOv4t}ûø÷+#c>Ëìðã_?~áXgü½ñÞÏ3Tö~7~Ëþ•;Ò_s¯þ’ñÚ”™M3›|J4¿3»S³DËW+ÕY¼pÛ‘cGO™öàË3zØsÏ}Õï¸ó»Ø13ö¿Ho~uD£¸§º¿e[ŸÕ¯òƒ »Ö;@µ­8ì³5G–ÿ³¡â6‹øàÔrM濶bÇã¾¹qO§ì;±ØykT—z_U8þâkÓÖ¿ø݉žÛ?kZsï¦,]7¬ÕáÃ(½¶gôæK·n&6èÐùÀ¸.òÊ­ ­^ßõ[Ï+'ožäÎÜ~püäÄ=·éþN­/¿­>zú/Ÿ©ÜrA£Ç—^ÿvµ–3ÓO ;mèÆ©³n5‰-÷ëcu†íøü“ºŒ|wN—cÛ·>°ëP›ˆ)&ºXí„ø™a̦o¶®ë—ôSò¶ß°ÜÚ³­ÂŒÍ;‡öÜ[ÅÐi6ç©xK¯÷ß¿aéeÿÍèt|ÿÕ„ÕŸ>œòxå§&þøõü~µËX®Zæ‘ÂË+7®çª=ÏïÚôWÒñ?÷}²-rëa_ª_þ¡1OVøï+æùŠµ/ H«¸vüªM{þ±&*—¯Æ °Ý­ý̳ëæÅïx~a¥­Ïœ9™pÎܳÆo¶Â[U¬3qéÛ{–Û†%þòv•ù½¾=Ôô£:Ým—¶·dÆýùG™Øwdã©f93:þÔ ²î¦Ù+Η1?kÜ•u›_ý¶ÿíf?Íø®Óðg:mß@]ž³dóªñ±K¶ÇFÿ<%¶œüxË–Sƒš¶š²(Óûxóš?÷¼±cS•µeº~|òäÎ2±ëˆ8÷¿:ƒ~›Pó‘­Þ)»æîÓ[^k±àøüÿ^¸öÔéÁÿª5¬l§c›Yfø¦åå/kEß]¼ãö:2ëRÝè*ƒël¯¼õÌy²ÿ͉׻¦¦Vüq#ghñè˜N1öyÒµY ëÖTÔ¤ìÐn—£Lûð]PÃíè•Kë›\Éløá¢?yîÝO%ŒÑû£gª3§žåF›?àö™ÎNis+ñì€QŸ”™½åüÅÕ:\4 mþD¯—)éôž!@-©4·ÉâòCOךÙåÔ‰—¶òÛ~šœÞÿ‡¿¤÷zô›Å'†™ýufä‡s6ÞN[%ÞX{f߯µêÙ+»µqÈĸ×Ø{5ã‡é+ Xó—•ÿ|~^âÍV"‡ãÎýó@½õ?ö~ÙpsôŒó'vF6[örê3Ê]Ñq{îw¾ùeqrù÷vÃÈi37®ºq «uxΆ;MVÛÚWms2µç#ú*™ôÒ¬+£3™ù“æÿG/Ùk}öÀªßb_ždéè«°=nŽ·nº<…˜ÎÏxfçîqµÇgvËFFí8´|gü÷{¿¸­ÓìôÛ?8Æ+Q=¸ùÏÝw~ùóê]jPÏn…ÍO=÷Íî=®ý±¬CFæ Áƒl½&YÛ0ü쮲:õ<Þyã©17üx¼¬aÙ|úÆ¿*œxy勆ÛÍ×<xÈá% U7cøã= 7›·ªÿħ{Ïœ¨vļeOÕ¬P½l‹f†cY†¦ÚµœÅ„ „¬AÌ%†ÑÔæ“”êÕtÚÓÞ ð8¬Œh—xˆ bU4¦ ‰)ZC¥-›—j£hK—dÑìPù¬Ýs™€1‚ÌR´B¾kif„ÅƉ¸ëž»5ÙæB¶ûÈo”ª1i¼&â1*ÿÓ¸ŸÇ€à “SNjÌ+¸  œÌ¡8Añ¸È $%²‚IJ.£¨ŒëSr?Õ<Õ°oø5%€IÚ!¿7"ýõ?U»f¸Ž§€£ûAxÅû!ÁêtZs c»N³…!&²[ƒ!^ý:r…t¥€ó,ŠŠ¨( ^…—9‘$DR–d†ƒ o½GÑFÐÿònóˆ¨ …Žûî®G^4â‰é÷™9†RÄqžÚÁb²‚q¨ É,Áò˜^ûœ÷l=w ø·9ï½ ßÙ[N9žEL!XŒ'Y$%E”QY&0Y"©|í­Öj Hv7ïùz">»¾‰,Ù= ÏÙS”eqÂqAD ¿EeçŠÈðz_óž­Ú³74|^ØP^Í$HIÀ$œ"qœAEB–E…¢Y†¯ÍÍ{¶~›oµ©H¼Xof“n›êd³yŽÇh™–ež¡)’å8ã¨ß„(<#äk³‹}EBj¹¨v+"«*"„⾄FŒ—$Nf OЇ2$ÍsXÏcaE#yOÖቼ#^?,!*ÁIZá0`ñP OáøBâižçE”]}j-§?é«Vê5¤ö+(#+Ô-(s—yæœ08'r²Ìñ”Ã× /;ßêyeä=_ÏÏ>µ¨ØB¾79TÄèf0\PpA&”¦x— GY’–$Šâ9þþVñò^½Wh0Q6ë‚D#c‰wòEæ²÷<õ+/®â&M0îœö²F]™¡H«˜ Û¦ª}wÕ4шl´ð1Ž¥¶o Âi¬öAòÈ¥Õ‰ÕèwÕf·:­Ù)ؾ©±Zοþ-üÞžý‡VFà{¯ût6/¾+áßóÁ˜È]Ð n“`ÉEѼ^Ü3—èÝp夳šrþÓÐg-z CžøQáõ•ÓŒ1pQr¨úÃ*.=›>.¿~Ž8ñÂsŸ‚Ò–¬"¤w›oL QôW®±žîzÁw„w™‰ & ‘&'’ħ!‚ ¾T€ð$0±ú0á\¿dU\9ðBõ7I²ïSq'Ãîb‘ð¾úÑH\¢ŒXä 6ÛdqÈvXÃÂ;ÕìuXí¢f­Ë*ähDËX—Ì^Û³Ê%gLWxX¿\’´ÚÏwØu„k;|·V2&ÔËdéí+<6^£~};âô¹y­â`–בֹGÇŽˆIAq¦ÕF<bAæá&>©¸vK’> ½@í×͛ݘô˜ƒ›rÔjI¥ ³VgÝènŠÙd‘sOÞUêy eŒ*—‚é ÷¨›€OG«;'䮟päb#ùõg½s7öê8Ÿ›¹åŠôå:~#g(þ˜¡i.öýé?g- àñhj €7µB,ø™R$À/åšhðppÒ' SÍ‹Ê íwK“®S¾­6ýLÙ†’-@¦Á pæ-î:CšP<âmÙósaѳR''u$oYÉ©#E¢>øG¸)8‘ênîš³T.,a¬á.[Çy‰c!Ùd†µ]v&Û-P8=˱liF$×òˆÍªrõb}Èty‹×9hd Wed˜Õ@Â̵]€¹d›{ê@ó@Rx‹*èTä'Ö<–ªBëÕ–üŠ†]÷z[úÎCÛ']/Qó8ý§­XHrTåÁࣸåhàóÝr:r.i j>šhè2…d|_´ÐtPRÔÿp%Œôµ›=D]¨‚Ô_pÑå!¸‚’¢þrŠâ0_9eñ•«ØóG å::7-I†»°P¤^‘…’“z°àÑ/s¯ ©ÔbO*Ör²Õo*KÔBÛOÁÒoµÉ´ÉâÅÁUë$Ó0µ¾—ŒSGÑ †‰¤JÍÕö+—+V]]!Êpðv[NÆV!6 ¬:ë ¢Ž6Œü°¹ ¬OK-•YA*uÞC•|r’ja¥&ônílý=²+ ' Qå4‘Zå‚Íêp˜sx@²&;ë‡ ÿ×hYG®ÚÒ#%0 ÝP¬ö$5f$òª#P5¼ÈR±8þ²‘ ÆV.&_FÓ|³ÌðŸÊú¸ÖÔ&¡óõ !ÂG¥Ue×=¯Òb¥2¢¿gŃF†9É·NoO–a<rLgŠÕŸw9^g¨€•†ˆÂ›2bì)&‡íís¨À”°;rç@´©ÁÎeÚ¹N XtŽÕ.išµj½X%Ù&¢¾<^1Ù9øš E®@ÂóX&V`‰å5^á˜8$ˆTLµýRq¯ýG"um" n~ý†êI …j÷@“€ÒΦ-a»÷±{ Ó6PUoãç­sç.†ó ³ð™j ú9'òé÷ÃY_¿_K°~?ÆÓïç:¿Múùý¼ …æö£PÜÛí—OÓ7ˆZ02}aͽ®"•PhJE]N‘)ø¥fõ©Þwµ )dµ§©g¼ñ%Hˆ×‚Æœà‹ɺ"¡Q> DùÉWiZŠ”ÐDNø L•òó' l"êc™zÔi‡žA1¨‡\ÉžgHá$—ìË+ž€B &a”·TñÇ]0B%ˆŒôð±»õ4ÿ"+,È_`©$p¿,÷P— &?Ý£&´‹¢ò2¢1—íQãiÐ $°©¿lµnã qYOa ‡½#j=™NÙ/i1ÿã©äá1"DwÞœœÓH…iájna¨h¸¶ËsW ߤ¥IÀáÁG‘(!Ê¿<’C¤dÀî¡ËPc=d¨ê.JöHÁ|¹:K†.ƒèºFf•©4¤6&aIâ»î2¨©«]ÈïYImÊ5*™63Ÿæ(¼ø'Ì÷àñ™F‚€K®c²º¿€iÁUD#œànÑœ,ÉêLªÇ[‹KªHG"µð¦æþpR¬ö¾@/p&jÂÈx¯0\¼â9`=‚¯Z¡8ã®)‰VGqÅõ×FŸEgwbvn LBÕdIh¨zad^LTu‡brX¨QØâ÷Wø f õ­οN£†½}3$BWDÜnU0ÄÏšwgçf[ó^B3çÝU%.s>Ÿqô ŠKV›i€øë¤÷ºŸ¸Ôˆ/QÕ@'¢<á~A]UúzØë!dηÛUihr"’UvXê9|pÝ‘,&f;âÃDŽ6ûÕêUVÄ!óv1#®›fŠÔ`õv­¤Èª>wT(O‹,Í×›ôyØå~ɲé9 Š.íWµÏÁǽþ.´¸@N”NºÂR" §Çbâ{ÐE¡:I ÑAR5 Á«N¬»8Ç­:%ÈÎxxc>‚õᧇí3Ánr¦Å‹‰²Ø7t˜Çù¨ï¯ò‡³~[½VA4ú¼ _µÊ³ü©ú‹/œ¯O6§€¾+Œ¯)(z(_5.µ€~Î H„–¦8á9ƒ2¬XUUIVød³Ss³;ÔΨ¥d—²úÞ³S ÔýU–K7Á´Õ búpŠútÁôáݾ.L9«–-‚pðÉVy?áÛÖ°í›À­¶I †Ï‰´yîðžW( .ˆF©á˜ÖËÅîq3¶„Òtäc¾e—å¹%iåŽab‰rlj†ˆ^kèkßC¦@•Ž¹£´sq˜û‹—SYÙ I+ËûÐÀ0Š%ª‹,%†¿½ýnýa}"øz€"5&Kõ]Œ©‹M¶t¦¢€Â„±—Ö*ÚÀ@ ø(ñZEŒòq,9°ùü—ä7½¥(R›†›@òu¡• ¨R¥ÿ?_Êž‚Xú#ˆ®D;H«Åœ†ðv;Ì1Ñ…P÷ÖÖ®!<•±×/•Aa,ƒTo=ø(f„ûóvWƒFK^"(ä@Inž—g…šeĹ”÷±¿ºÁJåX!¶W®TïYQ¦RPÎ.2^íí×Y±[“ÜyŽžŽ&K}`•%ÙÌiÐÀÒ£n«Ê)§:ÕÖª¸P¹R6ð¾kŠ%»½½CMÌ1²àzJ´Úí²ÃfµHp@ÿ¦áhÂŹ;N*‚Ôª¢Û!0Z^hÒ3›P=&‘êZ¢¥ŽÂ| S‚Åj6rñ´åtí §N¡µÁ†Ù²P»dY£ÌÂõ° ø(qk2÷˹IrÆOÔ’˜+Ùi2kÁœd›Ó*[$'ŸPXòœÄ½åy¾.qù}.Çã Øs¹T–—ÊrŠr—çð›-yAž‡+ˆÜÊ'À³%k²Ej¨fØíV;¼d—mVxÜDC—ý,òYw k©Vx8ŽÕ¡.€;®%m ªÉ—úK•‡{Sy(r]¦I€×òhBû÷å¡Á•uh¿àê ‘ ÊT:Š¿ú‚Ó¬¯úâÖ[B„úi¾«lÜXUÔŠX§*¹#1‚8È=Œ\þZ-q¸eÎÜ£‡t©U !Oý^.ýÐÉ'[‘Ò*x­ÎßW«‚÷:4©ã¥X¹a¡FxxÕR’€ÚåPõ$ï§BÒ< 2ºz‹iXþ ‡à‹ÅI¯6aPQ(§NåZǪ³?ïvF¡ Jà9N&1‰Dž܇(ñŒ€ÑP^„YÓ¥–JŠÒèr.K-~Ù£Qe–¼Ã-t|kêtƒÞ‡£ÿ¿“>¾Áâ®9Šj¤ZÃ¥„´t8’“TœB_YvŸhéu[qõ „|™,v³( ðHß’€BmË—[7¡:×å}jò}ì‰V«4 " ýNrŠgk•¡á*¼ŠÕ íÑAó` åxÆ”]V«Ò¼Ï@ôÏä1ª`ŒHJ¢ILDä$pȻՃáÃnD®Ê—ЯFÚ:žÛÀÉÃ¥d§o1„ºÜBsÙzP‘>t7º‚¿°ü´ðxhÿ†éÛ<Ð/pc ¹0ŠºØ»Ù„èµ épAæxB1…`10$‘”QFe™Àd©„kÙ ÓÈ»)‹£À…!áf^¸_®¢¯fszU„æ‚q„Páö þ\^¨&EòÊN-,~§£Ò‡Á¹ñ¨6dó)Æ+¢CgÕÚðQÌL/@ †õŒÁ8xEŽKù|–IäPâ—¥¿®Y¸+`äꚨ¢# 쌖iYæxr8Ç /0¯¢ ðLÉž­PôÆDAóSµÀCÈÖ„/5'î¬G~RT=8¿îs³ärZrHZãàÚÙ‰ÙݼÀÉ6Im€¡g³:4V®ËVí }r~K"ËnJH³Q 8¸X—0 (7ŠI7´&;s7>Ô÷Ï/cE_¦;gEíjæ·wÑHp¦a!%`vÇÿËD—bÏ’U“SÁG‰ÛP¹5Û*šæ"h F¡¾®É Ó9òÙ3+ Ef”q–apš”8FdY’’ ÇY…!Ä’µ!‹GC)hæm©–Rª¥8ò‘|[ª£Ü;:J©nªnâQ“[ÔJ ”àà£Ä•’ÒtÜà\AažŽ[˜5Yþ¾%e}|KyåãjB蹨(—k×DEëðŠÃÉÛ@XáhƒÿW¿J´»¦£}el½žtáýELS¤Ò˜ˆöpi*k/a'ðï¥d3‚3Žb‚Iº1Å©­#ÝâàP—Õ¼¾äD§ÓÖ¸Q£”””hÉššÐmµ'4‚'W¤ê/\DSSR‚Ï$‡]lft=a³$Þìt_³P_n,š¦Áµ)ƒKÚ’à·°É+ü ‰‰0Üó?p@ÓP×ã¿B…J’ð7ÆP¨çoøCP8jÀpŠ¢HŒƈP~!h¡Î"‡ŸdHÚbx‡ÓšœóÂóúþýiú\›.­ãÞèÚÛŽtíѪc‡Öˆ1ªQ£×ˆÖµ‰kƒ¼ש#x'P$ÎÎ[4=„77jÔ¶³ñ|Sõ%Œ{¥Q*„…Á‡õÿF9=žŒ–œ|?ÕS“ÌG³`0Žã´§Õ{ï¿€ÚX¸7Jî—lêßÌØZ?ì;.¾ÕÌXíá&ÐjrÈÎf=âÚE±êîäõ¨-£Zm˜wš€¦â§CÛf\ö3PAjfLдlÝ÷µÑˆÆ8Ôœ&'Ðy\,¬1Ò‰ZnW>ÊÕ¯"šõ£¯ÎÏ€†äˆ#P[Ì@!r¦™eG¢,;4ŸôÁ l‡h7ÙœžßôáûóÚUÇõé—,ÛÓ¢û@•·‘öMpJiW×ߧ=æëb¡AMQÙª¾ƒ:ÿ„¦ô 8­6£&s$+b±:õì7Mý75„}MP˜Xš4Õ‡~N@n8§@ å!±èš¼l6ÃvÀ@ÍnfDêß6ÀÉõ¿>ÚÔ©Íêʈº@ˆ242#mKmbÔ Éõ¥þx”YVÀ-h4%'i÷ î‰ØìÖ>š.íÚ~x‡.ÁÀŒ,^7ªý+1h4dƒ¯5€šPF\&»®Mƒ_. äe;jR¨6ij—Œ†_d ]€A/bUïñ˜¿…ïo·¦`F—ä„”é2ƒ’ÍW¡Iíƒ1›\_‰Év ú8U‹_#O©¬®?¾ >´7B½%oÓFf“ÌlŸÚ‰E^€:»/„· ƒXð‚se´Étw·sTÿ½gû~´i£d³nù¨ZàȦd…ÚÝûâuY¥tŸ˜~Í­0µ±ŠÉI®3¼´ÁŒ­ÁóÜ¥ûK5Âÿ¡—þ—`¶ <<‹9Ù"¢˜»þ‡]ñÑÿh'Kõ¿âø)ÕÿŠGÿk¯½Z¥Ú_©öw?j÷©¶—³R[íÏ߸¾ñx&Ú;ªÕP¡¯NW¼ º9X>VHh…fÓÒl.À²57Î\%oÁ– du^P ’d%H"½DÐêò[iõÍŒç]såCY)„/xÂ\p„áxÍGtÁC†#y‘\p¤áÈžpdœ 8•œO8 .8 !Ã1yÂ1¹à˜B†cö„ã¦Ñ\Þ›àX<áX\p,!ñy±¹àØB†c÷„cwÁ±‡ Çá Çá‚Pá8=á8]pra¼9ÀIö„“ì‚“2œþžpú»àô/Ï„‡s@0@5'<’;¶@ä1Ro0ŠKÁ‹4P]$Ž£p”áÿ½kanÛƺÛN;±£ØÀg;ÉT±åD3Ží•ä¦™ÍŽ—0f#K^In&ßçö·/êA‘4/ÉŽ›‰Z9%C÷\<€mG¾¥RÙøb.§T$;ñE XxOœ]¯K²ÉEDRJc'v:Ì S›„8]œ¦N˜âh7O^–u¾Y>O@µã”¾Ë³‘”´ùÛøhÃræß°TAN—ß²°ÁýÞßµä né I½Ìkôj¼PÕ$Å;Çò½C„‹»Ðž¬l¡Ôt~¸Ê»AáªÐÔH çd9”wøäSÀy¼+|n4þî…ð<÷ª… oåE … P²V¨tÓâGãñU~÷é³M»»Ë~¡„ØéºAjqËn»»‹êË¡ÍqMÂÉç;>&‹ÐÃnØmuìnwÀîlh÷UdØ_å{[²» `w±Ý=»·‘ݲÉt†þ`“©”ÃZÞ¾E÷ùhŸlÅî>€ÝÄvìv­oÄVó7bKÅZz_ ° Æ*_¹»Í‡~€È0QÂVCÍU*+%ƒ¹ˆ{*g¼®ÇÃÏ—,™„CNø<e³Kq„±øw|33Ãp9Uäò«q’¥Y,!Zro±k6¹ÊfbÑry‡ÜîKž¯<ÇŸæ¡'Y~p•~€Ë©"— ÄWlöÓÆàrª<–ÞÖC?ÀåT‘Ëñ^© È#À澋Ӷ®n¦ò°ðp¾÷`‰; âeÜg¼×·tñ\NU¹åën‹m÷ ~-:îºÓózò"²+qŽø¦öø—*ò/©ÚŸÛ¹oöç9¹‰Ymà·þµUÇÒhé&í°ØÐR?À¿¶:ÿ®/är´û<¶ËÍÑU8c“,NW±T¹þ[h´=}üÿÚŠüKó-DEÁ‹ó+ÂNKûgykPÄ£Éí1Ù(O8»‰éíÉøj<“5q·šMµñük«Ž¥¹ý¹‰Åaóz¹MÇéì“`†ÃN¯Y,hN"ˆw"n”SÝtš7€&~€mõ¹ì/ÿm€mEþ¼îöQÿôhð¶Ýë þûYïô×îaç½|Çßì öùàõiýç?í>[ŽVò!Kûä?ß¡Îog½N¿ø‡Lêð°­ÈÃÝ7gÇ]ŽšW£×>t;ýOöŽÏ»'¯ZèåùœÐq÷MwÀ?68mÉÚUÿL?Àö"Ÿ¡7ÞÁk¢ý²{ܼ“>êN„q¸uÛè¬ÝtÎÛ=tvÞ;;íóæá­vØí·»o:‡qàa[‘‡»'ܾ¨ókçd€ú¯ÛÇÇEçyÙá†o¿<îäõàNsØíu¢‰¿™ö€‡mEæ¾Â½žÿ¸…úgƒ®ø¥ó[‡ûG»÷®%¼ûàô¤ßùç9ÿ¶ß´_qwyRò2MüÀÃŽ"—›wãƒó^çhî[ýó—ýAwp>è W§§‡²·ö;½_»þÏèøTôß#tÞïèæqÀÃŽ"¶mieœ;=%üæ¼ß•îß=tz½ó³A÷ôd½>}Ë7H›>”ýäôDº•¾ÿ8;Š<̽ý´÷NQxºìÀ-ôöu‡_ï‰ÎÁgÐk Gïz݃Añc¼¦ƒÓÞÀÈÿ€‡E^¹1:é¼:î¾êœt²SQƒ·Ý~g‡Çšn_| ›ûm›×÷\º—èë¼-įºøvyxÇZ2¡îjþÚ>2ÇÈCf¿;¯²W¼žwä=Ãøã<쨯)‘<Âø×Qäßò]t-yŠL~CÏ<¯ÂQv}3äéôê“‹»-Äø@ž4i„à_G‘—{£O÷ÐÛyz}6™–ÐÄð¯£È¿,[¼¿Ì¥79’‡³Ÿóë{óë¿Ü<»žÞ${éädzŸ·X €…E>ßdÓg'c6Dgã›ø’ÍòZ¬®ï]ç×ÉF|`UD¯.ÀÅ®"ŸMÂi8âÃăËpvòW™¬Åõüú/Öì…ñ^6‚šÁ¤#»|fÚÙUcäm>öõ*P²[¢dµBžtxòZÎÅl:O¾{ñ}6Š‡7 “.9%cÐ× «ÐgB@žmR(Ó=•±ÌþîÓ-2¯ž¥ð6]Ó[Þ..&ÿ¯‡áçÕ±[ÛÈ|<€4<µ±Ì6z™”ç›x%@^`PhÐÖWBþe5B|º©…ý ²Yâ'qd{â„Ã4Ž©k9Ì'‰/‘V®z¼«Í>²ÏŸÆ“$?õïq¶ØŽÝ¢æ:DÀÇV‚œX¾oùiÊ(N)³qdÛÔ¨½~ ‘Ü×H€yrÔ=îp2ÅVÃ÷² …ËRòÃç¯ZèîºðÈ¿¨ÊýÁ†;èÿ› ¬ÀDÿ<”õJËZè÷·£T=G¸…rIºø]@ 11vSeWQ|­”®ù"³lÉ=­x„8 –O‡ãOß½HÇ‹M+Ñ“ß¹‘ù§—tžã⯞>ÝQDÐDà–P!”ÊýœÒ'ónSüÃ|ˆ0Ìx®òþòãoƳŸoßÏò_æ%í¨¶ÀÉ°!¢rà+·B–.aÐ?ž£“óãcUÛÁ<6¶ýÓgÏP1jÍÞLÚ[Í™?_Ùll8e::pþþVÌ$nÏM­Ô\ùûú‹Õ7_ÙôŸ.åæ1w8­"/a@ÊÍ߯´‡R'ú‡äuÍñ”¿_q¯Rkþ>èž‚<„Ôüýdè1 •æï×ÀÓÇÿf /fèÉHÜÐ÷C²Sêì‹äE}sçïWÐÿ©U{ žÆ¸œ¥ýæÉšjôÒW£ðŸŠ%Q³¬dV+ˆš¸5bCEÃpôQžû«‘0Æ:¡ò΀ð<O±NLô¿ׅχŠ€¸ãͳRCŠd»¸,ÛU+€¸ïtV¼‡Î„%$—åÁ}ÌF‰¦ãA Wƒššãf¹ãfEÇå/•Ý½bRëÈmM+&Õ©3¼x&§[¡i ±5}„‰kS؉û¾“„8M}šV}÷B àåüÏýNûÇç'‡£îIçP9û䯘T÷Q2KËÅ?!³æ8€T9 ©A¦Ÿ²Y|yÿ¢Þ»*»4×0W¹‡p‹þ»7/O/Ä6ŸÝA§×œöÐOÚÍØå_VBn–hÂÂóOª¶7@i¤ŽÒLíqÖîµßt¸QôíqN8f~©jíÚ`QR7 1µ‡¸gXÞs¨o¶Øù¹Æ9±˜ØànR? 2³ÇÑùɸCÓÀ‹3¥î½¿i©w5aHXÞ —³Âú5?}?U*ŽT+d-¤šµ(R.¦ÕÄcËÃ<@e‹i5»Ø`&L°‘aŽ Èi1­æª0zYèªV(@£¤mg¨hH1­’—JÆ];RDO‘ÖXЇbZG$'ݪ½PbZ 뛕¡¶,ìT+ˆr›ý•G‹ãIö!-”sy~«çÄ€ÛÕ ù0ÃF@!‰ímÄNÓa# Ä6°'í–†.¶ËN€ú¶8Ŷì(ˆY)Æ–ÏQXl^?vT¬-ÃíºQ™ Jwþ ýTfxï×2Êí­3;¨½¬ˆ&±½ @Ñç#žòr“y€1Ì*q$.‹#Õ ¸Ã®rÇ=p? ;Ä60ÿwŸÜh ±]—S?÷ŠAìT 硸â²P­P€*åíË÷…Z~Åýóv8÷Ës˜P’]Íïø”Àš&€";À2̽%€Ô;usg•::ìèŒÌqeÆ6öhd9,ð½Ð÷<œËsBßI¾{1Š.¸£L7IÍv¶1¶£Ú¥‡.}{É–•”=à%à¥ÍR@‡‡m,ȯ§«ø³Š<†‰ ¿ÃeýR¡€»ÀÈf;‰ gîÎÓ–@ª†Ým¬' € »U"z¨DP³á²šM­P€B\€BŠþj×,)g 7K36Ñô` Ü»Õpw ¦‹ÀSEVÀ‹ðXLbϲØß³,q´¸õGÒ²¸pxÞ´šßw(Ží ÃÓÀr™ø:æЧQˆ@±2Žø–Öª?©†0@1‡MsPÌaWã.§èR¯.æ‹7™:DqØ­™ÕzdŽá°” a4˜cQL›ù6ùK—øŒgÂR‹e^·ôw¸¬¿S+àà”¢[¸k‘"oæ€æ {5ƒGæ!£ Á)KCBYÔl7a¶Ûžã Ÿ—V2õ€ÔLÔtPÓaOc9Ä+úƒÎ6r€Ô¼R{dáÒG‰vJ7Œ\7 |–â˜XŽûáü˜¸™©GôZVý© °‘WŒ,î-®Ýa";´x—qœ4"•ºAá ¶ 3â ûŒ¸UðëyUÖËÇ"OŸª~À\žÆzÌ ¯œÁ¸ÀˆÁ×Ywiе¨.Uû§øuË-æw¾ê S|€TüºaÊÃMýø@H÷·±:ò«áÈÚ¨Á¯Rƒâ¾Dv¿ÙÿDŠÑ7 ˆ>ýr@¼³¿‹íJùU£>6_]ɶÕþDCsQ›ißjÔ9‹ÊQòî)„¾¸$ôUìR€Ò&² @¦‹Mdº¤Qৠ?g) íÔŽYh{QPj§)sB ezÂâ8$|ús/%AÂÇÏ)‹(±â8ŠÜ õñ‡ø©®+Ç·/?Wåe‰UQߟø~-}n!K±·@IJzHµÞBQ#± &á Q$%‰¢Z¡Ê&…Þ’¤¡ËÛÌgŽOlBÓ$pâEqä“4ŽDéâð-ªÑ[âËpÉ»*.ÿqêÅ”Y4%nJ Ql³0MœÄÝu—™Ê(,}æA: Ú"ÑÖÝ–)n‘ ¾´Y¤¢ÍRBp™}¸¼ø$6q¿¸ 'Q¾^÷¦ýÛ…Ø…õä•*¸æŒŠT´YJŽ³Ûð±œkÕȇ"-´;cWת˜›6‚¶;=ºáánò¯u3þ[SsþFÊ(ªÚœ}‘ŠnK`¿ ‡ÃqüD±šö:Y‹­ŠÇÕ72/?û?6^Œ:pŠßQ¥ @0F*‚1E3üËú7wÅõÄžÃ[e„b_ø÷–ügþ'ªˆ›ÓAR>Q­P€ù+z­é<÷Í}\%ûý¾°Ä¾ÜG¡º¾®ˆ`ùZíVó„_!cqi`;^Ð #ì$¡ˆœ%Æ‘DlD>°ÙÅ(Z¼”4´`e¥"Ôº»W ƒÔˆ%Ìr‚0p7tbÆ“_š¡Xë•›ý]LÔ]ð&‹ÃœE EàTíí UêÑÊ­|Ø¡Z¡UäMw€·²1ôE¤F_dÒËž«?̤‘aÐW籑ÖH‰LÚò‡ŠÕSqÝ|e}~' §rgRÆÿW­ W"5z¥¯­ Á)K¨V(@¤5â¦û¸7OCãýÜPãMµ¡ulÖ ö0êçîŸëΖ7†Uû€rë¤[#ëú »@¼5ª2Å @Fj4aJw(*;'@¶5ª¯m9§±G´Jën«üê< ÖõÚßiSHàH®¹†Š›2è»ömË@í©ÕÞma[}‹<ÐÆ ü‘ÁŸ¹E 3è[ä¶f €(ÔŠ·°5ƒ¾EhsˆI8°Ù"•Íôë~WV¦z«34‡¤Vs¨˜ú@b×n¿ø•±+ g$5zFUóÉKùlDµBd F\xç­òFCq î«…½‡Œ:† 3«ád…¤FV¨ß›ÞdrIª€ë¦MÅàÿQÈ– l$NÍ Ã_Y7d˜¤|P¢Z¡BZÉÚÎpR£«Òë Õ%K]A¹'ÐZ´[ê ÷!Ó#€P“Ô 5¿¶®ÐnùÌDµBƒäµ]¡[Påèt€øjÄÆ\`@šÏ3HâèHiþž^ È5I\SÜN VtaÁ@± ¤,Æ)õqH#ÛI3‹1ŠY"rÜ¢` pûÊ= Í”xŠôù‡h¨ ½ ï©j:aì‰øfåïØÜäàCHE‰«¡ÍYÆÅÃ¥(M#*úRR£/5ŽŠÎ¢yLt§DKwú7‰©ºUR}|1QOc©l€ã뤱È;¶”¡F}«õ*1Q¯@½JtԫˈØÏ5™áª’©ªq8ts|汯f ùˆ¼}±¹’‘ëã‹…âbe»´®¥°ý;B@@K¼š“'´!@Äå£-Õ (¬Fç ÂÎ\‹¬ &©QÃGBoÐ<ÂYR'œ}Dþ¾PhuIV÷ñ…BY½²aN¯Q ?&ßØ<ZdR£EÖŽ…€¤˜”$ÅŠ…,VQ?¢  X&~™ðÑ2ñMX!“ŠY¬ÅOØ} Nžð?²‘jÉ;rk/"KdÒ¤"“¾{aÂf7“Ñ yQŠhRRD+z g&&@ÎLLäÌ3“²œ¹>aÚê!ãZÉpÀ1)p\¿éwùè±0Ù p¾»|hâuéLä»ðoó¡uÈ;ŽO&Éêpð119ø˜6²© vÒ$r}Ï lÊ“?p"Çö½ÈbaÆX%FˆŠ“:˲aÉ®‚ˆË ,/±ÛŽXÄ Cß ù8µ}‡¹V—4Äœs’\B¬Æ%»(]ß(ŸFKS@iåлq$»+Ý™b+GÒÊQ JæØ•7>«BhŽþ´rPè&¢nULÍäA±ú¾ ˜.¹©j&Z9žôn@Ø*â¾Ã&i³9¤ ûñŒà³*¬f>¡Ué»Z±Íaž*éÙ+Š™]ÙC…¼EG¥Gý:­9[T$­ ‹n>¬GÚ©‰Ñx9–_ ¶ ‡h~0ÑáQ@¶N+²uõ4Q˜LEsŽO+§“ª¥‰ЪSl°O3äÞTIî]gåÊÝ9'ˆ¡aió„Å®ˆ»iÍ¡â‹Ød2ž(xßÂõfã1ŽGfnhÅ)1Hµ) è¦A÷³“GÙ()Y ¾fŠ®'ã?²„éuKq6­ˆ³W¤Ü8¶œñ‰ ;Lº xºâ'$$qÈ'ÊGIx…‘¥\,¦Àòm.r—S52hMtÖÐYÿ½+ýãVòùì¿¢£ YÑÁ³Ç2°k'yY$} ØÝl{òF½™‘ÀÈß¾d_Ó—ºŠÔŒ£;†äÑL7›,’u±~UÜgÝÙR]*^—]Œk>±>GðÑœyÄBsqÌGˆc«nìüU³k±Õšã,#$¡9‰Š„„E¤2™¦§©õÉl©ªJ R.Fì `Ç|;n4”Ùþ‹f/%"R4–yLXš8SI¬Šœe:aE¨Òb¨Ùä 5ðáªy’Ûx~íƒ!憘0Ä÷¯á~æ‚ΦúÒn*¬N }ùÒ÷^öÜx ,‡n’‚WrbË|—OÀw˧¡X2Šå"ËsfÔºPBga–›#ev²äÆkèÇ•.w*íØa¡åx“Tp·Ë'k9b•¤ìú¶ì• üp€$r˜OB€W¿ Òþ^€&v¥‚e!|ïätaÕ‡˜Â/ù€9¤Þ$øóÎa )EN"€æ“à?oKˆ§ÿè^~º÷sN`‰€ÅN š'¡¹Þä5hÔÌ úïAÞ~ÎùkðºØ)4‡Iä,j ‘ÏÄý$Èõðmó¿`É( “xÚêüß<«€Uî Xå`•ûV9Xå.€ÕFQÞ•]öP“¤*ŸBª¶,ðcó‰pUîS‡“PîR‡³k0M•Á+‹rz­ €µOJZ!òÑ­ @PHØ#@B9T»sje,¼‹€fò‰ÒšF¨á‚uÄI”1³’Œ€Ë“ÈH7!ó‚2›LgàÁr¬nJYw\.€ÓÖ«„^ €’>Gîr”O GÁ¥ÐÖZs[ €Øš@„—óh×€å¡F…xKUíœZWˆ @|ôx8<Âã]€Ìômr¶É]`›ÍÐΡùÀlò)Ìæá°ïÄfèÓÅð%Ÿ_vœùggØÇ"ªñ‰8­s:Xp…|WèÎvÐ؇=# ЇJ’GSÂG¡ÎÌ%ŸÀ\"mvFÉG0Jd0@¹O¥L€ùDˆ8à$E¡ŒæD5g*Ìiªbt(®MÍüÙ3âþ§u¸”ÌΕËH?>BúaÏѢఀíГ ðZ|ðu<òq'`9>ËÝþÕãŸ4 >Çð9—øóõõjý1(¹«².î‹\ïþ¸7ݱÿ'`ß]ü90j<ö Õp_<öa–³ø Dü9,•MÏ,ä3ÅŸûGÒ`u'œÂ|ŒðÞ©À Np¢(Š¢NÑ¢¶~œÏ৑e#à—[ËÆ+† O†>ºÃU/¿Ã"²Â“¡ysàCßaB>šOõ—ûÏ V$C«ëðn_|t¥ óJ…ùþa½wtUŽ½ŸW)Gt²ÕÚ¥÷óú„=¤ƒÈ½÷óS¡Ä<œ§Á‡öó²Uø” @ RA|Í<'½Ay1g¾ï[zÈV祎ùÞ‡bó2@COÌ" Ú/#I”q–E3Î ÊxȸP¶†kçyÙ3 £j¿³éUâ8i”Æ Ui­…ŒªcY‰Žã$ç}¨õJ„BðÅ°>¦Q9c‰Ø©R©Å‹ÈèI,ObÂBekú3…GÆ Õ¶g’¸œ”t\Vˆµ"㔄ÄèŸÄÂÓb³3UJ3£ÓÓìÞ]+úßwjé¿33êyF’1ìn–@ب$^³<¯H2Þ»›;8ÜŒZÏš²ój„Eâ™ ÅÒa^ãÄCã@à§$x£CÜãš¼c‡fÆZGgåÓ´WNº>Í•M O±“4¯¹Hâ‚ÙîOšžóòLy&ZU‹bb"CšÝSh·³2ðývN¸åÒy×Æ;#@Îú¼t—£òö…'ŽcÆ)Ò85.@é9*=‚Ü—J¢ÉdF¸MkÌÏ¢$çÓ¹ˆYœHÒw©ì5~6\}£§ÓáìwÅO ïGÅWþZ“âæiu™G.~B]iTvæ¯6%~[—ùpqã'ÐGÅzþzÓáâv™'ç2~B z¢`<%~Ê<€l‘‰ªΈ—ÈEŽ@.n­ZîbÝ6*‘ lË€B5‚f`ÛŸ*?€ Èù*?{°d€¸|9ˆËÇÒ à‰>uu$t/™e<Û‹p. £sÃÇ ›O²<áIµ6L˜Y£C‘•=³Âr.…qÈ!£4aÊpPjŒ«()¸†³FIªû®[Þe—šì³ù%PÑCŽ*zà"íº…¥Ð¬">?ª¬q`°¡ cȉÂ;jbOÝ$PŒBN£x4ç‘(;!Ge'¼(ð G°,ݵ¸©j3ÈAmìø‘%|¼¿@€» 9›ÉÁÛ54T¼P2‹"%i–EAµåsURö̦CGñÍÖEp{¸G]^Ý> Š²Äò W»åj÷ïĺ/ù{uUP?U猙ág13Š…ôKE(hžFD3*rÙØ@»¸GŸJ ;¼”>ëH©.åÐ’·ém6Ûu~w{ÜŽ¦d¡¿þüýi•üæçïëj ¿ ‡ˆçQöþ£ùÝõ­ [šQ&„h▸є¢\FJÓXa˜fŒ§‘åï¡ÍÎPÏ”mòª( ?”DIN%ÍI“¸(4§V¢©\$|¢S6î )€¼ðr”¾OžÍíÚ|€$´á[’k‘HQdq&Ó\ˆ(Ѻ9X.›ÄÓ'QVDׄ,,˜6Ö6§B«"—y¬ÂAñï²uêª?Ù,ÄØõ£ˆ™R  +"AU¥y$)#©dqRW4¬£éãYK@åµï“§âUHòDU!IUJÈ8Ô± ³,Q ÉrÁ¢¨Þ U“xúø†öc è‘# LŸ@(`×uŠÑq*ø’8¡á8‘2&%cyœfç:.¸H³œ'fMÅÕ@Ê&¨ã™„% nŠôÉSºCÑäI˜àQþåqÄxn42Ê©á$NšM”M:ð¿ð,yeÎÑÔ·FZ2b;¨OˆÒ”1²ÝfGÁ"o ëJµì_aX>yÞQéìö ýÛsmÈóôÅ+],nkúìùEZêæ]áj³º[gºšA3:bSÀÖMŸ¿}f¾¶íã ;ŽieúA#b<’¤£ƒÛ±$ø±„I9–+„Žv6Ï4]²ÅÈ &›8~êMXC‰aKk´Y"Ù³ÖnÄÐÕLSEW˜?ƒtõçõ÷SÓfNŽO‚ÎO«Oýi8µ8É`qg"âIÔ{”Ãsx=Ypjz¸'MsÌÙø¦ãáÎhß?`"ùp"™u˜î¨›=cÖCŠ¥0oÙŒ¡ƒâ:3Æ^LOu&ò"ÓDûOçe҈»ST°­^á”ÖDºŸÂÙ[µª=Ñ¿í¸ûÑmP¿ó§/1jMŽº]C]Ú@ó1Ô­ë" +z1Á)üìY?RežïÙ½k¢=ê‰v‡uÚŠCø/zàs?1­“âþ{{§@í Ð>%¤õÓt$dsjæÄtaG žéú;Ýa Ð;&X­ ¨ë±ZÊ<˜‰gp[=fÐ °œ_¾K÷ÈdHêÁ¡’xêÁmõ¨×‰Áœ§]{á)ö(z°Nhƒg¾ ùݼã‰ã»§™¦-»jè½OÞYføÙñNá"ð#´5h;©{>ÈÅ︭þ^¨OˆïŸÐÍv}—õÄ ÑàªÛö·-’ž³ qp´ÛvXã·…§óÛgW”7WŠñIU{x›€“Þ&àÄGë…cvñËn«·<»ÁÀXwwÏÙvÜcÛTlð) ÞQá|âƒtTÔwvCd,ûœ†q¡SÎÌNLÓ0)"Æâ\ÚržVÙîr¸­îFmNHþƒî-Çß~ÿÃ7ÁI±XêÓàà#=—#.µŽm»Øf^ÇÐD^à¨\iKýN/÷Ipb!×;‚'Þ·¨õŠ©¤S§¹&2Q‰LB%3͹ày¢BŒ 3j½b`[–:wÛ…!‘*´ œÈ ´$ÞÖ°‰|³= ª÷›uVQúäíûkBG#£MØó۫˹œ&È«ËɸÖåÖzY&Õtòq6|ŽæÀóyçÈùI¬¹|}ýÓzÓœ• (çm¿_8¾ƒ¡Ør#ø Ï|í}»;.&´9›¡ £Í%n‹–žðÉ<žž~§ü̽õ¿Tj–µu:¦"uX§"AŸ¡$5{¹VÙzåd)¶îý‚¥)ItB—ŠeÖeœ^Ç)Ó„hæâÞ‡ÛêêÕ.¢¹wÏH4Üü{Ícyn»óø{Ú›Å/èÇ÷ÌxZöºo⾋ÅÅ.jµŸŒ1»C©cpÇ93kQ¥ÄÆ(âI¹h?p[­SZ:àUsл¥·¢kÈ(DûÔv¨ ůµ*Üt¯Q“x5Ä=:lìÍú–ƒœŒÛDe=íÃÁÙÚ®N&ËE–ç,×i( ¡³0ËMƒF¹6 uYp[ý¥fÖÔâæ úDuxãçX¦¶úu³Lc[ÃÅ3Xß^uû·ž·2Ê{–<õò‰‚t>Q¿ <üájyË€°6wÓà¶×VÒÓ¨ÛœWNþQ8› Þ? ·Õó¾QKå½{CEÏêp(¡#Ž¢&â¨d/>†8÷—€î1äHksËÓ‡œpOȾx û|<Öpl¯Chkœð슮‰W_Þh#c¿ñut_ç#åà|¹x>ì•{×Áä6w ˜ðÉ®ÖÐáM ÑcÈm¹&ÔÂm”¶DDŠÖ–&$ÎT€e:aE¨RÔQK£´ÁmõãUlˆ»º[n2öfa4®‰™jo¯Ñ0<ûÑ0Ü%*¡õL舓(cqñ•'‘‘]Bæeö(…gN‡p[½ÂRçEYË;×Ãd½cØÓ`81 ù÷é¤`¶äÃÎIÁBÚÃén‚>ýRçÀj^ï–A¼ç:t }x€š7¦²´ŽÓ•¥‹ã´¥2œ^OeÏTõ>«{ç :h|m™< Cb§Å.ÌFå¶ÕÓ¤Û4WX×7ìQ«NzZµƒ»²]¢p1\üõ+¬ëàn}û]—¢ï.tm5a!‰×„]Ñ–¨#½êòøÑè§È€»XY0­~cÃmõ6ö._vg7wìokwƒÞN T|yvkõÆV ÎÎ^t>ÎV7¶Wûñ“ò“ÍV­·A±Z™¹ níûò«·ë¦¿ÕWG†Žy¾Ö›Íà‹Ï7Öü|ñ件Öê&øÑüü÷Ý2`QÀÌâ (&Âg26OZÿ¸Õ7¿Æ¤ƒ6³G5ô·Ûíí³‹‹÷ïߟç« 9ÏWë7‹›\¨Mù'Ï×o6ëìò¨¹ãöæÍQ –ÛöÓû'ej zŸ‡æmÕeóQ5$ûmºÊ?ÚÿíC^<ùâÿ_—®|••ÓvQZƒ´»qöò b›Âþo8,éþoÞq[$ø ʤ”‚J²/ …ù: {y:ðº³;8¾HÕf»º»ÀÐ÷Ñ×ó/_ýãåëÿýé›ÀNwðÓ¯ÿõÃ÷/ƒ£³‹‹ÿá//.^½~üóo¯üÁl}¼^«›MÉqÕòâ⛿]†óž—¼æõÏl[ÔÞ\¿=Ûvî<Ï·¹eCå?\/o6—ÍÐ$Iª»Ëkqhþ»Ö[Ãé̵gÆ€Y¼»¼»ÓßFn º”²¤žÏZhXñnµ•íêö¨´ù*¸YmMc׫w:ؾ]lsÑi°Ø +AW#'ø«ýe%uÛv,MÕÚžæ›™PfNƒL/—›[•-nÞ\‘£òï[#¾ê¿_< žo«Þ˜7ë €Y–zñæíöY ÃÛ_Û‹Ì—yóe}ûÙRær.õuuMÐväv½úÝЯR¤šÅ`¯è&[ì^xwZ€œ'çMúŒ'»2cöÍ6·]¼Ø®«ÿ±[Ž²Qa*ÕDßä¥sO1±_ì4 CÁÞÒ-¯éôÿF½[¯ÞÓ£Vù2+³bðÜh'»O—‹Í¶þÂ|µ\ì´Æ®êQŽ÷ÅjqSÿ'õ¦I)X)cæÆ©6Êc&ÏìžnCo?Æ4¢nÌŠ²£îµñJmUÕ™_JˆÅÝz®µfÄÙÝzm6~G9¶¼ýÞÙí=ÝÔó‹»e5™Í¬öéÍzôfŽŸîI5ÆÌ]Z½Y®Rµì·ò]õfDÝñœ®ú¶ù ü»¼ØÞÓ!ªùN/õõQ'ž^6©IòÅú*eçYDs¡”Ô‘*S4S!- © š6  ’½¶ty‚&±QA4YÁ’84úH‘DIœR󅬟PÚ&ËÛ§44›†©í¸SýÔj[µsßû¸ä^Gƒ®ú¬#Eª'ìHÞ>°jdøÄÆr±íöœÿ´Ów+ÓSÃiµá©Ùµ}ª’ö«¢b¿vY—Ãí´Ú˜I}Ëqœe…ùl8AàQ›Ì`²%²ÕuÕù‹“¯Îú:9iwªïóig‚`µo²ßåÆ=9 ¦_­™øÃ"]«õÇ{.+›pëû|rÀ ø¾vºÏ§ ù0ºïXÃEWåÛÝçóýAøˆé>ŸŠ/¢ÑýÛÅz³ Þéµ%½QÆøeŒPººÏçÉ ‚øÓ}>…]$ˆ¾;=( ÊEÝC-·GÒeP«èžGžìóåÖ@ j Ý×ÿ`gnî”Ù@3 X­¯ÕvSzoWËou¾VK#ð-ØŠ}µü—ùÿ6ò].T·þÂŒ¢„ÙŸH@ Q”@+ùÒéÕÕÕééÕiù»ûs:üüªûÙˆC¹õj%ÔÊþ_”?æ÷Eÿgôyû—ýýét0Çþ‚¢Û‰w÷í¿ßÒ@¸Q”p3ýÿôÇ|ú£úÝý™ú¼óûâÊŒâ·ôp%àlÿƒï‚O/??™w—æ燠|Yþõ²ú¬þ¹l~¿ >ýf{ß›ÇþBîÿ¨»öæ¶meß¿ó)Pg¦c§¶E€Nœ9Š­$ºãØ>’Ü43ÉáL”#K®M}¯ïw?HI$s—´ìö(ãXæ\,ûÛvrýr7¸#£œN!sZÃÍô«>þöÜè@5úMgCA¦¦¿©éätNåÏlNëp3ýª¯wºªH?€¿ ‡¿$“–á’þIÖ‡ŒÖd…~ù,é'F*Ò௹…N ýï55·uZ~2úŽµ\‘üø‚þlĨ￑b*Òà/Ãᯢ§½ lN?)ÐJ ?æÿ+¨H?€¿ ‹¿w¤·F'–þ•T¤À_s[¡ú[õé/v "ýþš;•Ðÿ‚ܽÐÿ^l8¾r¬‘IÍo/æ¨H?€¿ ¿ä‚ÜÝdr?”?]ù“»Ñ¹!w™®ïËŸˆÜïH¨ÿ—c½1W;U§À_†ÅߟžÛÁKé$f¿Wÿºïw•{JþZb_~xq´"/,gX,ßÚ§ý6€å6ËOF7·cµúDvOö¤`ùäjØ×3Ó[rŽû“ƒî,‘¾­öðÚçvs+ôXnc±ü¯â?€å6Ëwíyt6äM÷” ú±NÄÞÐ`¹ÄòŽHTœt?šéi|%#ª3ý!ÉÖGˆ>õ‡jfXÍLöÉ÷þô+õïÑlZ~Ëm$–_’~ÚŸ§<„cAnÄøº?UË–7ãÑýD~™~ §zÍ" £ïýáµ&Ÿè@ƒIMþXn#±\Q|-¦GÿªôXnî#÷·¿–ÛH,§‡Æ˜¨¥¬\öÕ¦äz6QÓPŽ %Ca¤b â…ÞŽ¦rÔïW¥Àr‹å$[wS ½Šò‚\«»*ô²Ÿ²‰þµ>˜ÿþÚHüeëü—|.è›9ÿå`Nf±Øø jÐlŸG¬/MPç=\¨ªÓ௃ÇßÕ…\ImCêö‘žâ½§bÜ“¥.ÕÊ_¯ÿ^Úauúüuøk’ž$F5œ­AKé˜IXR´ßêà H(DKÔüµ&£±D75½=]¦‚db5T¦À_sÁ2þKÿ! L%I™MFéô»B†9ÂNnD¬`N’ÛWÀ;V7Ì n2É^@Eúü5w,ü»éÀ_‰¿½÷í.é^¼í}lvZD~¿ì\üÒ>m’7ŸäÉi^õÞ_tÈ¿þÕìÊÓÚ[É\–æù©üùDZ¿^vZÝ.‘Õé€Ã‡Û.ÏÚ’jÙNó¼×nu÷¥±rvuÚ>·OÞ\õÈùEœµ?´{ò²ÞžîÝúmUépØAâðÅ[ò¡Õ9y/‰h¾iŸµ{Ÿ4ƒß¶{犹o%w›ä²ÙéµO®ÎšryÕ¹¼èÊ×#ßÚi»{rÖlhÖÐC;HnŸKþ’Ö/­óé¾ož…çMK2¾ù欕õC Íi»Ó:é©W4ÿVw8ì qXÊŠ”zÉü³}Ò½l´Õ—Ö¯-)ÍΧ}%Ý'çÝÖ?¯äEò$9m~h¾“â²kHYEú]‡]$›Â-‡ñÉU§õA½)[Ý«7Ý^»wÕk‘w§z´v[_Ú'­îKrv¡Æï[rÕmUµãJ7iUô#qø´Ùkj.KÂ¥ÐK¢”Ü\uÛZüÛç½V§suÙk_œï‘÷¥ ÉÒ”Ÿêqrq®Åªºü»¥‰ÃRÚ/:Ÿ•¤ë¼O>¾oÉã58¤ðô:M%èÝ^§}Ò+^&{Ú»èôjÉ?°­)1·5½×_ˆ19o½;k¿kŸ´eªÛÝÖžÔ5í®º 1ûcSö÷J‹—ëò]¨¯UépØEâð ŽíkEDÚoIóô—¶’‘œF©2»í\½êQqò>ȇ5õ°÷*qñkʉlŽJ\$þšQtû$”¾@P'-ÏëpØ¿™ ¤9½¼rm¡üU»ýþºHü,"AÉÇܼŒnëLKT¤À_‰¿'"KûøM–~£ ùi0}™>Ìÿcvp3™%‡éXí¨¿¥^(ì"Qøl4ëOÎGb@.G³ø«˜ê^,Þd‡ÿÑJ¿lÞ‘-õت“xxŸxKŸŠôXì=}|W£Z06v»D6 ¤W‚7zÞ%“Éh¼óúyf‰Ð29™&R¿~UX­“ây%ˆWNOT‡À¼+%G•õ«CHžWG”ðJP¢¤“¯îßsv^?w44Š5t«ó¯ j‘¾(f¦H_4«N8€ ^ &Ôãy‘pcïÇÊÔs x Ô¢Þó Ôg£§®Èpx Ô£½°EocchÍŽxÀëàð€Ûu”:Ǹ1?oz«q@þP7fi­æÍoá-IgC2»Ó‡¨ÁqnÌ6?ÕL çu¤Àî×hÔ/ÓëK¡ï\×ÏÃØ·xâ¸e< mªö0©kaZTWf’”Í+ßÜ÷ÎòÍUÒtV[&¿””():/jz~Æ‘“R×ó/¤ ìE¡Ï]aåµäºkYM>/RL²*Å÷?‰Ty¡ÝÆ2Ã}ã^íYt±ß¬CY©yò¸—°¬ÂÖæýâ×hø†ž Núb€@`¦/Þ£\d™»™-›jÖV¦ào:}ßyŽÆsþî~#ÇD^ýMãlF—üëçŸ÷Tè8U„¤º4tº›ËrñÆÌøô¥J!þé÷Ùhúòî·iö%oiûö` Ü:"hûÀC¿…~ºx ‹‘I~<&çWggXîª;àæþÏdU™LÖ{$>šub0ÕàÁV¥^ÝRÍÖãµÊ©<_]n)ÞM-º¹E¢2é…Π߆r¥@²·<_NÎ=êuU»g”‘Ÿ ­ b)Ì-ϯÑödJ–ÙÚòüƒVÝaT®©åySâqÍ–«\y/¸§¹?¢Dw½¤†”Šü~!™ÿZMŽËu,µLKÊÌV>/vë¹®'©Ï’Àulj¹Þz›;>µ¹•Îg Fkö†Jâ@{áíú<Œi{¶gù‚y,ñÛJzÜOƒ(Â׺9õˆýåBËE9Èó‹þ×.UMͬj\£€Ú¦¥j»(k*TK•ÚQÞ]M¨€ägJKÍ`œåy\Ùô¤@N3¥ë:û©´"®L©©²ŸH'iÈÔHCÆJ> iÍä`\£€ž53vQ–¦!&h’Qbs]zÝ¢J1¹ðR7öjE±¦Œ¹7৾›:Ü‹–&¡åÄ,ð#› µ¡`<2ÿÇ™?@[y@Úekü˜s(í ;n€ô5j¤¯!Ç TFͤ2\£¼™ÙY¨FKCþãÆõmËŽ£0ŠãÔI¹kqáĶë»a”„, 4e6¯0nTÑÈù¸yÊiWø–íI›‚iJHAJmN9 M±Yî{µûdÃÈL 6ÞC‹élóBi”&‘ïr¡¸ÇÃÄMB;0ŒÞ…âÍô)–©€:õÖÔ)f×[vbË(7u'YÑÒ4K¥ãÀ]– +ðÜ ¥–Z©ôØ™G}á¦kh–í쩹Še(dF¹9)JuZòEÇR(tn*t¤B‚Ëhà2 —QnêP¬]¼,!€åµf.Ø-jÆná”hx* ÄSQ3žê﯊ò£P‚¼~Ñ âz4¾%ZèDúF"–ÜëíU£ß§KÐØ槚‡çJÓ¯cœú€.ókDÉÒÒP.„‡#ª7IŸÐÃ{&b‘ˆU£ë±jtÚ°o€¥ ,Qgt-êLy!Ww‹QµX°9zrçõ¤ÿ¿b47ЪOëÙÔ=¬ ·ÑÀt+Ùªà!t4¨º@$]‹„{,Cˆr£F”ÒPâ×hPcU‡f¬N +Ahïȵ"F™"; “”'y¤]ßN”Ø+ʪ,UѶÙ2‚|ØZÏãÆò1 ¢†­EÔ ‚ŽxS;ü@ØvÊ}ÙJ²Ð‹ƒÄIÓ€Ù«¾ùâ-ü –£ Ä躗­wù]ŠöAåF[ ©Dü0#âÛj¹)ÀÌMp–›ÌÜ×h9º2T¹þ¿ÎÛb@D×ë¿÷s™¥ê×Ó&%—W¤¿Í²\ÿ6?•¼-Ôëgf½~\£€ž5‹è£- mÁ¬§qXO’€91w¢4LCšJÝÉ¡C¢Û€×æm FS–x<åA¹Üó¼Ðó#Ûs\7Ìb,VŽ£á#8ùÃ؂ףLw +€tÕ b@­efc’ÂJL•ã*é2 ¨œÌìõ‰ãí¯1 þ13ëã°Õ6Wæ´hü]¦ôP“˜Ù¦C¯ÉWa›†Ì /ˆ’0`åŠ(ðݘ{—DL¤ Žä¶éRÁüŒS |23Ë'ã Ÿ·:®ªh0 01³ëDi2 (™å‚qÊÖ¬á‹j´´ "Ê·íȶ,áÇ3]²Ä ,ÇMb‡s+äš2gCh̽®w!‘¡gxè¸>üÈ œÈOmÏ÷S&åÞç,±b+1õŒø}Ü´~,4Cƒ=P'’9k뿨fòÌ­­Taªì’QÝúˆJ‘R”QdfE\£œºødëswsöf³+?…×7/õ’íl1ë²GîòÇ{®œ·°‡}I¸ºõaÐü@ǬUˆk·V.öü§Vj'.³BšøQ`SËe ³’”†–HüÐYÅÿ¥žšÐGÉ›°Ç°'°Ò ® $DnCºˆ6+âÔözä–çÈŒ8G¤9)²:AŠ Rduªç±Ò¸)ÌJBBíØŠ¥xǾo'ò?§‰ï:ÌËÏÌoCµ—û‡‘U°e¾ð30EFêÒü•–‚äÅÖ‚¼êöxƒÀk›/»j¾Cp™GåØóô“0ôc_‚µëx©-"ÇshqK0ê$®²uV)¨ácacl-l Ù, ûkñ\j-ZBC2»Ù]ôGëï«N{_Ÿ•_>wOš½óæ‡VÝ=Àdá¦É²úp&G¤û[bLçe±MÝ€'.õÝÔó¢˜ÙWa”žë³ÿt“ŸS &˜…·º‰}XfÐZ,Û*ƒ²”'$ƒtΔk‹[<´œ4ö¹'!%J‡Bäâœ5‰çPý6,‹3›Q‹T€,V†B+tâ0 ¨°”;4 x”p—2+r™¤ygT“xÕÎ¥À209¹ir®2(ÓZHñ˜†žX4T~±'|׋åë¬8qçù ËšÄs¨þd–E€=ÈM{p•Ej!”`eÈñ™O/¢Ô“Jâ®ÍxB¥ºX’$yü¶j²‚ª¹þe`«rsê•=Ù´-’=žÔ<ªÈͤ©ÅÜ–C µ(Nì Ð{J«®è&ñü©½¼‚e`wsÓî^ev¶Ð ˜cóÔgÂå‰Ï™„ 6 ,nùg}ÑMâT{ É •™¡¨¸FãÈÇׇZõvoK`NùpèÁtï~2·`?gìêêúÉ­›¹ê« $B"Ô«èõ©HûC½ÝØÑ«F¤Ý€¢ }Îö³ËDc×°,T>š—›ÔOúâùؾ,Jú®”óÅ=E­îýŒP õUÑfžÇý,ž‹¼Ø}A wìífG÷¶úª,ãUY•™ˆgÑÊ£*ˆÏ_¼$ Í—·îe+é•díæÝÕóù·úïR2Åx—¶ZqŸ…øÈf~…Wiç,†}Tøe?Üß-çrÁG'›ZØ}À±M®ê8±¥ØÆG:0 -º4ç+ ˜°è>|ïg«òú6Ü´k, éÕ¤µcìRL×ø­Vø–•Í%¿ rì14zÌ‹ªUÔqÏaûœMé×Â[ kJœ@ðȧø~P4Ún^)|XOØzOøÊ 9òy L‡½n<¦Wöà‘˜žß±·«ªÛuåžAWàâBcÁ¹xõ Iáj`°¡‘àÁý¤¦ìWô“WźsžÄs·ö¤" «îÊk¬eUÆÖ€`™u¤ð$+­¾EÖk¿¢ÈúJ~Å‚óàÜGÎלG©Äx6/¯·*Û7dÛª¢9æf:\qo¦×¬^PÇL×7ÏõqVý`‹Ö¹Îç[Zç:}¯2gá"µxÎÖ,x‹Ýâ=ëÃô¶£-Öži‹Ãké ¸%^WÔ-kYIWàuô6õ†®9ZÔ‹ú •¸ Ϻâ¹]{ÐVnhà‰Ô43Õ4«c&à œx3¹òbi¹TçFr~ý^.Ñû$3¡µÂØ®Áìsñ…W.ñâ[ô~ÆfÈF6Ýø4r«K¬®¨ »‚Üæ®êgD|Ö™ÅÄŠ­pæèðz×-Œü†-ºÈ¾á"W™æ Ð3¶ó‹»+VT0p€^ÁT6€ÂÜÏoy”Ùuµ”¾¢W¼F\µoôÕ­€‹Ó*+·=þ„7µéŠImW˜øâ赋ņËÍ:+Ž8È?ªL '¤æ·ì=dö|ÃðPe2w>à4yü¨—r_ÁëYºë)û,XñnXPŽ™óñÆóµf¸8bI¢x‹ÉXºæS>d1b}IMÏG/—ÔjMGÖ˜«s”ò7úùåsœ›ÙÛ]g¦Æ:s]½°°á¸.¼…]?F¬®‡øàÅÉ µª#¶bQuø GâùZ;:±.[·:m·Îa×XŽ\ÔÍ®¤à >¼¨ˆrµ³ËÇ6¢ø¨Êþøñà€¤ãð‹ªmA^Ç#ÙÂp:Q‡Ÿé#“i8ž’t4’-“õ]Ÿú:žSœÚiH6&ÉXL&Ɖׯ&jH¾~öN Å8œ ‰ãCòAþüÏl@'L²–PûÈñŽ\_>iL.nÄ°nHtK‰Yç¿N§7GÆ÷ïß“ÑŸ·_Äðp4þÒèñgn@>{Õ¿þbA&ãøxg~ÇÍðË ÓÅIý3‡@ýCO~ÍH–‡².©³Ñ(¹U¿ÕC^?ûá¿ñ£HOF±îBCÝ™Y±ÍgXj|;Žú-ÇŠUü­ã8ó~ Ìu]‡º–gÿ _>µ¬ˆµM"îûÌ”4òCN¦£Ùýý†Îÿ—~^ýxzqÒûtÙ"ê­“Ë«7gí²sÐh|´OÓÞ)ùõ}ïÙéÃ᤟No4Zç;¤8ø¾ÛzÜõ:?U[TÝœ=˜î,ÌNÒ")Rb®ÓÀ{3`ÈÍîËbÑàk·oÝ–#ÛIf±?þŠ’%K~šR»[xqÛ²E«žza©H.LµûÒöÝ-zkzÉQiW×ò\Pçìœã^æóËÊéè<šåKhì!ÿd¢åýdÁ¾&Ëhâ¼I¾Ÿ®`ÝõŸ*Ô´ãx* :qÐnNM¤Ìtêxó‰÷—ñeùy¦|ýùæ"º^VÔÀ›"*°4îÈ×weó/ÿé~_êúËõío¦ÆÂOâ·ÔæT£ûî?f\MkÆAóÛü¥úÉ1cnÅ— ôí]°‚íeÛõåÅêáA¿;­®éû·=Ü›5q—7?ԛŕ¡Û‡;—6ârkQ];h«]c{†P5¸=†:nnÙ ê‹ŠX˜L«ïŠ6a`P€»`dTîìÕìý¥›Þãú7wE¾š×ìi–6t™àÆ~ÑâÄ=¾)íFe5Z“¥yx'2L%KV*l(#”2‰¤R 7&+·Wp$5wýwý fÏ…Ì“; ²<û2ú´þXòÅR¿{÷ ¬Z^¸3X£òs•Ò‰ÜZšz‰£l§õ_» Ê|¹Ì.[ ³Í´½<&­“aþ‘´³VËüVÍ«åƯ5Íê'VœÆJJ•Q³8ÉÜak¥)£±`Řõ"`ùrS€^~Zoêòú ´Y¨P)¸{JÜ`¤ûAÅÆ“>ä£CcßcKŠNˆÑfz óÉ óöíÛÒ6Èâê.– ±Â‘ù[}ëeGƒÚ,ªzk<æݪõ¤Z¹iq¹ß©L6Š™ºw}•i‡#hušÙ6k ¼Ü¹ Á2ß5S!Ít±ŽDŠ: é~[$ß°m{ª`ä¢Þ:sÝÌæ£Þù­€™wïvµªŽUÚMß¼Ús±îÏ î¡ÚÙéԺ؂ÃвN™‡Px­5ìæõ¾¡u¯­#´ú}…µ&~Û'µÊ„º¸¼µ4­øž«.·ã–®5þ¶Z·éc è;‰%gxr]^\ÏOi"®¯æßÓsݘôòæƒ{o–eدõš=mÐÖ¿¿¨ñº-(=…ýûdömØ㢑Þ_gáƒlYŽ-y:‚áuÚázÒU‹«‘þZ¾ß ³<½ÊÇ8ízu;mÒ‘¨NZ?8Ý¥ å)žåQ0œÜ–g5yûÖ:¿·¥<AMh´8ÜÒΓm=és'¸Üü¦åv€u1¢T$ÿúR‘;ù¿=mþИb²ÿ‹StÎÿ=ÅçüßÓäÿ&³å[¹œÀ9ùwNþ“¾äß“}‡ó‘ãIþí§$,åw7Í¥˜v[ù±ºvTj¯5ž7`Rï›Á…òsùcwO‹©ð™šˆïo%¶„¨éDjRa, YK…E²ŽTË`³!°¦î%¤÷»ˆ¾9GŸwëP7¦ÿ1wS·rR^ŽÜ–3nfP\¤*MSNÞÆžÀ$©d‰ÂFjm¬RdLd1$±Ô©a½˜ ÇÌQ&u¡ŽŸØõòÚÛÉâv^5Yn«ù:2½½‡#3-C)…;…*™;<2E\Z¤¹¦óTðq™Q?µ5š hú9 éX…]axŠ©0ì6ØHÄ“4Vã¸ý°Çu³\w0]yÍt˜þŸ<¸þ&>¸†1¾'\'¨ú» †j(|MEÜ><$¶‰ÔÆŠ`­#Æ}cܪ§šú‰­1t7©'4§aÜÁçfY•-Ì"±[ø{†j(|†@ÕJÌ s\ „$LlmL­Iâ”3Ôª:_É:øÈhõÓÛF뾬ÅÉÀê5¤a¼ÔJ]¬ú Æj(~†`5‹u†”Mc“2ƒ@ †¸Sf†q2®ÀOm;à€¯*öjC˜4{‡WW jºr9âhRO˺º²°âÇ_>tË ½d…—âvPÛ˜ “D‘4ÆL ¦eœ(ð%4KE<.ñS»­#ã•Ã¸ÿd˜ö“žÿÄÙ üdÇ0U*Aˆr¦(‘)KˆQé¸0í§¶™ù}ó'3:eãØ›ødˆzü¬lçÿÝÀÇßqxê#”CÀXAUª8M¤e, nX*ð!aCFøø©mðãjfÆø %Œá=íxܵãŽ3÷fŸ÷ àPP ŠJTœpI(Ö2ÑÄ€ª$ŠÜF&*U#ËÝù©­±Uï46ü†ñ;¿?¸³¬–÷Å-Þ~Ã@è J†Pk)–Ì\3áŒD)D9(¥š(Ƴ‘=¯öSÛ<:¬÷uûƒÊgÉáµ ¼"g š«XHwò‹Û ÑD€›H"ÇfŽüÔ6eKÐÕ9Õr‡‘‰:”ýCDqÆÜzJ°$¥<ËÒ$µqâê ˜P¨ßSý“‰ÚOmWÔ·Ë/ãw¨‰›§ÔØ”)m0É„‰‰#1HT*܉I#zòâ'¶‘öB‰™} I÷‹;¼‰0¾‡ÕÐË xrt"ÇÁG(††à5çF³Øè”i¹DZÈD€Fnú•žÌ<ù©m[oóVãul€ c|`˃áÕßo0^C14l"Ç3ƒ2b\îÏ,¡c•ÆB% ¹^ýÔnÒ˪0nÁýWõ æ¨Çça"Tô—mM}]÷˜.†tPZNQnSJIL´ÖJ eâ4e(UbG–—öSÛTœ›oVÂD:HÞl)ƒ¿ëð_ @‡(§ƒ‰„@Ÿ1éêUf8I¬´‰ŠµÙDËOmS¤ª{‘ŒW ŽyÔ»qïC 0 ôW1îÆÑÓQ2çÁJ üA5°BR+DŒR‚«!RKJ¦”Ôm¶1&%óSÛR²g{°Jwsl…mX‡©ÄV¡­·çðBÛ@ŒJØ#Ž¸ŒÓD`ka,á\+•1B fjdÓ?µÍôy%¿6ex^§”!öf×éø;/» þ%ƒ^âÄ(sÃ…ñT1„Ü¼Ì <²…µ~j›Ål«éYÉSÉ€2DɾÛU2çÁJ üA5n"fZ‹ƒ(µîH,“”§a‚ǶÆÏKmKɾåÈ.L¬ÃT¢Ùù{/y Äè §ÃRŽ0ʘ;£G"Š('ÜR+›a<¶šO?µMnmòéÖ|ª•[+ñõŠññd!NÖ²ôúœ œ„(ØGÐ,]E²ëf¼ý…»™@¨Z™ˆŒä"®D›(¢a‚½ ÎÝ~,R÷Ûsût›¤x©m ñ¦y^”Êõñ¬X¢XaH U¬R^¯JõzÝ]Néí6|9e æU–iÁ8¸D‹eV%DeYâVÈ+m„‘Ujû©ÝÕ¯âéõ«øõ+ )!úU”Žë 8®ï¢}*æï9XÅBa?è©+âDãTZ"’¦L%B[MqB‘Žû•xî©«—Ú=.ì9”ì'vVß̓â †›ñ0_-Mô $R¼Ž+u-ïÅtú}©Ó£¿DE·îÞOMø³ã@5´°Û"L‰™Ê”²‚1‚8ÎexÌ­âf\*í§¶I~äúé:ý. #!  +=柷¦zþÃW‚}ˆR)W•…aÄšL¥I¬dœ#DM¿Å, w"Š¦ùì®z9Um´ŸúéôN­Õ«CÎZѪû.ÂYKH¡ŒT¯.Mb”Æ8ƘR$ 5FéTe(‰32²åú~j›ÍWÔ3X>èôk´|aéj¸…ÓÀ¼èÕ]aÄÒ,œÈò™Û²È! É-H1Ó‘ì~ÚÂËïUbPÑh:ô–mi¬ub,D6‹c--ŠíÈ‚ù©­µ"ŸÏóų¬L}ÞòÍ0yö|ÜòfÏÞŠþŽÃëʱ9(G˜–B4"‘ˆfDQXb¸Êˆ¦#›Sû©mêÊäâÛS‚0aöT‚¯•àßÝÙÛuxÈÍ!j€ Â3V1I3ª’Ìh­$V&UB&}O$-CfwàØíibe?ÙÓé4¿Ãû‚å/þx8”+ÃvÎ4®ÆBj§nAp–b‰±ÛcHf„ÞO§c½ŸÞ¦¤Ï1™ÝJ±0·xHpÜÏtTý¹¡fˆúìSè˜á¶)ẗðö†š¾Þ{l¨†ªAO€¸ˆuF²”ZèBjEy¦ Ϭpç^Ð~…<§·!~²K‚âžF$”-CDÀl‚ ¢Y«Àvá$F‹ ƒ3WD‰~KQNÈ{?½{H-‹‘Z‘0) ¶"(îš÷Áf$WÞrY“qD(Ì~i,’$f†HB¨µ1⤆O•¬ó[Ø|ì¿ÐŠØ0)†…âS½¿[ëï²Ç£ 0,«ûàeV0¬d¦2¦0ãˆêØhP³”÷ ÁO…{?±5îg=“1/÷aR ÆýŸöàÞße¼0,ZÉ”2“À¿Ì”ÇÌ[cŒq*pbd&â~…C§Â½ŸØfç±¼gæ„ù‘0V‚se¢òõ¸»ÈÛeø  @À F DêßŽÊ:è¨äh÷ö›W{.Öm:á<,ŸC«{ʤ[RúƒÛ+¢®Íø¾‚×ï·¨¨ì_ÙØ?Íï—7ûFñdƒå öÝåÈ^º_Ìîí…ˆvîVeÛ–N³vP¹çjžë+÷ÝÍúO«-m¼5¸ÙÒƒê\\\ÏoþflyNf‡­U‚nùªP¦2ÎS0_Ivy/¥í[çN£8òö2Š{[ž@¶k^󫱦03et$¡ƒ¶êø@‰^½n·[2 ù³ßÐQÕð’ MUó­+?ÍÆ„*æ—R1Õ9¬Xߦ>¡˜¥—7îõ™ ÅYr°V%\¹Ž¨;üZ” Ÿuk¬ºE§[$yvÝ¢ñ¡bÒpÕ:¢¨:XµM?Ü5jUðÑÑšš>sL{šU ¡ü¨‹þÇÏŽ^)¬pvLWfd3Ü»l£´×zÚ¦3ÇzyóÁ½7KS, å%\Z[ö¶j׿¿¨ºÍ2=Éûß'³l§?Z méÚz´¶“ õ!*­”Á7h^wøצ‡eÝ­+KÁêäS·2²âÖ£õ]BgÝñÿ–MOÀ)ícÇ·: Àëô1<ŠG[WöhǸ›#¶H‹»ÑƒR)gwsv7înЙ5+ð‹u¼í)ήwë]ˆOÕcÂ,VÓGìÔéOÇå–.¯X,|ŸÛ]- À^?©‹i†.oàåÑ笋€8¥I§Ô²š¥~_î"ÐJÂ;ÕÄݹnÿÜ/ËZ… ‹•¬©;ÔM·)ãɺ…ÂLËGRå)&ŸŒZæÅ1cMé6M˜®9V5âÚ ŸÚqüÆxb­ÛÅäníQÅ«ççE\O^zd49‡EOí¤"š¸Èu}8/Ñ¿ÓÉÁè¨éñÉB$F D‚—sˆt8Šd­tš3A}Òžvh«²9h·gˆ„Ùvˆt»Pb*ŠðHI0»=Š%¸“Ts“".-Ò\SŽy*z=¼¯å#GJ‹ÅänvŽ”ΑÒ#¥t”yýsıq´ÍWòÌ&Ã`àå¹+ÎHŒÛ®pRCŸ&õp|kB[­©i>3·³ÒBh]·Š9a[­š/K3Ó·ùj9_…CȶÕàd¶0ÅòVNÅìŸ`Φ«‡Yx³$æû›­ì1rD:„Ÿ(­÷5lZ•b §³mô@D–2½Yˆñ‹üsöíim>Ê ãÇÛ(¯›í«7<Ý–ób%‡%1º5–[§ŠÓDZÆRÁ$„Š¡Ä"lÊ#9Fݪ©Å9¸Opûº8ºº‚xBMWz2»‹¦fîÍ‹èÇ_>œC½}¡^KóN‘ "xyî,A­2J[¯ÿÜÍ·¸•Ïè,fëáÕãí(ÉÑ䆉6ýœø¥ŽÙ 2È}(ÊmJ)‰‰ÖZip”qš2”* ±éxÜG“™:»ñ¸Q³ãœ92?ò&BgÇùÌOež>YRæýáå9TÏgº•áN숓uÇâÄêc¡:±~+_Ï®¬ËãçÓø°ç_Ö=>Œme¸ÇoN.ßvÞ Sm¥ ¿öàEù~Rm©°öá²<÷Iƒ½Ñ«Ï“å}¾Z‚§{“™6ÅëÊÛTÎæÛ >6=ý÷*_N̉j%ÄVpª¢U¹ÛÏsT¬¦nÒ /O·&åˆ|ž/6p|ßÙ4ê<¿}î Ýy%ÆK]‰±g§°ovbûòDì‰` ³\³JZ¿–ï7¢BÑÄV+mJÛ qL)ýHæûÈŠéˆ6Ÿá‡íÈfð:KœÒË÷ú´)ïݪéÎÕ;sꢿßNz¬0ÐDKë˜+ÅT$ˆÒÁÔZdVº5 £™U¯æ›ìüÿùÃO?ÿWô]¨tv—1Øõ¿#úq@êv½Ü;°¦“Eóæ@®  ÞïWÂÙ¡KZ±¸w?éîʧò¢0‹¹›.Íî\Ð}}Ù|Ík¯ñvÎ¥‚ßš½ÿóÿì]ésÛF–Ïçüˆ¶v+ÉXR߇ÇvÕŒsŒ·’Ijì©™ý¤êSf dë ¯Aª“"ôéê>‡¡¹ßG hh±Ô€«Ô*vð4ê>÷¨û¬¢õ6à¼û}¥ÒûUt D\áо=ßK³N/:-E ÃÀ[â-ãRI‰´åÚöÊ8Xoæýj6>ħ†wÅñÄp<1O Çä`)_ç†ß[¡q¹næõö(œîA8’W¸ êí.¼VüëQ‘Æ*&…¦bʼ!ØAb–c½€‡öÛJGamRœG!åQ )ËÂéý¸Gž¸k”îGRˆ6•pùL$m‘Sd5±ØQiˆ…ŽB(7ÜØ’–nt~? àîGƒ ?Ä…“¿_Ö|âɪ¨·G3oö×}³Ð"ûÙW陞,´HEÒJ>Ôy"Å(‰é;@ˆR¨uÎXn$@`p8ÌóŽÅGõjO4¼‡ÃŸ‰QÁ¬OY#~¬êi~ؤ2*Õ“†íÓ;uô¿vö÷éþ çG¯ÂåáR7X¶BÅ=0ÙXSÔ9å Ñ Ë4›K‘cŽ®f™0ß5lói[¯öïn|³leL3fÇ—¡Cfö™Ëv¯U vÊZp»WlŸŒíÝP¤pP`Gœ@ ó†e¡@êñ®‹.Pt8§(=#2ï˜"÷OcŠÜë•>ï¹±¤]¸<þ¹šR#(&Ê Àáxm!³ÆÉ1‡b“¿¿ Ï~·¹J'¸&|ÂÚÔml{²™¬á¤ó£Wá2t]^•Ù®kÄñMUšÎM¿¾ëëÓwáìXçÀqæS0Èr ’°iµpL'x=Ý#w?î~ÐÓ1µÜª™LÚµ°Ö,½0yŒ±úÀ߀>w/½¡-\UVŠ ¬ke¥(1Û ¡‰=t}´Ùab0ˆiŬÄ@¨hLýsxÈ8ž"àØÿ]ŽH6"Ùçd0hWáò9š1‚¶Î¤»ë×T¤íê-b]@s͈AN[ë¼R:ÈÙJ`È ŽÉðÜáÔǘd›éšòb1_ænX?µõF¹™UöæD×7Œü¦„×åqw–)"Û©­Ã Šl¢²Më$<¼¡6H|&è¥Z^«lJž$¿Î³²JI•|22ç­FÖ„cbÊ_Þþtöë?¾ýæí›_þ~öö×âŒ=ɳäë,°ûÔ}³yúÙÖß•0R=P:65(zØ~æçò™é*Í'‹t+íõABÈ•¤Ùæ½3ÿ‰£Ø-qvŸä¡í—Ö\ÏÚo|Ÿþ@©[î).h'…­Ð‚SŽµ„I(ÃVa¡6ëõ'E^d8ña¿jf$&š¯€pÎI‡-U¶QâxQNiË"ùÙòÆÏÖÚoÖ÷h®—aMw×è…‡ˆš –aŒWŒa(‘ ÆI ½‘îp4úé| Ç;}>¼‡ÃŸ‰1o Ç» ç"#‰Oþ»w™ÏH!ˆw*½P—AìŸgáö‡VlÀc…Ëþ-l¡jëç¹]¥ó1LoazÑ—7\N¼‡’‚8tSe’[d{ê¡Z¢ƒ±^Lç³1·Éè†ÚÙDwóË—Éñö>}ø Mq•²®J´ÈÃ{.#3ŽÇëеËc[†j÷1¼ö¬°>º´ˆ/èlþDðíŠhÙY6™.Rw6_å‹U¾‹œá+¥ëóæÌÌg…Ù,ð‰é"´ÖAñi:éáU8Ä ¤“Ê+€Æ0£·¬ð PñËé*e<3>(œËÇ­§âÑ•k¾ÀäÛ'^Hn˜Ð—GW½îΪ#FÂeØÚ1²¸å¼»Ü `Ö*‚”¢ r/1Bh*¹ƒ#yPrÃèn6Š‡†—«áçâI¹ÞU(?!þa!þŠQcñ“{*,²í×·Aúu‹÷¸§ƒúª îw5¡\uÎÃT´œó ¨5*í“0ä òŠ!£…Ì &!µÀYd—ÃÖªmZ¸Gûöðà9êÝWï0üÕX¶ý±)¾w,Û>›çRº=VL×añ6b¯ÝïýÐöj),Ŷg½ZÆ´ös®Ç·ð»AªSIUç½aZJfµ1Üx¢ÆÌ*Šyøô û|Äî¡ëqžMÿOšÿ9O±†<œ.'ÿž¡#Öӎס3wPÑNƒÔ=ilj”º¹½0SÇL…Û»‡äŠ(ŒlàRZŽ¤ô„, ÜËxËxF§¨xú;E>QûDÝ·KTt³‰×ÏÒ% Q¶]¢f¹;_NòËÒ‘©¤ìêiÕP¤ˆQBœõqÞ!V{üÕœ/ól•ñTsÄØëèq@x\qý'‹µ·žWü›lç@ðýîÑQá —¡¿ëS$v†E´¶ÔÆ{”tâÌ‘ðŸpJR`¼sÎ+À"N †Í»ØT²ÂÊñp€õï]¬{ç£uo05k’UóϾ"ð>tàÉhໃÏSï)Ò‚K&°Õ@CŽ=œZl˜”Í}±\o”~ðóÛŸ¾O¾íÊqã|Fä|jÈÙHÚU.ü›rtÙI¶Hc8¾š%…ÕÇ-×e¨‚Z¡J&üu¼>‹!û1åÖe’åv¾Ê¿y€$7å(wQ531GUÑ«‹€B¥SdÝó÷*‹ÊŽ ¥âgödÞ-VíUS·Ñû]£»Û].ú»[Ž­;ëS \MÂCpÃÄ“Ãß“Æ&'þÆðhWÓE? dË£AªS8†^pga€Ké¸7Œ­µpX§ü°ùZ@ÙJ/yG}í±§ê=„™»8;œaì;½Ûg”ðú½š»­¼„û¿i*¬øc5QxªúêÖê¿Òê…šyC«Œ=ZÄÝB ZVRsÝ›}Ì-3øÆë  ‹EÃñѤN}²Næ •DkeÁá~‰õ‹äÊ×$žß“€ÚNt|Mæä.Î9´FHë™!Úˆƒšï-DŠ`  ; ÃÇ1ƒÿxøøDÃÇøÁk‘OPî+‚ïacöP ÑG÷¢ßÑß_â«&ÕÜÍìV¡îþ°®—«óÒå’_ö ø Å0Ù-š] y‚¤zoœ&ˆå¬(0Rƒ6‹u6ùÃmŽ‹?'³3­2wÁWeïÇŒÚoV™15òˆ+ÿŠ¸¨"»‹‹*ઊWŸ­]¨ål2;/aç_åkÌ©n&ÓÅÅ2Ì zSuYb•çre{aÒê˜ï‹Iþ¾ü 6 N¢×Ü+ßh4YóXî)áß–^³4öz6 Dô@ ×AãæãG¯Ò4ŸCÐ;,w1u¶p¦œi„bI4-<#î`±Ð1BÇÕîèÉ‚=£ýrg "w¦{*'Ó—;cRqgÔ#R‹ PÚyR R¢ddÓDcmɶugOó^-»{rdù²áŸ1çsG’ÏC¾ÙíÎÅÝ›]9Êü,™äÉ* ¬%rÅ_nöÖÌÉOU5?_NU +™ýðó»³o£õ¨ü°:7 Ô™óý¨÷]¾ñŸ(?ý?úúD׋pÚϲðCi¹)uOç-àvÎlQ:[ÌÓËuÆí®Þ’ÊÛÉöOè` H`#œJ!8áJ`ÊÀaMh× íYþqDÛmŸ,Úëÿ&ÄÕ*'ÓI–x`âí}¢WyÛ –#z”x¼ŠÕF „}öÝ¿#ÊV¸{³A1s®ÄÖ·Î%I³ùY·›Ý£j‡+øÇ^=”û:Á†QÆŽAi¹‹ãñqø<~’åj™'~> 2YÄß‹[ï—uÊ[G§§¬‹lëÆ«ÙT¥a›ÿèfn©b棰Éÿÿï*MO€4ø9aÏ©,÷Ö^ùaóUh£ªQ¿ÏóÅóÓÓ‹‹‹;ÿxyîf'óåùédfÝÇj?ùb2=ßêD’-ÍË£ú‰Åìü(Qi¾þ$ôþË‚wÀq¯e—ÃGåâ]=·—ñgläÕ—_<¦±Ë‹®Ÿž§sxñÙ²˜®½µ“€1BâOÈ)hþŒÛ 3 ¾€ˆRJ {â‹h8Aü‹ì­·ü[ÅUœ$_h•åóÕ̓þÔýGúïÅWßýòúÝÿýú}_yòë?ÿúÓ›×ÉÑñéé¿ðëÓÓïÞ}—üûoï~þ),¼[ªYV ±JOO¿ÿûQÒÜt¸Øoïþqú1Ò‚ñáê×ã¼ñä‰ÍmÜŠEƒ§é,{y ™Ù²|ºø®SQè²XØíá»ÇA~˜|xyôºdJÇï¢8\³¨—G¹û˜—ÿ9g.ùÏw?‹b3_!òïãþåøõšË6è¼ùþ¥Ü<§—Gç%¯ŠšÒú{ß•¼¢äÅù$âRÍ­ž'?–[+ÈQÅ/_9æ?ã ¢Uvb²ì(Oi¤òËÔeïË’(æWÉ_ˆ”3³œ,òæßÔU~Z1³ß~_¹ååÉoQŠ=-ïìö ½œUr\¶ýt£¿5¯Ü©ËIÁ?«÷W1Ê(•G-3Ÿ/ŽJp±ó*½Ãt^œCL²$|©ÈšDÔ˜g¥¼U5ýU‰4k:qNÕÒ©¸T*áÜ¥i¶Pf2;yŽŠ¿eWAöE^ö&JÐI1€° Ýäü}þ<¡lññÏG¥¬oë›ÕãÇ©óá+à„ºiùdÝ‘ éþ比°ë—¿QAUèѬõÅÂáè8‘' Lv¸],Ñ7©UËJ ?j¨i©9%» Äynq¼±A×0ƒ­¥Z|§Ñÿ™ú°œ_À£"ãʬ5›UÚø4dùF£O'¯Ö(Ü„Ûb¼¯~V“Y9þ_Õ¹«F!õÅixð:qþâËsY‹Ðß×ïBDÍŠŠ£nÑøNåªìÌÛ|¹2A?¹Z=b³ZÆD"GêQh÷î‡øɵ¤^œ®ÒJsªÞj{¾Qk¾QÇ ¿¾'å Oõ]%´¨®9Xâ#ìÖ»¿¤é.‹¢–pb˜J{Ϊ¸•–VM%²º•CÖù~“DZ“„;.ƒæ¤üW± ÏTÝ-ÕePºIB×$t¦IÂÔ$L¶IÂÖ$l®IÂÕ$vb@ëeÒ$ák¾ ‰ó&‰óšÄy“&‰IMbÒ…DÚ$±^®¶Ì´IbZ“˜v!1k’˜Õ$f]H,š$5‰Å˜\¥íT$—5Ée—^µ¶]V“èÆKš$òšÄ-Üû*‰U“Ī&±êBâC“ćšÄ‡]øYÃT亀VÏe>Ø:ˆr¢Nçæ?G¯þcÖƒ´§’È墭.(Úë€ÂìYR{°„_m´ Æ_\¡²Ò’WÌ·ÌåÕ"ä=¯Š"a†—‰vé|vn<¯ú” Ü0¤7OA6K" ü8Y&ÇA’ _ŽãŽÓ×2ý>_>¿Å|TÙä¡ñ`ωH[!4" 0íˆÈ`XnM³´=~y‹IJÔç³N3M“”ChY$.籚Õ19Õšæûòà¦x× bí?qÛXêv•CDxè‘VÒrŽ4T±åVƒ®´{›y­¢É xH½×˜¬µˆ¸03BCý•ù¹a,¥õLåùr¢W¹Ûíåh.± «±¦J@cLè†Þ²Ô­ñ™>3ót5e»µNCDÊ ûZo-ÅVz)¼EÈ €\Ìb³cëabÀõäñŒk¡lXƒbã–(l5QR’>oPǹr"È AiXÄ`m„µ0¦ê0Œ³Yë s—i´˜jËx˜7 ƒaâÇ)AŒcõÚaaž˜"”…Eι…P`Ø8ÐJxÄÝ®;¬\ge\ÀnáaUð°æPL3¦4Óê%ÕÈIÊv_“ͦ7¶äxáV:Iòa»c¨S”Bà|ËvèĄ̂ü¬ó…r‚ CF#­ËÔUT`lTŸ7 ‰g„¤™óU9 "\†µ*ˆÞïþF‹1ua›ÌSiµ R+&Rp `X[a6Ã×íÅ6½â˜1í¡ŒxBߪ*”A¬¢í·WTVqÙå¥øÀ«@Ä;£TÄQFÍ c”ó>/Åà¹d*ð@ŽP`ÿ)Çe€IJ'–»¾”â|q·a¨0ë¨T@Ž¥Æ‰0wÔ )ÌÕ‰ÛaR&À6lYid‡iŽ"$@ôÎÃhT?Ýe,ÆYh°dÆk†aÁ?Ac“ÁT„•¥ICL°–*ðDôÎ’/iýg#†³iÎ+õ´8·5 <Ðê…žBó"IÂØØñ¸VË£õ68ö^„±³¬+xJdPü,”;˜Æ‚ouÏ ¿íõzŠççó0Íd°ˆéûj´EyH£é QîÒöŸÕ$Zu¨½Œq=˜wÊÜ¡´ðƯ×ïÿüiüÒýïOüôƒâ”j£ä]#àub=*-Z+§K @h¡úÀÈæ@Ü/W߬ôCÍav ÔïþçÐÚ"¢Lû±•÷›ï†QÜäßAU/96pv™2AnËLÓSra_s>O |Bô”–Í0 ќɖÐ8Z;f€½ß‹À“Ò¼ BPPŸaPtŒx`ˆeç±óÏ“2$á±µ2Y¡üÜvŸ¡Z¬A2÷©‰>P;v"–¾ÍÕA 1êˆb¶XNJÇÂò¦gÂ<ñ-`ç+K^ÞÁ~±jn0Û%8¶V”]mZt:‚ÑÜ]2ÒÜÉŒ-WÏáü¥àë([sC í ïð5HÕAqà”4ÏKŠ¤háôˆ*²×ñвÁˌ٦Ògý}tÈsxdªÖ2Hv°íþðð y„Íã}]Ú>OŒù>”?õ9ÁåOÅ;MKJì …¼Zoºª ¨AráK¨Oðh,C‹¥Ä~1cf}`볜û"À#ÉH0)jŒ]Ä úâ { *)ÖýÆycöè~œ8n/âŽ[ñͯÔ|¬U2–s¿#UßBÛÞï6ðÇ©ô²@R²Â|ëø%–ÙAL°lI·ÿëÀï>Ѧƒä ªK´† C$%Y‰%öo¼)äW—QáGž1àE}Ãa(,¡‚ÇV&Í/uã1ª[¦ç V‚°CO "k`'âTÁǵ]‡…¶V©FjEW¦á'ß$ÝœÀúã‘A+9QWü ¦«|m’Ië°Ë¨JÍv(¹ƒyµ‰0Ä Aª+Ãî×cT¾Û?üﻸ^§‡ä¼zkZÛJ5pô Ù]×7¦ÇO½<0Ž…™sËÔ â뛈GÊùËTø—ì]\¿x@ü_æ†jü«€Ÿƒƒ„,õ:{ ìRýòbõQ·‚;Êø%|Ï4V…†7¼u°XÕÌg'³pÚæ‘™A]¬ŒJÐ Ö•Š\w­A/7ÈoÇ„\js&h%p²\ûP§˜¦Ï1ig„! ˆZlYèŽÞÿ†¯Èe¿\[g þס¬m»¢U°·1×­j ›b­ ºRø I}JÀ.b.Hÿl3‰‰šÍ!Ì@ƸjÚßgJæ/†™¡9»5Þ¢©Èvð÷ãxW*ÕFH¦¤Â 8Á4Ù¥yüI|ÔGð]k{è 늩 ¡›5Àý˶Æ%Ã[DK庶9Šô µ³¾Ê³§&ì%*$/]ˆÐÿüºžÞ½¢MsiKàTˆ˷ZlL‹U¬ß8 =¨º{bÌ÷ádÌ_OV»l«³aX<‰Ì+e6jS'¨Ï¥“U¬GòœqK.ˆìàžAÝnôŸ¬¾G®?©ÍT“5ªK°s¤QqA|âÐÜjÇÇÒûšã3•~%û-ñ ­VÖ*˜u¿ëzðËXüÄy'¬yëS†üÒV ¾„† dCŽã¢ßžñ­u€°èš}Q2ÐÐ ’<üRõÄÍ*Ç5piÑ“k­—êù ­‚8ö²÷M´£¨ä½7víµŸ3Ž¿¾ÉåÈý×\IÁq°Ÿ¸Ü2·Û>fùó^È¥ê}p—YÊN­@=ÄDÔ÷Òeñ?¶‡óUIK ;¥…G)b ,âÁkxß\ b ržùV¶É«ì3CM±²b¤{=.ñ¾­É¹Q;ÂW2«u¢i;žUõ}îø¦×Ÿm#Žê?WÉƘmfE ´f!øb‡„ŒzéÚœ˜|~c)ðÚ…3,¢ ئûFõÑûpV¾bÉÊ`kŠ 7ØU„ èƒåù²ž,Ãk%Ëcõ!X•†`PYìLÓZßà˜obùí—>×y©Ý«£Õ1&¨§Ðp³$›ð|PæyÀDÆ=¯:%‘‡¦†¨Ç978ø<·]éy¬=^@=så'çÕ¤¯1×~¯mw_­@âPã¹Ü×Åà™y€oâÏžV±Ø†…û OÖûòñ7ð||âHíôV% ¢¬*ˆ0ÌcQxLˆþKx|§;”}߈…sÁÙÉ~“%߸Pt„ç§ó»øæ* Ñ³1“‚W'‰:šv»/Å<¡£n:ÆCT»t¼t¡T»Ø7ÊzßÁôÚ%ò N)„X1½nY•ÍàÜŸ’´ÉærGã|Ê I{Ï`Õ}_^]­CòŠu±é!œýëÓëÆöwmbÞ"[ôœ¡ zꮩ‰v©du*¨u-cØL Îa*M}«OdöÓèw–{5¶,IÈSÚ5‹Ó 7ØT±ö•ìÒê`!|ÂT[5GKmiÚõÿ±.U?¾xûñDĽ.IJ’Aƒ°Q|×cƒ¦6¤¹·Uu^º$ÕTuÇÏ?„ª!Ù[*c­cBr÷Êó#×V;õÕÓHS`RPÅcß<…»í;Muo'+“=ÇêT Ï!vµŠfÝrzÞ|Ùú‘ &ž ½JD žÍ÷³ˆ õå~󞬔 ôv@2ŽA×dì"šÉÓŒÌÇåÑŸÑÛ¯Ù·K=ËR­6ë„Cxoe• ª2.åD |õ¨\’¬ƒC¬J‡ÝÊqäã[ÈÚ¾ú¯–B™àÙV§~¯‘ ^î’àünž¥ºK·!lІt\!ý×–¦'x”y¥T¡®VAìÖ² ø"-àZpMÇjõã³2¹šÀì87Tz í³Ö÷Vë6Òã‰ÏõfÉ%!¦S±-9AÉ!l:ó÷®O"Rö.ð;ZaÄ;Aß°Í@æ¥lŽr~Ïå ‘üš’1 Ù'j9Q «½AAÙÈ>q¾äüVšû¢i ;öe· âC)fÇåòv.8½½ga³Ø‚RÕâR_Òó^ï~>ˆÜ»ÅnÀ L5ÓJú¢L°±qLdþøõ˜öCh&™¼åÿN«a·ÚDJÅœ.©„ø]EžÜ"jžª»Ô±ÁGõÌo*³[‹¨M¤ÿ}›HïÙîú?ïž[Ÿ:ð}9ˆÞëÿÌ2û/ýŸkâýŸÿ%~ôþÑÿùGÿçýŸôþÑÿùß«ÿóßè÷üØÿßþÏŸ‘ý­&Ð7ø:AßÆyºôÙú}Ñ·q¾G£è=Îwhõ|ç;ô{¾óš>ßÆùm›oã<Ý»ùq¾CÃæÛ8ß¡kómœïкù6Îwèß|ç_ÒÄùÏó¸{²¿tOöouOö’äûujÛ`dy)€±Êµ[ºX‹Ø©gfŸÜxñüççQ¦Ø²¾žý–ÎÊ6¤ZWaÌÒ£î¤yóþõ¨ßJÕ|åq-ïë´V¦,£Ýgì+/)÷5'¤°NãÓ¾æåiƸ¹§ÐdyÑÀHYö,­ÕßxDo‚yxõuV!<(J´ëv-J‚¨Ï±kG̵+¯,ŒÓ$ëÃJx0‚ݹOÕ%¾Súç ó¸VøuÚžM²ìÖRk=¾šÏh$3íצzFkÞqj}'ºµ[gæáíî×Y‰ÒèÚ` ‹?El ÷±dŠ–¦tmazìº--%36Þ-j5ëƒå™…y|ëù³•ùn碕±=}Zöy×r)ðPt¹&Ió®8‚Ɇ 9–×Â݇ z ÌQ§§Ï6ÑZkèÜ…w4¬Nã´;ÒŒÙv)Ú%ǫ̈”¦Þ®»ƒ@ÂnbB&³M÷XÚs/ݯ훧F}°o®Z|ž—+EªS*6L.øÙFSi:øü”#}|ü:­)§y;9Š´¶m«‘&/yNֵ̮˜öû²^JVR[ÔàѬx^ˆ½{gLâ Žøu^]3ùܽ¤RÛ-¢ÃiÅè’wÝ¢åoyð“Á¶ö wáðš†Z¡!©˜Wɳ>åJoǤ»×üÿ±÷¤ÍmYæ³~‚lÍØ.¸GRÕ¬d¼ådRŽ]ë­dJÕ@7DÄÁ@ËÚ­ýïû^wlðÞôŠ•Ð"Ž>Þ{ýî× ×:r¡À¥˜Åx–aÅ$Š|ÄŽÌkUé" -í½C¦À”•ûIâ¾Ó$ôHì`å‘á†IH\ŸúÑ"‚ì@ h0@aeªG#+¶#,¦9Ö"a·|6Ý #2"ßÇD¸ˆÂ·“g"$ô|E ¤ÈŠ„ÁCË PcÆÜ ´Ë¥Eèâ‘5û­:ðhÕÓgÓŸFüº‹ûUŸGã¦m9¾?ÿsMÓxŠÿíâóÿÛMüO¦.4ôÎkïªS䟂OÁ§€àS@ð ‚ ªó9¶:¨'øoþ°ô+÷ð`ýz‘ŠOÓü†:–¨»!Ø‹}¬ ÓÚ¢ ²l9Ü,ü eõûtÁOŠ©eãöbð I’ظÅZK3‘]€ÍS7_;› ],H½Æº¼\LîîHþ€üªÂÁw#Vµžñ',;$UM¥RPÑ­–ó½úR½&ôÆúXô¬<1ñìŽ!צñËEcpaú¬1%׳´Ü˜,çƳç>ŠkËÅ"¶¶ ,!Z|$.qr9V–ž”UÅq¤.­Vô h°zq$m;¾?˽Ž+sü‹£fÊÄÚƒ‡¢%–y„á™>adÃ}6ÓcÌŒW™–&XßŲI”{uzëD•QÜ”]È£7ð:ÓÏ"D%¦¹ÁN â»®cù‰c%‘i[µŒ} J{±TµNUEÕ¸ªz‚oTù´´ˆFÌ` F=+ð-à ©ÃðDÙ= ŠWžl]íÓűðþ{®¯¾€\i®é)ÃrNlâŸ52µ—…póö±¾¶‡µöùª‹L`¯ÛRë Éu°æ`_~à„±g;Že»óƒÄB'v1íbKmK¼±}Âó‹­Úú‚r´…®[Ñ®ex†` Œmú¾çÌ CÜŽ~h»ŒêbSQÎÈ'ô/Jtno)¶Cc§}d_hœšÛ´»¹Ž«ßíJn Þ¶q+s×Ç#ôÜØ¡VbP‡âVl¸sè äö9KéVÈ¡}´*gæ‰Cœ~ŸýøæíÚ‹GvŽ]CÁ:ÕÒQù¼•ÔúBz&b{(ÝÄ m+ôgA#Cô ĆÕöѪ0ß RÛñÙÆëàÓˆ1…Žo&‘ŸÆí´Å ì=ßÙj¦(F¿¶$ŠÛÇ«\东î—}á».‰}0bP‹:VE&Ì —æ$!‡µ6ÛGÛ÷‘û]œ}¼B-{uSTŠµÞŽÉ¾Ð]K ='‰Ü»Ôs‚Äe‘eãŽÞ œ“0Æ<¾fL¶Ï^‡Èá¸ì øô„ìZXôMÛulÃ7ÀîñýÐÆÜgPP¡ à«ñÖí)²­£U¡Ž5ûTzúÂv-¥Çñ€jLÇŠý„Y”á¶îa„ø†ËVSzŽf5¶Ï¾áPÄ„}F_d­C‰Ïð˜ÉL“°€Yvh®kÆî‘æ¬æîÚÚo­ nBéöÐxªqJõÀµc¶/´×Âlà‘`%FÈ;…ÜaAœ€:žX†»Z^Búßìf;®Æöñ6˜w::8äöøZ “Ú Ì*Çv3pbÏp’ÀŽ|·ˆ7¢Õ`;nÇÑ:X¼t›¨Ý“‹£'ÆÖ ú¡ ¦tG-žíÓÈ¡žm›A°SßâÒooÆ…t¤5ÃíXí éµ"S˜ÜQD,Ó‹˜ÍbZ$1HhPGdE†~4:\ûìLd“q1’’©ÞŽv„öò:5qÇNjyNH<ßO\è,93¶5‚"Ôq*‡‘¹Ô0bÊÂ$ÁC$bŠ‹ÃpŸÜÄ•ÞþºNz‹(mŸ#šT¨«Ü¼k­MË!Сôb¡¦KœØ-€&nH@íûÊ×fëìÕqÈ"ÆÂìÃë æuPXnV‰’(¶ ]/2£8v@p€Ò¾b^/}ùRìXü—aù½Æ Àh¹-¿ßBJéwfèyù²‘d˜ÝÄãñn¤¬V,AlöÙdT½¦âNòi¦³»˜Nï²Yd65šÅ²üâ5Ë™{j¤Ô†éˆ=2hµ8ã»!\ÂÝ-‚Ï;Kx=FÇ·•j|ûœWp4«r–QO‡ä¯£§ž-çÖí“b@Í ‚ÝRL‡ÜÜ#§˜v‚Y/óyŸHàí–`:¤-ÁtMëe]ï“b| ·Ó¡fãˆ)fke0û¤ЈwÇTÒ^„u´TÒHV,kÛ'‘€\ œmɃªÊïaQuˆ#î°0ú«ÍÄaµ&fù‹×Ï\¬ZCcõItën°Gúó¹dw×5áÃߧÚr2} @¼ÉOìA¿^Œn°˜ K®6>E¯¶ÍeáП/Ïü}×4,éYRJäz9—»TËîÐJ6~[0¹³–Ž”_Ź&ö ÃŒ°|ƒ–׿â߬d9 ~^R*v–Q—EõüI¤YxÓÖõïéè4›”ÿœõ?)©ÉJÂêýt”’/Orv®)Û{[Ðz³²'FJŸ5¦ø®”clØŸáú³ ×öaqÂW7Žë/渱ÊqÇ×õ>E8x:îlc 0&#ÚKˆ4ýÝ•S°¯òÐ! h<~<¹!3xÖ×$5êe·œ[nŠI Ø-c“Ñ$"£¢ÎðX·šb…rΩkÏpo/¢3pãŸãÚ$£yÖ¤a}N)£)´qÅ9wÈ`×f®Èú8¼ºq[ט›-ÙßÓ¦[+ž9׊UU Ĥ\ÐÒ£`›Ç€k, Ä‹öúÈ´5{d·`¥ã:"H”eô¸f÷ngšôæûCÁ ?ÓQ’åwÜß¡ @…€yELÀ†Ñ Û=mŠÀý ­£Ø–%dš¡~ _{—Ü<Æ;WÅߟÕwH¤ûŠÍ%ÿp 2W"Þ×dzC«Cò2®WÙÚˆÝ/ÖÅÕVŽjg©¥¡=ÃgòŠÎÅæ‘iQû} m‚{“e}øp(lñQGŒ ³6‡ÐfL•¿-Á J'| —@À ÀklˆÇ7kÃ8xè|í¶Ø0‡d|X2‰Oò”¾»C…Âþ8vŠ Òl•ÈÑû‡Ì'EÁ`­Ž/Èp™¸üÊ|¼\x€ÊûlžË‚P“qPÑžI“àì>-ØóS-!ÂiÜÏñÊ¡H1sFµÏ‹r›Ñ «)0‰îH8šˆ½Âä<¿°G–ÑDÔ{˜èbwÍtùz‚%køäÜP‹ò€ÉÞÞ4'˜õ¦5ZÚŸ7­CÁéþ¶(lÈl¬Ù=z‘ý”p‚—ÓÒ²Þ,žúÙ¢}3zÊQáó£ì‹ô¦*–NµY™‚R£‘I6áœcƒ² &øúÿ&K;iÚ÷¥9  îâó5 •zì8è–Ù.xS¬Nîõà'RACYþÀ¾œº¥(žˆÒàU‡`›tsùÃdTrîÓÝ‘«ß a Á×®yÏ®•oÓQ”oq zßx¸é[j<¼S#³1íŠÅælÈCMâHa\þ+XÆ\l½Ë¨<{Žñ[fÕP6¾O]v}±Ì Ñ?ª¸o#¶iÎ6Âÿ¦Ñþmœß_q©*•ß} 2I¿ìÝÌinIÔiä£èF•§ÇhÜÔh_&œ«–‡Ò”°Í_§ùký¤ÌGÃ𻦠dü¨KµüãGí6ƒÆ“<»ÓLÓ&DÀWô©Èwq©šÙm}Žæbƒfõ®USºǃb÷ŒnÕ(ö²[… Æê|0£àkïfÔáÆêÜ9qëI¶Oòœ<ð­6d?]F» gÐðT©ÂxQÛင²ûҧ켃±YLC²Ïlx´ÊAúh^!M‹ñØ ¦r£ ¤‰ƒ"åäž`¢ȃ8­2â&# ‚½ö„c>×Þ”š<Ηw‡Ž=Y¼¨qkÏø?¼Í,Ç£®¡û,ÿ¤Ý§å@„É`PùŠ~q¸™‹sXåˆÚÞäj‘#øeªåðV¡G„ì•;qÑ;ÄH<àºÄŽ\*½6¦ùz¼¹«;gŒÐPœ3JŠgï ßyaªytjeÞ£2M8­=*ÝZZœC;›½F‡}Ï…±Þv‘ÚBЭ¦­ÉqîÎ->ï2!çLß(ôª‡Uû+ÏY1ÎFT†ÖV~)x ¥ìw²™ðêÍø2¯3^g#Ôš%ÄU+Îx Ý\9å í3çµtË?Y.˜ Ûôoæ±¼þ^ÃÙTeŸi›3²²á¿îǯÍjG«º±ùØ®Òržºì`ŽÍݲò†²„L†åMÎnSè÷a…z¸ö£\O4lÌ»-(çH¤‚ìT$¼on>!ƒ¤"d*¥\EáÒå…]<§•( ½”a·$yá~¯v(ÿÀìËZfLk´¥ˆ™jyÇ+ µU6Vù°(vŠC”Ã…áãÓ³Þ¤¤ál¾¾ò éÒDþ}H0^‰±¤Äg…Öü™=Ú›žÊ^MµhçÛ¶ìh?õð€<¨\Ü>yPƒzŒŽHA?,pFž×©º¹Êçüǘ~‹³±&|q‡è:üqê6T\†¢Þc—uÎ÷ƒ¬èçµÜ–¯Îô@™†¯½;ë5@Öå¦c*¢¼Sn΂F|c¶‘^¹9ý“}úÈ»ç‰~Åæ ê{Ÿ;´}øL—%ÛãÍbQ™²H©8¹ÊÃÓÑs wãáƒâ «™yɾ”¼ªŽ³ª†›lÆäIŽ­iUø4CãP*¾ 'e†ËýuOY²VGŠhÝ° ‡ÕXðµÆÿˆºÿ8?õçø©J~:)ShðS:¾‰†dôéš¹Çý\‹ÕDÊJ™¬ý¤ÁÒ$Ô^»§·ŸvPeh¼²d›kòq$ÕŒ­•ÏÄ86d|=Túû/Þ¾=î{—ŽÔµiˆ{)K<–Þ¹Ä`Ä`jÀä?²{1#€ÜÖøú|b³ømk¡ äMðµî~ ªwÆBµ¹è4¤ÍV2l¤a.™Ñ k!¬`\ÜÜw›§åÃM<`ñ§Ü—þŒêMè › ãÙî‚Œ÷Æ['ú6ç7kér+ìCÃú ßL"#@Ï%Vàz¾³ýîCƒÕ/´yÀ=• ®¦Dl܉X~•QüÖž ¹Éè¼ó°io—v±Îž…½ƒ”JyAŽÙg•w ù7¾Ê`P’ýsvŽ!.Çl é¹:„©£7èSnû˳B9žÆ ç  Ÿ²¬‘›ÃqUbiŸnƒ¶]_$‰*¢½1ÍÚ-Ì·dY¸è‡%Pp¸_èÉÝ‚F0“€´{Ÿ2wåÂ×ÞÓ"çUÓl¨z”K/X!wiË›5˜îÜÖm+¦TmZÅ°Ü3¾Íõ.$Ñ·gg•!Thggp¯%Éq“¤ —âÿæ·õ±áâ–~BŸÒœÅÌëËÉõú䧺\VãÏðÿL†šåk€R3í—Ž÷Ò yBc-™€D¤„®Ž;”åøåÅÅýýý9;<ܲÑy–ß^ð}ŸäÊ;¹Lïng¡y|¥WoŒG·ºF†e}FÂW¹yœ{ð§2\S»Hxø/vr}òͱp mðé\ …@´Üh’§ã࿦ïê¿ø±,ÃøÆ„•í:¦kxö7†éø†ýfltK>¤lMû&"E êÊÒçÚî釦·943Š‡»(úÉÿ€Ðfô–i¿'À «]égÃϬLc¢ŸâE4B¯tÓÐO‡$bÃ…ÏÕwê‡ÿù=´<Êh·–‹³«œÅYNù›¿À›¦ö;o÷ª1äÓC%íÊ8·NïSZà/ç4ΆY~¥ƒl‹?é§(¹‡òÒmÎ|®åúÃ[Œê ñ–ÒïÙu5PÂà>oT>LIþ)ËãAJí¹Yˆ()Ðé¼6u[×N¡îÓÚpŸ)VϦIÊò?°{øñÇ÷ÖBÑ÷Çô¬}H*øy~m÷ÿýLÐ9èŸ~x÷öJÿ7dC†0§ýÚ(¬ ¢®m¶ž¾¶ñ)›Æ²)Û{ ¸ ùñ>ÿ÷øè‘æä¿r*ÜdËß5mwFþ»¦á=Éÿ]|.¿}ýWïÿë×4ĺöë‡û敦Ÿ]\ü§ýêââõû×ÚÇ¿¿ÿù-¨Ä†ö>'#á Ë‹~Ñ5U¿·¹þþÝÅlËÄ—åŸg¥òæ9-)ªç¼Ã/wÃQqµ 3 Cñ6Lø玕`À³gì_“ôó•þJî‹þ½y•Ùr¥£+K¼ü=zø V^}xÿãYÀü¹F>ž}øÛÙ«ìn Æ`4TÛyóÃU8}G00YR‚Øú¹×Â~v¡LË!»®,˜—šÔSÎcgk×öïå…xòär˜Ž>Ië¦$!íYѨñ ϬѯóðÜ`ÃmÑ 0ѵÊ×-lðOe6ÜÉÂfGg©8^±ØñÆÔ6h—?£ŒD>çÙ½©Wv4Rf圜 •«èÓ††éumª«69ŸïõÏ$‰ùÿJn™œ%ÚÝ—ðâ¢6¸_…ïÒhè—úr—FÈ( gÝhã5¨¿b0¿Õ'e,o­šq<Éaù–ú´uô 6G‡ }qS—“¡ô‹J¬6ám5àmõø⑈9¾…·ºÀêv˜EdØlå'q­ËŒÔùœ[Ô‚ ü7ßQ€ ÷0{oqܔћÈJl;öMêâ2Ÿ$ŽE̘xf’¸$1£ÊçÊý`õûôÀŒtf;qb… Iú‰á„Ad WöÀm§¹bÝKƒyg0µ)w’½Še©×¸¯<â“»;’?è<Ü'FõÆ"ÎîòXz?V{q?Õ 5çlK±a›²¤4G8BÛGµÍ ¢¬Q<½ùì/ëhèæ誄CØ´¤>ª3³ªò—ud¦ï[ndkšššÙÞ~Õ³˜Úl 쾚Åu[VÞ›Ôm`ØAd:VôH³" ›–§«ö¢Ð ÏZ«nâ o¯vÅôf϶¹°ú}Ü:-+çMêÔtÛW%0L5ÒÏslOwÜÈpLlA{Z«NB|ÒBÄÜçZY d „o‚¡ûÄZVÈ›T¨Äû ĹŠ 0}’,ÒW4Ç6ƒõð“©P1÷Y:ØfV£âZ,+ÙMj1tTÛwÍò@®¦ãªØ1£ÈÅŽã†ú~Á¨˜Ú¬ÔI ¬}P³ee¼I}*¶æêºØ캊aÕ…ÝÀö´ÀЭ@÷÷ÌüS›»†X4x 3ÛÒ*[…›4Ý´T'2 Û0±`‘çE¶ãC; MGù±•¸˜û,êAôð … ¹â†R¶ò6Â Û pä«Fè(6ŒéLEúø¡ë;º‚p´sŸ¥cGíDxJVÚFö½ã+–¢‡XQ}ì:Ø5à]£ªfªº¥®Õ@òÁÝ·hŽ ‰ÍJzü=`}êAN I JÖÛ&mÄr,Ý5LÛw5Ï‚w˜¡g»d†(P}Ûõñ^µ1±Y“x $ìûs:YaoR±.L'°<=òÌÀ¶=S ü(ŠM%cPÏÝ*:lšúAÚŠ˜ÿÜ4nJ‘쀰¬x¥«rº2¹bV>yG§q0¹I³;Ðiø•Þ»bëub Άá¹»Ù@¤t>>pÙÛ¨Š[²çä™S üÔ¢*fZä*?2¸FÝÈȾû 9V–ø^ñ‚˜'sС{ *i3©ì‘'Ô¬érYÖ¹ƒBšŸ®7.xܘen/xbÚn²×üEÄ‘<œ:[-yí ª²îMî‚Û ¬9÷¦¹eÝéJò:î=Kh™:ÓäÆÃåÝb%F%û绑F_îæl¢dwáe›“Ý*íèOz$yÞ7¶òÍ‘û zAv­ÍÜeÉÉ—Ùxü-ã=Mi½DAÍû_r}•ñ¿ŒÚnü?YýÌiéí„€XTG¨#8<ˆj,ðü\O/®¯vMS]1z(¯y%Öð÷È6Nð¸7:þ)Ò…i‹ M XˆO¼È(ßÈØ“$†–u©è‹wdYk ô8<:|L3ñå6ù­…U<ûxº,h-̨?u#8PŸq‚ˆA{²Áš¡0†íhª’µãÛxQw±lÔæ©À8Ìñ鶗à—Uyý³l·äÌž`i½9d -Kmö­€i%YýAH¡ð}Û§¨¤ö•Ž ­¸²”|Emo¼b*Zå;{IÖÖüxåÕ«ÔË\ªf±¤9èzõŠù­—.Ç1çÊISC…勲犚¹Õ—/Ëš+kà_‡½›¤¸ }±ê]v‡{äË…]F;G ¶~IQÆ\Qiد«ÄÖ¹=±’ ‡Oݪy¤©=*ºUHL.&s)yŠÅlrÅÅaÛ­t¬;}GxßÕjƒj’îæ3D=,®¸ú<®QeAÅHÁ •lZà²`°Wö $¶´ìÏ7¿#èÖ‚…9!–K7’>•&À òuñQüzpˆ¼„ÅÞÜR¬Æ²Ý&¿lRb‘y³!+E´åÑqþ„ÃãCËJ廹ªÓÔ9”e åôœÐv¬ÞÞóBÍÞ¨æÇ”E~#®ÜÎ5âWþd§{…KLa/ö½»d{«JDK{èÖ»ca•Ç £ÂtÑf2Æ`ø.ŽPk wýIˆ)$Р߽ɜùÑ æÓOÊŒG!„ÜÆ£?Xbw: °ã0Ù“©Ë`Yký×ò.Ã_z>CrkÞ9³½Á×* Ó@é±w4¤£.Wy|°ßÃqä4ÕùPc[e~l+•äêÉN˜Òµèù­ RqÅt´-áu°û47sAKE·žmËéÜÝXyFï*“$aÐ4Ü HožaUF8ƃ0“‚$…´iX­ÜËÞ²½.R{—“@Ðjé[·<%Ý;F(c!Ûƒ¦jó Q.qÄŠ ‘ »eË—C*VÉ× GÍC]n‚r;ûcÊ”£»sl­+çÂQ~Y}­+s•–,&‚–ÅÖ¥; jŽL¨…8ò&ýñõíA×»+ Jö¶¶…Ÿµœ'‚ œØ•.E|AÍòE5:–,­Ñ†ž`’ÌyL‚b²÷žŽyó"^”œÐÄOvEªì¢}ñš€’-Ȇ†5¾[2 £$rr|r÷<ÁÛDªvàð<z IŒ…žìF4ð(e9yT<ÂÊ@žD°•ò?œÛÚ›)<ÙYòÁ¼×^w;^{t­7ï œ,uâHW3myW¸Íçþ{ƒñ*o½¢÷ roš-ì’NhØ‚©§؇j‚á¨xožåácÓ÷üyØO®ÿ¸Ôœ,\nåÅý߶ CÍôíŠjðã¹ÿïàó柧îçË&"Õ.¯Þžµ¨rX«}ÒµÚi÷ýö¡ûñ @_AÝ‘7`£\¯_«5Ï+(kjÜêÔÊè¶k‘²Tò0ÿõpœyò(‡Ä¡/üë¦?HŽ—£º®Ëž¦÷‚Y ?nðl¸÷ÿ9é}?®4xd­.™!J ³ã ™a¿&³F _uß:Ô„Y(ä·Ã«úa#¾zã É3å´šÇîì–<šáXâ ~ß)³˜eD ™¶ORí"†ÑÑ7Ôaɯß1ïBzÉ€>øƒ[n$ßûQ$¨÷+Éø®“o+ˆØ¿œ3ryIŒzÃqöÊïÞwåÖÜïNðèîèwšçš]‘{0¼ð ˆdþé ½©±(E2¢$¯Jn)¦‰âY6bK‡1"»qFø&þŽÙ,ÜT%»{{ÄlŽfïóWÿs–[–CdêH„÷iqÜ'ùIÒW” ý{6+ÿûä'ôf̨!óHˆ2@²‹“¹¬WÈ´†½f‰ÚÇaz‘?~ØÇÜ¢™ø†Ýƒ¦„ Gñï ?6Ç”¶r·ÕIÆ”Üt[MåD9r6\fN3¼³ùI>?R[;79ÉÆ#$U˯’ ³áH0×jé=úÞ÷Q|«VÒ1i™élÛ¤Ÿ9KöÖÌ&¢û½Yøìxƒò{òÑë ÿ—ÞW̹$cŠ75xpYD~Ìí4WÐùô´L!ÞZá:WÆ©7ö1i”ÅÕ¥¥“Œ9Ç•YédÂ+OéÞË‹zS›ôù”¯Õ¼¼µœ¼µ’_N ãñ ž’‘Õ×~ì{ý|)ïÙ9Ž²ü‚Bý6eNпéÍ䙌PáÙ^·|‚ŒJBÃ,Ã4]ßÇ>ìÈT\ÇÐà }Ç×tN.wGŸRXænè8fjºí(|\/Št[ó´Ð4Mø+â¤?->å~qŠÔÙL/ñ×¥ ÒZϦzkn™‡ŸcÐÁ ŸÉyú.öüüËÒ9Š ]šÍ†hçã}œN‡Ù¼KlœÌìCË9¢œfJFÞ×Öú3gÉ„1•+H2{£ðXÀLÍeîÄ•ÒlTÞ˜ÒÕœYã)(Tªå ¥­3{kß0âkÿ:Üôsp0íR´ëÚõ¼@–ÒM{ëÁZþ™Nõü‘7º[q-¢톀vCžöËÝÐnn,wúáö]ñ§,í–€vkån h·7’û;º×÷;%tyU3kŠUÓUÝŠÜíÎËÝÐîJÐ^êªRüFU‘‘V¹W ÐEUe^y°ÍO9ú@¦jRô£Ù𲓉¶?ÛÐu‚aÜ¿û†Ã‘×ÀY¦±±×ÿ~~Å$m¨å耙*f( ©R€FõRõúúºZ½®Òcö[?=· ¡ÊÑ/5U Ô(ý5ú…c-ÿ]8?ý‹ï«s,”¤_lª°¬M>ù÷eúà¦JÐÿ÷ßßÿÍŽÙï²ó™cí¸ø²ý€S¥ŽÐÞ£ûÆ=º„ߎá{†èïÇô¯;Ç¿Çé±î¿ês5P’~È©2 Çèo£ûþ=Š9¾ý”Vo9ý„Ç/?Ï1PŽ~M™šdRúë”Î>§s ßIJë`9ý„×{Ê@¦ •¤_€¿šþ"ÖZ3úÆ£5ÌÑÿÐŒ~4Ç@Iúø«Iâ/ÐñRsǨ£í‡ÑwLÛâç§ô³C~ÿ‚² ”¤_€¿šþzZSÊRúQ†V”ùÎs ”¤_€¿š,þÞ£î²ôç(I¿5Yü½GÍõéÏ2P’~þj²ø{‡ûzÌ~–œÏ«±Vóå e $ýüÕ¤ñ] û!k÷øvà ûø Ñý!Óõ=øúè~tÙ`Lõî C¯¯–¥_€åº,–#¶îFSGå™vM:n¾ÑŸPDïŽ6–¿uIüÕårÎè›TþЙÃI€—VÁôü5dÇÒhÚÖ©‡ÔEª<ýü5äñ7¿ ÔÖ@·Ó(ëèÆãQÏë'3]J•?]ÿÍTÚQyúøkHâ¯ÎœÒHÁ©Ÿ¶7X"´ßÑA$}®ð ŒG$áåˆðsI4rÒ¬ÆIiúøkÈŽ¥Aþ âï@ uâcžwq4¾õxD@‚°Éæˆ+<Þ¸ƒº„Å -K¿ ù¹ìGÑÿ† Iüí~huPçâ]÷S½ÝDðûeûâ×Öió½ý ›¨~ÕýpÑFÿýo½—éh… Yêç§ðýŒš¿]¶›‚›ÖáC€Ã†$·>^žµ€j`£]?ﶚ*û³«ÓÖùû*z{ÕEç]tÖúØêÂmÝ‹*ånñ±²ô pØÄá‹wèc³ÝøDÔ߶ÎZÝÏTÀïZÝs"Üw Ý:º¬·»­ÆÕY½.¯Ú—¨¨µÓV§qVo}lž®¡‡8lHâpëä‹š¿6Ï»¨ó¡~v–m mu®Þvº­îU·‰Þ_\œÒÞÚi¶m5š×èì‚ôßwèªÓ,kÇ™6%qø´Þ­S)áÐè(Òn®:-Úü[çÝf»}uÙm]œ¿D.>ACƒ ©Á§´Ÿ\œÓfU¾ý˜6%qZûEû3"ié´WѧM8ß&O·]' ½Óm·ÝìmÀi÷¢Ý]«ý›6%qxÖŒÑyóýYë}ó¼Ñ$”]>µ:Í— kZrC‹ ûSø½¢Í‹ôu¨ òkYú8lJâpǪT¡Ö;T?ýµEÚ§Tf§ÅÕ+í¼#­©L›òkÊbG˜ü5%ñw~]y0`êÀò¼ñ½á¤æôìÎt·—óõèà¯)‰¿³ŒñGè7/ý»u¦%JÒ/À_S8}ü–¹ÛPB~é_³ÓGüô¿'‡ÃdE£_¾Ž_SÁo‰  ›’(|OzÉáyŒûè2žßð˜r1;}4d§ÿÝÀ¸,edK\X,¶äÇÄ[ú”¤_€ÅÖî÷wÕÊ1 ckŒå  ¤¥¯S¨¶¬ØÒÉœ'I<ªœüÜ‹!ŽÐEçìúíÅéçëåD&À«ò„¤¯- •„㇢צU€5VÖ,§U° b^ÜS‚j¥döâ£oD•£G ò­•_DÏÌCƒÌÛæb983/Œ‹R‘×ï¤<ñMohúõˆçi£ñÓk’o T¼­¬¡ lÞµ ôî‚L"ÞÉÂ××Á°?IÈ÷e9&jÔ.ÓˆuÂøî6…•Üg4à·ä]FXë÷àjî—?'1Ø"ìG9VÊÛÎ+o„þW²\þ¶åõ7™UíEå¸(m»´Ò–{­@ÿÚÒú7‡WíEÄê—¸t¬SÓ-mKkéR¯uŠªb¦”è“¥¤h\)eŽÉ<ÛVQ7í0lŒ1ݳ¿RãM 'Ávˆ8iøÉ–íU²¡Ÿ=/°üÀ ÃÄ6‚Èmk›!vÕÀ³3–­–ZͦfâøÃC ¥ CÕ3ãxD#q½Î;UHª¨ÅIHʱ­@ ÓT ŒU_óôÀó W7]MuU×a’²w()1Eø¯!‰9Ô‹LT’’X,NÞbù?IÜtŠl‰ÕÀ}1ö"¨B‡ú™šØtCWG¦«‚6ñ Õc´¹’½“x݃V[Šg[êÂE5¿ðÄ5')J·È®‘¥ENdZ!t,”]4Ï Ë‘¥x¦QQ²´Áû!ʃ¢N$ÏÕTØÃ2Â.²÷$„ ]Tµ %´U[UB_sS·4E‰tÕŠT2¢#ÂV÷GØAåfóÁ /d® u‹`ÿ=î…i/Î|d°.„#6}Cu4ÛŽ|.ù¶CKæ†Ý¥]™æ®&ä¾x×:k¢ƒ*šÙ†Õ¥úeš0ÓöR®c©‚ /pýÁåj¶z†­Ø Ý7-×»X÷\ß0¢ÀÌÆb‘f¸x>®K2L‚Ò¥ ”bر ëšg–çadú¶eF Ö=¬)~5zXÖÊò¬ÏWÂõ‡oóšªf`™†jZ•§† ˆìÚ¶d=SN7¨Üâ™T¸^{TAø¸.ƒ=5ÔiÄ—g=¥Q {ýÞø®œ+†V¸þàjy¶9Ðt‚@sÁT‡ñgD¡æE–©iÌýY…^“èáýžŸ©X–*[»ÿÏÞ—vµl‹öçü z­sI`•fÑ ëÒ@î"Ãc8ݽnßÅÕPwËmÉ¡y/çüö·«J³eW•,À¤qV ØRi×®]{ª=ÐÂ;ÂK¼\€ï»,ñrñŒTñ<èõ°ZŽ0–‹gø¾‡`Ó¬G±`/9ø9õgXý™^ñ/§^pªÙ F5› í‹n<Ï'uíeUÁMèŽk‚àp5œQUJÒÞ tà J¯W¢›Sô5‹Þˆ ÊSÍJ4bƒr$Py˜Á«ôHQrÅ:åa¯ø&žÞ)´cÍ2€Õ_ü±xwKÂÏU‚åaú|IîhŽœiԇ鰣­@×_³±ãª°‘}P"$öë‘a›*®ìhÖ_„niá­ÊiËêÃô¤+¸ª<Ã×AÕ°åcOÓ£È3æúZe‚¤ÁKG-—SH5 É Ê©î‚šÕ]Äå ¡’+È“8%WpÉ•…¯Ïì༪e$K.—äIœ’+H°äJŸ/9žÄ©¹‚5W:ð$;žê¶CCwô€tBv‚ ô, …A`Výñ¤ÛrÇ=Ë)¾‚–_Yàð¨Ñ…ˆ{Ø‘¨ºyºê:šŸDªe ;püȵ+3Å̼Qc¦]¬SNÉÔ,Ù²pH­¸ŸËæV¼£ùbî† «ØôTC·\U·#?~÷Tß7ê'*]JøpŠ» fq±A9mYÅ•{ˆlCœª'hYÕ“Ö !Eù—Ø“9õJвz%+Œ!Nµ´¬Úˆt”/Oi»°"çC•’³ò??ë4 ²~¯tÛ\’ms) °ÕÇ`}^·”îî¨üeÃk q0¬:]”Æ}¤ZÛ]`0¾ö+]#w_|Ê<*ÀÚs­ù_¤e’ƒ]͵+0qpˆÔˬ=Cí¼mñìæa­Mî*á»»y`ŽÈ\,Gt.E¨s-ÌYì)ÕñÏÅ©n•3ÅÅÄ—šæ„—Ÿƒ²‹ìJ“Î|K#¯¯¿›Ÿ‹ ¨Bp‹ ïFÀ·äBòÛŲÛÁ½ô6W¯ßuÓËuÓÅñ©j>ù†\|J+æ¨!}d«a‹Ëyr5©Tïꇎ]àБ`ÇMòãoÄi²[,8MVʽ±­$I­:ù1~‚d¼ "•ê=bO-±§vÀß,Ç^Wgùv®ØZÊüý½ªZzÍ`W—B'•kmñÝ+)ZV ƒBíg×A]x7nB‚GuˆÁXLÄ5ªÔoh Ø é“4Ô itÚhüˆX ŒvŠ®•ÕDæÇè‘m¡’mIÐg¡‡ðSBÄõþX¥RK4UC*7õ¨…X¥bu G¾×Qœ»x0åìjz[ÕéÙ'××K[×»htüsbq\v9s–Ã%½m“F“Sè>=¤Jî©0Í.º7ÒEB—[!jFTüÔnÌÄP{¤MhFv)ŠÝIq#Ä$dQ‡h3)ô¶…¦õ‰M•Ø4ºèJüXJqlvˆËEæM©W\÷|ŽKM½Wà’|-ŽËGᢸ$×ß—4BF)„o-ÓÄ5Ÿz&E¯º‰Yê&]Ä?XWœ :þ.¦&6•Æ=÷D È­ì'·Ë~⟸J8²;œÞ.F$`M©_¿è¤·ÏÍe–ÕÍ„²?H'Ú¼e+iG[ù8ï[¶†NRÒ):Šã´Ö5úzšC˾ÚZÃø#_ì½NȱÑÞ‹²ÉtÀÿÿšÍV4™ Òw k×thoº¢„š§×lâ•Žðy“qÒ¾ÚSúÅëáÍUˆ¬yyvÇd|µ¡x£´ø„¶M''Ý´ç5üÊ@†Ø”È·y_mò½ß}Û/2É0èdô m“>ŸAXµeä'²MµúS¥¡5¶úEÛ4©Zúw@&*|¤¨}±è5#t¯(ßù¬²ÜÂëxß?Ñ×ë¿~:8ÿåó‘BV]ù|ñãÉñ²±=ü¤ ‡ç‡ÊÏïÏ?œÀ†Q•ó©7N(—òFƒÁÑÇ ¥ºMouºCÏO’±¹9ûu;­Ü¹¦!Ù¼ôÞŒÆÉ›–a@N¸ìnz-˜zðã§ÀàÚmà´Ã/o6Û>'=9SÆŠÿLÙÍ?A—àôÍÅùÛm‡nÿ¹A~Þ¾ØßÎ3+FÕqŽÞ¸å=,ŒáŠq·xZ¹îqÆUè ´w÷^Ù “zR ¦$˸SNq„§xL¼ÇìzÒ}ü{ÆIø I6”)‘RDw#œ\cœn($€)›%¹€<0 ¦ÃIZýæ7ï‹Ç>͸âoÌðônç·„†/ÐoÄn ïÆ fuÍ»+ðæLWd…2âlY3ŽK$#‘üi<Ù`R*Œiå÷)¾!}hIu¸hK¦ÊˆŸ˜ÔƒÙ‘=úoeÏu:Á©7Å¡ Àæ+’‰ ÇWo6Ô ú÷xö÷Þ åuÊ _¦ iÑNºì*¦5ùóÖÀ= ó/³Û·G8‚KÔß°k”É4þ ðÇ”’œ&ÈÕ(—ê…³ŸTuÇÝÉÃqè€Lº“_Ò€8H§ìG.³è,sùÏä:‡ ë_‘êä‹RLkL¯©À?ö¾Lã[´Qè-@™lŠÊkí姤iBö|5–XUnÓùî}ð†c6ÿÏÞ.âiˆ&7¶A÷,Nj},>^±1³–±ØŸÇd­…°•Çé.÷íB!äU4[à%È0Åè£@röq2»¹ñ¦w„=ä }?™ùÛ^Jb‰P” RÀ¢¾VµÑ)·Ùh3ì3ó'c¶L…ÛœK®¹Ã£^¼žì½&‘š{ß·— Ä£ZõD­jGlì UkÒá^&õ‡‚(pxFžOYÎG8ô®¦Þ UçkóÜm1î`˜ ü¢Ò5?ÔÔ–¢cy¬0™ÍD§u ü8Mã›Åp þì)Ù0ÆՆǃD&ª¤<&Ïò[7jK^'{Z¡ä‹’X@C”Àó?w]@/‡ô"Ð1Óûh PG×jçâàwl²GzùÔØÁeZ–&‡ßbÚª^)¹")Â9¦›•ô§¿&]¡¦•ë$ø'ys£å˜j€!þ§¬%’ÞHÆ$ÝŽh¦<&qS {Èp Ï$€Î¼-Û^6Jh7: éœGî† ]%¤ê²VPCày„5åÝŸ¼éÔ#ÇΠd$“x&ÙdàºzÇŽBy,áà¥ïGñR…C+b¼ˆâbá[¤mÑ?ïžãÿ;Œë3ñ³€(ke±Òh*£„â™Þ8¸&dI}xdMØN•Ž2æ²1÷)(Çi\*;MæÈ´ëEUˬŽÚî)܃½3š† ÜÍ8U×sP%h ½1ã0&{'Y3²œt“xtå]9ýѨPy¨É±p84w «Ù %*;HIÆß’Épš#1Ÿ­üHêLô4Ez 5*bÑ@Ò#!R©Œã—JŸ›]vB ?”9‡rvrÏIŸC9*FŠ'—5p?HG¨9Pqøý²J²Uœ¸ÂT®ÕûìÅ—5{czý­—(W…iõ‚«6 ${i÷51_2c¨Ë¦b–³‚ÖÈ­ï>»õŸÖkÎÿ¯=°ÿ'Õ¬Šÿ_£þËzöÿ?ÄëÙÿÿ0þF oà³ÛÿÙíÿìö·¿îðŇëãöo‡„Í‘X‘"¸ºž7ªòŽ}&䋯Ìgxêu1!ø€þM/ÎàÊwx„¸ÝÂáô24ŒÀ2LÓõ}ìãÀŽLÕu -0œÐw|M/ò,©#¼€Pænè8& [¶P@,Ëõ¢H·5–æ×PT†›Ãç³ïýbŒ Öíìà%;Š¨R)h»°¬šñC妬Pñ6óÃ]ç샗“ó—òÚ·ùiÌ*G äÜJ'‹£ô6öÞŹ¿}¬ó Ö@DÙ ;l­&àOo®YéR¯.×­ÞÉkžYŸ}:ºÄW.÷d¯ê¨¾÷EšÛ#t•ÊÂ?õà·ëè°~X¹AjMú\t‰¦$õÜ#Y´ SNË $Ó>ì)¯îe‘ä}9‹$‹¸UI •ð‰¦ ÞËBuMuä,—, WZ.~¾ÿCï©{\¯Ž xë%‰ÃUÖK fÈcl¯{â„]«špL‰«,˜@µžGY°×~+ÍŸbïwâ|ºÇí·Z±!ΚÊâyíTغÝFõ׊ñÆW`ª"ÈÉ,»VÜ¡î‚Rdö®Bå%xœ^Ç«0ÌÍ5ZϹ¡÷¸œü•”Åî*+)1(¿’,×ï^Ö²SV¢²ù«(‹Ù•4e~^úíÇ.™ïº!eÑ»’#_Éa–r•ZJ­îCïËš—àù$ñ½ÊÚ ”;é/z¹3âî…PºTgQ*µV8«(‹Ù•v(¿²î·ºŠ +›»P§«¬Ÿ@©Œ5â°Šq<Šº#‹ÕUVP ×·º»T {z]£•üXübòôÚÊýxš:T¹‡|EZv¡V! ­ý1‰¬êö÷žfÀЪ„Ø"X`ªàh@ó€ÌÖ6÷Bg]‹ÊŠˆkYÜÊ'-ðHf§æ A —´Š¯üUî,¿Ç“¥Î)D’é@ ª[³²ÖÜt fˆ ZœVÑN(ÑO•PîçTÿ1‰ÌrVLøˆC ”äiŸ6:…å<"m“Ö!åhCàtï‰ÒÂrfå#ÔÇd(0ã‰Fà˜ÿiÍ}ÆO<&¡è@(úŠ@ÀÕS&õµ{ ÛcÒ :A÷B'‹*%ä½Åm#ÍúKè~ T÷Œ)u¡@ìm¶|˜ƒALØÖÉó>}…Kž!ßì±M¿äNƒÌùÒ˜Îj»6Aeyý¬Ý,Û¡h{ëφ£0¡YñSœÎ¦cRkeãÚ›’@£É݆²Iòë£ùóò¸Å›¯h8 EAŽSö»É"w&1°@tW‡ñ,}¹&B”o†SšzK5„á˜Ôaó˜ÞâQ-ƒð£°!@{”ÞL\_ÇIíáʵG«µù‹ X ÂW¥´ÙHÖeäÁDi{_¸F;:i.pžøx|¾QÃÓ69г(ðµ§)õ-’¹ÅÌ8ÓëÓÛ˜ð­aV¦’滶”È‹áƒéí~Û$_Í’)°R©Æ%–^JÓ_þl5TãõÑpš¤¬øNoòD«=ì¶Ôå–Gôcó!B>¢:¹¯ÕV_ÙÌ4…m²ô/·µ$„žÍ=Òo&k4óÍ›{’†ZTn¨UêI®™¡¦#·n¨µ€*"æb ×ÅP#1˜O[Ì?´g‘bl‘h"_2…º6h)%žÞѺ ¬• [`ñôéÊ#~ ;€6ÌË:å=ó؆[Í­óزÒîš±XÍ2ê,vR¡SF~òèºpØá³/l ¤Ãcb¡™-÷ŒÑӴ݆K½xá0™Œ¼»¤ÇëVpëÝ1Ë,ææ.ªÙ8™s"À³v¬ð}4)»˜×§¦¸V6é:&ëXãÜÆÓß•ÛazÍ̆D!S£ª‹¾<ëaÔ=yßaw²’ð‘V%Ú«| OŒâ|Þ°r[T Ã^pMµÒ\¤â?ÿRŠKYÛ?S\Z«Ý5ê9®÷ÅæÔÔ¿gí§˜n®ýtô# ä3¬_ Ìj9'ÊütSª2 ÈZ,]$ƒ)31“JùÅ¥<,{åÁSµÂêÍvr§è°í@K(v¢ýù¬{Có‘={ÏÈÓ˜A¶‡lÔˆ:° ³Êr„Z§,°tkù1žWõ®!Á†Ý*NÄÚ¤´ÀbV“EkR–1a£¥KŠÖä0ՙɊùèÎ »Âéeˆ#o6J/§øjéNží d¯Ûï!þ‘-ÏS`÷¤‹x}îd.ÂÌ1H5ÕeîAJß N sOعUÂÌ’Œ¤H²åŒ´¶ |Lš”1 ÷]镤Oí()ª£Ì@Lé]¦ù¨2brAÆ>åOð¶Öšõ2î$§]÷àËëEÆuW‰%غ”;_ðh]ÜTú=»ŸCãä #›ËûvÁ Ì¥óìöZó9mìÁÛZËÅûŽ>Ÿ÷6!Ëjt$n‘87–ôúXÉðÿv8È(ç¶V’+/ˆ÷,Áž%X VÏ£I²³ƒøó àY=Af„·gAö˜‚L¸1µ9ŸúTdiy)–½œ·n—˜uŠOb’ ¯”†¯ó9¾NFN$÷hêd̻ۛ…Ãyû&o ¿Vâ¡K—³¼½×]y´´ó/C"Á¾œœJU1HÃ?ªÙ¶÷thDOàíY4ˆ²s) ££Æ0Â"Æž;1œ ¦Y:„½“a/]ËEd4é«S—‘TEž¿ÉãêÄ]Eèee´eEÕp<™¥*«èD§)y¤ÄD“YGÓø¦EA|3ÝUŽöH¢F©ŠÚ±<´Éh‰ èÈŸ“\dzóc°ˆ2Î]rè:Ü™¡sÛø²§”^Oº&gÌòkb”xA€',}ª|nQW¤XÍ&!=tÊæ¶ãú5H碖6U¼ˆ 7e]X’cNkIŸQcEj×¦É <A?”6©dG¹X€2†„[ðHÊǘQÚÃÔÓhÐrÚ Fç{äpÞþÒ2¾Ÿ°ŒMAoh €o’ÌF@wò£iNc´®`!×hhÕPq¥jEé c\vV`4ÍjŽE(y-ÕME õ…w¦Z¶äÎK³¾Üä°Û§`ŒÅ1aò;ý꺨²Ì¾Ú€B†d_4¾Ø{JØ{ñ ¹c"„”ðÿ¿f#E³€×T¾kX»¦Cà HÌt€¼ÃõušNvƒÛÛÛ0þóî wâéÕ€„sÿ™mû¯‡7W ”d¼ÙÈ¯HÑì´ø„ôê£,í8;üÊ@†Ø”È·•ä'yÈÞ‹ïž_‘YoPüèºX¼%´>ŸAJZ†A~"ÛT«?);B¦ñ1hÈT-ý;Ø1ªm~§¨}±è5#,@Q¾ó½$ráu¼ïŸèëõß?œÿòùH!«®|¾øñäø@ÙØ ~ÒƒÃóCåç÷çN€w¨ÊùÔ3=Í G7”*ǺÕ)³:?üIÆBäæì×í´rçN˜†„Ñþy3'oZ†A®ë²»éµÀãáh·À*áÚmüÇløåÍÆA–O ÑoäüýÍ1.ØÍ?c+Á雋ó·Ûå„sƒü¼}±¿}–Š—A©¬Œs|ôÆ-ïaÍ7¯£gÅó³ë£e –ÞSPOsV¿[Æï =)„)¨²ôÚ¯Aæþž Ðn“ I6@ë2›Þprqº¡2›!¹€<, ¦ÃIZýæ7ï‹Ç>Í„ÃoÌðônç7Ú/”}#vcx7ÎTé¤ywÞ\ö¬Py”-i&xˆ)J¼ ¬­ÍaLKWLñMü3³ .Ú"ñC"…ã„é!Ù£ÿÆ$w1Á)Xoí¹Ê, <"½кÞl¨ôï ˆÀìo°%^§ b)t¤K+1ÎvÓšüùÃ3¨ÂüËìöíŽàuÇÄ7ì¥d2ü1£)§rE&úI÷…Ú…4ÅgcOÝqwT@6|ÍdÚŒ’;2K~䢻fÛ3õ†˜³¬ iE¹!_”Ú `°F½ôš ücïË4¾E¹ÊA(37g£Ê§£a’–œÑp¯Ðjªê ïÞ°ÏÙü?{W8›%« 7¶AðÇržj},>ÄE‘Y×Æ8ôRs–[~KFËg̦°}Órtb½Õ¡#½}¨×ƒÙ(3^³U­ã[«á[“Dx;$lŽ'p—®®F±ï꣼cŸ‰Ì¨:Ÿm`¬×Å„àú7½˜ÜSA*|GªÎ´»ïÂáôÒ×"]lžgbÛ‹ ÍCg¡(2½ù¸Ìf(Ì¡›·€Ý”|#{b^Á7_•Ü¡0»¹ñ¦wÔÊ ú¾Þˆ¹ÒƒÙÛk®mmpÊ^Ðì³e‚‚ŒWb¸˜³9ÜØÉê'—›`.¨cï]œ{@ØÇ ÙBÌaÄ[`ì0dNJnZø ×­»µX&ÒPd9ðfûžî˜–ºz y¦ÙÞZ4”ËÔìï ­§Z̵¸^Þ¯sŬ´âoÚõšåóûÉ®ÀJÍç\Ží;š§¹Q`٦„ÈŠlG_­Åjó¡­¯Âã,¶@;9I¬¯²Â­š¦âP7 ûÈ1tÛpŒ/0]}=º›+̇¶ŽzÐ ÙßÓ¢¾"jÂ:Œì2®B2šç9£™<*Ò±oX }[Å2BÓìÆî…÷B„üù·%2:䯤,vWYI•TÃ"!QVˆ|ìªAàêØC>ˆ’¿N›Ÿmïü±·?e1½ÊªúŽå¡©ê ?0tÓtmßUU 0ha·Uí¹Ch±¨|`ë˜güº,«,ªWj¨Žü(Ò"ÃtÀ&³á9&ö­ÐtƒHÕ ìuÓ¼ŸÛåÏ¿A)=ûUàǽÛ%q‚±3R} ¬GÓÀH±§ùZ¨…jäëš»u ~Bß’¤+OrñV!Ç5}09 U äkš¯ÛŽjé!Ø6´nMâïK`ð­c^ ¯t_«ŠîßÐø”#»š«PŽeû:íM¦a_wudû†ùvmÝC®úÍË$þüëŒâø÷Ùä^©‘Y¤, òâô˜O/²k¸ ½¸†í!àfŽª–äžëxQ¨ØÕ"Ëó»yž½ðçÏ/ý"jHÊ⺷¾åšó ¸/Ö “µæWºÄœU½QÒ•BéqÕš¦Åö¶}㿳۟\‚l*V ÃF™¸19…Ú¦ÊwG<*:H[»[<½¤õyØGqTÞ–´7ÀS6É•Y÷߲рá8ÁSrÞžBž^ Ú&qÊö¡málÍ®´õƤÍ&µo®´5…]`È2ýÖn°ü±û1yhsØr–Tk.!k,JOÝa[LÍÓGsÖÂg×ÜÞ»»EÐIJ³ïùšÁ»»Å9½Ü@æÜ@yØŸÜ8hnœ"@n cn 2þSn¤¦csw—’©i±ÂHÄŠ{di‹é›Ï97}k=Pä¬V°0+VkÇf¼a›keµÞWGÞ¿Œ“±‡½­¶£^Ò ¾æ/#Õ‡â)óbFt$&R7PÒùm}[œq¤%¼­…p\v µFLÖÈûÈåLV¤GÔ<5mµÂ_;Ž¡™µƒ&~©žù*±†S”³Í«ÄŠ¶w²æp£«yÉÙ»?%]{ŠÄÞ|ãç]m›kÞ„‰<¯_Z *ø}ߎ«l~“¸ö€ûg{ŽmH¶²¶²¤¤[q¸š¼l´äëÖgé| 4=(dÂÛƒó`mžä ô¼éÔ»Kæ«aõVVká@-,%Óiáz‰t´°p[VVQb¬ù5Ë7qÇS ?BÀãÍ!Þ22û)ÄLÚ#¤ðpóÈ·ôF«SѱļÌÅIqÇ™ƒÉ4²qF1È*a€Lm¾.a†ûñl4’hžÚÕŒÚ'£Y_ÎÆÓXjÀæu5÷#Oñˆ:íųæÉÕÊ»ó‚¢L ŒHŒ6_o0O«,zý 5oeš¨.äçÆZZàon¦z~>šU]mŽ'] ÿ¯£' Ô2X+ûzø|,¼V¾ÇÄG=ÁI,Þšõ›²GÃ¥Úá0™€Ž“,u„Hb׈§Üzw¬`p ü3Ì{Ì@Õ˜?‡d.;ÊqšiÔyKì0Ï>`ÅU”MVc…Œ zócÜÆÓßYïQêÁ•»6ËäqNÑÙQJq’Îœ-â=uú9Rë ±4ìšQ|öœ4y› ¬¬Œ SÊƱ¾Eýh´j71Bê$Ÿ¨=ð¶N¤{tü¨MÇPcï‘ó.ÝÜôÅ Um:†-¤°}ãîóþô]ÿk‘‘Ä’'eA§ûôÉŠöŒ€¸á -'üTvzÊÕð +€…²3C~uDµç n‘'Ú S%Œq2þ”56Hf ª9K—-Ô˜KÑ€!ÁÞ4(g_^x“”v*#Xœ‹­¾e3ÈJ!ˆÊ{ {h âÈ`™â?f8!Ç^•eÎϬzô(’œx[ üDNutµ!Üi£Àñù¡´¼A`>TÒké¼¥"ö`½p¨¹YÚy‡ÈátŠ¯f#o*Øó©äó©dϧ’BÍHùU ¿qÍ{üMæï?±ã³ñö¯ï©|±aÆ™¿†t÷ øÚË„6Çw¨¿ 9ù¤³´ªJK‘yQ ú:åg¢áÓæÔ·›¡Pä¼°ÄEèa"sF¸Ö Q5Ík±8¿½B±=k¤>¼õ©Q¬kWi÷¹«ôó«ë‹¬L½ÿ³UÝ ½7~nþüÜü™hÏÍŸŸ›?/kþFº‚éú>öq`G¦ê:†Nè;¾¦ê;ͯ( ”y„:Ž„-*/×ÓØÖ<-4M’–= ÍNÇ.¹ºæ¹¦§ëŽœÀw±®Y®¸f6|™i]<%ÇñJ-¬ùͧK)Õ½ÛôëZ§i+›SÙb:¬öÜhi2]5šzW7l£U>%¶`¥_ôˆª‘ÌÃ8jåºq¼±G(et›û/J:]2¨ÆT« J7BõÒ,€acoðêÛ«¾^½*vžì:v½ŽV¸)cxõJiçÉПzÓ»—Ñ!ä`78°â°?8ÞMìæŠx/yàªSö„y‹½µÆ˜·9°Û+aþ-õ¢}ÁÓ„úU{€´æk/xw8°;kŒw—»+»Ô‘ºü‰HÁ–Ü#9ò!‘G¾êó%?G”!M~¥4hÏ*µ?ÁÐ`yŸ uENâÑÝ5§ÞD~<¢©™©7ú~^a’ÀJ U~Ž8CBâìñÏiHH¤Q¾´uyy¹µu¹Eß«ÿ·šŸ_V?›ãPrðsÄkþýïƒúÿ¹Ï‹¿Èû×­Æ$áç6$$Ø^uŸüûuø9 7€ÿë¿ÿýï¯ÿfïÕÿmŸWÞ—0‹_W€Ÿ#à€#ð+_•ÏðÛø¢ÐßßпØgÙÿ7ùûòõW}m$áç9$"äü§Ê×ÑW%ÎàÄð”ÃêµÃOæøë÷ ÈÁ¯qD¦&$2)üûÎQg ÿg9¬ãvøÉ\¿Ò THH~ŽüÕÄä¯Â¨e\Ÿ°90XÃüðO)áW„Ÿ#5Aù p¼§ÐÜ1è(ý0øÞPºR²Ï øÙŽ!¿ÿªT' ?Gþjbò—Às\@–ïT`U*ÿ›ïµ HÂÏ‘¿š¨üýªœÏÁ) m’ðsä¯&*¿*GÝá¯N@~ŽüÕDåïWxûúŠ¾Wÿ¿jù¼öÙ€Qͯ¯ò HÂÏ‘¿š°üU>)_'ŒîÇðÿ þÊ×ø«2Q¾n3^?„ÿ¾òuúUñè;ìõAÎv˜ “‡Ÿ#5Qùû÷ïu÷0ÙÏú_‹~Êܳä¯RöeŸJâ‚#Ë5QYÞÛK~#ËuAY~Oîh³jeóà%hª£\Œ‡ÔÑÞ)Ÿ½é0Ù>›…`ÛR ïøãéñ~/ðsd¹.*Ë ÿY® ÊòM}>%XùñìP <&Í2î~Ž,×eù)IÙÙ¡?cAZ@#d2ñÂHú‘?{¬úøM²•±šÒŸñ,í?G–낲ü&‡Ñ0 Ç[¬÷žÞ Sr0ZDù±Š^$Š.â[RÕ‚tø²†QÝàçÈr]P–ˆopº»2ùËÂϑ庰-Ý×K~Ž,×e9Úilš+‘Ñ~@ú3ßÌš×ïežO¢‚‚ïŽãvý–,üY®‹Êr…¼å5˜+tM6nèaž0Äð†Äº®ŠŽüÕå¯6Às…ßäø‡ÍÎܺà78ò×µ¥•‚º¬CF+?Gþâò·~” Ѐ·Ó…Ê—âéÐUº±SæOO€+‹¶#?Gþ‚òWÏZÁÃÀyT´7±4¥íæIø©ßHÒ˜ÓÄSÒÄjJæs§¤$ !«4‘†Ÿ# Q[ð(þF#¢$ŽÒ[/+ãA$l2Ás¤‚!¼S"àÆLÔ% [Iø9ò×÷e? ÿ78ò×”¿çïÏ”³OoÏÚ?=Rà÷ϧŸþy|xt¨üø |y¤ì_œ¿ÿtªüïÿîŸÁ×ÔZa&ËþÇCøÿ‹rôóçÓ£³3.ê2Ž6åðñ‡Ï'Ç5LãtÿãùñÑÙ(û'‡Çßm)?^œ+?+'ÇŽÏá²óO[tvó·ÉÂϑÆ þôVùptzð€ØÿñøäøüŠà·Çç rßv÷•Ïû§çÇ'û§Êç‹ÓÏŸÎ`y`ÕÏNö?vàC9lÊáã€_åèŸGÏ•³÷û''Uâùñ¿ÿãÉ›ÍáñéÑÁ9Y¢ü·®û€#‡ A9 ´TÈ?ÙRÎ>“_Ž~>úØ?ýe‹P÷Á§gGÿç.‚/•Ãýûï€\6T& ¿É‘æ n7lニӣd=€¶Î.~<;?>¿8?RÞ}útHwëÙÑé?ŽÎ~PN>‘ýûV¹8;’ÕãLŽ6åðáþù>Å2D@º¹8;¦äüñüèôôâóùñ§/•÷Ÿ~BƒÙ€é>ùô‘’•<ý˜9l Êa öO§¿$J§xKùéý|~J6Ïùé>!ô³óÓãƒóêe0ÓóO§çèßäÈaSP—d¬|½Ôë?Gþš‚ò·ì»£ü”©—þ]·„$üùk Êß’~G?² ÈßGéìãìãÿœmO’Y¸Mÿ~•þ@ßÓ,8RØ”Â'ñl˜lŒñHùÏ‚kœÒY”ïLØÇÿ9ƒ]–O¤§YXYl‰ÛÄ=½$áçÈbëáã»ràc«!ŒÅåHHKï2(GlYKÄÖ„:sœ$ñtcïûa4q¤|:;¹<>==zGÔûË÷rxã!k‰ªC“?v ¼¤& ½À©c-‘:í‹=–#,¬%¢‰…,Aƒò§$ ‡ñÎ5áErðp˜¿µ„ù/ƒ§ÌÜ ÜZ–¸[& n¼`'$KÂÛ“‡Ãò­%,¿ì–S=«×x›Ãéí%œ¾#â ðen~Gð9ŒÞî’(bs˜¯½ÄšÃI”q‰póò2˜Œf ùÿRn’¾m/±løLíw|wOC–¦4g—ÔS_†p+÷÷?f1hTì‡ÜT8Ò®K Eù‚ãrø¾-Ì÷¿'¾áa$7+·ï‡‰Û&nÛ]ˆŸÃ‰m N\‘§Ç¥ŒÌ•:F@EÞKzâð^[˜÷JÊûóýw™v¾O¼l„ý±ßæ&ž]p•_ 5W‡ÃªaV½â\?}VªsÜËd9ŒÝY¢Á¯°¥ëwºèÝî²¹”‚’ÞY”e‚žë"–:ºhÊgÖ{‘ ³P ƒ× Ó0‚,×å Êm¦S¶[Yƒr’”º…CVŸ3«!K{q’ŸI¾Ü‘ZMw™àä"þ{9žFŽoj¶j…0‹ÈPMË$ÕÆlÓó\6O}nisͧ¨BZˆXÞêˆ@0ö/I²î4¦)Ì™@=Ë„±zìÐvmË‚ÀÔt¬‘´Œ ´ ÃtÝ ‰?Š Ç¸Gôð!ôà?‡i7âèY¦S ÇÇgDºëbßEHuBizèûº«§ÛCÙ=¯DćDÕº4ž&–ѳLé@ª®ƒuë€iÞ55°KÀ"ìxC%…R¦ÀÏ+! ñÁè„Úâoô¾„†kèše¨:v¬È0\Ó0-Ðu-ÕÄ=Y ÁŽèÁ R±¤¶»ѳ\zÀ÷²Ò¾ˆƒ¡ÇÂý AR´w, ÖI‰´4ñ^„G"ÏôC¡jAd˜:vl]#±¿d²÷)Bø (Ëùåk)ˆžEˆe`;25‚vk:Qä»F!H>ä…COg"Dã|A%I1 ¢gE¢¦eY6캪ÃæúéèZèžeÔÓ]„á‡D9ÂÔ³ÜÖ„ïk³ú—˜¾–¦°/ÆzVÛä{O5\¹ö=û†gÀTUØ;*Š S’'°¹‚9Á:S­~•>Õv…¿–Í6 L-CêÒ,}¤bÇôì ²5Çñô~ó)¦JèɇRѼ<{\¤.Û S«£}"ƒöåv0jV*”#|›åÄ]î¥DB9ýƒWÿèñÌMJÒsrú‘DNû«(±÷-/‹÷pæ‰89ýH0§¿Ï—Ô™'â$õ£eIý5 ÷%†9g¨¼v²oÛ* ÌY¡ác ;šؤ®¡ëÏ÷QÊ îo¾=>9R^m)¾%$ˆ_Šn±å_´¬l@O²ln¤šŽ£†®ª‘ M7Qèz^€PC< O£*,«8°Ø’šºîNh¶å–$¡‡2­@HuG›S/û lvôrï6j–)”S;5kˆ ÊSB ýƒ^™ïá$ô#á„þ¥¯Sì…´‘òr¾ßùsú‘`BŸ/9æÏÉèGŒþƆÙ¾0(?0pèš‘‹‘k«¦©Û¡ Ø»¶éÌmß¼¹Ç¦¨CEt[s²ÿQ3û_lPŽôl¦ä‹ Ê8Byò¨Óqòä‘pžüüëëœuó…Í<qùÇÂ-. ?Gæ¶÷ù’ÛÖœävÔHnï°­]Ç°­Ðw40Õ‘ŽBS J\ é`ƒifs[—­6E÷+'Ã-ËpïIí ,×R¤»”˜¤‡5Ç‹|ÇU]PKƒ 9˼£TW̓“šIñbƒr„T3S]lPŽàJDÅIG¢éãK^ŸÙaxUóH–\. ?Gî¦÷ù’dQ×ÈïÀ¢L/Ä–é¹¾F¾æت‹M]‹ã†Ahjsó ê:ï^ŽØ[–R¾ÈW,É°P¤vä«®©¶ƒ<+PUË·|=ðË÷ý朋^zÍ9w¶9y騑—ÞEôXºá‡Fåšé†‘m覅ÌÐÖ\0†›sô°zV??S!EóÕ+1§‚èp¢øääÉ#ceQn!"€†®(òl_7\ꚧZn¤c­ ŸùáþSC&G¥h$íw@f`# NÕ-G˜x± '257D®áé·!³~Ž#ƒÒS‚FGiVXìäW«NþFëe|†Ø´Õ(ô4]×=ë²m/PMǵ,WçÌÇJó6 U“SL5‹ ˆ ÊQ‘šþbƒrô–ei÷÷$8éóhYú|kÀ ¢üKðÉbYâûʱLj“¶Ž–¥­w”Dœls´,Û¼1i:çâ”n~¾ ×F)•½.KÓ ë'J/ÉV¿ˆ*«A°BÑÓ)B­Æ6vw+k àú³B YƒÑⶋ"€Ç¯ô\Ü}=ð)›«r¶ÖNÀ•.»yì}{0ÃßÏÆÅÞê>»Å¨kŠÒ–6‰D'þ¼î¸5ç:XOH‰Û`WÓUqä"õ2ëÝÃ%¼V1·%"“™o_ì¸Õ¶š×»Ž+>ËK‘æTKq’$G¾!"NŽšå;¹å&¾Ô#m$1´J›†¥K`Ú]Ï"ó«‘õ%¹¢|_˜øŠvõ«-^PâãSæoš3å{\?˜ºÕõÓu‰ýXà•ïIÇkw¯lWÎ]vˆï¯$¤¢†WdvÀ+߬Çë*&rWÌæcÌó¤LNn‘ÞÏù_}.€IrLª `’¤éàûßÄ ³/¯+öé÷Ê=HªUÊÔÉ|ûXÉ+ÙÚD—–¿²`^yˆmüöž´¹[É|Ö¯˜0ûÁvé —"«ê­k+ɦ¼NíÛʦT8%ÆÉGŽ,{_½ÿ¾ `†œá¡™¡([I‰U6©9è}ÆŠnfyݼIÚsp»‡$í°VB’æ´Ðݾ̋Iýñ½Å&!•º›,Òž{ѱ}·Gw:¶ÃZ¡cc#Év2–ZõER{~1]‰ñèdlßSÐ#Bn…µ!7·+´ÆÉõÇ÷(‘xU"ûxÍ o¶už¶‡7{ï9ßûøKHëžBP ákŸÊ•ú2&uåJ}Ý’Þ,hÏßî΂rÁ·S½Lao¼“¼X ÷)Õ(]‘jÔcž"cÁªüJ½ôJO¾µgëvçÛΙ¿½"ÁðÖö\á=8MS}¦iJ]ß]“oØ>±W»…VìV'ua·Ú·Sw·[í°ÖíVmõ·Õh-žÝ# W,–èa°4lßÚ†í°VhXí6mõž’øä­ýª^LûèÅJeµçwWY»ç£·QouR<¼ø1("+š ‘]f°Ú7'ô˜iÙq£C/{p—9Ø+}óG),JöúíÕºývXëê³cœÍ¤ùü•èJ *v‰CÛ÷w§d;¬uJö é“•ö¨TóU¥ºËŠc{V‰ëûåtÝ'~*Á|†iÖteý‡lŠdã_%n&/}4×.ûþûÛ_>W ›L`&Sÿ;ܺšU]Ž·'À cfv>_¹q~6÷óúçßÙ±Êè8ù þýÇÍ(ÉX’éH>Íé)á¡Ø⨲ú˜,r‚"öWE1==9¹½½=6“/íøx2»<ŽýPº°gÃëË•N$ó™~9¨Þ˜Ž/‰‹+ÐûƒD„Žù1…Ÿ±Ëp)¢äïzgÄûFξx¸oÀLthèD†p-öÚFê—fóÜ#FÒúwV 3öÊ!9")Å_xëƒØIº×^lùÜx™K’/T¬ó¼õ¹¶ûÒ^Îäô*x%2}íuÝ|pðσ$±æÒ&¿9¥1ç{;zo PêƒCq>ü?¸áÿáŒóhãs‹;‹‡ÿúÀŸ{dºAž_É©}9³z23áÍŸáM”üà¾\éôá•õg:½L³ÃÛ¡)®àW~¨'£Éìå@¤~78LÜp4*/]ÎìGFàÚ¼ø8‚ý-k‰ïBã­EËYrt^uÁ ýý´|ØÈÙ»ÉL_ ^Ã#¶`äü Z8,»ŸÄ~'‡›(Qk´nLmèìí87k¸þúæÇ—ƒó?+£rh÷_©qž>鳦ÿ b°Ï6îÖÿ"ÑUýORö¤ÿ?ÉçìË×ÿùêíÿüòM⹞üòë¿ÿøëdptròßøÕÉÉë·¯“¿ÿö§ÁYI“·39ž7QŽNN¾ùyÔ]¤[¼£·oN>xXÈ¿\þ<*jo›ÂxÇ)4øáz4ž¿Ü !âÛáY+ |]Û|3xöÈþãføþåàUt!ÞúlñÊ¡ÏÖ~(âË_{ïwn‹—¿¾ýöˆ×k Èß~ýÛÑ«ÉõTC5ªÃùá›—bùNÔЗѳœÌjϽŽž]ôè ŰÙóÊ·< ÞûttSL.nÆà³ÊâÉëìÌŽýJt|åàl4¿+ÐBªù±žƒ‰˜yýt7X[ Ÿ_"êðmÎõl8-êwþïe¼Z:¥üãÆÎ>ÿ1I®áN·ÍÇñÜÆ`«o×ú[ù¼ºœ?¸äléðúèćkÅd:ˆA‚™„£øföÚÜ胇 ´)’¡÷þ'þ€>pÝ˦¿ŒÃŽ§©œYé…¨9²‰¶£Ñ|*5XÑ—ƒtþž‚ë]þ}~œ±7ðcVÙËhmOB§¾öÁMSÝ,_?Y¤ÇÄ^Çg’EG¦³É@¿IVb៨§;×¼¹V>žIÅqµO&ŒÁ•ÿQßÅ“b¿ª!`Y…_1¬²c“x:7‚*c%Bž©õ,ßÏ&·h°ˆA2#ŠÉDVË«þËòÜ —as=l øžÿ$‡ãˆÿ/òÒ.²®} /n‚&`ž7ý¼¸¼È"GüWŸ#¾ rÇ až ˜¯e!cçux„žÕJï¾õW6¾zvr3ŠÌ¬¸Ú¤wÖ wÖ“àûÅ+´¸‚ÙXñÏ<¯;Q«Ú_ºî·C;2ˆW›Xí±T%¥¢üD./Ïo®¯åì£WU—¾šÞ¨#YøJAÄ}W’ª¾jZ“W èAÛ Vf âµú߃݀M½ŠN5w­œMÏÏü6¤ó¯6¨`Gõ J¤1«68¯÷ª~¨B€xv2m¶ v`AÉWð†T“Y,``†BÉë0§²Ší醩9€T"±B1mÇq*ÇϬãæ%hœIö õ ¹oæöZNa¾¹²½²Á íÿ»€ÛåÜK³¯!æõ³He·à¹Òºß ÊÌ;ŸðŒƒoøŠX¬lw± _Á÷ùm!k¡#ñzÉø‡çÃï ±¯€•Ý- Yzm½¥0VæÁÈÍê2 V  – ºèa½øŒ¥«¬zær6¹™V ]ì×i ß“ƒÆ(¸Ê΃õ‰¶§Ö"t‚ÌëS™[-‰áÖPNç™ÃVñ\Xɨ¹²O‹·~€·~ãé™5¼„^†Ã™ÉûòÏàÄyÌjË™o Æ›ækjR“ëÁù¶¡PÆ:_uè¯_ˆêg âÆÎu_Äý;íó-Xù"Nçÿ›&…?³wÌuµPO/^Î×vAå§ÉÌlÔìd Js ®‚o¢?7ÿ«zuл:Ž[%‡eÜI„Œ•$Ç8#FÉ–Vúrƒ²,•<ÍmîN9æØ!¤)#L1©±ÞInn f½ûá6.D~Ú{í¤‚t¡~è#B¥Ã{Ò™ö6{ËL_>ÞGfŒdJjÍ5B(¬×)×Æç+é±ÝtMUCönÖ¯;„±zìƒHY;žcˆÉ;ÈX?‚õ‘1ßäŸÁ¬Vº*ˆÛ¿×ÞÞ×W: Ü"¯¼*c 9'-x‘Õ1¦Ùâ½þymãl ø®ÁýjF@;5šèwlzþöÊ®¹ßÅòVø$š'`’F@R\É"ùÅ_In¥_•…å­ø0c¹NœÀÃ~÷öVA'뉜Î9‚>q~m¢ëÛ›‚”ãšÄ0i ý‚Ú¼žè›ëê@˜’|‹fåX_y^†ÊÇ;Ãuâ—Êd°vu:›“e\¾ê²Ç‰ ƒEœ0‹³¬—Ó¹ølÝ­X§•¡³B˜“%Ø•‰¡•Þš‰.#ɦ¶ßç}.fÌ¿Üç}§Ás˜¿Ú qóþǵA7N=÷MöÆÐ`qSn`(ÝÌ/Öõ‡•r¶VÌ(î ,£›€-÷Pöƒ†6Ò¬L,¡ù#–{ô/ÛÄÒ¸;ÿy]jêÓ+Ûô@‡€çóé¿Ø b„zßáW˜¹/3œŠ‰åOÊà“)ƒl£2ÍŸË'S,"âϧXü,ɽf0î«Vؗ“£E¤OzåÉÉøSè‚ççÓ÷™ÅØäœÄ †ûj‘;f ö¥C ”%#žtÈ“?ñˆtÈÕì$Lí˜údFXk )1åx½•óär‘Óáf“ë0Ïã ‰Ém(ç }zæ×ÍËUøE;®ÂÇøG”Ñ/ž2ú{~ùŸ—£‰ßìâr¿) wç"Fq¶’ÿI3DŸò??Åç)ÿóÓä~‡ÖS–çS–çS–çfyî7ûq{ÎèãÉòÜÜ“ˆ£?êzìJG u¡ÁvÀï€a¿ÞýÍÇžíBQy8>í´I³*µ¯êPÞÆSfw#RÞ î)u¢|á…¬º%û ¥ê TBõ¡ë tB÷aê LÂôaë l¢“ZˆI„«@¸{ ©Ò·.A^V /ûôjX1¬@ û€ÕA,ķ׺®ƒ¸®@\÷1®ƒW Æ}@Lë ¦ˆi³:ˆYbÖDcØÍ+ýtIDQ¸C{¯ƒ¸©ƒ¸©@Üôñ¾â}âýòïk ë[’W¾·3ë½=™x-ççߤOD¨óaò^ΆÞퟱ¸?ü°àBÍãLyÄ÷<¹W~æï]Èa  ÞFú_eG“ñ%ܨrÒ!¸Àµ™úírâGÉerž,<\ÍŸøiœ µ/ÈðìùÁéÖ™ ,ª‚o4Ï2®¹R92θTbd*9’XHº®yÊlŸ®ÊÓ ¤å† &%‘ !“s ©˜Ä2Ífd ò*Î)ÇÙ› ÊiÅ;pX4¨„M91Ê¥Þ(먡™ÐÏR§sž¯6¸‡Y4EQ,w¹H%áÎåÔ2‡)É92t•,[pA).¦]p FSh#Ê. «þyN‘’2—‰6¹ñ3]OÊ4A(·,ÂäDpÊ”|A¤Î»agE;!˜­¤;œ£3šò\âL • ávaׂ1­re9‘Vsd©2–c.‘ë†B9åÜ…f ’bKtk& f™ϸ éƒdŒZ_óF:)SG™Î0çZ©TæJâ´ßãLwRIeã@ò#t‚­à–¢T!nÕ(+±µH+,R,e& #Š1G…æFûó麠p%翾ù¡ _¤Òa¹L()Ë©Š§HJ´De#Dr–ÂP­!5ãäHiHtÄbØ}@p«Îh¦±ee(w ZF0”3G¨@; —Ü€ú]ì2Ó,Í hvùÊlšúòê]Äh2yws7K-b%÷ƒ ÂZ!‰IõL*eTcT÷˜j¦±á@‹i*´Ý8 ø¹nŒ¨–X: ŒAïrÎ@IíqÅ©Ä9·¸î€Dww!'dº!FÂÂX¦¹Â*Ë2“Äftb*Ò9Ù M(IU¦a0.`°e0ˆÓnÁ:1Ñ ‰NæO¸ÅN;•æ üi…α?9Ç2Au®:6Â:ñœƒÊFàP Xy½EtæE7Œ€IÚ…\tψ¯¿úƒ ÆúI`¹uxm@ßÃÅ$dWƒ+¯'ÓÑPuÓ( Ø­r›â4w Ü.Ž4ë„RDM–¯ñ«ƒFQ&ÏTn2É3}uZƒº× £8ÃÝ4J\Nì$Å^òTZb,¸ŽàŽàÔeÔ¥.œÁ± [˜EÄY &€N·xM2j¦Vwc‹GᢳG 2kˆmî øW†ÐÈú/9àYÒ8‘cç+s‹,! `«°»Ž©?2µ'ü”v7^påËÁãLpL¢Je9VNéË›²”íbdSP*¾ª´BYžCP@iÃŤà|¤,Ã]yᑸðe›º±#à…™?HŠˆ+®(V[%xÎùì J a!fbJƒÉÒÀZˆ$Sˆz:u4µó+;êè{b†2Þb–RÐq$šCˆrnäàsÂ@°`d•Èè.Á„…-ËÁfÍ%ß‚C­+¸Øjä°0•Õ¹qÚ¦Ð^ô.FŠ;âÉ©ÃNYâH•u Àý²m¬xØ ‰î* h¨§ô-ƒB@°¦‘ \”Ø!20¨³ 0X.œÐZ(a´õÑéüÍûé(é/™»\ƒ³ aÅFCÁ‹Çàºã]2Ëp  g,£9¸²šóœ‡ ¢t ë5önÆ£èä= î Ã\0–¤ÚeˆÓô+F ms°žRDuŠH#ÿ#ˆÛoòÇmù`ÛÒ|½þyÊÿøŸ§üO“ÿ᧹axëįÎ>•ýzJyJyJyd !{K©ãsjõj\‡‡Ëu´Ú=;²[*˜áìBecÍ„õ’X&]žIÁ r¢¤ÊîÆÜåEû´`SŽüŠIέçA|Ã\š îcØ´ÚöºÌ‚= é"e+ ö^Ì/€Å"O0ôjy*»#ÛnŒîUƒ¬^4³f ùw“j-6^N|y1¿ÆT»ÙX³!lêèúVM’†h¥F×öòVC ωÕðÉ-W)„s8Í)·¹Ñ6œhÓ¿pˆ?ícŸå?JGþ«½õ±`)Ësª’òœÏ›;"Q^MÏPž¦ÚBSêÏ3ÌsÌ©“e»L‹f+±ëdzÞFFæóÖj})Ÿò0š+JS¯ 0Í£WÒ"– ŒSŠ>..·÷¶NÿOÍävÎö¥ö½8+°Öøâ9“>@¤ÊÏ™R–)üHÊÓ-yÛÚß:Ù—Ç6%Ï>+G{Rù>@ÊÔX„3gˆs̸SLd$ňíÄч ÞƒÈG;ö ùð³–Q<ʃb†ãéMÑÎоD¾C%M­ œåÒdVD-VZÛŒ¢L8¦Õ_›¡íØ×ûWÞ#G۹ؗ²÷á¢0œe9·Ü‰Ü`lŃ¡f:d™ÇeBÛ{[§ºÏúüJ¶/…ï¥d QÊI‡!ìrÉ5¥9„KšJ§Ü/·ÿ•Çd;öõ~„dÊÏ/}YvñPÜ*‡Æ"ÇÂjge–ZFH *‡kLv=WÞ\p³½³uš‡ŒÅ‡ä&z(ç;k—‘¾|»—YG”2°=6E̦X’;ª½oêJ˜ÝÊ´n]ºÌ«l„\´3V8‡••Ú¤k`žiM)c£¡¯± Ô´iØ[ñoÄâU:Ûöžä½WÅ]¢˜b« ÕÖRíW¢™àœ" 0¡»yhfÛÛ{['¼4æ¡uwœökßÕ Èø²¸jçq_º÷/Xº­šf9EÖ§ f{_?_›Åñº5®Wë+õÏŸm¸XAó´½ö+\îÉÜÑ~y>©½>·ñkøu¸‚J½ÞÎ]ä ßÙƒóM¤èF‰¦ÑîÔñ0þŒÃ6ô|Ó«m½ßØÙç[1X£o¥³éª¦[l±:MÞ†Éøjœû{rœÀHŸ}fï«­Yz2™™P%r¾Sí¥æú@(OÄñàþëT|iuya±¢±¥îÒü÷jcÊNO+ßU;h¶g¬.$„Úóy{á Màø ¸rÌô+;Ö!"ø|*ùAÌíZXö×Qò °]cìKQDÊ-UEÑPêf82ó Ñ3[ÜÌÆ~çàJÎüÊÜôã yæ³9d2Ÿ6\|¶xŽü)ãOšYT+?NʈF ZøU;Sœÿâ[€çÏ/à’‰u9¬ž?¨Dp•®f¾ÍoÃñï«gê%ÅKbû:\"å¢fÙÿZ™u¸HvœÔ|¬åÃ*« 5,ómJ:FDßDš.°üÛjû‘;a9uCgŽc[±©{+êŒCÀÿ=EMW4bdS_5ý‰Ôý6PÙº)Ä%¨åÈk+]·M9Ý4MÜ¥jÝNƧk•Ã –Ÿâ-qoÿªš–QÄá—aïcââm_ûáìgwµ—!ý3ºîAx¶ä°Où(Ót6ZÛ¥½zö"N)û¹ˆ Xê ÕŸÅ¼€éäÿÙ»²Gn$ýî_!ô¼Øƒ¶‡÷Ñ360/‹`±‹}1žÕj«¤‚¤êvÍbþû3“*)3•‡®Ru« Ë®n‘ ’Áˆ/‚Ç·ZMí,y¿xZÿp%^¹Ôã-§\ÈüåczG"u|:‹åCùRæGS<aC92Á×üò)±AhB¢ÑaPàhÿŒ“÷€Kûç† uϺý¤ë›> Aýz6=³±ìl¼ùßüCòfC©†û¼CŽÑò³üÉZ®¿,š‘„q•1]%ï+_òcz·ÿ‡ÆKþ?í&VÉõ¬¦<ÁÞÚW“RÒJˆ‚Ü5Ç1f¹4ÏeŠüO%&ŸøiŒéñï‹/ás ’™÷ Ñ4N¡™÷Õe²n«O«u2û¹Wâ»Ò Ûñ\K³5p;“";ÍAŒ¹€!êkï4Á*N“p1)t+ÚV¦S­ƒA€[Ðz¶ •ë­ uçYù¯4ÖpöæŠbÍt^éÍã’×È|·Ï“¦¿,ì"»R\ª‚ŠËçâžqÚ>išØ ùŸ÷«8«ù%äé ©çŠhˆ`ï~oÚx·X\̶,î6÷ÆWjpÜþ¸"ƒ;½e÷®ÄY¼¹#ŸÃìÍFžÓμ¤Ÿ®gæyÕ“Š,ÿtP22L0à•žKã5)Ÿs}Oó|®Á¦^ü4ùû¾ífO>¤«É™J§ôÉ÷å=´TgŠ&6äÅò·òMÙ"6YMv{¸º’ˆògCo²Z.U“ÿUÜ O(¡¼„~WÎï߸,W<|)3†ôôk0g> öÇ Úá»"0„ií.Ö`9ÏŠ«¾¾3AÇîž´Ýah­’ór鋼ûܬ[†âh^áäò—_l°[,—aõ¸˜§ ôõhoó¸ÁÎqžéºéçUi— d®kiôÄi¿´JàãÕ÷ÂHÍðzª£Èc6ýœ¬ym|5][|'<¬2²š@»\#$Bµ][ݶšÑF]˜ÔÐvÿÆú•fT5¬Ü}XßùÍÓl}· ÷SXzÏx†þË¢×çNvZ´œ¤7â*a÷y„œž,“•UŠ²€È9Q¹/Kº¾ ëäÒK-!ô,¡J½Òeœ§°J›ažèz9ZË'¾¤H‹†t(Ûµ¦üêÃãú¹-U™D¬ÄñÓ·ëŸôTd²`ðqƒø¯|þpt~2ÝÍÇBý.W4êldÿƒ¯gÌÓSœ4=÷mËê_P ÝÙÂߤÀáûÒNÿC¾´yW7=÷Xœ@)rNW’";õQ½Ñž«·4è\MŠ½¶­È+æCüI²3à/@2|Ü|Õ¹ÒQXo†ƒÈ¬gªr$Oëéìneb¸u…©­Sæ£<4ôG…w?ÆíU¯:õTÅ+P÷TEg÷ŸS4Å­²x—‹‡Oä³ç­dÖGT»¡¶Ÿ@Ã-âŠãre#«‹§™ÏÖ{²˜Ïž'éÚU­‰Ò•î©ªäÉcöxé1ã§G_ÄD•ä‹ò¡ììRË•áq'Å; SuËòMÌʵ?¤[úWyô¤Òµ-O¼ÓÍj×jžiî÷Œæ?ö [9_Ò^`Úæ²!”zt™‹x-[%9aà™¢ø¸9ós9sÂù¶3ßΞ=ÃÙ˜¡-PP0l‹7nL!e I5ìò°KóPNQ“ÿƒÜø?.ñsãÿ¸ ÿÇÖ{)?}¼q€Ü8@&7ÈwÛ³zãY `èðŒ9Á8×ÖœŒiňcÊ[e ­Ä­Žyn$Ó„ö*1!*ð£MŒT’ĉÌÁ±j íAÕ{$Çš£¹¡T…¨œÕ¡µÓ¯Á12+X?ß°¸Ó‚˜l¯€£ <„ýy«P²é>Ä"ÿ)ÿ`Ï×ÏÀcÒíTOÇe®˜Ë¤>uEf´1½œ&½ÖY&9&§|°sC±“Ç­ù-´­/OcûòåÙ窱bŠÉzY6ýÌ3(„€À*QÃeJ2G¹çƒ!ÄÜGrÐ4VbU9«½~×ÔœôÍÖ|°³¿³5IîÖCÔdô Çc ˜Ž„0Êœˆ‚>)I•ŠÌbÐabŸ`ÂNÌT’§¬¿»õ){4ec‡ñê–þ±”SÄ;èx°&Zã­$ÌS®5;Jˆ¹’×–7G²{¥­«Aƒvª#·z¤²Ï-÷¿³ªˆ8‰\c†-åè0f…³Ín¿´õq¿ÜäöÏëر>f^%D*XpË]ä‰ì[¦p$ôÈJ õ?ÑTô~yëƒ>ˆlêìs:vœZ«”)aD¤6 ©œ–ÞDdÀFEYzã€9=×Ðgý÷Ž@CK”SÖéÈq>fN¡NŠoE£³oñ˜EmÓqû3Û\ãœö@]–q¬ScGø˜Ù„¥O9!Ñ2éÏS° ©=Ã}`N±+!nÌ#ß/m}ä0OÝâŽãcæ“)É,RÚrÍ#qÆ«¨”LK=‰ìë_ý#P—eÿÔÙ•dìĵè­p\¦ýc«)õÈ)e, $c¶ê*ا6k¾WØúˆa ::.zEs2röŽåV€1ÄŒ4ÌœpÌPb!ì´\¡WÄAµù½ýoçcy¨ÆñÉ8Šª\ꊢ™¥×;k|‚Dß϶ª;<öÜ#kœ]Óà?ôÀ7Áj;8;GcO§H¿iéW˜có¯©0fàS‡)Ìé˜Ó@§+¼q¤E™´¢Ø³Ü<Êt·bg‰]æ†EsÏEÞ³³Ð/OàSÝÝá­{u¢œ-Þ²« ëiè¨Íç'Ò522”Yî·|Üh±Â¨±¦>|Ô÷ô0¿ s߉ì½/ÐVßæ4û¨u3ÛõáCùVÜx隱܇iþëkœWµÖSÕÌ.}øÖÓ€ËM5c-Žÿ˜wNšMPÞ’;â¢á€½ +xP´¾“v{Sôª|ù[z¤³¡J=°ëð·Ÿ Øú›kaºÔë˜Ý0d/î8#3PËÕ1šîý¿ hÓæe>|=;ž‚éܯ"°¹b¦ KÅÛc jªäXÆ V»vRÖ ÓôbÉ6rž½ÚPÏÐJÁ3¤ÖÓ„¡ +ixÜ…hxš%4ðå™[(úÆCÑÎrd8z}Ñã€3W=žèÛJ§ÉÔB½™téùØšy¥ôŽú†ó¹}ƳQN±_™ºÑæ\Ÿ}½è\8G¢sº|Ü·@¦ó‚] \!ýM{®O©ëð෨úŠ¤wÛÞÇ 'ÓÎЕ¼¾ƒ>'àÞi¾+§Zh—ù”<Û^aO˦٠ˆxZ[>qò/é|\ÅöQ-fa؃ÿíYÍÖ|úøºˆh‘k9Ïè¶QbõîSæ{o’ j‘ì›$ëpÇîú\ÉÉÏŒ¾ Òž#îÙ¾ òžöXè¼>í>nAÊ-H¹xrR42 B}¶³ÇÉŽŠxúkx=7õBCÔÄ&·³£}Ý1ÄD㲜WHQt`B0§_Ÿ“èwŠÐ>n^ø›ð—¹«0šYéúöq¼†ó Ävß5R³Ã=ôH{\ÇY’^“Îhóy‹”FÛžêJ™Œöà‘Ó²µðqóÿ7ÿ?Êÿ_$•}J6¦f]„ˆz]i¼^’Ü8™.ÊÉtÉŸ$í†ÿ)±¤0G€Z$Z †yÔ2"¦•Åðü·GÚõˆ6@;øŸ†¹ËÿD0¿ñ?]æÇOï—æñãäÝ ÝÄ»Éÿ”Hxqñ4÷?§?ðûpý·0ûÖSgÞýóÏðõàïÓ×gƆY­ÌæÏZ ®žl)‘›ÁÔ„eÒIK"¥NbÏŒáAšÈˆÁ.ÑÄFn"¶…À“IYî׉½—ºXþüî~B€6Á`TfgÆý–¥hTØÈw­y_ïí?þû?K >JKóOjÈ’šüºúhÃÏvñûF®­éxŸ¹† Í‚ObÁÿä.ø‰±µ‹qû¨ÄMÃÿïïþýfl×íçøŸûÿr 3ýz²6ºí?C’‹ÿŸ Ýìÿ%~nü—áÿ+yþ£ØÌþËîï—ÝßîïltYÆ&Aß)èÿ®‘îï´ý*Z¬õ¬¥®ò׿§¹>ˆ,ql4ÛÉÆò€Á¤ æXAÿ:› Ò‘\øî3ø¡þ×,§iÖG¶ÓG:RaþP,Ñ;“e1CúR²¹QÈåBnD!Ÿ ù…B.4ÈÌT…b.GºÏ…îGšæBÓ…>åBŸFÚ(Ú E­ =äB# Ís¡ùˆB¹ÐãˆBË\h9¢Ð*dýªBë\hWjUè)z:Ä"V•|Ε|bzH@·x-w4šÙÙÂýöî—¿¥}©iÚëKæ¢8o3›å÷ƒSûi^\kß:;špàjùñ-*¾YßyžØ0[›*AÄÓ­âíÝíc=ý$ùÐ"|¹â†ýÅ8ð÷«ï>ìMvTm4[ÃtQ¬œÅZ <³VŠ™Š¦"JX%_ùPm‘|WmÑÎriž»ÚÁ42XÎ¥š¤±öÖyÁw ²±l§À0ÛmS×?6„­D‚~ò!™é\"Öœ# cÀ…ERÚ€=#˜ˆè Ï{I  ÂBÂý›W•:+gšQ" óA‰È˜æŒ‹Á#ªSí Ö÷O3³< ã.wÜÕ;^œ…ìš™¬Ng¤¥XÑ@æÚx£Fcê¤ñµ£÷5 xÙÛëe^µ%´AAÁi"RðÿŠë}ëóÚÍÖŠ-”!í1$$ÑÂE¥±Ñi¨#é…±ˆªæfe£½‡¤õ]MåÁYçˆäŠÏšã°sÕYïrS-˨°9¿w5ƒuÕ w˜2G#¡.X®rB(ňá^+¯+¢ÀDPh“ÏÚäëÚ”Þ(î•Í Á(ÅÁhæ=&HƸSŠzaJñŠŒÀÔÕF!µ‘âà.³Eò0„Hµ'0›:pD1á,(Fü*ˆ •"­žìbVŸT×»:#ò!„ÓLF$Á**h.€} ”K§«­i¨.¤íãÆÒðÓeJ |î\…¹C’} ÆJIxLµcì £^›(…0ÕFól±;¯©•Å„ŠCºã™!4)½‚eÍb& D‹.yÆpkwö[¹ !VDpÚ2‡#Ò$µÈp‰f¶Û…øÇ.Ù³Ú[o,–p ÿ€JIE, …‰Ña¹1Rh}ÈZêZfk2û ^èh8W\1fƉÈa:Õ.ä# Ë0+.ÇßÍ :ùA(®¾ 1Ö$m¤`æ$Fñ9!Ê8½áºuøý1m¾‚]cžURI Wd!`K uÆ2M¹&|x¥’¸ÝLµ3Ä 9e%ÔL RØH„½— °10®-ª´úè±â”=:C §|$‚âpº[ Ủ}cƒuØzXª,R.Œ…eªUˆØÄ•Sf¯ ¨—1ëe¬ë%Líz±ìÝì1,£`Y´)ªhÃ"$—0êŽVúò8{Z/îžæËÅlVŽh~ w% ï|ÇOW)¿ûb–éäs—Ù1 …-§¹‘yÍ’$]´KP@àÊìÌŸšM/à 㠎^&Liô¼ ¸`ðº \#L¼êXgâ>ÏÄ}}&îs–pÂ`kɃÅRŒ[eb@³&€Ð± 3ÍbNëbN;ÑY†«€’@w1QR+-1Ç&ùqA¥c¤¢Âè%æ¯ÍÕ4ŸšBÈÓ¥•›PœbÇ4,P©,(ãS£Õ^ .ï]\Ç¢‚DÀ”Æ1ά¦ŒR‰šÁjˆàýzpmy"lÆ ”F þð¬T0†€=à='©ŽÐµ^Œ¹‘`¾ò<Ð Nœ;æ4%ÞZ‹¦¼îÂWÓuçìl H”Y¡,Ødß`ÑMpÈ"⢨A‘Ž8hÃ| °L(ð‘0 4XÅt0R­cìµBIô´ƒÔjnüD4°¬L| À0¸’û ÓgCÍo ˆã”G`ÙaŠ)Ò\Ã'AN:AAÒÇuT»‰‰Árì €’ῧ0xh¢qt\Lü)[ƒOukðÉ< ñ’ªÃ؈)%Ü;n$§lõʘîY(å,K9«KYœë¨Žä ·Ú FÎ ö‚žž™LpµÃÛ+›ƒÀò>t.ûMp@´„Õ@Ó,b-1Z‡Õ` ¼Qosóû'sßéà6I{IJœO=6`<‡ DJp ®=æK„ù}w¨#7XÏXè‘0,2¦ÜE\ÁAÁœÒ–ôÇV+Õ×!ÆRÁ:”(½÷'¦“¸ì½ôºyž¶­­Áá?ÿ b*ÀÌ@@œ %c>XÕ½émmá ÌáôaPŠ ¦‚¥`SˆN´"À‹jcÁðéíqËù!/”‡úBé\ÌY])‘H©èÚZ¢LQÍl1…R9€Ê1Jmʳ¾Cœ®B´4Åþ‰Cl ÿŽ­’$ÝgA¡Ûév:öM,h–(ZN…{) v"„õT)I8&œçQž×G9ÍÛ¼Uapp„BH,¸k ðCòاs…~ Ak !ŸÞ Š ¤„Ðlaž B­GÖ7ÐZ‡GÚ¤o`¹ASVŽâ£(‚)RE >5‡4άjœD·w½‰çÅä" – ¢*Z,®)D‚BÎ*Ôiq ¡2ع.ÅÆ|¦Áo» 0‚Æ(8XˆcU:„`×tª~ÑÔ| Þ­«©<'XΉÊrXmÂc£‡¸¤F¹äÆ莄oÙV­Ù èÞ €Ã)ÑÑØo%%ŽA;`d»44~Ÿvf6r¤—Z¦HÚqBIƒš÷ÌFšÒœ²·?Åž^ šgJ*MD¢ïÓÊ+è˜}Ðëa˜RÜ7SC`â¦oØ DîZ0Ð~y‰ 4 ÁåTÆÞ¾ ó¹oH³”æ ;xP> ¾Âˆ9“–õõm°]àÄHˆù‰J™¾(°"bá½'¹¡Ö(šY<­ÇÌ7ÀXb X"˜&¥‘#F˜]p¡¯W›‹pƒZTŽÀbÌÝÐ ”ÄP-´f’;Ñ«Ëà§ÅÓ0CD°6‰`’*}ŠNqyXæØxÖ« ËÅ—ƒ(]Š/@çÁmP¥9hiDi"õuk“ÊÔ-‰ €-pO¸À2NX,ÅcB2ÔëèÖjýÐÝR6Rš @^â…‚€eU8¦`<ÄiWdoN{Þ½²Áà&r­ D”ÈZø²A …£á#3Ú›(›!ÁÖ ~ƒ Év1BÁaÑ2ŽšQv‡oÍÐTÉ ì!åÒq•…Å^"ë¥ uT»I*i ¨…îC¼¸È Ç#f„9‚±x|´î´àÇ!ŽÒZ[ê¢rH9x%Òr_Ü×Qófdƒä ¢¢Œ{-ø0ÂHƒò·)zG­I¤g¢Ôó7« >ŠÖä’FïM¿wT¡&ôÜh €ùÿÙ»¶ÞFn%ýž_!8Àb²˜™ðÚdÏžàAÎÙ“gƒ×!KdÏzýÙÍV_$u·n– 9Å–ZE²HÖůø•àû£L‡ð%ˆXe2ÐMãƒÓ†Á@Aæµ1”Áj$Çf ø¶àô²UÌC3…,Á<’äÈg¹¯Ô Ž0XrÇÇ¢É.^´íâa<ùHŽ*©‚ƒ!&Â"ͱBSÄ ³ŽuCæÈ™*aÉ‚fÅ6ç˜éàÝ F]Žfe u½cÐfÚwLQ-]˜2šÇÊ`ÁÜIƒåŽbKìçQK—°JòkÅ@A[Y ½¨3‹`n¾MGO.„û»½¡Ë`meY6‡q°¯…ç(ìA°ñÊ|Ð_,§OÐRÌÈ"ø H¡Ìºv‹Ç2Ë„G ö2#a £ÉvÁ?p).ÓR\¶—"tdD¼ÓÖS¯ÙyÎ(ñH€Í.] sî àl+žûÅz_xµjWjÝB#Dik‚ñ™àŠ0I_à(´;jÎ6ñ…¥¤ÔÃÜiblº=ˤãáÀéq5&ÆÅ‚³iA¥RâešQa8˜$ÐTFnsB,.‚rfÀkµ6°ªàj0åÀ‰Â8|ìâzJ‹ë©½¸ž†8ŠçÌ¡`¼v§ÑÖ+L¬GÄaJ¯ÞêL<¹åÐtY‹Q¸@â˜7°a‘—Öo8ÛÑЬã=Þî •ê¨Táý ÿ#Â’ÖÊ)1&¢0Ù‰ÿÁ -ü'Ì1Â7üKüÜð?.ƒÿQšMÍ$`LþH~70È äŒ` §ÉH#Þ‚q5` Û{RŒñ÷xZÜÏ«/³¹V³&•ï Q}<@¬~­oÄ¿ãÃ¥AZûÌÍ`ù6³q8ì^Q­:8¦…aHy›+a«ª•Äƒa×ò‹myWÍ}ùöêñÛ7µ|R«"Š+K°õ~Mx"Ñðk­ ñ(Û×þ‹÷v+£@m ´@Aq¶@À¥Ýl´hF6¡™ÿ1¯ðâÛ ;­+êJpèÆÇ‚•‹Ä.Z)†n™Eƒõ²>L¿w÷`\\ïŠBêE¡è­TW˜U.h®d¸¦Ý:ë\&øø)Že³•¢…ò¯÷¡fKQ3ú§íœ_¹—6×xÞÿOúê]cÔ9½sžÂÙ\¢\f˜#17Z/ÍY¸AvMóÜßÛú \~šûçv,¿™[—c™ j@¼g ;h†±Á’‡˜Q8.ÅÍmQ^â,³Ûßß:ã‹s·b~_vNÇòù¨ýê‚Å‚6Ì¡=—Â…s>ã0BV4§ç`ßyöïè+$œ˜ ¤,Š²1jìÔ‘œ>jV)yÅãÍZœÑpï=ÜR'\J™ù̾ñYí}½ÅÕ¦bZÌâHÎ3‹žy“,1«Ý Êx² \†¼ºXÀèŠtioë\Wû¯AÖŽåñ1ó©s²½(µNH/ – CÎSrí³_Í®ì}½¼êÈØI;JlkPJj+ŒD0Ã4å<`ë8r˜FÍy¤logë\ø6gœOÏd‰{2@)Œœ·cÖˆ¤Ø9 §hy$’H¸v0gÄI…KG›„in2,OµSÆ¢ …CXc¸çêìç#ýão¸æõsü!ú},{OemÞiIÑ”É/sóÅË#ü¯äó®‡DÓÏWWàð¨ÍØÑç¨/|"Í9¨Jb•t™:‰MÞíª‘¨§·´YÕð<ž3\<ßMÞ…s¦M¡ÃðæOµªÃ©•õ$ú½HåÁ}U+ž×ê¶ ù¥úŽ›"~ßáŸzX‡"ó.TP0ÎSYJ¸Ó©cÊ6ƒÍ±”ZȦ„—b£õ”lǪ«ðxøö¨‚[:’jº5=´AâH·oûô©–7¶@\·¯´mçQ¯v@(ïåÄyp'í`è1Ò·¡Ž•—aQFaù~²[ îP¤÷—{¾ûÜ/d_‹âØöÝ>~lþnÅsr —ÏA5í7Ú¥^Ï>ùs©–}”^ïŠýb¾ZMõì¾`ç럮Dk¹¦„bŸË¢·±nQ^8p$”­Õµw킶§Õ†]õ·¯íºïh…„i~÷^^\!Uc~ø~7ñå|8Oì8ì¯Ý¼öø¦,È«ÕÅ2Ü]ͽpOBÁÍÉ´4“¿Ï» <˜Rª®€+“w¥Zùð}ºr?½Ÿx5[ Ÿ/Ã;P¥ À-°\­·Ûù½²¾$èÁ阃¹ÜGñ4Þ 3àq4Ð=ÙÏpTcv͉9hòñÇÉ¿Âð/æì•îÒjá̾®ÝWõ4/ÛnÔ|©¼K索óì ÐuN­¦`2Ø©c Š9èŸðtñÍbI)ˆÁƒþ­•s%ÖÅé–Ö æÈ .¼;ÂÁe„—KÛ¯ÙwpŒvE¾k8||í¦Í E#ëvIäðaá¶ÅˆML—Bóås¼í³Û» Ì|àÉ£ƒ…{†)爄{êðrRÃ…Ô€<È+RÓ[„íjìKò¢y~?¨ë1/øÕº|Ó½±A;]-fêyuºp <O|WÏÐâ5ˆ)›¢mÔÎ\š0Š“ßÖð´™=Z;PÔˆ(Bt‘é“wENv 9_ÚBg|Ÿ/ÿ*ªF§<•ÆW×â1¼‘xäám—û¦lùŸñbYP®Å…)hP¶ žâûhÔ8ebuÇ®ÍÑŠ?#süÖõ~ þ¶ žÕ„r})ÇeñL¶²î0äìçåÜ•Mwé³tB³æéá 1óåÒ­ó‡poªíTéß\‰é¶¦AÇÿÛ»¤ÌÖVOöˆÛ^.,Yí¸6¸ ÂÒÊ™ÓÐI|9€NKØ‘Éè0ÒMƒOfßÔ¨îìÏ´!­y‹ÏÅešÃä5Î[I|ñÞESVU,ÝÕEeGÌ°)ë¼zœ­ïîè§{ý7®O5œ,¯X9¯D+”Ý¥Rðªe•¬hö„±âB_¹uЫFùïry…t×G· î!3lòëZ1¦M-6| B©S…nÃÂZ?oKn ],» ÝO·;|Ò{;ðòÖmØSiŸ>övˆÄpOñå$^qCoÒUJ·ÀÿA2³dÞS¶Êó×w…Ds6QÁ %,I®"q%a“³%Pöéø¯¦Ñ_©s/væï>…ï™ù¤Âþùçï¿wŸ+A1*•_jA³êÐýûüqf'vþ¨›§ñ?~¼–ľkYÅŒœRsG;^Þºæ>iZwÿ½ï7ìDÓâ•[Þ´«%] nèŠ2Žx·´TájÍyà—óo-hæß³çZÌi‡lÝÒixÐî–œ˜žS4²ú…i©0&ó‡Ùó$\8i5ùöTž+9³¯OvMæÆÒƒi¬å9Ædp¬=ž“?6º[%»óU)$}àç÷p2=´sÅ$^æе±µ''ñÁ9€—Ϻ~û×€nh¼'@ã½üOÿ—£ ãÿ²,㢋ÿKoø¿—ø¹áÿ^ÿ7"˜ÞÐoè¿7ôßúï ý÷‡É¥ÐSï^.ï.%q2T^ŽÞ0*¯°`W2-ƹÍ2ïœÒ É0µ& µD®aŽ§ª2ý½­JhŽÅäåò¯šåŠ+‰œÄÂY’)™áˆï¼PÑFA?þ> w,ׂƒÿ4§Œp-©VŠ2­Y†ÁÞÇôºf¸¿·î_v‚€€äô1³J3Ë&,#2—D‡ÒߊCbK$õIAÀgÝYÖHÿØ7½‡í9–«ÇÌ pÒKŠ5ÊÜ9B‰Ó¡ ®–™¥ÉÃÝ=Ÿäííí†çýÈžçß‹c¹{ÌLrBs'P‡¾ãLc òÆé–ê0”ÖW²ûǾéEpuåE:%¸_ñéÿjôAßW€f-fÇj?™Þ¯¬Êr·ŸÜÔëNVµ5ÛnŠn¦GÕr©žÛÅ7,DZKä˜å˜ f¹'&Âq qͬð^YŠá¯Ãø_Érìû¦fÏ/§ÆNÖK¢Mèëõc1…­¥rŽ´±“lŸAÇáñ«—: ¯sí\“Em„É ,¬§©uv¢b R¡C®$-¨œƒÝ÷Êã×…9ÙîÒNþzÝ ¯Äs_Šî>ÃË èvt¦ >~æÝ;éž@$ùéS¡ë÷§în£BT*keN~«›Æ0x*!J¤L0£K{(e^„G‹ä §³éú9ÙÖ«Â莽Œ0ÑÆ ‡Sݘø®@Iw9Š¦ë•›ùŸÞ·äõ÷élVäðFŠñnD}_Ýì’à„}I»Ç¸Ca€—’xìSx¹¹#§pGº~Éó¦1äJüu¸Có…ygÐ2]œXºYTè÷«ETä÷‹ùìy6Õ½ èÌq¾ŸäýÊÌHg[’«î7û‡¡·‰ îï&©W‹äv•÷‹Áˆ]rDÊíäš=c[ ù¿Ñhi:ç9þÒÏX £}šôâÎéÐm³¯ÀaóÐ:ª{ñQ6 5Ýø*g¡}úâÃ8lêª÷UÎCûùŇqØ<Ô-¼W9õüÂasŒþWk¬ì‚]ñÆôø|óo¥û÷qòkÂXü+ÜÛ,¼|ëèîVDÕäËôÉ=L*ÐÆÂ}ŒéÃbòÁ½‡ÿ{a³«òW‘ìš0åDüwêúrsî–Xtª8dÓôX·Q07–¼G<ñÿdèØÝñ§GN?üšÊú쌃ïªìîèã3.^i†KøÁ“s¢®u;¬hváŒüèªÎ.?â3çdE]ñuX±µõ³ð¢©¾º|(Bƒ'}R9‘×ÚÛ3ÞQ¹Ñ9 î{'XùùRÝϪp„àÊÐ0¸²[ð¥˜àÍ@bZo=˜(iEþbCãCt8§µ]ƒÈ¸x´O«QuD×UæjŽèn®ãxñ•ùu¯³XC}É-Õp\ÎÈ­LÃ[OZ9ÂQ¸ºÂ ;rVä…3gÞªÙ5ÿl#ÂDe¶ßö|¬f>ßx#kÀ½Ç7zVù*PË]=³¼«_byGµœ¯|‡ƒ /7Ñ}’À+¹ñ~JëšÓ7yG`©{@rƒ ¼nÈÀþbÆÿÃ(ÃYÿž¿áÿ]âç†ÿwü¿ Íü[N ¨± à ð†xÀÔÇ.nß)P¯ð´ãŠ-¶F¶…Vñçoa®q«ŠEn§ûkô‰ž Ôoñ¨?€…½œ†%º2I½8Õo¿è? Û/Àõ}þ±ŒOþm¶þ];%MO®ìÐǯñxâ |ñçHì2P 6ÇxLƒ×ýXÎhcˆà’*ËMžåÜ)ƒñŽÂGÖ ÓIÅëÒ æ‚R±Òþþ–R¬ómc¯!­Œýx¤•4Qìž)Ì{Léb3î˜ã_âC V~q…™°b©o °48Ù±EŒ¸×vI#¦V÷2|LÒŠõbð#a<„pxå»-ÝžO'$ÅéÉj²š† @}¿ìÛô¡ˆíÄèjÜY¡[`ùéÝg9¬œÌÞíXxË¥,Ø…y¶ÊÀ›KæeË›ý{}|úTm‡#cŽ¯Ö ˜ +05ØÇ™—ƒeÀNµ †Gwh·êDJFIk¬Å:7é ª»…É›t†\ë’Aé†S"3ètdKwg¢3,[§K§J¸‰ÐðŠ±[ˆ‰Öèz ~]þE¨­Kƒ²Òò4…š'ßaáoRËbž =‹üáwV꧄ʼS¥í]²……V\¾…÷®»"H#þWâ~ß?ž6ØÿãÓVü/#Ýâ—ø¹Åÿ.ÿ«àóo¡¾[¨ïê»ü¸‚‚»GwdÎé#×»¿Ïf#*›Ü‡Øc“g›JéQ× Ôuþ0&±“èÈePgÊqÞ«Ô-5fPºNB'z S'a 3†„­“°‰„CÂÕI¸Dbª–I„O$ü_ê$¾$_ƘÖIL‰é³:‰j¹ŽÚ2ßê$¾%ßÆx¨“xH$ÆXÔI,‰ÅË:‰e"±C¢±ÍV‰Ä8ÙQ'±N$Ž‘Ö¥ÛV’|L$Çôê©Nâ)‘x:Á!LíèbG ø¿BÒ÷4Dç‚”‹×òf³MÆúûÉ“ZNƒÙ¿Ú¡ ¿80¡VEˆe] ß"£.Ø««"Ž:2üö<Ñ.c_Ï?•ýç‚Ö¢õ¨é†“0ð“ÇÉ°dáá# QšÇõtvÿÅ­ÃmF3 ÷&ßýôçÝåViªüasí3ïÆÎgJÁ',3ŽçÔKC¾û(¹v?ìF 6ŽÞ×"Ì[ÄiêC˜†[S?uËûéê>$à‡Óž0é<ÆšK­4*sFHd3˨ãqìowõ¨W`Ê?®3‘e2óVç–͘Î3£¥¤”Så=ÎèáH&¢PÍ\)é凼ZQÆ3‹Egêÿž}óY°;kC6Ľ¦Ô[¦™•ÒdkDŒ“‚f†9­úXY"d•¨ÖûÛL#–¹r™ã‚; KÅ"f¸ DfÚQaUe×F¼‡ƒi ^I“kM3­,¥ÆYv ÞWÄzŸ÷!Ä:ïcìtÇ !Dk”q—d¤%Š¥‘£ˆH›[1vþ•¢À"˜ÂÌj­1BRKnjЄ0ëûæ?ö>œ ë>0šX”g\+"„Ìç°xm®Fffl÷™äˆ±ÜçÅêÿÙ»Úæ¶q$}ŸçW°vª¶¯¯²7S«ØJ¢*ÇÎIòd§*UZ€fTãH^ÉÎ^ê¼óÛ¯Aê…z1JJ2Wg&’mŠj>ÝlôÓ À†³gÈZâˆE\h¿ ‰T€ÂU¥¹1ØXÍ©£6ç¹Q>ìøI÷ƒ˜eBfXJ“§Êy»hà¿¿ÄÒH¥À­  ŸŸÍßbB™+Ž˜5ÁÕ°HgyΈq†™¦¾/q¦tîHTÆ ¹+F&i®,Í¢|ßžÆÁ7pIsA0VåÊq#”È$ÓR0 UQƺ»¹Û‘ Úl¡#ø¡ÂI¯‚³¥âdFÂJ4¾â3Î]b,Ïh.LÄ Í±Ê‰1AÚZ(á®cUH±ÒÎ"°”ÓXríÄ`MY&…¦© y†(i .ÏG!¦ËR©üú"i´ ñ!ãØY8­àXg*•šCô“ÚŸÙb×8nl ‚¦‚ æg”(h Òæ"åp%DГ¦j|ÜÈUdÜNÁ¸ÆB›B¨Lrˆ– iŒjÎÛ.äƒÈTq£±B8ç™´©uFãöô·áÍ@_«ÑoÈ$ç#oÓ¸v¨õOiá(4}F4M3 Aöž ›†‘Ôä(J°˜[ˆB)ˆ·ð·×¥œÃÈt'mægWФ˜ Áã9! š8…lfÆdÓKƒ,öø©±I‹¡¹§DåBC^àÒÙॹ˜»›8ì™g ‰,UF¦ÐºÆ¥ÕòdUc·BJCˆS$†ÐÂP*}|ÕrDM€½CØ¡AfýžÈ|Ö¢LjŒ8¶`(°¾dŽè £=¹ņж4†•/å%„°)E)P‘!¶)ð8xûfðöÛÆó„VÇ÷rŽúñߌrF+ã¿ØÿB@}ÿýÛãøï×ÿÍÇã‰)æ›MŸÿšôÊÕ¶_•ÕG„G„G„G„¿ýˆðÁF€«ú<ƒ¸úëB!ØQü]<»‘^ùÌ/²}>½N†ÒœSƤÖVÛÔ5ùüÀa…ˆfØi;ÇþÕíÎØÙžv_F‡“Õ¼ò@¶çüülû,€=ÛËö¯†“émòÉN¦EÙš4;Aø§(=ˆÝE»øÛ]°ËìΈÒú3¢4ÆZÍN`„bNytÈ­þ™!…?Yvk—)s1£,7-+»¯?ÿjÍD]é¯Ë¹êú7øù‹õ5 Gm†?@h(ŠÐ¾¡ý¤†¢H­ˆKǃÁàøxp\¼W_ÇëûÕ}ªþ±¡(b+ðŸ/x?Y}mì_üåßï×Thˆ?@l(ŠØŽv†ïÿ}Ø€ÜP¹þûßÿýþ÷ò½úÚ¶¿ò~2->ì?@p(Šà<þäurzŸ¼ƒß~€×yRüþCñ×i¹oöúaþ~šÜðèW®@Cü’C1$Wâï&÷×÷Éx†ÓÂëzŽUmÇïuüðýšÍðãeâ(Ê,ð· œ×3œ·ðº›cmÇïu½/¨¸PCüþÅqü›”Þ2Z⟖:”XÍ ~ø—,ñ'k 4Äà_É¿€ãMæs‰®ðŸß…_%³ý üe‹ñ¿Hª 4Äà_Ç¿OglŽ?©`M*¯õ÷âð/Žåßû¤¿3ÿŠ ñøÇòï}ÒÞU†øü‹cù÷ÞîŠ÷êëhËþ•}'¥×|8š+Ѐq4ÿ&—ÉýMé÷#xõà•'÷ãûä&¹VÆú!¼tr?¹OTñmýdvJ"kŽ?À¿8–ÿü=‘…Nbùsõ¯‡~6ùNÍ_Kî›í^ìmh‹—ãX.?ØÖ ? p9‰äòÓñÍç¢Nòäô)d©H®FÃâÇíçäš §Ïzwú¶E¯sÑí´‚?Àå$–Ë¿•ý\N"¹ü y{ï¦6yÙ;K®‡¹MíÓ¯€?Àå$’Ë»Ö ý”a}WÖK¹+Jå'å4’¤Ø¥‡#U®EïŸÖ(×%˜?Çw·»áp9‰äòc3tüˆ8N”¯¬ï+ÃÜúÁÑùTúÙ" +Õ2òñȦ;Ú?Àå$’Ë=âööÅÞî߀ËIt_úP[Cü.'‘\Žž¯5i±VCéû¾¤ZòñnZTWÐ&ŠÚâÚÏhÈqw4¾…VÜ€ËI,—'åØÛü™«Š_U­8=è "†ý“ûÚ?À¿$’ñ¦ýÁΕx3·?4fs—Û­—`ü4À¿4¶/,`—ëÌœª9þÿÒxþ]Ì´'Û‹eg’ʯ­¨®§ËXZÿb ¸rÑž7Çà_É¿¤X  \ˆµ‡ï¸ZòØ?Sü’<~²ÑíØO¨O€ÝüííÉøãøÖ¯ÃâÝêvÚ€il_ì&þ´¬éäK>Ýí¿ÔlqÏ°Ó›{šóËÆxâx‚•T7– !þÿÒø{Ùß$þÓÿÒHþí¿éô’Þå«þûV·Àïﺗ?uÎÚgÉËŸáÃvҺ꿹ì&ÿøG«½•²ËÒº8ƒ×ÏIûïïºí^/ƒvÑ#ÀÃ4’‡;oßw5¨Ñm]ô;íÞ1$û§çWg‹×ÇÉË«~rqÙOÎ;o;}8¬y\h·ùµ¦øï¼n_œ¶=²K¯ÁûN¯ýbM§çè”Æ~ß}¯ ÷òm®…ÿµ)þ³H^á±ã"%WIë짎÷‘F™½Î,¼­âôͬ!?ß1þ°³ø1åo’G°ÿ²Hþ]ŸIw\ÔÁ('ÕAæùQ†7w¾®ÀòÈùl ß?0¾~öNøüË"ùwQ±yúæSñõÔËÝÏg»ÿv÷ìfzgž»‰/™^þ@ZX˜E²ðùøn8}v1¶×É»ñ]þ«½-´Xî~~SîþÛpý²¹"Ò‚¸˜Ç÷‰´5Äàbþõçw4S @Æ|Œã„’“]„h‹×ÐÖMq3'·Óéxò§¿º‘±.¹ìN//»@Á­~»7xÓÌrâ54´Šg~ÚijòEûB0¯ažíãN ^Cëv¨®\1½5Ãñó_˵(šà ¯!€:<Ë'8ü]ÜêãÕ”.9)xt~ÈÊRMà"?—;´®,ˆ³š@¼a7sWód0Èo®ï¦þõ´‘’Y °f55ܺ~³Ÿÿ5ž˜ò©™É¼œÜêseU›ëbH¸rþçÝȽüÑL•@ˆÍÖùŸH¹(›ÕôCÖ/™™¡k¦U gÑá¸ÙiQ7c»8 .fÑqq%P_u;Õ`”¾Syþbg ÄÒ,:–6;m dfb³‹ºk¹ ¦Å7«KäÌyƒó V>íöÊ‹†>[Ò`®ôƒ‘z!¼\Oaq©ŠÂ‘ SÔ¹SP¯ïN•¥DXŠ¨´˜b!2aufrgÌ•šó Í×$›é.L™|”ÕÁàõõ–}HëÔyp„ux†)QÚnÚ—ÛC)A©±:Ç™Q¥u²FÖŽæ¸z5ÂÖ cððEÙ“¹"­S×Ð"¬#˜±Y oÔ¦˜2MaJ‹™6™‘¢´Žø¢Ö c(¬œ³ôŸHëÔ¥>Ö¡‹bÉsg\¦´Ë¥²$Ç«T锈´´Žü¢Ö cÈÇ×wGUŽ¬ËábZ–T©•˜Ø”[›KœñTÀï+ʸ6¦°ŽL¿lË b˜Y§â=‘Ö©Ë(#¬c øqF4 Ê„r†¥Ìj“ç‘À–¾#ѵNƒ/0º­ÆåHë’T¹š¤þ;’âe]Žú°ÑɼUj­M…¯È²4Í­£Ž¦Í3ÄŒÃ%6™ÌêýnM÷›)„/æÆ÷åU‹´k]öaWÅ9•‹Ñ\»”›‹Œá¨ò‘ˆ•v¥4»Ö¥. t[·üMË: r—ˆ t@$ßEh « cîÓŸýå€÷&õ9d Ï!ãç«mߢú‰E7×êó¢tøAî ËÀ}w‡þ[£{Ã(­¿'ŸcCIsŸÆC³ä¹ÊÑš1ЛvV+§•ÑwÂDJTŠr_ÈVo¶æbm?ûÉ«Îyûè8ÙhîÇQ”ü4®¡@øü+˜‰Ì ÄÆ•4N¸”aÇ$tL4a)Ú4SÐJÑúקðy¤þ+}Ô†úgœ2Ä™f¹cÄh&Èa®¢}!ÒMýË ì®zý-8ø¼yÜFB&ðù.Bëi >"ƒCnÍbQ=CÂç‡(ì–ëS‡x 9 @•øüNõl Ÿ¯(°Ñ¤¢‚¡‚+îˆv<ÐÇ1ÊA¯XÁ–R&·4b_ »hÃqaå(ºeד7|¾C#  AëHâ„è'ªÄÈ·KóP ÄŠ-1²e{k?Ž'Ÿ“bÞbªù‰±Ë?lå ñ8à”iÖ²5FÐZ‘Z6´`’Z ß·‚8 Ø ê¤öÛ·¤'åÊÊEÓŽm³b#¨®ØÈÁ1È:ÃØišftÄk«üíÐ\ø¹×ëšú%­÷KCUJÐz•’8¡ÆZ/'4À"Qõ<¾e° ÐBt=‡·wå]5 ™ÖÞ  žŠ¬çqÈ­Y° ô@k=v VTdT§Bj&™Ã¹Ê•$Ë(Çšìèfίǣ=Ûp Òª«ôñð=å¦ÁKóœe~Im- 1i.„ÒØb‡•ÂH‹MÍí?ïÔõvÍ÷èRʆ õ²!j†ÒÊÍÄÅÄ›ò†_œI2Í-d¡Î┪LQ™hNÁúØÜ?‹²qÿa~šFä¨4‚Ö+Ä 0âzù8¡¶©«Éñ¦ ¡@ TWcc딈$ùwä™lVWcï8(PÕÕ£Ø}* ”‘@ue$Ö”.t^Œ<ÀõN}L–Ô±‹j··y¹fc'³ºÕ+Gx­ õC¥(ñçXØáûúÇ3¯Cñpî‹ÿ<Ñ?&+"éÊßϺ+ó_ÌǤ‹3tq‘º,¦%®MIŒ;)Ï3ˆp "Ùwðf»íóábØií[‚m‘³ãõ#›×ÏÏ­Ú}1L‹±lÊf– ÏZ¶Á¼ƒ5‹¼x±>áa+ƒ%«GΖ¾-¬Ú²IkXØ2<£)Þ–aY¶œO—z؆þ>øeyàÍÇ7ÌÇ›/Þ8[ÇmªÛЇí´ÂñAkŸÁ‡ ?lÿê–ŽÆîF&ëFFlÍÈù Äv±rxX*ÞÊ»q=lc§gÃÂþkŨX²uXìvö5ÖìLÉ.Þì¥4ðæýz<{­¶aÚÅgOicÂøº k“¯â $,kƒ@–3»êix~Ü“´‘Ì |4|s!ÞG÷¸QQo½­_‹»·qHŸMå†Ï¦ ’žeü Ž¨5ˆ¿»ÎÕÇ„Õt[…<)ÉðèFÆ~⪑±Ÿ«Ð80„ç¬Æ†°¬‡²ôلب½8ö€"Ýév Ï·cXÖ†«“Òë­¸<ò€i­ØHkÅ ><]*¾Áï1õªaÆ5¬O¹ŽÔnÙô7¬ïfíðHA¼µ÷uØ'¼B¾lo‹,ví`îð(r¼¹÷‘ÞÇÞ¥”ƒf¸˜n݉Ȃ55 ² ¬í8òfSõØál#g»dºÁ9 2Ýç4ŒÁþk_8ðÍ8À·Äò¿Ná|%?¿Xae÷·^`\ü^`|eýïÙ¢Ÿ?Sa0<Øà><¼þ7°"Ë*ë“ÿ€O!É{\ÿûklëõ¿kç>®ö]Rîãjß«}?®öýMWû~X»=WÿÞÐì¥á64­ëë=+2œU›Í'gƸÖ\Šu+Rú壳»‰®‰ìf¤¥fß-q æØTÍŠ PWåè¹ÝXÎ ž|.'o,ÇT嘹ÓXŽ­Ê±s9Q‘iEÎ/U9¿Ìåü²¯_Î2ï™Üá\î°1¾ëªœ…Ö´›䌪rFs9£ÆrnªrnærnË™TåLær&åL«r¦s9"@!ç¶*çv.§&ð> ç®*çn.ç®±œOU9Ÿær>Å¥J·’³e–µ˜ÈWvÕ!•ó¤æ¤òø¿å¿úÌØGµ¥ÿŸ%Ãääp°?¡?@@°{òô»•é»öz¥ÜZÜ<ÁÄòŒ ©‘Uˆ ’3…8µ2ÄøB° îyqOï»ã‡Åá™8¦,J ·i΄³\1ÖÖ!aRÅ|AH/®˜B÷]i°ÔÆÔ£žŸFúx¦2Œ×3Œ±É0ƒSd:gÚTOSƒzn‰ŒÂDóTr®MΉÂSê´£yjrW5ÂVÔƒé0ÎÜ™ÒÌ)½q‚©39!ÚhŠ¤Ès¥˜¿KÙÌÜ.#,k„°©t‚(E‰ÉsaÉIÐÜÓéð—QœÅ•dŽ;‡SÃ-ƸˆM±0RqŽ™£º¡Å‡‹…‘Ö©™‘6ÿsÈHÃ$–™’õÏ}Ï$ÎàÖIçÒ,—ŒjÇy¦¸VXçQ‡°õ v528bÆdÎ:¿ÖK9å©ÔŠ,Í­Ÿƒ)ë nl½1hì‘Øs&]ÆI‰1&7¥§YÆQ–+d‰ËbÏ+Ühk¥à„ DŒÕ˜ÊÜq¬uûðÓÀþ·Ê#±§<“È7O.r¬CLéKs'0ΛbO3–åÐ,Á(¥ÐR5¢ÆØLjn$ó öáÔ߆ˆóušÙ9ê„pÐHSƒr©ƒÐHHfBC_”$åQžëTg\¨\å„2ɈãÚ6©óu?î7¸™ü/{W"Y–•§a°‡t%8.‚jPíîûÿÓv—ŒÖ¨…M3´£ ›1çþœ[NfFÙ?ƒâ0‚à­ à¸]‰ Œ;Q7.Ä…AÝÌFE\ˆ ·~çÅOefgÆ{/²ª&3»«*32â¾sÎ=÷;ßwï}÷Q™ò#e†¿êš£¨"–„­Z j“èZæÓíG_E ªœ9È–X¼qÉ“Dç’Q‡ÝÁ§_˜í²QˆR[Â"ƒ˜é¬µÅø…ém¤Ñˆ/2Å$ï’æbæ- €NPtgz2¦Ïfó.çZ_%åˆ|€Þ pÇH1ª\}®v¤õÕX1€bö¦ššj³I IµZ̓­?Š“qU>7¥C‘ò®\µZe¬¬b,ˆT+*§u–—訶¤á•ñɨfÕPûZokr1 ´"}\+F— פ=:e,Êç"Q™É!¨åª”€Nr%ÆœHùëy™hÙ¹³¶  j²±ä‘•2¢bùRÇ< TrB夫7àrÂ$mŠuì6ûQé!_«Š·ƒáíAÊZ™0`©T_‚4"h16U4F}*@EÃ5åÙ`À4m¥hb뱚‘Ã`½9mjSµj6ccÍà3Ès]« #a½eåÈ1ƒIR*ƒ0 •md„NÖÝ°Îv%•± =(eòM ÀQ‰@Lóp¾ÉA7 –n ý$&ÉQE¥u•\˜žŽâ0¹Ä@2hKßSr ^ ·1™ÁK#›D9p^«I;—Š£ êoî³}:ÔlkK°Ú$  ã¥h¹J-P¢/¥ŒÍqP 8$†¦­u–ti6[¸Ô“ãlöÑ‚šD ²4/ȃªCÓ)K »’©*zw,:×À(X9…0tcÒ1×[2ÃLœë(@S¨¥0`ë Âä¾åÚ:–¯g…XˉÑÜ ì­X*\ À»ëO˜×Ñâüìl6_Ò@”ÔžY†¢ š ìÍ)¸´t°Œ€ÜHGPOY!GÞ­P—¼ç1luö¢Ö>¼ÙR3¨tAõHKëuQ±)ë4ÒxÆò0i,ꬅȎÈGEšlö™zÈãÉl`¸äœ-àÙRº<ÚTÀU"tq‰4–=¢úó½_N ¤Dž7-5%¤ë°'¼alÙ2zc”—µŒ)ðßšiÛ‚±9ŽÈJ¹¼k½æ£J¾Ê†jdȨ¢©ÇìóãâÎaPòE¤˜ZÊðŠZ26†–ÔX}3TÂܪDKÓœ7 M ‘{ VF—]Z+(hJ6Iߢ–"€7FÈ¥Ui¸ª‹ð cÛkBQ‚NJR;à؃.CsDuAš“S%‡Ò¥º ªÝÕÇJ‹ÔJÑ &„o%G|§ðšJ’¼É}HrJ j­@ÞFàw™mPíZ»š,1Ž¶ZA- •Hûš2axßš‹1XßzB=x<ÚÊ·ó€aÉhr`JçVãªu;mAžu[ÉÊ U‘ÖZjS*%ÑCWf(8‹†C¢+Ðr¡eQ 5ˆ¶à„ËyË­…Ö¯¾)å’U0:™›à®$i¥Øm8ÌFÉ“¡ˆ4¸„n WÐm¶¾W…2†çXJÆcð?+ži"$!À ˆD@¡wSòÕ]ƒƒ¢á‹]`‹,Qô¶j»0–Ja»bŽâeHé’ë9 ÕÙh¼íI¦W#'ˆR -xBm°*"I ¤n “΂R$°LœÐ‰1ÓjÌá|Ñ·ž?†z/k ±6HóL@«%ʆBÁAÒØ4Þ€X‚ãF¦çß™Æ'g“’EXÑ3M±˜~•ðÍQN :’b˜XŽ!Ô$à‘²Q©^yc5È ˜×XzEÕCâñùߨó!kKIyzÛ'æ.y †ªQâjŸ«×H„õ]øÛ~òßøŸ_|øàs_üð…ÿúý¿ùk“ïyð_øùßÇŸùÆÉß|zþg/üòŸ¿Fßýï¿ùà½þ»¿ú—øÇOüå_üñ¿~ó[/üêüúïþ¡ûÚ/üÞêo¾ø·/þøÛ‹úá_û“û?òÒ7~ö~àÿè¯Ë÷>þò÷}ýÓ¿ôOŸùäo|ë·OÙ”‡ŸçÁŸþÄ—¿þmŒÆÿ¿¯Kã¿NçGø«A„*D©…fmFmC›µfS“«{‚Ç]c÷ø—VJyùü¥ ánü?‡¯»ó_žÏù/«Ã³&¦s*K~ŒÝ»ÔhN§|ÊòÝ‘0wGÂÜ ór$ÌS9æbt_ì<Þ†/t?wo^ß)áwtL'÷î_'¬×î{÷WX´5pcÝ°#Véto›#—^îFݽËX¿¶ ù‚×A°jsÇ_NmM{r‘JqWùhòhžÎw:meÊ׉FÖÍ_i½ÐéJ²F[áâ€xáò+Õ–gs˜ÖÁÎù‚NÒÙ[÷^áú›à6Öªoe7KÖµåhg]”Æ´Åy7âýÜ#¸Ð“üX£é*0'ÄpU©w²œ_L@#B¸,3FÞÓ·îñcñ«Í{Ígçg›^{sS`çæ-VçFlûrÊ#뱺ßÁß ü.\ fL—tòûE"€G’6¥©He‹¼ÿ,†,ñ »6iûÁ‡øàÛpŽòôŒœ3âß›¼¿þ±+Iu›R›‡«±kçÝËͳår¶cÀö™º°(œtºXN”nˆÀ‚€ðLKÞ¸êßÏm~sïR?\ôcÕغ‚<óî€sݽkÈìíXž7ê 7¾ëørO­×Vv¬û…+ïjbjò¤Æto¸xXê½ûïñó¿ôLûîúˆéxÓq‰Ž°ñC›Ý<±ãØ×…ÌŠC ÙT»©ºÝÓç¯Ú¡T{ UÀÆ+Q;bÍxm襸6·¶E™]1w(¨æöã×O?bò¼`Åχ@\6{(a;ds~¶9ØýµåÀ °ù~3:Ï—Óãë"æetú~3:ßïTõµ1{þCóòêÝ΂o÷Ã)ù×¥õ_vÒí±Â»ûkçú¯ÄHWöÊó?¬ðâný÷y|Ý­ÿ>Ÿõ_Þx·‘=“Õ:ÓÝðÝðÝðsYÞ.ã}ìàýƒY~ÊOyº~uW¼âÙ5m­~|È}=(Z›gnÜÐîOMé¸[OßkÍzq~r’æ1Ì*òi9NŠ&´UdÃÇ.%UHæ~cf„àüdئœÑÞß.¡…ñA»ìþˆcˆ¢¨Ä~â»M(ÒýÆ"Ò³óåÙ9?ãdh^‹Àm¢íCTŽŸò†Q%å…PÔpY/÷ÛMò¬¢Ýo,¢==챸ÕF4)·ÂGQH²|N»¥$I SDñ|þî»ßXûxVÒñð` Àm‚ít¹A6¦$Ùb@ï&]ä“>‹;¬Ìî7ÁæXœ¨ö°` Àm‚­1fBhµÔKõZ› £áÇØðãä~ëÃý§æÅVJ1QIªYUoŠ4ÊzíX0­õé»ã; üÙÏ>“ÎëwþdP‡ â­ ˆŒ "7eBÔ2ËÚT“J;K>gЪ½:ìýÙ´NžMŒûí=_̇aÐHÏo¥‚¢c •ÈØ ­ªejÓQDT›ýÈùb5 Ó²Ë37«ô6â©×ÇSúp9L7 ×øµñÍB¥eš/Ö÷¬XMÓÝ0ýð {ÕÉZ- tQ}¬®LšÁÕŒ¢ø4vvÿ‹éÒÌÒÑr²ØL7â»Ùœ“49?å©žY›lÞ¶xmò°[$H“w~þí·_âŸLO»Ùn^²èþY,¯|âó©<ÞþÌ®ï>_LO¡±“´œO?œ|ð˜pyêÞ?ûŸ¸]tÛ·OiÎkC04ñÞÝ ;ßò= |Éíç™Í¥Ó)/dLO'K¼±ÍŽgð庙¯7VÓq›‡f~îtÒ;3]~ô:.´þv²LÞ˜ˆÉ ¥ÓE× 7_fs˜u6;­xm6IO>zÁºÉ[oMÄNäú³«¥^xÒ8Ï âM¯=9F‚*3ú?ö®¶9mdYïçýs¼U[‰ zq6©C0‰¹e_À›ÝªTqô2²ÙÅÀ‘ÀYßrío¿Ý3H[Lbr,R,¤Ö33=ýôôŒ¦ƒ`è Y±¡TxWî¦pfâçJ\ÃœÍÔ%ä•Ä≉èìu Ì"¯è_Тp|èŒFw°Ã×`Hý×bp–ÂÃ''ç²Ztx Ï#ò…’k‡MT¥[q8¾uÂ!œuD–CFòjüŸ$;²á–Î7ü½<¼ÄË5rª?¹¥!Þuåo Èn±.àѲ= å|EkW5œC£IwrŠ½fêÈZäƹ⚺èäËpv M‚ûÍ.êª_|@®1–Í®æ³WxõJË‚fåµ(†ØszƒW;ã;âx®ŸYÂÈ©4»TKÒ N:w¼¿aH¤Ó‘öŽLÃÉíГ1³1Ž •ã¢»pkÞaâ{°ÙE¼Â¥©š»û4€.á“#Òé.Ï[Úç­ãƒå9Ð5ó•ŸóëƒãÎY£}ž>ŸDž3ƒ+°Áf'uE¯Ùè÷[ÝöùÇì]rµ’¾¤Ñl¶z½Iï“‚óLjžÍ¿gÆLÔƒä—'øi„K4`TŒ¡¦Ùj°Í¦jÜšñIŽh‚E¡ÉñÄ›ãªM'Å‹[¦Ó —ñùØÖ1)Ž‰½‹½•£ &³ÉrF-‡çS¸ñ¯ø{¸üƒÏ çÏݶ¾¿Ÿh9º‰'ƒ õ%¦üz¶lQý‰‡åŸ2Â~ƒM;°g'Ë¥WÃñ˜‘QŠ·âÞ¶PÀ˜YÛ>]ÛdÔ6y{Ú†ˆÓml¶ûáeý90²­éY/m-È-¾z÷xx›£UiÆB2ÒØ®~ƒñ’Ž#a©Š­9©ìyA?¦q˜¦”ˆûÃF`AÅñ™J¾q+`¦rƒ¡/,ú…–“ïú& Œ­îÏ G4œ Ü‘3þ3¦jq±*îã»NlÌýâeý OÒw‚ÌIÑ«\¾wM½?Å›F³Ì¼Èh o¦#º¹6âæb™É†¸Â cç%ኘdGQ\f@ÏJKv¹¥Z+¢øÎl¢‚4;_ÿS¶ÇÛ`:݆®x)F¾óòÕX÷eÅÄX6èk¤MGlSþ't Øø±š~URòMœK…$ÚÕ,9¯ÌÑ”çiÙ´­%[ήœÈ>}´‘èU['•ñ&7Ñý=_ŒW“±ù–üXLDÿ}~¬¢Ùyi\—­²+¾±jä»!ˆƒQ÷“èAÒŒU{sSQùï»å¿KÚ ¾´Øü”—3&°WšÛÎk#†Þ±gÁcY±6mê^Tc„jŒPª1B^¢ª­ŒøSíßÉp㱡ÁæC‘aA‰¥];6,H¯]ÛÚÈ`e&k[¡n CÝÒN ¾Š.rÞ™â¤÷Ä Úù®“¸±ùÙº®X+ó›Ùcs––èÙ<çí‡~+ìY]0ÃÈKŒ2º6ؤ%vÂâÀ"Æ¡¾ mwŒúÒ+‰·F}«k¶ÆŠ2²¢¼ ¬øý„º*¦­˜¶bÚŠiË~wcâ©Ä“Z;F³™gѶƳ+Kg·6 eã4”½ lZ1_Å|ϼ¼¨šž¨{WûeÄÖŸæZˆÈµˆLîx‚rÿ&Ëî eê+Xõx<¸ØV˜Y\ <Ïø¶påü«Á†­æ¯µ—"¾U‰ÇWwÌ·J?Ÿ»5×*õè̶"*F(Ôʧª|ªïܧª|“Ê7yfßd‹ž„•aü˜˜—æÃȇª¥„>™”Kl¹´c¤Ìw“Ú£¸­7L n˜;AÄßób_e=lµ‚uÇV°¾œÕ¦Uˆ¨rê¬Õ Öðd·»HTಯj‹`)–•`Å»ñä`‰ÝŒžÏWÞt©ü|o§'º×|ã†Å¦( 3µ•ßYhu—$ò wG"ÀŒk^o-<†^¹¼^ù÷äGkjÞÎoÆÚ_Á!Wóµˆù³{â/+V'™+Ž[†v3…ÞÈØš×ùBüDÃZñž¦n[÷˜p/¤5q7¬ïÓûÚUJ%¶£ß¥ ]j¯ý§ú‰¤´ßløDGÌÍÛ^4ÏÀhž±~CÍ«¢y»Í«žGßù¡jæ;"‹næ¶ü÷‡«xÛŽÆÛTIË›j›ñb¢xÕ^U»¾WU‰$\»äŒóäbOôÃ{lY¼5÷[G÷[ß ÷û+­j{¹‹Ð¾‚+¥X+–\)>*îC™R¾Ä̇-œÑb+ù-&mWîaXk!opy®ß£{fÞIãÑ½ç ™}E¿d¯÷KÒHŸïqùâœ0ÏGʘU'?íÆ’Ý<‘•/a„{Äì\¿±dd>žMæ`PáÁ-·6©†Á1y›Á±l³^‡u–‘ÁOo¼Ï2q°Äëñlç'"W‹ÌáA8¹Éež@\G‹t%›Lg/H¥vNr/s˜G3LiL&³LzóëEfþ¦ÿu|äÜï~‰Ð½ûq™  }ïÿ™ˆbE’u"«Gšq¤Û¬6’îؼqšœ$Ùïõl6=ª×¿|ùR‹SÒ×&áU=üüG–å8 ‚'=N®`YY"ãø ÿ‘µ:KÎ_9d8Ä‹„¿& àñ&ï~ü¡ü /€gÖ¯F×Eƒ€òøKÂѦáÿÀpRú|™ªªÿCn]×d†?ß(²ö‘¶†à‘×uˆ\'‚~ûp¡‹~ÿN_¿üã¸ÓÄÔ!›œ\\¾?m7ÉÞa½þImÖëÇýcòÛIÿì”O"ýÐGÌ€9£z½u¾GÒ*ÿEeÚÞïÖÿBY2^=œ¥®¬ù3;»á_7£qôvÙ¶m~5;ˆ“wÓô58÷™á-æúf&á°¸—žCŠ_üÆ»vB ó·—ý‡ëJ+B~;¼l6Ó”œvë­½¼†ç½Š­ϘŸwÌ{*ï¡ì–úý]b+ŽÈGÞµ€WØhÇÆf¨&ªyQ´‡#º·{ÑìnD£kJg{,‹M\<%óÔYé_þpn~46%ügNûÚ,ÿ¥Ü…þÝ8¢[’¿:…7±T¥ f½âö‹Í²): 6«$-SIª ¤+å'Ö NË)”›á&"\^Z„—ˆðDDøi~"ÂAÓ"h"âT¨q±c‹ ‘ª«´ˆ«DÄ•ˆˆaZÄ011J‹X¨¯PºI‹¸ID܈ˆ§EŒcÓ´ˆi"b*""L‹¡ˆˆL·‹b¶$-b–ˆxÄz¯Š˜§EÌs·i·‰ˆÛ2ö,5P¿né %*¼ç¢=©l¯'˜SuÈS¨òܬ0Ì%Ab˜Ë£ n|åÙá *âa¯Yl|y®JôWiìGâ7Lë8šŒ¯à‡£7 .ÔwëƒZË~?$9ONN¢PbKY‚ŒÅh¯SG³Kö ÛvCÖ IÖUÅôa$LmÅ÷}›ÍÑ0p0*ƒeUä[ÅA^êkmüÇý–ñY5Ì*þó\¯*þSŪøOÿ©â?Uü§Šÿ¼¼øOqÌãåƃªøOÿ©â?/>þã&ñw]ü²A¼Hï‘(bÆQ É¥T7 U1 Ûu]GvmËp4‡jvàn†k =¼] ¹…í[–ŽN²i[b¶ª©8ÌŸUä ¾xĉ÷mD.Û0±u†¹4°<׆á‰aÛž­Çâٓ㟋Šï’Ôq¹P+ïö{ ÝÊfÖ1„åÇÅ寉ìr…vÔ @Uâ}œ$ØìÃ…“€wTÚ+lJj:W7¼›¥ŽâS“¬†9Ø " åö4uÞx²÷õSŽµ66»)-}D¨R TÉeÝ }j\—{ïêûÿ<|êkÑïJaW °«Ù Y‹›™…ý}²þµÝÐ ï8‰î`×Êcÿæõ®`ןXïKËP_ú“[ªw£»±Ãõn`7ŸTï†a4#·4ÄšWϬËJ]‘di+õn`·v¸Þíìv ìBw”¥Çï(KejKì–ì"Ëen¹¿Í—þ"“•RøÉr(»t•Ù´k€yg‹™á×ÔþdÄç_ÑŸðÿþ™¢Šá/ 3¹™=cýš\ŠÐ˜]: ƒö™~äÒÇV,”þR“K‘Ã_goø¬gß+ÇáçýA®‚ø ˆM.ElûÃÇŸŸ‚¿€ÜäRäøïÿþûïû¿ùgú½îxê³>€R|~þ‚“Kâ'É}óž\À··ð>%ìû[öW“‹ßo“Ï&¹ÿŒè3- ˆ¿€ää2$ÇñwÉýèžLbœÞ£«³?–ñóO¹ˆáW (S)E™ ƒáÅ8gðž'XÇëñcYïYR*$ˆ¿€•rüK¸¶Œ—ø#^ŽÕÏà‡d‰Ÿä ˆ¿€•’ü 8Nš;ŽŽéÇ÷–é‰/ðóƒß?“tñð¯RŽO{,ÁORXIêÿÌ@ÿ*eù÷žôWp–ÅŸ)€ þþUÊòï=imŽ?]Aüü«”åß{ø¸ßgŸé÷þšã™cu®5Ÿ÷“â/à_¥4ÿ’¹Ÿr½ûoÜOîÉ”Ür[?„·KîÃ{â°OèëõÄìp"Ç_À¿JYþýù'Õ~ƒDþö¯‡þ¹æ‘¿–Ü^¬‹.WÊrùÖ^bøÕ.WKrys2½ qn‹¼j¾@²ÈåxÈ"³;rá„Ãè°7÷alËFxíón»±ü\®–åòçªÿ.WKrù+õŽÎ#JÞ÷ŽÉhèÑqD_ü\®–äò.õ‡߉–mf:‚…Ž _:BØ!w8ÆÈ0Æ¢¾({²ÿqãðp¹Z’Ëo&þ0zlâ€8!%SÞ g8): '·C¾Ì®YnoCo2ö‡ Ú1ZBìwlé‘K‘Ñ|Œ_Ó±? Ý0¼Nn&3J¸ZÍ"aüü«•KCýCß.wàÅ z'Áì 2C°єzHswˆÄ"Á9Õ±L5aüü«•e?‹ý× øW+É¿ý“vô:úŸÝïÝίíãÖ1yÿ;üØ"ËþI§KþýïF~f£>diœÃûwÒúí¢Ûêõœ´I9 xX+ÉÃí³‹Ó6 †btçýv«wÎ~óôò¸}þñ€¼¿ì“óNŸœ¶ÏÚ}8­ß9`¥[½Lk%y¸óœµºÍÑxß>m÷gü¡Ý?ÇÊýµÛ n¿Ý¼é4NOÓÊó¾ßxÚâå¥9nw[Í>6QòmÓ~PÀÃZI]­‡Ê?= ½‹V³_Z¿µ@?ÝßP»›ó^ë/á$ø‘7ÎA]^å´L¿^ÀÃzIÎ+7tãæe·u†íºÕ»|ßë·û—ýùØé³ÞÚkum7[½7ä´ƒý÷¹ìµDý8½€‡õ’<|Üè7X-pPz…zsÙk3õoŸ÷[ÝîåE¿Ý9MN:Ÿ@Ñ Aø˜õ“Î9S+qýÑ xX/ÉàíîïX‰¨é¬O'-8ÞÅÎÊÓï6PÑ{ýn»ÙOŸ%íwºýô_/àa½$/Õ˜œ·>ž¶?¶Î›-DÖÁ|j÷Z¯ÁÖ´{xB›Wö§”÷’©öuh ü*Š¿€‡õ’<œá±fˆHûiÿÚF‰1‚ÉìµcóÊzEó$îȵ í^ÀÃzù9ågñ#ôþÕKòo~Ý{ö/¨ÏóƧó¸ÓË3“Õ8>ð™³þþÕKòo´X R#Ÿb÷Ò½Û$,!ˆ¿€õ’üÛ¤~þñ{þhòóhö†®Å‡ÿ5?œFs¿„?_ÍÞ°ŠßR) XX/ɧ“ù0:<ŸÐ¹`™Gf¬Ëõ)?ü¯áÆeIA¶T £€‹òcâ-½ñp±ñí×wÕÅ P@ÆFŽŒË -`HCÝDhmÐÖ”s0i×$Ü{÷Ó0û4 Þé Ù9C‡mp"Vkdb€Wê$ˆUÕ5xÿÏÞõþFr#×|ö_¡Ä@`;vÌâonHÁ!ù,Er-X–Ië»Epÿ{{Ô³=Í4›’ϲŒõîhÈ®bÕ«÷H6ywýá¡ý÷õ&#Ý  º3€ºžY?–º½Ï»·dî磢ß½ØÝav}…_ˆ¹¿ÿŸ·(ê»?¶™²­îùK ÿÛÙî ºº3úãù•›|U·Yµî†·u»‚¸ÎŒÿ .ºn\<éÿþãf žYÅ.|ž*þH,­@©ë†ÒmÝ® ¦ó^÷çâ÷–Nß\`©˜±ýzµ{¹í”Éû<ºwn6ú$P‹PÏ75O§)tæ¤?—«6} 'féŒW16˜™˜kQø(óÎj}dõ³÷Æžìn¯MÿÝïÛ»ë3Â}s±j{ÏC,<óO‡olžqÍJæúÃÌýKoËÝÓz«ðËèa,ÕvЙ¬ÓFoâbe-¦¸jCc°íÙlgœ=÷bAy»`¼XŃ/]îFªÓ¡ç ¦Ã¡-P$›P:I«(] ¾‚JNåºs¨ûM9ô\Zl0léò»-._W?¯+4ÑÐÄ°BCNÿþ›xC»©…Z^»wlÿZS[¤¾»Ž÷GO¾ÉåCïœwN·Ù+Ô œ™F9Cu¶˜Såh¤61„v¥Ž·I 6Ié<‰phöîì¸Éð1ƒWG°#ؼ¢ ‚it¥4…žIòïßp¶áÍJ o²Yû%æéÚêóX¿ðIœ/¸øü· ø´r®>?0à úR·›H,\,9Ü3¹U,Ê i™ä3^68en'Œ|Ó™Ô´rØ>ßž´r >iô|™Áç¿iG+Gdàóá¤þòÓíýÇ‹éèÚiWâ÷¹|úËÉßøüçáŸÿÖ“ú|©Áç¯Mêup)F¡ƒ­‰J)Vk¡ %íde:LêÝQÃSVwgëù†Ïy"ê‚œ`''U½Ì¶h•E¨T<ÅâmlGp3Z9eŸàÈÊAôü ¾FW F×Q¿"8­•A½GeœùùÏÝ4î’q<œùõÏ¿Rq~…£2¶ÓÊYô쬌pÒA‡§NJ¯dŽ€$…ß)"‘ÛûQËF§kÆ3wåè :wtÆ 9zöÖ MT+³ã,EÖR[MÈŽª•^ð¡½Ó5ÇöŽiCZ9yƒžŸ¼qÒ‹É¿ýìnž®Ç Ês2%Zkbaé0ö¤£`–œ"¼ó ­÷l*J+ÇtÐóc:ú]©tÏÏÎèkt¥žœ;ÐâX/¦•*èÜ/.Œ]\ü¥³ç•zuîh‰W/ÃÒÊÁtî`ˆñAZ9ÏÎçðÌèÉæýÜý‰jþâÞ—‹O…aĬÇGÞ]гC‡Ë§ƒJ~cwêîïâ*Žì–3Z‡ à¹ñýôûiÏ?½•õîwߧ p–ÛC–§¥9ÏÞ/6Š¼k³õûVlAs¶ì÷¥<Û“Ò×’S?— |õI^«æ_ö=_=[”¹8úòWMì7•?>ßø÷ùÆ¿Ï7þýª7þ¶î•7Y¨^eáKOóÏ×ׯ0lb8‡>›wãô„ÖÜJƒºƒVþk÷ÎÓ˜“ô“Ô˜“>Yö唉—q~¶¸Å²‰¦e;in'mnçàyxn‡7·“—íä¹¼¹²l§Ìít!ÓA;ï—í¼ŸÛy¿¹«e;Ws;W›Û¹^¶³É3yr¢›e;7s;7›Û¹[¶s7·s÷Ú¼}R&OíÞÏíÞo~¾‡e;s;›`jçqÙÎãÜΖ«Vwí|X¶óançÃæv~^¶óóÜÎÏ= ´˜·xéfÑÅMŸ»ó¨¹Z¼·oø‡ÆŒª}ôøÝÅýÅwàø始_§I°Çi{ö%¸ÕW_ñn±ëÓÝ©q:²j?™TPÕéâeÊÞ'©­°©èä%+˜šÛüÇi-÷‹oO·éçõŒ’lÒÒãH¡-$;]³EçÔAÙ·9m²øbç¿—Œ¸ü´îöþ¼-s¿±Hí+U™bÈÎɤ„‰šHe—#³<ê÷Œ-³\ƈÚÖ“²B%i²ÔžñÞ³©Gþ9a ÿPøÇËø¸;®·ô NrAyo礒‰ž˜QÿFÓñ½[:¿I—|{ý᧛‡¾Þµ°R‡å˜kÎFåPƒ¯YÊì…,íðøÎÞ§ùÙ®t–TÉÇŒ̤¸h¤ˆ*'CÐ##Dq.¦„déAXhV‰}ÎÔ&w7˜qyƒœ}€ü¾BÚö¹1+“²uð›l ŽóNe½æb“Ê0øÉFm,‚ܹLI‘a“)ú*]éÍ°]<\îNxé3Ç *BIm²6&·Ö`’,ÁØþ˜\v}ùaw}•:1K»JÐZV¤»¢äm4†Då ÜÊá†ããåæ%ONK¶’“´”+”Y ™£ñJqQÒÕj'd²¥ªJ –ÚĪ×IÔÚ?¢“M[`sÚ#‘¼ )*8Ò»$±o¶õš<›5:emªZ=1À ‘)¢¨K*¶cfú†hZ_í” ¬’BêZ8 Š¬Pq"GNŽ­5Î {Q]°è¤ü³ŒÅMך qè”ݾ‘.3" ÉÅ„(;’òŠƒT®˜ìƒçcÇu˜56¯2R–È48,29©¥Ö®íŠê4ãÏwm©ÿÛg —L¬‚åÊ™…"Øà¨YĆVšGl©’9Yø':c©Õ›„N¦füA‘%LÕ”Pª`j…æئ“ýƒùåËÛw:»–)´=Æ8ïak†„ÓQçš,I9äά]d­G`´ÅOë¼V¨ŠQڜŠ¹Âœi§Y—ΰ Jƒv¦Æ„oƒA‘DxUtXQ^Xo3¸‰-2ü¢äb>¤-V\^Ý<\åNcÀµ•ˆì@¦À ]ξX° ÝPmª4\aBÞ·-«Àƒ*’P6L/FôsûSWØL†-SW(ª&$K7šëPjGŒêHé 1ˆ¬Õ1%¥tÍÁÛò1¡;aÌûòxïïãÇË«Naã™ÀT Y2ÁÔ¤ƒ=µÆHF i úO¾½H‚"@EFYH…ÂT¢›¬™¥@'é@K­;çU 1$ª„x׆P±•)#öèª@ñ•*‚i$#€­9+ng3­ñ÷ÙsÕ_¦IxDçæ@[CŠ5$ Šç‚*7”þ켩Áe¨=…vs%Î@t¢ôƒv›qóPî/Óu¼ùñ‰ŸvrbPí|ÒªíÈŽ1JQŠ’CFÐBõ‘qBÝ×íœÁേ~p "Ìuû§Îh«µj6€_”(±&¯-ˆb#ÿTuØÀÙ©6 r«YBL³Qšr‰¤Tÿ´À“E›´¬ª(ÓÍ’H¾x GU”V3ÀÞE`ÏYU4JP?ÉCÑêG-ë¯{{6Ê ·Íd¡ü`;rµZ,@2kŸŽ§&zø€‹ÈD }àA ÑjªÚû’Àr¤ì–O6m)?@2ASÁVªeTÉ죖Á 8 ™ãK©ºˆmËň8mó”Ê¡ÉÕ~sËûû«Ç»©”Î nM!%m}‡ÇÖfP€’U<¤H´U œ¹Vgdo†Ó”Ê$Ž ]Ù-=íîBí¤„óAdWò ¹È J’HžËPúlhó¼)—‘ÛKn½â]°—VP-Ð";ƒ-ÎP™  Èàц  MP£JÞÇ„Ô©¢›åÀ”‡«Ÿî®Ë&]Æ»­ 5rˆ÷$¡’j9Nœ½·Å°õ‰ã0‹; :7~e}N¥h…áL¨Öà)lX ßÔðª3­˜Èhe ¹éøb¼Be1Á°IÛôøó†Ïzt²©cr¶J#}@‡Õ)M‘djû—¬l/ê […oWÅ5Es3‡ °ŒÐp›fÁKÝØmÕ4ÓÓg–„°C— BY Áš<@$ >nøYh¨á³¥$]•ÁCÑiöø“&Iw=f}XÓâ³U0 È,D´ø?„>¢ÆàZHJë’¶J;ÕÞ¼0*Tó Œ2D AÖ…X8r׺U¹ ¶ß~±¦AÀ©H£,GOÑÏœªÊZp®ì"¨27°Qoá ÊQ0¬›×1±³·ª•cïN™ZD2·‰åRíƒq>n¨W#,F4h©"ô‚.~šå°j‹šÛHñÑ`¡MY¥6¡éò¾€á'…:žiP¸.„j¤¨(÷¶&¡K-PÜÙðøîüî|áowÙR›†³Z È~ÈpPûèä‘wû9ÔƆ×ͺ¹]›–ß—°*Á“òªÍ/¥ZY¹¢g †?^–kPÑFÐÁeßæü(Lô{<@wïzùj%rØ·*ª­ls¦Fx <†“ÊŒó§ ¢JU%§¥Œ"mˆ(gPOeXt‡M»—6»Ì ÞWA¾º É‘ÕÓV‚¤8[ÍãX£‹¤€jºf¨Ú\LG zuDÍzÍzšlxZèÚ·0Û bd ~[E‚¬±­àÇ%¤ñb]2A«@Ú9_­l¢.²°$j0á½òdk¹^›ŒÜK ¦J)(Ÿ!0½jóÔ`­ÕX‡úZd¶-i•½H•”H!I€ÚƒÇÁÌÊid§Ónú¬21E T©‰BMÈ´¢Q…¸”àGz<銂> ÁÅÛƒÆDȃC%¨   AA“ ‚þÿÚ»îU§ö®Û©s¦ zŸ®Ë^—ÿÿ×[ÿú6Ï žÑ‹qb³ÍµæIœaù8jÌó l'!J¢Q\Ç\óÒ…ë%¤«'Ñ&fœhž€ÁÁ·$‘±ÑÔ€ÿ AÙ„§Ó@S+pÐBCä l…SA¤bWþA.\³]Œ^y„ÀŠ¡ýlœ’e„MKk@ä™Kc/™t‚a‘z v‰¥¶´“Ý®ÄiÆ’\+X(‹†ÁM•ø ¦XI— 3×I)„@›ìÁ焨Vk0ŸVÒŒk‘hçJ;$ÅDªù‰:UD9Å43 ˆDÅG‚ W˜9—‡2œ‰mì"âs«°$&˜ˆ˜‚»ò[‘3Ý U O•6 â Â9î½ôÔH‹´Õ`Àçs)iˆá=„wÚA(;õÄ0ËŒiép»]%Þîk®S~+„¬à$àrÃÂ2P®’ÇÆ%8Ñ•6†¦Dš™Ô€Ž7DrÇSpty…]a eϧ‹ŒyA h6Çàÿ^x––›Ë9Ð|ZPõ YRk•é„f`LX`‚J{£ù<ºšåæ#(uŒ¥ 9þ€à¢HÏÌËj*­¶«†Éi–€Øið㉇Èßk¡Œ\É4E!-Ýqùx z‰9›NxÆ@ŸCÜgÀ%‡À†BL8ápp‹[•€Þ)æÌ%,3pæŽ>JùÃsÉœHŸànS̈ÒàX*  DK îÆÎ¥ü3x2õ"¶OdyB¨‚³¬tMw~¼¾ì³Ìg†sARÁmÂm ¡,˜@„^:SÓ>Ò•ýL Œ¢)kž@Ë&0WîÁss9ÆZbEœ’¢Ö<gGe,Ž%‡è¬¼’=ÒU=§SBØ„ ¯\Kž?ÁOhé„MûžjVŸËRÌIƒ'–€ºAjH¦ðüÉp„2'Œ5F€ó Ÿ·©Œ‰ô5XµÁÁæ—^\G‡3‰ØÇ‘,1#rÌžùDÛ,•IÂSÃ3Kæ ,Àêbõ1³™÷`#ÒØ%rÔ†Šé¸œÓ˜>A,·Ä›úÂy÷ðQøx¾ã½Ì>9 ÿ—ð$e#ø¿x²n‹ÿ»Ž×ÿw=ø¿Ê´í«û‚sF·œw-wˆDÙâoñ€·xÀ[<à À^þïà|®€VÝïM>ïà ÈïÙhgo’_lk­Û–s,_I¤ÖN;“bHq9ø×:Ó,.†[;4õ#ëz#¬ÒE€Ê2–ÅX/ QqŒõ×÷a©/º€ ¡×|wöå4ó¹ÓãúÐÇAoí ßP|6Õ~`oà;óOÀï¼x½9òDQ9øô“½g0P½.Ê?ŽðùÊQÃçÚ¥ìjNƒæ6Ö8»±Æ˜ÿŸ¥@–ÎRû˜áÿS`߈ÿÏS’nýÿu¼líNK5÷£Á¼ÇÎÅOƒ~röŽ‹^õ°žsÇ÷YWÝujFíìâ‡íÚÏÁ‡”ììÖ•võ‰¿ë}Óûñk„–ñ`T©–Ûû œÇ–3– w>wÒèÕÐîá1ïæÎÚ r•íÞ«ÙÎ>üïšF½Ñº±£ëÊÜÝÙEµU/>ºÓrÇiŸî~åìN„#º«×1‹®ìuGƾ?¶ªu·Ñ2û5M#ïÁ*p‰mA•;ÑÁN´;‰δGÕIÞÛ¯uÜØw_¹õÜÇq¹“<Üß îr'yŽÿôyþü†¨Á·íkHÿƒ{tûÚ¶åö1Cÿ§úŸ…ü[ý¿Ž×^|þ™G.¾—á#7Ÿ}êü½ÿx踾ã]? ðçý7ŸzòåO]ø ÜwßC÷ÿù ϾÇîŸn?reïþä_>Õ¾ùñýúg|ð/Ý÷Õÿ}ãúc³7?úüS¿÷áŸ}ãg¶}•y ­ßy5Ñ8/WÌZÿ1OFÖ¿€pd»þ×ñš°þßÿ~<¬ÿ·¾ü¾ÏÀŸ¯ëÿ7nLÔP=7@Ù}¶ôl®e:„;jwpMq%2<ÙÅ=MÖãQ›j<=€§˜aÅzwÝ„»ž3ÛFµ;0ÈÚ•èõâm0|¯7j¶° ¡÷±n ߤNcŠ08ó•-f˜{R‘ãè»ôôÍç>=Ü9Í„õÎ)RañéJpŸÅ:#ˆ&ž-xj¨r£ýä}ôÞƒu?ìDukôòdú·2ô¾ªsà¥î­;C’2Hï©ÜÎ|–xž ÃYx˜ŽÝ cæŒOc³¼IÜž=Úa.œ³gs¸*Õá0M¹æqFbÁƒà#•ÜH|—SŠ çà0Ñ+áñìñ??g‘sùô9[•Ú‹pÖ(M¹Í(žmÚF4¼MœáÊÅ.›OS¯†„+‘”Ùó‘Àƒ<¶õ¡i‰=óéÞÊiۛ듣#ȹ²Ä‡s5ï-ï ™ü”óµÃ°×©NT¯á*™ª[3ÔÕ a Ô\òçCVºäíCYu¼ÿj`3©—]oŸ`¬G‡B²Q/ñÚµ‚_jï«?6'*éäpm6…2>µ¹t´¹˜uÇ•c5tW7eÊa‹±„œjȆûÜ ˜f&JdOÏL`gbÑéyþ¶ªF!êw7š®bOšRhï®;ÞÙ›­¶Ï’9št÷,šL$Áts¶»„¨oÖ:Cf-¤Û¹fÍ÷î¦Ø¬¾¾¿ôD?vÄ šX½ /åÍF»]Óõc¸Å6Ž:—7ľåR=`Ú˜ïí;4að¶vè­ƒàjFûªöF»œ>Ύضe[Ù)f5t^ά.lé(>æ.ë·tcC!Ù¸ÎÏäUUß—ˆGOOßãÞæ„üÀ9ðáéÖzä„`gØläÂ8Íntc PW :so¼s¯1I“A T¨X„ÿŒ.væʽZÛ]Þ¼ª·Á¡‡ï[øɆX ”á![Ñjw¦…Ë1 lØ"8 “-ÑãrÂ,Š§é:ƒ«þˆ§)ÓrUæ¡ûã¾æ2V˵›C<Ö4ªôŽ Õ%Ô&í¹”ÚlŸ<Ô^Sú]r \Ö®³x<6ÊFErx“¼b Á„R“9Zâc…¢©¤J-‘±1õ£²* ¼W³Ô²„ MÅc³ë>›e=N“1²O ™ÇèŒËZœ©¿;®sÛ:¯Žêø¸õ;5XŒÇÕMF‰ºýÍ3K­ŠË%èÌØ‹b¸ÓŒE7 —§äŠD\ð9g¦ãò̾ë uÀõ‹ÙB”Qˆ òŒÀ—?DT…~•ÛH¦¬Ÿ ]Ïij[…ƒ€uŽ'&á ‹Ãð÷£C^¦ j.›î7/!u¶<»4ÓÑ]Ê-£K-<=ˆꞈ&YªížÆj´ áŠkžò4º”«9gCí¡M#ÄMØD™ Iܬª©²(è‡,P ¯1¾$^Èz­«Î7xŒpÙt­_5[Bc:œ-ôƒ7m÷¥Äásî®·ˆê/NhWÕÕáD÷)èé0Ýé%F \LTM¾Õ8è«`Ó8hÖ2$S4ðÈé!¿zž¨e^¹l OÔìjh;jÚà69œ]×äwÛ–ÙÂá³Hyl®•£ÖL×t7ƒ„iC;‡ h.Ÿ)Þ·î+Ëzþ•çžÛ øB¾ìÍŠ]ƒ¨]`ÐǯF¯L¡sN¹{¸ƒ» Ú¹\`Öse¢µœ8–%š(t‰á²ù&êÔŽ¢PÉG¬Ýüišå»íÃPÎèÃPÞ†¯1üß„­ÿ—‹”%Ûç?žÒk‹ÿ»üßãz} ý»…þÝBÿn¡·Ð¿£-ôïiAÿN±DKCýMØp$z®P%óÆ0?¢8ËDê¤a‰ÄKçà Z6X]ÒËPÎ-F·(U“¸è"iÆR“î}LxfYâ3šJá#Y7 ºÈ›ÇÿV‚ù­Jò…ÀÈ2™¦q̤^Ä^*éb«™„ÕO›ÍbïìÑöh¿Nî–@ «HæEXªœ¤”À56Ò8[j¤T åœÆ<Áb¦9Xº|\ßSg·Gò2¾«feUò.ÂJᥧ>ö†H#'Œr"bN½L’åb¾ÎM¸•HÅì©÷¥b^øÞªä]¾—(Ál&c¯³ ,¯wÕµ*ia#xPDXÐÔ25Â;ª©¡4ÕFë·àç{¬ÁÙX†³§ÞD lÞU EUF-"–0m%ñ‚ÆŠ™Tp+2Cœö*•Š²ù„bɈ¼=6ÎlÞ%Àxçg£9‡wVK@ðVe×B¨Þ†$<DóÄ0´ã\(F w‰§DÐs ÁÛ“¶ÙóïÔUÑw«Òö4ÑwK¨£Í+Üš[‚UTê.Ã6–*üÂ;×U÷5@²i%_‹‚ì†.6_7'õtü~3Pu‡G²HS2V:Ä(b<ÑrUL£¹ãÐz;ʱƶ0€[À- àZ`»cî[,à&Â.w^¡Ç‘™Mh+{y]ŠZ½b‘Éí>Ì¥—†·×<ÒWTqJÔÅü€{'«þ…p÷Joï±¢|'z½óÁi®xJFðáó]ÝÌ;pãBcEÙï´~iÔëJ7Zª(XRw è NñÀ¯ Â@ö)†>B"ãs7½â`mp°’å^°õFAUµÝj‡°§nW· è6„(ÍÂc Œ®¹¾1 ø]aç5‚ËoÊwÈø ò1çâÚGÝú¯æÕ>ˆ&v~;ÿ¼ yþ þZOª»C\5þá|‡TØÿ³w5ÎiäJþþÝníVì{$Ígöòê'ÔslàÍnm¶ü43‡ ¿ožï|û·Ÿ¤`˜Á´4௔IÀ0€hµºû×’º[ B@äQˆ‰kSرù¾3œ$>‚+xÅAȼ\D¬ôK2Ó²¬× ÕÌú½V3l;–³€ú¶ú¡mÙa;´Œ-Ÿ?*ÃÄžO= -F›v~­*d1u‹lìÑÐrxà{Ì÷<œËs˜âGÅh˜Øax÷/ÆZl6íú:löŠ#;H"cX.÷,Ûá p±km¶jŒ5-¤è[˜&QZ¶‡ã„ñ ²idó˜{Ùye %œýhó5cfã÷¾/#nûIŸ§ZCgÊÎu†Îá bÂipÇ¢˜86÷ÅK—ø¼ž†<™¡ƒ{/ hcˆ)3×+{Jc‚ž0BcZÔl7æ¶`Ÿç¸n½²§OfààÞÅ\oÔL9¹òÓ‡±vB—…®ËŸ'8"–ãG>û¶G Qèù†¬\g؈ØQ± ê/±…`ØŒÛÆÜgõÊ¢©\©Öž1¦÷j¬‡E¦=_ˤ…6³„*:NYh!ˆCD–caNܚʑmîݺƒ•³la¯Öîf`à.… è™-Cn™—“›Î)c>a}1EU³çé‹lÁæ–éè¾úÑ>Ï–’çõæŠË'¢«á`}]ª}ä ,Ä$Ù|¼Í“òs–ÎYÌW;ÐlÓ`Ÿvqé$ š¦ßýͧZÛ´+^²Ï|Õç¶ò|rnnP›OÃËx|!0ë`ÑÂâÓë¹G¶fÄIWµˆöóöÐ 1±k d0b“­‰’~”†(w”Iq,²`çôÒªíØØYlG'3¡ÚŒX‹Íh%'TÛ¡A©[zù Kú5;¢>oh¨\mˆ`ºØ~®Ã’îY%ªjkøKß²Ù˜z–kÃþ…Œãš÷/òS‚d¤WnL6d3¤fÖ³Íx¶l3àµÚ‡/y6SñÂ:ôšZ~0`çYÒË„§Ry•Ò‹ù…PõMùB!4S^žˆŽ?+ç½*§Æ2ñ· èÅEõÍÌæ-nLÇ=¡ãzUÊžˆŽ?ãøS4›ÇgÛœkªõ¼. KSv]ôØ7¥ß®Ðo½ìª'¢ßÏŠy¯Š©±ˆûpŠYsé|»¤ÍjA{UÞÀ|Z }°±åÜuôtCøéP{±Y£BØÍüå³Þ?v½‡÷œ¿eß=ßœ_×m—­¨²g]|“õ|½‚¡OÔŸö§h#4"R‘Ó¾É-¹l;îO–öå—d>P–µÑm9 ¾^"îÑògõ¼WõÔˆŒy8õ”±E%?\Eü¬©ŸM™¦‘ÊZPBÛâ¬BÔÆö¼„Ôds ¹8†ŸÓ]aÃ,òúˆýqj‚¾²1ší"dE%dtI2 ðUÆšH²^ÿ—ÌMÊ3ÌéË’œ²§çÜ÷;Í}¾-Éÿ·¢pnä7VæÿÛÔ†±ÿOþî-þ<çÿßÃí9ÿÿ~òÿûiÊϯ,݉PWé:ÈŠ“?§þ?§þ?§þßUêÿfSâ§=®x<©ÿË)Éúx(¾¥Ã«óÁ(dƒÅVÞe×´òñ ýy%¬êçY‡ÄõZ}8÷“ ïñ¿%L>î§g!I(<ÛŒ9Üc‰MŽ˜‹“Äa §î´2¯3M~[¾pA8µ£„¾+ü‘$ðËü‹7œüf¥Òdz_™ò`­Š`)ŠÔ¯0×åîå}z7š=[œ©2”²*¢ÕÝB«IÊÎ/2E(\•S»Bιœ½Yù|w1i^|n(æµR‚p.WÓ|ƒJ e Q²Ð¨ÔâG£ÑEFüîöËWëÞ¶·gš¡E;h§‹ YJ·RÜím´ü6›¬öÔ¥×·|L5aF» ÐnëÓ~ï|wÚ5ù>· »EŸo#|wÚÝGÌw Ý[‹ïê0Í?y:VEA-o“]bak#|÷ÚýGÌ÷ =РÝè±µú±¥Ã-³ŸÐcŸÜÞäÍŒ~È0Ñ¢ͧ›ÝÂI¹båÅÕÞåhpý™Ç)À—5‰$ì³Áñ÷œËü” šÑ€Ö³ä?hX Д]jœ5g õX¼7Ê×ÏŠ×*ÊŒ~Ô°¨)úwÕ]<î.Þ+×g¯äãM£ÔCú`ÃZÀ¶]›|ùïÓ:ôà†µÀMÐó×_Ýü•=ïË®wÏD/>­A?pX à$ýèºÙ»A'âÙq?Dêùõj/»–ßßL÷ÐÍ'IýÂÒ€Ö¹ŒþºÜ QN'÷Á”V¶œ~ÙÇOß—:`F? “hA¦¢¿©èätNÄýjJëp9ý²¯7ª2¤À_¢‡¿(“–áœþqÖ‡ŒÖx~ñÍéG¥Òà/ÑÄ_AÇ{EÍuF’ŸŒ¾7J®P~}F¦1òù'Tì€!ýþ=ü•ô´g”MéGZQá^~\è€!ýþ]ü½A½ ºô/tÀ~‰.þÞ V}ú‹0¤À_¢‹¿7âáf[=ïÛK®/\ÛͤæÓö´†ôøK´ñ£›ËLî‡âÞ÷ÝŒnÐ%ºy•Ùú¾¸‡è&½AL= ]ßš ÈÌéð—èâïßÓà'1IÌþ.¾ºí¯ÉwV¼šc_~yvÕ–],ßØÍŒ~ `9ÕÄò½ÑåuvôÇ‹½-áX>:öÕ Çä°´?~Õ½ŠÅÜVÍðÚGvs#ôXNu±ü¡ø`9ÕÄòô•¸z5æèmw úŽùÖ=Ð`9ÕÄòåI”ýðj2=FVv¦?DÙþR—ÂþP® Ëõq#?Ð;UGW“zôXN5±üb÷“~¤6!ˆÉóªe®õDn[^¦£?û±<-Fn¾‚ÉÓtÕŽuMþXN5±\R|Á'¯×Sú,§ÚséMÝ é°œjb9Þ)©€ªÊ‘˾,u.®Æê4M–ŸÄÄBkÍìîp4Zß0¥Àrª‹å(Ûw“½’ò‚\KÅ]zÑOÑDÿ‚§;kóÀ_ª‰¿¤ÊÁ炽™ò_(s|ñ¥CPƒ~À_[w.fPg¦Ç{™Ó௭¿‹¹‚Ú]Y©]-ñ^° Oûl0žÛReüÕþoaÐvÌéð×ÖÄ_š¨&ž…È®,IÚ¯UpPÈ%¢©#Ãø0¥Ýäòv:ºM8ÊÄj26¦À_[w.-ø/Xüçê¶þûT|H¼‰ö›šï„¸¼(I™!ý€ÃŽ&—…[¨ñÞi§õAŽ‡­îéÛn¯Ý;íµÐ»ãã}¥­ÝVççö^«û:<–ú{€N»-S?ÎpØÑÄáýf¯©¸,B/ˆ’rsÚm+ñoõZÎéI¯}|´…Þ‚&¤)ÞWzr|¤ÄÊ\~‡MÒ~ÜùU2QJºRàúø¾%®w¤ráéušRл½N{¯Wü˜èiï¸Ó«%ÿ€ÃŽ&Ïŵ޶ߵŽöZ’²cÙƒínkKØšvW~ 1ûcSô÷T‰—Ôu1ò©)ý;š8¼€c eˆPû5÷nKÉi&³ÛÎÍ«ÒŠ½÷¹"ïÔ´?€ÃŽþžòƒø€¿Ž&þ–£èˆ‰¹@P'<Ï 6ì_^ „;=ÿä4ÚBÎd9Úzôøëhâï¬Jòx}ÌÝËðºÎ²„!ýþ:šø»ÇãTøÇo³ôEˆ<ç*»¼“_þûÕ«ËñU¼“¤ò(+Åø õ@aG…GWýñ«£ “ÑUô™OT/æ—w.³ËïżlÚ‘ õ°ØÕŸoèfH?€ÅîýÇwíšuc·Æzé®@ÈKµîññx”~·x‚Üx û¶ó9;Τ“â¹+o5=ýQrsWØJrä)æuèÉuëÈ€î ”XÑÉy~„\)](òÌ«:í^°(-œ!h ÜQ‹tÏ.~5éê`‚»jîúÂ3ù«Ët@oÔ“—"Ógç½×¥ÀoÔ£Þ-P¿4²¿fG<ðêààGë4 uOg³»ýrƒÐkÆi¼u§1³Hk¹n~9`×hz®íF\@ Oo³É›™ëãåyu¤ÀϯѨ¿Ê®Ïm„úfÕF|ÏBϳpäDØí»Ü'Aäá0I(±ã eYå°ÛÇì ¿þ:Jc™4•iÉ?ŠV)gvÜ©‹ãÐq³£XÐB+Â1æ<ðyXIV×ff»²@’œíÖr™ã×XñKJ:ÎÛÉ*¸Í^7Ðí=ê§ù§hÀÿäƒ-ô¿zƒÀ,Ò£¡ßøCS8z‚: ŒA9ñóº‹æÙ›ÙÆ©b¢|TƒÃÉ`ôõ»¿%£tÊá 7H|ú…´]âÕË—[šTøØ%ªJTõ§äE.ÍÅ/fÎÓ@ büã¿®F“Ÿn>M²'yK[º£@KàÔ ÀÞ®ö(ô“Ù Ìtýçttzx¨Ë}ÀxÞÚÜùêZ4'“OÃzã€Bàk³ŽÆÜLy€9Al„Qrè憶Ÿ°µÚ”Š÷Íå ÞâýÍÈ­&^` 7\¼_;4®H÷ï¯&çóºh]ß›W ¤r‹÷+tÝ›Å@®¶x¿,SzÍ®6±â}}ÑØÏ}~)sa[0”‘ÕÆV¼_G/WEñ¾~gOä°Ëºs.¯Íz·ÚBŠ÷ki€°™ ô3c6¯Ô¤re¿gfNÛØŽ½˜D‰íPžø¡o[.ö(‘Ñܲnv¡ÏìoâW„‚éZ" ã²çZGÅfþ« ×Åc>;F¯Ñ‚ö5P_W¼jŒËF½žÝ24×æ^â[¾åE”ÇòL›ˆã˜a³ØVƒ6åWƒö[ÿwädc\Å:ãöC\S^ÐÈq]—p'â~D-jÛ§ŽOIìGÌM„ôUñÛ¿k‹\¸ \æ\¨éÈiÛWÁëÿ4[—‘´š3u42š@b4ÆP%A)•ùþ¯ÍHP W§÷b·±ÏœXXj‡x–‹ŸNlËqȦŽç0(÷¹†Ñ`WaÓ\ì§21µÙŸ†ÓJÖkmhqhïÇh‡ØSæƒÉ²±1Y†Úæ&;×-$+¾F?ŒKF¼W¢Ð‹b;°)qm‹rßM–9¶ãZž¸;¢Ÿò·r†hsrRrM²®1ætEãÌÿ-O4³Ì@Ö4&UøÓRsi˜ïÞköbRby[ *sÐËó„Ø <›%Qäʉ,ZÅ®m‡ ¥,–ÑZ¢}9Œæ`¤_cREùÇ6@æ5&Uïà[ÀC Ë<„oloƒ,ó6ÌÁF*ÖcG óÓªû¡‰4@N6¦eD×mÀÆr®´^£,Ò•ûHEP”ù_âjvV„ÙZ…ŒiklfÕXn’‹1­ÂÙ}-¶yØ–Aèž&ù@>0.åëJ>`½ËYºz¶°œ:«ÕèÊ<,¨×sp$–ãû–ðÆ,+ ±M¨ƒã€±H®ðÉúvÞÝE%€s~ì8Vl“À Cá&Œ º¨Üa\Üþ»› mg ÈÃveñ.3²ÎB+,]½òÇp)LSo€¬.\ÎêÒk€·rª•^£kFóP?òc7ò\ßvi"œü8ÂŽÑDžæäÓ8£Ì$šGžD1Õ›m±a1>JÀ’À±ìÀå‘å…ða­€3?HhYl²c¯”ÜÜ›º©Ø­—ó¹þùì«ÌQ?»`éºÇÝóÍ_Îd’ÙÑ»†vàr°«³1½toý\ÓOf׺Ô™»2"hµáU’ðT— À…+gè5 ¸d®¾K¶‘ ?»U_L a~Úæ诊…[ FEæ—K˜h¿ÿ?|4eÀ : Íoé‚£€ÝêJD'™ŒtyQ©¦Ç€{éêmo,ú߬߅î/Nns¯X.Ã|²ÔŸü+º4.Š[YzÐlp\`‹¾ºë%Ã"B~.k¡°s³©€½êlzœÏH¦r(Å«×|wÖîtZïdq!hÍNOW4€lìU×ÑW$ŸÐÔ-$nHü0æ–°À \æDœR› ÜÍŸ”é)gc–ð3!SË@ýGvq¹Â¿(ž)Ô·JÆE›ÕÉSÀ@žö ÖÍçb–ÇÜ €I^u ½,d:ßâõ—¬jÄ©h2€„°Û}ëF¹¿+—J_TW½ekîæcÿøá1ýö=E½hK€„^ý¥|)Ô’ƒu}´E€SoùJþ Ã݆ýx€+à-[Ö×\Cðd÷—mÓ×ávÅèf_Öåà¿_Å]°ê'Ïp>Þf èxìàñ4ÈÈl'Û`Øß Kí»E"j¨Ÿé~·¶ÐXìW±ø¡Ya´3®ÍŸ} òí|’»8óøõ—ÁïcP­Mvm `Ù_ËwíÔ +Ðß \™ƒ*;½ wkÊA%² ¶Üi„ù‰+™ŸõÝ…[]†Çbd¡â ¶K¤¢âJ**ÌöÚè7 dŸâJöé=ÌAï.â ÈjÅK²ZŸ¢±×dàòËcü Û㻌"Ô×\ÀŸ©äõ>V4»® &¢Œ—¤(?AÄÔäà2U2 .½4s /iI¶õs ´ø@€Lnb-Oxxãmb; [N*¹åº^²Ä‰Ucƒ¹ÞdY®÷·µoD€´rRJ+×ltµŸ@*éàZ«f\â`¸9I€r²$…\gsòøä®Â( \N¬%ûÜßšP®FGRI…×lv5(±½(–ÿàü†ƒ¬ À¿¥×BrXÄÑWŽ†œÇfr äž“%¹çR.S~WA./Ä|¨Ûò–À ¼õ!È}'KrßWक+LLp{”[.¦ILb—‰©$¾@äº$’š¤œ+1Ú¬ @¾:©ä«k"$ÿMÊG{ë5 ÀC%qûö‰PÊ'Wép*a™ðèRàI)É[—a4”ϲÖk°Þå¦õì¡Ö©Ï»--hfÜë}êóÊ[‡³XíTuT73úte¢yêó&oF¥ hLÊÇ>k5º2‹J#n›Œ…‘ÍãÀI.¦ÿ–ãP/¶#ìÓØ“UéåyÈV5n»^Ä´F·0ã~‰YQh‘ØJÄÄ cŸP 'ŒÃP ãðgQÜz°ºæ¥iÏ’þ¿/¸îB$2ËH%³L7Þ8ÇjlOF_tG€0ªû\§Ä#×H5qmÍ {]º´,Ÿ¨©×(~•L´[}Öƒö/Z¯³óÍĆþuÕ¾d‡_ôÓ‰te¥ýœŒ‹"~9ARP¤Ðö‡ã‰’t“d©‘J–Ú­dç7y¢Ÿ¢gz`ß%Ků‰¹Åk¤ÜàkP’ z˃>ÄÇ̈Л–ç^Ñ—#UI[ñ4‘O¾ÊsP?³1 9Jº ç @:¡å©Q®Þè Ú.Û]лN²$¶N6J%Ç`ÖY³ åHìêBξb^/Úþ¥+ÃQ¡äÜèR:'l ×2j-ç6Ø\á•ëç¿àôEb—m°¦WœŠHʧ"ê5 ØP{¥ ½MÚòr.t[H³˜)¡·5B€#‰½<›ƒ§éèÿÙûú綑£Íüì¿Qª®l¯?€ùÛWy³›Ü^mò¦öÝÔ½W©” À ln(Q!){Ë3AÝdKU–%‘lÌôôt÷| ¦4 ¦È|"Ü»çŒê¦ShoŽì0ÖÖ€‰¹óQ1{à0 =¸;…÷GÏu}@ïa*ès;ˆ[`ƒým{˜xža0À!žˆò.évo  íR.À @½±ñ&/1ñ±Ö¤WtXˆÃ"°·5y©Ý‰ÀK0?‘Ý@xÖé°‡`ô;Šo}§À&@6ó*ˆÊ\ÀÄ`öI·"N(à¦Ø;*½iÅ·sð)OiŒT'&†Tf$8hôcr^Ï«ùèËoϱ)/€'½øøÓ%¼íFÛ¤·eÌØÉ  ç‰ƒž?fÌü,›N'\> Ó$·¶€c4‰Ç(à ÿX¶¤ W#`84H±@Ðw¸ ì<µúë·Eð >ÃiðÝu¦—öÚDc:y$¡®ŸôàúÏš%0|ÒÃ?ˆ|@¾ èI‚þŒØ+ê¸dDa|~¤à9hÃhLN`éI–)ˆö=Àôƒnf˜s@ì±?ÐZÏ“ð|5ÕëTw·ç˜êûÙÌöc}8Ú̘ܯ?huð Zàd[€Üƒn?fd¼h'¼Gdð€QßA¿#·øð7qÀßH±@àô¨$ݾ ç{õ:“d‰;`ÃtHh €ti8 @|.íâsû'ñóoN‘ð™ü€Ó¸¿ýý•?UàÀ2WKí¡ík¥w¿ì…«x¶ÿ°#¥]ïžöŸòË ¢BÌ0í`†‘B{3؇¤ÑhÜ |#Ñ´ÌBÚΆ{9æŽ$ryK´u ¤ž³AÀØ£`:EIûVsCK©àV`åÑÞê£Þë/ßTÔƒÈl…À<êÔ=ÓP¬¸<êýÔÙ«JvR§dç9.(xvüNmÐñˆ<ìˆúNaÑÑO Ñ-½S.ô kyOÚS tìµ»gó¸çÔqëÙr ¸’—¨ŽIê˜#-$)P›’vjS"’z˜Ò!k>L‡¥¤цˆì:‰ãˆ&QœÇ&•M5‰Ó"‹“0ILäÈ«–ùTó¬¢Ç©ˆH‘³"ÖiH Ë· &I.l©·Ì©¢·¥96áE§âö’¢°—=ðíàç0d{ãdCŒ@IR%¹BŸ¢ˆð’ÔÁKNüæ;²×@‚Âú.hövžs\ÔÄ®W*up¨È}P Hi€aïãën;Ý’Ö[ùäa™Ú–€4ˆ Iƒ(+eî¦À×zŽ]ê tÏ|£„ð]êÀw¿”cV ƒ© ž„§“œŸcê`Œ¤BÐÚò’^ ò=kcŒ:€SrŒ=ñ¥¸—ö€{GII|wQü2©K¤î ÉS#hS]<Ò€Øøós Ir Ìs¥`‡€6SÚ|ªa÷Ønôn5M{PÓ÷>Üxe ‡H©zÀÙ£ ó!Ïñ2¥äö½÷­ H•zpÝ#)Ýb §q°ÖÈŒ@2Ó’+È Ä ˜Š!›ü— ï=Þñ`ÆTâh|ûîxÕ_Y.r½Z5iˆWÞîÙ~ uÊÓ»ãàšé"å€#Ó'ô &q Å3Àòd6ð0‡ÀÇýaéh㩹ŽFëLÛ†y€é€9L'÷Þæç:€\ÈáAÀº ›p ¦å:€àMÜÅ·§ë‚’CX€tÿ£Çœk{QBà™Ï§ë4ú €®¡Š½å3|FÊË]¤Ì©t@MxæÔ„Ÿ”»*Ç3zä¹3ªÈ3§Š<Ö]Þÿp™wø°§þŠl>œRîX;»S€}ìuYuðp& .RG@l¢îÎíˆù x2ÓÎò¦LF·$¬;(d˜C!sÿi­ÿÑ ÀKØ»xE:€œ†9ä4 W™ ë!³ñ Xs ëaŽA†,€„…õ‘°`f¼Of†¹aü¹ @ ÃzˆaZ´æãNÈ’k~R<  ˜a=3W×¼ `Ÿa¬›a'':thpB¦æ0µ`x$ÈXX‡Œ©.€è„ñˆ*P…°UN(€fâAüží|äƒõåŠ Âd‘™9JrG©ÈÃPd"£y‹,˪ÖS(×Ä‘“,΢"ãªÈX*’<¢$bRö˜>ÉuÄ¡ÿy—ÎÁdåÑPRé 'Ȉà…Y/ŒÌ˜L/s0½XlØ‹ýoÌö@°z'šÙ–(aæÔ;Æ%Æ‘M^ñƒD±ž’ÆXŸaõDˆ!d@™S¥Ü§õV„Žÿ#½¾ýmùͨlÉžÿþwP¾ó×{ÞYKx†$Ìœ²ÇøAÂꀳ.¤'põNùbÄ ½ -ûµ[c>àßÿFꈽNqe»w‚Vÿ›ÀO5C€V Xœ¢Í^ªñ¿u㩯`=JÑ#x ÜI‡ý-Z4ÄPŸ«¾}ú0›kx·­ñMÈozø ãÆ¢Z3;Z@D”Ãp. (ºÌœ¢Ë‡²£vÒƒŸ?î˜úM¡ÏøŸA\¢ (êÌzŠ:Ͼù+ˆ·N­eä: N`(ê„nÈʼnÁ9‚æ,œÞ]„ l¡˜C¨0óXOüÌáG8¯Üóà›±b-Ö¶€`á”F:W€Ãõ”æÅiöï:ìXÐ˹{„§o"UOÕ_´2Wëe~}ë±Nð+À‰Wä(û­Ýë©ü³‡“TøÔnæç®›ÙžÕ²O@Lì©1Œô Çë­â;ž!;HÀô¨ç-ãëa\,. +Í=E}‘)À¸ÀÆŸ<Àü3óm4Í<ê厘'À}ÖÜ?qžÈô=wÐ÷'Þ>å:Ÿ‡C΋8€ÍçÝ2½8¡Gž°$‚²L:ÊEÆOT!kW’$iU-ó9a9–,OË”R¡S‘G4É“6f5°Ø•9Œ<'¿Ó¦±Ê²…Ü)æZÞOc¡4¿H&°öÜÁÚû Æxhû© Ʊ`{€í¹¶÷‰ˆ“žGààêžÕȬº~e¯i!; ä´=äç˜øÛn {$Ñ=$cN„ ø¸Ã€\"üÜá?˜º†ŒÜa ðÄÖp²ÏÈ>rw€ìs²ßzã®DÌë’“®|n{swÏÜ= ڳãŽÏ@…Ǹr€€;Èépp‡`|·8=”+@úÜé·Bcy`{V=:F`¬?w°þ#/r¾$p`ËP!ˆ±=ĸ¯óLFlLxƒÂýç¬Þ˜dð8p‡Çïô¤Àar˜XÖ>p‡ðÁ?o¸x÷2sxc*qÙÑÅž)t¢‘É à=GÐ/›ÌBî ­ #àÁ¾¼=UjXÚ p‡P`äÑ;ËÿRòçM€6c T;ÔSÔg°¯D`±à‹2 #xaÄ„’€½÷°7ø¥ïÈ{ÀÞÎðÀÖ}o‚€·÷ð¶¤ÕÇôœp¼‡îäºö!èhæx‡f™ $sE2wA@Çú¸3qJ= ¬á€P$:wm¢=Xå^2‰ð8ö¢)’óà©‹ÄAR@«#©‹8AÈÿ„Cþ‡Y_!AHE‡„)ôp0Gà#AæÊ× BP ‡úð‘ Þ…6‡³;G•ôHЃ…Ã9®@‘`Nœ GL›ÂaÚ´_S#èu¦ˆŽ§‹ G ÂaèÄ-@l)bË)–€|R8ä“žG%`o{#n¿RD†":x.¾ 'Ho”?¨DˆÂ!@ô‡¼5rá—få‚?Q! p±†øm‡Þî‹Â~ Ï"@?'ú¹/ùÆ}€»Nôp×=â>Pù÷!ê=ÑK½‡ùšµŽXú„ÃÒ7…lÓûrˆHEi Òé„~¢‡ÐoRùÀ(¾@ÿŒ u :ç…Ã8MÔ‡æC¼€Âá<*€Nóáøå¡p(‘Ö ‡$p_Æm©uª]Q à߸#ßÊÈ_F_JÆ0„G´|¡å›@HuÇÏ+À}¡èC†W€OôpâM(¸¼{¢‡wÏ/´ÄxÂ!Æú6 °vØðBÐåáùo áÁ[èa«;[@íNË¡¬5à—¿Üè[=ßcFüvÂá·;ÇfB·k^Œ0 ÌaÞHR0¹ ‡ÉíIú°¤ ™ÍÜ#’´¼i 0~8|HÒÃú²-‡™äăÂ!œT’ Ð ‡ÞÐ7Éx …ÃSˆLr"?áù=l$©èø„CLJD’ €ÂN8vHÒq’…Q‘¤` SàÃD’ €P8Ü€hG°ŠvÀI¹z€µOô°öy;{ öÞaÝ=§z˜Ü¾F$©ˆà„ÜA’ €NôÐÂ}HRÜ ‡ä99ò9áÏ$?èðÓaûÄ1ä;Àý&Ä€ºµâ 7ÚÎôÊOö!Isi‘‰ŠXÚü–±ØÌÛDE K©ÖUËdùˆó I3™2­¨ÎãXiÎYn’·„›l.¢ŠéBô!IÛÓ‡'ý›pèß¼¾*ÈO*ö8á°Çùu“Ž;í¿@.?F4á0¢¼Õvãºm9È°p}‰×2ͯ„ÃxuZ¦˜±„ÃŒ5м'ÒµD‡P )‰Ö×Ò˜À„ÃöðAšXÍë4‡3ìKh~ƒ…°ägÂ!?{„hP&6t(ÆpB>/áðy=B4ǃhh¡@{„hŽÑÈÜ„CæöÑ<Ô¶¡£d¸ßÝýßðó‡hÔ{¢‡zo‚M€OôãM¢ ðÛ ‡ß¹@øà„Ã7©S€uN8¬s¾g¡œˆ»Û È@€RN$Ý”fLˆ&@E'’#O¿‡–æéìlÃâ’Æ7ÑÃøöÂ3J9ÑC)÷•Á3ú:ÑC_÷ÏDåbðL€O fã›< ñ‰¨ï?Óô¿q° ‡UïôPîðN+בõŸ ûÎ6¼² J‡›ïH€EO:,zž)j<éPã@¿x¦Øò¤Ã–‡µ¾ÃqZ†Ý8}0Û†¢Ñœ<’hî+EQŒ~\¶ÝÃñYI]÷uB(¦3º‡ÓéÐáM?ìèá,I:Œsþ‹šq¡ ““.”Á›ì!x›PöP¼I‡âÍ7w¸Þ¤Ãõ†ŒÝ ›tXØ64C¤pÒ!…CB3$À 'V¸Gh*™4C|{ÒáÛ{˜Ð P÷I‡ºïèØCÞ7)WÐêÉZ=_gðÒÉ^:¤»ÈÖdÙÚ×Í[›ôbk{ Ð p·Éš!&:é0Ña''B8 qûöQ,ÍÕ6EòÚEä¤Ã 7öðŸ!}ü"Ò$÷^<Ö˜@ï0ûM"9YxeL_ tø‘ù@ª'R½IeKuŸt¨û|s%€O:ì|Hg PËIj¹}·6ÚÖg ÀI‡îËpÔU¦¸{2>ŸØí¤Ãnw†¬÷L¡Í54¤Ê€l„À=J€FO:4zc O%@º'‡îI€tOÒwó%À˜';ŒyHßPÔI6 8ªøád‡)ôRws¦üdNVi.ÃB¥„Rš2MãHÊ4·•l…H¨Š«–%å#8Ù°‰“»1Q´HsÇÉÂ-j䶨0rج ò‘•ÏÐ÷f°Ûw›§¼=¤ºQ IÓ8 'œ‰‚êŒ ©L†šŸÇmÚ-ðÇJ€‰HºLD8±€í;„?‹Ûþ”qà¯?~ÿ¢|Õüpõý?~÷Ç¿þð»ÑÝ’‡¨ý𙺻¾ ÊåÐþÑbõ?ñD*.Sż"Ë Ídššqã±ÝK(GËŠ¼*ÊÃ@Äìй0CÎEš²\É0¢¶R²Š´NbmVO…3;¬x<€JÌ:ÒaÖi+hU&ÖHqÁYl‚t*C™†¬Èc)BbC8“‰Ös®Dâ5”*–¤EÂC–‡2KT–…‰N㤠] Uò}T¤J)OGEK*¬ ¥¡ç4M"–„4‘™2“„'¦7Y‘x …Ž³\¨( ‰ ‹0‰#“Ê4ŒŠ4%Š9²â}$F·P[A•×B*HæQ*Â$ŒÌ„à±Ð1yž¤fV(F¤Üô¥‰×Ðp6VE@šçеUT,µ°6ÄbGJ$IVˆˆ‹0â”HI®¢”JªÎX‘xq*"R䬈uÒBé[RB’ñ,ÉdWAVºz€üÓ¡^j«'Ÿ/n4V=Âx™Æ‚³vËr³nÕqAY–+š»Úä¥H¼~⌦9aÒÈ3A;¡™6ëi,_d$-¤êê§ï£ —v¤Ú Òÿ¼Kçh%„QY˜ÉÀ¥Š%¡*M´™‰½–’ˆ¼êK)¯ œdqf\3È#j’© »@4+î‚Jñ ¨£¤P¨ZÔLÒ¡fÂ.棃mNu¸«€ùHv˜B„B€dëu~ÌT½Ø¿²t…@·eØ•M„Doãåe˜^5¸ý,¥óY™ãÛ7ö½ÉDï7Ù»ou1»™­g‹›Ë7¯³r‰Ô\§]­wË\W-5 -,fÛ”W.- fÛ H{áUµRuÓ»¦ÙßaL_˜Ó oÛ 7}‰|_DŒí‹ˆ7}©vvW¯>àŸb]Ù&Àv 9ûìãb¦‚çOŸO<{ZýõÙI‡*ì Uè­D¼ŠZòxß ¼‡·ä$ûû®³WìòôˆAäÝA,w‹v¾#¿Üîì ´K7Ú…·!`í¿¥á©ÚŽ„côJ»z%övãÎbóKb¯3z:å+ÄÉ(ÖmcNY[Z¹¼Ä*¶^JõNçbÊÈÖp1>‘m;õáÄ?õ'©‡“‚ž=íŠyô"pþFNé ˜M÷šÎ€ÙüÎ;.Â;ø¸è½ÛŒ‹›O<{j1žÁóÓFËpÕ´Z)X-¼žÆ[íе9 L÷CŽÑn>¥RÚ Z”ú­ZÃð¶ ^Ã÷÷ë¸2Í ïƒçÑsÄ;zŽ¸‡ž·ë2ø`¿.ƒeuÖeíäÃ^øy“àó„ ´È¢ýš ´ÈÂû°z”u’¦I!2gvþ&i‘=PʨJRIaedÁ²¬ïÖ3ã*ÓBÛƒ£¤Oè~¬v²jµ~T?¯–ù‹ Ôù‡O×ÃmV:‰³ìG¶6|Åákk®0žo®°¬Ž¹¶ ªk0öÚxÿ ÷Dg?A P#|õÂc7”åîÆ´ou€{2Í·ŸpâÓîÄ÷I¨ê@Ÿ=àÕðs `uÕF}Nºj¥ï$‘‡C5ã„Ý{õÞÃn $Äð±/>!ö>B>ì¯7éðæýÏžþáû¾ ž¿ªd¹tѧMy'5ö·=nÉfÜ®Ó|¹¶»EãÍÿXrýõ2fó‘Qö÷,…qk¬<ÂÀÖwÁ'Ëxß5ø”z¨ë*ÔÙ‹þe­oVF{««bö˵>¥C+cXÓ¡ê±™º‰¹øˆÚé÷q{ø=ùCÔÉ¢†_kÁÎà+2^ àòSZÌæÚݮٕ<(sß¹þ¨ç§4£êô¤aF>§'½%/ë-ù2Ïâ\á;xçêß¹GTäÙ1¹K[;n5röžÀ{œ=ùžæL¦7ÊÛ¼½LuFqÚ¨¨såág¶[ìŠD…’T›µ-Q"¥©ÒTǹ‰-yˆYUo·ØaY-vx£mw'¨Þ|:õ%\,ñÈŶË<˜¿Ìƒe¹Ë¼Ý<¸ÆÛ¾÷„¡®³ÀK†ì8ÀTx²::¬Y&Á͆ zç Çawqìs€¼ÍdJ©Ð©ÈMXÏ“EÛ|ÂXfÕÅà ·»¿Îg«õæóÒ|¶Ë‚š±´ìï»?¥³›ªÿIßë-ûšÍ.ÌûdXýÙÁÓ«– ?oÿŒ’Þ‹²½nÉø6]§Ucþk½¼Ë×wËCÒêçw&¹´Tr[évǨݺ?Ø¿ôŠzóún^ f=ªm}“–¾‰§Âû[Rõñó©!½Û$-©[6 ‡ô¨öµæwóù+3œ¶ÎÌJ¿‡1­ZŠuu-)6 ™ |˜’XKIt˜’v=ûM9¯Òºm©OÏÊ 0kÊÉj9™·œV{òZNî-G5å¨ZŽò–£›rt-å™ZrÞ7弯å¼÷–3kÊ™ÕrfÞræM9[›<0Oöȹiʹ©åÜ;ß6+ŠÜÛZî­wû–M9ËZÎÒ[Ϊ)gUËñò¥œuSκ–sÀñî‘s×”sW˹ó–ó±)çc-ç#Æ)5ó&9ÛeYõoøÆUæ‰IÍiƒw*½É?ØÌØzµÝ8›'¾ Œ4“š7ÛÚÆÛÛùÝzquw³\Ì7p֧Ϟ\6¸‘ô¼I'À·;¿‘&YÁ(*SBç$fq¡¢„iB2çДüª¼âúäÅ~¹5=£Z†ZEqN—Ï‹Ü‚èrÁcó³H;rËÛ1O*möv©­gs³x`w³ùgã·íÚ=Di3•yÊçàý2½ýP濦—=×ÍŒ„ìŽè\ßT™¶M|+‹Pó•yv• g‹¥iWéÐîVú:½}{ñ+aelRiÓh»Ø4ÛÙ:AÖœ=ÞoÇÂ/‡b½lÚñ¸F_Æ ç ëÐoÞ^XÎŽ¤~Ïûåâ-3éê.3Í[U{ÑÛQœÙ û¼+½jåSO3͘­õõe9¹;©¢„’4á)¥±.⥱p*J#QÙñ­ö*ŒLEal" ÛCP{èBõ}ª-™ˆÚú8Z::K&¢³²ÎtÆkúŽr¹Ó§2MEe™œí–½ ›Ê¼äI3xf,õ<µû:½Z›Jª!&’jˆ°£µ+»ßѧ:1•„CLd†Šz†®òÅm¯Æ¦2E…˜ˆÆjZº-ia¯ÚÄTÔ6ÏÖ_ô¡£´©869‘ÙÙÃõÔ¡`Êì”™²žË­›^j¶·ÿ/<^À~µÎÿû”Ï8xþqÊ.þ“‡òñüÿ,_çÿç9ÿ¯ÒßÀnM?žþ?žþ?žþ?ÀÓÿí©í‰=úóñ~ƒïý†ÕÝõuºülýU=¿¹Ñ+c­/ËwØ“MkªAÓJMŽk†•°ß6>´®ð§/«Vó© µïí-¶{o›¾ëÚ'ö&Æž87ôÆ“7·ïnýqamB„ª?v±,Š*jØÙðª«Û3Ü2èŽYuÙ ;pà¹ô •îª|ÂI׺Q²3ø+;°_ÄMgŽ”£´›(ðµ$d…(¢”Ûú/iÄyÔÖÞ‹ueÙ°#¸M³‚Í8zɶ¿Aô²nÂÕcÞj;fLj„…EÈKbøœæyH”b©”B†4̇+3DÁóQ îçvP³×[q“›Þí˜VÝÚ6xrK¥òÂÒ¶… ÉDž²TPMc•hÓ²þÔ˱„m£Œ?ÜÚíøoËÛ:0'7¯º¤ `d¾:>ÆèL&Z™Ä‡èL„±ÈIx’8–Të,›Öx­Ý*ü à ¤¯vÉ\“"+d”],‹Ò4ÖD„¢ÈHaœOk$áÖît]W‹¼×¡ôUïQáYr±8”¢à…y¢y¬YÙñ,Ô”ä‘vv´¡„[ÛÊòÇù,»÷!õUó1CJT–çY˜ÇqÆT‘f,™Ž‰Hxjž¤å !=¹ÎF±¸ë ûØ­‚íbK%K˜å|s¥“¢ ™NsŠY>œ¼æüÝ@÷ˆÄ¾£vŒ…H2ÎTÈ%‘‘ÝÎ)bĄ̂±œHãl¾` »¾mD×@Ù”§^C›­QÆf4Íô7Ï)BJ"©¥-ÿ›™Çnc["o’SYè\ 3­B’1RðlSÆÚ¨³?b6ÖüFÊF·ç’Ñæ’`ðí"¿³ÀÜ ^^*zÒ_sª$õmÜ~Ýä…ó×Ûåb½ØÝúî^¤ª`›WíëËÝ/r¡ûÞcî³=?ý2{ƒn¨üz×.¾±­µÈ77…wE/ƒtÌg7ú@+j¯‘i‘ùVâ¢(ï#?ÞD·¿*¯·ïƒï³Äȇi°q º]zÆš™o£ÇoS_[ôp7ˆ#‡û3¨²jmó¸'hjù©wO{þX‹*—žÖ.GØÕn]Ð=ðøMÑ_}ýn¾È7#b~yì·ÐCÚ)eþC¾xקŒ{Ò…¯&ªio~èû ¤‰ÞŽ?Û« ÷¾ÎÀø‚–›yv¹ÁŒÔÓμ¶ Ò2' .ì÷ ë8,ÔÄbëJˆ‰®^µp¬àvaק%ªî¢6‹WA…·¤×Z¿ò½ÅG¯ï–7« fÕl-?©±aã –Ad_¸YÆJÌs¯ƒé*È´¾ ”q:¹ÃŽïžÍúO:ø”ƒ3Ó¾l:nÎ7Z»§o4QµúÇJ+Û&oµ³=`jèiõÂ(ia^]~š­ô«ê9'r-RšœÑ|;‘k¹}·ÅS®ö‹ÝV„qK×tR——jqÎnïͶIફ$Õ,h——×þ2¢®Œ›ìʆ¦ù•š]¯¼å…I< oïÖÊËÅ'@Râ·÷ÓvŠ¿Ñ¿¬¡Cê½-²&ѧu·S uÄD„%Ûø«ë²^ž¯ˆ(iˆø—^. =ÓŠ²ý§Æ¸¾]ÝÜ.u>«Dü†nc?ÜmìÒjöíc—yýªÚ ª˜•Ê\éfgtëFŠôôyyowK&¡*£êSûý… ý«Õ,›6ïVf‰ýìlùOežü§lÕ§&\ovvì¶XéÔË=.ÓòLWý®ö¸ÀëC»T;Ý|ú°Xù=m¬më(6>ß|;kòã´"lAð65Ò}3âîüD¶ÃKØÂÃ^éE^~E¦¯¬oŸ“¯ÊÆWézÃ{ýiQz0³|Þ8Ê•Ñ‹ HçÆmw½ƒ§ý«Þ’Ìî|NÞÚfËÅÛãÈÒUy8pÒvßÚ<Õ'ä4«áò|e•9튴´<ÝÄÚ—VÅÏ^áXÇ BÚu°|\Osœö:¸œÆÖÁõrq·FIrÖÁ„QÞY£õ¬`YÔ]Áâ$=®`½W°†©¬`-ÃÃN’ν^jlßeûbµx+7šJân#ÅVµ6ÒÞUÜdw¦moδDâÒX‚ùö§Y}-¡Ž‹Ö2üÃ"¡²1‚ÜÝaI;þ?{×Þœ6²ì÷ïýsت-Ûz‚’8u& ÷:Æp²©J•„­ F¬$츎Ï~öÛ=£'`f„±S&áa=fzZ3ýëîéé*gµE·®PAO„‰›ŸB3þB­mA³üê·ŸמÒü§KùŠR>·êø™6ú/]…ô|[@cYXTÕ3m4{¾-0}ß¼9síçéÁš“¥WVûÞìü‚¸a&ˆ€wÈ¥ùýœ]âRÇ™“Ä°ÇàM2Õìd‡^™äd qB §:]µB>v¿´?·{t³¡ÙÔ6ÃHûNnbUwĪLjB¿Ù¹ï˜Tû½0'ÑÌÄtÎß • ‰5\š78y0à @=å 0€‚þ²‰Їí\û³üs pÀÀ4ÇiÜ~P!¨–ÓŽà `íŽ\ ¤†äÒj¯/J«ï0Ïßâµ;ÍãCöŒà÷wˤÛ?:;=>l¿ï·“’€>ß™z~mÔä^F3FžŠBB3}oêøá TŽZ9\\x³±]™3~"W$*wŒ&Á&Ò8?wr^Î0˜ÍÓÐ"–çûŽ>â⋵V<€Úì›V˜}†¬;ZlÁ[÷1žÇ4«Ž›´s&tlºþ ò-TŸœ{¸ê3°µP}žIà fU= )üY …ž{x*R ‰(ø‹’ùqWýe±7Ð:…ŸÃb/µ½à¨mhóKy-nœÖó!éw¹MAÊ’‘ÝÅ‚¦(>É,1hK&™²,ý6çcùRÙÇ1Dž$B˜í}—Q7Y\ñ¹{ZR¿ålÏ’©ïïšGýƒL{8ËéÓ›œêl¨ àc{b•à\¶.gNÂÓÅFyW_)'°¯Î¶øÕÜ—@Ç-ÊOì)œq¬Ûñóô}¸+C4m7˜ŽÍ›`Q™(~M‰›hE È7;Rœíƒ~6±‘xºˆ8Ú/•V»õFiFå5Ù¡_´LÏ·Ù¼Þµç'×nxÁ"Z@ÞçÚ¼„…Þ«¶¨“/Zªt¯c(ª‰Ê¥^ô‰8¦uAÁô‘,5øi¼„måÔjm~j5˜[dn5áo:·*TÒ‚%[“ô¹•ãb-°5CŸ7`ÅJz 9šlÈod— ¯ñ-a{KŒñ¹Õå/¦x!•gŽy/éN~ît'˜—>~¥`-0_Ͼd§r².7…âb4–Ä'Ú”——¹Mneš‡›£©øê`UÎçÔpL[¨ù‹¡mR#Wð´8Ô ì-÷S&å`«²×Ã눸GBɈÒ;“FA¿ÌOþRSpEø/[â„  «zf±ÛÎÈœÃdžy€“ÿn˜É³1À›ÓJ´pÖsB /,1LDª" ‡bã<›)ºv>~zî–ës7ÊŠ”£eË™þ¶™uº’]É›KDQ µî„¿Bùø Þ·µÖOéŸÊpzðÅÊ,‚ŸŒewÁ'u™Qâ ÈüèDO°0ä217îäÊ_Áð¡^t6íOdnm,ÙFúí¢}ya^9,µ;m쥃Šx×gg¸;ž—2y³NãCàã1!]«-hëqA6®c~¬'DYD^¢s‰§yQ”Ø&Øðe[f°—m”ó"º ‰îe¼K’_z6F%&Ùƒ™uù ÇãlgÎda¼? XaÙa³BÇ´m*~Ìñ’³¸¬Åõ&b ,HYL`ú DC;ïŒ4žxŒÑQ\γã„î-« à17€gãIƒ7•êwÑ9g(s¹hÙÞ|vDÛ£­jܒĶB!Oüí¹Ÿ0ØêÈ`2è$Š€ãY±(N–õ&‡mÑqWVÒmÔì íÇñË™¸áä5H<øxjÜR×U¡9m{hYÚÕh U£ÊúÐiÈ:ˆ IלúVº,6àh§ž—8Î|(ͽ¶µ-ÊŠÔ¹ùü:3™öŸcP'ëü í”’ö86]P{í‚­Æ`  ­–åùv¦Mæ•éŽ©ÀËÄSn DóâM)gÓÐO|ØÛ6+å™úãn„+A&$‘#ðð¢È\|î9ØÙQ"¿’´ZÒ®?¿;Raf-ÊBBú¹Ø\ê!HâG²9†ÎwÀÇ£*0Kì3yÁ>ÜžkCYm.‹|6œ¢@15c±˜³'ÎGZÀœm>i݆7Äy¨ôöª6ß#›·<,'Îð ˜ c±m®˜õ¨Q%%_ Úø¼bê‹“qÖ,tǬ;fðâå(ñÀOË™MC/4Ï…œù ®±ZCÎ5=3±‹çþsšœe^onØräÑpT—,ÙÉádš GÖkúh(tKÚˆ¦ü  y±žØQõ ­ ì6žÍ?öôÜaU¼¬êz²dÿtª>uÖd~ë>€†ì ÷«W4]È‘YÅCßÔ…Ùö¦"…îÕ+ÜèëyÐÉ‹JfäÍ0b2ýzpÅ[^Pß=zLì)Ÿ…^¬×¾uµ‘×¾aö:k”¤ÏéñcÏû>ã®þZ,HŠ×‘ÅåâÄ£>¤ºœúX/õ¨¬.Bä<¸%pgæ•B Që †ó/JJ-ĦãÔfŒŠEõ[Óêõ›Å¾Ä“LÜŽ°DÂÊ9 {Ÿøו´O3U«Ö5URµº>ÒF ¿ƒ¯jš6¬9ŠlIú6å0ÏE1½hð/ü|Ò}žL“G-þxQä·D‘§¡’ðñ¢È¿(ò/Šü&y9vÇçù3oJ£EWq>”b¯Ï¯µ. .¤à?ТÕmÓôåÆÂ. Y÷PÓ’®ç‹2@^,‡ûyʆ6ÔT»X]²UÕ5dtNÕ’ëfÃùYƒ«ž(¶Êó5Â3D3¯$Ão篙{eŽ–9ãn¡±LIGÕMèÈÃÑÐÔMS1•zM¶diÒHβ;‚"ÎË™†,^`GÚÒ”Ç1 4£x0õ¢Tjù“ÎäÊõ½ Ó¼2}—v)/‰H¸pÏ/œ Ì„¶¤·º£(W:¦9O"ep”íÈŒ†;b<ðžh½4]Á­™ö&+–hŽÃ”ü¾ãæ8ðÿ?ç*òô¿›]º“‡ðñ˜ÊóÆ6ZHÐXÿÃ…^у<‹ã}-ňŠWˆQˆBâ’~»Æ®ºbKö¨¦ÈRݩק6™Ã‘V³­‘£ ŸvIoÞùÃXïøg‰ñsDìo£3éqCe“ÛŸ§[iIǼ{Y»4lšÞ•‰¤Î$,½LÜŠS¡Qš¦m,<3SK¤ éLH¼`.êŒ7³Hj 2 ™x2OLR;w¥[g\Tqa¦¤c7»T‚AÝ‹Ô¥‹)sé«W§½ÎÝ: “¿ÿØß=ñÙ߇ãx¬V?„!íáhšâozê©a§JU9ÛÌxû&À(Ê·¿~H’$À˜úïÿ™‰\'rMÒˆ¤¼RõWšA…Gƒ3¼!L™Q‹/ÂpúªZ½¾¾®ØÞxxÏ?¯bêæÑøùõ{y>G |ë ß1œ—ˆ9“#@ý¯t¬J•FE‡ŸŒd8Äš„g‡ž}ƒßXÉÛ_yyý /|˜ iЇZ¥v@.|#uÔèxWñ[ªkµì7V(k’ú‹$kš¦JZM—Á|Áºô ©m¤vÎk†ã›_†fz³»Ì;ÿL_oþqØm ¾ž´ >nrrúî¨Ó"¥ýjõ‹ÒªV‡äƒOG jdà›€|,QBµÚ>.‘¬8ºV¨$ôª?°, oŽ~;+vh£¢þ¸O‚ƒ%ÅH†a°»éµMðZÈA¸vŸ:…J-&®÷heÄÂû „ê$»ùµuaúœÞï7¨˜[(äýÓæ~+q£gÊé´ŒôTÃJQj´l“ë™eÒ“Þº!¨U±E® n©\>\ä=›¥Wýú´«ï‘|},¨XAPÂ4¥ ¼;Á…ã„%‚¦TÔ6¼« ,ßE¯UzæOóÊdG#™ÿç_3´ö?Qù­²3b7Ú7“ÈsÌß¡7†!’ …™èaFx‚VºBoZbl{Ôæ;—Íà† \TŽÈtœ)Äœ@ÂVçÊ8k€ÓOÖ`Þ]ZÜbkfí$,¥¥£u“§‡÷ò¢ÞTgãÈÜŠžjžßrŽßrA†/§„µñîáÛÐ)_ÊvL¤EÙöìƒH½Hèßôb¼'ÃT8‡ë—{Šl×?ÃY]Õ4c8t†ŽUi5£¡Ê–Ú°‡¡¬DäFÛ™$©Â° Ͳe¥Þ3 -s4Rê²)ÛšÖ¥QTIñqë g©\Šªc²”<õÜa*·æœÑ±«ù÷Âñä/ü¼-Ï5¡ ý`“„€momòñß·ûÐÏ7IÜ€þÛ¿ÿþûöoö™}/;žù¬žA+¾Ýƒ~ÀIB‡ô“ä¶uKNà×¼ý}@ÿj±cÑû þl‘ÛoH}î ¤Ÿr’È1ú{äv|K¼ˆNÞã˜Vs9ýØÆo¿Í5 ý22e!Ȥô7)ãˆÎÞ³˜ÖÉrú±­·´™.T~þÊbøKXo™¤ô¬ ŒV;G?ü#)ýd®éçà¯,ˆ¿@ÇGJÍ £ŽöFßíW$:žÐÏF þþF² (H?e1üEz: e1ý$C+ɼç?s (H?eQü½%ƒ:EéÏ5  ýü•Eñ÷–´×§?Û€‚ôsðWÅß[ø¸Ý£ŸÙ÷Þ’ã¹cUÖk¾íÅ (H?eaü%]r;eý~ï>¼-rëÝ’)¹Ýg²Þ…÷Üú·Ä¤Ÿ0Ö«±Øa@Vœ~þÊ¢øûûoŠñŒDöÿë®ï"÷¬ø+žèpr´ /8X.‹bùÆ^ÅèW8X®byË›Þø8éDvZ»„º2N'.õp„7äÄôÝ`¿?³Á¶¥^ç¸×in„~–+¢XþTüç`¹"ˆå;Ê>y×?$c×r&³ûôs°\ÄòžccÌnBÃö ÌhÀ%a!„ºô £ (G¹³8Ao®G?ËA,g{vú¤ß}?øÒìµ ü>éu?wÛ‡äÝW8Ù&ÍÓÁÇnüûßÍ>œ¦Ö 3YšÇ‡ðþJÚœôÚý>‹Öi‡UAî|:9êÕÐŒ^óxÐi÷Ë ì·ŽN;ÇÊäÝé€wä¨ó©3€ËÝ2mÝâmEéçà°*ˆÃÝ÷äS»×úD4ßuŽ:ƒ¯”Áï;ƒcdî{àn“œ4{ƒNëô¨Ù#'§½“n<µÃN¿uÔì|j®!‡88¬ âpçøKÚŸÛÇÒÿØ<:Êvžwm`|óÝQ›µ:Ía§×n ðÅ¿ÖVqú ôz`þQ™ôOÚ­þhÿцþÑì}-cïnuûíÿ;…‹à$9l~j~€î²3×Ë Ò¯qpXÄáùΠøuÚkÂç}«ú®?è Nmò¡Û=¤£µßî}î´Úý×䨋ã÷=9í·‹êq‡5A>lš”Ë@8tz ûÍi¿C»çxÐîõNOîñ.ùØý H>¤ã¤{L»Uñþ£qpXÄaèíÝÞWd"öt:€ËäËÇ6ïáà€Î3è5±£÷½Nk½ Z:èökõƒÃš §Ý˜·?u>´[m¤¬‹-øÒé·wAÖtúxA‡1ûKÚ{J»Žuxø³(ýÖq8‡ce*ˆHç=i~î`‰h‘ÙïDâ•ŽŠÖÇh WÖ”?‡5ñ9å'Ñ#4þj‚ø;EW¦«hY@hž—æÄÎƸ½nremö.2\~þj‚ø›î(S!_"õrx³Ž[¢ ýüÕñ·åØ>èÇïØ’JÈïãð5;\‰ÿk¶? fveäÿ~¾¦ŒßP+8(¬ ¢ð‘7sƒýcÏ“of]8!mEz¸2e‡ÿåNÀ.‹²¡Vè,ÖÅmâ ½ ÒÏÁbýñ㻪ÅÀc}ŒÅ å ¤®¬S(¶ô°5¥ÎË Ï/½ýÍá~O¤Û?:û šp·wö±Ó8¤¯@ <)qµ+ˆw¢ZŸZÞè+ðf9µbÕr`B_ó,ˆÖKPÉ„ûŒy• ”BÅèáˆ}}…Ø_EOºN}·¹%ßrº£êNB\a¾-N8GÒëÆ£©Î¼õÚ:…r¤a}…4\`ñ(Î4µsvfMdz߻…8Wç·ú Kƒ?N¿;7מo—Þb®]’_ÈÁòï]¸À„Žðû_34öU¬)‘ZÏ‹TBþ#X.GªÖÅ¥*ú:ÝQ±Vqi½° «–#ëú¿±Š“© wf“¡ª‘€z*[²uW““ÇTç$ýN ”Ži&ØÊš?A°s4V=n“~35shª Y²u¥f銩 M»¦;z]³%ÓÆ,¡Øhm¡Ñs«¡¢f'ûw&#×n 2ûšo_AƬê@Œ±uèRì‘¢iuc¤Zõú¨6ÄÅ䲎+côd ŸÜ2Œñ„¾³ ôcj†:’ë¦:TëCö†öÈ”dÛ’,ÝÁ(dL}cîlsÍÈ Ì`J3{î‰p‰OÎUÄ"AöptF^ù¯¨èY¥!ÜÍõh…åo¦ ­ÄÑ1j8²¤k†l8’4ÔL}¨ê¸†i3…vG€î¥x¸1 ¶ê/¹‡=sAv«t#v* ]פ!Œ,©î e8²$KR€¯Êhde§QÛ&v® Ú•aø´Ã9z£±Î\ƒ£üëX¶G 3D|¿Õ½nÐÞ/¤ùuϸïl²¼ 'ë§có&Íö· ‹ÁQ 1ßï&_Åü-Gõ4Vã9¸Çl ±Lˆ_cX–êòPcX®u³Ñ¨9rM©;Š3’@:¨¹1ìÚ³K:ŽwXŽæ2Éð²2²+:²8îc…»`ŒÑ”QcØЇ†¦KªlàÞ?¸ëaÉ#Y®™yƬä‹p‹9Ê€ÑXG@qœÆκ‰ÆŠBáüVK=‰“ãί-õ>9—žCèþÃ4š©j;éw ¿‚ô¯†28¿ÝROâ䔀ó¹ü?{×Öݶ‘¤óì_Q^[ê{[çÌÆÉNö$ÙœŒsvöɧ¯ŠTÒŠö¿ou ÞÔͦf"SP¨®®®úªúRõÑÔeìf#“:«(Ã9óxêtæRÈÖ(×&E±è8|»°ƒš9ÜrB\ßK€ß=Æ4Åœ;f¹’’xî-©‚°®ªŒRRì)ˆÎMÜî£áú=[re$“Y¨X˜jæ2¯2Æ°ò`Ø)å 7dŽEØÁ‚ã–c/àú.Æv»#„ë»Ýîkàú·àÛÝ\ß{žð—"™ËVV;ßr{?þ[ŽžÀÝŽž8 ôûZð–ƒ,ðÒA}í!Æ0)(S˜§óL ëœH…!™1«¬ E«†j²2rk¬[N¿ÀK§_ôv[&¥Š T¦ÂÊŒhD\–*J53ÔKBšÆz6| F·øj¼Ÿ¯v†Rf‘5H2m9•`›u&3F˜^îé5­ÝÅT·¤ñ~~תAÐ ±ç_ D5gã¤E„bâ›­ÊgúP­jqµÛŽ×8H4É‘&˜dôUy¥•5"ÓÒRS:k¦àÔåG`íÏ™¦w;;Ý–#9ð¶#9Ñf/mÆS)w¦‚rˆ‘”IÏ×t¥Íû·¸l;ÄcÓAŸš kˆ§JXˆ’I–I̤‡Î´™÷‹­=”z· –m§¢áb‚§ðh(|A qèÔcŽšÉ’|“}îÜܳ|XH'¢-'xàm'xÜÃœ–‡³6î( ݨöY‰òäÐÆÓÀ3<¬ku?Îßžé8åYÀ«56Øâ€Òójž=’oiÐ D>vðu­í<”ß\/3¨ÕˆZûlÓ*í.ÞÕú­!ÁSŠ×œÓÎé-ßöÔEwùî˜Ù,×\yö%ø—CŠ‡õsqâj!@q–ƒîc‡ þ®Ã²Ëb…HÎÏ«…›¥ âJŠ»8ÀE}€÷Øb€·Nôà;M³t×ñ‘ ³2VƸº`®ŒÕ*€.’e¤«˜¯”œ¯’ì©ííë|ºk{;­º¶7ÖmWùÚ­Ô{^×{¾ƒÞ·çK»ëýN¹×îj‹XÞ—Ãa rau3¹‹ iÍcõ°!»çÄú;²Åó/ïÕšRwm„ìb¨Ûסtrÿ5-›e[.ÂY<¼JšOn؇5Jóa_­%ê"E”u5ÊËëæö‚äà –›,i´÷粇SY˜­Ö ûfk—Éÿîfk£³>¨ù ç»,ÌW8Í¥·LÛÓ˜ÝeºKJ´¿Ý‚·%ši¹d‘>:;‡)íëI»Ã”vZu˜ò©]¼qi,˜¬O…'²Ovq©í“ûÝur×…ýõòf܇bÞ*|©¶§6»Ku÷4év¼¼î©ûKaÈ:0¡r`Òž(ï.ÔÝ’îŸx ËIi#;DwʵNöÈí0¹¢~(ÏÄYÝ3ñ]²›ísÑ=¬ìîóÚ;dàæÏßoàBy^Q¾ ¼jŸ:ì.佦!û%ï?}Œ²Åkd[üJ–U•½BݲÚ×]9=–D¾¿Ÿ•ú¿Œ®ðoù"ÞõqXMjõéWÐ÷ˆËcý߇ø9Öÿ}˜ú¿ƒÉÄ]ÎÀ—žšXû7ùÕy7q#s¬|¬|¬\¬zÐäXøXø¤¶Ï¶Y¢WO©‘Ø2¥¸ƒØ’…Ø{®<Ö%» ž3Øç ¥?eÆ“,I|&=bYªqÀ%åÂÉ$£0ã˜ÏßrZÀùìúZMîê%{¿‹æß\»``è}_-¡/vk75¨A|KEámî(ÐÛ¥Æð‹·7KsÏp¤^n¸~$ûj±á³›…Í.ÞR4â¨a,f<Ô ºŒ²û>zwbê+RÝs9Ïn*qÏWŽ5…Þû¢&Ù+rílaek/„'Sw}®œØj.”bÆJ„i† ¶ØA@î2|ÉÒü©à©ÁM„ cp LÆÓÎO’OåŸÑñ…±Z‚Þ¾Bá×æCz<Ž7(s ÌÝÛ˜§®´b±p")gWBï¼N6¾gžJ¹’ÆK’¦Šzø¤!påaÓð5[~OñŽùß1· ŒÑoÖË?wàÈúêßÿª=ihJ]Þ{é@ƒ²ÔrŽlHhÍ%÷ ¬OFãÛ'ÔÛíÜ6{áq:»½‡ûJ}ŸV–°ŒeÊgŒ½p…¹­QæTšyºS‡à#yu/}ÜÎoSøùͤœiN^>~Ïö•ö>=ë½KµkD,ò(K±€#E"–íÔ³÷#Â{Ñ”öö/i DM¶P”B_-ÀÎG?øëÚµ÷o_™ïÓ¿YÊd˜Æ!N3L± ¦Â!l ¡ ðX§ï³îßöö79YL¾&/Û{²¯t÷éIN&Þ0Ÿ:…¨·q$˜$F Ì2ýļl;·M¹W‹òž‚ýí+é}z5ÕT¤6’(•Qí,ÃRr!4 “-Ÿûølo“3žŒ¢ôí¼}Å A¶×ÜzÍ”È ¦3i=J‘ÌŒÛIQôÜK¯¶3Û”ü|!Á½õªÁ÷†Ù i×”¾½·¦8©(N xIf2ƒ¬ÈÂ6È)ËY~Ö&¥½ýMNÂä©™ŒïWk| ãù¼ÐÉyÚôÇÚ7Å=!Ý!ÚïÙå{Å‚,›t™°~qí¨qª3f‰Î¤2Ÿ»zµ·U½Ü_ƒŠ.¯[}û{ÝÒR1g©3ijçÌÐÌeœgSÖ^|îºÕÞþUݺ™8ʺü¡4,èÓ«Åkç Öä¦]³úöö>š/È[E(¥ðVšNSñ4"£6=¬fU‹¥ ±.óà¡2 ÄhJŒážWý9‚‘é•q÷¨Yíí_ÊqWsç—}n>}nð7»ƒ½XÜu¬Ê•œ'â¥jNÏC›G%Ÿ¸él2‚ÏÉ „ÂaÒÍÝIò2l]UÉÍ8½øå7Á9¨ÑROM«¦*É«‡§I±ýÉ2 [”ìôâ—ðÙEðç[k‹ ©u­¬îQ)äzùÖd[ŠõÕ›3\îÓšß´`0¹…ÿ+€8pKhÖiR›É¬ ;î ³QèÃF{ÊÝÄ¥àŠvýZqÞ¨,3ÞTì[ËÔiñ²â]{{tšâ“ øuôèG~ôè÷íÑk##îFïβdÙÆ5×}PC‡Íf‡æ‡57ííãâ‹­~}]r°…¡>Etò,‚ݘ•hr¦ ”w æ¥ÿÛ¼7@˜8xùj±· ¬™Šîóe±§ôfœç=¼ƒGìx6ýæÁàN¡·5¤¹º½ÃS€Š‘O®‹Ò¢W*¸C»BÎ.aœþ°j-ŽºçýÞ»[íw0ã¿ï¬?ÍVôþæ¼Ãv„Ç3çÕ‘‘KÛCžÄfðÑ9‚ ÏØ+ʸÉ-T/X2 Wó9½¯3r—ö5É$/K7òæv»o^'^ ÁŽáú$|sÚŒ²óàuòó¿Dÿ|FPæ†Ç˜äÓMÑgG÷Ô¢Fbá1Àêvš‡ «qè.ƒ#”7d{ß z¿2ºf"øuŒ®1q—˜¸oÜÙ!.~j¡g‡ÝØO*ô ;ÙŸ?VyÄìrà¦är¸XD]1ÿOéRãÉ]<w[üõ¬²Ç¡áP Ã~=_Ÿ³& ËW’°Õ GßõD|×Áó¹Ÿ{¶Ã™nOÊŽYØ'åÅŸÙº©xÒá3N ¶æí ¿ª»ü°)c¸î¸Uwð6@S0Z¶Ê›ÎF![0+ÚršüñúÈ gÖE&ÂAÄåæÙâÉäeqÖd 9žØºÜŽ'$·ƒéUçI³•ù1g} ÷–Ú_¾óçxðu@gÅÎ@^SÒŒ._Gô딹ŠèïcLH§Ï8ßððÅÙ¢ÕYÄNËî=v8 á .üÛë$ed*dÁñ&a&.nQˆ¼ºyá“Ìhå7ãQ8|5õ0?»´±Zo°nê¹ÓÊ´õL״὇͞Ç¿Þ!Ñ•âh˜,«dsÅPÏwk`ö§gÖÌfíÀ]1M±HvoBÛç´ºF«‡ç+L'DïfÇ ]'Å1Âýmx‡ófŸ  ?äâí¢KŸ/ÙݔͮrØEF»ÌcG„ߚ͎:˜»i0ס>„ k®c`BU³á4œ5sy˜7v£Ph±{)½È¤ÇWïhûëTqP°éÝú8)0Y2 ÷/³|ÐËÁ.À¯c”rŒRŽQÊâ ‚õ÷—q ÿúó<ú‹[·mÇ}LÕ’=8èP6âñÀA8 ãU²SçÊ÷À¥ïy‘2\ áãËÂÿ;SÂè¼îl(_—ÅÅÜç#Ï´ßë‚âÞ°¨^¿Âðºäbúü¡6oÅÀ~=_,tœê?bª-åJ"†¥%ÁÙt0ü˜+ï€ØxûR¶nu¨6ô™ç "žÚfìxÚre¨G€±å›×ª«°O{­¿ô“ñõÂó›ñõÍð®–BÞàø—6}7ò ðæµþ-.õ.^“_gC[¹Êd<Þ%a§ùÒK„Ùä+vÔë›ÖqÇèf6­ÚRÎDÁÇ‚L6ò{€£ÃBø8 í\¡‡Å1¨_ÏgñÁg‰¾è­Ý‹šËUaâEÍsàâÈñxÚ(‡~5?꿸tr.ÛÚ‰Ëó¥ oó ·‹‹êé`:~‚ÿþk6LˆLD ¦çLœó,¦·çNZ_úÖªBòÕtzs~vv{{{Z–°?O.ÏêÅÒ_¼\_.1‘äóî¤zâftÊ7Lçß÷/¢IŠÅÜácÁ2|U4)\­ Ƈ—\¼øêøóÿduᬬùþqõï`cá_,9ªÿ>rÉèW˜pÎæHЯ„ˆ¯t0¶üÌ‚YH’¯´Ê§Í6Þ×vý™þ¼ýÛûÿþöÃÿþò]º<ùå·ÿøñ‡o““7ggÿC¿=;{ÿá}òï~øéG°'(ù0Q€ `Ró³ï~>IêVì–Föá׳¿-.?¾™Öž<µSl[|á_×ÃQþn œeYñt¼ðüàÌ'ÜûÆý9|zwòm¹iñCb*›ÿî$ éâῇÀ&wÓw¿}øþM­ã ‘¿ùío¾ü¯¦@§5:?|÷.[©âÛÒ;üþçÌMîN…í‹+Ý´w£€çËO×ø­œO'–“èÊþ+=OìBà^T ¾ÙŽ“pbÖÄ]?¹"’‚›^‡9ÝApÃã¼@å«ÿV¸î9 S?¨Jí¸a¨¸c Nyw‚Nâß7àË¿!y;-¸ APjèBí¡ó„‹›¿þ~RO¶ºX>þfè<Ü‚N¹».îIæŒÜLÆ¿ƒüŠªêüpGéûC  ÆqÍëÉ:ÍN!’— ‚œIªˆ¾ŒŸàŸÊw7"åß8@qEÅ º p$ØPÕxOÿ‘ú4ßâ“ sͬBÅÙ°öípOI’áàbkêø%¶÷â't‹öÿ¢.]ÙÊ€QÞžÁƒëhù‹€„~žÝ…ˆF…V7h¼WSU0ó¯ù&õÍÔª›ÀÐÑôdA=„{Mî¾߬%õöl6,CÞ²W›ò& y“ž_ÏIÑÆá©]ZWÕ¹Û¡…t‡öãîÃa¥¨NH5eV­îïC%˜º•à†¬ó» ‰5„D{ªA](_ÇAøQUl©>Òuº"¡û0u¦"aú°u¶"aûpu®"ÑÉÍÕ¤NÂW$|—u—‰Ë>$uƒŠÄ ‰aÄ\]{ ™ë:‰ëŠÄõ楌3J’£Šä¨W7u7‰›>$&u“ŠÄ¤‰Æ°Ë+ýlIÄ´"±Åz¯’˜ÕIÌ*³>$>ÕI|ªH|êbÏj¹Àu €ViA™Yšq 8QÇæ“‹†lò $Õƒ•‹)ðáâšüuòIMöÀGR·áƒ•¬ii|‹Õw¯æU‚8úÈðé.Ñn8ŽIþó’o.hm’¦>±´PLhø›d”¼$ 7‡vñ…UÄ*ÕZ›çs\•Ó=B2Ë=á¼A®Œ1\3+½W–bø ¬L$Yd†_lÎóq\Dš C5÷–i/<5©aÖ3aSg…G¦"xUL‚Åþkr_¬FÞÆ|õ®°=— åu˜¦ò^¤FI¤)çÚiJÃ\Uý][˜¯¤aàšSF¸N©VŠ2 ÍÁÎ` ßcÚ”Æ:æ‹EÙ]$/5ó)™’iæ¡x¶ëTX*ˆH{K^(‚3¥i“ÁG†3ã ·NaÎãí’/ƒÉ–TïK=VdN¨Ì$Ó’ ë½ÔÚËLÊå÷u>'4s)´B+±ycdêNUÖ.ýA»îÌÅoÃæ!-Æ™Â;§´C2e˜Z#˜ê-~'©Í‘$“Ê œJJ„ºLãñY»ø«4xöAÖ\bÂI¡ÇAKRÔi‚(Juoö»ÜÌþM¥Áô>S\¥È¥X:K@m93qã]*Û_3íò.9“4õÞi ô(aþæÓÔ¥ÚúýÑ:ˆ–mœùÚÚ´š5§Ä+RA=ž+ŒRád¦c VÚd\lt^C˜QëiaöÚ‘Ì*0¤0ΘIJAuí¨˜ ‡]¼©Œ7 8a1e™40$°Æ`ù¤6ZK¦ JÛ•ŠV&)Ã@‰Á ‚ñ%”UždØS"5õŠ§¶¤·¶ëíù⌨””’L ½©ÌQ«ámn²Ôôåc #ŒS›z+¼X€0>¥HÑoç¼ÜæÓ…u‹ˆ¶òSEŒ É §½’™Â¤·Ð}ÊÁß /‘åÊ…-|e)·Ha#``·±ÞîÂ*α ’„#¡Ét³‚P–!®•3Nôå\{N Q­SKÀ"PÊ EÒ3bÃDävÎ;˜ÿŠõŒ€c!Š;¤I…ta¯$\ vÞ¿Y’zaRÏÀ(#€+'[ˆT+ë‹ùÄ.ì;ƒ8ƒ—iÆ q„€¡;Š sÜc$p_ö;ÒÛÈ~×5×O ±iF½õ® o£Àh¦IŠÃžªÚ»¶ðNúÑÛh·ú­Ši.dJ$t*óž"úÉ=ø¯L€°Pª\›€þŸ½gmnÜH.ŸïW Ê)¥•1 0Ø8[å²÷.N|¶Ëk'•J¥TÌÌ eŠàäÊJ*ÿ=݀ċÀ'$Ñu[93ènôûQ”³õA®P!6\iDʦ’DˆLâ‚nâ2¬ß†\ÜѶ'@¹yÎ}¥q5úÚż“!äéñ}Žîé@ƒ×Àq\€Ží×öÀ°AŒ9ƒìt@ ï"7T„’ñ®£oUŠMlJ|N%¼Ã@êÂwàNHWÌs„ãè¶MŒµy ð8À_‰ÿ"Ž<û°Áß¿ëˆÿ:˜ìáÕâ¿Ìöé%þ{Š.ñßÓÄçjbj2îÑ·u÷`aŒÆZeG]—°ð%,| ",|°0pùyÞs}X=|`þ6_νé¥{j‚•mZ¤Œç÷Òu#Ïe,CªÈ× Œm×kX†Ôé³ò†ÃÖ#:Ùg]×l‰eën aVñúe6 k5·þ/IõÉ>)-UV~ˆ•!pŒ» i³µTX™Àž˜(Õb^~X`ñWY­D‚dúÏWðF~ýàßùüä šñg8ËÔ6—0 šÕBX¥’žæ"¿T&‹E²á½Fm_Sþ}ÃHÛž!UXVúRã)>w®*@-8[,kGÇVã­1èZ¿:xš„`uëÀ*àTÛT‚ MlÊuè)×öwBd~¬¼¸e£u½9‡$¯ˆ‰t?nã,÷½He0 {ÓR ÒlF`UHIˆí‡Ú—ô"asÅÓçCZ¥3ðáÐÖýÀM´Íz¡m((GǪ’мÿ%qØÍh Zq$*<×–Òu¨àÊw—ÜC¯ô´„§Bݧm‚qùâ¼ÎšWov*îOp·ØŸá¦“ì†B}náp¶¤A(8·ê2ˆ"P?5¡ 0Ž ÃݧmBþ”îÆíPxïƒÛÐ¥’ÛaɈ…ʱb+!€Û~¤£ ·Ý§mº‰ŠÜ«IVFxšwø9 ¥¤‡~d3•û¾ ÀqÂÀ÷ˆ'í€hO*&5 wøÈȦû´›ÈæuSÌP,îC1œ`ê˜ï —qØ- p~εÒLE ãŽŒbºOÛ‚ÈSL7r‡|ä*I B}®=øM("Ûs‰r…ë„*r»O»QŠˆ(Riz/æsñ|ŸFÉl‡/™GôÔ6‡âwZ’ppÂ¥öF%Ñ:ÒDay¬ ‘ؘϵ-+G¡Ðn´±°ìª´Ø ·Cá½n} 쇻”‚>+x@|›jÇe®ò#ß!} ¸í†Aó4uÔvcu(¤÷ÁªKCê{JÚa¨Cz.pBö®&4‰·€Õn4O“%´exíÆèP(ï%Ϲ'DƧO#ꄾ-"z\0)µ 52yÞyÚ&ì‹n‚Öõ9u´¡pÞË‹£*<Á©$™ësê‡Rº>Fü¨tÞÂ[Ú ƒæi¦‰ì Æ &9¾ÃÛWŒØ”¶+™°ÑÌåÂçõà@_wÐ@ÄíE$a i¤C8Ò·£lÙ.ð7²#?zDÒ ƒæiLýÃùùÉPôíC* ú¤GBÇ×NÀ}¦ÝˆÃ¿‰ãºÒ}ü¤-¤’L#±86­œ×÷0”6ö¡CÂ\ê)L@6QŒS és;rëï>m©Z˜f'Áu7r‡|¯×Ûò(M$†S@ŸPÒ&Ä‹¸@…1tvSÁ_˜µÖ ƒ–X‡äèonžV´á_=½‘2´\æO›ê]òš6ë»$ZâLót¦¾eÓŒµ•=_mÆÚAŠ­þñˆ*þ×{ =8¬ªZkfa´ûæèšUU¯§­òâƒfóuò½pºé&›ýÊ$ÏI6`Yrï¸d³CUwXT°ÙùH E¥ÕÍ<ÆtèC¸±†Î‚œ3ýñÖÚLµÛ eVû]=_}hƒÇ¹Á1ŽFÛϺÒúü›Gil¦f“07MÕ„{ئ»øAÖ¯Ø 6]Àv3ù¬çêýlf£i63!wÖ‰5UOÙ-ìå3WØ”¥¶SZ´ñ†ÕOI>~“ÞYßë¼·÷<]Ôö‚%~ü퇊FA`þ¯zB¨(1l”´Ó %nâš…þZelá2ž ­LþÛR¤ñ»«1Ƕ³ç+ëûŸ­Ç ã‡7Ùtà•Ñ’ØYf=¨ðK,çŠÔšlìd#„3ЗøJmjo•e?)ëIL ŸÆ‡<Íà`½œLÌví"+žVÁ¶ëôà&ŸshÖp94Ÿë5A¸MÑoËœzÿ^M:Æë¶-Õæœyÿ~ªþèX‹ùµµ÷êkåÕ³…¶­m‚œ­~Þò$Ü¡sk[ðÚ¾I–åZœ{€8ô[kkår6|-ßnõše~î> õSzYñ´«ÙÄ÷Ó††ß9²oEøZy%Ò÷b¾"“0§ÌMVa¡Ñ»®ff&\¶€šfwr‘‹v±èÀî˜.*ªJz:]…T4•]­›Sûª7U$ÌUºœ,âégKÏ“Çv„LˆçÀê ¸ŒFÝéÒQ†©F›Û` …=¢‚ç…Y ·Ul-§¯EjÏf4@ÜÄ` ;ßܬE4¾KØÉÖÌA0cï¦Éôº¾ŠÞähÈ“»»6€U~d,=|Þöç9 ‹üµ²³n[ƒ…–)ú˜Å—Ñ0Åp«m0˜Çîok9A+×ås_†ÚGdÛr­­nv؃µW†¬›²u­Ù4Âhqîµ&ãt&ÑÃnV ‚ú‚e˜e=òœG‘ËÓÄÇ)ʆGåL³”s³›ÄYªTyØkñãMôbŠè÷Úç@Æ35×Éü1‚ÅÉ vjT_Œùàïo­øNÝ™0P”<Î& ×&p ¹RðшÂ>’Ú?x¯áž4Owgý6“f€|…׉‚4žÍ®>Àå,‚«ÅIÖîsÃ"žá«GÉÍø8<é…]íÍ®ŠGäU¸üšQ]ÏàOüRÁÃàï¼É¹ö{Sçd¯€Y}obñË5ËÂ/ÍæêKœ,ÓâÁ ½;éµQÉc³^6ôtusª`42v&¯E‹—Á6õnÚ-"˜»¡NùPá#)6jùs^ÐããÎËǽ¸sÖãn(EZ½øÞ›.é}7$´!“À2¦ÙÊ¿n|ób*"cd×x½¹“¦qZqºÀøoNæÊ(4‡—™ô”1ù) ÍBŒš,“86Ä¿Ññôô¤•-¬ŒM$V¸iŸc âÒ«p‰p±y«pÉç;Žæv·#!Ÿ¾(Ñû+ÑË£êÐËŠ NbŒ_eqDP¨ßšöŒ‘ÖBqW*`¿<•–Œ9*p #ëŽÅ JÀéP‘«Ü´ÝɼLvð®vw8—Å ¸ ½ÆÉf/¹-o9·%#ÌM:ö*ò:_ªÜaòV*ÑÁL[5Î €Ë­¥ÅtÍ]Oqªî.É,C"µá¼JG©€ÖºÎ w×›[Ë.Aù !Z˼×#¼„4Ý­‚­žªë¸´îé1oÔnŽ¤fLÒs™¦-ë÷š=Z)¼‘DÓ,ó÷•ã¿sNq\mrÔëÜYSš-9s2êJZ•:‹¬¯"En1Aq1£’}³¶KësüEM-„Ùe„ÑLE1ˆmüÄúéÓ÷¿þçÏï¿ùöÛŸ>YٹЊ|¶~³ªÄ,‹ÃºÆ "·ÖÓ^kØV>Í-µˆîNçûê“5{þ*{„Â:#§ŠìÇ0ç3ƒÚQ²N›ˆÍ*z0¯*™Nž×O—©ŒÇƒfTa‰\Þ¢¸î/ª¹Soz§y~Ópù°æö¾!.Þð²ÖPïß}ÀöWJ:3¯†è%=†ŸŒÎeji^—þpr©á&»of®OS¥f\°\2¶t2ßäYÕf/ ü²&KÓE2‡…òHûyS‚ûÖ„"$NäÐ4L.oQŠ 2úˆOë™WkN½ò@g^×Á«ϘtË^_° Ë>r¤GK±ÑÉ‘jç¶W&QÎl‘NÃûY‰ã¿ÐGŠ6ò^î¤ ï2~|¹O€*Ëäå>AVìËî ©q×GÍ-|bCÏ¥J±êÒ6×åwðÖª0ô¶Ü´VXÝZRÍÔT¢Ç>Â#dn‚ùé?>þûÇ_L*ÏôâÕ¢Ù‘¬XgGZ£æŸMs)P2Ĵ䥨ý6A-wxϘ´L3WÔgµ¨.jržhÖYöFÿR>exƒ¢žª/‰I-^”9± •ì‘ëc›@?nýô ¦åÔ×æw¯¿ùñ» ð¿ŸþíæÖ¸Á~ûñ»þþÇß­VZ`¬j–ÌyG¬ø1Ïû¼‰¢OLž‹‹gØõ^øzú,'ò®fš˜™Œ2@ì€iú©ên7ùøòµ¶Q2Ÿ«è”E[;`u:ä@Ež‹hQ"¬ìÔ„«+9¤&zóóü¸*X\Sìê‡Þ¿$7Û¯îoû’ÐkloîeÞLø†š¦Y–бŽR’^£˜{Ç?ÅZå'økÁ_êŒ`ÓþÇ2’}ì¸\ŒäNw+«¯Wȇ ‘‚™W· ·mÔ«Š‡ŽVœ»¶/<×–Òu¨àÊw—Ü F™n_òíÇ`ýž;c' ¥M^¸²×j¾‹ÓÙD<§]¾bëº%3÷¦_ÁÀ'¥ª‹gåìëµQ7|LæX°»ñätm}ŽYcPQ›IÍÃ+ ¶î–‘fS%š ”¡ÒIñFÿFˆ+=±~"•À”ð‹Û¼K#°‰WO*n)³ØÝon*KÚëÐvóMÛMg÷Žu!=¦Z-c¹6-ìâœEºÔ ;·úc¦0¯éÌJ™³%†‹ÆáÝçQŒ‡çU Û6ÚÈ!ó½?$µîÞ–}­ä„Ûq»2Û¼[æÍÞ{³÷nËfëo%esEÒ+–Q"îô(ûXõXN—‹Ðå5dn#I³ÊÞVYІr¿m§^LiH}OI; uHCÏulŸPÅైðóú OZc‘u—ßÍhÈ{ê„ÄüÈ›´‡"1 ¿æÉˆÆ Ñ'%Ѽ )¤&´«c…£M¢¸TZ,'‹UTíWŒ}Æ‹Rý@-Upivo ÛÁ-“Qsyœ-žëâ—5Ÿ$T?ì!y¤™S@GÔ+ù…µ=pF:mí؉cwCÑ`ìÁ’”"é€ Opª Bæúœú¡”®ïsÛ£ò M@ŒÃ9Ãx1g8r|‡¶¯±) lW2a+¢™Ë…ÏëCwòËÌÏ“ƒn`·‰á¯µrvóÓ S_1ÏUcŠzñÎEÚ0šèûZBQùkp1ÿ¼ÌºÄÞ²qiÎäOhsÍ+צ4ö¢’k&RLEš–(‚íø3ê#ú ²°vì4cª¯ÐrU|ñêÀÿ‘}Âå<ÍAF3P¨+—  ¥”­i軎#ì p!DJǧÔão‡•Ï.íL÷çé³£v3Uš™¾‘nKGìUºÃƒR¿«â)òƒ`”,w¹žó‚˜¾9,g7‘؈\9Ƕ+z”# ìÕ1ÜmP¦–ðq¨ß#ž´¢=©V9ÂÁÌ°ñejeC.©Z—Xðë‹äà ÒÝ@0Ámʼn¯¤ã ‡¹³Y¤Ua}áS¥»ÁüôåÿÊoÔæN±j±x~7¤aìÚq×#¬‡?ÍÔôS„ú‡É}2Ò4ßTLë2+SB°KD¬óâŒã FPp”$²%*ìÏQò·#?Ë7&ûô"è¢d²|@˜ož(ãÌL‚ËHZOšN†zí¦"ô´¿vC67ïýŽs”$Œ¡>מcûQ("ìá¥\á:¡åÜŸ-ƒž.:ÊEG—ŽòÂR­„”÷Zü®°€ìUèXíl¢¿âµÚxXÍëÓ·ÉÏ?àA Å«˜~•omô¬Êþ(PßÚ4ƒqäªÛYÔ¶· ²í¾oõ]/@sa÷?›ž¸'QÍÇæðÅ‚–Å*)xCô[œ'O+´éÝNºyÿ8’ãÕƒø¹X¨MQ³:‡7 µyˆ–ºTr;Œ"±P9¶Cl%DpPøuŽØéhL§‹VÑêÇ¥Õ¿x­Ø¼Vgׂ›þÇ‹|QƒGå¹4Ž=¸¼tåôüJÛ°Ž•Ž[жÑæGžI¶qìäáRû£’hi¢ˆç8‚D~`sù†RŒ0Ýö*€;øï\QŒeO/]M1h_i$×W«³ðÎÕM³)ží©RU}$IŒ:Rh#ñ4+[l)^¨Ǫ̂÷òà(篫öm $•x<˜4.Ri«5êéXk ¬XÞ'W¶Ù}z­{šJÕUy'ÒÄK>°&.m`Ï|Û!>ÚxÊR Æv!íÓfÏÜ!´\ĸ¢÷Ô*¨ßœí{ܦNá2§¡SìV€Â‰pHà{ÂeÜ÷H@À<æ\+ÍTD¹§è’w6&ïÏKV'¶§[]ò¬Nà‹8’ÇáX–¿I´ËHr–z¬CÄóבr\Jyä0μЎÙÒvUž·q“8X¦¯®Þä"cŒk=‘/}¼ž¡Î#òàò¯¹’g€áÚÙÚPS~„_Š}LQ%Êl¹*ZŒC'k°­ ¨ümç>–02ãÈá2ÃóèE<¬¹Á1²Œƒ¤ ¢Hð€ø6ÕŽË\åG¾+ÂóNÚ9©7õLÎÔ$9OieʼnXgÉðßêoËø‹˜¨¬åÖfâ,ÌL„Â¥CèÐaŽr}áEŠ8ŽëÓz¯Ðz»Ký©Ù"sR-*Þ43c!%S™–XN~SM¿Äódjl„/b’KÖ<5þü °gÚO̽õO+„DÔVx_¸à@Heòû3I“•´øßãÁ!ó‡uÒ¡.#QÜ»ûˆlv†5ýWŒð’ÿ ûƯ°½k.“WÏe*ù~‡1Úˆj— m«sá‘H8#Ò¥šQÍ}[ѨH„f,ñ( ‹™©ó6Çk¯i³ ;™Ì·0kû~¯Ûy¶LY*xü–F,çê\Ù4e°éh>©e†õ¶ÅÓ°ûÏÀÞ¿Ó!ª²pf=–N‡»d½V…Döýý»w…[5µÞ½ƒÏñ0žæ`o% Z‡3üosëa^œ&»uõ0W)ç8 ¾zãÃ×)”>üé/jŠF1¶zZ…ÿÿërb9¾åØ„Y„¾w½÷ÿÏÞ•ÇQi‚1G¸›4ãÂ`EÒô}Ø–Èxfl –%13Â68ˆ>G#Ï!æ°,£µ6)î# ‡6ŒC–À&$K ˜º¼[,ÂB ² 0‡\(’ýßëîQÏèèîñ¬ÍRÓª9ÔÓý÷÷þþßÿ½÷¿¿ßã$<å]% =ËÏÈV‰‡J¥‘Áàèèh‡–_7–ÒsùB*˜Îiú:ë^Ï^”Φj@Å‚Ú°ÏÉ¥„œ)UöúÙØ®¨±ƒ‡¯&dØe ýªäµ1ô‰.Ò5»eÚ ýÞLeòŠœ)f1¶éOò¹‘ÈŽX}RG:?IÜa„Šæ8Ž¥8’gZH”“µdÃÌ°•‘ÉD‹"Kùòô…vûýÿé¶èôH_8¹ª?J [Nô,‰@{0¸‚ ƒ‘d„XÙ\Þ¶FÉ‚œ+b(g‚Áho€pZø(ƒ;®C²(t²õµ½ä8³C+iÈîñ×e3¹bçb(I’̳ñ±Ðª…`¨Zpl;îcu¦hO¢‚í:%ðEæÉ Õ!¹üÑ9\Ò.âš3IÈÊöP{8Ÿ÷\à‹vJç Vé ¤LÇ€Z§•ã"fÅ4+$>¡”.«Ø®a±Ô¬Z@7ø‡Ù‹€OÖX^¨Ø¡‹ÄzÐo*eôâ®—˜±¬â ä¢ZH£îÞÄ/ÃÐG3÷Zžcøâ²^ëF|4ñv¢6–³zmÅÚ³xmÇä 2•uÿ,¯„?¨e_ÊLOnÍ^гy<%74pà 6«›©fðŒÝà_­KŸnºõŠ¤Sz>ÈT¬fˆžÉ yAÓ¹Tg€ àÿGÀ?Zÿß/*™hP‚À3Ô¡×[Z@püȺ…³U£Ù?Z§·gt!;8=kCT€@cjôg6?웎°xåªÄ©Æ.²Cê AÙð³)Ф:Ânm[­ø°ýzUkÒä>h鹊ùÐT¬2U|ŒN^[ÈR›eÚm¸rƱQþD/*“îªPž“Ûpy»–ËéœYþ~9¥[¥Düµ('N%gââ•mªõVv{"çÀ¢P©«dDä’l‚IØC®3H³K¬– Ðä*&¤£ö\5:4ž9µ¨EÁrÆj`ZwµZßt•¾iŸ Ÿ‰YÆܼö_:«!P%µâÁê(!SG ý¡ e2^ŒÂná ÞSµÎ¬î”'Ó²¥àþ„S ¢!M7êS[¥$Ƨ8•2WÂAÙ†%û)”â¡Ø"?"T§Õ¡ú¡9Eh¶ÍÝ)B·Exr@3qŠ0l†)§ˆ”-"åGDÚ)"m‹Hû‘qŠ¨˜ë UƵöYKdÖ™õƒ*瑳EäüˆqŠ±EŒøQpŠ(Ø" ~DTU»¢-Ÿ/qŠ(Ù"fðÞ“E”"ʶˆ²k"ÖÚ"ÖzñgŽ~9šš°Ò@³ Éê«×„dQ;QÉäÕ5®nkÚĉñl´Ž‹ç*¶UF)ŠmÖ |Ñ¡ U4C%Ëùš¶£öjeÔs$ú†–õÎäñR6 ,Üй`¡Vgäy¶¡àíD–h‡–,ŒÊÔ‡¢fúé 1{Á´1–µâµ‚JÉ<)‘”ŒÒ%y]äxU•d‰T5–Ç8õ‚¦³2cÚXÛ¦¦›F>šÞªâ?űœ:˜ÇŠoä5\â?GqŽøÝ{8¶ÿÙ/Ûý½Kš}*ª(Gź#qø<½¾p¼ÿ×hçÞ––CNˆEBÉu½óò`wrÕiÛw¿'¾ú£?ß•¾‹mOñ¿9ìow>7o͹ó·üöô+ÉgâË^üÖ7ߺ}cð×ýÇD}´kײëÚ¿ºìÑû¿øtÇ «n|ø-Ú/‡®Øû³“üÀ÷ÎO<ûÞKß_ÈŒ>xåM÷Þü‡ÃïMï¾wkqã·®XöäîŽM;öF~ºå$ùÛgÞóÊW.üàò5w³ýꣶG®Ý{îÏï ð–^ÛýÔ_O=qÄî9ä7W]ºàâógµÜùèü ÇîyeÓ{>%é¾æ¼ÝÏÏùòmëÛ}äŠð glùbêÎÍü¦7Å3^ܳñžß}ë…§9xó¡[ÿùo?òïf}ÄÙ›Nù%süöí·Ý}åÛo\vÚñ'}ç_z¬eŽ|ßûò“¯; _Õ2çàC‹mx›¾× ó^œ·¸5ôxføõwíJ·îÜÒ¶ów~ýaËaùßü0yc›¶ñ‚ÍÛ=º…io}ôÔíÇ~«ë˜Ã_»lçì7éÙño×l~æoŽÎm E‡— Œu}rËÎ{æ]ò‹;Ä›³Ü²ô=GŸ:ü÷‘ÖGz¯ý]:5ú˜ÙúÙõonõ//ûýÃ÷]þÀòÓ_ÿÑ¿¯ù³¯»%ÿé=ƒ¯=›YùÎÜÓžÙpÓ¯î9夷ž?ñ™§W^ùì·?Šo|¡õÑO.}îÒço8ôýèKG/ä¢Î=ëþ:oz$ºþ±;¹eÿ¹íw¿º~pÎuÔŸÖ/ÞzÎÛGÞ·òê]Òk[‡{..9ü£WÏùÊÓR¥¿v†x¦°üîÁÕçÞ:÷Ù«wîÞøé_Çö±"TËŽ/œ°NÜVüñÚ{·î>‘{é”Ys.Ìùò›G¼ÛõeåÏüÎç¬l{ˆ½ ùñ%ñ¾½íƒËþ‹¼©ôòð¬áõëŸ8ó‰]ÿú@:vÛ1×þiô©"qÊí›n¾æ¹e{÷¼¾ðÚ«Ù¼ê§ÇmùÒ/vœÁoùù[—?øõµ¿蕇Ò+ÖÞtÍЇ¼7kÓo¿õ³gŽßrðÃg¾~п]úË݇Ž_ð‡]?qá¦U…Hç¢O#Ÿ|ýžü°¸é©=W‰ß}ðè–ð®ãÎ>ò˜ís¶Ü\b÷ü÷݇_{û9¯^vÝŠ¯Úqßìëß-lS‡—´có®uãÄ-Ñ»÷öþöŠ[÷†î8î/?¹iÓùÛv_6ü磮wî—¾{×w°ßÇŽ2íüÓâ‹.=¹Î­Êÿ£Æ M56øßâæÿ).ZÿçHŽnúÿý±5ãÿû'þo>lUHçREÂŒ<•Üæ @sP 9(ð8(0}0«ƒŸÅAÆ– _±¦dSÈ2ÿ¡{íI[vdg¹Kð’{ =™ö¨(ÙÎO-g³ra,€óMHsGÊJ»\?LA!lrWí½ª’Ž½MmlËÜ7³ëG§(ˆ)u† JZ¤æ5½kn:§fÊšNÌË”N›Ç#V§Y€Ì0Ó¼œÄÂ̼¯Ú´HðGš®fpð®Tp–„Ìô«OÉ—Jùìô©š´=‹˜;`óŽ˜v>UÙ‹:Jmƒv‡ÿÒ'ìSU·ÉYPój±oZJ& ÷;&û³2Ns#ø  •ˆn6pÂ/ÜÑé¾>SíøI d¤HºDoëeÎX Ìt3«NS&²¢çŠÛKz!›ÎáF†\™x ®)«(JmûÄJfã>ZX´è-;߃xȈž4»cÏŠ ],åmõÖ1KU›m‰'—@íiß ¢Ô.'P´&îÉgÆó–z)QÒÌ"k§Dõ.šak‹îQ‹ü¤ÇXÚš:ñöŒ?@V‘ù 4ýëB‹ÕR<-L;YË0ÕrÀPå‘bTU‡4ƞDz"íⲜ©CÇUË]‡’è‰9Ï,1½ 5h¬¾{¢H±QZ+gGê(™XsÛ¼M_3Yx†jAEïsÌM&±5ÂÜfƒ*qJ½ædB<*h==ŒÛ¹£r‘HU:š•åèŒ<”y­@ŠÜô‚Êxj]þº9DÚ"mnõnSæÿ£ž¹•Öˆk¸Åÿ’¯‰ÿ 4M5ãÿûckÆÿ›ùÿÍP3Ôÿy õ7óÿ?/ùÿûïïž¼ü¹ÍÿŸ(™‡¼é«O`9 x<ËiÀ3XN#@rêå4 ßËñô?œ¤éc9 ÈÕÇr°å4 kËi@ê>–Ó€ü},g¿$ñ›ãž=¯ØÙóÊTÙó¨9cG@gÈ §{ÆE×9žghž—E‘)Ey™•uV2d-,‹$šS&Ìž>œF‹–Áï]Yõkð$¸+Qç Ñe4u1+Ò-2< µW×eÖÍàkVôæm¸E2ªJKº¤‘e@å¥eƒçÀï¾µïMÞ´Ú/zP¿]`’ÑuQ RÒÐð24¯‹4g0šì»(°¼ÎÐ2¸^YT5ƒSž3&Áã¸b7‡q¼XŽ¬¨ÍP<œ¢q”ʈX+'Ñ`†o~Òepæ‚¡«'É+k"g’¡ó§)ÀºSYNs g¿áLÎÿ¯JghHŒyÆø? N…¦jžÿ‚£›Ïí—­ÿß?ñ3¨C%¸rKÌ¥šƒÍÁ€æ`@s0àÀ4,øï,O;¸Ô¡J`þlE¿¡k¦Î¤ÖÒ…A…6F 7#Ëœ.È‹–­”yÊ08Ù ;5»× @?WÐIÚ:ê-‰<4F Úñ¬$*z"Ѻø2=W4‡ ¬«Ø:اÇ\Ÿ#°)¤þg&ªnèYZš·§É¨NæÂë ™fÁ‚:pYR‚œÊšµÀ±åì:Òü38¿ÃÊÇîÎq\.èBæCYFeg£OÑ Bi¡t•Pl¥ÎCÕ|Ölýjû¾n­­•já ;ã‚©VÈ”¸q­mm%¦Þ*=–ž´R cÓ†EøÃκ`g½cßïzç\°sûª÷ Ϭ4÷¤wÞ;ÿÖ»à‚]Ø'½/IŠ%b­^(â¹±I!HÑAèÄ“ Ñ»è‚]ü ë]rÁ.yÀîëŠ9ó)Ò‹¶ü]Ò…](ÊË%[¹ùÃïBdí ?1ÑÑœhÉâpsÁ»"d¡'2†t­ g€ðósv,9³>S:ðª?ü.dFy"³¨B£<öKmƒƒƒmmƒmøÝùj«Ý?èÜ7ÉCùÃïBj”'RÃøƒøïÁêפý•ÿÐûx[M|âw!6ʱµÖ ý­Þü.äFy"7À?¾aÆñ æ»ó5Õ~Ç{pJ±zð»å‰à~b)1'úá['¼zü½ÿ6÷Y¯Nû=LŒ¯Fè«î€Oü.$Gy!9œÏŒy §¯ŒUž?*ãê¹5ð‡Ÿv¡LÚebü!Œ3cá,Á«lcÍM•uÀaB>ñ»ð/í ÓZrø‹fL¬Z~ø#&ð5ð‰ß…iü 8º1š1¶_'¶+ÂÚ_ÁoÖô}5á,€Oü.üK{ã_„'VAfã'X Ç«ö½ª>ñ»ð/í•ljä$œ^ñWÀ'~þ¥½òï8­¿³>ñ»ð/í•Çám¼¿;_­Sì¯Ú4­fu«]Ÿø]ø—öÌ¿D1>bÚ}^ x©Äx~œ!ÆÛM_Ÿ†—BŒÆ ¿C]ÚnÇ$2ÿø]ø—öÊ¿óæ2ÒBè$šŸÕÿM÷éçœþ›à>kwe¯O]¸p9í•Ë¶ùÃϸp9ã‘ËÃù‘1<= qVx>´H‘È¥q„£4FôË…t±=QÖ o‹{x±Þx,Ôü.\Îxåò¥.gü.\Îxär„8«—ì³ùûÅïÂåŒç¾t£6Ÿø]¸œñÈåTGM(¢¡,ËöÑ$WD¶\Dé%ÙZQVP¢Zñ»¹| j}›_ü.\ÎxårÂw³gÁwØ5žæ¾Êè¡œ "Ek6î«þ]ø—ñÈ¿ôdýƒžþÆÖ?Tf­¬êSÞ‚:ð³.üËzíK¨ç>Ø+núÇ￬wþ­È´AðíyâÍÊ%½–3Å _Š?ÿuÜ´ÿø]ø—õÈ¿LfA‚Í1h°Ž2ÐÂ>†3ƒ1š†â×zNËŠxáj(O6_Â+š‚Y•Š¾ñ»ð/ëµ/ ú¯˜ñMˆ’7J£ˆl†-Žè*¢9€›FÄ[@—3©®X4o€Oü.üËzeÿϺð/ë‘“ݱ‘è[’\ŠG øÞï;/‰FˆÅ«àÇ(Hv÷ʼn‹. %àgÜ[1»,¡Þ¼VÑ•ýñh"AÀAõ”Ã…‡Y<[ÞßÔPŒx¨7‹&Ú ±îˆÄz—¶‹’Do_’è‰-%á°d_.ÝäÓüâwáaÖ#÷-!–GãánZë‰%Wa/‰%{‘r—€vCD(žŒ…zBq¢ Þß—€Ûw-K„{B±åÑH~È…‡Y<ëýÑó¢½I"ÑêéqÏâ((>´¸'j–Œ&‹GÃIt‹ìoõÖf=ò0Ø X=(¿§HôGÃ1ô%º2 öŠ¯jCÖîëMDÏ€ƒàG"ZZ ærV•ùÄϹð0瑇kªqx ]ŽîØVb`q"K$£ÄÒ¾¾®­‰hü¼X8šXHôô¡ú»„HDý¶ã8æ<òp$” a-p0z…ìf ÃæëMFãñþd¬¯w>ÑÝ· nHGp=éëÅfåß~8æ<ò0X{_|R"²t\ÛˆÝQØG•Œ'!CO$ã±pÒy”4ÙOÖeÿœ syxÂŒ‰ÞèÒžØÒho8Šõ¡¬ˆ%¢óÁ×Ä耘©ì!(ï6/T×á^ ¯~ñ»ð0瑇«x¬ ;""¶„E΋!±0‚ËLÄ,÷ŠkÅÿ’wíÍqÛHþ«0IÝ–lË6ñ|ëÜf“Ínª’ÜV¶®ö®’” $ÁxbI£Õ#Yßå¾û$g4CPì4”•œþðC3Ó6ý¯»?ýËp_dêØa¿S~/~„ì¯@Úß1Šî¸›LÖê¼çyfÏW]»ÅÛwnÐ!>hBGã¬õöW íïÕ ò¢øûà^VïrÒ‰ëì¯@ÚßO]séýã?ö…7ÝBB‡ëþ×/†_ÿáæùÅÕMó¢½ M¬;Æè)+,VøËõÍêêù×kwZüu}S¿q×ÝSÜþúÅEÿë?¬Î}\¶y=…l±ÄÇÄúI\?`‹åÃã»^¦=`ŒåÈãˆRÎXÈ‹.ïR»««õå‡û½ã¯®¯ß^¼éÛÁ§<$`ñäŒÅ›_Ïj³À€É6»œÐu4g=€A’3if=uß~(}9€}‘*G$¥/g”þÌ3ÞÖj„ÄíÞPM3”/¬¯N_žÙúr½7Ì …€¦—3š>kéŠï,ýæzuš¹p(w5£Ü³.õÎÂ'&H¤¬PìjF±çÉË.ÓGcVÓWhu5be­žÊÕÇu™O˜Å2lâ9D®0!É˧Ïè¤q°ê¾Ws[ÔwÈá_œÚwÛ¹ÉqÃ`2.$9äOš¦ó¤tŽT†C™ ¢fN©ß*ˆî“±‚øÈ*ÇD˜-]ZeˆÿSËÚiU••f–[]w+3e_»xמ½uï~^_6ÁÁøðãŸÖ«MO½bFC‰M$N%5o-m+.ˆ–+[g ÷W·bo4F×)¬åèó/¾ü“—ðPlx<ó5%¹U„"¡Âþ¸¸ûA¼Öß<Ç©ûÉ>)þ¹'€±2ûƪÀ­au\üˆ ÀÞ˜œ(Âêß°¹§ºU«/‹Û Òþò¶ãj³a8‚Åíéúç?n×›V€ÅÑÅë¿ûÇμöëòÿ{öì rU€Ý1b´ª¢h»vAíÑ È»ì=¦Ó•÷=¬—àßýãf}ý¯¿|wÝÿc ô»{€I12G$=ozVívú“Y|ðºS°¬4¶Ñ÷fý³çÏ‹Ý1=ßçí`ŒA3Í^¹”cCÊùÀ¿~.…}l“Pî_OW”û× ®H#A€ºnÿz´ *T”jû×ç—s‡JÝר¯“U*Ê°ýëѺL© ÎÚ¿>(Ùyµê_Ç‹Ægƒ„£ï@2]“”D™W°þõ{«Žóê¤[Ø«â_š‘Þ8ÔÉó.j…ܽ¬ Vyg–j§TÓJ¢)±JWDʦihå…}óeá™Ðû=¯ºýëZ (ƒ&$ÖɨÝ^5/פí2P MÈØuEªU¯V½cµä^ú/ñÊ«…‚jBâÎ Ëêa BšØ,<&jŸ ‰-ÄCêb ´™)C$ ¨y2Vó9Ͻj¼Ú£Íq÷½þŸcÏ)U¶M[Ó’P­Œ6Šb‰³¦j[R·-“­÷ašðPß®¾O%í#óÐþš†ÞÆ\UT(',o„¤¬jʪñrs=uôVÄVï‘”ÓEƦ K0ãjbQ Ä—б9¸ST¬ÿm?5M uº„b2@x¡‚€ò[BcmýPꨬ%t¬·S–H³dT1‹”| Ž•ŒëXqD5;..E­2BäGY-Ué¼À·må¼*u͈`þ”‘ÆÑne¡Ti©ü¨PuÅÃèÃYë¿©´Ö·su]­ÙKm:=Šö£€b(ÂÆÖw¹ÌpÿÌ›ôn‰=(@9•C! P¤DÆEJ8¢€=W¡ˆÎÂÐ1Erïï xQ¥Ìz‡Ëÿ!ʶ)Û’‡†à¡=ŽL8(¡ïæ <ÅLëÃW[¿]ɪ*%­µjËJ–T‰z3{˜¾O{'1p><á˜Li|%€Ý[@`øØB}ûãœüêƒNÎìå[oÛÿýo_ž|õÉž€ï×Æ.ð¢8&:)1w¾o3´¾gŸ¸C®@«1ëžÝ¹Úê¦mÝå·û ü»&À[#ÐqD_K'¡¼]S—üE. °™Èû%³ªI° €óéx0Ž(`W#Hý†ãÏîºp¶~3œÒ  ði„Â3ìŽÞörñv,o»K\ étš>ËŠ[ó¾Ã³#‘€ÙŒðì©’Š¾Zxûý£s¡P>%q‚GæÓ˜Ÿ&C»¨$A`ú4‚é/©²°²@¹¥ ¯½1ñaŸä-wµ¬¬¨-ËÂ&ŸŸ'@ÉJ€÷§ãIZ8¢€§¹Yø”,Àý”ædá)€î§9è~ Ìs¢ãyN8¢€zE Yz݃(0‰Þc0ÒWîl}ù®°}¸ZŸ¿lÜíîÌȧ­ŒD‘ƒ‘ù“”…§Àd$:žŒ„# (²ñ¸"ÑÙˆ,<c‡™|䡲ðÙ!?6¿ ̬ < ^N)S` O¡ÀìÛ¡(DÏ*:š£x:‰pçG¢ck`¦åãˆgáؽa€qåãØh™x`P÷I‘+PC£Ê˜Å<Øô¥ŽÂxrŽ(`½Qå0÷ö2:*sAú€@¡ Í)T¡@¡ Ï/ÀÛZ„aäF)#uãšÆ*ãƒåOKmkkUJ×ö+Ó Õp‰e£ÖëUU>€buÙÙÖ<@â4mʲ-µÚS’í¥sT Gœ>pú¸»iä¾Hy:npŽ# ˆµÄWËß»TŠ˜u:YۿЕÖð`t:Fœ@cäãÖ$l=c›òRoN'ðæË®½pÀMš€³ï,ý-€GaÈ‘ÖÀOÓ~KÐÇãvæ(¢™æ`‘)€E¦s=ÀC^Ó¹.àHtä_ûNá»èÈ«™·'®ÐÑcàñ£ËË gšÓkœ˜e:î5Ž"ªçXp?5\jÙðR0-¤0¢å\Õ”–¶j­íº:û/y¨¼ŒP5gŽIÁLÃüªXc+-´i*îTךv‡j}º>0oT"¡1÷loT²£ñ]SîæHÇOì‚©s’ô°‡ú>]‚_§t ¦0¡:¾9]õ§“«sLîl#xOÔŒ¯';¹xP* a:¦wk_,ë¶h”€äà+˜q·“MbÎá±e‹¦Dß^ è{O£¾÷¹[±\íQïÇÎbñ8 ù?59~P3AQ5ï?ÿ€u|€ Uh$*Ý„êäd›@»ù€‹•Šô§üêú²¹¹Xì”?–Êm Ô­Ðh¸2÷”®P“á1 …E5(X/Á‘f@y •—àøÅ€rVf\u0 V„åÔŠ°Y<*&€Ê0Q™Z•Â–Æ ríJZ¶†ø¶q¶[Ii»¹ã¤ <^®Û–2ÑH)*Ê¥ÒUòš‡ WñRïy¼î7ö4?b%™:)VÙ3ÈËæ¼s‰Ž‹v}sÞ`¥bÞè0’^2œË"p..¼$!´ôE… Xº€)à9ÒÏPÃ.î“ €ùŒç å€Ìg<'Áí™Èq­gQΘìkè¨Æ«][i]µÂ™¶öVÕ••beà®_™œ wbu7Ù+ƒüPkKɈ15£´®•¬˜«ÊV¦›ÆúÿíWü¬7_ð@ "à¿ ÿ=•^=³ÿšö€óÂ90î—=Q90©—.ŸEî#\ûÒ¨†×B´µ~Kjy%XÓº’šU•ìšlñÿG»öÁœ¤x÷4¤æÒшV1¡UÍuMbT¼anÏOÿÁ]Ÿ¬Î÷Ï“ör}v²z<¾>Ö}ç@ê°¼^áo99PéÀs*8PéÀó*r®9P¥À'ªŒdá@ù§•f((àQA2aú:¤KC¶ôÑ$K9PãÀ£NÞ(yZîBèõkŒ–@>;`²£RŒC#ÿ8PgÁ£: ¤iŠxN»qÔ ð¨n{Ö?ÿV¬^=? ({ࣲäfE<§èÏbR.µ¥´ÞáqMÉdÃLÉM]q£ZG¥Bûž°2³¤ËÃ¥Š…ašPÅ…¥†WŠiKÓVÕs.O`Ä‚NOvZ’x^áy—ðkè/ç7ñò¸eùCåF9€Ùå˜ÝCû9b—óœ˜ëò¬ûëõsü0ãüœm)Æ‚÷‹CJ+«€é0ÍwjP3çyM88kæ9°fÀš¹ÈmÂñpj°,¬Èi!Âné<§[:Ÿíéðj¸«}`Bo-Eë«oåœZ*Çû•Mx5wî )w¼ˆÕùµ»lmíðˆsxE;îÉ–~çÚ u'ЋœËèŒd>îäÇö]Åð-s,¾Þe­®5¡¿hË\Å%'M¥JG‰W´áÔï¯ ½ ÐôQPŒÁÇ£pD÷®Ä¸¾®?,VÍFzN‚ôœ Ï>°¢ni‡RbýJ÷¿¤qõª UŒ>q´›8Ý”²N“ðVü÷ÕÇŸ¹vu¾ ³"^ýþeÕ…G»+?¹Zß\Ö®€Óa6VOöEýj;Ī£e)\Ћgé=Šƒïfì^Ñk1I`i>wUÜ[>oË­1|&åI‚\œïæ âI8?IÞo‰¿xóJü³”d8»>mB¦ðvs_½Ú¦nî–—póP<í/®ò…@N²n‚4¾I•©ûÅü·øÍîwöjÀuä{H€‚|zô´ØùÄ“£þ·ù‡uJÄË‘ˆ'×­Z„£k¼ZÌ‹Ôñ¦¦ûÈÑç_|ù§âi»:uÇÅ„> ÃÚ¯‹S÷“;=¤j,Í®j4 ¬ä/{»š¡µ` ^kÁ´vµVí¸{CÃÎ<-»¨­ô®¶Êñ | Sñª²ÄpÖÆKkÛÊGÅu]­I90­‘M?˜pH©'¡ÞVê ã9Ž˜ Jp¼ò’]-¢O-íi‘p‹yËØpg™®ºÁÔV‚êÎJ“Í;³[ö?z4¸.«ó‹›ëƒrÕ쉫I×­Ï»Â\ÅÎî8ý¯^ÝVÑÂ^ßæ½™¼ó®Z¤HéŽ;ö*T…&Z¼]Ù•{9þSö@îÚƒ„sÅÙæ\N°%¿ÿåÕüÙÚ¹p+¦(ÝÃÓdQøMè®Oâ#p’ [}§Äðú*/½6?1²dlméACo²«º¶s&T^1í©{¿)5BöÔÉìà‹ |`—|©„ ì†O<ÙزƒFv¡ÍÇnd§TÎqñ Ç-›¦ÆÆî¡Æâ#ÖaF¶Gl î@1U¢Øÿ±÷¬1’gí)±W¶#!â@¤˜ö8»Óín¿ªç»%¶ÏÃ8öš$ä¬K½zwìÙéÉtïííÛ€Ü,åIp"’@@² ‘€"ˆb!! `ˆIÌC9ŠDPøªª«§{vfº{vöqÎŽ´»³ÝUõU}õ½êû¾ªò2Ó:hŠ™«Nw­?s³H?‡*ñÔ˜ÜÄ([ú„¡øFæÃÍrŽÒ; æØ×úßÄaä; Œ›(Ä! =Œ„ËÜuXˆ½:zÊ×ú¿º-œ´ G\eŠ+Ö,ù¢p¸š–E,I5~“>U‘ãk›ëÓ#Úßf¸â<Ñf}­o#*¯ÞÇVŸÊw¾'n4Þf£)\ =?ël6Ô-¶/¨Ûj råZ£S_¹6Î÷™LÔ™jÍÊË' ¥x%Bg«fÑšESquE}2ž2£ù2|Ç‹„1:±•`£s~EO\EJA#OÜé ÍQ)«îzTHÛr›È[7¬í~3ÓeÓ~ÜÈtÉu'µm[øå©Ifc›bbr°@²:ë\wV·•+AiŒW:ûô"¯T¥äNÍ(¨ÓYêJKlõÉt¥å6œ¯‘:X_h7OC¬òFé%QVeW‚]âØÇ’¬nàÙÉ©Óv±Í\ʘÍ8ñÜ–5eÐ ˜fˆâ:žþœ:«Û*“Z}çž1ªâ^©Xºk2m²p÷kG¸|á’`¦ úV§AÖç„æ)•5ºÊ±¸áFð@0Ä ¢]ƒ¨ye¶[ƒ¨yÓ̹‰²9C^V\KmþÍ6tn …ÎP»çkR¬<+¶:bççÎ6I(®Ÿ-{ПöEµ`é]jz„††.ÂÔÖ^AX¹LeiWkØÀ-2ʼnµ½ÇP~ÒŠp·|N)úå4‰~å¹ÕûÊêçT·UÊx*ìW›ŒéAÉiQ7"jä£FÓ¬««óÏëËÕ¦¹ìµ–ÕªøîgCÉvþ·›ú熅#êãUqX¸±°°\xLch¡›&âñ¼|’¤¸ŸQCËFO|—¯ÖúºÇêUk ÐÈXŸ'ÉЋåS‰PÅËówdq׸~~v£cؾaj Ë9éz'Q 'Kw qÏ [F¾ãO ~-M{'—–677Y|q „èbÜ_]’ž Ì¬™?Õ^_ê„‘ôéé–®Ñ뮶 ÜIó'Ðûy¹gÎZ =øªº ÔÄ[³-ñWYžŸûáúˆA³˜ÊÁ/ tTé,a±å¹®ø \fÿÂ!Ç3ç,!äZÈôì9Süñç s–÷Ù|`s'i¼1~ÜUï/ÓÏ©μåÖ•wÜw›!fݸïÁ[î>{«ÑZXZz›sëÒÒ™•3ÆÛï\¹çn` ÓXéãn"%î,-ÝvoË(²í¦#9våþ¥‹¢-KTξ.¤…š‹,e‚™%À‹ënrzD3V†ª¶, k5ø³ÎSPvìØö…Ó­[•X[X'uh!–_LU囄5ðôôƒ+·/Rlkäí Þ¼pk¼ÞÃi›tŠíœ½ít8¨£v&dæ]Ü/”;£¤’2²BÚN;|YË»“Bjm-®·Ã Ó¸ŸËmEO›?ÕiwÉaŠ XIÒ2ú¼#î:Øêðdó´eˆóH²Á‰NBûí^Z|ó0¾€ÕÓL8>üî ÞßZ|8»)Ô›zÙV7áTLZ2\»Ð_-{kuÙò8›ÍLð %)~÷ZJY±XÞØçëñ®î´€B`á¥âªnÚ‰Ð5 B2Ð7(Í•·#pŠau/° §¼ÓIz˜‚…|ºe¶äÿ=PÙÿËóÆ©Tõ¾ô 9 JÞ^]KOÈë]¼I‚—L¿Ìª/txEÌEÄ×U#ïH¯? øS¶ˆ&Q¢x„O± ¼·£µl.†‹z‘lP)yñ%e¢‹Ki_ýѪKŽR›J½ó.3žKÊ]¼hkÀ`‰pe™Bÿ»øB?Þ´Z¹ ”©†hœ ?xÚi'iö^uÚ먾åx—ïÁí®ÿ}x•ŸÒ—“ƒ*ŽjCš£0y<)5toþ¸N#¸ %F]jã N±êÌú• ­éÓ~_^Ç’·.GåÞ FÝÔ©¥ŽšL=«e|Û%|Û >º'jŒwC­:¸ZíÄwÊ­Ü¡žÕQq< S×òÁù¿,,ê ïx‡¯· ÇKðŽÞüÇÚýóÌu©ç" §~„Ì0pmêŒÄvòìnÚÙ`<ïa! D™íˆtBø„8ŠßÆ6CÖWÑ ¿gªæY(zn…ŽC„'àQ@IÈ#4DYó +9(Kº9ãíæ>ÍôË *¶oå´•=N6Ö×qKHE=Ó7vy<± Kp`nÁF‘ÄMg7Z¶{S¡’é°˜YXçB^A­õ`Lñh£Keo‡ÿR=¸a.( @ÊñÖÐêP=£MES2Ì‘¤šÆ’^„ùS½òZÑ1‹«°Öò1 ZÝg+bgªºŠ’à¹E5W½ÊQPÔ¸a¹ØI¤:êÇú¨t …zêžn‰Í™k¶.³Ú7zz6ó­‘Ãs& Ïo›¸5{Yª ¥, €¡G픯ŸÌ çÏÂûA™‰T{úÒÚ¯e\Èþ•êYÝ6¥˜l[#÷—ë‘8Mã1\!=΀­Î‹‰U˜Õõ„ƒ*¦×¶Î? ß´J¸,öS5–©Ê]Ÿ¤m<"giÀ(•Óƒߧ”‹ß„cîÌ#Ìq=Û>r)¦š¿¬[Ù­aF£9™å¤g«ÌkŒRwá|Z‡0£­6匘"E>#Øg4r ¼yØ·]ßtBL#™Ë´·Sdß•Iªg>I½Z“ÔqŽ½Ë:MòvA±U37¦Ø&„˜³)ØN`R“8v}ê[ˆzSQŽð=îÊüW÷6Ÿÿ|ã¡‘'Íœ¼t®R‘5ÅñN$Aœ–-b›(ð±_Ý–ƒüÀ M™™q€æ³º·9Â÷`:«g²)vw2“Ø5#;À`ïGQbE¡ù( N=ÎämWÍgR…¤v‡7+û›c{°e¯xrËžÍbSÌîd#“ÐÀC}Ï%˜1êšmû®O"gªYœ9Îv… ª‡> ½ÕÐ(l´¨˜Å¦˜ÝÉ,ZÄ#&ecYü,Ÿ2ß´=a0}uyÌbõÐóN RU£Õóק;²1¡¦ÔaÛ¦Ï#„9±,Ä?t˜Mš•SÝÛåú Ÿ}‘£M±º“„^ò0b1#3r£ˆpâ™BõÚ>€æÓ-B/¬zÞ‰<Áy_è¡éíH¯’(ôý³Ð¶BÐã@wCÆm*ößÈ›{›Ó%»£ +;›£:ßĺ 3¸/&sÓ‰Ú QØ8¤€ <꙾oz–M<è¶ v‚ÅCk¦B"Oã±]‚˜ ª ˆ?rÇ”™ž)¢Gž¼+tV=þÁò¸¸{³ŽºnŠÛ¦ž’ùq®ŽÌUiœ‰é†È'·!]ó„à.] d¾V §Žð“}𠵶=íõã4D¸†Ý9*¤š½ïûƒT”v¸ìN¼jÇgÏÀY$Wwxi0€¡`î^XL³xÅ ‹ÌÀ©!NEœÐË‘y*OD1D£fm{Ue¼£”G5ܲ—'qTÓÆT.îý¤ êh™ÓÆY£]§ „M £gÿèiæâÂ(›šF™Dd'–Žx¨»!tººÍh7ï À3ÄðõeÅ8ðEkáÌšÎθ˜`eQFc'³˜­&9²Ñî°ÄÀ]f¨ƒuá»ÑZÃ}èmµŒ£" ½Xênùð˜` ÜÌJj0MtüuÑP¡`Ö)!A„ Xº|ŸøΡ1‘dÂ#¦r‹Št§ËÏk’F(kã¼³Ý}hؘ) [¡:ÃòÊÏ‘³ÅûA§ÅS‰«E£`(ð-CëLâ½S\–%–!P ò~…Ì|„7o.¦EÆЇ{²¨)8 šn?ß”üª%ÑÊÕ3‰F‹­·œg$Mza›Û|6ÂþëA|M´;héäI•“7¦‡2É«~'q“÷vcUõ³‘º¯öØïŸxÎx :±ªâ"M¥  B)Oã%ݤÑÈöá[­åjéyðuÁ¨ŠU˜9ðñºd¶JERÍ8"ã,‰l*Ëh»ÂˆÝ£ÇÅ£c"¨ƒ¢‘âé¨ÚŠÚ‹“¤M:B4²x#=v@ôŠ"Þ‚^‘}Þ\ãB‰À¿ín÷×¥g¬áDH|ÂV8Ò.3ÔnÛÕ™YOíXÍXâ~QË1÷W͘¥Ð€:Ó·±ô®á<Ú?é­·üv—·9lªj_žJ@Qß8- — @$*;7ÝŒ‡Ä,72©™ˆ Wf ca³ðc'Œw°’á}_<9 @mIü÷“t„ ?1o—`ÁZ#î²ÉÀf³b±Ä¤QKZçÔžOzqWl,+Ùïù¶îR¬¹=Ê©_+ž:¾'ÛAÎÖ'!ù~ís@ùÃ)¸šÍºWÊþ¼)q†sÛ·1Öoߨ#bÌ Ä§[{Ù]Í[)aVÝLUC ¹gÜ-<ÍÕÅvN°M„‰3èðF'=ßç«m௭æb¿ÆV‹ƒ'ög£¤¦çr÷YOÇÉzíNRΥ̥$-¹IŽ%Iß O…p‡Cp‘_$ öŒ¤D†ñC Ò®8Ôhx4äøø³$Ô)5E±Uè3Sº5lËþe}…¾‹¢Ã½©[[H*øõŠµAg¢& M­Ù±¹‘‹«zçþ‰4±‡ñ¸1¤¹ýìMb†³]IlQ'G•¬âLº5DSù© â˜8Q•žâȘ҅0«¬É kÝä­XTQ&}?{D)Bøµ—{̽H#/gzÅfRÖØoýŠ4"¥‚Ú‰ðÎv´7¹òÚܽ•¹r¤ã³H°HO–:ân¬L¥ñz¯³Uð8Œ©Ciî%kSž¬Y +ÒO ø0zZÚŠ87zLÚ¤¬^¬NvÕâ\ÕÈz¶m0tÍÛý ‰æúêž1òë€Äg3š(è€Ò3§v BЫ¦jÑxp –Ô¸7Ep@ø½ çj’÷*뾬¼Fvc†jCÖÞ¦¯üðäÞï~x¼û?¥óߣô‚ÝMšg còùï¦& ŸÿîXèðü÷½øüê}÷ÞqÍüë_\söÎ3÷Ã߇Ÿë®¼~íνwnîÈ]gÏܼrñÈüƒu׫¬{æ¿ßó™_½îŽ¼ðØãÝǯ½öמ3á›Ïßö§^zß“G»yúÛ/¼ðíyîã—~ñÙ{n~þÍŸ½dýŸ¼ðî—égÎ=ûâ‘'ÞÕ“Þç¾÷ý¿^á¯zòϾô­ßæ/^óÌ;o}­ñ1:÷º<öþGïÓßwŽ³ëýâÛVîùÊ‘sýü`mÎûЫ¿wÄúÃÛ¯ºôÙè£÷go»÷Ìïßò®Ç÷sþKüŸü|^Ð3¼b2ÿ;ðøßþ÷|(~Èÿ{ð9¼ÿaoîÈÏO?¼ñáðƇÃo|87>ŒÝo€Ø6BgG#Õ››;WYœ¨2Ž§5Ož¤[œï>’Ü’œ†HºQ2Þy¬»‚ë '«Dt%Ò Õ•hƒJLWb *q]©–ðÈ*EºRÔ Òª®´Ú R[Wj7¨”“L-2Î*­ëJë *uu¥nƒJ=]©× R_Wê7¨”èJµ„zV)Õ•¦’nY#t#jÝj3ùΕÂm"Jô΃Ñê$Š΀Uâ‚° pv%NñvÔÞüÉñ>DOßokEŒ¡)‹òmb;ŽOrœ(° ·oªX‘ã ´ 0$(ä(¢NH=ÂløÈó±Å ™éÐÐò‚ÄBèKÞVl-€0(?ò•©ÃYàz¡/ÆǨ=¹À€[\lg‘=dM Ži Ž²àïq±©TìÊšÔ_m߃%HpoEAàVÔ‹hèbu  hÐâH NDÈ\ß²#Ê|Ÿy¡ípÁg°¢@(òÇŒŽX?\ã‡ÂÜðSÓ. p|XOqä3 R‡ŽÉc¡G«ìÂ)”~Úµ-3H,Ä>õS> ?ðYR acÄSF¯æ  ™övTåØߺìo½­¿ÍÚ,·îbƒ»/¸¯adR—àȪ„I)“ÝíˆóC‰óÃ6œ B!÷È=)xOAÑTˆ@ð°šæk¹0ÈÈ×™N=½R •@¤ $/‡¤nU99/1„C’ûïÚ÷P¢f4Ž±Ð”z;ªrì„AÙ ƒm`á¹iKæSpÃeÈ…¢1Ø®(ÍDpàŸQ³35ý+ß7{ŠxƒxL€§ÃÔßU™£LJ-˜lÓ‚I&¦¸ŒJÇ(ñÁ  «(бŸÆ^Ò 4³æÆ–›™Ÿ²À­’¹¯®²çËê`XøÚÏÌ\Ë|™$~&”AŽµÏ#†W‡pr´ª4G\¦ÀA~–yKApÂ#þJ晚vp²­¤²9e% G:— \¾$0Ü)t;K+AÓ4©ªÄ.ätcÕ05 ó¹ÇÁ)ÒYÌ!:SDyA¨˜Ô$¨ˆ3DÒ‹Ÿ¼œ·U&eU•2)«’4Lµ À Iff™J? £L¸§éŽªeò©”ɧm2ù¤²i^šòrhûql›ú`ƒ¹J•ŸêŒ‚—z‰ÎwY”¶U"óŠ*²ðó0À‘/t¬ |–(3îDœS{EV¡EtÉ÷Etß__ùµ²þÇÎÓÓå…©RGåúêCØ­­ÿ‹¸ý}ýÏWx}_ÿóuÖÿ”ÉUéÙÑE^ûã~_ ô}5Ð÷Õ@ßW}ûÕ@¶úg¹=ÏÀ¦~\4.Øßí—çAÅÒ=5T;Ž[—ƒñUÊ´ïgœÊ@ˆPqQ´ ™ˆ¨†€PÓt·p^ëÔ ¼å™fI7¢®Í/s’ŒÎkXìª;YÔRÊÀm­@yìqÙ÷+—­õZÛºi~mÁ!Eù[–&ET¬M¸ÖÕ›·èM^n#—`.ö3û÷€ =·]*UŇëb,]5ûÃX d9´.^Pöné{£üÉK£?t®UåVM÷ZTQ(C e+…Z5]þê\–O^<}öÐ×ÁÁb\8a÷ìþª@¶â¶Ãöà€l-‚ÈÓA:ãÛ_³EÔà Øwì_]î!‚=| Üï-Ãѽ¿÷HrìÑ_XîÁÎ$÷×öô¹Oj<±Û§yüˆ²#æQïQä#Øã¿°Ü{‽VÔ«®‘z.ÒªW%Â.”ºTyð˜¯zø"£Ì ?¹5{KGKBPìü7±s‹7ùðö£’c1ÂχöÔ•©þÿPæ4«¨õð#dFÈìÊ!4êDhÖ.^]]^ÚÏå÷áúõ«åkª~„Ô¨©YüGö ŸG«ïë‹ßÌçÝáZjâGˆ:ÛAcøæßû‡àGÈ:‘à¿ûóÏ?ïþ,>—ßÛ®/}]A+Þ??BpÔ‰à ~ò†Üß‘ øé¼O‰ýù…ýí¸¸6¿(?ÉÝ{ƒ~¥jâGHŽº\¿Kî†w$ŸãTð–XÅvü¦ïXk@=ü ¡LæD™ËâÎqNá=+±Ž¶ã7m½³ XR¡šøþenüK mÝãŸm(°ÊüðÜã'k ¨‰á_æÈ¿€ã­Es[ ³úSà{aõŠÌ¯/ð#Æüüž,7 &~„™ÿ<²?YÂJ–ÞëŸ+ ¨‰á_æÊ¿w¤¿ÓÿJjâGø—¹òïi7Ç¿Ü€šøþe®ü{wösù}°åúʵ£BkÞ” ¨‰á_æÌ¿äœÜÝz?‚wÞ¹ËïÈ ¹{VØú¼Sr7¾#Â~ÂX?*ÍNAdõñ#üË\ù÷Çüä'‹ÿWÛõ¿©øížûæ—WkÊáræÊåöª‡ßG¸Üwäòãüæ¶Ø$}ïx</&—£á˜Þ’ 1Lžõfb[áuκ֣àG¸Üwåòo%„Ë}G.ßóŸÁÕÙD‘W½2dj4Qû_?Âå¾#—w•4G– ÒÙ´~„wþ]} hÀ¶ÛÃɵ˜ªñ@ '÷¶Ôûüw©Óž×ÇðoàÈ¿~qôŒ)¸<ÛJÌ€– ö[›dSŸ‡«¨‘ÌÇÀnfz{œ_çSs¼¶Q«é¤6~„×Xä"þí9=V‰&¹ž~ó£ ÃNnTfhÎfˆwlnTPݤ8µ·.~„÷¹ìobÿ„Gþí¿íôHïüuÿ—V·Màç‹îùÏ“ö yõÜl“Öeÿíy—üûß­ܶÑJ²´ÎNàýiÿzÑm÷z¾Ô¤Ž<ÜywqÚÔÐŒnë¬ßi÷ÁÙ?>½<霽9$¯.ûäì¼ON;ï:}øZÿüжnóÏêâGx8päáó×ä]»{ü@´^uN;ý߬€_wúgF¸¯Aº-rÑêö;Ç—§­.¹¸ì^œ÷ { ×N:½ãÓVç]û¤Bx8päáÎÈ—´nŸõIïmëôtYy^µAð­W§í¢ 4'nû¸oº¨ü©é8@x8päaÐÐzþé!é]´;æ‡ö¯mÐV÷·C£ÝÇçg½ö]—à&9i½k½uÙ[Ó²šøC„‡CG^WnÆÇ—Ýö;Ó [½ËW½~§Ùo“7çç'v´öÚÝŸ;ÇíÞOäôÜŒß×ä²×®ëÇ…‡Ž<|Òê·¬”8(=€2zsÙëXõïœõÛÝîåE¿s~¶OÞžÿŠÒÀ'vœœŸYµª¯?!Âá#ƒ¶Ÿw3B4šnð!ùåm®wÍàåéw[FÑ{ýn縿ü5hiÿ¼Ûo¤ÿ!Âá#ß«19k¿9í¼iŸ· ²sÓ‚_:½ö>ØšNÏ|¡Sû—´÷Òª—ëÐæǺøyx…Ç­!"פuòsÇèÈ#˜Ì^gn^í¨8~;ÈÏÚŸááÐý™ò7ñ#B„CGþ]Ï¢;$b"¡<Ïk1Ü̆àN̶߳0ñSÑ ?¿¡#ÿ.Îù›<'¿ÌÝËô¶É´DMüÿ†Žü{¬äüãWÅÒ äÇáô§âòóùåÌžÝLfò¹ÿøaú“ü#µaáБ…OóÙ`òì,WCr‘ϲjj[qùùMqùƒÄeeC©ÂÅ‘{LüH¯šø.Ž¾~~×Q½ d­‘±[¡CF ycç]25™äã'/Œ²áL*«““©ûöü£QÀzD/ª`¼j<ƒ¼ „À¢ «„cÖÏ7ÁƒR5Ñ„%¢ –¨häýê3Sº²!E2_/O†G×"çóE÷õåDTA ó` º9<¼)p„¢ Nh&óeàkÛ|ÔFÏ.à\Ðý|÷ùý–ìø†Í@(7YPÂ3Í›˜iŽ˜iîÈ<}Dòª'iĬó‡N(.r•ÍÌó9›zqVøc8áîÈ<æ«žóÀâàMˆƒ#ÄÁyƒBã*“~o!ì_n;ŸBdó´ÝÒEr¥YÆ"/ȤVšúÊn= Èâ¸Xr·«ÏþP·Ÿó±4‹ŽŸ¼ü”ÊS¦H…‰*·Œ“L„,4Ûi¸ó4‘ÌœiÂ8ÏÅç‡sÏÏÜ°›Ã0{¯;§mPq³Fî°¢oÉßb÷ݘÿvHv·,Ù”¡ú¤†ûä»!¬x•°ˆ†ß•"A'ñœkŸ þG]Ý ÁB u`6(«? ÓëW±$Mˆ%Aˆ%ñ«ÚuO-Gä~ígñØÕª×óZF*AX" „¬‡ùç'/u¾ñÞïäoÿn}Œüöôé¾#*Äö'á*B´ÝÿMïÍÇòò®ÿp˜€AüãÏòéOwï§Åó’ö]{±êI«ž V=áν0ЋN˜« ùäìòôÔUöˆŸÄ–ýÓgÏÈÊ!HïGÍú1‰‹,Ħ†UgàP¯Ú<ÂýG“鸒dšI‰"k¸á~}¥Èn¸ÿëÈ”Y• ÷7:ã UŠ,´†ûÕpv˜ÕU«ú¢¶Y¥È"j¸¿ë«VŠ¬’†ûëåVlµi…ûîªq2sŒr”ªz Qµø È^™"F·$ãñÀ\+Fû5Õ§ÚÃý Èç½S³á¤œÝìwsX¢{fãs̯ýA¨,Í2ÆÃØ24'Æ„Jdæ€;åÃ-s”˼@˹C«­3Üo4 ÈÞ°ù€fÕÈ4{®9d¹3¥›öÛш’ÿE^¼XS$ðAÉX{nþ+lj#nÄšÓu¯¸x• 0Ld’cG#Ë )ÝÜÏ£®Q™«ßßÉß&k,xHlÏ;"Ex‚nò„9vf¯Nˆí§ë¶ÿÿËEl÷úZa·B›K7lî.Óhrþà*Ð%üu=s‡¬Â¥ÔÝùÝ‚4 Kdq-¥÷ƒ›R%²n–ÒuËZXCOYK×ÖÃ:j>²J•®¯Ru+±YëKG ­\Cä0–¤Šû2KãP š¥*e^”(_ëÈóã8•™Yˆô¥æÑh„Ò÷œ€iOšÓzáb”Dà˜%"ËaÛãO£9;üÈj'êoÌ }¹IÄ¢Ù‹‰@Ïu´ +žèÚŠ'ÇÑ‚¬C¢ëëÜ EHm}qS¡•ç£E¦ÚtXŠ$1G¼ÅQê{Y˜ ã±õ>Í ¬ÆhY&tP/a‘fIzÂ(ŽÃXH©yœ$æè˜pUeŠ# ¬Î|•A‚¤ÄÓ r¢q×üñGˆŠ¯>›uW×bü°¬ >Þµ~½2‰„go\{Q©Àeâqk·íü^Auå7‹)W´ˆ÷¬GÎnhÓ™ÖjüÏUþËâ¼­gª»Š8cÁ£ÌD:k0âƒÛ#áâ„­=GM¨zv³¢Z‡º¿]ÛŠyÙü KÅï»Ò’`N·°z‹ þé9ˆï½"’TNÃ`Û±\Ä 7ƒáÌ…1ÎËS;õ¢$o›†›Aðdî•VÀÅ/ÿÛd-öý+Ìó ß4Ü2ùº;Ùgq<šHt”2ðz•&" Ía™™òýÀ—‰0IH† M:ÐÕDhef¿2QëÂ<àsü¥ôí_­ pg d¶ž4îV(Â9áælíNåþO¥nH>s—×ê:ß‚þ‰L‘ÏŠŒ”’5µážp}â 0Ìcõ¥,óÞ|бä}ò”Ðýob¿‘q®3¬£ã$nÓõÄm·B² ÝŸ°Sáe—½áˆɃ¦Q£y$;™®g'»ŠÐ@“ŒaŠd ÓªŒá¥T´Ç|Õ²H†1­Ê0vÏcï*avõDzÐꧢQ$%™V¥$ÿRÑ(’ÃL›ä0S$‡™®ç0;ʘŠÆX¤hæq¡¤9NR.…/”Ï=eÔœªj¶uÜ’ŠÖ$ w˜!dÌ™`¾ bEeqm¶¨OE%±ô˜Z›!0 nÄw@£›™û”Gì9߰瘨pìò±î±×@bĸÇ.Écq앶y´W+ŒRˆ7cã-I•Î>¬jÂÖ¨`”/žFç7Å9=d*>4šÂª‰‘LŠ ʯ1Ý#„7|ˆ#†Ë3kñ0’SK7rjËê^¸pM"ƒ„§BxAé”*¥¢ ðó‡3ÑUS]L’Y²qí%$#—ndä.¥¥|É™ŠC2&®í@ìq“´^Š¤õR÷´ÞËiÖ%u+øæ&·«‡Èžú¤Æ·ÓÆËý(&$UjDŒËP3ÁIú¥I¿Œ§/ȪUr• bu“&VÉÃ¥‰»Õ]¥©zÎ ’¹K×2wy ÉÁ¥IsˆdËÒµlY§B’Ë<—%Êßn•C’cÙzrlÐô]1ËfͬÝÊëHªû_v†©5ñW›2æ¹mò˜¯Z¡)CRw™×ày5Cp™×`>–U&¹dw ôlv\÷¿ZhÚÜ]pŒ{’ Ç6rá¾|´É<:Ö$Ž!ytl#né)åý ²ß>C¾1]¯äâé#»3$}m¤ï}IO°ÖS}†¤ø±õó3Ü ­¦Y¶‘œ÷E†äâ±F¹x ÉÅcMrñ’‹Çšäâ±ÊýȬµàId)XÈ,õuÌd¤ÿÿÙ»šÉ‘¬ÜË0´´0‹V#±ü(&gAÝMV¥¶Óéš®b³³²»UW™YÓÓê†ÿDVyƕαõ£É™~VZþ$8!+!h!ö‚‰Ñ ‰¸°Biç€8¡]í ˆÿ¤íÌÊ»²º‡rÉ™Yþ‰xñüâ}/^<¿°m ¢†¨“h0B™vu±x22,UE‘ÄቸAŠQWëº1ÀjSŒœç„)?³È"ÈH–%žwC—%Á€p&‹ž+±{'2B¡4ë@Œ"×?’¥ ¢îc©ä­†amH圆‘Yæ2‹ó–Ê0òù¾ù e`q> 7_¡ ”äÊŒý‡xŒÌØ73ö‚m/Ì®’ž}ô\^Œ~FflÈ™{™[±!#56̧Ææ+”¡óùª¹ ]§Æa4Èš€GOØFP!lHÐÒñ@JÂW@CÇFуdQ¡9üW4Ä3Ts QÅFƒ®5T -S—«•:ÌÅó›Ž;|†F#xÎï•£Š4Š÷ñ3d*Ÿ{•¯Pú̈́Dz•Ö ÙŒ85¨y1¹ììd¶Á|ŠR¾Bx:‘Fã“1±1ap&&,=±BÚqEÓ*Ÿë‘×ËĵAF\,×VDÝ0ÂÚ`©°6ÈkƒeÂÚ #¬ – kƒ sÁq í` ‰Ê``šªia\“¡ŒêE³TqP‡ Á¤”‘„rÜCôÔk.jÁÒu]l(šŠ,± UWê–YĬZ ‚Yµ€ÞëÎ%ÐU,ûjäFdF=¨–Kê!”ÂdpÁÀKµ|ŠÈ+˜ ˜Ì§Îã+”z*Ï+D3̽±7t˜ÐvúÙ'Ãm0™zå«\—p›_Vx«Î·‡—?¨Ä§Ëq‘EcÈd¸+/]Ió ÊȲ@¤¸Ÿ>ÅÔü›LœÚžÐÕ2“ºŒˆ<Ø(åÞ#ohc{E¼*c^ÂÝ%1‡p&æpA È#ä8U*õò`¹È§ý@œspŠÏwˆÏUÈâV ã°§ØÒ ÑŠpN„â…¤Û>8B¸ÛÞò¢i¾Ñy¶½ÿ ì8wÇàT§Ac`<´çñ¢\#Ï5t\,¢2Â!+l1E¢¥¸4ÑíBéo!#°Î6^Lg¨‡¨*B…yâÔCŒ HØ(ãÎdD.™ÈÅeŒ°D˜ KäåCg7ÊèlFh!ÔJDQÃ…ÑMºÔ0 ¬[ëuë\lŠ«P”uë^ÓбéN¢‘)n˜(¤ Ý$§6¿GŒMQ&ÉC\A±¸FøœI¡X¶½sÄb«@TË"‡¿o u½a6 I€QHÈë²hª€0ƒ,…8F³”ðr0ÐàlºFžb%Fš4“‰1åx´Ø‚‘fRXæD€yåGtÙÔuM”58PeQ×TÃR †‚Ñg1ˆÉÏŸ’o:ñ²g±á$ͤÔ̲'ÔVœìQMQ¯ š 꺬4ꨡÔMSÓ5Á´dÜ¢îÉÏŸ²Nd^-6줙ܞY‘ wÀ+?re¬º¦ƒº¨ÔI ¨Z¢ª Z–¥…M!EŸRá.¼ÌYlJ3¹E³Ì § 8™SÇGÅR/Ah5 S•$ÔÀ]Á0-IÃ2%. Eòs§äD/{ÛÙÒLŽÔ,{¨g“›=”%uЀHQ‰Æ,]C¢$j‚*4´º¶„ÉÏž’žX^ö,6ç$¡Ä „ÄÈŽ*ÍdGåÛ$φ“F"TI,3 !1Ò”J"s"Ì °­øI'}ÀѲeŠ(iËëT!­Ùj,dÚ9ç;˜¹ùVö|<_>¿< ÂwM4°‡tÙòµ»5ƒŽpÒ 9ðݱG–"í‰âô5æZj@+àe1{ˆÄÏâK ·³95s‹¸µT¾’pŠ¯ñµ_Ù6?_Kë󔧂™{¢ÌŽa†Ã¹Ò[%ú&Z×d‰ §KÒL¯Sˆßlƒ‹Ÿße·2º"z/`©òKÞ]IÉoü– ?Eá ô@0¹5ßWq18š"˳’¡¥\«Gk ­„l°òËF¹¤©º"_O\¦¼ÐL¶SyIrÎòð?²ÇlC˜ÉãòF5ƒ½wnÝ©;nß –çá]r›¨ö$¿*(<á·Xv#E];[TA¨&¨¸.W)(9¥ VÈk ' V'Ö\§¦qÛÛñBêéEÔ Š{‚’_4ŠOv²º\ Ñ-W26"Ñ£‰¨€ î±Q²rütÕø‚OŠ=Èÿ¤ŠO+rz|ËíËXšsžQ#÷ŒŠð‰€9ÝSÀ Ptêèbþ ™]Ky¬—ë sž±Z³ç¸øѺä|ÙB~‚™[ò@-Îx®àR xò>IÊ€W pYàÖ)óÞ´¸”‹sžKBʸ$ ØvI¿cOÑó÷»¢Óý\ÆGxùÕ€KÎC¬ÎÉ…ÿ¼º²ž~H_¥\YÙHŽBª}rø&=⺀ë’T|#ò›ž:òbŠÃS•f£eyÈ÷s'6îúDUoÜ|@¢õY$†û!Þ~쨒lc ¥5¹¾¦4pMØ¡aÏtGÀ8IhdØø£ ­Õj§§§«–{v~ˆ†«®wX³‡:‹Dôæ]ûø0GÀ’õJ|ÇhxXº$G0õ7il¡¸ÚX­ãŸ!ÉøPØ$rÖp­sòM*Ù¸yãz{Ná¿åšô9ÔtŠ3X‚¥ÖA4^]–É7îðBú›l¢,Ê7D¨(Š,â¡Ÿtƒ¬ $¨7€°T*.ØƤKpÃÐýÀ;^Ç:ÿÿt³ìCO µcÎÒ/+7ß» ²x2À*,ŒÈØBÎ lS¯TÉA’l½" •ª£È™{]r&¹ø_Ç%]‹¯dÿH¡u™®gÑ;wð"xBË]Ï\=Bd¥íuaVOm+8¿äªé:®·^1Ý|§R%‹ :Ñ¡Cã!ekäsWGN!«™»’z!XÙˆ °lrž]léÞ;®gÙ–4ÓŠ°K÷p Õˆx@ÉÕylHÕ™nk©†žÙšigu¿»½^ù"5F¢!oR©7.§¡ô­¼Àõü§Ct6"€Q˜Õr)Óòðý>ù‡bÒø÷?•(”Ñÿƒàb.ß!˜¾¼:ú_a=¥ÿá ²¾ †kýÿ ¶_ßÛyðÙ›_ ²ÿÙÎÖf¿Œ÷W^z~ãO~b‚¿~²³Ù쟽ð_ßü¹ãï>ünïGÌÝß<ûxù¥ÏüÔ‹?ð{7^øãó{Ÿœë´w6ÿìÞ[¿üÜšs½Ü2ý?Ѓ£åö}²±ú?¬‹ùþ-Àëþÿ,¶9ýÿ¼ñ¥ïß½òÑüu÷ÿ‡?ú·_zùWþý>øÜþëßÿãï´O~í¯¿Pyõwÿü·­;ÿâ}æÁ»?¾þå÷þêßzßü£ßúø?ÿôŸ¿±õÑ}~¼ûKßþî“¿9øþ_ýê¼ùâÉù?üÏ?}mýëo´ƒo}ëóï}ø¯|ù¥ÿþ‹îÇ¿ÿÓßþøã«ßùú‡_ùáüÜGÞøð/oýÜáÑ+Oí‰O½V-W²eú?¶ö,Í@5 ꚢKR ¦¡! Ö5ÍÔ” V-¥@¬þ/ÈBvü!þqÝÿŸÅ¦ÕÍTl «–,"K%y溎4I èyÓw½]í6Óÿ5«ÑPL JjC¨ãMÓ‰D“YŠÒ€â€öÿb"–ÿGª«¹þ/^ÛÿÏhKû*€ø}L÷x䎇ÖzàQâ­Ù¡>¸pðºÀ¬ë§ .tÑý±’b:ø™ ‚‘,›uYQ4ƒ€’©AkÈД–Ñ0 D  ¼ï 0£qÿkÞùÐ0çˆÜ ö×C^›ë‡Ê7—z x(ŠÜ ´‡Õ¹.lÂÛ`°¨=•)¬ZRþ¸ÈzzâFŽNæDÎ0õͤËaÙq9†{—€ CCâò+ Ó°Y7NÞU7}&ŒjSí}ŸîŸNWÏÜmÖþcøèA†yûJòµþ[¢ÿ}ø=ƒ…t&§^Oé:Yé̘Ñ%ôoJoR¸ŽZåщ nuY®Uå÷ú6ãÿ?A^@Þ±^¢°¸ÿ¿®ÀkýÿL¶kÿÿ§{›‰ÿP3¡dK©cqÿ¯×ñÉ|ÿ—ë×þ¿g²Ý}us·Õ¼×äqƒ½ý{Û¨¬Ôj¤V­¶ÙßonõnqU}OÇcµpuðZ­½Sé²S‰õ»µ3R–HnŽ~®©;W­À"qe´Â³cgè¯Ï)FÔ4-¼›^‹t £@äÚôîØ>Y¯´Â»•>I½ÇÛ­Wˆ½Þü:‰G÷Q°¾ß¿¿Ò ‘i3…¼¹²ß\ia“WlÃI—Ói¯kÓ{B“õ0 ¼s½Ôu›aà[ðFoìÀAqèÝZœeuõôhï÷mÝ­…—ݼ‹÷(&/Ð ÕôñxØ#†µâü#„‚ ƣƑ H=¾éÙ£ }æmýDFqzo¿;FÞùêÛ>ɦžá»Ñ:ú(\ˆ&wŠÞ8 ‹d@C£§Å’xM{¸£J7i¹4Kª‡ŽÝ²†±íc3ù¤ ì€$†5×G‰fŒª~5 ¢LÊ!<Õ=¤ÁÁÜt0‘ãø#Ý´‡‡ë¡Bÿé–ý¿qÜ Bjð/¶œÃ`“5 ÔGg¯“‹ðI+>ݾâ ¾DXUÐqx HyîÛ˜aXl, äŠt ùô…ãcƒ„x «Újœ0‡Æ›’EH¬^øGQÒVÆ©a¤)Z€ð9gJNLG13‚K¯IÑ?ÔO<÷T¬$Ñ´X2Ã&‚»c'uÔ±ý :O9ö48IJÛ»ñ‡Âöïé‡Ó•ÏIl-¾q^„äá!?SÐNr˜§}ˆ%Š´:SƦè!1½x-ö¥%)¤ÆžGè&¥“” YêH÷ž_ÔÝÚØ füT³ü†~ ŸOIØÆm|¯×Ðl)Âc<-J·gëÔ£¤AøýŸ^LîI1ŸC:N§„ENœ¨‹„¾ ¯ ‹TÁ72&‘ꥊçóSnL]¢I-1g#ϱҜj¿¨Ö°ÛWÙʦڱ’ ÿ%–?} Iuaùúâ0wRjæÕ©øeº.IÒM’^cSsLåÃå«ÝA¨Ü‰Ð®ÒƦJcê³o̦ YS(±X‰ÀÈ5 w2ó;?»rÙ­Øbu# (¹å°çÒ.2wÑŠuÉ;Û¶áéÞù‚uê Ò¾8G'2?íÏœï‹Óg \’ïSÍP›Ú“Kâûâì–Ô?Á|_œzõR|¿o{~NG8¿D¥&¨5(ˆâRø¾8/$< c>/¾/N? Ï¢˜…jdä™"×2–Ūd K> åü*—ºrf1ú@&B.úÁt(;5•YpcàzÇzàÓWÍF®s~„,Ow0໎Oa_wÞÁ߇ã¿Gµý 0¹Àì9òŸh" Q½T=88¨Vªô3½WóÇÒÇf4T1ú &r¥¿FwüYËî3Ç“ÿÈ礚kBAúÀ&rÛÒä“¿§—¡Ÿn"¸aú'|ðÁäƒð3½Ï;žú¬àV<½ý €¹ŽÐ€Iköð¯u¼oú{þ× EûzüÙ“§„úÌ(H?äDÞ•Ÿ'  &θïNL«>Ÿ~ÒƧ¯åPŒ~È€LÈ·ò3¡¿Iét":¼cZ‡óé'mФD¨ ý ü…|ø BiNé÷Ã6„´Zúñ˜Òr (H?!'þb:¶(5ç!uT~BúÖ©\èxBØcÈï§ Ý€‚ô3ðòá/¡§“PÓR´‚ÔžÿÌ4  ý ü…¼ø;ý:yéÏ4  ý ü…¼ø;íòô§P~þB^üàÉú™ÞïÌ9ž9V ¥æé¸égà/äÆ_° &£Pî‡xïáÝwF`²êzï˜x ÓOÜ×k±Ú ¬8ý ü…¼øû3¯IÚëx~gÿ»è»È= þ›b_t89Z ,‡¼X¾´­ýË%N,o¹£sÌm[­ÛØ`hSGpötÏöWzc m鯳Óí4—B?Ë%^,^üg`¹Ä‰å·¤|tì#p¯· ÛDCÝ~ô3°\âÄò.²lòJ¾1¦n|"#¤1ö„¡#€2ì!ñ ÿ€_§vp\~»ã ý ,—8±üصìmÒIˆ*]”s„¼c; “¢#Ï=±-DÕÃ…:®ã¸§öðÌ÷[4ˆÁ/É–KœXN(>FÁڥſ(ý ,—¸ÇÒËÚ ÒÏÀr‰ËÅÕ\ðÉTV$ûd!p<öIüB ã>AdH7H$ƒ™èÝ¡à^_-J?Ë%^,á¼™F&”§ä:^Bw*ô¸¸ûy«—æ?%Nü…³üÇ|N雘ÿ¸3[cÍ}%è—ø+óŽ¥A"ežˆ„ª8ý ü•ùñ7;‘‹©­aÝîRï± ÏÖªK©ò§ó¿©‡¶Zœ~þÊœø+­‚>&†ÎAcécX"´ŸÓÐ#D³ˆÿ -×ÃèFÜÛž{ìt}i,V_˜~þʼciÌÌâLà“ ‘ï‚S‚ 1Âú#d˜ÃäÚx=pÃêhžÕÂô3ðWæ÷e?ý/3ðWæÄßþV§z»÷ûšÝ6À¿÷º»ot6Û›àÞc|² šûý­Ý.xë­fŸ¦£•pÈÒÜÙÄûcÐ~s¯Ûîõ¾¨L;8,sâpçáÞvS›Ñmîô;í^û­íýÍÎ΃*¸·ß;»}°ÝyØéãËú»UÚºÙÛŠÒÏÀa™‡wínk Ѽ×ÙîôSßïôwsïcî6Á^³Ûï´ö·›]°·ßÝÛíáǃŸÚf§×Únv¶7Kè!Ëœ8ÜÙÁüí7Ú;}ÐÛjno§…ç^3¾yo»¶ Íf§ÛnõÉ#Š•í –9qË –zÌüí*èíµ[ò£ýfËG³û¸J¤»µ»ÓkÿÂ>¾Ÿ›Í‡ÍX\n夬 ý ‡NÎ 7îÆ­ýn›,ÙLd«·¯×ïô÷ûmð`ww“öÖ^»ûF§ÕwIÿ½ö{í¢vœÂÀa…‡7›ý&å2& =&ŠÈÍ~¯CÅ¿³Óow»û{ýÎîÎm°µû ~ MLð&í'»;T¬ŠËÂÀa…‡±´ïv&I§¸ mµññ.éXxúÝ&ô^¿ÛiõÓ—á–öw»ýRò¯0pXáÄᩃöƒí΃öN«M(Û%-xÔéµoc]Óé‘ :!³5q{÷©x‘¾ŽŸùY”~+œ8œÁ±*UD s47ßè‰hÄ*³×‰Ô+í­­¨#¯–Ô? ‡þ9åçbG( üU8ñ7EW: „uØòü?ö®5Æ­$+Ï¢¡YÞ¿öÔ$0JB§û¾ªêV'Óí$^uº{mw2ÑFôÞGÝÄŒÛöø‘¥5½ƒVË ‰ì/ÐH+~À øñ +BBüA$‰?Ã2ia4$VË©û°ïuÛ·ªnœ‡FíÄnû^ûÜsN:ß©Ç=çÈëu“.„Ó³of»-Äø ôÆ^5þ%ø‹ñw4Ý ²Žî¦á¥\eZB“ þbEüÝâáâãëÉ­=1#/wÇW’ÃëéáW'—£I¸ EâXñ+’B‚ÂX…wú“ÎèònŸwÑ~<äãXŠÙáõArøÕNÆe™ +’‚H°˜¨‰WôÐä_‚ÅäéïïÚÐ@ÆdŒÕˆJ’ØUˆJ`‹”ÀÖ žÌ øhÔž»v¾õB¡½ÖÎa»þZû ¶sxKOk"%Tä%»l ·0Z€ôã°+AR‚8‹ÙU»¬(H PÌë ½1#öM£qØé¯?~H‰ã'%Ž¿ŒŸ«²šóñMså1õÙ—x|Â*ô**qÀ´ÄŸÒI”šjxáð0t'#ñ¼¨%$•8TZâPå=+-ZŸÜ%3+X_øN’-º熖{ùI@=ù£'ŠÄµÒù›@ÞT¤+ñ®´dü1ßd¼v"=©$n˜*»a½ËJ<.ÅUŒ_⩲_,8éƒf#sÔiP‘XOz×ES’xRªìIõ.+q˜Ô­ t·Ì€f®4þeΕNoуëf%r—‰<íæÉcºe©ŸžéâÓfŠk(vI·Ì:¥2÷l{8ð#ËÅ¡ÒÈÆQhYvœÀŠ¢ÀK¤Æ§¤ž»m,•[Ü5”RËÜ%$•]…‰œf® EÍHº˜[ìbŸW5¢²±\áé=…ç½ÐÄ~:{& BæQú¡`âpn‘™ðFÍL(úÿB8Y-"y#~tW…RUhYWWP(öµ™ç:˜[ ]‡œjq‡„†‡Å6n¡P÷¹RhY¯Ð,¯òŽÊ%ñœ[%žc’xŽUˆJ‚2¦2Êݸôã+åjá“DbLuõ²Çô¦&±D=èzÇ(šôâÜ+™e`’ˆ=ý»˜ôf˜$hd%AcÔD­¶Ì+ä ýØ Â¶á¶I#טs›n˜ŽË ^ìÇqaZÁñ´2m¡—¯•àn\V8æð¢j÷’Ķ¬d6aEÚ¡˜ –ãB b;2¹:¡yaNQ;åÊQ[°’è»$ÒÑ3Óõ cJº¦>žŽíZM=»(ö¬fô…jK¢xF«øfIŒÎªÄèLMLeryc¥GÇߘF9 ÂùUL+7¹'’øÈ|½¾Ã7%I)àüóíðMI 8_ ÐÔº®C°oG¾bxBç¶å@èîZ$`HßTèºCh«¸ç*º‘KŠÚ”¤Ë€óúýϔ䱀óUˆ–à œ®£8S’dÎWîÔ·ùQxŒâ*ÖñžÄÏ>,íàšü—»8ÿ¼wêr¨óÛ©¢4ÛÌ Ü$0ì²0Ç®뒈„ÅNT{µro-68ÿÄC­PB ™ËlPì`pXa#¾é³ (£(R\9â0%/ÌùŒjD%à4ŸÓB¨0”M£Ü³ã]EØw}»˜†.LdÐ%I’ s>É…Q Ò•ežx »¦$“„Y–IbáBŸW¼²¯Êr@<öz©)Éà`–ep¨¾tgJ/˜e‰æ„ŽežN³/Þ…›TÐ̇Wk<ÎÅ©@ÓÌâ¢G*ÌÙi$ t¯.H-Y}þ'ÍiY¸NȃN2ˆ?ý³9XL!FýkÛB•ñ\›W7üØMåx7óÖÏ‹¶’³Œ~Á¦)öOY”hÕ4Ó<­2-v¤Ë•¡ ŠãÌ‹¯‰äöÉlŠ5UY¦".u ©‚Ë ¤C§~RŽ™+´K¬TÏlÅÊÖ”Uô Í¥h+ÓmOs[žÔ®cÙi;ʤ¥œh,nçt¾¹™[&”öõéw«¶’uºäZ :F#M;|½C½T\;Y®91zF§~³l­¬h•} ^Îœõ±x©išê†wjÑy¥Vâ¬Ä©`%òÕm 0Õ_)_n!éâ~îs¨:X©&Ý‚&Ý š”Oë¨k²Ú‘Fw?yr‰%î´ÎŒ¸±Z[Ÿò©@u}VV\®ÑâôÁé__X©>E¬œ>EÒ+m}Ê×KÔõYqí¥Š:ã_HöÒJ£f±›‹š­iJ—Í5"ÍJKð~9Ä®T¯"MGN¯v•^>Õ¦®×ŠÓvUŒ5þñô«¤0гˆÆ@oJ'´4âÂê“cåêÍMÔ¡…$Vê_m«ÚÖ‚ˆ0ù jfd•%DáŒÜᬌŬTŽ( 6FQ¿?.TÑy8ÌNNÛí†áFs'®] 4¹öâ¬èN¿‡nÃóS“.²(²`ìL{Ó!›ØShOïôôÑtj4‘=W$++º$*eåkì¼xµsô`Ž‰´˜Sú‹AïÁ9äuÇÓ#q)1—ׂ· Ëp(IœÍê ‰‹\;«úzœªÿ9t;cß>ÅúŸµN×ÿ<«ÿ÷T ê~× /|ü…ïþxwû÷ÿø_xácËêþò§¶¼Oþì¾wáíïù÷/þØ;ï|âþ;ñö_þÞì·ýÈOüé;oéÝïüäÇ?øÅŸ¯ï|ñÃ/ýê/üö÷®}Û¿òþÞ{óϾ¼ñõoþÓŸx÷þö·¾ñÁÿ¼±ùõŸþƒ¯}åþ÷ÿð÷½ð_úíÿ—ÿæ½î×¾òþË—îWþõp¼ñWøKï~õ¯ß¿÷é;~óßþùýwÿûwþîïýæ?|ûwý×:>xýßÿÆ·þñ«W´Âÿom}æμòŸù™èÏ…Æ>Z5NOÕÿtÙúQˆWz Yÿ7£XÿÝtˆyÖÿŸÊÀÐ,Ÿ8u`,p—p#âTÌ™ôYówöx²BÿO ÿ®°ö¯x”÷Ó¦`fÅþO,ó¬þ÷SyœÕÿ}:õ§õ3Ï*þ&SgÏ*þžUü}¦—K÷˜€OIhWP»Z·«bY„#¶ßu–íÇÕ¡"\]J;¹ë¹š’œ‚’lM3È+å|Ü ½Œ-OG(?OÂÏHø:$‚<‰ #èó$ÂŒDøÆœFµ)Iž‘TrHS³É“ˆ2‘‰y2tHtò$:‰Ž‰nžÄÔ|µºÐQžÄQFâH‡D/O¢—‘èéäI 2Ã<‰aFb¨C¢ÐíF =_’'1ÎHèÔk?œäIL2ò$e$©ø³ÜJÊ¢¢äù"áù%ˆýn?xýܵ[|ÈE´çMóá{ÝîìF‰5ôÈvDØo“½ªð†Câtù©óM²Í‹xu”•1R¼;F>ïö{àÄfÊ7 .ì\î ¯<±½ðË3W‚C€….C$ _NK×Ç ]ñî¿ÃèÅÍÜ^ôYÙ÷Ü^ºóa–cÓȵ8¦¡K-;ô7m“Ôp Ní¶{1QöôR?‡‡‡^¸XrA›f §>˜aó“€sPÛ ”¹.1mŸcâÇY´Éõx³Ä‹kËIº)IâÀ‰ÃñB 0"»–Á-›„‰½3’e$ˬJ2û~äE¶cy‘…€Ç5q@CƒWTÒ–!`„:nÀÌÈ1M‡Ëò)6œÐæŽøÌT”lr|8(“!» Ë¸åX¦Á ½EªÁ°±<ŒÅ†T¦vÁxõ¿TgSCÌ™ËBløŽ]*ZSB"à ˜gžj¤e͸>0í‘eÛ¾ùb‘˜›Ô`¶Qß'óÍ°X„d«¬R»û.÷#“Ù6slƃˆ{`ecÃóˆˆJ:ÚíN¼»‘Àr0ó\—»¬‰„ &jÍï¼R‰NîÀE"Æe‡>±‰œ4ð ¬"‚kG~AÆ؉Àœx`2ÓÆÌ7€‰úH*"t䦔ÉàÚ–Zâ<îú3±m8ÄåH‚y°åc]—9ÜÀ.ôof:!%ÜÄŠ2Ì6¨ÈᙄP—ÂÅLÊ ú†‘À ƒ¶`aPAu’erd»Í”„ Ó¥à|-„&á¶Ü"¦Å"¸h!”I– ¡ä1q #DòmClâ;­È„6´hŽIíRé½Jú ˜{\øã:T´LÈ ßä0µ|» þyÄòÁõE€vÌpmjàÈr$‘Àð"ÅFOöÄ©á(È3Bnš& -—š.\Ô|Ê,,6sW:. ¨o¹&³\è3Ý00=M(u°b+!D€0ý($œPvÈÃ¥¦DÆ’KÅ‘ås´5‡}d·æœZÿ-n®ZÉCéú阖ujÿ‡ãà³õŸ§ñ8[ÿy:ë?Ó͉¨•” “´g«Ag«Ag«Ag«AÏÅjÐÊVòò\Ÿúp*ˆ?Ç_N'Ñrçx—»¶(¦ ;ÃCߊl; fxÌ©9–g">Ž°™~Ên¼LÔ¹7 ,6¸-f9˜K ‰ ‡¹¾ 'pz‘y¾7JÖŠÒ«d:P› Mºå¹iÛÇÞk~’496Å„þ‚™×„DÙÔkq}*ÑÍ~6QZ,ë×Æ+Œj=6G5ÛE_¼Ý`A*BI*<„*d2$ééšOÍ?—h;Ÿqèòã>4“ÙJÎ!¤”iH<.-K74_YjÉ×bz¼KòÀ"¥,CÉ…ŸºÞ%YZ‘RÙ±½Ï<ÃÆ,Þ[‘Þ%©V‘Rê¼g¤wIÖT¤”6o©Þot†£1zćBó›ÈÄ&݀ѻ±½K’³"¥RcÏHï’°H%¬Ö%ÙêÐ|¶ºÅÚÒ»¤]æsÙ-¾äJÓžéñ/2¥´y¹Z‚›³TæI•À¬b ˜Áô»Çy8ôºøýn²>êu_‡¿x\¼éf6—¤ÍCŠióžþ%€¦˜6O(níððpmíp-~Í?×ææòPzüK@ÍT¯¥¹?áu£ø»)ŸcxN2^{‹ù²žÄäLH“ þ–åæ›ã?æ3ã”Èðø‡hÆ?š@“ þ–e÷›ãÿVÌÍqÂ]l? ¯Äv…ÒãSþ“#ÞßGy4ù—àoYšÀ9þSÎ2þQŽW”{οÐä_‚¿–*þž ö)>Uù/ É¿-Uü=AõêüçÐä_‚¿–*þžÀËÉ¥ø5ÿ¼´àxáØFb5÷/ehò/Á_KÑ:$v߃g ž:韠:¹œøú<}t2o³+0HLþ?-û«ó›’O3ìKOjêB‚å–*–¯ì¡Ç¿-Ár[Ë·úƒã¡X{B¶.B`¸è ×‰g8ÆÇhßvF—[“ƶñ¯±ÛlÔV¿ËmU,Vú—`¹­ˆåìËpt2âèzku;ïøŧÀ¿ËmE,oò°#Šàú“x_؈¦ÓCÉêŠùž˜ó£µdÓtÿíOÆÕø—`¹­ˆåGý°u’ÒkÈr4àãÎX,Z†ýGÞŒzãdsw¿ÛíN$Õú½°SȪ¯É¿ËmE,ññæc›¿.ÿ,·«×Wy:üK°ÜVÄrs}® ŒÄRVjû"Q<:šŒÄþ‚±}BØç‹ÁÔïöúcèõkºüK°ÜVÅr”¬»e÷Aäì:¾Ñ¡`ô 'èñáúcë_‚¿¶"þZ§õzÎù›LÿЙÃIÀ6Aþ þ:êEÃ2¨Ò(5*}þ%øë¨ãoq!¸ÝßÞ§x¼1v¼îhæKcç¯ÿæm]Ÿ þ:Šøk¯£60#'kÐ`€%Áûq¼5ÈçÑB1Í{aè&¦·‡ý£þ˜£Ä¬Æ#mþ%ø먗€ AÅ€ÁXJŒhÔÆŸÈ!ìhÀsÀnGïP\/ºÑ(iMþ%øë¨Ïe?ÿïHð×QÄßö­F µön´ïÖšuï÷›{wÛõmtýœ¬£ÚAûÖ^}ö³µœŽG+É¥¶» Ï{¨þÚ~³Þj!øR9$8ì(âpãöþN¸1šµÝv£ÞZƒ`kç`»±{s ]?h£Ý½6ÚiÜn´ákí½µXºÓ?Óå_‚ÃŽ"ïÝ@·ëÍ­[ÀDízc§Ñ¾+øF£½+”{´[Cûµf»±u°Sk¢ýƒæþ^ šZm»ÑÚÚ©5n×·+ø! ;Š8ÜØý¢úúnµnÕvvòÆs½Š¯]ß©'r€Ñl7šõ­¶h¢ì]Õ~ ÁaG‡ÁVÀêAù;k¨µ_ßjˆ7õ×ê`µæ½5aÝ[{»­ú§àKpm×n×n‚¹\˜³2Mþ±‡±"Ï7tã­ƒfý¶h°­ÖÁõV»Ñ>h×Ñͽ½í¸·¶êÍ;­zë ÚÙý÷:hÕuã8,Áa¬ˆÃÛµv-Ö20FL »9h5bóoì¶ëÍæÁ~»±·{ÝÚ» † R†·ã~²·›•¾ý` cEkßkÞJ–wà5t÷VŽ7Eçãi7kÂÐ[ífc«ÿHÚÞk¶+Ù?–à0VÄᙣÝúÍÆÍúîV]p¶'$¸ÛhÕ/‚¯i´Ä‰²ïÖ@ރؼD_‡¶ouù—à0VÄᎭŎ5n Úö†°‘”Gp™­Fê^ã^±u+íÈëý–à0V_S~&q–à/VÄßù]tkñ½éɆ:ˆ<¼^g0éB8=ûf¶ÛBŒBoìUã_‚¿XGÓ ëèn^úÇU¦%4ù—à/VÄß-!>¾žÜz3òrw|%9¼ž~ury0š„ëÑðåã+±âW$……±" ïô'ÑåÝ>ï¢ýþ$xÈDZ³Ãëƒäð«ŒË2AV$‘`1YI!í'gKD‚Åä9/¤m “90V#*AH¢^®Ó º“Ç69‡àßÖ ÔR‚x¤ñÊùéô«°#0R`¥ì ;½Uø‘!Ul@‚¤%J„¼º´¤¦Ãf‘6Ž¼`Ø%·íêëC¤ *±Në“q§[•q &õšœŠ:Ï3>—F›{*Áª\ÁSUíVŽû»ã+Š!Zå†*qÓ´Š›¦7MU2—Ä PŒÑ&J+sŠI­‚ñâ½l`ßiÕ7Ñö^ú€.‘¼ûƒ¶¦Ì¸ä·ï¾;¶ :hÜB¹î¢”ÕK©ý qr¦ij2¹†þòûª¨¾ÿão•ùG éØ–z€V É–$5¥ÖTXŽšCJ¿¾D¯Þ¿|i»ì±·[ÄËëÆþw''CÔªs4†¨Ä–×Cµ¼[ôÉëCÀ÷-Ógµu¢jC“™t;Ø@GÍÞ9›ß!ÎÊr¢~-…4kæÇNKEØòú`È¿¼}y-é“­GR(>iFw¢HÙ`Ý:eØš¤»e®¼¾ó–2éHà,ç>s5÷cñ„²ky}0DÛ%;[üõÃßÑåe›¤þÚ¬ µ¯ÿ·¹þÓ,Ëqïöòú–q#Ô jÉ–Ú»%½¼î.N1Pâ,¯;°P‹:-vA:¢xöBu·ˆ—×xæ~Æ&ž +õÍeýyÿo¼#ÞŸÔPPˆû…v@qÖ¯ò³ºkþ1é8Œ“@µ™'A"ä,ôs,Hd~ÎòHEÕÈèãŤyÇ"£‰Gã8à 4¢4ð³<ö2Dy7š¼ÿ´µk¹à ¯å1 o¦½ª{¶«(tÁ½BËÕ”Ÿà~ù‰P@©õkB쀭_¨aÐh»ª'ú»û9òœPñ€wUŠRMiOéÉ8 ÒŒq?ÍØ( 5¢‘€õÍNdCXƒ^ÛQj¦—"l‹0@t;ä·BW–ïħ}’¯ÓkD@¼+ðŸÙ” q?ÁÐ(@㸯"m׎ƒÕ$îáxTèÈÜÃý̽]+gžMr'N•”ì(zyÀÒIÝ’Œq @$v9Ðûü¸!Ð9É^š*¼L'åäêãøõ–Øsîó㔘+e*0Å38¤a2FîLijGQ˜úyšpOÙ³Q$„Oâå ‰8åê@#ÕÏ6†#Æ蛘hxYcó ãqš‡I,hNs.°çeIO¡©C >³Ó©ß¶L°Vc@F!¦óåê~ò1‘AN€ôB2H/´òM¾Ý`Þ5á‘Y„dKá6\çó,c¡O½HHO2ÂcN&IåQÖ¥—9?U³¥wB€lE²%[±ú÷ˆ.ëÔ"Œõtv+X²%“ÑðnÍG ÜÂö&éûE¦êäURçd¾PÝ´s„….jk2³Õ©euǧú†£ådÎ$’- ‡÷Ž[H7ø®ºU#¹eK” 1GJιe› —lÉ%l/ÑËηïP9Ã,»õñú±<;s™I„Ä‘èM€,@2È´õ.ê%g9 ëô²þ,1dé‘þÁ%v@ÑÖ?MÄ( `¬ŽøøóJëìFŽøè~6Á2­ƒt«½³Ll¾ÜkÍ;Žg–G|ìóãdÁ ïŽôÏø° H²þÁV@w&äXXð°í¢Nˆ¾œ?Ú–²µ\!2Èzˆ=nKE@õ{ªÛ”é+#e3Œ­3$ÆL~{±âáÕrò?¢hLz×¢<ÛZ @ñûNÈ£n`º8eÈv"c²Ðhœø6¥ž7L€~á¤×/ÜÒ0ºx“~o; €ë·Ö¶º3áÇBZgQÅ4Êh"xèÅaFœ’ˆæ4JqJ¹™Êz¬¤³<Èå q‚ƒ< Üóƒú¦q˜Èjg·½fU>ôÛ/ @â l Š÷UeI€Œ)¸Ô¹­Çóe-,g¬`[™œI‘ÿó7Ñ F‚¡ƒÛ»õkk#é¾cI¯c¬-TÀdè÷qµ 4W%ýæªv@-iÕñôOtñ€Ž§Ä¶ãéŽÏk³©ÖÞ¤Yî¸Ýqü€°µìxºÏ›‹$ ’~ËS; €H“ÏGvæ¦X ˜‰@~LqœE$ s‘'IL¼4‹Cc©N¢-9£äâ¥SľŸ‰8É)É)á'r?öh*z¹Û|ZÌ¿ $ìh?:fTzR¶äxªßÐ( ý¢Q9¢ë]';Hù!‘K¶æؤ $ÿ~òP@ŸF}\3Æ?È®Ð|Ä}ºµç¤çñH;NÿÖ#ÐÑŒéèG€Ž~$뤻ˆ  ‰G¹è@[>2¦-Úò‘1mùGveã=°(…odWK½ñYTdgÂ…ÁHœ‡$æ^¦Ü0bTPŒsCVY;ÖQ‰V;1I˜z˜³DÚ3B–rx¾Hý0Ì™²'ziŒâ÷z­3(r<²l.'ÖF@Dz D–»ã@IoŸc¥îåä,¨ÙÄ¥wKWÊaËžJ9ãäR@YÒQY/G5z‡79i•ÅüñÒwn-Í‘w6Ž-‰´³_£šŒKA—HÖøt!³/ ´$V-·UñÙBâÿ‘ìœ<Ž©cË €ê¦.Ì‘Ì(z:FÑ­‰CkÄqrè‚Hz]--- Ýôî°_\ (OHúù„û±_| •Çï§òüË츻Éç{#£ä"ùƒd{^f>¶äã1¥û>·ä÷ó–v-3×j Èoòwå7=`iI~?-É èÎ^EÎGâc!R æ{ú$±0 Ó$e¡† W6¯:F{Koè{öZ‹i}‚}|Q§7Eó§,h²äš,ï–Õ¨¥¹ ÕoÙ± ó„0&çO$B‚(—¢2ˆœ¥±'ee…j›¨;÷˜•ttò,ÁœOú6P+¶ž¶âÞ¿yñD_•ÿ¸®ÏF°žÜn3Èt€ê¾ZwAAºÙ tz‡Š.âÆY3“0"©ßü4fLR-L>4­Èë\›“+cd×[ôì6èüAoª.zLy£%zÂ( ’Ð,öbæ¹\Ö‘GÂ4 ‚˜ Q³²iŸ±õ˜¶ÚmpúƒÌ·‚T¹-ÿ0\Ò”äq€Õ~&^J»îN¤AÚãgdy-z3rЩ«‹#­,ÑsÌ"z˜I§-‰DFœSF=ž$Žëåe@:àgä–€-‚ûpPØEJŸ@¶ü$$ÁYDišG8ŒTçg8%Y–Õ‰F ¤=zÆ%/Y"È8ô‡]ä˜KäDRâÄ,‰¤–Ï’”Ǿ/’ÜRžùTòT½4H{ìŒÜ–µE`…ûýR=Ú{²F%Ë)ˆ0Î’˜ø£û˜z±'IÍÍL4H‡µ5ÎÛ³E`Îù#Â]>méûöᮮ뵦í@ó©— ié‚š>œ¡YUüM²Æ ¾6fp÷õ>ýbÈ`6†zG@&¤²»H¯ž‰|2Ÿ¨,œó‹³T{mÞ½^«R”¦¸mªNâ¡-;ûôö<¡­7s‰±žËµ…Fgû`í²)|Ò‹V áÓGÇ£*1ÐC¨.•hÎqãçë¢|Jò|Â’Äçx)~?"U/úöè[ÔzâøÈü:‡Û˜Òë1¥çŒD{u^eÿâ×Ä‚ÃáàHBë-ö=?oÅÙ栗ª-Wç5÷Žeu2$S¸auI¤ÐH ò`g&ãÃÿݲ£¬@Û <@~H<ôå‡ ùmRJLœ™Òžå: õ ݲ?‚#4 å²×,ˆ˜¹1ÈÄ^5ŒŽen4Ì:ê覱A×Acó—Ç(lýð‘‘hí*ï=¢Ww+Ù wÝWÄ ½pʽ#ÃY€2ók-Ÿ?ü¾åÝ釥ÎQ×WìÌîæKašôŸn·ÿVCFZ%Ô­e¿ÒÓÊ樊šїYæE%ÍŠªoðd‰äMOФB¥‹¥TwR‹Õ¯þÚ(Ï5…SVª–é’LRq1.ŒOæ7—‡Þ¡þ¾Z¨þ~u€.*3ùé HÆ“›Ûê…Ñâó÷ê&y1k.ÖŸLE.oñNC13÷ õ@eñAâϘC ;¨;ÚµíW³T©v6)n›ŽÍêU¦†xV•æO£=õ,KÄXª›²ÂsǾP6ƒÄ`‡yõ=­ñÏÙDzø„×V”äL3Et!ŒÍ¯Óɲª/ÈKÓÉÆök[z¾W?³ÉÜÌÿ5»ÙÔD)›J>¸ †ÂŸ"žXv½Zÿ|?u*Úª,u›œ¹7—¦°ÐùŒUÌ Î,ÕU¹ úšò‹º£ûQý²õÑ‹³ÕÔ³¡jߤƒoâˆðýÎK¿±7³-°Ì׊ÖVØjZ(Ý÷lj˜fVÈkÙØRzlÄ@)Ãÿ‡k$×?/W³+ï”xh†ôÍb•ž°ª*'ŠÅÕPP3 i¿öhÕ®¥ÍaÏ2¿íû Ü–Yýi4îƒ|ËÁÅâêB%V^}3™óé*úœçMÒ¥˜¶S.£ŽCsx¥Fcº öLCº8[tß'åþsO‹é”¥EizgvS²™v'šÙoñ#%„zÐ=Ìp17Þ‹r&´’Qäžqä{ä[µ„^-ÅŒ-$aÔkô{®¹Êõµüµö2ºC“ãZÜ*©¼¯VÚ[!¨õ¶í‚¢†ü+ÿ˜¡öR"…–Ò€ùëšqôk¯Íï5’Í…俯y¸V®ÖJèL(±/ÚéRk¬²Í`RÅHlIµ#‡¨`]ª½ž[ÒÜsS«EC­uNg‡›ÕH:,}K®´*1Š¤õF9”I%fç,Þêˆ)‚œs«SHDÆqeiÆC°zLë§^ȧ^JM¨H3¹‘£,•êȪHÒ˜ùÜg^‚Yìá,S~IÄr„’mþ¹%&<ûuN­‘âˆÍé:†“Ä÷¥é“ª=ø($B*V¦Ü˽T7ür§œÙ{íŽwµ,íÔ’ãÌ‚å„{ŒÆTŠI\†^”‡„1yº´ÛËKãã(Ût`áq¨Ïonk蹢ʚ,ëeã²f¢békϼùb¢?÷x»ÏôM"CÏ„‰Kë-}Ûn,FN5ü7 lqõN.§<~}‰^É¥X"†TXMA§îXž¢çŒß¢y‘­ïPGÓ­–"_MÑdžåÌ„äLíèV®·Êbjb®ú¢,t̤*PÝ-Fű?MÔÁrêr1½»Yɦj÷x&>åo§èucÔu^4cw(mNÇ[*ðÊ×c\¨N¹>FŸnÅ\UÅÞQ®|~6W2ÔfÏõÛwo^¼ú ¥|{-ŽÛGñ±y}æêY…š=uêOÏ_=óâé)R(^o5O'iÉJ©—èS1ýªXI¤þðýðòåúí­9ž#-$ßÿDârq‡DÅOÑl% #gž©Ên%¾Ë9›NïN‘Ž]© Øf_± ©ÒÕ{—b4ÜåWå¦B!UEs-Ÿn‡ÔNM ÍóîáYAÏ ¾RFk±ìúulÎoÕúÑiŽ–Šî´¾s‡ƒ_%÷UÅ&jÜA™mŠƒ¦‡ý…Þc@›¯ÙàÞGñ~7qÅóµGªw=šœmÖÛøèÍ7+¸BÂâêi1—K†MTFa˜øíÓâ5ÚxN{â#¬lÅž·FR£YGŒõfͽv‘*ènYga+ÐO\€Äm ¦ÁH{- :£ØFBi ƨ®MlsU‰åhêp›´yz½aw€ý?ö®¶«m Ÿ_¡¥gwZÀò»éÒ³)¤mΡÀ&¡Ý9Ó=¬üž†˜MB)³Ìüö½’íÄq‚%90¤MHìD¾ºº÷y$Y÷*¯§$ÎHºKÓó…€áŸ£ñí™wx_*¨]·rÅMC8åJQ³ÈiVJ²Œ3-„ |‰‚Xæ¸Ù‚Ø[ ‡¤ÀÌäó7DîÃDùÓÃÄe†I9HÌ ]–Åô¯“Û[¶.Ô)êk¬kA™•ÃB ‹1¶™GÐdr&žMì»ÐðoO<ÐÐÞþf¦7^–†)¢¬<ôÜ%Þ—`࿨­³ lî8kxxzð°î„cƒÀÄÈãaC•¹¨<– êuA!hrÆølàE‚§²™–ºúíoÔ3z_P,+?La>sæMV–ÉíÏ Tõæ¾_Ø3±™+%Y*_Š®ÎbÍ,òÇìïsjV3©&wr§)åwÄ¿Ûñd~ñÀ²xzx¸%]F¶º˜ ‡ä–ò ¦Ù0E|üèˆÿ}!óc„ùˆ}>{øO(–ZZ‘ƒŠér‡%¢“ÍÁÛr“O“ ׇE mß+JˆÍøÈö+tÛ,ö+¦Ý&¸X­õôàb¹Ut9¸È­l[/º“1dv~r¯.¤P)R¨ŽëäzY<:37:t…E?ú•šè+ KHžîPPbhÌÁ5ñùƒÜùr”¹áä¬â‰EÆ=‹ÐÅAù‰C¶ÚoI¸oÒ%VÃ-Ÿ":([iÔ˜®‚Céê!€Öq~­ÑaºÖ¨.R0()N ÷ƒŒ D5=žei/#šk-iH“r²ƒO#ঋþ꺙èØn$O‡áKøTnè.k÷ö¼ÓÏ/®c‘ª,@zO䆌Ðù$>Æ—Ì8Š¿¡«iîþF§1Ë’m™Ä*'qÊO(³N´~Tá³ù”Îÿ£™¦Žçòÿ˜Ö:ÿÏC<Öù.ÿÏt›Ïu u u u u ?M 2ð L@zaÀRجžt@“BkÈ dkœœ@Ó;•K%ZXÌ$;Т³ëAIŠ ¨ºOïry¾î¸ºg›ïy:ñtlé~µä+È]“-”áË{Úi ÅÊÖ|™XeS Ó…’ Ýu4]ÓôÐVCG·=ôu¯æì'•·\YI‹ñëžÛŠÓf²z\¦ÍTP™c»–:ªbÍÞ£Y˜ àFÍùªo[±’FãW>¿§Õd5¹L«aÅ BÅstnëF,_ÕußPˆSŽ_-·Õ¤7âZI£ñëžÛÑŽÓf²z\*“ƒb8Xutß÷œ@Ñè30°k[ª©;¡¬¦Íä·YI£ñ+Ÿßü“—èAR“Ë´š¯âз´@1±úªo :'Z`{¦©zJµ,'ÜV“Ýy`5nÕ§û4ñz!’Z\*£IãEƒ)¹h°™ W4ãWR8=‘¬¾þé‰*´Ó\*#zKF³ìŽ»KFšÌ¶e™~FpÅWÁ€%¨Ž]:õŒ¢Ë«~0½w~AF4!P†ÁpµÙ¼;I"±ÔEňlyæt)wµ=‹ö1z¶Åb†93]«ÈÒ#ëOo¥ouš-Ìõí¦ü·är“i *VàÄfë²!ÇÜxí˜õÙøzÍ™_Ü¢Ìf -ÙÑç—RfApÓ‰J¡u;ó%©X-–$¾þqAq¶V,n«£ÌÒ5~ÊÞ%Û!*zWÚS©Ï»Xõ{—x µÕ{W¶a|æ]}âÏà]ÃÈ'ì]²ƒú¢s%£íú|‹–W¿kàZb ‘WîZºí̺–H Ç£zVm^URÔÜòMKÕ ‡ÁùuŸ gUêís…ac®°Q.ôBÆÛnƒ[^ð-â†ÎfšÖ¢Â®†y$*Ç´š‹ÅV„™Éǃ”Ê3›Eä¨/SØtÜ$SXÅa‹pCÐ5Q+º$çÁ.ºöŸÿ_9s©iÿøâûÞMä/vü_“¿n17¡‡pr$wßE¿BX»ú–;’˨»‹~<¼ö"Ÿ wCÀÉàÇu⯤ñ>è Æ‘GÍaDúŒ¶F@°á«~ûá‡DîTÞüEz‘ß~˜©OœfçÙ$SòK2<»HILC»'ŸýhtÕ' ,ëýÌв«ôc2ÞE4|ѯ¶hÈù+)ýÒnÑVƒ®™™úèe·Xú.ÏÌÊCRq&Wg+ ‹õLœi›ô*nÜ÷ïr"ã(/cîkÃà* âôÝÜ®â$Ä.[©šœöâ~<ÜEÏ€E›ÆArŒ®‹Ü]?¾Q¯¾!œ>‡ç.y€Ñ@ÓeÛy‘û™xiðg¦z*¾Seô2§¶œŠ2[Êév÷"þ ,Åu“‹r%¶¾Íª C‘ú+Pgöo+å5Ÿ5Óí4~RÕùÉÃÉÿÛ:ëÏc@X&ÅÞÆ:íB×\à*Iÿß¡ ˆõ3ßU°Ü±L³‹¦zÎ(6Ø} é^¨:0ìÃFèX¡¢;¶‹á„‘åÆß²B¦9Ó7ÐLÝ蘭Ÿ¹¹ˆÆРišz"ðsUæ]6WåßÖèü½>æò¿Í¦±­å¥ø¯kà¾0þ3uC_ãÿC<Öùß&ÿÛ$ô¶‡ºÌ¿Í µNü¶Nü¶Nü¶ÂÄoõ&DËj<ŸFîé$~[,IRGºá³ˆ®Îû±Kú³¥¼KŽ ecËÕg PõbR!8À>³/§wrç‚~pOô°x'ýuÒ}™˜I·T¦8nŠ·¾WÏç6µUÖKëó.¦ËÆs÷sXNs@CÚàÛ¬º¹RÃ!9¿LL4w”N~åòõÙð; ažI`ßįiÛâ´Å³é¹¤n‹ U9…ª3…2Ê ‰ð;›/·–}lnNlVHv#»6«…r3—ÚÜD‹sÛÜû•]çÈ®‹Ëþàz78²Këù~XÉCVv“#»ù„õnqd·–ÒûÛh8£t?‡]¤);Š¾£*Š]‹ÞmŽìöֻÑÝ]êŠX)¿"VD´%wI»`,rÉÍ:ròsˆ «Bò£é@pÚÍd BBº%ÓxÄV#\ÅýÛ‹À’>~Üg‰7ƤÿþžÀÿCf¨ròsÈ ‘Ù#êŸChXˆÐ.5ÎÎγ{Í?Åãgùcs%'?‡Ô°©1ùwØ^wfŸsÇ'Ÿèë]£PIù9Ć…ˆm³²øôßçeäç"7ÿî÷ß¿û=yÍ?ϽîœA->/!?‡à°ÁQùÑ;t·‡NàÝ<{¿Ç>í'ÇÒç^öºî>SégZ@R~Éa’Käï »þŠS9xö3YÉbùi??+T@N~•C™ªe2ù›LÎ~*çž×™¬ƒÅòÓºÞ± äLHR~ÿªbü‹kLå%uHdõgä‡h*?*T@R~ÿª‚ü r¼gÒÜ&Ò1ûIäÛcv…Òãù¡ï?£|$åçð¯*Æ¿TžöD²L~”“åžÅ×™ HÊÏá_U”ïPoNNQùg* )?‡UQþ½C­êòç+ )?‡UQþ½ƒ—»Möšn.8>sl'±šÏ›Y$åçð¯*Ì¿èÝ]%v?€gžº‹ïкÛJ°>‚§‹î†wˆ°Wðõ v"“—ŸÃ¿ª(ÿþí™æ¼‚AbòwöÓ}e~SòiÊ}éáÉQI]p¸\åòÚròk.×¹|?¾ºe+ÑóýˆMeœ"6Ã1¾E'd¶º×>ŒmÙ¯}Ôi7k‘ŸÃåš(—?–þ9\® rùsm Ž^ô¦{€ú‘ FÁ‹ŸÃåš —w?%›U³¸'°Z™h€’;(IÙ èÌ05ÐM4¾@ñý¯ÇÕäçp¹&Èå—±…4ÃHß@d +šÿsLo(^ 㯑oÆd\'ñâ% H«ÉÏárMË©Ä—Áxwió—•ŸÃåšðXº®‡¤ü.×¹o\`Doe¥¶O·B—×#zïLÒ4Ä¥«¼ îâ1x}CV~—k¢\Ž’ûnYªÛœ]SÇ5z¨']Òì¹ËêŸÃ¿š ÿªóú=çð&Ó?8³í › ‚ü:‡uѱ4š@•vÈr‹ÈËÏá_]œgoä‚´;t÷,6Å{IÆtM±”?»ÿ›k´myù9ü« ò¯¶hp!-8ÛW›\-QÙoÙ²7 Œæ³D£?»Ñéía|”˜Õx$-?‡uѱ4èTüuôHc"ãp|C™!cØÑUàQšq#J¼CJpƒ„êF£¤$åçð¯.>—ý(ø¯søWäßÞûvußö>5;-ïO:ÇÛ­ôæ'8ÙBÍÓÞûãúÏš]8ÍF+É¥ytÏŸPë_'V·‹àKUêÁáa]‡ÛNÛ 5T£Ó<êµ[Ýtö÷OÚGïèÍi÷ÐaûC»_ë7Xíæ&+?‡‡uA>~‹>´:ûïAˆæ›öa»÷SðÛvïˆ*÷-h·‰Nš^{ÿô°ÙA'§“ã.4´ÚA»»ØlhTÀ!ë‚<Ü>ý¢ÖÇÖQuß7óÆó¦Šo¾9l%õ£9hwZû=ÚDÙ»ª~Àáa]‡ÁVÀêAù‡ Ô=ií·é›Ö¿Z`ÍÎO jÝûÇGÝÖ?OáKp4?4ß¹²EF;›/kHiÚæp’-ºÂôžÇ$Þ#ËÄ–Û‡µŽ˜Í¡&ûá#<äF`6‡žl½ŠUrÃ6*ê”ùØ/çá!Øs5×qˆê®ka˜†îÃÅV ¹tZ$Kv'½¿Í¾·7ñЧÀ×_ãÈO¿ŠJÉÈö¡ ÕP1}Ï÷Ã4L×Ðl‘ÓPãFÉ•Ôü®!ÓrX%?ÃN* Cì0P\ÇV 8®¢›ªcxPßÕ-v{Rhšž÷^Õ°MÍôƒ¯AÿúŸ`+sHÏ™%=$&Ã/ P„ÜC¸’<ô½¨éqØÌ©2|s8$ã8e5‚÷š†¨'«C˜Æ·e`€e‡.Î ¨=ìÇ7¯Ãx˜©ýù/ døö/Œ¼¹àÓË—/¥*g78_ ¡m¯>O}%ÿÃdôÔ WFÀIþößëxüêîó8y“–ôB¬õ0'ÆÎË›æ¿ÃyáVˆÂI#Lœýeí.ªýrj€óKkÿåÖš«1zÞý«ÿâó`¦U2Ÿnr‚óŠ ú£@ΕÊp¾µÑ†œÆÓô%¬§r´…óU¬¸-á¼°òo.X–¦{ YU0'ÚÎϵ‰ký…±Š°œpŒ‹(;'HÍ°Ï Çx`ú9¡ßÏç0yHøçDvc\DêJÂÁoVŽœ°nŒçý7Á’9¸‹‹¸[+òrÂ¥1žG^4銢'¦cšÅ å@&.Bf ,4‘Û'ƒ/,o¹$pPË ä½X°—€z Ýo @àÄcuv>p}±º|Gµ"ÃsBxq1„W¬Pú©óèw¯¹ž°íð’üZ—4ä ]Ô<Ó²aNÈ,Vç±­d"ÚJGÆÐg±UÕó-ÇÇfHw'öôÐÕ\ ŽVî=4™lŸŽÜ“ÖÔe‹MEòðψꚡºUµÐò¸Œæ*Ä°p€uwãu¢¬d>ñ'a£àÀt1.W¬Púªóè+`#Œé’üÁù²†ÁÁmµ8±ð$ Ã×ñÕTÏƶI4_ ÔÀ5Óuº6sª°ªÆÁá¢bЭX¡jQ9Ô²Ø8ÈpHnñè½ ’õe“ä|•M…ªŠµyª)1•lv-$aèÛ¶¦j>ö=/$Øô×WHàg[3ÏÜ°[Þ^\bË m‚mÏÅݤÜ×]×!Ö`,íU´NP,.ÅŠÊ¡,M8}aÞVb$EÒGôF4 ¾]Ñ Ÿèm]9Óà0Ÿ¶€ùîm%mbªë*Nà(ªfÕ³ÝðlŒÅUü{vk»¥ÂǶaú: =¢šðjû¡ê)@7pmЛ_“ ÷Uí‚ÃÂÅ`W±B9¬¥Í.¦3{òjòtÅõ‡ža†®çi:°¯­ëŽªyšgÐ{ÉÞÛäµh8 ©Í3d2°{ùRô ’+‰ŠÊ!MbpÂ6—™p‚/±Vqþ¦úŒ'œëÜ©©Ñ’ÌH‰)‰õE“:7VâBb}ÑÌŽ¬p+—8QŽXŸÇwÁ©Nü!Ö‹Ñr9¨XŒ +”ƒTz©îux« G«8='Òë"·Wà^8ÔçáðÁ\‹“z&h‚ó† 1o‚–ωDÃÅH4±B9èT *´4Î@`éB@B?´?Ô|=T\ÕЃ0¤]z[ uÍu™d¦²º¥ Ø7ll5 |Û4UÍõ”À²<¢;¶jéºV\rðÄW.³<'À›E*]é2Bw¿QäÄYàBœ… r-p•@ Ì ´ÀÅ@ ¡B9KŸqÙÒçÔoŠ<) +]¹\âøÆdÍ’kšj¹¾ÀW×|+®áh:Ư§ÂkóŽÿöζGŽÛÈã_e#eË—&‹gè…bëÛ°|/ØMÒdµ#Ì®âË!þØ=;OMNW5wfwt¸ àhWv›UEÖÿÇ:½dà`¥ ÚZt•ÍhÍñÌ?ÌÜÏoå#²m¦ÇáI‡tÛ¾ÿèÖéK’W½KqÈïþóýýðý›ÿxûÛï©s ø4EÛPjÙàêïW©aµ-C¢F=5N´l8ÓôËõ-CBI]¥*K-»YuîæQ-C¢IMKd-F“çØlž*[†“5"h†ˆ ™Étf¸Yj;c:¥âÎ3U§·Âunl[~ ÷ïÓ|®òy°O>õ÷îÃÇoÖéþw»ò’ø¶Hø`Ê;ñŸm+v«áåþw»yøÐØí ˆ›™ñ¦œøX$B0tAÛ:ÜZßâ1«Ü¥J8Ø`g­ã’©®v]»N'‡ÁŒ³‡.ð¡ª\Ø8+tôÓX~q4]ˆ]ƒ8“'*O}ð/óϞˈÛ1ùék}{»¼½ûYOl/âŒLI RÛÞ›¼½ûIl/â¢LžŸ¬oïëQ{g› Äk™c¯EÜOÄã˜cc+°6©Ý&lè£RFÖ«Ôk“­´Ëf‚³Õ¦eörzÏï¬`®áQÕ¤x^[»ÔÇ1móEEW¼¥§­2ŽèÜy¦s?¹Ææï°†?S7 ѾóLû~znôÀßF­Û$ómºsDìΛ,: …Ï31 ŽÈã9IŸ5cëûýf°èR@Žäy&'µgç˜ß·®û{ðŸ>ÎiÒ´—æ$á{i£Óçíf4cÚùòLz95ü`9õ¹û‡Õ4¤ñ7I;j£¦=,o²MàiãÆŽŒÛ@å?´ëxø†Á›ÓÆiÇÊ› ñ GÔïìfµJ~çxY\L6œ,þüöýüþ/䵇ø£YœÁýFi8þþ1ŒòâÑE2=j;ÛuBDUti}°}‰ë®íã¡­ÛÜüÜõ‚à ¼ˆ/CAª©F˜^`Æß8|ß°Ân|Øó|á„k…d¾ƒ´Hÿ¯›Ð™.ß3.]ÛŒº‘ú*ˆ‹ã%ÉÐ%ۺ傓‹Ú+ˆ/.PD'†@|\wŒöPÄ3òüñp«:c÷|\¶‹öPÄáø¹êš/Rì7볨QãpDàÏùãLïvŽúwþq°"GÈ>®{Ez(¢ðç…ÿüÁüas¾±Š‹ý$öá®[/Ûg9þ½NYÅ>¯àsD€Ï1>ª¶½5ïrŽùyAÈ?²GTQ6GÄð HÚEºs.<4·K_ÐçWw)báKJú£/šÚŽî‰è÷MÓÇô>ùì†K-#SÊp¥[S"vºÕ§‡sò‹²:/¾¥e`9Bð"€#D/sÍçïn>ýõ6wƒH6‘ˆn"=‘ÿó‚ü¾ùfÖ§.@`^€f%÷ÿÆß–ú‘ÁÂð;0±Î·'´@·L¥ÿ¥m¶NKs•ׄ´Ã­óƒ\ؓཛ¼µ‡¿VžF΂ 0ÑŠø‘ûœ+]‡ˆGˈ‹ºuÈïv.þ±kñ,žqkq>Q=o="®ò ´HízDüâ¸é¡éÁåç⸄ËóøEX¼bºG®E„Zár–_ÜÆ¿,y'ÖZ0žAZ€†° £TZ¸-Å¿›ù>ÜÜß=fUÎãÖg­H¤€—Ïæ!‘ÒH|\‰öPÄCÊÏÅC"…‹¸<‡‹ýáÕ›m®ãÑëñ•ò‡‡ûó&Â[Žø/™û¯Z„ÙN%A‰ZιV WÉ7βNÈãÌÖ¦ÓŸ$³EîÄ‹Ê<—5{VŽP‡.¦¶)sÄUá>üêËM#úîoˆ'DNÇ3œnÚQífQ a\ƒêxÛ5àœìxŸ!åVË´Ë:žE/4•H×Câ£ÇÕ³y;ôã5 GÊ"q…\@8’%ìôLi–ü¶¼ïþ¶èÓ¢R •’¸B®É:uœçŠÉ¹i¤XW%éù£dŠH=$®r¯rñ„î8õM}Ĩܳ°H‘$>.’D{(b‚un‚¯êŽ ¼\ç[y—èp¤Ü×c“IOÄà+ÑŠ< š“‘@èÞþ“güçä.t;ƒt+¢Ê:mlxh{Y`k”5X’½Ð>®Ã†ášµ#DèP>¢C©Ãظq ÚCkSeòIš‡@³8à˜ëX?j^@#µL`ÐzÓ{—Ô² ºÍ¢ŒÑ΋”WMÔÚjÎ,7¼Õ4Ùõ‡wÝêãͲýü©œâ&÷AåÏÅ©„ÆâvRÏ}6’Ä"^ÐÒáš³$qj¶ °yTˆf/h3Øæ ‹¸P›7OpXÄ#Û*Çyÿ>º¿‡¾mÔ† îØÖÈàú<|º>ϳ²$Hn'¯Z¸K‚ÔâÓu€ÎÊ’‚GB¬fI!¡PÝç*Y@ðHÈðHZ ïMÅýJ€@‹@‚ÏÊ’-B-^ Kè…b?ÿÏ’œ‘%ê„ êüüY@ QÈ ,<¯#›êi…úIWÊ’B”B±Óÿu–  … ˆN ÁS¡€§ŒxÇŠzD×fÎÑía³e{xÒë¬ à ÁÀX)4OSÄè] ÉÆ÷¢×Õos%mà̱§—_¨÷4ú\\Uu±Þ¢Z8„Û…Rå*Úƒ‘¡P”ê:¹!@_( ¿ÏÇ BùB©¤íÁˆ/,ЫW)¨I…’ú|Òo@pV8C‰­/o×ÙCøR›ÉmE|^W%Hc£Ö²s­5ZY† ç¢ð’ísÊ¥±G‡ÜO'WÙ×Y>t·ä®C¼zj}½ P,Ô@±€@±P€b¯Ô˜ n®Pýëyõ뀽€½”žß7v?ÝvƒeYÞ->®WÿX¦Uô×[V;ïV`x¯ÙÂTŠð_.Z† Š õǦ>5– aŽá ÌqådB b¨ˆˆ¡_§eCHa(ÂÏGC6žmÕ^g÷înÎ`Ö„ 1ñÁˆ{*Ã@ÂDí$ïtQ[Þ´Üëè´p"è.Ø&‰ ¾ð~sñê,è,`‚Øgˆƒú´åσ ¯2¦ˆÿ;\;…OSƒ‚Ãç‚‚Ùpc±øãÊÿ󑦡“S sÏü® \oÍØÀ ­›¶¾|­*§Ó¾”5ÐuÜëËb}O‹Ê¦ë•Fûì؉@µÿKòk ¾©€/Ž$.'“–ëðÍòvy¿t7Ëÿ ‹Øg"{€æ@ 6##‰€ÄP‰‰'ùð %à÷äz7w»Ô1u 6¿€Òžg Ü®î–AS» Çg# Ý‚¬ŠÀÂØÊŽD`W¨)Ñ *ôiÁ@èP•×Õƒ#€°¥P`KŽB½Rp& L(Õ †RV(Ï¡:^8  r8ÞÞHO „0020ðrà ( ¨‚i»pÚF´!u¸§*t»€0~ *îƒIøˆŽH'™d¦¯ÛÅp¡±1ðhƒì¹º pz‚éRàOápÇÁ©ÆÐi^ð¨\Ç´é—çqåUPÈžAµ@×Ì1„£‚¼ÊÞE ÕdåR‡ 7õ]ªk*‚oA ¾HM=05á?RºF¥ëNÄÂ_ó3+ZF Ú™¨øºkZàÓŸŸƒóGɽ‰ÏÌö#îyT9ïTûÏùùü@|º©I—#EèÀTTWØ°Sr>5Åa’Ï™ðž[Ó˜äÆò~4p¾k¼uª³,š&ýo¯.ç=ñŒª‚/Ó£Ó^x°Î•>óîþÃý”Ãeúà?e^†ô$»I„v‚œvªoØFC3ü†x¹+ DäDS}óö øyMD<‰n:QÆlÓcwûòCó†7É®@,p&îI4.T |“˜®àvx ´ÐÍ:.”$2(é`þMV»ì'ç¾ãšyÃZÍû¢l™ê“¢j&ºbö3Åd÷78õ?o˜_þòÓ›÷ßÿøç×o †gA£DV n?]h/÷¸»Ÿú’zS³@À,1Ì:ä÷ïݼ,mK.&K˜¬~(Ãz½Z*è~X­{ð3ý[«Ûð0õ†Ì‡Ûì5‡Ã²D^yŽöØiG òÚq”Á9\r3‚€Dê}çE®Þuh<°ƒÖmúŽ{Ù©´‰“ÒH#Ò–ÎöE¼ƒlú+ ÂÍŒó=0J¢À(]²Õ³ qPI¢@%Œ˜gÁû(¬ê|#ÛÆ{ËÁCã x¦¬*ZèíIØ‘ #¾âñ2Šˆ¶mC$2†èœyG€F¢]p¥Í™TˆG©¬q'VFÔÔ¸'#¦kÜFK{Ñí¼ˆ á[DÆ·ŒBâWO3íB¦wß½þå—7?¿ýáOäŠ8 Š9Š¬Ÿ"rõ)9zB¨‘Q9ÔèéàõgP]# tM}uÐÈmÇž%šB ‘A7ÄÇ"ö<ãcHƒ5š:³#*=ôdŽŸ]}çÕØÀ$îó‹ûÕ‡˜¾çÑÑ1¡¨ÐÙ „md.©Ì ONEŒ8¢'D !*øDÐBTˆêĤ4™ ˆrék]Û“·ŒiÝtBèÎF.š¦m½ZÖë›Ç)Ýs v9Þ¤cL.µŠÌhÕî³66>WHçç(¤Øa—·i G׺B dŒÒpÉe ædŠçZî´3ãÒ7­O«i~MSxýÏþ‰4ôM jpQPƒcŸÓy̓[>SïuËþB4ò¦Q…‹Lþˆ¼;íâE™ð&0-½æ¢ã,o¢à°ÙeÌÜÍͪ¦ ÕÌ ºs‘éΩ 6 ñÊ™8ýt³sЬ]á’Íš(L¤^ ýÛvÍÚ½ *t‘©ÐIóxùr_ˆl;oZ£Zˆj]dªuRD×Û4ò Et竾s¸éêõf‹´^¤õ»z¸ó¶bˆV]JñЕL¦˜¿I#¦p?¶É8¡]rŒs¡AWÛÎql<ÆÞ‡QÉ‹•¼@Tò¢P>çt^â¾?³Ý¡v÷ÃÕÇë寻_l.*M;4߆êð«þ/—ë!f9´ˆK˜¥¦?Øk£ÚšI"Òz¡jrLˆ²^`µw²¥Øß¾ÄÚ¼QB o¡è¡°šÞbLç¼mÓðÛ5ñÜñεM€†o½Þ קûe¿,šž¡”H-Q¨åsÚÈÆÕzge—¯Ò¿½üýÍý·›O?|ý5Ýì"–¿P—§Ü°‘o=Ý÷û¢v™“mŠ‚”m×ùVDoƒeÒ;P`Ž½úÐý«ÛpÐýÛˆ•œýBJ ]ºÔ”ð&A ÎMgÚV0}l¬LïÐ8ÃRLç˜?~ç7|¸šrÎÑ웂±q¢Î]¤’(TC"îY‘2E"+SD}.âtÅà©L$4]z¶÷ŸÖ·ÛåÒOjƒ¯kX*p.¢†sç"tK%L¥|{t[Ûõ×t •4iï« tAªF‚W¶?UJ-35øÅŽllš¶/"Ü).¥RÞ¹®mu0·É€„ñƒ³“ƒÕŠlí 2$¦j³‹Ai>¼m£Š±kYˆÊ¹ô7"½ÒB4ïåÀ;Ÿûk"ÞÍÓgí}'‹5õo:Cóý¤G/“}(¶}hÓF!yoÞÚ&=Ë=ï‚íѼ6ŽÛw¤Ñ}ºé'ÐþÛèý‰Ä Yí¤³/˜ZØvS€—Öß>©Ø!µž„­I`"•›D^¹ ŸsMŒN„¾¼yÚßxÖÛt…З‘q[ç|?çvGãû8Øx$( •y*ùÙóO.ê!áȨJÑk#ež„­Iî!˜—c^´‡"ñŸÆRy7ùÕ×gÄôfíBÀIŒ§˜äŸÃ‡U_»©?Ü<þàÃþ‡1y÷(LR ”PW‡I „¶‚–Î$kp&9 T™»säò wŸºüDªEྠ–Åzë†ìÖuôúN±Èøí*'ØC¬@®\»ë‹†eaÛºaƒ†‡OJ±êÊ…Œ8V"A½Ò:ýéW[§é‰Tñ@ñ,w²S½òíÇá¾¢‘ùŒ_O;ó¢ÿºoù?~Óµ¼V>Âå>y­ä×ê;è{ÞGÐø¼GãŸlêí:­è·'³˜ÔJ ÐS[zjW-äï^Õ>y§ôv÷O¤áIª?ëÞˆXŽÔý°[`×íÓ  hü-²Æ߯^€}‘µù®‡/@áf¬ãÚq•qzkM-€›+úÚkŸè9­iÌ@|àÚ ë$Õ–*êtr}¸WZ¹m1Z@·d~[Dº)£\-ÔMYÚŒ÷!»é$›ËØ"ZÚ_ZœR³}Z@k=´fКEÖÛû·$p­‚¡k&'Ô  “Dù¤ôfÁ;ÎïbÂ(2¨ú%„ÐxYôZá4žè¨º@Kq‘µ?[ø¦³`K䬎f+çñG<1Žb"´”åÒë lᣴH_Ï¥Zò€®ç¢Ðõ¼Kòæsõ.#v@ÓqQh:~i±º“‹Îî䨹=ÝÉPA!º“׉ÝLoÒAsÂ]t£Þ£Ñå’ÚSI‚gŠ(=qç&zSÀ5w¾¯—¹VÊT½Ø /+>é;{ïo/'t€®+”§\\è]—Õ¯Ô  ëd®jJDwMImr(']å$('=å$('=å$â$µ¿"%Hy4Ó£ux*펄SŽ%„—áìx€Hõ¯”ŒVŠµ–§UÄžA !ê|ᨖJ"Åô6ä–ÚkÿøxûüË{ÜOŸWÒ¾®j\Å B—k§^Uc:çô棽y0q6PŸªá(žUÅ''5üóýãSíÖ°:+Šxù#²Ø'Q¡ürØ"éÇ6Ú.PÝ ¶²ë ;+xõ:N°íEm¿zëòŒ¬/“$Š{5j:ÇLDvY ²_,Ú¡˜ÄXGüÂl0˜±ÕkÊ„À"Ú‡«^¯ZiRHà·Ë¿~Í'šõ×ÿâÝ7µS9­$%Ê;ïÕMå‡o¾úúÏï¾ùú«Ú‰œöQd*¿P퇟ֲȇ^/(€Z‘—£^õ¶Ž%@·—º}Í'v½DÈ-b½„ˆõK˜üKØ{7Ǽ٬1ó4vËÛ¾ŽZôª½Å›ÚÁH€”/‹¤ü¢5ÒÃênùbÀ˜x²Ô¹AL**¬ñO4JµÒ©§ 0apÁň³¾ÿôüð)ªùá©ž3.Y(¨*ÿ¨ütò³ö§Õ êk¿>õ¸#%BY($¨0e“UÑ&û@y€ÌÊ~ãÖRs²¨r5”õ¯yÍÓw_~ñý÷_ûÔNÐ]YEítZ­& –Bf­çk^EY¯ ëp©²¬eB=–PÆ!II9]Ú’ÕKÒ[õ% è¤#Ð% Ò¤áˆí#ž ¿ûNG—ÀxÒBŽnÍõedB ë©"²J L)k J¹¾‹ jSò¯r¥DJžE5†úÅ—_~ýÝwµóÐô û<ŸVL%¸“p_çëɪ±4«¤ÏfÕ…®ägQéuitJ•$Í!¾]r%ÙS®$r%Y8ð ÆZ]&é~iÃVàY8Æà­=•PzÑ?ãÂ;Éi@Äè!Ú¡acŠm$ø÷i`ŒÒRº¸ÁœAî‘”ƒ4ÖzG_§ïîïúôÐÁÍéàv¾}wó¯ýê?+‹í$ph‚,šP£Ü®Ê®Ûï6¾Û’›^9a@‹Ž3˜wÍ‚Ÿþ <ˆCºàSkwë´sŒGŸ‚¹A &î(4vF8›rÓ\Æ0Ú¿  '¤×ÕU:Œîæù÷/.ù‰ Ýäµy…™óš¡è¾ÊÆ#‚ÑÜRÃŒð”\)g7éÇMýŠËX_s#S $-éδÿf?Æ/TÁDøôqZÝEdîþñöÇÛæî¢Ûð*§(ÙÂù¯ Ê}Z8;¡R•GHÖQÎ.ó $ËýšÏªƒƒÊIeVNZ»Ú€Fí9MAõ¡2«½0DÕ¡rSZ»Vàn)¨£žƒäÉZ— ˆ°”;ƒå4Ž;V[‹H„E¨SéÜûqf©`æ• ÉÞBÔ[ï¢.‘–ZÒq¸2xï›ò'kîÆáy¥Å>/Hµbªƒ$ïÙ`@aÌ ƒ>ƒ´ÎŸÚˆ(R’…"¥6}þñ~·-cy»‹oÿô!EÝÑ™(…’…c .­Ï ™•Ub&P¤#³"ªRí¾êsdVŸS¿°ÿ×Ó@ ’[W»vC¶Á¦ ©vT@áo i*àXôÀ±:S5ª¹a ‰Á±è1¡­ *pëÆ™©ÕÜxüŽuJ91pAŒÇ~Ѹ¥P#MôËê¡“n6ÏTí§çð™iæÊ°¦6‚j ýVÙIov«Xgí\u¯ZÃõsm+@k«ÖhqýTÇünBÄÚ©Zµf 맚ï¹k˜ª4¹.å/0Uóøh~¹¹õÕFÛÉCÒDkLƒl"ãr­³  [¿ìëÖ?Ïïrë ¡óþMó›E¤{~€¦Ïímó›å¢{~€ÍÐG^ßÏo†½uÎÐ:ºÇü¨è2k´ÿê¬q Ùe¡£}¯H:aã"£}lu´ð€…'Œc®$—ŸSá+ås aŒzY`ÔŸzÙ…BÖÍF¬zU`Õ×ϦÑzP?]5òÓדi´ÀPW õõd-°ÔU#K}1™YÇס(ëjCY¯ô4n«åüóċס!*€ ¯ŠÍçk÷b;fœV8ªÐŸ¾~6͘qZÕ¨ó¾~2͘qÛU±¿}ídZ1 Æ«"5¾j2­˜ðÎî ²(€N® tò ºÝà™F88k²Ê:†À)7M¸1$l1c¤Û]8.϶SÝ]úç×oÆfÐxòªÀ“¯ŸM+hìxU`Ç×O¦4Ž¹j䘟 ¶72ÌÏ Ø ó©j?<ø(MÄ40ÊUQþ¦£ø`~¾Zÿâm)¢Q»,§\8åoJ¡‰iZGÑÙÕ³¾@2S HL³:ÊЮ¾¨ž "H®"Þ”ÂÓ¬ŽÂ´+-ªgàráþ¦|g5ýâíþ7}¢ðÛUßþYQi@,W±¼.¥‚¸ÚÄkG0–tðCÀÓV¤£í‹:Iµ¬ÈlQš AèhÕîEô¹tÍêι+p¬´.i„§= F=½¼Ç÷?ìò{¯Ü{ó¸{3‡Ànâœn~»»†î&`¶ë–Ú¾sÃÚ¿qŒ%zìöó/æ·î#&…·Î¿˜ßº«lÞ6^|:ck ÍÖˆ'êáq©â¾ )µW½-ôa[`‡l5US=¨¦2ZƒR(HÕ¶˜4,»üþißß÷oɸ›'Èyþ ¸™jŠ¸#*!c‡G¸Ø-õŸC'@b©‡ §‚Yj !RPˆp #£±Ýh&³Éµ4ù÷µº§b‚òüž«å¥‡Ýá§þ‡H3\á)Aq7>BžòÕ– ƒa!Á21Âc4rNÓ`°å|¨ÂzFK µB¥ k}ÓÕúÒÃnþ¹}ãŠl5iŠ:7nÔ¦)ÌX½yÕdd®+¼yÏpƒ_^Ü«ŸÜ~ëîؽÙmîïݬ*Ó‰<}8j Ý°WÉd®Â,p%+,¾¾>(NÃùÖÀ˜îëÅn‘¯$^bw\ËÓ‹iWÆo¯U ^ÑÀ0Uš3Iœ!lˆn¨¥C­q,:ƒÆZ.Ìõu´{ïÿ¬åÁ@Þ¿±×˶!Nì³ÙqzQƒHÏF0ׂ)™<±ôFG ÀL˜V#M»Ú¨€ÇÚœŽÞ ‘¶w]míùçK\’µqÁe‹´O¸ G aiïfWæ1Ï„KR€ËC (É7êØ¢–rƒÑ؆%èAŠ+)\ &`íXß²Eá±6ûê\Ã÷aiùήÛRá?†#¼>þ²w¤ãûÝíÓY1–‚Ì7Û˜ñ†mŒ'Û•òaàŠpÂ…ÕÜê`‰‘FExäY_£þçd/<Ö¸ŽîþáúzZ!ø9”Öµ3o'öyšÓ·´Ç‡ÜmðázïmAÛñ¦lñÛí>ß=‘KnYÁðzË Ö`Ìëí…‹«5ƒ †1pªÁÇ?׸[GÚ8ÖzIÜÝýÇŠ¸àËØ1ðë(:‘X3«å& Ay¹ãTaà mµ6H{Et´0^›¶å†ÇZ¯ŒñPÏØêžl}Ç@hZ¸Âƒoœ÷D:a¾v}¤ó2Üïæ`çzˆ«’ ²q&˜Ú2I§k‹øtiÁ¡œ.-Œã¥™(xÁ`©”…`©”=rÅ^§JI…˜ñENãA¡øi‘+x¬õ¶÷·OæÙ½‡ŒÉø5Ý® cÓý ûðür$û’"FõFĨn1‚kc„¯pc¨÷¬€µÈ­i…QäkÕ£ eÂjD¢ÙIá)„q$z¹(ùoMF<ÖÖ¾ÝÓ÷špz¼+³¢_ši:Òqµo$ïÑŠŽÓ!¶Œ ®¤F˜ˆ¬X"0¯ySàk½2 ÉõM¿’ƒ½µ;x‹Ý1‡Ó`JJ}8 kN[±]NÛzÇ ú⦠†ÓÈ&œÖ¬˜x ÂD·XE÷Æ9¢ƒö(j7xbÁ‘;p€k9ñ౎!‡1Ñ™œ«»[[¹có3ŒØ¿e$õï[²e- ,§ Fb,4D5æDÌתOõr¿€%~³ËoÛä‚~>PÜýǧhFíÿúáÛw—Lç‹“CãqâAb¨›XK+ oú”±âÕû/2Ö›qÃRΞ!Þ‰½ÂV’ôÛè¤z†™£-žßø¢ñvI“-íæÉdcMÆóä]S;P*£ÿ‹.›Ô‘ä+jPˆÞZK<ÖZbo›»^&«.Ë=Î H*<\ ÖÞ˜!(1ø%Òzâÿ–QO0²\G‡#ÂoM¨h† x¬ u%­IU}[0°ã×±>°¤k|‰:t'Ü ¬^wÂcmtçºËXµþ\ÞvÁøÚÄçG3‚3¸6È:Iµ¥Šºˆ²2p¯´rUp=!<Öj]ë{²B"œ£Èô ,K `‘.4ÎÓZÃn°á\_-· ¬^_O¥s§·ì"¼yI†k2— ׋yÞ¦)EˆóR{,ulˆ~šŒ×BÜ`-Ûkµ™ný§5ñÍü¦:5—öø]øïpwÁ‹p:<`©ÞÒaµ«.§0õÚF—lp‡A“Nµ.J8”#¨k妀ÇJ+ôéùönôŽgæZ@ä÷]õ/§ÌïÚæ’{I± 14>‡ä)ÕM9+x¬µnÿ`î"†œSC²á ׺ÀÙD[Î&jçlÖ}7ßð<+¾×T›¼fK¬`Ò…ÑØÆX[Ë1 f,¤òš2!p\Ù¢ á±Öq«èµýøxûüË{ÜOÑÙÍݧ•átìûM¢Dm.­9kù/o?¾ü»Eïï *Æ1¤ºTŒœõTŸr,m|Äi5854hä£Á¯¥’‡VlÕâµÞ®gûâíßpéGR¨2Ó›„’Ð-¶ÊLeA‘³ZÇãš"<1Žb"R´)a •ë´ž4ÈñƲ¿MˆL×ÏÉŠäLZ‚r­(HXhm¸RsªµUqÊTÜÁ6ZíÑu"5ôåc!+8Ö&zveåG ´òÐÔì¢ZSo ZyK³ ¦«ûéƒÖü`Üã}S§©9¸9k‘Ê q2ºNY¯”%Q…šr³9¸ µ N¶¤nV÷dfhF)½HÞ&jŽÄ¨cT³‰%ªû‡‰¹Øl©td‡!éi´CNE #ÎXht#½ö5fÊœ‚Çš³øæéù W!Ïád'2E¸ÅD8pƒë™¿ ¿÷,+¶ÄÍÅ nîÿ°weÍm%×yžõ+`æ-eŠ½/²¤*gÆ“8屧b9qžT½RP@€@-ÿ>__ /^Þ”§œªpJC÷vŸ^ÎòÓݧ§è•Ñh\T4^yý’Å.K’Ö.™$À&)9‘"pŠTŽYOoqòp]'uj°î,N×¢ûûäC5ê4žS¾¸À>Ó( UŽåR £R†+8a ÓBLòZ‡ë:;ñ;^‡ŸúåOxREζ8MY Ô£³êš=°Q4—dŒ”ÂoÔ–•Q$E©­Ê›15“×p]]{_/Ü2û±U–Z{6Ïv‚¡&£÷s¤é÷šòy)K»×[%kJµN†%`|ï“üêà­ Öõ؉z^€¤«ŠÆþÑ¢#]A):\A9aÏÑ!DztÞÀùì©Ížİvª¤}cBKlÞæX¬«cìÇåè^†{œ«ëeäz<ü\txâ| úlÓžZ 52¼%&8k\Ž,$[R1ø1òÕ¦=®ët£HYJø‡EIñ{I–®áúž»~œ•—ljPù”Í´âXKþì¤4ÒXN[v$÷!™Q™Ð*Ž®ë§¾z•æø ©6ï_jM;LëØú2=3â˜E€jPw{Q/IŒärŽÆpÆ#-GCÈŽªh}$.E;&˜qHŒ4XW‡ñ¸d7ê¡äðúÚ·ÙÚØ8WQSÂm8É&+™ „—æ» m䚥( 3v”×׆“†ë:þLˆÔž9Ïr@ÏcJ_ž—íHmOÓ_OÉÛÑŽrPTÒ’œÎda›T Y¨¤3‡U74Ž‰Š·£<\×ñpŒt­»·#ë¿o†ñbp†xŠ©•£@Éšj‹¹ ɦ ÄYm4J0­¼DKVNÞ6&F×&Ù®«ñÇš$›õ¢Ñž­€‡|±¥ÈìŸg»2—š•Žôšú(½æ%ÙŒ‡o¶œà$?ã–Ì~AØÚè.þËíj.4=ö‡Í”ó1‡ó¼™e¢bˆH%•—<@k-b>©1Ìz8Ï;X×ÙêæEa¦n›Ú³ôL»úxèÉy2º)»RZ51|Yêx51\×AMŒØ‡ÑµüvTìª v¤..Ù¦0—X$¤$ÕŽ*—ˆÔu;÷³´Y×9]yrN·ƒ?v~u}=ËkwÛ0êõõÛ£¯Ãj¹Å·›òõ‹æ°Üz;Ë«Õ6­gå@ÞîчumïîÑÕ úã:m6gÞ¾Þ”m§o_üëþ‚CLòröþýûÃbÆôŒ*g”¿ê•4 ´žýé>-ÿ\œ ÿu¶¿7ºvýÃv{ÿêææóçÏ/ãêËWÌÛËÕúöf¾ŒéË~„_¼žßÝž5b¶Y‡7WµÄýòöjæÛö´þE­}i^*ü¹k2¾Úu©<-ÃZ~"o_|÷ÿ?¿ØOñ¸ ÍÈßä‡e("±yÿÉ­7Í” ¤•â»&+ÉñïfÝ òw”I)…ãÌ¿+é0ýnF¾ñ¡Ÿ‡"„³ÙwÞm¶«‡§û;ôüÿèÏë_ýð§ïßý÷Ï¿›•Ùžýü—ùÃï¿Ÿ]]ßÜüÿþææ‡w?Ìþúoï~ú¤—ÌÞ­ÝrÓ(M·¸¹ùݯfÇ:ã3oÔÅ»ÿ¸ùRꢥðþÏëíQÉ—q‹&i~¹[,7o:ª¡ÖÚ]éæÝä"~Ý¥-”Þ½N{˜zsõýN§^¿ûzŸ®ª†…ž‡ªÞþMÙÊ´IÛ7y÷ãµitÑ£Jþzý—ß^¿º»îö‹ãz~ÿ»7öPfwuñþ.ÙÕúè½vªn§âšÛùv‘ÞVeûjöƒC?ÎÓ"BÿÏþÓ­ç¤6¯ov/¾x½˜/ÿg¯‡·Îo^†Íæªl{ysµÙ~Å›RÚ^5+žûî• ¥MXÏï·ÇO>ºOn÷í^7üÛCZ}ùqƒq³{2®`üºÜ¤J8/}ÔÞªúG5yÖ˜ƒý|îõ~±ÐÅìoW÷W;[W³åj‹ÊîVŸÒlûa¾™á¥_ÏæÛÙ¼ÁÕ¦lOúW;ÃÙÖSÆÔ­“+¬³-= i±ØÜ»0_Þ¾¹"WÍç{X ýç·/f¯·»Öàõ¬éØ2Ío?l_ͤºÿò›òÆúp_üz‘2^!/eºÛ½3kr¿^}Äøí0Ke†òÆÞò67_¿Øܸuõ–¼´/ë ÜM…;ŒQþØÆÒÄ›íz÷«ZΦ—…ìÐEZÆYçlQÀFð„u›wŽÚ¿tŸÖ«ÏôªÅOàÌ]g¯0ß_uÿó@;FMßþäæË]ÿv·ißËžBÁ®:š/&/mN*úcûõÓ•Ô6†‡õ¢zŒ—à°2 'u9Ý5îÏëñ°î«ýP[ñùN[÷ã|ñDÑ×7‹ÝdÖY=ov2Þlâ€Û~5ÏzÖQ×îãïË\_2-ðx‚ÎNq^4˜üYƒÙÝ°ß.Ïêå^Õ Â}'}äûøOˆ¾wµ-n _ì ùZÈO(j¡0¡P¬…â„B©¥fö…r-”'º­…n'š×Bó …>ÖB'j­‡qº«…î&ZÖBË …îk¡û …ÖµÐzB¡M-4Jûí mk¡í„BµÐÃ%ºb_ɧZɧ1Šá(Ø(uÀD•Ê>5°S«/¬y¡¹Á-Ç‚k‹f9(P¼ž¹Ù5P^.Kww'”_¼šŠ§ÅUWXpâ­¹…Þ‹]:åtC²o/áÜ F,µÑ‡¨„’Á§(!uKU{( Òh†px$| >‚õ´ï²´tM ýt§i¹z¢°‚3Un&4* a¥Šhü«ùæ`¯Û‡…[_ÐñP;Î;Þl(è›™60¬\pÚsjxâ‰Jë"OLpg)ÚųÍjgV‹‡»å{ÀÙ¾Qn7­#É2žˆJ)X¦1øÛ0‡AñqO+¬Vk€w·=å…µ&47†ž J3«BŽå¬K<0ÅqžpC†éÝ®ï#%ö¤Rð!0- wQ«¬L.Ð25ø*©»1jdÿK™v‘RÊEà™ñ¼,gŽ”2F0'£5ÑúÃ"åÜ+7ÅsnŠ@{}£P¯åõ´¬'pšœ1å’B°˜1<ÖË8v„B¡QüÑ>µUӯ˔¹ ³i“$œ2)’<à£b&Õ l¿ÞùÕâ|Rcºß~èëL½àÄ™¤‚: ­h@.A?ðf¥:Øý–DTîOËG¢çëâžê•ÂÚ!- ¸óZ3™Kí”'x´.k¥Ü~Ýt±:×B¥Iq>¦;Q8ÆsÒ:6Ã.+›.E!hgwžÖr—&r?oÿ}_Û+Ûûè¼,¡=þKiÄÂPæ,'T·Jê®O•ëÓ9קE¯L>cëêÙ 4»íÆ(kæY†eš’@ÊÝÁŒtŽF%îTèWÖéË} ê£}c^Y²\ MAE‘õÌñ༰\ZFaÃÍéêô ™ý¥^cZ0^£fN£ÔAcä$¤­·€´ m?N¼¹¬«ñ}ÓÞê Åõ¢*2—Êyˆ©5)ÓÀˆ4Á¸'uÐH¾Ì•/ó9_bj·«ußè¶gÖ &Î`K¢Xb¸áŠEi©1êïùå~ñ°]½X®W‹ÅÙp”¬4ïïR‰|½Ç;q¾)žðûÏn½œ/oûšP £2%=8xF*E´eëK6P@ѽÚY><&½N£Ld4G]0å92X˜`X]Óˆ‰7=21r&nëLÜžÏÄmÖb* KËéDx€ á &@è¹ 3¯ÍœŸ7sÞ‹Î*\J* m™ÑÖXM%uÅŽû –Ι«=Fßaþ³¹šÃblçyžú¸²#9 ÂB@#åX°‡O’[š½ŠôYïfçÚ¶P,Sº ¤ð– ÎE6,[iÈ°~¸¶Œh?ð«"–8ÏöxV—c"Àx¯$ÏèÚ Æl[0_E™8(ÀˆË ‚å,zï©JåRnSï‹ïÆW%¹Ô(’5#^Œæ;*b¹úh–xÂBVgP¤Çjax À§€eÊÀFbxòFØä´JÖæ<¨…Úº»1¶C3 :Jc‚ÿË9“1H§%wÐ <çúgmd+µ•‹óV.œO‹ýV1ðÖÆDt¹-ã)…£‘ÃI2f^à"醷Û‘ƒcy›zžu˜Õ†&Ÿ,µ:ɲáÑ:H?À¬Ñ ¹å탻í5p-D²ÑeV',òXŽ+ó,á„hÍ)tû|…HZÞö»:m¶-¸ÇèQÙÛM9å2d8®0PP˜JrÞþ8¢2_¦±9Ôÿ‰0A¨N pŸì£ŽS>­,Z£Ý8ÿ>UÉÉuFJ1@K!bòpÕ£¤VW6çQÇ„¸0œ æðN¨(XQë<OÒõšKÅù® Êݹ ô seWÎ41&dz @K\n…Oh¦2†ž¥S;‡]ö¼1F×”?¬øþ¡ÜOPþ%I½ÑLÁÞ“Ôot{ {ë :F5É^rå•¥Q+ÔÎT9 mŒÈ,=Ç\ÖQ^žr™·1<¼7IP8&X¹_>y˜k ø¡e⹆?Æ 5AH!H( ¤†k äD”%3E$>>Bk=© ß@\˜â%*Ç‹Fp’¡J•6Ù¦V—&¸í#6.M÷ïÏ­ÆrQ耂Øn²§pÍ– Þ^B»H`¯\ªV}:aa·CÙ  b~,°Z‰ïV?í ÖoH-·°n}¤êœPœ“—6©Âè•S@AKçlOÀwGk@×´:úèZ-ð® ¿Ö43:P²}dÒ—yod£öGGmuñ¤ƒd<±2¨%p/Ê[À¢z°?‡ýcfJË”•™Y :À½Np  JéÐL‰mßØ +Å |(šœÑn½lÁ”.wZØ ®´,ØÅ•LB+ÎNWÙÖ ÀJ^Ñr&Jê *aÕ†§ /]Ш§Ú6¨dU‚S‹îÃß.r$ÈL‘Ä<î­G§=ì8ü(k­ç!›@LˆIf0‘ÕOù}=5·+h+RLDÃ…Œ,{Ø(abÁü]ŒÞSk{-\£20gÆMÎøGÙ;EBáè'Ãï=UO?9<68=ñÎPµmÌà G"£²,’X’•ðJ‘„É=?}_qñý9.§Á«”¸ƒNÕ@L&U‚Eí9hlC#æ(¦°,,+VRá‹wCO Žf …{ÇmF›1::bÊ,O4aî úeâ4²yžÄºL´šß;¡³Ê1_˜³H #ZÂÍu©âS*áþÇ­Ÿ`ËÀ[J)`Ž ׄƒã‡ ã§ò€Ò¿_Ï?R³3nŒâgÐB*& iÉÔ(¥3)GAƒIA@G³nÅ?’ו×笈†LˆÑm3Ï^—D?™–u#Î2ÑÀì&Õ0ç“œ±zÀý¶/¼ÚÒÕAÀ¬GaÎÇPÀ‹YÃa€l(pTèŽRIÇaì­‘&šbús$¦aᣉMì$¼+•b¦0ûè~k®V,3«»-ó1Ý]Ò£1Ñ1^–A “L*oaS“†æ:(n°í–ÿ‘̶©Ì¶9g¶æž“ѱ!on4Ô_Ð:1( ¾ €zRÙ'bC•Nsë˜í\/†}Dk5nûôxYuKÙÁeJe+x¡€¸ªÝév?w‡ú˜¨š$™{ #8ðTBuH'TbÒ4s¬Ô€£Žóø@9-Þת~£Š¾l²È\Jm³ÀÜdâËá@=R£‘êw/ú'nàˆèGkN@ÐÐJ&LÒŒÒDé™—$%íkמ”Nêv‚ز Í8!bYÍ V) P†¦,[¦~ä-Nè¼³/<ZPe½Öhf¡œ|Ž€²\_D~Bïd®8)›H JeŒpJÁ– ‘¤ä&HøÁ”Ãf Ö0*8%*ú`¦9ï R6µ—³ê£¶‚»ñЮ– OƒåÅ=VÞùT”§B­›’äo JtÊ$X¾€Ÿ\#y Ù8°ãd0Tß.@ÐD’³DÀ ”ª\”7µY;‡ñ"±/ت³1æb|–GTîJÞ”Qˆr« œ'¡a‡°g%7sŠÚ_hý¤çÛÙ3øHSËwIgæ¯Ü6%,Ü l“JV&2(M…âÞƤWBY†Â¨(Â!Å^ÅàÐP9LqÈšµ!n Ø`Z2/Kx*Á#U>z•…3Bµ¹‡šÿ—½këmãÈÒïù„$Fb×ýâõê);ƒÁ ÈLž ¡®6Šä’”=ž_¿§ºyk’Ruu«)J–Äd“ì>u¾SçZuªƒu_m¬ûêк¯ÒU½S¥<ÃEL 2 jƒq6æ¬ÏpèäÓÛ+8cçB+ÉXû^8XlÌÖÙhñôŽê„”ôq“ 0g˜P-f`hÒ‚C×éñíGš„©¼½Ž=òˆ+“òÉŒØH³¼óðb<²­ßsj¸³4±Ç^‚=ÌsΘ#1nŽ¿\ßðð1/tÝ9Ò8J`a·€ã8K©L>§€ñéh¡E*Æ‚¹à!“Lt¤ô¬s`<| àp½*‹g7zÌ7&BoÍo„ëó¡p}nL®Y$ÒÀx%ÌNg}4˜x¨ÃÍòê“ÁÄç°h»\Öc”6LXùMµ O9~ Ú½ n'úµÛI›¿DöÿÇÞ¢ÚÇ|F¥¸îíÿ’Õ9èÿÁ‘|íÿq–¿×þçéÿ±Y€>ª·Ì~1,jËüÚäµÈk× ß@!:~d6½×òµeòúòòîöÖ,¾&õ°Ýr?¿³?ÕÇÕƒˆï5lªü¹¬w¯´ÍUó¹ëkèýt»£¨oùÀÞýï>̯?¸™×ÿ1žºÉ£¿LVÿyŸ_ÏGs\]'jê~éù¿zWÝéûùNQÖw©wdùà&ËJ‰.öÇ Z0MèfI©Nÿë*õAþD6ßù¸˜ÝÍ7¬ÿ°1 WÁCƒËŸÈu¥Ýjݶ÷D e Üû½*š¶¿ú~õ+(çä£?•‹¤Í¯FŸ×o+s¡øZW?ºÁïÍßØÙj5»½º¾7Žj¿+íáoµÔŸâÇ2¤%à‚”s䛟^5 Ûg@ý´­=Ù€çÁƒ,Tjj󦞚÷àþsõ%02?‡Úi¨R€rs¢¤Œûdæþ„›Í¯ÿù)l}¥›Õh¹Q/ðj kÔ¤ÙTo¡„ûÁœç„>ÝE{‹v¡Â7ê³ýF¿¬*_ ÌÎr´ßÎ'_“sñ ˜üvT‰~šS»– #³¥m÷ÆÊü踤èÕµªÎÍâ(ƒ–¿ÞŸ‘oëyXë‚{¸ZÍ0Úîîv3À5SO&ÚHHÆïA²žoWGWÁIYÍvFçP_Ô^ÎúÓôùb÷¦vœ¿»9$±àýûÜ|¨<ŸÍÝÞíî~àü áíÕ£ Ìaö(×Ðú)ò®’|¿j•À¨ßuä/f9ÚîÅÅì¶ý8›Lf_€AMï·)¥râ^S9Ï9•Óéï(ÿ³./?æ3Îÿ`†¥<ÎÿÈ×üÏ9þ^ó?çËÿ$c÷Ç4iö×ìÏköç5ûóšýyÍþ¼üìÏI­¦Ü#MW<]=×ÔO~µc‡ÔÏdQÓ#ç Ög.ç­r<¥Coã9Áæ|´®lNÿ„Ïy’};>—Ž½Ÿó:ðùvþï›ÕèÍ \Î|ÛŽË¥#ïÅeˆ‚‰#‘bR°b$;F#ž`Õ‰ËÕYJ19Ko[&ü¹¤…AWƒ„ßUæt“žîRCiUÝGðwä>É«Sr·i4«Ô_Ú&'u«Ôß½&wˆÜn õt¹Ý­Öß ÷þ}RÄ}’¸ ÈÙ]"l»³²::ô‘`VøêZáÇ€ù0Á{¾ªðéૌɛv·ý±ûmV-{M53º½›¬ÆóÁ l_Žy(ó ÷é Lëù"ÉI~>$[xÛO¬S7E³ Ìe0ÿ!Ý`è!@ ^¦fVûT2»—´×ŠÙ7W1{YGõ?.Ï[ÿˆ3Œ_ëOô÷Zÿ;Oýo³eê­¥ÂÀkðµøZ`ÛpÒI”F2pŒ(׈ynPÀ1ué‘ê ;÷MUfØz-?d ¥lïSÕ!"ä”ÁX £I‡¤Ãƨԓ³;Ä)U6Ày¢›ü?À÷¯¿üúߣ7i.Þ¿ý\X—ò¿Ö)Eˆó©G‹ˆ©Ù»Kç Y ׌¯soóÔ6_4sn|¬Ò{“¦6u)ûû@ Óƒ3G%‹ÆU'\ Áe·¥ƒA§¶ÁS ‡·”å}àEÌòèá,áöˆ§¾õA§Æ_X£ Ý…æ<Ù vçßݬ‹ÐÛg¶m·¯S» €o‰—ÌaF¸¤aáIÛÅd7õa õLÞ¦íë· Y‹åª~íÒ‹š7ɹÊËC)F}äAª¨cà2$È5óÔK O¸Ͼ¿< å©åènzj»ÖaC{iè“íé^Z¦ 7 …eðD™㈻6÷¯¢íõÍ«×mü¿24{IŽ°:5ñ£©EPÖjÇ‚D ¼¼› Õ$y²›‚sgwÊä<â“tÆbö¥~QU¬6/góúÕl>Ÿ-ÃF©¼Y w ñ(„¬x¸à±£éHfç¢XRmŽäSã´Nâ1 \äé½ÇÂœY(J1/Å¡×B?D™@Z¦j}:'8š€ejK´11è>*á‘×oqÏÓÜ –7ÕÖå°nZxVôóh—"Ðmq D*k#š "µ‘„@ÀªÙ+0àDÏ“}*dzwžû“MöíûúLŸ¼4”"ÔG8D‚fá(‘ŽH¶("ª¹%AsA.Tòd7ªO#[»“ç†R…_ D¯¼“^͉*bŠ­†§3?ÀeÖ_*èy²ï½j¹8ÛË¿>à{Í\„ˆ†¡°¦„2…±Ó4 `qú€ÿø!Ô ‚”gAÝí±O_)(¯ â‚HGU0Ï@Áì¢„ç ˆNE·”âPþ`žØ&¤éØÈÛùlšÊ|—m)»û@K©§1Ĉ‘C¬á£Hmk!ÎÀÜòn:`@ÍŸ§÷Àù«½¿ùlòõl:ÿéÒG¥höŠ­K¢`mYŒ:‚îñÑ AGúUˆ”œ<½IÎy½†¡$h“êN›®>¥C=×¹)ãýMê•fm¥bßk+-!œj‰0áÞ*¾b¤¨ÑA wqy¨<½§äìyËU^bJQìå®È„§<!•“N)D­Ð,0 >µ—&1yzOj¦W´ï3bÞËgJ‡jK‹ü§¥”Z¤#h£aFÁz{Yö<µMà÷ÔÑ9WS<¡ÓTg¯ÅR¦“\´’B{ª03&2O(¥Ñ#üe‰NžÚ¢ÓÔK/A„KG•‚ßGД6 ¡Hyw&Z."Q*v+îhóôžHê_F¸^Êê~º ¬‰<"Kƒ¹AZ,˜q”v[í1˜þÈS{¼XóòVw•ò¼WJ68CŠVy„˜aAÃ…Á»ð60/±›§¹Áþtœå=+rwÉòùÏBNõZsG• &x*Id „!£±§ZÊ,CPD¬‡Y»—þÁ4„àÎfkìZ,¡+dy/§Ìˆá(Cé´YáMN‚ç:â…”Ýlåó7?ü&!˾ë ;žÎïVÅ—²½Ä,­˜€£g0‹4ê:Ý1Å\õêó8?ü7“æ½ .e¯|!ÜŸN=SyOpFS0ž.»ežÔùá7éÓ“¹EB¯Í=ëi*£ L1³¨#63¥º-K{>æ‡ éý“·Uý±ˆÝ½6¡ΰG$h˜¸"ZQIƒ·žæUè–y>Ðæ‡ä;xV-ö™²¸—§µ´Æ‘œñª•8ÈO&>únK Ÿœùá7 I}}f®FôÄ&”©½Y̾,·oêuL-Rš¥0ôÚFƒ(,"%ePœi¢1Ün™þ¥ÛÛüð„"ÞâR¶÷ËZ#&ÅRcžö¬rO¤Õ!T`Ó +xä©m !ÜŒ§Ë±¿=à¥Üî5y¹šNŒf’Ga00æ™I.À…åóÔ!{–²¹WuÒpê9У‚pšGpà@šT:ÜÜ ß­%öóÑÇùá7—ÿ¹Élz)Y«øõÈB{å›)·^HOBNà@™’ÔSÇ夛f>Â’~sy’™Ùt¹Z˜ñ™Œ¶œR0ûNÚÇ,M“DqDqNgŽZ§¼Çü¥§ÄóÃ?œË0E¥ÀõÚ]âÀ—¡Q² ˆõJY©<£ˆ£êÂüÆ<µ Æï‡DôÍVú$-ö¡B×+¼ ”yì‰W`ñT”Ô a¥âZ0ahÇÃRž.É¿AHÕ‘yP]ò¤‚W* ½¶¸Së‘%i7=å.*ê”±Þ¦Î-ØaÑý\“a6¸g©=ÈÎ'Æ…›ÏÁwžv•¨ÛÃœ„àØRα 6PÐN-A1:½^]“¼¾{ý¦` u)ª½âgƒ8Gó-ˆZÑ:   •RŽw«+?g©=´pßžô”"Úo‘žˆ”3ƒ%S\r0®ÌYx¶aÑ[ðÓ.KzòÔ6^ùö¤§Ñ^k€M8pd ¥1PNƒ‡1Ò ¨÷̸nUÑÁ¤'Om³MÇt«oO€JAí·îIRp®"ÖɹçZEäAR­âÓ—¿R"?üƒ&Sg^ŠD¶YU&ýJˆ12Çe0*PL´Š «FžÅn‚8œ•¥ö”&³3ý3Õú.¬áP)ï{µ˜I§”HeM§ìxé(3N ’ ëB›§ö~œë2îù ®Ÿ×¢·L!½fµg‚TMk(¦XyæÁÄšäEK»E×ÏǼä‡P¬œÝ¶2.çPþ¥ÐõZ¯É)„WVm"÷Á8¸¢1AQX¦ëÖb0¥§ödæ\%£Sw6¥Ò^  ¦š9,8s$Ö¸( "NSp\TÇ•Ýõ¯ÏR{ʦ|[ÒSŠh/Ä€p%‘“cÏ-³” ‰ŽýφóH²Ô630_Ìül²ÓtGðúß ÿRzÙ/%RÔ†¤‚ÓÁƒ¢B*âÀL×Æ gk²ÔØštÆ×à!F‰(dw¿lXŒ˨5Wr†)/Èb5ŠîÂr©yjOA{†¨¢,œ(ez¯umñ (&ØH§‚bôEDA(á]pÝVœ ×u#KíiC_­þ}â–.½î_¤LŒJ¡íµ&EaɈÄY"°à"ÞpE©{é›=óÃ?•ô|h‹%/…’ÑËZEl"(NОÆæE †À¨TjÕmÛÓPüóÄ69n@“…ÿ»3“—++¥øõêùa"ñkƒ¬“T[ª¨Ó„˜¼ÒÊuËŽÖ?Kló†—-&¥ÐõŠm¤¦J ê¼¥–…]Ú D£ƒkuÌ£ Ü:$OsÓ} îϳZ-Æönv»¨Þ„̓[¿nËäV V-â“B–õÒøH~²Ö>zÏ©×Q«è ñ ‘Ðq§ÍÀðäi>ÏnÛùò øÓÃëc=nüøvyüaµúžÏ¶·a-vß•¢Ùk•“kk9DU3–Ò"ÂkÊ„À »—Õ};OìAܳ ãÕ×Zxž@bR'¢'¢R`{EÏ^ ‹„…Gj„¤ñ1:Ç GD‚{{i%ö<µÍDgXí¬Âò漺NË K“™3“æ¥i)E°×¶0ˆÀÄ@iÕ¿gˆF/¬Çœ¦’]Ú¢yj–()¥èõë…«½cX$šè H:îVZpt¥¿´¬\–Ú#I9×Ùà5Òéim:Ö–1½—÷á0ø: Ì5×Î  ˜Äh æ´[¾l0ï#KlI¤£¸nƃîå*è%ZÈí~™Pä{xC^*£E‚Ããˆçø¢ÍÛô+—7ƹ°¼]JYÝkÙ•ÆF¤T 'Œ¶8¦£Ç\IÊ/¬Æ™§öxÆ>í~Ó0Á»kÀò §½KKîl÷›=ß»´Ñ9-b‚Ùk%ÕˆhɹTŠyæpJ2Ã|´Òí çSÉ¿™¹ü×*LýÙ)j±‚¦É^VÄR$•¦J²ˆUri¹ýêú·mì[Á¥ŠËÍé¿ùþw4…ÂAýÏxú#¸îÿ{h¨öÄ&M5ž¿U¬Zlh>Üš¡oG{ 4÷ðL¶þç1‡îyÜV°ÒËÄøÿäú»$L?‡8žŽkqY%ðÂýKÞ,gw ê©9AX)ð0Óÿ+ý²”Nêhù{ÊÖªãéÛ ÛDÒï!†E˜ºZü ¨Ñ'»á$7zwûÿgïÛšG®4ß÷W ôÒR¯ªŒû¥ÃáZ»{¶ck«n{üfmHHØ& AJ¥ž˜ÿ¾çäH\($H*Œ' jÌL$2ó|çö¶³Š?í¨ËÃÈ„‘HäLê}‹_V._×w.dºß•g¢j³íö1É`ÂUî¦7åêí’’Uºz¼×þ;HT‘<)…À LÁÍ¿¶O˜ ç¢"„oä¿n@¢ÉÔíâUÛ­c§yU³LØIU"—Mh68vO¶Z¼ŽIH»Y‘Xų½Pí…¬˜¬G£N!ÁyLdʤ Bvõ2ï%],4‘ŠÉ{®£¢á„7n u.š}ÉéØ£¼,ld9\Ï#Ëó7ôàÚPtèýðÛ}K—n´¡ûõ6ª±gýóZCjö·[²zKŽoÖG®ú7bZ¥”¹MòôP#ž[oD÷UÊýðCÅ¢Òo~Ýúüvl«mTnuTyú;åàaÙ§!¯ÚÐs_Ù!‚´7Ž¬!È é‚ŸÕB–ª˜‘ûa¶¹!hXZ¢µÜSÐ(ó„õÅ2ÔnŠ˜‰G% 6iŶ¬*nä…‰–ÂÆ‚lùT.œ?þ¿û“ø£ôQ³.vÇlõ…ÇòY(îïÇ~k/Oäì톿fÞQ´C0¼ä칺ä-€VÙ¶0jȯË„!ã—_??üãË_~üéç/?þå¾%áží7VGVœa7P2@xc"Dªö# )]i1 :ì›!Ê Ýî6«\Óµ49pÿ½fhÎÀKšÓÇr#·ÛXjs}ËÀ’œöeœÂ—ðø0³/¤ýM g’‘[WŒõßÙ@tË[7§L~Nù ᯓ¿„¿ñW[¼öŠ‹‡‡eº¡l±K÷å A\Ë”á¬àµÅY[1xtiÚ.`¼ŽÁRd:²¤µPóþ6£1ÿïPÖ—z6=]<ìIN˜ú£”ÁÏS’µ"=g„w4ÂSŽ›®™xP®vˈÙDÕ.e› Í×Ù*ÎQhçÙRšp"¯éf›‚Œ½0±MWˆ ëß¿6P†¶$¿1£ž:´ÝŠËp/b0 h>ZÞ5\ûØsJ—8 lÔЀQï^e²©6tx1€7ˆU½Áöç »í=9ÅØ~”o¸¿ cíè*ç~Í3 F=ûö…»WÏ<õðÚ?”ò®óB݃{áœ(6`(6ƒô°}ó-sW›ÑÕhi°L6-òîP³èzÞÚóDú4ËG½/ø]œ3ûñÍ`þ>>}û\}á.]` ‹±àR™h7OdÏ‘­_o´[Ô¢‰ðÎm؇w Y¬ªo Ni²%Z¾Ýì"hG-’Ýb!œ|ð›"edÌ’z]5Å´ nœÒ³HOõîùÛ>´ÆDæƒÿ†ïZîâZ?þCñœ:E0¯UY=>»žÓ–S—¶'"¤cº¦«[¨ôð†w§qæ[nƒª£AÕ»U >Ü=°± ñ¸N=k|‘æÛ‡nÜlͪ¿ÖÚ*‹ûÏÞÛQMûr­ú¨\K¸ër8¤ªöRpkà R@eb|oëâë"»;¥|ÿ²»R3ô} ò‰™lV#³Îô…1Õ•´Óä'€š˜&ßEO¥Å…ËfèyCá–”é‹Òϵº‘²ÙKÞŒ·a¦²^/Ðâ‚1“ðŒrBU·OrZ3â°£ñ¢§ãGQí¾TžÛBêƒà5U?% á8ú`hø–k7òà¼éq<(Ü«EÉ5W_a«b•›C[¸÷«–dX´<|N‘#GT®ñ:ÃÁè‚« ½¥1ÕþÕ·½Ã†Œ~´´W1ö ÕÒ je»LtZÛÈš-Ñ¯Û „¨5·ŒÛ ø[/áÈÉ¢ƒM^ÖÓT¦;õö$Lð˪(ßpô„¸¡ë’P×Í( XiÇzxX€âûÜe'ÄžÓ«Çé…tq¦µï{‡Ëñ×0{$ôHVÖò>ûa¯WÚ/kºú 4À%*Íšøiþ”½0"à)Þ¨†ï(g®@h+¦x€rT³J#ºxô€ð¼ gx<{¶[ÄZXsÃ3þßPÌ >68Ä.cÆÈ®cÿ(᜜7†½à3¦Æ ”‹Ý Fò iX$ ¸üË^ŠÄˆÏd“f»\£ f9Ïë“–€Àx­/˜—tûThD…ïO.ša«î"V„ËP뻉}]r‡âÉ.9Ý7êÖÊ|ÍŽŽ‡u¶x]¤a³ža{q@Û6?1,#ô]†N¢„ÚaüÞ‘ ³°ÂÄÍgF8ïákzF:3Òy‡H'|—éŒÔ6¸…æxÀ N©*`’gåÀép•¡÷ímLCÍ$K“'YjY–‡ƪ|IX¿›ñ!‘IZŽrŽä•¸Y梃ßa¾ZÅ_•#<¦ÙO8DÀ!Ño_zÄg*w~I©-?UÇ h™´Á]Á¦ð»2ÿ&*Âéˆý®üéëZ¤·„óuCóÝb;peT`U•‚éBÔK—q€*ˆ矙ÙÚÚ·$šË@yÝCÆF³(/¼ŽBûa ïÚž(ÄfìÇ%=l—o˜5¼õÐRÛ¾K´YçÝé1éºYþç='~èââY®&F€,–Nà'zl;ô×°ˆç~#(næ${ÏœdSrø½ÞÀp~T|‚YA[u<§Æ)UÆ!­5|0eOÓÅt°Å݇tÏ-ôaݺ8œS—ÐÁe0,Àcb¯WÏ~8OFáYõB1ɆvŠ‘oDz½þ%¾×ã…i0õvB#¢$²<;!‰B/‚#Ÿí#i¼[®O‘û?ýüùÇþôO¸G+¤¯Y&)¨Ù Ú'Ÿ™±µ›[¼mÁéJ®Ý÷Ej Á$;¼nñz‡rž§áâ~g»íXÒïøzÓûŽ÷…‹ïU’m–ÂŒ„”?Âý5œ¡ãí ý§,¯ B{"ÏÜMµo({¤çÉ^P¯«ÐÕ%*Óõl4\ÂÇ¥ã]$mºCõñ뉔Ý+?}UröLÞÀWâ¡(=T2VTíþ°WžÓ€Š®ÈÎqIÛv¯%d¹MW æû&ÍìŒ:§°‹WÞ…v+ Æ|w÷š~6r‹‘‹Xc yËRÝO²‚zt!š0ø.*YÝ‘ùÖJ²ºÒÁÕ²Ê]³ÞËï4´–ümOÍß®4Ò/ÛµùÛ-¯£ †€7eDVàFIGºt@|#‰u¢ÇŽmGWÅ-QšôëzCsC4y(1«ô õ!æˆÒ+À—r Œä”ax%5þªÏ ß’Å›Ò\¾Í6k¶­0*–ÊÖZc9uå÷“4ߣ<‡ES>òptkm…!³.h|Eçï;T¬<æ‹Œ¤+nðaüŠs,5–á°a¡¶ z0\FÉNä{k>Zœä»°œÇ,zÓr‘óXIêÛtèvè$1ü1¼Ð‹t'±u‡4Ñ#©àŽãN.)ßʃØvç€/¶)àK$QÙiÐ84cÏŽ Ût<ËÓ±º8U*‡lò!‹2-JÐÉõŒs”õ1 ½ïÀ£ ›ƒÅÞlBð¯‘Em"©G-'^´Êà‡5À FÐQ`j XÉcžj’nsø9L¥Ì«´‘ÉGd5·Ð³RkâÏÕÁÊ¡òÇ !*GŸ‚Q‹OKhØ·ÓCu@Ä¡%:UŠ€-̲%+YÚÃÆÖh¨Y΀,ãÂ-•1ò¥•b1wÅ”§Ý.ÉkHE¾x¸â ‘òŸöŽºm¹Ü–ÆA†ÃÏ$1ž_[7 Þ"_©Ø|Wùåº×›ˆëÍËãúWŽaÚ WβCo³ óË&Vô± ¦©´pÜÔÇXg£oš¤A¶§TÆ:Âö붋‰³e82œßé&Jé¥5uÑfÌ0ÐÍÀsÏ÷íØŽ]'Ð=›Øqºð^®kB½@¬0ýº¥«XäÎVÙ+í8]Ž ­öŒê2Ú‡ù]y­Ž@£ ;é3])~G¥0a”˜RHVcSEÒò›íóqð|ïøü†b¢3"PNgeË5ÅÌÄ&㈛-¡«2O—k ^LÁÓЪÎTtTŽFùñ’§ËkOü)«†»BY4‚—VbƉøi³ap ?Ý@'q TÆ’[C˜j/ žÏÏ`èŠm!¥Ãýk;ß óä™ •¹þƒZ0º¹ôÊ¡ ›SoXd¯#°žÎ¤—“ÈòŸLZÞ¹ê2Ë5Æ@p§ºÌï9³+6oH¶¥H¬0¾…V1}5v ²Á{ʼðéfCñc8^i^Rj Þ‘‘µCÔø4ò1½¦6­g‘pßóþ*J5ȵʋV´yÃñ:«Ì£÷´¦L„FÍN“É{úÇ,"XÙÎc'gkçHÃ>Š¥ßˆ)Ló~XÔ¤`ú ›ØÛí& w[z„vÝ‘á¦o–Ûðég^ä†Ð—éy¾$Ó¢lÇp|ÏrèȬßÕ÷ò¾Éä’°j/}™33Ý'`®4Å4Ñ'`‘]Ó}‰í§p\;Wè(ȼ»Év<Ŭ<#¯¶$_ÓånÉ]Zx]ËnnÕíw¯UÎn£»{ûÿYòÌŠõ†¯é£ö¿~ùçÿþãßîQáIN"ÕFþ^æ %¼÷¢SÔ…7”le„pò\û-t‚P{X˜Çlªœš>ÒmµÑÙ¯^èbÁè…¾¡N…:µŒ\ùzQÒhñðæ†Ö ãhY¯ Ê¬*tÇ{o?}ù [ðÿ¿üo˜ºš&˜ãßÐu¶Ù Å0] ¾H¦) :/‘¶”­éfû £ú·çOX¢ì#ç`.…Ð.à°P\|B†qà­Ý·…”ófpF)D4Žæ7µI_½!ÑVYM|š%X“ªb(_ŠØër™ÃºE$6º/¾;_÷ŠMeB\úù›TúÇDl¦‚°&C ƒ(©7î™VŠªEíódN£—1àã±¹áfÀþÞ2Få2?&œš…—îúSiŒmâþ°Ù°ø‚Ó°€´‡'²™÷¤f#ïI)½ÑçñY5‘ÊãÕΰéI ‚´iH±©ÏèÊ!^i¤Ÿ£n]i)xÒE{q\ݱ=?´-S7œØ‹,‡Æ†í˜T§Ô2G§½4CÞg§êþ &¬´¬§}ú¿W¦”7§‹ú;‚cüI.ºéW8'Ðê[€MÎ+ƒñkÚmºå V$Ih´UYòÊ»î>jÿüô·/?ù·†¢’QîÂàž¤}îª bÿC6პ njևÍi:»¶\ŸJ·¢“"ØŽ¿V6‰lˆ.d“fY=x1÷³ÅŽ`9*‘|Pžó`½NAVI’Ø‘ãQâSK§$ }ÛuGwM/¶“ë'; 0ÑeF×C²ºÈôᮤnX€ÝÙÃဩÉqœ…x[yŽýâ¾½”ì¶1# ®#Ý'ÈÝ¡C¼†ºj^%'³KtK+Nµ•ÑˆK+ÑêZ†i/ò©oS/0º¾G4ÒÇ).Å★å»ò.ò—{õ¹øvM r[B¥ aP“A©ár‡Z”­SdˆEZ^™¨¼$ÛMúUò×ésŸÒè‰SÓòºÒ¼Ê÷3]±*%¥*ªaµO‹EÑ]…WôQáTk†l~™Å=‹¦Žäd ä–oëµV\@]pñp¾Í~Veå_¨1Ž¼Ž¨ÍF–ÙÈÂKà ìÈp; B“’(q‰nF˜¶&cE‡Ïô‘ã\^­?1¼ø Mên:·ÜòÑLPºÙ˜7 ¼›qs¯å[¤KPIjê…añ>íöƒÁ«åpBÞãè8»saÞìúðëá,G°ÚžaaèvB Û¦ºîºq`Ù®k¸Vä‹ý³ÆY6¸+Âúu û†Æ<]}ÂPÏ£šö£¨)kÓ~5mºø¸zbíe}ÇosOHÝÝ0'Ì`¥ñ ’ìf‰™ól‰5hùŒIz$dǽÍé–!cu ¾çTð³*Ó’’•èYœ1W=ÿ‚eø ¨2⿾cÒñåI mu˜ùn½ÎJ>'÷¬°½B¬ B_MÌI1ž_¬×Lï’å膔®´^~´½(¢Ͳ NÖZÑ÷¯t ½¥h4!°åT æ6Ζ€=î)óÇë°q€ñÔÏM1²å‚{£DóY£ž|ûÇÂÃWÎ<õèÚ?”ò®³?®8„”­—ßþ+êJK÷ÌXañ:ÛÙç<ó÷žgn˜¦]ú;²U¦ì!H®íFõ$¶ÕKâ£#š Ú›,×þÕrÀ¯Aë5œgTa®S7*ðøvvðî©ðže«©ðýÉÆ›Iñn +w–Iñmíö"÷ -ÝóË÷ìÄð©¹% Íf’Ðë†öï=Ala£0íЉu=Ši$VHIë®n[¾ENâ”üûœ¡­¦WñåqÆ1P r.P»¤ð^]ŠÑé ’%ysIñÔêz(’•Zi l§šRíË*E_•ÖƒÁ/N×KÃ/»q ˜†Y_ƒÇ’òå£EiÛ"׬ºì ÿ±#‹#b†1KsV¦&ÙQA½¡c'ÛôêöͼBzÓ¯B·Ó@9lÑø8»xs‘Y~ã C4Ó„ì[èô$Úæõáàë‘oººN`ë±ç“À¥žëfbÆŽ12ã¸D,ïË,~QÙRLá¡¢X†Ô­+2ßG4%ï¸g†3dZç,õ R^/ë÷ÜP†"ÑüÇ»{M¯ªçg6€uLqá„—'Æ÷Í Û›OŠF½U¶=‹Q£9ñ­ChLßpÖ ¦+àuÖ5ƒóëX×+jÔƒ1Y¯’©CðŠaÁ÷íÝê#õ­ºdÙõA‚|0{¹1Æ\=ðÜ8v„ ¡†g»Qh„$ô¨ø½šp[.øÑ#Äš*Îø·0†eHéˆ*bimB2O—ë&­÷%+'æì_ä›VL`ËݤO¸Hÿ˜¯AàÔ—w˧rþñøÝŸÄ¥6„#JuÆ+ “?0áI´Çô™ª1E2ZŽ¼…fxG5¹úOØ¥ËÌh|8ÒÓƒ~GTª˜Ï¡ì‡GAѯ„…Íö&ï2š$iÄREùŠð4Åþà nYÑJø$"9O#n>æxÎ÷~0¦Q5-4ßòB=ê,Ÿ5`­ÕJ¢¼J1ª3a¼b±Š¤(¹©>ýùžnãÑ —¼AÜWC{t†J1L[q|,òœÑû2²äsÛL¢( ýD÷=úŽ˜aºNLÐvÝøº©óHWXÅ’nÍéO)ñ ÌI u¥´cºzÎÏ°™Y"®Ð«‰L£×j_¨àËŠ‡/Ÿø,Zå'9±²¿X™â–ª°ÕÑá´KV=.—FzÃ;/U~âÈy9.ª›yÿt-È7ê5 ó5WƒÖÙâu‘†ÇÙÔ£^¤Ö, d*šï#õ¨Q70]Ó&†M-šXĈ$žnÅž;²+†ñ—€;é» €º–+¹:‡Ì³Œ6¯ˆ /~¨¥¼8Ï%FúÑ|. cÇ(0Š`Ú1Ÿüütm>ÉYÎú¿·Ïg.'ô­Á xÒ#-2\Æ`GÜê|ò‰lxNýD^še~ÓÂud±­é‰ ‹8VìÀ¹—$>‰'± jZ0%AäFnLß»1Ž/š÷%q¦fß›®YO¬ž=‚6×Â]ºˆóJx/ÑnžÈ){ׯ7Ú-ÚÈàêØ°ï$ïçaælyÍSʄȘ¯|¢z¤³š°ˆs7˜;±Ú})†KF”&Ça}0Ú-~ͲOÉB¤®~0D²êTˆY[]éãz«‹µ‰ã㪜?Ô†bKïw7–LóWƒ‚ .…ñ:´1'ÝÍIwçLº„dãóýZÛ%i'•DÖ/7£`bÄl!t»”ÚÏl+r-/ðãq™JðlçÉ#ÓG­3U¶J•=I¬,ǃö¦ à)^µ}ÉT»Ã+­Ö%^p„á2øà^KÈ9|ˬŸ¹q……Ü)VŽvò{^ߤGœ÷®m¬€Tã¡þ¨’;óñ«þ–aâðª„΀R³Õ^~ºÓ)6׋ÌÊ Ön±¸Âøv› )ÃeTXå;‚ºÎÐu4е%PÐòKÌÙÁ¼9iL÷všlLw8 è}Û5×W‰2TÖísˆäUd#Fò¶ŒäßÝÕ€%û° A†–³Í«–¯MF°¬ª{b«Ð"à™—SôÍ¡£4¥h¦eUvE7·þå±ôÝ cKûmÍB'óžG‚•¨Ze‹ XÉ­(+ß c•»©Õ*+r*æIÌøs9ä(ŠÑ:Z™Áƒ9ƒ¡—–ëí«b™Æ¥(–%ÁMÕ…É0:Hüúa›}Øå{^怭hgÂë ˜gÀ<À|6[¯e()>¸i`>äéûà†__xܨú°j©3ÓC×vë&jhÎÖ¶ê5Ý[ ¬:¯gôëúLTíÝ›Óê u:?jŽ˜Ìú^® >â¹;óÉ_‡h¸XËoøJJR > Ù /ÎšÑ Õ}º¿³A¦¸@ûLkë¤_|¬ÙR7Š5zo¿&–å…† ÿ <Ï \è$®orÆáÈê.ñ©STàŸ~þü£ö}_m qÑÕµÈq86Æ–4|’Lo:aíœï¥}.8E·Û×ì¦\j–hÆõà÷êá·ßËï7t!®VÜâõ”¤ÌÂÍÄæiÈ*™og½°²—Ê Ù=/Ø9ôHÄ2Wum–îÒ´7HÍ-5"—üB•Û “i²æ4Ù¾ÁǧSí ìĸ¥Dü0]ƒìÌ >èNñÒM¾^SÆK3¾ÞÎdM–Þ‚N¡dém›Æ. 'ñ<'"aà{n[¾a’رiYVâ^7dÈ‘à3Ø™ÁΨÀÎÄ)|3­¶O,®eŠO@âø!!¿Q86S‡›Å©6Øù럳¿~NÃt¾cÐyŠÏ­zx¨;ãôÖ«»­í³ÁeWG¸ì^ž{¶9£Aê]=*ƒÍAݶ¬ÂfÎû+hi+=÷A¿–´µ—è·ÞX?lú~; >>?P·|[ž™Ø>L”®“À 6±CËíq–ª2ŽºW@ÕY6EðQÿ™&ò`/¼@·7eÌ~ss׌n&˜â§PƒWðD–18!ÑDºº«¥qj-½±` \†ŠXåì L)Y(6;…ªóK´‡±èÔ¼¢Û<2Þ´¢^$¾ÿa-˜“ ¯s Åhñî-KIªËóÆŸ×Ü|õù~`n]‰‡kRåé¡Påå¿¥káû TóNžÝËÖg³¤¯ýùvuîÔvÞ„¸µÍ*fnTôéV€ú!IJß -Jqõ °ŽHda ¹q™xg7öˆ,»Eµo{og·í{° Í0P0PSÒéç3]êê‘O OÔKqlˉi Ç |rT†Ðˆha÷ˆdfY2Ë’âßÓb´Uñ>i§ùzA^¹<Û‚F‚¹éì„ZAv%ß²Zž¤iŒ7(I£QpÆ,ÚØ;¹’LÓ ¶3\®.ÒJ%Qñi«|(Û7˽ö !nù­‡DÝ8 1’ v‚„˜±ëyäÝ;òS=ÑÙhß÷¡ÌÆuuú:ò¾^þ=lÏòt×0u'"†X±­£‘"²};¢n˜tH7¨ö`9«Ì5Áu/)+Fí‚ ìF&ÒØwyAÂÖÜyêtœô¸ø°Ã–ë°=‡‰çêò`øÔ’.6Í«­†Û’v嘴Š±>^ÌCƒÏÎX¼[ØÁ…û-@¹gAø ÂâåŸâ&ÇÔJ,¯ÈŠ3¶ôÅ«¢VýÈR9áìø+ôõú’šW\º9ÑKŸuá0Cɼ[ÇDaME÷¼ðÜ+<íb`§ˆž4¦k$ÁæTÑÉjY¤Q©R^P ¼õô-…Lìš6g>Ÿ«…0! Ccå5}Ôþ±g²øã¿´úÂ縀sÄ0`€×9.`Ž ˜ã†ˆ èWù®˜sîÎÓŸ:SIZ¤ïqø×­¿ß‡¥¢—ÿ„:¶ë& ’Ðq|3ð-Ï¢qh%‰}zÝ<© ààë†2ñU…*¶J— )ÞGÐð¾ —1-ÃÛAX¬^¯o9ÀÕq¦¢¥*ŠÒˆ˜¾ž„~ ’‹Ø4@–IÏpÜ8¤öq&€¹Ž”ã…µèui¨Í`dšþT¼¼å‚ÛÏ)ÎÍ Ò*P¨cÜÌ­*òßáúN«ÔÛZïwð÷;Ûñ¿™k2 ‹®ˆCÿË?>ÖnéWm¯ZYe©-wXln )»ëî£ösI™²Âo[úÈêúìPwÄ´°1:†9»xáÞflzUc ›Õ[†rFêåoN3N°¢ ¦n”è2œ¿ãúJzÕÈraZèíØÈvk.ÌÌABÛ,@g+Xyš3PQÁ륥¸Ûp<›%3ÎfþlèÁHê–fœZ3]Âf3¶Ôàd3yúû£1$µYÑLçˆæ†º¬K˜#Úúáþa”È@T_´—ÅÁj+^†c{h’–DAhØI 'Ñu«Ó6Cç*Ll§€ q„ ]Pá<ás?2<Õ Ò¨Kh?¬Á»ò¢ºº¸½ns¾ÙÜ0¬ò•2XÂ…]ÞV%A‡‹ìì€ß²mÏ:f_b…”y*ªP ”’™˜˜>-ƒyäÚRº/ˆ¢‹¾/œÆ¹ ñ:[úÏWZcrn†Wg÷e TÓø‚Ò“,Öý¹‡ûÈì0ö<Ý·BJB' Q@c˦ºŸÔ&”^¹Tð^™Ló³À¾‚À†‰Ÿ¼´ÆÅÓUTã½³œ®Êi˜“á"Êq=©Â|_K<›L<›³xžÅóxijâØ ]3 ‰S¡˜6L=qC;ðqÜ#Ï뉨J1?}9=×3Uë™Î€å’€¥¹ö#vo®åÙ’ÉQÆ”GTØbÜðDÛ§ò†²19´ écŠ!˜Üº~7ßü ~( üµ7ü·WŸ‰o͉uȵA¯ žÿRPhú†ÿ=¤mª½MHP61©[¯äFR:o€³¾¤‹Eµç:š:«­¥úéÅa› µ^gØ6.«šç6cVU¶4 ZþúÊ­Ž ƒ{: ·4äUz‡v¨/Ù+ Ù¦^äqhÚnlëV»alÐ$6˳½±Ñ`ýT²ÝnÒp‡²e†‰×GõÔ³I>šÜ7ÉP³ 'ùj¶áT¡víTÚµYvŽ‡•›«(û–ä; ŽÒç3× ËL—sÄv+°–°{2hY>)ÀDVœ¾2+ÃUu©Rb$_¸Ïæž Ó·¤+Ä ƒv­ž.žy|øy:VO…FÇìË3u¬îæFÇå—2âº>àT¼ŽAx#¡¹Ÿ½ÐuY¸•ó硨jÝ«.s컡g€gIœ$QäG7=âø‰;j ˆ<ƒÁ Î`pƒãƒìd:rSé7‚ÙÓÎp†„g„„žð:Hø.è†z:ê;Pn$eÀÿS¹?<öiê‘Ž¡~èƦšD·Â€x&ub|¨ÑÁã’€ädÌ ž®ò‰ Çè¿BúÅdM¹–öù‘yŒZ^cÍNÁ}¯ÀpÅÁªvÈNæQ4ÙÿZ<ºzáXJ%DdzÎîÉŸpwW\«"$°:Û— –nš7Âë$è;q±ž‹Ï°¤k”à5‹Fggév=هÆ8…m)´B»ãÇAbù ±LË!¡cz‘©ë ÒKŒN|WyòÖ-2㜆pÚ8 ¶(÷Gi×´x{wsvqu£¾ŠûDd—R9ÑV릓Íëxl¤¯ ®=Æ`ˆ!n gƒx¾ãõêä€É쇺×OÇý2ŽìÎêYI`Ô5 /ŒÓ‹õJ­SþFqHOÙÃkhLYƼÉÙWXÌe)N¦ß_,hØÔ# ”­ØÓkúÙåIK¸bü–œnÅo—¿y¥Í–ߟˬê¡…×1(…ÇzÚ)QÓIù0MÇ <Ý08ô#ªGp~Á1n‘€zn]õG^ÒïkçøúäjÑó1Þi6 1Fìa <‡ø:õ ƦKLÇŽ݉*gŸ,?n*ØO',Ö‡ŠOÓíöõà 5¨oh{µéûJÍ6ˆ’ásË*½«AŸàùã+NûDêen£ IË™)UÖ?8Sýñn‡¤I5|$;‡ëÕõÝk}c–Ìå0’Ú½Aßðë ߈G—‘ëR¨´/-»íW*j„" jD¶CÑx»^x_TÓk„ïY}ܲb+¡D·Í8Ix¬8qÛq-Ã3œÐ¹.[Ë~\1DÙ·_Ìøbx|ѨIw9œAe©ºb‡ðã*…ìR>´Î¢N+AËwù½¶LW»¼¢NÎ0e"0¥ÆÂRÆ*«P@ÏÁð —ùp¹8œid™©˜ìüðÙlÈëŽÔ±ùˆßGØ×°!_Sv²ëv¥Ê\î‹ÞÌ©6U)Ü¥ÂAsóºõÅ.©¨ пAÏ«C_6¼#Z7qÕ¬„"!Îæþ-Zv‡GTS8˜ÛÞW%éÓ”#ó½ySÛM¼[|¶#RäÇTp‚éÔm­¿ŽDÂÈLÓB;I‚Ĉ‚8 áÿ÷ ±¯·yXGzÈÆͺÒ;Õ•&æZä+sµ}Bá=Éêé$Žò…ý=å€Ü=gÄ´ÖYý<Ÿúyü0ê;{+£±gÆôE;ænÿ¿«ï´Û]."Ÿãl ƒÓD*ÿ@ƒ©nRu½'=;0@i€Ë¬gOEÏžõâéêÅA]¡¨èÅR‚Îúñ¬÷¥ë§Ÿ!鿦Q/Å(‘ee?ôQ·©—P7¶꺞y‘ïëVè6µ=?1Â번¼¡nÏjö¬fŸef5{òjöõÔë_ÿœýõó¬UÏZõµê!ƒìRÁëõƒì˜ÞÞÅ7Ö`6·®œŠùü€Øºëúfâz$Ô„ÿ"I踉éû æ{ÑíÅŽÞ/ ”‹b±‡“ƒ·ü¤¡ñ]#{K¿nwd!dã$D`ùÄðŒlš.?TL]¼[®týÅà5sòhW¼^ýäîêUîz´ZNýì6-a¾ŒéÝ"ÐBÍìÕ+RØ‚…`'$:‚ßÓ5 jšžj›åÚ4±ÂĤpZSŸzÎ1§tí|^.ø'³z"óo?,h²ò€Ï·05‘¶÷œ—ö®÷uÞOL!”…t®9l\!Ú÷ß÷º0âMuøÒ™3*%\+æ±å€Ø¤OxBü1_h¨Ÿ--ŸÊ3àÀïþ$þ(}°!tŠäâ©B"õIø»ÙÐ|­b&‰3öU¡Vè>ABDp»¼1EoÿEõ þó­Hp9š8©¸Ê ß'ýÆKI¦@e|\H·‘åyŠ'ðmú‘~„Þ7Œ ®t•íŸ„Þü?îîµ'g8„Trâ#Á¯ÓEº}•ptXVJ›®rÄ9Oô9öˆ¯Œ,õ\nÐn.ÊQzûE½¼R±\X¡¥ËŽ¥8ÿÄx>áÂ^·àÓÊ3Ù¤Ù.×è‚kK‘çؾQ¤·¶i’ÂB‘cá?9/ÄæïAí¼²½ f8^l¸ÈæÙƒËRíÇæó?ÍGßäO3Å…ý;Ýdýݦ¶['4£_×pzª3=ˆ̺Ïî™Mq©?¤qÿö|³¡cä „`|G¤˜6%î4DoÙ7+ŠA âW sùŽ$¤.Pq÷‘íôÜ}lvaÓ EsÊô×á€ã2ÆPjôŒQBºa7N•^„ gMïábÙf9 ÖM=6íˆF$°ˆéND¼ëÆå4¯É %ñ)çH³ £½¼ç‰=í¾ÓþMÿc—>“åU˜÷¯H1ÿ q“Èl=$zèÆQˆI±$ÄŒ]Ï#õùgýóEªÑ¯]où¹\åÔ,í=¹<áË/éê9Ýd+¦!¢²ÌY¶‘7J¾TòLÒû®ÂÕÉÍ/h܉ñàâGéºõ¬Ì)å寔jŸyVœ”ÿyžyÁYù¯A}GN€^¸^ßwd{uµK] }üŽDôLyl’Ž@£=¤ïˆšhÖ–—¸VLcË  ˆ… H â¶ï_—=ûR§ì´5ßôik{–§»†©ƒd6@nǶî‡$‰l¤¶&­¬ªãNùÔ­>\VyºaÏMAð:‚s³‘ÖÐöZÏv~v3V$~dÛaÂŒ¹p6ر{œ¦ËÓ~ÆŠºµ‚Ûôß—¥bŽvŸÝ¼Gš~ÄvØ[ÚN,,±H´/ÿøüùÀ¨eº"Xý‡H7TÑÄ&[J[›UC–ï˜ßî~V±tûT~sëÒ {±Mϱ¼›»GZâ™—Úù: QéÆ|¡ÚŠâl®Ê e“wÆ€päØ–Ý°¡0qá¶üµ7ü·WŸ‰wÇ£TôÁõånÚ[NfÖŠ„SWÜ|ÃÿÞHÄ}³pó/@j}W-Ï~S@!¬Å.Ë®·eWjÓ¬3æýopú-Ü°S“WAÃ{²Õ„ê·¿° Q¬]#&&IÌ&ó}‹ ¸AÀ¼ÜMÊ8Ê®Šþy·r|Cö_Ϋ¢^l¨I1ÀËã1^Gà™_„àq$9MvÃSBáéãÁ`´f#¦¥ÔgECfžöoÄ•ŠKãܤ±ñܽª_§ÉO†$Ri•[UžþN;Ø‹[òª =÷6»a`‡adÙ1¨†AdSO·<;]Ï8*ÇulFâ-£,g4: 6±aÃÒš&{I¾ÍÖSw¶^g9½úÈȳ¶1Få´Þ§íÈ`RRÆJÖSÓo&èãÖn¡ÉwJ£°-6h¤ß¶êDUâL®ÞhUõ&¤ÛJy?;xégØm’†å£öËï% СR´¿j|U³½Kd+_Ëp0» P|°gr"˜¦Ò¯ßhó‰m}—ì5¶¤íúÐnE›âíJ¢uŠäYrSÁþöwGJ²$Ë‘d;‰“¶cJ"Gòîx¼/–çY–gªŽaئ¥ Í ª|¿&wàì!Ži¼¤rÿÜ~?ðð€å1× öÜ\Ôå…ìª`U‹Èœq¦%1l´£o>&i¢Ü² åò(:°ò³P;Všà4³WHR•c^ø1×r Vcr ‘fó´˜D†jŽ}ÑÔ•™¾àíK Ž]©æÊœ=eàkšÙ•š¥4µ‚D>œ3YDPvéÓBWü¼¯#kÅÁœº­\5kª2ªIOœ oô¡ ü‡~?‹“~ʱDè½½(‚Ù.Ì|ø¥‹Y¸Ôõt]Ô>T.¿Š/iãõ–…h' ‹ Fë¼ÿ5ˆbE’u"«cÍë#®ÍÃKØ ’ÒAšöù"I¦ãáðêêjàFߢÙdè‡.ûžÌóWþ変gÎQ/{bNz„I^Ð?ç“@Xþ C‘è^µ#wßØÈñógÿ›/ì<~Ž„¡ˆ)˱¾Ë6$49Ö4ü–M]*~sÉÚ”åg²¢ëº&ë’¡>ƒé#™ò3"íˆu¯9®BžÙ4N¢ùú~7] ¯W?œþ~röŸ¯ Ž:ùøå—÷ïNH¯?þ[=OÏNÉ¿ž}x I"g3ƾ8_ÿÖ#Åå{¥ò•{öiøë’ñáôß~Rxrà&..jÞà÷Ë Œjª‘G£‘xšßË(2&`Ñ@7àÞ>wü=êòÖ?Cq/#vG=&º1ýþS/;‡O/¦s£¨1‘:»÷}¿þ„`–M¼#e„üŒ¾xãüÒF.+ F)=Ÿç ÞžÕ§â|eŒ¬$Þ fsŽ žK¬/,y7`°4}ù=øCúm]ɽŒãÌÌ„àyP(Ea|¹ÑüãœÇ™9ïïñÕEÿ?Ò Ë(¼áÁº:øÁ! ‹Ký–·©„†0£°×¥:NiB0Ÿ3?ÉjËzìÌA “Þ²v”6ËÐáB¯¯êÕp¤w:ªe|+%|+^‰èã{xª ®&AdÓ \Ë[QÖ¦GÅþô²^ä‚þ›ßŒÏ ×ðŒ®~ç;Ÿs[ñTÕ1eW£Tg&õ4…Ê5dÏÓ©'Û)¸B„ÎìÒ“,?˜ª9ž2² I¼‘éIÚȲe¸ §-ð¼ÃÜ "o%ÃÁªŽ&9uJ[˲—}¶×š_^Ò٢ǕcªqÃ݇=:ÐXzoÒí7o¸:ƒJ•sXQ‰¥e7ò#¬p9y7D¥Õ~d;ŒžØ--×ÚJ‚‚ÞñÛ(×)óbà .û{Ô+ÍéŠm*ï½ËnŸŠä¹ÐS À=±ŽÀ‡G=<†¼P²{&³h>Íðý*cäe¬rbµJ15Q¡ÁTÓ8¦º«¸¦d˜2Ì<×±T¦¦g;#ÃfºäQ½w\V¾ƒ§Þ£ñ,ìTü )Œ·0ÿÉ9ž`4E«5|*?dGI­™ÍqþÇÐVÒFø˜£ƒO±oÞ½MpxÖ+–U#W©9²jZl¤Éžei¶¡ØŽcxÐ҈ʚ½ÚhdYpˆÑ IÀ`¾¬‚˜¡®ͨ;ÂçìÑ^i²Q¾~À¥‘K%E’,QÏ°Ø´¨ž1Ò-Ûs˜áîÙ€7B[‡ûïƒÜñÛ ²eÈŠÃ4=…áD2,ÉP\M…nŒšÚ£An†¶Š|´þØÏQîŠùmFY2=Ï´LÍq½‘AM1MÒGÞˆê¦kb ¨ FY˜ßÊ87Ã[›ôG ô> nW„oE§-ÝÕhX†")µm“YŽýÑ-Êw³%œº©Ü.o‡4â¡ ‹… ËÄÔI-éy¨Á—óCÝd»ã8lµ 1 È3˜Ã˜nTOÑ]Ë´m×1Ùf ú! v3ª"‹˜YåK¹#ª·Zʶl1E2e]ö\S± K“l]Ñ,×ÔaÈý°6#  Êšqí¾z;¢~›avWÒUÙ–TC²tgä¸®Ç ªRn&Y?¤anF@<Ί1ÌÍcÙ¿[QbI±©1R@>7 õºåè2…혣ÚS¿î“Ý mñÞŒ±=«:"{«E*›’§˜ŽnBª³Iµì‘¡˜Má÷ãg±Í¨€òƒú[Ÿ-‚´· é]Gp›Ùb¨–æ¨f¦b©L² ocIº:¢žsõÑÏ–fT@¹›ÉÒi›¿¶I‘Wfûy‘ìÝ«²©…¿ÆþÙ€nçY³"âf—7Û-¦ Þ©¶h òºãbgƸí5—g³›—zm ÿ‚ `³d¼éç60]më¡ÈDôº†w{,ÉW |ìƒÉ 7~¬3¤m”ƒvw¶FcW£”ì^SƒIQ' äUb'£t¯K©Á•¥Ö½.ÕX…‹çiCÓ5u•C(UJUìeW´Ú€j­Bä .óèvìB †êá0ÞµJéƒ8pHxîÆÑr³ôø˜í‰b¡#Igz¬ÎS/¤£½/Ý*Æé˃ÞtE›"™CYAmŠ~ËÇHàãIò@Ô)»³f¹uƒQÓÑeué~i£M厵Æš~§Û°-}Ò“<éIžô$÷¨'Ù‘Ž¤³ÂE¯Y8óxvg'ßö þa]8j:¨w!¼9öÛ£ÂÃÇæÈûÀNËÃuR^?yÖíˆ6vcÆL˜nPÒxñ:÷fŒžpîË›9(/wx ®Ê75ZÎÇ.ra!6ÂÞ‹þÈ‹¾Ì÷›~È÷o‹jröÝøLœUý ³á@­:Ggô;Õ$ç/ðñ´ÇüŸÛcîPßÙ1·ìÓaûÓ&òiù´‰|t‡í ‡k]¶U-’í—É3?Ìz2yÞ#“çºi¹úÈ—%an`{I“ÔtØóÅ ƒsÁϸ)nfE»³¸(·ÁÇ>â7&wò­hNÇòèõ7"·Í6Ä+͈ÓuÅò :÷N¾6иäù~4¥Þ«Z`>óÙ7VwÌÌãKrß$4Ñ”?PîÀåÙ©QMµàc/6å»Ú]¶Ó<ß,Й+¶%²–‚7Oü@Ô·B7—ç,m:‘ÙæœuÉl…Àr%Bœf’jªIWyBù]RèÛM_X]‡Å óD®>¹&9k¦ªwÓ³¯ÌòšÒl6¾ÊÒÈó¯B•`î]xEiæ-…ÓOÈ@Pƒ[ÐÒr.Á£…úádg<ɧz/aÛžµ)joU¿ª™Õ4Ó’ èn8h§z,¹ZXCç»Wz$.Ö «ôhN|û;äÃU&o­JÚO}ÌÝÚÆU=ʧüôX¬K©-÷Á¸wí j4”§Èm‡½ÝšË/P³ÂÛÚyJ¬ò$ÍR <)¦CžäÐf§‹'ž´‘a[7c4eu žo¨Ål‘;üÑk1ï_‰yÇ®¤½ïúµFð±'M’dW}›.[ŠÊÏÂ3ÕžƎj‘áïþ(C¼œñqˆ¾ñ]‘„ òÖRæ1¬KöÅ'SZP1¸»+³Èân¡`ªX }ƒY`³âö®Ìhá`ÜKî”]¤¢sé‡~?KÓ“~ʱ„çú‚O„V¨SüŸ_ºÈMŠK½!¬1×Å`O• ǯbTç?ËB6ããðþ×< ŠIIÖ‰¬Ž5c¬¸}éïøgÜU…L—Mû|‘$Óñpxuu5p£ï‹ Ñl2ÄøPßS|>å_N*@xæõ²'¦á³‡&y @ÿœ<°ü+@†"Ñ%¼jG‘ãçÏ6{áðJy%ÃU9ÃZË/¨¸…†ß²©KÅo´‡2tÅ|û&]×dfî3 &djψ´“Ö^sœO„<³iœDóõnºþ@_¯~8ýýäì?_nòñË/ïß^8ü·z2žž’?~=ûð&¢DÎf4Œ9I¢Ápøú·)Nÿ+•Ïü³OÃïX—Œ§ÿö““7qqQð¿_a|TS lFâi~/HBð$ÖÜÛgÏýoG½“4bý2ÕŒXõ .âáŸPXŽYrôåìMßâËj¥’?ú_~îŸ`‚Äb\¨çÝë£Ñò¤ÿG½‰ "mzß©Xµbµò?²žÑqžô`àÏ|y‘7Ü"J܇þÊá_)EŽœ8îáCG½8Y,¾`,é”ÒÞá ØPìÌüiR¼ò•~£¢4¥2_ÿž³ÙbðyáP\i÷ »Sûø¸útÞŒˆµ™p–gJÁPf@P$JFïF<¿ÄŒ]FߘZ7¢3¸ä<Š…´š6ýƒ`y=ˆS Âsá았7ØñÃÉQOêñßS ¥éo࿯ r~Â;³’áÑÖ˜èÆôûO½ìø+½˜>ÎOjÇDèìRÜCr@@ý ørC6ðŽ”‡ð£±â\ÜéKƒÑ@JÅx…‚-æ'd©ô_( a‚O«%"ïqKâ…%Û –f.¿§H¿Í¢+¹—ñ.œ™™|4 ¥(Ù,åíÀ?ÎÙc‘òþ ~(úÿ‘NX~H…S~Mˆ?îà—*ú-/nS aFa¯KuœÒ„ `>çéO××–õØ™Ï0ÅIoY;ÊWeèpy×W%ÂGµŒo¥„o¥#Âë!}|OµÁÕ$ˆl”ky+ÊÚô¨ØŸ>Õ‹¼CPÀó›Ó8 …kèþT¿5rýÙ¹­xªê˜²«Á.‘™ÔÓ*;Ô=O§žl§à.}À ºUÑÈÍ’n¤-f‰Â³Q)sºRÙm¦eKò.Xâ"oOÔQm0“o{|c\T·¦Ýyå®VÅœåyR^ïïm¡VoF'—b†JqÁÑ+YÀå/±¯.Òã}!ìŸqhåtÀ³år€o¨Ti¨T)UÊgPñV'ºÀþ¿¿íëà Ÿ²­`W`WË©…›¯¨ƒRÿÊ7ï}{Fg‹5·ñ*ºÁ®5À®µ‡ýÎñ®7À®ow|Ä°^]a7`7öïfìæVxSŒ»3&ª4”4 ÉcíïVìÖã}Ôû¨ìZ”¥›[”¥6ØêÖdw‘å6MìòÕ þF&+­à'ËmàRÊä }q~sÓ4 ÌÑ~ðÈæ þ‚ï Ãèá|¢vƒ¿™É­˜Ù=â¿¡É­§K‡çç燇ç‡ü³ø>¬–ŸËV(T7ø˜šÜŠ©qø‡ü ŸÃò{¥<ÿ…Ÿ×‡•.t„¿±É­ÛÁÆàãߟÛÀßÀÜäVÌ à¿þ矮ÿŸÅw]yásx½øs øœÜŠÁ!üä-¹>¹&á¿#x¿'üÿ#þëD”¥ï£ìó„\ÿ‰Ð—F #ü LNnÃäüŸÈupM¢Nï ƒ•ÖÃ}üóÇJºÁ¯4°L¥ËäðÿÌá R8xÏ3XÃzø±¯×¼…)Ôþþ«´ã¿DÌ–p ,ú `uKðÃYÂO*èÿUZò_€ãWÍB@Çç€ïˆÏ+’–çð‹ƒÿÿIŠèÿUÚñ_„ç]Y?)ÀJ ïêg©áoà¿J[þ{MÎVàl ©áoà¿J[þ{M^o±áoà¿J[þ{ ×ü³ø>¨)/• Ŭùó ë@Gøø¯Òšÿ’ßÉõTÌûÞŸáíëèšLÉu_ÐzÞ6¹ž]Ê?a­3²#Ywøø¯Ò–ÿþßêè'Ø$Šïò¯uß]ž¹á×’÷¥ÅyiG\4ðr¥-/ßÙ«üj/W[òò“hºàOäÅÉKÂU_BŸk8’ùHg~Üÿ6‡Ìx´;ü üWkÏ˹íh;OI.iÂf> þKÞµ0·mcë¿Âmg;y8ñ An§Ul%ÑŒcçZrÓLêÉònÕÊ’W’›ÍÞÞÿ~P²$â9„$oºëiGð<ø¾â|³–ð7û¿k7í¸½ýÿr$ÿ2s.ƒix™âšÜ)ZÒ¶6Y;ú8ÎY)I“ã|2Uì¦oO'7“¹ôJ·šÏZÛð/Ç®¥Õø«!þmyÄ©q¢Ù¤˜ÒÌ°dØÙ­Ì4Í)s‡šx§šàÆ%ÕÍÊ3$ÚÚð/Ç?Ëþ·à?ø—#ùwðº×÷ú/ï:—]Oýþöòâ‡Þi÷Ô{ñ^½Ùõ:Wƒ×—ÞßþÖé«·Íj¥\²tÎOÕÿï½îo/»ý¾§>äÒ€‡9’‡{oÞžõ”Õª—óA¯Û?RÁþÉÙÕiïüÕ‘÷âjà_ ¼³Þ›Þ@}lpqdzWÿZ[ûæH¾xé½é^ž¼VFt^ôÎzƒ÷f€_öçzp_ªÑíxo;—ƒÞÉÕYçÒ{{uùö¢¯nºk§½þÉY§÷¦{ê€Cs$÷ÎÕøzݺç¯ÿºsv¶îè^^^½ô.Î{¯/Þ)GS7¤£ >5óäâܸU{ÿ <¬¼ýâò½Díéfyï^wÕë—zr(ç\v´£÷—½“ÁúÇTO—'ÿ<¼rcï¼ûê¬÷ª{~ÒÕ–]è¼ëõ»Öôúú½r°ßuT¯Œ{é¹®î…þµ­ýHÞà±#D^ï¥×9ý¡§}da£‚Ì~o¯fVœ¼^LäcGü ð{Êÿ–8"ø7@òo5‹îÈKÔZ L¨S‘çM2ÞÞT8½úä2ÛB¯òdž¸Ùðo€äßûjù³cïÝ"¼L?»<–hi?À¿’Od>Uññ‹Rc ùf4ÿ¶|ùxñò_ïžÝÎîòãbúÍßçßšßS/,|6¹ΞOäÈ{;¹Ë~–sÓ‹ÕËÇ·åËŽÕºlÙ‘=õ"¸8į‰÷ôÓÒ~€‹Ã‡ÏïzÞ®‡2Æ5 0dÈ\h+l ­[ó0GûžL¿úþëá8ÝåÒ8úlž+Ð<þY{u»‘h(l ¡f{†sV X¥ÑSÎÁ€%–h°'Ój*sÐ#—08lÀà†>®äúiðÆ‘µñB1™žß$Ùt2;6µ~Z‡€W4¯›étÍôáxîj7¸¢pì|Ín]KÂÕphEêÇÍðpÍðßd6ŸL]Mà\4,xœL£5ÓKrös€5„kl·= k¶Ýž«å¿7~i°|}Ôïe"ŽÆl$B¸¥áÒ(@ ³xþäé#¸v# pØ5+å>a_o¿ÜŽ’Ï«B%ûˆ #€ˆ"Ü `Ÿ?í"è`¤ÈE@l¹„å10ÔqÃPÿ*?šLóZábÔu›Fh…Gæ›uè׉ˆšiœ¿ðS^¤a’Å÷“XVh½¢6ž”‚W «úa‹*×o€D¼ –2€—5ím¿Ycéµ¹¦òÉòŸ½ÿE4à5qUvŠ¡­Ÿ+ÙyùÉï¼ó«³3¬;aE̪Öâš?æ•f/úgËêÆÈ~aîÈ4þ¦óãGýúüÕ–¡TÍÿ%'Åâ{ f¬µþø1vœ@"Ð^±1 ükuÃ7Y™7Îå4Qmö,òÍ_‹¯`-¢‡Ø%zˆè!ˆa(F“O_}?\Þ)ïÑrŽz*}?W¸#Ž*æ44û4œg?׌zfâ6{¾NÒŒd ²$¥qÁD!’,¤È% )µ¸w‰døîaI׺×ÔÁ,™- e˜)uu~Ú}Ù;ïžþiñ›ÉO½o1Èófcå6g|ùïò÷•ÕÈ©K€âê}«ÑÛÇ1Êä×V“‘µ ÔûþÙv3¨÷wò]Õé£Þìþ8À;J3¨÷ï( ›ÑnÒŒðêýp“fÌVïïà&ÍЭÞßÝMN/Þtzçx/i†oõþὤ4í$͈¬Þ?¼“ |Bl Œt@jOˆ +[:Iÿ¤3tõà£PÐbƒÏ=;ÊÊl¬³ºyBlÀ¼og€˜Ø€ë,bb¶t–ËnžBsBlð¹g7Ñ£€dbƒä};€ÁĆÁXÐ’ì¿ywÙtÑH± }€ÖXŒu@{M诀~šÐ‚W@ÛLè‚×7÷mÝ@Múáë½ÕhWà˜>@ H Ý!€dÀ„¶ `sY$w£e!C¼kxIí1«¾±Ÿ’©>~gÓ;J‡X=ïùÇÝdþíÝø×ñäÓøþá¥)zä•o¶ylL½-¡ö€uý6w*oGI¶™lX¹ËÂÐÚö%>m¶„Ù9ñ+au ƶ À0«Â0¶]H«rQ\£Ð1̳ØÊS–ŒQºÖ ê*JLì€ WÕGâ0«*ZD5 (`H“f‡0Ò¨\Al„ÑP†~%j5@¥(’$à,Èeìç2I¢$(-6Â~› ó¥ !¶Á`6·±6wÁ^öκÞS¯õ¨ájûÜ#€Ø†ð*çíKìðÛ‹÷£‚õ€Yy•Y‹--nȪžm0iÓ~ÙÆha;HxHP¥×b*%–TÑFtYÑá QPǪ:×(À‘UÉ ªÑÆ„Ü4‹NŸdÊí‹XäAÂYœ“¼ Äj"ˆ, ÕD0–…üphFü(¢4Ë…ºxXÄÒg™šz,ê5)d͆ùÝÍí¾¬ij¨)·ìÍHþ&GhÐR“Iˆßñ]³axäýr´8åç;`½àÚj^2®Q Ô÷rWi[ϽUqñR×oú¸«©Å$ÄPLÓ“{†yô‹dõé_LÖ^i—ú×Ó§‘VÖWOmQþ÷Ÿæ0N ÷˜Tsqh,ª‹—ƒnï Ý—ˆúz§íð?}öÌÛ@–¹÷Èí~ì ê²+–ƒÐ6°²}‰¨?üj;ê•GhËHõ'\ ¹ôd1Æ9ËS5 ~œå‘äŒ$,S4³8‰ŠT =õëÕܵ:Ñ2ÄØ\‘Ü/²$(òŠŠ\­ ÕzZ0Æ#óTRž‡Q¤³úotÆ×~¹F{1Àb[Ô"mç˜ãØp d$´z¼!®Q€>¬R¶cyíö”€ºjÑ}`ÇÀþêQ¸Fì·È8×~öÆ¡B¶(—’ãAN‹”%yÁb?Vq†Ž)ä? < Í4´zü®Q€,ºŒ­áá¹êy¦Ð.&dÔ"Ë8èv=´´¥–cŸ! è [²Ò j•n´7Î ­Mµj:è¶@j•„<àmÐتikÜ®·@u‹2IB€nƒÖtØvÌ­ž]†k@Ñš¦b+ŒëóLÔ«.PÈ/hM~ñ0Ó PoP¶{&ëÔ4 ´¦ik˜ã¬T!ÔIBUuQ…P@B]T!´Q‚ÈgÎ"¿P+Ä$&±PC¨ŸÙJ¡¿(²¬ˆeZZr¨|æ‚ò˜ª~2K|’dLð"É’,Õ ÕNcÚØ>D:3:àq¡¼–Á{À|î͵ú‘çc§  .¡u rÊò Z=`Õ( ™ ÕSOP‰æ´©öB*Ú˜TŽRù< Š\ýE„š~Pp?±,üŒÄ¾Yi|›©Úº¢ l†³ÊÞN¥9wë£IMÜÆs·_È_+mM™/x¿%#ä6cOk9ö¨”ÒàþRñ¤Ü¯Çv ˜´µ|ýýu,SF¢fÚb4žéþ´–îµb.onÔßé$ÿ¬ÿž)B¢çO+yþ¸úŽHô§µDÿµúŽeg]ÿŠ7R@G@k:‚µÞ–·ìÕ[`1QS"¬õV;欷À¥Z›×(@É5¡ö’ƒ•ò¤@^?­åõëÛx@sRs)!ND~ڜȿ¾ס!÷™>ªÉlº›NŽõ¹M£òÈEaw}*G«˜ Hø§µ„\8bûŒåyçaÐX¦êq–‡2#yœŠP®b”ÉéÄÄ5k€ò‡ÇÞ7ÉÍí·æuIÅ¢ÑĈhM<€ìø£'‹ì÷ßÇl!JYY˜Æq˜§Y&²‚§!cažL¨WƒÕŒåßmC€ï0ÀQ»Ýßµ.#ºä"á £9‰yE‚Æq¡ºœó²¬ÈŪ›“±ÜÒM{Hµ>Mt©$´ò~@–Ak²Œòg¶xôb!œðÝqH„Ô"Ô@?€Ä_ì(8¢€Ú‚ZÕûóL ÎUp(c$YHcÂò4OXPDÛvæÀCÒ*ùÙ–SÜ¥ÚÙ' 0 žYòà±-7#%« €m·ÜX-‹}¯àä©3Ká~Éeøú Hkg-ÓÚןå<üC¬ÅÓ#ýøÙ{a·d·{¨@b÷§S¸´dŠ³mç |™ "ä–3knù¾¢¿ByWÿE2‰?+¤º‹‰/Êe%Ë¢‘F•0™íý1 ÍYOKÀ>@^M¬5/l9*á¡B! Cžm9áË †€Ä|f=fa'æ²ö™õð4“IõlËA {åS Ÿm9áËEB £ŸYZÀß2€6¬éùض ·ä×c[`³–mÀZV»©~ÛfÉ鬖œn® w’ÑW@…:dp2 /œÕò·Ïéêêff`{¤³J 9òž äÌ%œ äŒ9Ôfh”7t¿CN ãMÈ Qeœ§qú"äyÀs– Æ3Jƒ4)xiþ\üyÞ ¨‡Ï‚jL‹¤> ">s©ˆÏ€Šø,hÊ4,ñløä¨ý‘ÌmK%xO=òøÉÞr½'Ø,F¸Tq}1|=$×­Ž£gÀ ƒ–Ÿ´оž…@Ž½î?î-ŸŸ«ï/~õn’é¯rÚ*ÒU¤×¾¯îZ~w»ôýþ5æ Š|>t4€4‚*i”L‡?–€ä8VqxëݦÇÞ…©ðååCõ¢^ŽÏÚÝä@ãЩ>F…ùYDCŸäj®r?Q‡R„¡Í5Ilª°f“L'´š(ö^G†æî`‡(%P•Á–© “Êà{Ù!jÃÑæê-ï@7aý†eÒ•^ŽšyéÔiæ5ê¢ mQ;LçDÚÔ›ŒUô“LåÚ®üÚû@®?Œ¯Û )€×µCNÚÔ[à‰"Õ Œµ/ã§.¸ˆÙÛcÀ+,´=o»yüáÏùue÷xè=SQÖ³Ö±êÉ,“`xÝîa2 ÷b¹204W¬¦¹B¶ è¦XU7µÇj¹ PW1·cTZ‡¿iF²@Y’Ò¸`¢Š#)rÉÔô‘:3`YH[¯öîË=½xÓéã7Uu³œÒâµå;srq>èþ8ÀS! žb¶s\Z"â Y³³h̺ê#[ô‘')Hž1)W _fQ&Õ2…(KÕ¬6ˆ:Ÿ”5Bfér?‡ Á´¤=)˜B?”,ŽÃ4OÂ'בÅòø:]·MAò"LÀ$ c–£i°@ðRMü…m ’Ú‰,{Ý»ä^¬&÷úfûYÙÏ4cjÅOB!Y’ !iDŠ4ñØDŽ hRžeÉ|Õ¿/ežJ4fQ¢!ç ùb5ɶ]€k¢©eØܾtž‹ãbÇ ÅÈ¡Æ2ôT¬¦§ÚºJbÇ^o¼ËJV±š°êÁÐÈ¡ÆxŒ#ðŒECõ_Ì÷€”‹Õ¤\î³ÚÁ°H8rÉ[¬&ØÚ:©ù±w¦ËÎ;Oj@jÅjR«›Ô5÷&5 âb×>&5)$£Q¤æ±¢7Jy.Cå©q’Æ$“"O¿ú~³o_ʬ$h¬&AsŸÕ€í@Õ± U7V“¸mÕÁ±÷öþ˜‡–ó éšîÁæ³Ãénó i‹RoóY-Dˆ€ø… œòÓ\¤Ìç$Î$×$½Ù·/f>,]ºÏgÀv`éØ…¥™«Éü¶ÎçðØë+”JÚíŸr@ ÈkZÀݶrˆËFä‚ÜwHä€Ì×d~Ø4“V)\çñŠ<·Úå€ûå˜8 šã¾CVòãy%?~_)–¼1s“b¦1OÓŒiœ‘QšÆ—B?±U¸)HbŒ×é÷n)–¨ KÐ„Í Ë»tUyqy–È&ïVyÀ¶TÆàtò YpQùδ±’áÆg'5÷Ö>:¹½Ì$vŒ,Ú¢8p#{¾)öI)Ô ¼¦^Àæw.Ë0#/S+Ìy2F&{r@ôÀk¢ìÄ—‡ä€<‚×äht#X#š£R^ÓR ›mŽÞxM@±ž^¨?÷‡ªdÈ5¯`úx°2‚pêÝÅa¯ °5î<™Êd^&ìØåØäË,ç±N8J¼Ù­Ì†ÉÈ”j£zÎðûøÕõ¦ÿåró;ƒï­vŽ8 ;áµs Y%}àÍ`¹vr1ÖßÅ2¢aÀ¹Ì‹ÀÏs.‹Ü¢Ð÷ó´P«Ð|­*‹1x#ñíP…!‡ Ë© µ#p?Ô±d*D¹6Ï|,ðg9ðÚYؽ7œÆÀ+§1 h‰µ9Ìymæ uâÊÁSÜu²²Ÿ1›dùzÑYÄœ<Ãê{àûËÕâ $n2¯õë5à’ÿgïm˜#¹­lÁ¿R‡#ÔRËN|žÕ¼ÐZò¬vŸe‡-ǼEG~ %JÝdÉ–¬ ¿ÿ¾@Vë¨<`e5»åš±$2Y™¸÷ââœseM*Ð¥L@Œ-cÀp)qý¥q €›’yÉŒÅ+ONv~­»ÿ0©ž¯vyZª ¼@™ð©18 úÉ„è·L˜Ø}2a÷½ÿa Ê„jøs3‰R&$Jr˜¨2C}ÜÊz¬·©Ôx xŠ2ÃSœ„ŠžœU% Q¢¬a!JÀB” ‘œO/HŸ<"ðQÇ Xß:t:©j‚âÚbBÛº_#ïûN+׶FéÞNô^jg™5r½˜Z¶l1¡Þ¬N÷c?ôQ‚H¸Ö²àÚ`¬¥<ï\.¥ 責œÐ9òÙÌê^‰Ôg›PJ$©ŒOÎ \âhd'&GžÖaÀu‘ ×X¹Û®ÙŠ>_5Ô>—”pjðg;Y‰Ó ð\äÏ…hâßDš ´Žì YSG€¨<ˆžíÀtjI80m£8HãŒ=¶®[ÏŒÔ}ǃ·½[7Þ¸–=óH0 øùÇ\Þ»«W¯_ú RûÞ…lêɆ@GeRl€vGŠÀÂÏcLO=ýá$Ø /•$xizÔ{õÍõª ± žÒÕ$–R&@HÒ¦?+8Cl0“Yùþ¥’OÍ9[! ¸ùUĥЗ†¨<+SfJPc+òÌ^ÈÕì^NP&8Aât¿ùq 'mÖÊJÓÏßT1ÒLffi^2a ÑFßr9ŽCÛ‰qz±áîÓ%¿L`Â3åâ)¹¿½½¹%6ŃÙéèu¼òCô-«áÆß­®oîWþïWÁÐ^]O‡·Û±¨è£tgÔ @UMbQéícÖÇ«þ*ܬp±Ì;+•”Z(Œÿ¨­ ’Ú txÛAC.B-ž(P÷Aeê>üÓ=â|ƒþbæ=ºJÊf_ÍZ]žØŠyŸ¬’"ëOa9,ªi¨L5s¨¤¡²•4ÎoúAI Å*ŽT¨0¡²&H‰°ÄË r½û+œøZ€GÎVÊX­3 t· U¨l¡ ÒÂz›uH6s%' {læÈÇäIb€lŽsZ_àêNÔÓ8»õ¾.Sdƒv. @ •Ø Þ¸-^‘.T€F¢ ù>LKj€Ïâ5|68ŠWœ¤(@ÚP¼âX_¥ËðÙÔ,€’p<£óœÛµ^r'´ Á|7rïyã­ºZ¡ñrQ>nÂá¡íºâËf‡{ÑóÚa©`S%‹KK˜IÊ” PóªÌ+ùÔ…¸Ð–T%XRR¾½úæÛ?¶÷þöE”£^}rDI¢6Ø«Ú3·¥è¯ÿ²D.\t©ª,#ñá#ˆÚ6”ØoI÷fým]I žêáI¼)œä©Ž8 hwdzþ-ðî@oª½I†Å˜y @@U%ÞxõYè»Új8×QCªTšn/¬3òÐà›ÛµLÊêÇo¯^úU{÷½bÍ‘Éÿ¯‚Ë_G5'W  VU‚Z-Õ ¶8Œ¤ò1pÐU¥ÓN»-°Óóµ NÎÑÍö÷BhžŒß³‚©BRsbæLæ÷Sº5rbW¿ÝË„µ¸G¥-Ú€bJU9¨/¡Tº»ÞµŸö:ß^S*)qAÿTà6kŒ¨%©ŸAÿL+v ® 68ŽL‘ rcŠ¤ ²P™Bw×›JëˆòX°€"îòË_®’êõ»ùLn>p¹ò'§¡ÙjŒ5­uÇm7øF¹Ö)§[Õ{!¤\âq%¾¹¿zùâ.ÚkÍ´'98ÝŽàô­£”<À»eêfL$œŠÁ/S–‚xcàL2\‚“Îä?üj¸¹ž"ÙûMt4A{ÂàÆsþë!,×Á¯®ÆÕÕýôWw³®a.\ßGP™€˜Ô•)IñØSè3—ç¡¢ 4¨„аþüó8==HaÇé€V¡²´Šw"d UA¦Ø}.$·Ï¨}n?[žd©¾VqdˆýAE¦p ý³Ž¶¾)ˆ¶Ee ˆ›Soâ*Sœã<WØP!Þ@TR$~Þ·ˆ ”+QI¹’ø©Œ¹@q•)NBÌŠ€z*S¬ º4P>CeÊg,¶ˆ-®*)ËqðYŸ-ýà‡mÏÍÓLEûÜ6Öqlò8¶-SâØãï_L7q5EuÁdS5 (¢’â ïãÒµE”M=q¹#*)0B½/p(ÕBj1ð™J'wnñýMØžmò€ßøë¸jË¥ò¨‡¡’zÔm* ª„hX‚?Žø—†&€É¨&ãÓJ ¤J(ïŸõüK•)±Q–R¦JH™Ô5È•*C®<’óg—€ óŠgTe9£gŠÕšª3M@UEôÐbH(`†ªLmŒóŒWœ&ÕCüfÂ<} (ð𠕤n¨ªá†jÀ ÕóÜÐ3ÚkÀÕGNKJÞŠNx+$\æÕóÕwÔY9ï€tB½ 5àzðßÏS[3ïYtÂÐ(hÍ®Ú µ1ó6^'t‚Æ스Q3ïtBÚ(ḫ±1€ç¡žGAcLÔ†Ÿ’”K¡áª_‡íõóÕKýÍý·ñßãýóõ¹0µYÀ)‘¨%ÙkÓFmð8åGö›qï_½®CkÀLÑ5Ì ˜):)'²_rc= ÕE7ˆñ¢ÕFôqµâ]¹LŠ$v™N±Ô Ô‡NJ}›Ý(•6à£'T1Zƒò!š[Ùck¾ëã~¿Ëû¸Xý\ Š™è¤˜É±Øuq¿Ûå]\¬˜¨%PtReßó¬·ØŸdº]ÞÅÅê+jPIE‹šm¨‹¢“º('3ôl[ÓfúÕ$R”š× ‰Nê‘ÜmR"yƒžÍü²&ù¡Aáþ8½™ÞPùnR‘X}·†‡~½ÌïÿðÕ‹ÿùù—ÿþÕÿ3Àø ÿ B-¼ªA%-ÒäÒVâ›>Š«ºQžKTЄ4(þ¡“âWté ¨ª:©øqú½OÌŒ‡7¿+œ°úÅ–lBÜ=‚: :SdŠmW¦Þn†p4u†£¹Ž¢Ã?X?zä|Öê³Ðñpq¯ÿÏž­þÇj†(µ Ñ3ß]ývÝ7jO€ÍT!Y#Cw=ùxÛ·’õú«ùÍŠS[,o¦ÔGÜ•LŽê¨1íTõRËš€0$5ª¿±ïIø¯W‰¼[u>ØËuí´ø¨"w˜’:SŠ£ÆlÇwRb YRgËa\ÊDÒ¥–ì x‹:SuâäÔë ヶënýWí½ž•O ÀKÔ™ÒuSc³:7œjâ¿Q'üƵ‘_Cq§N™ ¿êÕwvõoßQqAu†ä˜ÎæØdòÕÌЉ§ €`¨‚!ñpy3 Ö‡oµžŽh\™Q'dÆ·8s€yN’dí&ÚãÎPËGê×UFPµJ‘DZQÀ<«šãGÀÔæàI›/Âv Ã[ †ŸÎ0üjLþ:+ÙOgÉ~— ÿOgøÄ[›aæ]}ôµÕÀf8o$C¾.|™d3Éô( (r:C‘‹ŸýçîÒÏVôç[w¢Ïþsw9¹’çC–a¾?w—(+y.°h'hhûÏ]ç©n°t–€U¾ˆÿQµˆ‡Jg8Tç;iÀjÒYVÓ¥ì "é„ŠD %§H'œ¢òÿg•½ #m*Ý4àýè„÷CÆ}æ>bÞPß%0b¦fK è5ÚÔÄ\¢­í2Âzz[M1iç”|´#¬³ºUŠ5c?zÙ k°‘[TX7á4Ø(øŠ›×/¯ºs€Žˆ,zÉMû,yˆpM*ÓóÈ@Žë9¾(ä ¦u‚˜^òÀÐ:C/ yØh`£—„<̳&UÛ9ä u‚<¾ ä —µ£ãÓy2êlHPçsBž €=›¦B»ØÔ³IÊ·\òdˆÚ¨iÙ ¼˜¤ÀË# OTc1I5–wòd@A“„yç OÔ~1Ií—wòd@“TQyç O”h1MÅ>É€‚,&)ȲäÉ€Ú,&©Ír)È“åZ £Dì<@²1™"0J0PÅ° ¨…ü“ðG OpC ‰r^È“ “©áA¼1° ™â¤“‚)‘ܬþñj;€™ËTç˜Ö¥†ºëY¯¼êÛŽ»Q˜Ñ´},÷àE*|Œ b,8¥$~±F‹}õ¿ÿôù‹Ïþø‡O¿ørÍœþk¾MÇÙé¡1GoÄ$t’å»ü êòË]—kÎ `®˜„¹²þöþ‰qýjŠI¨)ë³îG€  ¡˜„†?O6hÅð¿}9à Ü“p_Öc{è ”Ã+ŠÀh1 £%±Ãg@|1 ñeÞ7œ >h[Å$l•‹ž¨À41GLâMÝL¸³ä,BÈFd±ª&HˆÐb‡Iˆ[³ÿÀ`P?LBýÈÏêØ“œ“p:â‡vfh ÃdHOLh_ÈÛF<,…]»æàæWÛ—O V@ù “”Ÿ Þxô¤î5\™™ÍÇ…ó¶å¬kc½ cú¾oƾ7vô̶nße­ Üûµw៎RŽ‡“…84À¹dªAœúà_¥ .žÉÀå$5&ÓÞãœîÁ¤'¶8¢¤vÅcÚû2mïnEÛ ÜS¦ÚE}{?=jo±¹ËÖp¥ ¨al·´&sLk"ÝtÚ?‡Ûmò¼÷ÚqÍeˤ~-ëG¢ÞF &nCË"?€ÌYÚsüw‰ŸyÇbm¯^ß„þÝ_4ÌSÇ\8èN¸ LJX ÜÖ‚-ÐZ?ÄÌ=x/DÌY@@°Mšz<SjVÈR‚MH »R„á½WÈpÚkf沈Bªh‡Q¸Æ VŒÿòo×þï÷t|±|{ÌW &µ,`,ئ÷i3Á&Ìj,vðê©™÷vöˆB@·y·d› ‰@ pò¶©ðJv:Jp i›Ö·¼ã½ëµìzÍû¶mLŸ SË"þt9Ò«ƒ}ÛH>Œ£êý0ŒZI¥3Luê8{s÷z:ª~ñúæåO—¤»Z€Žµ'б³Vy:lúo²ðV[©–N&¼Z€5µu*é‘á°Ý-‘M€ŸÚeô½¦lw|Ãú-Ñ£ °©¶@"}¯=GEe6ùš…ŽÚ8à9°)Ù œü»ƒR9«u¤Am-pI •ÖÚuµž:ò¥U{,»Ng½Çg¬‹iŽðj À•úN‹Î|,À´ÚÓJmÆUCm0ç¼b?gîÔ& ç$´Ç.TÝÄßÄÆÛ›Á«>>möPSËXÖYǼ árÓ]Ø!:ßim;¶Ì·û5µîo‡7¯‰9³_NCðà¼ëU-ÀÍÚs °®6ÁºîQ£‰v±€:}ì ò¶7Üÿê¿ýÍv²Í´cïöÏÈà ÜH¨%Ãßš¯c­Òý?ŽÍÛM•_ ÷¯ÿÙLÿÚ|…ÚbàJD…2‘@\›qO¢ÿ}nÜ=àïVãÍ5¸ù»»ÕÕ¸ºö½¿»ko*"‚Z€µµ Ö–d¿6‘Qaò@imJ›cDº½°Y›Ín±äõC¢‹Ø °µ À–¸!8Z[ƒ£µGkí6ৠú£s“ŃÌ¿¬@ˆX€Ÿµ ~–¶"·#9qÛyM¸¬ÍÀeÏP1ô—«¿^ÇðçÇ«ûoW¿¦íßÝ^ÿj8rþÄ<€åÚ,,wóÙÜn÷IžÀ´fð¶„(ë]ª\jì×&°_ªuÆ[Ö„ò«k¬îIŸý§8ÿW¾í¿fîêfœÜõ›8§ËÜ3€òÚÊ{ÚìCü§VE_¹nßš`ü]™~Ig|Yèµ@ïÌÐùðô5yr½ã ƒ·!æLqÏ6æ)G`©3˜ßƒM7HbGÛKÙ¹N7FËAÉ!x!{ÎU׎ò8«¹îÓ‚dì£NXà)TM²€„m$¼¤Øb›ÁŸÕM äË›_§¾gºD~WÀdeßß7w ×6#0Ot2mk Ó@¦mFKþ /„;‡ÿ_ó µÍèÎ?|ÊÃLffi^2a’†÷-—ã8´Ýt<Ú½¸½ùq²vÏkŸÒ»Vº0ÁCÏš±ÂM' ¶•3nÛé)ëÄäúAÄÞ++„_=PåÒjÏ/!nF+àF3ºüÕcU¡_ö¼ü)bTkj ØL­÷ÍàƒŠV×äÖ@5›©fP”t_Äê­Ãž†ö€Ò 6[:as,C‹W]çþ0j]‡Êä‰"l…†s8×»cÎÿº_ävƒ8#[áá}[Õ ê„ÍVo½ÿ p´YÊf*HãEPššÓ Àú± 뇺]_ëèm”À–Îþ523ÉV °‰lÂ&¢÷ùH…`áX±Hâƪ’M¨JÈH¶}W¦oš¾i;?Ž¼ !S²u1<”èúam"j­ß1Y€íš.F56c߆Ðg°­Œ;«X3(/ØÀ½éC'_ßúþê.ܲ.!ì´vúatý`‚5³ÂÉÎs9hk£ºâ«xã"Á ØX6ac½§F õël>´ŠÖn!Ìš¼Ä{÷Ú@‘PØ œ ŒY[¡f¿Ë&ü.zFp—`-…™v˜MØaëÏV/™kÆ<çÆv­—Ü -ý(º‘{Ïo}tG(Õ ¤ºyÄQ€|µ#÷Ú€æe h^égÊ3#3¾]`²S2¸P'y㘂ÒR«Þ6aŒš¦ Äԯɑ‚{ò­£“ÆãÖŽBÛh/œÓÝÐéQ¶VÆ<Ãn§A][€hfOÍž’‰ÙLŸÇÙ@`³'lS„¾iùQÀg¹gTs<œÍnïß*f€ƒfmVî ͽs¸7À™³6uoÄÙ0[ì+ÜÙÕ87PÐÊf Z<¹ü}X>Ùc˲“JP±Ê&«–÷¶ †•MjX]jg[¾Ë»¢ÊØYP*Ë&¥²öŒèn¬£ê%u.«”ÃÊ<Žü,`¶“jWôe Œ¶«!R2§MÈœO‹ìØŸ6aÒÆÚú§K韴ÛÎE—p8Iöç©I[…Ð<]†æ9ÚoL'ÇdºxRâyÁ}'‹/Bó­K]“°â ›œi 4Ã~§k*;]RŽŠ î_;*j+æí”;bƒRçò¼ErM…À»¬NWÃêt³¬@Ó j"x+ÛùA³Þ Õ™¦çïGË „–Ejár̶ëmÏ9saŒnd½Æ.|T~j#ªuŽ€yñº£݉š”O-!“Úr`KOTÞ µüä|ØçMN/îúþÛ |Em40ºÙ²glt; /Æö{·eÔ Õr¥«#WÒ‰¯(]ò‘ÄWØ‘®€yâ«ÌHWÀŒÜ7w/Ú>’^Ö±/µ-À'p"ÏNÂu€)é ˜’ûõVïÃ܉'|ÿzz÷¡µ·þÕÍ!˜v±ãÕíÝý*>{uu½Þ×Nƒ½zÕ†háï%{Z˜—.©B{ÿuE l:eóLE lº„²YИ ¶Dn0úI]rAþ· KWÉ°t€aéj–0,]°|ÚüoØ™®€ùx¦œ4L—¡a>9ª¶DMw¢8Ëô©¦j;À¤t™š+ïÙɽ¼O—ð>‰†ð7]Âß$Þ˜ï„Oy”-Šr/TÒùÏŸúÙŠX0ÊŠ¤ËP$“Ï…úõþâ«ÏWÿcÅV¿]5äiüŠÊlQH7dM7_ßfö¾L§+DTà+º„¯HCbœUÀ¢ Ë‰7–:CªKò„Q" °9‚2Ž±‚FÚ„.Â¥öØè £n?ø¶:i…ÀŠNVPW©}#C¨#ÞXì •mÆô,¡~ákÍeXkO^ýš35 À8sÆÙ¢1=à©9“;Š}rê0ã\†÷þEØ€,ç2d9bŒ øh.ÃG#Þ8† ׊´a ôÕlx–ótIŽÇÍ~à!²Ô§÷nö”!>g? =¹L¥,â3ÈPŸNzöÏn®§Üôý’³çác6~òí›óõé·Eî°¡\† u²ĆÝßÜ·/× »º[7ØpàÃ_^ÝÝ¿Ø@Ãö·Ö[|س²N‘¡;‘LÍ/Ž6þdcØD.Ë&"ÞØë,AìWw“©lØ…ÏxŠÎ0ÎB|öÇ?|úÅ—ô· \H–TD~¯ÀÐg)@Äá¬Å:ŽËÐqJú 89ÎÂežK&«.Ç X?.Ãúyd†­H‚á#Vδ/e¬>¦¾bà[2t$ü¹@V`õQØeCÀorY~Óû£Γ;Áy"› àö² §Y׌⬸1Œ^±Èÿ&”Ë0¡ÎfÂÂ]š*1XVÎå½Ø{8cÇÍ0ÃÎùúØñë›Øn¦hÙìþ;aŽ½Ÿï™5óT·xý–)|}6"ˆ×)–ižåºª¦¹Vh®JtœBÿf½|¼~ÒË¿E;Ú5ë¹ãõ“í~ïVȬïŽ×O )˾?ë¼ãõÇ­ÀY?¯/jÈÃ\ýò—»8"ì0›* ihé¬oŽ×.6{Ö7Çë›1³¾1^ÏÞþÿÌØlÿòî¡.Ñr2à˜ØS܇f‡ÇÞîøÉl€ÃH×Ȟ蘺Jp¡ìç±ù ”å(Ñ}2à>Ù ÉHÚÍódY&ª!<½§ùËï>ýê«Ï£¹*ØÕ„æÉês°áËÀë°Ëæ`ß:YEøízˆyÎ}¼þv“¤ü ùˆy–¼^î#.£'IC€<) ð¾ù‰y¡xýqç¼Ú@¼þ4­ pƒ‰2Áe­ÊS²)À§'š OĦ—†÷Öž€€%Ñ|ØØâÝAô‘H/Ü{^H!^¯DH„¯š©d ›âkßÕõêAª· tWIˆ×/—X°úHèðq‰¼ÂÆ·”ÔaÒ Î;)ùhG&¢úZ«T0¢ýèe7ÌÖ9 ª¯C:Üh¢Ùp>'ú¨J$¡eÀ“&Úï§õœ×–ˆ×³ÃP^$Ü x¬¤Tv‰)N SúšlJȈB¬v’Ad•'ÖÌ+,ÄëÕ}˜×Yˆ×Sðèyãíy]ƒx½¾sÀØÊ,8þíû”O>‰D†ÓÞ7·«ë›ë 0ñ‡ööªí^F–{»—Qˆ×óæ¹fö{š)t=÷ö§ØÉ!úsÜZ³}&p𧷷ӿKa,¡uÀ ž¨p½?P4J\¸0ƒá¢œ×2ˆ×«€Üá‹ÀJ ‹“Æ’ðí¢·4¯¯`œ{*oO­PTè0à‰RýåÎËÄë%[…ßO²wëÀ ìÝ+ž.XÁ ¬gFÕ`vlÖ–|byNO™LüC$^2VÀÖfjLÏÇ®ÿ¬ŸÕuæÃàW‘-¨ýþmæ$âõ¥v~uP§yaˆxýçñÚ€+ÏèGÐ]ɼ†D¼þ˜sTb€§¯K¯×¼^ÅÍÆC€CRC ùd±êwÝχD%ìg)§Ö|ý·¥c>fd¯9/¯Îî=Ó@lðÛ‘Žó¹¬j„î¼ìF¼þ(à¼øF¼þ³ðŠóñúÓ fæµ;âõŸÅk›W‰×ë3ÊóÊ!ñzõŽ{^Í#^/ÙqÿÙß=hl•§TæE5âõK%O/Á_ý~([zšxkà`NV&e¨¾[k‹mÊy'bùå·CC€O9QúøÝìžBî0¼À瞨äüšoàu³µœßªß—J‰×&¯n^Ú%^ èf^%^D’b^(%^/Kü¿¯^¯ö©Îw^"%^¤Ç8¨c²uËW -qFóZ.ñú?Ñ‚Îh^¿&^ÿ¹X4¶y›ÎÄ'ÔrÞÃWâˆ*=Dg4/Ò¯?ÂÍKéÄëËgÌç%jâõƒ6o ¼ì M˜Y/{€”.p³ó²,ñúYÜìÁvlŸöà Üâ¼ÖK¼~jq“ÎŽÄܧÕ7ýcYÐÄyÚ{q,€:©1?ßÅg.Ÿ§¿XàgNJϼåDô¼RL¼~²Ý™W•‰×O Åy 7¢.줨Ë?ƒç³Ï ÈÞ°“²7ïÝš`@‡-¬€ScÒP¿a?õÔoØ#ÕoP¿a'Ôo¨wŸØ ñâÍç6;¡GCŠÃjñ è°“º0o3~`@n†›yÿ–P¼a'oˆKÓ°Â4Ä›#BË…¶‘zšùIô]Øi}—÷n#Æ€Ä ;!ñ²þ<±Š2ì„¢ÌÙ i¥Z5,«UóžZRà™Oèàœ}$sØ ÉœùWòÏ}}$‚ØI‰ ÷oMÙ!6#;ôÖöa@þ‡ÍÈÿ¼w¯DX'U‚ˆá!ßa§ÄwˆwñAVT‡zoளÊ7Ä[—š•Š9yRáÿëÍd+%2vaYaR°¹“wXý¢¨´xx(pq'DV6ý§ ZhÆ<çÆv­—Ü -ý(º‘{Ïo}î–À[WÎyâ%‹«}1  Ÿ©–•z¡~&Õä$·&KvJ†X×IÞ8æ†àäµÔª·M£¦éB(?õkñÎß“oÃiŒ0n`í(¤±öÂ9Ý ekeäzlÍYƒˆ–°yZF{3}gµÚ˪ílD46 ? 8ˆ¬€ÎY|{œ3R8ì„ÎSš#çpì@(‡e…rˆ®HÙ°¬” ñÖÀ5fåaNºÆm¹‘xƒIB*þp^JÍ0à««qõ£_]{X•¤È}•–U™YÐ^£0µŸÚO§j€ Ë âÄÏ…`û;é[r „xXVˆ‡>ÕüËÊïTV°àeõ%Ðïaýž’Ö}7é¼<Íü+bYá ‚U=¥%Óúâ{ëp"Ï64Ò,bD,+FtF/½Zº¨Nèpe'D…æßH)“½!–Õ:ï@WfpÖ;¡5ô>FE@ ‰e´Š"# ˆÄ2ŠHo;^ZK,£µô~Î öÄ2bO3*±¬ õÞÀeå•h·î%£’Dm4°êGbGÄ›#*:é«~vË{Š7ãj=éî~]ä7€|ËÈ÷,\R:,+¥SwV š•Gv1¨%v˜æzv¢FáöËqoìÿ>yêˆ؈ÕPǘÅDå…x[`9’ úÆ_‡äÞ/¦t3q%a–F™Éæ7Û’K­Ô.Ö^òž î;1ð¨R=Í·±ÆÔÎq•MQƺÙÔWÌæ‘4 ñ¦À,%‚(§_Ì­¿s»AÜ8+j+€­:Ò#!Îe ÂŽTCˆ7éHƒƒvÓYžõnòMßÜŸ|v3ùœÖZI&ÆQêqìºn4rpÌÊN«Î{1µ,’µÃ#Zw2Àí¿m¼ê‡”Ó¬Žs%œiWCg{ßôÖMìãÖy£û>9ÍÚ7 ý<úîë)»¶;ü‚'Lûkoýåõ£,€ýÍö÷éq½z8]íVŸmº¨s8²„°í ÍÛe3¢¢ö6Ó¿6_¡¶8h[ã ë™%¬gRäD0螇mãšË–I/ü(ZÖ†û¾ƒ‰ÁÈQžvF¯^ß\G¥Èt³Âj" ð›Y†ßW? ua¬âýع.îðBÌÖé°íS²i1bŒ™êb{¦³ëñõ65Ë°©ŸRb+ŽëãÒZ€ñÍ2ŒïiŸL~p.ÝËo ¼U†Õýö2©€öÍ2´ï§4ÕΑC,rvÄ"'Þ8¢ ›nŽ„ÄèÛFòaøÃ"y¥EØH¨NW5Ú„Í/^ß¼ü)_ψ¼Äl–!f?¥érËjÖ nô<üÔŽÒ#·vl³€3œAM-¨ÄMÍlµ†xRkˆºy¿TØ?1JˆeŠøQ™"â*¨On+¾ 5¹­I<Ì‚Œ«´ï—M'•oto›^)'úŽõ>¬’ŽG¢ø*>d¹xµm¼íÚQyBÖNø6©s-Ó²íEÔ’8\hK¤Èë š¸«™ÂÄÓ¢™—õxÖ-F€™âG˜)âbà&îjŽÚ\ˆ×À…8€ ñ#¸ÐáAÑÿïÃs~6$¶„ïèÚÿøÇjý‡Ÿäÿpóëg4^¥ ‘‘Ž {{s{¸oÏæn®ýª½V7×/ZÅ65 ï¼YM§|øó»UnÓùÕõÍõDZñ5Hj;‚ÕX`€À ‡ô¦÷_4ñ=à‹ÈÈÏn–ÊlRNo­› Ö¬·mÜîõíÐK«˜i¸rã ;3tÝáZŒÆí!椾 €„‰lìé±,â0#2’²eÃ'½Û@ݶ Ûge¼ö£2Ú´ƒÚ( ¶?|wã-Õú»?~ùÕçÿë«‚ù ,zF vo~NJ¥›g’­°õáÕÅæ(0ɉ`*qŽ¥T!kr'@âT$§OuŽ~öÇ?|úÅ—ô) NEFàôxŠ®I¡Ô'2 ¾¥f(€í‰¶G¡ÀŠÊ+  h"¢=Õº§½LŸ¥Àf”:géî±ä™ liF¾s±™ li"ËIœ©@åR¨[ Ä-E"nùTgêŸ?ÿ´ º›"£»yÕùù‡Oÿwé€\‘äÏч§Rç)€ÖŠZ»Ü<0V‘ÀX©óØQ]cG T$€Ð’|ÛA²mu}s¿º{óúõÍí½ªRo8*jÄ:ÀŠ#ÜèÞ|ø-ñÀné5ˆs²fìYXÄÖy!FcyãÚXÕ³wC$ãrq˜“}FÝæd‰C´>…©%+¬& *L UQ`¢LbP`ƒLUQÌb)`a&›ÆK5ª~¤5Ìuƒ²BD‹m#Bn’Â2ªpœF#¬ñ­ÂÒ6Ê5MëX+[Ù ÙÅ´Ð,q{·ÅhÜÜÙ$›*³dÏ„4Eæ^;®ž¯¾{¾úþùê:ÂÿÚa’S'6ø’UͽmJF=_í”שí>(QÔ¤¶g¯lÎÔ¬«ëƒ_ÞôíËÝ;hµÝÀÍè^¶ûÍõ4IÛÛûxͨÍŽÌVéÀ¼jZÚêÛ|!I3i×Ô¦ö>øžîͽ/jp‰h%©=ãÕíÝ}A+€Ü¤Hä&Ï Ýàh‘È=l«þùêîX[÷yDV¤¿üðž*‹#ìZÀ®iºT¦Y¿ÑzíÿW7o…€Z WãÅÒZ$2’› ÑÒ¸ÇÉ™Ñ@w‹t·èn‘ˆAžÀwÿfB@¯|ÛÑk÷[4ÛzZ|ÿóúÍ«ÎßÆ kÛlfD¶½y=´kXÈÝÕàŸa—¶[$š§£äýª+߯«®|¿®ºrhÒïéÕïo‹Œ&ãüäzt×Ãy³†ÑìûƒWÿ¨llH¤çF÷Ço¯^ú‡ñ=òJÔÑ”ô-›\I©Ô׆ú‘²© ÆH )›ez~N<ìõw½,ª©$˜¤lr2!ý¬Ü)& ±Àh×z®ý †¦•Ò‡ŸÇ¡Y£·²ÛkŤï¯^¿è^¶×ß¿h¯‡me𻵤îž%²”MŽÎ¼ÙÜÝõíõøAO*"ø«áèÿ8Äøø!æßþ´ üiÜlÙÌÛýp=ÓâgÛ¢ƒ=Àö—{bKçI¸þø–îoG¶¿ÛíIÈdÞq„ë©q£ÝxÞà‡ëhyŸÄÀOf3b£Ù³}dûïõ³'6sÞ¸‡ë'ÞÔ¦Ÿ$­8µšÚK„ÜK <Ë× ,"Þ¯Xt–zA©ßDŒýͺ’õzsò`Mãskr¥’¿Ájüà&IýÆimÇJôó|¥Ø–5áOy±?n)›Èæ•o¯ïVí&r‰$‰«»U&„,ór€$Ðú“ìè7æœúÞ€õN¸?oî¨iS´Ê¨K Øê“Š¿E‹ÍÖÒáÅuGájÝÂV;!mÆ’vs`¹3tŸÙIýéËðºV÷7ë¸"ÎÞ×·7¯ýíýÕ.4_[œd¿T8¯-OäxןêÔÌ™0â‡v: ™GòÛ è52¡×ÄÏé”ù±ÀLf˜5ÔQ¦ŒW°Ç% »ÈŒ¨ëìäïöþh:ÙòñêåËÕUÉÝz(›ð€¯"3|•½R—”s’Ñ™®íZÓ9 ·-S#óf;ŇqPÇ9±µ®ô´Oy8øxžKõS  ²ÈŒvkiÏ.nË|TUãnf4mß6^èÖûÉo3U{Aø'©S X32aÍ”wBµ4VèÎè𿦋DzMÏÛÐ…±÷½Ÿ Üîím¦î|rtèAí0³‚LiwŒu\;5rg+º¦· 7MÃýzfbXy°+[¿œOÏlˆ½T™ˆá–÷¦q‘£Ô+Ëzæ•·<ü£ež5²ozÓÉ©7»íÜ^ov¿¤öx„ÂSÞ-lXj¤ì[6:^P+œŽ*ˆª×ëw³Ûˆîõ¦ôÄLRŽ¬ó•€{#÷&›‰|Õ†ðáï1véo®C؆-U¡1D™q.S:[µ¦wÖ‹°½Œ§]JÞ·\ŽãÐvSãµym_×ͦîžEHŠÜŽà)gÛ=I&ô$ò§àì[üf†.T“?·{óÍ·«øú«ö1€c$E…Bšl!™°…èKé»õRúîRUè¿+XM€Ì$e>eT6ýVÿøÇêÃé§C›˜ÔÁøå~ ò·þózÿkĹW2!\=r¶oÞPÕ„)™áH‘_RI¾þWw¿º>ÊЇ¿Û&’KøÒ°°äIiõKÀÑ’²f¯Z2Ñ%É’¯þøÙ,Ë«›âž1¦û^½ïvʬOˆ×À×7“”À³² P¿dBýZ,áÍPG¸Ÿ Éj•“6T>ÀÈE¯•Ö#÷ƒQ¢]ÇBe°{aúa# @¡¶¿ NV@Ö’*gS·€:ªáä-™·è³¿ =êôëÛS1"¿3`O2t©ÕNj §CkïÃý„T;Ñ£p [Ÿ-ô¿ß¤™Jß?0V ÉŠüjÍJÖЬ$ YÉL}ƒ=T`áØ^“ÌðšêÏ7¡I&„&êkVE×Db€š$]|*QäÐœQ[Ì˧‰:pÀ´Ô¤yd]Z7vcÃÆÈæh¹b C-b9”®7býÔ2“©K»»clõØ['›®m:=ô]Ød·ƒrcËm̱0üë]¤HÄ,¸šÒÌKQ@¤“ÇT1 N,f«Ä$pÒG¡§©­ŽÍ$ÌÚm»Iõ/„‹^ȧ™FÝJ½|iCñ²ã@i„i4ãê[&Ç°¸›¨îÞK+{¯“î¬ÖAIûͺÙ- jÇ€µÇ>vÁSÀÍÙqvºÒ&DÚmk&±Äæ¼õÅW~D#ú9@ñ’¶á/g1ò?çL#¼µ\ “cïÇÞh3ÈVù0w†©˜‚t™’'Kù¹Ç/Ç'âï9@&äR;ê)@þeù'5¨šò¨Þ_%xj{–¥<*@P 4vÊ£”•PHÍy4åQÚJh¤vUïû` ¨„5@jO!åQ¸¿Jàþ4köHf¡Ø~•`ûŸ³P¼¿j*v `ýU‚õŸT\–;§@%ÚYñÙ¸s T† €+áÎ)ÀP,“Á?9ºgáÎ)ÀPYþ@5wNŠ€ÊRæ_ßcin T–@Ý´ÆY7Z®¬ÕJé^ˆÖÙF 34j0ÊíƒnæP7%{^x*Ë+89À¯ÚïÃô_õ7¯:ĦÇ;– 2ðY^Áú õÃiˆ;LÈ*K ®²¢gŒÜ%„ÜhŒ(ê-Á4ølu‚­šôÑGÔD–WÂŒëþõOL°ŠgöOÿòoQ®þf{LGÛ“=[}üá«×¯ïüŒºXcAe 1bÚØ׫Âé@É€ó 2Lˆù˜*Ë|8$ÂNoCU–Ø^à62”‰õç D[X*)#rüð³°hàa¨ ã°g¡È*À²P–Åj³âc®¼±\ÅkBsÀ=PîÁ[ á*À)PNÁú³( Wr€ÊâçiÑp (QA%S›¯23–¢á*éWHÿlx®€•üÇÏãh¸ €îUt¿< Wì¼Êbç‹ÛYi¸  ìÕ ”=ñæÀrgêoÌNêKÑpÀß«,þþ0ï*‹|§D).W²Æv¸Ê¢ÀMÃU©­2Hmê(SV­VZ­2ÐêÙÉ¿ WPµÊ€ªß-®xn•Ás?a«ˆk•A\?]«Øn•Áv?]«hr•A“?]«v¥jÜ@¯«ôú¬ àÖUný]`°*WYxüSM¤ؽÊÂîIû‚_|°MS[j›_³í~$¡L ¿R5 €ÞWYô>m=aöª˜•Áü“§ß6·GaÝý $²S+ù«5dV Jç3NoƒÌªñAeˆäw¶É¹gNf´*À±PŽÅÛ1@€Ÿ¡t…L´ä •”Žy‡e­ Ð>TBûX ­ ð9TR£ùú÷˜ÑªMEé|^lcYé´Vêæ(s–Äœ(™£’’9ä;ƒ’6*)iCM‚:5Ê´Í¢´VêÝ(¶-磵*P%G™ÜÁ#i­ÊÃjr†µÖªfÉ\ñ!©9¤ÎZ`RÒyi­ p’TÂIŠŸ'DkU€¾¤úýÕSuÄ`¢Ýp‰TÂ%z­U~Jø=9/”•Prˆ¯pr”­ ÇÁF‘ª/‹Öª1Gs¨LËQe$âM½°5»óÙÒ#Q/†VõZjÃ:Í")Õ *%[Ó·ÃT M¹ re;9 Éû^5Òòfà²÷}ëDË-S}kôÑ}k©²dÏ Ê°¨ù2,’DƒëF=Ž}Çü¨Û6\‘º÷ʉÑö<’ZÒoßøûwŸ†$ƒ’-ª dËáÂ&¼õz†t%SŠ—:¢x ài)Wáøô,E‚°Æõàí¨bÙlÁ›¶³Ö´.léÆ‘«Q‡5[¦› ò=ïYㄵü Âœ·tnd­fÒZ—[ã  †µNÛ¯hÀÑ󼑧±Ø©]Ÿ©º€dR¼Úßm[æŠ>b®ÐV½¤]SVBZˆfZ³znM¡w}ÏXŒó²c<ÜrôBK!T;Ä]ì*>är¦„{%ÙÐpïÆN…@ÙYa„:ŒÉ`ý4˜&Юn*5Ð ®0ø4Äž‚©—`ÓÏhª+áNʸÅÀÚõ¬h^]×TÐ}®y…Xr}„%?‘ûð£Ï÷)Éái€Q×Çõlûƒ!È|þà_ÝÜþ´j×H­0§~3øÝ«ñÍu?ýÇѧ°ý â8‚ßjÿ9?¿)ëˆ#xMÄ `îZTÈ¢éY#e«Ì}Ø(«V6½qFD@X§›¡ uÛk×N-“—,^Â+sM4zŒpN}Rx÷ô‡ÔÎ!õ¯·`CªçhR-“”×Ô§4€£êŽzºUÛkU<Ù[g”Ãêõó`ÿ‹Ú"àLÜ)é…EÙj€7)6 À™:gÒØJ»ÀïŸLõúóç¿ûâ/_üñËùÓ>uˆØJ`‡³‚ºsø¬¢+©3XÉùFüáODˆ–ÀF‘æ-AG¼¹þþúæÇëM¬ÁGh”ÔªfOPŽ:A9Òæçƪ®±YMdÎM|šíÜþšúv€Íà«h4‘¹\]Ñl¨UMt pƒ:Á ÆN¯Ýô;½•*oBävÞzò Tr·xD_¨TVå¿~ùÙç¿ÿâËÏ?£öx¹(*x×—"²¨F —eîzQ$@¦,Q'°Ä Ñ?j¦€-ê¶x!îGU_€‡K ŠâJTõ8ÖDmúB,–ª¾œ€(Kû24c߆×2ØÖ FU¬”làÞôÁ»ä"·æëá—Ô~7ŠjÓn u‚¦,‹¡&¬ïqµý%±…À—f!Œû 8˜5¹Æþys :y\Z$<§œR'pÊÿCœKM©4å9Qi@.ur¹t¾ž‹6óY‚?|`r®>|dÐyâ ä€ :uѹ×ùÿªèü~ß÷–Ó2Aà¹2pÒåÖ$5yà¨:G¥ÑŒÙzÛ€¹„W§ŠUgP¬‹ éß®¢ÞÕ­> =:˜tÔq¾.ƒ›­#tíõõŠØ<àè²°Z±¡Å(C”%d/LÃu×ê¡ ±c­²¦mv«íêúêþÅÿ»šÒå%5<aõUß[àÕÁ«“Äû¯>ñï œÞ£Õø‹`ØA@þj[“°_}!)~ ºJŠ_į®‘â×ð«k¿ÚÍõŸpàè#¦¤ {(ßèaàŽñF(éÚ¾º®]×± ¹Ü£û>lìÆÆãmhJl“VƒWÔz8Ææ–ž7.~Ž7 –ŽcIð~â€ZÖ$Ôr-‚ç-‹ÃhdÖG@f¢Ý€aí*JCk€Ö5xa3+O°;ði¤3¾g"‚±ú.Lϱé¡‹ÑÊ*>$µ;'WË7WC <<]sÁŒcÊë¦îÖ ƒõÚz©™èŽfÐxëý‹µÐúÚØ<êôjM P®7 /Ÿ;í3Þ¿ô“hõÏÏMÓTÌM¦!| ¦¸š*©op× ÉùÓ&8ãkj0¾`|M"ý¾75ö8mË1}¸¼"q”æãY“(Öo;žšDt¾2Ûð°–§Œ±mó‘ŠÉhÈ6À~tãØ„9 dA´iØw½frdÜGÑÒí¸é#"Ó…ÏÞP7_‡=51n0@ ß°ŠM€bø&Ã/²¢çÎÖýbc”©>ˆÝ›ŒØ=©ûv.v‘*•b€4¾ÉJãÇb©! S:ÿ€¾Éhá/Ùrr³gLx´€Û‚9b!Pï œ ¯àD€÷75x3«’MãÛ¦ml£­ø`µç·¹–‡½f.²©eQj{©0>žÇ;ÁoãÙüØŽ®‘a’ÉA¶‘þ'3aü%ãw nÁðºv‘õö P 7‰j8ñ¶`r&²Þ§-ôqÁ£M(_ê5€ä·ÉH~¯å‘–KÛR_2¢àËïwf>µ $ɨ„øòs@p ß“!.X7Àç'úÞDWd¼¬!‹ àmj¼ ð6²âÁ>‡9âs<5n˜´ s,žmž¶ýüéö¦÷wwW×ß<ðÁîfþ¼°ýÀL<ž7Ì>ˆ‘5*Àñ053‹î%ÄZª5–‚;V…ìU'¥›v` ˜™dTL„_ê¨F´J ÊX3Ž¶”óÁÃØÆõº×áK‡÷½î_Þ\Ÿ#ú¢Þc€X6 b™Ì)z¾úž8;ØØ$`cRÊÏnÎ8^½¯ lx·•ÉÙ_€6 ~¸îOSä¡ÚëuøfeÍW@ÂF×x+€Ö5 Z÷`Ðiu|Ø4³€ha3D‹Ìç šY@ñ° Ńx[àˆFLJfð?¬ÌyšY@±2ub5‡f0D¬Ìí«Í,àØLZÙF‡M qœ÷ÐÌF†MJnìâ[>4³€a“êG3àmšYÀü°25§Ôy̘¬9C9l¦"Ç:4³ –‡MjyÇê°ªâ€Ò‚ÂVÕV¬+84³ ‡=*ÄA/`óTÅ!£Õ.lMµ ;ËÀ š).:¢1Ý Lô^ Ç›V l]‰Õ5U±- ‚X]s>ÖTÔ´³0G‚ ¾ÓŒù.Äî|ãxoähŒörèô$gm¦>îÉCÙBÍHGkÄh¢Îq7XÛq©ƒ5õ²³¼öøœ¿†G¬oYeu¢Õ-'[9Ì´)0“xšÿpHl 32`ÎðŒOÖ[ø⟭Ót!£.IÝ´¶&o š6j~8õã–SïœÁD“hGÓÖ¨ôZÄ´¶”dg‘N$;â¸êYgý x×*¬eã”’¦—vhÖø¡—ºT(4 !•„‚²£}<¥°Êi©[ÁŽ™¯kò1¡#¦Øú˺Œu9’¯Ö%„ö:pÌÍ럂uŽÿ".Z×Ì{Ôp½&™çšyû®×D©Dƒ´pìêT†ð•?üžfÕ]3oÕÃõ D®®™·óázÝèÏ[úpýè¶ÓÄ¡’Wïn©©kæI¸ži>_ºùœÜüyåšD‡{±oZûV܇yéRcÚmç-·kèÔõ£”Mì#µoóÆØiÓâÄŠ«Øš8 @ìjˆÝ,¤§„@Eµ¾ë}ˆ“d˜jÞ ×wR ªç"¦ËWñ!ËíwÂjš.–ti…êG+zÛvC×·}Çz·³‹áÖ¿~Ùöþž¿¿¹½¦ÙÌžËböª¢.÷½îæ¦Éëˆ=·7?R#0}Ž×a ©S8¸íMàv.Ûc–ãÔÚ*–á[¿˜Ýïâ‡XÐdã¹C¥Çã®zÝ)ð€Íd৮•–³A‹¦×¢]L{mÔÀÚ!2r@.›èHÐe@‚ãS\õ¶x€=„Ã(”2n”½1cÓ1çÂVMÜÅÒrë±)š?À g|q|n~œ ± cŠ×ËczXIµqp|.ƒã+ÊnÖkß^GÐìÆ¥ìÎîB{k@² ôœ¨‰FÎ%¹xÔRS¹uåjÎePsï*øhYÉü0}£hþó·Ú*'GnZÙIÓ¹¡ï†±e|èU<¨ðåòÃ^D^ ¬5Ç© ¨ äωŠãT7 6!Äæmxµvd#ïZ7û°»m%cb0CÛ÷“&¥‹ˆ•¥bsÓ6J5#SãØ ÝˆŽ«K¶¨ÖÚ^éFõâq9Àĸ,&æ]ˆÉVÆ%X™³ÆäOãjð4ài\‚§y[19@θ9ó3‹ÉÈ©äñg“0“KÀLïBLÀQN¥ Ðú˜¼ó«˜‹"‹í1Ä5ÀW®|åøÊ©ªä!šŒò™µa¦ö‚CXØ>Vø“çÃ.šýfWûxñhvÑ@¶ùúY4âÄòANx@•ÔwøÙï"šÅvä¢JN@HUï»Y¹øxÓ:ÙÝ«‰sÿ”vÕ@}Ý%êë¤õàØÐrÑéÆiÝEÔFIm9v¡ÙÍÐ{ëasxõ$ø<èÀ»Dþðs™mû{Ÿr÷îHšô®F“ÞMz§+°[nV^—’pMgx,ÊÕÛ¶5]xÍØZ.Âkw¾×SËLf}®¼€u:X)Ù2#­ !I˜}¢’VŽC×øc,ÑÝ›îây õë2Z¿ïF^¨ýºDí÷¬y ÊëjDyåu‰(ïÛÊ 5]—UÓýå€ð®Ë ïþŒò@ƒ×e5xŸz^ »]‚î~d^ x“ûÛ¶¿ß$*ÏêÜÙšh ½]"ÒûϼÀ¥ò/ï2ÒÆÿÌ <é¼`(8[sd .‘‹~Wó€4árêÕx=ŒÌ…ÐÙòÑ3¯upÔCß[-”àºïvë!Xñ'”ZÚ.«¥ýϼÀ™ó@ÜÙ*,/Pêv®•Dº]…H7of¡ò„¼À`½¥¾Hê~píCP0ò^‰Áqe©Wñ!ËådX‹l*N.ÄèÚ÷C+Bì©Å0È·m쯮ïüíý…Safm|¼^å}BÙÐöY³¯Ÿ…›tÃgMk¼^³Rf-E¼~ÔÍØ`§Ä RsÕ…õ"˜`vCv•]ñ.†ÇxôñöæÕþ ^ÿ'Íâñfžg¯—³KxË‚™ï™V²w¡m?ê¶á½ŽKÛƒv6‹ðX(|Ç=C÷|š„ÔNÍÚÆx½¼SQºÎ ®bÒÓ¨±]#ƒ#“Á¬°f‚„%Ö§nÄÆ“Û=»%Œ×ËÝOøÖìž0^¯˜ÿóšáñzÅMg‘è÷£G冹®ºUÖt¡JýþŒ|jY„³_ŒòÚ¡uعH°RÎŽÍÀB¼b•f¢©ÌCzØÍuß^ÞÍÜãõ2fÉÙÝ̃Ïãõ³¸›œ›ŒrH?nîþ¼Ä!ÍcËãõŠµ3ýŽ×ß ‡46× ûßýWCëcÔÒ—¼×¼ï¸fa«Ûû¾—Áh3"DßæWê¼Ï"w˜ýwþDÜÕ<º:^'§*Ž4mÀ+¥¶ø¨#œ6ÑεãõšÕ v¢üT‹7³R‡wÚ8ïبzÕ;ÖË>´¢ ;9É<1)Ñć,ˆþÇQöÊøÖzÑøvì¾28ùFó`“Æc÷¹ $»—íõ÷ñPáôü¤yÈx¼Ú‘¥Î0ùdÕäA =~ZX¬¬ðFxˆdš_ÛžÓ죶p$§¦ÀŽKÞFqÿ¦ ïÜ0´šwʾ¢K*ý? ™ÿ0À èÉHY^"ß³[èÛŒHÁ>s¥¯ôéa.ù˜ímÓÃ;ʨf´‰ñA{®†ƒ¹ôà¸Ë¢¬yü|¼~Ôr¢sœÇÇë5.wø¯W¨y\v¼^qÓÇêW*ņN„Ýkß9âÏÆ„¥'-óˆqˆ›U|Èr.W…mª4¶“"ìáÕ`z¡ü6ÑÜ7Þ ~\´äÀå®­Âå¼îúyd0/u¯×¼pàÍÉJŠZ¼-<8oM—‡9S¾u^ê2^¯gà¿5.ýXÒð0àËt‰¶üÁÖ‡8ó•ñzÅàLÈÖz•n!=Ägû«šÊXÅñ ñà¹Lʘ*uí°±W«ë7¯:[ ŽÐÔ8Ây j¼>÷Þû›W¯üõý¿üÛo~³ú¿zsçWíd-nnÛÛŸv’ß½¹»_s©âŸø¿_Ý݇QZo®ûxýî׫߽ôíµ¿ýõæiÄÆû›€Qéi¯'\¿‹86À5˜’cÆE‘ËoSV­ˆ‚qa\€35l¹¯Wãzv*Ë–gœÀ=Ôhk‰¯øÈӌ֯˜^fˆ7óØx=³*Þm$^´y‹Ôøy%„Â+‘‹­ÁÂÌãsãõGLà‡iûÔÊp…~#ÿs}œšÀ±'³B@Œ—€‰™™yl¼^³ò@Ü’B` 'ñ¦‘š fS^7½¸ ³Äkë¥fâXñ4¦Õbrãj8,„@oBT(‚‡/"Áˆž Ôÿ¼‹Uy×½\ÝŒ3µ,ŸÇLÆëG­Z<ÔûdU² ‹m)mXæAŸñú#‡…h' GƒxWê Ç\RuÀ1»ÙBMûËà÷a•Ok`Ú®wäwßú—/×ÿY¶ð›îØoFStÞî€wUçÙ˜pWcÂ0á®âH‘Íê’ë.ÄlÜô£aL‹f¢ïº0ÁÇÁ׉!‡Š¹<ì‘ÀšåáUl^;=^?Kvyû#u"ÌÏ.ÖTÍ®y—ÍRà2%ýyDö%6eÞѳD×|já)óŽ505ðÆ,ÁïÕ3\6g·(ƒùùŠ•²[ (ÀÔ±Ÿ÷Ƭýxñôô¾!wh>`¬¶dc¡=kÆ*dF÷æÝ=«X3 :«ðölVêœà˜{Ýu½¶aZwƒîzÉm¯¹‘xXUÞtÓ©7ã Ò†:%¤æ®ÕàÛ>üÆ1ÞŒ:îbÝãì,>†V:?Z¡¢0Àíe…Úë1ÚóÅŠÎŒc‡Îú™ÏÒ“3^ÁbíÍ%qÚ±ê~í¢I6*ŠP5!8Èq– Çã'<A5‘[¾ÐÍŸ•Œ p— ½p\jTD–»;Uc%ôxÝŒLú*NØ›W¼ÙBé5˜€<<& #â‚ _†)Ø/p·êoÞ¼V‰’‡jP àæY…¾yø<]±tæüs™ÙE—5ýNZdä?+Î=é=]𬈠à±EŽ9¶ØYÑRi«gB¾?ùç£Iù`:G%¿Ï%·Â/²¢hsø}DMA‚pEV`ßØ,˜°ƒLÌGؤ‡eÖšà}ÛÒZß)ï8÷SËÔ‚¸Ýóp®ÞÀÈ5S’ˆOpÿ2/ʯ/¼™—žŽ×/ŒfóÒÉñzÍbƪ@:™¸£"ºÃy©ãx}Y\0›WŽ×+†{^,7^¯‚^‡h: ïÇŒ8¶óâºñz2¶Ó#–ÚPl*ä{×€Õ³ˆÝ™°èÖu±ˆ•¾ul –°5~&©@"a ‰d=.YЧ¶í¦Ó]Iɶ{/hÚ]GT•;nÀnaº&ñX*,a©¸6¨Nv‚µº±­o=ï#î~l_ŸëÌ·Pª‰QÿS[y3?%ÂõªãVêÜ™w¿¼ÉäGh7žwÁ<¥ÜÐw²µèúéÌ3 :-Jç€yÃ3• ÎzÂÉK‡7Êðmx·¡ yÜ‹UM‹ÏzPX"özÞíñ¤„ÁtèÓó vŠ—üpÀ.â »¨FÄik>'ØeÍqDÎ*h±axæ|3årz„Ö g)º–’/QK´]àªï%c±ñM+;£¥ð½Ù+ ¼ézÏöÔž8  qÀU‹–êÙºÀÓ²á_“k=…ñ~öˆ E ~9’U¤ 9NÕ8½Ç’¶œÐLêQ·£îœ²1Ü0&³>,™©e‹’¶æ…è|LžûÞùAHßØ‘yÙz¾tœDuóƒ¬.øùaƒкxBë:3lÞOyW Ã9 bñ"D,^GÄ*ävsÀ¶â¶Õy#h@kâ¢&øœ ž–° mZvØŸh}.vR_"=Iì‰qfìj½R(^Ãáá€ÃÃç9«=x+[6LtEY?Kå§ÅØ?#gae½•>xž± þF½ï›S"µFç±dEÚ8‘È°ˆf?u^÷~‘Ôº$‘V:oj]²’HÉJ §Ö` VA0€“#NÎc¸œë S¨Y+ F°sÖ¼»ŒQØ€1#XU1·¥™^QtýÓ%’C›ÙÃõŒ ,Ÿ2´Åª|| I§dÅTÁæwázn|æÏmgWRm?ŽF»iÑ™ÄSÎŒWÜ '™½ü1ŽàÀ—ñãÂeŽq–®å¾¨õ!ÆŽx|^Râ`ñJÙšÓ…Èb–‹G­¢*¡¼JAâUž›¿Üù‘4N‘Ð8/t~$›Sð\,±XÂ|i+´ø1ÒBìù’Ô¹\ZÁ+*û@EÔØüiÒÑ,^Ü–,@ÌÙzƒïê2! ˆÂ²¥>K¯Ç² TxH¶žJäe xÉBÔ$1•XˆÇ°ƒ.µ‰]qHBpÞ|6Fe¯»ÇG-áÅUs ¬ ˆŠ2õ ß{+' ú]öúÁÎ,»úèö DŠâ8R¤ñÀ³5… J‹„(}ùÍêxþ³5©ÀÇ’œ:9ãÁ¼„^‘zß|?…óy¨¿"¡þ.dˆÞæ1½œ`!kÒ€Ÿ*älúa©cz®"a¸–Ó ÀC²¦–¬DT!kL8à‘ UQ/QÌV*$Ó39jiÞi?ö=÷Žõ\§Dce׌ãÔ2Q®:"%8%”ä½æ}Ç5FÑû¾— Ze…èÛ£ûö7×}›©-K<`¦uQZ‡ ­ Ø¢HŠ-Öפ%§ú@C‘Ô1¬œ™m\ð3þDz^@äºæ„óDJΣœðîÕ€%6;æ6‰Ç甕éoLëCp(Þs«‚‘P²]o‡©c@Mÿòæz(rª5ì@¡kì. û‰„ìG{y¼ðåÊŸÈ”Ó{/JÈ€~(jªÕ ÀíÕêVÞ;Z|–8hÀ‹dÊé•©_]‡€ñu˜(ÝK¿º»úo·onWkW쯧Tu¸èŒ"¥3Òn \BB4<óœï×ÞËÃÈ°Í;цÐÆ5n°Ó1œÿûý4{þñ’½äûRç psòaœ7?¶·×a–fÎá`®¬®îVC°7«ðŸqç1^ÝÞݯüK7%w«ƒ©Dìp”&w¸ûàŽÜŒ«7×±é7×/ª›ëÀÕ™WX}"aõ¡ ë}/r+ÝPd醧ÿ¬q[ŽÆTAaéàÜsW¼D‹#ßóUCî)ej À]®§¼d²”!!©ã¢šštÐòÄ| º¹˜ü<ÛY@ïGô>b~ ðû„­aŒâ¨!Þ 7wSB~kèG¦»A°V†Ý£ 6«i•i‚óhL˜ˆvj™³4”=aÊ‘µ#3Q*© ¿tÖ<¥èupñv8vííý ÿ_oÚ—a ÄúWKg…ˆ_E)á¬ÙÌÇ:ázùt“Í|8®×'zÂà1ïe“Q¨V‰QÇaÞWɦÛ!A3™T1£ñ$öóhë£ñéSŠæ[~ÊŠˆµ— "šL*¢ÅÏÔ†_œhÃG†úúçM¾¬/{¶"¿©yÿ k ŸIPøLV>£G%]ÏzåUˆ‘¸…MÛ÷†ƒºõ>{´GöÇöS”Ï¡?áÙÞ#ÈSsÞäÊ| µÅvXãSÌ *@¥”Y*eÁø”ˆÊǧ˜AT6>À¹%DÌÂñ)ΕOñ&´l|€ßMx¢Åó§‘Æ Ýþ×tÎY×ô¼ ¶aì}ï§Öß¼¹ýæþÅpõª"Ÿ\óºk¬U™©W4>Æ:®yˆ‹­èšÞ6Ü4 ÷c舉³7´þêú`xÊƧâ Ï æˆo²Eñ Ƨq²íÆ^YÖ3¯¼åá-ó¬‘}Ó›NN­yÓ·/kǧâ %ãB« û·h|tØ·²1¸)û–ΆWÜ §“FõzývÃ+4èÞßÖŒOŨQ`&K¶|Ôx̲¦òŸÜ^™p{«ˆQËøð]}ôÑõýà,ÃÑ­!D-çcg¿#vpve†³K ç àïFóÐ…±!Û[Ý“ÎÔÐøÖ8µ?a/Ç%ߺ‚M¶Ie”+ê ¡"Ï‹œÛ"b´ä Ë2!,Ÿ;¹h»òˆ¶KËéJ@k•5´V h­’W ©ä,ñ…ÓåM«´k¬‚`LE`‹ç‰#'MŒRWñ!‹åtÛväƒW®mºÞ× +zÇ…ñj°Îöú(µú.¤s%`êÈ„©szQüøíÕK¿ŸŸ9™Ûe稭J†X¸1lÞk$_7~¹€ ?ÿüü­ï¿ÑÞßß^uoîýI„LÒ”Wþï¯}bÛ߇þnƒ$)Jìä‡ÛFGñœýò³ÏÿÅ—ŸF4 € !‚Õ†¯G(Ó²•&¶ØŽ wbJ?îð0NôxðdRí(~Ê µo®^_»™°5xT X2SéüŽ p$d†#A4ò€œ “ÚHÔû‚ˆ¨€Ÿà_Þ=l›ˆó ýeè¿[íŸlÌõÝ€¸&çSG5S“bHv™ ÙϪº4U¡ Ëи qikB Ð-ÝB¡Ê¬l7!T‘7q̹a%7:;œ¶á^Èuã— Uðó3¡Êa"ÿ"ºÕ(™K—“v™ûFpk¼^žcSÛ ¬‚+)®UÕæÝÙ2µÉÀŽ¸y&Ëš¼;Î$‡=*ë°¡ûÚA??øýfÐŒ”RÕ$tÚmç£U"ýàÄÜ|l¬àTe§!2ÎÏëÕ9Ú3T©& 4ÉOÚL{¨óXÀªJ«ä2K© È”4.ÔK©A”|r<œÄ.Ïû •Aµ®N,ùé@œøÔy‹¯š’}é^€N|ú¼ñV âu¶Ïx¹ÔQ·ïª©C@oª z3cùÃ8²“Û¬w%™ûœ²Ôv£œE#¢vìM(r;€1΢þP;öí3µÀgÑu¹§NH`¤sÅ*h7¦°êµgýsËáåv£dKt§_¦’:ñS [×jŽn›¶Ö¤Å€¯©liŠ3§ÅÀ–© ¶Œ–PPÈ¥ õ¾ÀˆÖ”IP ¤æË$<>©£rH!‡¨c ¯àµ*€R5h 5{xOîH-d£†q4ªë¬dpÖ7¾ëÛÎužZ %W¬4Œ…_1¶LJß4ZNH­™½IJ‚Ýûon¯îZ§Y.–[Qq 2ˆƒÙOÙö:^¡6¬ÈgpÖ†Ö䀀0¨Âpî&—¦€@G¨qî—g€A¨AjÔÕNKV)(€~Póè‡}‰ÍßEk2)ÝD`ɪoï|‘¬¦8%«˜”i¡7êËá‰,¾×e¼ˆ`Jå«-äºÈ-6^åmüY.Œ¸Êñø¬Áwo(Aù4Ëf×W÷ß®în^ùÕÞÁõýtp]¢+`ÑU΢ŸZœëÀpŠÌ ¤&Z¥&š*`HUM§€}Tõ\#j(­€5UÇÖ”:^À4ª ¥€Säêß;Ó[™Õ×Àvé*Ë=+›´µ#_ýï?}þâÓßýîó¿ü¥<¯mÓYÛ–6¤4sQ@¿§êY…åØ™ìáÈQg>9Ǩ;—Q+Ž-¡`Û™mzËuçœlc[§½ÑŠñ‘ÑUnŒî^„‘õwëãæ‡:Ïè> UFç¸,ôãíÍõ7Ó"«ò)@óX%šÇ´‚ \:Þp9ú¾mXÛ ö¡}Ûw¦×Z™ãýçðæÕ´}üàî~ð··»ºä^;ŸàÏŸºÀ@•‰vÀù”®±ó®§¸´óíýÃK»[}ÛþàW×7«7׃Ã]wˆ½»2O°zªNѸ¢ n…žAr|H6Ĩ2àÀŠ*ÁU"èð. .±ªSUÊèðT (²ªSUtÿ¤Sd—°–ꄨ2Ýeµ/_®@çw«»ooÞ¼bÁ⵨rdµ©Ôæ“td#ªçó;2€(U ¢”èÈPT™Gp¢ÊÔ8²6ª6ßû¿ßGv·Á¿üiÕ¬Ö&~,‡¿¾›*Iy3€?U$ÑâÇ{³u°ýhþwüò«Ïÿ×WåáÂU¶8©?ÊáæU{u½º¹=m4§²Þf¯aë´/e4?ûã>ýâKz@i?³9U¹±|¤ (÷¸>—W,¼À–¦Ì8àË\êËÊ\ÀnA¥Îàx%U™œ˜Ëhî>=óï€s'vfóˆ?Ê{ ¢ùŸ%öÄûÖ„‹JH,Àü¿¾½yíoï¯|4õ}É«˜„¼Ùtýо|.~Ð^««ñø÷E.YTBf9ÙööÖïrRÏ7ÛÍxHñj}X·«ÉòpˆÕMözû¬Ì{R‹JH-$ïEItŸ >™÷ÇaP?F%üü¹Ä¾€ì¯5 Öè„X?oëý•r4à÷è„ßsþ×·¨©| å½­×·ËðQ_ß¼“ÔYvÑy__•Ž(1Ó€µ¤s¬¥'Êh@‘ÒE©ªPFÊ’N(K´PFR’®Q××€k¤ ÔõÜ|þ/Ê`a°„t KH–ΰ„NÆ=Ÿî’íø¿÷þõýêì2KÓ‰ÈÞÎâÙ^R>þå]hVIࣷHg¸E'[¶CñÄ Fbw±±±ASMº¢XLš‘ÎÐŒ Þ{ZÁ 8é§9LàÓrç€9¥O0§æ †OÊᢖÎꊗåbÉÓ`îîÃêÛ;¤«I5h@ÿÒúדôЀΥ³t®sûhÀÏÒ~ÑKÒ•NIW´ûÊ•Îhgƒ¬Ãßú`üoœ×–xu·úãÿ3g×7÷e®¸tFúlõsè ”±n4 —é„^Fú<*S ãL'ZÕÅm*Þýºšæ…t”´I{|²|7Ís>à U ¸­yÖ9œÙ¨r`ÙyjÙ‰F•sÍ+КKÍÿ$Ð^g<×öä׫¯Ž~-l{”}ØYYü(ð¯ÚÁÇ–5ÑÞ³©8u™ÉÀä‹J“_[(©µoºjŽ¤{¦½oJ6Qø‘ó/§Gw¦Ê’cžòÑGô>ÿ%òþë±aÄC­b7è^qç»ðƒëí•\ØMú]­ÿö·7QÃr5C PPà£ùºø Z àÏÅiNyj0­ }Xh³µ†»Ééa!véÇÁìÞÀͶ\Ë»ýèk„,"²ÄOÙÖuÆk…­Aجv±Ä¶ƒ0%)qòƒ;Ùß¿üéÈ»Uí½A ) ñdCEP$Bg‹D,.‚BZä3‰!#¨¡3#è÷áNFhzgàìeEå" ´ tF»àtòûö¶ýiµ¦qù»Õ«7wÓþWÃ:·ÝN×ÃO×÷Wã•¿-‹#fÎhÐâÈË‘ÙŠ)Ð<ЙÂñCé’íY££0S1Bmë¸ Qé8¶-S¢=êÒ7þþÅôþ^\ ‡½ªç?h ª “¢OÔlè8,a2‚ƒNè†ãšjÈ&èŒlÂNM¢8Þ:w9 ´t¢µ@k œ U‘r:‘3 ÎM"5_1}$f@+`k„ 42Ъ®g)«»é;}3§reúÖ†Aâ~T|è ¦[Œ«ÑtN·ÖO-‹¼W²ÊÕ7ÑŽ¯ß"Á¢†¼îÝIÃ\Ó˜°rƾW­j¸i•ëÓÝEoñp¤õ° ƒ õ JWÐxõ‰ª³ŸÓã¸'%t”'©8]8Å:[äL=ÜWÉ&©\íI>²®ã#WOQXgˆÂ—¡>Í:¢=a¡_†ô|¸¨½î-à ¾ ÛùpÁP{|e†|šóáJ¦öøèÊ/Ðwõ}—zWÈ› ãê:®ž¥/"Šnä]/GÁCPa;­Û¡oìè›qC¬ßÚ*>d¹ˆb>ìÆØÐq©ÙˆqÐÝÀü8p¶kÉí0¢¸\4èT:K§zg" @²Ò’Õ;E –N(X‹#XJçèT— ÏK—pT - Ž'~ÕœÇ:™mÖÁŒ=œŒD‹ ˆa:SÝè)%<7L'Ü0¢ËÄ-íjªši@‡Ò®"eeÉ4UÍÌ,Èž’Š«fàܶìÉBÌͬ2a*´žGEˆØ2»`j sCâHc½£ãÎk޲ƚ®wÜ MÆöl)Ïuá4×AµÏ0 L ÃÀ†IK»!X&ÃX’ù>½#ê`Îût“a¤ÀŽxäyÜãL)Ùp0©IÀ¤¤ñ!ª°€"5 Š”ôô5œåêi†ˆSÃ)¼¸´p÷æm®ŽŽS©Ž+A¬’&‘¿õ×½ñÈæHªI ©Ô]á¶]ÔvÇ— QiÃtóãzh¨Ö 7MÜ$5ã”FmðEGPJâM#JÀe™ûm%bc€ÿÊâ¨gŸU«XÏãF¼-0‹ ílœšscˆÞàÓLŸV(˜y÷½VcTÙº~À+E€àu×?o[]4×f2¸¶%ç#™G Î$ 8âmÕLj-¾ð9“Ï=éšÝH.™: €Å>BÖo ,oºvXøÕ·!Ù#ÊßÞܼŠHw÷7·g€€C3Ú“ ¨Df#³Ò €©™,L­B®œö;"èn@ÝLêVê®o’95É#\oð­«ñÍu_í¢ÎdÊ-ëÏdÐxDW€rFU”m4%g2õ…jy÷šï&ñ²W‘zñË-áùcöõê7ëß±¯Ÿ¯%Ì®&Ãùp1ü/²7g2å…N6ÿÇÉ6nš¶¥_4eöÀóL¦ÖÐÉö|¼ê·|ÇЮÐÿ÷v¢ZÜ\GÃýãêîMÿíZÔô¸ÑÏË Œ*p0{zó24<¼áØÚ«1¬ô—/ב¢Ë¶ÝQq/~ãj(l9p7¨VR¾åa@?Hgí¯¶­pÚ¥C FRQ‰ÜÐgÖ׳ ²pŸ RŸ°—=(غƒÊM&©Üô®3. ¨e’*Qäi!¾åC¼(1щy”¯2ùòU3ô£ˆT—2ÙêR«]‹šŒÅ£L¶x1jÅœL¦˜õÎÀmäÊ0Q¦ò1‰JÇ䩼A¦¢ÒÓ fA=&“ÔcZ:˜p“A€S'°ýäuñ䙜#O”6 Pº|úÜùâɺ‹“(†uç˜Eam²¥˜–œE#m2iâ,xe“Á+_"‚(Þ¶¼be€6› ´™ši¹Š©;v ×ñîkWüu2èZ›LU¦Gr½šJØrl êV=p~™*L‹¯{àÎ’ªL%+x&Sí™@y&“”g:c„îöLê¾kª±‘k+¤rJŒºsz·ˆBÂÒé^ú£•Dë#¨êd’ªN'?K/ÜK˜Þ¯©£k¶(Ô[µ’ ¨e2¢JÝíÔÙLÜSeé@1(“)µ¬uL¦®ÑrM&)×´Ú¿|L°8ƒQ¾ÍÈXkƦ|z-¼o}/;·ʼn8©»«:s|“% Ò¼7&‡<ÙMj`íÍ€ß|2—;× ¸„-£Žˆ ’º[DϽÛP†Í@IBTÆ2ÙÊX…q¤ÿ&Œþ>ª.5ÇY‰3l&kËdY[K[@´2¢ÑØŠ“q‚°” *ú´ŸøÿëõT©:Ê„m•â[û2 m¬ Ô½™4òÚžïOÃU{ÿ ‡¿6 e§€›d2Ü$Ò¢š ¢ä•¨H&KEÊB. QŽ€kd2\£Õ –Æ‚ ="ã@ø³5„? VTÐGì,Dš×ÈQh.…jDë”èTÓ÷Ý0æ6¨ÁSË"Îz)Y Óë.ü"žéŠÎµ®c#Ó—Š)k„ò9>÷åõ­,€~Û ô{öCŠ ?SK'A¥’–¿™ÁwŸ£¥Å©9· <œÔº>Šhm› µI Xë_Ví¬R° m(tYûÖꪶ}Àó&ðé²ö=¬ÐêöžÀ®ËÚ÷°.«ÛyXýÕ–µxwóʇñÞ\m<þŠ§Ô_¬:ÿòÊÿ°¦œÇQ‹Ù¿ôíõT*7üðcáAµXp[„¿ûñê¾ÿöa©–ßY€Í¶…Øì¾Ýº>,³ßýñ˯>ÿ__ý–Ø"`¨O šó‘Ê$²©Ó¸Šç|€C^#ÀdAÍ«Q ù¡À4gÐÎ=E. ØNí°ÿ¨õ®[Ç u,öÙžÀ>Ÿ^ Ý­o¿ß|‡Ú`½mõ@^›òÚÏþø‡O¿ø’hvP×fºOß츯ÍÀ}O›KÔ¶ ö x‰ Øøñ– @ƒí hðS·l¶k3°Ý3X6à%2ø×ó[6`Òm…ê¯ T[BÍZ¶¿üîÓ¯¾úüÏ_|ùïD뀨ö„âÿS·nk¡ÿsZ·ŠR7Ôn_”Ááž6nOÈhx®=Q:à©ÛO€÷µ'J<Î~¬¯Íb}Ïl?غŠº9 €m\l?׉ªí^" ~ò¶Ó0±;&~â¶Óˆ±;1~T`èHØ ?qÃæÐØeƧ !ƒ|¶âÄÔþÍû#—;ŸÛ†:‹vMŹ„h—DÏukðcûæåöP†f6À5»×üŽ˜Íy÷äÝzªfsÞɹØýn„œÅ]RƒåÝ°Ì©î2…\r:€dw™,4€šÕQ«¨9PűyË¿¾Ú{_tÆã@ÇÒmÁ‡9¤Å«öï^xž³’T§Ê°8–ú†s‹m³v(©œ•#· x –z‹s°Šm«vˆ¨œ‘"· {–ûs`Šm«v觜‰!· Øj–ÚêsŠ©UÛ Ïs‚Ú¢Y:Ê*^OZô„(X0=?¶¦D³ÈŽ× y`m8^c,Ãñ 4¯›­{A@óÒŒ-ÓÚ¶š5`ÚX)¦Z®‡¡øÔ²X<ãÍ[¡%lPx¶rÎ(e¬•ƒ´ a¬lå0všqÞÝ7ÌB=l"—s€{i ©`K¨çÿÔq¤"ia§ç«ï¨s˜Ø¤¶©…µ(Ðá’¤VÜŒã¿'6åpIQRž\Ù Š„¸´HHÕšY¯=U"€îùê:|ùy®nÞÜm~Mm30䲂Ãé@—Y<è@E'AÄŒè‰KîתÑôû ¢óL¡’µ’‚¿½½¹%è(|ùæUço£Áº¥«) ¼º[}sëÃ^""ÇÂný½¹º Ótš¯w•Ê7”2q™R&kãÖAh×ê㧴gK\¦` ñÆÀ×d ˆD«AK^6£3]ÛµÚ÷­o¸m™™7ãØ)>Œƒ:¶R¯¢N?E…eÔqÙ:"§?Ë–«ùh3Óˆ}%I\¦$É9ûV¬¶íu¥‚Â(N¥™âÊG‰“{˜ (¼û¼}È°µR\¦VÊCo ÏÞf÷6îù䃨½7CÃÛïå.Óû´’É€²ç2”½ýní2¢O+é ø}.ÃïÛïÖ^bïIh2 S§øðö\†·w2ùú»›×“ÕTxéöꛫ¨ÎúäNU™&Ü~³Ú–‰•ã__ûãr\VwEÙ[@ès¨ÞË~¾¼¹÷ë 8?úÕ›»5‘`lûûõ/ãO¯ÚCþ=†‡W×W÷WíË«ÿAáÔ·(A~W–zd@—)Ýr:ŠÕ8@/tÙJ+´>·îówEÍ‹Ê«ïB߉=~ÿDÝ—Ó-[mµjZκ®i­œ7Ìu#Ü w¦u;±ÕpŸ«o®bÙµ(ÿƒœÊ<}÷õ¢µy¾£Ê¯:@§tº&‰ 8.S¾¦d^d½gÃP“g€Zé2µu6Ÿï2vd_?´¥h9'­«ó¾.‡°¯_ }]€` Ã%[ƦÓzt2"exé,Dç³üpÕ·÷ÁÿÞß<6Œ¼M—ámÒ=ñÒþ7¿:§1Ú-Í/ ˆ ®°ÚÏI/}¹mÿÚ4‘û|u†³:?‡µpj²x3bª%ùÁwJFåy"Ü:­ËÐiÉfß6ôÖ £îƒ• ƒ¤Æ[)Ëüžäü]Vrþ„Ùÿ˜QM2 èº,E—h”ÙÖeȶÔ;?|Äw%Þx§ Ÿ•´vŠô½ ¸º,ÁµPfÛº©ËÒM÷½âŒ#> L]–dºwVò(à2Uiˆó J]†Pzzj”‹‡;ÀuYþèvÏ|)|-ÀÄdY¢{3`¹~P;ìX†JWÀŽÙ;—.ø|Jx)ÀÝt w“:ÖÀæ%%Hh·ŒL—02O†CUÇ­¹% aº#&qÐÒÕTq€è\yzD4³Œ#Œu¢1Ö käȬ7½6¾¾ãCï‡Ö‡»¯âCJà`Í€$V8¼ÛÞÓñ`¸E‡’GÛ'L1"1Þ]š7ñ:13ÛáÌ´ŸÀDë¿Zmž2[¨Il‘rmk{ËWRaD¤–l¡¿çLJ5Ç-Ø; §ÅÅ¡Û³?^¯°ák³S?^?ºm<]¼»¿Þ¼þà¡?“iþ럿x¾Ö*ûó/þüùÿüô«/þø%¹w³.9^?jÆᳯ†7¯^Çs¦È¡”Ûݯ`Ê™A™Ö3«Æ°Gë¹èLۆצ&‰îéeÅ[¾§ em4ÖrÞÆ LÎ7¢—Áïta9xãñÓÝÉ>(ôÖãÇë³ãs÷ú6ü‚8>J+i•ð­iLØÉŽ½5ºáª¤4Îo—ùú–ô²®•Ö–š5ƒ=?µc§ôÈ­ÙnëÛ—ŒÐlä¯ÏЭoê j›Vömë˜t|4’µÎtƒQŒ7âÖ›Š·¤P'G!yß«FZÞ \ö¾oh¹eªo> x÷’ñ™ ÂâõÙñY[,âø˜žµºq kÛƒio•î{׺¦äº@rìÊú–ô2cßkL¸e{ǸVƒWaáêáx€v6–:B³q^¼>;Bã­÷+ê ¯Ø²A;×…å tÔàf`FyLJaØd×ã- ÆGõÚ‰à„ÚxH>¶£k¤çR2X''äÑøÄ›—ŒÎl´¯ÏŽNÿ2ÖP'ŽŽVÇ´V ÎÛõFoÃâèúA„ð5ÒTbO¦[Ò‡Ç5Þ“o½ ²h”ìE×Ûa`ê8z™î^0>óÔ»x}v|ü½i_’ÇÇq)ÌÁf°†‹¡už æÓX§7Àüé–ôñiÛ‘‡µäÚ&Ž¸ë„½ã"ø®Á:Û/¯éî%㺊j3áK (J8zÔ½ÎÃË¡6„QG”>Òf'| DE¬œ¦¾B VNÁ jîE6;R6>,ÆàD¥m…µ {Š‘+׳¦é#Šp’nv2ï³JÉÞú¡kú†7£¶B¸ÃÛ&jÚ›°È†øz½¯¿q@øàtKöke÷±]Jax^I¸%ï´æ©Uñz-$¿‹fzR‡˜êÞBB‹n¢‚Ð{ –^R§çT?×ëîê¿ý‹ ‰ºTA œ­Cm¢ÑlÁ›ÐÖëö=#¿ûÂSã>º¢¿~`f«âÔw»ôH8öü;zÏA𘩠Cª8;Zã6*î|Ø$hÝw]^a×øÓžXí¥,ÂóÕñ‘(ùI à¿D3_>(^ÏŽ?1L™¯#¯×Ù†ï‚Oä0K½ÖõÙÏúgêÈ+Òƒ2êÈ—)R—y»*q‚ç=G ÞO{?ê@‡&tMì=OŽ×+Âäyúo¼^qÓY6!öîµÑÎÈ`2{®oÃ.R…5ë§JŒ SËd†w~®Ø»];h§ìàFaÇ`…j;ÅMÏ›ft.{Ç’éÇxU´ÜÖ†ÙÙùÍüâur˜½Ù¶Û{í_¦¬ºÜ/Û¥¬axV÷¶Cêy’c¼^·qXlÐ6•ÿôçÏ÷Å_¾øã—/þð§Õ?þ±Ø@æžG\¶e™——Øl÷èùª¥†BóŒËxýÉô©#÷ `–%Ñ ÎÓ,ãõJœÑ[„Ÿ]x~F_„óÜÐxýILØÏŠ!ˆ]³ßNŸè‹„·(u‚7abRï “#*dî®÷÷ý¿¬®†í–üE| /ÚÁ(î?2Öš±é†^ ï[ßËŽóQÞ#6ij[f{ïµÝÞóH^7ôðCxÍS.vuø÷Å°¿[ŸN–bBvú›ûÕíË7þYöŽ7ý¿üÛ¿û5£qú³ÕÕõªg¿^å›6MÿW÷oŸùq¢=Þ\ÿöÿúM7…Èûqwóæ¶÷ëþ¿l78ñ¦ýoùVþiº9x\¾XG¯p°¹Ü‹sðý}Ì+FBŒ>îC1—ë;ÿúÛßF€%µÊl&UxÙJ8Ó0®†°UñMv*¬±¢uÞè¾'ôs·ã€÷:#< NO­þÛövõá*÷Å÷{ WñBlè]øíôïüL£ z¨ÃAg,B·Ï ³'þ¢bàñ¹2}à+ϨOzÜj®’ïœðsŽ®‰i¯ýÑ51ÏEÝf3ºŠ çmdÚµQ Ú˜¾ïCtÑ;zf#Ïn³Í]Ã{íæÛ7þ:ŠV‚áÝŸŸéw?XÏù~t¦ãÕߟGxTýxµþÓ­Ræñ_îÉj®ÿp¯Œì˜ã¿|¸ðð§êǺ“=ØþéZéñèϦ_>fá5‰ÅŽ`¤i¨¢Ín löâëýÀzát?öC߈0¹\kÙ84mˆ3¥,²vø^G:~a€î¶!Q™ÁÛ}÷´Í‹Ã~{óãö|¸Ö“:§åkdäÅî­M©kÞÁ T7h3pÞ4½f^HkÄÀ[+{¯;Þ•¼|¯}òâz DnÛ0bwxî 6¸×ü»9«•´ìÈJZV`%YC aòPßGE1R¦QŒÛCÇ@ÆÑû¢-µ/Únú²Y¿þ¶bòb.úä­ûª›±›‡æ{_~ØIžsÊ꨸?eµäôð° Rƒieö+ÌÉÎZé¹èÇÁ”l‚𽶛š h¶ üÈíÏzÛóÉ'+vÆã²ÞñÄÿ.|¹|Œ ă_FÑꇬææÏ>Xÿ¶~ ç Usd¨ ÿ‡bI®C€à‡Q5a²ù2X«›fèFÖŒEÛx|¯‡IùúõÍ5êß}!7‘ãÕõd~&òíUÛ½ôS|ýÅÕ'«7Ûü3nî'ŽèzªOtÐÂÍ}RôеR £PʸQöÆŒMÇœsa¼G™é|;Óñ½v ‚ßþ6BL°­YÿÕ z?‘PÖýÿÔ]én\Çr~åGYÉÅí¥z#_AH€y¡W‹0E"eçæéS}fÎ>œ^ærl$N—ÌžîZ¾úªj:ÖQNd¤ ½#NIm½õ„ÖeYã9D‘x2ÝCƒzž–T(izñ){ýXÌ‹>üýé­¬ÁÉ¡<—Ú<—Õ·£Z0Ÿœq™Žä 9i½@¬QŠ§¡l©u(ʺP{òyìáøú‡õü‚ ü‡ËÈÏ$ãÀÔ#k7Û4¨`µŽ)°³cš?Ù§”Wp¿s…”Eû©4^´ Ò'`$$k>T6^½²¬¡çäB£¶¾©‰h?}ßíüxÐÓßi-¶ðæïtƒ?9]ë¼öŒQƒ8™D½ Éá?ÂãOš.DYÖ%óóÓ·‡¿=Üg æÛ~íÆC·‚ðÑ“ã’òøò%CL/§g6„ÏÉþ3”täÕ¬®VCÐGå i¥å·ž¢ºÜÏ»»aõºá™^ìݼÝÁ§¹ìlÚ¼/w4—™5ý¤HŽt¨2TDI¼L… £Ô$åM@LYÖMF{ú|º€èóÒwÁ£‰ÜàÑ-ÀãtPË´¿úƒZ–µ9¨gBá5‹ûý‡Yí3ê˜Óºã-ÝZÚph•¬µ¦jd—îlÏÍà ˜¦¤uRÜç–SZ ÒrZ2Ì7£(kuŠ<âkÏ°|w/ÎnìòÑ+>l'iÔŽ4 ŸíBXŽÿq' ïÒLœ'0}¶S–5ñ×ÿ°O qq~½"*¦Ÿ^‰þ垺??dËû|h¶›gïã9ð<¤ú³áçϦ܋¡üÙÜÞ×áú¥Xô¢øpIÂÇÀ ¾ËFå*É òwŒöøŸrPÀ’N”S§¥#*Ÿ"¸<žª^Õ”e­3È{öåë¼Ï+¡ÙEi¯» o—¥’fŸ—¦¥› v¹r§Þ`—eí<ËEMPѹœÞ=пÔÿRw¨sjEE£áÂz™'p,Iƒp¦æhOê¼,kÔ¶_›°ú¯‚õ9­3c=Ð)1"r¹ºÉkâ=  ]Dß(†`) 22Q4+1"rEY3†ÙÂ/Y¬ø¸øåðM¿^À]Øê줜BÜÓeÒÖåv+õÚº»uK+8p+u¤ÈÔÆ dªaÏhV=VµB¢nJI_B–è YêI!ërC$'^r›ËqFnJjƒª¡ M)„²¬e aE¾½®¯ö^´ ɱL&4ÀÔ“õ-Ï_©·¾eY;뻞ìR4ÀË× —é&\nŸ'hÃM!Q£Ä wÉ8¬k“çʇ¦¬LYÖ#]”jcªüþÇ•K8"’¯ÆX÷¯[äSש<¿åKI >ÙeÁÌòœ(‹)y錑Áy¯Ðœ:ɹ Vp…Ok($s¢¬(kܶÇX@é—^¾|ˆS4Íš£jæ0PÕCxæ<ð-R˜$É©¢Â‰¦€«,ëN3ÐÿsÐhõÊÎkÚ̉µ³IÄh´r¡°ñg¡Ô$’a˜Ÿ¬dÞi¯¥gÒPHÌ°jS÷eY³oÑöoÁ„ˆ÷OÃ[‡Z€\í?ZÞƒK$j¨qyæ:K‘F)Á˜àq;¹àLúš¼×ô‰”eM>΂Â_{D?ÜMÔ«Žkâc ŸÜ_Žþà0ÊšÈ+²%(˜µ˜¥Ü€§hb½q,ZŸ¤%ÌnhW“C›µXQÖJÁÜ?>Çïç­¯!ŽïÕØ^BU–fâõ¨ØÍů Å–tiåi’õAZYÖ.H[Ï©,iË× Òø&HëÙÈòàÛú,ËZodÙ2çý;½uܶåÆË+|¹$(j!”díÎßfÔPñ®Þ?p+Íf+bÒIµ ô,”ÕTt.œ”ÖT†ÉTFȦ ¨,ëõ¼Ñ1Ù§Ÿ’uÊ]E—Y'Úœ*>Ñ3©Ó†F°Á—Xj¢S µM–Æ|YYÖ²¬¼M?^îÎç«ãÑÅšh3Xµy[¯ä·‡=ÿ€k†Áx7¤·Õ.+r§ûü¿•QÒ -‘5ø7X è½x˜ñ, jtð eíú%ØÜ÷ã#öbþjï\ì%jÑVÚh.}Ü=Z{î é‘>‰”ë`+?h° ãë@ÐàyŒ ð«"ÑkuÈuÛÞÕÐèxʲ&˜åîn*µ-ÓÎÚ'c˜ó¢ÞܹÙ$‘:UÉ~¹Ó îÈt$¥‘1¥À —w‰ÅÈHÔQ5¡eY—øÝ牚·ÒÄÏbškf§Ÿo®aÞ™ k@î¨Ã*OJ(G°ÝS Ši¬Ã:¯øe„õ-ÄÊ™Æe!VK¢qâ“I‰¨\³àªôV,sl@¢,òê÷ ÄeMáûC´Wú€ì€áýZ, *¾'þúW<úþáGÈ9ÿù›œ0ù·ÿü¯CigšM´³.z>* Ε£ÿ5J)# c6IÍ-‰.4q”˲֊¢&®Æ‰ß¸M ÛÖÛ²–z[bj³ñĬKÄo+gû«~N·á%o) Ÿ"@[£™Ìsˆ‚ÓBE“PxCƒ–×dáåÙe-Í{Etí ìªsðËúφÜ#ÛfzCæÂ4xÌSø]n©\~—e­Ãï¯UdÐÏ/¹ìèë¡xlðžžXC{Š1²@5$2+Ðm˜b”¥d-¼ET”µR?¹;ש]Ë}álŽ‚‹KßN„¿…XGŠ5 D3©¼ØȼÞÊßн÷_®¬þ)¶Þôk8=|Œ|¾à\åFüóûøkˆæó‡oidžgGÏ)'S›µü}O1CÏ”0HO7µž+H¹Ø)Ü~¡ÚŠ1Š²V{'×âä5ï©d°.RbÐR£4ÆÎ4EδÆ}5†ª7J£¨±ÎPU•¯5ÅÎeY‹Ø¹–nµ6—G°®.DÏb=÷d©¨&}Bêc AikdTrèûDMVd&ôe­sLÏŸ­÷ñ¹¾¼î=Ôºfë8?è@J‰5I:¦]ˆD‹û#­ÀÓÆceMƒ† )-ËšQO›b>ƒÞÖFÛe£Sž_¦®lßýI­úòÇ×(Ï;X2t†E¡ */k`étŽBk8ÉÚ÷.cÀ7ž ð.ÍQvÚ 9:§6¥´kMÝép?Äßãáü ÛŽR]<4’%CÉ—l¤*7al¬ê9óÐJ²¶z÷ùþëÓC<£ñUxç%í½’R„;m ¨×°=è$Î%ž jÆ=2¤³28žR+´²UÅ…£^–5úÉù÷<½(´7^yè‹Uõ üâ§|ÎݯÁ¹á³°÷ÿ{*Ê~ ˆŽNŒZÞÍ*é0TwžgæFÔÎQt­ƒ“Š6E³eYkœÿ‡«m«y-[°”R‘,ú/½L2ž_¾=¾;µÌzÓœç Z|§9Û/‰¥pF¨Ês1-ID·½ÉДe]¢A¹ûøÛ9ißɤZŠ¸þ¡Þ9Òà¹!PáƒMiä‰4wèë¦0š‹ÉŒ–šTeY;Ëœî­â¯,_?P#@­'@7Ý%™’w4&‰fX¡öèjò¤=žË–` ,kòê­yF«½_wCQúD¦æ<ˆZþLŽ) æ´2Rs4œŽ*´§T‰À½D/½‰[”5AV ©–éý•ëÙ_®Òg6M €õ\þò°“úË_–µ¾üïZ x‰³&7œµ¸jÎì˜è½¶yº€·ÁþÎèï “‚t*¸¸jÎìe-±§[;C^g>¸Gfuðÿw™ÕÁ|ƒê6Êbl£<€.ˆ"w£$B´Ÿš'ÌäÆÐD8,ËZ¹ßãÓCî r™û‚ˆŸÈæÞæIhKždê`L®%Ç€ÙÜ~šäÎuј¬dNÔÄÁS·€²¬e­m{—©7À~ñ¥žÖ¹Eê¡ýĪ€èk¹¦25Ûh%MàšæâYŒsž‚Å@µ)—Q”u˜P×æå5ZÃÔÖ¥Þðî])“Ûú9Ù0i#`©BË DÞ‘„G<¡[›RPeYÛà´8;èRè´òzè¦åÆ[è(jÔ:`Ê:L~ÀSAYBS‡jÞ Ç3Y3Õøù“É/ËZñ1Š]™O£Á?l}œ=ÑññÝŒì]Èõ(³ -å(S4e•Ñ&i&´–BHÏÑ+Ò¸ ü:K0FSeYsŽäù·û§sXoÃÈÞ¬5ÎWe,z n å?çp«©ôgbrzN…QA(©IJçw*3Œ¤Ð¬¦ zbr–e áSFík˜œgçùý_Î:ÿO%ºŸ5q,§Sl8=9Ïzüµ\ø¤9zõ.¸œâ§žV¥ç?EYÂ>m½^ý'ÐØl3at|Q¥(QJ¥½òZôÔ DP:Q×”?,˺Ø,áæ¶ÊÿÚ)SFÅÆÑ¡]%¶Q „E“œ@a4W<ÇÑ? :6ù§eY› PT/ö·zôJ¿};tnÍrϺˆÌ&xÔ$JGÅ“a&J–³´ÊyÃж™K²vÕAå2ÏËUE×:íŸNt~ãPÚÑÚ_KóÁ9+å¥ÃL)'ÕG• B+Ô!MY©¢¬=QrªÆjÝõõêë{ÿi3 p|¶˜û7>üÍu\ŸÆڮţ‘Üy(Ûg[j®[JÍç™qÑ[¦Ir: ï`!š<3KQ!ƒÃª©ô¿,k§Yêû—ì²óÓòUÌ|„;ºWUœn¢,Þâ“N³3•ƒ¤AšœSŠ‘q,w“ \²:jœY–5φ¶‘ó‚GQìFNRÅæ‘“øC"J)*Zyf ;Ü™†*ém…¥eY¯gJÑ?¼)ÓŠëß“YÂ0DØäX¡¥Ja*uçX9Þ{ yM¬¤„TiŽ¹ ´(kAj=Õ¶¤ ƽ[xÌ*dÖî5àɃ¿¬ )ÁƒIF§G¶¡c×Ö¤«,k]Ñÿ%úß>׶B~Mýn¥\?Âñž0¢Šáó¥éån+¥—ö6õÑ`¶CÓS ¡ ^ã' =¸<æDrše8Ñ´ÊÁŸÒ»eY˪†&’Õ[ò«L32õ¢b]^ªE©qNPH–DB¤ †£V§’WM<˜å¢¬r‰¿~¿ùÛ鎴RÆ׫+¯Uöƒþô7m[¢ÍÚj´« 'a,œüjý÷o}ãhy""âµcƒ5Deh"Q¢å£o‹*‹².9UÚùJ;¬‚VÞüÁiÙ[Ѻ8YϤÊ:t,cZJbˆ·”0Z+P‰€@OAZO«ªóG[–5©Ìs£ÄÒ¬Ÿµžò+Íwß–N£¦øm.¤Œ-£UDYÉk%ñ.» 0ò¨¢Oݶ‹²Çí´w$ý´­cO„ó’7N«ä?ïqø0\ãÀ¼4#Þ|k8ÌTx«š¢•²¬5ÜtxdÅô>´÷+?è©Z ¹=›³‘ÉD Í4þœ‚M” -pêSkeYsZ¬'³¶køôJjmkœe¦pž³l-8Ï1`}„·ˆßnêbp)£‹H¬gš€Sƒ‚Êð¯ )ßÀËe¼Dç»â·œ¦ ”eÍY¦»»ß«kí?üÞÿ©_˜"0ÓmpÏzÊJ –q‡öSJò܆!($—Àãíi2ÄeYãFØÐÒúßþ¹^ÿáðF¯b¾-ZÎúœ4džÃU’<ÄÀiL¹e…IÔJ Z7•d•eí­H]ƒö¢1šÚ´¿•Q’dÓ ZvÍ¥>)“ÊUS.híH"3®™çº©ÇNYÖjŸêïÊrÉ6\øôöõ& ˆ:vÚ¨”:'Ì3-'_¿ý;‹›V‹wûýV/“pôéí(M¶‹–Bä1ñA°è ªÊ»]ê킬Õæ ï×'<¤E¿v‡e­Ö¾ÇXyµ—ªºf‘ah*IO§ã’pÇÆX•lî»!šr¢eY[ÜIsšWþ (N°‰éðACLÕ‰á] 1Ļ’÷Éé„>±ŠZ€a†â Q8²jŠÓ"‡X’µú`jÉù¯Ž?ÿ<}j${ÿõˆÌ¶%@Kk³Vµ‚¡´JIÛ DB¿‘qªs|äeh"”e­•Ñ†úñª¥>ïý¡ÒÅš¯“tàwÊÓ<³‡P‹öVK<™Ò{ƒ^ŽÀ”j"–eåí9̦ž¦ã’_n™$|¹Óä®'•DÀ‰ð UNy" †;žfW±¦ps:³eY«ó5WÏŽñ¦Î½{Qg€Õ2=0—Òý÷ç1+0·ÕÉ¿á¡]¶ä¦Ë–ìAX©¦ ˜Ï#|˜¤!q½‚šsßÔ.¡,kíÄ{ô¶aŠÉÕ€`'ëÝÛîpÉ6éÙ@Й"\ÛD¥ŠÜz´ˆLÓä,A»a((&d Ú01Dʲ ‘’×Üöl¹ê@|ødÉtA)¢¹‹¹ø2z‡HtÊóbl3™eY—b¦‚Ó¼ò•Pë`NÛ–j²–RÍy¯•áãbwÂjê³KÇS;EIcñlQÖ>ÍÄO½…”3 œÃOcbÿÌ“÷/?ì‘Ý¢lc\èŠq…µÞF­ˆW†Ò€N³ãÙÛÐ6ó-BÛ¤”¢¬5¨ø‡}º¥jy»¾Ð5…ž¿ª³Ùèl|ÐQˆA åyFOä<)͈±–YéM€” «iÝ.QAÖR7T—K>n”øñ¥̬«ÿMua²…h¸TJP’¼"À‚rAã#´Ï(ËZØÂÚa^ëmQéæ~}ôÇ]2 W¯íGÃ…MtÇæ”3x¨á¨€4•º„â<ÝðŒAA©Ý}U´¥R­ú³GDœcZÖAfº*® <Ó€ÿN]SõÎy@U›j÷@ÞÞÜÝWÁmçqψÈüápæ¿Ýd?ì˜7%Þll¢rOWmÇÎA£ˆUçžÆ|Îh¯ÁUèEg_|iá ï•L#­“ûòÆÑG-ÞIU­y'ÕMBÛjë–†¡‹ÿ¦ëª(ì˜Ñ&v÷ÕŠ²­ªWéfÏ~§®z­ÆÔáÂ&!ºG™åšsÝ ¨®é&õLÍö5U ÜA'Ý}5<0)t·¿¾ÚC}9hÃúñvúNÔÎSÄ °{¦3PI˜ j3ÈB¦ªû ¨Zw©xf¯˜Æ‚Ýw÷UppQ¯s“³G« ן®°KG±¨ Z0õ•®áT J`CÓ ‡ßÕ¼@Ó¸ï ŠÇèî«j{¢hÉM\vø6»8HÊ]U`ì!µ¬–Û†£9XžBLK%¦®ÙŒØ&w5æáíî¾-;1 X­||?éõn-H·E‘?¾=?W‚„Þ`ôªr~~Uº 2&Ã,¼üL\I) ½BÏÏÉ[“¤€XÞ]ÃØØÚ«ç)†%_=û™GXõà )¿Àÿÿ½˜*š­à¹L Ñ/ ëÒtÄ b¿ÎyôÞiÞ)ûŽXêËÉO²l~yqq{{;fñç»ãäæ"ŒÿœÛ”Ïž‡³›Jšø/FE‹yt3Rè4[^èŸ!¶2vÆ|• Ã%9%¼ëÅìÿâ WϾy,ÿ\P{ØâÝ“e]v9†Š?†áýPËñ›¡jæ7D3MÓ ¦jéßÀ‚UÿFQw ĺ ¤`EùÆ£i/ÖÏ»ëþ#ý÷üÛW¿¾¼þßß^+¸êÊoþëí›—ÊèüââŸúË‹‹Wׯ”ýýú—·@úªrÐ(<‡N/.^¿)åîVïÚõ/‚ó¯çY©å˜e _C1àçÙ4J_´tC\ו­Å³`)ßÏàM‡gÏù_‹ðÓ‹ÑKÉίïæ|T°'`“üs&ÿ€^~PÈ^|¸þéÜ/r£“øñüe<›ƒtñ¦å~Þ¼~á®Ú 8x1º‘|*NJϽ’|BòÑ ³)¿*8ÕåR(~œ†)h ÊO —(¿ó€'ÿìù4ŒþÌyYF½tì§é¿¥ÙÝ”§γ‘(Z›ÏÀS? çYùÎô•WsþöÇ_ žÜÿHé^È;ý²»(KÀOë­Kðì³ÈŠ`©ù²æ¼åÊì,ž¤¼a±Å™"㜕l¦ <ú\¦„(HâÄH|èo¥ðYöƒ8¥ §HA™ØIóùtšÎ©F7/FêHüžÏ_=Sžgø’(b@<¼™d—ŠiÍ?ÿ€ÁMVÜÌ›ŸOy¨c“Ïä3Êyÿø“êDAøD.½¢¨òàbæ¡hTÇîŒY¼-;”r¿d A¼Èù§>b–…$—šGLAK~¶Hîë­˜±¿HàõÍJ*"šUèðEoïêùÅb*³XÕ*¾µ ¾µo‡DÎñ-´êƒ«›iìÑiµ—Ÿåµ>3*Ïç˜ëd9!¸ ~‹‡±M ©pS§RóK|:*xL˜|ô´@×}›0ƒR“Û404J|j‘ 0i@¼\©/, kêºÀnV|#Q¾0£åªä—ÓÅlF“;ä'Ž¾ ‘>ãøÆÂKñüŒR苵µ­t.¸Ó¨f¶Èk]Âû\ay9Ùo}*…ÎC={>¯™ŽnÙN]ý6€ÏrE^ Ǹ’õ"I%Bç+Ž*G‘ƒfš n›”' ì–X¦#÷^ŒÐ®hÅ37I¼˜(^Ú*bqÜg%ìN´+Á%, -ÂŒÏ.i@ƒ€9ØÁŒhXëÓ(±˜ë1•ræj9HËVo Õ[`â¨û‡7d‚\„þbñSˆ%´Ìr®-Foôð{µ‘gY¼†˜Kêöw= ­˜ÙH«cÏ•Š·cÝXVQÕZ5IàAߌ¢Ú^`3,hmùTu¸Iéòb,9δzzþSŽ¡EXzið ¼/šŽ*”RÆ÷ÚÕö 2},Ï«B©îž­ºŒ8ÔR1Uþ˜V»Úæ ~±ák÷"Eü6‹L| ÞÕFtËÑÂu¬dZ¶åP®¹ÇµÈÝж`^–XäS™uе^?€Y¸q ³16ˤŽÊbs¦YT3 ßTM?àŽ]®‡/;.D;¨hèÊnCEN`SSó-ÝlWS=ÙÅvnûÜõô㢢nh×RõA)N?ʃ1Jç}!TÕz$Q ]ûmèÌuL×ÆxSÛ‚±ˆM,ÃÅø/OÇÊû¾u\tÖ í::û‚Hª›€†.ê6pJl¦ÛÌ¡¦aÚDó|ÝÖ]Æ÷LÜuCÛ²¦B?=4טßJ©1)Æ=k<ðˆxš©qæ–ω¦¶8¤bø*ïƒûQ•:qÐF;yô•rï^o—â1ûÛ¬´g›¶ã¦®j–ILæ¨>1}&–@$›Y¤l¥»qЄ¦±Ð∼Ž…ŠìmÖÐ=ݶ8xºgšjÃH&¡¶FŸÂÂvã  Íª:›rÒ½¢C±¼ÍŠ2 ×ò™jz*c®¦3]eŽÎlCÔª?&ÑÛ m÷E%åäÁ¥íPdoå' 4S^ÐätÂ8õ‚$;7<ŸiÄáOáUíÆAš(fäb:'ð5[s\Õæ¸oºªÁLТH`µz¤¤”¶ÛÐ¥ÛŠ£CŽëÚj`ššfr˜^a®¥y®í=2éÆAšeùÇ#`+C×pzÑDÙ4Us-—èÊé9,˜jûžg¹O‚^ºqÐB/"jyÿCökTjÝÔ8”B¶Û q Z‘e9Ìã'ÕS9µ{ZǶõÕ mïyåý½Í÷G@5CWrªQ]@´L<åØ °Ênê.ç¾j3U‹jº¡mÁû"ìŸlp'{¯„ƒºX7é ]έ<•ºª«Ü¡®n–f€yfªh{H»šn²§ þºqÐMÆÿ:ij5ü˜±|ÕÑtƒþfwÌ:ìÆAË]8…wöèHgèrnåXטªR ¾Yp'jÚf€þ0Ͳ=g#ÒIÃóû3Ýð¶ùÀÑ\àýŸâ{«µe†«î{`zŽçx¨­å{\3)Õøf[±û o넶‰ù›F-ؽÈßW„þêÉâj•.‰yVjÃ÷E¹ØÒ%@öq" \ÒÞä³Ìl\“5Td)¯b• òšqMäjåMhäOp,Q¢‡ksŽÊ¹T9éŽWçIœÅ«D¼zj”ÌüÌïâýdõC&“ÖŸmV•)¶=ŠäÏró«“–‹EŸ‚³ïSf*ß—Öì8ò’|v5%Ï/àÏYm>r½»1%zû“ß®ÚðñÐèŒ M £­YBZçº)ÍåžW3ˆkT.ê£aa;aù;x™§ ¯$ÜKºLlJ¡™È3Äìd‘_Èk÷ç1Z_"7yJÆÊ»X‰ø­¼…©ß ÇÞÚH©‚éè©è-»a‰6éXy#GgíÕÆ‚.Þ}xû¶È+}™Éý ¬<>Vdþ#›VsYvõ[ùL— .1™/^æÅóÏŠ­ ¥ý_Å÷ÿu9V"|‡ò5ýMà+)o™æX)1Ô®‘ïU[Žz}ŽJc-ÉJd­2A^S™ºªcƒ$ëÇ×÷»õª6¦¦Ž®àCp #ŒîÙ¼‘e‹}ŒÅÊVs„׉Ñ%'>öÈè×Äü§ẊEf<|YRøzNº[*‘¸b¡×UÆæ-Â)rQñ¢e‹$BŽúׂ¦áùhBL­žß”,—As晈‹§øbЖeËF3ŠgyÉ‚ Pá§Ï¥éêhªp»œ«Ô—øʼÊѪ,û–+·4|'Ùß”&‘×3É‘)'ó»Dìr&?ÖAÓ©®]d…Qm Ú Ÿ3Lkt»æsó«eUôÏuëc ‚º¼äSaÆÞçovÕæù¸¼Œø玾šUn«Þ—ŽFÝéÒQ†©B›[c …=<ö' åNK«ØZD_ŠÔz8›Q qƒ-ìD|seEA|—°¶š(á{f%Š£st}¥,ц¡ww­1«üHXz8ßöùì…E^W†Â°ë{ðÖ`¡»eŠ¶a®àãh˜b‡ x¯m0˜Çnok­°¾„ÉpûˆÜ×]kå Æ0[÷‹K5¢ºúlaz÷Êca:§™?Ù̪#Å «Ë8"Êz„<ÝŽ\5zœ¢lø®ÜD”ZxaV r8K9GkAÈ`EãMôbRÿÏÚu ã9O‚8™I!XŒÏq\¨°‘P}qÏÛŸ)á˜Å6ÏæSkS(á.Ѷ\¤ö¼×pOŠÙ•s&êý£(¼´Icáéí–<±ýà‚«ÅIÖîsøþá«Gþñq,˜éWvµ5»B,î‘Wa÷+Fu2‡ŸøPÁÃà÷Þä\û=­s²/€Y½{ñ‹ˇæ ÿÆ‹´˜x¡wK”ž•<ý%›ƒžÎOµŒÅ| ¯E‹—Am­¸†Òl³Ól/ÃUç››«èBR¬Õ †sç¥i;/f[qgY!k(EZýê{oºt¥÷]КHE˜fKÿºð]¬Q¨PÉÈNdu½yœ¦¡Zqš1`ü§óI Íñ% âßJ&¡Ð,ĨˆbcCðkO·“8­ ¡Lpo"V¼uãìK¸C]ÁÇ‘Õi.¢ ý|º;CùùôW%z{%z±WzQQ¡áç4Äý+¹ õSÓžq§µPœi€=8–‡Ò’1F>Ž„‘uïÅ ÀéP‘«Üz»“y‘N†sÙ©ÁÇe‹3¼[Ò¶“Í~myʱ-’0×éØË×dÁsw„ˆ[©ìJmU8//gJ@§ kÆ躸 S>þÌ2d§– ž—á(Ô*'¹¡sŽx==SÔ–wºEka:‚µût„Ǧ{¯`koèuOx£6s$5÷$-£iÚÒ¯@Óî\ç'h*#¿a\øwRW+ô‚[V’xÔ’3'£® %Zɳ‰|)r†ŠYú%ûfe —ÖMø‰G¢¦ÁXÂhÎýÄ6^Q~}ÿö#ž{üñÇ—/_¿¯H¸ÐŠ¼Sþ eV¢ŒâPNQÐñ6׆e·‰Â3|8ßWŸÈ¨ùÝ…œÂa-É©"û±Œù”XÛKÔisaeFÆUÅÑôn5»ü¡ò:î4¢ Sàã)Šëþ¢ÚÑêÕÒÂ4on ïÖÜÞv‹ËixYëP——Eñží•’ÎÈ«!zI#ŽÎe*i¾,ýáàSÃuv'Þ”®O‘¥&\Ð]œÜ)Aœ¬ÙäYæÊ—ZÖdišÅ t”ï´?lHpßœPÄÄš‚ ÁÇS”"ƒŒ>bëõÈ«§Þ>x 3®kçÙtkjN½Ã&.{etì9:9R­ªô…I”¶H‡ïV*M=Ú), c=Ú,ëx=Ú,ËŽ=ÎUÒ¹ƒ¦Æ];5gp9‰7%ÌÊ©¸gB?›ÑÏál1Ãb{ ž6öªKÃœT‹ÓU˜ z[N[3¬ÎÆçŠp©G÷š3ŸûTV'T=ö™Ô6<¥þWçTë‚ Ä]ôžÒ¬% {#áÚDÍ…³ÍʼnðÈ‚ö’Æ3¾<‰¬p†èïMy&Š Òhu_úd¡YÕ+9ã4ʸ¥0žDÙ3Á0ª/}ÙúT«ÛI~¼@); žt1utéßL¸(!y‚!µÐAY†²ÖdB?•¢ÊS>£ >ùé©È¶*Õ"à?Ç*(°Ðô+¡ ï),ÕLèwçj¹búÇNX.­sØ4 ð} …zÀŤßy9Ô ‹g4ŒÎò Ëñx\¯Ópß@k9d>ö낤VÕÛäc%'܆Õ¹ØúѤ7{ëÁZÜ»-ƒ­žÚKÈæ’¤—,£DÜéPö¾ò)0>¾Ú]^CÓhiVÙûÎ2+\½¡Üß7R¯“4tO·-ÎTÏ <ݳ Mµ‰ÎM˜¡¶FŸNŽ…¬.¿™Ñƒ{è€ÄäuÚCˆ(·_ó`Dá†è’(ÞÐR±µ„+F‹@qƺ˜fË]µkÜû ³Rþ@-Tp)Fo ÛÁ%“Qs™Í³»ºøDðrPó“„êÀî’GŠs ô#ª•üÈÊ‚î8"]o­Ø‰•c7<†¢ÁØ%Á”” mš­âñvÔuþÃÞ³6·mkÙÏù¬î—¤Ûðá›dænÒöv'íÍ´éìÝOlµ²¨Š’ïÎþ÷Åøõ %J¢i¦Š+’ÀÁ9àyá<Ä ¥ŒO0âùÇö;(§ŠìÃ9CýXaûí Šl‡6á”ÙIJ|æùÞ°[ùe¦Ç‰A׸[ÅðóFEK9»~´ÂÔs晦XLþ‚¾H+Zý´PT¾MAÀ¦·sS%.kðf Ä%)“? Í5­\«ÂسL® K iœY¢€¶ý÷Xlѧ‰¹ÓÊNÓ¦zN–Avã ãÂÿÀ>Õ×qŠƒô¦¡P£ÃvÇvlá³À!ÄÅD)ÎÔök–¦Ø¡Ç­9—3ݧOöZÍtR)fú•T[Úc­Ò-Ú”ê]e«HSve¹ó¢Ï PúU·œ]WF¢=råìÛ®hŽÔ²Ô†ænm„GàÓÀ <× 0òKb:wIÔËìQÓTàªu> ^c}¡ˆ{! e¾Ò‘:s¦$¢6¤È¬/XU²ô£§{øW~£VWŠ³ÙÓE›‚±…ã®A$X&ÿ5ãß"Ð?tì“–¦é¤l¼(³ŒU"†2MN€ÓÀ¬AröDÖARBWfM@Iߎ–èèsE@µÔa°é¢x4¿WˆÐw(âLwR_=)=©:­h굊д_ÐîÚƒ—¹yo¶ìûãKQ¹N$•:b‡˜{’y„áE"[dk­:²´ÑÓYG9ë(ýÒQN,ÔŠq~#ÙŸÈž…ŽµœM4W¼ò¦Ýj^¿½?}@2Å+ë~•N­õ¬Êü @ßZÕƒ±çªÛQÔ¶¯AeÛ~Þ껞¡ çªÙÐ5q¢ê~ŽèHÊa‡±FËŠš-h…××ãð&¥fûÁ‚%ƒUBðÚè-p?n©Ó¢w[éæÍÏ‘°»xˆŸŠ……Π=*V‡ýZ¡e0·êî!‰ÂÀñ9r\ßñ‘pÇ“Ôõ\Ÿ ôXËÓé¬ÕŸµú~iõ'¯ë×êèZpÝÿxVƒÏjp¯<—Ú±§¾N]9=¾ÒÖ®b%&‹ ]ÖÚ|Ï=é׎²Ù!2D 1Å‚x̘xùŠBŒ Üö+U·ðß)tECH{:u5E“=×H^ò…Ypeðª^ñå¡RU}$Žµ:’i#ñI[\’¼PÉ™;PíåÖ§œŸóòmJH vß™4.m¤ÒTñ ¬‰XÞ%V¶^}ºÐ=u¦jžÞ {¢ã”È P_gm`ÇxÛ6>§¶ÊRÆz!í9õš©Ch>ˆŒßt¨U8ÞÒÃÙ¦àÖu BqM§Ø.E †<îxÜgLÙÇÔC8ŒÏ „‹¤ˆúé:ÇõÉûsÊêÄúp«sœÕ|{ò8ìËò×6ê«'1K Ö6âÀ|$9r)”½ô¥räP% Dd{Œ »—â`žÜ=»|“³ŒÑ®õ˜Ÿz{=½;÷˜ÈÃ?çLž†ëÆšÐz7¥ üšÍ£“*Afó|`#aJn­ÞœÙóF¯üÚr–ø‰ÉÌ8©fošî±Lâ1OJ,'½(ÆÃi<Ö6›õ–‹ ž:¼½P3í GúZñhÅ‚àÀ€–%Þg.¸D7Rêÿc”Ĺ´øßýá0óÝ:éÀ £¾z¢¸o®#²ÚV÷_Qä—üWP7>§ö¶±Lîb,SÉ÷Û2›À2rƒ ¤È• ¸› y e€IØG£"Q(Ôm‰{iXœd¤Î×Ù^;ßH«m€Ôɤ¨û]”ó\Òe)ãñk ±«reÝ”¢£iÿ¥%=¬× ^ë†Ý¼öî•A•U_½Ñ¬ûRép›¨×ª0/з™[5±..Ôïð‹2ž¦ÊÞŠc°'ð·¾t7Í 1—WŠ¹r>…fðÕ ïÞ$p ôîÅb F1”z[?«ÿþs>²°gaQ 9׼¦.y—»a•%’ò–®øn6›\_]=>>^òøËÓ­_ÆÓ۫ᘋ/)­_¼Þß.a%Óèí {b2¾Xl4ËQпÐû ]ú—®úÓ€¬~2K‚«aÌŸà_˜äÝ‹oΟ¯åWâDþŠé7ÿòžÓNç°1ÿ"Úå͇Øß L)%ˆÚ®óˆk£o,»S(V|æÀ,ë›%³x>Zyߦë'úa¾K¹”¡p)‹ÂQ`ߣÌu<Ïбá;öû©½ÿØÓ’¦Ë9Ö¿ÿ.µ.½ÿX½ÿÔöìóûˆÏ›o?üëýçÿþô½T·>ýþzo .®®þËyuõáóëßÿüüóG¥<ØÖç)'ZÅe£««ïXe•åÑÑÚÊç_¯¾ÀXNÿ¼˜•ž¼ä3ŠŒžðËýhœ¼]2 ‚À<­ï ”meF(]IÝ{¡foïJwñL¾LÁ{;˜)åÒ<ü÷èŽM•Aðö÷Ï?\øZª òï‹ßÿqñ>¾Ÿ(}R)÷¥q~úþmP<fÂÛÁ­ÑôÀÝß÷ÁhZFÃÒ̆3e&dºÞµ ÖedéSì\%WÖ„¾íÅe.ü™*ÊÀH.£$€QóvÌžF"¹b6ÐIº8¸æI¢é¼yÅ•?Ø3¿¦ŠáÍÅôéò0Ǯ̕fò§qê”KŸ.Á›é@¶´.šR3U:Á¶ÇÍ,ž Œ¢ž¶x˜ŠûXw\Pö«ºéuêEŒFº!ƒRŸÓ©¿5Z{>à”Mƒ“Z™b4‚²ÏÃñíÛ=Ðÿ?QêoúÿÊœ{33Ѐ}hé¨M)†·w³k‹º“/£•gÓÇ/FBª[ìK*îÍ=Vˆ²•ÿPø3Öe¶àŽTíW+7êL’Á;û2¸´²Õe3 ±d¬Ì™’£êŸLm¯8 Œi#”Ux®6p¡°T+WßS‚̦ñ#dæìÌÌDŸJ¿‚EW8ÉFÃw¹ES6]ôzßý̆c³þOìV¤«óäÍ•zpÙ:ÑB7.« ôKþs“AØXí(XueŒlÆ 0¿e5kFËVͧêõ ŠÑÁ\¯B/úò¡Þ\ÍG©ÿ ¥j߸‚oÜáË!1kü¨½'›qu;ŠC6ªŽò£ù­ÉŠÊë¹P<õ._úAÿ¿¾ž)!U]ƒ¤ånL>œÞ„X:Nä!N£Âc’`†"æ"))“(LÁ5î‚À ºº7 "æ|#Ѽ0ƒœ*ÙÑÄüþžMŸÚål ú8Ô.î¼±ê¥ø!u¯é¤åEÚV×ÜiÁÑœþ¶BFÀPró˜áWù8ÆûSì­ÚUýF?Æù ´þYÉ3.̹2x —“‚‘æ>Hµn.¢Q¢™ì´¼FÅÆÅÓ¿ÀÙæÎî¹ÆóI†é7™X­âS{èKH½ÃïJ~¸Ò„©çþš1Á‰`Ô•¡M8–̳iˆ‘/@xáà]Õÿ“zê£âÝà+Þ* §ÀìP£_ÿ¯–Fà­/ù‚ë#üZ}(Œg³xÅ.)×k-¸¸`C˜Þyz[½4Ÿ&ÊoåYrWJ_R—Gu„í ‰Y ‰ë éÚŒú²4…þ| …–nùj9Â.S¥þ´GùoÙ£ƒÊÖ(#x5y=.lN1™ãñÈu]L\¸’QƤÄ=#ïFhsÜ’º HÚÍ»Tw®ZcçH|`ßq‰í¸B0Ò/’n†¶@8Cö‡¦mñ¼ M]橉íDDÀíÉHr̤2ó£ÀîM7C[¥iVû¢?´m‹ï]hë‘Ðv„ð#OÚÂm)œ ÄØ>¦Òál+Ú‚y^‰å鎺›áÍQž”^Ùc‘²-zw!¥`‘zR¨%ŒÆ}*e …K)…¿);GÜ^vÅ楻"‹ ²^šmúNrÜLʶè݉ãFŽã‡Ø~`SÏ q¤Ä´Z¯ëHâQ[étæÖJJµuåÁ‚d8ˆ(‹È™Ç.q«U dé%‹Å.©²Ø:¤\a›£©ûÂa‡g_X¤Ã‰×ÑI§i» ×zñø0™ŒØSÒ…ãêï0%‰žÒúlŠ¹ñÌE5s%0gŠ9ðº|ópæ\è©!Õ.=q6 ÖK“ÇcÆSnÞc<ýÓzÎîŒÙX°4°üòƒÄžu'ï;Ü‚ôMIAø%ï/f²ÕŒ ˆtVE¹×Z ÓUœ@û8æ¢}‡A³_—âbû ŠËÇêöš‹öWN6UïÛ³ö“/7Ó~¶ô#7Úé_ ÌnUVÛ)U)² `WIÄh*”™˜J¥ìæBuFAð”­°âžrËpÙV£Ø‰åó¿¬OÙ±÷ Þ1çÀ ryÈF5€h vAË,§ä?j5*gÈR›1VžWu®Ñ‚ eœ$•~}-`¡t1ݤ &µz¬º|t•Ã”WÖVìÔ'pü ƒª¯\H6A‰ãÛ¡z‘ž¶8>ÜœjÑ?¶ßAü£!Ï)°ûÒU¼>s aêÔšê:÷ ÞߺéZùUbÌ’tKADñú«* | …_–ôÆ‹¼’zÖ-%EyTè†s?™=¥š?@•B¨+‹Æ5»š?©¯^kÖë¸S;íº_^'2n{•¸[oÕgsÖv_Üçi}pžœWm±ÚbãV¶C;»½z2GÐàúêµ\ÜwôyÝÛ„\·êmjÞ:¼6ANu¬dø?[d5¨IÑ+É•Uõ8K°³ÛB‚åÛçh’ì·÷ñ§ÀY‚ óT_gAvLAÖÔÞ¬7ÃÆ~ž¥•7î0‚ö³AéŸãIL(}óµàë<Ç×µ‘ÉM4pû¥ñn ^·o ø²Ž=ï“xXÎ¥‹U>Þ £»mytkç_ŠDÀ>SœN¥ÊÔáålÛ=éSõu MÙy+ ã …a‹˜z<’µ5Òð& ±Y/CY8¤O¶lØÝ ²Ù³<®IvíYšk+ªtÁ¹ƒÊªµÝJá"Á,0k9ï QÅ÷“ÑSéh…$Z(UQ9ÖQ“.2ZÙ<É]<A¿-e¥œ»àÐU¸S9¢×öRÁ—æ8™6qP)?eîš_ƒQÂ"h’ªÓ§Šyóº Ëz3Ǧ½E&}+Ö÷ pŽÅ$ 75U³Ó~Κ9õ2’>Ý%©]Y¦1ð ‚~¨Pº¸K.­ßW Ì áP¡f§¦žÆÂ^ž-£Ãó=8R__µŒï&,c‰¦à,h /l’ÌGjßµ û £m  È‚æ±]Û]”5ñÕJŒq³µ£ÌËű`'÷R}Á6ZP_6©ö§é£núxþô÷´¯ô#‡îÿæQêÐ…þÙî¹ÿÛ!>çþo‡éÿ6ŠãɹÿÛ¹ÿÛ¹ÿÛ¹ÿÛ¹ÿÛ ëPýßÚÌ l_) Â!‘Äï*mDž´Ià‡H] é Š—‰q’5{;¹.s+$Qg]æÈsî2 ׎¸+lA|±Ã€†v@ÂЦ’ÀCÕ1}”n $+²½Z0ªaC´í2G2—zàÏFêÕTãû¾pD€#¨ê‰d€=쇥)Ìððg«.smQ¾SUvG£Lx!q¸#›žïcô£%YNÞÍÐæ¸?$uho‰æZÙŠƒ _MÙ„;ÊÍ)HÈCwË7¶û®U9Q7Û£¼Iת}“²-zw#%"Ä‹@HSú$ˆB5mHL(í¶g¶ˆÛӮشôbWlݵª%zw!e€m„lÊ™‡#ɸ«Ð‹Aó¢6a\ÊnÛåô‹”›—žÑ®kU[œîÖÙ&‘ÒÂIä`_ aŸúA€¨úƒ{¾>\ê“ Ü mŽòÍ]«öÍQÛ¢v2r‡á(D<Ä#JÇl; Ôö;aðŒ_ÃÍKÏÐ9…7;Wí{c´%ÖNü9ä®ÚyÒ BRpì¹,BÌo¹ásµ›—^ÝÇÝm µÓG%²]Å£˜'m×wß B[1+$ØvÜ¢ãvfÏßlŽo]ÒbŸï7[ÓÒl‡Q›´4kI²]¶‡EÒ¡¾dJíççâJê¡ÈÇ@,ô{µ=6[ÝÏok´%×.[ÃñÏÁ{Ìæ>cnhGŒˆ à ›ªÅ=ÓnwùnÛ¼þÂ׶Û][ÜîBGê±È%Q€C鹑2bÔ÷¼úLD<ÚNìMíß mŽuÆù>åø>ÞñïF œ§m ¶Ë戔™IBLߘpFŒx‚ â;÷Šÿo¶Ðòâù½l ˆØ±ÇìgÙ`Ãõ ù;{ç÷‘ÆÖ…5Ó(7žìmöø|­5N¯ªp¾ÿVVÕâ:Ïî+ÍZ’°Gú=IEk?•ªii `XMÒ]•\½ýëói´TñfRN÷”äMjË’¼iÃ$ïÅssBß:ÊŸÔ‚ó‘m¯×õõX|™µMøjà_è_Â×ö̧êÚyâá™c%”­âhÛ·'ÎùG>Ób—âä²9ÍŽ´¤ÑH™V¹“FÝaÒ •Šš:¿Ü%á©Î ‰­tOõÕKV¸¡Ðj=­Å³— lYfµ.6–»Úçé68+x¾lûæ̺·aÝ7{aß5ªº ꮄwPÛ!nøj5O?–Þ V¾o®¹žslmÖ‚2 Wä¤=ˆõY”ËÆ¡åq eµýnEš„7Éì~¶!éu ^qYš4Ë.]Œ_f2>°™¸y`MúW,Î+ »ò­Šõ®Pªl§½pkà;žpËZ®ÃÓE£Ã "@ØÊ渊Íón8y«Ú´âÂA]!]»Aº‘¿¬EN§"BÞ¿úê¥Vß"n£ÅàFê©ÿ~IRl]v§AÀt_¼êçÖ€=°Nξ¶ÁÞÚúx©ñP®§#§šPí‡Q©”j˜çÕRM)¡ƒ4[´tꦞò@t䨒ڬ3nWòeIÇ¡ZŽT{æÝ Ð¦'ꪖs'­®2t– Ÿ¦ 0»oué¹Ô˜ÎK4>Ùclب·¦š´Î3U¨€2o¦4Äã0¯^[’ašžÂ/—Ögx8ÎL®Æ—JZM.ÞBæÄ5S§Sg‹Fk‚ÃHXJH0S)N|aÑ,m·šÞ<Ž¡C«Z‹ö±?Å8•M‘1Ã…juýJð&UdÒTY9²;;°YKÓ(+'VX]5O7f:3¤éÇðúmc—·L§Xê«—T'­X8zKog*Ç]´¹zy¶Ò ¦ºOòüäOCÎ2ýÄeúÚƒ¥µr½8áo+ÜËs$ Г!tO_>tRˆ-ÝËÒ›M§ìIW€"DRñž×Ö]ü(„i";„®ëC9„Áõ!—¾ó~®¤eøÿì]{sI’¿¿çSÔÚq¶K]Õï™±c±„m.dÉh<ã m?mÆ´€Ö¡;Ý|ö«GM7tf5 É^aƒPƒª³ª²ò—••Å÷Ó—Žv ìënö ¡»Ä2þòpb¶Ñ‰ÙW}ÖµÖ†¬WL Œ¾/–_:ýU+·îv!Gl0Š'… ·Yyݬ°nA˜Þ?`=§‰/ü0”…uEŸoÉÀhŠz‚&²žà%ôÆ’U ÷uKÕmmãy¥î‹dí?ªÝT¸ËQXƒÃÑ-Ò«}»Æ~åq`ÜŸ\‚ëÉú@ô p8ú\«²S.âÙÛÕPl§\ô Ú÷I{Ê¿ ®„1WämƳ€8•ÉŽßV&´mª$oçËhüYU— YîÚ=q\ÿªO 7¸¡Z!ÙÎ3*«,ï"ïuÖÍþðcCª]²v‹P5nIM‘'þk)ßÚ>òßLi’§éKÎõLô[S¾I îa|ÂF‰%HyÜê©t‘·´G]»£qÂ?ÅÙ—b;ÇÉär4Œs%Á¤hŸ'R^ +èOK ˆòŽ_}w!³Ë7ÜòQžàWþr«Bº\Ї²"ß!=Êñ^ÚZç‚ë](5wéKöý6Ö:ñìÜU_ÃTW3;Ÿ¾dE=$4X”ÉôJìc2=“4¸LÏÇÉÇ>__×úB‘ ò ý̓Ò·| Â>£tmV‚Ì©Ì’™1RjË3“äÊý˜àìI"œÑ§"á{"Éäž(c)‘½å*™Hš¡(ò±¦(dÞ*ïZ(òr’9/M¯K6IA^F*']|µHìV¬„tá/jþƒš¿š_¬…ÝUzþÖ¡ UxÎ3~wØ!òlï‘®?…é O6f; ÈÊÓ>Q¨ÄOgQQk ßbÅÝÛóÈ×FÉy5gé ;+O<2iǼ…Øc©2Ó»4{€F=ÏÏu”ëÐZ³"»²í$HQ%—+yßv ôÖ,iˆª ßä¦Jê›`lVC³è· ²§ëý'ƒU©âÒñèb}Ñèârp³¿­A¾B~¥Ý¿iQÎ/*À_Î@QÄ9\­©óž¡îRÍøRg¢O\0ËL Y]ø±*ö•aÿ…ˆÃ¸N/_äàz©ŸÙaÚˆã—ðK,9ï³5ƒ¦áËʪô;@} ¿ÉJ2¶ör«À_ÀþÞ}¨n{|;•Õëµòh±!µbÔ‚ú±¨i9«þ¸¨)+jhóÍ›¬LŸ+7ûižÍ8+ZÀ5U¾ðÁ‹ŸU}úïÕi¹yËŸÿu5 Ì%Ì 6¡æ–ó£íKkãÂxÇ3Ÿ•¡ÌU“žU'%¥óÅh¿û¹ñ±@DVõ8û‹ËáG‘™z:¿"ë- Á$‹åò·Šd~IuI|:+È+nòâ»».îxB—ê¿›K¼²•{ðV××çëšn®þ;ûƒ:–í>Ô¿ÇCý÷Û©ÿÎ ²a?"]U÷•ò¹z¨ÿþPÿý¡þ»€Õ‡úïõßÿ­ë¿ƒ•ÛçR¿ZûÏùJí¦›õhQ¢=ÎúXQ¤=×j:>^¨e»*vaõÖÅ>ÆÈ甼Ë}o8zôBð͸jfŠ[pQE£ h”-5*Ù4ÿÕÌ’ôèÅÁÞÏ6}ìíÍ׊v Ý\•tËe»·GV?曣ã~8Æ×k¾&›Ð£Ýh·ð´ßú¸Ûíö¦ã¾  …o;ãî´;÷xÜ]€vw£q%ÃØEi7ÜÊø¶ÒØʸ{íÞ=w ÝGЮuGjTß‘[¿#.”bægo›=ú£ E?Yì4»¹Ä| v&Òdv9\Jâq0àx?È@ži0øÌ~LdJ+Á§zôXFQXv‡ãàEá™KóóóFã¼!_óÏFñúyþZI@éÑ`Eaš¤ÿ@>ùëÁò³t}þ›x½iº I?€k…k{µÉÿ>lB?€m…mœþ›¿þúëæ/õš®ºž{=8ç½ø°ý¾Q¾ úÉkrsxCÞñwÏùó˜È÷Ïåo‡êZö|>{=$7õK3 I?€qƒqŠþ¹ÜQFgŸƒ­ÁjúE?<.t@~ &à ¦¢¿)édtNùójFëp5ý¢¯7²9Ò¤À_†Ã_¢¸e¸ ¢ú h—èçÿÈ‚~Rè€&ýþ2$þr:ÞHj®u’}Ï%_‘ìúœ~µbÄû$ßMúüe8üô´ç”Íè'9ZIîY|]ê€&ýþ2,þÞ^‰N,ýKФÀ_†ÅßÒªO¾šôøË°ø{Ã_nöäkþ¹·âúÒµÅ5öfФÀ_†Æ_rJn.ßù³ËŸ¹ÝKróLÉú>†äf|CùÊ×úÁLì( Ó§À_†Åßï›þO|¨~.ÿ¶î§ÎßTü¶À¾ìòüªæXXΰX¾µ‡ý&€å&ËG—×ÊîÉáS®9ö¥czMÞãþäY÷*æ{[¹ÃkŸtÚÍ­Ð`¹‰Åò»ËM$–?1Ÿñ«W“„¼ì‘A?J†“äé-Ð`¹‰ÄòN‹Í~x5W‹Îô‡DŽy)ì•KìbÒÈr”ŒåÏÑÕ´ý–›H,¿Åý´É3ˆ†Làx™Œ/úSqfy9ý« ?ÉOY5ät4Œ¾d¡ q_%ü¬G?€å&ËÅÉôÇÙ_—~ËMô^z[Mú,7‘XN÷ K@æmÏx?ʼnJÏ:ND`‹Š+ …£A4—»ÃÑ”¯ú†.ý–›X,'™»uV0*Ç×bá.3=ï'o¢‘Œ÷7M$þ²òøóqÎÉ›ÙøóÅ_EÉÊ)¨A¿௅ÝK“9Ô™‡™Ÿ»>ýþZxü]>ÇåÔpÙ®ª\ÓdÜ“…,•Â_ÿæ&m_Ÿ~-$þš*²@4<ÏÂ|ÅaIÐ~-=ƒDz®‰r–O†ñh,’?E.FS‘±I°Õt¢M?€¿v/ÍÇŸñ¿82 C2Ñd”N¿Yh¹@ØÉe ˜A|xÇà† ê&*I‰.ýþZx[öÈ À_ ‰¿½7í.éž¾ê½ovZ„¿×9ý¥}Ô:"/ã¶Hó¬÷æ´Cþñf—,w+jËÒ<9âÏßHë×wV·Kø—êôÀa ‰Ãí·ïŽÛœjÞNó¤×nu\Ù?<>;jŸ¼n—g=rrÚ#Çí·íÿZï´!{Wþ3]ú¶8|úŠ¼mußp"š/ÛÇíÞor€_µ{'bp_ñÑm’wÍN¯}xvÜìwgw§]>=|ÖŽÚÝÃãfûm먆pØBâpû„/iýÒ:é‘î›æñqžy^¶øÀ7_·T?8Óµ;­Ãž˜¢Ù»ºëÀa ‰ÃœW8×óÁ?nî»Öa[¼iýÚâüÑìüÖÜ}xzÒmý÷ÿÿ5ß6_svyRà2Múm‡m$™›/ãóNë­˜Î[ݳ—Ý^»wÖk‘ק§Grµv[_Ú‡­îOäøT¬ßWä¬ÛÒÕãl‡m$5{M9ÊœpÎôœ(Á7gݶdÿöI¯Õ霽ëµOOž’7§ï9£ñ ir‚ä:9=‘l¥Ï?6€Ã6‡9·Ÿv~ƒ(8].àyÿ¦Å¯wÄâàÌÓë4£w{öa/ÿ5ÞÓÞi§W‹ÿm‡m$/ؘœ´^·_·N[‚²Sу÷ínë)—5í®øB[ öû&ïï™d/±Öù\ˆ·ºô8l#qx ÇR‘ö+Ò<ú¥-x$£‘‹Ìn;¯rU¾Éò~Mùc8lãÏ”ïD°üµ‘ø[t¢kÈ"¾ÊŸŽkžÁ°y5àêôâ›3o ±?õìkÑà¯ÄßE‰“}ò>S/Ãë:f Múüµ‘ø{˜Äc®¿T‘7’ïÓŸÔåýìò߯ž]N®âýtüýÇéOrà·Ô …m$ ®ú“g'£d@Þ®¢OÉTöbqyÿR]þ{È÷e³Žl©€Å~O¼¥‡&ý;·ïßu ×ŒãÒ©@ÈKiw‰’Éd4~ôâq–ÓZòädsù¶ÿI0 ^'Äs*¯šžþ¨9€9VIŽ ®CHN UЉàª:äøâ¸uXúN…Яèã"VCn—‚šý,za4\Ñx4Ùÿ$s]i é I_‹t×Ê‘.ÏkîÂÝ­îµg^ŽpéÞ^“p@ª»R½áfžð^ú5»Èv·ŽlwÙîšu´‹Ù’ìý°EÕi@¢»›nIæ^Ó³ò‹¤4ÛPc\\Ü–d›=5Æ0íƒ.€®W£Q¯Jš/$„ü˲„xØ,´Ëc4òìÄó­„ïg‚Ôô©»N"ü­9ež¯bÿÖÍÙçäúËh«LS¢˜OöUR!¢ÜŒÏd,á÷ŽøÃJ¼ÐõÞ Ëñ+Ž;Q‰;2É¥òY bž¨"?DU:YÃ]ˆÂy+*¹V"Þ7Èúžô‡³R’;ù_ܤøRùËHEp4ôäO$Wøâøu‚}@þûÅ Ä5rõ€,"0Õé§Ý}­ê¸á›ˆ!N£/^¤£ñlˆŸüIžþí?%À*ºøo?üðI<¾U ŠTfµL³’=K¨4ðȤpþþŸW£éO7¦êMÖÒSìì˜âÛuXô¾ƒž…~:Ÿ¹0Éßž““³ãcìÈÛw7ùž=#y)2ý0¬7øzÐ’Á$Ñ[6€òïû[&1q³$ õFIæ𪠔®Ï¯ΦÝœ_‘ A˜nþyi*v(P)¦Í?¯&gH]–¨ÏµE*B°ùç%ºnM¨R Æš^‡I«…*ÿÏG™z/Xc8/ù%V“=ªå+ÿ|cÁ1 σHìt$ÿ¤FCÑüLnZ!eïq`²Ø1bË hÊUÝ4¤nj;žÁM# =!Zæ7BOwµäæŸ×™îj‘Ì?¯7Ýш/ÇþP°Ð›j ¬™Ò¢öŠ”}% úJ·Úå|ò›pù‚Ä@P5¥EPص(¢¤)-#Ã- c þ™Ò2Hܦ8›i1¼×( ã 1Çõz,SJ ¹×à“2ü8ý´J"éàƒ–ácñÐZ•MŒ$ð + £ˆ·›Ú±R?uƒÀ‹m#~ôBvKó{ÿMî¹A0ß â˜šÔ´£4J“Ð2Xê;¶)‚OÔ@e­£YÀ1ZƱÿC¶ €C1¶×(´&8ˆ™Ð’I@ä.e+@a½a}6ÉA[I`Æ‰í¤¡aÅ, \ÃõRÓOÜ,!zÁò£Ö”3Å)õmÛð9wÚNh¸n˜ÐØb”9iØ“Z ˆÈ[«L=Èù‚)+b’™€@]Z ÔÅ5 HoVi3ɳ’¬ÏLTÆk=pB`)+êó5 75 ˆl¥¬,åo Õ€ UÊŠ]—°š;t •‚Q±œˆÑbˆ(®Q@Œc-QVð LïQl'¾'ŠÀ†Vh{®í1Ãv'5Xä¨DBww¦÷È ÇùÿL3dizaP×ðMšºaè,Í·myGëç@ 5Kö²Ý:ä°§A ìJBh!Ô¹R€ Z Â5 Z1*×膇TIà°ófGŽox&×Rf9–GÈÒHQ¦sH%ò$ÏVÊj­øfà'±Ïx–ÄŽûFèņo8. Íe†Qõ½$ÇÜÂ<Щ]ï¸ 9¹€ÿ8µ16ÕÒÝ?ñÍóù¼u~Œ?st?퟿mþz.¼¯O^c‰ô(»ò̪ŠeÖ~OAìì›Ê(Üà¡CÕGQW±}Ô6sÔUîCx•¦Éø÷åaýK Å¾q:˜]ÔÁvh¼ª©]ÞE‹‘Ì*… ¹£êðy‰Ý¥õ°šyûýÿIF³ÎWБkþ)ÆOmj—÷ÎÈøÝøƒ¯‰åí'p¡§Šxµ†ü‘ý –f@y(zgãðÜ.ïÊ'™N®VF+LNæ{eÚL&55uÀ-š::›w×Ì ÑüÔ ™ƉaûoûN`G‰iZf쎷ºÐÅïƒ‹Ë t.,’٘ɿ*,ô(Uô¬Æ5  ‹S6ÔêóÁ== œ²©³â¼ð[ã)‹~à¸Ftʆ< îŠg°¨ ¸†Sg•mºŽèlJÚòg`ä‰4F(«ñÓº’€@§ ß ß˜ê7äh³'à›NÀֱܽòb’6äg@‡pË:D:N’'9зÐÞ-¢=váZ'€ºvºEì\œªhî <Õ˜!©ð@ó– 9` Ƚ:»7Œ^3V‰&›ÃÁVC_´Žg=@üz[ɪÔɪ\QGò¡I? %=\èÔ6Z¡GÔÄ›çÔáJ@y5â™X¥35âT'ŽÚ{¨Ï<›…O½8¢›z®kÙ2ôˆ ìâ©NÄCÓ 0â„RêÆÌs©ç™.Wø]ŸÙ†Iݨž¬Nxp6Ü=U"»5`€8+ù‡£ÎU>c'·ZŽ±’;8êîó–ŠjiÄJÎßõOÛ°UËVÇã›߬äñ²øHv#Ïõ>àèÍV8z‹ƒ8 ¯>./…ÕNÞ£Y\]ª ¹d|¬cŒa€;63Êv¬Îƒ?žc€ÿ6+ùoãt¸a³bu)\£ÕŠ+ù:¯u{ÕÏ’‚ æy6µÜÂàóÌJ>ÏsQR¹å›ïs"ÆXŽø‘y1 X„FbÌ‹ýØÍís„`?ŸmúÔé­’ÜØ1Dg±H®Q@ÒJ·¹üÄ5Å ¥Hã$3ŽÇÁµÌ,kÚ‹|BÊÒ¢9{€T,ùH+V©š¹9,Ž‘øŽçZAÌ’(¦Nb†|â™C™ŸºQ¸,ÑÕ¬œ:ô|Ò·ä0;èÝ• –¼×È­ƒM„íbO„àMÍJÞÔµ‡NÃ@øµŒ€^´ˆ^»´Z󥨫›®é¬X‹ Õ(àfÎJnækÅÜëdJ’ ú”‰¸üážl\¼YÉÅw"ñYH|V'‹Á'ŸñÇ pg¬lÛÝ™Ñÿó÷‰‡wVrx×c‹û8>€RQòÅGª®€3=+–‰Â5 ÀtÉ ~­hÖ'2é_\T Œ¦<01oG縣ŽDxy»i¹¶Ïÿ>ˆ=;Mý4ql;oé¨cnÑÐc"Çê8ì3ÀaŸ±ºÆl½>PሙulÙ ¨;ÄŠu‡p@P,„kŸ¨ =w—F‹z¶BÏŠÇÛäb4¾&ÚKõGÃ8Yü²Ö®­I? F‘z¶ùвe3 D+–èÁ5 ÈßbÝT£•E ¶lx“*Š;:·fË®¿iƪž@Ùfapç¦Y ³Šªâf´^4Óêífië¨×²TéÐ[I „+–P@5 D•°RTÉŽ÷§hº|-Å£ìjG$%¾N¤¢UX)Zeg»}Ò]¡¤²+­¸Æ¨jBXIJ0X–ú ,Ä A,HaÅ„ý¸Fá]'NƒU:h#PÝñÌ4Œùæɶm+ ü$‰¨ÏWŽï‰\#B½%ƒ­2ª¯µjFèú±çrÜJ¼Ô·bÓŒCÇtÌ8J܈c¸ÅË !ܜԉôÎcà¦ÎJnêx'uÝX-x•³^åÒ#lW‚ Û€39[áL^ƒn ©&X¬+À¦ –Æ©ï3®©:žŸZ\»qhZqD½0 ý|29§ß­O&üÕÙ õÅ boøˆ³’8RŽÞѬàmÐaêd g€§1«ãiÌOcvϳ„3À!˜mœ%œw*õ|ÞUoRñuMú±}ß³„3À=˜ÕÉÎß`VÇ7˜U:"¡Èw\Ë‹|šZ\ññÆB×6¸J’X&ÍTRæÝžyÉí0LƒÔ´Xr=rD2;rcÃçJ]n6Œ†·¦®–Ì+ÙEÖ*‹úɘp‡Ï•R1"r@±éÕ±M Ö*Áúíó¹NÞidZg~9Äh>h@jvæ×] Å:+¥X—lqOœz€L쬔‰]¿;ëÕNC‘Cè ~qË–³jÎNüœvj]¼÷ u>+¥Î¯=;qú榀m¿Ž.dúg™þ¿‚`f`+Š ìJ®üÞÿƒèJ]½æq,`e L£ཱིÕ-EwLôšÇJµÒd–Ê0àl&2c5Ô ˆ„1K‘0Zó·m#LÛqLæ8~† }Ï ¬ ±|¾_JòF´Å¶èn­h&åc5`L PÇ4êÀhl~L °Ç4êÀ˜@ˆŽiÔÀ*¦1ëÔ60+}„10Ad{©Å· |³`ûç%žÍ·úNœú±#Ž·8eT'ñcN‹AlSB/ 9»›¦o™~ÂE_ÀŒÄåÜÏ)ò"៓ߦ$ÿ¼ ØhÝtª Ñ&à_mVûWWU&ktt5Œ‘Œ8U›¬†œ xC›ÿÏÞ³6·mkÙÏþ¨î‡Úil“ŸnâIš´Ýî¤iݹ½Óéx@´™Ð¢–¤œx÷î߃)R” ’w[ObK$pœœÎÑÐf^›»džЈ‹ 1ǦœÇ6цŸ:Sø©&¦È6Bî¡B¯ÜïÇBˆ_€v§ÝÆb/¸†jJŠ5'ìcwÚMhë×Ì>c• ˜"Tsô?vµ÷ mÕò̧ÌHßó1bi ì·¿w•LCjÄ“»éÞ6þ3?cý}£48`È|ji¤¡»åÞ8µ^M W#ñÜMw…Þ7‡ã’‘wªŽi4ÒÑÝt]œ¡ä½7K…Ã-¦5‚lÍa¸ò%Ay´ÍçŠF† Ò8>¦š§É¼ÀîPí_ÑÓdjàA¦†ñ´ÐäRàA.…)\ §ô¦8ê5)Ø螌Mt0p»Ë$,õÝÄwRŸEVjYIY6稠´ãv_y ͹þ˜ûëÌÙýþ=ùšT ¼–Ja:[4,Õ›bphr#°7!7ß{(¾¿›Ø¾„Ë,;`Ž¨ç¦~Âo ’8¢â¢#ÌOÖ7Ž³³­ŽÛ8›'LIÂF$j{Ô»(«i@Æ꘲|ÍAúØ_—ÛSÇ»aÁ G¶,…T+÷m´¹Í1 (IèxŽçú)-Éwmsl—zœ%÷{0>† kr,°?eÞk’%ð Y‚‹V¤t¹8lG#8Ì/?}ûT¼…—_ýzñå¯ÿe<4¾1H}è7-.dãü÷ì´¸n¼Šm/ ¨f‡^êûqâà”~ ™rg¹ y™ ng°.&^ gŠ4H°è£GZmˆÏ÷ÜÐÃŒV@,7MÂÀ·/¦®DŒ©‰,Ašãgê}i¦Òè]ƒÄ‹5ñ£.L籈›Ùnä¤k“(ˆiàÙŽ{N¥ Aâ0cüLß M’Ììt‰ PËK‚4ÇÏÔQSiÛÁÍ}ñ$d:ÜÐ mXQœú¶çó Ýœ€ÚÇ"‡RÉ¡pæè™–hŠv>¸1 lˆ8N@BØ) ã$ÀÆ„Ý8¡˜ëÏêüyrÄâš–`Š¬Û}ôýß=‘ãâ æœä˜Wµ±YF~£~qæè™Õ`Š2·žVeT£ .?0µíZÚ˜vD£>“"z4™DxJ&Ödá)™DøÞóí ,F½t øz”€ °R›ß{ÌìÓÄwÅ¥Ç8Ü`ál ç¤”j;fIda–€˜bÌŽ†o†¾cfpòJwèQ‡Šlíz'„Fxž ˪+¬L­+Í‘þ8\·®2¢øóÏM'šfůäoT³zÃMÆOÉÃY¯O Ï™1u„ž<†+±&URå¦Scï9ÿÉ¡‘á$y¡1ÔÂuCíÁBöÅÇ6¬mâE“ÁˆŒ¶ÿðˆ‘™bFcšEúc ê:™¡Œ6ÁK) û%xƒ¢eïPª"¼>ÊÀòŸ¿fi6ÏxjüÙ³ÓXè ]Eþ²*–eÂ$ú`|_-ð“ë³0ê´  ÄX. ,íhwµ–6ã$ÉÖ4!4¨|Ø/Ó«'cP²†a‘í®àŸ$gm^º ‚^ ÁZ»T‹àé6îvÔre=9|‚:5ŽåÓé8Ü4K­µYjM˜¥Iû0ø$u0Ž4ŽÃ˜0;°"l§Aûcf©VwZ5þV &׫~ý훯Г4ËÙSôÀÓÔæÁc«ijóX1S ; †õ7j1¼Û­ˆÛÌ/?Br¢vê¶ßh7Œ:CŒòÄѶêb…Ný¦Ž~Õï¾At?gílj¡MwàxÀKù½,+>Ü”_Ä2š›ê]èæÜt´;Þ›ªG‡râî—rO—#;MåeY±•kóV‚f èoÕöc·‹0îõj áhU?EòsU&üHü=¹~3 Á`]¸ÜÆ;KÂmÜU&h¶έ¾Ð¢yD GG–5Q÷ó™“ž.õ¡bÑQÎ@­¡›µj…~oÈ\­˜ºÏ4EûÝ™?oÐuݾ®ëNÑuõäæÜyôfûý ]ñfUþHégO‘äÜbmï—O{k|Ú›°´õ6²ùÒÖÃê-ížñ½µœ%vŠîqu½Õ=FÊ5ØÓomš¯îiÛ¤#ŒqšãCÛ³<<ª³Æ›gG ú{@Ì …)wŠÉš~µFžËÛHöh'ˆÃ™lz#Vx‹M¨Ë¦ÌóÓØr©“’ÀòbÇ»>b‰j±©‡Õ¢%aÖ®* ŒÚŽd—ÚQÎnY¾O [‘Õb8á9p#SU×”ª{C’²¨Æhº-ŸÖ{IÍù´VO¯Ü¯÷3é'¨)¹Gõxô;¹µôwT™Ûﻺoƒ*½E  ˜ û´ l®h+›ÀvÇÌúFÓ‡â™+bãÃút®œÆNVUÄíÈÃ+zú×û@{8Âí81ŽÑÈ/Ö¯öÐz„íF=‡£;eãA÷jŽÛ‰1´#Ô³Íòo Ç{‘Ct÷øl2ŠÏ®$”vs„„ÒÂêI¨vãT' TÁ=ʧ°'ŸÂ)ÛcÚèÚÛcÓ"u§8ö©ön°#ø±k;‚Ÿ²f,ù]SÅ,p•b&$ᵬ•‚ú€bs)8>8ÙÐ[ÜT9ÚÅݾAþ…kòoÊì×çìŒðMÏÿ·1±W?™ÈÌZÍý6‡j”Õ§Oò3·ú¦$ êUÞUùÞ>›Ý·ûœ}šzØ[mºÁç ÓUŽl>]'†6ë1Û«²®©Ù½bo˜¼vO“h¼ÅUõ‘ä#ÆF¥ß‹_ÅQUñƬh|¼ûj°×¢Fˆ@ÇxÎi¶áÆîÁµKB¤l¾$&<б¡Æ&ËEjÕ*¬Y*Ø"jyŸë"ì3õ1ûp-SטjÎÔ§¾:Î1º  z  q¤QƒÐI!)úkœÌ:áJ(S×hë¹(DÚî ‘ö—}˱õycæ{lšÑ®œ,þ0~ µ É`¼õln÷8àNáž›¬Y¯gÍnØm_>=>FiI®ø‰`èøø¼ó8)óºâÄÁVQZ€!´àŸÅ«ë²é¯|5;…ñRZ²ªZ{qþ¬âÌùÁ7lÎJR3XsôüÿÏeŽœuè!Ÿ¹þ™BK%úaÁæ?'¬”;Ôž: ‡~]׋³ÓÓ÷ïߟÐâÃÝ›ŸåÕi6§ìƒÂðÁ³ìæj­¨*“糦Æb~5C$¯Û'Ðû‘GcŸ„'>|”]†GrHü-G+ÿË9?øD÷ËÑ"ÅO;Öª¶âˆ>¯|×åa}YÝ¿ðÉ£ÓþÄvø’¶gùø@´m9Ÿ kŸØö³ä3¡ObRÕÅrû¸uïÿ¤?Ï>}ýë‹ýøâTG?þòå›o_¡Ùñéé?ñ«ÓÓׯѯÿqñݘrº(ɼ+䧧_}?C݉þ‹9~ñÓéËæ•ÕÇãºSó„Ö”OÑà‡›|^=ßÆŽ¢HÖe¡ðç†Õ°Â ì1èÆÙíóÙ+ÉŽ/xIÀ9‘•¿à¾£ŠÕϹøú8 hä×ã_^¿*n¤Îâ¼ çÛ¯žG«:2"ÿJò‡¢ì”{-ק\—¢BÕ9;o8Ä’¾ôu–3ôG0rŸ€,vð,Ïæïë¨I\$U5C%Ëù‰Mw9«®«gˆçɨÁñ¼*)³EÝ}ó–ÜùT±“·ÿµdåÝÉÛŠgÈ7féݼbòŠ»õÚþ6ÜʨËHp0EMŪ¸Pá’ª.3ÉÞi!Ρ*ÙMqË~Ì*…@i®ùñ² ñUÀ骦?•¼¾…ÃqJJFøÄlÆ–çÕ‚$ÙüêùÌš‰ï `šêûùzVËÞÀ‡‰À¤dÙÕu}†<ñá ^^Ò楪~œ³ŠX'»‘ePÛ‘EY¼üI1ÛL^¢›ÀÙ-(ŽÒ['ÑI“ì"J±È?Ô”wñ´.埆ًQ6‚S D6§ˆã¹'ù‹•| ö&®(ÓéÿœÜ–Å{{ÖŠ|˜™rˆèÈÄÕÓ<«jõ^åÙJ§è <1ÞóïH6—ãÿ‘\­Îå*T܃ãU=@ß·M€9Ì(>êŒ×¤&²3?×å2©—å}К'˲§”¶ÐùNJ¿w|¡oõìt™Kb6TíãÛéáÛ‰ðÍ=‘c|µLpu•1ÉûP¾‘ÏLFÔÏ1ðÔëv@ð@|…yRáËÙͬ“2Íò&áŠfå%uÝÄw=ìH|zVºNâ†4c«îfó$_RÖöpL C/¡BˇŸˆ¤)âPÏ ;]éÆ-øfôCÕØÙŠ/©æä‚œµTW«åÍ )ï8¿jhð~»èñ ãÝ×Í]£Bý[›;=à‚ûÍÖŒùl‹ â VÄk Á­ Ñ¼¡…ƒg‹õŽ®®?;ÿ¦$ÈÓÅcÄsèä‰ÃÀÆùL=‘x\¬µlEŽÌ«¼L¼ìŽ¸.8qRp¦>>ã§s\;M™«²X.L·‰t}|òv:H½vÎs•¬µÓ ÔÈjvsFb⺾Æaê‚ŽêáØ5•;¥Ø¶=©.µµ¾…Zo@6p >»‚N–\˜ÌЭú*¤ÜØj²Gyû?õ«ÅE][¦pG}ÿ‡AWãï²Åeœ“ù»K2§—êf9ÕÚøRÙÕ£ÍXªÈ®ÇÓÏMÕYž]œl¥‰Í×e‰K™kGÌqÀŒÇ<ÏŽ­ÔJl6‰&ÜvŠè{»¢È½$Y¥chh1?»Ð‚ìEØ \b»4Žc ý8dnÄŽãÒt-²yý ¤Ðwvc„Õúj0 ÁX´ìBæ…QàDM,ƒìâ8´á_H-׉¨¸^ñQ±(}ûT‡×N$ÄXäìB7ô,×€åa†m’2ß lÆpŠ™í‡qüØ¡ïoŸ<÷|"Æ¢f'ñE‘PX¶Ç¨c;¡Ãì8HÓ”zô±‘Aßß>j2u1ŒÅÌ.T @Ö„¶‘ÈNHêÓ„AäÅQˆa1ºä±QAßßu*dy— zìÅÈ.ØOÛe|C3+až-”°Ô ¬ˆø¶#NE|TØ×÷·ýå¢.Ò|ËB0×ZÇ¢i’`0'Yd…>Ž#Ëó\L`õE,›3ýðÑ-}‡$ÙÆšÌ)2K»P$ÍØOX€ÌÜ$´¡EšB3I0¥öc£ˆ¾¿CŠ°9Ý(cµ“6‘(v`aq'±o…!³\ÛÂ1¶-*ŽfzTDÑ÷·% âR9Rº9Æâf' bà ´cYħ±Cl'ñƒˆY,¥dša÷`F¶¾·Ûòë[»º!ƒÊ“7#1´5lÛ~L‚-lx+âšCì²(1÷}>ªU¡ïïŠâHõ)`‰TÛ £¬JÆ¢„×9ß2^^@Žöügap"èUžÁ,a'hÜ`2´ïŠ’œH'g\žnq1vgÒHêPú’¦Il³Ô'Ä °ëƒîá4LDdü#rØè;ÛN£+V_.J–dUVÌål2Ð6F"cća>ó…ŸZnâŽú1Ã%âlÒGÄPõ½m1/Óàeq›QFûª¼1oc1´Ó2°X]„„,À^Ô¶R‚Ió{«|*cCÕ÷·¥ÇêÅËjWuV/ëvMôU…|$¢Œ‰Òî^oÙÂi¶iÐë"Yr78‘£¸vÄ~™ªBæÉ5oKļ,g¾ÔÝØRb6x ó¹.V›­ëûTrwÿ ½9MlÍ£ÕW:(ÛËÆíq«fƒ¿[ýüpÃÃ&Ç°‚ÚL³ó£M@úÏTAó¹<°6xZ$#‹-쥊6gjO¯!•rþ¤íNgrh0ià ˆk&o'”€Ï;CßfÅ’7DêõmÜ•è¿À@œÕ%)ïºç/‹e­Æǵ…´ÛƒôuÁû Ü$èS”³A³Ü¿‘ñͲ:0g¯~Ë>ûûçÏ_þæ<É~òåooÿb&¨Úº¢úŸY6{Šfogÿ{&1Ǫe^s7(–9åcÈ/¬Ÿ¿°_(è‡ðõˆ·À}1jPb VRsú‘fµX~Jy:Xg™Mùƒfù­/gšbÿ[6ÿ}Ý:ê,ö.«R‹S¶ƒKÌäÕûÔ±'vi²Ç[T›ßÿòæÍ1 ÷åQ³›ç\¯-G@R-™©»»Œ<°wá×ì2ºœæöánǸÑ! lÛë€ÄÇÖ 2FŒ„á>‡poü•Ÿ°.ÿœ"¨%÷JøðG•4ìkžƒ¾²?ã$ú¬qŒ÷ÌëÏàïgHºiùwn”^gÉ5â7Ï*s—[2è} I ò‰¿†õ ºYVµ(œ›—:zŒrçBø0V²§˜ju˜¥í Fñÿ§ ¦ï넘[>ô-²{{qÁõˆE!ÎmàTX.¨°!E­4#P™ê•EöiÝzêÆ×Ñ%÷ƒØ›ª=á á’?ÒCEVª¿¡Ái øfTÌÀ®–n†Ö}B®šŽò#. ¼€w˜Õèê«ô$O†øSé±Í@>®»±;ë±’æ "+|hMÖqüÙ9üú[“¢É>6t”rv'(hcôƒLæÇ¥w(Fó·æñ—Ñ<Ňº‡zñ·WK¯ (|t}`s?vÖØ?R'h6oÚ¿õì]ùwÚȲžŸóWôsfl‡­µ°$qÎ%6IxDZýO&g2ÇW É&‘ƒ Žßõ¿ýUuKB Ð-o“à-­¯·úª«»ª1¦6å´h÷cßÚ¼ hcÚÁí$$¢:<,ÅÇr?´‚ïF+à“@¸z/­`kØb UÝé N~ˆ-ŸÀ" ,dÙægöür6{±}ÚDg[`Ë@úkUýÌ̽ØÚPÄÍ„çËÎ;tgþ€Õ§Ä¡á±Ô tá+EŒ³"±Êgå"K¨b».¦Sä| ¥ÎW""Å.ýécB|Ax3d9aÅõ.îÜ_[šrãÁü>*å‰ÿ}kNK@ÜXmbuu‡:>µë[·¥Ô€áã‡Ö”Çsk‰Ná+',\õhê:2àÓÉ)µZ<9/ž^5E"üÑCSSFÎë)·èÌ)WI‘^V%-bÜüP)ó¨”÷=+rüöˆµáHƒ]íù³šÍ'¨'älôÕbJáBe~0ýÏ0ïM'N81÷¯@ öÁÆôgöŒ‘M™Á´™^úˆ´O^Maõܯº̵Ѱ¦„iþ"çÝ<’Ïè0+à/¢gµ1å1ÂïÞŒ¸ð|d±Í7ªk¨=ÂÇýªÇª÷ À¸1ÅU¯¦W¡¹ï1鿱&žj…UüC±ú>+OõQ+V¬¹æR«ØÜ é<… ‘®Ô¦‚l<^UŠWÉCУ–!¹±Å+è5(ÞŸ£%Od­²ÈC"¸á¹eáÉîÄ ñþ&c™Æwì·B[5ÌgQT›Ê²$gIeL*˜Ž8ÜòÃSJ~{¾ä`ìÉméÙb›Ûn/¬=ÆÒ³ÎÊóè-<ƺsóŒ·dÕù.,:Œ½áãfÑÉà–Éh"Ž±þPâàDâýÜ<¾_f¢4qÏGIñÞtxïÈYÄÿ¬ÀÏ//§jm©«4“¡;ÆÐ÷Ì"ºpj+ÜÝ“Ù116.Ó XDOv;ˆÜd\òŒéÏço¡K¼Ñÿ…RŸ]:˜Û e¸ºªÆ”-ÙÂÀ»äÒ@nº0¦_¶‹¾1eŠ ‹>0y¾ÎÜŠß*"rgԯ΀¥ýÂ4-o†^+‘@Ž[èØ6ˆäÑ2³ékõ ìu>”Et›H­ãOÀ»Qå†õ˜åù_Õ"‚Bð+3Y+”›Ï»`(7ø¸cûÁ’eÐZ-¾ :ZGÞÉŠ6›Q'+¹TRó!T ¼¬C6•®N…¯~’M(½¶*ð‹9}É%–vÖRé ×ri¥K[k&ÂÈ%”.p½‘˜€’JHK·£`Õú$ðÙÜ1¦²I¥3ræ à¥RI¼¦d¼o’/©j#ˆ=•LJ6zv:É&m®O2“*KÆš >Yæ* Z=»×JÐÁ„¡Òu¬Ê;3+YÍi'%°†NÒ±ÁV%TÎ>ÈØ»úÁAW¬ý®í¡ß;ŪÊ/0õϦFT¯Ü Îwâ¾ÙéF •°ÿØ#1%°U‚ xÒãgYŒ®ÐÛ£©ç+WahȈz>÷,{îÄbEâ©™;EGnŒ2Lã9û†Jfè„Ì»Ó+T Ù¥‹PÁø Tˆc¡"à(W'£ùFÄámÕ2àûQïàô}ë÷Ó^¿Û9|Kv˜úéÚlwœím?”x\Aå9]–¡1bß"tÄð·; .åX–=¼#0' FjÃUžÃ|º s„IùIæðµM³†šii´i)Š^«ªÆ°1 ƒª]Rë!YLoA™¹á i(«ny;­•Y/v¶µdέ!¡a.ઢ?µÇ¤á\ó;lR‘'\ŒóYt)¤±p‰%Ä'ê _D»ÓH@ë­3›§DQ÷ëÓ_Y«Çå¹ø“í~ùä×í"›™t£Ñ›óJÄ6·Š¨Âr‹Ì¥ÍV±ÃØ—¢ *,ã;²]13zk†3RˆÖLîi5ɶ©Õ+–––þ “Û$‰iÎȘí#|cîðw~ˆ‚}1½71— Qná±~F&È'Wø X´Ù1J‰JãÅôÄãNF–Y¾•ilt{Ç*/ø¸o¹,o/]íì¦6ÓL±ÏÄß?9‚ö‡«ÖÍ‚ùßÌ´õøŒrw¥_´ÂEãÄ­ñTóˆùƒ‹ßÄÁW$YÄO±,Çâk£‹úŠ g—¸f)X<õk4@ʯážqá©JxŽÅYq[tu^·Í{€á@DËä@L›áBJ¿(ïnÛ%ßDÑqÝ/,ž+©úç_ô„%- QóØžXóÙ°£¢ 5|lˆÜâ¤ÀûáÏ¥RP•)•à8áƒOÛuqËÂÞ°Sçá^æüT¡òêe0d‹ŸxõÒíh_=y‹S¬¬GB ¼‡÷ÿÌ¢Ô‰R¥:¡ês­ö\o²ÂM›€v}qeøÙ;ŸÍ&Ï+•ËË˲é~»:³ÆewzVæh}ósûäåèâ,×Õì‚;&ã3Üg~ôOXÉÒr£\ƒ¯2âY³8ÏŒÿñ!¯žü´þ…$cW°Jà îÊöªâNÓð?­ëÕèöª)ÚOTÑu]£zµ¦þ£²:Õ~"Õ¢Xñšc»!ä§áÍܹ³ò:ÑùGú2GgScrN Á<~áÉ@Yæ™Eþ°¡“¡¼Ø-¼³œ¯Ö …"ÄY’Ý­ŠŽ1°œ¥×…g‹ÿ|)]S.eïܘX»S ÷Icw”üÁÒÝ]à-ž[£³óÙnµ¬/Gæì¾iÅ¡ë¸ÓÝÂÀ1†_ E”BŽèlj]Õõú:]9ð,<…;ºáÓcwEZz<hγDý‹McúÅÏG¦šÊ‚ixçð„¢œŒ­o³).+xæE]v£¯Tÿ/=ÙÈ3ÖöÔw]ôúMÓë?úÿ]¼^þ¼´×ÿxÜ&XÝäøäõAgJ•Êu¯RÙïï“ßßõßáTIjŒ=¦N¥Ò>,(Í]ªŒáúÝÊ7L‹âÍþ×Ò,rgÙœ™H~ìß.œ±·»$ fÉïf×Z*G R¿Âµ%ë¯ùèëna«¥>8¥`·0ƒÆo~ƒÏšížôß”Œ>S‰ü^:i•öÜ‹ VA‹¤Óiï6÷ðÎzƵ’†×ísvæ¬Ìn`»¾ ôƒçÄ_¶U’ë]ä Ÿ~e—=y JÖ_q…Ð+=¯*H &C@~X 2pXåg/ÀçxÃéh2‹žùl|5øQ_™øü×Üš^•?£j^ágän4¯Æ¾öé%ïŽà t)È„é/~múŠ «pp?aΕ;Óe©uá~µø .*ú;w×ã–ÿÑ?sM/LËÔnŽ?â°Íñ !ïªö{*“ÿÔï—3ŽÇ3pbyNôÚäÛ‹À˜ÁIÿö’cÙpIµ¬[ü™LÝÏP~|¬4¼ÂWÑ8váüb€zhµÜ,ƒþŒ§y‚\û%ÁPÞ<À¿@Õ‹S¹:ŒÓ+XÎ1eO,´[(ÁXÃe×Dð¯S÷’[f0\›;‘£¸AÐÂâŒ^…ZpTÝeù}õ†¶<ÿÇÆ™åçUÚ—¸qYX~þR“hB‡áa™DŒ1´(¶ <šÆ¾138˜Þl:¨j]jAŽýÅë…Eê8ȉ£Ãî½<©—•¹ã÷üZ—·+o%c/GÂóx0Âeçâ²:sÜáÄSyËÉä(šŸÈÔó0Cp€ýfã=‘B…s–ƒfºecEкNŠ­ªÃ:55ÃЭºakŠA‡FÚ¶nØtàÃåÊK0@—A‚¸YÈ ÿ‰¼ÃÂZ‰fr%aFô…Ò§¿(Šðq<‰äó‚Ql<£ëýܼuC¿w8ÇYD¾ÖˆÙЮ„ni,³‘Tí©qvÁhä(ŽãYérÃ&U?Œ—D‘ëÆnáÖ,õë;0Å-êwM¢Š Q%–(k@ÑKýÙÒ«ÊγÒM_;;a‹•Â® °«ñYŠ›u¨²üš Fƒ©1½ZqK"vM€]“Ç~çå® °ë7.w|-”°u¯¬Økìµ\îuöúÊý [ ñÕšzÌ®Ô*”V”*­n¤Üì\îMö¦öLO¤ÕõO¤U™ÒÊöH»P*óÈM¾²áU¤ð“Å p¡d2ƒ<_¹ê1K2ÎŒž[æÔÀ•Ë®ãq¿~ç ü?³p-5k¨Ùð ÈŒJ‘Ù=–¿€Ð¨¡1¹T<==-O‹ì3ú.&ŸF¥$T6üR£R¤ÆðWØ>+ñwêxø ?¯‹‰,dÄ/ 6*El;¹áãߧ›à•"7Àý÷ß_ÿÍ?£ïeÇ#Ÿ•SÈŧà•"8ÄOÞ’ë½kr ßvá}@Ø÷]ökóß»Áç¹þ„èc5¿€ä¨ Éqü]rí\×ÇiÁÛ °Ëñc?=Md ~E@™Še2ü-†ÓñqÎà=°Ž—ãǼ^³ DšPFüþUäø—ðÖ2^à÷x8V3†þÈ?Id #~ÿ*’ü 8Þ14Wk?ß.kWÄ?âç=¿"Ñ dÄ/à_EŽO'Dà'¬$òN~Æ2¿€Yþ½&ýNYü± dÄ/à_E–¯I;?þh2âð¯"Ë¿×ðq½Ã>£ï%ÇcÇ*¼Õ|Ú 2¿€iþ%GäzÂÛýÞ=xɵ{M&äºÄeýÞr=½&û„¾^ Ä'²ìøü«Èòï/OÕæ $òÿñ_«þg¹gͯ÷ù‡Ã£ËBÀåŠ,—oì• ¿*àrU’Ë÷ÜÉÕg…ÈÖÞ6hÕ9˜…cvEŽéÈ+õæ&ŒmÙ¯sØí´6‚_Àåª,—ßWù ¸\•äò-µGçžE^÷ö‰3ZcÏÚ¾ü.W%¹¼k™#\©7˜‡>ɘôåÓÂìÐ`4FË0Ú¼"ßφsáp¹*Éå®9²GA˜%\Û8±¦£N'N¦îב‰ŽQç¾G·í:Ž{é¯i5Ùô¿—³ü\®Jr9"¾°fÏoÜü³âp¹*=–ÞÔ+#~—«’\Nˉ.Àüæü¶?Ä¥aÌEjá hî^7À5ÃPîŽÝôúbVü.We¹œ>þÛV1Ò®ƒEÖ‹Fù„$FèðwÓòð¯*É¿Jºü¡œ#ò&(èÌæ|h-­‚ø5ÿj²ci6€<õ¬¡ÏŽ_À¿š<ÿÆ'rmd»ËL¼ând8ÞB–2áÏæ#•VÎŽ_À¿š$ÿª<$Ft»1ZBìWA|à¹Ç½c­±éN=æ ù¹À Ny³šy™ñ øW“KCùCµÂЮ,B‰=»DfÖ›XC¤9€;Bâ"Á9Õy¯€Œøü«ÉÛ²ïEþkþÕ$ù·ÿ®Ó#½£7ý­n›À÷ãîÑoýö>yýN¶Ië¤ÿî¨KþýïVN³Ñ ²´÷áý‘´?î¶{=åɇ€‡5Iî¼?>èjÈF·uØï´{EPö÷Nö;‡o‹äõIŸõÉAç}§—õŠ,wéÛ²âð°&ÉÃGoÈûvwï€h½îtúY¿éô±pß@é¶Èq«Ûïì´ºäø¤{|ÔƒêZÛïôöZ÷íýrHÀÚ$w¡|Iû·öaŸôÞµ¢çu ¾õú Íóf¿Ómïõ±Š‚oyû€‡5I†¶­ ÿ HzÇí½~iÿÞ†öÑê~,bëÞ;:ìµÿ÷.‚“d¿õ¾õšËV¢•eį xX—äádã†n¼wÒm¿Çú€¶Õ;yÝëwú'ý6y{t´Ïzk¯Ýý­³×î½ GØß“^;«§ xX—äáýV¿ÅJ€C£PØnNzÖü;‡ýv·{rÜïn“wG ¡A…´ð>ë'G‡¬Yeo?º€‡uI†Ö~Ôýˆ…ˆ-uà"ùð® Ç»Ø9 ñô»-lèÙj¯½ rÚ?êösµ]Àú$/š19l¿=è¼mîµÙæàC§×ÞYÓéá^ØZßÖ¼°¯C]à׬ø<¬KòpŒÇŠL‘ÎÒÚÿ­ƒmÄÇ"³×ñÅ+ë{ïüŽ\Î)tëòsÊ÷¢GèþÕ%ù7¹Š®H  ðu y^ãÑdî`ôâðÊ`µŽLcfäÃ/à_]’½p%H™|ðÕËÁU³DFüþÕ%ùwÏ2§ ¿æN1 z—òÃeÿð¿æ¥‰77ËöNYÁo(Ö%YøÀ¼Ò¡k9äØÏ­ËÅâpyÂÿk4†qY‘ å¢&àâšü˜xC¯Œø\\»ûõ]•lq-AÆr‰ ²¶†!'Ìî‚òÝiáÕÓÑxèÌM‹µIof‚|+ŸcÌ–IãÕÖ0Þz<#7ÕÖØZ8,ŠX<BªÕò´KÔÖ°ÄšL.<#ÐR‹Íø ¸žS¹0†S×+Ÿ#‚ìå! ˆÚ‚Ƚ®E 3ÿÿœÀœP[à ùÊ< œEݳ ôšÍ…¾.à‚ú.ȇ¾A¬‹Ï‰]Àõ5< »R‹`·¾î„69¯ÂwFÈ› ÔóA]@u5O¢‰^—ÃTvžmw³•´€ê7ÄˬÑh>qŒ«EøMè=ueÔåÆ0›|eÓ{êzª×ó´JqÔ9m¬ê ÁîL ·§FÃÚC¥¦ U[iÍZÃVô¡Ù¬S­në5 ° ÈMî-¸ªÎ¾XW—îÔä1­0p­)Y-¡|ÿ½§†­ Õ¦Õ¬*ªn(ÃzUÓ‡Ùh «Zµ”øž#s~1A0[<?sï+®yNµ±„a*,², ¡£¢Ÿƒâҫ°‚|:ÖWËÙ&ÿ‘«³¦€Êšq*#r>ýȪ»„J6ž¦€—š4 D.YQ4“þ+p…,œ;ù¼*+çr¦®ÜLS•(lÛq/ ¯lwöÖg(f¸ú3#bŽ ~={¶-‰JÀPM-Š›´·X‹ÝÇU{g –-ý—¿æîìÅõ§ÿâ'´-Û&ÜÓÔsH©¦€š5éJÙaÈt`òó.ßñS¨@ð7ëëë…ˆ+æY©D¢Âhöiœ¯¢tÒlH—©åxV¶N%J4›)&¶®_NùJ‰V×ËZ8G*™êzÁ ç¥Ëþòœ…9ÉÓ¤%ù† üÍá|ª¶¤úßÏŒoäa¬—Äp>ãV© üÁi5-„ÀÛÎ/A–½åä*pè†óKàe÷l@NR7œOý¯dÊë%0œÏЯ"2XºC­—Âp~Y5ø:¢$uS[4¥IeUºøÞÏ4éý,—¨@ÖQéØÒâû:±øž™‹À¯˜Ò´¤“+q©²ËÅ yê~Ñ"ð¦t™Ð»+Á"p¦4-÷²BË)E®¾4éê+—¨@4Ñ´hZc¯Týu}XÓ©BíZ>êCm赚ÙT‡Š¡ëvÝð7· 챑15/C_à–Ð@^U\´6é"ˆGš’é ÄM‹=)ufi¾³¨À#–*ii¹]R鋣⿰ޖÔNÝç¨.3,U’:­l} ¼T©"§~¦Ôà]ù‚Ãx¢²Å ÝIŸT¹DBWI Ý•¬tya””MÙøzR%-Z7?—ÕlŽTY¦`æÐÌw³«æŸMª¤eö]2¨À%“*i4;¸ßr’¨ÀG’*iÉ-©K ¼©š”»²é „¢šËBJÎ~T•¶¢¯cxy$‚Àcª°Œæè`G<ª L£·Ø¹>vTMÊÐ;RN¾s4á;'Ûö’.éÑ&—¨@>%Ý̤]ë³ 1 VSLÝÔôª¥ÚªF5µ^«64CUÍÖlÚC†Ž·5 Ö6ëõá@*Š¦Ö°A-›6«Ój¨ ƒÚñé«;ž“fmëÕ’Ôx‹ÓƒKzÜÊ)¾ê¶¬ÝWàœAÎ’Mà2A“.R‰ ühÒA.Ñuù—™m¶u{ k5[µ–n75c`ÙMÜD¾¦4!åÈ:/:ÚŽLƒj¬¦¡ZCj« j¨ÜÿÕZUËR©e¢W´AyL€³uÿýK°¨—êIõIjÞø|tv~z‰~•§Æô °w|Ëoɦ!X«Kkò“Ú‰:]y§ÐÅp‡E¸Ã, \ âÕdærÒÀsÛ¶¦ÄËòOYLý0Ϻ[*XwKkI}±_°Í·–Žò–Tºå±Z-¦šÝòŠ†ôÙvóT*ùmY½I°ò—Ö’ª¦d1üQý3i@x eý5?UÙ?ÿYÄ 4¹8X.QúX“Ÿ¿ƒÙLÁÒaZ[b4•1d¬7ÿI£hµeãï`K¼ ­¸)ÓÔVÒ (ÝÄR[6‘$U¨Aβ£`µ/­/³£âùã-.|eF\8Hýòζ7Ž¹ã_eö ¼>#Ûdññï› ,‚`{YA|êµ`yFÑÃYîÇìfš­®jzÆÒnôâî¬ÑqØl²ªXüÕŸwSl´÷z">üëçŸ~ -‚þ2]gUçÓüú!Íß9Û+Ïs0œ:i•V9€€hÝÑ­Æ7®Oå®ÛඡÌß»W31ÕȤ? æðÿ™mò0 M×9à—6 û[&¿h¬§ˆU¹ 3=¬%òW!ÎMOôµ.¡ïꆧ§§iˆ—4yN²†7­§’âÄ-(<3Ý I Ô3Ó4Hâ+þhÄêƳųDBq’fÊI._ßIIƒx>3åù~kkÖ ~ÏÔ~¸® âIÌØ“PÛE܆ÕÎÐE,¸[ð§Õö–߇%³}eÔ^ Ô4¥É b:MKšÜ VÓ´¤Ég)lBö.ôÂÃ¥}Fh«M¯:ψ”zØfïìÓä1Ü0®AîC./|ÞiÝs«¥õb”Û§î^XžÌY™SSe‹V³š§5‹xÐ §ç÷Κݥ¼`ÚÈr„9çcæ¼=„˜§…QGXv^±ìË5óæàx[@|ò€Ï{Y>¸;ªSwcÞ%ó p§yŽpê|Ä©S[÷ɼkH%r„ ç]&Ég‘U‚ßÒ*/R÷Ú™}HH)ôR™’¨üÖ»ÍÕ Öùî&l®./ü ôc¡uyEëžÃq„Ìå-d.GÈ\^‘¹Moc[ŽOól*9S Ím°){9Kä£÷ÑŒÂaû—›Í‡»+²g{3œõüüÓïŠìâü…jñÄ—Wˆ/±Ùù‚W„ï)b.ƒy ÎHo¼ò¾S<Ýw^u\ËÀv«uûîCˆ¹bv0vÿÏáí|»›ÔGøb^ñÅÏZ H1Ÿ@Š—†%ù¸Âmþ1‡%yø«óÆÝÌ'èæsĶÌycìËœ7ÅŒÌÇÏÐEÁø6Z£ˆ# ]ÑòÝI¥,þqäɘ“¯h™ýù)¹rÕ;¦"2ü,ì?⠈תœòg‘”GÈd>¾W…Ö(bXÇ—U'„ÙÖr‘×)Ú^ Û۬É;'Š.g¹ ê0»)Å#&gSI¥”7Rk=s^K×CðÞi?Ê\ç9üdÀ4¥¾^]¬¯înçqv !uPpµ}‚ëôK¬ÿLö¦ˆB:­r®žµšþãuú´ˆjáˆv:k§ÓEÜh¥Z^¿^|‰†!>ôøœŠ£}êÈìñEÐöIC§óöXk®D´:#dìYö½†0Ξ•ónSjcóªÙ-†ý¬¦¾%Ä?‰‰ãAƒ(‘ûœwý^°ØǾ³RF×¹’ÌV!?ˆ‹qþxˆ¦ t8ÞäÇGÜ›ïtˆBÿrYíhÍ"~GÒu/ŽÏq(£NRD@œÄ©ŠÄ×cYoZ£ˆEkm“¥ùnÜ•¢'z”e’ËÑ˨þQŽ%KÙHTÜ1¤@˜;Þ"2ÊÜŽW¸Ý{NX¦=$¦·.r–˜òÖtÌ„N ɸ+Ä×ñ2½»ºÝ¤uœX­oÊt!ÏÄ9TTÞ´¤úw>÷Ì{9¥=ôÀTÏS‰˜öz¯’Õà˜í*9•ƒ£—‡¸`ÑÃ"T7- #ÆãŒW\wž‹J©8B»ñŠv#™ÖÇ×öváùÂÈñŠ‘ÛšÂO-‚1¼[ßÜ]]m®Ëå®»(¢ÉÐ!Ð7O×¼ßÜÆtMâ8ÿ3ÏÓÿ^ýûöáþ¸º[Xo>­W?ÿôÃê¿8Ýÿø‡êÔdÉF¬vûí%‚ïqCOè,[ãæÇ 5)SsÌð  ‹ÊmmïXgƒñF«l" ¥—‡±î¶fo°@äw†¸ ÓFiŠ©HöÖ1ß÷¼Ò°ƒA«eò*G„¡ï¸H®²·ëìsP{µ*ªìŸÐ.ON#¾'Ÿ|¸Déíê¸ðÝü>¿aú.X¶Ï/\G.D”0¢>Í+õiâòDĤ¹mÙq RÒ¼’’n¨”áˆD4¯$¢‡/Y`µg^©=?CÚ Ñ}æ#Ýgê¤@l¶m9“EøYng˜Ó¤œ~©eÑöQ$U,§t]Î(«X¹Õmµ‚nBHÿLi³¤2'½I,IésǼè£M–Éè@9nö(kFÄÌNšDg*Ñ“§Ä$Ö¦ИDÊ*)Ó—‘Dý*õÓ¯“DùXC¶*òì)±í²öIÔg˜7ÒÀšÔù_LF ˜&dV_hF àjMÕ3dÄá3¡â3iÑ t#ð†Ô "Tâ×̈=.Ö%[l@ C¨ Ã_qB ´ZYá¡RdmIˆÂ9B%ºzÞ„ ˆ$Lèª>KB ì&TV_lB *MVª¹DÌp%§zÊ„ `#T’«¿¦„ „%T¯¿•„ Ú´PiÓþÊb€èàB¥ƒK\žˆ-@Ë~‘ …Z‚vyB =Y€±›X˜DZ€Â¿œ7!ˆR-@‹Ö'b³¡AëbŠEKÜ<‹b:1Ù'fD^º´IÊ9)9W}´ RzV8į•+·[šÎ%‹"šº>÷¦ë£ì¢uBìù’ag $Îr*µÇä†xhaB !+Až$!µ/aÌCFíbÁ[àL@àLãÂñØ~õíãCç_þô㟩vX"ÞDVÙ«í.èøQ©_†x9ö*‡3¶–|ìc†Å;Hĕɱ+|åñ’¿ qI’~åã±ÛlYsˆ#‰Ý#¢" ªÅ“! ¿ N&‘è…±DïQfóùïD FjÀÓýŸ. ü×ôqsýy5lº\)ü.¦ÇP'â7+ÅIb³ˆ‹¬øWRÆ•”¸Z¨ŽÕ ˜Öäá5@ÿ\nõܽ€Õí{w;ÜŒ»ëà0%W7«ÿeÑ A€ ¨0!0¹íMœ“8Sv&„$Ÿ~©Ç¥œÛÞ.}qæ ¢ŽÔ3Ó¡Cã$ááêÄ<ÈéîÿvÑ t,LбéúzsM8Xos}å`´ôòb½rû™y»Yes;ü×0K› zZ$+¡X¡¢Xg×ç¿ýøO?þqõqó×”f^‰»««Ëàür}qûy»n®NÄÀW<,y\j³Ñ¡«@Ò¿;·ó{eöàÑ­£ "XàÑ{_vzAíÁIfùjV9ºÄs³Ö™…õ"•bÂÁ´ˆy•çùZüvÙ- €°Â0Á /]Y›õåçBìWÒ§‹Û÷ea]ü5m°ò,+A÷§ÛâH'ˆàGëÿøvéÚË€¸0Aâw•ò ¶eW‰ð®`—¸¥ƒÅ7,Å> e¡e—¸ÉäQ—ªàJwœ;+¬¥¥¶wÊp%“L¢ä”ËŒBÇek t¡‚t·?Ûøô,@'ˆwªàß]·Ï0â' Ë`lí ©Ëql¶vl'=ÙFøb¨ôy‡ìÅC–ò„#Œ˜àJ¡—>ˆ©­Dzií DùVŒ”o©­Î[ZÑ5äïÄ—òÞÊAtIaÈŽIϘ”Q›BòÖˆâ=KÏ&xïS%5¤wÖ&Á¢öÁ)Èa‹é…u:ÇEž àãó¬|¾[çÖ~É Ðâ‚5xtðߢæ¿Û3&tÚR ¸¨9pZ³óUÔ˜öseJBn‹r[ 䶨ÈísÆoa°EÅ`Ïm7oÝõ/iÈø”Mf_rC«t™ÊÇ…C.\²Ó@-&jÒ`mÇêí[’i ä¼Ó„ôR÷ý\¡¤@¸kQq×O¿‰ó?ÓÛÁÄ=9GË1èʧ:J·äÀa¼E ã-Æ[TŒ÷œMí/Öqµ5¬Ë&&âf*üq×úš~/²[LÝϼÿÿ†dö··/ ÿq¦Mñ¢4„@Àt1¦¿ˆ4„@ t1¦5Š8¤Š@§g©Óÿ.&ø÷çÎì<ÛäChz1AÓÿ \Ü^Làö¿¢ÀaëEÅÖ/ˆ¾^êÞŸLb;«õævÕoîÖqÙ«FBŠÝ<¢W`=œí»X\Ë-S³í*GÔˆª€þw R!÷´Õ[ „ÝЂ< Þ-𾘕&d7eç‚Ô¡÷žq!œ×JqûØeÓÑé­—žéóe7×AqàÖ€Šå.À÷Ö:Õi©;=•Ýü‚Äæ.¯ùdï)úrw11J@ô­…h »Õh1VþR²‹Ø-DtZÈ–™Œ”Bˆq)mOSÌ}äO|•Hùƒ¨ÊH‘.a-³¡×,Ë1 E¢*ºx;+¤ˆBŒ‹(ˆ~)—²åHµ‚W+÷jß¼]´›X•1œÿ8lkÿoÉE£)£òêKGêDKýƒ@êĨþÚUÄŽ h"h\•@jtV¶š áÅæ¹gEûú+U2¶¿SO£lQkdŸëD˜úŠ¿¡[NùiQÉO—Úv¸‰·.¶ ÛS—Ü\üoÚŠɖ÷-Õø!¥¢.- &r¥‘#Å¢.& vhP,~–uqq¤2„ɕथCˆ¿Ò uç©U}ñ@ê”–©¦Éù!%´8?ȦÅùÍRµçZAJ,xÈîÅ9^ë^e·CÉß”ž‘sjMc>;£„PÇ¢Úmê2°±,Zz‹ <¦:ž…$B(b1A÷…Ÿ¯ Œ±˜`ŒI,ÓîñF®yñ #qÔ)|Ú³ŸsÕpÖG ©S úÈ£ràb‚d‚RF>TÜXºe7ïßòçÍ'˜²›÷FùóÆõ »y‡?¯Z~òVòúð—؇y³Ÿ?'­É @zÌ#»yš?o: ”ݼ)ËŸ7l+d7oÆòçË#49[éPmØúIÀ—cÿðÏ^€ü‰DX9bý§û?/úŸ¯7!ÝÜÞ‹~3óç û˜%F‘ŸyFù‰”HÖ°Ù•H¡€l)³Ü+a¤’ç9°ÒLŠ-÷IkµK"…’˜É=ãéã'wÐÙÁ.Ø@ §SÞ3+áÁsÎó~^&®‚a³,ˆÑªë»>]¿Œ-´D°`É)5*Õ˜m1ûò @¦ošVˆ{\  }þ³Døb9Áo‡ù ŽâQ'ÈZb¸°(·Jí-â©5%BÔÊšÎÇ)ÕíÛ >¶Jh©ã”*¡!ÿ$~RBC&VÎ2Y“ïmꌌ¾ï4èèS¯¢â6pû>3Ü¡-Å×Ó> ŠI¦ÀõåL¼sÒô½PI÷PTYTÇÍ>êG?¿Èœ'©Éžxw òÔùÚ:}Ztò 23].õ”÷àH8UAwª‡©ü׫{jw*ZÜ©@Ü©øJî”FKøS±DãàÔ[9‹–ÞMU¹Ü/qµ‹%àƒrÁiÌ@‚”ãg!q9†… ]þ–G³ÕšëA`M)¦jG§¹íjmdßùÔõ=çHrÜóÈc×{à>鱘~ä¥yY‰ð¤rÌ“Î<÷£•|9HJ•r*ý‰=[Å*,µÁÕ*+or¯vW,Pm1µÊj=`øBÉÍ¡Îo˜Ô¸&OÄÝM0­ÄxUe «žôÐA"੬ԻO—×/ï¨$¶.~Yo®ÛÆ$¸ÊJœþb÷Uir?ëVÁae…ÃRG±ê²%Rµ"?ê§v±žM@«D€VÙ´Jh•-@«ÔsÏÿôöôQ¼Ñ2$c"éÎÚ(¤5Jû˜7‡Ùf»°Ýžjv¶Œ$þýGÛÑÍÝú¶};zOŽzg9á2"”¥ãÄꂬ#áJÝ4uŸ¥Ç>‹ºMº_¼É@ðZYᵫÑX’S‹¯*+^u»™¹.žG"<«¬xV¢‰C°T©[δTV:ÖT—pü¶‰½A˜TišR—E*MKêHe D*gyÜ]½»çÅÂsj×bŠñ$‚ÃÉ ‡#eïY‚Ï”Ø Ä%,"çŽí7£Žâ@lÃFE!Ø›ª°·'•ïVD­?½O·ïsüV¤v¡Ü¦pQ7Z{7n{øzs»HÌ]!h›ªÐ¶ÊÐòm­¡÷=õþP…sªæ*»uæ'áä'™·ÜªÂóˆësü¸ß¼­Ç€¶zÂù© κzÉ mÞj«®á#…`{ªÂöÕ;\‰Òç…™\x¿×Ì¿Xçe´r«›‹—îúñ÷7ÃG|áž7窣›óÑÖŠ-Ý[)$T]mÕ‡¸wŽÔ÷4oºUWŸlEiÈÛ`…†ŠÕ |êÀf[ð8²Bs¯¶}̱oÉCŽ…ªR&ŸéŽrdì­d¢ãÑ0Ϲm:QÐ)p>>8zŒ›ïÙ™ª(J@z¦¦¼ÄUÚÉ ^ËÙFnñjGXJUI9?ü Ó ÄÁçzêé.÷¼&‚f]èdßËÁ‡ë>•ò†4üîû–ëYÞ?°ä¬ˆ±S.i!¤Q.Q¹ß}_NË–NVz«Ô@ÁV›R2£&}"t­&„®O}T¥yk5)oý…ÇU;oþfut:Eì/âË'¯Ç?xƒ[¶›[wûx“Ï0Ó/n?·ª)DþZ=!ýh ÈnñüOhQç,"ç¬xƒŠBT”Õbåg°¾<~ÄÈQSV“jÊçˆßÆZUŒõó@ìbþ&ušCIb¢A!ȵšÔb¦ÎXÄÂñ† ‘B˜h5©6¼Ël=×á…BÐhU¡Ñô1FloI!¬³šÐñ%Y„ƒ=±#ˆyšÉ=µ5@pjÕ‚S+DVM¨À–,æ‚°ôä“—U•¸,q #° Z²%ˆ>«ªôYOœÁUˆŒ«‚–jH…è¸*h8­Tˆˆ«‚2 Žݤç“Bw1äÖDÞûÆùÀÂpUrîY¡OÏtèÖ®09“›Øïí„ê-sÆËÞIùƒè”sV÷!øÎ…mãa³¾¹=H×–íÎڨ¬ÓpÖÐÔß¼¦üQ̤nltV‰–é„0«ªbVIéÕýáUÂÄž >i’S}uÿô ÆįE¼Ð$•:þÚê^dú×#þjJuõ*ïðÂÇ«§z±Óa%ÆZª¡¥m‘B—*Ùâ©æSUÌç©=‚†*Ùä©„SÉO…𛪅ßTê åÀr¬¦‚ 1êlp<Êü}âÞ÷CÏT«ØkÒÁ_ëÕÓm¤ÇKö>qšî(¾æS³LjéJãuÈg^î—¨c+„UºÄ,“aCzú™hÎTµp¦ áLUÅ™>3r©UU4*Ñ5 ì©Ò-y!„U$½Ó©YHWUKªF,)u¸§×¢Sª&T™–lòÿ±wíÍmãH~þΧÀh®¶<>YâûáÄ©Ul%Ñ•cû$y2©Í•$A›3´¨%©$¾óÍg¿ø)ÉH+É\ÕÐ%‰&°Ñhà×ÝhO]XSÃÔR€¨c+¦k)¶iYöEÖUOË(Û‚¤_éqÕ”ÇW¢š {`¢x¾®H–fxž®c׋MnI˜^ ";•vE[Š½ã,ŒGœÕ7ý¬¾¹Ï7^jЭ8‹tmé48‹t 鬔ٻ†+ë lÚ|‚Øʉ’5¶,ÌÙlj ,rc‚Sâ¡ÏAz‹’èŽ r·Hï‹ÝqiÜOx­V§38q´†ÝâµvƒklÆÄŠI¤À€ðµ_Í58AµÆÆâ–"u«¾KDiá ªP,.wIó†¯ œà\c#8WçE¨¥‘ƒØ6W¬4u;(ðŠ˜¦•¿™@LS½ J£mŸñQµõyÄ ˜‡mÉt°_«6—»èÑ{E´öúƒÀž~á¼<#~0èrÇ/úCójgI´Œ]’UšD¥3peÑ=÷XU¬J]8ü—¥Y†v\înGìǹ&Rm½2’U)êÝ*‘H]JY²ãûŠv’ìbS·M8†§ƒÝ()Á¸‰,ñ˪7ó¼\¥áqaZŒm%<.Y]zŠæû”!….F_•!…®>/ÌwMT†4-—¡J‹?Ç,Ú×öU¢j–oÓE™œLË•LM—ÌÞÞâQbíË/‹6Ä2 ÂhÞl¹H#2÷R|³»©³ôàÇ2¼Ñ¡„ôýz–ö4™âœRܾÍÖhÐ ¥ÚV“´­jç<ç¯+Èåù“×(äÏõ<5¾¹jÏW`Æ_Ùr‘y¹ÀÚraÇFÃynñáªíRß³–Úuh3ÓããÓ^&:×\˜TSœÃŠžsØ÷<…¸ØÒ‹î.)Šk™¾ä’bê. ¨åqXÑsóË¢œÁqŒï“Y²ˆƒìM¡‘¢–ë re²“ö¼^¬ñV¦«ReÅceºUC­a&É+ªWˆD×DîøX@m£9X²™òäûÓUl³®«Ø DS’E1S’+zWÖ\ORºcSéZ h\ ä D¬WöUºæC\Íó]"¢ÊÄk†ü²j®©f=¬žíë„L' W!ë tó’»|g8w[:þvw± 720ü8Ìü_36YÎ|µ+–­LþÚlâ˜Üz·¶ǀثõIßf¨YŸôõ…ÆÎ÷>‰Kx[OVÏ÷ÿÛ§ø² ,Wâ[n5ÙˆŸüYsq~¶ç¨”õñ8˶6ÉÍ!6cŽ³:…»ÏѨF›ÑÂ0tÃWˆ£Úªl:šê;±M˶ÔÈáÀ/«Þ±E¾{¸¨ð¾š(Û%7ÃÎ'1}˨AWߪF)ç/;(.å­–0°š*9Ö¤;߆þ«« *ì^I¸J綛ã¡kè²"û†_¦ƒÇ óUWÁ`Wš$œ_V]oy'2¢lÉUs³p@“-ƒ~§f¯‰ó›[Ö:ÏfB¶üã<§ù¿=ߥšQ¤J Œ¢’ï–Šž¢*¶¥u•+šêø6ô~ÉÔMIÄ…Rò_VowÑ'Ñiz¦í:úŒ -†>Ýw¡bèk ÜÇ%“uÛ6“Åt\l¨®†é¦/ØtdƒòH$l¢d2¿¬M~Íæ‘׎Ó,çw2‰´º|kMä[³…g»í\/¿ÃnµÓË}Åq$`$Eձ⚒¦ƒêY–£I"Ú—_V•ñM¬®ZžÑj£)÷bom¶ªTwü6ñû–ª#ÅqÕ‘_VMuˆ©ÙæË©dÛ£6©Ö´ÉjNÉI~̾8'ùeÕ8Y¼ ð80—nÍ´•<˶G&j5&¶ñ‹[.õ¼:š«(šŽ‰kÉÄ—m ´jKµ°ì7ÂPnYÕÎÚ¢÷‹uþ½Î®Ñ)ìÊìZ“9lM8òM+"ßÊÆlÑ’ØÆ´ç‚Mº ›m;2vLûªë8€±MZ’_Vmî)j?Ë\ØWÁ|±L¿ªhjµe­ÁTF'x˜(0Û úžfƒä[ñ\Ðk\M65O<Ëè~YkÑ \ŸV>+ÍÒµt¶%HkA L¦’q²d_rmMµ}iMOÑ4OWˆiÑ 5¯QX¿¬5Æ Ê+K6óQž|T×8Ø@ôLáPH³…d¾„#J°âðYëÞO‹×Ý‚qr ãxëJaãïõ&.lü²Ö„Mp®%aË“ïQØŒ5ak…å)²ï™*¡kCúžâXÅÔßr Cq%Çjœã–µÆA~!Í@Sÿ²Ä{dŸ¾Æ¾&s[ewÉQáÉËŸ4ÒXkS;ŠÝ_o·k½ÝnÐÛK=Èñ4ÅÑ{Cic/õGsô>ÿ± ‘b"E’u$«Çšq¬[lïË™O@ACÎ=*×ÒÈê~›¦‹ã~ÿóçÏ=/úrõíEñM?˜{äKn2?{Üݬ’Ø=é9ó›ÂaZ^꟱e"äžÕ3à4#.eU¢wÈ»§¿ô!/Ÿýð×ñg;hÃx‘˨OûˆeŒ¤{}uÍšFeS—ª¿Rv®þ +º®k²šÝ’¬™Šö’öJÅ#Ç’öU„~pp’FËðÑt¼ûÿO/¸‰ñâuèP“Ó¡sF§¥;ÏþçBÄ»!è>ŒpÙšoIø‰¤‹;]z1 þ.ÊR§„[Ó•wÊÄÿõJ¦ÓáB%'·xANbâF±Çr^@Nýƒ•{²…ðî- nnÓ©§t?^z gZ×Â(>é8!vïtw˜_º‰É½©Ãµ$½á¡ôñ:ˆ’QËUyúÑË‚ / ÷Y¡ybÇ¿G±{xêF]²'x8¹…'tó*°™¸êncFùLeÏÏ$¡À#·1¹1?ß)Ù`o÷z|~Òù7æŒËzË«E]•ýÔõŽWSµVSPïö_IÉ^«¤²çJî¢ÿÝŽ¾µñŸ ³¸{½;OßÓÃÿ©çmmü74Éøküÿ‡j™¾ú:¨ï’ácE—UÕòT×v<Óñ}ÿ{Ó÷×ñu ýO­½.½—gììÿ²jhŠ\éÿ ëÿ þÕÿ¿ÁñâdzËÓ釫!¢Í®®_NQç¨ß¯žöûgÓ3ôëÛé»s0ò$4ñtN3ÓûhJ—d, ñ“N P˜e~N}· IO®§¯,f²nòëÑõàè4º[€zã„ÕrFÃ{•'CÕ›Ì"âJº³Ì"Î,a–! Ò¼,lòcä8õÈœö+4a ½fkg)Ÿ½ƒùï¹½žb'é¹IÒA1Ev†÷€õà®=™×& JÜ8X¤Õ;¿áO8»šÛð¿ýkIâûÞoIÌóìŽXFï~ž—Íþ¬ç®Ð[¸„HFÌm7hî ®ê®J£E'ó©xÝee¡³(½ ‰º(Héþ¥n%Ä£žŽüÑ?f–²ÊSLe¸ä’0LØ æ7'©Ãþ_`ÏËÿù ½H3jà$.Ô¸L ×|PôÆÊ©¬É.KS¡Ž?ÅÑg¹S:Ú@2³*¢Ë°r•^Ù ¸+·aÕËÄêûòæYý¯ðÍj3-êwƒŒÛÊ ü£G’ZAåe‘BØnt´Öµ2ÎpŠ3b&lÆyï*­¨±»Œc¶oY:uש£Ý{{Q/úË0kÌ¢UëüVjüV2|;%Yσr)ö¼º #‡õRÞd×DjT­Ï «·e…àûŸ%¦y*L…{t¥ÒNe}a‹w‚…4ó4ÍÕ@·‡8Ä5}]²-Mq5Ës,GQËÅÖÜpYDéÓZ5x„íYtí…­ ‡}_5º €N_ß]Eµ*Þ³)å²­*ØÖ1¨ÚÄ·\Ç&ªbضkëyñ0VÀKu˧<ÞôJà¹ýò§fݾSÊVí2;k3Ùµ*LeXµiùĬ”õG^pZpÍé^¼­û&RÙ>ò p.©¹èFól|§rÛcõ­”Z¸Üës› uJœ-æj±²°ÄÙí¡Í5ñÙªûðßžz–]OˆöÝk#´¶ðýVºÙÈpxˆ¶å”ÃyàÄ8¾$+¢í»FH§ý›ó}÷šÆéOåûjtè×ÔÊ=ð}÷šÅb¾ï^ã!óI|ÄIŠ>‘˜2´=¥/™}E’•½ÈûþÄ|ß½B2B¶íž(ï^üÉ’·š=’ƒ.²,òÈÃ}ÍèçÙÚNñÑVíJ[Fì ?Šïpš°™èEÞß/Æ!~& öqø;üÞÀÿ˜ j3ú9`& Ùwä?Ðd!@cãRw6›u»³.û®~ºë×gÕk#T3ú9 & £¿Ï>ðݯ6®—ÿÑï‡îZÒÏ6YØ[“Oÿ>>…~¸ÉBàô?üñÇdßÕ϶ë•ïþ jññ ôsN8J?zƒNÐœÀç±óößiv-ÿœߧèá#¥¾Ö é瀜,rýcô> (§“À',hÅÛé§uüøÓZšÑÏÙq­ï8¿ƒþ£3ÌéLá³,ho§ŸÖõU "B éçà¯"†¿(“–ùŠþ$«CF«W£þЊ~´V†ôsðWÄ_ ã-£æ>£ŽÉOFß “+”_/éÏz =ÿˆªhH?1ü¥ôŒJÊ úQ…VTù¬×*Ð~þ*¢øû€¦tŠÒ_«@Cú9ø«ˆâﶧ¿Z†ôsðWÅßøz8dßÕÏá–ëµkýLj>hH?aüE—èa‘Éý>ø¸è!z@ ôp”õ|ô? ̾¡¯÷‹a'²æôsðWÅß¿ý¤ÚÏÁHÌ~ëÿ=öÛ$ÏŽÿVØ—_.¯6äËQ,ßÛÑŒ~•ƒåª –ŸF‹û˜No¡ƒÓŸA,t=˜‡#½GW8’£ÉÒÛ–Yx£‹ñh°ú9X®Šbù÷â?ËUA,?Pàê2!èÕä …Kæ ùùÐÏÁrUËÇÄ£/œÎ’¹ñ©ŒÐÊs” vÉ æÔ3LýI7Û™.ŠÙo´LÛÑÏÁrUËï"/ð—MBtŽ Zø.Hé¼è"Ž>œ¤·8es~†Ñç`~Cgý=Ê´ä?ËUA,§ß‘ôøÉâß”~–«Â¶ô¾Ž†ôs°\Är¹·Ö:••Ë>ÝwÝ-ÂbèT†°CƒÜrÜGi@WãmH?ËUQ,GÙ¼I¦”WäšvܺÐC=¡ˆàŽÄ½'󟃿ª þ*›ü>WÆ›‚ÿЙ½¥K¶6A ú5þj¢¶4* M; \¨šÓÏÁ_Më¹@mÆöˆ¹xïpJâ‡Éj,eƒ?›ÿ­4Z¯9ýüÕñWí¡)C Îæ A:–K”ö{}äŠhõ_“¹Å€nÔ½GwQJP&ViÒ˜~þj¢¶4ðXü ô¤Lˆ’ÈO?Sd(6Y—ÂPà)ÀÍ3¨K’¬ÒÏÁ_MÜ—ý]ƃ¿š þNߎ&hrùzú~0"8¿_þ2:ž¡Wàæ ®§o/ÇèŸÿLà6³V2“epqŸhøëÕx8™ HÔ¦Öqxôîê|TC5ƃ‹éh8邲z~}6ºxÓE¯®§èârŠÎGïFSH6½ì²ÚmfkJ?‡5A¾|Þ Ç§oˆÁ«Ñùhú1øõhzA™û¸;@Wƒñttz}>£«ëñÕåšZíl49=ŒÞ ÏZŒCÖqxtüEÃ_†S4y;8?¯ Ï«!0~ðê|˜Õ„æl4žNigmû‡5AY©æŸwÑäjx:¢'Ã_‡ ƒñ‡.•îÓË‹Éð?¯!ÜDgƒwƒ7 .kRÖ~ƒÃº ¯ 7tãÓëñðm­Éõ«Ét4½žÑ›ËË3Ö['Ãñ/£Óáä9:¿¤ý÷5ºž ›êq:‡uA>LŒË@8=Eåæz2bâ?º˜Çãë«éèòâgôöò=4È>cýäò‚‰UsùÑ98¬ â0Hûåøe"•tÖ»èýÛ!\ÓÎÂ3¨ O¦ãÑé´š j:½O[É¿ÎÁa]‡WbŒ.†oÎGo†§CJÙ%­ÁûÑdø3Œ5£ M0ʘý~õ½fâEû:´=mJ?‡uA®áX— Dhô Î~QÉi„!s2ʇWÖ+Nßæ¹×rüÑ98¬‹Ï)=Bçà¯.ˆ¿ëQt]„ÁÈê@ó¼Ãó`± A^¥,¢-¨}ÀvƒoE?uAüMÊHzŸ«—Î}·DCú9ø« âï)ñèêb¯²|! ÓçÙå^~ùïË£E²ôz~Lw½gŒßS-8(¬ ¢ðy´ ’£‹ˆ„è*Zº·$eµX]î-²Ëæ`—ÙS- â6ñžŽ†ôs°Øøöñ]ýfà€±±Æb…rÒØ æwqI’DqçåO?÷ˆ.'ç³³áÕð⌂äìm³:rÏØxurŠÇî lkŠ~"ň3v@ÜvŠÅËA&c2­³!™‚ &IêQï–Íèá ±ivÑóì]{“Û¶v÷¿ñ§`×MÇv÷A€nbÏuÖö;ΣvÒL綳àJcITôð#™|÷àC|‰(ÉM'•³Y-?œsppìvY(wëYãèÌÝF«Ú™Š wò Š† (šqäR#­6-) 3–|ƒ†!fù¸vïUylÄHêCƒf ý‚-4ˆûp@Üw I QÁÞÞ&ËÙv­~¹5Ò ½Ã©”Y²½Ÿ>d+žo+Z-Š,Í*Ê!»¸›Me&;î_~ÝfÒʹ5Å 3¦Îð¼ß-Ë5ÿÐZø?PÎÜiêÖ*ƒ O#ÈCƒ Éæ7HãÐA×”äÏo^Õ¥—³ÎnÊV2ÈÝÐZîºUk—¡ƒ¼ì7"Þ<ûeg¨'â¨AÒCûX6Ð/ÏÞìȇnä/µ¼‡_C?p#ß §éArÚ–yjè#7ò ²™ZÛó‡ÿËíÛ›g¯|óê?ª­p–äTu¶ÿíª5È~ŠGajìÔÁDïúÅ¿ÿü쵫t1¨j­Æ3È?¼}õ“«X1h ê¬)Üé~ýì§o\å‰AÕPkU3žîïõ‚€› ‰ Z(rÖBvÕ´Gä`¶÷ƒñìíÛWÿ^/ý8È ¢Ï ~¼}óâùÏ7j©ÇqEÍ}Íð]z·aCôC?Õ¨wLýdn·DìæöúÍú%;¥kBm-®bØG]5ñ,.ó(éÛë8ðk~ÛÝÜAŸ2l7Oƒ;%ŒÍzÀ".äă%4 F ð‹cž…T2¡Ž; oüP4]}¤Â¯&ݦ¶ÛP O|,ŽiS„ØÙ`p†4 F!LÒ€!ƒ(˜¤)öqÊiˆrBhÌäÐlØêNl\ 2|, a¢4Hãs꧀q@˜úaŠ|*R’Cž3ò:Ï4—K,a²³,`Â,À1(¦ €««¥SêsÁy¤äLô„0™)P0ÕøgLCfÍ@£‚$ eïE>§ Å à a&Q”Ãr )Òy3éAȦÁ,6¢¤!F@b€åˆƒ Ä4Žxà“(—GJQm¤@•º%K˜ãE-`âˆÁ a(E¤ü#ñK‰èþäå­¼o² Ó^@]QW§oë+½lp3“ij9›.šÈYÂ5lNVxçþ›¼t óv-ÒíÌ›.ò  èì¶6 š ¨iÝÐu‡1óã4‘Æ„Ô'1È¡ÉÊ‘šâ)ÚN©³ÌäúêvßfÛÍr»¹åÓùú¶Î{zïÊ{œÖ`À`8§œq„H£˜øIBÔ=‚4„‘Ô0qÊE«M' ÎSê63ýp²DM LpBG8‡] ]jËôƒAŸ½D@THƒ(áØ—v’Ï}L§AŒ`œ\Ó†O©3ÌäÖÇ8¦Üzi0Õ†é¡Hˆ`I  @ªBDa"µ‰”DOr8Á)™ÞHA?œvLávÜ>/вØC-€EQ†„&B#á'r¶ gMQšÓÖkKÒ)؉¦Y–°™ ÏcÇN:Èñ!ÛðÔ~„!¢ „ŒcÊq cìK30VAJ Í®käˆh)èEÓŽå‰#šú[ó#i*G4DH Æ„á4Æ"¦~Ã$ŸëàSú[Ìì$ˆ3o†Žhè¢ (å¤~ŠÃBMþCÉ b#êí”.3½hÚñ&uDsx9 ´#œí =ÐN 9–V5O‹â(bpÊ@Ó  œ å>ìf'ªÛóŠÌm:ÉLÃv½Ú;mµÔZƒ1Á@Aœ+òÒÀcùä!/()Ã(bkªÇ m…®™puUOÁëvPì Ò±+öÍišˆµðØ&ß«o\ ½×5¿°H¯Ï¶ve†(a0%\?¼ô±÷ŸÙÖKd¢:FBo{Þ.ôÝê!¯÷Å­ºãñ6Š×›îodúk7¢‡—ŒÀP,qƒh7W€! Žs®ØÕF˜ ”3Ž| YÌ© Fi„¡œ–äž4Ò«6Nå"2“´ógÚãv¹© -Kät¢D”ÁS •tÉßa²À„Ea!¤z(§BÎLÒÎÅ}r:¹0yÈaI+‹…( }šF‚ˆH9r½Nî½@¿†\7m™¦õf¾)¹®š%jƒáÌVÎÜ4L©®‘ÀÄäqè˜$6xÔa ½Jñd¨™iÒ¨7 µáÀЊ×þÃÒ”3„]ƒvص]¡ã&ëÁÍÀ4áaÈI‘&bbœ,Ï]*aw²Þoô(û‹´2àOf 1Øž÷n]Vhã¿-`EI‚ŠHNN(E1q’4‰ä0(ÎuhÐðÙ`28ÚÖ~é¼Ádi‡¾ÛjXØ í`(°½~SÇ7ñ9‡†xw0ïnµ‰²:³]À³œ±O; »ÿãH¿Áå?8ÿgØD Áõ`(¸~ß|¼1o6å˜ñ’ !”)I‰Ï|˜ "ÀxŒc¿3”§|;×ÃùáËW¯_xϽöX?·òí<²d†~0Á$Œ¸Ÿø”Å1)æ|TÁXBˆ4Þ”÷¢"ëÆ †¡øÿFãÕ­„eã;5>ÅA%p)å!#<†I R¥¬‡¬Óøõr¥{Y6t³ 3ü¡}Gês¡–â*üDœ"HÆx˜vU\Õêƒ;Ýà*ho;°+Ô UÇl*†M`hSAMóã& |hûý)o¤­ŽÒ3è¾ а  mCøs(@ƒoíGh(k%çÇaèÃÅ\þ¥Iš0‘Pı ”uøz%ûLfK‘úØvpv2€ÖN†±-&"®/çUg_ËyöÌEA,b’ @?¦aBA_ÎÖ"µÓvD–5¹XAÐpk¯Lw· á:]™¾Ÿ‰Np¼4\‘+Ómé©Xú»š Wå¡«r>5 nÍ…C·æŽßÙ —Ý¡Ën[Öm®VðöØŒûŽ ¬iÙf“œyS^®ÞªqykïÞ,CÁ¢ñ;ßã×צXú¼M ¸H¦Z{Ão÷½™JÒã§Ï¾úJŒë¯¯b“P—XEíYÂ\Vgô›I £Lç:¨mºM6(÷ÔÚ@'{Â’ ª3;[çu:v‘9†Ë¾‹Ìeµ»¨'>loµâ­¼ÎËÇëDµ;‘8ðP‚kŽ41‚{`ÔÊ~4‹p›æKÞãÎT䘰*;¸ kBä«Ù'`ëxÿÂ0£6œ}Etg>ã‘Æm¤1l"\cè€t%ÌÑ쥃¹¬ŽtÞä6,×_>¢ñtŒ§`ÐæMö@›Ëj]n°p—ù›G¼íI´g%!Ì^z{ 1Úã¿Må k õÖIeBQK& 4ƨ3vbϪæ²Ú¬Z¤2<ú‹lG´î;eO«r°ˆeµÁkŸ„5Œa3÷¡Ä(ñ˜1nôŽ;ŒñÑžöaûÞ²ñÍÓhÛæ¥çÚóe_\öQ¹§cCºX6÷˜í¹ç€ Ãý죢UºæxþæIõì0 Á0·û\lGcY½3ËæÇ™eýå#N:Nè`àTàšE±×\–_ÓÖ2~ûˆ¦yj<jó}‰±¬ýP÷nÿ·Eºçå#M:@{ 1µÕ0ÕE)ÍKR%¿96Ú^ò³v›äRohö1¥?$mé:Z»±û·Qd-kê£Îk7]SMVqŒyqÛžcÆ.”›íÌæ;'5HǽD\Œ0bmSV7;µnur²Ϭq˜²˲áîÊò´n¬Îœ ;ÌÉ* ÍÇØm.«o °÷ˆƒaËowf€·§„#ú·:ª’8H×J"™äí%ÒÁöã]àyóIŽTi’Õ) ‚´TŽYÓ6Ÿé>`,k¿ÿ{LøÀðÛÇciÔY÷Fc”¬9ˆÜž¥HÏÒyê²m6FÀ+lÍÑiöØé6 o-ü®n•tT€ j,ŸŒØ¼EËàñÛ½ÆónCU“Ž &£6nôvxô¦q·I›~m`Ÿù‘už¾S§µÚæî¶3ž–éà¶3–eµäë®ñNëîèx ñ˜µuóö@›ËÚo+ÛÅË`(ì8òÃ1+jÆó»VÔŒeí;¢`îø(\<Àµõ?Ó­%.릲:q"þµ–$>¾W u‚ÃCp°v“öy+ÓNcÔÞ·ÝÂË5ðGï0q` cYv÷ˆÂÓ®[¢ŽÂFc #ó©Õ¾XcYm¨‹± Ú䱧óÑ6ï8£p3*ÿãŸ..¼tÅîÔ²‚wqñ´ö8Éùt­ß×OÖRÎn¼4Ë6bå-Õw4Y•4çIgWAÎWÒŽk%<ýz­ î)ð=Ï?*{>[5<ï^ÌÖ›l;ۛϔþôçw+¶œxgJÜ©‘pvÿ÷ûž'øðþ‘J¡‘o«üVÌÞ‹Í4agçêázú›|ü³sm²õæ«RªÌÿý•,y‘q»’׶OV"ÉV\¿ù½|xÿÐå>ÙÑ{>Ó»Éæ‰ Ï?Lùf"¿¡ó$›e«'gñŒ%ïÎÎõéöÅ£»•ø$'¾çR~šÉºòƒïÏ\JSU•?¥Š®êQIÒOµüWô@M‚!8«\àÜ›@ùÈ$°ü!*·¤/~7Ý\lVÌ|ÆâmÄGY„ñìƒç_ⵧŽU`+YûÅ<ûÍ:ëÚ6gf™Ñ.Wï*‡ಓ%ßͲ ‡òKP~Aå\~!ú‹¨Vѵç˪D/ùĺX¾©0o²šJ›¾¿œogRÅgziôä÷í|qqÇT÷ë¾/» '¥öB’mÕ@º/ìRdËK=å›MåÈÍ¿r®ê®s]É÷E†M'ƒ_e3ÒÙ´–\2c#G£†»–96}9J2”¸y´tHØR€¸SuŽÆåLÜ©” ›j<*–/ŸëÎc³éä˜D¨µørм«u^QO‘EªsÕW-(/ì½›JvH{L É¿(eÄ‹o^¼|I¾*åJC < ¾AÏï F³ªgÉ6…PC|¡ÀŤÀ  bäïH«õ@{lìöëéâ÷VÚJj«aêµJÖ=Ç!½Ù+Ùt ¸²åY>HÙBäâ¼òL°ë÷S9†¯—‹ÁÏ ÎÉ®'Ùû\uŠ“Š•jfž³€e?¯”9¾}½'O__E7Ï^>G5ŸêO«óx¶•*Rª=¿yÖncUo­±%;µ‹ÕtŠÙP+ÄìHeý‡:ËéÜË—Å«¿.å])²Ð² ùµ]V‘Z|5•XÃ|V´§à¶™He{.@2ÏÂJ\Vþ«.=Cãݼ|w#±§·^~óòæåó]–BijñãÅÞeJ©ùU‚²!PiT‡™I¶KgJʳí&Û=W§]|X)©¯{w¡|Õ'6¼h¹Ù%4Ç#Ä_¶ÞIÙ|:ûtíͳE&¥Z"Ôî£è/øx7ž{ÐÑî>æ/áìTeoD¨æULëÖ–@W?—¬QÁ“?jBvé—2%G»³h9%N6ªà/ô,÷B×&¹KiJÉY:ëWždÇï²ß7¶²í²¨ºþ})§éº =™³Fö*sØÍÚ,Ve•&vàå{ù§Êøê…‡/ñ¿ê¬º±Jt(}~ƒ†˜£ÖÆ>®¬Ûü¯®i'Û“É&ldOµ;ÿ\À…Óÿ.ß–rXÙ[]cСðÖ‹=%¯G¼.7Wl6Xê˜"Ê«¯ÊíÕÜýbWhaœúuã´°–ô¡hª˜’k ýŸÏ(êv‡N¨†™î„€ÿÒï—/¨úW“š­á¡è©SÃú›õà9Uÿj¦^‘}gô¼tCÕ¿ :6éϧ]e{&†mß2VƒÚËäÆ@TµÍ^JΰÍdºvSÔ@•SâíZ÷vÃüo%—©j¬ô'ÕûæR]%M˜(j”;œ-¯`—gu³‡þ¹Wüw ð£ê½Žâ˜ÎÙ•E]wŠD)½æ³±sO -OÂU|ËÑ”Êa•Í>B<:—©ø¾ÿ(wh^¬eî‡þ¥œ¨>@=zÔ_Ÿ":¯cWgn4絩²=ÿ˼éoª’ŠG´¹ûm5in˜*€t:ä-ß?ÏÓåý$‡Ò¾Òr¨<²×Þt#Ç[¢ßU—~nÕ#hÇ™ó¶Õº_QP™Ÿ­É¨ë†’&XV sZÌ6üR›¯ïÄÊvó™^›z¿éP)(ÅK…Fµ`7ŠÔƒœà^A²È´–­¥HPôY)¿dƒMxÏf[ajÄÁ=„µ‘W¸ºœ‹ùlºÞì«íÅKð2,fÄ©œ1mgìùzYÍsº¿éü®•±õôÕB[Ùm æSÎgbÇù¨ØSO“j³ÿVBÃÎè% µúÔ"îï;lËÅŠìe±"ý{¿úié)Pz òÆ—o6Ê‚a7½½QëR7ªK¦¿åW.¨ ‹V4ŹÂõ ŽïS)3*UT;y¸ž‹øȇ\i¡¹Ë\¢YVq°h=Çÿ°÷¬Íi#Ë~ŽÅ,®ÚÝøò”Cœ¤N¨rl_Àɦ*U>‰X»±’°ãs¼ûÛïô<¤iô®ìÞªƒ šWOOO÷ôcfzÄP敳uÅæ¨È!Þ&G^ÃMF Þž2WOÌuwk:¦ýÕÆ€!Q&6›«’r‘ {1µóË™Bœ ùŽÁýËç¸_íe¢IVÛÂq—¿ÿ±Ã£.j‹ Ýåø¬wvzS(Ö0\ÁOpR¤nԤˢ$2„]…ݪqtP÷±4ZÞÊØÕu"dÕræ±PJ5Õ”f9{³ÝBAÑúj¢4&½fª½FD«gY+b‰^a6Ø›U`ð0mÙ•Dõ3ZéàJcëã"ü[¶ øè­Pk_ŽÌ“™$\wl `p3‡Š Ũõö ; X%{ õЄ‘샵^à<#Ë_zö–Þ°@Ðn8Õ´–Ž/¸@€E¼òE‚uJųŠêäâsR% <µ©þ¿úÜÿ}.6¸ÌÉ ðºžäˆ¨¯MLç˜ÛášÉ÷)Ðo•4> ¬5O¢¿„ŵÞ:rŽðÍ=»2Vó ÁÎQDcïH¼—}F[kÀÝÖIžšä¥å›ôEUºÁCµÆÄJ-´MG¦éX¹ñføI šÏY©Îºµ $$eº7c~°®ú!¤4b͸»€F™ÊÔk'£J ã” …Nì‰8ñZrÜ»—Ö«)kd¶ õ&[ˆyuëÎÚˆñ.bëž#¹æÁŒkMOÒXÝ¡û «SŠO#“·AZãäöA!Îtçùл­kË®^)šJbGq?'Éà_æç56ážyšˆ›Bc•»[ÞÖ–pÖÜ.ù!OÅŒË0ËÁ=ŠÒ~‡ÝJê$Xåª|åsųȶv ;® ôQ·%È_ÓýƹJÂÕ±R¤ÅnJÀ|¬ ðÅÝŠîo-j£v³Û¥ú []Ô5%§„~ÜƳB@Wɤí%-q)Û¨"MèŽÔ¼à÷ˆh§q$N AéPHã,*_ŠÈK$ž¨ ¯ÊRa²TJuùÒáUÉ–“ñ[Z¾©D!à'¢/*î}¼UiTqÊ’k`¿ðR;VK‰-î3Ùea»eñõBª¬ÎU-~åLw™\v€-12êß¾ZÙžÔ–·¶“\¯ˆQ,APZR«tŒôã{wd¦X4È0E Š42ûþ&ß´í?i¦n%×S‰dgÄ<à=Œ¨%ì²EÌ›™Ÿj¡.UUÆÌe¥Ž‰$Šx‰û[ÒÜœ¡'Öz,p”®êfÁÉèÅ¿IÄý7¨ ùÑ6[¬+Y›˜È g<߇µsþ“Šê¶Mg‘®˜¸u¹³¬‰j±§z3±q‚=¢t{Ø šCÁ'OQ H>jÃѸ-v9ì1ÓwäX•f¼ëŽ ]c];Õ€ß3ã®÷‡Ò¸¼oIÕr]»“µÅòÆÏ@ÚÆeßR°Æà Jôn{t<Œw¾ââQðN—ÀÜIBÑNR7º½àZVLß?Ôzú 3:‰m–ùé|·´M½ó L€?Uá„;£ Qx¶áÈ»œ÷ð¢¥@ ‚44ЈûƒÐ$yØíõÚ§£ÞhÄÔhXTDÈg ]Ä4}Ä“D2I•rS™”¢È'Y„t£=¦–ÍÈß­ñüy lt6Œk—ˆ«Ât0ñO÷« Ë|äÄÖ(Ù¦â #n":ü»¢€¤¶I'p¬ŠüƨjxPD ß–è™aGÜJ#…ÿ©Kl+–œ8p †gˆž‡Vãì$ƒ4˜ ej§pƒ'qÞÞg#ߢô‰5ÿÚz4&½€|±7wžöúË´p†¥A¶eâŸkÒpÀbÙ;²Mó±r‹k…$Mò/T¶xâ Ë<’­vœnÍל¤´9–ÉáŸæ°Ùlòö•¨ù¾5€ÒGäûBÕlŽ¨"Bø¾PtšðÇ¡úûÞX6ÇQû˜ì¿oûzSÚdzíû6?löô³)Ž”ç-ð¤ƒÃ­çþ†s:îW,ux[ªg'ºíÓXJ¢¯!©r°@о°#Tí¢¬ ?s™ƒ‘•Z47nݵQEŠŽ¼…Uò†0®h +_x¶µŠjoi{ÕÎùaòB£j;O«•Hó Iº¨¶ìÊ>ºtÆÝV°#âT Ë”íDpà9®@Öµ¿,šÕ´¢YÙÙáúC¹îß®»>P[7ûÍAg8æ“a‰l¿UlB2|u)f–¢øºNo÷Å 6As Ÿ +ÃÙòTé ê¨Q¸—Øn8Eqa›_ ™•¢`j²¯?muŠºöY÷li>õFgãqªqó˜™ýØ;Žµ¸ë‚+äò‘ –›0Ø"¶ëN­)n-ƒ®“Óh’=¤š}eaÞÓóA_¢p©ü¥‡¹n I"O1G³6±Ñ¥6„F«®¡–g£:²~3>îÐ —àÊ™8ïc´õÈb@­ÖHòðNÞê±:IÈ$!eBgžeà$n”ã&M$+KÉ ¥ÉNtÆGŠÕ!Á«èÛ¦«‰ÕÚÂ$³Ž%Ƹ#{*Ž/õgµ2CLþLÐÒ „§ÜÄKèi%ô´6Úi%ÚaP½¹ÅãÜ$|cñ+lÄ0}Æýwÿh_Z¼ß’õ7O¬ñè3¡¤?Œø«<¢¤Á¡D·Š¶hÇRâÎ5sp]'°á ‡gLÙ›•Kw+Ä`CÓ›±Àr´œ„ópëÞ[ÞÜ&ÛuùšÖÊØ9é1é[¿“ì™ÒH<$¤ÍvÄ°÷‰¼Wˆ›ˆ€e³ò1ÈE{9;™møÆ£?é> \h°ªYï‹ –õ ,c‡–©0YµVû¸ÝÓ»íãÂÈ\ d§I81¬‡“Ôôñ*ˆ¿ÆÈžyiÅÊ‚3Ág;5›]½ÕK–(Q"‚òŠñ~˜AêCÆ^-¬• JlôÄX±=쌀W¨RI) 0±Þú†ÖSEH|ÆZòùŠ|¾"ß½"ß½"Ÿ¥Èg)òmÂŒÒ3€ŠŒ¾²Æ{E*}EFŸgõìTq" ª>Œf¤4S+wxøPä`ÝJfSv]‘OÙs+¢8Y¡UZ©_&:Â)8—€SÆ11)RHC•3¤”µ´^EŠ›8… 8“.CÿX §€$§ÑûÄ‚/åD¼Z¨µÆ5ZTãÑdÇSêî‘ ’u·u·’u'»"4ÇNÐJb%<ô ä‰YCµ©(Y”KfVx I`ÀOŸÄ±êâtÁbúŸ@Šþ+ûšÍ[ãìAH9)@I¹cNI™ãœIIŠ‚ŠrlÐÅ O~±‘¤Ê.YŠkpÅ|WðN©ìqJm'9d Ô«0ŸÀC’¦i°Âs#BA²rCOÄÄ/ ohëÙÌUqˆ3 ÿÄ´ÔCÐÚkdÛ´2§Ôè!³ªdzdUt^& ºpXbÚIÓ6F×èˆßxwéÐR¡SÙ`´wZ¬ÅÞ@/¤j±úPcË)ü“®¶EE½™Ø>ÌV[`ŸJ¤ÑP&…gÚ+}Êa·7ô”Z„¡Â#ówÿž¼ÿE—îÉz–62Ïÿo5µNWÿßmwþ{ÿËwy½þat9œ¾#ntu}z>¢J­Ñø¤Ñ|„~}?ÿpg®¢y¸7ßpñÖJ„k›îurcÓ|Úøuµ 0û*œ`8u30á2'Òà·µ³ñß(ªiõû}Zšäµ ÿ[[ oÍúcgß½© 錮ͶV…_rõ¦~ZøN£ò­àÍõü¬Ö#×A%*ùµv=¨ Ý5ækÀ­„z&ã7ý¨ ½›å+½íÊõ„|#ñ¶R€8vÞòû®^! 0Çú-š‘Ù…ÎlÇzÝ Ù^;p¸6½ ¢ÙàŽ ˜¡ÞTˆUÿµ¬ ‚ f†u2@;ôœ!1å7ãΠOÙåX¿ý±³¼‡úo~åíëM)VÐ|Ø0¿¢/-À+\’2"÷q±ÑdoõîzÃ2©B/+3]²©È³Ö˜™ÂA™>½p ·¹°ÛhñÀ/©øÞ\ÖÃ}j@84€ti9‹ò~SiVÈofQßoÐë€Bƒ¿xüv®nwÀ ™p¢ÉcaäàM’…€^ÎJH ƒ]}F¶eˆ‰o±ò¶Yï×›Ù8™VH/yƒ/ 6þãW—‘^òkàèõn°{‹Y\£ËÝ !º­ cP"\’G€ËzϽoUÂKì0eÒ.¢×;Gx Ö–€“;ºsO¼¾ô÷íÃÞÐþ_aÍzI/´ÃUuþˆaÔ—*º©ÄØ`Š‚^KuŒŒÀ ÀÌo· v^Vm¼ÇËöájÁžÌ2t0½ÕU½nì:˜|Te|k¾µ’WCBûxŽKÁÕWÇ]Ž\Ë;ú¬HÄþµbØ!H§”Ê‚ RÙ#Ë©pc{7f»½„uA±°ÖòxÕiö{mmÙÞBÓ¸öféìL+„°L}³×ë,MM?î5»øÕ7V+ýX34³Óéi­Ut'é^Õ›}€¼Õ×5£ß1t½g­zËEßÒµn¿¿ìwXõ˜WZ¸Â[á8N^÷ ùû±Vé´¯„´%=&ܱ»n“> e­?а9ZE¼=~¼,Ô*ÝfÙc=zçb8aiì(wE™;mtV¨•e/ßê «g‚a*Œ²„¬P‚$üTÈ·q+o>[ŒjÛM^7ªªTË©T“*%Ó@ÌÊNñ¬¼mýOí©¯££pÞ‚]Ï]—¢„›°…£#¤~…yžÛ ´³ÔWYØÛ9°·‹ÃþÝñÞɽóT¼G¬¡-(Ÿ ñÝà»ÿ`ÄçÀ~ü$ÄŸÁF*Ä®Âk½ãFKkhXs}¼÷r`ïýƒñÞϽ_öR-¶šÙ-¶šÏÞbŽtiµŠŒÏÑs¾ÊÁŸ#ÈZZ!øQ¤ÊFKed`%Ž*6zâãÖun-N’†X Ÿˆ}Ãùÿÿjaùï:-Ž0kf#þsZ«@#l©zssS­ÞTɧø®ÆŸßˆÏ ªü9B­UH¨øä?ò;ñ<üŸÕXJŸ#×Z…äÚÑÞàÃß—§ÀŸ#ÛZ…d†ÿñ¯¿þzü‹~ŠoÕsá³qƒ{ñå ðçÈ·V!ùð£wèqøˆ®ð·7ø}ŽÈ÷7ä×>cï7üsˆ¿ôÒ”„?GƵŠÈ8 ÿ=:ÈepZøípX 5üÐÇ/‡±”ƒ_Ë‘˜Z‰Iá8g€ß;ëF ?ôõ‘t@ ¡’ðçÈ_­˜üE”Z6ü>í…Õ”àÇ(‚Å:Pþù«”¿Ž÷š ¡ ßBWˆ=á§3¾AbJŸ#µbòà™„qø‘+ÞñO©%áÏ‘¿ZQùûˆæ 8‹Â/u $ü9òW+*ÑxøÅ”„?GþjEåï#þx<"ŸâûHñ\zÖ Tóåˆw $ü9òW+,Ñ%zÜRºßà÷ ¿—èÑ}D[ôX£¼ÞÆïzô‘A>ñ\op¶CYyøsä¯VTþþx¨÷O°ŽHÿË¿Òþ—)“ñ+’}ìqø´$.rd¹VT–?Û«üzŽ,× Êò¡»} '9þ<| ;izèzcGð€® Ïök³‰u[¢áM.¦“Á³ÀŸ#Ëõ¢²üïÂŽ,× ÊòŸõ~ºó-t:!Ç^ZßzùàÏ‘åzAY>µLn—Zìˆh:co AäÑÂÞ€eì~ÝÛÁ-r=òßÝûÁŸ#Ëõ‚²|íšpŒ±A÷Úñ–[Ë[Û8E·ž{g›ÜÏhÄg±rǽ‡ &KwcÚôRŸýàÏ‘åzAY¯­àÕ“É¿,ü9²\/¬K?׫$ü9²\/(Ë[õØðÁ•ÅhŸœ¥¼Þù¿Àq¨@CÆ"–!ßݸ W!—„?G–ëEe9¢~7²ÝC.Ð5L\™èq?qöÚòêOÆŽüÕ Ê_-‰ŒgßpüãÉlî––rö€¿#ÛEuiÀ>ã€Q•‡?Gþ¶‹Ë_Ù‘‹¡m`ÞîïÚ,Ø„êG¼”0âÿ­^þùÛ.(õ:šc`Ⱦ.⃶`ò­ °?У…E4\¤q=,ÝÀ¼í¹k¸l’Uà—†?Gþ¶‹êÒÿÅw@¸.—‘ﮂ{ \†§õo=¯nCEïÓ( Žüm·eÿ-ü¿#Ûåïüýd†f—góOƒéáïWÓË“Ñx„N?ãÄ1\Ïß_NÑ¿þ5˜ád¢­P•ep1ÂïÏhüëÕt<›!œiŸ~äÈávA9<ùpu>ÁPãnLóÉxVÅ‹ýáùõhrñ®ŠN¯çèârŽÎ'&sœm~Y%½K+ Žn”×gèÃx:|œNÎ'óÏÁg“ù ÷ cw€®Óùdx}>˜¢«ëéÕå µÑd6<L>ŒG{ð¡9Ü.(‡'¿hüq|1G³÷ƒós‘xNÇñƒÓó1í&šÑd:Îaˆø·}çAŽn”ØV0ÕcäŸWÑìj<œÀ—ñ¯cLƒéç*P÷ðòb6þßkœ '¢ÑàÃà&—ŸcTVþNŽî”ÃqâÆÓxx=€ñÀ´5»>Í'óëù½»¼‘Ù:O?N†ãÙ :¿„ù{†®gã²ë¸NŽî”ãÁ|@°ŒÇDº¹žMùO.æãéôúj>¹¼x‰Þ_~„†d€‘yryAȪ<ýträp§ ÆÔ~9ý HJ'¸Š>½ãçS˜˜xæÓúl> çb6ÜÓùåt¾ýwräp§ ŽÈ]ŒßOÞ/†c€ìzði2¿Ä¼f2ƒ ŠìOÜßkB^0×ñXÀײðçÈáNA9,ɱ*aDhr†£ #f™³ c¯dV ß³‰\ß“ÿträp§¸OùoYGträo§ üGÑU‘uP‡WžkccowänÌ0'¶ýÀ4c?øsäo§ üõÃH:úÄ–—‹‡}Ì%áÏ‘¿‚òwh™^ŸÒ­=à„>®³Ç¿ìj[gÖWÞ_ƒ‚øgêEŽî”ÂçîÎök®å +8ÿÅ H/¢Çõ-}ü‹½ÁzïÈ3õ¢›#‹»Åuâgz•„?Gw¿|W£\r„q7&Œ‹Uš#!»ú>•æˆ­n†ØÚcÎÒò}׫¼=´WÓZ¡ËÙùÍø×ùéåèóÍûrXËAÝ $Û̀ÎùÁU?܉ÓÍ8jp‹5›#(º‚"Ž¶1ƒð&?0m·~ |¨<9Œ¿›Áø³à‰vl€õ¶"ìaèö¢M °]m¾ú°AÂx[ø~ßÍà÷ÿÇÞµ÷¶+ûý»Ÿ‚'mnb‹z«/7q[¤I®íl·@=¨Ö»ŽåÚòvƒ“ÝÏ~‡¤$K²-’Šû¸ÀQ ØÖƒšÎÌoH‘ÃvÄ›f‰x–+,öéÄÞVä;Gï48úväëeÙç3SÚP.pñN› "ŽÀí: m  qÄ™‡ˆ]_‡óéjI÷ÇjL <¶ÓЦ;´ßÉí—dñÉI‹YvIuÊ ·Žé.ð¡Ò~þ¼J –âj¬p©âBÿ‘,WàóiŸÿö Ob5®.Üù:.ܸpÇi£ü?ì(øá6^ 9>æÁWŸl²K]8]GÚé*=Ö8KWk!u·I×n”ÝYr£š“¹Qú\‹Ï)ÜÅraç¼i‡r¦wúè¢pðÑ×Y5ÑGÈÚ¤ÛdBžúQŒ=ËÒ¼>ì´= 82u¬Ûqä[ô…åÚÞà¡žôO”¡ë9cI(rrÉÖy“ùJÈÇÐ#[‹LÛDZf¸q€Ø²]M'®®–ÉÇÙ&Ÿ-zAgóÓ)¶ib‘ˆ)˜×~HÍŒÉU'7ˆ¦É IˆÆÅD#¾§™A†Û±iPo±ãûndiÛV4‡2ÂÓ@Ó“¤¹`¤EÓäõdDãø¯{¶EØÀ†ÆaLSÓc϶ #ÓïëŠFHÔÌ>¦Ÿ ÙȉÆxf¯ê™ÿ’´S¯)ÆÜ-ñlŠôCË0ˆqdü†eÛ±oÅŽƒõ0æ÷°¤÷¦\ݦíÏÅW7µ®S'è5ÅÚÂ¥þF Iè4üc⚦¡ÇCºë¡Ç…«ÿ€Â= Wɲøç*âojZHˆß°IX±–ë’? ©ËwÂü¿ñC‰?LfËTB·˜¤`Ŷ³¦F‘D%¸Ñ!Ñ<ß#‘ç;¡mkºmë¾eYAhd6`þP•ÛÀöâ™,ň‚ÊÂkJÉLÚ…çkú\ˉеCƒD®i{Ž8²m/ LÇ‹y ÉðßÒL¼”˜ÉM3Qª„v퉂>l¹Zdø–gcì9¡iFèaÛ…hÌòžy%l¶'~„JØ™ˆ%°YC-ŒEÐ-áµé–ðÝžÛ¦PA‚'óš®{ø?{|A¤Òµæ€Îßó]‘ Or‰âÕŒ/Gµ}S¤¿¹÷ÎÿØ/è° •œzÞ‚¢ÙLsC®o2¢XÄtuºq=“h–ëdž‡Íȱ ç_Æ¿I´ºaýèÕà¬P%|<’jé=–³1,ÈX翈ÂÈ"žëAË;0Ëu,W×,bÐ>Š_B³„¤yoîí†ó’¼ÓL—ë¶2ïÄ·õ ðI…¶§¹†£A4kÚ¦‹íPóã°Êû’%fܷ㺹/Ϋ»j,ÈaçÛÚŒTp^ÊÿïsSs?Í ç÷1@c˜­Á#pýmü3þÂùÜÿ ráZ΢Š9©p[îbOwÁÙûv£ûNì:ŽiÕüûr5ÆìWңʚ¶ c®gL’+T¢õ4Fr… `G*·Ðw í¹…°Bn¡úö–Ü$téèé4áó$»YÿØiæŠô @@2·Ð>7EÓN-¹PkÓömx¶ë˜~¤“0Â61‚0$ºuZÓAÕ´oXE1Û–¶YÈ5e’Àd8µ]#¢˜„4|ì{„„ØÆå¹TÝéà2§ñ‚ö1ˆ 5®§&’+TWõ|AR… ’ø`©$>ßÑQ ’ø`é$>»·Kþ¦¾ƒ,.W¤_€>’I|ö¹©9*A\ËâÓÚQ…ží˜nèáØsõl]K3#ƒ˜Fx¸ÖÇ:Mf÷°_AjÜ”Úg׫ÉvNË-76ÁMƒ“¶<ßu‰kAËÉŽb/²él2äóÊŸnr}$É´3kù€šLfskW ¬gøÙ)O¬•:8‹áŠÙà éÊð±m;•DÃÑ hÌ›±ú‘íPzQ­[ëìÝPyèxy¨‡ù ¢Ò ò'ùøö/¶+ËK1à¾2Ø^î)ʵÄËx!÷±¿]öá¤xãWrÃÙ;¼­%µ¬ÁêB^óEÞø'ùˆ É‚:HÖ_1ç 6ß@±Å£Yäk°ÅÈ¥º;Dµû÷Xcz¥Æô’§ò’lèî–&( Ú¸¥ŸT£Òöâuêâ5hc=oøÄÀ ­¯ø}¹¼|ïùî½…Ç9ÜåxŠb÷¨ÌvE™í·/å…ݲ­º[ÈÕVóÆ;šë®]ÖcÝm#Zq£¼hÛöW¶‘-¿ûÑ^åiVåi¶‘§øu»‚µ{u¿[œ´Ý‰6îÙõª¼ô>ÅË"ɵxUâHÍɤ+žh!”®Â¤’<ž<ÉÇ]5+k¦©üâýùP·âC[ºxž¼b¶Îת¶ Ô~ñɪà“ÕB-Å“]äÕR\VE-+³hš#®Ò¥{ÔL§¢™NvÝ)@PûnÀfÃ.uL¢­EìŠ Û¨„¨¶B£mݾTSh´zA§€Dô–¯*Ñ$%h·ÍV.žš$oåâ²*V¾žóÔlâ‡(¿rîU,¼McIÕ‘Žn-©£†[Uü@^¨­^((X7ÜQoÞƒºî=Ä4ܪÛtÜæÚÌ…“3Ì\XVÅÌ‹YŸ"+Ï.Ü£‘»#wÛè£p$©‚>¶•º[nÜŠÑæm_t°Yið`SÁuêÒ=çEº”uªI…×e±13þ^ïô-Úgåä?qâïuÛF8ÇK¡mÓv¾˜Zçñºîkv½™•¦zÐ#ïë6æ'íÕ;Ušh­TD<Æ_¡ ±Õ|¸ÜÝ+³Wÿd8ÿdli¼ñtÉñ|anºîxép¾ 8_ŽœaØ„â$†šÓïìÔ§EN0?uÐéFÑÚ£µ/ž-iïÞ‹¯ÉŒ,|ºInæ~: ¦årýçÞú>Öì#E’EéºS ð€ÝNÒ)y±^4Þ»ì|B#¾HÔ«É”<ëò‹<›Nf¿gAJêËN¸\ ™ÒœŠ·S²üDHz€è`ËŒ5z}Ê2\LæiùÌoþ>?š.¿}^‘Åmç·%wÆÎÈÝÝΖ„£¯ß]¢7‹¤HF,VÊê2 ŠhüJcô4™ð@2JØ< rClbkÛÀEGh’¢ º0„wÙ£ÿÁ£Ê¢*SA|ª6 Í)A!™N—s?œÌ>>?ÐØï9„gÙïг”S_ˆ1*Iè2QOeÏÿ|J/‚“Q~2»ýxJb¸DëXä†_ƒ Bæ‹ä7o>äŠ@¯(?,_¸º hÌ«u¼N>2”Èpú%(‰ÝtÁ?ò°’q™‡è<ô&³Q9WozbIƒ+jË®)Ñ?óÿX$_ðAѺÍä,¢g}¯ÒÕ«²pj:Y·•Ê¡5ã÷Å[2ãü_úI1’66àÆme0ÃÊ£ÖS*è¼8,Sˆ?¢\WÊ8õSŸS¤0h(­ºZ,ØТôŒ¹J5ïíE=뮦¼2óZ­Ê[¯È[WøvJ8g“" H£¬>N“ÀŸVKyÍÉpTæç<꧂!8À~³‹é=%¡Â92%7¥ô'dšx&‹ëÈ4CÛ´,/H@B'¶4Ï5õÐt£À t£tÈ ª<‹\× #Ýp\͆ÍóãØpt_,h×ãxÝ»QŸs¿ÙHw¶öKÙã¸Aµ^9ÌüÖA­ƒË°ƒ—¾tñ0^@ýiy{œ–Ynþ[8cäuB™`«²Usc+¢§¥ÊÔa¬–JÍÿÕ^’-iSi;j“tYJ¡êÐr¦ž»æÂßwS›§ r\ $µè ÝwM„«¯'²{¢*í‚ŒÌHj¢1ð7—» ë3’šdÜ$wš{FÔ[vó0o_räŒFR Í|'¹ 2?¶d+R]5G9IeÎøžòšB挣ëë룣ë#ö¿¼Õ_—mx(5ú &™9ƒ>¸Ëvøß­îÇ‹_ôÿÝQEúÀ†¥WoG>ýûpúàÖ”/£BÿÝßÿ}÷7ÿ_Þ·/ýï^îA¿àê©/vÓ^£»“;t ßžÃ~†Ø÷çì× ?–íÏóÿ'èRŠô @®že£þ!º›Þ¡$£“À>Íiõ·ÓOyüð°Æ€ý‚„H*¡§¿Çèœft¦°¯rZgÛ駼Þ1J*¤H¿¥z0m™­é_r8­Q…~øCkúQEúø+™ÐƒÒÿ†QsË©cúÃé{Îô eÇ ú¹ÅÐïP™Eúø«Ë®$~‡e9ý¨D+*íõÿéàoSêŽýã :eé¯0 H¿uYü½Cýöô—P¤_€¿õœ ô¢»Cö¿¼n9^9ÖåZóá0g@‘~þ6%à¨Ñîæ\ïg°`Ñ]r‡æèî˜ûú ìº[Ü!Ÿý[ïæn‡™:ýü­'ÀØI?[V‰ü³úkקÊ= ¿ÖØ—.Ž*ÊB€åMy;~„Dy>PSžÊj´ÉüvAß9¡G'!Ð\t5›°Žô]ú‹Éòx´Š mËZxƒóá ·úXÞ”-䇿˛òTVó6ŽáèjIÐËÑ)šNB2[’Ç߀~–7%.)Ó?$Ñ„&ÍV¬Ÿêef2C|@b‡‚ÉŒö Óþåú2I?¡dÁ>“UÚŽ~–’X~“D“xÂL!AÐœ,nèªÒš/’?&|I?ù){g'Óiò…¦{ “Y4©ä{S¤_€å†$–SŠoHÚfùëûéË é¶ô¾6EúXnHb9îÔL`I_eeºO3h¡›Õ’Ž+H}° ªC~@G„…ß%)Xý‘*ý,7ä,³÷nôõ.¥¼¤×Ôp«J|B“²èÜ[þü5$ñWß”?ȹäorùƒ1G«l­‚ô›ü5å8È M= L©Ôéà¯)¿Õ¹@m|{ºxoü”,&þt¹ö¥Ìù³÷¿¥Jë¨Ó/À_S1´`þ´c°Di¿eC‚B-¢ý×d% @7Ú½½Hn’” ®VéR™~þš²mi?ˆø 0’¸-“8ýB‘!GØ圄æ€Ü Þ¸‡ºå’W€"ýü5Ûgþ&þßà¯)‰¿ã7ƒ]¼¿ë û¾_/~œöOÑË÷p²zWã7Côï÷FpšµVx“¥w~ û{ÔÿõrØ\Ô†›’8B/¯ÆèübŒÎoc¸l|qĸۼM•~›’8|ñ ½íOÞ½—ƒ³Áø=ð«Áøœ ÷H·‡.{Ãñàäê¬7D—WÃË‹TÔÚé`trּퟶðC6%qxpòEý_úçc4zÓ;;++ÏË>¾÷ò¬Ïù¥9 û'cZEù·¶v ÀaS‡AW@ëAøgGhtÙ?Ð/ý_û ½áû#ªÝ'ç£þÿ^ÁEpöÞö^ƒº<ªi™"ý–‡-I®+7˜ñÉÕ°ÿ–ÖèÖèêåh<_ûèõÅÅ)³ÖQøËà¤?zŠÎ.¨ý¾BW£¾jg pØ’ÄáÓ޸Ǥ „ƒÒQTo®F¦þƒóq8¼º.Σ7ï@Ñ Bz@ð)³“‹s¦Vêúc pØ’ÄaÐö‹á{*Dªé̀л7}8>¤ÆÊ3ö¨¢ÆÃÁɸ|p:¾Ž[é¿%ÀaK‡×jŒÎû¯Ï¯ûç'}JÙåàÝ`Ô ¾f0¢ ¸°ßõ€ß+¦^ÔÖ¡.èWUú8lIâpÇŽ˜#BƒW¨wúË€êHF#¸ÌÑ s¯Ì*NÞd†Üié,[òKa ð×’Äßú(º#äC[€¨ƒÈóÆŸMæ«)„Óë+óÑ´}ù©ßŽ~þZ’ø»,F‚tл,¼ nÛtK(Ò/À_KOH´€øø%ŸpÃùyš>å‡;ÙᮎçËUÔ‰?LŸ2Áï‰  [’(|–¬&Ëãó„LÑe² ?‘”q±>Ü™óÃÿœÌ ]–3²'.lÛ÷]ôï+ë’-Àbû_ôO³`l·X¯H³im À–Ý[µ¼Ù“x‘˜eÄ>ï½í®ß¨ÉL@vmÏ°Ý@k9}w+bhc7 Mû,çš- »$6’ÜóÉÌ/-Óh’t>Q¤FÀéÛ N¿‰žg;×>(„'Ëi·’$\x¯·[¬Õ£9×ëH§ýßË2š#p¥ŽôbÛ¬ªXf˜‚_̲Kª³.x%M'põöóçUpÎ?ÔX8U§>ýã?’å üª#¿t€úz š#pÀŽ´V{¬ÀÛ:-VàÔÜ&e{¶sùmœÏß‚çºY ´],+¯›]Nó§° ,_‡¤n¸M:'äè¡O ߉-ÇÂZì`“¦®Ò#'04{!1ó¬oðÜ´ü‹ŽKe.0[&G(Šæþøse’zŠ$%ÕdE’2ýÀ´p„8&|: ݸ]©-Ì%e|CI‰)b>-MrAÉJªÉâ%$e¸~Œm*2t¢»8|3Óæ£[Õ¨¤Ìo()1EËÐOÓëhr£¦SMNJBR8&†îºPi†«ëºÛs°ç‰\RÖ7””˜"ºÈæT]RMñ¨Œõ–©†gꚇ½(#Û´­ÐÕ|kZsIÙßÒú„ù‹…››’¶>AíVCè¿d¡¯)Þ]Ùt܇>xdÓ1Ü8ŽC'Ò(ÔM ~[!6\âz™ûs%Á‘f^€Ðqk<¶/mªúÍ[ø¢8²ÂlŠÌ%„‰ÑLÏ·|W#.vH¤Û¾n™¡¥YaL¨Paz?0„©ÀÖZÜsq{‚6‹§µˆ=AÃÃk3Ü4<™—ßo%T¶S#ýòƒ ¶oÅ<@:ªc>õoEK²+Ò/h¬xr/9ö¹©uÌy‚f×ÐÉ$\ºQ„‰cDÞÿ±÷¬1’ee9@`™°¨ j‚ü¨ô’8»ÎÌž÷cØ™ìÂ>˜°.Ë,ÍBÚóœîlwW[]3»+ š$jô'j¢&„ˆ`Tü©â4nÔ¸!’€j¢`Lüaôœ{ëqoUuŸ{êÞê®iê&ÓÓ]uÏ9ßû|çœï|ŸCI®,ƒ‚ªv’!ãò²ªÂ“Bµ#õî´"cQ›çD²œ°ÕY ƒå57^{Ï„QhL©vcNªd9‰*ñM8’/cœ›ar‰²–@&6©d“‰‡;Õ¸…ƒ QtrqË)[­ý|Ò»™ð'Ši‚5?Š€‰¤)áû|©„‰l&áûe:MtM&—3,sžH5¾_ZÔÌí÷/÷ŠZWEtçÃÖMÿ8Vì3áOTrÍNл|2E=Q—Ô­zeÞh2Gaf)‡ˆ0$¤@Z5ÊBWç¨iM³ÆE¥IGÂ÷ËOÁ ° + (u@ h#ïq;Ð#Ä RÊ­b7.ër)æ…‰ü$áû%,G" œMAÒ¬Ó„åo”dä ÍQ"Élšdä„çÙòð¡:óðz&ü‰9æ ’Œä™£D–8“e$ÓM˜ÁšzK´gaˆõ„Yá,óÀTvR½rM$3ÉF2Ñ*±±'š3ë=×ÚsëøTÑå^-19ÞÆœ¯cøPûúöËtײ‰ w& ÊIšØëuŒÁÙ$1ÏäU9M‚4Ö–Ä4>›Z¥Y§‰Is6ßI£NIHàIIHV©IEàIIE„÷zm8rb¦<)Hë˜HæOJæ±|Läà€'åà˜AºÀy²õ}Œ´ âª7P—AªVà…5.”4‰ ªEò©&F¡pRV=å.'áhåzÀ­1SDfÚ 6ë/nÙ p s…cbDNÑo,Ã3ÊÓ#ظ¬Õ‚CÄã Ð ¶ ¬¬Ã5‘Q„â‘<¤c’˜fÄLøyíZ-áx©¨Áö*–8OE<ÉU|-§àÞ„†é³ñæ4L÷U¡aýȽ)«­:¤"­P1£ÀÕÄ2¥êæ–iYçüdŽWómG56GE!óÿèÒ¸¡¸66nd”Úž…dC†QHöUèidDSa·èPYEó©×œ63Géâ+8dL eLŸk5WÆeÎÈ» s•æVá.Ä´]we”ŸhT:Ь¹F¥ûªhT=~­©VU[u(•¤"•µ'TL‡€6§bº¯ ë‘¥M©XmÕ!Q…Š®ëD·ÓpÍu{©Í¼ÜY¶h¸ªµŠyÐ&ÓeLz–MÐôKs‚.wX“KѲå¥N$­ÐÒeè˜kNÇì³ãIX©~[¼?ªÂ¯…Õ× 0žßýPÑnÚ(ü>¼Ú+¦‡8óL7ŽzjØ‹!C½f3Ïä\°<Œ¸E§©aëú¼uµœ­Ê9ó&sJpo+Y±G<œ ¨ÌN¨b °æÇùª*#MÞšû4¸óÃþÔ=›UËõÀÅI¨báÌO#kr_¾,çCñºv-š³b)0nôð´“™ÕÀ l¶o"À‡7+Ä0°a< UØ~ÔÇEà¸èˆãœ‰U,_Ží‹ÎB‚%©:dÛaõ÷îUŒvmÜ Šq.•NÊS•ìn0¬Ãâ~:X‚% ‰i+Ýá^Ù½Èk½ÜvÃíbÕ¶S™oï.A¦âRy¥Ër£:¿˜¿ÒÍôÄ%¯ÓsWú9: &o¸D?3"t4¶fÜM´›ÀêöÇgžecy¯®Ž³\ ¦Ò³³\Ñy¨n»FNBçæ«<ŸèÌpÉ`¸äÆp­±áÂò$ÃÅacºÖÛt5XÒž©ÓU·[“ÅzKÓõL±Í[Ø®nMV˜ÈËÃÙÉZS“Õ½¯µ±‚÷Ü<\ìÔ‹5ÅÈ„²bP¹IübX›ßžÒŒ U+OEÕ¾öHÜm«gëx¹¡^n¦¯Q”†ÜDiœÞS‹ÿ8Pw·w"eºãäø¨Ù¨ÿbüdxÿqÏ'ž}æ©û/¾5Êòý7ßýø­ðÿ…ðïM÷½&ü¼üÍGã;Þ|ü±÷¿táßÿ᱋ßóè}ï|ßç_û†/|êk¿þêïüò?ýì7ì=ø¯ÿÛû¦ú‹ùú/üeÿu¿xkïÕŒ­n>ñÌã¿ÿΟúØ™¡¶y<óñ_ô”ã¿„oâ¿ÎèÙÄ^ü—é÷v÷ ¸?› °MØ&l¶ û. ;ÙüŸR$&õý€ P÷j8Ê,D:D\8Í-…^ N— S*Ch: ¡£š4¼‘0hrQo©Ä8"Xi¤Ú¯ Jb6ˆ[µQwc§ûêÛÅÆV#Jçb߆҂ZÇAøA@„jì1UÚ:Dµå¶H2¼>”N[P:ø 蜋{»Ø»ÀUÉŒ·ž+íTÄJ,ÀZÑ9 lÀÿÎþA†LçâßÊzHœDØ朑ˆ3 Âï)B™¶ËÅ9®Ìz$Ѻ©Tçb߆ÒáX‡q¸PÞR@¶Æp,}~½¤: l\64“ç\Ìï•pÒŠ¶8¦´êYN£G‡ýâÄÈ„—Ž½9ì…%çÝ][ÄŸ–uŒ‹“gÝ¿3,Ú?÷®þ³½I¢éQŒj?Ip¯W:“å9ó¥âg¤ÐåòÈh‚ÓÃ…_ãDpôp©:Gñz²œ~í¹»nïÁåÁë.í$‡R™;)yžtˆWgÚÀœ}ÈC…×®U ^Ëȇ'Ji({‡7R6€žŠKgϲ%èR"šÇF`|lXCUµÅ6Ì÷…œï«Q€Ã|_E¤îl_ÎýàHÐ|_Íÿç;ƒ”ÎwV8éè~t`t•P€¼ØˤµžÚUdoE…íÎi‹õâ$ܨóF»WçÛJk¦ÎÓ]³nÜíB+Ssw³póË]µÝ¨m–Ú6Øu_Gµíد^ê6¿+°QÝêf©nƒ£É3¾8¯¼å¹kKµ}r¼ Ú»´¯^îå‹àýøÕ¡îÄ‹÷/º½.w<›_ªÿ.VeÄÀÕäÏÆ*äZ…S½å’éÍU—ÍU—ͳà©Åÿûá]tixз®»{@©û?˜Ð™û?Œq°‰ÿ?gÁýŸï ÿ~ð¾×‡Ÿ¯|öm ÿ}ntÿç7¯¿ùÂûÞòä÷þêW_ÿéÇïï_øÒ›ßríOþî³ïùêÏ_¿ï~æ+_¸ÿ+â¹w¿ôŸ~I ßù䇿ý§_ü³_{ûÿüïÞá“Ï^ü­ÿþ“ŸøÜ{èk–}ëß.|û?¶þà­ôÜÿá{àÓïü¹K¿ý÷½ö›~êGò—>þÆ/ö¯o½òê _wß+Gß——¾õÚ_øçïÿO¿ð±+þÕg®|ýíßy“~ã—Ÿßq÷ñ=‡WþëÍoÛ{ÍGÞõ??ü¾áÖS?ò+ƒ¿ý¼ŠÈm® %ŸšþÛÝÁ¶%Ä0B©ÔÚig¸§@ ‚ V ð¶u‡W÷-Í#¥ÿ€€úý„ Þèÿ©< (Ö"/œ3L9ì4%Ž[+Œ×g ßæYí3wÿO‚ài;#¡ÿAñÑÌý?Â!Ûèÿi,Ê€·w»½»n¸kÔÖåøáÑîÏ„!غ¼§´Û[øÞä›ÉËzGè9º–z>ÚQ‡îúÀ™°”+Z>ZÂÞóE¿×§ð^.ïf]WÑåwíp'üF.›þ^p}Kï)óÂÖ希Ü}t{à^ætëòøöVüÊÙ­^½Öj2(ê]¹1=L‘áû¢ÓÑËV ^èÌήÅs(”#Xu´F¸<‚<®1‡®¨ŠÚ»¼ˆ•kØNšå¢üâÎîÐÍa|ùÇo=}}ëíE–P.&çQFÝ |à^Jb‹;S™XA6=j•Æ·WlTlת:§3ä3tžàŒOΤã1Ý^ƒ!yôe3ô¥c\I7¸î§0¥5LwW¡¬@Î I:F2Kˆ:RVÛßW»<( 湘C'ë‚Iàtzà*‹‹ÝË]³6‹6ó1¬„ƒpºWÆ¥æ³2=jÖ½úÎNC”ùéI6ë˜ÌMÆ„{MÆä9p·Ãœ9x¹±åèhÜb?ƒ­ ;­IùÁƒ¦ã£kº…>·þ£âtó¿ÄR«”ÍælÖ§ñlò¿œNþ—±Ï{u§Wl¿l¿l¿œFâ—n¢Œ1žO#³>‰_CRâøthÕ„V·÷úZíÕ{yªü¬Q6– >WbÄÓ¡ðAñwñò(®£òÛsÇÜnr85ws50gi… Æ"Ì`á‘Ê{Ì‘B–R  VB“îÇØwž‰æÀi½R¼áÆÉhªRªnD;‚È;*¢µµÎ_)Sµ„Vï/?8æõ˜gúî“ã|Àm‰àPê`á0¢Ê…’h)ÉY WVã›&ÑŸñgœ²u lÄÑ\*·ò>´1Â`w$tDCò3‚1U–/·Ópïp4~ Y†6p2éÛŠ—^{}”…ž0Š£ ІcKÌyçeý: GSnŽ6›:x™tnÅSÉvB l$>¬@ gÜE4Ô.·à»‡xšDOë[Й¼Í¤w«Å<¶ŠFX˜¼T–Ê°t°S¢¸Qö¼Ï¦iôëk9um°ŽÏ¤p« Y넧SŒPZÇ]B«¼GÔ3–;Þ¹w¸™Fž› µÁöi&¥[é(r1žS`¸äÁäK¡°: « “Ë­•î®¦Ñ¯R¦„+ù9^Â4´¼¹”nU(xaÑ8˜µHB¨Vh&Œ§Õ¹÷”Òè×YÄÔ4?siÜjG#¸_ɘ;åŒvTz fÂåçV·£‘„¶Fþ˜ýq{÷àh·Œ?³sŽ\"·a¨ À³È ætá?©q„/áz14 íCÏ”“¹ÔmejC¯L"†ˆ‚Äa籂Æó`ì¶Áµ^‡boSضFî½múû‡ýƒxà4âœXÝLr·a- ð"‹‘Äœ`b¨&„y ,(È?ïë—4úua)² ¯ô£Ñ¼œËµ6™a±`çˆs 5 ÀRb8ÐJxÄÝ9—4ú5@  rÒ?8ÔîjmJCiÉå`Ki¡wߦ-Œ¡˜X†¶š()— U¹§¤%þ¼´œ©‘˯V'ON3M“”CÌ´N<çÌ«—t#V榡­Ñ[Y»Jïáìâhr¹ÖNB$¢jál܉÷T[Á%¥„ÇË·à¼Ï5iôk€Ü9XmhþŠ\ž´¹0UN''A‹ÀÒhB-5ºfF) íÌYçáž2nû®3:g"*œAŒQ¨1¥;í°öˆ5Ø{#GV%¤YîM.ÛH‹Îy +0` ÅV¢ÆzIKÚúݼƒ#7žoaÉe`«Ó$O¥Õ‚J­0STp `pýñWtîÏÓè×}áþQ÷ªô58ðʆV[éÒÉ@C„&Ð`œ@ëÄxÝí4´‹¬”ÞS/lú/žýú:—Ü­öë(´2Z C‚ÐÆHSæØ[$Ö‹µihgmYçûì¹›KñVG&á¡GZIË9ÒPE Ä–[eÌr3ÆêŽL’ÐήïQëÞ4™@&÷ZIŠš#¤$1B) ^ „±$Ò™5»:˜†¶XrGŸsIÉä^«èC âÆsc£5ÆÄ[É¥Æö¼ïȦџ9×íï7’½•:‹¹îâ‹ÿgïÊzG’ôûü Âûâêu{y…A t÷nck«}ì<,vd2i-‘’²Ëýë7"“÷!’%Q ´-‘y3ã‹Èˆ/4Ê×>ÜÚ† A†èeئôaèÑwasÐLbZ®Ì¨ï˦nè²âfã[û¡ÇãMê`k»&u)–†©c}ÐfljLˆJ\Ù—UøçÚ”™Š©j¶N”=mÓÇÛŒ[Û-Àq^¯WxOÃCÖ‹¢û¦nɪk2ŸR•9 UuË14ÙÖ¡úýH)/G‹î~×YÆE#Èáõ7uM¤pP_1]OSˆ®™ŽîÉ®L KvmC¶\ÍßOK=– òpcëÃM`³bÿØ’Õ5®’©3wÈ*Q¡hÓ‘mÍó‰©(†eÆT×RuU×A½YÔ*nlóZÈÔI;Œkà²áù¾e€Fdzº¡h6“™K‰ë¸î~fóc-áÆ6POÊžã }¢/Œþq t=δ±?È ™Û4t•ù†êQGQdÓðÕð-×1‰½0ûÔpk붖>‘4w›²äé “çzêøÄÉë«.Õ} ö f»¦ G¶}&ûž­°æ“5ÜÚs½¸yž:ö½Óš¡²§ª6quêéŠKÊ(¡˜„©öÂâ ‡[ÛšgÌòp~+ÄÔa>ÈCNsUÅ–ŶOa*Q™¢9Œêºé0²'æ±ÄñpckcþŒon“÷§à˜‘#<Ï&òAn „ê¼ÿÌq™bè¾.ûDsm\J¶íËû™ 5¡Ã­ã«äI${?oÜïÄ>-ûš©êš!k´z×)u=Ð䘧x†Ç–‰d¸µí÷ód’5#Žëù1¢Û5 SÞjžÈî/åP¾`U˜wL ?èr- k¶RïZŸnâ(Ê ÄÍä}"åuö-~—ˆ,ÚÍ{Í¥øÍqŸ‘²ÿVvä¯õ¤Ûññ"še®ýžùA`‰I¥U²-­æµý—tW…ý.ü͉|žËväãÕT¼øø#O[ÏSÜ·RFdæ¼Ü•2¼PöÎvzÎ…"ãB‘¶Pzv¡<…æ„mhsÁù O©#Õ'—?ùé¾ãü8Üâ׸N¤`ÕRHìh‚èÓ_ÙúS [üxú×é®ñá¥ýÁÞï>u ÅGbò8¨|º‹Î®èöS7ØZ+ÑÏÞ·Ynóüõƒï‰lfÒ=g¡ø€; æEUXäCgí[6j@žä¾K±ò(}‰¤½•·A-4fîhÔ™àõG Mß"ЃAÓ–x¡É£ô“¨Íâ$­öå÷ÏŸAiNñw€ˆEæv°ß+î|”D¶voU›HÌÜ륟þ†¿3PÛ¾>â£\ýóûÿ’ÏfsQxì_ÿ„Ñ6ýß&T®,|u²ùüª8os£sÙ€>J7TùΊբâßÚ#ÔS]±°ðW¸®¦ «!`P„@ÀÀuœ„±z$ ­J˜Í§_˜ÏbR±ü&´Æiî|0PyŸ†tF.Le1K‹“I“wâ’-T.J6u,òȶ3DýDgÜ,¢çý ÔümÚ)Wï׌„Aøü ý+HT){$w0wÿ—¾`ŽdÜ+Bø.ÿíäa*ÁžO®Þ¥íÆyšÔÅ1ßÀ$t:¬J䲉ÀæÏÇï‰ÂÕû’„dñ6W$VÑ·7&½‘Ëz1Õ!$8n³‰ÌüEª4"¯êdÞ[°ZIY𡨹‰ŠæÞøbTÇ¢]W>iÑÊÉrÙ—ðzYžLÑ[•ÆyîÇë!{^« Ùn–Á郋0ƒi…Y…Áì ”¤+Í’ŒÜ›“¦Á< p2¥År*%$IðN/DÕÊ£~ºšC…Xf³Ù6ªRîãÇšMwÚøšÍñYVW«Ìz«’àO& ÁÍrJAV½ ×©8raçùpäqlmÊÔë¤ÅöÝIfC"bøú@ˆ» V¨Þsí/ÝÆ!ªúw/$†~D›÷;é>ŒRøh“©§øáŽEÂú,!)É,§Û˜I÷\Ý‚Tðž)ÑOˆ.&#‹M]ï|HÇ ÔJAÉæ‰q]ýEŒyÑÏïšÕ‹Ùˤ{k “GQÙ\Š¸©¡"nj'Þ­¦XF3fF0±×Õð±Z¾f4·e=Ïè± =,¡VùÓl+HÁf»J4ØäR5ø°Ï›`°0§Õ]£;° ’ôi\‡Û¥iÍÉ᥅‘7}ôvÛ[ú 2µf«L-˜E¶Þµ]"Ûl­ ÃÉÐU’‚.…'‹o¤ì"b¿~Ù]#Ç¿.A~a&•ðr *+©Ó$€šL“lé‹P÷KÙ 5Ç n (ÚUrËMx—›ðA½k[~ÓÍf ­tu€IxÚ_)Eù$a ³ß¯=íߊzõávíBí‘:Œ"ÍFŒšl@G$+tZÚ2é[EB“\"Ýås‚3x7ò,dV¸×°ßµW™Xaa±ÆÊ—CZ¸÷«äG±Ä,ZaØ«ÀÈ™‘£‚Î$p½™}:$wÆ4Ÿ¼`½GyJGy«ˆ’Õ~åÉNGy»yÏjn*ûÒiìf]-k—ľ¦'0žµ_Soež)‹ÚÃðµ w•g4ËË#Õ¦€ßl× ~[Zàåƒß›¯ÏÅûút,Ë!ë`ÝmS¹[Na†’P’%ÂϳM1.ãÏ¡'N œ$ˆ™±hþ‡=¼I,åç𧂜Òa+®ŸVÛyI±"p¿šlæðö˜cõ}¾¦P"[y9Òhµ]¥KÁÕJ ÒÖ=Nät´[Ìÿ |ÎÖVß’h/ƒÊtψg…I¯ À³K8‚œ Jõ˜œÛŠþ)áTkòµ/«R‡Aw*²ÚÔv_Seµié­¥Y™n‘ÆäŸÅÝ\ã®Ù5î’Ü€›Ù ‡¶¦âÜÈ ï©Ó๪QªÖŽì³¬1eM—‹éj`K¸³Ïé^;*™âüur8W]BƒË`^€ÇÅ$^Ï~Ô}œãcÅÒš!Ñ~ÌFˆv¢3J%iÆtDAmÙ·“8Šc©Ð}™ª„YŽgÛ†A©ï,Ì1ÞÛ®7‡ÈýúüÃô¨*\‹Òçƒ,)¨ù ê“Ï›˜ïÙ~˜¢àí:‰¬8V}SøQ!Aú9óÍ믰)'Ià®Þá /Ú¦Kñµë9Þ±½oB|‡~¯33øx0o>CÇn÷ñ—(©5Bz!¯ %šÛ×”#¹N˪Ž"I?¿DBeºéz„Kx?ß«¶81ZÌi "Óé"e£ìùD žÇ¶‰}/_•¼\üY€X‰}¢)wžÑ{dÛæúa½l5]‘ïãܵ>x|²BGT×Þ‚„-D ]­™]Á©*ìâµ¹î3ˆñ-NćI®OË|ú•ŽÎ˜x]€}—¥zš"¤9ýLþsy&¹smÅ3¹RÁÙ\ˆMµYwúÕ´g]«ê¬[+dš³®©·œu;¦c †ðUJ]Óp± “:¾ƒ‘6¦c+¶¥{:=/† /$þ¦"¾nb–àÉÁåC‰¥X¥S>g³quHßL¶1 ?aøœ\0|)_! ÃÝxÑ$I£žÙ€Æ¿P}ùæû(Þ*Å%i#¬I;±k–ÊÎꥀœ¦òû]n¾Gy‹¦ìrrÔøäÖ¨s꘢òÙê.–tÞ_äãæS"±.ÞVX›_IDÛ¤ð(8’<[yÜq BaðáüJÔµ–ᬘLÖMóî\Ɇ}&3Yo“dë–ã8“åBn[.>…Ðô5. é cyïUŸ®×¸”o8æŒ8Æ Ö— ªË¨ ˆ»ÄÖ[FŠdAÿYÈ¡°¿?¯,¬hê?¥,C¹©ŸæJoಳ|ÑÇqŸßñ8 Œ7 Ò$‹ö€¤¥JùÉ{»$Tî“`½As?ÈuaÎReñPQQÙšÊÃëm’¢™û%x~aœÆ$”0^$/;ÅÁsÂß<\n`q ÷p¶x4&AÅF„¥œ6tý=ã3øà¯P¥Âþ5€•Ç˜s$ÄQõõøXeúi/½²ióF“«²ƒàuxãt‹ Z\LP¡N¾Æ°d¡Îµçm“¢£k“bˆº«àO’–¨Y{p8ÊD¶eÓ6=Õ³M¦: ~8D¥ÌáKea®*èâs] º§'`Êá£×‡ñKù»„¤µ”Åï¼µèp ‡%C¢áÚØñ‘ÇqŸ5¼.1Ìuh¤XÍM”/4LYxóñÙèNëÔ¨êð7sÁ¤››>vÅ{833Néˆc­1c×A†%WDÐ~eŒc“YmT»yPV6pŠL”5&[²îXŒ*šÅ£.3_veÍtø{³8™˜½l7ÑxˆhÌqO )L%¼„þRðIh¥õÈN‰ß’ÕÈÓ…Ã¥(ʼ.AŠ.Mïž‚U³ÕRU£+Fâ…FDLã­PÍLŽ»+þ‘ÍÈìy-œ›Mññ›FOC ¨PU³ºŽ^Y£ãÓŠÔŽPS^(,Éé’Ù‘mUµ¨o)Š©Éž¦Q×Õ4Ý÷Ëq5ïê™b+Q)Çõç M<­˜/°OÌÃKôÊ¥¬¼?ï2ÎõÆAHˆu%œê„l5ùIê¾— ù;øÞ£|ê=>~”ÙcW†KBÛfwQ`x={€ÂŒÁþŠ£6¥cì?N=Nh>•?¼‡ˆüDTS%Ú(mÿÀp2û…vðãèsô,/·ÛŨ›µQŒN@“»yn¦Àf„mQDa“Ûa|«‡ù?ÿúùé÷/ßÿðãO_~ø]çEþ0ΊËÕ¸^øø>YTº]‘8‹ˆˆ?…â˜=ãÇ°½²¤ BÏ"õ"Ô†‚á°7y‡Ñ!­1¬G‘p¿õÌ_M©¹V›¨yE›…0¯7•yñ'­Šš‡ æ »I€á®ƒúì,ÙKÚQœÊ±ïŸ,Ž¦+–vËw1HžÄfµP“‚j·4l¾c§i¸Û”í¡]Œ ê:¿Ã¦îk&Æ5Éq Í5dJ]ÏÓæ)žá±ó’Z¶­ßõy¹.DrfËéœ — í¬ežeþr{ÀÒ„Ó…ö€{v]nrl¹Ç}u@GA®ª8Ú>¿pßràVÒš| ÖÛµ  ï`B*«¹¯¾~Rm?‘XJ?¼Ü–¡R‹š¦"/Í"Üøo6”}ƒTW ¬.Wk v2AzA²Y‘÷dFòGqö°Gd­‹Eü+g7Ü‚òÃ6zØà„tµõP=-½ÈSåù°K÷ü/3Š=á‘ðňã5 êQ­‹ÉB4• bŸLv’Oîß’ìÕi+‚ÐÑeЈ’‘â¡L‡ ÷D˜œx.KÀÇK;†»ök‹Í;ÈÏ1a×|*Né¦fêj¥0þO‡ÍŠÞÂü¬ ¥õ2N"ÛqO²£¶âž*dµSºÏùw[¼ÍgO¤KCÕŶ>#;UÖ½Z!ÓÔÙ1›jLEðíÅ0ÏÕˆfR×±©’îغ­0ÍÒ|c––¥½´]Þo‡ªgTÄ\°FбžúôqožÊ%¿9X­ð¼!8úŸ$¥û ûZ} °)xeÐMºR`E|ŸÑŒ}^0à–w}x”þþÝ/_~úòï-E%bâCœ$õWûÙ„O*ˆçqZ>¦Á||tùú¬T›UR8Û‰iåƒÈ—AvÉlÒ<ª¯7Ì}Äh±Y2$Ÿ•'ä8XoTˆ±ÃqÔ ŽBAÊšK MWÞˇ¸’Æa~g ̇.MŽãxÌ(Ä»mûÅ7|{*Ù­cD\ »»s3†X-uUq¬ZLæ˜èŽRŒz)‹—†©1]v4âÊ>Æ«®M™©˜ªfëD93‰l¯¸ÌÇMX^Õ题ܳÅ?¯)!­†CiC˜ÕdPj¸â@F›b‘–7T^“4¾f¤çMúÜ—€¾jZ‘‰MäÅ{ea€©ñJJUTÃ¥ïV«¢ºoVGÙ„C­yñëÈCï1/«áÒÀQ>X3£ü•ïª5£»ô÷¬¶à¼ùÎ6§YY*+ÿD@sœàu@ífd¹YDê‹X*õuêPF,ESq}ݶ™k0GUÙRQc™3úâ‘ã-ƒb5ƒâ…áÅk04Uߦ!À˜ ËG;@é.VïZ,xw±r÷ %)Ò%TIjš©”ð>éþ[£bFºÄ)ݦ ‰Ík¨¶•ø"©•C>V>pO6@ €R®Vƒºpm-{4…ðH¤ ß"â…ò|Ñ‚{$;‚›>`c¿üþùóC½XøtÅ|Ä9H\:TºZ…®pætÜ—U$ê²lzçtµi¥«®\xµo×ÅÒBϼl}~8LäÄux½ÁÄLÜ“ÐJU:(¡UýáÒˆ%fgòlÆ|ÉÄÖMê9²M™¬ù*54ÏQºC-äÃðf=?£ã çžçpZ¶OS;óUvð]60oöÛîz¢P|a)GÆÜë û^PÁcu¦5#aV12/âGõâ!ËðP%OàÒñí%CÛÕf&ÛÍ&*ùœÜ³0­eõ•3B_)  ?% ¿9× ïšÇ躌…’“OÓ“"ÚYÐ,ïàlp²±ÑfuÿÊÖP[@A£qÑùƒ/§¢1÷^´ìñ‘2?>>6aã íiî›YË~ÈÜŽÍGiLuçëo‹p_9rSª[WSÊ»ŽBü\¼pÅ&Tyõ’xÒóÒ=sVX¼Þìì·8ók3WTU/Ï;¢p:Sö$×z+{ÕKâ£=Štº‹,×þÙbÀÏAë5ß1΢(ÂL£iTðÝìàãCá-M¯†ÂO'oÅ›Nž¹³ Šï*wŠýCq5Ù²Ͷt_±™EM‹¹ª#IØy³Ÿôî zf£Pu×ðd™zÌñ}Íe„z²)ëš­RjøFÉ¿/èºrz_îgLÉšƒœä.)Ü«Kq:ÝŒd)¿¹¤xêÙ®R¨ô$Zü¾ó#¡ºå3™9.S Ý×eŸh®mW·m_>o¾Ç¶qYQùÜp†Lë‚¥žCB&òeÝãû7”aH4ÿøáA’ëêù‘ `#C\„áí…ó} ÂövOѨFéQŒíïlBkøæ³np]¯ °n̨_Ç:_R£ ŒÉr³‘\‚)†?]´Ë45ë’¦7 ò ÀìäÆL1U…xc²éyª£¨°©ë¡²çº°Ù/Rÿ™1¥±H‡HÌ=¹ {ÕåÏU Ÿ—z&—Íy¯³Z"B¼’Ç9ý/f¶ eß±\â“QÂ`£#Šá+Ìò}×P=ßkn£5×c‰}¥l“füÁ<ËIf*j"Šú—,| â(ÄMDz%qÀ_¶(Îo| ž_X’Jä•+þ]ùh-§‡¢°ëˆ-Æ cBÿúÿì]YsÛH’îçþh¾Œ¬±$Ô…Ãc;¢×}Lo¸{kwììËj« ‰ÝÉ!HËÚ‰ùïS⢠¨¡C2ŽªB¢*óˬ<„°¾E‹TÿóD„QdùW›"Û(Fêؽ/ÓQ‹nI÷! ޛج§3-P INÆûóm6’7 LJÄ`Dˆ(à¡ ·Qàvœyª¤Rinw'W xá]©Uy2Ö©7¼Ý#MLJÖ¿ZŠ7%E¢Uí*ÝXê³Ó€Ùƒ.¿ÉÉêÿVÐ3­¡üØ`ZcÁ¶«RÉC”¦ÝÛ~G3Kà’bÅ•ùafJ¼²êp`âi7u½\ÌfSv˜âƒbîäB³zï'm¾QÆ%Éó`€ \Œ0' c'´ilèxŽÛmÆ¥'PK̤y^ghšÎpœxöì´‘Å6ÓY嶺¨5¹¥+•¾fù0±Î”f@㸕•>ù"‰19‰Ld‹Œ¡…˜—> Þ䊻~Yç=E»ÖœÂòÝoÅð6:¨ï_Œu¦.kOL:‹Ý8/@ì¸9‘ÊCRitÕ ¥nº¡Y$œWqà楤κ^Mµ«[|wiÊ”Ÿjl)¬Ž}@£Úè€vJ´Vî >ß­µ=eÈý ªšù)4 ­ç!pX€ÅÈñq`3›×f±]†Ân+w”L%Š·GŠá£Ö1mT6mÔ !pf:îµ7­t]v JÖ÷‹¬]Iã•Jë’I¾©q™<ñÒ éLå³Ùî8ÿdŒ+œš47y´½4¹>·àÈÄ€W B÷#!UÂ`ò‰ŽÌøÛ¢Î'7’(u1ß«Ý¢kÁ ½æ>°u¦mJAx¡¾nÙ9£=ïä{*•¥?B׺öºV„, o‹9k˜7éwm‚é8ÜÁ„b›KÀ˜ï{̱F™G¹ãÓçn×\vâo‘™X´CŽÎ"É’·ÈÙÖ“Â\{Q–údšH¶¼X=˜2À:€Îw—ŸV>>í (a'gû‹Ù!ÈúÅA×ò—.箉¿´Î]S;ñA9cMšØi›±¦ŠŒµJ¶‰k  ˜D8ÄÜ }G`ßÇ®#l»Ý9ØrðìŒ`§W`g`)f1Í×·Ú¯eˆo@ƒà:¤¿ ÉVC‡›)Wë ìüønñáý” óƒÎcöÜòÌ#»2Žo=¿°«Ú>\vl—§ÏÃR (%¸Ê³ŠÖ`³_´-ga³É§hÉõÜý¢ÄÖ¾E¿ÅÆš¡`èyÕ(øðø@°m LB‰ ì¹Àgñb¾çzÔöñÚ<ܪ^,†>òþ?ÃDúƒ§ãl²õ™PW&/ÊÞÍT…øeÒdåðÄb¡áD‚&¦ó…pÀÔ ›W¾/ØBMÃŒX5ìR˜ zעج媒ÒWÌDcѱxi·[ð¨3ȤµÔ÷o×ÑBoR©ãèh1:Z<{G ‚2AuÑa»±íU¨Hïk½­«Dâ¾ÆÊIƒld’E¿O—ñÞ¿IfºƒKØž0W9*eÓ3è÷À¯SÊùžmçQˆ[¢(†yÌ\Ên[Ë9œ#ˆm†‰°îÙœq¸aw›‹¼ÂÄ;nc÷Ȳ;PTûøîí¸mû,h'3ùÚä÷ÁT–ôîóù! m*K…¡;©>Æ]<ÿ„¬Æ_í±ÂoéÊ:o,W4Xï\°üA­QSóFó$­ØE®íhNåZ²=FCŽ=Ì…ÃÂ~“¹\­:øFÛXŒÑyÜ‹F&$›úF]lD_‹ÒHo=çN“zõ¨×m?+v¥^ ŽÝóêÖ}dë(giQ¨dŽG‰‚‰{Õ‚¯r¨—çNX㣖ô] σ(°}J퇻Ž`Jà$ègE¦Ö`2GAø„éÇ?ÆÞ¯bDT_]@§}=d ^}¯cR$ïø ûz/ûZ‹/k.Eãúz»[ã{jùS’y³ h&ý›Úgˆ· 2 gã•Þ‚ßZ«éÍ­A¨šËŠÎ1«)Ï×Íz"Mí¥TSšâUSµ+¡†oT7I)CƒÌgº´~ÝA,óú÷•Fýqƒã¨ã¸Á1npŒmlp4+fÒÜìK<º1q|L©VI*¤ïaø×)~ßë ¥¢fœËU"qµf†9!B=wÜ­‡K*Ÿ %í[9ÒËïŸxTÌÅ}ËýpX\¦"¯ö ÄNãñ„{"¯q4<#<ë ž^Ü£IàfiNë'°m”û ŸPÁ¸ð<Ó ò9Ã$ "Lz åLºâ᣸¾§Ór˜Ès"¸‚ ÄB8@ÌöQrŸj˜Ïr-̳SâŠæâµÈUA¯ž‹ÿÊ º¸é‰ù} HKÛî7T{<äm Øb¢¶l½JR¦óø hWŒûél–﹈¦NjG«(Bòä° ø*ÂZGØÖ/«šë”Ò x$+[Ju%ÚÍFåäGMÿ_Ôpu©hÈÍ7ô¹Z£ÌC˜ÈBÈ8ÄPxÌqhÀm/v„œznß`¢*cB×ëÕ”m”labwà¨è8=È7Ⱥ¦ò²¾ðƒ|¬¯üP¡v+í€Ú‘©Ù§ËîmoΣì3 _äªIÓmØ”FØ•À:݃AËÉ›J˜¨kÄå¨Òf ½“ŠGòKZBÏ\•ä»s…Zí:Ë]J=›À¯Ótœå ¥ŽõÅuœ]Í¥Ž·ŸÈˆëx§ªc´GÂqšÙ §C’ã?×iq©&@ЕpÏ!†ÜT“@ºÌw¨'z Õ+`pƒ#Á`¿À æLGBc*ýƒ Aý¶#$!á !¡OêØHø,‚ånÔט?ÞHªÿ#\¹9<ÆØóÀU€yž .BH|l›ÐCx¼ Ÿ=›º#óèÈ4;}Üï üb°€f;—ví#µ¨óo îúÀ‰k¶CÍ™{‘[µœûæCúfj«W²¥Pï¾fLÁY?8â[µºs[«±K`žÚO!A‘ áä­:öA‚>“-ÖS¥o(ÙÕé[Êñö½ó³C6.[¨aGrA“+€;®ã»˜1CÇŠÙÉðaz(¾ó¯¾(UTy:œ!’B+éöáOzd¦ ËÔ FYg•N›€–?E/­»é|åÔɦ ¦²°l}3³0†ž­á#óåáÉáL)Ê4 ÅÔ_äÕ+ºZч6Rû¶Gü<ܾÆ)[š«‘’ƒ†;Çb—cªaV « ƒÍѵSœìñ$½6¥yƒ®[„¾zx4Ô¶nBJµbE"æÍÍ[D¸˜‡ÇPmïà«$Mš"I¼·ij½ 6˽ïv@ˆü£•ìKíÙIUˆ˜D¯^™?ÚQ¸´N]Ð(¡ÐFñ|Âa®Íayˆ€Ósé:’0nÔ•ž©®4°­E33çë[%¼Yû“ÁuHr}Ù!w‚Ö:ªŸ§S?Fqe¯ogÕ³ÎôEg½Ýþó?Yg›(ö|wrpVÊßÒ`ò‹4»‚ž“ží©4ÈègEÏõâáêÅ~Q¡ÈéʼnõãQ?nšB®™n|¤#ö5A±´m‚,së¡Q˜¤Ã0s1ñ Ø÷0“¿lè¹”ø˜öUÝÕìQÍ> F5{ðjvwêõÇw‹ïG­zÔª‡¨U·éd§‘Š:vïd§õö:渾:³9¥æGb>Ä8@Ø…ß $¦ñž°C Cλ­Ã]‰ùžŸw{º¢w Èåâ_ìöäà™á4"xQòÇ^‹/ë Ųq"pûÆò5™žÔ(%]°¹[–Òõ§ƒkÕÌi¼]Õ±sÎ]wW¹.kE¤È»!ŠÍ—XªmÙBÁìÕÈSÉ“¥Â@r‡”ß“£€î`ÇÌ4 ¾ÀC«ÔŸì”KŸ„¡¸þJÐয$‰u~Þ”MkƒóÓóhý¶»X´ü[üc3•ðS˜z%»çdLÿ:!÷|l3j3'àLéîr…ŽëÒ"ýuÿf’Zâ ˵©Q’>ç‹ÕJDËÅ<ˆ’ðÌíE1ÿ<]-æ ’K ¼šêI¶X%7&™èg:ék¹¨ö©vŠ/ÖV Ø—Q.–•¼4Â0ÒBXß΢EÊIÿyº(ªü«U.K|…å±{.‹Ý¢Q1;šÂa’D h8|SÏo!áL›\Ö „€BЦÌó\ꃀ†!$¡ínC2žŠË¶àñ‡æ¶ØE®íhNQ€mÑcsá°°råc²†Ìuó/·È½]»|ÓQ[¦êؾYÚ¬ú¬'ãŸu˜õmæBH}Ì=J]Ɖm‡Ôƒùؼ[_ÊŠt$6–“|¢m±œd¯8är’™Õ´37ˆ­W”ÇÆŸBqÈD‚Ô)1yP!ɯŸO!É[alD A%‘’B‹§«)™éßt›Œ¯ÍþkV’ÜŽ$àSU”t‘ª(é¢>d¶é›‹]—%Ë@”Ivª°N4mÞˆ“”¥Ô{"›½>acaËÏMq$á玄 ŒyaàúÈöCpW®2 ìÖY#ïé2[‹}D“b(9j8`àWœþ;៼Q¢´û…•½ûlz)._*¹½(Iö;º^M¿$¹ ’†žGI…Z$E4AÔÛ[gw‹`NEð¢5ô¤VCl‡±ú \bgÛ6t ¶ÁW ½±ø• LÐW–ÝJï{~6jªZÖWŒFëÅf÷ ï»>П×ß|÷·wŸþçÃ÷–úÜÖ‡_ÿãýOï¬ÉÅÕÕ£wWWß}úÎúû_?ýü^ÎqÛú´¢óHóM:»ºúþ—‰•]Y÷H/ªOÿuõEµÔÃñŸëÌ“—Á:PëMwøån6ÞT4|ß7Oë{U2CJO¹¤å½Ú_âÍäá<ŸKøЛ‰rý5ÿE¹‰Hqýæ×O?\xzÅ–ùûůß^¼[Ü-%ã“2*ÓÎOß¿ñ·Ï(±÷frc’Ò#Òû¾3 Á0ýÀzº–Ò.aI¯¬Ùb±¼äÖG½´¬¤ÈQßóõk"bF%…dtÉ£h¢„œ”‰ë‡™ˆn…XOtrÆøÍÔ ª“ˆ¯¦Êƒc{å7ú™š³1óúí±z¸üMA+s¥ÞƒÁÃ<–ÈQñéÌxÞXkÈ–æ—ñ§Œ£Â‡J[/–#L‚…vY‰»Åga° ¼éeì9"¥Rdü·â®¿1’%mGÑT"3ªfMŒ¬Äl-)—áÍÄžèÿ/%‹Žÿ/!É뵂B–~9#ÅôævýÊ"ÎòË_&¨ÉÅøñ‹™å-ö%wæ+ˆD£¿Iú¨”ÌuG,šäˆæ¹uÅÛÉ[ûÒ¿´%±åeÓ ‘¶V¢àÄ€JþJDKpñ+¤ìWtÎ _ua+M%s³Vß“ÿœ~–Š>˜$"QÍÌ–nf™³ oUßÙôm*u³âU¿ïÛŸ%z6ïÿÞˆø-•}}%¬jC‡eÉ'¢\C¿¤§ë4BçrF©·Îµñ]S3˜‰gû#­%oÌ7sÎדmë ÿåG§–wuS¯¯6³Ç_5Oo˜£7lHðꑘw|/ŸªC«›Ù‚ÑY¾•͹:o”}Ÿ ÉPoÓ’'ôÿõÍê™ Qå51S†•*À*u‘kC„¸ L). 1¤€S„!¡!`ñp rIؤa{}„y}Ï‘P$ôÝÐƾǀ¼@ât>#];í%¡AK¦¶åNq¯fYNÒoŸ;­¹WÁ¼Ÿ3Ä4¾¥vÚ—y¾ØYÌ'Ú –1йñëü¸HÔ& 7ʧÏhVZVZ¸œ?—úM3­†+zsgÖ@æ¬R£4y˜Tû€v\Ê0»Ì}óÅä­š< žR‰Ùb;…iîiæÕs4{kÄ9y{uþç‹cÎÏÓEQkìhÏØQž •ãÖköüܪþIµ ÷S¶R5Ûvþ4;Þ3v\ìONw²gìäXºoùÂU õZ£»³gìNéîî»{ÝІ­Ïbi»¡®lç ÚµBwoÏؽÓÝß3v¿ÆØõ¨Ri=Ö#°ëP«Y—{¤ uºÝC~à( à”üä¹>¸&§òÙ¾¼ý|_ÿu¿¶¸ï/Èõ'%ý­0”9Š¹\þ¹^“ñBÎLÞ‡KY£jùU?=/4ÀL~@&CA¦–¿©å.äœÉû|)ë¨Z~ÕÖkÝ€52”À_†Ã_’kËèFþiÞ†\Öô–üò¹‘Ÿ`(?€¿ ‰¿RŽ÷Zš¯¹tZrùöµ^‘Åë+ùó£ž"ë 0”À_†Ã_%O{%ÙR~²&+Y»o5ÀP~¯I¯$'Vþ[ 0”À_†ÅßkÒ²—½†òøË°ø{-®_èÇõû‹Š×o½¶—kͧËÊà/Cã/9!×W¹Þä½+ï ¹_“+rý*·õyÉõäšDúQÎõ½¥ÙÉÌ\~xÎÃå"1ÿÿö_wýoòš¿n°oñòêUþ°œa±|c73ù9€å‰å㫯uðDvv¥àäl4Ð;³¯ä4š ¦¯ºóT®mõ ¯}Üi77"?€å‹åÕÿ–s$–ïðWòÕù4#oº‡d8H²Ñ4Û}ù,çH,ïdé@åvŠçyt“Ô‘¹NªHò£¢_Š#µ3¬ö¦ òe0»P~õÿx>³“ÀrŽÄò<>ч aw•M.3ub¹Šï[e,è‡Ãñ—E"«t‡ÚÉ`9Gb¹’ø2›ýãÞêo*?€å½–ÞÔÍP~Ë9ËéëÂÐ)=ºŸŒS9:s ©ÒžiŠbf¬ìîh<“³¾a*?€å‹å$?w[‹9]êuNW^WzÙNy‰Á¥Š;½oÿøË‘øËÊý/ûyÍÞ,û_Nætžd•C`!¿ðW`×Òd¥6ã°ÌAh.?€¿¿·r¥´{Ò¶õïe4Ë&ƒh¸+­¿>ÿ]´×æòø+øËáÚªLí"";šKXR²ÕqAqFtÜÙXE¹Œ'S|F¶çrj÷~Õü¶Ý;VûVön“œ6;½öÁÙQ³CNÏ:§']9–ýKZ?·Ž{¤û¾yt´®8ë´>¨ñºÕ={Óíµ{g½ywrr¨gk·Õù¹}ÐêþHŽNÔü}Kκ-S?ÎpØEâða³×Ô½,—J/…RzsÖmkõo÷ZÎÙi¯}r¼KÞŸ|”Š&¤)>ÔóääX«•¹þ¸»H–Ú~ÒùUu¢Òt=äãû–|½£&‡Tž^§©½Ûë´zë“-ítzVúï8ì"qøFÉqëÝQû]ëø ¥$;Q-øØî¶v¥­iwÕÚyglÊöžiõRs]Ž…zj*?€Ã.‡oáXC"Ò~Kš‡?·•Ž,d”&³Û^˜W=+Þ/&òkKûã8ìâÏ”Åpüu‘ø[Œ¢kH®ò€:éy^F£ÁÕ|(Ýé›O.£-Ôú f‘üþºHü]åêž¾&îeüÕf[ÂP~]$þdéDúÇorÒä‡áìÇüå׋—ÿ9u5§¯û“þ˜ý¨;~C­PØE¢ðÑx>˜¾:gCr:ž'ÙL·âæå×WùËÿŒäºlÙ µÂ°Øï‰7t3”Àbïáã»öÌ€±WcÜE„ôjòJï»$Ùt:ž|÷ÓóÁ(ÎÓLëät–JûöúB) Y#Äój¯^žÁØFÀ¼«G—Q²$¯jäIµÊF_<ßF%£ïÕýš6Þ05ÔÆí­ü"Ⴞ0ž÷.£d2ž¾¾ÐYŒû°ô^¥·Ýk¢«”»–‚û€q÷kŒ»•à^°&ø¢n¥­ì€a÷k »¾¬wú*w»­ô€U÷k–XvÒ¯÷|‘g`ÙD|na| |asQÀžû˜ÉÞ‹—tÌz°ÿþ}æV1ßjÿj}½Éœ² 'ÌÃÇ-H6y3sÂ|œüÀF+ØðC‹‹†ufñÆ<èo–ÍÃó(Î<'I½ÌÉD RÆÓ0tc'qì¸}¡"<¤d!Íy‹wÙ_Ù×/ãIšg6R™.%5öÉG  Œ(³u>P¦”$;oÛG-©ßŠhبùÊnŒ`~‰<¥•zÚ w7AZûe †Ùçl¸Kþ9€™‹4C” ƒù³±HȳOhƒä´ï}ŠÕÀp‡6†; w(êšzce÷È 4?ÉÕ]þÚh¾†€Á]D¿÷‡ã/ßýÔWi«ó~ßùSv·üôŸks¹ä_/_î"¥Ìxè¤"¤¯ëzõwš½þÅÜ}ªB›‘Téþ=Ï~¼þ4ËŸ,®´‹=ÀB‡6.}XÍ0@ ¿5Yɳ}r|vt„íxÀÒ†á½;þå«WdeUfŸF6£@z\¾î°l8ÍL¦ hÖòýô‘5mom»¨Þ¢RÇb;„Œjù>ºß¿\è¬,UºŠ p¤åû¥‘Ø¢-¥íY¾_/Î]óø™0|¯ÔOù~IŒ-÷K½É¤Ž ´%œ¡éX¾_!Ùƒa xÅò}‹) P‡)-šN«ËïÜy²3R±€ß§»[¶tÈ°p)-›ÞÿÅ™~ìäXÄ”–Óa•Š"ÀÊÒ¢••ÍD^°˜E.ݣ€Ý[77M£Ñ_:K¤™•ø­”–Íž…ÙÏÌKjbfê*¥U𡌠ÀK¥´lME³ô`Æ)¥EgwY€JYÙÞ©®‡‹M …¹)Sq”:‹–™öìNÊÊ–Í^{Mt mRViðHwN&eeCiáŠëTeòý´` á^éah3åyÔ÷™{AœðÈËœˆŠ4N͢ĉ–ô¥S?¥„îÀžI¸‹öœ™ø±ÕEÀij*ÏöÁt0ò¬lä-tqŸOg—³©ÔÅô^ºº^Ä/‹ÜÀɼ@p§NœEiÐ2ž%ßý´ü)#}À¤H²Ä]ÀVÞ”@ìAº§~ÄÌPÔCÊôØÚä8…”—äá&@¤¼Œ"“C©ëù þÃNFLxL0#»3Èv°X£nmŽÊŸÊ‚]ÈBÊË{'ÛÝ%8”—QÇ\I¾giƒÜÃjRzAÆÂ’ÈáN3–° KßÏ„:½[ê jÊoƒßÑÊ@/CrÉpý(¿?.Yú÷‹Y|¸‹`Q¤Ö¡. ðݨx,£Ù¨xL£°Ô¨ØˆÑ—ßøͲóÏÑdzoõ#ÇK³Ð‹EŸžç÷¯yI%Âãj-´þs&ž@y£EÊÀøöô0æbÆÜZ/[+îº(õ2¯7øœÝÛU÷ÏžÏÜ>õ“Ò$< å‚Òó"iEW¿e¤‘0Ég¸‹6]”w“ôÑϾQx¡—%qæÄ1w3ß‘“6‘=#˜H˜“±XÅQö_3í!ÅPC”—ùvÏË—È_¨Z´HÕÂ]0ÿ.°k´îÂ˳Øv(PÔòC£¯±N-Àg¢nÙ…(‹P•¨[åo?œM˜HÔÝ„ÁþÙÒQhFÔµvŽu‹Î1öº€,spŒ”[Ú¿k®+Ò¿|Õf¾4êá#/69½ö õî”a;µ^ õŠò–_µ…¨-HÍ*´HPÁ]°NEš ꢵÔˆPá§I¹QæÇÒˤW–õu¢Ðæª(?•”Vl/`u¿ÉøO4ÁäÔ/Ån)è5om»ê`§JN ¡äÈéxÓb€7î¢ÚØ]ËÕïý¦Gæô‘R9G¤Üw× ¨èg"Nc/–?b0=Tm±åôxQX„•²LµÍÕÚ²åY]Ž»;d=Ò;ª€ª˜HÓÒ¯k8´nžLPëÉÜ%ÅÅà‹ó/*éÒùe4ùKÊsÒ=:ÿÐüå\eM8~‡.<œãáThìÝËQ}ùÁ|̓ð{¢߃6ž÷ûÙä·Ûý÷;V&Àá m"OP|—vJvU tœì {¾ŽØpk$%U{QùUyýÁgã墶FŽµËïb àÐzÁÝÝð›ó»ÔÁÛk)ÞÓ©8}rô‹¯`%‚ÐƸ´Ä˜.Üë\Ç1ösr¼ŠíQ–núiTÞÒCàQ"¢TÄÌåAF™G•>\æŠ4–Þ OÙ°$ãùŽ4¸ u—°.wSgùBjéPö½˜qš9n…nèEn’q®· YI­ÈµçÓ¨ŸË.L¢\ö¢Ë«@/̾å€èofº| m\!€AK¬ˆ»×¼÷zg÷•¸v*¿¿Ù-@@¤`DŠoL]@Ò`6$ 4X‰¤a§ GJyAߧ¤tÄñò¥v Ñ]Qg¬ŠÌñ­iC=>2Ç@atmh/‚$õ/Û„zôbD‘oNêñ‹U0RÌGë©…±2€èÂœŠ¿olàZ+VôÃ]@Ø ¾Ìý¼cŒf9ûj « Ö|sJ wñÇbö?ÁÀa“ýöÑ Q±bAÜEô7bEŽç·¤1ØuÀªb•¬*óÖUÅìÕÙ)¤òqÐdk#à{ÛêÔtîKÄ.ì¹;¸] âvÝy>ý$ƒ¸Àc¬±G@ŒmM3€›Æ*¹ißÚd8p¬‚‡L&ÛË@.cä2›}š‡é’ÏÑdÅÃÌÖ^”3VA9ûæ ÀÙ bÛƒ/I··ÍFceÀþæ€ëbµ@ÔE«àÑÙØÃed´åüXu¬‚U÷­ ?ÀÝcܽw1¶"ÏJ «¢~k£8ÅRƒ¸‹N@×ï °@Òc%’ÒÑ(z¬XŽwQ¸x¸TÀÄ$ÛVÄÄŽüâ0a¯¼K^ºûq `2Ž?íd³ùd´ì…¼H)Ê!+P‘šðY±ðî¢@«Ñá. ˜^T‰¸½fÂýƒ8yPóØfJÄu²(U5$Äúf(?`¢‘%â6y3ÊDÌ–+Ö†Ã]°Ô6œ9VËë@EÚR!ü$ ®ãöã@„IìÇIìRëÚWÛÊR2E)FÚº¢bn!anbn%Ú¤yÈ-E^ FWst"DPUŠªbiËF +1Rp‘¶±î»)VÀ4—¸'æ:q!+ `Ó½RöP«Pl¬4€…¶aª0€©Â<|>åµÓ­÷dß0P (†Â¼òÞ•òÓ,žÿq{JV.ÙFãÜ)_)䉆dýaµÆª¤0¯"ìérá#©PV…yEér5OX±æ ê¢@=æך¶u*àÛÁ¢Àr!}ݪf±=ÅF˜_´zKƒ¦BŽá¥s‹cÇs³0q’ eK¢ØɸÂ4Lýµ¥³—ó%§CéAƒäðíbÀtú%Ó Ïä›ÖîGmd@õæ›ä%²ž@¹fSn„ 1VfˆÝ¥ÆMµlUþº†õd}UšÁiàJóE]ù$õGíÝKÉT»\îî`ûð*ŠÑÚ¸‹x_Q'µo¸¥\CæOdÄøp.LB-»ÌÌ“²è6ÃÀvàáTTŽÙx×Yœd=¡ã2T±áÂf(\ÃÝꀨGÞæ@iîÚìõÅnxE±­ÒžcÇ(aÃK%lŽP†êÏ`¯ àŽkƒ;@¹îZ0w8Pé…»˜-ÖGÜ"*ÊðbEƒ-âåít2N²étO6­ù¸¡ü€m*¯yz[Ä›ˆ{6 A€$Ä=+UK@¬lR±$¦iÌ2F]7äAâ8¡ë:>wâ,µdþmÃÂÜäÌŽGÙùxô K€èÀKD‡M’Ë8@Nàer‚qoèÞÄŠ€–o³êÜ/®´ÐîàŠI…¹Ka 0¸oƒŠM€ûÅõŠÖŠ'@pà—¸êàc:›¤ó«݈Í/9‹.øÜ/n´õƒqpþ×qýP9x‰Ê±v6fÔ5ÿ51_à\ðçâ)âc}€Â+x [Ôã<«‘þX%<…¹º¨<°YÝd^"  ¡yí ±=8!W‘ÌŽ*tV¤ïnùHø™‘[ ÷óŠà~[ȆÚð4¶DmVí@\?G]«Z˜¬¹ ­Îo-Vr¢6D³§ ܾF”ö³”ù^”Ð~âÓ”S/Ö n„Š³}˜5P˜Û°!€ø_Qªøc¹`:!€øaQªèc.•fÝJUêÂ&YÈ¢TdgK{ˆ$U%t6¾W!€x`QŒÆ]´ïD©HŒIzªA½Â&¨WuZDE”éI»¿oà €2,¢¢ Ë*û…Áîõ¾®AM1ÔSõTp8)€z%¢ª^É#– §+mÄŽ`Åh+ÛÈç3‰¬{B#âŠz'7›š[ê¬è€é®¨g‚UVÀSs ñE<ž@\€*„ˆR…d\Á,v·@¥›ç– €a ˜ ·LAü¦¶„¨ÍÏŒ 餾+|êx‘Ej pøaìd¾Ú™×Ÿ‚›”¬_ÛÏÅDt‚¿¿²Ù¿çÑðgµ`~ˆ¡Ý §µàveîäÏéç#¬úi°·±}@Šha"zÍ[‹¨röeã„2D QÌšŠì ´°I'-€ b!,ï‘E÷澰Έ¯d·³ÕÆÛ.¹¾&ú“Ïîøäò è_¥ð廳ܩí»Á¨?ÞÉÓääûh’‘Ñx¦ßMå¯J¯|y¥^ý2˜]äÒæŸß]&A ˜èªHg¤~¡UðrEÑËE¢Ù,lrC öW”bïfrp‘%‘/™ÓIerÎÁt5ÞFy e+JQ¶H˵¥cÊgÊ>nADÕ QQœöÿØ»þç¶m%ߟóW ~¿$®¿ – übwú’¶¯7i“iÓyïfzãÐV*K>‰Nâ¹LÿöÀ/"EYh9ÉÍEDzD. `w±øìâ~¸asܼuvÉÀî®ç­|K`=žá9oø[#òKˆqKˆ[¯)QòŸ!8ÿ9€2ñž(1‡aŸ†GËÀÈá0#0Àå=ÈÆC°fÞFç_ q!Ôu‰8’sp9ñT7»²;Ö Û£GßR/ágæ·ù´s(jX¯8Ll5E]ÖÍ€g¨dþŽüÝ𑇲ŽAàâÀ/“Ái¨Zgùgúš™ Ž<ð•ç›Jžojy>G "O‡-­àµ÷/#;!U ù7ÿå/<‡ÍœQ½šé»>uñ@Ò¡¥ÚÞKùBñ?ë{|ypŸÁ‰]Ç dà ¾”v%èL†ÎØ®zP»õ±ÿXq؉ÁÁ Çà km×F:àŽHº©êæ®Ç dpB„÷Ðpd>Aæƒ/]‡B¥cœ{Gfžp×ÀyýòùË4S&CŠ/&ÓÛj¨|ûí·AcÑÔ@Æ%5ø[Œq¨4“1&ƒöîöìLô  “²CçelÜgQ78÷ ÂöÖºŽt28c˼ëÕ¡Ý#U¯#Ÿ… òYDõ: Ö 5Å_E:,Ë ÃÓ®#S‚dc@-¼?ñÀª×‘*@RF©ÞPhvÞ =ÙW 8RȆ”ƒ{*–ÏqÀ‘ @‚Îf7ÿidpb‚ï,u¨älÌ®…|O‡ ìzÑÔ'k@}_Y94e6¢l­ì/È„(È´‰NbÉh¢HZE†™ŠyžÎ )†/p?¿/øL±à(¹ ^%— Œvt Ѩ<80Ó0ÄLû©d8 Ò—{jpªa½¢³ÑíºàèÏY”5DC?³µÁ½{6<2,Ë¥‰ü‡Â ê‡z"6Á놬{ç˜nˆÇaÁë†x<ølà³½±‡õ„K’cH²Œq•Æ8æ„* 2WÚ ”¸‹ßÕª´:gƒÇÖ0òغ8Àà° U~8ʤàLº¿Hj@bƒ£¸8 Š‹ûMJ;š¿öŸ4Ž*á wÛ>µoá¨Aƒäá[8ŠC2Ôªž£ÍQˆ’¡3˸°ÎΧž£Ì9$ãʘ@âÐsɈŒgØškcˆúg<‹8L`-ÁÄWV%5&]é"Œ Fn…›{#“,¡ ƘòHfœ§y$8QŒISŸ-#¶~=̺Q…¨ãGNfZ\(ÿÊ nŽZ7§¥nÝo'Î~‡!ú}dc7Œuk¬®BõS¶®‹Ûãt9ÏD†µ7BÒ"Q9II,sªULL$°wŸƒðZzà@¸ÃáîGÖD‡½Sž¦mÕÆ¿ÿúÓýV¿9ñòå+ß–9€è0¢÷Ÿ;‘7Ú#ÓVa›—NšF£(W¦>Hšæ'9å\wdÆáµeHžvÎcNä*„LU¤HF$N$cGŒäy16|5' åsãÓà˜u_6Ëkí§”ž²TÏ-H§‘žÝ¤M# ¹$„2¥êA\‘ôŽŠŠˆ¨LÑ\DD&LL4&…"¹ÌÓžp*Ò!Òqøƒ¬€5é,êÊ$>Òá'‚s† ½¤ãŒæ’BŒ£\{Ŭ¨¥c° N¬…+²XK¥È3ÂD®å”Cl$TÄÝ:5–rˆlŽÊ  /›JCyʆŠ˜§‹bÎ d©Ê ‚q¦gÁ”Ö³ª"é/œQµI}¥ãp·Ù}阂ñÈwä g±LË‹4†4ŠµÇLeLA1,¥¬#†¤¿lFœ+ã+‡Ï8H‚èK¦*Óà)™TkÊ3ƒ’Y.h’¨¬HH.dÂôhª÷:«BþÃfDí'_Ù8ÜÙA"G_66îã-†IB‹ + 2£Úªp¦â$f2–ŠªU(É[6c6—}eãpÛÖkßûu8=©ýLÛ1žŒ83`-1Ãs!ãÈÅ€1•åÁ‘óéˆ.Ü·\½v¸DJÃyAS¡ŠBpÈ(Í!ãJHa«6À¦rõúsÔA\nÚ‘Ï¥ ªyX'ÚŸN½—Gd7Ð1cÆë†A©zÿ¾n[XÍLpÀÁa¯_úA§Õ†½yè“O"rÀÇŽ(›´4l@Kï[øP81¬Á‰=•œî tDåXpÀwŽ±6[±{Jν;®9Ë®4ͨÝùZÎ_Y9€‹à\ˆÂ2°ë@/B@™áµ¢„’px2 Ûf~óg#Et w7*ý0ýdŠÒQ¢%z=5Ž£ê.°1£è.0ÿ kõ„M7û2á0-Ì}@XYŠ=4‘M€ô¼šâý+Ìí“]¡ÔJ•™gô HUèûó³çª˜Ì&檓§Ç¹UbÝ¥Îùr~³ª_º}‘™%-ñ£Ë3+Ú'8Ú’f¾mI³º-Õ6ÞòèÒÿ)1¶O9÷(Úà–©ˆFŸœ4¥ 6‹]LöÎÄ%_ }T]¸á¢¹^;þ!ýõÕdÆK%í¥¼œWåÐøÍÊ´ÛbøÖ}ÉÀ_ÊzhTRvGœRm¸[Äfñöï£ÎOWŸ>Ù鄈Ö&D,DõðZw–»x¨›“û"½»ÏV^ Þú¸ó­-e:¾éz'Ú³Þì$'í‘lA‚uc‹ü;§t·`ÍÃðž®D Ä©û'Þ¥xmEÉZ¼máÇ Uî.¡à¯ÊÝ´Vª¼[˜a»x÷ÑêÚ;4úw‹¿5ð“e©uºÉçê}9Ú­V§+­NGÜç/p7­•À{éuÛ%Þ¹ô`ÏËk5ûùÕêbTÎÑäêzZɧ"g+‘8E$©EîÞ¡v«ûïvo×Îz´‰Âã{¨d]¢Ø`ôWöNœàPÍîíMÕA¨Öĸiµ¶Âz…Î¥d3þ{·ô<õÚÎh=¹K“›ó3j““ðØ÷¹¨Ù.„¤]‹óÆ7¯oy-ƒêèM•ÒŽNL8–DH‰¥ÊSR%R!5AíÁ€à>–¹nZý¡VíÒyÇ:ÖoüÃÔ”Qk†iषž»J ¿ç㦵ò|Ök:%Ü¿aÃÅÃÝE}é„çÓº4ùn£¢ÙÊãÈÆl¬8aÔ+álßÀˆ¹þAw¨Èj‘™€ñK½·i³Åh§IÈîb£ÉÝIþš< Ø :<[ÓჽÕ1îBëþ:ÆM«³ºê”oßîb¬®¼C±üÒ±Óîr-µÏh“¬íøÝ­vIWÚeŒî†ð€BÓ¶Jº­õåÛѸá»E0Äk†õÒº8ÃR÷ä\OOš‘‚% HÆ1P‘yIrå~8iõ½¯á|˜Û>‚ëM‹ÚõÀxÌ–‹;_& >8"÷fbã!m!1… 8A4fKÐ"í/бéÖa­ýûw{µ)ðM4ƒ„l xÃùHç«tõ¨M\WfÈ&nxJgØ°·5ÝÉìúæ>!“A‡a`m‡a4Òt§ÚøK3²íPm }ä°Âjm¯I‹ÐˆòêQ´½ -BŽòêb~U1¼ÿÍá}_ûûíˆõâ}{Ý[„úuo7óm'Ôþ>Úüj8/&ù‚/nï¸Ì’ã}{¹\„ˆ?ï]îÛ ¾#÷–»y­œ°m¯PÞ·’G(ýŒå¾½d9Bô^rÿa²X–è­Z, øY/ô#zlªêìDîÛ #”}Ærß^ !æÁ{ÐãíÓQùH+ì‘ëÇ>Üßå+Œ‡!‹±ÿhµ\9™vú˜/®x¹´q¯ëùôöRÉŸjƒ?ŸV;×|ú§þ}¡´ý_ØƿØÅ^ÆìÊßaÐb/ƒfõÒÁùùùÁÁùý¿ûs°þùy÷³† ãßaÔb/£fù?¶?úÿãþÏàóö/óÿ‡ƒµ&òï0l±—aÛ;ù÷Ç}øw·Ø˸iþ?üõ×_þªþïþlú¼óÿñ¹nÅ÷àßaàb/gøG?¢Ï> WúÝ©þyìûSû׳ê³úç´ùÿúð‡á¾×ü;Œ\ìcä*þE¦мæSéŸiÃ+ßÌ¿iã[k@ÿØa2±—É´ügùœÖ|–úç¦áu¶™ÓÖ¶!È¿Ãþb?û‹ªÑ2[ñ¿¬Úð¿ä] sS9²þ+š¥î Žçµ[k® ×v†¦ØóÐ\$vÖ¥ØÍýïWÒ±ûÈ9ÝRâÀÝk*!±¹%µúën}jÕ²–ò«äF~Ò耣üþ2$þ*9Þi¾ÕÒý©å{iôŠ,Ÿ¿–¿^1úçd½ŽòøËpø«åé]K¶’Ÿ¬ÉJÖ¾šß7:à(?€¿ ‹¿Wdhɉ•£ŽòøË°ø{Eºþò¯wÀQ~¯Ô·«}ó}ýkËóÏ=¯µæãþªŽòøËÐøKNÉÕe­÷cõ5P_¹š\‘Krõ´¶õ#õ•“«éÉÌwµÖŸ¯ÌN dîòøË°øûó#ž¾PAbýÿæo·ýïò7-¿Ý`ßòéëgÇÀr†Åò{{¸ÉÏ,çH,?œ\~›ê]!òøpOyABÎÆ#“á˜#ï³éhöt°(Ulk"¼ÞI¿×¹ù,çX,ÿ^ã`9GbùcþT=»˜IòjpDÎG…ÏäÞÈ`9Gby_–#…Ì&¯uDwf4&õ¾1O壱ΠëüÀì ¦³O¦æÿÉbî'?€å‰å“rT ³ q@²©$—ºöÝ\o'^N'ÿ•ê‡ùçl^Óî'ç瓯£ñz§¼4Ûÿ3Ïñ°œ#±\K|!ç¾³ú»Ê`9GÇÒ÷õp”ÀrŽÄrú¬±f¦¾Y­ûú2Fr±˜éÿy¶¬t–åšP\ÛÝñd®Vý«ü–s,–“zßmuBeM¯Í” ¥WýTMŒ.äôÙÇÀ_ŽÄ_f¿ç5{³µ˜ËE!·N‡üÀ_¥ÉµøÌê|ž»üþ <þnnä*iŸ+Û>1)Þ‹l.§£ì|vcKñ7û¿k“öÌ]~ù32ü\7­÷ •v,,iÙ¿ÒN.5¢•:-ÇådªÐM§·§“‹É\’Z­æ3gùüØXZ¿â*õɈZ‰f“jþU#à ag—²Ð0§ Àjàj€×P7›Õà(?€¿ŸËþ.ö_ø+ø;|ÛÁéëá‡N¿KÔÏïû§¿ôŽºGäÕ¯êÅ.éœ ßžöÉßÿÞ¨—M´R‡,“#õõ+éþí}¿;õ&Ÿ~8,8Ü{÷þ¸§¤VÝèwN†½îà@9û‡ÇgG½“7äÕÙœœÉqï]o¨Þ6<=0½³ÿÌU~‡‡O_“wÝþá[%DçUï¸7üÕ ðëÞðDîk5ºò¾ÓöÏŽ;}òþ¬ÿþt ¦GÍÚQopxÜé½ëyØ!‡‡{'j|I÷—îÉ ÞvŽ×•çUW |çÕq·î‡Rš£^¿{8ÔS´úÉw8,8¬tEi½üã2xß=ìéºë*ýèô=ÐÚ}xz2èþ÷™z“z‘uÞuÞ(uyÜÐ2GùC‡C$7•[-ãó~÷ž¥[ƒ³Wƒaox6ì’7§§Gfµºý_z‡ÝÁ r|ª×ïkr6èºúq!€Ã!‡:ÃŽe%¸Rz%”Ö›³AϨïdØí÷ÏÞ{§'{äíé¥hjB:Jà#³NNOŒZ¹ëOàpˆÄa¥í§ý_õ jM7 ø€|xÛUÏ÷õâPÊ3ìw´¢†ýÞápýmª§ÃÓþÐKÿC‡C$ߨ19é¾9î½éžvµd§ºzƒîž²5½~C¯ìÕß3£^z­«¹Ð?ºÊàpˆÄá ;0†ˆô^“ÎÑ/=­#K•Éô–æÕ¬ŠÃ·Ë…üÌÓþ„‡ø=åïâG„þ†Hüm²èLÕ€šP§<Ï‹l<º\œ+wúæ+¶…ŽÊlžùÉàoˆÄßÙ5äù°t/óo>i Gùü ‘ø{(Ë©ò_Õ‡bŒ ?ŸÏ_ÔO?[>ý×ÅÓËÙ¢|VMþcþ ü=õ@á‰ÂÇ“Åhöôd"ÏÉûÉ¢ø,ç¦7O?»¬Ÿþëh¬â²UGî©€Å>&¾§‡£üGÏïzîÖŒ£ã2jAÈK“w)äl6™þé/Èh\œ/Ji”r6/•{öYk [/È‹Z h4ñ‘€°¨ÂÚä)êj\îòµ@Rûøh²±@ÆD±Z†?j1üm½¼9­¡³·ëÇ“¯ï ›ÌΟ¯ßæ> €¹Z̽Ÿì׸hÙo.qq–<L|Übâ=G}]òµ*Ò~â>n±ð~âGÉšø+º¾§ð€u}¬{ X÷˜û4 Xè”<ßr@ê6Ò€Eï”\ó¦uüò<ûv]ì^™@€”ÜçÃÍ‘‰Ĉ}##N<MÚLùY0i›…GYQ²€ó´,igaÄÃB”¬ JQ•úÉ’eÁüÛæì‹üöu2-µ¿P×ô_¾•´Ø¥ëK_¢0äEY%¬LC‘ QĹD‹„ò8XÞx±´\7·Â//Ç!õí8·£k×Ö®Z1-¬/Ûûb®¶¬»RßOþ›–À©t§N†ÑA}É•‘© )9)mJ‚kƒ´y(q[«óÉ×?ý¥š¬JC’Ç#ò’¨w ªÕc®~{òd)€&)oHEHe* U—Š´þ‡õ@ŸægJƒ~þÇb2qõq^ÿ°li;&¥Âo¨HCô<ŒªëiXªùé%99;>Æ«=`øÓÈÿ…VS°eBEQ¦"HDœq&4gAU„¹.G–Wts¥ÏFÿ2G—W=BÏi|gEzòô)Yuþg?½P%M,I}–âšÝqY@ ‘¦–pîIþk¶1r+ËþÔ¸¸4<ÊDó8-iVq'A$yšFy™G•¾%Kçn.‘ýmô;rfÌì-7÷´ßQ‡>Ž}t†ÇÔÕë ÉþÙn;(Ð ò|&]\6 œ4W¯ßËŠÕæp¥_¾£ßŽêuw?¾ÕëmCô<'’Ÿgã/ºÞ¯®„à2íÖ_½~wŸà¥³S@3ÙêõïåPàȵz½!ÚCˆv»­^ß i€#Ó´yd×(`Ëš‡¢qÞ1ªâQžÄ< SÎÒ8áa(X™‹ˆF, ¢¬ˆjÉvUaÉš*(‰Ó ÐÕâdP%QЬØô’î?¨ÂzŒ8H™(í.¤¬»}ØÕœ ¤sÈ՜֣ÍÓz¸F”l¡C5Úz–±Z‚‚ šŠ˜VyècBI%e™±$Œâ°Ð×Aë³õÔaµèu«Õ²QJ4dE–ÊX¨°"–±  Q(’¬U+ltæA p؃rŒ_UŒˆ>Ý$°3 ¨ o:W¨tÆçÑŸ?}ÕÝOÙô‹‚ùÓÁñ§w¿}Ò›“7XáŠ[‘5VonÅeÛã `7ŸíñV.#ÂÑbY–Åå2áE–Çe¨ -P —§eÄ*M>ÐÅl…íhù¸6È …”,aQ–å¢Ì“0–‘¬Â8Š³R9: ¾¹ú&ÇzóçÔì“Ñør1GcÀé¤(N§-ÇüâÒs uR‹Ö‰öö°¶Õ¢c¢gf'{|'“ZœLÔv©+õ›ìKj±/QbŒH1YŒç8!À‚d ò.ñ‹Ó41€ÉÛÈ$kç@®ñ_F—5ïùòiYV^}ä~f®ê"¹¬&Óº¬Øêx— ê0€7É,Þ$"Ñ”Åi’V “$ èày‚œM€Éè–Ít\Àa¥À5h·e,ê)Rƒ`°˜tÛÎñÍÚÃ$`К׵à̵÷@Q£øø'­ÈWWD)4yé¦Á÷q¼ñ‡Ø,%µ÷1Ûº«à‹‘†W§0jïw¢¶¾ŸXXjïh:-yÀzR¿ÝBpƒYó¾\£€}bÖyHŒú¯A«©h ¡ ù2†¾Ýñ9éhòœ®Ñdœ }EýºsAÞe_¤¾òW»ÈOçºöæØ\àê¤Kƒ˜1ÛúíØ·¿ý^<>²¿§ ©­MåB±ä>\îÁ˜M¥ÁÒûn$úÝ-À.ì`Í ;pÆ”ÙÆôV…íˬ®-\ÊÙhªÂ›;ºÄÀ Œm¡•¸º«À-ŒíæÀ%ڞƘm;rùÖ™®¡`|›3KL*Ì|^PûÔa—9poã¶{Ûø¸ðtp@€YVfY©X¹¸ÄšåßF¿èΠ À ëØÚÝt×,¬BfÜ:Làê,üfñÿÑîÀâg>,~°ø™Åâo±ög—åÊ91—\NLA¥ÕÜr\®j ¯øº¬£L{f1íÉÔúDfWÀgÍPÄxfã[†ûÕbt^nM§Áèñl =Þ©¢O#QåUQP‰¤ eθRµUiQ²Í|oíHšô Ö Dw¶…èn6ÞwHTG‹XÐ-,õJ­W‡?‡ôrfÑË‘– r³fñ|\£€ù´ÈÎn>¬Y˜Ñ¬ÁŒÆŽ`›eâq°Y»Õhk)ZÄÞ²¬+3žç".“2¦QIšGeUk’†¾¨pËÑë]í-§²(’,áYZde!’ƺ—Uåq™ç›Í^o-¯QúЮ?Pÿ–Eø¢SðÑÂCÖ˦ذ (nË"+ïr‡}@¬L0øÔ«e@½Z5M¶ÅV¨¼ap—-Â<“,’eX™Rý^•YEƒ(Š×7ÖZöÕjF\=¯X$ªÞ²¨iË|_†‰3Í¢û`G³Z.®Q;¢‡Á€•Ë"/ìX¶ÌeË–-k¡E5 ZY[}Ø€„Çš+k+ ðÞÉ‹ÉôÉêñh2~^Ê›_nåâ9ÊXÔfØ[ä¿Ï‡ ìXæS–ÔXÖ¬G‹j4i“á(Áa—¾‘—?˜£äbý£˜†ÄbˆìÞI8J|à(à(iÂÑÚÍMUTÎ#wcÜZ6§Ðû0 €IKÙ‰†ÎÈ­{ÝÐÚÇñIâwy†?pÜåj-¬…÷q$€¾ UÀ÷îP½—¥>¥¥P¼—¥>qP{—¥>ÈÙJaÅ€\Ly(xY)ã8å”2RAE¬Þ&ã´–l‡…Ø⪠JÙ“Tr^Å Ò,cYT¤¥¨ªTo¦¯›:v¬™åpˆÔ\nSso•u~0nj9À¾å>ì[°o¹CÒ»–á·–o©Iê"ÏNR¼Î}lwª¸E»Õž€Ê.·¸íøIÝm-÷ÁlwܸEé­»Þ­À—Õá]˜o)¶j»Ê¶0·ØÂøTЀùð³UÄ^/ßÂëE @éå[(½ëƒ‚î`»-‚/V|À 7øºØV»çÃÎå;—ShìWN1·±|¿œ¸³œ"¯ˆly¼¯/VÒwÛ¯ò`³–·;ÊX,Š;X{Ÿ§œø½œzX ÷rr/oåæ!Â…LDi$¨`E\IVÊ0Hƒ4©Ò$Lâ ”Y-Yò`9±Œ  i^f©Š8C™+IŠXÉXæLVU#'VœOÆ>LCn1 qáƒû7`r‹è5>fxR` r‹-ˆl@JT=à[£œ—K§) €®[8~ØT‰Ë@hÌ}Рêq‹ª·Ò€ôÄ6 çø-Éõc>|]ÏžÖFäÁ,p9ÄUlQE3³Ø‘ðž{pm8À6äV%^㱿gPð¹Åg\ËÆïLx—Ó%Íã ÷Y8š ôà`r‹ƒ¹³Áó>Â&·h˜÷ql)b[h–kìùݵæÛÿy€ÊÉ…Àí!Ëõq Ü4·ÊMã— Z£ M}€( ÍQe¡1 Ôeï¨Í­*ÑŽ‰.º»¶«M‡r `Ñ ‹E¿}™^øé@¦dz/°^>ÌM0ÖEౕ%–º<˜›¢•¹Šp’Ã,*ã”Æe¨üä’É<‰x\梌8§Ibm‚n9â‰tív‡--¯:—†A‘çE¢œpåü'ú_Nã8 IÓTʺe“»aș߼èn ü jEŽâ2ó…V @Ó|8Âà «B.΃³ÎlxPkÑ{ýóšW‡”vœNuuo?Rÿü[`q<Ô!þ¯Ø^}W}öL„ºÂ*À‹ÝkKW°&¸aÛðŠùàPJWX¥t±x¥'+YÌ ²€â²‚ù@PVøT‡­tPd¥I‘§yž1å’K,«‚, ʬȳš¢ øÃU%â‚¥U•¹K&X^–407ZR9ÏòMr\d—³Åy6_Â&½zˎζk@‡VK?B´éëBx[WXlÝš!Y÷á;r$ÀÔSw#¹;ñ]X’ìûÐ"Àøãw‡ãU×-p©(¦°°Ê”îR|Ç=00’…ÅHÆ5 0†…ÅFsë±Cö Ü áÃñVì«È«Bxp²ôC¼âåJªâl÷Câ—…æå¿,´&KVíw£/Ù‘><Š^Ú{§<—X »…?Ð]gÆ?ðÙ!.습À‡X~Å& /²ƒˆqÓ iè†ucî8Äa!õt8z}¯2­õI¼4á(§˜š"ï¾Vuc–%=¿Ê³XJúÕÝý|¼ ý‡ˆÙr,H™ 1DKãíF#0O×¼Û;Èo‡NTd«¸¥µUžÉãÂÇ ±”+ ‰]æV%Và‡flz„ðÈ´l/ð@Z4‚!ê´š#~„è!ÈAqÚjÁ†e‘±ú÷ 8ê8ø1(øo-ìƒÎW¹-©Ú#ƒXL£¢ŒYLxél+*£ïŠðïµ”ë@íAœGý´S0l‚4¸8ÃLôWí­æ$°›¸¶_{8`©†uä˜>Dì…6l¢±—ÄAW,E|`ÜKGkèuâ„øVlÆ ûF¾8a‡$aQì‚òªÓ›×ЫL«…¢UˆÎãE¼óÈ֋絬ofÔRVG/éKyl$”J´_;þš™åX-é:°Á×^þô«åO@c–©ÕAIúÜ9<ÀIs»zåå> X3è°æ€uÍz¨ŒôGÀ¸`¥0#<¨ŽÞ÷í°mÁ‡c,xuìÍ^dz]°87Ú{¥+X«âöAW9у´±Ê XY{©(æx© ÁÚ)ßrè—WZseTÖUÅ긪ŒÑãÔÇ>è÷×QGH €xãI×çý–~WŸÆ1 w•ñHpwtlÓ»ºz¿4ªk¯uÀ”FÜÅ!õi¿åAÍ—TH¡ÎÕGŠ¡¾ZÓOòñã˜×·C¡É/_žŸIFoÑú4Îϯ—a4h“âåâJ^Ь0’4Ũ«%~·î²ªÄòÖäÄÈXÆó¼sãúMŽªÑõ‹ïj×îtaüÿÿg53lß°A´†å\ïÊ §ÌøyÉ¿ÅéÒˆŒ:`PVþ®(–W——÷÷÷,ýøÝô"Ín/§ Æ?–jæ‹7Óùm§FžÅo'ÕËÅíÄ ³¢¾¥!œ”­‹àƒ²ÈpIV ïF){À¿˜Éõ‹/ž¶ý €X A] gW´Ì!ó0CÁ¿0"Íæ_1÷jÛÖ–íº.±\Ó³¿€.fúÖ†yÈBlûYá˜1Œ/"šéj{½U÷?ÑŸ7_¾ûùë÷ÿ÷Ë7¶ºñËïÿõÃ÷_“óËËÿu¾¾¼|÷þñ÷ÿ~ÿã0ØLã}F¹@9:»¼ü槉Ñâ÷ŽÝï½üˆiYørùñ¼h¼yÁ †_døq>[äo7$c…a(ßÏrÊàÏœ€-ðì9hqÓo'_K<!x 0ó…|ù+¤Äœoÿíy  £—ÈßÏÿÛù×é|I‹i4k¦óý7oÃõ;2Ê $Û4k<÷N"“D$ñB1-füºÂÆ+ƒf}®4¾Î¸ñ+OxÆ8Q&|ñf6]üYÂfA#x2Ï'FÆgöô0ãùçÅÄÀPòzøæ”ÇÙtY4ïüA?Pyµ„Ò?þµâÙÃÅ9ÆFÈ;z/²‡EÎcl¶¼ûv£¼RkÙè]¶g ÓH©¨ér"©¥Æ"- ±yúÅÝ47à!Pi cŠœ•æÀL@8eÖ_Jž«ÓA™ÒŒSì: MxÌg³|IcÐXÞN̉ø¾Â(¿_¿0Þ²4ð!3D [òéí]qe¸ÞòãWøÜdÕÍòõóOàóÂåsùŒQd™¥€ü¤æRu|¢¹quóÁÕ°¾:›æEynͦk5­Iö¢¾×?ÒéBÖÿz[m`,ÕxqS(?l<ž·ú©¾¬“]@ÂZ·ÒxG * ó›p±Ye»R«j¯²LDº×©ãk»t8Ð7'õær5“Yµj[ÞvKÞö@o.‰¬ãÓú̽²º¥µSùN^Ó©Q³>瀪wu…à‚ø.ÆwB…{|Æç“Æ^|V…²±ivÙ‰ãľÅ¥.÷iBl •g%‰K+ªbl„®]pH,w×ä‰; <ÐG’ÐOL‘7Ü2À2t¨XçRÉ ¯¼¨­Ñ©ÌUËIÝöåå|5ŸÓìQ«j‰¿$«E|>çˆ 0ô¾…oE•q·µ8éØaòÚV.ÂÄÖXWA&Ø­Ce}@/Þ,;×nÓâ™\—‚ƹ!/¥h¤‰Dvì±R’Ë5`Ë\dÍÁ4›å̳f-}¡-‘ãÁ}ñv‚q5wvõÌm–®–•¬ë0Á¶D1ß ±ÞÙ×d%Ä62„7¦Ÿ_Q›ØžíÆ$¡v× ¼È1†Ä4Ã8qË"Õo}oýVÌô ™!©LŒåWÁzhcV±º˜{/…_Û/EiQ¤[zrCÿ‹FiÑÔ•]bíhk´VŽ¶fâUÓVÂxÚ4f s};²Ç™ë8I`GqØÊDf ¿´Ýo7‰=ç@^¨n üoÕ«“ViŠyk#»~‘(¢VHœÄrˆIiٜDZ>·N«‘Õ¥mÈÿ±ÛXÝ°C…½OÃ&ŒÙ<¦‘E`oÆ@|䙶ïÆâ“á +çÝŽÒ´êò6ľ^Âlnqöø :TÈû4¨í¹–å¹k“0ÒSfBݸåÛf8ªA ¼ã »²òÍÞQùçÝ@ðñ>Í’F¾™Ä¾MÂ(ôxl¹Ä¥Ç,›}ÞÍ©®|£ë˜>ãL݆CåºORÏc~Aosb“…^Œ5 lfš‰)ö©9!òT—¶!ôj‰üiñu¨€÷Ô„ˆÃÏuBæxŒ8ŒF„,"Ü7Å~Ÿï€TW¾QŒ:òþi;ÇÐÛ§s IlÇežçF6ñü€QŸeΗGDøï Â¥1Õ…mȼöÙ8RcZGR¹muÚh{©ÛÔô+ cǶãØ‹GfâZNÀ…oE:%–¹6ß3©ïºÄöV£åسÍÎbúÑàC]ûFi38ý‰øͶOqô?nû¡¸aè8‘$˸\ 3>Ž`Ž…!êÂ6d^úѳ)åÊ”UÎè8Å¥nÞ¡"ߧy™Z1ñB×enâ;nôÄ6‹@!ÌᣚWF¼¥…Õåm4Å-/nÄ (†éüfúhí­nã¡rßksÛöÓ¶I`Ù>vH"ß (˜õãSkcuy··1Ž°ã·ò Ñ Á¥•æ’QÙ‹&½«Ë,-ÒõrfwH®Ÿ¿¨¶‡}#¿õWÖ{¶r§^qµtÞ|íúlÃÅ*-”ì\ní|\kuGö¥Ë#Ÿ—kvo.áãëNUJg¥pDŠò‡Éõ&QèI¢­Vi•9ñ‰KÝ›ž×*¸zø°éEUñ7–öåÖ*ôßhfÐqïè –Æ8¢–ÍÓHÊ1}U®²VCîå5üà/›Š±F ±:‹.#i²9rA–ÍZÂESV\ÿ‚Ÿ9ôJøú†1éÓ»Õó/*!u¥Í¦>ÿ˜.þÙ…éF[T]¿Ó{(§¼dä•Ë®.ÏS6M.Œìí“+vÛFŽMiýGx°Œd7ÛžÞïdV÷±XÏD¿˜µªôÚ2äfº²Á~Ÿ×­õû’ ' ét„íŽÎ¸¤ÿÚ8·Œ9§‹ÜÛpË\d&ØÑÖÞÎØqpwÝísnÏW÷¢räT˜).?j¾¾v]À—/DïÄòÔ. ùŽ9•~FkÂçêJ*ﻦe6îˆÓLB8*ÉT( ¥!)ù”¢›:±ª¢M¿Œm¬¬1ù÷t¬| …¹;ÿúùð| Ûiã@l!·/¢Õt†ŒZ ²Ç(ýn–ã ]5©±L…¾+.¾Ä‘MÍÖ) €ºÆlÄ´Ód—ª"¥ËÒ&²; *ÿ­›½lá+Õ/ËÅA¡Ylì]nçýCó`Yñ}ékÃú-Z…&¼sõS'n¸Ùölg É!*wœ§ã:ô°áÍ´æK¨¡0#ãÉÍšÓ¢«OÐJ}gí Wª\B°tuÝÄikV8{U.®à m |(ÐóLz×-Ó<ŸF³xž¥«â剟ìÆ êe¾¿ãÈrðuºHÒl.æ‚Œ;š#%E\J†ÎÒ4ðD¶zœ»7êM®á×#3a¯fhöt‡#ºÆŠïÉÌÕÉCZ?q-Þz&‚ý©ƒìƒÛ˜¡²‚œ"¥b^ܧ=Ð;©ÄÑdbœ•4r~?ÍùË×FBg9(öp?Ã+Æûf.rƒß)Ø–xnÈr–EH3&§qjCAÌaä\ÐóÚ¸Kïù4,Ù”dšL1yTcå“óU^ ÂWe>šÂáÔ"© Š¹É: Ù­ÜÀhKA@ŠìcüYØ–Ô-BíÝÝÇlvƒNÐY8Ag=OÐ ž ; ëMÃ7ôt¬7t§ýÔ¹þ)fì„ܶñÞ”†‹˜a“üå1™¸a˜0›Àì‘pþ5˜?ž»‡”H¸U$Ávžà×3L~’0©áõt0ÙØÐ}›£Ù烚Ÿ¦?Ã'hÕôûÐ6‘s?ð¤˜òZ» ÜN?ð…1-ò†ýpÂ)øìò8Œ}P·IÑÈª8¸‚Û£­Þ ~,ë=Ѻ»†æ Ó >öL(Ï®f`Ñ•ÆóŠ”Ä¿-£ôœÁÃìXÏR„_OÏ*'çÐ¥±éÉéLçLŸWãŸ9pŒQ%vúTpºÓ€Móå yã@®ð ‚tîÓìOã~ZÜÉ4fšõËOdQè“÷]Ÿi9ZÊ<ªý·åfˆPM¨yYÕéâöµ˜õå4¾´üHÓ£Âs!4ŸžÑÿ}fG…ÓJǽINŒuU<à<«FHÛé9¤ïxhl’Ü8­¨,棭+­‹»ÎâŒÓ¢¢“êá5ÖÅi–ñ|™.psÆΊM½mfË—|ºÉNËSzs ì6ezØEr1BˆûØËf—í®+5è®ùw`†'#ÖÄ:Ë”ÃSÙáô6¨0;ü­‡¤c‘ö®å_ÃÓ Û2Û±éà3éh[vyöñ&ïgà=hÃyƺš7¿Âˆ{NÛ(>I6ѧAeY·Æ–ŽÒÍ t.êgåb°ÅÔÁ~žs\@*pã_Ž‘EÂÖ(»Fä¯xŽÎpbF°rÔu¨}D¾#9¤™*”:Uñ°ÁÃKX–JwË{Ð8D.øõ¬Àd0Í”’C±S ´šb3lã)´Yøõ™sË£Äxöï&‹È3ÄiÂqO?PS)Ìswy°oH”ü"N5šÆòØè›t)fzor蛳i4œp4vŒþlÕ|ÁÑû°W¹9÷`Ç4ÜÌû± GÔu{  ôÑ]Ö|§óåì¡1a´…N:{´ ‚i¾8Eü†Ì#¿KW3V°‘.fÖwr|¸9%!`cY±žDµ*÷P)˽Lå!g-Ê7Êôdßb74ƒ&˜\&O4)éy.|ûpFÅÇžúëÓ¹EÌc¸iLý S ¬Àê¦%GÌ î¡±ýïéÑ÷>»?·, zægt¸FОr ©:$¼µ~Ô2*v–îgåMÂB^lðÊ7H©Â²[Î(!ÇiV-FIÏõŠ«ÜEÉ%ÅOÄा%Žq˜Î3HNÎU®æó2¸öÓ²pA€x&æ/káÕàÝÒ´ÇÝ(åÇ°z0Êá×3µîG­[Ž~oâg}ø¼+zA¿\v+¹«+ùa %zÖÉJñ£!{ÓZ·ÛYÌþz˜euÒ1ŽŸÏj>«ý´Pè­óß]K´ö!ó0Í]ç¿»Žç“Æùïžÿn™Ïç¿?ÊÏóùïsþ»Ôqîžÿöžµ·m\ÙýÜ_¡õmnëýÈ6²Iº›‹ô$½g(CITë]ÇöÚNÓÁþö;$%Y/‡¤$ÇrŽÝZ±e‰‡óâpf[þ]Ù–ß–‘Õmù÷™@qöÐ4Û´,Ï÷±'²TÏ5õÀtCßõu#7ÞðB(ó/t]+uÃqU^Š"ÃÑ‘Z–«kQü0Òæ“Þ·^ø}„g@­{ô ÓŽª’¥RЪaXuóçÌM„Û†8Z”7¿b'–\¾‚âòË]kµå-­Ãµå‹ƒFݤ¥‘ãÖ˜¯W/‰>AùW‹eo4cAñ wA5ì‹26M«Ô¬|”J³„ÓbªpÇYŽe:†EQà»Ý´à;‰¥r±Kâ—k ` Vì2[ꨔ6‡=¶èf Ãõ\„4¤פV•:¾é! ¹*v5‡ºtË ,Õ "\³ q£Aj·F|:LüŽ.†i"4L²¨ëÜÏK6:¿3â?Á±c„ÖÝsPhk®X b`ÏÖ²»^ò¶KX§À‡vAt7%Æ—l·õrïo}£e ùõÎd±Ü„¶ê*Š|'ˆü(²Ý9ªoXh“†áÔ«\·²åC»ÀøS (,eñÛ¨Þ¤Z貶îz®îû&R‘ @õuÕP]¿Õ*„õ‘¶Êà÷}‹{`´!PGR«MF0§y>ššDºb¤YXyÝš|h8'{ÞÆ×1 eñÚd Uß´÷¢Ðô#;270ÃÈ´C‡v¤Ö«úº!³ß÷t+ÉúHBv˜š„i(ÐpZ–ê9$šF‘ãû‘ã9NÍi½!$ÁïûŠdÑœQ ø¥:SRùWæ Ÿd‡¥µº²±M-QVVÀòX_èY#ãogjY³È-É0›¼ç-MqÅ6Áýv±£P64QÀ°¡ôÁ'zî˜u’‡ ä!–![š<Ú«d- »íZŸg(ÍdQ®­ˆf¡ ×xú-l­(Dêf3ö¯«’f¤¥ø­”j©¥hD84Äø¡ZÅåcR«¸²™uIìðcq U­¹V€R±FCV®!’Õaxnx-•ð«YjÙùÁÛôQŽp5t7’*–  ªcz®c“ÌtäE VµfæZ›h>OÑ$£A 8ê:QtáÚÜæ]»hݤ¤œ©•!‘¿Ù4ôܶ°gs½ ¤|Ïä Y¢4ΚO+œK`¨ùy[³Þ§€¸3,~U%Àžµ R¨ÿu%Yÿ«’Ïí+gYÕ˜lz#– q4¢€¨Ñ±>”„á’KY®Gà€ƒá`~ŸèÖ·3¦tS(é>w¶Ñ ~&ñwtÌK§—lôc æ3<Œ^íøõÝ`8d;öi‹´Øe¶_ñpØ¡ òMÌ¡•0«àxè§pØš#m˜#e;B÷¼¼!’ ³f„èŽ;«Ôi7Ùq7ÅC*Яg¶]n2Þ§ÛåA@©IOóo2¿ï‘!’ÙØâÞÀG«È ‘ ðmÂ*¯'âû+²Ú¹ÕÍÕOí#°–ôL½¥É¢]óÜ>²F:ç¼€å_»qZ£ÄÃȿβ®¬Ó”H•Í†ŒlÜÈQHeÖfCVônä8¤ªÑfCVÃÛÈq ófA&UÍæùS½`™¿1¹l¾ñ Nò¼Mª²üE¥Æ2×Ì™¹›6Šâêx£´Ì 3i&šäG6ø`ÞƒÁÇtvßÑdY…‰âcú4“Z/M ÓŽ2¯zÌ‹us?ƸC<Á{Åb‹ºC¹ÿÉ%íw?#òK½O[açË"»Ü{z ¦9á¸RHë˜ÈJÝ*ò ¬eÑYƽf•¨È ¾**Ÿ¾\äÅW…$Qmõ¾2kÑóÌóéﯜtŒÂß•ü™LY_ÒÍú)Z HPíÞ8l=€Hà¦Üz®ÎDÇÑ ž?ú yæ]®9šæEZ¦57šÀÖ·Î,Ñm˺vcyqÃìºÍ,êš%yÑš®ÍbF¶]Ÿ{ÐJC¡s¥^—Ĭ¸O9ó\µÈ²ú—&€MÔ?¡zˆ¦ûUÇcåãùä•,ÍÏt­r#j æ@mVj°,7¢Ò`I´¬²Ðà[ÖÝŠ`ÃY.ÝŸRØæ$b&/q,•H6#U¶÷ß”*»”ÿÙQŸ6ÿ³¦$ÖŠùŸUËÙæ~Š×6ÿóÓäžÝßøãá6ô6ô6ô6ô64½øyd€–êG ×DYL7á 8Ò‘™F¦ãûža˜Q„-djŠ0ÄÝU>´Yœ?Í  ä—Äq“ñ #dÛ®æb°L݈BÏuÇ|W_3jgiãG{#ʇ7‹ð %x Çp<þëv²z3“V‘«jFD¾j:˜ýØ L≠±ãÙLãm07’¤F®=×ÒÁŒ“ÈÖzæ!L¢P’ZOÉÝzã÷> ‹äyŽz³,4¡834,Ã6K³¼ ôŒHõ16À˜CØÀ¶Y¯äÖªäØ,¶¿àù5ÉÏY»Z“B#‹ä&êáÀr²ÇA–øQ©º¦DõêŒ.å¼f‚6Ó·BU BìE‘ácüÑVMÃÕÁô‹¬8x›nWˆP€WÈDøýÏ­"%‰º®dÑ»ÆÂWËŸëÛ«Ôpzyé«Æ+ʵ÷ InžqÊÛ=˜'žXòŒb(Q½$6€Ï°±TÂ'’º"ë$ ˆÄZ‘´WKÀû×|ì*rÆ7S@ëäOdãÒÑ-™BÈHùÀ†¥‹ÈRäÒ-¬!)¦ä3J{„“@RÌ2ÿјRÖB»ã½¢4>¿—I¯C)î¤ãò(Þww&L¡q²ÿª¶—Y.¡›L†äAd§- K´[ñØ×­dD°½RÆ&”F8±ýüí ¶¿lgí£»:+`±Üªõ„›éù~Þîm¦oÄÑKnö®Éœ&L61«ÛߟÇݪ &¦ê^¡dbG²ÚT1¨B‚„_-ò¬±0b ˜&)*Ø©H` …•eË“Ôä‹õÙ®eiK|5rÅñÃ;¤›o“Åu†Ço¢"]¿rßBdó°Åg·ÕûÚÔ¬s’Š>ø‰4k]ÕHÊZmíâCMÊ­çv8Èóvõñõñö™_Å…MW‚m+'ôŒ —ɈĈ¬’)µó»q™w±‡Tç%•^Æeïn0ïv• g˜eÌ$g:"õæ$q´Têì­B%YþI!÷yíØ)½@£–a ?>Xj~ Ú³W,Uï½Ã œŠ•7o¯s—ð^xOtÐ|sév’`ÌO¬VÕ”Yh*!€nY¬[ :d±®ªñk¯Pˆx^£q…ÙÖ¡•Žºî»•ò­ðdiÀ‡á°Q«•+žQ”+”¬P1a•lU`Ya°T®tKÔuÇÆÍÇ!nÅB-±P@"×T#Yö¹í㻣 {×ŧão0ƒC‘Ÿ'·ó'Ëå ·É/›H,2KCW‚(jÙú1@ß„ÃúEËRæÛœÕéÕIäùœ@Z‘i½Ûª>ÝaÍÛÊ>Oè>”«íÓ|Ui[ßçÙ,kÕl÷ ù,YÓòĪAü·Ù‘ÏÉÕ¹*ÛV-Ú¶B•Š6ÖaJ×¢‹¡ Bu%Wjm ìyê^œf³­iJ%ê:^ý¨ ï2•$˜bZ‰*ÉÅÙrÁÓ)žMÆ#’·²è”LSIç,U±.B±ƒÕ iUùÔ–ÍQ2MàðÄÊ,”Õ5½Hˆ‚Õ}«"KѲòíÐ…ÊÒ*y x´¼¨Ë9(Û‰‘iÇð ݪ‹çG­|Y~m¨…A£ÙñêÅŽ–©ËpKlŽ8ÔâJ`×SüeSï¾F??9B÷DCk!ü,åÅ&{t»è2i’ÎC¦ïái›† Ÿñ4܈Ҕ`›§¬r!mDyʲ_d¥*—H8l][—„€Kbc] <û_JlcÓ*]‘'=ò‹¼Ñ³Û=ºa V£]¬7Ï^µ³y–†\ä÷éÏ*÷R%Ak‹²àFÛÝÁ4š/Û4ûØóF¹'-â+Fc²—mð¦¼ÜÓ¨Z7Q•æþÕÊ"=r;r“ab@-I¦Ðâ]"?à°Õ¹¶:W­e ËTó¶~M&Í¢QȱòdÄU%ó'Km:秵|Æ[\x¸c›\´U½…O¥¯n„ª'6 "­o"’R@;¹™Ã–Uº6s6$n:FÞ ÓÀod•ø%Ó@qø*‰!Nª“+¤R;Ý_Kƒ±:;Ö(j«½ü(ÁA=ýš,¶gGƒîž&‹]Ì„ÃVGßêèµtt-q&:z~5\r‡Àò­\5»´ømºqÿnçhEø&Q€¸°m¬ÆÞfð—@Žg¬µSçtÕ#®l(«-ЭHO®+ÐÎ.ßZ…XÒÑ’Œ¦ã›…"Œo&ÃûLàØ= àbÌ9åà¹òtb”I¢%(påí$¤‹•ñã&ケÂîˆ+u)øªÐ„÷ ŠHsSV«y¹ÄíÈ&â˜>2ºK®›qüÄ8 9³}åÓ\±Þß‘Ý$PÞǘ øÓ¤ ¬Ð»*!iq˜¬BÁa«îlÕZêŽnÛu‡éµ€[²"öÓpŠÑy"!’ ÃüžÂåY‚PK<¹T£(P+Úqµb;ŒõmuºœNÇdÿ{{‰y?Sööà<93›£é„ñ˜pâ ùLúš–=a?õú fÅɸó?¼y=#tðæů ƒP€¿ƒ÷ÿÞÝQt° Í80íË£ ]©.}u"wûë|>9è÷ïîîöÃñ÷{˜Wûãé—>Ù°ö=f¼/^n¾€PfÓà°—Ü1}!…læé€þeòÚ¾»oÃG2œb]"¿úãðžü%yóâ‡í«É‹ ´KŠÌ>!eËÎ’r+ÏPÉ 1MòWs,5û>©š¡Û?hºeY¦f©¶þƒªÙ¦¥ý ¨­<óº%óJQ~ðÑl>¾]ÞaÞïúzýãɇã«?>ž*d¸•Ÿ~9?;Vz{ýþ¿ã~ÿäêDùý·«wç0!UåjŠFLEÃ~ÿô}Oɲ;ƒr€«‹þwÒ–FnŽ?îÍ3wî‡ó0úÀï7ÃÑì°¢ÍóûEìÆð~ ³âÝx†.²B™|<¤17'ö.q`°úeDÞ…c…„®Ä qÔ„‹vI(쀈¶ñŒÉäøÑ?2q˜¶CpŠ@Ó ÔuxH*z vöÔý>¹+éõœACl=…v({ó@±ìÉ÷Ÿ{ÌF “ãÛ÷†8‚KÔ} ß°k”Étü'àÙ =+byJjŒå.¤1(½7ê¾·¯²ágÖ S”Ä»Ûxð'‘‡9ÓHyV(£1*`0G½ôš ü#ôm:¾Óz‰'”™XÄ·ÃÌYˆ²p oRU!«Ðþ¾y‡#Öÿè Ž{Iäþë>ÜXÕÁÛ*kè}zZ¤4Š"½Îµqæ2Í º¼µ¤ÇÁíôÂyoÑ:1JóБé]ÝÔëþí06ËãQÍã[Ïá[—Dx5$¬çp—®¾ Ç>æ[ù•éQ¶?{ÀX¿¦‚ô;½˜Ü“A*üFbѪ=…á`zšfÊåù>öqàD–깦˜n軾nÄàÆ)Reá…®k!Xy®jÃËCQd8:ÒCËru-Šº}­æC@®y†Ž< †‹#7ð= Jçž7Ÿn œ¥OIp\6€i.¸_üÔ¤XB[¹Ó”;¾ñ¹¼ bYŒjúLÖNñ¡‰ÕÒ£þé…}dÙq·~'N¤0[™Œ­š_Ðé>íq¦ÕhŠ¾Ü°¹–9K\HÍL,©2ÉÜÛŒ©f®{o‘j1é&þÝ©>Ò¨ÎiTÏ5JçBöÒ`|ÀïïüÏ^Ó×ÎN:ù„`78°y„TÂMyÃÎŽRýJMÄó?EÓû%—Ñ&ä`79°›â°?9Þ-ìV¼/XC¿ U¶ƒw›»Ýa¼;ØFôþ–†á~ÃÓ]pÑí¾j÷uU3[Á»ËÝí0Þ=ìžìROÔÔÇŸ¨©"Ø’{$GºhšÈ#wÚ|ÉÁÏdš.¿²0j/3™ôÁÒ` …3ê9œŒ‡÷_q8ECøcV‹oŽ†Áß/˜$©¢„*?G˜iBÂløç4MH Q¾´{}}½»{½KÙ÷nñüuö\‰CÉÁÏjšP£ð÷éŽýü»t>ýFŽ»….HÂÏlš`Û© >ù÷¹ üᦠ7€ÿáŸþyø‡³ïªó™cÿzñ¹ü§ 8¿ò«òpü |„O‡ð>WèçCú혋߇ÉñXyøL Ï€$ü!§‰9ÿ…ò0|PÆ1œÞÃVT ?éãçŸ ƒ_çˆL]HdRø(œÃÎ9¼oXGÕð“¾>ÐdHH~ŽüÕÅä¯Â¨e´€ÆúÀ` sðÃ?e¿Rè€$üù« Ê_€ã7 Í=ƒŽÒƒïÒ•ŸOág3†|þ¬d; ?Gþêbò—Às–B–À¯d`U2ïâ1×Iø9òW•¿ÊU NQøs„Ÿ#uQùû œÖ‡?ÛIø9òW•¿pxØ¡Çì{§â|î\ŸQÍ礒ðsä¯.,•ÊÄÑýÞ—ð”‡ñƒ2Qö¯ÀÛW¦ ¢G˜ëý„í0A&?Gþê¢ò÷_?ÞÏ`$²¿ùoËþÊÜóÈ·…ì‹O§g%qÁ‘庨,oí%¿Á‘冠,?OîY@åËãW ueœ¦´rø9²Ü•åëÂ?G–‚²ü¥±gogXùåòD<šáWO?G–‚²ü‡$FmàßΓ“¤3ƒ‘‚HzÊŒ«ùs3ÛUOéßñí¼üYnÊò›q8ˆ]„Ø¥æ&xz3˜“•Ñ´ÖËÚMòU‡Ãñ]¼(¤á ³šøçÈrCP–ˆoðü 1ùËÂϑ冰-ÝÖK~Ž,7e¹¶_˜4?CLûÁ8„ѹÑÜ](ŽoG> gR¾;ÏaÖïÊÂϑ冨,Wغ-®gèšLÜ<ÑC?¡‰Á žî7Æ?Gþ‚òW/ãðœá7 þa2‡·®‚ð›ùkŠÚÒJJuÆ!Ù4!?Gþšâò7¿ Ðö·Ó:Ê šcP&†³/¥ÌŸ®ÿfm_~Žü5å¯Á¶©†“›èÄýžÆ‘ 3¶Âñ””„’þÜŒç$_?!«ùL~Žü5EmiÀ? øH·õ°½8ãh~‡âd}DÂÎ&8 bŽlŽ%‚wJ܈‰ºËÒ, ?Gþšâ¾ìµð“#MAù{õÛÙ¥rùáíÕ¿.NøüñâÃÿœž(¿ü?ž*GŸ®~ûp¡üç?G—ð3µV˜ÉrôþÞ(§¿¼8½¼Tà¢:ýàÈaSPŸ½ûx~PC7.ŽÞ_^î*gïÏ?œ½ÿuWùåÓ•òþÕr~öîì .»ú°K{W¾M~Ž6åð‡·Ê»Ó‹ã߈£_ÎÎÏ®þ ~{võž ÷-`÷HùxtquvüéüèBùøéâã‡Kµ“³Ëãó£³w§'ÿÏÞÕ÷¶#ýý»ŸBçmŸ¼ˆ’¨—4 .›¸miÒ'/Û]Üs(‘J¼ëØ^[ÞnpØïþ II–dI¤l§Íb ˆ-QÔp83¿!9®`‡8ìhâðÉð×èÿØ?»2.?žž…ç‡>0þð‡Ó¾lÍñÉEÿèŠwQömU=Pà°£‰Ã + õÀüÓ-ãòSÿè„éÿÔù8¼øy‹K÷ÑùÙeÿ¯¡Ü4Ž?¾qyY‘²ŽôccM® 7¨ñÑõEÿ#ï­Ëë.¯N®®¯úÆûóóc¡­—ý‹OŽú—oŒÓs®¿ïŒëË~W?+pkâðñáÕ¡à2BDq¹¹¾<ârvÕ¿¸¸þtur~öÊøpþ :ä>zr~&Ī»ü`cMi?¿ø™3‘KºPà-ãó‡>\¿àÊÂsuqÈýòêâäèªX Zzu~qµ’üccM^ˆ±qÖzò¾vÔç”ó|>¹ì¿[srÉ œHf>„ö^ ñâº}Á¿v¥_ÃX‡K8¶% ‘qòÎ8<þñ„ËHJ#˜ÌË“Ô¼ ­8ú*òΊö+pë¯)?+ðkâo5ŠnË 0uàyÞ“Ñ`2‚;½(™E[ðñß„ºý üÅšø›ožíŸS÷2|XeZ¢#ý üÅšø{Äèüãä&AÈ߇Éyy'½üùöd6§;ñôï·ÉÁø µBÂX…OÇóÁlûl̆Ƨñ<ºc‰hÅâòÎD^þÇ€Oòf ÙP+\»úcâ }:Ò¯Àb÷ëÇwívk€ŒÝ ëUª@H×^¥Rl¹-°5“9›ÍÆÓÞÁ÷ƒxDYlœ_žÞ|:½¾:¿¹>»8?=½ùÐu r[p¨LPöÚ’)O…ÀÖ&Y=n ôÔ“¬÷Zb¸Þ*ò 0ãn‹¯ÊƒÜú! ß,¡ƒñÎ7rÝÚ¨°Çn‹=n''‡+ä)L«g®ÀtOaï¼{×ÔÊßæãäÍÎήÜÝ?ƒ¦Š+Ý«0c^˘BEW¾ 5ʶÐ[Åz [è9«Tª°gž¶=kHƒE_ÞÜD“á|Æÿ^ucœÂVymU±Ä¯ìáËxJ妩é(-RÞ…#r8€dØ;´Š (ìŸW¶†ñÍz&ÐÓ7lDq·F) ž§mð:½ÖW˜5³æ+Ìš¯oÖ @}}qRëÔ¤7ଠL¾ÂÔùÚ¦®ÛkvÌ_ÅŽùm¼Ø )ž,l DÙŽGþ^_nvljr®èr¸™oßÈ+ç+®µ•óL,ž9F45ÓoSeþ'‹¦>£®±ï[±ÍBß ñ\q,›,5½²0mü"O]Z80)Ù C 7œ’ʨPSA›>kpʳü˜ DÁŽm[˜F˜xØ&Œ6õ œ’çSksŠ{\"tà”š”_È} £t9Õf¤48…,Ë$¾é0'mÐgߎŠ\{¡G";’œB85Í·#ž6¬?K%£$/¤f¥šVpÈ’ñ²Øi²²Í†j°’/$QäGv¡Å~dúe86 ¼Tè,MVnÊ6½Öᬚô,WÚ]f*!(#ߚشù¸Í}”n»Ä|EØ|Q„c“#ÓŒqjtXœ5Ω}ùîä´o¼Þ2–Õ|KËÁy¥§_H‘%î?{í“0¢ÄBŒ’ vl—E1x(Œ‘Mˆ_à îh·»Ýa€ûší.Œh4M»ƒMjò#QœÈ Æn{,ò±åSê…¸¦Ý2ǽhù-nŸ¯ƒûÝÍ3R$ û«TÚŽNp_ËæoòÓÍä´!ÜßÄ‚âEšC\aîW±ù혋L½ÅéM~:ÚüvÐ…û¥,딎›(ö­Ô8´À c‡Ð ðBÀhÛêÕcžAX¨±Þ Ék]ÝVdAÕ¬"z•*³š7D¯RÞh%óøvþR$ó@šÉ<ê”ô£<…==4z—²ÅF=ïH¿4“ylòÓM·ÙÉõœ¢72k)Þ‘~ i¦ÏØ䧛ÅRäÏ@mù36§ærópºiû¡…¢ØÆQbă¡Hšä”Ušoi6]–•Ôm2Vn¯Öp¬~/áÌ—^kÒm«Y+i:6ÐÖâ‘F34F”éšxEÞdm©mæ™|V4²]ì!Å }/r±ß]R#Öâ\á5áK‘µåiâ|wv@Ÿ©Ò0´#Ó‰„¨oÓ€š^„MÏ£5g¿ÍÉ𦙺®€o«MÒå³F·(€¶T!›ëßö-× bD_ìBV#ž™$nê–5»Dá§TRƒ|îPdû@Õl¬µPaE%ÑKÑÓíÇ–…-Û¶P@üˆ`påãˆa‡Œ:nP·œ5ÎÞµ¦µPd AÕ¬!Í+Kf‹Ó—rNhð!¶\W¬+9ÌŠ ¯ß¢¶ƒÁ~Ó«›•Î^Ôit£H5‚ª©Fô*U8Õüz•*»-)Ç惑"Çj˱Q\ej¾YjmÙ1ÖåCŠÔ¨-µÅê1eH‘‘U3RèUª°Åmi"꙯97 .ÆÐ|c1XY…aI¥´ rÃmÈÆÊV¹ÎÁ¡ ¯’I‚Ëï¢,È¡Ò2p‰[—ÖÀÔ½ª¯P{?,œ¹·¿Š0¢B›píÉ„¥dçÑžïH×å¸zÑHŸãk-@5³\A»ÌÕô€æôÜ £ßPa4ò>§‘y“ž¢âc=7óF£=ŽS{Z`!è/‹³ì$5ê%V}©Yc¹¶«š*´t£rƒ—ኰ¶Ü´E­Þ$·ö¨×ò {Y€²N‹,¤Û¢:¯|­Æ¸þrcˆ»’›röükÚãÕׂu½çfU¨xô5àU<ˆsc àðµÒŠ8fc“*ÀF¸¬®Šè„ÞVÙ³··Æmfr*ÌqÞȨ)Ì-—õ¦¥ŒM*hPŪ»½`ÁViõ{íáq»dçcöe¹^TÓâ#è ¡:ü]_Õu- a\ßÌ >gkˆR b—LçÌÊlð yÞ.ž”ì˾mT Íe)4WBõ$¤¾®;¡ÙÌw®ðÍÏÖͺµxº¬Q‡ˆè³fp“vݬLº×WóRº÷¯7‰=–µŒ=–µŠ£«^ÜÒgô e]]þ\­è f‹5ãµø·eÑ~çÂ,¾n²7lT5Ñž:X„Ü«wkéau]ËF8Û ¦«Ê‚ †øÿL#á‰Gâ¸Q±—;"åâFÝõª¬8ØSǬt±ÃkÄ¿¬gmd=õq-wyg¹«MèbeºLìwÓÙÎÀs<cÕÌtY«Mu)·¾tàñŠÛhšœîª>V7ñ5Ù¨·†—½5¼‚mVo½Ó·Í꺖ms¶±oËgÌ5¿iüGØé­Ìy#·?7ë5[Ëý`­ åê5â.S諯7¯â1wô–7âœÔÌïÚ]æw0© é“kŸ¬‡’¢šG6鶽ìžÛvk"ð³ù©Î…ËÙñÊ‹sÜg ?Ö=“ÒïwÓŒjy«· œ§tÊf³Êƒý÷^,N„Œð÷Ïùа<~&6½ç¸{ØG;æÃ#_h— ¸K’ÉÞîî—/_v¨?ºúùSßà½n|ºþáôäÈèmïî~¶vw¯ŽŸ>\}<Ý3«)Í„á#ÃÝÝþYÏ(jü[(ûÕÅî¼.ÄN¿n'…'whB¹/üã~8š½­©òʧEYF(ü»g ˜(» :øýmïHZÄí+m–ÙG°ÕàÄȇßð!êŒ%o¯¯ÞmûÂ’,UòÓöõáöÑø~B’A8,ÖsÒ,ž‘q ·ÒPŽ§…rÇÒPI%HÉ,ŽÊåDq3•n56.X̦lÄ4déûÃÁè×Ô”&$œíD³YϘ²!Ï_õ0d³;Æ’žÁCëÒ6òüu³h:˜$Å;¿ß‰¼šš×_~›³éÃÎ/3§ îè=HF3&ƒÑ«Oèͬ·Ɇ°èi§¦¦›C-÷2’ñ¤'ᎎŠSvÏÏëG@¡-ðMDZ1?—@(}õß$öåõpž’)#\~€›CfDl8œMH4ݾí™=ñ{ ’þ>xaì'’ø25D@6?%dÏÀîä7¼ܤÙÍôñí!‹¡ˆ¹ƒÙ½,cä„L¦ã_€ÒÊ$‚—(­ ÎïCŽÌæN°“ö‰ ¥›À¿$”“¸›Lå¿ üD+3GB:lD Îç’{Ào,ð8X’_Q¦@ÿˆü>A½ÜÉ”M4öÁGX\凗¤7àÖp°ðöŠ€hïÁG2Éö"·,œá.c÷d=Äß”½ê&⃵¸‘Êu“;>ôI ‚r)†7UÂÕ¯áïøÿ$Í•˜D漚å¢$^~#¯§<—?8ÃÿKuVYJbŠS²Ò{ƳÙÀ°iQät€mD@"¯ëmÇ ßYY™Ûéx>Éz.ª,É7§äEIÈï¬.Z oR »ß#4FÆfÂ?74=/dˆ:²Ü˜,ŽÅâ4åOÀS§€¼ƒ·@¥8r«güžþ”hß ´–ŸN¸qìÇØ¥‘‡mfÚ(¶xè”ë²Ø5 öÓ™ÑcbÞ1‹1åMY"ç¢LA8N’ñ}3é€è{¦s¤¡ªãáŒsDZ;/³G{¥î.6³±Çl‹º&u\‚b°qˆ<à¤oZÌ7£Ð7Wë±Á(y«‰…7$â·ZŒîÚøuí#f2˜NFBnŒ© {„ø›tUF¯…ÕjrÅä’›»6}-6{$$Và‚ãldóɘ…ŽiÅ‹m{ey~,6+ɲÑmr§ÇçŽm×æs>tÈ€‚ò+w$f?¤Ö€1Ç¢Œ'Ž™ D)ûDY‡ãèW¨lrÀÏÞ+¸7Éâ ø6÷TÉÁ ÈâxMF¢;CìDáËŠÎ(¹b£ƒaä”M†0zà ^Ólp?æroˆ{Z‹)_ƒ$ßÐø2»&ø÷|±ÊÄÉç£ͧ+~ÚŽôΤ“ØÐ Êa@W8”1í…üdÝq‘súPÄÝ„b¦ªØ[º Ød¼T9~‘ïÃ×ņÀ’äæË›u JŽêž”1˜ÎˆØ]UOWÚ*Ë6!.Ȇ»)Ùàôäƒ !Ó•yËKÏnICÒÅ‘W¼ö­õØ((×#»:×c¹N¹±üÞ¹R¬Fî^éNŽSaÏ"¢[EÈ©”îìèN‘‰*‰³´~_îK» ¾\7”k†O(š.xŽ¦{þ|ëÏRüÆ_9þϵÁâUãÿ‰žãÿ¾Æç9þïëÄÿ•ã¿ ôøøøU7×Nøtë)‘m<ä9h[yu;‡dX®å½¼¦•WhÏ6ØÖ»¼ApAü…S×¾p YÃÊ:LoB+¶íÈCÔ!3ÄŽEPD\ǘÄ(LÉ•ÃœÀ.o`¦Ž³(¶ß¯$¼Øt?Dp/Æ @ ¬bþ–ŒKä±’Û2 Tï]9¹NX¢‘ÖŠKlÞÕ;x?fÈ¥vqÙàq‡|fCØw.·;’Ÿ“¯W櫘*0WgZ„FeÌ&$ d1äøoûVÄ‚ÐZ)…o>Þd, Î6šª©mÎh¤™Äx5ÏB¬½c¸ä(É CúúJÓµ+Ö‰AŠÌÈ2-JLj9¡m;>Œ^,dÓa8p¢'ÖíjjSÎ}‹^WwuWö¯ÓÕ°Ðôù¼6ó}x¶GMj‚À¡`µp3™7ãQ:[MoKVJãåSéâ®l_§‹?ˆ=ìE®KMÛ¢v¯‹0a&õˆÆx£1Ík3òQ¤FÍ‚æ¬HF–Óh0šÌu×ve÷Z]«Næò_ßµëä 1^jôgG¯§ªÌsAî‚ØñìÈ1=`°k‹2 Q„ÉÓ^5µ©ižŽ%îÊòµü*ËvCLÍ8ð)Œµ<~ÄwCÛLŸzÌwžV÷ª©mÌpöµº·&Zž‚놊 Ñdº—<)ZšøEÃëØkëHAÌ cÇÆ. ©Ë"Ëwü˜¢Àa–R´Ú&‹¿–AW³ 9[ÊÓ1+];r¡Áȇ¦ÄÌ$¶ïbb#š0(dÜp]qrÁ7ß•w¯šØæ,DÙ½ä1Ç¡Z`ºvâ:£‘êzsVÆqRîÁ`¬¨Qı2QÓúVỵÇÕ<Š ®›ž[ÇmìÊãî{™švÈdÀêo’Ñ0VOo“ÌúZY#ÙòS‘¨ƒ—53²x¿ÝËóÀ¾Ò¶‘2ŒÝ—f¿÷wáB¦A¯êš·v”`+³{éìw&šá|0¤3£5eÉ|:‚ïF\9>¿=yè/ùÂ(1&c¡wââ+Wlð5!þm9A¸Aù^ï|‡Ý,ÝNF‡%ñypš|âßÔ=ƒ†%p‰Ê…Ï¢¸få_d’Zå7€¾ýk0úwÕ>z£Üi'ðÀ±¬méjAÖ®R2ÃÅvA(%XºS0…ÞKTôÒ°Ôæte;e³lû…dyÞpR¥Ev“Å/Ö¶#_,ßÛ1´!—\šÀSt¶ÎÀ_ÈX+J yß tDP@ $ÑÓ¡îjÙ_´V ±·‹mëÀŸ—rx  SböÞ±÷‚D‡a¸x ¥K7þÒé®Í˜œ[9-†S§Ë¦Ã¾Á†Ôwþ.dê ÆGg5ý½ÅIºÖ yt-m·¥þ¥ oíóUÁÐþ+\ ŠÉÁ)?]îÍœ³îià„¶xõ¹ æ~Âòá;M”3u7ãá]lÖkJ¤â $|xøªì}º®|"ãIð<Æ|lS%˜ióX€ÿ©Ø>… ³®Á|Ñ()Ä`…Ã×ÇÏÕ•éµwë_Š·Ý¶Ñæ•vY¢Ý½ KSä_õÀ¨:Œ3xßòÊðQ™ÎM6r,Uéß,aøAcï…_/ZOZËWâà ìµ1Òjc ˆQ› -$8jÃ蕪@.V#ö™?òdj^=ûúìY(jÌqèAMcgZ¢†]L‡´ˆ;8Òºƒþ—+Ñç³3‚ß`œhuêKÿzÔ.vŸž’óSÜ?åï‚Ë|>z*¥àæÒÞB B¹‚`¢[SqíÊt *SÚ½„ž¼ º¾Nî¾ïY©ìíEe ¿¬1™d–E¹þDé!ù2Œ—ã=¶;˜}–ÞÐv&‰Î¡/c¡ä ´OIöârÈ!%àèH˜‚”4¯ aœ‹†/©"1Ù'_áó+ýž’¶¤(2ixCI,¹6“…ÃÃ>ñæZ¿ÃðiâÝ>cãç{êz·~/ÁO—»/à¶W %Ú7ƸG±Kô K; ;p}Nü,¨dê»}³¥¥áHn-íÌ&aUÑðŽ€o]Gášoú­.ó½1.CÉ2F»àÉ›¢2l«à^ЀkwhwÙñ¹ŽEàs†x0rnI×¹jý1.íþ#`È‹ÝOŸì—?ì–ÉŽ $}Ò‡T€4?cMíC ä”ôPòÊï9Úª74pT‹¾šã¹Œ4ð®}Ò>{ûŒ)CHxdhÐÐÈ,»¿ÐcÁí;¿ºö?Ž@ ÛI˜A²\N³«._ZÍ*ÕˆsžÕ€ŒÝAÆî`E‘ š¬úÀ¸Ò{×ùÀØ0œ¸”ª°ç(·"ñ.&¡©ÂWAÉÕ-LÝÓœL²îaÌ¥MÕ$“ÿq[…²5Æy ª0«jÊ}\¨Îo½ˆ]ƒ{iqx>a?DU32Í]Ö½´o|åð­ÜðŒÙ»e–.mêÚ£kgXغ˜AœT\V ’°k.íýDKN·ÂÔKì†Å¡…´8\LȨ²Nòë)½ÅBL÷÷Ø G`N•YxXÎáUS–=àÖYd>Å ?Ö+Ä2æSÐ¥áÚ’‹‡·Á}öþÈOÙâP z»ñ‡RGGs†}—6ÉÐ9̤V¦Ÿ]g°8xñÀ%Fƒ-펽[L7Þ-³Qvð+£§èИ`9¥ÃÊþ§ÃÃònüÒ¯ÿ0þsÙ<ø¿êþÛáUGA{tr ´v«“>«ïŽK_½›ó’ìNA§0zG±ïËäƶvF}ïÜÏÇìªëø‰ï§v ¾óWÒÿM~˜ïÙþ?Tª¤ò?Ë’¤T·þÿc¼¶ùŸ'ÿs”,”œ„fw›z›z›ú»K½–„ÏÛôÈÅÒ#sóLmÑÌÆñË`Cò¢‡Øè¶ O¹#Wc|ÍŽ]†ä¼Œ÷|T‘ÿˆÔ,gÄÖóÐ÷bVX€÷—@[p3éÁ^jä` }cŒvžc ü*°Á.¢W}ê¡. óÔ‡’ž£<ö <(’•ož õ6HÍtX ýsµ*KJ÷8¬3wè1™wS¶‚üd$Š$·NüŠžâoL;—53JÖ³ÎÜJHˆ¾!<Ó}NÀ¯wK9¦oÇ”b™J×Î1E 8ƶh-cš"m Ó” aš2 Œ²;ÂGK§l ã6Ħ)M ÕYÊ·M±kJ±Äpëç›ÁÐ3XÊ4mC˜VÛa«ÂæN&ÎÕ|hL–±­¶)²VÛY«²†g)–rlSM•7ƒcªìsb4¶¬&9¦Ê›Â± QM5PÍÅ;)ÎmŠvÖ7d¼VÆkSË óOKõM±Õ7Ä1¨ŽÁôîÆ„v,eÚ¦øچȚÈšèdÓ´Ç—´Ôñœí¾ëí¾ëí+|%Ö©_PkèZž‘½þ[Wë55½ÿ»¦Ö·ë¿ñÚ®ÿ>Îú/a¼&=ªZä ‹b¹]óÝ®ùn×|¿5ßp]Žm/ÝYËð¿å¿åœ _N kã)Ü%««¡gÃd-oÙµ'\Õ¶k5 ªnšŽéXÚ@­êšlÕ¶Ù0å`‚Ýz\hY[· Õ²eEkTëðÒÁ@Ñ0“†ª6dià?› UoëH¹¤+²¡«†¢4œAÃ2uG‘ëºnéO¾jÎê«ã‰Éåªßœ·^p¶<ؾÊB3Óø+ä³B[«u01®n˜ŽÅ®âéÝØzíîd ¶Ì˜ÆʼŸQ8%_d¯paù}Y¥2§R9Q)ÕxQelççÃý}íï‡J'D»Â¡]I2d)ÝÔ&ìï“å¯Ðk=uÍ ö[ùÊK{C{MœöGç»Ê¡]}(ß#»pè%×Æ÷:‡öúó]ãЮ=ˆïìô¦§¥ZªúaU=”«’¼¾78´76˜ï:‡v]€ö\O”ªÙO”ª"ÜÊ÷HºH’È#÷×ùÊG?È$Yˆ~9±Ñ8™ã`A…¦t2sì ï®{b ð½!M¼03†¿ã±#‡¦{FAÍG?Ì$!0{BþsM4j—Ê———åòe™~ÆßåôõËøµ •~¨IB Fé?¤ïC<‘˜x/\ÿÂÏûrª 9éç›$lû…ÉÇÿ>=„~¸IBàôßÿùçŸ÷²Ïø{ÙõØçá%´âÓèçœ$pH?yKîïÉ9|;‚÷)¡ßè_Çìšÿ> >Éý'¤>Ñ9é瀜$rŒþ.¹ÞϧÓ÷0 ÕXN?¶ñÓóTòÑ/s S‚LJ“Ò9ôéœÁ{Ð:ZN?¶õž6 &B9éçà¯,†¿„IË(¢ÊÚÀhµôÃ$¢Ÿ¤“~þÊ‚ø t¼£ÔÜ1ê¨ü0úŽ¨\ÿzH?Óüþ‰Ä“~þÊbø‹ô´CÊúIŒV{§? ÈI?eQü½'ý:EéO4 'ýü•Eñ÷ž´ŠÓo@Nú9ø+‹âï=|ÜïÓÏø{ÉõĵC&5Ÿöƒ䤟ƒ¿²0þ’¹3¹Á»o‹Ü{÷dLwám’ûÉ=1è'èúa`v姟ƒ¿²(þþø\Ñ_“ÈþMþµêß<÷düaŸ9¼š“,—E±|m¯|ô+,W±üØß±¨«¥ã=TäbäÒŽÙ97&îô 7·Á·¥^û¬Ûn®…~–+¢XþTüç`¹"ˆå%å®Î§yÝ;!C×rFSgïèç`¹"ˆå]ÇÆ:®9Ÿi´°1M#„^2Ý‘Á²LßLË~NÉ ýכϊÑÏÁrEËo<Û¸]„(Óx9cgrãÎpEt<ñ>»6Æä¥ 61·¤7z·~0y›n_˜ä?ËA,GŠoœÙË‹^ú9X®ûÒëz够ƒåŠ –K•” LiÖM&û¸—‘Ü̧4Ïá‡Á6LÜÆ`…vwäÍ@ëËyéç`¹"Šå„­»á2R“kTܤÐC;¡ ÷Æ™TÌþ*‚ø+/òø³7ÿA™í¹å,í‚ô×8ø[õ¥I(Eú!ˆ­žŸ~þÖÄñ7¹ Ô‚m§)ƒ1üœ3qá4²¥ÔøÓõßX§UòÓÏÁßš þ*,š=Vä1æKHûÝw„锧,0»3²½  NoO¼o†uQ¬fÓÜôsð·&êKÿÅŸ@š€ ÑÔÌn ?©"ìtìXs˜ew‚7bP7ei(óÒÏÁßšø\ö“Øÿk‚øÛ×î‘^çMÿC³Û"ðý¼Ûù¥}Ò:!¯?Â-Ò¼è¿ëtÉ?ÿÙìÁÏÔ[a.KóìÞIëïçÝV¯G P‘vpp¸&ˆÃí÷ç§m šÑmžõÛ­^ûǧR±L^_ôÉY§ONÛïÛ}(Öï”iëoËK?‡k‚8ÜyCÞ·ºÇæëöi»ÿ‘2øM»†Ì}Üm’óf·ß>¾8mvÉùE÷¼Óƒî^;i÷ŽO›í÷­“vˆƒÃ5AnŸIë—ÖYŸôÞ5OOãÂóºŒo¾>m±v€Ðœ´»­ã>vQð­¨pp¸&ˆÃ + õÀüÓ2é·ŽÛø¥õ÷ÈG³û±ŒÒ}Ü9ëµþ÷ Áä¤ù¾ùÄ¥”’²œô«Vq8-Ü ÆÇÝÖ{ì­ÞÅë^¿Ý¿è·ÈÛNç„jk¯Õý¥}Üê½"§Ôß7ä¢×Ê;ŽS98¬ âðI³ß¤\ÂAè(”›‹^›Šû¬ßêv/ÎûíÎÙy×ù‚Ò‚O¨žtΨXå—•ƒÃª ƒ´wº‘‰(éTËäû\ï¢r€ðô»Mô^¿Û>îÇ‹AKûn¿ü«Vq8crÖz{Ú~Û:;n!elÁ‡v¯µ¶¦ÝÃmÆìMhï/Ôuè üš—~«‚8œÀ±25D¤ý†4O~i£Œø4‚Éìµ}óJµâø¯È•‚öGåà°*¾¦ü$㕃¿ª þ¦wÑ•‰¾ÛP#ÏcäŽçCNG%ƒÝè`èÎbôsðWÄß09дB>øÃKó®È´DNú9ø« âï±cO`|üšê¡„ü8œ½b—+þå¿ÍÆÓ¹]L~¼š½¢Œ_S+8(¬ ¢ð©7w§gž3$çÞܺvf´Ñåʘ]þ›;¿,hÈšZQç`q]Ü'^Ó+'ý,®?þþ®Ã| à€q=Æb•r²®©”[õ ØÓÉË™N½ÉÎÏÏÝÁÈv¤Ó;½„QüÇËwùXÆÁŸzþ$ ›A*fÔ†ª ÓÊÁšzÖ,§U챈¨g@Dšþy j•¦3Ûõ*×hòÑÃ1ùõ “ŸEOtPçm!MjÑYÃ0¥Ž0~ÎO>ÇÖ×õú¤qL¯–azx2ðåÔ.]^Zãá|Šï½\Ô8¦TË0¥|µúݹ»õ&6;3ùE’§.X0õ!&Ö3 ç~ü÷Ü8gÿäk Ǩjéã_ëåØU-ÃóHw™3²ÝA¾Vq °&l€ó=–cn5µˆðsì¢&lú¢Û¦Vš0¡ÇzjÂÖ3ßc9FRk`t#Kd#óIÏjpžÛPØ1¶UMU›9áý•¶9¬s/bÑ€‚:ØÈÒnƒžju ˜uñtCR«¦µº#« SwL¹Žƒlrm¡É©b~££¼ÅEÛ'܆‹Áj#¯ˆ c8zÚHêéWQÊÒÔÕüöO>7šfY~šŽá( »nÚJ­^5dM­YÖ€ÑV1ä7èûRøX“~Fw\².de–]`¥:h¶ih¶5PT«Q¨uC“kZUÑ k€c,d¥¶9¬ÌÒ…­ ™=ÎÃlŽ5m²¦œ`£È@Pç uüpÿÅ}Ø\¸¥sŽúC÷……G–ˆŸÉ'ÊB¾Ž93ZÔÅæÃ×ùÊ7‡ s†¥zÆ°4cŸ=×ìAì% Ä†eȦiV¶l5,SiT­ª©HFM³4Iµê1%víù UäÒ›öi‹ì—I¤ßå 'ΧmOT±8f=cÀ¼&¾4 ÇlH²e×ÞëJu J’!)ªÖôª­Åø’Áás†zÆÌHÆ€&— Ôª¹a¨ y ª–) ôÚ@Su½áXuÇFÃfMÇÚ§ÐäMå8z½ˆ%æ üu­H¥ ÒE¦»×j^òYæékÙvÝeAÿy–=¿y—ªÙð ¿o¶y—82à÷D"]VÚAÕ´ZCU,­.7lË4lÛªU²¬Õ4s Ä•×Q´û‚-qbvÀïù•OâӀߋTš+ðûFØ$N¤ ø½°F¿wn0‰Š1zlƒö¡íD¬ÔîœôgÛ~ø}Ó5:gà÷‡j´dÖͪe7I2-m 9 I³l­*×5µ¡7âNÕ íªÒªš iðû7X©†iU0R²\Õœj8˜yÆQ4]±e31àL§Ø(CâÄÈ€ß ˜N )C¬RHºxB›Ä t!‰ºÈx³yÙø(cšQ<'ý y‚@ùl'Ò…”ŠtQÀ&UÝÑ`’ªƒê 6˜ŽY¯¢3$k ÁÎ ¦²ÖÐÕYNÈ )+äÅ ‡3!"ã)s kšnغ,éà)Ðöšn;²¥ê†Þ¨ÆZêü{n S--àúIœ@R:PÆÊFHÕØL^¸pʦÞDÚ.º%A³u«^Õ´j]’ͺ5€q%¸¼ÎE3Aí¹À‡RCJ‡Ô«”ƒhé8b•rÐ#+øÄ7Xá•8Á$¤¬`K×µù*ød:e…xð婀 â eq(¾ž'qb/HY±R¦mgáW`÷âVa@‘6ÍfËùÇìÂ¥N4Q‚ÅÆýÉàZ¶*ÏHV`£áÿÉüù‰§Ç§^þth¦óÏÔâÍŸSñ±}/qê=|§- kË¥€¡æ¶öAF9C,—6$˯ˆÂLM&ÆC¦Ê¸mÑ‘¤·}#^ÊxŠ&Uûö®&FŽ$+{‘Àh b8îa ÛˆüííöîŒ=?Ç;k‹yF½‘‘íòTWÕVV»m4bÅŽ0+b…´+¤.œ8­Ð^‰9Àm9 Ø{€ "ò§*+³*ãEv•í]²$»ª«2_¾|ñâÅ‹/Þg‚0\Ð ‚+¬°¿?C†i›eqè £{õØ- >m o€-RÀÐñE¿®†§Ê° ºml¨LØÐ|µÜ€9R¬8¼ìG+mÞ¬tÛ©õôù)¸õÚ溚Ý`)é†êç¯4§ÖlD¡Ö‚%ûCñT„Š¬¢ôõÓ¦áó;¾:ÿÛüƒ^É5,«ÿ SÏvíÿ›ëtüoOâÕñ¿=Aþ·¨ãëøß:þ·Žÿ­ã3ä ILiäan3æÅ6a8b.ŽåÜ-ÆaA׺ש‚&W–/£Aí(&2(—¡Hx±e¾šZÏ?[” ?7?)øÍ;~¶'Ë›Ôñ³¡ÿülÑêìÞñ³-³{Ç϶L÷ŽŸ­ãgëøÙ4úwül…þ?[ý;~¶ŽŸ­ãg[ªÇÏÖñ³5éßñ³úwül?[]ÿŽŸ­ãgëøÙ`úwül?[Ç϶TÿŽŸ­ãgkÒ¿ãg+ìßñ³uüluý;~¶µúÿŽŸ­ãgëøÙ:~¶ŽŸ­ãgkÔ¿ãgëøÙšôïøÙ6:~¶sßEÇÏö ô原m¡PC~¶òaU*µyv.éßÚÐs­Úmla+#x«¨£è¥ÚècHâº:Š6 #Z±_@1¢°hM.aF”æÈ0å­ 5£…iðˆ Ò'¿•£¤<ÛÌÓ2¶´šm´# 9_žäiÈc®XËèÒAfMì00¡†¤/ ¡[„™2}I|UrÁZ_¦LPæÆܶ\Ð(r±`ŸD>ñ¸Í—óŸ+Qï5{˜0­eÖ”Ìî6KòYÐî¡ÙÁ„+;˜€ÝC³¯W÷Á„jF±êfÐF9$‘¬-ί*zƒî1Ÿ4bù1ã"p™ýXÄ\¥µcê:¾å“Ä ù6×Ü+4Èvl7æ—¥„ïËIïÑ™ÚNptÂÆïÉÑTÍ/^ñ­#…¼õ*ô¡kZ’ É%.|ZKˆ´âÈ,ƒÕVeÙÕ‰1LÛð4ŽÅøÞ¼ß…ê¤ Òª€s˜PMÐeŸ?¹n¾š@Ë^<ÓÍ)‡€Í i-f®]m×þ⦖-` ‹{‡ñ]oA‡ HÛ°©óCܳ“Àw¬³@ 0;µ 5P®fÐwêÞ¥Ó”ÛÊ'OÓ6fó ð;õYn’ÇÝYÿ‡DÞ/$•ÙíÓNâhàÚØYQ]ŽÔ)4µX»!ñC.,ÅçÈÕ‰¥6å+ˆ%–ç(a±Pi­ˆeƒéÏ0µRíõ…åÓ³*=lÍVE|ÄjF§ž‚]Úª^ˆúYBò$#YOTídt&Ð@nØÒ5#ŽSM dy,Öå’7óPòº‚ðÖSqÜt7vªã*0Ê× ®qu ªeø‚Y–ã.Yö4€Zh@ÌØm•5Ð@‹qZ ªÚÀ}±î‹›à¾%(Ù*_FÞBÆMð`8ýMÁx™›½éXCý5ž¸ Oü,@É°€ŒÛ±€Œ«dPïœP2=Ï¡ªÉ¸Jf<ä0w<âÉÈ%CŸÇØd@#¿rDÈYDÄ"ÒEØh£J!÷£Ó xåi<¹Wóä­RÀÇìk<ºG‰ÍÏù³ðª…fðÛŒ¾fð[a.§O[­Íœ}ÍÈá×cs§qžÏ·Ä…s‘Á0}èh8ÊX}Є·Zð5#„oƒ˜4 r;¾ÆÏûÕˆiø÷ë·q¿¾Æýú­ò3y}9w.éV´ù¤ÔpRÞ Vú-NÚˆñx84½¨ª˜ ‡¨?´lzÇXË„jP°¸[ž¹½tÚëóŒ¤ÍÿL,®abÓk‚Ƹ6Ôá›Ð‡£AÒâ êLóqˆ² ½ŒÆMÖ±µ0±¯ÖŒ’ËJÉo²F0JÐfZ]FYö,­ç>¥Ì¦%ß1ΈžÌÚ‹ÆÖ€´KW?%KëEGiªkk;Ý£« =¥7¤ˆÁNåÈ‘=8³,„T‹ƒFpÂœ <»Ÿ²±£mތҜPúßì;cÐM ó☷hìW®@[¹Æ#×Pº%¸Øº’ŒÛùM€‚Æ[-¼5Ñ@sI š»´¹ßqU@5ì,` Ó]{hS<ãDz¯Ê ê}– PˆR1¿èhà¹ÄªzòL+‡h~d‡Z¦Ùÿ«E:ƒh ¸¤Á…†zð ÑànIw ôˆ5K¬,¢A»«EôH4XWbAjL<½Ý‰D~%¼Öbõõz–Oƒ•´~Þ³?–¦— õoöcÄ‚U—XåË(¥D4àXRåú Õx·*›Hh#æ RÒG¸Š&`æj-)¥vá60_@4H:Bàð©óg‰ˆ‚GÚ@ðˆ†1êèS‚DÙžMÓ{^¼ŽU[f2›-ÐBGq É!ÕyȺ¢=#¨ Ñp+*·L¨f4%ð9CëàCCZ@*¤ÀàCC%@ªT0¡šqªZ“$´±P5À#;,Œ,ÙÊ·{"v˜Pô¬‚zå$Ìö‹Uíz](X—¹w<Û ¨ˆ=ñرÇC×S ‹Óžªv<ˆÑÏ&ô‰Áµˆ¦6¡õÌ@™µMAÍöºM•lBëÀ«|Ⱥn: hêc{ÁÔBoð54„] €ÎMS[šØmÑDƒ‹%ÕŠÏ0¡šÑ¶Z†&T3‚j#?Åùš¢J 5‘^·³úDe@Òp¸¡þ÷ ¬‰¼Ê—Ù|Mƒ¡%Õ¢È0¡_X­T ÚD DË’[±Ç¡]Km’!ž Dœj¦PVOb¾æʼn™ÔÌ¡Aèñ $3êO$TРňSŸÛè#ïú¼5¨Zh$T#.`°8:4 4(3âj°É+YÙ&XiK#Xq«3é´U<ËŠDH#nuB<·"ob=K!O;@ÔàÜHçªùÝön¸Ñ`ÕˆÛjÆ­©cIªu,aB5î°Zc$ôÜ°º0r¸hÆ°–>¢Áð‘6>¢Áð‘Ö¾èD*xMQ YKŒïšQw °Ð¤_dj­ªSh|~­çê;…ŽHjpD`§Ðà IÐÆk0¤†ù[õà¤A’ j+o Ú¤5@=´ˆØi#è,DXƉ¾¹–çY®ŠÖ¢Ø•îÌÇBµÅ…¼  ÃR‚K…ĦeÐáY½F³ …t£…sªÁ4Ñ:¦©åÍ.hëi0…ò«4ͱm:µ ó#ŸÈØÚvc*B[ÆÕ<ô,A°ÍµY{^ó‰6ÕÀ¬h­¼!Pls³§µê„¥ùûô~ÒQìî›7¶Ó_凣k7_||gÍñ­Õ œ¿nZ(¡CÔ0KÉ‹ÿ?Ï"Š@-82}'vÝ0"4ô“ÌñÕê~ú ”È£8L}¢MU¨mšÃZ+¤8o›lO<Ð6ŽëؾCó,Yvùžk'ä¶íBä8 7N«*.Pë4Ç/´V·±b……¶f1;b,À¶œµ{6frÏÁÄ xä÷‘Š„§Í¶6¨mšc%Z+9o›ÌCmãE˜¹V`aÆlÇw…︑ŒTK×ò¼¼We" ŒÓ&q ´ŽsGk)ç­£s´åؾœ„s7ÂØÅŽ«Ê<cÏá¼X¸P"á¶i›€Z¦9¥µ’—ó–ÉÓ@˸ÒËxÌw)!ܗϘJoS;Œ8 dkš>a)nš6ëDPÛ4ÇÓ´V{sÞ6i> l›€ØÔ‹}"û¡œSXž¥òuÙm¤"á¶i“üƒÚF¶áª)ðIk>¡˜éƒ*¢ “*AMd&“hõxñDŽÔ9ÄÓó2”J©n+ŒÍ3eç¯ÃEÔ«Åͨ~þæÖâ³åxx^½.âÞ %zß?Ø Ó FYï£dx:V$LJýb¾¤äïFûÓiM*]cNle¾ÖX‹§Ë­¸Û®ÞGJRâ˜ÚW‰ è½HqYÓÐ{Gíݶ÷´ËÛ„ø¡Ë›—Q錭ÍìÛöa‘­Š-c#ÂM4w)øu, ½NmÉã\mŽZusѼïHKQøL=‘~l€{¢6ãÌò§¦0óÇoÎÖÒ•¦òŸd•)]îË=ÒtUÎȬú(nÖVq³wÏ­V9o¥^=Ý6RØtb öêSz¼hʇôt:ë28zOrþlÙH\•pŽ§&íP}j*ØùDùè°Á€ G(|Œ¦ØÀìæïO&£ý½½³³³]>|ôøX v‡ãã½Þ€‹GùÈpñ wr\Q%ãèp£8c48Þ@¬?™~#µ¿˜âëð®¿ëÊ™Êò«ì–Ô¯á?Vïê"W/^øz©;âÃ(½³½ e¡Õ^CM\\ÛVï² Yå÷ôE<ëV 06v,—\P¬.ò Y«UcñëT5r„.„,™ OûKÓýþ]úúõÛ·^ýøÅçT›þø×®¿)ß?&ÿýô|Ÿüÿë?öõ{òíó7®¿xçÑǾõÍ_þÁ/|ê§>úÓO~úG~ôWþlãKò—oüÎïÿž{ï'ÿúµ¯ýë§?8øççþå?ÿ÷·ßý#>Fÿù/&Ÿ|î×Þ8üè;ß9ûÙo¼ò«¿…¾õÿµóKã¯ýæ½?ü·ÿâߟûêÉ?ñO_ýà¹oþÕ?üí‡ÿøÊÖÛóÂ}峃ÿÆvðÃ/ýñ|ñÏ/}ôïüÏ÷üÝóÿýíoÿîO)}o¼|ëú_¾ôÙ/<=‹}o½æúÿq²~rÔK½éÊ®ÑÜÿm"ǯRÿ§•îúÿy\ºþƵ;oß~©GŽnß}éækhcgoïèµ½½ëw®£·^»óúM9:ZèΘ ’^Vï}oïå[¨<&ŸÑt8¾óæÞ#% «“ó;“Ò™»|ÂÕH^ðÑI.ƒƒ ÈÎNŒË·1‘Á€S”Óo6ŧžŽÇiŸ©t•žœ×îõÍBQ{§ýìaOuÞÞdÎÞÄÐà‹5Éîñ¦<«ÍÝåÀœÔ©kq‡´Åši÷b¿iE„£ªDÍÛ¬(e"E¹º9)j’søvF²çŒD ›AÙ(ϧðˆj1“› Ë"ÂBDh""*‹ˆ ‘‰^Á ÜD„(‹…š6“²ˆ¸›ˆ8.‹8.DŸ£Wæáy.²Wˆì™hÕ/‹˜6_£.tRqRˆ811(‹"&"Fe£BÄÈDĸ,b\ˆ›ˆ˜ëvI!ÂÌ—”EL  Þ».â´,â´qj"âaYÄÃBÄCˆ?+ee\7 Њæœg7*¹\'†ýaôÞÆÕ×ÄX¨h!ååÐ0VuØgõü¶ÑC6î©°G~ä*Aª>B%¯È$w¾è¬7¹T¼š²¢¨ üé©>=F¡PtAò‡ý\o9¹ ¥­ÍlÝW±½ò˳&o|õÐŽŒdåÁ꾕ùJˆ‘‹û¥m·¢ßr/gÒ}13öôRƒÉ‘6·š.†ó‹ù˜Páz! ;>†][‘O¹“-í¦ Î‹ÛËÅ‘iÝ]-ê +rüX¸Ìñ±CBcŸ[ja=·TkÎaZ˜3i× ¤uxäRF\bÛqÛ‘Å£ØPëÀ ]á0`ß À•îGjì…‘r­ÖGI¦¸ÇB'fÌÂ%vÌ#JCÚ8ð£ˆ1Ç&¦æŽ=HËrß–ªhȘMyùœÑˆjÍ$½ãLqæJs†ó=O6˜ó€; <*ÎÙ°ã˜XÜ„x²Å ‹ø Yè'¶ÃfÅ#5ƒé-â Ž-/ ;”]ÉcnÈThlǘJ õÆç^,â´°‚åÚ®ú¶ð=+õóí1Ëõ–þir4jÒ»¸¥Ìö" s߶ôÒsÂÈóã Šyl;±æB\DrŽ,ý(ÐH‘ÄžãP‹rÎ#.=‹åy.ö"†=C#yÒ(Äwy(Dà»Ôõ1å"$v öl…¡N÷ÞÃ#ñˆEÝ‹‹YžãE²ÿK•±eK—bûÿØ»ÖÞ8’ëúÝ¿¢AÍPR½1dÀQ{…cìÚŸ¬€¨Ç-i°C33ܵf{Nõ<4|hªz$È  ‘z8l’]÷ÞºuÏ9ÕÝÕ9“õÑ!_}:lìˆí»P0c=¯uÀ¸$"×(ÅÒ­Y*Nˆt/OÚ>[Õɡθ[/™!®LŠ,ZãBBõWÚkYLôfbÜ•¥Ä‹*Ζ¹ã…”t)-!@¸W€ºYRšÕåžúÈ2GÏ2ó);¦³ä(;¹p„,¸µšè€ðäPbjæ [|²ÊK½AÖyéŽ;@ÿÕu^Èy.5á J¡ d”R£PÀô©àîBâ©`M5­&†béDíC£Òq£Ë|±XŽ9ßi}æ=F”³¡Æg R6x/b¶1ë‰Ög…’‹Œ÷Ѫ¬rÈEÁ8å„ŠPr£XÙ[y]‚¿>h7r4´&)´šµPšg6•pxʈ¯…åÉÊ%ÈP/Õ J-zíï´^ç`¼†#}LIJ&çTÅE¤=:e*œÄÄAÈ eÆdÎQ:É$ïc aÖ×kY»ÌŽ‰)¥ Y’öI!4¯Ñ$›òÔO %&bÙ*F¦‚TÉ žÞ7ûMj°¼}ßJ ÓPUEo·B†©¯|™XÚ8ŒóªÏ,Zó€ñO)Ûä¸bN²ã¥ý ¡DöE»DaÈTª8 1”]H1ë Ÿíb¤ÊEä,h“ö9‚8aØÈlL nDv÷²Ó\k—¬w"[X’hÜšAEp≆+PNQ±d¾È`K»PæÚd2 0»žÄabòzIèˆ(™Áµ É£4óqêÈt–+^8Bl@®µ$iLH†êÝZÉ–í³^³µNNKÈ1Ôå¬ÄÌ 4Lò6¥4YÉx$K€4’”@°¥Ì^“LEG —JÛìËušîXv<ËÈ‚ÄC< MàÕ¼rbôîÔZh8¦€QTMgÂàÐAúˆº^‚ê3½;×@¥¦ ª–¬wšÆÚÁTBî늭S…Aˆ5F…@¶@·’¦m' 5¶gØúÕ{æu¹º½¹YÔg²ö9"me‚"X/jo Î'¹E`4•DOQc\„²cZ—¬­cXËhYξAgv7lvõ€L@‡´ÔVFpá‹ÐF"}Q/ÜTÆ•þÀZYŠ|”ÀÙ‹J¤£Ô W‹Îp;èF@Û4{yBi­xðäi*{úË$Œa ’#Ï‹dŒ 0N9nöª^nÙe6÷V)a9y©QÆøoŽˆ´.Néè§N”á¤;¯µÑ• ¦ê ! æ’9C ZŠ¬y#phÆb£ÄÀêîê $s An‹—œ9ðF9#¤˜:]˜ÈÎúÄlÀض’JÐIKìÕ¥7Gª.Hs0"E—œAZª3£<¶>UZ„’’,H0ÆlIÑã“À>8Y[•äšÞt *%A-{Ôï2[ÀOš4*£Ÿlµ€øf"´9Da °¶ã½Ó¶4BÝ=u†@ `Xܫ蘒ÇðÉY´ÎS§\ÈVÝ–¢° ¤Gd¤µä’ùR ‰5èÊ€³j¾ŸrÔçÙ!LЭÅca5öÄ5gI9¿-WÐmø¢¨@:ÃpÀ.”“ò®©4‘,D2åY%UTP(Ì‘'™uÈìxl™N֤𿊓:]„ÐE•"T6™îóN‚ýÈ:¥©“Â{ h[€›ûxúìÖ:(ì&°ÈøŠ[%ðÔMe œé‘/ éÁ£mµ;í•ÕL¬ nâTð®8K€-<ÆA‚šŽ(ô$#£P¦"Gyí4‰cX–ì£B8%µ¥A#¦0PkyNÎçõI¡–KdàÌqšª¶œU஄ÁoÓNNÉ’à‰iÖ˜ ©ŇËVtÉY_- lðÊ S4Zö»(56jõ}×Q Ð5¤ptŠJ(¤zàŽžB9^ îy z/UB³ „<йUDWŒšJæ@ÿD €fa뉻(¥¬NÏy£7y‘UÇ ÝÓFj! ¼òÚ³ÄÀbÕµ¯J±ä§VamÃAx¥ˆ:Qµ ¾FDES£ oïk]ÿ­³âáL½%¡BEð@?e SU Cbó©ÄßF‰ˆ—xôÅ´.ª&ä:šaLæ…Þ,Òe·BAÔƼ‡*>rpU‰Ž´(pS1ÛU±2Ê¥ŒŠŒAÅ%Ðé\•êJSÓ\²dÈ ôظؚMš§ Ð7…–nÿÕmì&î¹AâdŒò¾žÛ4RK?uÍaé]fà•Ò Aï0âYî « 7x$ñ_¦zuºN 5YûD, Lb/MevL¥ºš]½o” §³ :I' =E%xS¼ëžbR \a©n§WšÜ´נ¼ÿMËE_Ñ2ɸ\q(^îh™MP£s¹Nö¨‰EKæ¬!æR…ý(ëÜD6„<—Ðÿ6-ZÛ¦šWìVR©VB@ I ’¹SÒ*t,¹ôî¤ÑnM©–ûûë9t¥ŠÇàÉ IHU˜‹)ª:yo¡ª„ëÇæÆË.O*4±X§¤ŠÎ€ktºÈ¨ERD²'yˆFWh\Ôë1"”fç!o$÷.Ø~OÆ{û»ÑeÇ©XÈ`Sk2êh„)v7Ÿ?Õ‘¨$›É`}…CZ\a$Å}pÛ¤êrd³ _—'ÎkÈc®ªÊç QZÇŒ»’–’'ybëÚBY±ºjŠp ±Ððès)ù$…ì÷¤}ži¯6z%=thöõ¼ °sTz°zhË‘ýRT°$ b’y½IÐDxÔºÿ8:rd<‡x½¯/—ôf¶Z/ßõõ¤Kà,Ž‰è™K¡d‘€‚Å„xÚðŸrÐã=4kšýH­ƒ’‘³®êà¶QÌxÁ¤‹ ì´.‰Ö\ðbÞl ¨+Æd/“ãaû»h¾XüpÛY ˜ª}%dQzÉ-o‰`& Ã÷¤N!J.H$™†·p •X‘<žñÒsõ݃Š{\i/­x‚+SzÜ•ë ø‚a‰2S”v<Ð{Еh€Ô©0¡(œÖ+®D ˆ7@^sàyxLAäB(≬ý +ã½4}chsN×ÑbÇ+ÏÞ,ÃÍÛᬖéqݳ_üÏ/†òþZP?7«Þüæ?Òªðì¢î¬çä_žqvv1‘æOþÞþ'û_þÏßàÈ׋ÜwäÕÛpC/—”Ë<þåñ—|øëxÜ—_l–myÉž‹‹ŸfyýŸÔEZÌË—gqÒgõàùv×›%½³û¶ »ÔQ>jó÷þjߪžýv×|žÕŸÝþrËËôv–å#6-ä°z‹.¶¦`ta~™gW«××ã3È׋%>à¾Çç°\†wøº‚_¿z6\<µ#C³yÂùôàüô=ŠÍÅ_¾ûöåÙ?Ô!6§éj»ÿû7þ¿¿ÕåWý$m­ÿœi!ŃõÒ_×û,¯¯ë¿}žõßæ‹ÅÍó·Ã÷ãÐê M_—‚ûºÜ×¥à¾.÷E,÷É–~;ôç êÛ½CØ1~?þòvƒŸÑœ®Î~ûÔÔ÷eV*h#EJ¶hæI¹]»G•Î®Óü6ÓÞÂ)Mø\¯ÃÏb¼D/J‘V‘µ®W?l›·>éðÙW˹ïõ õbâRô$…ñ>y½=ýýû?ääñèC®‡áþ£ß»žœÍØñg¦ÃÃg¦?xˆwZ\mŒqþOÏ>öu~¾t]¶¦ù0 ªßöÏ÷ãO[ý±q_^l©ä'‹»iØn¾à¸Û†íö£âþï³åj=üHËxð<ù‚™‚qùIâ/8î¾a»ï°}R‹õþÃc-rÖ­iM6Ð…óž&Ï?åkšý ã¢ËþὈ}Ï“ÇËbyÖ«ñ×Íbþî-åe˜ðóÍÊ‹aþ¾¾!àÿrLÔiö7ÀŒwÙß1þ @ã]€6Ö¥‹ËËË‹‹Ë‹ñýp»x¸ÿòpߣ 5Íþ¨ñ.Pí1nxq{´ÿ]}¿»xàÂDûÀÆ»€íüdóë¿×cÜx¸Áþ»ŸþùîçÍûáöÔþƒ÷—ðâõGØß8ÞpÕþá÷ÃÝ«»áOøôÛ·Ãøùåøݫ;íör÷þj¸{]­¿×ío€ï¹ýß wó»a±µ“°Íw¶†§í¯>¾þå¦Ù/)º s´ÿw£ó­kl·;[¯Ÿ¶¿úz7:pBíoà¯èÃßa“-×ïí_m|ØØšïÙÃ{û‡L´¿¿¢aÇFkÞm¬ógcßË1¯†íþ½ý›S?¿˜hEþV{¾Ù[¶³8°u8ؾßs`¢ý ü½ø{7üù‘½ößs`¢ý ü½ø{7üÛéö:0ÑþþŠ^ü½ÃÛÝùø~¸?±ÿÞ¾›¬y}¾s`¢ý üÝø;üÇpw³ÉûklßcKÃÝân¸îžmjý [î–wCß1Ö_ìÊÎȦÛßÀ_Ñ‹¿ÿøK鑸ùzÿ»}ò7G¾{}ÛÝû½cÑÀrÑ‹åŸì5Í~ÙÀrÙ‰å¯7ï–õÄÖð«W¿`nøËõlœáX¿þ–³Õ³ïo3´í¨ð¾ùãwßüî“ØßÀrÙ‹å¯ø7°\vbù¯ä3ì½]Ñð/ßÿë0Ÿ%º^ѯ?ƒý ,—Xþåzsí,ÞŽÓø5Gª3³ëasÑÈ0ë:3\çV›Ç1,–ã×Åíú4ûX.;±üj‘g¥ÞÛë/†°¤á†–W³u=#z³\ü8Ëø°~Ö›ÇF,æóÅO³ë7õL/_Xÿ–ËN,¯_ÑúŸ?:ý§ÚßÀrÙ­¥?Õk¢ý ,—XΟ?«z*k›û©^Ùxu»ª/¬ÆDÍ¡ëe i_w¯kŒú‹©ö7°\öbù°9ï¶{ÂÊA^P¹—ôð‡˜]ÑòùGÇ¿¿²Åãø#Îõf æ|›èÉ.8Á~ÕÀ_Õ«¥‡}œÒÃ6©¦ÛßÀ_Õ¿÷OäÂÚ¨í‹qŠ÷*¬i9 óÕûZ:ÿñüïA§=ŸnU'þÊçßaL=ðæ4²ã°Tm7^w©"Z®ó×tK [Þ^.®k6iµ^M¶ÿÿØ{Öæ¶q$ç³GSµ•ÌúAžÄµŠ­$Úòë$y2©º*/H‚ŽfdI+ÒN|Wû߯|ˆ”%¤åI&uªJ$“xt7ÝF£!Ñ¿–êZè$¾#)e¢x%ŸQ3ä6žóÕ€;FÅ»@7MU]§Ð~‰þµÔ}Ù_Eþ[ýk)êßÑûþP^¼}èzü¾\üÚ?ého>ÂËžÖ½½¿hÿúWw¯Åj%]²tÏOàßG­÷Ûå 7jP¨ =l)êáþÙåi 4ÝóQ¿7Ücÿøôê¤þnW{s5ÒÎ/FÚiÿ¬?‚b£‹]ÝãjMá—èaKQ_¼ÕÎzƒã÷D÷Mÿ´?ú(ü¶?:Gâ¾êvµËî`Ô?¾:í´Ë«ÁåņFí¤?<>íöÏz'-äD[Šz¸ôÕz¿öÎGÚð}÷ô´Ììýׂ—ÚI÷¬ûØåÅ —5„ŸJô0UÔÃ«Ì ÓøøjÐ;ÃñÞ^½Žú£«QO{wqq"fë°7øµÜþ¢^àü}«] {Mí8*ÑÃTQŸtG]Ae˜€B¾¹öû÷ÏG½ÁàêrÔ¿8©½¿øŒÒ€OÄ<¹8lÕœ¨DSE= Ü~1øˆDDNxWûð¾Ï89€yFƒ.2úp4èÊÅÓÑÅ`ÔŠÿ©DSE=¼dcí¼÷î´ÿ®w~ÜCÈ.ƒýaï%Èšþ ôSbè¾W‚½p®ÃXàϦðKô0UÔÃ=¶+‘Ö«uO~í#d0‚Èö3ñ*fÅñûl"ï·”?T¢‡©úžòW±#¨DÿREý»E·+n½LêÀò¼eÓñünæô²dmëƒ%¬üýKõo\D‚ìk2óÒhã–h¿DÿREý{ÌÃØÇoÒC=¿M’_ÒÇûÙãÜíÍã»p?Züí&ùE~KXH´0UÔ§³»q¼w>ãírv|â‰Àbùxž>þÇx 벑-aaKt±­¾&ÞÒ§!ü]lÿùñ]Í(c{E«5*Ѷ٦Q‰Ú²kÔÖ\8sdzEçè§q4 y¤] O¯O/..¯ß7#™DÿØ5ú§ HÞm ¨Ù-Å­a•è»F׬‡U­[‰Š°kTÄ*²óB*ÅI8žíB Ô ‰È·kD~<˃è·-ç!±ÝåYƒìušg¤9ðIo×HúvÀg ûRàWRò5ß‘ˆxGo! ‰Üujäî#šDÙ$ _\_óÉ]Œÿ^6CR"Fš5\&üÁ>Ïaz²g‘ßm_=2’òØDd€‘ûÛ¿ïf`‹¤_ÍP‘o§*¼5íÛ•ÈoG]~£Wu5ÃJ"´ÆB[­[‰üuì6Ì/‘®NéZR/Wƒ¾P1¹%”òžiÃE‰ë(KÜfÝJd¥£bˆã1Z8^ðýäq#\‰¼skLZ™òO=wý_{×çç=1Jz3à$rÓU–›ml—%ø—ÝA÷ô´wZœ®S_"fÝ'‰YuðÏ.ûé1š/­nçh›àÿ ßbïÀjvšÅ•ˆpWY„7ëV"»]ÚBˆºÉ춑Ì^–ö–¨Y²·ˆ‘Ù[Яg¥‡v7ѱ°R÷I1€¹¢qÌ胂MduSTÚ^é¥á½*†îÛ®˜Ìæ:#Vèá,Ð}Ý0­/¢L¡¼r6CsAtŽ0Gný¬IW­&„aů¡H£:NR ‘Gmf6gÔÕ¹íZ¦é‡ºÏYèFŒ›^×çà…˜€iV`èÜð Ò:Q¤ÑS•×ÉAžÂÒYS‘†õv2¼¯ þÕfëì×ÍC“¥ÂÀœã‘K sBƒyÀDÌUƒâ%¼65]'…ÍP´ }ÁH\ëNØÒè)̇eëF#TgK+SR‘i…†ë‚ŠóŒ€¥UŽáú))Ío‡”u¡V±çMˆ]oøÃûæÆ2‘$¼€÷m­7ëá}›Fë.ð^Å«ðóß·¸ËÓdE$i"àýwÙŠCý¢9Ÿ°-º›ŠÄo*4„¿Þ«ï¿í]6"É·u¼Qç– Â¬ ú°`õ}Fž­)$ƒ¸ÆÁ}ñ¶ÚƒqÇ K»ÚRrˆL„»j&Ñ„ßóÉKʼn&I—AêÒel‰N–ƒ×RÆñÂ00d á‘Atæ9®kP\àtP"“2êõ®-R—i£Ædo‚:×#Ýâ.`èVh:T§ºK¬ˆ[~èÛIïEÈ·Å·ÞFV3s¨5*ÑS«é2Ô•è)¥[•>Í„D%ªç°¨û 8Ãt–2ÁßBúKrXÅÛü4”þõ»’Ä¢4¡Ôg.±,'p LÙÈw-/À+Ö|JpúFÈÀË™‹×€ˆ‰«(B~ÖÆÓù]¢<¯%ºz5ã…R£’4d5 …Z£e£”â+Zu’ÜD97ÄãÏ¿-4qm8£sòåçxCø%@17Ä6?Íæµ$9YIÑb^{ÚŽ4dŽD,Ä;x ›Õ-FQy9—Þñ$&¶êT•$‡ uÉ!¶dmÙ`—”;V`.X¡.u=Pø:®ŽA¼%í)‡$•YM%¡Ö¨D7­æwPkT¢/”’.|MÁ$Q[H”p™n%– Ž¸¦x3ø%‰ˆb¢„m~š &I¦²’)¡…` Mf> }ƒ„RÏtÜ,¤ºcê>Ç›öŠFÅÕ™×ðï)“W’;¬äNh#jýÐñ9#$â¡áØ, QàÐ$¶OW1z6ÍW—I¡fë¡‘à%µ¢Û ‚nÒ¸¦é:ž¯ƒ,&œ•P\´¹n©¬v™¡Œ¿DqÖebØþnD&u#ëÚÐsLnÙuHà'ÌwWñßšÅa#*ù:G¥›z®å^÷‚& ¯ûVd{žÉ(‰ W·uJ™cû¡%».ýò³¼ƒ2(#-ѽ«©6»ÆõҥˮÚ*H»¦c†á0=t³}=`÷¼-*×*ÛEël*I’²š$B­Q‰AP—¹aK†uX`[gø‘c<ŠF]Çñ©ËxeyÁÂpp¬Ì—Ÿ'Ê>AIÚR—öaKÂ"kÛò jº®Ç¸ +Cf9œZ¡Ï-× ²n˜Ý­ñ‹)#+ÉAVsD¨5*1ê7Û X¿?°¾¡@õN’"§Ëá«_h¸ôNù–µŸp¨1Æ^¤ö‰c•À”•è×Ù]-2’­WÀ› ¢‚‡µŠ‡îzB\ççN]OÛUÅ¥8£S9Ÿ£H1#cCyp¡œ¦êŠ9óæ!‹›ù½¸°ŠN ®)4 :Gÿ­k ft™Šûœòk$ÓÜ6íÔ}4 GšÞ9q˜G{ªPXCq,‹#K+Ç•ûÉ…Š|]«.TÚ®‘7hIt<®úh1ºEÁbâ!®L°˜ŽÞbšÈc'Õ§‰¼­å4)Gdn&,08ž—Ý0[ºxŸªHÖ†7¡¾Dáÿq4æ‹x»3ÆYΧÁåA†ê—·µ$x%t±žâ¥¢Ž¹µ0yÁÙå²0æ6ßÎ')ý·JroIò Ç ªBjÝ’ýIªÓ~Œžð)ôÙ!žçi,å®0u!ØÆ­ÖB>§ð³0j3~V\Ùˆ rg“:AÛ8®ê§aµ|½“k‹d¥c›‘•êmøTîÁR'kkoX=³~9mMõ²#­)êR?VÔ[úÄê1/9ç´Çõ_l•“,gÉIVe¹”xÒ}֯͞m3‘—ÖÛ* M£dám,-rhÓW j.x¯¼8z£WáhçŸâ& híÙT;ƒÿ¼›h†£:¡1-,Eq]s‘UØЊ¸­ñOI2?<8øüùó~8ûòpçû³ÅÍÁxò/Ù:vçÕøöf-^¯;yùô¦£±IR<èwD Ùw÷mø™‚ R”ð­? ð;9Úùáÿ?Âi ªRÐüyÞ¡b·Ù‡Ž»–…ß`eéåoìб,ãbPJ-XÓÚæÀ­`ˆý éÛbÓ租¦ýà§9Ÿ7–“½ÿ‹~^ýxrq<úxÙÓpԵ˫7§ýc­³wpðÁ<>88h¿½¼յтMc!,Ùäà wÞÑÊÒâ³)ÅhpðÛ"X9û¹—”jî‡Iˆ2Dtøåv2_¯i†xž—ÖeÁT„¯[ž€˜‚²{`Pï_wŽSiº7Â(Á\¶‚|ç_’´ò/¨#bž¼¾½Ýs…zÔÈo{WݽãÙíœ%cXé”Úé÷^{Ë:iXÖM*dg‹R¹“TÈ¥ÂMTHÆÉ„åböP»çTÙ´·cXK xÄ|Š¾ø´àΫÉxúG&æÇûAw´Ÿ`vЇ ?qžt4Œ†ÌÐÃØS,Æó¤üæwvÏÒ§™Tþýßw|ñ°ÿ{,"µÄµŠáÃ4æé ÕÚ%xs¡¯²&A6ž™ÄGÍŒvG2›wR-ÎÄeL ~‹Ww‰[Ž Ð®6N´1ª¿^Ѻ+ëúÇTeí MÙ‚3dD¬^>™ÄsŒ§7¯;zGü=Ý“ý}´£½JRhàÇB[r¼0ìP£öüË/X^†ùˬúÞ„GPDߧü6-£€Ì³ß~©I”3–(‡ë• ŠõJçHß÷öóhQÑ`j]à$D’Eú•ëLen¤vŸ†Ò¹bUà‹¥™¬°®(S‚Êî³Ï¤SØMÀ™)ŠÚ+0-–Oñ³ì¼šŒ—ö_Ùnø±ñ4Åÿ’Ýð"t-)¨¸® áz€Áãq¥¡óâ±J#l …XWÚ8a K)ò`Ô´VDLÞ-"b²hÝÑUèp¢¯oêÕÁÝ$Ì|T«ô6*ô6|=$)Ž§PK…V7“™Ï&ÕVÞ¥ÏT0*ã³RõS<‹ÂX§DTxÇ'ü¶SÊ®Ã'yLw8^\û°î21úÀbŒr‡E–ÁHÀlE”EÄÏ#…É^˜C÷ØBq³”Yé„飒=ŽïnoÙâåIN£ŸððÚÞ-Ç “âm~”-=ÅQÛJãB:uV–^é³Z[’·@!mp‡|‰}켚W—b-/i:Gïf“ƒþò%–âj<´ÈKû)%çKQšö’b ±I,Ä좌%ÈEG•Á Åîôu ŸŒ¼ÌÍbv7Ïi]DƲ„ÈFâÎœæû Ä{>‘#_c|¢½Ài:_ð`‹;­ñÏxü?\>¶Méý”±u™anZs—°ÀðÏÔËñ™cQfóïzlåÈ—ÀXZµ±lJߧŒ%熮4ˆ,Ûç@pLCŒÐæ ¿-,‡¶Dü|kZ{ñ5…nS?e0Ñç{̵|jº~èòÀ5¹¯‡Žoéa„h|ÇSŽ| Xí_Ç›°ÅssH&ÄE_rni:‚Oá?4 Id‡dë[AD‰9¾áz@Eœà÷Ë-rä«ÜòŒlBžÉ*4äìÖ”ž$œ(û%‘çPX`˜œ3æÔ¡‘n™†#rË}¿ì&G¾F|çŸìÖ”žÂnV`Rr¹ïIJ<Çà‘é3ÆtÂ޿-ÃFm‰à »¹OEÒ8yøú&NSR?eX#X% È£Žù>õm‚Dß 4 E‚ÇohXåЮ ë·3¨M ý”A¥¾c;Tç:µ-_§¡Dú±MÃóÞÒ f׳Œ©ØÍ‹“_ߟ0o:hOa3Ò£ൠÇò<Çô¨9.#®¡{4ôÛÍú¿Ší G¾ìq¸›<ÿ¦ٚ¦éà=É5å¸<´"7 |æyœêá[x’.2mXAµÛ4x.I"¶¼gÿI VÿTC"+h±ñ½ao)ß?ÒNfÁ†ã‰,¸b3igI6 >a_"øQa…ƒ;Så·Œ™:žÎ³d¶Ü§]Ý@KvŠtVbW™ÝªB’"®rëƒX]¶æ1e0Ž^¬y˜‚#u›¦éz^ùXÓ}F~{tO^À×î YÄ„”Тµ?øCçhþ:T0ÖU“Qb-â/7Rãqr+)+³CÄèãõ æiaµ‘Ø…Îç0 >ù=Å~5F߈§¸Yýy–‰¢XcÓP[ðän1MË-x|7I4o´)ÿœ•Ó^TÚ¸å,+>N>i &é&8/×X„u–o™WÊfeYÕ6¿7^â©ÜN'•ÑÃ-ï09ºÄß<áâ„NÂ4î¨,:òò;ù®çœ Ùœh¼ˆ“Œ.“`_+‰UI³F¥Ù˜3 ¹Z»Cˆh†P0ƤB‹,à,Ô&ƒt< ‚tµùLœGÇ‘(ë.¨‹Œø ÂÃðäï@õý´¿´;ä¹eä·Æ sªm¶‹éãCŒVçþKåg$%«/£<°ò¾`„§ˆöˆ76d‘LJIqd_œÌx‰ÖXø0!´êIš/¨×6d?Î^BË áé´lS²yKvµ%ÜKÁÉݤ!§ÚÐ}™äå`šM¶€‚sý{¶2ûñ¯nˆº_Ý,¨® ” ÏÍ÷¿¬*Ïh£FCÔËY©L­fš3Lò87ÙQÊ2¨‰ü”ü ¾Cá‚ŠZLøg¡wÒp¶´ÉÙôÿØ» ¹©3=Àb’q€ a±9bä’±™CgöÌxÁ&àÅ6¬w¼†gü$=MË£i5’zÆÑ8ÔÖ†#@Q!à8NXÀ wA’-0ìRN……µ³,¡È.¤–aß!©Õ×tk¦Ï¡»Ê²­ãé¿þï¿Þÿ“Ùv£;¹ïê0½ÌJÇrD*A|õ–9F#ã‚ðVc,Wu¤ÇlÐSóuÉ $»$€eبŸ.ÖTÇ#È üûkG¦>¸„õÇþ´¿ªtø&¢_£=­² €KSð|´Ñ‚€¿yΆm½„6ÂÅFÐç5’j Õ(*¨kœ@áoô Ä#ÎûicXÐßPÃÁº¹Ä–B;¥`ŸìÓ¥LÙ V'ð¤=‡±ý¤]‹]ŒÆFdÌô —í¢á±i1*¡¼í¨fÆ©‡v] RR*v'–„óO$[G#@ò Uo:AæªUƒè"¢€+ÇL$M;§LÐœœr©n”€ìÃ&)‹@jÔ6 ûA²Uç‡ÙS¨ ÃÕ+pl5Ž«{‰H‚þÅV×èÚFÞ–6òRÌ¢ƒ“ƒ¾õÖÊ@\´ÃDŽ…ׂTžG3ÑÍhÀ@\ÍD'¬ ݆Í`\­’-µ&ê‡gtœ#‚ï8Ÿ3—L— Æ=x"u3lî´VOk0K¡ÁZG`ÈSxR°­£4« þ¼yt²ßêh–ô}fPšW‰“y+%Ÿã‹®—VŽ…*3FëÊbÿN)A½IDï"pÀd°0N ¡ éÅ#®—ì‹Ëp´0@#MFBœÏ2?'Løð¿À\‘ô¥Ú•òS?ñ¬è–² A´'4o6´œaÙ©ÑaËœ¯7T°o¶y8­Þ65 J´˜‹l"oUUEÏ3d­Ðí´&í*Y«p6J€Phá‚q&ÕvM2™”ŠÀÒAì|˺“D`…ÇÀÎ(ò¤ a|ovƒx!FFÄ.»›ñ`’(IØÛK<^zJ12*Äq3 ÎÕâ¹ÛÈ¢1]4~—i©@'Lk”t†j6“;Ev“H³Ã7ýn¸_Û‹@&T’1½õÂ}+" J5gê$ ó-×HIéYIó°/Æ„w¢‰| 1š²-V•±çù  RÄ7ÖËn«­Ó€c»0¤¤¸õóL‡ùá$€“q`d4#@ed„¬:ºFãCÜ e¨]¶ÐÖàVc˜ pWF1ÚáN»)ó¼p çÕ«a10ßþKkiGŒ!î† ·#&AËü°üŠØrù´$³6|’†½Ì„ÇO'`,u]9²;Î’~®‘š]#"‘A§4%Rµ!N×ïàczª…Rú¦²ÚY}‚«Ôå®Î2Àõ¸“P[®|ªŸžê§úÁ „ߢžÐ…Å7 Û—jY\*È^Û<±ØÁÄ¿­Žð#Ê™¿Rø„nÂS: Ù¼nßpD% °M1~Ãl/m“¢‘[yþ\Ó˜\¥Ë í&cHv¡°Ù<5”³ITC¢vÇLU×°>Ôrtç¸ÉjÕA7N™cÌ—õè©‚“dˆçu¤n;Íüå¢C£Ù7϶~jïJo¹à›‹ñfé·YïôXo`«Í|MiÄY–sm\uÌâÍÞl£7{·9°ÿ‘ââ·^‘ØlYhÛÁU¢5Ótr*F'ý|ÞôR¤±.UÅŽò. öÛX£ì̘F³ýùûŒÁð1†G*à KÄè)AtJ¯&66ʺÜË«V( ïÇuáƒõ¤;ûõ±‘¼N¸…ËÝ'Ò©œ§ÝñÏ’é˜I½kôOÚetŠ _õjjã— vvÌê#âÒd¬}˜¾šn§ªï@­²QQÄs1‰ þ"/pÒ²$‘“بÐÁrbŒc;¶ª½(ñË`²g˜ØŽ™1JÞWîz‹þT}Äé$Á ÄÆõÑ1PE:/F(ÕÈlУ å™Ï‚Æ8ttDºñI̯"é6€ ¢÷ùWü›7.E-§p‘éJZ¶“ ‹5-•<¹=É1H»yîNB\VA>ß=¡«NýKìVLô"²”ÑH7FÃ=5bÁɘ„ÎÙΤIåtªw!ç©À›{½. ÜG×I£îÍ*°FMKIêªP0úØIô†n·ûL nq"Lw±‰ðßÉWù@A°i—kpŽ}ç);vž'’HX/˜æîukW DN„P†^8f¾~ó,TùШà•Å&¹óÍ›_Ñ«P±Ž•©˜3R}kÙA²‰¼A Ud("ªÒǪšcHù e+ÀAÒŽÅ™©{ U¹hÐ0…åÛò/.ñu¥ËÏ[æ¨7`©:&Î (°Ü€£ù4í>VýÏ—-5ähý([ªò4OýÎKg¹ØÝ4¿ùßžL)æ¦aµ©Šï(#ÿs/ä¾;ªX±-ÿ×ãwŹkÎ<¼ó8ü¹¾ò¬kÑßóñŸÏÌAÇW&ttrÂʧ m9èýg'‡ÖÏÿ廟¼Æ­ü’pS|õVÞ|Ó¿¬8åÁ÷ïýöÝ;c»ïgË®äì¿Ùq»uû=ñyÝÒá/t2W­¿ä” Ž»å«ó¿÷˜ç¾qùcFê΃ÓGïìO]nçµÚþ/ìíXýúƒ¯ï¾áí—ýî&fÿ¶S2§Eï{l÷“ïßùoÝGo{bý£7-ÈìÚ¶}ãU—Çî¸G/¹õ–¸kû¯_ÈpÆŸŽ=üÆgè_õ‡¥ 7/>{íÞõ}s3_H­¾aß ó¶ÿdóK÷ïúë7?ø©´õÑ5Ÿ90÷ íù?ï_÷»ç–Õ±tÇSúþÅ}öÖ– îyä;Ç-ùí¯.xBùݯ·H®ýéÓo|뜓ñ_'Þq'síoÑÔG>êOÿä¥ 7h Rc½W¯~3Ñwã›?~üô}rÎçöWÞ»tk÷u›—íø¿^éå›Ç–}ï“«wÜ}ÍyŸðwôzxú×»~ðeÊ~xè£ Û¸Û{ã5ｸóø}?¡>ö’Ë>xvþQÇ^ñö¢§…Ëö}ñ¦Wö¼²qk÷®³¶Þêè÷_Ë,è¿äˆM®:$¹<öðósà¯:wìÝ>Çw}Wuþ鬓¿ÆŸÒaô¾àœg^ûøŒëÞóÍyÿqè%»÷½ýÇ+öwدͽô¡WüåkÉ‹Þüúÿû/}ØÚm?züÖ_l¼ä¤:îù»y{o|á[Ž>Yî&¬Â.5Ϧ=qpI^ª$eCg`ÝÐWzâÄú[ÐÈy=ëNëYnŽ¥‘ú-ÁvVž1È>CåÔjܦ¥)ÝûVPã25*“Ý1à gÞ^âyŽ’ ÉDåû/úûèý†žu-ßí^Ûh,,* ÏÉËØuè߀ßd+–žv‚W6ƒq@ϺÖðÍf 5Ù»;šúè•ÊT'SnŒ–ÿt ¿ž±½¢.3ÄﮧkiÇNCì ¦5v±/B5Éþx Ž™8Avà¡›ºÝ­óŠaÚ4Û}õBêªðÛÁs ,0é¸þ3hà2¢ Ò "l„ü?ƒéÿ;™~‡ö»Õ<]ŒjrK)šÞ²4BÝqªwÑ}¼Ç€º…í•à½‡ñ;’¶ÌÍhþ¨SÎ#|‡ëëÀ…Msn$û%"ƒlo¢—E“.Ó©û†ñüÍ®Ëýåù*r¼°ÔŸS*CË ¼9øBÖ=ƒf0‡tÉ=þ§À¸eNpÏÇ‚)Ós>fŒÀYbô}†>è»q‚þ2ÞÁÕ@OÑñŸ F ;Jì“éïCkÏM[–ÓÐÿt%€¢(<êœ6VÐÎü£·ûcŠÖ¼+ËÂçlëØ©™Û;ü¡oª¿/c¸^VwUsç›Ï™o>ä„ï ã*ôT%s5b˜20r[9“ž«dDÁñô ®šô„Nÿ“›ñ3IE×pö⑪n «¢¨DEIJÈ2”¡Ó$6yEŒ«r\æ·»nFC¿‡a^‘PãqIQy!g£è—š&ÄðLIŠóœæ¾Â´ ¿yoô….VÄβ|É}W—Ø[u/636¬É ’¡Ý9)mD­=äˆ>;LªLJÁ æ#¼¸4ðæ¶*ÔzÆ æ$è©!z¢Äí8Ü"{¯W,™ÞœGŸ9 6/üÆ=WépcYñ§‰6˜?Ož{:BþÙ¯¸À<Óô·éi„Ë*¤!8¢u£—®V: ~ˆ ¹ Ã&PaG‰­4¾"PºTé~O<È_5»T°tI~0{Q¤,ù´ªŽÓ lL ¨°‘•Çy1KòÃ^X (ÑùlÁï™Öó®ù2|'d²KÙbBÔ”¨´8乨Ì&øä8YQ9ªÅpFÉi¬ Û-w+bÉ «RÕ’ó^Zùqƒ»*!ŽÐSW1õY¦òQtu_¦œØÕ[¨ðñ‚e*ìä5Ýgž‹oä€\ùœçb¼Ì±Ñ8Óâ1³g¼PãÐòŠÓ¢SZ (ßÛüÄÖ„»hbö©‚צMbÝØŸ¶¨,¡…ç™pIÐâr<*'¤('ò IãIBCPxçYÐdkZ¾·yÉsk¾¤åW3ì Ïd5Ç*q¨Aäb,€ Å¡œ€q¡Œà´V³¶±ÙÕ#Žòƒ/ÜîEé}•~ša'x&‹‰Ä eâ$ Šªb1^“4•‹ÆATbÅø¬^Ìòƒ/Ø¢ï¯eùe ;µ3â°@‰‰±Ò5ù¸,„¢È ±A×d¶loóÊ&ÑYo g 9³3YEžW1DÀ‰ ¼¨‰rT…0*|B‰Îê±üà‹æÞ¨iT*G…\³!¯ÏÆcñ¨Kð2ËÃD‚,*‚ãùYMå_4J£é#ìšÍÌVÙ¸¨²ªÂÆDY•„âTr"–@ò½(Ïjú(?ø\þQCÂhP…]ü™š â,Ò2bœ&!-2Ê ²„ÐÆT–8^›Ý„V~ð¹ÙXf¡…]üID+󟯪DrL¢œh.¹¶|oKîÊm „vŽg²žZLMHñX”•`‚¢‚$ò 6ƒlLYMžž ¿fëY¾·%\4p5ÃÎðLVSQUáUÄ Uåx”O$bœÓE…éYúss±Vo1Ëw6¿\úlcÜa—k&¤!Ë ìi’„„ˆ4eE@'xˆᆠqÛT¤Q¾³Åêa5ð#;»a½D¥Ü<®»–Ya*$¿Ù>GÜ:%KU”wh5.×È̼Š‹kñÏ,ñGØÔ…© ˆxle™#¢E3G$C§£)ïœnU)O!Ótö7BÂT M!%øŽçBÁx*ЇgmZ ª­ž(©…¶¥³Ðb ¬( ­Ÿ>¶éRЦÊ@ëMAµÓÏ–h·DæªÚfš=µú™fq^xtht¢,)ÎeeM+9};ÓìTfNºÙ, Ì’zyÙ܉­V+¨¥‹æ¨$¢«j Æ· «¥I¢4\†•[ð5R'§ËÉ挜 ¸C÷¸U´S8Ý£™Mi€â™"‘T‘E‹øQ Éf™ct«BÞš ˜P‘,’2°qºw7 fà^QÙ ’eü0ã©7s²oÖûÓþªÒá“R‹ž8–­žXEA×vA‡F Q!W¨ cfa#\,P=¡¤ÚEuŠ âm›'ƒ2ŽQž öÓÈæ° ‡?¡†ƒus‰--þ„vJÁ~ÚÒq>[Ì”Ý݃4Ot‰R€]‹]ŒÆ‘S˜é.Û…Ý £’ÊÛŽjfœzhו %¥bwbÉþʉ$bëh4“5ÞÖ ҹ(Èð\UQÀ•c&’¦Ó& ð–}’gºx7J@öÌ í ñÈ :Ô6 ûAlÒù;mÂ.«ÀAÚ8®ŽÓ®ç{¨[]£ky[ÚÈKi°\%uÄÿ»¢â|Ž…ׂTžG3ÑÍhÀ@\ÍD'¬ Ý®GuײÆÕ*ÙRk¢>qxFÇ9"øŽó9sÉt¹`܃'rQ7ÃæNk«£ ¸Î€Ðè:!OáIÁ¶ŽBu”ò;WšGGÁ»|ZÍQÛ…Ì[)ù_´ójg»¥»IÑî)Š17è]DΫ-í ÄH()RL¸^²o™N4¾ÈtœÏ2?gáúð¿Ú——å^*¿—¾y8­Þ65 J´˜Ë€ãÐhUUEÏ3d­Ðí´&í*Y«p™3€P×$CPâ ΤڮI&“RX:ˆý‘oyBw’è¬ðØEžT!L£ƒï Ãn/ÃÈ(£“Øbw3#Ð!,@ò % {{‰ÇËMÁfÓ‚lªïn#‹Æt‘¿H/MK¥:aZ£¤3T;°™Ü)²›D ˜¸éwÃýêÜ^¬!é*±¸AÓ0¢7¢^¸oE„A©" âLD¡P!¡µ“„8/ZKB˜˜‡}1&¼Mä‘ém‹Uå,Áy~ƒð‚TûšÆëïi«­Ó€c»0¤¤¸õóL‡ùá$€“q`d4#@ed„¬:ºFãC R¦ |²…v°&·ÒƒÀ»2ŠÑwÚÍÃì…ÃX8Ysí ‹ùö_ZK;b q7th¸1œ¸Z槀åW–+Èd4kÃ'iØËLxütÉRו#»ã,áç©9Ñ5"tJS"!U"†Œ™²¦C©EDéP¡p@?áÝ6. S˜ÉeC÷òŒ}Y&y-y‚ñ¿®Ü(@óÛ8rÛk(û Lë–™"1,Тé¿1©$!‚0tƒ\Ë>Š˜$åÈ8i¾Š™•ù›T(ñ %å+ 8`WÐÎ,¬Ýº“[ûP?w/R³ ZÚ ]=Œá0;E‡:‡*¡þœ+(gís •”)Ù{¸@½0\¾‚LE³—Ëûù¢Z]šoEËbkÇÇh§œ2“^°Å ³Fél™ãºŠø"°™´‡5‰e‡†½á`ö´¡SM¢ë7QBkq»5"x¢t4ºbBMÓ¸FÈ4Õz¸XÌŒWYÝ‘ C£íe1)à9$T\6ؼ'S˧òµ˜šnˆê šBOïkALh]Yu‰^[”‹å”ÊT´Ê¦PáDŒ~)¥ìR­îÿÙ»Öî4r&=ŸçWhÈyçä‚¡¥¾'±ÏKlœ°‡Ø^ÀÉälöxûêÁà—Ë$>ëß¾%©šnL©ÛŽì†î‹xT*ÕSRWIw—ösyÑÁÇC³¶NkóêœAOP¡îŸq¿}ÔOÏG,°ž'[¡vÓÂÖ\±õV8SôÄ6û§8Õf(˜½ž1[øåg'Vý?ëIÀ~ôi‰Ÿ™?t¦×@¥å|àÂùÔ ¾Ï}.†ãhIŸŒ(ïzUŸl+=NÚ¯2@w!|[_êgçî—úá$í¾Y©ÓÅÝ·%þœq¹«…õ¿ŸXììšÑ?:Ã?DÑšünâ'¸ˆSÌÍËшäõ©Çã»<Q)lÇdYðî®ÖeJ6Ž…=™Œ®ºCŸÈ0к˜1ŽDŠ¶Z§FZö Õˆ¨Ý‹I8Œùx†åp”¯q³Ugð%s¦çbåËûã¨mÁI~Äåz~o™æ:l m¾™–I5ü3ðVJ‚Á·ø¾ ïj󅟦·šéÍHð®o¦èßÏç/ÊZ`úÓß¹Öx²·öÐÉÞ?-ð²“þ¶³“®»3#;;pœ™Í½éºÄ„¶.ùwqêÓryªÖÓ†<á(wbïåŒ(ö~}£©œ_“·ðþ·Åˆ0›0‚ª?7¬ç¦+ƔǗѸL.ù¤lb½¼¤²ŸæóËçÍæ—/_áäëÕy4nL¦çMž£ô5QŽ__/Îs ÈlìÖÒ;.Çç|cˆùò ÿU("m8 ¾JÈpHV‰Ÿõ'áÿŸÿÈÞ¯¿|// ª€Õäª`­ÅˆÝÉoh¼XÃàÿSÛÔ²ÿó4ƒiÖ/”™¦iPS³Ø/µ Óø…hwòëÈkÁ5”_|o6Ÿ,n®0vþ}½üíàxðá¤Mxs““ÓWÝÎ>©í4›ïõýfó`p@þx3xÛÕÖÈ` t',¶7j6ÛG5’íP_tÑ—½æW^å7'_wæ™;á<äÝLüà׋Ñx¶»¡꺮¼[\yœ;€É 'õ;ÀÇÿvkûÉÚ"|'Zj~vkóèë\Þü"øäMÁ.ïžwÑQ …ü±sÚÚÙŸ\\‚\•)§ÓÞuW÷È-åÏ¥’»—$×H; û¿¸a>œ륖è9™Ág# }ѵȡL#×üú¨ïÏÄ>YÎÁlVçd´[›Í¯FÑìSÍk„;xIÍøüGfÁtx9ÏžùìýåÉ£‰Íúü¯¸ÏÜhÊ3j7†Wãd&m–¿;ƒ75‰J‰0“IS&ö»vÜa—{îqÆ'"Šy]Lx#w³à¢zàŒ&3ù¸-ùéß$¡,Ëá2õ¦‘ǵ&ñr¢ßd&_n·¦ÕÄß—|JWþ ®É˹DÃ"*ñí{žÓºüú¢&¦0=™Ü¾3Šb¸Dk˜Ñ…¼†,€·öä']§Tø #ñmoÖ.Oµk{ZÃmh l8- ”$KÒQAâXÁ)£¬ùÊ’u#àz¹YE†sù‰‰‚×´V\“Á?öþšN¾ÐZÊ„\3Sq1Ê góÕàh4Ü[’m–UE}÷Þ‚g-ëâGI-å."pã¦2¸üdréZAGËÃ*…xcÐ(^ëµ2¼¹'ÁôÓgô[JKk,¦à$Îk«Ò¹ë¹ŽŽwïÍE½l.F‰/œ´êº¼Ùš¼YIoF"ëØ…»Tdu>šøÞh½”×ò˜J²õÙƒúiY!8 þó{2B…s‹u=°ihxžÁˆÞ` <‹Æ±éÅÔOàJÏe 0EWtTÁܬìFò‹éî.i«¬v%75“¦]¾’Ãò·äýùK=嚘ÁXyâ–žTåõ$}|f7™‘ƒF>¦…–mˆšfJ§Þù…ÔÎÌQ>´¢•ƽ{-YoIš¡ÌuãIm7+M;ý¯wK¡ )”­*´'{i0¹à›OŸíÜöõôéR]•°ëv}] q‹Þôô)ÙüZKºCêÁøÿÆWYì‚ÝPÇ~ïr7ìæ­å.^‰ÿµýU»…`·¾c¹ÛvûVr?L!OgbNךšÑdšæ܉Ü»óËÝE°» ØKý"Õ¶ÿ"ÕT¤Uî'v¡Tå'ŸÞå«~„È(SÂOVÿ•‡)æáäñLÌV]NFWŸ¢p*âE&#™êþ„ÿÏe²=WÔrø2£Jdö€òG*š°Kõ³³³zý¬.>³ïzþøYöXÁB•ÃU"5¿)ÞðÙ\Ž/ÿâŸ×õ\JâGˆ*ÛÓÊðù¿·ÁU"7Àý÷ß_ÿ-?³ïMÇ3ŸÍ3¨ÅÇ[àGŽ*ÇO^“ëýkrßváÝ%âû®øk_KÞ»éç>¹þÈѯµ@IüÉQ’“ø{äztM& ÎÞ£«·?¯ãÇG¹ ”ÃÏÊdJ”)ð·ÎQ‚sïEŠu¼?¯ëµ¨@F…JâGø—©ñ/‘Ú2^áŸÉ:H¬á~øGVøI®%ñ#üËùp¼h®$:¡?ß®Ð+’_â—=†ÿH²(‰á_¦Æ¿Og‰,ÅO2XIæÿ\«@Iüÿ2Uþ½&ƒNUük(‰á_¦Ê¿×¤]¶%ñ#üËTù÷>®ŸŠÏìûé†ãkÇšRk>>M+P?¿L™É1¹¾”z?†wÞ¹ž\“Kr½#mýÞ>¹ž^O|B_o¦fGYyüÿ2Uþýý‘î¾€A¢üý¯›þ/sÏ–¿VÜ—^-) „Ë™*—ßÙ«~ár]‘Ë÷'—WSþHˆ<ÞBÄTÆéx(f8æWäÄ›g;ýEc[1Âëõ:­;Áp¹®Êå%„ËuE.¬ïÀÑÅ,"¯úd4 ¢ñ,zrø.×¹¼…ÃÙ|:ô2â td!Öm%ò¡‡üáØ“ëá_ÌêÉz¸Óå"½•ð#\®+r¹ M ÄCˆº\â6š^ çüYâ22M.7ÌSH&£Ñä žã C¹.n5ü—ëŠ\Î_Dóç·Vÿ²ø.וÇÒwõ*‰ár]‘Ëi#×DÚv¢ûÁ$„ÖYÌDj¼—ÄSz>–vw<™C¯¯—Åp¹®ÊåD>wãO_9òŒ^óŽ»®ôPO(bxM·–?¿º"ÿ²¢üAÎ{“Ê:s¸¢MP¿ð¯¡:–&K¨Òinyüÿêü»þ Ð6Á¶‹ELÉ…7¦Co4[ÙRaüÅóßL£5ÊãGø×Pä_].qÈ N—½ÐÇ~%"vøâò<6g>áñ'“éL¬^õ¹˜ÌÅ2R VóYiüÿªci?ˆø/¸Úpy6‰ç_83¤ ;»ŒNs| sN¼SNpcIub-üFiüÿêsÙbÿ „ Eþ¼éôIÿøpð¾Õkø~Ò;~×9hWàd›´NoŽ{ä¿þ«Õ‡Ób´"‡,­£x í?Nzí~ŸÀEUêð°¡È÷'Ý †jôZGƒN»_g¿{zÐ9z]'¯Näèx@º·\68®‹Úo+‹áaC‘‡ÉÛvoÿ €h½êt;ƒBÀ‡Áî!H·ENZ½Agÿ´Ûê‘“ÓÞÉqšZí Óßï¶:oÛìÂÆ"wŽ@¾¤ý®}4 ý7­n7«<¯Ú øÖ«n[Ö”æ Ókïx¥ßªö„‡ E]­áwë¤ÒÞïð/í?Ú ­Þ‡:×îýã£~ûßOá"8IZo[¯A]ç´¬$~áaS‘‡óÊ Ýxÿ´×~ËÛt«úª?è Nmòúøø@ôÖ~»÷®³ßî¿ ÝcÞÉi¿]Ö36yø 5h )pPzÅõæ´ßêß9´{½Ó“Açøè ysü ¤€D?9>jU^L„‡MEm?î}àBäš.:p¼Ó†ã=Þ9@y½Wôþ ×Ùd/ƒšŽ{ƒJúo"«7"S¨"p„jm§Û Ún…B„ •Hóé³;ôàKIÚA¨É¹eTÌ2_ƒ?}ã[3¯v"¾“”ƒp’£6x—¯r#(!&G¯¢•a8F…BÝmv|eÄE›ðȳÃ0ˆ]×5—ùVàž¥GººstƒË¹¦L:¾©ÍþŒ®¾L¦¡\¤‹/ÿ•\J¶%=@#S|Ç·5Í÷)$¾£4ÒB@ÚÉ®)ÜlÉ}Å9’LJnô[î~óÐŒ¯.‹Ë=ó¯urs€\Ó$›yÿ·bk Ìä®3QÃð¹ž,¬µK¨ªZ $ãVk¹¸Î¶Ú­ k“¬Ò¿eä…r£Tuâp]QǣɗÚ^Ì×ý’¢~ü„ Wœ*qÁ_Ïž=QBEµíÌçs¨‰Å†×q²ÙýÚÒ» ÁÕó@‹ÿ×b2qýq.¿$%=Qk=Š$ÅÃùò*A‘¤x8¯Ü ÃxÙ¼’ßvÉÑi·«*øí›jú­ÿlg‡, Éüã¸Z+l'8¯,°h4‹ÊtŠd£Ãù;‘o5ab«Šh»…óUu»A„óÊrÿòI¬o´IWy‚"9Þp¾ÐJç7Áê0¶ÛP8_€ñM:E²¹)-šÏ{2ìHÒ7Í%}§~ó}w$§›Òââ$ÀÁ=·6€Hö6¥ECý?Š%#¦•æMëW$+šÒ¢q%K·NÕŠ!©Ë4Ÿº¬V(biÞ4n±-"6ùë–ìúˆI¤eLâWöüg´TßGÌ$Ýd&ï«ç#Ù¼”ÝÞã¬ØÓ‘<]šÏÓU+1tLy¦&9ábH/ᯥ4Ƀ¥¬hÉî…ªüVÊŠvðÕ1“ìö>(@{—.Íó0§¼uá™îˆÉOlÞà‘‚Ol˜VdÄAØZì°( ¨e…~˜áñÅ–§éJÆÊ"@Œx>ÿU­PĈ³{1âHj)egÄ‘LOÊÒˆ#iœT0#Ž$hÒ|‚¦Z¡ˆ×+qÐÙó…w^Re‘ Hª?G2©þVI[¤úXñnÒ `Æg·2ãz1cšKY¨‡ÔÓ˜›žaÚvÑ8 j{©î”±ãHî#Íç>ªŠØqý^ì8’VHõ‡³ãHÆ ÕÒŽ#é€Ôx0;Ž$úÑ|¢ŸZ¡ˆ7*Ùq±xì×yš‡'žX—Ò^$©ŽLúÍ!#vú JsÆ‚ÐvCjÅn¤éûºoñȎÌüž·Ë‡U²eËØ+3óè1ÓƒÈ7Ý@ ,Ëq 晡넮_ÛKdÄ˯§½HYfÉçì©Š0‚QdU¸\îïRRÓläŸÃmÓ=m–˜ù¾æF.Їé1fàø¡ãø,Ò´(yT™Ä¶ÜJ¢Ð1ÏöM‡ÒÐ5©áÛºnh†Yššamï2³óM@h&Ÿo§V(›u`oSV¢0ŠD±åqµ™´Œ³X³Â 4Ó2-ßÔK÷4Û€¡Yɶ2KÌ·Ò×sâHó]¡žëk†Å\3,¡oØ"õyù;•”Iš£ù¤9µB¢1‹å J0·3Ðö($ËÈI²Œ+©H²57ÐÖÍqmi ƒX&e4¶ø°}OwLË ]=³mƶ·ÜHIb¾•fèf›3h kúnä3ÏöœÀcf¨ù!h¾Øôªšb šÏ†S+¡™žß¬«8Ú’:€ð•¹¯¾'†€bmOÀô8Ô³5†¶A=ÇòâÈ0ÁVÔö–’©¦ƒæÚÔ EXÇ,nÄãÕÝR¢qÍsm75’æššå†f›ÌóK¬Þ6N\'Uدå“ËÔ EèÉÜ@O7u‡#î.—å!‰ZÔ*ŽVʇo¨>‹F²®¨µékõAg™!'’OE­MWïoЉdfQ«8Ü)î]Åq'’¥E­¢ÕW|Ü‹ä[Q+oÁUËE,_>oJ­PÄòY[ÃO²}} f:g•ú;bǬ­ñ{ß®{!–Ð*ZÂûêZH¦µóòžfsÜ%šË]RÔ|$•ˆæS‰Ô E¬S>ÇG©Ð­ò QÏ‘o»QH™Á"ßÒ+à#«XcŽcëQäû²ÿVQÏž Ã~4Ô)â8¦ž0Ó÷B‡:ž™z¾Ë ge6F"ø©SˆëüF‘Þ+ϸN4Õî„ïÓ\ø¾b÷@â÷i•ø}ê ,æ˜ u·Õ_¥{Ä& ºGAhYŽ…ó ›Z™«»ÇÍJ©g”’%Z© 78š¥Þˆ’…Þ|ãþá"ºàª„ñýÇþÙj^Xõ¸ß=;=:hvŽÚªm(”›w‹T‘ âšOXUdˆcU-9Ío>‡Õ‘!Þ™«¼ Ùhx£[!C\¶í)7!yÓ`dåP "2Äks+$î1$}‚Ò'ÌGè–gûžïë`;"ØÖsMË M(Î ôŒ!8æg Jb9ÊÄŽHæùÝ»¸|±Ö;WÇ–ý¢®XÇí¾Ó6G_)€¥ú×WÇ–Š—àL[\‘A’×ÁŠyjÅn'fVÈÒ¸y2æ‹éw¹L-}¨Æt7rL+>¬ŽwTĻꑊx·s+$¬Üo+‡·´¹ØNS,—Ï¢æp3$=…iU(I1aù Õ ÝV‡;ˆXìÇ6 XÄ!PÏs"fiV쳧Dæ|»ñhënYfèRú,ð¼P#š±(Œ¨d½åéP>o¼Ï)CbðY!_ÉZYé3ß þŒÂÅ¥z6CBïY!ô^Ý9«†ñ,XÞ³¸¹ÍͶ™\ä%i¶œÌB>Ó¯ ñ, ü•@f„X â£ÂúïtÔK¤Gú†î1K·4n Xèºø-NìúëÕö–ƒ]ÕŠ!F!/àf”ZVò‰¬³‚WE„øù¬Ô Eˆž© 37?ÓÚ-÷L‹!AùlCP~Ù äG·M·eHÌ>+³¿æ•«@L{!2_Ñ}@‚êY!¨þæje²UÛ œgzq˜W¾íÿã.%éh%$þ•Š(ìÅþÙæ¨kXë ‘úé‹O*ôÚÝv«ßVUE$ŸbñU5±|ù]‚Ô EŒW!^ÉΨLh°8ÒM×4©gY¶åS C3©iy~v}<ΧÃùÕYð) þ\Îh<á¦LS{>Ç8w¦GN¼í¿ü/{çÚ#Çá¿ÒëIl’‡—"0Áñ‡•K 6HWyiZ˜‹Í¯_Võtõ…ì>$§{fï0,ɪb±XçB¾Ï9æê2­ÙŠôy^®ópÓpѤåí¿Z¼]¦€ã—±åÉØãÃrñÛÕòòÃW]æسL`_yYÄŠfŠùƒ¼?Ü}ÍÓ—<ùø©‘ö„)š«‹åíõ"¥‘=¢'†hçY¦_Ýþ›³íÒOk±òÅ!Úz¶ßj§î¢ˆ•æYÈ|ð#¾Y†èéY‹žþǸø¼¼¾¾°£/¹ Ÿ?¦$s»ß½Ù© Ï4Ô½?i[Wˆàž•÷÷3†³â¨vQ1ïu¬Ž\ M—FÛ¤4šî*î~1×ïÿíççµw>=ö´¥þóïÇ6¯xû¼~ ¾Š—öËyle±(†h÷YA»ŸÝrºá´t°9 …”DE9ã’3¯,žÞhࣂqwNkñVéÿâ¼o”/¶®5äºdN()@ƒÑÜ{"MPœ‹A7 àeJ(Çî-3xRžg7•ñ°ýn:uEœ_‰h2®Sê»mXW¹ð–`½Ã´"}&ræÝmyíÙ|Ê`­”SL;‚6Â¥¢2ÖúÑœîšÏËeúЛ­g³Vym<ÇnRÿñ¶6@@Ȇ‘‡¼ÐÝ|¶:s„2`Ê`QØü«5âˆfŸ‰’ t›¬Ér+8Ð|kµ·)èKî× ÄHJˆ_|»º|ƒIAV`wË ~BlME“‚`ªµÆœKùKR0 ƒ÷&ýjg“ìf¹Þ¨œ¾¢ÕïV/pÄO˜…Jƒ‹¨ýYÚŸ!jVPûwÈ'?ÞüóN8^ßÿô¿À¸jþë²sç á˜ÈwÎÚ·x¾iûYìÆ;ÉÒØÉeu*ÿ~Ý^y³ *‡x²Œ ¹³ûÿögj' q•V¥ÎA¾Ùè~ÍUèZجÂ2X¥êŽU/ÊHǬ#`’Ù`cŽÈ´JÉÛ^†xsÔú«çqÍû~ê.Šx=•gwíöíϋ׷Ÿl¸K¡lÊ tÚ=Äaêþ.u¬¶—3â5H¤BK>¨Q‡))U~44%ŒëAËýš —Ó¤4‰Ær Ï«' öÕ]ñŸª…OŸgÚSÊœæcè—B I‚)ˆŽ:¶ÞîÙÌô½Â‹æòMÒˆí7ª»(âÆR}ë˜zäL»eÕûQHû¦J>þIæ«HÏ ¦°|µÆ!¿š KtÚ[¤ ŠµÌŸ’Cn]‰µƒøã!O•+·±j‘eÔbïŽÓ×µå„l(œ´Ö]qbCCu–ãâ2ŒMʦÖ׿]ܸ_ãóýN™T’ H‰±CƹpxZmTÄ ¥ÓÆû©ŽÄG %0àÜœÙipíà NiÈR­-@œÄÐhĦk¤bJÝW²uØö…hIJê{€µ±Çºî¬úí ÆQ—ŽÀŽDÍë=9•dÐ) Q Œhc˜‘N{£f°+@WaÅí\ªÖY 2Ë åsŸ¦í7Ö>bõ3ž¹ÚB <2Ó=‚³ %~%®Â³Œ3®cÄ ÷P€PÂÐ@ Ït¨²<\j£Òg°`Á3jéANû£†c÷ ¯üá~ôÔlÔÒqú¦ ¤£f í TÁÈq%8åQ2ŠHc!„%˜›ªA¥‘Ñ3ÖlQc/ˆä³â¸Mi"K}àhúe¹Â]FnúÏö¡Y9@šAAÖ êü¬ mŸ kût^VfQ5‹zVžRõ”z`V~T@3Öê÷ÁÊÒ ²žXçfåé´C U UTíIX9@`Z8A«{³r€¶¶'få¡g!£g+Ãz…z=øXí¬ d*:V=$+Wùˆ±.t¶jÝ“Nñöûå›4Ò údnú¨>@YÈÙýŸv¶2¶vå"v‘õØEI… I=Û§ˆÕàp(URh€˜^G MTM´ÀzoB»Bv}`´àdG©#@U(ªGtkmTTJ8cõ ¤ö0PnLäž@ôÆH_äw¶*†[|¹ õ DaZ¡ÐñëaèE@ÀX=Ò e…&”õÁéE@XS(°¦Çáw·‡S;Qˆ·“åsŸ‡ !h¡@ÐNc«»8âH |ëɹžf¼±6C˜T(2©í.íÍî>l§ýB U(@ªU].rEG_`•Ub¬)Áxµ'|y@Lõô»`Õsx|Õ•!ô+ôtŠP…ª§Ej!?AÝ?KûC"µ€Ð¯ : ƒBŒ‚ʽ_ÅL§ÈSÏ“ö’¤hX+F5˜U¤¤-!µ÷Œ€ÏŠÖBÁÂ[yQÄðÓ“»à3¡µ€©PRŸä~ ­BZmݱùéóM?W > |´*Ö·ž3˽¥ž ΋TGç …¸Ú÷ËÕ“Üók>g  ¶Òý#*ôR¨€P¨ðø* *<… … §§P¡Pá÷D¡B¡B7… … =* *<.… … L¡B¡Âi)T@(TøƒQ¨€P¨ð{ P¡P¡›B„B…  ž&… … * *ôP¨¡Pù“¤P9B¡ò. •#*ï¡P9B¡ò •#mVù^›Õ~óÅ)Zœ+GÚ®ò½¶«åñ/^”·­ŸŸƒñ£?Þ^º1Ã9öÿ6Žÿ¸¹ã{mXÿ”?_·=ÀqÓÊIÇæGú§rÒqÐÍÂjc4ýÍpÍ’'u–¸aHiq4–Ò†I- •"¨id¬\7ÓÍ"~GeàÒPBm´FaV{êl¾N«w²ŒµÐ5ÙÖˆ¨\EãÂÝخ‡‹Tý­îˆ#€ϽC?¥8g²¯‚»÷jƒaŽ€~¼¥»å·ù1Í×Fürán¯®Ò7;ÿzüÿj×/bªúU²í7¼µ;÷úæÓMöÌÔg¨_çÈÒëýµqdˆyÍ›_öãk-Oí “™¡Ukì>àÔŽ±³Y¯ËÃ#q¿˜«õP^,n>U¯êã±(¯B ³ÉˆWÓGW©ÉåìÇ«zcf£¸¨½;„BGE^Ž`y<Ãòª6Fß1³ì•ALlÆñUCâ-–ÁþxOÏKŽ`z¼¡çå6”öŒVû/„µã…f”‡ö¾šÂ>ÇãŽwlÏí«ÅÛwßýünñî»Ú˜¯ ¯í¾ˆÍ*PtÉ ©Ï*1­$‹AÑ]2« ÑV¦S[ TÝ–JlŒëÞß~¾YÞ˜[G-«Àb»gm2Œm¼@´UéáÛ  Ž n¼ˆº탽­é²z¹\|Z^…ÕFÏÅå„íŽØsÇ–Y¶ÃsgÓ«ýŸ»¿Q;ÄÊv3^a¼x¡ãá'k¯†ÁŒÛ1Ž»A㺫~ˆ-Ð[µÓ‡XJÞ“ #È/ Kwš¹¥•Î@p È ˆ¦Vë  Dœ Qh·•á|2?.Ýd|ªg1žüiÞ„]'ŸGŸƒÏÅ#‰ $FÆ`>f™gžD ̵ŸàºËËÕâú>µÏ„ÐP\tÔ9q¬_¯wC#^hÔwص'ßþýO¯ß½úë»Å›äâÛ‚˜´–tš @ žè ò‡ÈŸƒ³:nGNþjx6HròáÈg}£ãd}4't2ƒÀhg¼ãƒ jl«½´Ê[»›CÏÛS£÷­þâ«Z€€ªB•Š§óåÎkNžÌ"µŒD',nl¤»Ow}ñ+›²žÂ–^ó!~x¡¥^[šÍïöÙtº{éŸ/®?w/‚ï †¢ˆ‹žã%„â…¦wOæ…®kA+_9Â%ñ—´zå¿™«Ë4‚Š—~{99½Ï)™>ž«âYã¹Æ3GÐ<ô®÷ÐB¼§G@^è€WõþçÕßHsâHhõžÒ+ñ·Ÿ7BÍõ^ÎÓŽ8ßíDŽ%`(í©‰ÀÕ@d­¥õVFn†iÆV¯æ’ÿ®~ˆ«*òCçSlÌ‹±vøˆ{+P=•¡<ÂäpÙÊ#,ÇXœb`pü-üò“¹¸l ~†ø™y-¯ï{,LFePÁŠE>¡ 1š&›Ê-pËÉ>+¹(¼Ü:ì©œi„µáª'JG ^€Jð×·îµ½:„Cá….l÷t’ó¾•cŒYK¤#€:xf˜3c1j¯×ÀÑfßj8ZYÞÉOÖ†Fà xÌÖBÝÌp]ù‘a‡@ƒÖ9oyô:h*¼ îzzÂu2¹'€nÍ-¨†÷´SãPÂKíÔN‘Z!Ì /1'‡sËÕÆñ»Wyõº#½D°Ž57ëžÄà«q‚\ðr›¡ËÖf~‚ø‰s̺=óØžÊiF` >ôœÔ!`/€ ‡­vŠåg³}1Ét‹±G×ÞñââË/«c]pàÀ[_Á¸_6˪qU!&±€E,Ö²† „Í‚0”Li^ÐQÉH%]`&P­#ñ™8a/0ÉL}G¬‚`¼€U´bó4žç"t/Ò[®wë¾ÓK©Ä\ ‹ªƒˆÊû#f»EŒ?£fËçÖrWÇÇíêqkAÆc7B œë„vb\kqãÔ!Îa(ñxwb›†Û /p•‰‚PpÝcv‚8ˆ“øˆà âp ôï_-^ýõÝ«×oüéõ-ž½ûiñî__-^½þ—ñ@ýyÛØËZ€N3'ˆ¹Ó€3GP®‚ÍÉgÝ~žÂ¢p™Â#ó!ù׸0—{þ2ýÛ§eDsûñæýúNmÓ€¸ÐœGéêZ'ƒìBìÒò~¹èß÷#X‡vF t‹Èé|m  ÀŒôÔMœÓ µBD¦÷×Æ|œß˜ï ŽYÿªZçÕ ",Øci*Æ躹ˆÎE œ‹€Êúë_žRnJ¤JFìw¤*Ž¿H‰ÿ%|Z&s:É '™Â×>l~1ã×û¯qüˆ{Ø£mÿ”?Mû{!utlÚÃÐc+Êõ+â4\<ŸF6jþ"NëTò×Æg… 2 ¡Ï]×¾9d9ðžå€(ûEÖçdLWs9´u47Yô`_|; K—ëLûˆ$'¿lS±Qp"ãZjäx:vOUtÎ)’r˜àS %½õN8n¾øö×p5oCßýTs¼aDÆ.œ¯©Ã<özHU ăȈ‡³µ Xt ‰=².-ç¬3Ý1|$ÊÉ3–¨í™}$ÈÉ°Ž–჈Q L0!­VËŒ2)%dÂëõ\o¾®ÅƒÄ8ÑqÆ’¢=ÃG|aFj4­ý”†ÉÆXËœ—‚…ôía‰ÄŽÊ„Ûë«í϶}øˆó̺Àœ§0Zïð:Dôtˆ‰!2ã ™'ÂRÙ•y"0…èéš" BÈžÌó¨f»"7ÆC2^†iÎ"”õVʼn÷˜–£ì l~ï‡ãw]^øõ‹¬Á¥s`c2:ÉѲdù½ŒDi˜ÓŒOšž9L›·HúÂäê°‘¬‹L²Þ>žêú/‘¬‹L²^yYd…gêðÃßîýÛE DÃ- Ú´|§^ÿÔ¢ ˆž\ôäwŒþ£wUˆ&]4õA˜Å1Ä1cUƒŽœMŽN@ÐC”X:»+Ž™?ý³vЩ$+ ãqÚG '5¤rU./l$šëô;^JG1Ìz# yN«, [i°ñ¾3•±XŸwœ5mHDr-3Éum’üb>oJ#%"Ï–yö|§oÿd’7{¶¹ùóÉéþºÒ‘JDÄ-÷«á×]ô¸ç”™2ûÅÖ3ÕoJDE-I'•ˆ‚ZöÔw—ˆTZöÔw—Ge›5 ˘>fç½!*e¥SjOSÌç Z˜id£ö³Ú¼Œ'¶ïo Œ’\Á`9 ž>ò” y5¤€_qÐTn}î[*Ïl%(²h}¹êÝ ¹ÃË«é I‘eC»–Íñ,ýùîJv<œJžYÀÕ4~ùeåómƒ0Þ!—Ä?^8i$ ³F•ö i ó•‡<«×Rûtˆãa=êx‰Ôå—¬C/Q¶dêxyT`Xa»W^8 œJl ÑY5¡DJ‚Øidð@êøtg©KOÊ,ˆh¥`ÞÕ‚Fb¶®¹)9zf#Ž( eV'¼}<Ó³Ì-.ÓßšôÏ¿^,o¯›Ns%"w”Yqñ*ÝcO‰heV]¼ò²ˆ¿ÉŠ‡ŸÕß %¿e¡ä÷øf³¤ûñ K¤b¸,T eòhw¢³ÍÓœMÓVû0ˆ»+ÿ]J¤^¹,Ô+ß)Ÿ8¿ºMùÄG?J”H©tY(•>?Ǻt^Å5Ÿ©i”2aslÒRt`Ýà=ûô6Þæ±Õ$RÔ]ŠºÏ3µU» ›©ù,ÅI*¨‡È51bˆ‘Ë "HÁêåîYJßDé\lä>cÀ&Ù^íÍŒ&MbþñG¶Ô-©›R)i=¹ÖÞ顪‹¬‹ßWô† Ñ5L{J ZÒL&Ë´u³I´Û|~x=*kdÇÁʺ@“ùŸýØRø}‘¸E`ÔÕx.ëêƒáuN4@.‰[ p1#\£Ç‡0ÿ"q×@vó €óEâbjÜUÄ…‡ý µHÜPíïTr> ø3Ä;º.€Ñt_À™ýD€&‰KvJ¼JC‘œi‚@âv€ƒp½÷À¾à™}ÿ±ë pd%Íù¿‰æü¯¡¦¼Å àÔ1Ú% ð€Ù³øØBeïa±BþNÕ)†óB”Ô)6ðB”Ô)Oâ\uJF›®åµî:)¼c‚;á½gT[F”‹äA2™¨Sb \˜¦°G ñ5ÖpËIÚ… #ìYÈMM½_ñy1÷¥¥IRtvMÑù €Ù²hr¨1ýb+s7ÏdW˜ëO©ûÿT7Ïtü>þÕЂ£¢*C$ö s€ˆ# (Þ%aK´îR¨ÚÀ‹Bý+ø:$Ùâ¬]ehôš ™"ÍÜóâÝ3ˆ.[[™ž+³ò!\÷ýŸÃÇOzl!÷\&SÀí¬O¬]ô2Bi´‰ §TS¨’p à4E¢ë3Î*Ö+ûð”ay•Û·¶‘YŽ†WãM.ÉöÕ&2ˆv1ÂL²ÝõÅm2‰ÆÕH`«b [Å D]9N4ULXºÎ7ÚÔ­•L·L1«)“¾qJ++&G»ìoyY9†—w€69+ ¾³Ln+Ô¥,ÀÜŠD_ðË[Ð\$€c-ˆJ%-¾Ðâ[@-¾ ,n¬fk¯ÚØšE«caíJ¯²òŽ+ªôpø6T³K .÷@)Ç沫ðfDºD+ó,³Û;þ»á¡NˆPt ‰ä8Ó@qY„: 4—‰¦àçÞx>©Û‰ZµœÔ”ó3LKjÝ™2¼0ÓóÉÓË<̱¼ÜƒO¬áIÎ/“Ô3 oïZ¦‹žàþ2÷¿¸áIó/Û±†w:âɺ âIå/½ÒÏ5¼ñ¬[Å£ç*jêâåH´eñÖQæ¤ y¦¥tzÖ]bxy'Ý9v—y†Ž7»ÓñN&zÌg™ÝVªÅ¥¶v`_ÈY£ú«˜Ýéx'g]íÑf4¶—¤$Þäe¢‘ü?P¢™ šÈ*ªdâ1ÐftÊ—äÌh·»ÉçBftá—³.ü×0;  ¿$ÅÑhÅ/KZñK ¿$óhÏ1*üÒ¿ô¡²èRrF— "Ó*§†y‘€@Ên.‘µJΩU¨aŽ”œq¤Pžøf{œÒýôÓéó¼aä % cÉëÒ> VIZW¯Jóªgƒ TÉ"J•(U²„R%J•,¡TÉ“àPZ·B5&l«%w„µ$Œ¨´©;§˜n#&9H»É_ ªpæ-Aðƒ >•:âK6…ç¡ÔâxòvíÝÝc{·+sa'XEÓ&÷¸Ah6í<ˆ7sfÕQßp>J„,9#d¸ûï÷ýýOýmÛó¸¬ÿ$@Ç’ :.¸}ÞÏ^$D¾,ú„­øuóÑpf|µwš´`OŸþ˜‡ûÃ@“ƒ×!ÜïçÂýôrV€l Á<ë¿^Ç‹/Óòjfå«ù´`ÓD€.'“t¹î)±înž×ίV ¿ýêÉ?þ)(é»êw÷~µ¾­þüά«O?ª¢èñÿ¿ {á—/ÕóKø˧}úÑÿ<–\t'ªœä­V$À*“ V•oÏy3=9¤­‹a—„è¶mï áÜG8¬ÓŒ A³r‚H¥OW#¾EªÈ;4.ø+V¾þïÿøüî÷_}ùõçÿõ5V ]IФp²|óågŸÿá‹/?ÿ +©$HH× -Éi)S¬_ˆK2I\ºô 6ɦd °˜d‚ÅtÔ—ý›ß/·w–]µÛ]ä¹5€ð$„' ðj™Œé)ò’à]UGöm™ô–¬×‚C/¦$éš.^jÂZ)Ö¦…ŽM˜m$ÀˆœQ4b2A;¾öjÈOâC’áutš\öý¨ h!¼üì*Ž†ÿõWŸ}UÝn¯%>âªM&˜éÊ—,¹qC„,9#d]UÒÙ†”‰Z­:«:QwºvÂ2-•¬×STɹYS.©A ‰#»·Ó_iÃÁÆh€¹&g̵kÄh€¹&Kn'‘qMŠy°x¼G P㤘ºndq\NY” àg¾XXv ,ý1RW'/¶ £Êÿ Üì"eAßuy’é…8H0œ³ØXÚ±š3×µ-÷ o…0Tš-çQFºØµ8ÁÉ2g—ž`’š±ŽQák&L'¹ßoÇ=ù] OagÜÞûþ»÷‹öCœ(\69»C9,°$fl¶³ê…pzå!# À?“ þÙ¥ã À)“3NÙÅ·EͲZuI€©&Lµ‹k´³ÛÐÚìc•øš÷9þ&Oå@„ÎbÛ•…=€°&g„5ä°@8ŸñÊÀM¹q½nù`ØW"üŒfv\&Zq³°ÿ‘r$5©g!¡HWÏÖ¬C>ö€X¹€˜2㹡BùÓÊÛÅó®íù•,v;a?•vš†Ñ¬"JæjO}ÛxÑjëŽ;½åTd\ÝÙ0¸sÊH'Eת†Ô®ñŒ8ê¥ ŽnTDFJpÝäŒë†š’ÅÛê=V þÍØkÈaØ3ã£íÞ]uaµÄ-[¤Ãøš¹p€2'”¹ÝBJ>ùZ†„U-Ÿ43äÀ@„JÐÁÙÆð–XWQknÚÎ6ŠXâ¯hø!žÔÜÖV¶¼/ÞÆË"îïÜâáyHíФt Îd‚t¶9§ñ«Õr…Qÿ1 WEáªÅãþ:z0áñJNŽÀgSuêðé ©øo*ÁÃÀâR ràÓZ%ØV›,ªÄèi+:ÕGÊ-éX'w^²¶6 ˜‡Íßfl¼Á+€¨¥D-¬7ݾg¦+UÁKÍnvAûŠ@¯ÅO(€t¦¤³ó<ÅvBÎñ§ÃƒJ²²®à'N•äZa=Åiï­ª=“Î[bN /ˆrÞóF1Þ8ڵ̸ŽéZ;źÜ´XZŠÌ½8R-UK¥¨Z¸Ïœ`è¢EåV¾ZK”.tØ\Ä2Ûû Êñ…ü É[¢@I°¹2ä=Eº&Û)!ZrNCÖ¤YclØDæZÙÌŠ7­Þ‘®ï†~ÙcámÁ`TÖJuκN[›‚(¦yë)wBõúxˆòíâ»oßL¾C6À2S3–Ùî+'‘øójö£-Jâšš×0ó^–@d7•¸,+‰øg*Á?ëGÇv›>n‰u–!$55»ÿëâ†Èœkt¼j߆ë!Ñîq:øK¿3Ä¿ûÕò"@ÍS3jÞÏgˆ‰OÑy†p5CÂ6M…íCâ"MÇEìè@£©8†pì´´Y¹¢€¦…·.(xU–hX¾_XÎ-‡Xï©Ã]t­µŒ›F*Î5e–ÙþnõÌíÜ6+k]®àfY”Y1Àá°+sÕI.l „ ¬¨b\`°8U ‹Sd! <®U±vïˆóªu´õ–;J,ëLËcãò^²HAº„ÇZa”it«º&ìÈhlýÕÅöÏÒéÆ·jJò½_ßÍ ÍWÆî(€Ì¤JÈL 3©™égÚÿ&³z 0¤T‚!ÓçÛ—ïéÇãr nmK]o«ððËC<}¨÷øEy @OR zҥ󀕤f¬$¤WHFjF2BnpŸ0‹TÖuH‡ŠýÿËÅP JÍXPȵ›Ô„Ø„H&Ì&ä € nJ\ðIÐ8"nÉBÌìjF‰ôR2_·!dvMíl盶DN¿..#p2ê­²áãQZ ÖÉF’F¤Ru{aoÓfίîúqFΓ×ìC¤vÍ7¿<þF ¾šaðKV«=Ɇ~j¹¢­¿˜û·Io³÷¿m?»²€à7ƒà_ö+Àoªqöî6Q+ÐJ û €î« èþ~/‹qi´ß¿Œ€°'[M¸c¦•”SZ{Ç.|KB’,¹¶Þ+cͺ©çz«ë_åzD¾Ý³3ä\|UÂWP_AÉyñqkˆ¸ '…nOÊ0 Újïußµ”4mëZÝñCK¿_.ÿ÷åiŸ_­yâ¨{è†ê3±è!jÖñ©PÂ;k¹±œÈ°ûÅo¿ùÏ/âØèÉâº,¼]z˜œ\ …2™ªHN=]X7'•¤ã—–,è’7žö÷á8ï…¤ž W›†l7“ÛWÙ¸ÿ_nÿLØ6~ü“iI,ì0âæÎÕÂxÉy–„ 9Ÿ‹ªY›~ä~ÈíðØÙR™*ŠBq gPa á…÷FÆ;[µn‰iec:fÛÖÈöРžWÞìù³é„•x! ØËäÙ)ü^^7­‚%·<äk!cÓMãLm‚E‡¥BÜá{{élWÍZo@º!ç{md2\š¦f—¦aÇr‡É5gØQ(/ n¿TsK•ÜB¦NB3[Cò¶e‚³špî4aª®­ cÖê^2úËÜz8ÍEð!Ô'¼ö]gt#´kh]Ë&5;³>¡}Yûs v8’´¤:‰ =ò…*q¾©vöX1OgG:1½€˜}m½ÄKy:—ÐÉ[Ζ²?N¬”§3 ¼jàl){ÌeŽ”§#»N@\Ï•Ò¬VæÇ»…Ãæj½êè%Èz¾ÀªêV5O¾Ñ<ªRùNL=¦æÉ7F±|§¯ž!VóäM¢X¾Ó!\ÏP¯ò Æ°± 2ù`«.¹~@˜V=ôb‘ï%S5„Õ) ,ܵNZцoP)kµ [‹ŽGyCš°lü„»˜H~æ¦uÜêd‡ÿã_ýö"á±ÒÁ$®ÅK“›% W½b…ÉMª>AÅ “ó„©>Š0…C;ÖÉžÐD ¸ë”òÄæbhÖÔZ¥¬è+8®–qæ)32n;Œ]v¦³¸J¯& @;õQh'ff» ªAqÒäº í©¢=1Âäº /©Oà%aarÝ€ˆÔ'‘€0¹îDê ò(ø›'ì'«“:˜|“Ú`<˜nð6µA«ðç ¤å›Ô¾bkg:Ub‚– ðí Œæ›ÔnbjgCUbï–  |ç›ÔbjgLUbÇ• ‡ê8ôMjçÐK5üàíæ'e¦ =õ íù*úÌiLªÙԋ㪸À“ê ž;*àYY‚DQ]‚ÕçÂ9 e„Æþ œµMmjÆ…®©©VÒ»¶¯ ë,8gfm¸Ñœv”HVš¡ªë¨§ ;>¡¼óŠïw—«s¿ø»¿;ìqeH§ šOã,ªÌ\ÂÞ{ôºHÙÃÎ;°˜æˆÐÒ§HHN=Cr‚`¹dŸ¢þlÌy‡• ļҢÔ¥ž¡.q–Ã2ÌÍr­žd¹  `Cu¢ýÑ”oèILb¯+ñ^‹`Û óòBBªÒWÕ4HhNèi.÷•¶ ÒT7©‘~í†Bùï ä‰Öûñ+í܇L0ñSä–€¶êDÏ}øëêZ¿&å›7Íüu²™?2]úßëDÿûWF"Ó@}h¢U&›’R"Ð_ç4ÆÿrH+ób Ðõ^‹×[€û:«Ãþ¥b д^'›ÖÿƒÆ ¾N6ïÆÜ÷$LoT˜àfï»O¬Þó/‹µT3Ñ2‹ ífØ_Ù[&2ôÜÈ­žáˆêùÜèw\DZ0]Í~çf²|‡¿–«6hãPµDÆC›aà Üø íÖƒ L{e(i mˆÒZœ¸•aw@”ÑíŽ!+ê%Žð¼á:„/áÍó›|ø»7‘šX½ÏPïž‚L‹zÞÇ]mÎ5§Oî‚nìc{LÙ¦OŽ?ŸNÝuDÝœËM;×êÂTN¬ŽFŒj¯ª°.h¤b—gÛe¡"ɯ!¼¦N‘–Ò–I\”“ŠIo{ø´,F’"<Ö!IÑÿåÅÜŸ^Qu‰_º™P~w ò¶:ú3Z®û ¯©Ç‹'áãÐÑéÅ£o¬þÅ IU#Æk¸å$ö°Éª1,Œjj‹Ðÿî‚"p¬ñ +Cõ»çovç`ÕóVÑÃ?ÏЭ˜éVDzV³í­ˆT,¬ZÉÆÛa2š$yü¸F0kd–{ÔñBÝyw«tÁï?Â/‘óîRB.–Éo,›xtzÁ•"c(ß®Éx†vv¥ˆÌ?\où®`EØ(µ12¤Ê”íDWK/ µšò~Ó„ŸCx¬QáyÍøü5§«‘õ8]ÌHƒm!§‹óítíÙ]Á„™†©FQÝ8Fˆïº ïÚÒ¦5!´)Ó`ââ8aðX£ÊÝËÃS΄ÅçoþðÅ?¯Þt‹{è“/T\ ‘ï±u]”dl‚ˆâØ%Îçñ÷÷k6··{ý÷O§·ãƒ¥Û÷™]‘Há+;±<™á•Æ5 ÷´Ä¯Ésûc"7³ß½fÎÙ7-Ý.ϱ·(JÃÍYI£W2·!Ò™ !b=¡\«þ4PÃÍY¡±”DR·“ߺ™`2wg=gèwVúmä>„ Oì3ÄxJr ¥Xð€¶ ÎЉ†z!”oZV`«0Ëx<¥€ÇÚR¼<Úí=뛪®Ti‰S‰fïT"§Â1øLø"¼Ï„ÇšøLðX'd /v}P0 Î9ÚIøO2ñŸ$ÇÖݲƄ)ˆK¯;):¢¤°žO´îj—cÝðX“A‡;;N 0 ôû õЮmS†/¸¤àÍÄð&ÃôÖ^ [ûá8¸»ÞÉÀcíœÌ~ϼÓSšº‹ú¶çwJ‚¡nl'j3Êë°%dÊXRë°a Ë<¶$Û <ÖájÏ©ZþÒ<õëýïSÄžY…àäÐ*Â7 ô/ ±ÌtÖ*D×0í)!$üi ªr8èëP%ö~{P©{êø0iˆˆç1êÎ9áþ% ®¢”߸„:럾9ð曵l—Ïëþ‰uõWsÿr¤†² [ËþDZÓú'¤*/´éY5å›X!¤¼ä°C .YðaLÔÿ±w­ÏmI>ŸýW`µU[ÙT$Í3ZÛUwq²—«ì£²NÝÞ'×<%f)QKR~Ü_=1Hʘho®.JÅ¢LhÌtÿú9¤-%ÚÕR€mÄhÛp!Ûš™¦ÕW‡eÀìM,X1Cý‰œ‚ñ;§ .pXl· º]&³MfºðÈ}4ǹYKbÚY„PÉH/Cq€*1¾.qnNÓ+âL)8ÔÜG|O'ÍZFQi\KÆÅôF°ùÆÅ4­‡Ìx‹ÙI·Ìðòxϸ˜£½¥å4"dLpY»¦aº±XáYt©”hïiZcE[ü úL~ƒ}…ÍK6éòš@´sá 4ð¯t€™¯•&0ßêHŸR[§i8su5ê²úqñÚÀWƒAs™yèÛV#ìæJ•ø`ºe?½±Dþ²Ÿ¦u°ìK|‰{—ŸpÙÓ½e_`$ÑÎÎœî>ÉÈ'÷ŸôhûrĉÙß»¯Œ(G€ÆdÖ[å4(óØPÎQ‡5"4pÍ8pÍãàsÂ2}kåIZ½Y¿Ôw×úzBʶq¹ª¿ødÖ<ŠÍ}wÖ¼*a\x™ª™, ¼LÑ:Xð{Õ˜“+~týé–ËÛµÕÿªÚ?“—ððXnnG8býž„çtõ|á9«{`ŒØš_-›í×ÕøàîÓ)'9’½à¤%i’½YeÇ!áŸô3àá…eË9¨˜"³j’ÖØZä:íú¨Ã;}n=ÞKÿÖ/Oib5%C«¨ª$±~zG—|ÖÏܦˆñÝL²z0×?¹e‹ë½\ω–׈3N ’I­¢;0Ÿ(FZ‰ÐôÜÍ÷/MÒ'd4— SœÉÑ ü\÷Éh´ÄîMV1"H0œ ³8ÐP;ï|M h¯L–“³œ¬²iZ{VY»McQÝY7ätYLýdE©ßû@HYkÇN Pת&XIL¨§('ã,¹¦ií™ý³æì#Ãgî1÷Â׃ڟû¦2ò å2‡"÷<¤Ÿ¤:5j¥µÁþìV¢AïQ<Ød%ujӴƵ$loÔÁ+8R·vÒpXÊFb·‰a)˜!ç7#Ì—áOÞØ0WŽÞ|Ez$Jô%iÏÈ"«‘’p~pÖe]M)“T1÷!ƒsœñÉjœ¦5¶o³ño¶1öö¤~!¶ç*àÙᘮm]—§:Ã~¢XÙPç”—ÑAÔ6í1Ï a­s¼xÉ~š¦54tnôæÍn¹éHæÞ /ûfw¦ýë3ù¡bC¾Šh$»T¢ÉíÚ&9_°õÛ€‰€yvûÀMzýÚ çÂòƒÔ&7¼ã[Ynx‹Ó8òÁâ4­=°8nî‘ ‡ÃNÚóâÏ©£S„8Ï•FÆÖT*©U„Öž;Pq6'„žðÉ4­_ tÆc éñ!FyBvÎ!,6Ô@‘x`¯1(/B@q)‡EPQË‚¡¦†c¸TÂëiZ#Ž”øOƃòà œ'l½ÏÆ°€$ ÇlHÃ,ôØ1'Eˆ€‚ãȱ¢ðÊ4­¡²ÊË×ìûc³R5Oê&Œ]LnB^ Qê¸2A„` öAhËn…õѵ$-A9ºN€{’VdËÃv±lÊRŠSžT9÷å|nÖ‡õ«Ñ÷¿#†«g•º8,()礮]-‚‘#Ç=ÅŽøÚæŒ>m{’Ö;ðrpéé tìV1Š³””`u—+o­Ô` +«eðÌ5"\'LíLV5|'q§i ²¢2×þ¸Ïpì`í?Áž;©„«>½ /p4ñì*xÞUÁ÷/p†º“š[m”¬…rTbø‚9B) Nk‘ÚIêršÖ'H¡;ë‘Ñ3])] ~¤t·½‰ Ûö˜vîMÐÿð±=ÍI.±-ÓÈáRÒ™ià47Š:KYí1®ÁS"¡x ¬¨n{šVr‹4Ý#À ¼½‡û7KŸ÷òF•f‘ø¤=)jÕ÷¤¨ VcohÀšé±çÜXë `+̦‚æÄ’{|3Ik£¼ÉJw|ãÄñŸç Q -‰á'Ýâ@ŠX§’¬Ö”5u<±Ñ¡¡:æ0æàœ¤[¦i õCÌ-ÎÏ> ¸MºÃÛd÷÷)u ‹ÙQ½®a%ÉQ}¥Ÿ‹ñ²ÚK°‹ý¢Ltû!F½@Üñ%ÐWúMÒê³urÓËƳûYfÇÊpð  gNbéôÆuù‘¡§o‚W<Ù´Uû;juÇܺCƒ½¤ºCƒœšCi䆕êØrgV‚sZå@TK§À%†ò`'ÎP ó: ¬7šZMÒê5dfO«+ÇÃ>iíô›å›™Þ6l>yOÙ°yd<ê¡ù¥-CO›ätìi“¼@k¤þ•5àÉ„ÒµT¤ñ†:‚Ž "r0Qê_9M«ÇîYôý€/OF=ð¹ãXqßµ}ÄEÕö°a†3D©b1ÑU9c`‚[‰´À™¬êñNØLÓJܸºšêìrhFw#æ²o¿H­íÓ²¯¬ Éî.x|W¬§ÕUI1‘{)&s²žb¬Œì4fÌǯrŠ2!° 6'˜›¤ä4­±3zN‡ÁÇF\Lú÷÷Þn½{wRÛ;4N,><¹¸{üÜ`[ÏŠLXOc‘ f`DŽk/ƒX%ƒ•A  t§jYƒY’S“0â4­1Ž›×=ò±áS ñÔ¯äHy±¢{åŪÄöIbF5T é‰ `¼P˜Æ¢–A«r@NâIZ-<ÓÛìm~•ˆÞÝ€¹L<žžn¨Pb1•Ý²Û·ñVÛõj^E Æ å"”kbkÄ@£'¥! Õ|NxrÁLÓšœ%q½Ñ˜ŸËAþùI‚z‡¾—&×±÷½e:fgƈ.3f ñf„²,!ñmîãæÒx!Ú O¨‚µ”£îR(kšV I5~±ÉÔ½Q«2z­»°DOÖÂQßìÂZ¸DÕìðd>Z`Á'¡¡c¨PÝœî¤>pì$%–ÖÁˆ’y‡ˆa$p«]QëiZ}<©<ìŽßû”8V}ã4\¢íX6NfNND3¼¶ˆÚÀ3îEbjSsI•´Š°D8¬¡œ%¼¶Ó´F²¤/ãpÌ‘tèNç~¯-Ž[)õ^[, lž¤µhá…÷ºœI¥ ÖÀ ¨5,ê…8Mk¨¾6OIºhïöøªAòŸ'Ab×Á^'’’ƃIY “Ï*Œv”Zï°AØk8®‰ !À'e5M+iž6By¿^½]8Ÿ[)tdäh–·¡ÏöD§Ç¶‹íSbáGò3âN”]~/¨©€Ž©ÇqÓDëX,9‘Â;k™¶ ×Ìåà>œÚ LÒÍÄ««ÉÜÙ])qsÝL¦Ù¥@¡ñ.³²òu­½ô`†K$çqf©`ä0Ï)¬J~„iZ#c?Ó…=pÿ;ùH1ö„ÆR!»O^ÝõÉkVB J&Ù_Av_‘j}ç´6Ø€r5öAH¼ãµÁb©‚&Y]úÖf“´Ž•'ͬjúET3a¥Æ \Òegþ 9@î;ö$ì~,‰’ÈKÐ{ŠöÀ»¦±ç€§4Ô’ ŠM «íF²JåR´g’Ö³õÙé‡|ùÉqQãÌ°¢É*¢À^sŒBa‚WŠVÖ3“#×S¤`šÖ RP®ïÙxŠ¦0GlK2°-甬aÏÛJS#dLô‘#©Å9¤€EÛ‰LÓJFa‰/©ð±2㓸mM¤úh¯*i‡¬’.‰Åس`­­Q X:Î8Ër•$•LÓê“JÞÂLËʨMÎåÙÜ&ûî/%ŽÔnR*Vk,¹“(îó,­VRG¬W CuV0µ ˜¦5¶ºbŒž[?,·oæuǦ÷„Ôï#õbÔpÔY¯$t˜Ìhã1Ììg€mV0˨÷6p!ë5•ÌèiZ#»¸±ÍV÷ñ‰7…y°¥1íw>©a 1†uIfz Ê+N¸E4–6QBm­­a™3I¤Ê2VÒ[˜¦5äIA…ÔhÈ~k.¼Ïê÷O(:ä2WdÈe^ÒN.qÙ Ìql6,SHs¾4:}p–C5qyšÖ™áq—Qo~Ò‰Üy,.ñ»§vÅÔ9®b[g¢b‹SÖ Ï} Ø)S‹œ§Ô®xšVW]ý?~½Ê›ÃÝÕ§jWŒNÙ­¸± vÝŠ‹Œ§„:¤EZÕÀ(¤­ ƒ„a Õœh˜°ˆdUÂw3|šV:Š6`ˆCžºù±ÖzÂZâjËùa1°<;¿ÉÓÂFGŠ’öêúQ>Iίˆyˆª9¯¥dŽ¹¶L^3ŒÀ„ä4 LίiZãòÙØNÂí2Xæ;ÁFd>žKã·§LvQTŒ“]àÀ ‹+FÁ5†å£ ¨âI Ê`!½ó2Ë™”öœ¤ÕGáVë[½Œ¹ù¹…äcƒëØøOÔSƒÝÔ¬ „ª ìw)ˆ©5RF +•¡s`SÎ\OA‰iZãpøÃývµÕYûàUGG>Lï>Ç{=e<‚Fµ‹GÐ Åûব½öQ&—!ÐXƒ<0”VäVŸ¦5^÷yq·Ç$ÊhkšÕêdûÏúÕ©Ük+D‹|4©ÙV  gE\pa8µ8Aö‚Õo¼ÈŠ#§f[“´öòÝJ5ãQ¹ÎèSømœÐH‰±ZÈ–Á#£`N2­ b‚(°¨w†ÕˆeÝ’96I«‡Q™¹Çö8 ;!œ"85ÇÅh±ðLhŒ° F ­©¦uôÆ8l9E.ÆiZ½ŠÊ,‹Þ«ùWl\u žéûÂçLw ØTmÀ`Â+‚V\(Ç W›uH{³OÒJÜ›Wu8ò°Ù/±¦äH3Õ—ØÊË-ù&b¯‰IM…%Æ"ª5·$öUÐ[eíp‘|Ó´|hsünŸ×φ£dïÝx†`ÏÛýÔ~ZÄyo¥ª’=Ÿ»|ËâV1±pWc-eì2ÆTlÎe¹ÌéבzSMÓišR3¿÷d[ÿH_*¾×—jN£ª‘ÒBα¥BcŒjÊá˜g&«ºº7¦h%É6O?Áë)e'}¨ >Ï€KV‚­sÖ5ÂÎÕ k)tð äMVH6ùU'iõpé_µÛÉ°Ä`iN nL`<®¥ Q¬­àÔ+éFK_”Í8MkÈ‘‚láOïfã,~V”Æß­q#¬¦ÞŠ$G ¥pU´Aú4­´Zoõ`Gù*oÇ=!Nxdy³º_ÞìˆÊiÿøÍùyÖúºØçç/‡í PðÝv?kŽ€è]o+CÀb†Ã¶=u³îî¶=uv œtní7›½/Ÿo⣾|öÇø~AŽÃ»«þÿÿçò"uEæ¦WL\q ß´®þrïïþ=ÇæCõ»ßbþüf»½¿º¼|÷îÝ…[½ÿsæbµ¾¾\Ü9ÿ~§ÎŸ=_Ü^ïÝDµYÛg݈û»ë³J/·éÜý³È­ _È Û[†Cí#ųfå>ÄßñK^>ûâןÑOä¿[Ùæ=\6§]´§üÔˆ~㚣áï&ɶFü €3Ìa~â/öE…Nyý<Ä%YU_½Ù®î©óÿGžÿæÕ_¾yýßý¶Šo½úëOÿþÃ÷ßTgç——ÿE¿¹¼|õúUõ÷ÿxý§`-£êõZˆT///¿ýóY5” ïh#<^ÿxù>ÒÂqðîãùv0òÂm]”+;¿]Þm^!ƒ•RíèæZqð ìX]pí¹ÿçÃâ틳oZ {þúý?ëä-È|À*íà?DwðÆo_üôú»sÙH¦"?ÿéßοI¥t¾ÿö…êÇD÷â캼«õàºW­àk^3 IˆىޫѦ=k¡þ>øµ¿³"Ú«Ÿ=_.îþ±Í[m6v³9‹1›g›í‡¥ßÜx¿=«båóîãñë6v½¸ßÏü¬ßêöèN\ÿüÏ¿þpñótÈe{&o ûp·ñ¶IÙ=¸ßNdÝrÕhˆÝKÝ©‚¨²# Ù®îÏZõéVÕÝj ÄnWo}µ½Yl*¸èëj±­Q/®6 ý@©í¾ú7­.Mt"O5 ÿ8€›K_Y¿\nîµ]Ü]¿8CgÍß÷ ”v¿|V=߶wÖUó07ýâúf{Uqqÿþñ"8麓»áçKàtÁým{M•nä~½úøפnFÄ+vÊîènta³íÙKt¡.0N·[Ø?l]¼ÅËíºýÕ)Óæ);`ÒçªÈç܈'züÍßæšÁýßé·ëÕ;|–ÌÌö«ç€9ú£q™Ý 8µ\ôhp(šç}ù'½¸kŸÿ¯ÍNjÍÁbÁÀc4š¬Mxy1us@èÏéðãDº{´kXpÛ!L½ƒ¹0¢ùJou{síR}XŒzO-:tÆw÷]†ÛjÓÉø´)Úæ#@´¥ßØ­¦µ¿‡s° šxqµ ÍeM–TrVU!Nª‹êû4èjsïíÆZ½ñqDáÖ‘à­à [ä±¹‡¨:5¨Ò¨N·úú¢jÖI\ƒ½S¡ÒÛ ‘¯òÖ`[ŽÀÎ^ÊÆíï%êÌÑ{+ø¢]·­øxäÍ4« T½}¸íX¶{1éõ½‰³¤ñe̲¸r‡¯u·>ÏŽ´Ù®zUµ/_Zl´;ϯû?Z¸µm\«£Í/¯®Ò jÐQ7ö²§µön±IOŒoô»‡år8-šŠ”JÇɃη~}»¸kpS{âtSÃT৚ ñ~’–i0ޣĊdˆ ã}IÛ<ÚßGê_—Ðé!6ÿ¹œNëïè4nÔb2Há1™6é¢üvˆÓé}e„0ßãó¦îEyS@LÕ{ÄšÀÇï‡Sb2¢Óñ²‘¼n(acjíRï`â_'[!¬W· +xæwqaÄ™zõ<ⱺ+Ÿ²-°kAÝ/È}ªþ¸OüŒ|^ÿmZøÿjò«ÿïsüüêÿû<þ¿XœpSEwÀ¯~¿_ý~¿úý>‹ßï´þ°Ç½ˆ¿¿ßñ;iŸñ•Ã«ëåÊèå˜ÊÛcYθÁóœƒH½Iš¿›‹w€qpÎ/ý#®·X¿q`v ƹ2ÆoëÀ‘’ŒX&‘†tMév¾°t‡%_¡œ”Ü:Bk‰ü(­‰þ_ö®¬Ç#I¿ûWÔj0 ɶ¤¼«ÅÌX00Æj=ƾ,<[Ä°Éî")˜?™Å³Ø¤’YÅ£Ø*.õÅÊ̈/ŽŒŒŒ@–R _'¸­^¿\ýÑ‘#7 h}½ˆ¼.b‘›( þa`+"ÚøPÔ¶Öù×óˆ]øÔÏóìùó€]ÿí÷Ëpl›Xçn3×*ÆY»ù·µ‹x?tž}ª1†9K…áÍœUçjn³l×Üä[2¶Ù(t9ŽÛ1C—`3Ÿs•çúùÀdÛ¸ãÉYôD@*­¥$xöñb¾!Ag5²œH嘃ØEÀ±FÜ[L«˜s1‡#Çäøbç÷‡Ö¸¼|*²iv0lvðN¼ ã0#««P^ᜓ[ª,83Ž{œ°âPz•K=Ä¡\ªµá7H8ê9¢(ÁVH%áU‘³s¨º¼~9J®tëòüaÒ”I¿6¼ÂXn´‚ÉåT›X”Üxë ­ÊVžWšNǬôR—"µèÊu³r ؆YJ#%ÐP®'Ž«´òxO kv&ÚV°N¤Ók­‹ÖaÜÊ¥`nqE‘'qfeؾâ°ˆíK–ñžéÙEkÁ­Ó XzÁu–åˆY.1;ç˜Ö·b•Wº±K»¥Î†=ªZZ hØ3αW–bÍA¬ÿÒM 'ABz²KU;˜¬Û?ßNfãr:¯c\Ä:4¯’ÀÈ¥K+×S:µfV;D¤ .S±5ª`Ž YõúÌçA¼Br29Û%â)i½{w±¸OUÝ M3!—0m˜ yp`­Âšag˜÷[I6žjª÷ÝbBz¶+I ¦+Üï?dnçÎìaeLŽp“KÜø™Š´ûv©ñæ”»ù!æMTÕSªhN˜[ubR¬ïèB¬Ç¥{ófòÑåÛ´ÝÈEKdBB “AÿHh¥C.Þ~Š5ÐŒ£šk×L={§x”§W¾œÃúö×çôû y$=6Ó£gã1#­¶ ’úy,sñØÇ¡êvS]ÆõDwKS¦g»ÄPxKxõÉuåïm´ÿOa>m9˜ÿ¤ÊAåæ¾›ñ«==l6ØsØì‚•Àay,GXîæÖ)îïüPW×Éiå«ëLˆ¶ .h„±…*ì½sÈ ã uFˆ Óè–8¤g»-qró}6ø¦§•‹È„Tøb´±Ø Ê`¼n†:ãÄUͲ.Á7=ÛÕöìõÐM~’hpÓrDáïl›q·IÝuIœ ö\¶ÒÕÔZîm½b¡´ Np`ÇB4ÛõNW'g»‚NL»¿øEu*hPWÐqå£ê.Ü.ÕœœP¾jÎDP«<0wŠ¤¶œlQ˜&1ðªYVÉÉКžíRËê}kqsÀú}X^P¡åô¸Ù˜ÌÅI+ huŠÏL€=ÂRpÈ©!&vØ <Þªí&Ó³]Á- ×ØϼSÛÔ3™tnÃS"R86è$’J$PàœðØ{îd³´Ð“ñ4=Û• ¸ÁÔy‘ 35—ЭŒ‡ÆB#& ÔÒ‹ØÍN ì0CH€mDz1Ò³­3õvúk—›Kì6Œ5æ$"”àÍ …ÁöD Œ9p:¹HOvÅ׉Q#ß„§'qò¨œãÌZù« ¡æ¤ÎörÓN@൲Â`­qF1Î+B8°ÝR;éٮ๬€¾Dçeá™Gæ,xÆ…îEgzÜltæ"¦ :up£ô± 1ÁDÍTùB:潦g»ŽÕšrÕƒçÒ¯“œ]äq®UîÍ7¬a>=t6æsqØÊZ 3€ 3±u‘Àg†´îXÌ+=ÛUn´{î˜Ïã\+Ì¿ÞÂ|zèü(E&Û¥¢kæ¨â F¥!xõ¡ºc^Hz¶«K›•>Ñ)´_JŠò°Ð\Š`0á´•8Ÿ¼Aâ|¶ÛÈQà–çL8v¶X)‚­1ÂÆv7¬c‡ƒéÙnÈÑyŽµO%J—çñ®î멡鑳AŸ ÄVùwÜì±PB,²Â9Ï%Ax(ß-Чg»ÚÂÎô#þB¹‚YXh#D¯Ÿôàùy‚™Ønå„i-”´Ì[œÄaWïq¼fƒ¼ÒèŽå ¦g»º)5ör”ë„ea¡}½Ã Kžï„eb»U†bÊ¥\)9v– ­™‚˜IgeÇ ӳݣgï„åñ®îëNXzäüL­L ¶=§Ü>UêX„Xë¸ r‡`ê §}r¶«¨ÕàÓ­ûU™uÔj^þãúÐC’‡‹z ’¤Š·…®‹Qr¼|1Ê„v1²D1&!’šK¬²ž* ³FWÐvì¦qz¶«²áx\VÂôØ R#AÊCF® UüyY‰Ó«š<¥‡Í–§\Œ·:@4Ð`ì3„aé™…P 䘑R+‡x·ä)=Û§òTöòÔì€2 9òTV†éu0L_»D*=rþùd&Ì[… œµÀÊx\#™³^á Ô„+‚<íX}€ôlw˜¨. U/¬&s9Â{Y̦®xùømQ¾*&3ó±˜~TÓ Áï* ~,¾)Ê­êJÉÙäÇ'2…ªUúpPØ Æ€‘–A¯ˆÇ8O„#²Žeš¦g»ŠOŒmwÄöªÄ+9âxRYÃ?nmÓÒ#f‹P.¬[Ù@,$TF(C(Ñ^+D¸¶‡±”$²c"”žíªàƒéE¨¡…ÊBD /yþ/ïJ§¦nt?ņ?ƒÉ8¯±’[áé-{•œ[¾½Ê€VI T;d¹G(€ A Ú«qÂŽ]wIÏv) ㇇ñäôë.%ylkJ½£þZzàüt†L¶‚»r`怡»0ž€iç¡°@ÑÎåð$g»ÊáÑ“ç‹õ,ž5Äú¿XÿWíÉ¡óÑž‰ÀV·£¤CF1¡Ô31ÂÀ2.%£ i%þÉàww{¢ RÉù®Òwâ$£[­&îå»U'j¹›ÔÒŠËŽ¥´â² TwDÒ£çß•ÊÄO«»R– $ ³ØP8öS§rš7íCpB¬¦ç»«t¬yôn VêhMŸw*A­ÂéÉ.¡ês¼ˆ«ÚCæq,Ï‹ÂâÝ»§©Vé!óã0™¸kU˜Ûƒ=õî–á+y£ ãDw¬—Gz²KŒ²v…W…ñ<Žecü?v`<=d~=îLܵ*ßÉ 0@ LÄÞ„‘cëUž*†ÅN…ñôdW\ÆYÛÁÓØÌ"m&ÃNí?ï¦*@½xfrÈüâ™™i׸‡b€”ÃÜ*í—zνgR Ê}³ÜÖS1=ٵ½»8óHÛŒÃ'`L™ Æ\€´ÒŒ† ëƒ Iä€LôÆƲÍ.,œL3&'»ãï®_y´ÍGã»wÛŠ19`¾bÌÄG«ØYlF#¼áÈbq,‡©”1Ê€f•*N…ÅôdWggpE“a€,Ò6‚bý2}zÀü&k«³éÆAÎYAfŸÅdë,‚geÞ|T£»yâÍjå1É&þ`ß*w5ŒÞê…˜œo~‘ëLÌåötþj_SæŸM´ÿ26³XÚ©êºP5aþjM 52ãP¾> ýtXöWß»%Z/žüô¡OÇáÇEõß“ÆÓ±]ôê·ñ÷åú›ø­}ò·m{‚½h ž®šÕ²Á÷zQo׫Zsëm ÓͱìØb|õÝÃÍ_œ¯Úd„%ªi1Œö£™ ÛÉxV7Ÿ÷0.>øªWk¢àÃC?]™í7+øîíCœK5ÏÕ?»s@£ùkLúÔ ¹þ:Tº’ M$:HÒЃäDàÅ1¦%Áù0’N(»JŒls%Ô]$0€ž$ißôJArl¯üÒÀˆ[„<£…‘ÞC$‚DÈrb A”c ³È±+ƶ%¹ð%.:aUDØìq \ìÙ}?™j²‡ïȯ½–b¨¡ØÈÙ.ê­>tórÇ—oŠ[ËûˆÈí8Ýgþ|>ôwîþf#ľû¶Ø§Ï­¦zé?Ýo/nvÍþ°ÉŸÆ æÒc™ÿÝ}r4rBóÉ1œÍi±ë“)zì\þ«½4yú‰&úlg¥a¾³ÃÚ2'avzó!~í¦®œ„7Oê ÔE{ù÷_-ºM2;ºéÿ£l¸6º!k‹Õ~Øs-{ l…ÚŒ¸FóbÀÿ^0w‹¬Ü uÆÃxåmN­£]Ag1ðÿ­[>ï\㊻ñËÈðæ(¸e  ˆ—…âó0Ÿš(“ëºP€¸+æÆÚÞÜôæ¦Sæö¤X’]­áÝ,÷Þ›Þ¦w¢>ͺJ7™ 8h”ŸšÉ­L^9™}ŸÛCM\€½=«‰a;÷â&<Žcán~rÞ•ndÜ$ÃÏ€œÔÒ[_¾š'Äòo!õŒíù[vLÍú· 1±Ùù{¦—³Û÷Ê·g&Éâ ¥V;îªGÀ'g¦ãòµrº='D›¿$¾¯¾ÜC|­êÞwÇ׺ zw«w·:åcÌ.O‹¸\»g4èÝ¢óºEOB+¿(½?.Ñ|ÐÁ^ïh5âÙ\$†ƒ‹½‹´ß‹dÉw«Þy)GiÇ{èÆͪïdC ±mévbÔP•ùž’’Ô3ï°Ì!Äd a¥b QOt‡<¥Édp7ê=¥ÞSꢧt¥NG×ï=Ž'Ǧ²y&gò ÂãèÖ>Ó¤b€6Má Jj?Mèáð· ·Þf†ã‘»U¢Ta®“ì·"‰ÙÖ[ݯS7²·ãÙôa–¿h\¶­FWNoõPþÔÙpv?Ê-r÷kç/l°rH÷L´ =!§bë­£ŠMùóCl=Á#rIˆÐž–ã_oÇۆʸvô“håË×6•É·ù<™évÀ#z·Z˽óá­’FЂ8Áq qÙdÓšwk†N•½sÛçö:P¼}ü 3œÙÁ讈˜Å/ü¸,Þÿø¡wõv¹z’wj ‹àù„Ç¥=0²YÿØ—.i?ŸÆ[0؈gÔ.%6°ê`ÛKŠsŠÃÀºfF$Ø¥šY/2Ç|ð`.`V;'ÃL@lF$¨†´îùXE¦zÒÒirôñ‘ã#¯ ØÎ ŸÊœ?XRÅýÃã’G#óó™z¦@¾; ofWŒØ²ÉkK#6¿Š×›²v¦ì±ût8‹ S=*:èë²ãë¾ÄÛÆ{âæ7Å‚À/,xYÀæ7Æ6\W }lÐתxùË`úq<›Kw¯#ëÊWsk376_žcð¸égãéÀ(WBm¹§JZÕOǹDÆ*›Öð8ß”*2]Î7ˆtRè«ßß^zC×ßĸ֛;*¾}±Û뻱Ã)ÝtVŽæÜú©úzÍ*X üü¦M¥;ƒSqÿ‰'ómáÕp&È\þþpÓ³i}Ïqúâ&>Ïò~z ÊŸ¨Þ¹°§.KõÛí Á $€ZÇØ0"RN˜âBÁ‹íªg÷ëè|ûùýûkñu®žŒ¿¸Éhmú¯BÉùØÃu¿(ñ_A›&«oÃ(&Ì÷³{uŠ²½š|ŒR¯»hÆeé&q»4º‹QÀøë«ß¿(–VãM7ŒË~ òþ&[i _‚²sqúêk|s,ÕÿÔ®ý\£årø7çÙ^@ˆƒ.† <™*‘íÔ ˆÖf}U¢ƒ¾Wem„ÒÝ’º±rýèÒn¿ºÖP­['ÌS¿÷9áÞg£·ÁλǙžv£!ŠÆ^:·'Ø÷ K£I/–(Æ$DRsb‰U6¶ÌÐY#=÷¶C7‚üp,~<5lkûÃþÄ°?1ìO ‹J¥¼¬Î _}©B¸wŠÝ·ˆW/£¿k½ŸDrcvÆýö ›$;ÞÇð®÷5¸G"µÀÊxð†ŒdÎz…ƒ§D¸"ÈSÔIŸè¶í}’Þ+úB¼¢³Ð¡ì>zï°÷÷y‡ß?Äb¸/¿-ÊWÅdf>ç+ø*¸ºøºx,¾)ºrèñlÆr5ÌOËìÞ9=‚s=¯ð¸h¶»@p§û—ï®i ÆŽ1C–žYµ@Ž)µrˆwÑ]ëµÞIéŽqtRÊ*éýuå|áQ¬ÞS8§c*áñL<îæN1€´Â– Ã$^]¶­eÝS(]ŸüÞ¡ËÝWc¾À™~,—zâ‹Ý¢~þ6óZ¾N­B«êäX­gªÐªI­øPƒ¨8*#”!”h¯"\[‰pJ黣<ïLÛŽ6ýöê4ð¡û”è7Xý+Žæ)*•—w¥SS7‰úáþ>˜ƒê²Í¸|»ªÎ+õkp+i_Œõ~7ú-Y{BÒ œÃã¢þ„$âÅÍpXžïGx†‰õÈZŒ”¤TZí=âÌ`˘Eø²‡v<‹¯XynzÛwÇ»¬Í¸²6ïý4?­KÍAõņíÙå2óÁwRÿ˜éßqþâ&<ÎWºq$±Wb¡´Œ0…FPBʬc—­M¸yc)j̾ÃÕ…UæâÛ¡6¿ìèÕÊâµÓ›óQŽ¨4cuüð¸ô•™cÖ²=jW‚ƒª|>+¶IÅö¬T Á!O‰ Ç°ÃŒ)ÃœŽ!$‚»\5]êMQwNQ:MŽÞ2X"÷›¾DîîC¥ç]"7¶´ ë/‘+¹ÄÄ*¬v†y±•Ôa㩦ÁÀuè +r«·_ݱ_W£³ˆb®†ƒßݦü‚wSŸSÛƒ5±Î¢I!æ/nÂãÒ}AufÛ±¶qï^ ‡cÓìßîþôYQ2é9ó6èsÆ4C^[á°PXjj¤W¤[š=’»×îÝÑî&GÔòÙÉ Þ k¥Ò«Gß«‰ù»àOûÖ[Ñ´…ÇE7+UÖÕf¥j1ÛÌ0VæåhÐQ£°ÍÊÊ°‡ 2ÎPg4’`4»gûS¤Þ86çeoÉzKö<, »–ðxN§fŒ ­3©‡Ã÷;º?Òz÷ÇÚËrŒ¤³–R)´´Pdã<æ\P¬9°ö½³6“,“5ùÃNùáa\NÝeóÔV‚²_U6Ö…®÷¬|_Áëùq÷¤¨JDÖK[ņ?¶P“uë"|xýÖ ñ3Ã.Uù[…J°.(ù¦ø0žÌ»”,ŠOFå¼5Èêű0åÿüýo·~úëŸÿÍÞõ§+ûþÜ¿BËž·g›G‚¿i›œK my'ßíöìÞ“+Û2ñ®Á\Û4;ÜýÛßH2`RÛ„ÒØ98 ÛÒHÍG3:½ÎéÉEïŒ= KÈòâý¸÷É«ùÓõ…ùš’<À›R0 ³Ïóg†?öÆþBØë­„[A³íKbÿIkQ,pö*ÁC³/-Íõì_§?„`‚Òn®i]P!@QmÍ™fŠ HðgÛ®á*6Q-Ý"›ÝÄ wÈ+ÙºâBµ4Û”K\,„“ÈŽŠÔÇcÞ¤‹äw+¿[kÿƒYß©¹N›5 Ü_£Wd¢É¶¤i‚m:šèbÅ•¸ŠACÔ¶hsTËñ¶AŸ‡÷°ý-Q-Ç«–ãÝ…sTЈ'ÿµò6Ÿ4Þaÿ _ð?ˆàò—ÌÚ€§ —«—ÈÄBRÖqàLü Z¦·†ezÔ—N7¼·° kš.[Ä–LW7%¬;¢kj¢BÉ–ÉÖX/†Á¨ŠmR¹¡–6‘ÓÞ¼¿vŸ±÷éã/ ™o®Â÷U¡™]ñ·‘¤ÇéyÓ{—vµ`¨&_áµGÌúH|¶¾ ´ù[P }qG´è"ò†cŸ\“x<‰‹ØÁ5ùÖ†ÒÓùæÈÆÌlrb8†2€Xªï­àUeZ–AÇtQ ¦l;†+Sc’äbK¬-òªNü Xª9ã­ÂÙjû¸YS<¹íãÒ _D´óÌ7’ÛÌÒ—'·{ݽUG]0jpÚìÞ1f þ"aP~Üã'ÇÐM[Ð16d]&ŽfX–†EY3‰cn‘ÏŒ*w³jè°mx9Ù|[<+×»å½ ââo5fï=ÐÆ"‹~}s¤Ÿ•øxpO7ƒÓ6Ã}QÊmçhÇ”Êdòí™JF*,1Ù^jM—îªX²-I\[—‹²( &ƶma³ ÓÀS9EUÀ³ºSTåµaŸ¨‡v‰’(ôÀù»t‰’TEXt‰Ådzñ5wdZ RŠzZ•Uµˆäè®$iX•L°"Z®àX¶MD•nöµ-³šÁxD¨T³šÆ.+`… ÂÝDê?[¬ýÖüà ‰àŸ;[‚ï÷_ÍA.8mZñ["±4,J‹h YÍa|…¸‹šhØÐH²j›²k»¶mª­ÀKw·gwàÌ +˜}/cÝTÖ½©Y^”´ÿøØÂñ±žT¾{øDAeAš4ÛPÓEb£© ¹Ô-Ú’dÎ:Êjðó¾sÔF;e%.åáƒO…œÏ 9SA»8ãߣËñ¢±O—ããbVζ¡µs!ü3=×é’}rëE±LâW䆿Þ‹’–¡1ªUW€BÜ)rJù%Ž¨2dÑ€R4ÍÙ+ÁÅ‚a%ОU"ã,z÷Sä&b—’Ìè-cëÞú”"\†ÓFƒð(rÊıê¯Écnxt&Ãñj.‚af\0RY•J,L Ù´4[Ô%ÓuL*¤tC”\PÒ6þ+”™ð’÷Ôמzè •«0"WÛSu‡wûÎ%´.ñh@â&âÿ®¦ÌD>& ÅäÃsÕW¸ÿV©WxÄâ†&;W(½ÃbK 2VR{Ù›} Ìå|éy£ +)ÇGÛ'8wŸÌ;væÁ7^-°> ®¼$ðüš†² -:^9¹ †º"Šâ‘±¨S;âŠÄÖ‰$Ú‚J7=Ø& ¯–TV“Ïpaµ~p)òa¶ÊC­à{Ü5{]¢/=Àý’þþ¦|Û¤“‘³G¨„»¿˜]®ãwù÷âëò­¡±3y– Ò¯’©hŽl«€€ Q KV –$b骶ٹÆÈû‹\̧ÙOotaáˆ\ˆÂ3WeÆŒºZ«<1c*•ÿ ÊTTÜQ¦B¢p[śέ]ápäv>ñ3ÌI.¢áø/Ʀވå7Ä×l!Ÿ—ãåA£M×|_yñ%O˜=jÀu™ôŠçM”ž–{Ž@øø³¥KXc­s£‚A=Pá¼Ñus‚¦×|ߢP;l“H6Ö KÒ ÕÕ,Y–dÁÑtÓÔTAÔðÖb‡TAG· ¸tHÏÖ8¸âYZ¯tV*Õ5m'³ªt–•D:K+lha(–%ÁÄŠ©š‚-ˆŠ*b¸²ëêÄÜ"ÇúèÞžö%Ë{rDqȆpOϘó½#ÉwŽ!)_ŽèÛÎìêÝ®œƒëÈ‹Ñ$ÑB¥â阌zv0FGÉ>kn1dBw2{Ü¿Ø¡Ö#ž˜Ì›@nÍ£ù~Lû]<÷ŸàI•ÿǪþÔõN›ö³d~(7¥òá¼ q1æF4fY]Œÿzq»¬·¤)šßÎvõ€Þº%ƒ ¤¶h™®AlW5 ™Èš$‚ ;[´u—6ñ× m+´}¶hËøÿ.Ä¥»UzCÏ!ž}ÐEÖ$¦`›À2EŽÇºÛ(CØ> lÿWŠ² îÞmPŒáØÚ#5ý(˜!ëb±kTmE+ôG^{õhñ) Qp-ì¶ 8ŽMÁv Y¶‰‹Eœ-’Å!Á÷ÚÈ‹áJo€øípGxbSúœá©‹ØÜ.´ö²m¤3ŸˆÁÔ»,ÜÙY—ìñ-sw8ͱÐÃS•åQ•*(ê((e|åT!åžE6¹kòLgnxó@”ÛWRUDÅ\ ³1f}'«•š¨‘[#¦¤¨ªáÊŠ¥Ûªh;²«`ÀF] [³ ˜¿•J9©@ñ¹€"gø§‡Š(®0c5š -ÈêÅÄêÄY«vÇ0N›¶ª™Å`s,,ƒZ®î*²+›†#¨ŠâHŽAˆ«›ŠdI‚#âmÒå&Våš]¹fo•‰® Øÿtög·ÐÙ}æ¡û«òGIgÑ°à´Y%ýÞ¡ZDYÏ®B[m1›™&„a[—µÀÔåÛÇþÕVHzvMû,–Y© Û²™ª&J†êHDÁ,Ù¶+ÑÏê·®ð¸pmzÀõFÕOl„Ñ£ý'…ÕK&)·|t­qx1Gú÷€§Ã‹™ YKIs ïeñ}iQ…ó²ð§M¯¶“„[˹¡ xO 1}É+„δ5Ãq"j²mª’¨ º-«XtmÇr ¢l¥›n XAئ5çäÇ’Ù  Šœ¹á :t¦ÉBgšwéd»§O…Öpâ—×Ç؆¬© „Î|¬}@¾,äJßà0Ä×^®êy}Ö¿çB™É­Fã°ˆ~ýØ?>‚a£€ú!±Dì7í“JV¯d6Níw_i^"}8ùº§žÜsb‡aY_‡þ(Ú_’ ¨º&šÝK0UÖ‡$†Q2Ü» z·÷e¿ÖâƒùÝ>5#M‡öûµ$(ø u¬ŠH¼Þ¿k°Að­L~Ý=oî¶fÚI*ŸN{ßœ?Ã!bÀÇøÔÂ8»ï±ùØš={±O¦£ü×pkP6Ý Ú³Qõ0ôž=g·¾|ë{£? Æ܇D—„Ä5D fIé ´¬È½qœ¾òþ‚yj¢üñï ¯÷þ ö ¿RìAçz”XD¢Å§SôNµŽB$#¦‰$o4Q9¨}‹Úkã`\ãjš$’†›Ñ÷"€Ó/li³Gõ¯ â–‹¤è¸Î6ˇ¶) ¦Ì“˜¹ˆïGcl{£Á~M¨±ßcP~’ß/ÑÛ˜SCmQSؽ$Þà2~TmüõM[ÍœéÅäñ]Ÿ¸p‹°§’!¿Í‡ÁÐ~ÜV5ezG¢ôE£ÌÌ#°v ì™{46\ær=M´‰A þM•¶ŒÁ+¶ôjÚε–^˜ë©Ð‚æe÷¤èá/ap%Ö¦Ê&åÌ©pâ§R}/Šç¶qß;˜é³iÅ•Õ÷à{#^ÿ3< I-©rú¶.˃¶}yÐ{ÒÌ’‹d‚GÀQ´Ö™<qŒ91=êÚñ$üVnÓÛ“†äªÍs§¹,u´{/Ïêmcâ'6Èä­fÛ[Ê´·T²Á—SÂëxOi«XØÏæò§©Qº>» W/g‚ö›ÝLŸI5*\£¦»åót,kI®,Ûºè(«DÇ®"aÑÆšèº*vE+!—`f–) Bˆ¬Ø®dŒH\SwÅ4,.$£åƒù}VÊ´ n[œ@¨Í¥SR*ï–µÙ»Ï$3éµ0ÿ”¤ep„—1oôY‘<›Å2§–¯›-››Ød9©Õ‡€Z²©‘†„jùcÖ@n¹§‹böX…S¹º! yWH¥Ró6keš>êñÉ6.óR÷‚Úå!1á¬éìËœ“¾‘©”“©”É”±júÖÄÂY;hìü÷î}Yß(D»œC»œm¥t³®»³ƒ–·‚Üy”¥]É¡])Nû£·»šC»z¿vŸ ‡FvØ·Žv×rh׶¸ÝõÚõ{µ;wÖøBˆ-ãô†(5$AÖÒîFíÆ·»™C»Y€öR%N·é¾«DQ(ÒZåŠÌAQ,RäÎ:rôç™(¢ÍUÎùp–M°MÃ>ÑÙ'ºpô’8!›º|R)ÆþŸð@èü5cÔrô瀙XÌ6Øþ9€&4&—êõúEÓŸúbúE:í–„*G¨‰…@Ñß`87²Ÿ[é³_ô|S_¨BIús€M,l;+“Oÿ~¿ý9à&7 ÿæï¿ÿ¾ù›ŸÓŸeé©sãjñû=èÏ8±ÀQúÑtÓºAgðm>Gˆ}ßg¿Z<-ùìOÏ-tó;¥>óJÒŸrbãôwу‚„NJ+^N?­ãï?.T ýRdJ… “Ñßdtú 1|&SZGËé§u½aH±PIúsðW*†¿ˆsËhNÄëÀiu2ôÚÓ*P’þü• â/Ðñ‘QsÍ©cüÃéÛg|…’ôý¼ÇÐï¿£tJÒŸƒ¿R1ü¥ôtf”MéG)ZQê³xÎT $ý9ø+ÅßÔ¿EgQú3(IþJEñ÷µW§?]’ôçà¯Toàt³ÃÎéÏÎ’ôLZƒsÍï;Ó ”¤?¥Âø‹NÑ͘óý>=øØè&¸Act³Ëe½ Ý„7³3ôõÆTìp +OþJEñ÷§eó (‰üö×]ÿË<ó_sìK’g©%Û"Ë¥¢X¾¶£ýr–˱¼Œ¯C:ÿ„~n½‚€` ó‘Ç,ñ5:áíö&è¶LÃëœt;͵ПƒårQ,ßTûç`¹\Ë–w!uô®wˆ|Ï&£ˆ¼zús°\.ˆå]âx4p‹5á^çÀ#´2ÞñÄ’,o4 Õù4AÈþ“x5ús°\.ˆåÃÀñ\Ïf“u„C‚Æ$z1¸‡ÁFK‰/“¸ÕnàûÁ»I—R1gƒhÅöÏÁr¹ –SŠ‡$~}oö/K–Ë…uéu%éÏÁr¹ –‹{ ] bKé9ïÛÔ¡q8‰ØfLØã›1a‹zØ3¹; bèõõ²ôç`¹\ËŸw£S½,HÐœ¯iÇÍ2=Ô²ð†4rù}Û?å‚ø+Ýnº=Ç\ÞLÛ:³3±ÉÒW°ýJþ*Eui4c€UÞJ˜ª<ý9ø«ÇßìD.PÛ ‘؉wˆczØæ²” 6ÿ›zi{åéÏÁ_¥ þÊ{ˆÓ§OWá ÀR8ÛGÍ¢¡–)ÔÙ%éú«ÖgÄ4´?e«8*Mþ*Euihhâ/t'l ‰3Q¸ñE†)ÂFcbS˜£Q¤)ð†àFêØz¦½Òôçà¯RÜ–½ù¯äà¯Rû;=Ô;}ßÿÔì¶|?ëžþÒ9l¢wŸáb5ÏûO»è_ÿjöà2ÓV¸ÊÒ<9„ÏgÔþõ¬ÛîõÜ´J=rpX)ˆÃã³£P Õè6Oúv¯ƒýÖÑùaçäC½;Ó>:êwúp[ÿ´Îjwû±²ôçà°R‡Oߣãv·õˆh¾ëuúŸY¿ïôOh㾇Öm¢³f·ßi5»èì¼{vÚƒ×oí°Ók5;ÇíÃäP+q¸sí‹Ú¿´Oú¨÷±yt”fžwmhø滣6¯0Ía§Ûnõé+š~[µäà°R‡W€ë¡ñê¨wÖnuè—ö¯màf÷srwëô¤×þßs¸ .¢Ãæqó°ËÏ \V’~5‡Õ‚8¼ÈÜÐ[çÝö1}À[½ów½~§Þo£§§‡¬·öÚÝ_:­vï ::¥ý÷=:ïµËŽãÔV âða³ßd­ „ÓQ”oÎ{Æþ“~»Û=?ëwNO^¡§Ÿ€Ñà…4àCÖONO[•ç5‡Õ‚8 Ü~ÚýL‘r:ëÀuôécÒ»´sóô»MÊè½~·Óê§oƒšöO»ý•ø_ÍÁaµ ÏÙ´?u>´OZmJÙ)­Á§N¯ý dM§GoèðÆþÔ„úž3ö¢}ÞýZ–þV âpÇêL¡Î{Ô<ü¥Cy$¡Df¯“ˆWÖ+Z“Ž¼·¢üQspX->§¼‘q„šƒ¿jAü]ô¢«# ºw¨ƒ‘ç¼ñćáôüΩ·ÕãÕèÏÁ_µ þF3O=ô)^Z׫˜%JÒŸƒ¿jAüm'„ññ;¾‡ò“¿áÉ{Iò?&»ãhâì¹áOƒø kø5Õ"…Õ‚(|L¼h÷$ >: &ö%‰ÿŸ½«onÛfòý;Ÿ‚qçéØil_ÀÔö<}òò\îÒ´“&s½i;¾€ŽRYrõÒ$w½ï~HÊAq°ääz§™Ä¶H.Áåb»‹]¬~Š›¯O®«¯ÿ>žJ¿¬y=E`q„÷‰wô±?€ÅÑÝçwìã¨Æ8¢BFy­ã.¹X,fóƒó/ÇÓ|²*„–ÉŲúíä­@»‡/@¼áñŒg.Ã,°Áá¨ÍÐ]ÆR¹È€ÑJ <äM…„Š”nlé’Ôõ³Ådt•æóÙâä­ÞpÉš@Dá4ô8h }µO\`B4€ n_OÒ7Møva@ÄÄ8gf—;"À#v8v ʇÔú–ÐWšZâË”yž•"KUç¾,¦AÁBî³Ô'9£4ÍôÈ8¯Jﶽ³ßÄÇ÷R»T ªÝ‚ëS½5ÅêD„šAVAëjÀ„•eÄ… Q³ÝàZ{]Œ‹Õ•Þ,öðÙóOèR¹‡·ZWv i"írñ‡HžˆÄ7iÀ.ßÎE‰; 'â19òþ 7¸œÄï 5†wHqLŒH\0"0"énQè#ï¦ê²ZðÔ¬=±R €- Cð·œÌÞœ—³yÃßÃwÞ™'Ï~§Ñ½—üë믣# ‘,«§‡õôi_XÝ“±4}R9o¾ú}5[~óç/Ëê—šÒöí`„."(è$B¿…q¹~ -UàÝ?ó^¾yñË@·'ñ­ùÿõñ±×Õ`Ë_¦nïpŽfŸ˜,„Ý´gbjOV©—×Öínœ"þ°:•Çí¥—åÙòø®¤‰¨í–Ç—²G%K€rmy|x8[Ô즖=³V³(Å&¾©fïLÑ ÖZwÕaE+ããIíkè$µ§®º¥` ëYyÜB0úçαvŒ!kRZÎ~*ÆE@‚DЀrs‘ÅEHJNã°<8WÃÖ&¦– þYß=køqñÈû[W;>ôöÊ´DC…è¹ôöV$iTw÷T¹Ñ‹´TØyžVüUzu=`tôBó6ôUÉfuÝÜvQ’"3Îí"a?ª²ÚB‘ÖõHUüT \Ñ£AŽ€®h§qçÏ4F• ÏÄæbé_mùñÄ%?žùñ$6QÔe=»ž>@>‰ûâáw¶ló-ÚÙþ$î1þjS0Dº8¢¦Ç&¦»LÖz€š/ŸëzP}@âžÌ©¿š”ÆHløÇ8²€YJmãþß„¸öfÓIµ v%®fóR*Ó\xï¥ -Dagás–¹ ËÊ/‹=9¦‡òº‰˜b y_{ä蓸¯@sÞõè‘AP:w(x#ÀZŽ/J˜‹åj>m‚"ÕÛÀŽ2¾ dX†ØÀ]°ØÀ]BÑP±³‡Äh§eovÊп—âÀç•Hµ­ TêåøEÌq»GìòcUvH€Ú-’¸¤ï%YÄ¥$‹Ö `VYÀ£4*YVF1—fN‘–ÒMåÐTÐXµa æ‰ëÊfÉ„•~æ—hð©yúìù˧O°XÁ§ò‡°>‚O嵺< ÐP…†ŸÊ·tzÀ. "Ê{q¼Û¼ÀFé¶ZÁ@1tÍ °Ç@ • ]Ò((Ð`„vŒàˆxÒíú":X„°ì8‘:Ò2 $è%+C¦,©T)œ+T-¶÷X½*o"˜¤Xf"ãq–•Rù’¬¤ÊÓQ_í]9âÎ+ï(P•Bª”}—QQ  …ö¤(Öíwû6¬qÔО’îàÑ·l Èms ”kÐN¹–*`twðG hwc}Q'»)üŸ[ü¨ ÝÝô-â'Í燪#A;ƒk1pºåøFmÜÿ)ã'@.?íîÜ# hE—ìx:˜2Š@Ù€ÇAæó$ “°¤yš§gqD4c-=2Þƒ²ûŒŸÓÈÏXJ¢”Š¼H°,ŠÜƒ„‘26Iç“Ùô /)K9~¯htê±"È™K¦-2m)¿õNÝg6»«R I—ò;I“Rmi7ÕGÀY£/ŽÏ(cÈ¥Fïå>.–óbu}¨Ÿe÷ÆßçQŸL$^š¼ ;œÂ]wVÃ2°zŒþVÌq ŸÝI˜ËÀ¨2:VX±Ç) ·÷À–5m3즕KxïˆXææ@ÒuÆ­˜ã.ÜsXËÀ¤I\¢^@jtA -,@ /Mœü ãMü4æ`.9Ø`–9&ô˜Ey‡~IJ„±ÂÏ9—p'hIÓ”’ŒW#K,B­-­VZqAHæÒÖH2©™ BD,. y°Ç¿¯ÒÉ- r›ö(Öib@¶>ÎÖßêIå@Èa 1lˆ1#7?Q RH¼zFÖ?Uφ³ê·1÷°foÖµÛú?Évºyþéé3ïo9³¡p„}IðÎzöäǾ$4?‡Á“¹$¼3 á '¼o{Iª&ÿJ:Pd/Þ݃ӄWàÊzú(—r<-gˆ ®uÙÈÂKçò·Yµ-×B~ãRÁÅ€äxÖÓ`çb; ÕÌH<Ç™ ÈÔf.Ó3 ¯™Ó#aonóý3‹ù`K=)€ÌmÖ³¾Å¤X´·âÚÑÄ2»YÏÖú»ž@î43r§±À ê‚@43vÁßñÄp™XM ‡mÌГ@ cÛ|·ÉQoWÓÀ ºÜÏ™±?rz ᬛŽ# à†±£þŽ§‡eÈÌjjØÑFO /œ;ý[M‹Öîs;š@Ê9cûG  ]cŽˆt `.ƒí1¬C¥v¦”íÎ}èi »ZÔÓb§XÁ¬`ûÇ `sÄŠÀŠÀ++‚=c…U˜ÜjRXm2ˆƒU9Š]·Â‰V莦P ÃŒZ˜ÝO ä…%/ØéàDà‚@ 3 Hvüª?X§úË+@+é (‡`˲Ç`Æ5b…"Î"‘–~)¨¤q¤¡äAÊhVò2RÜ•#SiÛè´-â·üã©œ°eš |Ò<"£ÇMs“*¹«›€^ÌìåáøÌ="¯rª³¼ú.Ci7Áz–4å9§! ƒ¨d" ¢€Y¬2q‚"T5*›#°Oºa@×fv Á‘¤?ì¢|+—gý<ËÞ¼zþ°*yõüâñ÷ß¿zòüå·¯Ÿþˆ}@ [3º…lÞ^wTR‹Ï+dA3½rFÂ$.Â8„‡ee9eYœ¦òÍ…\‘ôûR$/J¬˜U=÷.PXVŽÑ¾d“EÕ¶ÉH…Qð‰4öãÔÊœKs\¹§A'BÔ"]‘Äóè6ýŽ°Ll£¡I‡Ijû¬¥~äiš ¡e4‰¥ÿêg!åIY3Iïç‘û‡Xæ”Ñ?e“E•öB²(ÎIù‰ORéÅñHN(Ï“4ñó" q\OµŠ$žG·ÉsÄ2 0øŒ²›M&©š+G§œQ’deDÂÈ'!£qAâPºÃEQÔôI<‹ÜË›° ,W£ h“AUV+’A‘Ô@qÊ#FiÁ3éü0ÁK&õGÁ)[õ暤…¹ç¡cYØáF­Ñ&‹tÖšE X\r*¸ÆŠ4„‘Ä—Z$iö‰Ó$-0Í=SË"ÀÜségÀ)fô³Áú?ë÷ƒ`^ujªúü å2?ðÆEób.Ô‹¹@€Ä& 5$=¶ÝN5ÞÍ["÷äy½DÕƻރjï×£~rFO³ó'¢OǺŸóé(Ó>KûY.³Õ<Õ#Mê½ÛûæÖ;뛜&þEå;€|ì÷2¶sñ8AÐ}_U ¬‰Ÿ¼}Äü³Hr•ÔÀj|Zw•¼]VTá®÷àð׺âè°úÖ]&ú˜èw˜è[3Ï¢[áﳞâpw]üwïÔ ¼µ¾Ëts_ïAÕÙÖÔíJ¬NxÝNys¯›[ñ¶-ñ|¿zÝZoŠ³S…˜ 5°P¨kþÂ6ž¿·°O¶³W9ɽ—ö3éqºKÎë|çMί³“Qš«á<¦‚uÛíC^ÃrÝ Óy}n!Ó)Ó*I÷FKK‰&. »Zx‰vwÛ,5µÞÔàδ³Þ.¤£="'í :mÚÙݼrÖDîõÜd=·`ýÚz„£]xëÑ:r†´ë+Ž¿b§æ£jÎÖ6U36,ý°æ"œrÑ"î#euSî†apólW‘ì÷fÚ"içÏÄ2€ûÚ¼ÜA<„âí^Öˆg±X>ôªßó\m¼ô¼}å.¶±1ÿ5ÿÕäÄl&þZd᜼ȴ ‘m ¶ó¹â W¸C) )ô&¼Ú„×›Ö+WÃÂYkÍúü£Ús{èU:UËãn5hØÑ ¡… €vÀYã€o¼w‡ZÃ7´†x­ù×»àùÓ2øØ.¦æâÍ™;4Þ¸a¼YÌêuä ÎÀÄG¾n™ÍiÂí%³Óµ oÛ‰‡ÖÁÚv…›íámW×Æ} ›k^v¬nÚS°ºA½.+¥-t)H«_ Ã^ísw¨bCXoR?ÀJ‹Ô[äc¢äÔ¼ôîß$ áÐÆmnì)8=oOÙ¦ú¡â7Õéûqº:y'±EœöfÉL¶XòuO³¶\!Û%3TÑ[Ýo—Rl˜y¯ùPýqÿøØ+çé¥ÚbÙ;>>o}Ïä[œ.êë{ú­à¼r6“o×»V¿ëCoç͘«C#ù&Šb.‹ÎóÓ…rƒÎïýSLÅ\Nòpê}'ÿýëjâÑØ£R¼=ÂÑ£Ë;ͽï¯ÅôÇ|víe½uÉJõøo—ËëG£Ñû÷ïOŠÙ‡—bz2›_Ž”'ü¡v).;ƒðóüì ¹âzzy॓åú9ú{ºÞƒœð“HþZ Y~U=’:šÍŠê§ºÉù½/þÿóù£„ ˜åZFjJÒ*¿o—÷P¦Lê§Ôü~û§Ö¡O¾ 4 À¨]ê¾ðÕÿ Ïßå ¶}VJ/xÞYºXÎVÛŸ:þ¿ôszÿÉ÷_ÿÇO=õÖ½ÞüãÅóÇÞÁñhôïìñhôäõï§yýÝ ©P|ïõ<.´.O'£ÑÓ—^[½gZƒ½~5ú huqýëñ²uåI±,”rÓ7üp5™.ÎzÈ$Iª«õ¹Òö—?®ÄRêOyî±ø}5þãìàq¥æ_«} ¥/áG|XV£¬³…Xž½yýì˜kõhùéøÍ·ÇgW×érœMÚtž?=Kn®©/+í?›·Î{RißJëê –ãåDœ7úÿQ.^JÐÐXõãr¾Ê—Þ+QŠ¹˜*/³:ÿÞ©´Å«b™fþ‹o.&ªøøãD,Þ ±<ðÔ6ŒõSªÔ ù||½ly—þ‘VßÖ¨ñî÷•˜ªì1-<Åç «G¸1c$7$XŸÓÿ4ýc>{OÖÖ”Ìê½SiúÜ|;/–õyh2¾1jÛv~ÞóïÒñ´zþÒKqÚ4´P–ž¼°†ÞÕN¾<åL¶½\½H3Æ|5Ÿë~7fèTJ˜âÂÍ'é2­WMÕÕ|ˆú 5e8oŽî™ú¦÷ÒÓÑjR½Ìæ­nò›nð›Z2|·Ï¥ïØy²ZÕŸÏÕ»Fq«éÕ²…î³±˜(æµ,©=nÔ@Í©JþÖL®¿^¬®®ÒùG¥š!}y½ÊŽÓår>V"®†â5£P[>o¾« êZÛtüÃê;Hù+š=RÑí>KãÙÈ[Ý;½>?UÕLç_Ž§ùdUï«I{Ÿ 1i×9EQÛÛ:8_©Z·Ò[tŒ4¹ÓÑõæM%¬yøx6ùö®½¹mÉßßû)°™º­Øql|ÏlR«ØJ¢*ÇÎIòd¦&S^>ÀXYÔŠòä<ç›Ï~ €Ôƒ”Õ %?vÎJ$K¤6þu7»a¦µGq<¾L‚Kéî,õóûþ24““_bTÄGÊÅÄœ@ÞÄS\ .-öUÆ/ƒ1Œ“¸Öübà§á3œÊý¡e"Âñ…ðìr’à{9šßÞŒ˜ˆ·žÃᢼTòÄA•‚óËL¬$çêxÎ}õA0þ×™„åd春½äÀfÏ&‹âÌPE[¯ž‰ºà V|çË$½#8«ÙZ’uAÉ_–þ‚½–@£`fáŠ@ÊXò}ÀB'ñ’À­ˆ&fâÆ<æ®íRN­0§iö«üêpR Òà P9ÀúŒü–TÈ‹øÚ^TŠ˜Ë<ßp¹MEM¿aÅv`pšØ–¸^Î D¾Z¡¨§Ý©Ô]¦"L§ÓôòvBré;îÇé%ÀœR]«8™qÀdaLÖçe¯øé³¥A_ìè­ãf'~èÇ>s˜yÔs368ã¡ÍÐçrcÎ?ó¸áÝÏ"˜\¬ö£5vuù¹ÉØ…¸QâÔ‹Bê‹Ûý±†~`R äÇÚêØ9Ë ›&¡ûqL©á† ž¡çÄN·ƒ"‘q6vÂ.¹ÃÄyDbC8­Á«ËÐM/¦žíÄVDsàÕ‹&nèø‹(Ñç-žU°+ð j&Q–Kã$à~d™‘%ŒïDBµˆÁ“Ží ºÃaÃ{î!e AZ#W—››Œœå †ŽmzNhY¡eº‘r›,àvä59uãNxÓ{•M´¸\·ç›p9²ŒFÙNF‘iúy–å332#[îWŸË™2¸–•ÌtiïßÍÐàÁ<ЛºüÒ›Y$¡°c> `zJ»¸ø œ²[ÌÌ#ù%“#®ÂErZƒQ¹ì"AWÃa}…ÆƯû|Ù‹8Ÿ’¬ð.á]:‹±/$MÈ܃!í º #p^dTŒ®L.ÂþB³XËor™/Ò'\•€|üÆGóÀo$cµ¨/}L/#øÚ8^_ðx Å­¦Kþ-|Ý'’Ná”@Ëò:’¢ËàžÂp×Æ©¥2Gp%uéç|ÿË>yÖ£Ïä7Ä/“Á$›.бÐàÎ>‘ž˜ðóæ÷ÑH nÙß*ÐË~Þ쮚º&Ø&÷hè%î+ßP9©·Œ¼t ÈQ]]K#æ?»f0Š.„Ê›§,œ“E±É5ƳÊQÃi:‰”](ƒûK±ìßeÌ?Æ•ïÞiTò—¿/lÛ+(:˜SX ï•:§‘àÆøu+RB<ùmI‘HªUi´Û‘"AÑ, "÷6gW’ |§¤±Ïã(´it!’­Ä6ú9-7¦J k·d3¯Ü’,=­Ý+”÷rC_øô\¹ëWSžÕoÒ¨²LÝô¯Ï/±}_©¥Ñ”™ ¦×çѾ6àœQáܼºfS~e8Gª µvSÔ÷ËMUbOÞT0Šk4'÷X]ÕÜy¥ãá TÍÓc1"x›òÔˆ<>å¹QL ¬7‹ ˆz³#–õU1MÙ Ðqrß4o ŒA¤T轫ÑJ¾ëò ò§¦îy4»º,•uæÍ“z®ß¤½²ÉQx.œÛ÷Iç?é|©ó5OçoŽ*«ü…8ѦÖrÕ™$³Ö³­YÎàdûìq¨|‹Ñ•?–ëÒýT²g®ÔŸ"5âIo> ½¹uYW[6«4;—ÿ:X#ðöp¸qÀs·¬gU rC{¬ p¾‚ê’Úw[ZØîÛ¡eÍ $µ˜¹(oŽ¸¦¹+½Ò®o™ íŽD´h8ø]4XÜü¬ßæŸ\žÂ1bl·¢ÀU²äŸÑÊ×È*x|VþV#;‹i‚PoÖ)®ygQF® ÇÞÚÄàñ4z‘Gé§<¸æ×H¹x8Í/’V*Ž‚L&Ù8s•ñÉËXè^Ps‰¸‹¼§¶ÓK¯@cÒê“Öñ±P€BoϪ+á$˜\oín¹˜ ¾¹Mý½<è“™é/Þ!ÏYžð@¾ù2«ÑH&é¥ÊHa}8&ûþï">ϪoB¡J©Wéô¨~ÖªŸ½—G¥þsy-Œ­\cmý'³x]¨ÿdÿaPDzŸê?ïåñTÿy?õŸj-Ò“S‹ˆ¢°§šÏ§šÏ§šÏ;¬ùÜn-dÑãjéã©ù\M‰êã1üJ‡W_†i —[y§Žib.ôç%(Ô‹Y‡à€ü,¿œ­ çøß’;&ç!KL3rilÍÝ ±X@£À¡Ib ÛVª×u‰¢ÕJµ7¯â\µžÚ³×ïR‘‘<­x 2fŠPŒõ¾ìéB«Åb8Ë+ Uwj,ÏÝ^½S!Ë{«®(å\Õèú½H ©î³¾ôÕ(½TÄì¾x¹écww&®Z´¯ß$”åMBWÓ-gÓî.Yý(»«·|M6Qöõ{wbéÓ~ï|_¿­&!öÆ|—ÜþZÿ¨Kûúý. q1ß×oDIˆ»ßßÊ¢†ßøDdÑ€…äPãü{c+|_¿ß%!Þ#æûú-2 ñ5h¯uEº~§qB nÕ»$‚.”ê\rw›zô#@F™ýdîþÍ-L\V•ªi¡Àhš¦ÃLÂ~0ü ¿pÀÿ‰Ôzô#`FµÀìùÕ4©—öÎÏÏ÷öÎ÷äëâs¯|ü|ñXECÕ£5ªj’þù„׃ågåøì“x½Ù+u¡&ý°Q-`ÛmL¾ø÷yúp£ZàôßüñÇ7¨×Åçªã ¯çЋÏÐÕ8A?yGnoÈGx÷ žÇD¾%?ªcùóUñzHn> ê—F &ýÈQSôwÉÍð†¤9žÃ‚Ö`5ý¢Ÿ¿+u ý L¦™’þ–¤s˜Ó9…çUAëh5ý¢¯7² "T“~™þ%-£9ý™êƒ¢5^¢þ‘9ý¤Ôšô#øË4ñèx/©¹VÔIùQô½’rEòã3úÕŒï?“ÅÔ¤Á_¦‡¿‚žÎŒ²‚~²@+Yx–_—:P“~™.þÞ~…N]ú—:P“~™.þÞvsú;P“~™.þÞÀËÍ®|]|î®8¾tì@IÍçÝ¢5éGð—iã/9%7c%÷#xöà‘›ô†ŒÉÍK¥ëð ÉÍä†òæúA¡vÕ§Á_¦‹¿ûÎô'Qý]þtÛß:¿YóiŽ}ùáÙÑš¼@°œébùÖõè7,75±ü0_ËÅEÈóð œ2Â1½&ƒÉ {Ù»ŠÁ·•^ç¤Ûim…~ËM],(þ#Xnjbùsó%½Ê8yÓ;"ÃAÄGß¹ú,75±¼ËãA¦òüdVȈèÌ`DÔM "…ƒ‘ˆ ‹ø@¶'!!éDþM¯¦ÍèG°ÜÔÄòË4$ƒHÞ„Ø#Á„“1Ÿ\¦â^âx’þ6ˆáÍô"˜–’”¢tÔâ'ÍèG°ÜÔÄrAñ%Ÿ~¿±ø×¥ÁrSÛ—ÞÖ£&ý–›šXN÷KS “5—JöÅ¢£äò*·ýÅÚ=R†‚P$D3½;J§0ë÷êÒ`¹©‹åDÝw+ªEäZLÜe¡‡~BƒK>Ùߘÿþššø˪ü>/蛂ÿ0™ã«ˆ¯‚ô[þZº¾4™ @“q(ªÎêÓ௥¿Ë7rÚ±f® ñ^"g>fs]*•¿¼ÿ»0hûõéGð×ÒÄ_S-z%.ê&‚+€¥‰\õJdì„rµ­Xįù(N'™X"Kôç2r¢ÄjšÕ¦Á_K×—þ‹›§ÒŠLÛ4™~ÈP l6æ‘€9 w €w"n¤ .ËÔÔ¤Á_K?–ý úßBð×ÒÄßþûNôNßö?µºmï?vOìµÈ›Ÿád›´ÎúïO»äŸÿlõà´ôV”ËÒ:9‚çϤýÓÇn»×#ð¥&ý@pØÒÄá·Ç ºÑmô;íÞû‡ÇgG“w{äÍYŸœœöÉqçC§_ëŸîÉÞUV—~‡-M>}K>´»‡ïˆÖ›Îq§ÿ³dðÛNÿD0÷-p·E>¶ºýÎáÙq«K>žu?žö`x`ÔŽ:½ÃãVçCû¨BpØÒÄáÎ ð—´lŸôIｨXž7m`|ëÍq[õ„æ¨ÓmöÅïšÎ‡-MY©æï‘ÞÇöaG¼iÿÔùhuÞÒ}xzÒkÿ×| N’£Ö‡Ö;—ç%)«I¿à°­‰Ãeá†i|xÖmã²Õ;{Óëwúgý6ywzz$gk¯Ýý±sØîý@ŽOÅü}KÎzíºvœà°­‰ÃG­~Kr¡¢„Üœõ:Rü;'ýv·{ö±ß9=Ù!ïO? Á€´€à#9ONO¤XÕ—Áa[‡AÚO»? & I—x|z߆ã]19@xúÝ–ô^¿Û9ì/~ zÚ?íöÉ¿à°­‰Ãs1&'íwÇwí“ö ìTôàS§×Þ]Óé‰/t³?µ ¿gR¼Ä\‡±oëÒà°­‰ÃK8¶'é¼%­£;BFrAeö:¹z•³âð}>‘÷êÁa[ÿžòƒØ6‚¿¶&þ–³èöär°*¡,ÏË`4_ Áœž³È¶þA,68hD?‚¿¶&þÎV³Íöɧܼ ¯›„%jÒ௭‰¿‡<ž€}üF•ÃHBÄž#êð~~øW/ÇÙU¼ŸLĦ"’ñ[ꂶ& §WƒìåIʇ䣬-œÊ^ÌïÕá Fà—ÙR/‹}ŸxKšô#XìÜ~×A½ `ì”ÀX¯Q!59–q±no:y¶¼›O6A¿í_¨íyêtAhB‚/ŽÛD$¥ï¬Qúk:9¯ÒÛ¥5þüùÒR—A4I³ÅÍ¥êðÑôÎM߈t×Z ]¦‹7#ÜE”»k4HѸn“z Ñ‚®ŽKr°ûb‹j¼§…ëê‡o}œ ˆ¼³­ê¶£.¢ ]=—d›z0ê"*ݵ›H%¢˜]§A£þºù3× ò—U 6²,‡y¡—X€ó¶Zµã€&±I©ø’2µ4þícö•_K'±¬g¯E]rþUÁ5j©Ø Þˆ#ÙaÀ™Ãc;6€"Ÿ“8H( Y¾ž’P\çÙ×Áø<£¯ç`zŸç²"wCÊ7x'j‡w]òÕvÈÿh²Ñ*~¹ LŸˆ`2ÕoD5øf!Bæ«oiô,¦ßľpE¿t¹ŠL5ß.]›ä v¼"É>ÍžÃî‘ÓÞñù‡ÖOç"4$âˆB vt{ÌKß©Pp{ÿ¿]È xÅ‚çÏ©}ENÎŽwÈß‚Ëñò… ²L”ù>ß•_Y:•?[V 5C¹döPìlcú?|É?ùõvv4;ŒXd¾[épÎô/tyŠØg¾WºÄÿj¶‹O¾¯-©Ë#µ4P«ã:ß-Ž¹¹!Ú¿,£“©±Þ ƒóõuE há¼6‡'|z5 ©¡å(Rp 痈Њ”ÂÂù&üZ¯;á|ƒF×Ö9i :åL€¨s‹úœ‰¥hÌ òB‰Q.)£f Tkc#©éë{~â1ÛóÛv"Ó |Ï°L76ìصýEL_êšZ È)R…EéÝÁE*¨(­ÂÝ-îÉéãˆD‘ì@ð/’ëeûuL]Š”DQÚý@ÿMUénùÀ Å Mô¢H ¥«ÐKÒ²£ _©S¢å:%½F×c¥eì†^¤ªäÉ !ÁèºÞÐ#Õ@´T ´~è‰þ¸«5U{z#EB”•¬–L¯îKmSM»3²êÒ ä©ë¡¥ºu MÔEjn(+k[ý–]ÊʺT·]D%²²JÜšBÔ%aÒeDs–ªWt¹…èÊrM‰^£ˆ®,gh5º6cSê ÓöMæZµâ0 ÁÀöB[‘2fʼn¤Ì2jXUƒÑ´†Q1ÆÂÐplîGFäÅ,`QÜ4˜ûñb D,O>P{4ŠŒÔ³¨\Rjé8 U*²_–ýú_÷êEK(’#J-ýÍÂPMx¦{}D¯Ze½ªuýyE´eѾå,M½FÅk•¯–Ùð\®G»ÂÏV…PÀ¯V_|µú‹ùa]kÉž¤VÕü2É'“t²ì¨ds=ý¯«túC:â2I  ¯‰øgO¿¥b; ¾ž‘š 9¥£—‚xõÛšÚÉ£¤åH"µ«V³ÖXgw¢âk%ôY9cÈÆK⿧&8èÜ!2Ts^#Y‰Ô^e7×™ÙpT²\Ëšÿ÷˜GS7š¶Hú!µË¡i–!iÔÖrða6³a5'+’ÔGíaŽ¥Éš§!Ô›®ˆŽ·‘GÅñ–3î ?,·zªvA²î¨]bÜcØMØ~ºò‹ „]Fˆå5×4Œè{»†¾s5ª*0/EÁT ¨ ¯¯©ø‘ü6êÔ‰˜ …¿.GÇ694ia9£É$IœUñ—ì—Á‹¿@î>/bºˆä¼Q§ªêájâZûŒÅÞëRƒès§J©…£:ºEÒì¨S Ü< „" xÔiB2éh9“N¯QDñ;eů{Mß+E’çh)yN—[ˆ¾.çµi5ŠäœÑ&9gÔÛ0g†Ûžï2ß##H|ÇCÂ/6,æÇ"@¬dv§93Ì XlEqÌb:V‚Å€¶ØQ@Ë¡ 5ÿî)ä! Ùk–(³q4ÈCT³§Y0ý©ç!:ÕÓ±Ê7 yˆ²ô¤¶QÑ”ž~Äü¡B¢Ÿ½ªaþHB¢æ½&yÑò^Ù*ÌÉ·Fƒi¢­qÊ)]B-®øå³×Ùàwž2£—/ `ã#èã—Íý»‹~­Íó¤ á™-F¿z.Gþ ¼&…È~"Œê[û #s Ù_„•öÑOd×VÞõC¯QDÕ•·âÐjtmæFdÎòlòü$6MnÒ ás)çfbrêxa()é{w™c‹  ˜ëºž•ø¦iÇ~Àl7òœ¨™}¹Ÿ¸CòÿÓ =o?.Ç BÆt’L6ŠË1$ß1º¢Mâr YΙ•—sÖkÑ'¦~1ÏÇå²Ü23«öçãŒË1dáeV^xY¯QÄ4Ë–à¿q\Ž!K'3³Qþa“¸CVAffÜ’Íâr YИ™ÕÀÃcË1d‘cf"ñ‹õÉø¢ó‹ža³²ÛFM|w[ ¹šGi–éêHÅÌjd…œ9 µŠ|²2³Ê³¦½Šd“3­lò¦ñ;†äŒ³JÎøÆï’@Î* ä5V†ä¡3«©h>z Ѷf1’]Ï*ÙõåY\;Œ„$Á³J¼îDF©IJ:CRÒY%%]²æ®b^HV:«d¥ß{XIVg•dõí‡5Ürf7 k )Þ¬¼ð¬^£ˆÂ-¯«ÕèÚ„+r~ß÷©Û¾Im3Ê<ÆièF‘mÆ c’2‘µuwa Ÿ¹A膆c®-IIX`›&ø¥QÀ­JíÙ4¸§l#†ä1GßußjTI]c®Î¼Û,ª,®Æ\ý²¼†Q d%6V^‰M¯QdŽº:y\#ª¬”ÆܪYôH£È’i¬É’i Y2¹kïäßÁÍkæ"&«Ÿ¾»ièÁE !·ê?zßE”¹[õ`å¬SÓ°Žzöõì5t^×&‹vïÔyERoY%õö±ú‹H®.«äêê¢p½õÐ É©eÞÚx䢚ê(ýÌ…ÎVo£ñÕ”\hh>𢠋ûÚ—£žCruYÃ\Ý’[\A-ái"OïìÕ$Q´+òp‰\poBVS¡½¶†±¼›&’#ٶ̫©\v´D_t%ÑŸ•ô\½f‘DX¶>v9"–eR®¥®ijC¤áTmŠôÜ]m“Û6’Îgÿ zöR5ö¼‘Ä I'önÎöîæj“¸bïÝÞÚ®)gdk$­Ä±=ùõ”D»Ižì©*YÁfèn4á°G"=ØÞöÂ1ÕÅöÇéËýGË‚×h‘‡éEÚzø(ð²£Jìtö[¤»ÛÞ @·¤t{Ø- hI‚·x#à•€×ý®® Œ%¾ãÛÅn£ñX^‰±†êÏ… ÎVÕ}uЦåp Ö½%ôÝ!d–Yl»€É ª‚K‚ÁcÉíðïùµÌ>zŸ¥§úèVÅfwÕ‚ývV—6ަ˭2°3½î•VÁ"0¶$pJt;Ç H¡h°+».o®6–7ºö³¸!G318ší7 \&¯h‘‰A‹¼÷m^°&“À…W‚´É$pà• õ1 жdƒ‰ØæÍ¢€Ê8 ‘~&YPU`)Xä'‚Õ~¢’L9·Íë‡"-d°´HÕZ4-‹I¦”EI'yw›÷vVN‹ñ®{½øz-ú^è` €‰LÔØþ¼]]_~ÖeíÕº|þQQ›kUì`Œ€E 7I/µÂø-ZÀF‰E 2–ÝWJŽ¶RõÜ©þ\}€ 0(ú%š–䲘Þ*‡a¡%À ÐʽïænI¨‹Í°–ÄkyÏ{én’àæïs/¨ObÒãš"3ƒéœ{ìÚÈ{H;FI¨ HIb %·¯!¦3µlø$çwåµÞQ!¬MJÏ.@a@- uÂ%´§+RÀdèL¯q kOñ¿MLø%1à—ØLëÐNâÊɪoká-rm“ôp7ɶí¬Û;¬èð@e’Æ_7Z>}°Ú"ÞÛ ,ïIU¡-;¶(ÆFP'quÔI Ž]¬›[„:ÉÛ=íÎA Xfƒ¬·•ª'ÙÍìxIð¸êïl)ÍûÓ*â9]Ig1BÚÃâëm†WV€]í¡èê£T-N>Úe-B^ÒCÈ‹\À ¹¤[ ×(`ø vÜmCº3¢;Ž=r¢\ÒC”ëQÉq¤rZÒË@ëÌÿ=D; .é!ÁE_€Ð–„¶Øv›×­âŽk°X,jR<\Û4ü ,ï/,‘Ëôö ±©×:Ó9™–^%Ùé5V#Æ ˜Óúà¨%G­²ús)«£)Ø[F‘ ¸ÎãìrlØâB[K4?Fó·×gž¦FÓÍh¢ŒVƒÆ²_rØ~uMŽ»…=n…5í|Ò½Zpg:ÁYû)µ . Ý2ì¸F á-¬ë>p*€tN`ç,`ô"‡ÃŠÀè“È%ö"öH˜3™ø1'iâ3F‰ˆC™È,öy‘òXT’iâ“E<,dИ‡i$ü$å~'©Þòaa°äè}†”á·´®ÑžÀB ‰“B=îÛÆJÔâœxä=v„3ß,èŽk˜û€r1Sn¥,ŽK½þ„ƒ rúvQí;o’¸U À>;`,Ø?7 Ô¡·Ïš£2zœ*}¡0[‰KQG#Iâd·€h+qØÉ¥»–Ê.BÆy¥I,yD³8P&1/” EFò<Ð’Q«RÙöÆ° ’иHD2àJ?ˆ3%# BdþzÔ¨Xÿwj)¡¨òÚ¦õwM"EšD €:¨ê@6;lm¨Q>{iëÇÁZÅ‹]Í"ð!ÔòÍb­3ôÛ0êG¡…ºÀQ(G¡.p:È(‡°Œ2IfQ¥Qš©-Ž¥z~Ÿ¨(ÍÏõy'%±)wkm© "%CÀC©Ì4ãY ’F*ZÍÕ'YÚ8j`\fÓI)›¢·X)gò=Š"ß3Oßc{xuN ¾<¼ÂЇl)@uG‰kÅ•E9Eî­P€ÌxÏ)L¢À¤=zH‘DÝI: ƒÇÙPD-ÐHúΗm@’RV ÀuX ´÷Ô"CIÜ%.î@Qƒ¸íÖq@&Q™t_‘€;¢f‘q\³€íDÕïCt €¢=œmK‚ 4Æ0ÚÃvVOå5`Ä"&ð;´§Ü÷vµÓÕÌ>þÎÛF'¹ j«vë›r0e³+_ÉïœTãp6ÀûPï3ü(:rMn—ø¬63ÙöA6 X=›Zßošã3U]½©ÏdllYí{PÁC{<¸]ÆfÄ Gß¡=ðCì¡Q±C{*m×ãä©SP<´Å£ÃÄÊNàCVŠC{ 8]{d·L@6*•½Õ$­"/=®”z Ñt¶\VwL‘þBýUm`Ç#`Z-!MG¹ÍF‡H ž†qšKŸ%"a ,“„P’'BÛ5Qž(¤.Ë «|õc/_t+‰åIçÙÐ[yºÇÞõçtj Ñ£.4z Ñ£Ã4zC‡90xt¼<¢4¬§Í?• =jàЭtXcƒhÏ«Ú×ë"—¥`Ì£[*W/ymÖi-ê}<Ñ5ˆöf Î£±K¦ Σq^mšÎÐC{#ÀÈ'.ë ª£‰‹•ðR4q XgƒÄ;׈4ੈñ¹Ÿ~%,M©LŠ”ˆ0Ô’1ÿ gï£8Hã$T䉟)A"ÓH hQˆ@Š¶ó(çùíÌÂoôOSµÆ^´€En˜´CÌ Â*J=—Õ 膘A7ÔZé©›Y­ô õt_ > 1ƒ µÎWšP}_™ŸÙ]­—ê&Òz2€‰ÔHØèY‰‚UÌ°gš#äƒG,p€f0€ßˆ¹ð±A¼ œ'iÁ‹"KYp!”e¢<“ºÔCœU5©µd6U&Zá%ÂþÁ÷_Ù¿+Y^Îæ2-FÓIeц Àï°À©ÒãJ˜†äÕ¯/ŸÿøúÇ_~¾|ñ Ù}ˆ…®õ"V²]ÊÉ'¬0À ]h8M¨ï·+õ³ù4“‹Åt~ôì£"—E¥é¿üôêòÇ×—}ùëK›  ‡£õ=V˜¥¦ÁOèA0¼®RߣU$'ùʾ#oøôYªy[À‡]¾1 •®•5PoŽ7UþòçÿÆzT ..CÕÅ5<ꦔ–ÅP—5q±ù|íáof›Òz†î._¿Bò®0 v.3jçê×ö¹ò;W€Š¹ŒØìö٠÷«ÈhE€Af‡‰ö<Tõ”Ö½Eþô Í\Àà!ëÖØt5“]} AdmÕW¾f™½ù,æ“Ñsbø?64ê-ÄÝÂS䥷¥§«jã1›ÞÌFc™×D–˜(ä“.Ä@6v_ðsh™·³ÙToÃ,” Ù’?'ŸÞ¦c¹ž.gŸ€‚d=}÷3 'Ô>zþõDÞp6¸#v|î!ଠÜk<À$Y—p ¥ä²@?2ýˆ´ÉÈ»¡‡JÍÖ¥"ßž2û£ùt¢7½Ob|«O}H©mSµõ¸ðnÄäVŒf5¦d˜ÛM€e§û €D2‰Í¥¬&$VÀR—ƒÖ €.2—ª° €"2ê°%ÌÑDˆŒJœÉ%‹˜ŒYBrŸf, ا’D¹Ð{hJ2 I:Ô~d!â,ISÂÕl#$“yúêsæEÑ.ÜU§Õÿ§ŸF¹Ìmn¤AêËñ”娣Ô0…Å r¥VKðJ=`«¢§÷(³×<þÁûv±Rç»Iž^k 9ŠPëeÙJ¼s ¶œ3pZH€¢˜ŠÂ­gÃ@N±ä”ÓðÐûž†àÆzàT¶ûï&®ƒp‡€ ;HïƼ€ybÜÅ»€'æxb7 ër“ôL‘£g‹R”£Ì*¸¬ñ9àU—NM¦EHcYAJ²œäq&¸Ì¢ØÏyN‰dµðÉÁö)àû¯œªš™“rTŒäür´¸¼–siu6U~QÛBlx‡º¾å)®;€B¨Ì(„:üBiy4Éå´»Jª²á’ªfy͹ôFÚzzêg™.¶9½½ºÖ „BÉUÝ\)ñ‰ú4•%X™Q‚£4[ÏkÁôt¥Æ š´:z°1ؤ#Ph•…VñË ¬!Àd,vb«aœŒÙVe­‡hçIe1׬à£R9šxo8û§8ûÍ?KÞ;ŒÀ%9Öfmßšœ–¸2¶¥kk,¾­8ó‚÷;|ÛÒª[8ìH’3@8("¹AiMí6Ñl}ÀÉ{Y"]|ÜûM_ìÙK Ö*I7Ií,)`‰{¸)÷‡9H ØÛàô>"IÐ4ïe²t‘ô;—X ÀMó~Ë}ÇbÄšsj  §¹œÞw^Bóé3ç.{|™wà˸FÁ‹?’I!D,#¢"ÎüBQ¤>¡Œçº‘’,>hiAÊc^äi’“,¥4Mx–Æ1!L‰Q|ƒƒ¯Ï]ܦ‹rTªB‡ 9RÅÀï\î–ïîð®zŽ“„&7š[¥Ù¬ÊQ­B°c˜E(z@#ýþá´¦[Æ Ì:BÓ¢[AÜHMn 5qƒ&½- 9»)²ª °“ÜÀNb'^½/•<ºøE\«*¨ÀõØÀ ©¬¹òß« =@Š<Á×¼ÚPÃ[ÿ@Å@@rŠC€¹R¬³1è2I€r³À+2ù@‘þ€ ò˜à›§ŒpŒ¯²ñ6·LiÌ­âµ~ûá½-3t¼A‡J|•³OmDÁ¦&N›íx¼&£¾ˆ·/]ì ‹ÑÒHG!>PÚˆl_Ôƒí«_˺Yµ›ÇœåüÓ·ùŸ:ÇM? =Dàÿ"¿oÓhŸÉÇ FXÐ]QÇZSœU5ìE"5بê <åu¼,UU]Õ PÐjöuQQ¿š Ž§æ‡ž[è›{²È๭_KwƒÌ;D 12‰ûO‰G&12ˆeõ —‰dbdÐÃV!v7#0Š‘oz¤àýk¸ûªFÖÕEalôYM{{õmÖ±UÝ“VèyF6èÝáùf¹kÓk%ôðJÏè‘[Œbëø‘X>£`:¶]ÀÔy˨n9W7·É2D@ÅñÈ©âx0G.Ç#€m8r©8¬ÁÌ\–Ù‘Z,'ý¥žô—jÊIh\$"ð4‰ý Îüˆ² =ÀFZ¢J´·eÖ¢¯k´ÕIk-òæÝr™êl‰÷ØÛvqC¦T³¥Ô¿}\•¯ßk‰õ7^¨'IŸ½Åh2ÒÙé'ß_¤V¼ýp—‹éí<“õ3Žu™zez´çÙ–èXÃit¼Î÷“’Çë~K#ÇõïÚ+Ц'Ú9ñ=öBµÒôÂj×êà5&¾ö´^ÝÞ õy åÀJlik_´.é–ê5ð>;EŸYvÊò¨†U§À…:ðâTô?êkjeWÕ>tA¹y¿:§Ùѳ×õa7uÍx¤â&yîíQóU‘–Fó«Z*vÓŒþ,¦ƒs$¹]ýšžÏ뻬îuYŸú}UšKðª¨Ô>mܲý±‹í÷C‘2H˜aÂÓB°˜äaJY”Äq’[©lËt™ÅØÙÛêK_«²O}²Ö„¸ k¸ò^ß»TÑØ®ï ›¾qÝñ>UYÕ0YZˆe©+U 5ª’"YsÆxFˆP%Qî³<ªðGhUÂm­§úâãhv™ŽÅäã¥˜ä— xae.¶´q¼ÂûÔuÐ §Þ Àëzç»°Älãþ’Šo9è—¼u˜Ž IÕ5Óä¼þåÈæÓÅùµCoga¦©Ï™L2?‹óP„™H}Iü0Γ<²ém¸­MË^A%ÐöiyÉ?°×I¤Ïê,'‘>—cïkó,ÈX*dÈeÎr_P*Õ¿u¹ÒÀçÜJ­p[kcãb¯Œèr‹Á2õ¾gµûgШ]C ¬µRæ4Ëó0—)§…ÒÏr¡ý¤ …•Ç…ÛÚ™ËD£u|S_ø5Fu¼Vo»è&žÆëw'k¬óݼrCÇÚ¶¬‰­k×ìºûtn¾tKJp”Ê)Ö 4 Íæ6.. #‘FÊn±(×1e(!!ñ3!©•­‚ÛÚün ¸í™·}v^È×akÈ]ÂÖ0ŒÃÜO¸2ÞaE1-B˜Z‡†,ÊbžYÙ#°­Mé­ƒjõe_C·šb©[Ía?j#2 hÌÃ4~’rs$) &ÃÂJ·p[æ’Ô=uüõóÆ$Yg,Iâ’±¤2ˆ’4 x(CÆÕª)aI£P&¹ú$K­òÆ`[+)U©øcRJ(Rì*»uáñ*V9XZž¬ÃEJzÂÅúÏμb.®ªR(ggÏZ7¢.ôǪOÔòf^zÅtªÏ”Îôûê«ëùRÚú«£ ¥ä<׋›ÎϾ_hL곑9×yZo:ñ~Rÿý×íØ #/ôæä åOX¬î4÷~™ÉÉël:óÒ;¯ÙËY>øuYΞ\\|þüù<Ÿ~¹»’“óéüê¢Z55þçÁ÷£›«ŽºÖõÓ£å³ÉÕ‘'Æåê%ý­-/8Ϲz[‹¬>ªI›Nó;ýWßäÙýÿ|šUÿºÐ½òvo|³—jUŸ‹Öƒˆùí¿ºûy„ß!cŒÌçá7~À)#ßxþ^î¼nõÀð¼oR±(§·Ûúþßôõýÿ<ó¿¯^zº»½WÿÏ¿ýøÜ;:»¸øòüââÅ›Þ?þú槿©å{oæb²¨¦±_\¼üùÈkãϤÂo~½ø¢Û ôÅÍÛ³²uåy^æztW7ür3ž,žö4$IR_]ýVÙzõçF–j©ßžÉÝŽ>==z^Ïó³7›°œõÊòÈ/e}ñwÚB-dùôïoþ|WóÃhägÿáìùôf&ÊQ:n·óã˧Éúšz÷ªžþÓyëw/êéWO»ê‚*ò}¶4O<1Ÿ‹»Åùµ÷ºš\ÞŸ+¨ký«ß« áccJ‘.γÅâț˱ƟÜåâZÊòÈÓŒæÙôômÙ|4+Ûß|ŸDýic,>üëVÎïÎ?,ô¦sý îÂün²™î³E÷ê–¼K[„Ù«ìSÓ™!ÒC»Çr:;ªw>­NüÏåÍôÓÿ±w­ÏmÛʾŸûW î—ÔǶ¾™&™ãÈJ¢Çö•ä¦™éŒH‚±zôªi}Æ·û]|K"Zizç^eäHî.û[€Ë]ŠÖ÷ã‚F'ifÜh2_í“š^ú;aÉó~˜LÉ’Ý‚a ¬Ô]D'“Õ‚D°,|ydñï 0‰é÷WߢkA |`© ÐI:þt¿~ŽwñǬüg?¦§ŸNhMŒ3‡NE”‹¡_A~¹3M`-ÊÏr•n¦!Ãã,8Ë x‡ô؇uÌH쬗â¿Ì”s.3XpGg1br®€û¡@/`Eoy›ý3òy9ÿåpš)XD/ñŠ£“ñjþ?MÆ…›R†3Îï«÷d<üßOE@*x8qWL~lðèªÒÑU~X¥2b\Wú¸ k"ˆ®—›h½Y6õ–]m–KžÃ"ï¹UêØôÞÝÕ‹Îf"3Õª¼ÍŠ¼MMï¦Dðx g©ÈêÓd’Iµ—·â˜ Ge~NÁ¤Þç Áþ7f甄 ¿Ñ •žž¤“,´-/ïbÛŽÀ-p‚0¤!¼Ä1ß6#ÛC?4­”Üñ,šlbšS¨s‰ ö}'ŠMËóÙs£n@’ÄòLbÆŽã›8I/>q«îã€QŽË$C,˧‰…µL7ÀgO»[Iglg}•_%“ñ¶û F³°~éUÅ´?Êu«r˜[Ç£Ú EË Jt_Œg~5ÑCýr™«Í:-»õ¦›2ôvΊ†°T/àhn˜³N¨ y"l;ÓÙ3Îk©×̯¯®ƒ¶ƒ© I YqØ'“ÃÿŸ(«zÂU~ ˜a%0ûŠò—V4n—NîîîNNîNøßòû¤~ü®|lËBéÑ/5¬jœþÃßNõ½u<ÿÆþ>žÔXФ_lõ§(öÓߎ|öï—§Ð/7¬n@ÿãŸþùø§ø[~ï:^úÛ¹.~yý€ÃJÇèGoÑc÷ÝÀ§—ð¾DüóKþ­+Ž¥ï—Ùß.zü…Q_Mú% W¨¤þzœ<¢yJ'…÷$£•ì¦ŸñøË÷5ôè—<¿‚êϯ4ÐÎ霤t®á½Éhí¦ŸñúÈ(©&ýü­?*Ó@ÿ §3£%x´Æúá*èG54é—௩ˆ¿@Ç;N̓ Žë ï%×+”Ïé3†}þ•Ф_‚¿¦þ2zú9eý¨D+*½ë+ hÒ/Áߦ5úG[tªÒ_a@“~ þšªøûˆzíé/3 I¿MUü}„?Çüoù}¼ãxåXGhÍ/ÇšôKð×TÆ_tBïgðÂ;BóG´@§ÂÖá¢Çå#"ü/ÌõNfvéÓ/Áßz)Œ½ôó”A°HÿW¿íû_眆oö¥‡ó£š²`¹©Šå{éÑ/©ä,E,ïÎKvk =ëþ€á£ÛÙ˜ïp¬Ð YŽW§ÃM k[¾Âë_ úç¡_‚å–*–-ùK°ÜRÄògÖ)ݬ(z=¼@“qDg+úÃ_@¿Ë-E,ÐxÌblCþ´(×ÆÌx†Dàâ‡ÂñŒí ³ýÕ ú}¼¾Gó%ÿ¾Y·£_‚å–"–Oçñ8aíñ§È’¢]NÇkvO4 `Eë{²ééç“Éüwö´_4ŸÅ<„aÕRþ,·±œQ<¥ëçOV]ú%Xn)¯¥õÒ¤_‚åõ .ûèÇgµ)°b·²RÝg9Ðt³bá ks‚é Y C”ÛÝÙ| ³þD—~ –[ªXŽÄ}7v™Q^Òk6q«J|Bã)]ž=Yþüµñ×Ü–?ȹdo2ùÃdŽ7Ý9-è—Ô›A¶êZå ÐfPªTúôKð×VÇßê\ ¶¶}ηx§,ý˘LV…-åÆŸßÿ- Ú™>ýüµñ×:C# †u,îAƒvl–í<ò(¤ Ñb¶Mgñ| èƶ·—óé|M‘P«õJ›~ þÚªki?ˆø3˜IB‰Vódý;C† aW 1˜rÇ x— àfêøƒ{gÚôKð×VßËþ*ö_RÙŠø;z×¢áõ›Ñ‡óAÁç›ÁõOý‹Þzý~ì¡óÛÑ»ëú׿·ð3_­ˆ%ËùÕ¼?¢ÞÏ7ƒÞpˆ Q>$8l+âpÿýÍe¨6çW£~oxÎ~÷òö¢õö½¾¡«ëºì¿ï Ùèú„s·}š.ý¶qøú zßtßç¯û—ýÑG.à7ýÑîî9º9ŒúÝÛËóº¹Ü\ax`Ô.úÃîåyÿ}’à°­ˆÃý+/êýÔ»¡á»óË˲ò¼îàÏ__ö 4ýA¯;bC”}j;$8l+â0è h=ÿò ozÝ>ûÐû¹úq>øx´»{}5ìý×-4‚ÑÅùûó· .ÏjZ¦I¿¤êrq¸®Ü0»·ƒÞ{6 [ÃÛ×ÃQt;ê¡·××|¶{ƒŸúÝÞðGtyÍæït;ìéúq’šBÈQÄá‹óÑ9—2JD1½¹ö¹ú÷¯F½ÁàöfÔ¿¾ú½»þŠr_ðyr}ÅÕJ_$U‰£ˆÃ í׃LˆLÓù>AÞõàø€MPžÑàœ):K¥Þ•›§£ëÁ¨•þKj!G‡ 5FW½·—ý·½«nQvÍ8øÐö~[Ó²}!ìçÀï-W/6×a,ØG]ú%8\¯¤„c'Ü¡þt~ñSŸéHJ#˜Ìa?5¯|Vtߥù¬¥ý‘”iBŽú=å¯âGHj3!GëQt'ˆÀZ@Ôç9%³ñbÃB-³h ¶>ˆÉš´£_‚¿Ž"þ®òH3ô!u/Ç6ÛšôKð×QÄß.—à¿öpBXBwqø,=üÏÍébµ‰Ï’%«§Ê .$(ì(¢ðå|3^^ÍéÝÌ7Ñ=]s.ŠÃg qøŸã¬Ë2FÄ…¤þrÕ×ÄziÒ/Áb÷¯ïêè1 ã6õ¥ I})T«/¥Ø©¶ÜØZðÍœˆ®VóåÑ«ïÇÉ,¦ /Â!‡wïô„&A z¡©ý¤d—m ë týj%xS¯`%§Ví²˜p`¢.‚ô© n™Vëx©U'«$ónÊ|q 'Ë7 )[ÇäCˆá ËaÍfQŽ¨è»ƒ¼_>Œ- µÒ!‰WSϲ—el”ÌN ”ïF”زÊjæRÇŠ;‰=J±ƒCjW·'³þµ|`Iö\Ï¢Ö©ÄjJéñÂŽ°$EnJѱ3ÂBµÄ<–$ÄÀM 1ž̓%é,pS:‹ö‘%X’…7e¡¨1ÍyÎïåíñôw…¢ÂglÃU¥¢ 6T [ížðâî&»Fµ¥Ò-¶½UrŽÅ” Ÿû• œUÇ‘ÞÖ—r«"PØ©çÏópÝ2)J㣴iKÑUë¬ä¢ËûjÉÍõUu i­„³ª]ÅV.¡–ÇžÖâN5µ@ù¢®ò¾ÊZ0–Åãõ¨kuÀÑ÷Ë£¯Q-•—º4êQåÂ-s¡Q‡ úJëI7Ö¤|>u“nÿÀW–ã[ç>¡È³élUtcùRQFÏM[£¾d.KùâX]–íÚÍs¨~FÓ²ü€¢µØ~c.Z k#ÏE+_(¨‹ö‹Žý‚‹!ÔÜEMòã)sÛ J2·- xËe._r¨Ë¼ýò¥Ù:”VRhWµ¶SªÓF¨òí# Ñ~+ªYªù¶ÚÙÁ³/f)ØŽ…¥p5JW›Ê°¼kðI¸ þà.ã’Ï÷\§Xq®(ò°BuEÑQl°o"¦²8!­[Yœ}8÷†…œæîNáÏBŠÒ¨. )¶ŠÛ/ɼÖsù”=e`Ð9ÑxÈu>Ñy–2é} CÖꊾßÈOýbÖËô­² é[m0WzXsÛÜPVWWvÆ—“¥ã—eéh,ÐrYÊã€ÔeÙ.¦H_Cù©iÉ߃:„8(;á8hã„ËÃ@ÕÚ*¤T]9÷šÒƒÊÔªÈÔj#Sù½5u™¶¹O§¼b„ö϶0éK,]¬Š¦Zí4U»«¡©íâ€e;šhë¬/fL±í–õÔÖØ'ÊwåªïÊûªì—HlÖÖ¢åwؼò›×Bå÷€Õuñé÷“Ÿ°q1Þaº¼Æ^yyw[|ùÿJôO¯Dÿµ+¡ÿß|1ÙÇóˆA‡ÍKÌìC^ƒYZ€,ö?ö£ü?~›Æ7ØtÇs­o öŸý 2Iľ׆MG„¾ E¾¯½íd¿ÿ/}½øîâº;úxÓClÔÑÍíëË~v:¬n§s1º@?¿½¿„yl Ñ’ÌVÜ|’I§Ó»:Beëñ»Å ÇhÐùƒõ…ÙÉéÇÓué̳x3›Â/øÇt2[½ÜÑ ‚@œÍÛŠ’ñSº³mOéo›ñç—G]a]OG,ž&³µiÁy~òÌ·YÑõËÛÑ›SŸ[¥­N~>½=?íΧ ²‡“r?ýÞË 8G|Fw¾,µ«ÔQç'ðšÊ¯Š²‰1…11tA¬&7Є.Ùј•Ãžý;µÊ¬ø÷Y´Z¡%°Ì0ºº§t}„XìPÊ"kÀ®¶Š–ãźü˯ä3GSKýëoº|8ûuÅ# ø/j'ƳQ¼õ³Kôf@ D2âàŽiŠ ¯™§²ž/ŽrÆsžŒ{I§,u;Ïr ä×hÌ q¾EìÓKWÂæý0™’%»/£A`\QD'“Õ‚DãÙ§—GÆÿ¾›åRÔ°Ízg…Ì«Ô±‰¾»+Qн<ªUy›y›šßM‰àñÎR‘Õ§É<$“j/oÅ1ŽÊüœ‚e½Ï‚ü;oÌËÚB…ßè„NJ©è$ ?ŒÇ˻ض#×vœ iH#/qŒÀ·ÍÈöãÐM+<á9Òr u.ľïD±iy¾áÂ+ Iby&1cÇ…aRܬiÕ}0Êq`™$pˆeù4ñ£0 –éA8i÷E±ïü*™Œ·×`4 ë—^ULû£\·ÒëÍtJ–Ì*f#ýýŒ®`Nœò&7›¨<Àå1íK'¥ù.N§”Ù+8k$ìiÎ)Ú¾É aîÕYPa€Ûñ£Ú²VkÄTÖa¡Œ¹¨D§uYe‹4¸Î·/Õ¥®UY‚½z;çuïi¥ä /$°ÄfÞ™±E<â*‚{XÛNV”–eNE@gY¢9©ÙË#¶Óvofm>-ç›E6¦yDc}äØ•¿Ý¾{ó ¥ Eã5>O¯œìÃÁK€4¶¦ZxÑ”#ô9ýÊA:½ï–ÅÞ²þ·:TÏ çëõ|ÏÜà2néNh1¼Bž»XQ€5æŒm±0Ì~9ªH´L­è,…Í/>T[ó…U1i¤ƒDbÛÃfÅž»iÑ$2}Çõ'q¸ZÔjS²P–™Fd©V¶¯$çµJÈÝZEI´E¨¬E;†ËŽ" B'¾o‡®F‘›D ¶Cç+ :þ"&ç¶6` ¥ÓâßnÚWqÏùøÉ'}HâÄt­Èõ]+q× †™Ðس1‰C'4Zi»9õE´@NmM ò¨”ßûBª–íKNWÞO±±> }›-Ÿ]“Èu©óÄ&£±•S[û_6´òQÕ•ôSF5q¬À%Šz“¸qhFVˆœ¸&ð`’V£*nÑ}‘q•Ó[“yqK=ûj#ª+姌(u"êÛ¶\Ãõ©`X"Ú±Eÿ‡½«mNÙÒó9¿¢‡©š²}1 IàŒ]—`’°åØ^À“Iílù IØšâJ"Žk½óÛ÷œn $!èà@²&áÅzi=}úôyNwŸî–kŠaXú`¿ê)mZâóâÜyEÍ+êMŠµ_éëzEÖ¾ŸUŒT5Œº¦Ûý¾]«ë™ßg’Üó°5WéšÅ‘XDPsJy“ÕlS¶LSÖjre ¬Š=誢hRµ¦üø%Ê@Êb‘ :Jye½‘£dZUV¤z¿6Pkj¥¦šuÓ²¶f`¤«õ×+_)(óÉLä@À=Ê)ßMÊÒ0Š¥ÂH¶V©Õ¤šdúš®ƒ- úÒzÍâg#S>ڔࣰÕºFy%¼IiÖª¦j×*ªbÕÁ©–lY1lð°UIÕL©ßÿák&_)(³hñjHÞRÛ¨¾+5UQ%MVl½jÕ °2–9¨WTSÁ½l×kC=Ouç‚M |6ÑñÙJs‡ÎxÞ¢ÛDMt³jHšTë«zÍÐTI—ôj ô¾*Õê–!í-ðѦ$7?›–éO!Z;°ž ögŒ–¯pox¿7y, =Aû6qiË—d¶mœ.§€XQ=·’ p_4$†O¨,lHk=šk˜ýYÁÙutÎàÅfÅu5ºþU¤¦i‘[8›ÿåŒÿ;ÝY+ç· u›•ZÝ(—¡ùœgŽ<Àl!œ¡-‘X[Ëj# €^hÁch–JÖBHÖVÌ)®2®Ê‚­Ê­šÓÅ æúâˆü˜­ t¸$y:aKü Zu±/:±]Ζ1?Žn¿š-ƒ¸‰‰eQy-"êÔ‹[ý#¹ÕT–ùÕ4€Žù’áL"æ$‹:Úp· —SKt€ŸE°—¾ïô‡p‹åNÑ+ž™‚¬ŸŒKZÈl%‹][?ºš^V ]<}?;¦äï—Qr^z÷Ì îR"Ép!ôCû‹=ü®ú“>¸,þˆÂ·cðÐÒ· X)Ï0‘:pÝfb‚±R‹5q=<¸X…²«Ñœ˜Î2Äý]¶Ú³×ÀÆ#¡Á<ËGD}›L! *@JíăÜÃ-Ø5Äz§eÛì^ÁU‘°\¯H™‘ƦLÍÏYâ 8©ÞdÐ óÞ.•J¤p­:«&¸Rb>H¨úEQºžÅ:¾\ï3ÃzR|’””¿#â¥ýùlSœóîK÷ ¿@ËØßHv¡ »V…z_¶Õ³à§@BÕ”Ÿ Z‘³ ÝÔR9Ké¥ç¥'¯îg˜?á…·“À˦žQŸhšaïÇ:i¾ô6ýø½Mt¸?#”a/:›fí_ èfsý\Üèôz­Åê7í-šC^6\lz6½¦þltñÜA7]|å‰;Æ3"g+'‚7Y LÞØÃl‘‹žõàíKÒZ£±ý›wrCƒ³i¹~ÐöFØ–ôØetJæO‰R” ”´hìæÛ|çKKÎU¸ÅVî´mÛ¤OÀ¦W•E†Ó–*žË¼´ø¥¶` ‘A-{`L‡8öwÔÊÇ5bQù‹í}ly +ªï‡]Œé;¶4¬Øg½$;ðû‹ÕBB¡A6hhÜ ½!0h¬ ‘–g[¦FÑÁÙ½è¡ØÖÄ1iµã¥/t‚JÕÞ4p†,½+¸¾×ÉéÎcf¶UÙ™Eëu”Öycn?Ý¢oÛ1ë§Ý™Î¬wÔk3¾£3Û¡ñFÇìvîä c!¿Ìôûÿ×7ºÊ.ëz*DLldmÑHƒ3Ò¾1€jx¦Á¤Û‹ ±½ <êÉ×y!/ªàíš =‰~øÆÄîÛߘáNôÉþxÑè¼ÁÇ>4Ø©GŸÙúXÏíU¥ZÌ¢Òø¨A¶§sÖ¨ßeˆ’I®êÿc¸¾þ·2 )á- E˜­yÕ}<Åí{±rÆï mA,€Œšg_l$\æ#ÖZX±¬HÆ{ˆRlÍCß0ÜLÛÉZ{ÛXº”éÒÏÇÇѲ^>9>†ãx„® -G&ø›žºŸm•ÀNÊPÇ, '¥Nœýæc4ÌÙ«wöØöh¸ Èø¼ÿc:$²N䊤I9©j'jÆ¿\ð.¶ªÀB†UÌó|““rùáá¡d¹_ïìqÉõîÊ8Ÿèk(ÏW¿9£»â{æi!ºc2¾Ãý/‚Ù@ÿŠ–Tª•4øÉ Ã!–%<Ûw­GüƇœ½úéåõ]½°ÔÀ<ÒÒ+Ó>)^q¶òŒ ÎÈ©Vñ[ÒÕJü\„*8àÒOÐ`UÕª¤‚Éø gý¨êO¤²•§s^S¬È„üÔ7üÀ.Ï0ïüwúúíçó«fïÓu‹`q“ë›7í&)—Ë•f¹|Þ;'¼ï}¸ P!=Ïû” Œa¹Üº,¸ÝyP¨ÉéuÊ_1- o±;KV`¡5¢ü:ŽýÓŒd¤z½Îî¦×‚ _À`ðàÚcûßSçËi¡.-…{Â"+}ZÀ¬³›_c+Å·ƒÓ›ÞÛãµg ‰üq|Ó8nâba,K§Ý:­ÏïAâ=-Ü1sÍö± ¯;gæ’™IzCàÀ§‘Á>Áô’Iº´f‘·t0˜]‚1…ãÏ¡öK¦ïp5³Ó‚<mÿÞ¶ƒA-Ì^€ÏðMÏ™ñ3_ v4´ìý{j{¥¿Ðÿ(³3b7Zã0¸ÞOßÇdBÉ$,É5ÐOC¿›m¯„¼j¹t 8Ϲ_l6±.*bÀ¦ƒêú¬…>úgF»³tP¦4XPiB·ÊânC¦3¾;-T ôï ðWø7ø<¿ z[„fÒÆ—NˆªM¾¾.0/ÍŠN†·í\R)©öˆ]Cf@À÷ÿ äÇ|µH ðŠ·qÿ£Ä…ÔÅ,œUJõR„ §Y‚Ì!‘“zlðñnÂñe¾ ¸7„íMóLðÄÜÕ &”–^Ã?6¾xîƒTˆüÔÌÈ'cGÑ›œ·q†ÎÙÌ%‰û4¿g gÌòmÜÙa.Ñ¿`³i üh®ŸHèrvX$c …¹N¤qnÓmQ°<µ(ÇæÔÃe óÔѧM¢Ãê Ž—jRÞrBÞrNg#ay¼€»Ddu7tûÆ0™Ê;vL$Gñüƒ=½ŸeпéÅa,uìnÉݵï¶/ÅÔ%«jª­ƒªlH¦¡IÜ4Gê‡pç«`„nÑs3·á£Í|¢RI¦v%ÕÂQËÎÒž‹aö(v{úYQs¢@û!b³'¤0'ïÜÙĨø–B³=3°¨K4£±Tžq7bÊ;ŠM6*YF_8I¦n/ĬP캱[8ÃR•Â²ŽÚñó²]‘¨ÌITN$J•'~©éŽøòÑ?Ž7}Í´U»ÂÁ®$’‰›V¦£#’ýšµÝ.œ¾gxK.£IäÃ^å`¯ŠcÿærW9ØÕåÎ^ÌýZýÊ‹]ã`×öXî:»¾‘ÜßƧŜ\D/ËIÚŠÜkìµ=–{ƒ½.€=×¥Êê'Jiå{$‡]$Iä‘GÛ|åÃÏ!2IÂO濹ƒIÇOX¸„O»ô&îðñÞ¶þûsür“„È ð?ýý÷ßO³Ïø;ëxì³| ¹øsü‚“„ñ“wä©ùD®á×)¼/ý}Jÿj²cáû4úl’§?}¢râçœ$Br ‡< Ÿˆâ´á=Œ°Ùø1þ’Ê@>ü2‡2e!ʤøç0ÄÀ{agãǼ>Ñ ÄT('~ÿÊbüK˜¶Œçø}–†ÕJà‡dŽŸ¤2?‡eAþï)šG†ŽêÃwJõŠ„ÇgøYÁß’xrâçð¯,Æ¿ˆ§=Cá'1¬$öN&2?‡eQþ}"½œ¢øȉŸÃ¿²(ÿ>‘ÖúøãȉŸÃ¿²(ÿ>ÁÇÓýŒ¿2Ž'Ž•™Öüye '~ÿÊÂüK®ÈÓ„éýÞ]x›äÉ}"òtÌl½ï>yòžˆA?¡®—#³Ãˆ,?~ÿÊ¢üûë/Jý54Ùwò¯eßyîYñלûÂó£9eÁárY”Ë·öʇ_áp¹"ÈåMwòèáˆ9h‚P©‘›±C{8‚GrmxŽÜZж¥-¼öe§ÝØ ~—+¢\¾+ùs¸\äòåŽN}›¼éž“¡cÚcß>üø9\®ryǶp•#§? ¢…Í03Θ°1 Bõ±ÁÖÕùÅp_o¶êðZø9\®rùȵœcÒAˆ"ÝÞi‚{Ó9³¿ØúÉ„æ‡îC8iÄrØJÐëáçp¹"Èåˆxd'«^ü.W„ÛÒÛzåÄÏárEË¥Rª ø8”ê¾éZP:SŸ.Éd„a•FÇÿ͙ݻƒsrâçp¹"Êå$¶W= é5VܤÒC>! g„;o*ÿ*‚ü+/Êä³7‘ü¡2[SÓÎ,‚5ðW9ü[mK“™¬SQ¬n~üþ­Šóor ЖÁ¶ÓõÛÉÈlÏ1†±]©ñg;Î ­”?‡«‚ü«ÐeÓhÂQD±1ZBì4`WË÷Ù @{l¹îóèa~Fn@÷õµ üÜø9ü[mKƒüAÄ_¢¨ùî x@fˆÖŸØ&Ònè‹Äë!ÁÕùl‰·¼ø9ü[ïËÞ‰ý¯rø·*È¿½÷í.é^½í}ltZ~_w®~oŸ·ÎÉ›Op²E7½÷Wò¯5ºpš¶VX“¥qyïO¤õÇu§Õí¸h|px¸*ÈÃí×m@ Ùè4.{íV·Î~óâæ¼}ù®HÞÜôpÓRrÑþÐîÁe½«"ÍÝâmyñsx¸*ÈÃWoɇV§ù@4Þ´/Ú½OTÀoÛ½Kî[nƒ\7:½vóæ¢Ñ!×7ë«.”Úy»Û¼h´?´Î×°C® òpûäKZ¿·.{¤û¾qqWž7-|ãÍE‹å”æ¼Ýi5{XDѯu뇇«‚< ºZ¿(’îu«ÙÆ­?Z Χ"jwóê²ÛúϸN’óƇÆ;P—ƒ”–åįrxXäá´rC5nÞtZ°<@·º7oº½vï¦×"ï®®Îimí¶:¿·›­îkrq…õ÷-¹é¶òúq*‡‡UA>oôTÊ”@¡ÞÜtÛTýÛ—½V§ssÝk_]’÷WAÑ @øœÖ“«KªVùõGåð°*ÈàíWO(DÔtZ‹äãûï`ååéu¨èÝ^§ÝìÅ/ƒœö®:½µô_åð°*ÈÃs5&—­wíw­Ëf ‘]a>¶»­C°5í.^ÐfÂþØ€üÞPõºe?óâçð°*Èà +RCDÚoIãü÷6êHˆLf·šWZ+šïÊ\ZÓþ¨VÅÇ”wâG¨þUù7EW$´X@xž#cìL¦Cp§çWFÑtkj#0ÖÃÏá_UgËû%ò1t/ûëtKäÄÏá_U›¶åü†M†¡@~¯ÙáRxøŸÓã‰?µJï×»à5ü–rÁaaU…/Ü©ã_ºö\»SóÞh.æ‡KvøŸÎÚeQF¶” ÃÅšx›xK¯œø9\¬}ûø®r¾ pÈXK‘±X¢†ÔV0ä„ö»àÚ«®W8û%ÜŽê¤X`ßJ÷¨€ù2ÉaúÇy6Ÿ¤9&VßÎØ8à‘¾í8»5?GçXs]Ìçßæ+ŸŸ£s@¯­£•3­××H´¾ÊüÎM½sÑ$übØ–¥ªõZ¿n©U6«š®+ÃR•¾^±¬ºI‘Õ+lfà²2ûl?>¸ž5[k6¼’¬0IRø|EïkUS¶ûn6côšfÔI“úrßÒíùH·Ž?_éÖŸNØÈì@ÌìæCò?‚²åpL=É1©Yy!ŽÁÐ}(œùN`ÞGPÖÀÂ!:gŽ`iøÑbê(]wZÍv·}uyÛ½>ÄÃ!ƒº²€g"¶fP„IU~yÔ«[ʹ°P8¼SW¿…P8äQ_A[w¥ë&¨ ûõ‘Ö,ÃÂeÈ1ýõÚ·(CUÔŸÑ£—*«=z8Ÿ»ÌþWðÉ« .œÏÏgv5œ¶âÉ°ÚTÂùQY­¶}p~Y­6`p~DWΪpQäº]“ú}íÿØ;ÝÈ+ ¿JcÒxì°êÔkxN ñصc‹Y—q#I+ÉÎ"ûòKvëÒ"kø–È–|™AiŠì®ªs«ïüÚ(U]{«Lc£½¾ «{N©ïŒ¤!J»ÉŒ%Phë*Tµ®ÒDC>$QSݸÔÞ]‡ÕÇ(ý}™o”ó»ØdéÉNvàuvi==P ïOˆ¡\/P ‡Oˆ±\3P 'O zòöö<íÔqÓIfÖöšÞgÛ›xÕt)õÇÿóÓÅÍç$7íöæzÿ/·ãr·Ç´‹ƒ¦;äpÚ«Øüýöopß`Úå 1vyk†Q´Á‰A\Ù”U>e ÏM úÜV˜2Щ&¦:Õ–òh;SmgÏä Ðh&d.{™»Âº¯³luk.ÇYÍÒ« Øð©>°'‡Ÿ ‰KL5q¬¦Û;no—»~€Í–9›=wýütþ÷ó‹œ?ě£õú TàÎ,0õrhê™Ñ(èvƒn'樠I {xƒÓ9l â :µ 1nmkR¡¡ÖPô&%¢PëH>éV·®¿ °3»^ŒÛjí&ÕDW™JYQ¥6|òµõÞÔáη7U·×Soq÷55ÊúJ§ªÚ4ÚêÖ[—jŸBR:Õoá/ίonåùn®¶½”;F½ ‚†»`Åxô);«ÆË ï@¨\ls7Ÿö‡J×—›/ØÉ1hjXc]ÜÙÐ_ AÞ  ÀPãcÕÐôBåbŠG³fÍ* Ô¼Bhɬ‚(bˆ­ónŠ%_<ê`¸˜ß'ê(¸P¹¼®V/~áO­Ç÷—Så”ï÷*ÿ{éÞþ3^ÜŦ'ï/ÿùöæôôó ï³,\蜙ìŸÑ»Ï“WƒÂ ßÌ-ôêÖàØb Ç~rjXj1ÅR—³& ÐBÏ9f*Ê7Ä,tΞö;'^]]\=ŽÔx¹FQæ Xe¡‡µ6fb1`ˆ¹£:${yƒ7mYƒN‰Œì¢ó·ÞÔÖR-Be÷ï“KÊGÝÚ6î+èF³‹FìÕ µ‹Ç÷‘8'Ñ ßPp]R£-µµ²NRê’ŸDÂ¥‡!÷VÅ~ÐJa†Ûjörgç¹ 6P [)[)Ì°X‘q¹SÙ[þ£ó¼îŒQwIç)׆S˜QŠ·JŽ|þÞg©ÜO,‰FKÜsË™kžbx2/à7Åßä ‚“!YÉtjÆ·©u2)É*˜(¥m„‰•t¡nŒ‘:©vÿfõz¥Æ誑¢m«ÆÙÎþ[Q·©sAײ¶ÍAQ¥gû¸Ãû*XJ.4?þ³z‰U§J^º¨“•:v_ª‘ÔÈV)Q+ëšäíuYûáïmW÷ˆ³ŸøE*vˆ;}&ØXî¸ô™p p¹ó›q‘j7!Ÿ]_2-y€[ý`ƀŕðn|B¾j­ÊxÅåWƵªýäöä‚€ÁÍã¾J&8|W’:LòÁ½¢,æZ d€ZQ³O­U²Ø­È`·û2ÏuWy^o^í%¿à0[1³-X•€±5¿n~Áµ¢fDÏ{,°ˆõ‹XTðܬ¨s6ðøËŠ,ËÌÿ*ê’ãd ÀV9[yƒNÛ4Y¬ÊÉ›:9‡³Jˆ>MÔt Z¥J"z¥ð•î‰ØþÍÜz9‡µ"xW‡d¼j£dH¤ d£¨r"†‡¼3”o¯·/ó@™ ln¹q´·˜t??ZL/Áý&RŒ“±5cz .?‘"w¶1Žé'VÑÙÅù»û9;¿9Ý2w#¸ÖDŠ\°¤–àb9¼˜„7è´g—#jxݸ_rXfÈá\ÜÏ\+,“é¨AfIãe—ÉtÔ ‡÷wðöñrêR¥3 Ð`9uCƳd°Â2Ë ßfcÌ$[ft&$,åÚ§ÅÁ’OÏO$€|åÔmåɃø®Ìà»Ë&à»R¾ˆÓb @_)ËN‹%€s¥,9-–€œ•Ã» xƒs6¼$€5è¤r6#y0VÖ}¸èdë`”i„k;Ó*´ ±?–êob13’‡y-áÁêXQ•º Ʀʓ ÁŠ±‰].!åAîðnÕÜáE~ TÂ% óü@ÅÊ»rBÈX9¥àýØ~ï-\~œ÷ñÇ›/ÿòçï¿šeÓ+§Ä¸?vL÷ÎnsrwL±Ùi©=9¾}ا'_¿ùîí7úáô”ù=€ˆ"KëÞy—‹ŸãUÿÙæñßÜýÍ"7ø^©rÙÛì™9[ef¾~Þìd€ãçŸ)MI|g7øü€ÊrJ¥{bcsQ –Û:wL)ú,KÐg Ðg©ÆéU‹€~–|úùéÎø©)…륜CXÊ9¬îB8-³àô3*€]Ë,v={þq!«;€Kw§Ï;À9ò¹ñbGr9%£}dGÃE&$ ÒåPZ›7(ð^Sz׋—x.§Ä«Ÿ§Ü v9%W½°_(¼œÒœ~º_ìK¨i{sÝI>y@/6_|±©˜Ö(NKó½P™–S*Ó Y; -‡:Ñ [»~îßÝ—Ïg7¨QËjÔßð|ééy†|Ô±xÉ4>H“;;;~É´RÈQ+³¸ ºä [;*0ÀC]hÖ  @õžyƒ>Q>!R!ÉH6µÖuhS’Öx ÆIíþÍæÈ'„‹ŸÚ³{g̨Z§VšhzȾB*ÑÄ*¥J§¨*[1¨Z—è–®X´æ,@WÚãI'H ¨+íq¥$hoÙö†"øGkõt˯éJØ5Ð+ ê`WŠ@¯€Ìö ¬0+ì´ ´ÈA›sPà⇫¦U ã@ºe%žH«@O‚Ìö$Ì WÃÉ«íŒHt,HÇsæGª YA›ŠTA;ƒ¬ç@‹E‘*èa#Qðç‰TAã‚5.0cJÐ ë1[ š ä°É€7(0yÃæΠ4©&Ì+êdM jcZ#S\$×PÝj_§FõoF½$ñZd¶«‚>Ù*ZelD)¡ºg´.š~z›˜{ íŲÙÏ v¦j[¼´.s2ÒT iµµŽ3Ÿ:®¦p5Ï,Q5§t?/± Ó¡D÷ó‚A'Yn†Y­$ ¢éf+Å(½ôÑëè[%¤P©¿¦{3‘QYÊ,µ‰’ŠN’òd+iÚÆ„¶R^ˆF;ÛTc³ô›é!ÆÓŒ_/ç&¹Sr_3ç&€¼SV=û]#¸yʨj/K_€åi˳<;exö5Ó{;e!÷—Ó5B‘'¹vsNž†œeŲ蘭ÞC€Ü§‘æõò; â!æ¿d¥†€ˆ6 E´—©ÔÙ&Ûåe+5DÀ²Rβ½RCÌ/ sHfòBÀÓc ̘R*)ªLv¬ôƒ–äY“D4#%ê’ÖŠN!2ö})Òû$í®zëÞL­xíPCÝ?Ô¥!Fjö±jTk¢èíAý?šË— ‰u‡—ì”`æ4Ò¾^1}¼9e„± Ó'ö½§¸]Ëeüéæ&¾ß«5]‰ÛtŒ»¿AX‘!Ò7‡Ù?TÎ|(ˆ%T.–8xL÷ÐþsŸ↬`ö¢‘  µ)Ck3 `ªIœ=€“)'&§ÜíÐcÒÜÓç5!ðÑ&äžUÀš)#½9|Ìá&ä?ѬöÁcæmB$ÓHÔzùM,[:î&æ¬D›÷K|îwÔ¼dJ:7 S®Í/™\Ik—”ÏY×€Ñ%ó!i»Ý ýƒ¸@jÉälàˆ^ÿ pޭ͘ñX`›LÎ6j÷‰Cݾ[ë1ãñÀJe ÚÇ—÷Ÿões•%iûÇú³Ø\Í›W`—F4ìâ–p³4Rùf[FÀÎÒ]´d[2¶ •l€&7ÙÕK6@À›ìË(ÙX`ÐlaÉÆ‹e‹J6"[R²±ÀÌØ’’Í$:Ê9ÅÖ!ØÓþ©Œê™­|´äÜN¹„ÜŠpMLuJ•õµVm2Æ6¦mdëPIÈHpÍÎÚ¾¸šÍ¬kôµ4"kW,¬h–2ÚÜ«žKÞ–³›s¢–2Þ »b@È’+ÁZâJQîU›õJ.W)¾FíJÚuáY´+ »yƒ/_óUážž  •ê¹*q«Ÿ X–êå5û¿ðî98-Õ9‹–®bF³lZF…{éÕlZÍ¿ïq~´µ©ž{¿#ó±ÀÄÕsšªJ’dºU•³zGOþVÕ0[â…ëj’0ïÇ}l¹£N›9U@> Àê*ÀöÕ¤.5# °±ËNbc*Ù6¬rä+Õò¦¦*5ÍîÍzqëÕPÖîyuKZ†VŠºö*ˆ¨…¨»ÌÀúƒNÐÞ:þ²sT»ÕHµ{¥,ªW@Þ[ä½95öSÀ%3 hx+Q´§=½5IrrûJ÷¢¤Úø.¥—÷³Âj¯|0ºV¶?fëÞL®ˆc$’–­³µqÚª–’ê^"PgZÜA_ÆåÕn×v«ò¯_ÿí/›W›´eSá/N¢T’SôŒ?ü9ýýn½ýÆ?ø[{Ÿ}û{ÿÕ;öoþôÃÛÿøîß¿~óÕsWXÂ# dæ°Ó!©a™Œu¥;+]ùªicJ²‘Z5ÅŽIµÔº‹ë‡…Åüö^oÙÅ~Ú¹_àtè«FÐfÚ½\:ɬõlöÑõ£¨kj{<úHì0>+Y"©¡É©J› 4ÕÐä úÄk+•S²!YÕªuÝ-P¡t£K”’}e¢³¯­\x_ÚžWÜÅö‹5Ú@°X©aµ^iVÑ`• ^³4«€ °Ê _ßš7öÂé_î¯ß|×½Öëû{&¹¶ ˆùª¬˜ï’•˜I5”æå œòBð#·š«ú¨²ècñBøò~!þB^8Ë8.»€êìò^”¯˜ûô°ˆ£Ò/RžTYAZ®oìÖ/sn©²Z°Ýð›/$ún®Nª×Q=ºóñ»ú‹÷ïãùÍ¿üÛÿøÝ·_~û¯ÝoovµäͺÉï7o¾q͙Żþ›n×w?ânxÀSª,O¹«GÌy°ÃY~rQ«˜J•a*™:`%_±u~É^œRñÅWç=˜S½zÉP–*+“zü’=+Õ¬d.:€R*ST²ؤ*‘òf¨0Êtã”ì[r­4΋¶N.ú¤kG‘Œ”®ª(¤Ý›õôÙZ¹f÷ cª.ËmŒ²ÝÃU6õ†Ò;Óx‘†¹æÛ›ÿý=ß|´À{+曀ÎS#:oå|P}Êæ|zqÀñÝe9' •]=(H¡*A Õ¤²l?èqï-Q@?UôSŸ¼JòN ¬ª2ʪ / ¥ª\IM誡Þéªy'ÐIU®D#}弟Š­¥ú´¼Àž*{>Þ ˆP•%BŸ´óg枀!UY†tnî 0Q5SHµÄ² œaJ™; C_µ ÷¬¨ªWéQU9Ô…sO@“ª‘Òéó䞀3UuYψ4¨ªKzF€=U‰vª@§ª <=É 1rOO•7±–]²ç©Öz-| ¤Gd«Ø¿™®æ(λíVÖVÇdQ’kbE))a„j”·MŠ}Ÿz^ûæ<ñÓÎçÍ:Ëø3¶(¢ŠŸºâˆ"Ž>ãyû¶ó(Ïèk ªK4B5ÐÕÕñ®ÖÕ´¿ì~~ÔtZWÓ^¶ûyÆÞ?Ìë~•çÕ7ï/??ÙÞ¶èœ2Í¿ž¤Z»·k·rh@jjQÐÊ¡;©Gìäºéµ”¥¹e™Åñå`q„‹cÚ‡k‘Ëg–]Àš– ŸhÅjqÄ«ü4ŠÕâˆWùqM/ÕY Ù‡ÕüîýåÛ¹+‡Ãýg {Ûy=Ój±vyI[Q±åEÎèÑjɯ1ÍN5“ÕrnM‰ùX`u圊{I¨¤¬Gò³$`Éz„%s°´c.™7,°™#øózp3ç½ê¯áÜü߬iHÍö,†ÍÍÅf7D÷Û]ðßÅ«Át°¿8`aeÞ¤$¬åм}øk{|QÐí7Ç| €ëVÌüÆ€®«¦’0HµêT+sÐ'ÐÑõWo4Áùª ÁGUùàˆ|gŸ”²Uؿي´"o´1IÆ`5µ©nEhZÕ4É“õÁ”úe1ç@ú×]ô³ž¦ŸÊþ›ï/Cs77?ÆÍåÅõö¦û„ÅÙýûöüò§›ÍþËúl–»@´ѯ˜“µùä‹ÕJNÜwxÔrÂÕèÖ€ÉÖª„ Ñ€£Öª€ ÑÖ%h´h´V õëõÕ'¯–û3oIƒDM¤z÷ï¿yµ™øó§«íÍïãÍÖo¾½ìb‚~/^ø×g¾?ˆtÔDvxðþKþùã¼™N[N[9mÖ “ì'Ã-·Î %’0&ç¢îA1ÓxÛÞ‘¨]#¨îÒõú»k…£ØßWÉÙªóÑÞVWJWu{xU‘¿ŠýÚ(iòf~›`áf´A3Vï') šˆ®Ö£û‹ñ‚°M«SÓTÂ’T)x¢6´Ý{;ï›fçÚîï; áîÚªì}g»Ïòz#¸n¿z@þ2Ý& yõP3•7(zLIÞ0©ÿÈO«ÖIgBcí '(ÄVªnUÙ¶õþÍÜz¶$z]'«»\ŒB—c„ÆÇÊZ#¬oD¤t ñâê¶h^j“+Ëý†m éÔv”f<ƒ-ù”mL€ü§È2 ƒµ-Iíâ«mI`?I2ŒIm[uc¥p¦3+ZJºõWuë»õºÝ× ÜŠ{-B#©5U·lð¦[óF*•Ú¤||z´vJÌÈö6sªÀ¢ÊÜ1?×FÞ½'Åóï=ÑÖÔG”çÔ€ØÔG–çÔÆÔŽ}#Ü~Aýa›ÎûÊ7_þåÏß5+sØ¥vìSÒƒƒÉé/ð Ï0+Éš¨º\lj]ùcLMe©bëšê@ŽéòâzìÎÄéþ\|÷_,¥'>Pžò×%HŸ²8*ûËýÛ·o¾êÅk6Ÿî¾‡Ï®/7ŸÝ|¾{Ǿ5ƒùŽ eÉ«wúÝqñs¼êߌqºrà6w­èœ °:«“Ê>í¨«ÎÊ¢NMY<{0(KíšnÍ&oÚºî² ï­Oª5D&4šl÷ÿê‡E|ß-±kžúÀ»@¿:ýÎØ5w[åÓÍ~ÿ|ýf¿k>·m¬³\ðónÀë# ÷÷nGú$Ìê}ôI˜’> ú$Œ8â•4IñÒ®¼0 AÂd$úVïÎ"Œ.¼Øw|‹Ïîþ—üŒM®Ð'aÄÚ*4U˜MóÍh¢0³›(˜†3Ó±,_n@Ç‚Év,/7 ­ÁŒÚ˜ž 45Yr4h@·‚v+ðÆM šIè™q4¨“¥:TMp.VurÔ4Š‚÷.4äw7…voF+ +¯€zGw›_aÀ„ªÙÀ³!°èéxG}†€¯¦ãõ.›ŽvÔgønú¥õõðÌAÖ¼ÝìÔr*þÚñ-x·SGÛ'¶[fFK ¡5Nâ:kü´¤v²¦ë§ÆÐkaF½¿ÄbÐx]ŸÍZ× ãÃd$ðçlö‹ytbÆ]Ø ýÂd%ñŸ}aƒö“•Éç/làdž}+Tk@Wˆ™ê ™{\¶_AŸl&¢¾³‹‡N£nO·Üyn/«³¿hÒ Ú;Ì°½ƒ7(ð긇jtk¾ªþ“ ©oŠ4õMð7Y~ 3ŠtÂÌH(û›¬²ÿ³; ío²Òþl‡´ùMV›ÿ·逻Lön™‘NölŠ½²3Ê\=ðV6p`hóâ®làÉø÷‡: “Éè¦öKˆê,+“½.aÑ€tc™’n,®A0昇\àö3¼=µ  ¹¸Æ\Î`̇Ž¹n6×ìµ ´ÉèþÛóíÍÛë^:y{r½å÷ö,®ÉYÜéû\óëîC³ßØO“³Ÿý;ìn>™ñ `JM®D´ìÖ–4ÓÅÇt ßÍXvT_à @wš±l]­y6mt±ÅâG ×Íü?{׶#·­e¥2@Û‰OÄM‰—sÉÃÌûÌ)e ØÝvÛ™ ‚óñCV»/–X\›,±º}œÊIÓMQk߸Ö^ 9‹§8z*j£rÁÝtÀ^­t)¸³›T£5¡€Ö„Ò5U†,S‰qô¸è¥—‹´ÆÇÖ%ž¼ )‚¶=MÔy1Y‰*ÒZ=. ;uºi™Åœ˜µñèSÉA’rÚ%|ü}úšY‰ 0¹T²þ£Ï·ÀJT€q¥ _ íü P«”)lcæ±÷›76Á[‡‹üG <}‚eCšð5ÛèXjCÇbÚhÀ2R–«Ò¼6pû–ŸÊ”‡:€¤lyêÂÜQ€"¤lâìþ¤UéìѪ<˜Ö[kñ.n/¢zŠúkƒìÇÙDйŽíø¼PÞ-ÎjçÜãF;o>­‹YÇÖñbì B ›Ð'f°ògC*¸ÞÙ/Cç}?/¾3FuŸ–pGt̯߿¿ŽûôÔ}|†‰sïx£•‰s7Å=N5§©ìíÇa×)×Ì°âFqg¶yÍpâLªWI¯¹J¼IÏì¡c§ÉŒÖ«Å‹n¶Òy³ÈQô-ãÔuS»²†=tBhÙõ³óí.*‚qPBD#a–1v¾Û’ï~û5˜ ÷uRúà 05`è ƒ N.%êHçcá4 !è„\CŽ]ûªŒ]«ñ@ó‰ŸÏªO¨5`hÁFwÔœPÇ0kÒû!˜U7§ð?Öy5ó"…·“VóƒEùs¾¹† ¶‹\’ÏaÓ€I¡“LŠ‚ƒÂ/÷ìOw;õðÝýöå/5Ii±û‘apTgj@ÔÐâ’ÞhÀÈÐIe þìÀωR$Kq¦“BS‚eÏJ¿¬ ½–šàM \]VÑG>‡NhKäøˆ¯ÊøˆKh*EÖ», ¡© ø—Ëâú ²¡7*õ.Ëß»,ÿà²<ßeå½Qîxz—¤84×3 PåÐUŽ¢Ù؆–lQí²€2‡^+s<…Ëì/]#ô¡ûIKvZqþ‘‚ô'-k‹JÜ sÅÀ¯ÈSˆð•ßó Az”–­qâð´äNU|”¥‡QÌË»˜ í‹pЀB¤“¢‹#4 ñè ‰‡é:ùFWiŸh@ŽÑ5Ú'pbtö‰ÎbÍè®#o´uG#µœ½2Ó¤F!•}< +‹€õVèqì”÷cOã8ŒB/VŠÎ˜i°z$É~Q€nI®Ö¯Oàþ"Wo*ØôÜÂ2€×ë¼¾iA éuMŸáŸ½jÀ?Ó<¯¶W?;‡H{ÍGÚ?Û~à ùîg>D€NqU–…Ïæ<˜”—o>gêǭ̾c@ÐI2À¹©ú¹„ Z"°1ÃÀ%Ð*M@ãÎü$ŸP­¬¿VuP»¦C€+ U…*¸t 4-0j€NR2¼"¶ ÛßÑòV¥<®zGXZÕñ¹þu SèxP½£ó»8ºsÜaAåð<´>åXžÔšˆNÐDŠ è$ „?;ðEºy« hZ×níêiD×F4 è5iäôïP¼ÖÀèšô¤iñZ?£SùÂçâud2fù…\ÖŸ6À˜›Ö„^/‹+`þT|y—6l´|ÙeQÜ\í^¹²V:!kõ•k v¥ÍºjÄô€ð¤W„'î¬À"®B¼Ie[3}X“f!éœÊµ´“#¹¹]?©n½÷³¶“IXw\Yĵ7ƒN+mEÔ+TÆÑ$1Xi—!vÄ1Dî±üè›ÿýuþctò£©?l~¬ÙÖÖ·V_'tLŸf%îÜÛNËî%´ZWF–è'n"`ÙÁt—Ãq Sb:%•e÷LJªøø·c‰rŠëÌ|7ó§ßo®ŠÂ4MLWÃ0@uÄ$TG*+;ŸŸ’¿}Jþö)ùýŸRÞ½›®â¸ÓñÓ±3ó~4:LWÓ‘¶2à?†åa¹G7óâÕ‡‡ˆ|¼…“LG,ÉÞï8m˜®!äÃEÃW)»lÞÿ˜ˆ8_>¼5€ñc6Œ^ j{Ljš®÷ppÌZ „7)0½kf kÒ,¾œÞú~T*Ä—vÒ½ïýè—a¤NÌÞÙE/~:®Œv½÷bžl¸w£ÇN:éûŇ€w´–&¯'ÿ¨^ØÊ×7Ç ÷ÃS¸ ïM}ÿ,C\`û& Ûÿö‚\@/0t9l‰üC—Å–·7I¸ý‰ð™yE $Qó¬ó˜ûeÝ·ÓäýÞñ¾?ÞÃçã¥×¯ïæú×d½I"ëO/¯¸méÃ;)8 3¯oNàõY+jÞ"x¼¨zàôòåáŸÿä=V@T0ò4ܤyÿÙâ§vÖ; O½·ÂÈS§’¾®Ì+à„>Óª„ÙÅ”Ì |YBø%÷u­Iæ•Á¬µ^x“?” %´¬@R0I‘”æIꞸ_áý­_ôk¿èù~0LRew¿è ý"`K˜bÁ•¿üâñ± R¢å›ö‹€»bN Ç<úº2¯<×Yb/[LŸò]ܹSêË4Ckü"P`1}rÅQ³UiZÈb,¦¿ råXÈ^ŽÅ¤‹•±ø‹á‹¿T”±Ü‹)–{a^˜ì„ˆÊs.cͳÑ\aÚ@ 3+RwV`1‡š³1@o2CMüžû3ÊØ“NÊY)×+iå…˜ ÍÊY;s¬…•EÆ@«2öàGeÍ4,Bjq½tÆô#‰ÉùÅ)Seì›'-crƒI $>ÍÊØ7Ü2©–Pw#_sp:̆ÓÑ°Œ ø&ÁçhZƤ “V„hy¸õ(Ö¿ù1뢫Ã$´%‡›UIþõÃO^•TçcÂ$ûFY€œ`Ö"¼Iß/’˜Ø¡¾¸&É5x¦0ÌF•âaÃ>ÔÊ^?üäUIÙ pŒnŸøÊ‚©¡,@Y0—¤,@Y0—¤,<$~7/^Ý\&ñ£[&~€÷`L›ÄŒùº?@Ÿ0¦2ñücª?Ày0¦&ñ cj¿¬š#ñ³³÷wƒÒ~œU³_F9ú¾×cOKL×ÃÊ¢$B«ÄoVzÒÓ"'¡ÆiÐ!ýâêá#x0á1Ÿ8õ" &!¢péäïCÃŽîÜĨ3˜„:÷™ZÙ³‘}h˜Zú‰IÐOš¦–€Gb’<’KEêŠ"u èvC÷H§–jRK ø6ÁïØ9R·€‘ak02ì~Œ æzò±ƒí’‘gºaóŽÎv)G·M-?Ô¤–ð6lWÖ*³jÃæ ³]'x“æ-¬å"ÎO-- IØ®¦‡ÉùgŠ7_*^&Í´€caECíW ˆV4Ñ~µ€©aj)Ï8Í´€#bÅÚðB ¤TìJJ…;+0¯¢"#´@ÉÊŠr˜Íâæif/g%)Õ9ë•XÆ~‘]7/½™{#Ôr\5Th5‹ ÁÉN9ãÜ2*%…%Ó»9X¸ÅÙùQÿÒkß(¹l—‘…5ór2 ödÿÜç_;=³€2a7”‰vé™<›à9´LÏ,`0Ø$ƒ!l×URó}I&àý6 ïgaC-ì¬ûèG?ü|x;N_Ä¥rÕÛ$¨~ß° ím {›Ù7ͺ0ß&ùwïö!Wù¾$AH|›(Ú‡~»ýí>ü¼=#Ã_(ˆã­_>×O]ÅËÏJ|ÄIù²‘çf+ábÀ$R©Œdãl%¬ΤÊEÌVâÔÙÙJ˜Ê|Äþ»Eâ«Y•f+ar`©T½ŠyY`12»f+á ÀF&.Ÿ­ä q¼.[É“âxM¶’§#Äñ ›'ÄñšIÙ‘™²ÎcÀäÛëßè°ü~å>…7|@2\³²ÙÊ]#æ©Ÿ§¼PR›ÁõföÞMäfíÆ©¿Í $¯Ù  ùñÍŸó¯%¸F¼Ì·oãc}`ãì?ÏψãŒô#õ ¯BìÅÞÇÀ~Ëšx6Ϥˆã«;ûã"ò×°å‰q¼fáÀZnäN;•ÿûŸ7oïc›qW„»ŒQFüççƒøÇᇮ˜: ¢ËSâxÅÝæ) qœ}·+|ê‹«Ï‚ ¿Dˆô¯¸/5ÏVˆã5^%Oˆã/ }e”«œÉÊLlØ¢&)Iv±e†UCÈ"Çãʆ’rU±!õ:XL%&/;­Æy1š&¢ÞI=™EõHÇÇ©ß\ý:…xýWdX[6· lÚDÇñÓŸf…(Æ—ÕªòÉãøåjUùnæq|¯ZÛâì6ÜÕ¥¸†+ߊ=Ž×˜ û¨þç“?g.M4Ü2W†špeáÊp¹fªáb ®.ÙL•»-b=%úˆ7WÑC¼¸/¢üx ö›¡×Ю‰ªèòœ‚8Þ¤Š‘‡åÇñú*ÆÔòÈþ8^WkÈ#áãxMT˜‡ÂÇñ S’‡ÇñšIÑËÁÆWµÑíUlÈÂÇņÁŽ7Òèa 1çäÝ`—Ö,£JDkïL?u±/óèÍnÏ•Ÿsµ!wã¨6äqïq¼âë‘GµÇñó« y¨y¯Y8°—ÕÂjÃO?‡IÊê yz¯¹O`i7 ܰ㊻`•W*ÜgÌrEcÑeqÇŒ²Âìµ!Û+/Ý ÃÏçÞLr˜G¢yÒƒº5«¦¤av±ÉTKO³±,.äÔ›°ªÑ7½“n\N”  m[WȬãxA]á+*,äÞqür……<Ö;Ž?ÇÂBYˆPZYÈCÕãx•~87•…šÍ/-äÁðq¼âAçñíqü‚¥…<.>ŽU¥ѱ_-ˆjøüŠÚBNÇ›Ôò(ú8þUÕòü8^W[È£íãxMh˜ÓÇñ[Œ¶­Hž@³‹.Sùz¨-¼úáÕ~Ÿ’m.j^t{¿þë\,÷×á;+&ãÛý[;þ÷Ç“¼pýy›,ÖøüëßóóSÙ äm«¨áˆ¼HA¯˜4 ÷f¤Vý`Ã…ûQ«QFL¿»:CrQ“êÝqe‚ R«²~^³XfcEÈæÂ_ÝØ÷šå$å°,°òQ^5¨¡4…勶Ó7Çh/6@ûvùŽ {‘ÙWæ;ÌõäcQ¯_Bâ.ˆ°ÿŸ>¾1~$è^Ô€îÝ‹ ƒîÝ‹$è¾ìáû‡‡Ï΋€Ý Qv$½X#é[æE ð~^Ä\1ˆ(ÕV‚½WbÊåÞ½?æZâow¨xŠ ø[X÷%SK Ó.pù‚š¤]€ñ‘v1WŒeRBáâ ~±AðóR/pùb…ËçÎ Œ ÕA€¡²¢â$²¸XF”b0'—a1]§7Ùð_ã²Q̺Ÿìm”+y]rk¢ÜNÑÒÓ2*r“qF9RV ¾›=y£í#±«ª¾=ßF” €Ì¢Èü¥sø®E¢òèíÜ>Äã½27<€F‹¾†‰"6Z¬Ûµó&n»¯`¢ˆl—aÆ^)a\l¾4¸ðn\øú›ˆÚ ÿçI/öve%m˾ð‹VsþŽ}t‡Î-ó¼^§GêçÉŒ±¼p·[Þ_WÑæŸ Ý\ä›%ÇñËežE-(ꦙ'€7‹ ¼¹4ùù‚„Îüfœ³jJ[),†}r~vÚ @Æ"2.~ò¾øɃ¶æ+ÌW\æ+ÌW\æË\1)†2ú}"çüøÛÕÃùÞËÂ- ¼‚á­H6W¨â.aZ`5‹ZiW%›š+TŠ}ùd`}Ŧí53Jp_¡j€eà}ÅïË›X¿u»gÖ¤Yd#ö$;ÈŽÆYj?Ns§m/­—EYk½¨ãÊt Z­ðHe^§&kUlN«ÝÒOJJåÇAêÉ~™lþö5Çž)4‡k¼Sì p“Bo TMcO ¾z{P{¾-qgĺA 4páz7Øo=ølSÖôdìYôä³Ý¯ã¢j2ÿ|è8~ÁØ3ßg9Ž?·Ø3ß9Žï{–m`]MÃ<x…iÒG¬®(ÂêVÅž+MœŸ"öX[±ÁÚ2£D€W¶ªî «¢¢!sø%`ýÖÀSÞ¤çÖ=2~éæ£8;ÐvrÅâüäÍÜß®¬]ÝSz?X¯Ü@vžÂÿXçÕ<Ì‹ÞNZ=ê¾ðç|sýŸ0†´é˜Û.ø$€¤î²…Oø?êö)|Û@ôQ ¢¢ºË–=©Ë»ì0¾KèYôÜóŽ<Œ×<÷¼›ã— <©Ë{ì0þÌOêòÎ;Œïx–l˜lÇìCovh3M¢IÉ“@ÏfÚôlÞ;ì$ ¥D§æ'; `Kiƒ-åˆ0¢$jJžžTƒð$€ð$QQò¤,®ŒCÐÕË0’›Hw‹Óäå(¤GçF}ï!^¤YØ9x=ö£$b¼ÉMÖ.Vy߇ØÏ-^?ÒÆz†›‚¨ ñhƒÄkuL%0yM£N¾£DûÜʨóì–{ì¥àÚ>€$ª(ž€Ò¦“nã IîS<Ýã¶{Ó a0Õ4 &Ð0˜Ö ƒ›ÆÌ Ñ0å ?MÌœmCW|v±Ö½{ÿëÇ7_pË"gÐz—dÂ-–»´n¹»Sä šòÒ¦)ïî‘3hÙKòYl `giƒeƸ¨JU@U@UªªªR P•ÎªNc§•ÒršÙE[µ!výÜ““óíÊÚl…Õ}OZÌV£Sd…ô“å°˜~˜bû.r~÷•‡Î©JDª@ªÒ…‘ªª´RuçÐù5;¢ Wª½½Ò…A¯@¯´èõIbç‚W ‘”-”-]eKeKÏeKeKç£l·ÁóëÂè@m©%Ô–Ô–Ú@m @m©9Ô–Ô–žÔ–Ô–*¡¶ ¶Tµ%µ¥¨-¨-Õ@m)‹àdDϽžXúŘ…ú¥óˆ¥[#¥Ô3¹Ûè9Â@[Amµ•šE¯ÜÔMZ™ÑNöƒbû”ØÞé.zÏ!l¿émUÍ|˜àµ' ¨ÛÏ·@$%Ž¥ 8¶a*0±¤K$ªwHœ–pÚ »~)ßß·K)òÒ\K¦‚]NKfŸlŒÈ\-™³²±û®)ßß7M){Àe¯¶¼Iƒ]aaÛØùJ|äë¥l—¥M¿Û’ãë{÷õk²ƒ ÷-»køiTyŒ µ´î9»SŒ ²TÔ•¶*ƘZ²©3µËÇؤKvm…™Ñ0Àé’­‘_#Ð}•ÖÝWy“+¸îªÊ›X3›±fÏ &&©d9B!ùf˜ÿ}ûÝ;û^Hät+ÌÂf˜š±þ?{W#Éq×Ϙ$öbƒ¥!}‹ç‹÷¶>»«Î·G|>:Ÿ­ø,ÇR¬u}îŽ=;³7Ó³w]dˆòGRK‘ŒxˆxH|Ë*߯);Ð *›“Ä5n¼9ž:ugæ{cvÔc«’‹§CUñ$“_ö]czÂyàws«·œSE%'¡{‘“’½êOt/;Ï1Cô{_å¹yÏ<÷B—,Ä~XÎB P Ögu7gap†x³áä q,åchk+‚¶}žÑŸ·ý,ñ¾Qã£iãc,H¢ÔŒ šP©f¹k,K¨ßA¯¾ñ »ºëPg_Í€ÉÀ÷Øi•èlVçðpiß–èp?Îλñm¹{ÞÏAwcîTgL 1ÚRàzœ±0 ¥…À)†z¬²gîïÇ5=yNåÚK¡Ú~^J¢©âèPÖp‹þÎY&ÕGòš3©eT°™Ä)«4;pá]´œIYl`È£ %î-„R• JÍEÎt¼¶èRÂ%¦HK¢±¡\ õ;$*QAƒµ«`ª™¡ê‹7¨Ë™ý´CqfÜÈWíÜ~#Þ‘ÊyMò³Ë!°ûƒÒˆUŠø­ø”‚¸ñD°QAÊ¿«œV¹)j”Ï#|ñŒ€ ﮇ/:ÜÌž²fÜ)o0Á¥aFp Þ át€ÎQ …¡Æ(( `ٞƼ©Ç*]¥XãJgœÉ­ƒüqï“âî[r9»žîíOR“qÌÁEgvFF¤f쟾·çl•LhGFCë|%1Б씣ÜgØMÕå-8ZŸÞœ£á)åÍ4ß^‡ÆöF·Ö6á3ÅFÚ´?Á*¦ql‘q®?––K¨…$~ãzì4EùQUŠ/×MCÆTVþŒÚ£èìÙ<øXT#þV8§\æyNÅ\—C‚â’'·aIý6Šaè–ŒÍF„+ÜÉ€È7ërDd›hNGD¹×eP󻆉‰BFjôR°X0$ªDR'&hDÔc•“1ãÙ|åöxâ\¢Qjj†H•#‹ëÏ3i17Úõòì€×©à±² /¿>Ù®¹—ß*q¯©—?sòç:tòAéä·1WëOøhÞ]CO i*,ŽÃcÌÆÓùù[ ¿®² ÅÉ,A±C.AB²š8&œkåšSŒœg‘z¬RENdˆBÈ#M¸´`W9 “qn£kƘ•N~ÌB|üYÅ$ʉfA cY‚$B>ô$™‰ ‹£Ôa•œè}Á¸‹mó6Zͬìl`ÍW]îtT¹”hfñðQÿ€ué8@@Kýá¯[M˜pf ÃÆG f p¦§J€P„PÀƒ†Y=Ö,h¢FÆÇ~ƒ-Ó:÷bŽ37¬>Ýé¬> ´ ŠQÚ&(;½b µÐ™£FD˜0Z0§VܘP†0«ká™› \÷è‚ ÛáÅff0`mÌ`§s1Jn¸°B:çÚ 4hO˜Ù¾MÍíŠZ¬ÒÕžô–+ýÁj±³k±”æGÚXõÞcxöHCÎeå>“\á˜2û ²¼Êcˆ/³Y|™µ‰/[‰bK „ðGgBa€kgj  aÐ\=V5£Æ£ÔÉo͹uÆûŠy–éùºÍØ𫪦~Ux¸Ÿ  ™ÓúÔ:MjE9Ó˜;Ñä]uÚ(â\†ûk±úýþp§V¥"í©hª“¦UÎøÕëQöçÉ­ýyâd¦0â€V¼iˆìpÒãòhçH'¼p¤“6ÓnT‹˜3éì LñG°b̹]P*m œõXeD­?Ž|lu;D|Vj5‹5ŒŽi9+œ×&Î;#¢MW¶Ë1Ìâ22Äâ6‘¡ú怨]ûdè¦îwµÞbÎnÊe,S†WIÞ'wÅ`' Íòw‡¶ímwuÍ3à§â£LTsçjs=ܹ¶y£™sKÛŸ¾à‡5a–Þ†mœ…ú3jŒÎÀón›MBšÇ6 ¹u “Í&!a+Ó5E’9a×ù%Lܘ€ ÕX9Õ¤‚LÌZ¬R&Vêõ»RVþÌÓW®>µ½b”´‹*µLA¥âq—m䥊QL„a $ÀJ c­¼w«TPC×cU%P À:º·u¥D¦š"Ò©-ñÌ Åmly6q‚!—ÐHVTÀ˜®\ßÍv0jÌŽz¬¢ …pÕ¾3w¦~×N'–`eÞ¶U~U’@­×6VDqŒ¡Õ ‚ƒ&Èù­ÇªZ\A:þ8Õ{—Îïl¾Í5vÛHá¶í 5Ž[%7"Äâp DL糄$/îb¡`}PU²0S/Ûé­Q9«4Í7Y‘nr¼š))3‹Ýe›ôo¨ÂÒµUK¿ŒG b¥% 8”þ]‹U 7’ØãJ°3¸Ÿî|—Î2Âi«Œp ä bï©`…5±:N¸àÜçŒHѯǺ{J¡Æª^2q£ÙDÄ£NDÜpœËžz³¨d»l“Íh$1VÅÎhà £Š0£µ’H™D I‚XW•M Ö…ŒïžHDÇ:ˆ+'ÜÆ—TÞsOŒ¡ÖÄع‚*!@9ï]¸ö€ÔÔõXý~mvï´ ç-«w¨!óÎïºó¢ÛKºtË´[Rj}wÙ*k(áA§I™BRH9æ–R ,C(,ɽ«²„dÛÜ*D—uî¡|É$K§Q=^º5 oãÖȱF‰´XÂØù‰‰3x…¶š"B¡AnM=ÖéÞrzúFÓ êÇ0g]dÇŸqà£G£ñDí:ÇU8Çc?‘}éÿQ§þ+ã¥øc¼ôC<¡Æ:–hƒ0`k Œ!D%1º«4zÇJ lóÙ´¼|½\eçª|ì îزAÉ Úð$qƒÄ `‚‘3 ÆR;ýÁ™RBP[¨Çª˜Æak^áˆ3 !ŽìÔ€îÔŸqi‚Ÿ F€Bk‘_ä)Üçà‰eØ:ºz¬y¯1ØÍü ]ÌÙRÒj©‚ÄJ`Í$Kh‚%÷Ç6YDc¬¶² ³«LûÎŒU«{%›¯Õ$#þ^ÍuÆ3S9n#—DL*K X¢¹I —j®)w¢_å-Ôc•bf<îí„;ó ÷.÷±K%³õU­’ œ¤µ9á.`b9†€1IybüÉWa,ªÅªäÅ…©Ž¼Â½Vg»U -ƒf m3«?C¼9³ÂÏ#ofyùÒ]­Eìv០•ò ÷ æw–ª!î3‚{çÑcp†*1’ ”€SU*ˆaMè¦Úú®p7ëÞv:_÷VY [­5Šr›PŠë®Zi¡ H’&J@ƒmД@=VéÞ›ð|ú²Î½Ó)çÓÇåü»læ´Q…A¬œã`EìleŽQ†nUõX¥š†Ìí»ÒÍ|W𨮾ƒÈæm~¦ÛyŽÊ5EµZS„µä@'þ C•¶cîš]Ò ,úz¬r€Löö[å¥ÍW\ž˜Ñ¥!žI®ùNolDv$vü°66.Vn».’º»c{-»3NÅ(ìp˜šQ´ï¯³ŸvG±ùOë›®¥µ™ñøÐ/Œ½»pqí30#‘×Dƒè9÷÷ç'ý%FŸ'ñyʲ‰‹ç÷ÍàE5Üäíhº9kñÞ»iº~sóæÍ›çôðÖí387ílöÚÜšÆV×.ôövGjk½¨±?ØYD?-ï8êײ]Cá9v.v—9ÉîVþJþW9Ô·ý·ÈŵS«?¾LYáM› ½ÁPÿàšŠŸâ¿aBAõ;ûà8>å £R£SÎIr}æTº#aùgâûM’bœ'ý¥åê~ÿ?úùÕ®=óðÚûnòð•g/Ö}?âþþØuÿþùïýÄ÷õÇW.?qýÖ}ÿü­Ó×îâïþÛO}í­o?ðùßùî·ziï3¯=ò>íýåÇ_ûÇGvzðK÷ŸúØ©_|÷åäÕO>(ßùÖOÞ÷+¿ö©ýí_Úÿ|OÿÉ+o¾OþÞoªÿú¡·~áÍ>ñ/¿ûïÿ~`ë^ýÊ/¿óÍþÒ/=¸ö£÷]ùÓ/o]úØüÆ›—ÞþúãøÀßøæÚË¿ÿÞµÏÜþÊ{ñ×ä;ÿÝû?òÕWÿì^ù§ï¼sç¹/Þÿêûw등xè‹ÿñQý7oýí+ßûÈÿüîůݹó#ô‡î¯.þàû~ëÒúýoÿËϾíßöÊS×.ýÒk_úàÚûÃö™ÿ;ý¡ýñ¶ß–|»ŸI©.ž±züC‚¨ŒìÆ‚=ÿ÷âsáôå矼þÊ OEžÛÑ /]ºzåÉh}csóeüäææåë—£Ï={ý¹«Ná€èúH Æ™’ýÍͧ®­GU5wgîúg7oy,è+O/7ÒJÍs:Õ^ùe¼µ×Œ·À8w’çµ³²Fh÷µgR§_]Ù scÒ;ØZ276®û]¢ £ÀÙ%æVšW~ÜO¶ŽMºõÒõ§7X¦>ïùÜÆKOlø¸‘HýVwœ+OmñY|[ßÜ:Ž*å.çÚ9×ÊY…´—öÍÅÂ>8=“­ ›ùkú½ÁSS!r|NÇëÑÈôý©·ûf¼kLºùݯ§¯ã xä±õöÓê/¯‹‘ßš¯ß˜˜Ñís¯M³™ÿÒ¬¢¾=›üD‚õ+ôÖI#’£Ìb™òojšx Ò[Íép=7çô0 S¶7<𓯽±ßÅÊ iÔóvÚpì¬1gdM}:·íJߦbd„ï*iæÃ)Óï÷…ê v¶ÖÁzöÿ}g$Mÿq-ºæÔ¸‹Q”½€ë†¦·³›žh¼ëq_Èý¨‹§Õ7úƺ"à5{y™¨$d4|ݵ_nÐÌ÷%ª;÷W Nö¤·<Á9~®Øê;ÌÍ`‘jOâf:Ê¿ ã.{ËÂPÎ `3Бoç9ó×ÿ0³g] ÎuÕ¬L…þ8 oÂõÒ¾w=3Å肳gwû½q:ýÁýÔïͼ—ª›½ïÅçDo¿ÿ b§8{(7ù]ÅE¾ý<óÌxèZy» ˆ¸åßzã²HENÌ‹éh¢ÒÉhZñÆj2e[¿—èÞ?š§îig!Ô…ÍI?gfÁÕùöFsí|1%ù;^í•Ç"½ÝÔ˜C-%X‹7ÄGzÃEÔ<ÑïáÅ2 g¾ÍŠ“Xšt­Å‹º9¯†œGÜ®‘È\#áv4{³ŸÎFâ¶(h!o–Y€²Š# Œ3G*pT0Ž®âèGã˜*Ž)pI¦9œ*ÎN³ŒÓ«âô œÞQû÷Ô‚Ÿâ–}tŸY‚3¨â œA0Î~g¿ÀÙÆUqFÎ(g\Å8A ÃI«8i³Bð.Á™Tq&Î$ç ŠsPà4J•6gœÍ¬¬¢ÃMgÝœÊÌš3Íqå°#1P»Þ2öRmÖïÜ7¢~´áì@WØ?ПgS>ºv¾r*ˆé/<¤>¥3›KôZËß-@¾‚¾Ñ#ê×ð/}jö„úÜÞEOð³´ýáp?Ëš_ùœ¤L`*&Š#éÓÀü^~l")Fiåw#pxÓ=¶…áí.#ÜYïÓŒt.u µ Z£Q’­îP ÔŽ ’†’Þo5éÛÉ×X %¡–È H)ÇLùÝr)H0F·|C¼åä'ƒ´é>”HD1c\˜"軦DKCÖ(”ô†xKI÷A‰f”“D+×#…I$ÁÚpEž0†¨OÍ £¼!ÞRÊ͉è7#݇Þ0u"&ö 6$¶4Š!n ,”ô†x«IoÞÝc˜P¿^5±ð'Å ;ùÉ%0 Fw÷†xKÉÏ6ªoF¹FQ«0b;Á8‡Ô]è„pl åÍð–RÞkÞÝ¥‰O+n°æœJÀ‰”€Zâ)ÃHoˆ·œtgŒ¬sÊ›‘N0B(ñÚVˆX%ˆá\S§Í nù†xKÉŸ&®¤½Ô&@¨ RVèYŒ€ÁÄ?J[+çžµ‚ö$ o©E0M'mD»8#Ê 5ˆÆ 0H¬q¦ŽŒ±¹í ñ–ÓžmîݨË ñ;ô»gXÉWÒ=URèŸga°QÐoi—I‡Ûyîî¸YÓc'’$6æ -òëü)I,5dáó2«üCîæß'áî“Ï¡ÏÂø_w¡¿ìSÿ£“Cñ¿Áø$þw/>'ñ¿“øßIüï$þwÿ;‰ÿ}¸âaÔ­Œþ?Šÿ=ô×AÔ¯ƒ€_±¾.Â|U[@؈‚„Çì 4¸W…Ø+ öB :,vSì œØA$±ƒ bñÃ{:œ[AàìDÙª7Ö/>kFÆ[{"òR.;¼°ßl!˜+Wö¸Kí—ø ãL(÷å9L§Â7ºÙKw#o¯Ž%ÙJÞLGú«Û‘4Ù-éðü”î“æIó$‚yÁ<‰`žD0O"˜'ÌN#Ž "iAÑï³æ~#¢]#è s3Øp¤ÜèÒÐr” &ëøÛ$LÚ*¬Ù(Övm&mÖlá ». “6!ZË(tÌD‚l„ÔVDýᣱӼµbç${‹=ùá3ÿõCÅÝOÕÄ!ø_öžµ¹qÉ|ž_ÁUªîfRc›’pf\•Ëd³¹Jr©ì¤n¯®®\xÚJdI+Rãøß_7@JÔË"eÉ–gíš‘e>îF?Ð €²”/­ÿ†ø€¾äãç%ÿû8ù_9™È»âô:ÂäLô«uvb‡Ú¾äƒ_òÁ/ùà—|ðQäƒ÷–ÿmöç´êõ¬CpÁÿí®¦Ñ÷ìÀÞô.Öyñ¦?¹4I¢Ó„s¡”UVgŽÇRäF劲 ÝpˆšaØ¥ aòœkCYüé˨¤†óœW5ñÇNà@̉`îpFrër­„e-xt¥!]µRÓ¸]²% ûÞL¶ªËÅôæFNîP+Öœþrh 'þ ƒDÔ àñƒðÐäëÆKUªåäÆ¢¾‚·æ‰ïucgþl#Õ./–GÁB¼_N…kí)[““ ïIJ½z7^Ü‚‹¦ÍM«zßêlR¸ ÖßØp¼"˜$u§[ã¹Ñ ­„ž«>ûUNš½ òVEÐ@ ß÷pkékZ?s5MÇ5?ßÕNÈ2×|¼ºÂºkzá F0†£~ioΫ–g€‹?‚9Ãȯ¸LÐþõp?<ÿ§7Ð…o¡6aþ _ßS£²mÒGóuXh¹ù‚9Clý¿×wz Ôlb€UæòàlZ'žOóÁ²•ARÅ…åN3¡Seð@>žf’˜ÔÒŒI¶+´¢Š“¹²OÆWÑæ—-ú9Gâ²l#I×ZzÖ°)#ÎØ\P©ñL…Œ‚5b™6œ1—S…ÆGgSôÕAµ½§ F[1ª+ñŽn˜/Ú7?ÆFnû Ï,÷"µ±ÌÏ<Õ6ÏT¬r&éÏíì.=¸Çãa$`+¶ ðy!/ŽÕÆ’›gž b~§Ê7Û­#¢˜N³Ø𲙯R3ÂüE1–O·cÛ ù£°t;7»RøAÜL“„å\Q.‰ LhH;ƒ çvâf8â0üÜŠoƒÞós,¢×OÃÉŽÔ}'µ$ xÐ#ØÇ Î1aLãL&‰Êã8yªD,¶w¾)˜{ R$õ«íœìJ݇pR$9µ6v¤„&B‰ÔjÂjÝjvó¹ž '·w¾Æüì”èõvv¥ëCx˜ˆ 7Ö°ÉqÆ2…Õys:‹S»›^=˜•ÜŽmƒèXËó„:µ+eÂÅœò$éHbj<å‚;, 4–ÊI¹›ÿú\FâöÎ7Ððå˜O(]9õ ©à™`\ 7.cÖ]Û˜ÆNhÌ`rf©Gå0\ÜŠlƒØ¾Êð`\|"wº+»$è0#sëTž+Ç­pÚijc•±Ï9Ý£ÂHgÅÈŽÅ©T,K!ä<¡™K¨S„QehåýTõD‡Ô[{ßœëšU8=¥Úèȯ‡È817„åÂYêðFeŠ¥"£Ô¦j·ÀùPjc;² bW§¤Hi@ßFÁQßÎЮD~Cc‘™Dsîtê’˜ÊDqfœ ÑL©t7/œm}žnÇ·Aü+‹Õøå“ÑÍeÿÀÞÎÙ®Ô~gñp: -Y³Ô@؇E¢àx‚Hlåé±qv;¾›9‹3½ämÛÛ•ä ά¶R–8+cî,gš'ÎdÖN”Möj¥“¤¢‰5q¬ ØÇ”*Æiœ°œjÍOg'…¢ýÚéíýoNt×µ ³»R·kÖãÕ¦´E•~Œ>ŒôOV’¥?/êšú²€êæ2È6 _/ÝȬWBÔ[¹:žŒÊѼre95J¥ª»x2ÿ#T_-?û°,ÙW‡p¶«*­é³y'– µ–hãO5ó•óã´"YâZV{žË‡kÅäBøÃ0±>KZ¾=¯«À—O}-ÃbÉÉ&i‘l}®"²]BvL^?¥„r Ù wê”hÅÓÂM}:©ªÏ{÷Ñ"[ýk¯×\¬a¡F¿Aé<ôt×=ÍW§Ú›‹ZäáëÛh³„ÞGñ{×»XGŠv”XŒÕZaŽn÷c½’Ìk…xð*á˺·¡¿Û7»°úFW½jgIàëÝΫ*¸zˆÃ=ÜÈahog»6 šÂê9,K3 æÌ`BXFaÊ‹_ð»Ç ¤þ|gL¨ÁnŽÝúùW5‘–©mú |þ·?ü¿e÷°Á‹Zô+2}<Ã¥ÊfL'«ÿnF¦ïîN£†»õVQl-6©õïhÀ½5ÄlsSx©±™<øbJãåb°À¨je@4±@ža`دþûœ[¿/4…íÈw,Å’Ë·Ñ ‰n¬‘LF“ÐJh¤«}ãËöá"wøhgàøZ§›n|1+1-ºØÙ|a2ïü<ÌÜ7û B,‚ðÅð îzÒR¶I]΀uñõZ$žÎ*ÀŽFË œÏÇÎÏ”Âf³±'k·É^¨i€:¨´=0©X‰7¾ëE¯q9ŒÆ#gû‹oüAÃ&wÊÈ` ôLg£N;NëRw¤*)_gl<Å¢•¿Yn>0Çײ¯ârºWÕLs‡àã3WÍ{RË[tü*u²¦òg£Ö̯k=ábýœ×bmlH‹â½§³!³ãÑÑù¡L²«šÆ‘ñäaÍq™«g%yÙÙdö|áeTpXŠ´Î¦Í­Âë¯ÂÅ7˜ =ôÚó5~¾^}5¸ƒçÍhZ¾9ãĸaú<η׸Ûv¼?t£ÉŸ Š®¥ß²OÙ@»¿¨e€ç›mgsl ƒ >Ù®à‹ÅºÏj+§ÎQÁöú‘£™«ó<ÏÝ‹'/ƨ@Ÿ«a2¸É2ÔQ('P‘Á1/oG+J â¤J@“èueFNnû…}ó6rrP€c÷'xå4úØl¥@«Sô MÀ‹(àY¡0š˜03 üÜîÎà@õ¼®G·ö¨Ù `Òw}nlxòfZ”¨ákœÄLápZ0R@s](´sDZƒ mÚÒÜ~‚?‚¼”ÄsDÒûÅ'nŠÎ^'èNБ— ºÎtG½µ(.?žè ñŸ»­Š;O·Mö o†ÀÅÏ0øI~€3šÜùÝé „Y§ÌIÏ¿…ðgÏóq·ðO‚ ÷±ë"Pê >^Ôä³T“-j1ŸNM†:˦¢\©eý|´æó¬gx†Qͪ m² aîžôS^ó2«þ';ŒúeшŽ#B8†ûêöÌxR6š{ºzòoWå×µº=Xö>! àáãh­ÞåÝ[Ô~±9ÁÇ^ ÊK©Ù¬Š¥ÝíJ Ä¿¬EY){ŒB°#°* 4|<½U9º‚®û"ÏtNÿ%ÿbw ªö“QŸY׎X¤qu~Üvýœ°•®º¬yRM¾ÚËWTÎóëätP^NìUFÜ]wsÐbÃã3{ZŸXô< A…ëÆ5¤UaA(3¨Š ¼ûY—luPÎ ‹ ¤f°¸²ÈÇ•háN S[`1œŸl,9Z.˜Õ6øvw´!M¨€5Uy·¦Â1¬°ìñáe|÷º5|¼8Ïç<ïÉnñœ»:â÷ØŒN+z¶oâütZS&_E+öóÉG=žÖ®(w°%-a·ÃèuP©Öø‰#7;ñÏ’óµÓ~îåH¦Šö¿À¤³™©(‡d—`06j’ÍÏ°=ÊOïÍÂÇgn[eg¶â7'µ™–ýÁe!ÅBÁMy¤ež÷ãËÄj QÙrf__ú1p9û™ÞËdsÐWÝ N‹½æ?[7ßÛè‡X¯jGÿÎ…iÃñ´|lƒãûºy¡Œô¬j[,˜Û=ºîFÌÉÒ A¿X£8ýúÐFq=šL­€£ÑppáÂú¥‚=\É8×V O;V{¨TxGá ÝÚ,†7* Vh£¯#¿ c$‚›„3Ž*ó|ƒ;±e…v%g cºÐÍ*3Ë‚«XÖó· T t¸Å´fl”µA†g£…U—`-"{4ÅèÜ“Ï~'œ½™âCOý­šs’Ä sŽpÙ˜úëæœ,à #æw€h±§øñ™ï‡ì%¿Ívu A»{ êmM!Eõ“ÍüÑB€T[çP~VÝ„ák Âņ]ùMª/@„æƉCHj=šÔɨP¹^[çºuy0ñ=?Ø›ÝòG“ûu˜ œ.ÌUNonªÅµÏ+Â~²?9#þAÞ ¬u¼¼JyÏkXSåðñbZfZÓlÅÊd|Q^U'Ö·±Ši¾Š]w~¾ìbÓ5y²ŠüÈ^.äíîEs5FÈ2 6Áñü$ðú4ëp8^)J #ÑFè‚Žñ»¿u=Û<Üê)1fb‹béÆÅ»ýš‹WßW0ÐD?Áÿÿœ"šE4&<"ì·íþ3ýy÷—ÿõíÇÿùå»YýòÛüø÷Qïäìì¿Ù·gg>~ˆþñ·?ýƒ+Ž>Nä0„ÑrpvöÝϽ¨9¤o™Í=ûa|¹úzR6Þ<5¥Áîüóf0,Þ¯C„ámÿ,„2ð üÐ%ðì‰ýç´ÿé}ïÛj¿ <Ó W+À÷=téÂË_ãDWaË÷¿}üëIîUÅ œüöÍÉ·£›±,ûà–4àüðÝ{1'ö\Ù¢pCõ܇ ‰‚ò/”ýœZžG߇¡ž¿ñê8Tjœ!ðŠ¢îÎ|Ÿòn`‹kkË^„~~Õ|!zÒ—Í;¿ËO2\­TåïÿœÚÉÝéïþ0êp§Ý‹ænXy^ÅòÛ |kMÜ åÈk犕FcÀp *3ŠpƒÏ‰½}²Á•‡‡Þbr¾6iT³\5ý—`Çfp¦à@K wp|Ñ©K fþ}/îù¿Ç`ª¿Áõ|WlÐŽ|ðpœ+;x:þóë^ð£M}³zýd`<Ÿr{ž‰fˆ@ú;Ð/øË5óñ‰Êâ© ú²ÚÞE|*NÁÄÛ`°íQVŽ3üª ÙBÈŒ=n¬öÚo˜z¼1·Ý@ÁQõÏ4ðÊO“Ñ-éÕ%³Ž¦ƒÆÕA¿(çñö 1³ñMcîû{ñ8ä¡ÿ¿È+[õ2‚/®ƒáF_g¼èçÙå6@ä$ {½ãƒ,e@æï³]Ž6C«{¬§p ËÞ::û‹Øý¯¬õîl:¨bŠ«‹ô¦ ô¦ ¾“ÐÇá­]zW9 Pgl‡²zØ »oƒ6BQ{88O°H³zåA(¨ê TGëìF¤dH¬£4‰òeX+)k´d—N©&UƒP]@è&]ƒÐ]@˜&Sƒ0]@Ø&[ƒh¥€fbÒáj® ˆ«&ˆ«ÄUý&ˆ~ ¢ßÄ  b&®†ÌMÄM ⦠ˆaÄ°1ìbÜ1®AŒ»€˜4ALj“èÉË…aWÔ »é’&ˆ²qö^1m‚˜Ö ¦]@|j‚øTƒøÔFŸ5&"À¯›;h5ñªÉ‰¥É{ôÕ`¤ÿè]ü sz˜bPËù,é`¾Abñv¶l¾œ¸Ã/\¨"Ì´T§(RE-²Ìæä¬}’®4r[ö`×™¼ Jણ3Y)¬ÀiÁ,$#GÏ ¨¸Y{×Âò£/Ҳͣƒl6{'uL³)Rò{Cn†­›æ£sCWsº˜Ö Ò}Fµ4^ùΠÝ/æ†G‡¿Æð¸³Î$Ó£9w…d 6œ¨rò`ÓǪ`ƒ³Ú¢²z!(m¬s<yó¿¤Â¸ß¤òâ½q⤨b‚¬ØrøY³¬Ž+`Xv¶*LÐÕÚÒ£A^»•ˆmùÉ¥ñDûðÓÜÖeLY¡Œ…Œ®9¦è Ln0ÕqɽõÜ#«ƒöùž‚eENWœ¤ í‘Ÿcv¥"Ë—.U¶f{hÇ)sÅ?]Ü®›ZÈ«ì!Ýî:0qm ì\¨ÖÎ*ž¤”gYµSHá€ÇlARdÏ—JTÓM½Q¥ÖKfMºéÊׂô w ¤‚ªªT‹ãæÃIšd]0'¨¦&5æ ‘Pœåì rG¡Þ«É1Ë'L¦¤„4בE þ§¢M§¹œ+0 †ÐáíB3ª@ , ë4²š2¹.»?(æ®Ò‰.S2ª[£*Q:-zŽzX•Å7û;p€D×ð?¶TVLdµ%/×WG-ø ‹¸)%ŽF9²À¾£±'Í£>#g›¡T€ÆbÁ¤àjÈÒcxþÖEæš$Ú5ôƃDŒ%K£á$ô«ºvÉÛ2©×@ó¤KÃX)&?n•ƒË$ ;y×JˆàèÁXg“ä18X4ÈÃø̽Xv˜K`uI (Êt½‚ÿõ¢AS€åNs%ç:µT½ñ1Ž€¨­Ñ½ûcU[†˜Ó6Po&!_‘ÞBHÁh ÃÀ(Ôiy9ŽÝ¿ƒýZRòªiÛ)Pà¢ßáa{UZ^–˜Á¹¬•œ 2 ¥$œ¨ t&¥®êišX+wÆ£Fn AÐß’zÝŠŠ¡Ë1š »™‘UQÀ4oáçÁW‚·å"›OJbì4Ø&°Æé(HÐ(Ê ð¦™žš“›¡Ía“q“`Ú£†ë"«E¨p$Á 7äÓ uçT¨×lCPwUyCt)¹úDGÔσ .3+ °³9&T9ªP$é×ÀÝåRµ¾»¸8æµÍ";òB¶K ¬ÙFí 0w&ä‡ùŠàìÓÒò±:d o‘Ëôþ,ø­$ËÁÀb®åA®¯nJLœÁŸÓR•‹b¾†ˆü«&º–&7p@o欸Š<“XòVREn`6±A¡‰êŽ*9gä9Ê€F•¤éEeëµ—µí\ü˜ íªä÷7/§ûÜ#š¨PL²Ql]5Öp­Z6ƒ4¸'h’bað˜ ®Æ ñ^“É]eÀq˜"+7¨Éò²ÆF­:Éf{Ö5r"SjåY¶'è t%°m ¸9ÚâÕt 9¥ÄrÓA:(©€Y× e='ÍäUl¶êØ3p'Y¬<%‘Ä9$ÌAP©uJ"µÅÒa›nFÍ°¼&3;pÐ䀰j8!à¯Þï>ÖBz<Þ¡¦ó.^ÑÀð15"dY£’Žð%U —5[éu· ÷ F,š÷H5VêŠHáXr )µS€7 S Re”×l Á&µ;(ôy†=d‰~¿Ñp”¾öhj´mK`«,”' Ÿ›~X”QÌF‚ŸÂžÎƒÛj€Ôl-ÿLOƒÇzçÀŽÌIxwÊ>„î> 5 xªÁ=Aq‘‡ôaó%¥°s/Ekp®Ž‹mÓ²e‰JJ}yH‰¡ÊºÜ‹ih¨e@=$*Ý]Tñ8¸H¨'É‚÷ ‡N#Š‘û²ª¦Zƒì§åwÍÍv„æ˜ËPz£‚K­”(M¸RɵØètPÆ¥^¡RåSjjÃœ×LÌ6ÔXƒ– š}-¡t Þ0¦‚¼Gt°E!]YmÈ4ÝÞ¤*Žå¥u€='¨à²¯!é d™ªi=a6;ec¶#Â7J×Z(Ú¤î,´-4(š¶Ló)¸ €]&ø§,øJÓñ¾Q³œ¿ ®´A\0p|ö%Û(¾Ï3ÅÑ¡<µî‚(¬pˆt‚ÀÉ9(M-RÉpH‡é@h«)}«PïÖá !›³ˆQ—ƒh¹aòå,R4Í'”Ví²îÂP¿¼ãëËe:Ôý÷h-’„-Zi"#ÛC¨³È=˲ÂZä2I3>6‰ÈûÔSReƒZ*!›éÜ<±½¹‚Üi°LÇfȈ€Óä¬~U ”IÉ‹‰=*d{‚UÖVút¥@ §L#U¸&Ž¤&:6 Ã"ü˜UhòœÝ–ÞjKÀнôèìj;A…ÐMªÚ#Ú˜Œ* t°H0&÷ÇUà›]dåÕ†4ÛRlÉbÎ2ë¢ üÊëÇèJ©æP.ÊÇv›€Ë¢BPãvLFÑnMËn–yºÏáåŽO–·uÁì1és‹1x‚ @à¡©½ûhÈtmHÚ a¶ œ«nØnî¶ßî¾SÌš’ue÷v@ò ©Ã™‹Éáv‚2¶’#OÅiД÷Y¹“‘K6~::1 Ì2,Ÿ„÷ë˜Ø‚”Ö‚JNÅ6€8ð=×Õã qá£V€äÈ5ªˆ0#-“¢Ù‚¹&LOƒ°|3(à‹ÅgêÙÉ’›,NõÞ•Ñ*ç˜Ó ¶yÈ—××ÿóqÐ6Cnl¹F9+ª”ðªBgÇšÇF óˆù\%-#$õ§dE#0r>Áüã"™dom3"°‚ã°ÁºF¤£ô,+ ,§~Ü´ v¬íj³ÜF¯¬óø‹7pjö®G=mX⛹Ï_€ Í%ïÁkè12w üO:6Ôº“Ò`-Œ²%í`o +Þ™`›Š§€©Ô`ÆA½ ä275EÝønf”´•G®ÆìO°PíÙ#ÓÄ&yÞP¯ÉW¸p4½€ *±Œzçê›T`á€V7K ‰©ƒJ5òJõƒôÀRÉ‚–¡Ê1Vyw†¶pÕn¡Þ{›['¹~¨s ]îap°)æöÙ|jùð;j9™ž[Nþº/yº­þÒsã®ÈSŒ¡¦Çûú?©’~Ôÿ1KÏý¿Ä×sÿÇçþÏýŸû?>÷|îÿøûêÿø+ú=.*ö·ÿã½f¿ª ä„Ÿ ä$ç ÚANrž 'ä$ç)CŠœ'hí8Éy‚þŽ“œ'hò8Éy‚6“œ'èÕ8É9ºaã9OÐ¥q’ó­'9G÷kËk_¦‰ãºÀ,wOü´éžøiW÷ÄOA×–wÏæC¹•²6ºûÚMTlKwšz`#m¢œÜ^K\^s¹¿~¤Šl!WU‹ –«£»ãRŒÊò,q×’ËýãK'„Ë|øÄü<¦1¥ØàÉÊ,[6¶[öµ5}1IÎÑ=ó€óqyjN9Zv¹ÆV"5VUÎÔÔ.Í(ÌËN-–7 æCÞTs‰5$—jW%xM*éXÉR!:Þ Žzäè99¯­ô ÒEbº1Jv—­°¼s6W(ùZLÅH”}ÅÈ&¥ åpbhw¼œjÊyËÊUSzcé†Á¥mMÉN·ÍæÑZ3¶–¨ŠÜÖµž›’&H¡Q}3®ž`¹z’´‚Šl[ê9Y«°¬„1ÀÀ6ÓìA%4‡q67ƒk(”³7²édŽWÀè`X+Mè1dÄn3ŠB£Öå&é]Ü …ñ|Ã3ÄVm½pNrò½àá³gÕÉ#ìNP‚Y.[{'Ûˆ^c>˜MÓÝ%¨k§F”ÙR©ÖµsÍV'×K»ë²‰½›nö1*¦@b‹:cBB"¤ÕÀ9X—}‰ƒw/²uÕ»JäM°cJNõ³–Ø®r<Þ é3Ëy ÃÊ´3 É–þˆÞâþ:˜«:[6Ò¬öŠôÊÜRBL#"䥋G« µ*ðÏLVÕ¤ƒYlp¯Xl²%·n>¾õs_~œôþÕ=W$äZƺາd‚Ç?~ÍQ!;8?âÚ+b9*ÓBUÒñ§•åÛüßë¢pq{øNð¬GxÞ^MÇȶ3;F9ÊHîƹZõ ž$ýw4»p-ÉJ·CuSANxu«:Ó¨WcšÌépÝXº2Îdε ´…J^Ëé¸t|dKKQÆOàE±hkS0­眕ô›ÞÙÏF¿ï £û?bï¤ÎßU÷¤cÞÿÁ—}üþ/ë•zÞÿù_H¶éÔänÓ)é ªð‹Ëª¥ü¿ý|Ï_¿í×&þßå«ù­ÆPSqûã_}ÿñO:ØZ=mÚóõÿ<þ?·?þÐoáÇÙÊÿŠèÙþ_âkËþW//ÏßžÓŽ±tþÃÂæíïÈøçúÿ%¾ÎÿöÝêlmó³­ÎÁæ³ÕÙµÒq5íQãû v>[ýx¶úæÕ7««×½Ëß^œçºº|q~õöÅù›ïVýó|ûb-zõã7«égoþþ×ÿ|ýæû7/ÎùËóׯñÃ7«3Ù”]ÝïÇž½xq~qµú£./Îo/VßÈÿÿðýêlýšïÕý_…‰äûë³µ(|~úœˆÛìÂí“s÷¢ ÕNyŸûÓíýã^=ñ~÷3ÎûûòÓõE} hZ]ù_ýÛ÷ÿþíêÕ×[Ã|½º¸º}¹ãy·d-ŠÚ%ENÒͳO‡“‡EaÊüöÄìwþö˜aî>3Ÿß~¾ùŸLÎìßÍ1³úËuù(½'²8癄èjí°}~—ËOáýyO×tîk•oå\mƒ¼ÚKN-¬¦ßþçó·ø30ÈŽÈÜ;†ß3Æw÷‘·_Õ-S?´ó¶™ä/˜ÔGÛ¼¹ìOëóL›oWüñâ²ÞL¯,ûÐð®ä•g€Ï×Òê/X}%G¡òêýõd¶é‡/§×¡]Ý?ÉíªJÒ¼Ù$M¨·šfÏözîªÿ'<|äÍÊâçßoæñooÛ,üîiòO÷Âä§k—ž¤þðíFòëçýLìŸKZ뎧Ýû@Ú>ÓÛ®L¶ÃÇh½}hW¥Ý¬ýW/·>3vÚŽ€»OŠ§„ð 'n¢Œ¾{Í<ýÆ>+O™ñf=%ë5¯mÞOøW¯&á’À¯aúIû¯ÖOñþúææ‚/Á§ëõÇÛ—#––ßÜXz’õó[y¹ž<ÌÅU—îíÓ3¾ÍÓò¸­Ÿ¶Õµlä†GÞ²íëÄ?bP­íQ½ÛEš­$ÙòaªÜÀ¢·­UÌç¶Zÿâ>cmâb†Ö¾{ûóõ#½§w“xƒYGº;|úóÅM{ùõªçËx>þýƒüdÄNEß[éÃÍíÎxY[£˜Í'oÆ­‡Bkg jÑ«è)ísXõX‹¥˜¥­œ¾mâcãQªórª>µÏ¬ò뜒Ĵ4ü®½»þðË´ ¼'Ÿ<•N8c(TRzúy¼Klx¼lŸÚƒé½8˜ã¤/ò?Øû×ö6rì`Ïþ|ç=ºŒÜMR7[{¦Oü¶Ý3Þéq{·Ý™ä‰s¸KdIª˜dqX¤dM&ÿý`-Üo ªHÉ6•ÎXªPÀº¯iv_uAÖHÒâ.»'cõX‘opê´žOȬê‚×+,å›i?ž®'9Úyv‘÷ðzûôSj¹œÐݹ+—ŸhqPD盛]õè(+mŽ_íߢ·0`õ‚%àɈlˆb~}„Xgc¬~‡rÏ#n[ã(y¦%WkÑÐÍ–Ú]!u<öaݘ +¾ï¼±\Âq¹$¤zAhdu^å¡ùü5ޫЯT‹ãÖÚG/O-þÔw%ÊÕãŒÎ‘ÁŽjO˜Ì‘NFµß@‹…Rñ`>c›YxœCät!€š°òÙzºb–÷6r8xl:)Ø3FpêNi=£ðxFêè<~Z•¯°"®É›wï6›®s$ ä¨Î!A2ìÕ— ŽÀ(µ7™]>[¬îMR€3a³"³„¦ö¼ÂWÊóÓÔnc•rºk¶D÷C·8k·^šfïèíÓ­Ë'x'(a†Xä‘|§^ÿ1¼± ØÔà›2²q@®ÔyáíÔ\’ #¨L˜›ðŸTÜ|¡®)æ‹õJÛT|íg¹3‚Íå»Z–3¹iPïaz¯ÐqÏž´v6É öâ}ÀûšL¸'JÐA Ñz1Á3ÌF#< ]R†1´››õ9äÚ]BøP/»pð|K]»Wa8G1m\Æp¶’p=lâož¹ÓÙÜS\ÉežÓÅo Û›¨^Ó‹—§iaS ÿϽ§/×+pG¦ºé’­W%0jcù^ ŠÒ|CQF*×Ë1ž lÝ£ åmôcÙ`=³å’põÙ€þÇ'CÓþs6UíTžû¦â¼FØfa0Ê‘úDãˆÙ3MÒbÏTY‹=1ˆÂÀuB„/ã½&±gº<ÆJ‰L}HÙoÉ”s|+y<“7×WWÓµÀëë–öÅc[Z˜òÃ-.×R‹•e+ùô‰ÔÚ„õü±-ª…¯eÑwü]7?Nþo\–K"»€F¥ &0ÀÿŸ™ù_Ž§;þo?‚ÿSö|cL 2F'¨ôJf¥Ï P*?7Ha0B¸Y>÷0Ž¬Ñ¸œ®góh¬aµo4æB•t³¢êÆH¦“[ôÁÆPÃt¾YõËò¶˜ ã*m Ùe¹^!„÷?–ïz¨U”)岸&CN9ù•Æ!¼(h`ç\sªÎ‡Õ¯¾§«VÙvŸƒÚëUªB œJ`Oͽ¸{øôÉk:Múˆ3ìøùœ¥—ßQ7ÕýÚ©:Ùu—5@}¡±ê íÚV_èw·úÆ6ho ÕpÝÚáV?}òžï¸ýR„VPaP¿ê¤Gàé“7ÊQØŸ›–B±lÂ:X{R^ ¾ÅãÄ\\üzí"¥Ë¯‘Ìš´Pç_ÝBI;—¶T˜øëÉOüëíψ\Í™wXd«P·ÜåÓÀ…u¶í…S%Âm-èN”{ÀKþãaÁF€ÔËÃã““s3þãìl°“ÿ¶ñƒòßó~ø&b@(ì.£@DýAZ$ˆrh€é"DͶâ âP†ŠŠQÒÿÀÕ(­ÌŽJX™wJA@:œÈ¯2c<Ú~LõäÚâûDÚ“ÎA“Y{av´0Õú²åŽÝÓ3_$ì£VHJ°Žšgªå·ÚPEî¡ÀÜ:ÚäÉM"t B8t§žœFÈîæH)<*²ê‡ÁµÀ·×æÝò(¥³tiú »!ŽoŠü–{œO&ô£@Hº+Ù‡èa?ÐŽÜuàÒG͵ùk×Û×`ÌòŒ5s-ùäå½p “}È\h˜SÜimY›ÛAo1];`ñ÷è“[#põæ>±|âªó­ÁPÛ'Ú/I]µ#Ûù—|ïïÉGEºåžØxW㘫ZÞ̤OêÓ‹‹Å2ÀCé¡ÖøÓ[ÓõÎÇŒd8Ñ™­xNb# yg/:OÐAµb8Å6M×3oÌìê –1ÿ ïcÜG'9Š½w¸ÅTJ£ Ë9é\‚†SÂcëØM‡;`jféá§`==@°ÝL $#ê¸@eA¢7 ›Oú‹ÝØ+ióù€~“‰¾4-Ñw!>΂éÄe“ˆÂeÅù3—GUÁŸ=¼žoÁE¤ŠÂƒ:CU,ÄÖ±ÙˆRùã=¬Ž«»³ºÆûI†‹(fTæˆÑñ’!ûÝMY™‘&·¹+Ô$ä„yü<?ôüŽ–¶P勚߬Í"ôĵªÄ³5 ÅsßhXdèÝ- ½»í8ôîøø8íœK…`ÇgW‹× œW#jïCRÔžçà¦Ózû™1rH³ù*1pïîKB@ß4 ß>Í ¡Ÿø.!œø,¥XN~‘¤í4Qd#²CúnEpÒ΋­÷U+ÀÙ׿ùP)p`QhLºy˜HÛæ èeÊ WËlü8­³b¾qs†²) uÝöÙÊ€ryðLL«C3dzh3Çy¢Ì…¹E-°j©¥´>>¬&1ý6 T/3ë0¬zŸ÷à?þ±O/aÕ`nÉïÊéýÏÅ%KGp„79ÍÙÑ—æ Š[ûS-ÌÊ Ä4BéS²+0ŽH­ò?`kY^£í³GÄ}²"בããA"«Ñ­öáˆô HÁ¥W×x¢€þ!S_ ¦ôuÒÝaÊΑ4ñÇòÿÝ”³|ļG×èªËòzD÷ uŸ£DßÐPýc3ÿ÷ð˜ü»óÿÜÆúrõWHM@b‡t#.¡5ã…¼DYÂï!:@é`y\>ô’?ªëücyûbüݸ;ðúó|v>°ü¿Ïχ»ó¿<ÿbÏ7rÚôÀÙNr‚f@-/hÍtÉaöªšzÜ|Yë8Ê»§NžÏ{Ùùócá¹æ)µ˜¨ð¨ÄÐb0Y•‹iqÙv WssyÌ’˜MŒddåY&Û 6âyü·0 6žc!»­ƒ‘\èax—k³8„Šõ á2Ÿ•·ùhù¶F D±ä·_ß4Ü”„Š¼‹Ðû‘ŠÇ9ïBuÅM€E|šU£ÅDÇ庆J~Ž„bùíëPn¼ù<Œ“U#‚ êcB.WÊWÀ_(C|Ô;¤ÿxБÀº9ˆLöi½ðMÂ1´ñ&§ O÷él ö„zˆ?] aß}¡èQ¨Kêa—Øeòf¦¾Î¬iˆLo¿Xõ ~÷2'o`,³K²ø¨¼â*‰rÚp»9hqz!°2@ûÏ Áµ=Ð'Faƒí˜ºÆšsOÎØç¼ýíçŸÁ|ŽÙ†TE6ëÁñU@€º3ªz²©2¿ c†LºÁ‡ñ+ƒX ÈjÀèH>Ï?¯´Gì ¨vÑ÷âΣ×Ú£Q*®|Ò¸þ8–Ä:_ŽD‚uP"E¬Ðó¬ïZ¨¸ u­áîFc³¸Ì‡N‹ËðQšÔ—1ÐÈ°r¬R2\KOËNªÍÐ4¹Ö8QxzzÒOÀSÅpG&Å2ÑIÚK,,åøçGTD? K%¶ÍÅs‰÷³ËrZ‰7–·šv«:ﳉrØÒ›ÞV,A°°>s? ¦öÖhŠ‡P~>0쉘ºy”ìû죃a´úP;õhZwz>hB뀦…©KÙ`DT)5(¹IJóBF’\¨^½|” FPÐóYpÃs¿5-htr–¾ÍÞà mݧÑÍ™~»Ø,€ÂZŒˆX íÊ©É,ÀÛ ›òÁaz‘£×ôTX¶¨£4w ¬J”GôgÃdï!û>›–úúKÂï­ú™Fq|î8ŠãôÅ° å l¸q!áJ5e§˜»ï)•ùï)-µŒ¼§Äcóš Ò5-®$LËÚ…–xðbc|Ot„ɉâ(ŸÄŸÀIØ`o®>šI¸ Ö€÷Óƒ“lup ú Ìzj±íB™*°®*úñµ5MBæ'‘³Be^`Ý‹ë9‘'©‘Yê=¥žj=oV"óø4Å©q *ÂcD8²%ëŪÌç“UvöiökÎö´Cù‘nÔv¡=´à ýð=€çØýª7/!tÜ=®Êõ|r„|ðrI—ù¢#N§ÇY•³«Ÿ2Ë#>-+ü˜ŒV壂¶‹D™Íò+>eMU¿XlðJ|Öõ–òù\“&ä Ä£g>T¥Ó¥b_q`c|Q,†êY£}]噥ʓŒêÍ m+ºsÚG¬§ÓËÉ28Ñ0ãBÇ7bÁÞál-ö"€˜ž,bÞíoÓÔ&™Ì+Ià¬F£K¿ Š¦ªs+×™  Ð¹³)‡fqÔ#ªÖï;›¯±Ñb²h$3”^©PâL¦Jv§*»‚RLËqV«ÙÐt .£Qeª6‚”‡ µQ1¿j"×*Én±) ¾‡'ã;÷M2ÃÒEÚ®T{ó\f„'Ç©3$¦=Øô¬#8¸,®oÈ|®|.G(îÔã=Ž¦sîlhÁ»£¥ÌZQþ›çKèÜî<Ìõ×!XOŽ\fÅ iü—½Á¤û¬Wig’JÞ-Ïe¢ð½;•mOå~5nÃcxÖD¥ÿ¨Eq¯Nܹª,þhò”XñÿŒmë²\ þpzÞ7âÿÏú¤ù.þ ?ÿ/ö|#ñÿú&*À1àeÕÞ2M]Á|À<)BZ“2ž¤•SÀš€ Q//Ío¶õÜ4˜šôÂm>ÍC÷D›Å.Z4¬¼5óÆUú8Do™>õ‹¢êôñ1Ã)(xk;EŽkNfê‰èI9šY34³@4„cd@h%!dŸw1Cö;X+º¾É¦yt„´üB]P!ÛÈ:þÀ䶬Ä×óÞVø¾6rÜ3æt÷D¡ánF1[Të)$Ý•x\Ì©7IŠªçtbaÄœ®Ç©LÈK…ªÕäâ‚fÚûCÿ`rÍ êÅ…vÑ•£ñb³ž½ŠGgýæÇr~›/]Üt•i(³€I¹î 2¢y ÖÝ™ê]á>Îa‡‹&Ú³¨¹ ½#?ï`ä:fÁ;ðY«%OZìó–#;ù,ïh§íØÉz;ñ––VC!þNJÊ~wÐiú†éT0\§¢¿3­†ZÖŽQ¦ ‘.à —îƒìéŽ÷¤/õ¦<“Y5˜À¢ïXzŸªB½Pt“<>ç$ËÔñi„ÚºçëöÉØ=9„½!VzˆøìÖ‚7w$meBFˆf^„vyè"—¡]ÖR){ïT!AŒ‚îŒî>•‘úaœ­ŒÇÆ@’?p9¨R„Óe+ŒdÍÓbWk)ì*]uRoæÀDÑË¢×ò7p±!l3#½B´Cá:9‡ç$áj;ß®rºÖpçyU¡(t^KF­&û aN<ë+×ýóÛ¡ê­+Ò‰§·ŽÚvÑWg†á”õ$¢Æ ÀþpÅ:L«Ùª´â¼GøŸ(e›ÐŸf´¦2ÜÃx¸Š&r¹oŸ›^ MÜj”“ÂZçª>ÝBƒrŸ•‘>¢ž0ÓG4À Œ¶®húˆªë" Nη Å;zžq)Ùyj.%&Œ›ºƒ.øR„ãçƒàuõðü(ÎÒÃ:±ˆÞa“ü3²V?ÂfC瀣C×ã·s—LÓ¯k± Zf0ÛadöX¥eöàû“žÖ,Ì 4Èç1|Ñ€ˆ<šj¾ z*Õ'¢Èµ…1Õ>ÅZÆÍÇXy Ò!!&†«©8C&rU|FMÕüräFÑLJ,¼Ÿ¡Qîõ=9ΞhÉ„ `&{{tNÿöo{ìPþÛ¿õ®Ëœå -$ˆ„£ð8¾Ñ¿4W3«¤dFæÊ,Æg¾*ŒNØÏ„‚±ºM(M ~‡…­JÞE…B‘žIÔäÏ"⼫Œ,":”˜,"8muû¾¾œ!JiÖj ÷”O²-¶LKBñZÏ("h¼‘hDŠö‰¤Û°U8{‰\ö›°7ºâO®R GP›P©žf…®=pP;÷P¢œ[#ÍÒÉiŠþP.¦[·ddU„,ó¡žtKÓ yˆªmv¡‚*4:ñP~$Þ`‰FÜW-áî7òdÛåÉpi¢Yž £ÙIžŒáóº†4B ÒJ­ŒùJ^ÄG>"T–Ϋ۟½!,z´Žp!Úþ!,Vt°î²8Ä$åòˆ;ÑI¹BºÏ3—}0x)³9 úiB‰|âJ"Bü½”É ñ7ÐE‹u°•<ÚÁ>àÝ…5ûÝ«µëK*diª ÷Æ‚†Ã÷¥×šc¯JS'ãÓFì—3ˆ¾úT,X9`ò|D¶óÔÔ!¤[Î6ÐO§Y}jqBnn¢…]Ó2™©¯! üÙüY1WE<Éh×ìs{¥Ê<§~ñàÎNG7ä¤B\pjÃÄ â®Ìdj$/N­qŽÆÒÆ„³™Q|Pr±5`'‰`ÅNZŒ£Ë7È»¨CHP ¶‰]t_Ï|œMÆ.†OÀVb›ˆÁñ …h+ɪÏØØŠe¨"¹€kÀiâfTÜ£—ÙÕÕoﵬTÝ”ëé„Ú3iù}¤rEý†§lAØýè¬l3§™2³ñ8_¬X Җû]Yñá]Nðͽ’â³:c/\þfiî0ô€{§–6ëx[†S$­¥2PkC?Vü#(Û«ÿ:8ìø¯áé.þk?ÿ%ö|#ñ_z—õ_Ðúú¯¼6`$ÔåÝS‡ßð^vðM,äØ´²¥Ie9ÖW˜Äu¶‡óÀ•Ë#£“ÊrÖq ¨3©5à_àç¢ôC¦ò%ìÍÅ…âá,ìr)ÄU²¤inLiî,±@•·ù(ÉØÀ9Éè¾_4@_å0v9¹‡n] ílæ¥i­H÷^šW†—¦çÒ »º2¼4ëO­ßKóŠzi^%yi ¸é ; 0T„Å@ ‘L½Zäc¨¶z™ßd·E¹4ÉMýL}©á™PÃFP3Ϫ‚œ›Iq…x/óndÒh*ˆ0Ò°×gºßÓ¶ÉÖD7OÓX×”Usl SÓVŽ^²º‰{•’<˜Rlº¥áÃï†ßg˱5–Ï–%¶òSûkîòâjrÓnÁ{ëÅ`£¸kºZÕá´ßÕÊê%Üeì7]ºZñM2e§®Vô¨ ;¦ì˜ÏÕJ“†Ì‡šmL¥ßæ3Í6f³ö¶À… »ZyEEÃÕÊxìCœ8W+-|d®V ²W«áÙFiˆGºmJqókïÐ üKûkÜE¹ ûk ù®½ÕÕÅÿ:%ˆÀÚòCŽm¥~WÂaËb]+¼îÐ6H8”K]’ ƒÓÿ¢äó®×ž~DÎÝ*™– iˆöêFdMIk7 Y’í¥Üˆ%Ù)¿)±m̆ÌÍÇhK}š1æ‚÷È‚õ$—)Ê"«±%s¬­›šcÏ‹"ñk·‡~k?–ýwLÄØ.“þ.hÿ=éŸûïðw`>?ÛÙ·ñƒö_ºç1þRЛÈü ?v˜¸“ÁSÿLK‹Éj ºÈ%‰€¼‰$Å0QY$±uTØ„Mmûu-³+!Í£B‚yÛ›¶éæs·Lѵ û3¶³ŒÏÊŽ&LÍmp¦¸´67L˜ÇpÞ…òÞ HÉË`ïpÒ4ÿÉôŽqæ#Å®.·Zßg{›àÆ­+Í6eH§ßßÀŠÎ×Ñ¡ê‡WºøÕ‰Ý\µaá‡ÑU½ÊåÂã‹‹j¼,+?‡«Ÿ —ý@PJ§íÀ»ùÍmãlcUELVq‡l¤I(ê{ÜOÚfŸ\PDZ8vk¨îU3÷þÝÝ[½Ç†iÕuŠØn˜vÕšç·w©½{ÜqV¢áùó”-îìÈjÖWï1íÀèjž×Îip|6™cëÂÛÊRûM«Úº[FU¥s¬Eµ qü†l©Ñôyé/6qþM³©Sý6S½‹0z»´–âNlÆTªƒŽ³“ö‡Iw¯fe’÷¦öDµªö‘‹S3äGý‘kÛi»³‡:X|ê>kgµØ#³Ô¢+h›Il„tÚ«0vºÝOüeÿÄš¯§Ó-€õö¿þ`x20â?OÏwõÿ¶óƒö?¾ç±rà56@¤Ï?þ“º{€æ ³ÿIµ°þ„ܨÏ`Ƭ*WÙ'")@Uú%$™Èõ£»l ì‹ÃG¾ÿUN¸›)¡¯rJs¥An'þG°aIÈ·¡†—¿I@x4u™/Hc®F`JÆTöº&5ß<_¼G¢–ÞK|¤]VÇoÔà SèwqQ¿JQuhÔ ì®/õÇ¢ÿ£›r–µ]+¶Êë¯ñ€âï ÷CˆþŸöuú?<9>ëïèÿ6~8ýï½ÂR ¹Œæ¦®×X!Ö£ð{‡LPr hî.÷ BÁ¼¼ o)œÓ „·’õ« ©ÈnÄ,õÁ¦³l¼,«p;LƒnF6&܈'\‰o9‚´Aáæ×,¢ÏuÓ”§­ 4ÍB¸-;¨·cõÐG¸Õ“ÿ‡ÍØÿ? /Íü/§çÇ»ü/[ùü…|Cü?Oàÿ91hÂÿßÒɺO³ta›fóëuv»Û1•  aÜ¡ u»Ÿ=^¬»D¡«j»É4Ž¼£$vuýl¯/nîHš¥´ 9{¡Ùn]-ÝMtŸ-ÜBî 9×Ö,AòÂl—N©K$£#-ÐñÔ“s"4ð6 K¬«üŠ ²j=ÅXÚbŒزœŠh™ jw]“í¢:òrœW`A[šåôþ&Ÿ,A/ » V_üÔ±*CͲ{°Òò¬ldÀ¿l ¸ Šƒº“*_ÁùZ\@SûËûŸGþýÝëÑû¿¾yû§±a»¦ÛoîQlìåàg²O7* õO¯ß¾þõÍ\U,Ä°iq¹Ì5&à‡FˆYØ—z/þYŒ¯|å…b"Æ:Ÿù x¡ÞŒVøú ¸ƒv-ç ÿÕI·J”ƒ`"¥[çåxxqÁÎíÓ'?BÎÜe†Æš’.ÐûËwRI^ygGî)÷ôœºYÄ\£p#ybTÍ"O¬R;`¹ÌVg.׫¼²^Í/Gr²Ú[£Î<ñ$„…wFÚ­¤OJŽlÈôäé“ŸÙQ•’V.Y™‘ºy#§¼õºÓä×]Öï⬠ýŒH ÉÔÓ'f"q‘@<Šð!QH¡‘$ºDœU{J>„ò! ëVçøñ¬Ž‹ºðÈðÉp³Àr™Ä‹§OÞ‹“Ï9@q‡ûWhøœ{àɦPC²ß’m LYê™×÷AKϺª°y6¸Q•„ááé“—À–/ŸM`§Èº#oz$yMòˆq›—÷ºKÄÏŒ7õoôiêFk.eZ \œ/&Ÿ>á"0Ã7=öÂQ?ßÄÑ,LHëKvæ˜ÝOäÿ[–Ë ÞÒUW9 ú¿³³Á©™ÿùŒü³Óÿmá‡Æÿª{¾™0`u„.ó@+€ësA« ±‘ò !'´ ¦épÁµJoGŒm"l_7×`f.wzl4%.Wéf…çnî³íøÝıÔ^¥«ÙkÁÔ Lzzií8t—bÚššs½_©/ž»ïÆ¢e•‘ÍÊþ¾¸-Ùb!´.èq¾÷Š·ú5Þ¨²èL§ëÙ|”Ï'GÞ—pw®¯iÌ”ãLÌ_ù‚ [qµˆK]PˆóL8CÚ ÚEØëq»E0°†·Zì€2⣠¶OŠ÷h$ Ÿ´ÀbØ°I¤ý´ËO e,±-9¤ØµPé‘ÅZ%Ü °ª* ¼Ñ#9ÙO…|‘ÈAºµõ€äãþ‹/• :(%Š“==v:‰ÔuPí¦y¾¦ã£¬ÏZ]¨Ø®šøkÿÞÙÑØÄè ìÎ.©o)D»Ù=¹å€íoŠ>ZAåÃX[îê)£‰o;4W0iCç®âîßÓ³¬œôkr\®ZLºÍÚ/ŒuK ã|³ÕxõnF¯Û¯Z±{þc‹ewÒÓŽBÚÕ åoŠJzO ;úÞ>$® |ë5d?[è'±1 ×Oà 8WÑuü~cEÓàôôK=E“u 9KÂk’X­‚¹œ8´©ÚÒ—}ÀºÝ$!бz+™ܧ¿YB‚aÿ‹½²<´žsÃc‹%¡ g-ùÆh|š¿"ç oýçS€‡ìÿýós«þóÉ.ÿ÷V~´úÏ›I. o" ¸¬$ÒY"p¥8‰þ$-¸ƪûÜERp­Ò”â†à¬n•\­LØUë®j[?ŽŠÖ›¨dÝEëè-¬u.°Š‚x f—GÆsb"—²´I(­xèœ{sci_Ü[hW·{W·{W·{W·Ûz¼«Û]ë6°«Û½«Û½«Û½«Û½«ÛýxoÚ]Ýî]Ýî]ÝîT»¿WTÜÕí6%Èo¨n÷®l÷®l÷®l÷¦øÑéÝ•ívŠ‚õ”ïÊvïÊvï~Ïeÿ¯îg—å´³Øø©·ÿ‡ýS+þ¿¼Ëÿ¿•´ÿ‹=߈ý_@ï2ùç°û#!ÖŸwO"lç½lÛx,íºrž_ÏU%r.èR} ¬ÅØ|wÏAó¤O¨?–[OpÚ£èÚî_\ç»#ý1jVÆÃk®’0žS"_/2)f}ÊsÐêéyS¸„•°ñæÖ1Ò|¨ß%ÚÐE!ð›F?:æ:.pûžµíˆÍöÝ$`:Cœ€FÇ »ŠkÂXÎz1s ý“±’Ëò–¬Ñ¤—UT·Ú'n@e­ñ6ïç$A"gGsŽOš ›î-7Þú´ßýı¹–û‰%Öý¤=sñ ¹Ÿ$ò7Ûð<é?îK²†Vêɧ»¹7­<Å5tÕï)cõÞö›.=e8>mÆSÆ‚GOS˜pŸ§Œ& ›] ”žÆ\gíõ‡îlOñ¦kO¯¦Àð”1·ó”q‘íGæ)cSÇn(ô¸9Oj±ÅHRfžIëñáÔy<ÍE—kïYšvèÃè—‹|y…ľ4ž`÷°ŒŸÌúzIËÆ÷È^ÇÚýѺR~A;Ufeý‚а`N/<1ï Íì@@üJ³°Õ|§ Æ<¨~Ì1²üÇéyß\qŸL¯•œ ŠL,×Q§UîåWzS¾Cb%â¾CÿʺíaKî°FªÛÔ±×mïn\¤¡}†Â;*E,ýöª±tÚikJ|X1ŠÇŒÑF°c@%o¡#´€u¾»)§tSü(ÓcºÇ”†rœzæ'Å2'k~Ëwú°Xñà†F—äjž­*ùÌêi3Â.ÞQ{t›-+ë.. ?a~«Î™!¡Ü)H^¡ôÒè;6ŠË¿#‚Ÿ™’«;²^›.¿vü²þü¬!Y÷/»°Ói¤ÂŸ]GÈõ†yð›»Ü±C«êÿx¤“Ý6|Tú`„¯ºó“”ýõúÑɵŒ‹mφêV5ó•Ãï4nàÝEO:< ä™H*0?RVLÉZÓ*€»·Å8ïÝ’ý͸®;ÿœ¶•zšð° ÷'߃WDö)Ÿ34S sy¯ne†SžXC2ÓÏht¾Ë¨ó]ÖyZÀA¶B'¹õòh#FÃÆb7o‰ÉµÜF-6oÊåÓ^I¤GœV16[.³ûè×+VPò¨wSÞå·9uü1µ”i¢-gk‚‰—rÎMñØéUêFæTwÒ aôÉqâÙ ê„ça—¯ç–ÕÜ>½7kKOkïºc†•¼-ÑÞœÇ'‰ÉÚ)@u²KµŽŸò"3D–§Ò9Ö¹Óf‡¢¹¡ÇáÍù¨²íV³Ü,=Ú曘!å€ÃõRï"|àŒÇ]:[â†û¼,Lö±ÔÇñW'ç±»ïKö§ ÇGÖÕq¤_ÚÍ£Ò#º;RûÑÇ]çõsè ·HõY;H‹FnÖ2ÕÒ¼&»Éã7ÜŽúg#tFÑL9 M vêž‹ N‡Y§6Þ‰!µÄ&üSõ íÝè!©JªŽQÊ¢ðÄ—Ák£L¡ŸÔùÝ•×!¿AcË7â0hoøf¼ øýgXñ&E(‰ÎÚåx¶á8hžÖ†ƒ§/æh%¥È¢N|õ‰³¶q 5wI²…¯ÓÑà‹ó#ôÖìÐ0àÿw|:´ò?õO;ÿ¿mühõ7ã( o P&@íÌPÉ©ª?IsTÀXu»p Ôò°+Þ{Î2Q¹Ô¼ý!€]ո쪶åã(kÙI9ËèõŽø¾úò•^¬ˆ€\ ¸‹b•].¹¢?­Á‘xžÐ#-óYyë/濹ŽåŠ+¾¹Á¢›  å„=„Ыû”¢ L5r0 ‘oï`®ÒU •S¾+8jåÄßÝMO¿+8º+8º+8º+8úhÒÌï Žî Žî Žî Žî Ž>¯ ÇÈßì ŽÖÑÊ]ÁÑ]ÁQÉO…G©Î1Iḫdº«dšDL»—7ôs´«dº«d'‡í*™vSÉ4tŽ¨})Ѹ´+’šÂ·ïŠ¤îŠ¤îŠ¤îŠ¤îŠ¤Ñ®HêŸïÑü±ü?qÍ9Æ@àmÔÿìgǦÿçùéÉÎÿs?èÿ©íùF|@µjü@‘TÿøOLGÜûƒè¾8? 鮢?¡Äïs•tyq“g˜í}IVáUN8º)9ÿ¯òj¼,ŠÜSÚ'h\,A ´çöäR’ ë%Rÿ.•k~™/H®úæŠñª7ÉoKvÇ!PJ_TB»àz$œ©é0¨{WyÎÐןܤ·® ?gÅÙ¢˜Z2Z±dzwÆÐüR_Y±"íäd°‡¸ø]5Hd£¶£Ò» ö2X±ÐrÉÀh a‚ ?óÑšCuÕŽl×ò½¿'¡-=Ð(Àzo ÕL¥ß'úSˆ•׊ú®) 𧷦ÆÜÇì 9ÑY’sq.ݽèÌãZ°Ã)¶iºÍìLÙÕ,cþÞ!ϲÊlŠ½w9 .¡25€,çD~p N30«Øͨ“Ñ¥2^Ázz€`»™ÈCFÔq)€Êt§nF“ô»/½Ï±ú ?@—Q;5Fß…øt:°‹Ë&…Ëód\U…¢_ed¯çEpá…©p|!vO\ f?{ì¢ê¸ºU”ÐupÇOÒñQqz¤z"‡¿£Ž— ÙïnÊÊô™¼Í]N“¡D/ÇÏãñCeøÎÑ*KÒüfmÙ!®U%ü¡Qü†ûF‹¸À"#5ni¤Æm×ØÓιԎu|vµˆˆÀy5Â!>$…Cxn:­7ìüˆ5H|9xqž¶ ãiž-;ا6t™O‘6‘ª|¹]N³ù§Ñ²¼sù¿«g;ŽôZÎ﹫¯„·{'¤6ÞÕ]I S` °ç$Ïäo"’®ÇŸîá®­Žz×ù ¹‰ ã" ÛY4úßÃ;Ðo÷ÙF}ôi–n$ŠÊ®hZø®”Âgø/@!ÓÆ’AÙ!tí øgòß ‡ŽÞ¶½}H¶~Iü…)CÍb ܾë†I!™lxp¼ÉÇŸxƒK ãë—¡=ò^T>J@hp ž'²»Ï—åV¤4î/<(ÕÚ/½XÀkÜGW7ì3Žw'_+]R“ÑRé“Ïo‹e9G´¼Í–RíRŒyS\ßäs³Û¬˜â;Ù•  E6ð-ž&pjpC$‹o{ö‚°YHÏ[‰Þü³ø1ŽÜZrÝêØ•„tŒA´FpÒÈ£Ž·R~‹E_¡üs5¯~Aé¢mš4ïŒÍA!X t”¾uˆÕxãPµÁ T‹iA)w¦IÌ:g“8ì>¨—ùÕU1.ò8'ÖºÏe{·qtï4AŒº‡ûR< Öj¡DÝÚb“Ç…E÷%! ïÚlŸf†ÐO|—N|–R, '¿HÒvš(2€Ù! }·"8içÅÖûJuªñÂu²âè ÐÕú2š:“¶Í.Ð9Ê”A®–ÙøqZ3fÅ|ãæ eR,êºí³•åòà™˜V‡fŽgÑfŽóD™ 1r‹Z`ÕV+Ji}|XMbúm¨ ^f ס×9óÚ€ÿøÇþG^ ˆb1sÔ{WNï..YäÀÞä4²/Í,àͶo0Õ¬œ€ë8” ‚Ì¿`‘„[åÀÖ²¼FÛgJ e×בããA"«Ñ­öáˆ4ѧ`‰Ò«k îÕ?ýå]¤7…5Ý̲ºËIÓÔ¼ó}O€« ŠÛn4#·¦xÊbõõÅøe¿L¹͌~ÿ€ÕÍ2ÊT÷Þ[$ŠÔb„ªÓ¨¨Í 3Z}î~(ƒbVÕ8›_EbìŸyî(4D¶u1'Ë,'Ðn 4I@Ò Æ/ÑnµåËô÷Dè Ïn’?ÌìžEÍŽ;üw5¯AÍ;“lêSFW_Ò(nÒ o›šõ ^ElŽ.>Æ:,ºá1¬ê³ØU­§fÒ‡ “~(T8ŒB…Iq;Ê?gcyüqÄðLÿæ›bæ{qiLøod¦YïûÞeÌÅ?-ÁC†Löo3QœÀ>N÷ i¾ËÔù.[Ïw‰ ûŒ,ìa¯É”ÿ–>é¿mîk~,g‹õ*ïí“1–½j=¾¡NzùLøÄ¿ª·Œcâfå$õËH—ÖŸ@`à–üo'®W û÷¦%a…ñ5^étõWtâdp×ãËÃMXÒ¥³Q„Àëí_ÓTª+,ìˆ)Œo‹ <6Q ZØ˸}-‹²j 4ä`žE«+²Ëjk³ú›Õ?ü8êíC®iy=t`×gÉ~‚…€'Å|t™UùhÄ&ãKh³:ýÀ Àï ÝXàþ¨A¿£¯b€6÷Yƒ¾û» !*ÿ[ µåk£ðÇ?ú¸c"óºÖÁDþWìDÈao§…£å‡^?棯»ë1cßhƒýñ1£•‰ûéÌ%ɃͺíYÄpx“—ÓÍaì>¢ìÿ¦¯|+îÒ^ë& 'u‘çùÝÈ}o8Õ?ÞdóëÜð‡e6^Ù—ô”„'-øÙÉ« £âäRÜLÊåÁÇ«{ÿAaýçÇÚÊm'Ò/ @U]Må/ÆÚ(Nú Á®c¦Ÿãg3蟧MǸPê§6l33¥ÀEú̆®àÆ¿˜Î”NÞ%ÀºðóŒóq²,I.ŒïLÜæÊ8á<ņ€Æ/ÅÛU ñ7Ô‰ò²*§À‹Òñe?òtúWi!‘°CN‡ýAß¹öªB’€NVÕG±Á2×[ÕcmiÅ+ ÿ‘Þ{ÊRäJã²[Š w:Ôš1o¸è]9}> 5€ñZõšdÌF ¨€êÃ&¼| ÛK¾Ò2#–‰÷,~Ÿ²—¨²Å€õÞ>Œ'è‘Aðúò@‹AèfQöÿ¬ËU‘û„,‚­¼lÅSž¿p‹jض¦…ðœ•Fì¼CñÐõ!é–3ÿèO[r.Á ü, ‡¬t+¼Àðü4žv ’¾u˜yTx™sݧÔrRý0=]õU¡oÖ³ŒV$@rx•U78 iuœ±¬{âýžŒcMIA£”d EV=E[ Sª -L* =PJ£ÄïYa–T³…8r)¨Nïò4jô/ø®YNqŒ1irèƒD†eîe1Kô¶n;ͼÿÞXχ›—x5³¿â±í£e£×Ÿû\‚ïq°uLAÇŒ_ùåø`Øô"¬l®\ûÞú”o¼Á.™n·ò‘ìÓYøRMÛ'LÃÖ@wù\oI´Ã9—êÄ£»¯Í°æ^$4†E#±ß±&šN¥úÓt»ðÌ™èOî± õ_œ†‚µ\*ûÈ"nÄNB¸M·(4ìµ!6Ý.¼¢wë%œ Ÿsr1qýq"/‘Šå°¥òÇÕ9SVèÄ,\ÏÒ˜âz­]nZ—^%ïåTÁºé–0Nl^³÷û/]³wÞ×XÍÀnt§ú£;·´´…œ@X> ³åá7ålyÞOñx i²½»¶=7ÈÃoÓ òü4…ÉWvËyÈéGÔ4ž–FÛ_ÿ××c…ÄãÍm°Ç)Ç/ÿ[ÝvJ‰![®d‰cCh`Ï=}ÝôÖüÃ&œZÚß™dZ¶åà”±€{à ×R í¯6 JmçÑ`,NÄùî?Ñ€³XûÈ­n`§‡ÍyDŸ]ÌJŸÆø¤ÑÔ^Ç8+ýf*ÏSÕ3=,~ÁÇòˆW½uÅ*¿ˆ¼ø?3íZP¡a짿|¢û>d·P¥ c6–Èùú×—Æ''òÑZ‘Jy.hº×E9½G5¹KÄÑÛ„Tê2lgˆ…À|È&ÈbV°ªèzÇ+VR­ÄMQo vZD¦™>ü C1ƒÞçyïå´*ü1GoÕy‚¬Ù@l¡iglC|‹`Uìĵñ'è¼Ó2à —‡‡î3ç²hëÃù1 û]E EtÀ|ÁqJNXçÑXàÊÉÓãÿYfâ˜ÃàÛ;·q› Úðþxï8Y!—–Ž¬vx_û©N.t¿<§ —u¢kbñ{öMYüΞ‡c-5OH=F±2%=ªŒòê² ÔxB²ýXø_ pæ×ïdÿ+p?Ò¶WZáv¾×wQ6 9›4‰ÂØzv'‘b cãԒ cC3Mé‹Do¶žjþ°Z½Õk„é.2UÌ˹¤§e¦ðÞ°Õv•aHþÂêo=ôUÿ‹ïO‡EÀjë‘ߎÏÎú_gÃ~Wÿk?XÿKîùFŠ€Iðm+±|ˆ”ƒæ÷‚IQV÷ šÑÓ|Os³¿œ¹~)x5!§Âük°UãPò8ÎБ›Z¦ùm>&}”š•òl„}·¨û!tt·àÀRÌ­¬¦‡È†2“ üB‡™“û<8V T…1B, TÑwøkúhÖà˜‘áS—åý(ÒŠÿZ.èo”ååkÁÄGçÔ‚›’4¡ðxl) ‡…Ó0rƒE׊)þFæ§ÁöÓôi#){‡&½È1rn©Óí£aBÆWÍè® uæ—È–ód¥F`½x¢é1;& qƒ¦ì‘gpN:ê|uƒ.xôøF\eŸò‚H?éSÜîz<ä:¸ïyw ·î¤fTm5Ú¾ ‰CøÏN_ëÄõ²N®M’>Hçìéó²q pY MsÐVIºbN.ÐnÁk$pø?¢8賈µw±ùºúŠîÒ%—á7*ñKàÚx8c´ðÎã¨$üìð‹zœÉà¢Ö€f²e÷šc'öÝÒ˜n¯”è„v¨è±q†¿`=¯8Ò†t~”žV8“à1Í(‹âïµÒ‡oEf`i×ØòÀ,¹ô¦ÇŽ;å|œu2—Ôϧé¹ÉÜ[Š´á1(†¶n¼  ýv,g‹õr$oD¯âö6M]Ñ{7`ÿ¦Ð>ž‘½fô/ÐÒÀ!ûq®~_9I8µúk ¦¬gd¤-¦Äª6d°ÜF‡év„‹šë²ÕjY\®W²šÖaþyAˆd„@¡s¼"j[ò²±g‰ ]©îq4)f•ýEÏ;‘ïÃÉB;žºU4y¶ ©níÜÄ Œ¾|+«Q k혨c~ä‘Y²©þ¨õLó,ã,Rth‹mª¾;ÍkQ²ñ8¯j]«pÝh¯µ%—Ï@m•&DyT¾’{uÈ÷OyÄWªñ5¡Å6Ä~™@Í€@/–WÀ9G¯q´$œÓü\j듳OÂŒ¡œP3Ïh¢úoZ…Aá©¥Êa©b-ÞsŸ{1y,xÛÞ>J¶=ævžƒ[Ês²3š,ÊbÎRP-àöõ¶„š²!gŒ™Q'ƨø}¢þÊ«;ÈC0¯‡`Ñì ‘ºí©àÞþöóÏèH^ÑùŠ§þgŽ{¼eŒ õ({‡Ÿ°äpŒÙ‡ªîÔÅìƒ=¦Þ8äüôü¹ŒnPfãp†Ã¸¼û²»uêÄFE‚¥Œµr->íÏh}¡£Þï &1ÑJÔi €÷þ«àÜir^±†{ü·=Ä 2ä ®¦÷½õbvuDÄ¥€ìe+%tªÂéa›r>½B ¾!l§Åxw9b$9Rê‡eð5Z(„6o‰ÔïŠé´ÇÄGÚÏÏ0h$½»{w'Ò1{˜ ´4vÏZ­PðëÉYäÁwD˜›ž±‘'JRˆÐu#Ôˆ‡5Ò¡G8Œ9¨ÊôbO*’q#âƒÐï3Y§#íªr¦lìbY.òåªÈ!«f¾‚à>8Úæû{ ){³ì^…êÔÖsŒÃ méY"Ó È£Ùëºg_åù –çM`ª‚þÞó’sò.nTš¨Ó9/õz ¿æ+'Ð ¬äóŠs—.PŸ<(‹$±ÏHiO/‚[Õ„¼hȨW¾2†o¥†¡YqŠ=¶±žª˜,,íâã^/×Åä!dìéqÉz{7ÙrB~q¿×Û"œ1vs‰i…‰¹>3‚*Ù C×äÖX²ëçjMX?ʵ’>bŠMŽÐB¿ìœ' ­¬A${i¢KÄ8Mk¶U‡©–_IÀ.QÀÕ9“|A¤Rxä«öjë½a¨°ÞL‹j5rÃÅWórb¿aB™ëÁ!ˆüäBŸaý]3ÒGÜ¥nÜסxBÕâ$‚¬(%qŒLîIÂ0#­äÌ'à˜@NÄ—Œ„—s¶XLáIˆœ.Œ•'Ò–Ä ã€~-SãýÆËJÃ;KîäL”`Täú(CB™ÀgƒÖáËÙ—ÂÊì´=ã†@mo݆¹Ø‰A„!m?c¬Qž‘¥’¶B;"ÉÅ`° Tek®-ÇKµÞªÚÜ)Xyœ^ùDay¢e¾z¯äk_À¨•7XsmIÅ·:DM ê_­A¥½'7§Rc>îž‚Z‰ËDA—늧ӈà_ö®²ùøÞ\UÌ×à ˆ`håʆÞ•ª ©ŒcGÐÉvjœu0n×Ì ’zd¸Só掎aw„¾º#ô"Rÿ¿¹#T{‡ÕÜ*IÇÊ‘L'‚ÙµØwÏ‹6€9 †$@Ý’E£§ïJ)|?*CžGFôe¢Æ(UpÖ8v¢x “ÊçtΊ)¬.åº8²ò§ê,˜É¬·PF}(¸bäA» IŸ Ðö€å 0ó鄳Æ4mF¼µìƒe"‹25`OZSD>‚°;×Í^+mMÂÚã³a{mH"ë§ f±ìßÈázèÊÞ£°‰Ws9mr\ÛY='6`l¬9¬ Þˆ'°4ÂZ·­ƒ«JBÚLømD§#GÚØáåç’ê0]g÷Voâ0%nèܪë\«¸“Üž5ÒO©¥Ï•FRtÕZ'Ô=[K¤îÙ¬YâreB…³;—‚^På–4œÂ_@›È6]]Á.)à*BnƒWN¿"í.qú¥J©/9wèB>YNE3.;Ö·0ó>ÏZ±-I–-- ñpRÈWi©e™ËZç¨ÃsrÖˆÂÖ[å'B¨ž~+B­c§u±rºð”.þŒ.fB—z=cÈ„³{G÷ÒØ=îëRaRbæVLÕP”s\æd“Ç2 K®ëÉæq·ü-u‚ùQÂAÐ)¨XN%luÁu5|z²ÞeYN kÌ=uD½Îñz‰©Æ5o)–óñŠùTåÆmS.…Þþ,»'Œõ-œh¾>c:üKï˜b,¹xŽ‡™€È2´÷Î „·|!xZ¡ÎŽ³º´¡ë/í¬8¤êÀ7ϯÕ?·„£Tÿ”¹Í4˜¡jkµä!NhÕ|Þ#î9êî^Âw|i«Êðâ°üRèf]·ù\ㆿ m¬2û¶*Ë1dít&T¯ºGžï¡Ñ´˜@¨éOIM£ÈÄ6,à»0Ò= ™ ’wƒÉ)ÝgTeÜ»)®Áã‘àðHˆƒ)+—ÅuÎXh …C¼\" #&]‰„Vðâ¼5r¢0‘ŒLç­^2mÛ‚k®t]‚ý3æäªÊŠ Õ]ÙÞ!9Nœ^yøâ¸á5üÚQ‹¹,›Ò­eÕI•õžƒ¤ %šiäN4ºV#*…4&ìá#7ð’ü@´£ÌòYI+ 8Ü”„>`Cþ˜%#Êàü¸¡ €GúR²~DŠ_\½S§µd3%k@ªä¦Ž‡Øc=p£“K°£]ˆÆ–#ßxdžhG/,„P«“"W-ùÄÖèÍ6ˆ”ÂÛ7Ò¡í¼¿ʪ‡Lˆ Qí”ûNÄvdcðµaÓõ¿ö«Lµ{§îTÆú'qpŠÊÕ•ÏÁmVP;ùp™|ÍmdÂb°GÿÝc>Ï•6¦TÔ×½å4DÌLUX@Ær†•|rúLõY­š^š%nivÜ8ÆcÐoä4ré”Õdú@øOº½ËUT'í~}®®œFZµžA].PWÔ :J$¼«‚W½00ƒœ1àZôöRР9@vu÷ UWŒ×Pv†J¼Ë¹þ‚ˆÚ×ð¸ÀÈaŒbØÊñƒ•(bU”ñ¹aDÿàY$í&€¼èêjÄaøùpË1s>.wRÜ`šÑ„k=vNJÑvúzŠí/=ö½QÍ_¯²Îf_ôÑ"$öÍEÙ×Í+pˆÁ¨»,××T §Ît–}.fë³ì¡Êçëß¡}i/_ÉbS¾õ@sI/½?ÿò××ÿúúWZL «¸n늎¯D2V½kŒçf"»ÔC}qŒð+VX>´lly¹cåk²Š0gD¬§õÈðð«Ë¡./ÚïÉÅ”Mõ€ç¹ïÃŒq\BYæš=Ýj»ÿòí+ºgä¿_þ…, A0+ñ,ö‘ÒÏbÆ ¥9-p†V5¦‡cñ[4¨4¯nÀwN˜ùÕ_@†áÄ ø_‰‡C¨Ú V•…ÿ´"»Tí±Ì hLì5ÅAM‹i7½µcš$£§@V½£xìí(Ž¦ÞQŠCšZÊDf>öW3‘ü…£¤‰>FÏÐ]òü´QtÌCé^l¥ú*õ—L¤+!ŠÈKbšÄlw°ee³M͵S¤ylàeÁ 8…Ëfwæ¯AYÃ;‚¦4Øf™³(T Å„Ì,Áf1ÁºZÌx>ž®'9«c9áùIh†Þ>ý*€Z.'T¸+—Ÿ(ωjXB µŒ*µ —‘š2—øUiYdpî.sBZSŽdˆ‹tpé Î:ÊÊXÀµµbrÖꔕHó¦Š.OÔC×Æp> hé4HHc¬Zë’´x˭ש]"¸Y‘ 0Ë[GÛrgIÞ¸˜N=‚3 òBÅ|-òÏäËárçJɵ²_Ð\*à)@xÕÜ*[¡$ø×—¿¾}óöOµ+sÊñPöÓÇå¶ejhŽö¥…æh!3@~@9l"ÄOºT8-\ZÖ Òý°YàkËÔ*î2Mî7„ÎZ"ƒö+Ê[¨…JþbK y»ÄÝö˜sÔÑÎð ò#œH&Ķ“æ±XNär[4˜bUÕ#s]kGh™"ÄõVɘZK&ù! “ô±cr(i åkÈ])hJpàêWjEýVL#ÿMAØ4žßðÒ§¨§£Ž`ŒÔó¥ˆúªt¿6ŠœD{jÍ™uè]%™ŸE=Lt»¬>†wº‘“I£;@Á‡¸CyÜñM]-"µ×BLÄ?¶f†Àˆ½åpϲî-{G´$™fþ0½H¡]oÿÙ€ºzU7år5^¯ ÁÔ¹fWTIf8,<O³Ôv_R»7Wtû`¯"ÍdºD 0hæW@šøAMóê–ÄHšSm§éá­žåËœ-š!Ë…oE ÃÈfhogb¹Kšê¿?ÒlÕTópGÕi&ë4Ìgùò€Íd›ÔÇó…N‡k‡)× ì·=X ºC(´Û¿\é¢lp/U°Lh›J} T‚¯¥¼CÇô«ž©£œ™„|+<7ÃE¢‰ÇR~ÀþŠmQ™¾?‘„¤ßodt»fhád~Ó´]v<ê\ Y«Î¨m˜ïRR÷‰dïÝ&󳨃>A¯;‡’³/ÓðzN („<šÙ˜Ð N1Ò2õQ{™¦sõPüÍyâLÚ H¤ö¹‚²¼Xñ7ùŽ§ER§Y­±D*7=ÒÆ<Ä]9ýØZdHÆ[OߧH Ðû=Ÿ‘¶Å˜ÐÉKyp›¨ýI9#˜|ÄÜ$úßæ7•üO`º²»Uƒ„§' “N|êh#Áéa¤îõ¼—_§_Ž·•yX¶¶F4‡+†ÔeûÝ4­v(G£P¡;õÄ;Ìôïyå¥ÞèoÀlR¼±´‰9Y=©œPÜñ ÍFîðsÀ½WLÃ_:pæŽûý¤3'×ÑÃï»3E¸ãFÝ^ŸNõŒV KíºÕ%ë¸ù)€ÿ“ü*[OW¤ÿ5ÁÈå}-ëÁDš3ìò¤A\ ¿§%ê×3 Jr8p7ƒç õÜÁ£™S'»}X Ò€œoàÖrÄ‚5×Q²ùÁqx5¬*)À#B¨M&ÃõÅÉñÓχ /˜HbVKHÓÝÑlBIfN–Øs ¤›šë8ÐÈ݈¤ØfíøH³I}<©4|º<ÐŒì4ìLÉ÷eWf°ÈÂ’¿BÆMðå¢ña9ç€_*…lŒ‰Êiùç E]ÌIIÛ«!ªÌ?ªËNþÈ ‘|Ã>zvB™Hò‰zwëCØ—F´}6hmù!¨·¢^jê×תÎLY 3æX‹ešP¦’P'’~¨OžŸwÇ4Ö3xº’ÌŒ-õðoí4]^Ôpü½2±J„ZŸX+OìêàÕcUp@ " ætÛ­)ðK¦’ç‹UOäÑ•!ÕÆIÕ_æóÛbYÎg4ZzY ç·,Í‚ñ˜³["bà;ÙUóŸ¢èÂãû<｜V¥‚’ÿíùÒâb¼g^´)àر^S¼!”(…‰ð 1é:û4¥6½Ö“fk¨ç_êI:…àÖë|ž“Ôy–e¥`=XP/ì§âÚXÌoËém>¡nav qOÊÃ'%g™ÂfÏ;O”ïp¸¾šBx‰ÎÏ“ÒºÑíäSqÞôNçÁ¤¤ˆWøPâD‹“@RÃãµÓxe½kLä‰Z€uäqvŠxwv¡&h¦Tó'¡÷F‚8&-BV¢ {ÑêEÃ[tãIlÏÄ÷¼%‚…ï¼yDÁwêùymÝ…é楳Ŝå}\¹Þ¥¡Æ6L7ËùŽ°¶˜ôÝ=÷„Üîç§Ï¿a½£ÇØ«Qà­ä'0uHþ‹Eæ-k›¥NÔ"U"`Ó„uoô2:ÃÞë–Äw5k§> ‰œ’T‰//Þñ‹oáÀÒ„E›9bfš½ðÕºPäI=ËXœt¹°ÄË})»ÑwÆÉã©(ƒÇÒ5`ôC(W. «XÑ´´õÃez^%|ì„Þj#ãV’#pì˜ÃÎ(f%¯×®iº¢öeí«°ÉfhÀPJ·›Ì¦æré²OD÷Ùbuo„z³•g¹ÉôµgIA7}ÿlU>[WÞU ‡±4ÌýEÑßËáÉ#Ôá}¬•ejRÑJKGò(1´ÛHâ11y$5/™OÑꤊ9Ú놹Fl·6**¥„ýYê üÍ"Ò®?…s¾ZÝ?ódr®!Ç Bº(Bƒåb(ï‡ëÑ œàªQÒ&üü1ÉÌNê%tÃf„NÊå±y&‹çS﯊øh£·¬°Ò2¯ \‡Ì²\M[¤f‰P‘}ZÝ ‹O‹#O&£«ìS1ÝnÄ´Ùöxÿcùîçâò[AžŽUÝ:€&"Ý•¤Ïƒ欑ÅW(£t%TüÁ¡¶jf @Ì#£¾ñFz0¼ÄI*K=7°…üØZ ùþžäVáÍÞ-gXÕB ‰ŽÒ0ÁhŽÐÅüÀ—xJõ°‹Bï²Ô¯§òl¦cOˆõ³NINíÓ¶É#Ž¦.á¾KGÓŸËÌkå棼ÑÙDD` »Yõ©X0îà7–vÜÁÍäñ‡âÄÒó,Ý<×\ËfÒzÎlÇ’¥ÖÜ ›9³yfrõìùˆ:aEo|½ÙULÖ:B–ž{p"Žt?t %¸Çx<9ßfà—6D‰“Ff3‘*)SŒÝÞÈÂq£WôJg¥,šnõ*õZ{xâ­éèZ4d (±à8§Ý˜,o 4ä1°`ÛÑâ“ý6´‰Eºoœœ7‹ˆ ùÊ•zÿ( B(^ȳ ‡k ñ™§#“èÙ†WÄHV¥X$iW¨Ékžcü‹È>‚€QºËIJQæþ‚i´”‚p<"\*c`›»¨\`|Çø¦·,®ox@–ŠÁè‘A®€¤lÕÕM~ëwê‰&µ/ûÍó tRw.ô eŽOšú1|̱æ>VyùàˆiQ™l­NguˆÃôÆBM¢¢ÝOé—#_®³!ƒHWÃfžëR‚ :Ö¹„‹+MçbeY­Ï*ûûìô–àÄ^ÊB¨ÔyßëiÞwŒlî‘÷ôÄ¢4% ¸•°Í‚âÞ¾æÐ}Eƒô1o 4!L#´âÎ2B§¢¡nèÞ³Š‡ ªF—šÛ³K‹r¨žl`LäJÎB©¿%,òÆMózrr­ß‡Ëüj ‘Ÿ”‚0‚2ØTM±Ê®]—eœ»›6¹HíÈ )ÿ sÐ °g*1åÏ ·õÌðé‹‹ ñ­Ajê%¦ “k³…FÍJäqp©I&¤w÷8hU)ÁØÜÎ:°÷±M¸¿/Î?èâŠ] s)ÓÔƒáÌ•Ã Þ¢gœsÉðlËi´ÛgÜh–GÚëÌ‘÷Bé‹^ÐöËÀ-‘ÙÌ Ó¥¶™ýáPÊÊöÒUÂ%h?öaÛŠ¦Ià9—2õ{ÔC……"¹“21ô¼Ì¯ L¾ìI³2h‡ÇÞ”Ií’îl~Ë%p;ö‰žfÑ?š«ÆW7”ù :Ü‘–¦wc›Yÿxð°G¤“ÚôGþ¬(õ‡i3É‹ èÁ£äB}íD±ß”se¤4juHô†GÅ«2–†}ª}ÒþhýÌóPs—8¼ïRÍàÅ°aM²înGÉÏIÒÛëmWǹ8n±Åì«Ô’Ž4@vöC#DŸøÓUQõ7*ê­Šî¦ZÆJåˆíãÙ8ÐÍ3=zéÍÊ}ªø™kuTøø~Ȫ‘a¸žÉoÞÆå¼±RݼÊp£íˆÞͬ `t Ö‹ˆL¨yö¼aBMOi@iFz8DÑG‘!PGöQmDUáé-ð ØNsãîPÞUŒ¹i„agêv›iÓ¿/"ð5¾ÐF¥êL1 ‚ú´)·›óȹŽˆ„ãO Ì;¯—mØhŒq¨'\B@Â;XVÏG;A‚cùˆ5ÆÉh›ÂD }r¹††[ñtŠ°«èúïÖIÀ÷ž,»S§îÆ$½¹›ZgnŒºta”Ï•Ïh.·mxí¡a̶hÇ«_CÄ–âxE$FpyÌ–÷AdÌ°ÊLÑò²9€ Žž4ª¢šŽR~Ü šûàý Í\¨Pkg—.wÍ Vm‡ôeÖ$äû>Ï» žWóûUšè^ó쌴wÁZˆý†‚n†LqÛ€}ÃסÓa8RJ„aT[ŒÃ`v$·{ß‘æn“Pí=Me©ð%÷ Ÿ–´Ï›Y`ë㨉Œ÷΢CÔÞŸ]å`›gq +LÃF¹µü.½‡:Ät˱h{Ÿs#1…0æÓêˆÔ©¨d`3Áb~€ö 2+æëÊ j_Ï‘1ÆRjS¶Ê´ ûN×óA¹Æ/º¸Àè ‹Õû:<´ +zˆœé2é—1u}ùÁh’d&Ô_óD‚GJ¤>_-'k+™§3(5ÝÆ^YnØa¢%ƒÌ¶Xæ›À—Aè¾zå‹{‡\š"0W ùÿB5,” `hNïSlÃ̶G_ ’ŠÛ"ˆæ™Ñu_ísнKîÅ]|0zøptÅÔîÈ_Çä/"ÞjÐ,à›®(öÀ„Å{×7³ÇŸbp>±õôø‰Vh­øó—túÍå1?,ÉlÚÂӲ؆çM㶂y”ˆœšló…?«™ø5—`[u·†CüM/ý€¶1b%uÜÊ8¹±sAg*ÒŒwFœ øNÓ²;+#Ý’S´¶J;Ò óèsÁù(vpèÌЫ#Áé™Ä9âiÇ ƒ÷¼\_ß0âúÿ%[x[ÊœøY ù0¡Àà ! ©Do¿|^ÚßäßW0*9¤cšîPS®úÓÒêT™º¬ËU¯½:Ÿ±´øl*$†W¨Z”Â%`´C»“ T¢\WF„»;0 ¨Øº–kOCè1JRi lX‘•i·TlÆ☠_m—ü3”NRK‘‹WÍ ´XI÷m~v}iêâjÛ&1ï"ûkœ†í&qD²Ö€¢\Ú "«“Cm2§Ùª;æ4"Jº™¸m¤yÑÐu-RrkÎkÔGáx6G ¶Åóµ j«¾ø¨¶*!¬íôE›ì %ÐÄwõFðÁqÿxñBÿŒRûŽ¨ˆÇ~3–ÞŽÎO }ÄÛż^(cÔÐà¸rì`y1 á{FuVÌ1b/ãü•qõsEy¦_@½jÌà]v/q\µ¹z„ùxCß=wÙhÍb«êÓ˜¶æ~ï ¾r.?”jI|j«Æz605âZ›Û+ŠŽìàðÀVhŸÆkÁh!ï’“¤`F¦Õ=L¶*¹V•=­µM={—Íž²ù›ØãŠp>ê ÝëGÛq¡—õå†B4È^žõ%ÁÆ1ãH=5¤cÂ6gí`é![ù sÙFç&Ò#}³Up^êßêÄXYáWˉc*Ÿ7K6Ê&îÌ4ZÕ¥?÷ž¾\¯nÊåS€Õ{ò'Qü0[¯Jði#»Aèí«òóýuN¯Zé>Ž8KV®—cÐLPFûÝî‡þܬfÓI9þ~–Íáÿ¿çûðÝÍwÇÑ'?g''ðïàü´¯þK~;!DïìwƒáéééÉà´vü»þàlpvþ»^¿£ñkÖÀöõz¿»$ÜZ¹žzÛ…Þ¡?ß} GLîùÓÞqïé_Èñþ¿×ÓÞð¼7ìNŸöžþ+!Xpèûß½ø®OþæçëiïãÓÞ³Ãg½ù²¼º‚ßž|—MzÓ'ßÍoðô¾}ù—×O$øÞÇg=|þþßßþòîý›÷HÛ€Jàåò*[e½÷\WX=%D§˜÷~??ùnUôžÁ¿¿¾QZ8ŸRp¤¶îù$¿òÂZÑ÷=/LëÂZÉÒ:ï>Çœâ±É¾I#WhÃ\¾0Ëç¾j‘CcŒ%ó^‰É}h”qSo4FÆfG²]4p˜Z× Éöwía©@®Å§ýYžÍÑýô÷šb¬{å£O~ Gªså&’`ÃT’=,O"}üd¢:S†.7åa餦¶ö(-vv 9‚hµøön²%xÞ,î÷zû)"ËóÁÃwŒÜlJˆ;’­5Á(éÁ§Ø×}¥éÔB ¨[K/sG—ˆ ›³K£;x~ÖÈ5˜©5#×yc+Š«l›™³Þ`d7\|5/F­g®ýP7Y@°ëŸkŸ˜€èš>6&¶÷u(Þ,ÖÍOBà `´ŽˆÓ¡¸†5.Áÿs¬€Ü#÷‚(ÇaÕ1N€Ùb1-rŒ £‘ë9^"Ï1Ϊܸ½¨w㇎óðÎs‘’Úu?˜ (ÁÀ¨ÙlÊòœ<ôྮz{üKaeöÚžq㞶·‚nÃ\l„,$“è®ÐŽHr1ØJ½‡GšÏSÒÈS-Þ™gN¾Ô2ºF‹X¶õµt@líxYAt§×é’9ò«#ªî—, L*ŸÓ8â+„…â8wXwyj2¹G÷gD„§òˆeäÀpÒl0™O'2ãpµžÆå©Ù´ó¦ŽÑ)‚§ðst®›½Vi>žÃ㳆nÉ-¤ë×`ìas™:+¬dÕz‰>®íÄFω HŒ5‡.ñ$›+"׶®zïh3á)t:ºÿüF/?—TWâ:»·z‡<¸¡s«®sp­âNrØ,¯|Îs$Zݱu’0—VÙ7ERÄÞ‰9Î’RœášíÓ‰±$O÷¤Ç„°Q"!/¾û“,¼«d棡®ÌJ^­‰#¹ßm^“GÅ‹ k  Çitz Å¥`AaÖxF‹X[–† …R’ÍÎ!§„âá‰ái¼0ÉöQï*›V¹x÷ œÂ¾F\íÚt{û ïŸÁ\!ƒA$9n¨ÚòÔ–’¶ÕHík›¦Ð:¡¤/žØ’¾:OþÅôHa#ØÄÔn#;Œù}„ñ¹'š55Žõ¬…Õùg;jTO›•{Âgfd5›mîÉÛÆu„Ýi+ºøsñ2z³ªÎ …|³R h¹8VèüMª’ÕŽ 2•´Ü#Ï÷PmºH#I•/Šï¨Â'Û°€c¼{<&ô‚"pû¼›LÎHé>[WPÿ—fGB{Çr& 0ð岸.æäoTG‘ùr ‰lÀ,=³òí ªßHm,"d¤Äy«ç”LÛÖ¡™+B fã›ÔàÅ Õeï'²~Ü‹ã†Gó+Ôd¬&™´u¥Ûr’%¼ŽçÀ½N‹¿ç#L¹“Óú5Rˆi6$ìá#7ð’Õ„ÄØÒY>+—÷ô´û“)nH#^íQJØóã†JXG¦•dbÉöW£^þÂQÒD£gè.y~Ú0uéÃè^l/†øÚ3 £ˆ¸d´jt(1ÛlYÙlSsíiV\¼,¦„@MÍ{¢¨5èNŠŠ°»÷U‡6\ÊÊ´äËœå¯ZLÈÌ’¬Ç|¬Ó3cÏIŽùâ ЈÐÀ“~NoŸ~@-—*HÜ•ËO,7ÐVB µ¬‹¹¦<~•AZœ»Ëœ€“#édG8NgpÖH&úJ”±€ jQùF«H)ÏQme‘(ÞTÑå1k¾1†óa@K§AB#žØ¤Eu"ðP[í“ôZDÅË[Ûr*Þ¸˜N=‚3 òBÅì¯ùgòåp¹Šs¥Ñì4H¬‡9O’N=d+”ÿúò×·oÞþÉ¢v¼þe?}\n[¦†ß°/-4ã« ÿ€>4ØDˆŸt©pZ¸´)ņýf¡]f%w«Àý&˜L©DíW”A- c…µ(üÅ–òv‰»í1樣á-àG¸ØrkÃþIÃ+Ƈ\n‹S¬ªzd®kíxÖ8ŸRí-…&“¢ÔkÃ$}ì˜JZCùr—`Ã÷®~e Ô=Ã4òc4žSß8êÿw›Ï pÔBØ«H³¯&O§ù&~PÓ<=%1’æTÛiFz}ªgù2g‹æ-¶ê»5 {6ÐßÎÄr—4Ø¿?ÒlÕTópGÕi&ë4>Ägùò€Í¤ÐÇó…N'LO'…°ßö`9(P¬ß¶òùœ*=Bô î¥ – mS9 €Jð ”‚wè˜^xÕ3uT# r…ç¦ y4áXªÑØ_±-*Á÷'’ôûÍjn:]3´¿iZ;ôñçZÈZuFmÃ|!ÜåŸ9„íŽhErõ‰©j2Þ© ,ã•ÔAÙÔAŸ ×Þ²2¿™†×{htEa>ÙÓ‹Wå ½¢qÜ’öîý*_!]@©€½§ö2ÒM7ÑhiŠ¿9a£‘‰¦€T°’Ä´÷nòLW§Y­±°7=ÒÆJ/*Æý>ü`k‘ dÇŠ9¦.§ä¦eè%”¾šE¯º;Í4)›r 5t€žïói[Œ ¼‘·I€ÚŸ”3‚ÉGÌ}@¢ÿ8aêÐ_óͨqö’øçD…¦0 Ý>æ¤Ç!Ö»2ˆ=˜®ì.9)ƒÔ—-Õf¤êh%êÖëë+MCž÷òëãôËÍêÌ·òE64ض+†ÔeûÝ4­¶7àͼέ^Ç´užWÁJ½óžl,mbNVO*'w¼B³‘;+ÕºàÞ«¦á/*MÛï'9¹Ž~ß=îŽ%s{}:QÔ3Z%,5¶ë«¨îEAù)€ÿ“ü*[OW¤ÿ5ÁÈå}-ëÁDš3ìò¤pʪð{Z‰op=£ $‡w3xžPÏ<š9u²Û‡¥ ÈÉÁùn-GDbs%û„¥]áð(jX3„Ûž0á{Åþz'¼1•Ï›Ö7Œ$fµ„4ÝÍ&”dæd‰=Ç@º©¹ŽæKò`¦‡3rŠŒþήÃY‡æeïù1‡©|õî=Ÿ@ZDU»ÑÚ)9Xæ>*ÎlË~‚§mH#zz×bÉŒŠŽÜAÖζæoBÏ”Üþ|n^—^Ǥ…ïqdŠœ7+÷G™Ëˆý÷äˆc5y|Ï[VS“žyDîBw·ym ÙۤÕlÎR¨=®´iRãf[š¥OCX[ÌŸæž{Bš´óÓçß°éÑÚkx+¦¦0à¿XdRŠ¶)HH-ò 6ÍFòFϨ¨#0ìØà%¾«)™ôiàH䔤š¾¾¼$'Ç/¾… ‡Ó¾c»9bf•ðÕºPØzeÑLþÂâò÷% Mß'ÇÜRÅÝ¢k(è+=ƒT‹9Ç*êPÅv%àÄPj> ãV’¡¿8vÌáÒj|Ð +i˜æP"\ûÑÕ%*Ç)MÑŠ34`(E_LfSóñƒŠ½$Ôl±º7böØʳ\õúÚ³Œv d¸¶*Ÿ­+彩ý‘·Rý‘^à°ž„ÞÇZ†ã&É¡µ¼2!Ó ß¾·±ˆn®Ð#é,¨žÐ|ªU†ì*hÜöO ¢RJü{+Ë‘ò2½.¸þü|ùjuÿÌ“¦¯†7ˆñè²@@À¬T[×!™#Né‹^ÐöËÀ-£&®ÊÕ¥¶­ñáPÊŠí*ÛÚ}ض¢¡S<[+Ú<Ø£ÆÎÚ@m†ž—ùu Ù¼AÙ­ðØFÝ.šóë\.ÛGDô4R°øU_}QÔZ·å€Iõl"ë$ öˆtRÃ.÷씬?L› h6 ’ õeÐå¹2Âœ[}sõѵúæ*Þo¯.zê±¼n¥XlÝͲ‰šçõÇ-¶è]•š¦×lGÒ)}â ®¢ròVÔñ =—´,6ÊÛdzq ù,fº#ü›•ûTñ3×ê¨ðñ!$ÙÊ›kx1±oãâ`­ð×·QQ¯ÚŽèÝ̬ªF·`ÙÈ$;gÏ&Ùñ” Ñ‘f¤{Ö†}éM¿qdÕ:燞ފí4_Öå(Ö4X¥3ÕŸÍ´éßQ´->ùn¥êoС–ºG(·›óȹŽˆ„ãOÌ;/“gè‹q¨SE‚oë;X–ã[;A‚cùˆÕÉhF (Šúä"â‡[1šGèxu]\[öÝ8ɲGê÷ìænj¹1êÒ…Q<Z]sšËõ¬^[DŽ±³-ÚñŠxàü¯ø’\‰¼g²å}³¬2S´¼l ˆ£ ö&£”7hwðþ†f.TÀî>—.7S ›Cú2ë”ð}ŸçÝÅaªÀùýÊ+Cð½æ[>hï‚õQú ƒMÜ ™bBö¯­¸wo½Õ]z™õÓí)r¤™~q´};™û!Üsë‹Ó†%íÁófÖ úñý-; “‹5Ά¯mJæZ&3¤@|èÈ3˜Rl¾÷´@˜žÎЙÈð#‹ÊÔz41ê =ªæ2Y-*T ø‚êiþ1!Š¢"ÀÉV~°HB2n"mÀ›MaøRÿV'ÆÊô¼<Õay~Þ,0rDj§Ð ¥ÌüsïéËõê¦\>X½'‚èV :ÍÖ«´ãlJ.\r‘¾*?ß_çsá¥Á–«Êõr "åµF¿Ûý<ÐÏÍj6”ãïgÙþÿø{)J~wóÝq'côÉÏÙÉ ü;8?í«ÿ’ŸáÉàôøwƒáéé)ù­vü»þ€´>ù]¯ßÉèŸ5T4ìõ~w™U«r=õ¶ ½ÿB¾û@δºçO{ǽ§!åÿ^O{ÃóÞ°?8}Ú{ú¯„Fé÷â»>ù›駽O{ÏŸõæËòê ~{ò‘ý¦O¾›ß Áxûò/¯Ÿ¨ô>>ëá›÷ÿþö—wïß¼G‚ ¤ o´WÙ*ë½çš•ê)¡tż÷ûÁøÉw«¢÷ þýõMï)Õ½ðëKÂ'Dö)Hzakúá~‘Î mEß÷j ÚG+9X*°C¸…{î?qgdßä‘)µÁaÝ‹ÅYy†DfôÀñ¸‘`]©ÎÀÑ*­j<4Ïü$¨ô º[º&Ìô=BÒ ÚÂçÝ”h˜¢ìŠ]<0e%nCôŒhÎø4àÀÈÙ­1Çp ¤”-÷,”>öàǪ4|S>ˆ²CÕl„bÏ·¢†‚ÚüYPJ¾נ5£ºÊí!9Š n~âæåZÏeÙÔÿç»!é´!Ñþak‡ý³¤¾þ:{ü¨ƒ%”ýø3/ï|/åŸL@3†”š.à“w ž™U£º‡uiH< Ü's: Ê6(xÚ#H4+æÈ÷sÁË[Èw¡Œ¦”ã N*t. FäJV|wi&è˜d”ƒˆB%ÁiI„ „²¿2ùEô¢`yj}Z •¥¯á.qT¾‡ág4SUŠº¹ìKk¼>C„xóŽµýËõÓÞðÉàù÷ýßûýã ä–²HB¾ôaÝé‹n¬óÉh²‘REE‘þMrÑ]:’?m\2+–|Ѓ¢W,afCõ|ö&ÀïIDlì¶-²[r©ÜÈ=$õÔ1i^OD]3ý€à~:ôÀ0VˆLÒQB—õÇEÃÐäéJ*˜@”†*yLËÑd*"· @g4ÿyãg5Åú¬ŽˆÉ£xOÝÀ»šC{›UQ¸‰FDhIžuµ¤¹ö¹%ŒÖÁ•}ûˇ×Tý6)®p©Vê9'²‹›Ô¨°uàâD~ŸöÄÐÆi»%ôqSg6 ™PMÛ¤ã¢"§ÇÏ›Ó{òûêæÈ~ÌjÿšÏ§Ùe>Qíšï-¹Ø®ó•ýV:º™¸W_>S…±Ì¯¼£Ã;ßØ´ÏHsgf©Ž#ûVD6Vü#@«­}°é×DÎÚÙ8 9fÖîÖ¢>ôܤí É&ÅNÛP¢o*køïíý|·¼d¡Ù¢Š +ä‚%\j®‘y¹““¼œoó=ñöÔÍ´Ó;¾H¿äQ31Íoó)Ù°¿”"?k•+"µu“Ï 3øñÞL¾hŠŸµ(—,Q%Ê='¹í¯ŠŠH!÷)LdÖጰ÷Ì¥„,å„;?® ‚d¦è©b ü:¹§ÌE3#›/`lj|C#S—G"Byºº™‚Ur.ÁŸšô¸É³I6¾ä ÿ‹BAX·õ„—kžpù²‡ L„\g±\Nè­zW.?Ñì5x U=}½ª‘ûÅðÑÞ[‚·p_[êSéö¤rVJu«¿Ý»¬ZÍVìsG‹ÕÒÓ€Ý4ÎßÀmÈQ%ò2t«å|EµwçË.ë½++Ü Ók¿KÑÉ-×w Å+Ÿ  eZ9% k°ŽÇz`TqR^è!!ê Ó_S"‚¨+ݾ|œˆ×سQ̪žgè¥òê.åÍÖÊÓ¯¹þù÷ƒ!\s§É<Ü 1Î=¸|¾¥Igecœ„»î2“ïjAìî¼Ç|ç¹î;÷M¸®–©†Eöd];Ç5©/¨NüeMdH3ºE†©" ;a2ÉUAÉAÔ $;$W(gÍkUŠÃ³Æ·—•Ý Ž®G—ÿ°ûO®÷e‘cba‹˜£qE¸m• êÖ™‰@5X¡º%9>oA\)_ù ôtÇ— Á2F¥ SeíL†[õ«¸ÝÜñF›ÀÉ/Nûh„¦…Y›ˆl­„ö9H\³ƒì³²iø´¹“{Öœoª«¸¹E÷™¨9¡<¥‹ÑÁÇóÊH[µ¶±Ú“­¡"çàr-r= ‡M Ç OÍMˆªayçäû ýXþ¿ .ËÉ}gο¿ úÿöϧ¦ÿox¾óÿÝÆúÿŠ=߈󯀾 Ï_¼K·_ Òx’æð«€94-Âðþÿh?7 &‡Fa·›æ¡{¢Mb¹f¬™7ö¥æ½ŽÔêEyQó1ÃþÓ¼µí<‚ãhfMpp®ƒ“à†Ì»˜>È|åz‚©8æò¦–Ó±¾ýi“u{ê Œsºé†ÖÍpY¶°SCÑ|~ÍXGžÔcéµ7Jí ‡ö¶gQCu¼#Ÿv0r]ö|Üj`cÉ“û¤åÈÎ+-”Üh±?/™°4—nåh9ÏU¿á¹bNÝè1¿^Ý0SPã Ö;2‘å=,eÑV„J…pþb^ø˜îˆÌ•Mƒzr±sŽÉ0{x(¾§gŽùRõnÊ»ü6§þx†AÞ ÈZ‰­ñd±³uõÿÄWD‘5çÚCp6™®ÕõäÉïaSë¼cëc%é–èžå» §yΆ¨šá.»Jr—›T¢û»Q »A/®‚‹Mm»³b¹6¾~[7Ékm¾÷ØÚŠ>íØ5v“N¬íš¤ð[>j5©Ð êד1Ù ˜#Ž.DŽBöç[§b…éИz<ý½!­^ÂOÍ~Ó¥$§Q>'ÈV>ð¸«ì¬0çæÂ5¿Gõ’0Ÿi6oë­§ÛttôJœ†‹£ñ؇7!ÿF?Uݬwc⩽áæž-V÷® &Ã&†•‹JÇÔÂWðɶ„ʦDȉýN/ a~?:¢Gó^m²(ÇÈ”›È œ.#z°1!w2“˜7ùdë×bØñ¨K¦1D×üžAz ¿,œ¡òÌA!ÐUCqF›-¦÷ÊýèA.C§‘2HîëQx¤ÃT7åz:á肉U1ƒ1= ^`´ð¨f†ðdš÷a"²—Å$vTh6 k‰ Â\q}C>îj…E³ Çd–È>M6ÂÑøéÒ†‰` ªO¼ßø›çcèôî€3Öö2Ïé7Ð8:Ô—õ`½WDߥqßìå,‡Ÿg1B;<´_‘‡”åÿ3ËÆ˲êÒý'àÿÓïŸþ?§gÇÇ;ÿŸmü ÿßó¸ÿpàuÞ?_ÑúÂ~¬ó_«»|7îŠÔŸÿÁ vÃÿïxxº;ÿÛøÁó¯ìùFH€?à˜ä %ÀZ.Zš¦U6Ã&âOT¸ö¸ÆµÖÅF‚h2PØ•Kö´¹R º»Øƒ˜Î]\¨h 0ÁËKv2ý¼6ð¡–ßWÊŠ˜ìfy™^t&ûƒ)LÜöjqO˱`žoSËÕËçßÒÖ{CŽÓÄCôöØ©Äû xq8`ÇÉSCis—ó÷KT¢ ‘•(esOUbýFÁÄqtÙ»tAýÈÔÜ9CEU•&ÇzL.bz01ÁUcxÚ m¼îÝóÍ«†Öî6sÛp,MºãFR.ÞÓËöÏtŠv¿[DEÝ"ªŽÝ"†'Ï[’“\0“R‡äBópˆ%-=¼´bƒ÷I¼ÇC¿-í77-”7,yÏüN ž ´\LX±Î ÝPøoÈÁAÃÖ÷Á f»NÝ ·zwðÛôV¨Ç|¿¿‚£Ÿ0;»Þué³ é‹Ïk¡]ê&üHO­´µ]L®U3ë„ýXul°?Cì’¾Ý(¢ÚŒ;qd¨Ä gëE;w7}d ®›´—†!Ò„ÅÐö:ÝÜH¦;&˜HšÌ4µqQˆ¿w7á¨Ð\Rjï°ÐT„WÝ滹ç´A ¹ªãw50Ûœ œ[´oÏmÙEÀ3‹7ˆDäÓiòôöµÐóˆ–Ÿ0%_(6Ñ©{†}Ûð*pÎf~ƒÓ¶l¬,x¹×œ­/ÚxiÙÿàce^˜NL€üƒÓó¾aÿ;ïŸïìÿ[ùAûŸ¾ç1êCÔX‘ÎüøOLäîýAKdtó‘-ä'ä}¶BfÀQ³’}tæžÐÒaµ eš±`³h˜d­¶¦&s6`—º^ÿ`b†¶Z u©2t¤ZõŸQ“¤²ALjk2¦÷Kú´ñjÒˆºû¡VÍDZÓÙ$X~3~%a•3Ÿl:+Ÿl-™©Ã0Ò¶6é-sº~´ÅŠø*'’Á”\á¯òj¼,Š-Õ¹ ‚Õaü°ªÄA!£‰ØÔÝ‘‡—PY £vM­È–"˦Usˆ’g´š5OPÕÄtvú¸ëe¶¸áŒÍ+ùœ¢¥2SlÐûž³!ûô¬ôþÑ£«ÕÛ§y€XÚ,í}üØzÿ™?1OêÞ“‰ä#CÑYÔþ2ÀÇ࿧ì¿Éÿ‘Yþ˜üðÏþG¢Ÿë [ñ/û|ñ¯RAé½ùç—üCû«þ—пüwò)¯Ø¶±¹õþ ÿÿ‚üï…ñýkÕõÉ]Xs²ž\þ¶'Ç '`NëÁ&÷’n¯µr|’ÊtnzεӧøÓCík±ºÇSuÑ{3Áž±éÿÿcÛsëõɸýXU¹©gäT¾[æD~CRG—‹Ìf÷Œý+g /ÿðìóÒñ¢‡ ‡ºÃøžRÞïæWOz®ŸýÁûeÈ9æ¿œð_Né/ûgìßsöïóƒ'ß]”´ûýꫯ‚w–€óºq+wðSõÆ¡v¥š”³ƒ¡§šÒ_0(ô\Ñaî+%áË=‘Ç[焬ÅB©­Ö¢œÞßä“e}zçÁIm Û¦KÖUmŒNWÒ…eªpWSèWñŒùjË¿ô©[Ožú/y9j R›ë²ÏÓ'ï¤æ¨\³wéÎúm–.›LŸû`§p¡…Q9VW.½ž:;€†RP„Ef:fp# ¼×’/×»Ó48Œÿ–ù®}Øë)Üú%coÔ-ᔿ54VÔÈL}P·g­È€Ú_‡ œ©˜ÀØܶ˜à©mðM`‚¥F±0-r &´:RQ˜P£S«¹©NkYÓÍí°c§´*ÛI_ɹ;ÿWn„‰ÛÆWÚ ÙšÏxØþ+“è逸¢Ï—õ™áÝluà3﹦ú=Õ DDé•iœÍ{—ù…^ ó—÷?^½~÷úí«×o|=úííû×x0ÍD¤‡¦ªb:ï$p¨<ªõëË¿b¸ Æݲ?Ó¿àw ~>›'ûWÓòî™ì î__þªÀ¥.dX1Ô~6_)€CÏVeÉM^*üÀzæÍ!p´ž©°Å5âw"| LÞ¤|¦k[!³®È•û[Eî[ôÓâr™-ï{ë lmãr~›Ï ¶þ ø´—©Ê2_ºsWÄåÿ…NnÝå~€Ÿ@þ‡ãa߬ÿtzBšïü¿¶ðƒþ_lÏ7âøÅ`w™÷A íð¥bP<œeZ\®* ¼&®ßNN z¢F%Lá-jÚæpÍH™’Bx6@™Æ«â3]6ÂI—‡£mJ®MÒ¹´Zòç¢!xÎ"çf¶/DSÁ²›M%/Ï›¢žÐl†›,…•'·¼2.îö®L ²‰¼áήÐmm wf…ÞbYÞ¸æ*éAã˜^kEóÈŒàä[0á×|D(šMá¼B^çÌãœ"ß‘úH9 ÊS™MŠ †ôü Zõ, ë }%”¿«dW¨'j66OÉà ŠÔÝV”¬†³’Þ”U¬`v†ó4”²²2[©…Î×mŸ.ÿ¡A¸¼3Tþzê sP ÏÙN(ÃaîËMi8+Ùã}ˆØ±öžÇÈÓhbj"¯ó)*Ü*žÀ!œÇÛÐŪʧWGFÞ@‹iE"ÝP¿á&ŸN7HÊ¢Cýçí=@Czâ””rÝxFà¸B$7>Šïý P+íàÏ‘–xW>±ÚJ]®±k¼“}M°ó^æ\Q-KÍE3DñüP;¤rCŽósÞÜ$g+{?ñ8ÿOTFÞÀÁƳ&Àf½ë‚ÈèJÑlzN0l—¿¤³$ԅЛ;ŠGës*Í í{ÇA.•p?1yAæÕ]Óó(.½tÆä þXaì±16ëZà>²x\?°‰4ÆÈø:Çø?Ò†¥pÍB9Ñz‚ @ý\L´4æ"œÃk¦!1XŸ†³¯o*Òs ÷ƒkdz*ôQ•ÖöXõìè<¿³î%®øZ¨‹”¹3Àœ= Þ“Ï}C×öÑH½xb“röÊÇ ù3Ò|‘•‰Fí›…¦Sû eŸé†¯ÞFRšDÖ¼FLSÂws´¤°ÉëIF´‡íŒØGä‘%±°±›Ä"§[Vt„3BÍ APnðUC¾ÁËþCŽJ§Éÿ²ÿœŸLûÏàtgÿÙÊÚpÏ7býAÈÛFò¿y=} õ¦!“²9wß‹Zö^(¼Ò¸šò×È]×ûPí¿Hïï¨!ßt&(¢„o0©C{ZÍay¾Óš¢º«Aó`1×¾·¨@,êÖ‹E¹v <äuÈ​’0K J1€7à#¹7ƒƒ¡ª7o€›È¦Å߅βÇZÑUqç ×ÌYð·b[T¦Ú` ó‹2"È\ÏßtäFac·Ù²§÷GÊ^EŒN¸²QUG·?Y«pŒc Îµ{˜Ú¯ù0Œd5駠|ç]T"Â\Œ'­¤pã6PÖ³ë­,zßß“Šú‚ãï€üÓ_Þ%̯ƒýîfBÕ]¶ˆ]¬Ú#þžR^·aãiž-Óˆ‰² }}*§â¿_xDÿµ¼,Ó(Œ,~¡ÛÖî›HõäÝ­>·jPœŠÈió+/¼Úe¦}q'ÙBÇ`³Yþ#e@šý/i<‚zKê7¿‘«ã÷½AÄ$&ùF'ñ,jÙÄ&ôQÃ7™Õ€¬ ùg7¯Zë™Z- fqݼ^®/·¹:ÏbWg¶žns^‡ óÚè®FíÚ¤¸埳±8X”ÑßÄJýÌ,ë}ß»Œ¹²¦e¹ÄÉým;Ã÷qzIó[n~~K\¸gdá{M¦ø·ÔIv8÷ËÙb öø¿õ–½j=¾¡–“Œ||ÐßyYÆñ³r²ùÅ&ƒàrÿï(<½oaJ| ó$öö¯iæùÖ¶E×mQ•KêˆZà˸-‰l]…xÃd:ø,Z*Ì.«®ÿüŽá+"8tî žóÑeV壡g+£„9€²@ê ÝËÐïlƒ¾{óšÿÍZþfw ¹oþøGßÍg :·®ñ ÿ+vP‚çiB:Å¢ˆøñA×M`ÿ!ößóeÙøÿ½ î…¸‹_6€ÏšC‰^q9í›öþ7bÓoõ\J-]˨œ]÷•àÊ~¼Éæ×”º `ܹRÓÁÊ#­:²3¹ß=¨Õ=ôi¯U­®ÏhúB&?(PQp#Œ×{4ÓÞÁ†Ís£AÍXý&ck½Šƒfƒ˜å@)Ü“²r üúÕzþÜ ?*ÒBø1žÏ‘8 ΀ßùžó´ä€MØÉ]Õ“ýÎ<™\Â=\øÐø¥x‹þhô~&ßUN£ãË~ä/èô¯R,a‡<úKǶ—UAu­êÀÿjèXoU•±¥¯²Ûœ;¬ƒ ˆ²Ô¹Ò¸lP)І;jÍX…Àè]9}nžæš2JÀ=¨¾ŒY ”*m‹å¢ z Û|¼"‚¬>¡¹Ë¼¸AÑÎ^}…ŠG€ê‘ˆÝŒóÇü†]è ZGáÄÙñæqB(I9fªúÖàR<Í–^Ô@£á&é1§†[Áö9ÝÐÞsóJµwTÛn œ[íºv渔ˌ@©¬&XèmÂrlXo‹y•/W£Ëi6ÿDvdºžÍ}mè[{ñÚ?=Å€xL¯¼Í}ò·ËòÎñj1…Rlucò6ž•#²–mvIxïÀíénKXO¿%ˆÐÇÏMî:€Ðj4’%Y­—ŠIîإ̩µ‚®mž!èqÝNiDéôÌäÃë®zñ{—›±6´øó¬zæy~ÉwBÄò/ñžÅïS6àµèPßÛ¿_(Á@Ð#çúåòÑÍ¢ŽìÿY—«"÷1Y[yÙŠ§<qîeô –•HÓŠxÎJ#vÞ¡éútË™ôëF9‰`~–…CVùñ¨èàÓxÚ)H"&Å0¨ÂËœë®lz”ŒºÃ, ÀÑ%ú}³že´´’묺&ºNÊYÑvO¼ßKK5à Qa• õ±ÕX µ>h3t–‘ônÚÀT]Å왈ü0.03Ü[=”ùߺ<š¶ý >‡kwŽ‰®šºÁ ‘a™{Y ÅXº­ÛN³8…7Öóáæ%^ÍÆmöWlôÛ>Z6Úxýù²)BěɷŽ)è;ð+¿ ›^œ$`“²¯á­OÙøÆìòáèv+É>…/Õ´}Â<) äp—ë–D;œsp©N<º{÷R¡ï[$ô ‰FbÒº-JuEévá™×ÍŸÜc?ê¿8 +«ÞtJf¯ì#‹(; áQܢа׆t»ðŠ"Ü­—p2|ÎÉEdR8yiÌG,‡-•?þ¸Î™ê°B'fᢰpx|–Æ×kíjtÓºô*y/§ ÖM·„qbóš½ßéš½Óð¾Æjöv£;Õ¶¥¥-äÂòá±›~Dhà™¼àÖWÿÚ.0ÚeD Šzˆíˆ¼"¼æ‡~XšW-yæ¾ÌÐƤ›º ·9ûë݉AXÖJ¸Böb:³…·ôn˜3 Xß;EëéiîÓ~òô$ž\_j‰G1Ù¾€zyÏÊ9Óçð]}©»‚øŽ&ʹ¦ ðÁF€-$§÷ëëß¼óËÛÑûwØáxØ»„Œ+ûÁ0B†{ Òê^Ñg'¬e²”8G½Ï_hŸ¹£ŠÅÔÒ¶&à­¥…ßäãO=œ…˱êR™ æÃý.Q†»œAå-ÔÚÒºÇÎRTu$bâÅDÒº©˜¨QìyÐk¥ßAŽ®™»Í5œé†t²è‘¿”“õ´|0q趙´o†é¥S%Õú±È0RÛOý@ž ÙØNn÷ò¥^ ,­íàRž`F( âD#’ØAj;¤fdág ÒUGRRýœ­§èlyøM9[ž÷S< œ¢f׶çyømºAžŸ¦0ùÊn99c#qãLo.•šÆÓÒhûëÿúzì¯÷»¹ ö8åøå«ÛN)1dË•¬d ì¹g£¯›ÞšØ„SKû;“L«Ñ¶œ'ŠpJikU$Ÿh¦‡²ÏuÏ:÷¨gó¸›f|Í0a¯’øšù*¿^«{ÊÀ8·Íæ}Ü—#Þ¤šöÙv]ÁyXû°Nt´/"?\Q.͹Ü_Ï9"ÓnzŽ~xœ´Žˆ?4$w)¢ÁæÉvr¨7›×o/°k:”˜×xêó¥0m¾N ¯6ÿs¶ˆa£vHõA†­vš«ßÉ0Å+A+zXO…c½5ŒÐÔ¥n…Œx6ÏïFn‚»P I1ÄÝ}m†z¨©’O„êÓ)Oè‘ ®Ïˆ0ôôSlcÌ“Bžuj@vÙ˜½  %¸뻳?léª4¢¦L»BÔÕ8ŒÓ]LŽ#¶‰±UvMeÂà8N ¼&‹b?X±#zŽZý¨N¢i+§K#ß«¿fKˆR6êŽ>éÍÇÙsì6ƒ¢%Ï£NÁBÙ&ÅcÊs|À)c÷À®åJŸjªÔv ÆâDœïþó øt:-¯ýÈ­n`§‡ÍyDŸ]ÌJŸÆø¤áJ½4Žq<¬^VLhÄóTõL‹_ð±ŒÑ}²[¨À²1Käü ýëKã“Žùh­âW]-1[ÄñÕ«C*HÝÙb!0r ²˜Ó Oè¯z—ëà•R<‘¢Þì´ˆL2}ø7@(†b*½ÏóÞËiU*øcŽÞªóY³ØBS…ò£µ‹­ó-‚U±“ÆŸ 7òNË°HÚá¡ûŒÄ¹,Úúp~LÂ~WGB0£kœ’–Çy4¸ròô8Å–;6æ0øöÇÎ>Ûfƒ6¼?Þ;NV«Ã¥€¥#«Þ×~ª“ Ý/ÏiY_> ÅïÙ7eñ;{ŽµÔí»q§ êë?Ÿ÷OŽÍúOǃã]ý§mü`ý'ºç)EA*@Ëû¨i3ñD¢vè «æ'­ oá7ª ç5?k+<`ÇxÈ.p¬¡RnQí* bîG´ægÖÈHœ §h­?\6ÔÇà'°r/¯ ö[æ×¹”ï龩δicšC–e2¥’RÔRŠ2)ÍwƒWˆ° `1ð•Ê„¡ëÙ¢)Ò:ÛI“¬]#ÌÛ•öUmŒüˆÄÀõ¹Ã¨CÐnŠ> T`h¬¢ä-‡|I­œ©tô?ñgԈȒ­ˆL¹^ÕQ6z˜µ•Ï”‚§üÖ.¥ÅNù#,€ª<â¬`ÔDç Cü‘¬t^m5KrBZ~’ÓŽ1Xà­Â;™@ú*h×ÛƒÿÝë1}sü(ðí”`«€‹\ùŸÀ^ŒÀÇ£?™‡Î¡SÙœ+‰Í!Uí2<JmhÚuòq,ÿlÛûRa‰0]¾ïµÇÕÞsѽ=åN|Ðv;T<Õ~y½w—O§¨¸Í'¸Ðod9ã>Wa!.ù²gKH4m{IFž¡žÿ2'Á„ìÌXèù 6s±ïr´¢‹˜šp<˜  ¡ÊTÉé$†Óœ+y.µ}³õ-¢âûÅŤ„Dºvq13p TFÖ^RiÏ÷vYÞ‰ºÜbä9!ŸRúSÿVúŠg ¶Pe\êv¬HéôâBQ/³‘ôJ) ox#¿ümsxvipIœôK=â°`3ÏÉ ¸». œ6LZ–ò޻ɖ"Å.î÷zû`–Õ½á!Kû ­aa&P#VVëvÆ×.¾-1µ£…ëjIkzÑ„±ˆGÖŸß)sM=XF=rëœ!O÷\÷näõæÏ“2†ƒ¢9ä /ŒŽ¡`òñ9¿5Ww%ΗÆFp¯[Õºï&Q9áà'QûX ä./ÆIîÑPìU­ËAMq5ÀãQ µèí3l}_pY{vþ ID„èI{,5ÒêSI}ôÇÛ¡>4…Uˆâ`+Ÿ /)ÁAªŠèY>+© ¿r ÊÓñ½ˆú‘49=ï?$ši©–¨OµœÔ6ŽhO£P¤Ž³³ñA»Ý˜±a‘Û7—¥<‚„jåúú¦IÔ™Â̲ÏÅl=ã±eŒ â‹ÝS?Yÿí+{ùj —¥ÀAÀ¹?ÿò××ÿúúWê͵˜@Ú/êŸ%r(0߯+:¨ 3ÍQ>ÈٜݓD¨0ûâ0€™08_^}Ï'Z ù äRD)‘^Žä L´5P×”Ð*'$‚ÜDBÂFƒ-:Ü”aç«‚\%K0+:0¹Øq¾Ëœ^/vÛý—o_Ñ"ÿýò/4+Äoo_½þéÍÛׯ$2ÃeùàÛ õlÁÓS r¨Ìá­\äK"3ÞÝ ‰“›r=ÐéRpãÁ ›O˜—7ŠG(ëÈe¦ü%Å$Âã¨ü .Í9íKHI®¬/E7õê´´ro…ˆ’tƒC0z ¼Ô;ŠÇÞŽâê¥Ø#/)QógV‚ƒýù‡¾áˆhâŒÑ3˜w3^ú÷Ñr[7ÈŽM‚í÷Í„g4Ùø¸JK¾¤í.AÞRsQºž–—d#•þ(0_·ä¨¿ÿ±ŒŠÏ¨S}š—w¡1ÃLä‡À¤ êÆ"ÅÉ# ‹Lç8ÔûhŸâºa‹8ïEn[4:Ç„Zµ÷¨È]vÏ”d&\ÖZCW‚æsÌÈΔ4ÛTÎœž'\Mí£½}ú)µ\N(#wW.?ÑXdõÉÖi_å7ôX$N ?Ò ±‹ Ðç2' ¤Ïö^Iy6¾A$ŒBÔ*àˆh2uÕÛ¡g:åÔoBÀñSÛ:ÞС†I­Ùa§Âo®Â?>iÖ:{ÈqàÖ÷èÑäõG¬§Ýûu>_ŠfÝðÀ–úö(=;Ϧb-{æµü1éòL‚GòU#ÇS]Nµ:Èÿ£¾©¢4}’_eà‚+Yà 3+EeoHõR€ÃªÐq“;'Ÿ-.R¬†ñÙ\ Ý%i`Ï&¬*89‚Û‚.ʇëjÙŒL ¸wº¹í‹¤sµa J›ùPñš¹2¢( ;HöõL$ÔÐE9Šùm9½Í'”k¡,«ä‰â>Á@oм󑓈±Á°‰_ ¿Lù †*¿$Ný"še¥[ħ`m¬)ËÄØûÜTÉaÔù^—ŸDž¸zùÐfVN@Žþ J©ŠéTv…Þç†Ç  ZŠÔ¶«bØ~6¡ù‰´a¿U6l7^Ê0‚ð„ƒmœÎÝ¡Q˜—3™Ýѱqèò"^©7p;-Ù‘ÅêÌx´2KqƒnW‡h»4i˜ÚYa’ù»ø-¦ñÛãà/»gg4œ¥]q°íÜÇ‚è]25L3q®IìÕ¾,é…ÑT{önfèÀ„»ÅVG²+õz碯*ôó(Ö°˜Þ+Ä„³<\ìh®£ñ·ºçÆÆ@t¦º oÈÊ™¢kfjÌuÍR‡·Á÷ôð|o«ÔÈxs[QX åyœì-$¤- úž;ú¾|íxLdn嫲[«c–"Ù¶”¶ñ›¥pŒ>²ŠdÌwš÷æÛ:¡¹t $KÂtð]Å5!ÿÂd…,š°’å/a¨ð—ü¶`j—x;³$‰&Ïã>Ä¥t.5˜ÏF î ˆKÜr¥Ð¡`lfe\ô™«Pzþl½*¦ô <#®«r•iº¸B–4>¾Ž§ñ…NJÖ&Í;#*1@÷îüðP¬/I—J×2xžÄý^\ A¤4Q”‹ ðK–Þ²ÿqO:Ѫä¸ižQ²£ß~}c>ž–å§õÂ|ª%6  ¾Ó‚¼ÐO2³G˜™^;Ž®Cwœp<¤,“c›´Yû¤\õišõZ“D[ÑõÁŽ/ݟɾÚÓ{<ˆ¾¿âÓ;*(¿™º¿àiv* £4ŠŽ·©æ"×èÁ6ξ_þÐÄ ÏÒ_ÕdV!‚{q›MYz+ÔŒp d üó8_¬([¸?80’ÂÉZÄç'åË|~[,Ë9J~"WB)Ï›âúÊÆI])=qÅ\$À·Apü°JûÃðààª1c Õƒ¢ÞŒéB…+±7óË»Bíþ'Bu:Œ¶U¹½ äS,:G'<âBD½¦Qï:”ñŽ!ƒÖäóxrŠ¯jDSL¿æ6UåUÙKŠhÒ(œHA>¶ E= ÖAO•[„¬Ò'Fô4.ˆ ‡ÜQEŒU¹êgSz/æ ÂÅÕ«‰Ë\ ¤ý.ÄûÜ Æ1ç'?Q**uc C½»)Æ7¨ùðTù“.­~¿‰ÏáÀ«M’ho´$$;œE[´bï.~w( Cê/™J•ª$Ò*ýMƒ‚’t„6¾¸ WÚÇ/!ÓÀîç1þXùF7å,±l£ëÃ-ÊëÅ:tÁß%-…’EÔçèŽÉïZþ‡áÙÙñù.ÿÃ6~0ÿƒr/¼*–˜Èä¾'ˆàFòBÔÊAˆ¶7WRtrKQy€°r8B„y»ñ4»hEÓÂÄ4D-.˜EÃ'ù\_çhE´%+vYN"¦Záz=Í–á¦äd/­æëé4Üj1%·ÌhMv=¦µé"šÞÏ.ËiDCÆòè Y÷CŸ³ÇúcÑ í€gf Ðÿã~hæÿ9žìèÿ6~þó=ߥçÀkh:Š?þc/zàtî/€â¿‚øߟÐWÈG÷¹DÈõ,Q‰êŒ_“ÛÄè%³‘Y”íWùŠúü½Ê«ñ²X(© >дmøÍšž‘àÏ’z=pI×aTqv “ÈY½rY\àÒ §ÕÛŸàµIøy²÷ÏY…‰ò9/º€s& 4î†i˜"£¾€”ð…eΡɇŒÍü^‹~Áè•õeµ*Vëóªx´ˆ²Ð\Ât kRQ!î@.ó Vø“r¸6˜oHp|ø§O~á_*÷GY,ïÔÎÝSsš²'4{>ÑB ñ‰ªeÁšS.>ÑMzøHÓíÉ'¦zßT–—}ìö!ó,ŸØ~eõ$JøEï/}ÉÌåŠðBõ™e¤9Ô§Ó…µÙ‰÷»Ÿü8ù?‚~]&€ ÉÿçäÁÿžïø¿­üþìùÆØ?Ì{ÍýѤ²i̹®{,½Zµp³zØÿ$oO#(¡²êB“™§ '¬‰Ü!¦ î­ç°°œ1œKb]è5êx£s3o4k$„Íèâb²xúä~W-Z<¯»ë.7kÜÖ—òPžØï”`GÙøú¡Ì4Ïr(Ø’.G2Ӄˑ¢‰Á*2Ø{ÂÅC7 ¤Ü<à ï¤ÿ4—qgW@€þŸœôý?žŸîèÿ6~ý§{¾±+€‚O¸h‡ä‹€Ýªÿ©?'80Öª ^¾ ÉýmcjÏ+Š¹´leTŸ&\¿+§÷àeļ™÷•¬‹óÕòí¨Y¯ZO½*ƽYžA0ôÃý+q ØœØeN-Øó<[ödæ{"‚ôúعbŽ `¬eUÏ0‡=´°6,Þþ@ÞŠá`zö€s–? ‰$  ˜‡´¬4†Y50iÅʑ΢V/ m¸_b¯?NÅiO%¹<<5“ gåàíaLª¾"”••!´W@Ù}ï–ùb VcÏk½Þ„‚ŒŠ•Y>ñäõÚ MØfÏTq[/Y©?«Ü ÕŠëÚ‹….¤«…1´'M‹÷™»4àé Î0NøþGè0v›üè6٠߇ڎß>}ò’S% éPJ¿Õløyç¾ÛÔØMÝ©¿6õcñÿÒ$ÝYzþx~2°øÿ“ÿÇv~ÿW÷|#€:@—µ@$ÜúŠ J;l#ÿN¨¢i6VµE>ÒF åý}+9H#À`± b‡§¯ý˜G¸Á3•U†Ä˜Êøjá*QúC¡È…f—³N(6¢ô2KŽ¤maôäæV™Ç@t5Ú­BÌ8ÒJ«²ˆmà?UÎ*#žm0ʶ˜°á’Yy‡:œ—w O·òÝóK¥oXêf—t÷y­U´¶6,–¡¯â&–P[AǾ¼P¬È† Q S@÷0{Mj‚|=¤·¿cùìßþöóÏ=²h3ô œˆ8?l‘Þó2¿.æXÞud‚Ø™ü»KrðÑJ¬Éó›Ò 0§~¥0¸ýQ(ûð+ãÁE/ –g"«@&ÌÓ 0% +ÌIä¢g^Cc®QÑ·ÂO~†Ò›wµö/×O{Ã'ƒçß÷_|?ì÷/™ñ¦W­¢ä‘Ôü&}nû²‘;#‚‰B.JäCGJ…œ=6PanÎ-¾ B0fCÄk¹S8ËA»(p Õ6P@7¯pp:òCLpk4™J)"àŒë>o¼à¾ ýæí=uÞÛz2´W±Yæ~å u£eë´þoùðú‚¥Æâ*p圈YAÀ!×ÑQaë0€t‰ªëöÄ( í–¶š˜EÌfÁRZ*`Òq©€ÓãçÍé=ù}usd?Vj ©Ï§Ùe>QÍï-¹Ø®ó•ýVF ›¸W_Q@…±Ì¯¼£Ã;ßØ´ÏH«4â––¨Æ¾‘•üR ÕÖ>Øôk"gíl†3kwk›«%µ÷‹<ê¶;mC‰¾I´¢ ·Gû2îk¤C^îä¤/çÛü¹3Ý3SwwzÇû“C{·IKý—²â Ū\ái.÷˽¹Ç䋦øY~Ÿ¦â'C¹ç$·ý•È2Ý%gŸoƒrI¸§:Íž“<_ÀŽs¯êry$2-N×ãO÷ S£JÎ%$`&=nòl’o9èËbÝr¿>Ú{Ë™¥Ê}™%e‰þvï²j5[±Ï-VKOvÓ8|·!G•ÈËЭ†òuÙ“/}ìÿ+º0ÂKºèH´  ¬2#*Îzý5‡@ìS@×Q¼òÙÉ ±P¦ÅVøXXƒ½p<öÐ#æBy¡GS¨/ÌT!80?Ö…R’$*ŒÝö¯î0&M·çRÞl²nýšëŸ?Â5wšÌà ã܃Ëgá[Š‘tJ,Ý„»î2“ïjAìî¼Ç|ç¹î;÷M¸®–©†EöæVRwå¥j;M&bó*…“¹Mãæµíæ mÌá¬çW®|ŠîèäCñŠl%]žS¥ÍJiq@2£ï¼™CíD¾¨·ÿl€4½˜#¼?ëÍ>˜ºp¾t[A+úäüø‹¥Ê¯à® ¼5¾v²ÛJÔPM:>õ?]p‚–ÍL üÿÖísÝgZ›«‚6 “cà@•µF—áYcþžóÙ‰—õxq¸»˜ àí>â‚ „oYä·¹‹ÝEó³LW€Q½UvmW†ód(=oÁ~:©~Ç™ ejë(44Ãèë}¥j&R»¯~ìýýŸ›RH¢ê¯°Ipù( K¸/rqû×½¹ýo‹Œï*Yhû¤åt1Ú\<­HÙÂD"À„C÷ñnb'¨Lö«`âè—£}™l ª@6Dؾ8#ŸtÏ·3éVÙUXCîÃMÄpHÍnÇeà@(#kïFÉÿYs×ÂÒ0y“Ñ6±q¯Ý¯æ„Vl)>±Ë] GíÉÖÐÂr=Žm$“³æž:ªÿÖ.¤Ógü7˸×Ux þûlxvfÅœŸíâ?¶ñ#â¿Ùžo,œÁOˆWò>6 dz.ú[Tü«mD™S÷;L‹¢<çÜD/§tŸNÿ¬=à¢L릥U(· ¨4M¨öLäÜg›Äcä‘P7 “gÀ\qòjxü2¿ÎX¥, ãMb2‡¨ÉDÓ2Èi˨̖¦‡}{úä=>ê½bzû_5-±8ýïÀ?ÍçÞiº #±åÒ,uü¡Vû=ÓMùì¡QŠ=kJ7þÔN'Þ¸óÆùbáÓ'?³‚jµB¡=¶”^'‹þ׳Vœak#(ÓÓ'?M³kZ—Fäh¤Ic2´_œÇ„4’°Š³&Å„n}¸Âî'5… mWŽSDƒ/ O|WС±4„Æ<õ»iù/…Úw!Óf³?ó Bvø oÖ“Ùç/¾â££ÝÙô¾æµ~ŽDÓ˜{ûäËIÈ¡j>b8[ƒÖßÎ×ÞÛÑ9`j…8° ‰´~fªƒô¯÷ƒ.¦ÓxÐG=\L¡×;¤ÿpvë&õ.ËrÊüW6£¨Eÿ¼Ê ËQëE´ò$¤¯†’:@ël%M°Ag5~™œY@?ÁäðÎͽŒþ5–ÐÓÝçcÞ<à[Ë hF~WœÍ¬±ëh•yÜÞq|<µ©ZY]úÇÕ;¶YþÇÂË€u6£DY‘Ž¥DbTòÙ‘Ôfôü9ÞÀv=Çl?–&a‹”¨Ì·ƒôÕÙÝgÁåÐd]Bq7P¥0²„ÂÊžª–µA##ÐCXÝE%eçÉðzÿÆ`éàô¼ –zåm:í§]54úÒµñÍÂåµÕ‚3^ÕGÑòÃ@ÀÈžtd Ì¥‚0šÄDñFÇ„gí¶ç»±¸ˆ^þª§Ò@îf‹îµ<$?û”Ï2ŽÇåêñÜ럆™n+·ÖCE·K#ÔÞÕ8"à>þì6Ü^õ§Û&auÑIÅÞß%‘Òw×;8n4jÿ³‰´;~ô“&: ƬÈpdlÈb~Ms!äÙøÏCÔ™i{dêÚ6cƒGÉîî*‚v=¯»Œ ×Á® «Cp® wÖO–˜í€k‡ «ŸlIÂùFµºÇ›šØ–.[}Ùe¬x„>Ɉw½óá](b<@¿74¥ñÊ!³ÅêÞËÀ„ØäÈd©c‹9½0›pö…Ò<ÿ‘qzí{±Yqœ‰æŒ¦²A‹2Ù§x˜O¸ãº°ÿªi³UC~³:oè.Ó#f‡¼ˆšR5M•9øš$îxé%q4ó«£2ÌÍë¡3Z4­£|¯\×ü24õQ$ƒûµÖ™$"³D‚’‰&Ô&¡¬ µ¼íÁæh}Þø†ìù²¸¾!Óº€ðÉÉa6ÞQ‡ãgB›qÄÇE N\ìýæù$:Å;€“¾ÌsºGé_íqU ¹¹@go¬€D;>«¹aç³ûÑ~,ÿ‘G£³ò/ÿŸGýß³ãÓÿÏV~ÐÿGÙó8ÿ(ð»ôü1’úœp”ÊêÐDü™àð#A4(\<ú•æ!aá;Õ#e÷G,jËËø×Ëž-þš:0/mÿhòá5ûçA’‚ÈÍ«ñMí®Íä÷ˆ˜r°Ò÷ð[#ÍñÜuËñ† +<â‹Ù„F7/ËÀÜÅd'ÓW¬ý™1*¼QaBV­2)žXʹGeqÓˆ\\»®O=µlƒÑCE/‘å©fBx·ÃYÜÇ9Ö‡\«ûÉÆŸâ×*ÿ¼È!3D†ÈêÑ㲘nôíø ÀÌ„+"ÿ]®Wq× ý¨Cícä31Mù¨"'b±Iòf’Ra¤¹½k°ê²œÜ{ ¾^§¬LÃ"EhJÔÉØ@½zaZ…H4îí‰_÷@Î5jûÈvèqG¥k”÷øôö>FäÓãáÃ^N&°›¡%îs«š¿¬Ì|²)¨'Õ 1Jª?=U×t¿Hü¤G“-5¥•±ªåÙqÿ†n¸h{•€ä®u]HBn^èlø< %Œ+°N¥ècyy¨  ›ûó"M-燌Ÿ3±—c„:«?4`Æ$YD†)FùJ#øž”óÛ|^À>0 º"ËÝHvÖ#V¦€ŽÀs.ÑÔ= 5‹Ü)‰&¤£¡¡ ‚úáÍ ]ï0˜z/rÿØ#j˜‘¥"öÌAz„ÒS,¦¶Ršýè°w¹$æž½‚U¹¤ß&·˜ÐÉAú¿H¤h2‘¿šdQy¬fÁÒ°ìâ"Ÿš¹¬ûÐÒʘ†¯È¼ÈºzÞ>1Ê$&Ô.]fqùÎèÒw„èæ§Ëͽ›U’«Z¶äXI•µ6ì±RsçÞÝ”U¤ùê¬ßâú¼› ÆÞG?}L}5´¶»™O³Rk3À‚˨ܥ.¯Üb³p—Ñ*èF\Ѻ]UÇu»ÔZÝ“2å±pƒ±ÞH[ „¨Ç¥S5=6[G¨6ÔX ?þªŽjŽ¤±t¯¥ÿ¨—nŒ±Œö=mÊømݨ a£Ÿê÷d¦ÚÄ• H¦øµzIW„PjÃâíÔØÎe¹¾¾Aß'uzèI•}.fës0â2‡àßÔÐ?DûÔ^¾X *`èŸùëë}ý+dŒ%tÑ-\pdBqY=]> \ ×èl>~™ê`ôÅa0Û"c–Ý£‡mEÍð×ùJ[Á]u—O§=z­£Q_]uaÉñ®ò[òÉSC€å‡i2%ËN]`t¬ø»Bæï8»íþË·¯èž‘ÿ~ù‚Ò¿¼ÿyôÛÛW¯zóöõ+‰Ls™Cy3ø@h=cŒs×ÁK˜®ê²\äËÕ=Nƒï&g#¦eùi]/9™VƒFû¨ˆÙO™†¸Z/—%¬$–|@P“t]Ü’ £«ýV˜ÅOóòΘ‡$‹QÅXŒ°æÏýðÝ2–—6¦Ff1 NF0á›R5£ŽÁó‡Õñxj€‘ +6ʨeÉCÁgÂÖ«!FÑ›ŸP[³…P£ê( öZàˆ»f©~fàQâÅ«&×Rµy,žûê¼ ;s”<æ51׃ö†>ÁÛŠž6UñOÚì¡DX˜Oö¤Òžj¾g¹0vs½yªâU|çò=†H7]˜åÙœ|æäÝi'˜ ù—°ƒcÚû€w~õ¹òŽ}M3LÐÕ\s ‘˜IÿaȦ:G§‹+ˆú('ѽ5ã5_Š¹ÍæG\WâkÅ®*ßMÎØ U_§&ÂÜⱦ,"o×]s”€3G&)ÐqßCܨ|5ªŠ¿·ÖÇXC$Y¡¸2ëE» 2÷u½Ùˆ²º*¹Î2åØuEvÚLŠCF)çp`XÓìr’~K³eÛÞ•Q2(Pl׈_yækTbÁÞBÕEÚЕ%ÉÐ2…ß–Ó[²È+v+aì£-¨üMv›SežœSŒïû‘Õ[ù"—J~]dYý¦ÛË'ãFS±e¾µóÎï¸ßo"í›G¹àh5L­ÎÛ.aªRÔ®*˜*ŠÊ/¤€©®RŽ£Ê/¡õP‹Ûu—%5\)´ÄÌÆe݉³„éŽdËl×Sõ?¬[¢Ö‡w¯lê†Ø™WZ´óa‚Ê'0û8Ä=6EÜúÐ[ämÚ*ž:¨ªC´ð=õT‹àÁNÐ~¯"Þ?Û‚s>.ÂÆ¿ŸF¹yÈâ)2 Ñ1ÇØ2£éƦëÙœ²,8’axñâAH,~ˆ%ñ9ÅÀA?¥ÇÙ|ªÕh¤ˆì7»×8À1&Ÿ®lÃÎBIJ¼´ë˜*£’£÷Ôs ±ÁÓ/†xFhŠ.ÈÎNŽQìW‚;œ'sÍŽÓÒ8ŸÒŽ+ŽÃêãó†fvÁº%‘Sšbh³ã½oÃÉïùßÖÅm6ͩƺM¦DÆÍ?óÅŠöýÁs€ã$Ff"¬Dòñ2ŸßËrŽëÌ‹ZIŒ5¼)®orƹ͊)¾“]‹+æ…ª/VŠžžýáÔsLèÃôñ¨¥e:y¡–¢Èö>Ï{/§U© Ú{ã×ÿ'‚¦=O3KË;O½þC¹Mª¤‘1WùpÕ!X^¬u ýIÎcåÝ”³|IJŒ® T5•×#œ5Â¥æ… ÔŸù_†ÇÇg»ü/[ù¡ù_(¾¼*Àé,„âÈl&Œw¸@vޣȽùa&èGVé˜ZRì’Äm†Ð /$$(ó$tVCæ­ónX0âjÄŠà›R11ØŒ3añ-GLõh”,¢•F˜MÑènT7ÜêÑAoÇpà¡ÏÞcø±è? {w©¿ð§žþCú¯¾Bÿ‡¿#4æ¸?ÜÑÿmü ý§{¾ZOAw™õ U=µ ¿¤o;u°ŽNó…ã!G«Í8Õ^(ƒV®^gÛÛõÃ`|IZ(ÀÔún0  °½™û©åWXi‹Âð”|>ØØÊS¤€¸6͙ȽK;ÝÕÎÓãCäBØŸÀÁhæ‘Û§>Á1Ⳟü¹¼ƒø¶#BV½uEƪÇô8,ÌŸ±<¸Âô}ë9!÷ãªLÒô'?—Ëly£@áÙ‰Þvbxb4P^­§SêÅÁ4Ž·y•ãc™[]p¾nAš*íóÏ È TïÖ©œc]Gý+ƒXtìVA°XAÓë ¥‰ÅÍE0Uv¼ëôJ°¢B£ÈëÐé¨Hq¯«<JŠåŒñf”ÒAcTòr¨îW³L¤+8ª·LçðÀ4ÆH!#ßØÆ›y"âBãÐwþ’¦ˆ¸ì8EÄñiÊD“¢¨yRo*Ád„ïÂÒ.˜ä¤ãk':ÏÂñàdÃ{ªÄÞ2_ÎIw—€§tŽ ks|ÉAo›½‡¶áÖß0Ž«—ŸÉÕ¸²0Ö›ª[N°a‰hãq—…±p‡õYKcw¼n}I,t KÛ_ÝW½Žô‹@ß+k÷ôŠ¬­?2íÔrÃe£Cæ+9âb¤>k]dQÃGXD©P7•©^´žø¾D$@+lu Å<¤ß×ÁËß´pnh{G¶tix4Ò“’-­;y›_7ïQ5¢±jFë"ÂtÈÑÜ÷óÑàÅy׬H*^D…{9<ea:å¦ ‹Jm Ï…P¦A¡¹$Ëàrîn ÂtÖï»/T0¾â\þGõüï©x”´öÌÂ4ô•©²«Ú›»ÄWy¸ü¿î¾Ž*7glôFÊÌÙûªù²|–¨¬œÊÇPE¢„>s†…ìÛ™‡¸#m<â9py^pÍ–¹ËÂvÞ²v kÒ”Ñuí+Û œ]ª‚Þ@™¦uì”LBSËk ´ù8[Të) V_¹;T–C\»:vg_åfw…íšýXþ°C[õÿ8>ž úo§ÇÃÓÿÇ6~ÐÿƒîùFü?(è¶þº·e!>‹Ñå4›Â0ÁO¦GíJ¨TÈw€B­ËX,Å译?ÏŒ|`ŸŠ(í*D»µÊºšÔz±*¯¦µàøïÐ,týDùïàN™ ™°Q'GLÐQp/–Ò’×V±xR­ÄáXŽYBæ›»YäüÀÉz!bL¢vΨËÊ›÷”#§(ê€Ý¡ž˜u‡Gs¦rýÁnT&åÞÖŽJ‰þñ«b5u.$KŠcÎL¦¦Õ8LeUU®‹>‘Íéð`¡ùœ0Ü4û;aƒª±‰2x7ƒ:6Vù¾j}Y‘åY¯øøÆS¬šyq'{ó…BÚñ*&I…lÍBY¸­="V¦A L½ZIƒÃçFF­1JT8ÈÈ^á"“ÎPãàõ =ç]mÝ°ñéhQNïÕÀYÚs šêÛ­›G”|VRÙç6úüÐããÌkåÂÌLâëž±…¹ˆ¹”¾‡ãïYböžœøž&ø:2êEh H—£•çŠÎS'BØZ¦ë&R/DZËÔX¬|‚tIÐ?D#Ev餲Òg`.Ÿ´¸ãtþ"á8Õ‘P§Ž´®C4Á ò£ãbŠ¶sÌá©E/„¹…\³¢j°Ð ±˜cÈ®EU«Piž’)Ô•¢^s–ûòð€tmY¿‰”Ôu]Øï0)Q~×ÃoÇÇ{ÿ\üóPÕ½}òÛÁWí–`|6aô¹ LÅ!Š*bBÊ7ðÏ[IÍI£Šùe“ /‰ /…òò¶(×,¯©1Ƙ|ñ¥ò]ø¸ —Å œ¿´sA^–ëûÂ|Â’†òÀ¤~ ^à2Î…+°eº}8uoïÇÿ(~ÿ_ÿùû?¾üáañŸ‡ÿç?þë?ÿ¯=YµÍØÞï{G½½ÿÚûŸ Ý^­§˜á•ï/ @ ÿsÿŸÿσfÐ÷ÉŸ0<ú¿¢*PÚT©\׈i!ÂDËüöóÏÏØé‚Š Ïn†zˆQšFÖ’l–NtÄFR@p-Š¸œ=†‰KUw‰i7³¡÷]›>]žÞâ¯PµXDÂYõ®×õˆŒ)K´ùãÙ«€£wIYóMÅÂ#ìÀÞ“éQª§ž@sfääðŸMïÀWLÃä•{/ÿ£øÏ= t^Ú‡,ë+i­áÄî}t•=%™ÌòyÅ´ÎdÊÿµ&4™f æ¤iœúq„pÁi•Ò™PþË/˜Aßl < ám>)¨_í#Ó;®Ì)5¤Ã\¶Ï”Xù™Ý‰÷*ðp )\ Gò#š°z=¯bívgÃÓîyaówHΖØì“š}ýfܬ·Ç›îõ.Ërš#³°î±#Ç3õpz2rÍîÆÓ†óÈ×'òW54 [þXͨРùáW@aþ%­ÖäÔb©SúÜéMx ãxØÓóüipP»2¸â³F'h·•#²!PÕ¢¸özFÚ\Êç‘÷zT˜…¿Q”+<Ä"1f +»ì石ñŠà”Ì]:£¤ š]…V­Êt2c+û€}Ì@¿RÁò¼(‚R™æÊÚþHí¹Q·Å.ó«)ä˧¬˜Ц³hÒu[¹ µa²öunhÂœô“x&Þæe¼ ý(Ž¬ a³Ô0áɸDºŽú Ei²ð½àYàmX.éC"é.ô'‹ézUŽÖóe9ÖieôTJZ®#ÃWÇJt?»,§•åhÈ¥ÂV}”±±u–)<àY~Ig@:sE[Vé"|B*ó#§®Fì¢É®ùT™Ï]VŽ¹à3GôN¨ )õðôoM=è:6%Ø»© ÄðìÑÐZ¡o>²ëˆ×žBîÂyYsû$²_ð½*¼ùšŸ „Ö§ƒn|>„ÏT³öùàÑœ× ¸Ý'%åª2ÂtâFϵ¸Q~Nª6 çOË×Á#*žC äü/jþ¿ýpðgJ)†„B˜ eÙ‡¬+M‡ø\ߨˆ!1ôm¹âÊú1 `Ž¶l¶ÞQÄVèpÔûÃ÷Weù­§ZM³ê†ªÂ¨Ÿ-¿È–"Qû#lewè€uš`®B}‹o*}à‹;!"¸,Í)ˆ³{kòßß”v@gÜø¦÷ëY„ÝpKÔÕJÔ,†YÉ—µDAzhDºgx»‡¼ƒ®¬^ÄŠÑ¿(ˆ ÿÏH6y0šap2ÍŒÂi›¬A_p¦ßR> ã¹íàtÒ ×ô”À´>­âë}'VæñæóT 3ïÎyÀ:0gè–Ì‚4‘áBG%'~Ía+ö$×% nsºa‘cžÎN6—yú¥œiô¯óhþ!ÝŸfºX펲FësL?ºþs¿Ä¼=îÔµ÷bPèÆ«U¹¨Äh[âúORÆÅævÐg>“ç¯ÍÕÚø^Ý¿íÕ¼[¿˜{µþNÝØ}ÚÁ]ú\oýúhîÏãi†üèûSUëzLwŠ1?Æ»×Ùϛ󡜃qw.‚üyÚr,Ëà’¡¿L €ar¨£ÁÁÚ×Ë%V4(þ.6_®¯®¸±™œ*˜so\"{w Ì,[~"䊖%M9¾KbTi€¦•†%FÆœ$2À3#†k’W+Ðí)Pû ÷½TÆ5JC@Ò §¬$&¨4 ùLǸ¾Õჳ;ˆcñžG°x–þÆ‘§B{4žfÖ#*àYO©öFuAÕ^˜Až:÷¨?->]¯§ÙÒxN•JÚ#é~º¨}n:¦úÞ{ ÃTîÊ0Ê{|ÍÖË:«©ÁܵÉ.‡¡Ü;ì¹G3ð“·{й\ =ØíŒ8J¢B†‰eè{n‡—4w$5µprB3ŸaWaµWˆÃºÊ¯ÖSÍŒ¯VPÐ…û±d“ 8x0Ž9 –ÐJœ¯¸EÇàÔI&QmFX¥¶4¾æ,ºA:ÚŒü%ÐÿòòßFï?üúæíŸz‡xàË+$â"×Ìøˆßêú¤9“›º„Ž9¼ó¹¤rû°W4ÛÅ8óð’­ U‰YôUTö ¯_Ä\9>+î.ÏäØÖMŠëš0Ϩ,PjtA(e(ÝöJqmP¬+ Ö|J¹9t;7˜ïwëĽí÷ø_{°éM$XŽ³GŒ›ÆÎ÷̘?%+ÑŽ×Â+ÐYð£ˆrÆC*H2$Œ´2¼EØν¢Þ¬9ußCŒÝƒEljÙsUž³þh8°]|ŠïÄJLÉgÏç.>;ÎУ­q`¨;Þ"*€»[\5/# &sE’á'¹BÈ̾õÞ¢ˆ%2G.Gi¤‘û-9¹Kð XÈPÖS&ç¨ao­~Š@_ǵðms.¾QÂý1ˆÎÖ!÷Ý ROV7„&(7…3û ƒxÄ…D^ä] ðGdOVw ¾q¡på¤/;}ø=}Ê,NVcUî>RÓŽÅšjÄh–ƒ‚NžGvFŠ¸w4\bbЪSv^™_mQÄb ;1¬bœqìñâÚe`ø"¬ü"åFwI êó? ÉïgFþ‡³ãÁñ.ÿÃ6~0ÿƒ²çI¡ÀﲈLzY[ÄH„*þL( "A4(:a?*e" €‡àõÙh´ÚÒfžÑ¨p{ÙÉ,·‘2/%Ú]v£•¼›‚ŒüÔ¹UÖ£Mæ-ÆŠ*z‰¬‚">ˆƒ º¤—‘OiMåšyP„¥Ìâo¿¾i1”+­­†¨iù„°¬½&OÝ< 7sîdb$RžvG8ƒ’ˆÐfx6P‘YÄÔÊÅÎR½}h)4HÁˆð! i^åË•Ô{i9નÈ,lw¥×NVf3¯K?‰·0Ù®¦#}d€_ ƒÉÑrbÁ¬™2ÐEB¨ªÖ7ñÛ™“ùâ‚à³_*«G\»èè\¤ñÕâmh‡|9• £ò|¤ÇƒÖ~Ì5Køè†m+øÈqÌ2>1Èg!¡•8TÉ„œ­Ëì¨r¼c„8¡RA! 9v„Ýl´lЈBnÄòZuN'‚ÍñcQ“:‚TJNW9TL.à5wbÖßÂ%竇ú…×iSÜð•Ó1˜… ð1 Ÿà‚›ZrDZTf½¼ŒY'‰Hµq¼G×ØW³dNèÈûÀåLðÊŒoN.¡3|Þô¦CŠpd>ÅÝ´žso=D”³žRáÁzL –öc @é÷*§s¢ƒFÕ¼%{ti%ù>ì Œ“¦Ñ飽P%"Â4Éž±|YüÕؤÐð¸%oÕt¯Õ ¸ÍÖƒ¸lQ¾H’>ÊÅʼnÌdf¡z*+…þ4/ïæ*&ìíH„-Fou¿€t 4â Š‰׺÷Y¡¡Œ/Ï=jz~–„Ì£D4õ׬~%öSæZâx!½K¬—Šƒ‰õNÑ1_hrœæMb5¯§Sû©âg½&ëMEHõv¼âU„¬ µµïYöqõeÀ߬ÝyrP]í- ¶ªp™°bKquÃKö (—þI%¹L?Л„Q¼mm…ƒ-ÔéôûM+G«á¤K4Ó_~ËT,xø[iæì“üÒäzYþj„$°¥ß-oW‚[§_Í•9Å ÓúÌ÷VÔ°Y­Ç7š>+UdÌ@˜M«<[Žåœe3ºÝàO ¾ËÕ›šPÍd€—„ÕÄ ê*F«©ŽÏ†ÃJ©7êóJ}a×Ã0 ÁbbÖ Ÿn)TQ¬†¦?²ªbN²ÙM‘±AcìÙ®èçP©v-~±Lå\ÓÔIïe«ËWÅrÆ’y”ޙĹEbæR_a˜³ A”qv«µ»—ØÝÊl4,ªNDƒH0]`„©L xoÿÙ *a ¼ÜÄ݆teµ #X7nôm8T1=Så@ó>³žoJïÕðWín%1C˜TÍëËJ”"e•Â6:OÚiÀQ/æÇÏ>çÏêôý[ô¥s×ÿ¹ÙfýŸã“¡£þÏÙÎÿk?²þÏÍæêÿÜ"X"¢oí¼Ï- ß_\P¿#õõ§ ³ŸŽ&ÅL}lð°Ü´¤1Ь¿ø’J2µì¤?]!hÛ¸)©¤3}}6©¤cW¥$¬§ð».|dzðÝ$d)ÐpÖBÒ›²Š‚2=ÏÓPÊÊÇnl¥V¦nûŒ¢/}±öQ1Ñ3 Pi†f8|ÄÂPWÆj)Y.‹i±æ½uEÏ3ÎÓç‹(d‘v_Ö Y‰0åbUåÓ«ƒ##Þ+ç⊩õÄ7Üä(ÄnŠ”Eסœ·Fd8AQ¥ëdz’lFMqþÒ³lèO¬¶2’ßÎËa¼s˜jëîeÎ%qI¬¸©\ŸiªæË‘ºj´%ߣ¡²?Ì ÌÕh(›·›h´T7—¶D¼0ZQ\Ñ(ø81ç ˜ûÇJÌ®„'óSA½>PùI6ž5–[i•¤ÍxN´j t–„ºzsGñ(c=bN¥¹!°}ï8È¥RåAL^yu×>j=äs6crŽ¿¬æXÒ÷Ø[S ›C <ÐGë6‘Æ_çÔÙ£˜Ñ2JÎY('Z¯h¢¨Ÿ‹‰–Æ\ðu`ƒõi8ûúæ¡"½1z?¸F¦§BUimÎŽeÞŠƵР*s ñžý³GÁ{ò¹oèºÀ>©OlRÎ^ùX!U&ƒ/²ª1©ýc+1µcj¿¡ LÝðÕ[¨Âô<‘5ï€Ó¬Ý-)¬Eò:Fmí¡·Þw ®ïˆ<²¢66vRÐfpºeµAG8c•VÖÙEŽNÚ>fÙD-˜îl@ûÏé)y§ÛÎŽwþ_ÛùAû²ç±)ð7aà»´©@­gi6! Ô¡ ¬ ÛRÂÉgÒÑŒ²É.q@É×e{êc Úi°œ  1b(P¹!V‚-Kv2íY}™eÛ CV2ïËÆèH⇓°½îr^6Vª•yö;4„©‡Ë{¶"\÷$œ°Q,†6D8`9†L1¸â@Ïköê¼rco•%2 gQ±ê¢;tËâ½ÂŸve"sÀŽSJ(Ö u·}Ü­hsqÁo1Ò…}ÍäUØï¨ñgktŠïTÄ"Ssû—Š(ªº@Žõ˜ì`bz0QÉØ4z6CËøÅœ Êï# ß&­Ý¥p‚µJ˜*FÝ•®¥¡F0JzÖG ,.«B&¥2’nZFØœeq}³bI!YÇ:4y£äÿ›N}-ô<Ò’]%§ðÀ™òó W'4Ry¨Ø×ûÍóýô‹îêS»ÆiÀœ‡³aI‰Ó¶l¬,x¹×œ­Gm¨ÝÐ+ÿG§ÅßÌÿ189?3ì¿'çÃýw+?<ÿǦR~´­üN$ý‹ Z÷=üƒQÇ„ª‚üU9/ªM 3{I 9þ… *£„õåü6_® ˆÐ³Ê(øÁ‘%#lºñ#ã^\ØŸü–êàãÕ½ÿ(æ@gÿSZžš}RDî´¡Öß-4™wÐ`É?éñχtEÓWúMPüý›¦ìq?ýgén»Œ¯§ÿ'ýAhÆŸŸžíèÿ6~þ‹=ßÈ-  oÂ÷‡ïÒóG‚4ž¤yý(`M@‹†€h®JíJh=7 &‡&/˜æÓ+oóѸ«MŽPœîpÃ…Npä]LWÁÐW)î|¼)‹Lñ)–§aƒ‰Y^†:Ålø&«F¿ýúÆöì[€í¨zqx·Æ¢†w½ðAè"ƒÁÕ0 Gà„và6iÞÖ‡u¼…z§F¸RrØaGJ{5,C„Geó‘똪ˆ<'M6–"Ë:UîÌ+½}h'ªs`è,@'£ó*_®dMV[€Ö ©¢LrØŽY¬ùÀ,'`z ŸÃˆ¡UW«>¤l6â«€fT`•”ù…*]Ÿ:Âg8`-..á<ÒŸCBG½®¥ñª-Aô½¸€K&XkR³k|£¨KòåHøcx0¦cêZÃ;1ÜÆ›uò§¼‹·F†=ŠcÕæ2!Qó›5Nžžž¸®¡ ÓÌÅÎàȤX&:Ù/ÉDø~ôÓýdŒ¸ÅÈK?ÍU¸NÊêu #asçp‰`ª¥kÇðŸúëy(bS‡ð×­ ‚^gp=wŽÏçV~»ØÌ ÜZ ÝÜéó­© 9§<½«¸yÒzoXM“΂ºwòügär‹òãülø•{E€Ï¦Wy=Yñû”¦>åŸ;ö)?Uò'Ü«@ÔL†+}Ôô—kÝUOR¶7uBÙtGBAÙÄc“°©PtMóeÓ²V™Â|x±±›2ÚýÄ)eDÜh0B6ØruwhŒ4^Ks"ÁŸš¡Œæ¢“LÛT5|v(H?[8´Õp’ÉwÓ-À-ÄsD°‚ôb£e>×ÞQ«\/Ê´.Ð>‚Ö<ÕÚ… ½9o”L“êÄ£)ØÙ‰Kþ®)]esü6*¹óªIÿN;·šŸŒøÃ+4Å ­Ð¡ÄV´çŽ¾°  …AS˜3ÊQÄóe*­N#²ŸPYo ÍußzA- +Ê‚‘KW†ÍCÇ s³–QD’r–/¦åÌ Å‹¸©* 7%…Ïä*Ž‚ˆ¯e^Í÷VÔû²Zoä]݈¬âȧ³Ê³åXΔ7¢úµ-õ ¡i™6}ÅÐ%አ§Ä˜¯Z´–æì,iܤ‡#0.ÍôvÏNsd£ š~=Ž~v pjI;N9°×Ëbu?ßäãOÝææôꈌ(ã±w‹Aq]9,ÅÁwrr'DÅ© ¹ØR%‚uHEMÇ8Ò•4&óÊ’ŠÆK3¬C é• KŠVñ·œC)Kol’C‹Xy `ì¼ãéa"ØGÝÏB²¡F*¶aBq\d8D(>4è‘éÛ^4Ñ·Åö8¥ŠT„0¯²6bÁŠ@Ö4[ô—}ÌN“òq$xÿcùîg€‡xð…aÀpp’€ôËQ§¦Èƒ ®wíå@Ý€‡°xfY%U!²˜¤Å„IàŸæåÕ\1 ÓËð~z€µ­N¡@2KÕ§±^ÊTuUѯ­iL5?‰œ*óë^\ω´89h`¸â©žjom¢u|šb¿²¬œvöõbUæó‰,Ä^‡öiOÎö´CùQ]ŠöЂ/ôcÀ÷ž³HÅy‰U¼ásheqàƒ—Ë'—ù¢ŸQÞ|œU9»ú)³LÚö´Â!` XÎâQ`f³üŠOYÓCÕo I $>ëzKù|®IòâÑ3ªÇÒéòP±¯‹8°1Þ Cõ¬µ9ÔÓÖ ±®òÌRåIFõÇ憶Ý9í ‹‹#Ö7æådBN]…‡D—k =Í;y@‘Âxä°$yâr² *PlkšÐ”ØLˆf, mЈúütá7¥ôÐÛJì—©cd×Xö®6NaßyN>ò›tv“Þ˪ZÏp–@§¹pÅÒšÅéšÐŸ~,Í^–pբRuóž{Oû‡óæ¨ÞF6뾇`öÈ5QŒoÈ5u ‘ïd“ÐÅ:ËD8NUCˆw ù|ŒCaa½2•J$VÙDMkúFL"Ø;\Ã^#Ë…ýíqšÚ$ó‚y% ¼‘ùLté7AÑÔ&‰[AÁB?7šÃ$(fR­¯væÙ÷„t&NÞ/)Cxó‘i¨²«bjÇY­fCÓ)¸ŒF•©ÚR;…I—ßÄk7åĹo[ÎqâÁ®ò”+ú±q¶’¯C°ž7 ¸ÌŠÒø.{ƒI÷Y¯ÒÎ$•¼[žËDá{w*ÛžÊ/ü4¶NA4 71  ÙkS9”+£AírDWŠ÷žLd2 ]ÐMä!°Gˆs7y>Øáz\wj×<–ËkB‘Üi‘‡¢yNáUƒ¨ë1̳˜óDÅFäS'4¤ÿÞô †å¡}ãgÿÇCk㛥Qp¬Zz-½Ú¼ r„ZŒÔ^ F1`l&GQ<4ñ˜¦Gwœáäl³,ùÖh¦ƒúit³C¨¥Mˆ%z­’'ÔP¿-ÜôÑ™ŽÝ¢i2¹,< «¿•·uûúƒí=˜hÜ›°bC|¿°°ûÇsÿo7"ÿ‹¾ 6|RÍ|õgØ­àôô‘Ë®w]Ve”¨¸™ªŒøQ(x~’ˆƒžªŒ†n?Ö’)é×´ýTËá’½ôçv|œòÎT«{0¢Ú­íâÚÝtý‘E¶;Ig'±íǃÓÕ‹ zŠ=ÀÆx®yv¿‘EO…’Æœ"é¦mžÂdF½»v<‹´ —íèÚ»p7Õò N¿]iÞÚné’2b® ÝK]ÜéÕèªø<ËíCå“îÂÏø½zP3t ê¦\O'Ÿ{çª{cŒ°ò"týñ”‹åÈÚHUd©Û]KÜÔ³ôØmìþÊ.Êí©×wžªÛûqÕÿ$¼GvßaÐpýÏS«þÛññÎÿs?¼þ'îù¦Š€"ðÏO¤Ú?þÓhõþÍÁsç$àÂ/ô'i|ÞÒÏ°/‹…â¡©zC½ÊÉ=6%¤äUN›I ¸yød5>•l<šVzøx]á “2(÷ï2'Ô¯âÚ8®«#‚X76ÒFÈݬ˜S¹ï8qKºtOÒÁ—E:4Á‚ø½™$ó=/.è?}ò#|ý£‡ÙcS§tâž’“Îãjj >ÑÔ øDÕ0àM¹€Ot½>²U ô±”ƒvJÝEÿ—ùi‘=ÝÄÔÓÿÓAÿäÜ ÿçÃ]ýçíü ý7ö|#×€1Æ&â´!ºŒ0;Ÿ§ÅX Ý@»ˆ Ð!zãì£bônñÀÓà²Ì§ùtUÅν‚üEUã·5XüXÖ-é³¢yêêêqF}ZÈgÝâûh³.e7p °@LÑ;š qÛ™8;³^¦xÛ|+èd#_1.çãlU?LgǨaê˜c‡Gp]ÝtÑq¥¬M«*þž<«†¥„Ò)•] {¶"ñåÚˆæò̘Ýbž:ŒÏ2ÈZþÑ+ÉKßX^8T+…'ö>­â§EãkþtPsX§ÜK׆(Ê;°ŠŸVeNý=5K ¶d:¥ËÛÓáKú°L¬tydý>UÒ &Ї¦½R*cèã ²óü á°’ž¸ZóóÍ]ìyŽ¡5o-Óÿ×Ñ2˜v½ïEž±iÂsl¿‡Í©Á,ÃêBŠÚ`–ÊÍBn’ªxÓ☪ÖÒ<Á¾ZÿÕ0‘éˆÓ>Âåj=ja.fÎÍ™‡\´OýäÃg{ÓÚ]\qòÈõ\¦Õ/¬2™. ¡.+“‹ÛåªL‹»r¿ ÷¦;ïªU­3 õq6u¸ß€V2 >rÉ’;ƒh ?0"Îé›RF> ¡ë’==ËãÔˆTè‚FÅá¿þ˼ZOWX·‡k—­ïÒØ2“¨ó ”`oxôä¢*§àãÃlSÈà¡—Áïé=ƪG1ØÃÔgK­›Gý¨ç”,ŽBÔ³þi;DEµAÄ®’V ·znp?¼ÜÌýùñ}&Ñ‹S—s·7¶™Ôbm&:\æ·E¹®Dù%F è‡îóÊy+ZŠ±‚–DáÁiÛ‹Ë*ìj©¿â3¶öXå‹7Š»ñŒ£1δNI ãÀÞÄzšÎ«²»ØÝã–ˆá*Ué済š"•ЇµFÈŸSt«£Œ0!ƒ2ωÍ!ÊgZDF·œž·½ 4Çñ÷Ò†uuãˆñvè};–ŽÌ˜ïQ1ß7¨G{»Â»•@„áÚB¤é6\û,¨ j© °°'\šÞ,DßH2§"@šBí2¨i˜Æ@„äªLOA‚Em‡@f]-‹±rô%ñ¢56°t¸ù"ÑáYï—÷?>üû»×£—?þøš¬¾ûÞ§‚ªH©< Ùä¨w·,V³—“»e/_ÁNF]fnqÿ=3A(èÍÍ,²•¼E÷zö-!Yß^;ª5Ãh[pšÓà üµ¥ uý–Wa’²«¨˜\榨5ÄÖlj]\°O ž)É…nm-ß@‚ž¡UÊ'&±ôÃIOãt  éÄ.«Ü½r6:)Zf;$3T¤Æ%ÛÕ«AStÊè58¥übènïÂ(ÄÊgJÜT|ZMŠ™òplª<¢ŠÂÍn³ t(‰µ,××7«ªNÃ^³ÏÅl=c!¡˧.‚þ1ÚçU>pꪎˆ»Èip5¤Çy†Q»?ÿò××ÿúúWÔQP^’ž8™g'Eø:)1`>¯Ñ"ÑÔ™šqßè‹ÃvÁ³ìÓ(TôâºÎW:XdÉï PS0ÒH]#uÍ ¨ò[²SƒãWî`¯€Œ ÅUA&ÔGž¿ƒˆ`EB¶Ûî¿|ûŠÅfU½_þ…`2\š¿½}õú§7o_¿°TTòc†¼bÆ„>VçÍALnbu…i¦¸4¦ë£™ý‡N J²md øTô>À´ ®€Gˆ]²€úq{ +¡Ël¼R¶] [¦·µ†„µ¼£§@f½£xìí(ίÞS~¼dÁl^ âÄë@ðq°?'Ð÷/;M$2z†X‹óç[¾t2ÇD;ûÔr>-·rÁ¸`IjûJd€©çzûñ?:Ûû<×Á³êÀZN‰ŸL0¨%)Kªš‡V[›ñHµl“UýR OcdH‘èíK6g ¢î+â/ùg"Š‘ÍDPŒò‘`;ÔwHãݯ$Å5‰91woYQNûlÀ ´‡÷0 S>Ùi°\òü,U9Ë{|>ü^+€A©òšR!-OYÒM¿@gy6g \ó¤Ä+v­ˆ«WŘö>À‚8:;§¤Z/È©W1 ú"'~:5¥bjÓ6ºÜd·Šþ£Êg„/ÆÕÁG½pŸkغÒà5r0P›2Ç«ž\ú3·Lˆ.@»kXu÷@D‡¤üžOº—]Œ¢l‹³?)gY1?b=ÕFIž‚ò %@Í7RšKi åŽô’8ìD™0 Çp2ê´b/ÅiQv•œ¶AªÒëôdÛäN?æq7·»Sª"ÌÈõã|Ù4ßOàd)ŒƒÚM²Ÿö¾#]ù Ô(—håb¯*ßA* »´bÇ’á"—N„3j{ÒW;ñ »j(%6TQLm,øz]üÞ’»ÚÌ![^¯©½–»~RSmÕã9vbn _ŠL1*W¬.² äô9¿÷æ4V6ÅYÊô¡ÅS2êȵÙã ÷âT^Ç-$ÀTô[4uPXlÔ?a¡¹'|áÞ^w,ÅÊ'Å ‚\E^7>Ò©¡ýåœB5¹¶ÔœèQ’˜,/X´Kƒ#4scª™>Ìôx ,üý³ÇyAG¦WÕò$ÉôaßØ°ÙÜDzxÀ~S\1MÈ ÒÅi{Nô¶O¶q;ÒKT‘‚ß«e[1.§ë™m•éèEKkêâYs…«.~ÑN†q¾}5þ†à<ÊÊÓï*û”ƒ"±æ¸ç2„Ïk·Gãý廟a"òd¨Î„lx´YÀV¡ð»ÄîNØL×^«ˆ‚Ó7Ò÷'ôàûEµ=‡Áeà ;Þh#ëí²¼«bmË:Ðùm¦á”^ÀÍÍÈ&¬Hò¤g³W âÁO»ë"Ü÷-_¨ƒÓ ›^Rn`ÍI>ɹ?Âá>I¢95ÕCH€‘§ã”uî³¥%Öìíï‰æ˜ÈqïÀ—kÓôCT–x†ø*澜ššö3ÖÅCͧ/Ò^æÙLE:ñ)Bßf Qñ(ð¤ÖY1O6ì‘çÁÍ[Å,.+°'á»Ue]b»¡yò]1‰ò•ÑëŨüÔ ¹a÷pØRŠ Iå n¨‘@yæF$¼A݀߾òH\Ô,'ί¼*Í'B§¤hœZ¢BõèuÚ'upeÌ.è¸5¿ž¤ Ò´=)7¯vñ–¥oj3X“ßó¿­‹ÛlšSã¡?ñ™"™Cþyœ/Vô’YiW›,ÏQ)ÛÀ^æóÛbYΑÔÜfËêâ€U”ãHq}“ƒÑõ6+¦øNvÕÑ6K×€ƒÛÅËiU*Èøßµé«þ'‚\œ·&üö8Ĉ¯rËJ’qžþ¥•Ÿ¹â'*ìjÂV 4€s‡4þ;œù†Ö@R¬Ü6EÇæ(½±m—ðhOí³çöÔ®‘‰w™Nw?i?VþW‚b•þ»qw Àëó¿Ά}3ÿ÷Y8ÜåÝÆæ{¾‘̯z çkRNSÔÊfª‰U¼6Èi±ž¸§gm"0Þ9mT™™\íSÉœŸIÐ\MÐ"&«K‚š…†Àr_ò.fÖËÎ>ÌÊDYɲÇ;X©ütHÏk&.êX8§.Þ&­¤‘§Ò‡Ð@ÃV·ç׫W¢¹„DjÊðαåÐrd1° Àë•EÞÆ`¾ZÞ«‘QT«ŠnŸè³åeªF‹WÃb±tžGúÃù%3ÊIöJ¼ÃO4Å)m',õ/š±>fê0wŠ$Mß•3l®ÍÉLÃ4ãl=N? ®ª$,{ôl¦ëé0™Ú‚g—V &`‚¬¾ð\n—ÇtR©Êb$r ð•p)†Ô)x¹°­yy‰Ijù6:Æc*-¯amn#)½s£L3Ççé8åuã×®7up_9ùÐØÃfµâ­sÕq¥x|T‘¹²iÐ2ÄìœÓ%<ßÓ3×›WdIz7å„×Ñ}1Mäìakš=€ö˜Þð€EY3²xÃ&3ãA=yòg=ÈiÖƒ¼ã¬ǃÛ¦{¢nËF)œÙ¢jF8÷*)œ{nR‰îïÆ&ÁÙó“ ì¬X®o ?úÎÍFª±w:ŒØ*잊>ÝU`o|Mn7joKT¬0ñR§b¡s«—o±ßtYäœÓ(_‰ó@TJ}…s xÜUvÖ@˜ssáZi1õ’0ŸiÆlÞVÖXOM—¹Çá|À²-XrXÌÎh™_xyoãWâ4"£ŒÇÞlåQ5Ð]Tõ‘…C9.ÜNB¢†'Û*›!'ö+È&Oþòà:¢Gó^mŠ‚ÇÈ”›(ž.#z°1¡Ö7“Xæûdë×¢NåêêlwÁ4†èš^Z›«°íjÚs…ØH1m§pˆÂcr)mÇœ903ÛÃY¥¬ Õ ®UÓ¶–,ðÅõ ÏÜ‹Æ1™¬ :X$ÉF8šåÑè(äíùÆß<C§wWqt¨/Vþî¶~DU?7Ïb¸7vxhwÞ_ݳþ·¨ÍÞ@Àþß??·ê¿öû»ú¯[ùõ¿Åžo¬¸!¡¸èó1µ8³ùbPÓ|µ,A{á7 “fùçÂSÁóò±Vjê0¯©ÿ[Ç5…–Œ!­žð6÷€S'¹XæL]×»Z&–K[䬙N¸±íRÝ_9qKª3²œsoŸ²8ÅR0Q:vù •”XÄ#^9ĬªÊq‘ѬBbAÃåVLê²$’&Ã/ªáÿŒ¡Sr‚Už÷þO>Ï.'ùry“KXÂlM ø=ðc\`¾¶Þ?Ö'æà(`4€i@$:X-0xÈb>$mDÁ¢9Ø%LJv®ÄåSOþPßtÊÍ<}ÿûÅ^ôJÂMs²ÊO“ëÝÈiÖÍrÐï×LÓ­J(•l9;¤¿„år¿‘kh¿×$mùXÓ4ÉǪ®I>Õ´Mò±Î»Éçva{åKŒ·wF §Oį¸G^Û—ä±÷û#‚ô=ªte¬‘j|¹QâÁk7åx·)]l |ªº#æ»'»íHÞ‹fªïéƒü]˜lR²x*vºÛ¡NvH~n‘ü“ï‘ÆÖŠMÜ_=û±;G5)°¨ÄM>¥kƒþîžipl¬s£ãÄ~ÐèÍÂIšQÜgÒËexcFå ºè õî.ƒ³ÓÚ{=(=‚ )ZиQ®òCESö’| Vô¡†Tû€Â;Èr°Z©rª‰‘E*éø8w~îö…Ø/ÇùtJÊ äŠò5ëÙì^­(Ôö"w›/W=匪S»†PôÜPIÇicϺ“Ÿüϱîš9ÍéE\ðÄDÃ/~䆋fdùëɧæMô…ÄJ[þZÊùn²€×ûÿöONÍüßçÃá`çÿ·ôÿ3ö|#n€Æ]æ×ËPÔfwTA™&ä7묤 DK:%   LÇQ—°Ç ¦OÀU¯´« ÑÕ7*§&Oñ–§ÁÐ5žcŽža¹/¤Q"OV¹é`s,Ôh‚¦ÞÑôÃÜÜêòÊQÖHØʼn‰#X> ›û£‘;4Ö i9ïý;e¸|ºJ–u; T (’ÖcUÒZŸÌr3“Ôkf@—™jNØèò¾)`ÅXïfù7êtZ}\16Ë÷¡zÁJÒ‹FˆŠ²|Ä®’V ·znp?¼ÜÌýùñ}&/Èš2êr°µRòoVu•àyæ;aâ…ÝGÚEƒu–9-2>ÏâXù¶—UÙÇÒMÅ3flí#°Êç+wã~Òb|¼œ’@Ç‘s?IÿdÅ7™šçnÉΫò¢\›ƒ®Z- Š[±tÞ½lJ Ö¥k=o{h>›Žãï¥ ëêÆkéPÂv,™q˜¢â05nPÂtE]>*ƒ…HÓmpãYPÔR`ass¯q›ܧÚ4U2§"@šB-*S){A„äªLÓÍP¢¶ÃG ³®–ÅX9ú’xáýD´PÿÎý5ù¸ ˆÏz¿¼ÿyôáßß½½üñÇ×d%èÌ€ðÝ÷>TEJåðN»ÕݲXÌ^Nî–½|;u™¸Åý÷L_¯ 7·° ò=ÚØ·„d}{í¨Ö ‡À;ULƒ5Ò—*,Ôõ[^…IÊ®¢br™›¢Ö['vqÁ>5xZ¤$ºµµ@á=ƒ4ü!)hØɃ E,ýpî(O&…^‘Mô±ÊÙè(ã“þ‹-“LŠÑŒø² ªAStÊè58¥›ÃbèîæLaÁÙH:$Ë_–ëëtÊU§ˆ±GÙçb¶ž±è‹åSAÿís*8uUGDŒ]ä4è­¤Q»œÚýù—¿¾þ×׿¢Ž‚ò’ôÄIW|œáXœŸ 0Ÿ×hƒ@·LuÊ7úâ0€]0Æ,»ÇˆÐŠ^\×ùJ‹,ù]NN-SЫ^]#uÍ ¨ Ó–\P¹1~åQW`N˜à™að;ˆÌR$d»íþË·¯èn’ÿ~ù‚ÉpiþööÕëŸÞ¼}ýJ@Z/¸(—+fÈ+fLècÁ6hbr;ˆ«{28f]±à‰fR:%(ɶå´x:`ˆ¨‡+à¡—,ÐqÜ^ÃJ¨Ç2¯”mW#ÈX ¶Š„µW‰ €ÑSKd-;Ê4ý¾Žâüêñ1åÈKsé"N¼ûsò}ÿ±ÓD"£gˆµ8¾å‹@'cqL´³O !÷Dz;h¹Íî‚%©í+Æ^Ï ôöât®£÷y®ƒgÞöZ¸ï â¸'X«&)=UÍë­ÍˆVöl·žòv0YÕ/Åð4FÀºDo_Ò'uç¬X±©s˪ñÊò:eéë`LÌÇ]ãÛŠ†‰Ùgn =¼‡™òÉžZTѪ?t>ü^+h­¡šR±´"{OYÒM¿@iö œáš'%^y´hå@\½*Æ´÷nFÊéì<œ’j½ §V\Å´ö9ñÓ©)S›¶Ñå&»UôU>#ü{1®˜–Kå}®ýaëJkR‘ƒÚ”9^õäÒŸÉ ;B pÚ]ê»ú:$å÷|Ò½ì’`e[˜ýI9ËŠù“è©6J ð¬»)úk¾‘Ò\J[(w¤”Äa$ÊÈ„é<†é|P§%{)N‹²«ä´ R•^§'Û&wú1»¹ÝRaF¶çKÕ %]Üâ,õ‚qP;É»pÜÞw¤+Ÿå¸KÔ¨ò4 )ØÝqK'Âa{º ‡?'^aW ¥Ä† #Š©ÿB¯‹ßCrWbhøõúÿßÞ·÷6r$yþߟ‚è®Õ}ò¬HêÑ-Ü.`Øž[ã<žÁ¸}7(²$ÕšbéX¤º5‹ûî—ïŒÈŒ|U)µ›¼¹u«*_•_FH­†~JWm;Ò rNŠuÊ¥ «³–ëé+}î­äíÍ°”‹¡3ïÜš¹y£ ¾É3yM{h:%ÀRò{è PxØ)>áÁ¾pôAŽ©zPªU®W±3ka!z¦œçÒì8—pMm-¥‰S JSóƒŠR“ i îê«„ÁÖÈ&Â?}S|°tf¤8Äƶùq£ñ³•KrópÿM}£,m\_°§ý*äi_¦lËx¬¥o…‰H&=dó6«EæÊåö~Õ-˜|艸–ÏÈ!~٠û3 ˜P @l4 a¹‰Ab;ì[¯!¡ˆap˜«ûgàÈ—3üÍ•%U ˜xƒ,FÞÛuó©Íõ-c>€åm'žH7²ÛV&{à¬g·G ìâÙw;u¶ûžÔñÙŽ]/%'0Éû3÷EÚŒTç„x€BuÌ6:zcŠ‹(doÞâÙêÞDM#öÞBõêm(r²~æB<`h`â­šÝC¢3Ÿbtpóm®•%q=©wH·ééŽyaÜ=UÜX±NÈ·\zw›ÔîXžBGL¡~ ô¸uПa÷)êžLzjB¹W’8@¹O€ß#ÐðmG¼ùýÌA­bÙü]—FDNæ cS'F–Œ©H;zÌú;}¦lAÓÞòz‘-Y{JN^tðŠ°G2!º©EÚžúq¶¬¤ó0Ɖ ‘¡ú<¯6òÙ £Í†MoÁ2¨—Õê±^7+ÁjLzˆÆÒH}{Wq§ëã¬^Šw¶*bD ¾XØÎaß.ÛãFƒQý¿ vqÑ›]èÓÇ`c¾ŠÖ•¬à`2:jJ/œ¹i$ÌTÔÑ$Jq¥A„Ì5ÎD¨4ê)ñrû  Т±}Hx6RûüýŽ‘ÚøK‰½ù~^üÏeÓ< öÓüù¿Ç§ççNüÏ3&Yâîã'âÊ5ßIØOÙôÑ>y‹ñ Ÿ¢„ŒÔÄþUÞSTÌo9[”÷“a§›ñ ¢Ý\Ø:Œ}Y3±Ey7cϯžä+'âm–µBÀ‰ÂâšZxX ½$x˜ .g[îݪ*f‚¬û“`^å/­³ÑÝ@ÞãwKr/¹_ìÅj ›:F9ÓãöÛŽŽUMÄ0ãå Ê bÆ呤صt´7«Oòö‘C„? t=gROgcÌÔÒÏ.¬ Jô–Àøk eÅÉÎ#ÞlôôÉÞU’e3¦'7˜Éq[5å¨.ÓÀÙ–uÓþêæ!xN&å+jEfÌ~c¦?ÌO|u:DWù”qµêxÃZeo¡—æÓ]³TЕ0Éô¤˜á)¥#…LK÷ü¢æ—–êÇê<äŽYø7¿û³¹ß´ö™cm–Ř¼óÈ´­«ÇÙºÅTÇÓ,Üs˜$ý”% â"€=VòBü]*Œž.¦ÃÖckþs´ÿ ¶þþ¼#[O»ÉZ‡XE4Ò9.-»¿{ötµia^/Ñxæm¢?Tו?ø ¡ iúÅiÉúïÎØ…õ· %wšTé bi¢tñÝœŒ;dH7‘ yM“ýœ³C~mÍÍr ö1Þ ÝÇz^ÙúÎ}T}æ—)QuwNÙ@7³ß«•"£¹ä0×Oøs3ÈÍ”n&á^Ü"N©çÊ~v2î"V`–ëq£Pu4|*¦e‹LJŽJQj¶Re9IãH¸+Qó¬¼tã­%zAÓbA~¥Ñ¢¾¹áÇó]ó‰_Ä–LÊÜ~U™jyË(ñÚŽ¹+;"HŒ˜iieï}:-<#;ŠAƒÈ,“Ç$£‰P'N<h:-:õI8ž2Kì"Ùx©!@“‰Æ;Ø!Ç¥Fª_­ðSïA( ³ºprð:‘Ü]ò¤÷Ü´‡LÎ( $exjgd ÷¿pùÂÝÝÚ Z>9ûð<[+‘9?äCõŸê\â»Þ† Xêçá¿Ô†ÇOON¦ÿ5áø¯‹‹‹þk?ÿ2k¾˜i}H˜j4Ó…DõGLW/í" Óµ|hXn{Tq·ñR˜X¬±°˜®ââÅü4ç•Û6@(é*, ·5,u98Ë,‰Ï*ƒAQCò&ˆü";9~ùáA:+4*m‘TsTÝ€‘Ù]P‚gŽPfo=ò°\¦J\^ޤżíb¦ª(»4ädI6FSHwŸ½]}¨ë^†ÎÜÒÇRìÐI\üiZºñ»¢w6ͪæg%»¹ô½É(÷ƒ&·ºãt lAµV®ß1¾aîǹt=Îv=N.Æ=8Á@û9 Ó{¼§÷0°ÙwÄå³½ˆ“ɇç_‰°SXÏ5ˆ[Éõög¼/ÃIøyÿ>Â8¿ß)Ùºî¼9‡=z^-ãÁñß é×Óërí!™¡Ø¹çµžÇh>\t8ð‘7ÑîCèÓsÄ…cRjÄO­sÏÓ!ø®Çáü~A}Åñþ9û9)6ø‚ÙúÜf?àd<Ý)!i—ôÔ9äF8ë0™H-}wyGä.ÜwÝtþN¼nzíøt2ˆ^ë{âºÉW)~v±á)/›¿,;q´‘‹²_[‘§-IÅÙ®6@5ûp±Û©›—m|ÑG Ô spf~ƒÿ<ÿŸ‰çõ§»¡<€qÿßôbrzâÄ8Ÿžü{ù ÿXóxAû à÷Ü?ð‹11†<’­k Šiž®7…µùñé¡b²s°±|? 7ê=»]6õÎoìw‘?ÔÉ¡Ü•Çt‡ÂÆ”r嬒Yæ·÷`=Ÿ‰aþ憖-è$¯ÒQëpºƒž¬K}Žvè:b»Lpe3»qzéÑRÓg(…îØ®kåÄ´pÆÚŸ¸è?›oÂ}×8¡m y¹ìÃ3—aå¹Ë3šÙ~¢ùì)ð<ñÍÔ±ùg`já¸åËͦٗvqšÇÄH9-‡ÿY×ëfñXR>þ:ý1· NÚ0l!}>Çà«ŸÙvþëŸîŒ© ûñìò"ÖeYį‚ÌJY-`þR6Üh"Ê)ÈrB3˜ I8Çn4;àœuB°%j$Ž«`õ ë9—èºc =A »íë%á" e¨Ùãó“Žä9òSˆ£ŒC«>ñ–»@ÈÔoé݆ñB@htÄ_mÛµ ?-ÂrT-›Ú, høœ^»Ä.lÈ)•„ µ.Ô :WÝ‹èâòRæQ:vëijÎcãÒöÞØk·Ü²\ϱÚDᥟŠàÇè•CPdÒvxš¬ñ >n$9k•Å‡íx(’îìÔÌÆDu=ÕvAnRŠòÉâ ‘ñé7}ˆL¶#$¬š¥HJ)a(‡²}ftFûHŒÔ¤8q-Á#™0­^xäê -ÁÀÙãu³½½8<¦˜}®ï·÷ làe€3€?}ê¨Ú̳qÚÿëÿþáýðw‘dIz4UÂãê”™ËëùFwȆ[âPtz:uE7|‰y÷³'ZSyÇoU¬sðì¬I×å±.¼–p"àIJíÝò˜;ì”ÄÚ‰Œ¨@=6Ï`ÞÊÞ?q<ÉÆfèôË}ûó÷rÍØÿþú?Iãäíº%™r½YoT(ÿú^ N < a9«2KüëœïxV¼½k¶ËÅont"}ìrV³â'8ÿVa. 6è`Öß-[â“+€Zó,ôC\ucœ`Íå]0çô¢r[¸yÉöÓ‘ÛœšÈZc+šÇÁŠf:¨?Ã`@:õ`#fGãFÄãd}½ýyÝ¿hâtIÈ©™8 .ÞŸíç4 ra¦Esv¿LŸÑš´×ûxk1£Íeņ©˜”¶Ù]Õ¶ÿnk«Ùz~gzHËÁf,L¾i¶«…J¦]&ñ¾Ÿ–#Þéå%ÿ¿19C¯¦#–Móû6®9¹6ÜNëˆÈYO´Ý®× ŸIÎ@l#"ÌñmýX­[o ,þ¾j>9ã°l1+g´óÞø5œ–Ö±‚Üè¬37ÒlÇO‚“wƼ0R?&ãA´¾ÛV.^cÉs`öùgò¥ï„Úÿó3Zköò«Ð¤¼Å¡ÆÍYK?'píÞ(?01µZ\!Òß¼NÓÁë üm+wt§°2o„FÁ©°Z¼qe×úCÛÜó ´r$Z@¯¹>ÕVNk®ßKeˆUÚÀ}5[©žc_4Bv—•øPØ™88—µßªí®O m¼S_7cºàÙÄ™k%Æ$î-hrÁæi¾ÁyÂúAÒ v"½4¼ôT¬|1?ã¸2_kV|7ÛcãR{݇é³lk)};vÌep-¹¬Ó~€)Ð…$¸½jëö¶Çx]¹Øœ[%Þ‹~÷Jèãú…Ý,Ûn%g'/ÉpHQ 8Â;K“šç³ËÉo›C«,/¯8•V•®¢ÎÞî¾^!ócg{ðÙå&pηV“·WIt;–ÛËhí°ûžÑÑ7c±'™¬ÇIõémžæ‚ÜÄz.dØAjo|x>tEËðoú©L_¹,³?7M…’{Ê—«^ª…«j…º·õ[º†j…t øo)P¼£Ï#\˜µpãIEÄîÅ”µO5’6îry§ 2Tw+þåQÌCêî “ÅŸ¾ÙÄ!’YüKA>(ÎÍçÙpo‘ÀÜ<\±ù™ñùž7ËíýJˆÔ}§<ñcüáó°Xñ!žÜM ãâ¶~*·³û]×–„v~¢x§TŽõ«j¹ñÍë¨ÏþÝOx÷7>¥j:£»55‡Øáî7]¼.ðËwÍß~â#:0êVûûçÑA ˜ÒÈ×ͧoN%|ƸFŠ(ª–Ÿz%Ý…NÃÎþw_ï‚G}Žõ /r›_zÑ1'„*e2¾û;Ýú½1EÅ•à7oÁc›\Þ_ÙëÏÕì~t·v½*†0ÂÆàÎÒß©Ëé¤sÜ™bš´£#ešç(µúvÕ¬ ŠN6d>Ühlf&\°‡Ö;Àq)½¯ãMìÓ³ÎBª³õ¶š-îNщƒªÑƒŽ•â©ëöa¶™ßå(MN¸ääÎq‚³Ø¦cu€–JÍÄnéXã çQõô¢£³ÓˆnEìqÓ¦ñV<£©ÉêÇÙ²’ú†"ë·ú<¯6r³ß*’f16¦SkÂ@˜—Õê±^7+1ϳuÍ}•Ü1¡ ÞÕ·wãz³ÇY½ïlÕúFa¡¸ékÁ§»ZÈÝs4ykî‚ “×QVQ^J[FYJÛ/U5úvÙ6€Ôþ3xMóÿeð´÷eÎA{æÁã?…ÉåJˆ †Äë™I„¾¹ËK{°Æ̪‡à_èÏÿÀVc¸Ðâ—Šÿpz1uâ?œM'‡ø{ùÉøbÍwúA4½“¨ó&8¡cÀÙü³0̃jàjbà%ñr@w“Òa®R¹E›Êj%^¡¼™hL…Xsn§éa"&ÄI ë—DGÐwÐ}ì¢YvÃ!˜!eÎ3÷æ_!Z§Bt^)?†@¬)xßÜ "kç}œÛ^,T@I;¢¶¼¾¹á¸|Då]T8S éFR°«ÖW6Èitñ–Éê"Æñ¬ò^W+®‡-9³T!eZs1nZ3ý½Ãÿ5d y‚PHÐ!2÷Iç" T2ôAð  vrò!ÐIa°ň(.ä‡8ÐïÔ$£R1 ¸Jñ†ÿ_2’Á\¥[ßcƒ9‘^/ÄG] cÔ‚s·]-ÏÜw®Çø‘¿ î¤k†Ð)*’ž ˆÜ/ Ñl†¸O áÅ…·­ 0îØÍpOøÄ}"ŒÃK\îMP×<ãBÝ=0¥ò¿ÿY­ ýã yV8e•ñ•ã—0Ì K)›eWA:<ÓjnŒŽŸ›2¼Ó·ì›-›1;ˆŸ–n,×úïA=n¶ŒiàȼåA=àÝ£ÄÎ$% ܘú]–x¸œ­n·³Û*~±A¬¬\•ÕŠƒo×óJ²í®õR6=bÓ¸»éQêÿ„§Ak’´!´9z™{YvEã/*„ˆ{̼ãP!DÞŽ{šxÃCŒæDp´1±¸Œƒ„°ªû"')Äx¶ðÏÊPÜË2âXîƒï‡ûà¨!Žã„ñøXƃä<Ÿ‹ùa;.!Äjà &üRþô´7Yc °ãÄ©¼Šoˆ×/ÐíÜ9‚…ÒÇ-{{–ݽ¸žu½³O)/í¶¾ êa.êŸ^<ÃíÁíÃm»îÆ&ýÛû€]ºî~,Õ¦9¨,"Å[…}ª,_A~{]Öà”ȸ§€[•£^=6ËGö-BjQ¿ŒXȸü–óÆ»Ùc%ul9;ˆŒø­òÚOpTPû%™w8³EV¹DzÞººLñ}Dó”ðb¹——dÐ U+D6÷Í‚ë‘¿ÐnET>~ø.—PÙ5v¹ÀÚmÕ éÛ…v4[,Ä*0mÃËMÙ|¹Å¡Ì{Æ}F:Üa›gs', «F~¼Òh¼ È#—ùN‡88ÖªÍyÝBÕÊ3gæû 9=)¥ 'ÆA†:5~ Lö e–7àRÀ€ižÓd|^vÄ™`qéc˜;‡¶¥òë†æ– VèZ}Vª¾Îá’Ñ¢EøñFF*3<F*#ùið/róü‹oR[Ña»Þ ÎÃõquQ§æaŠ³“ø7Üã¨iBÎ2÷~€fÛSÛßl•c{)ñ˼u‰Í]/\NòýÌ…q›Z:¼—º‘™‚Kà;š„º›¥pnzÊ€føϨr:ðæÜ÷tn6Ífv‹¯xŠVø’q·:x Ôˆ6eèŒ>W>{Úë"ëK²¥¥‚ŒßI¿——ÂÏ€)¤ª©ryɱ`ÅÚÛl£zÿ¡·§ÀզѴéîQ6W¿þýÇxØ‚Ò°&Nh’ÔN6‘ ðFÆ¡UüÛ³á.6©T´Ø„FÒráÓ2ïuFÀ“è¶5UŸmûò­Ëã–üawïtœ}&þwïUó ô7×ö—Üͤ±0Ë¢Øi{{-ErÄö±÷ÃúGà’¾yU|?Á¾Æ«ùæû˺•6ÉöUõºOZÊ©ûøó¿ÁB<‘ê«ù ˜×fØò ‹B}ÕÖJ‘8>ä@jö)|Ù„ª'.ëê-F×âÚ§¸ÑSË{AZ9Ô@ÓW hÖ艒ߛ1˜øðhÒ:hé¨æâÓ[±â2Ž;>û‰ÙÁQÝs‰ÛP?ÝÕó;ã[·õO9µø|3Ÿ£#f[’dmáI(œg{´rÏ®H¼úi¡Ve‰Ôw z÷˜Â——ìHûíš"õóâ?ðYT{d¨ ñø'ãó³±ÿáüôüìÿa?ÿ¬ùN‚@€ö#‘ ýî¿($Îè¿«l«Ýý›à§&TÄŸ…s49a~ÇTÜ¡Õ-øØG_m$<áûª¯ëpk•óV0f¤1*XWZ‡ºXV{¦¬+vh·;Mãà8åƒ×¨£V§i`µç³¶Âgh[+Ð좩¤Ü´æžÅl-í¸ü^ëfvkÎ!#f8:˜SÃÅl†oïòé|§ãòRÓÊ«?oåy¬Ç+diî\˜N¾aœø¾^I‡¸6e…Çx#iüÒKƒŒ€ú!ºŠ BM?CýÛõÓÖóš7Ö÷å6$ÿ:Îp!€üÿôt|áòÿñÉÿïågø¿Xóq‰Èçý2æB)ç7¡Ø”J¯¢ Äz$0‰S ÂÕók —ð•Â™çW³wµ‹ªIãNçNlÇ×ï›m«pG&Œ/¸^‚àÂòoG«Šž­Ÿöd&8™eo†áá+ÌÑ3ÂÚÞ }äžbÔüyVº×¯¾˜~ù©a )0 ò ’SŒŽ)ßLæã\ìStFÉGø„26¶VY½šåì×y@î•`d³j(åõ«Õ?Ss;}©s‹m§”#ˆrÞqÞ,3xýê'ìLOÍßÙË™?÷‚ÃÜy°ìåõ+c\IÍÀäåÌ@”‚ßmöäyýêâjTjâN_ÎÄÅIçË“²_î”ÿQÔëþz@BþŸžM]ùÿâüìô ÿïãgä´æ;ÓP/úª×U/°ÎH%=WË@€O0 w®#| 0aWÁÇ•‡øBÔ¹0à#žVÚQ£þ½Z¼5îÝL›)6{ÓX(>ãô>äò’Í(¢W.:yJâ‡6=Dò Šä-ËNŽC‡¸¯Øp6Ö·ì¼ fßÈÉgK´›“x3 agÿH¦ò³àW-ûXdm^ ‚Žn¬wIñ}ÆÄ?Œp䋉lºc"[1¡ë@€M å½Ræö½#%I‡n¿vyÒ“ÿ–샯¶ì$_.Š—ÿ&㳋‰+ÿÇ“ƒü·ŸÿðšïDøÃ]ì"<ìË:Ç…wÚ¥—ʼnw|G69DÜxÔ`0~¼×mVyT+»iªUë¯õª´6Ä|I‹¡²t&Ž»H,{^‹ÝQ=7À{Ö·†[«—ËhkÇ#ñÁ"#ßèøÏñèºi–#õïZ$écÿì=#^t÷¬OÁÏQy!2]¥Z,#Âh_öðãøÅÀu»R?ûÑ,ÊŽ dî°¸‡Ëˆ‚ZKÇ7ÏgØá+§‰¾³Âžw½=‹ (¬&Q=ÓìmX›üés¼v­ÖŸ"(HwYˆ¸ˆº?XÞc³„ãâ¼Ð &v°îA šÉ^ò®L?„($–„Å./Ù¦Û4ëcâ ÷™QÏÿcvO=¶8ùCõ‡8Ÿb×åi.A‘=1€¼·RLÒ݃;t ¯³ N3ƒïãÞ ¹3‚[@ŠDYÎ.úPi0p°@†y×,L×ÔÂw +ŒfKŒ‡çuB‹ð.¬[SƒõÀù¯<«9ßT¡;ôÕ\ÍIDCb¯=ÖLùç±Jf*d̨ú̱ê2j˜*¾jx 1×xö{µRÄ8v"* {Š gør¾7Ü® ]F?¦ gDBž‰¾6òôbü,Œ•â“ ^@7&Þ/WÑó>*QÆø/çúyb!ûk°†pÆBE@LÑäS[WôÚ¹âåFy?- Ž A"ÇœÈXßüz‘PTXE¨rÄ€ôNa½óJšÛˆ‰¬†+×…å€xù_ásîžì–æiâþ‘X:‡¶•Ñ;qø£XÜž£{S£{–å ÀQÜ%~÷ä}¯9ÌÄV(¤§7³Ù²žv+-å ‚á(¡ ®äD ]6ÅQCÃò_±ø÷2‚ˆ¾h tCûn™ç’´‹-{+Ñv›pU1ð:´cæ"h»"R]Ø.0q—Ò!{áê VB'§{ÓáäèòâÔœ+ãvŽ±'“:öˆ7ÈgKòÏ.E¼‰ŒÀ¿sâ[®c¬=uÙ%½ S•™“z×5Bg‚ï6Tg¦1ÉDê ƒÄ¡d¶XðXc›uëP¹"Ú°Ýüs .¦Ëp çȪÏuõîyXL ^Ô|ž78>”w¶’n«8úàXÉÐÙ&œ¯RKà³SKY‘ðsvb¥Ó|ì:†.syÉ[>v‚þÑÜ^^JnãU`cVM½â4J=w»A/!1øoŒç¾%‚ƒš€,]¿ljQùGìqEiâ°¢»YQ[5½®¢ØSh=ÏÁ “Ãz¿ž8¢O`Õ­·–½ðq @>+gtnø£ÈÆÐõ†Jè[Òæ=}EšÚI°¼—ÉžWÓ¢‡¼˜t õ|Z§¯ú u+LÚRxSt ÞÕ²}eÚKöjoƒ‘;j <ÖãÓŽü?ÈÑ‹¼/¨ •ˆj§41k‚Á®Zø¤æ÷ýRd1ã°q"ó¤8^88Ï|,6ø|2lxžÓóÝ ö{ã™÷C|s@ˆâ¢ä2='ÊÇÂp(Aî·‡“>; ¢×˜ìéË;~9?•÷uú†±ÄT ‚Åm+7Ë0‡ïËÁòžÿûÌ2ÄöýãïT7L|‡aùD=†ƒz7døKŠ¡Ø/HL&»xô¢ý,¼8-¤Á@ÜG÷#w9>¦ý§ÈNé^ø¹å¼s€-9¶'D‹÷"$VäÅg¡ùúnƒ³Ä‹ŒÎB²ÎAB³LÇg®—Áõ€ßÁ§xm¿¦ßØŽ²·']&¼‹lhw ê}ÂÉä‹HÉ”‹ùCØ{´ ÎLW+ßøìëÕ&ø[@£ÝT<®…JDµ-#çÂ!ptU< ‡¢ÏÄÁ  0ÌÈŽÚ»f»\hz5+¦±pÓ½Ó¸Þ$èøö´“–Ò¦›©È3·SSÜ50Íôäk8(÷g^1ÁÃïôóðŸóåìi8è§øÅñŸãéøÞÿœðø?Ó““þs?ÿ”k¾è§lzHÔ'o1ø%$ÐŽý«æ)*æ·œÆuŠò>¤3ÝŒW5èÂ7uŒÁ²f š¢¼ Òìù 3Ý€aŠÂ41¦-Š»${’Ú†ëÙÁà‰ð?AM‚Slø,O+;’.¸^1à(â¯èôMÅ0¿Éo6O™pÄ€Ãr(ØPŽãùÕ ~#:,¾aj¡\3†ÅÄù‹»øÝAja¡}A4þ’ †|¢)HxtŽœea,s!¶%ÁX xT,Å-àï.‡,”b¨]€!D6ÜÞ“‹÷%K<Ø–E^üà6í™Å„Ú¯ƒóàüd%Óóg™ê°Ïͻ穕sÔ}˜ãWäšÎæÏûð:ïbÿ»>Ú ¥†Ý³¸Šñ¾9‡tÊŠ•Ø?7ç;™½È“cÏMôºWá}LIjŽ¾…éûðÆ,ç9‚#6¹Â,„ˆï¸dá³~Ù2<ö±·(=ƤHÌËä>A’^EHO„CP`Z\èã›0Χ?èŒÿÉsý èJÄÿ<›ž{ù.Îñ?öò3ñ?ùšï,ô§H•õ“ÿ­4à§õ¼p×þo&¸¥4ñÿøÛo'#d¥ÉÒ„«Axûï7­×Pm À„ “ô*†ÈeÚŒßî·ëõì Ž«¹© fRóº¥[µ_ÎD°GVíêq¶ö›vf€•©¹uBÌ@ž‚E½®ØiýXy jÑâ/™BüЫ™ø¡½zâÈlb¦‰I*2ÅáH¡cvÝ0€—4Kõ°nn™(¡ÿ´Ú4p6Z5§Øºz`mjà _Œï° ë÷†"…! 9*š¡CdÅd_3™ü^7û¦jýXµòíýýv%0$£vË$'Ôß}ÃF±¨oĉÎu«fi¿Ó†IeÔR¯Œ0E…®²‘ÍõF4B@"\©6 óz——æ;Ô=ô4½‡ô)ÁRÚÜÐèÄS“|=EVñ[Ä#¥-5A9|}ÕçG9PFxÁ|94° >˜4'U“‘Ã?ƒsrþ¥PÉí yÈè“A™ÿä¤ôKAzûåø Ì6`çatánxhÑ[Å9ª‚tñþKÞ+pJ´x ¦#-§äâKœ’ƒÂ¹·©ÿõ?ùΦS7þãÅé!ÿÃ^~Fÿ3k¾3%Ð:œò5A‹¼ê®þú÷‹&ãLëêF¾4²0\^ò/SÁÀû"5DbSSAÁ÷Âå%Ó4 P/\ƒsbS^õb€<Îãuq Ä ——Ü_—ר»dÚ ›ë§âQ-zºg÷l±Å±Â¶«õ¶¶Ú$+ÿŒry˜àQsýL ±êò„7\ÒžûV',>?a™ŒõnFÏUî)AêÎÕ±ü5D3sy)Þ ¼V:˜#Wû##%“Á ]Ë3þR|k–¸{ë»cuègבHÐù\ñ}.`åÈF…Ÿø®?×îgçkù ô±r”£F~+ºâœÿ©ôg†îOW6•è!/,³vfF¼ASƒÑ29yP2çf'K™¾óiòú6=cÌþãòy°«À>•¸S>Þ¹s ò>XÁæ ÊÐ2‹ghçö!½ÃlZ¿f¦<’‰ó¹ò"!}“•ä9÷¢Üoãoð§!'zNþB®(ƨ]?oÝÃN¸¸n?Ÿ‰<¯_ýºªÿ/³€v|¿ý¤ë·“DL> |2Mð8j±J¹PV.Ô¯ÝÔàéÿWwÍ}u¥´Ý«ÛzÙls{%fR|à¸Ïe Hèÿãé™ãÿœO/úÿ>~Bÿ©©¾ŽŽ54 `'x—©û‚ŒkÁÒØ™1ãFÓVÀdH]U—3`šx©æ^¥pIlÖ ¡fômSA¥Ë²ããÓñmûhQeN”Zm—Ët©‡%ã–W[¶ê9¥yÖ"aÍÏ(útÝ,3 *t.¨Œ ϽÏ^ê´ÿêTWa€ùÎØÿsí¿çãÿßËÏØõšïÌükò§å[u•b㯂®lž†MU€é—ó:œhׂ€Öͧ@ _[fÞ,·÷«d±f»yØòÔl÷É¢ÁšU’õ—Y% r7ž’˜ë‘2]°0ÜÞÓ…‹3›ôcÒø‘yˆ·«ZfëÓÅZhÎõ¸6×£[G$/6ô˪/Ä®YùmË•¬Ï*¼®?+˜±D57Ÿ,`HæE^U³µ&½YÏVž {¿®9v÷ÆÖä—&›õílU·+"í7ìhm>ñűËWúñolÅŽ®·¯G~§G(\õæé_XW꟣Íìört2º¯f*ç2oÞ^(jõ} ]ÞŽoô¯ÿ::9UÝZÎÇu›ÂÿÆJD\hª››z^‹oW8*Iù#F¥:²QnM å¶GG'*Mt[mÞf7#vÉè¨úÌUA¦' µŽ}ŠT™o» ì§Ds§OðL/ÿ¶åÁ“ïf•³ÄõJÀV›Ë‘e.£eËñßF˜È–Y°¿íc;>ö÷˜÷ù¶?šGŽnù·nA2l‡¾~á׊L~ìc`ªMNãö­¹ê[ßÏn%A›}$ïþÌFÿ¬ÖÍ7fžÙrÈÊÇ£;!øóÚ+ƒ òÖ MoòR³Kaò¾ÌÓHfǃqè_ôÊaXj‰„î ·'?Eä¥%‘?üaÝ<Ö ®íßóÒ÷œzæ-€ûé^x׸®œ™üu¥sN^ŽþúËOW¿þüýþñç¾?öv´;ɪÆÇÿó·®¾ÿë_¾ýñg·ÎÈ&µ< Ôúå»o?~üáï?þü?üÞœy‚Õ¾ýî»~ùÅ8¶Â%kp†Çw¡wK?ïÞ!FyyÿZŒSbŒ_O-âuu[¯2Sµªæ³³~Ã8ò ¤iÌDÜhý(´Ym™2¯¤ÃneÙkëJñBmmï­ð Õ"÷Ndhå“rU/¼—ȲfŸ®Új½¹º^ÎV¿+ö*£˜Oøuø“øò9`íûöªØÐWc¯‚MÜ;[;Ilí+l´ÏaRdûTšl9@äØ5¯×Õ=ã•¡ùQo¯–Ü›]&@1ìl»2ªÿVe¼ ÜyïfåD1eàð_o¯ƒãÛ^WŸ¹€CïÓìÁýzd’ ç9ö ¤vÿÛ£ð5ÀêÓ1Ì•ÞïbG‹°#ê²åÙ;Æ®£T™ã—Ê0dj[잣p ^gƒ–ç™úÐÐ8p˜gæ0ÂQ彄óhÆá>q¦b¥gÈW<ù3,2œte0YL‚Ó†š¨øÛà"ÄYá=Éâ;ñ™7V‹¾éŠJ ÷)N“qœÐ¬¥Zf¡Áqgä$;éó©åŸƒÈWÀ²IÔ³ÞD¤­fX¬è|irËnÙk"Aü ÐŠ_ž\ÖÿäoµÍÄÐWm9À€áh£™RÞúÇ7™5ËÁ=Œua.?=l®¯x+´®Ôw'÷vA²äG¸ýÅóX˲Tç—©?§AíK;g¾ý8¢èF´¬3Î? Ô`|!0è¡umï2ý7݈?¾Qé¨ô]¯£#îpåaWŒ˜ÞFŽ·ÎÜd –ARtš‘”qÝœ‚ׂØ,PÚÆ»;K·{Ë}m»ÐÒ»+Df¼Œòõ?!ekgRµTA Âçäùáœ,<'ŸÓŽœw’»d¸ó~ì-èýìÇ/ËCÅYØëW¿D€q¶/ÝnGÚ[zOI‘“ÞLìÙdÑ_b‚ÇÉ~äÙÎÇ[jè62 Оç qÛvýúÕ¯Œ;~ÃtvËHI@[Ž™Ì¶i¶lÙ4mED´ðAöµ_§ùâ~$þ[qÚ¡B@¦îÿœ{øïÓÓÉÿ½ŸÁ«5ßü[µ_€þ¶WnºFþÐ-tÅ«ú4¼X80ƒÔñ~yŠƒHÌ@‰@²åkç¢%†°æ_0A¹ð:¨\V¾¼Ô ÿê[óI÷ìˆeGÃhÖvßip|t¼a5Ç8üºzˆS¨‡(+€z†¨‡NnõÔ?eÞ|…¨Hþ¯®ší‰ÿOÏN¼øO§g‡øO{ùþ¯Ö|gü_µ_Àÿí…Ç2þ¯ ™¼®Iå'JÜŒ‘ªE¸” ÜËÔ„D™eµºÝÜu>uÔwS§Ž<^ÌSrV¸me}U³¦-ºzÙLÔÛ-”~Áw6S'ÈÖ­f Ö¥Õm—ŒKæ{Á|ì™PôSœoÆ?èÿûù ùO¯ùN„?Ýø9Àe›ñ,ઌx/ÿ] \U.k?\Õñ3‚ç5Fv.Í nª ;¸ªáæ蛼<áyíÖ6W¸ªàe G é…e WwjЛF¿bäìt7#)»^äºó»¬TÓ-Ç:º­sq”ç#ý|ÅO8¶©òúêÚ>[ª‡øWD¶kÖ0@Êv-gÚU  fÅ[§v0×ãB$u[UŸl¨û™ôV\¤¹±ÃHe@SQT 4ùNÓwß,ê¥ëÉ|­rÅ? 0ÁžnÓ G¯’™Ñt®5{¿[ƒ&ŽÙ²¨(ÕzÍ„®tºQØDz¢¢É<½­š HÕǾI!5÷-¸™¤(u&7(AG’/wI‡Çg^´o 3q›O7 ­‰±ÁÁ7LΓ«ýͧº­˜|3[¶•ÌΟÈ ŸVD©"dÝ|«âg«AÈdäp»ª,,2ÓÔñè®ùTñh"b©mV±‡dÉ{¦cñ%×£ÎbGcKM<²Í(ÝLtÙ¶bŸ·ˆs’KùçÎÆbгI|ŽOðü¦ªñžŽª¾œI„Ï<ÇPØq—˜ùËÖI!­2X«ÜÕô yB}bÿ›‰4hb8yËÙû—¹RJ®Ž íIѯŸ_?´˜’…³’âD±êmý(ò‡·`×ïV:%$ÓØž6ƒÞ€ºÇ²×oþM¯G™Øy àéE’”1“K,âE9¤xPÍt_k^}« •‹bÅb'+=ýP¾Ò¹ …Ëyë|¡PìfmÃòš-ì¢n–| e"”O³'™ÎzÃæb¡%»íŠ‹6 |4âEzuUü¸…ɶ"¾dt$?ˆ·*å ÖÒ§fý» &ŽÛÖIçоH©TV_Ãk€,‡f»ñéùžÌvÛM½¼jg7w°ýVf¹³íèŒ'òâE#ÀZ-q (ήd2×#ç[†fÂ$ì/®$Ììºq@18éTåX—‡âñ}‰¥¦ÙK{×l— M$£fÅdBnÏuú#Ô– «eâpXÚVùÔØ™¼)‰§ÖJ ¯¡ÆàÍóYßÞ±O»áÍñÓä«!ÍE–Ñ›ÞS¨k%?6ŒŠ¹¥ˆþÄ_ß"G÷‰ Ì\â¼®*¹ºŒèþF·Ü“ºQè=”2Ä&·‰ôŽ}¡Ãt²™PNZÒC›{<€It¤KBiñU½a¤jª^ÊPß3õ•ˆA.”wÖ¡‚pÎæs[^Zbô†Ñý‹±ë}÷FˆoÌËyµ\Jƒ2#J•rÍöþ^y‡9DHéµLÌÄäH9d´äš¤ó¬±çÃéOaŠ×Tw«0f*ÞqœžºL nqÕ·Ù§îIt¸~¥?ÿ'.~Ü ˆþKâÿÆÓ‰‹ÿ›žœðûø üŸ\ó ÿdÓ ìŸ¸Ôñ‹ñA†€8P ¾Òa=¬¹OSƒíläûÙüó*pÓ#ÞÀ;ÔD —x¼ q_?ôjMb³E“=†öŽ\æD­w¡¯öF »7j¡åÕyì­—°±§P¢t²©4&`Ø!,.Ú‚7[½d t3Z¬_í-þ¯@ÝÀ²ŸêbT‹[(€¦šûÙSíÙâF›@N{ù¬·\QÜ£$í$êQñÆ0è1º]ßâ¼$è³°)„ñÕ±t‡>/ÍpŒ”uB°üŒ‹U…}ˆizäìY³xÚ³óÏv8íÕað ö7ô—×%/Úmëï:žœbݾí ÎT—:14S§Zpà•±ˆqMöß%®êx´¬6£-¿¸Éµ·‘r`²)[5«o”YÊãº< ä‚ ?Õ×ëÙú)G«× I@mÄ5^¯áßÙÁ„u³e_Ãëj£²h78iÅ~záROH­—×äld¨cðÔ„ùµ‰ÝZ¿‡ ºI³eê’š›ãÛ`Œ€?…]*îŽõn½ý³õÄ/¼$^ÂIQÒÞ]Óf9ðSÆωÇÍcćÚÃà1cbÅ&p½ºáBYÕÚƒzèÏÑ‘ˆÅÙ®Uö2Ö.çP›ªe3ôöðã©ÖÀ.¼‹ë´’XÎk‰å¼ËyVD2LÆå(ʋ߇£À&|Ž‚PžA.ÒßI±“lT'ÄßîfÍ$ʢϒü £ÃÐòyÈ0P9ÖçxLÿ8Îœ:¡Âöví¶‡‡_˜È!¶(MõîƊᶠôÇy<$NL¬0F …ÃMçñ°²õÅHx(ワ•·zØc ,UøÑ>1a„zçàÁà³~h0¾0,˜äBÃà¿>ôОôº;L$Á+|%™$±À©P^%ZR¨Wß3‰ËùH¯§=zÖšôm×ðÜÞê¿''m¿î@¦ê³Æ/ß5û‰àË¥‹‹¡E‘Rº ÁéD> Nº´ªÔ6š"™]@F½•X⻚ ñuïí ÿŒ? ­wû´ã<ó(­Uš–}uûòM@*^ç GÝ…Þ tÔ_W?©à£6ª1¤†$ðȪo—0ÎÖ ‹Áÿ)èƒ39ãìA[¶ö 3õ jƒÂL‰™ÝÆÔ!™ŽÓÉÙÙîÍòÈ€¶šÏÚíR¡îà+º ןJåŸÕsïCiöyQ{þkµ].þ–Â'çã'þïÙt|ˆÿ¶—ŸÀÉ5ß þK6=dì7Þb<ò›(!ÞòD}ó[Nc{DyÛ“nÆ+ˆ,òF7S£å]Mϯð°4éö Fö5¶‰ù˜X´y,š «‘Ô6@01o0x"üOP“àÛUä(ÑE—¸Q¼bÀcÃ_í fn6OÛÀbÀa!lØ!é‚2Hfç$î2wwß«%„º¤hü%…x‚Ôâ“GAx'àÓËYÐëÞ²R,d>kÕÍu¿»< SjæŽ[Ú/r5殃=²µÂ®ö¹tµÏvµOž'¸Ä¥û9¿ƒ{pç·»g¥Ùîoh:lÃ.i4©žKTÎuI÷ak_Q˜’lκgôûŒÓSœP$H†a1®b¼Îã!]ÄbšwH7ih9Ï=}ÿì±#Ž¢'Èul$z€\ÇH„|“ªUg†t2¶ã"†Ïú¹ˆ=îôÂ\Ä+ÆY<Ù`27¸OU¤…Ì#ì—d”>ÅûøeR‡Î.ü2¥²qGLMj<Éà2ii"¼SÃÎð:åíp¦o'Þòöìs Vo(‡ƒZÚ}¸\RïÈâ¬L!ìªáÿÑîØ“ùÿ”gd_ù_/Nϼü§ûÿ>~&ÿŸZóåÿÓÒüü6RH—ü¯*[Ÿˆ°Qš‰Ri,Ø ŒËð„œ´«ï¨è¯_ýüëO?Á«2  ëŒWšÍ9§ÔsÔ·&ÁÁÅ¢æØ€6^®qáèÌÉVÞ=›9îYE5žXíž©Åœ[WÙ~_¤ÀÐ>;é¼g@¯¡B¸ÀçHåIx˜Ã¨¥çÎPæñû{À ÿïéʼnëÿ=?ü?ÁÿÍšï„û›Öw$œâ»s Û¤ó¤,ühæÛб,Pêkà°>¦:ËŠh¡+ä4˜ö}ã|ÛÐK›j‡(æ5ZD"ÖN¦økyQJØX…@?oá R*NÀ"w¡Þ‹m)… ðô%Ùæ@ðÐÎÔ³_Õ0©­~±Bå Yêê5Ó¶ËÙÚ¯ò‡9sÙÇ*Ën-„Ä•ÇbV;2_‹˜Uê@09qi³öð;m̶WfU,PÝÎÊ]Ü ÓºðÑÑ7cÁP™XÈÙ‹öˤNCŽ[‡=x'nöi8y?ýøÔÝóÌ{¾+»WÇÜM5^{FbE0¥–1U-Gµ$iTʶDþì´ŸÐnÍ Ñ åç>æÏcöþ}€†=ü¯Žý6` ˜þ÷üâäÔ‹ÿszÈÿ²—ŸÀÿš5ß ú×´>d…  ‘UIÔé`tõÒ.Ò±qp`0ˆpËm§m¬Ç@©âî¨KóÏÄ3mÙ1wl© ã½u™ýŒÑx¨Ëܶy2«7ÒzµHµ¦¬Es¶…6£wò?òUî|8ÞþÔ+ïK<)îe X2u=Wü)ì@ Ò.Œøk€ÁfÏE’ê)XA:ΙY†õ°fÒÇgÉüV×WΗ—¥22–}@6äj†IÆÌ’ÛŒ–¹øDaåGÝVSòWkB_&D]T»÷éìR™ju QPTÓXϨהÁ¤ÆµõB $g"v¤Ž êjÔˆ0<Ž['g9°þì/ˆ§Aç㿼 ï.맖² ¦”§Ú袓‘¿ÊÈ¡kOjŠ~†uiÙqaÚàãÃÃ|ƒïÙƒRRè ‰¬{d*Ývèé^^Rdª$‰æ¤]úÀÆ:P[À[äà¬óºP¹T@:G&÷+lðyÈ#få,]1êCͽl}:´£mË*-êu5ß,Ÿ²–=ÄôáÈ„38Î"ŽúÃA‘Y\¯ÖŸlö{š"N§Ó^ü§¯qÝÿÚ¶„Ä>úô¡E¾vâÒV' ¡7ÏÇ>kxa\œpA…(H@ [ %l}6±4‡•Q´ƒãs›CÉG÷E%¥ ¸:Ór©h',ñ×íóË£b””¤"y†-ªÏò ?ÂC8Íq‰î¦Ù²ŽÒtò~/ëz"t¦ÅŽ^PN³>å×Ò¢@Hæ‡"@æÖD™¾Ä®„OÂùì.ö`š8Ê¿|RÛØVö ÌÃRBŒV‹ ©Äd±èaœëol?oLI¥lparôFŽéÿx£6å?þ1ºmXã”?æda›È!8Ùžñ+Š¿t·Æ€T>DÛçLÔ#g£1¦†!ÄžÀ€RòÎENÓCÞ!Óg˜ f‚èmÒˆ0Ë £!ɳÊABâVrp&±ˆ^ƒâ1¢¥y³eb=Öñ}5¯ŸX†“:J`Jzbñ"T.&™fÝÄ«eÐdþ›!cTúŒjÈ•Ý,K§g%öÃ:AÏE‡L•C¤Å:ýM· ´Ùg¿ƒDtwÅ!†-Q/ †HšÃ€ßw°5”Yú¥~ fo¢ðjY’G·ŠrÙÉâÙ#à%EhGïøde__@aó^v¼!Pw>Ý5mÖÉœ²}žŸw9;JRJìR)!T–lÎ$ƒ]"ï·÷:l|б.ý ®b]J‚€¤P¯Þú_Ö ´©>Ò[#¾.ã¼ zsüYéIrrÖIürïJɪ¿×W×ËÙê÷+ö\ãŽÛAÒzvô*?aVœ”SœfZ¢j¼Ï`c×qóêµ1‚vdûUV•ŒYÊï8Êž8H ó§§>BÜ8ïÈ,æFöàD…c6?碾åÇ÷ùíºÞ<]Íïªùï“2æf^$ÅIOp¼¼DÇ`s5x ãQã ƒ}âQÓdzîg—ñ¨Ó; ÃÃ'ÕxsÂSwÛã)•[5Wµµl¦îìÅrL‘ZÁužç‘PÊÈ‘ÂQ¯q‰TÔë $`r¨£ß_k/t{×l— éÏT„.º[ã üE§jBÔùHFªZÉû|³ù¼z`ôüb/¡·;Yù¡·Éæ÷„{0Ñiüá´7Fnð àÔÓgïË UÒ(€RÙK~ø~‡ßáwø~‡ßáwø~‡ßáwø~‡ßáwø~‡ßáwøýñ~ÿ¸gWó(‡cloog-0.18.4/osl/doc/Makefile.am0000644000175000017500000001460212413270135013227 00000000000000# # /*+------------------------------------------------------------------** # ** OpenScop Library ** # **------------------------------------------------------------------** # ** makefile.am ** # **------------------------------------------------------------------** # ** First version: 30/04/2008 ** # **------------------------------------------------------------------** # # # *************************************************************************** # * OpenScop: Structures and formats for polyhedral tools to talk together * # *************************************************************************** # * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * # * / / / // // // // / / / // // / / // / /|,_, * # * / / / // // // // / / / // // / / // / / / /\ * # * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * # * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * # * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * # * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * # * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * # * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * # * | I | | | | e | | | | | | | | | | | | | \ \ \ * # * | T | | | | e | | | | | | | | | | | | | \ \ \ * # * | E | | | | | | | | | | | | | | | | | \ \ \ * # * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * # * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * # * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * # * * # * Copyright (C) 2008 University Paris-Sud and INRIA * # * * # * (3-clause BSD license) * # * * # * Redistribution and use in source and binary forms, with or without * # * modification, are permitted provided that the following conditions * # * are met: * # * * # * 1. Redistributions of source code must retain the above copyright * # * notice, this list of conditions and the following disclaimer. * # * 2. Redistributions in binary form must reproduce the above copyright * # * notice, this list of conditions and the following disclaimer in the * # * documentation and/or other materials provided with the distribution. * # * 3. The name of the author may not be used to endorse or promote * # * products derived from this software without specific prior written * # * permission. * # * * # * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * # * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED * # * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE * # * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, * # * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES * # * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR * # * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * # * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, * # * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING * # * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE * # * POSSIBILITY OF SUCH DAMAGE. * # * * # * OpenScop Library, a library to manipulate OpenScop formats and data * # * structures. Written by: * # * Cedric Bastoul and * # * Louis-Noel Pouchet * # * * # ***************************************************************************/ # # Makefile.am (or makefile if generated) of the OpenScop Library. # Makefile.am is not a makefile, you must run the 'autogen.sh' THEN the # configure shellscript to generate the Makefile thanks to this file. ############################################################################# MAINTAINERCLEANFILES = \ Makefile.in \ htmldoc.tar.gz \ openscop.pdf \ openscop.cp \ openscop.fn \ openscop.info \ openscop.ky \ openscop.pg \ openscop.toc \ openscop.tp \ openscop.vr \ openscop.aux \ openscop.log \ openscop.doc clean-local: -rm -rf htmldoc EXTRA_DIST = \ htmldoc.tar.gz \ openscop.pdf \ S4.cloog \ images/basic.eps \ images/basic.fig \ images/basic.jpg \ images/basic.pdf \ images/basic.txt \ images/basic1.eps \ images/basic1.fig \ images/basic1.jpg \ images/basic1.pdf \ images/basic1.txt \ images/basic2.eps \ images/basic2.fig \ images/basic2.jpg \ images/basic2.pdf \ images/basic2.txt \ images/tree.eps \ images/tree.fig \ images/tree.jpg \ images/tree.pdf \ images/tree.txt if GENERATE_DOC # Unfortunately the following is not supported conditionaly # info_TEXINFOS = openscop.texi openscop.pdf: openscop.texi \ images/basic.pdf \ images/basic1.pdf \ images/basic2.pdf \ images/tree.pdf $(TEXI2PDF) openscop.texi DOCDIR = htmldoc DOXYFILE = Doxyfile DOXYGENTOOL = @DOXYGEN@ # The following requires a fixed version of the Emacs 19.30 etags. ETAGS_ARGS = --lang=none \ --regex='/^@node[ \t]+\([^,]+\)/\1/' $(srcdir)/doc/openscop.texi TAGS_DEPENDENCIES = openscop.texi $(DOXYFILE).in htmldoc.tar.gz: mkdir -p $(top_srcdir)/doc/htmldoc $(DOXYGENTOOL) $(DOXYFILE) tar czf htmldoc.tar.gz htmldoc endif cloog-0.18.4/osl/doc/images/0000755000175000017500000000000012555417256012533 500000000000000cloog-0.18.4/osl/doc/images/basic1.txt0000644000175000017500000000033112413256474014347 00000000000000 j^ i>=2 i<=N | | | | | | N-+-********--j<=N | ******** | ******** | ******** 2-+-********--j>=2 | | | 0-+-+------+--->i | | | 0 2 N cloog-0.18.4/osl/doc/images/basic2.pdf0000644000175000017500000001414012413256474014305 00000000000000%PDF-1.4 %Çì¢ 5 0 obj <> stream xœÕWËN1Ýû+¼ HlÇcK¥‹JU%v%‘º@¬By)©]ô÷{Ÿ¶²a„˜œ¹Ïãǽ¿X7xëðO~wsq=Û‡¿Æ ódÛãõÁ”)ÚRŠƒ£ÿ×ßæþÜ8û`üì ©ç8ø˜­O%y²èéÓ ìŒO± ^Å¡·mzFôWï¢"„Vœ€˜ºº(¥’¼±Å†ÙÞâãÎÄa²ÿŒ·W††n¯œøÍÆøqª jÆql G_†Ü†ÔÙÓ 3DXÓ‰Á@ÊPˆbê\”ÍñiÄ)DD¢ƒÀ1ƒÝC#G`gJ(2”»ÎÁI°!˜)[µNâ OòÒ9”æï„ÙÕý'üs¾:ý´$õÑV˜e´”êÂ/S[cÉY] û1Ëš„SçRyµ]xâ4ë^Ä —ÕNe¹ÚÚkt«Mr×98‰#«=ÇåjÏIâ èV›ä¥s(5ŽîÅÓd§“dž4õ¦sjÒ>£¹Hâ:k§­˜IǨ̰—3î1•ÉKçPºx’¼¨xé`‘ª`,[\ÚÄt.IUèŊл„VŒóòŒ£ÍO±¤*4 )8}ng\W¼Ÿ€fë…\Œe¿×ú¯¥BjÇ õu¡ÞÛ‚ã²É`1p,®’š„SçRyu½ð´i¶Ý)< kR]¢Sݲ³,ô.¡ñd—ËNtÈOxjR0•Ø-{›ÎO@§ó>kÃ89 ‰_·{’ë©ö`ésI6Ä삃„{†#0سÁ;”G˜‹JÙíÑü:·àCû2ÝAâ+F¶Ãð£ºlÌÏeâe°.Ç¥wŽYà£ã~Äý#ófg}‰ã .g VrÉ`i˜."‡¡Î_5º™ ã:}ʦÞ"ÂL|ÄGŽFi¤ýš ! ÓH½U²‹|Äg>A8ó1k»ÎÒ!«ù{ÅÆLE'‚X‘ù1ñ†î›,%¤ÆÇÄÐC°TXÌPÍ+°‡û*'XŽ*d°RýY ® öbóæÒÙfªA§ðÍhtkTªÊZ]2ŠS³ñU®é/Æ3–ŸÝÁ~Û­¶ñ4@Úl·÷†oûðŠ"<¶³ògÛgˆ3&»½3«€oÀi]¾ß€zsR [WÒàçU<»Ý^™5_„É1¢#î±èà’g”\\¡ŽBš< Øäfõôõ¢æ4a «§/—¶Ž]ûà5ZË™“=£!E_Œoù×>%ñ{B›ï[(¹Ÿæ?ÚK!endstream endobj 6 0 obj 954 endobj 4 0 obj <> /Contents 5 0 R >> endobj 3 0 obj << /Type /Pages /Kids [ 4 0 R ] /Count 1 >> endobj 1 0 obj <> endobj 7 0 obj <>endobj 12 0 obj <> endobj 13 0 obj <> endobj 10 0 obj <> endobj 8 0 obj <> endobj 11 0 obj <> endobj 14 0 obj <>stream xœmP]HSaþ>÷sFNí‡ÍÒ}‰¢ÕAMm3É Óù{c:ÝqžÜÎóLÙœæÔT83V*Å Ôø“äEtW"‰H¸®4ˆˆ"«ï[gÕE]¼¼Ïû>ïó¼¼/Ê!ÔÖ±¦û”™wX¸xMŽBr,¤)ÎKYŽUiÀ8”˜$j¢V9;ˆ_ÀOSðãý@áòZÄÄ;=.ÖÖ) ÌzscVvvÎßNnQQjóüfPÓÍÚ8”!ƒÆÎ; '#“> endobj 15 0 obj <>stream xœeËOQÆï0tf"•Z•Èc@ Ei 16B4‚i|­­í@éÔNy†ˆ‚FÃ…Š”>b•ˆP6TLÔD7`L\øGȹuXØ11.Üós~ßw(‡(ŠJ¨ÚlÒáã¢Óª´:rˆ"©q$6ÉMDŒžT¥¡âºµD¬¦±:~*Z• C{áænèÙƒhŠ’—‰în`wxùœ³¦†\.ïŸb0¼¥ûï„/·I‚ÝÅgÇŠ›St·Ù\Þ"¾,¶ít Wx»³Ûíx³Õj³*gõf§­•?!8·[ìàsÊrù½ÞP-´YÚ%Þ$¶™]|µhäOóJüÿe„Jh)4 T‰ª%# bbo£xTƒ^Q*ª’zñ«7 æðSr,¸ ùÔdÐ`%f­\'1‘þ±~láä×,¶Ü¸|ƒ“` Ä:Fúàe®‚lk›sc¸%YGV„ÅæŒ$ø!7Í‘Ÿ!…e‚Ä nRÁ5JÌ»;}¸™Ûq±õ½Þ–®ë£ßèý@zàѽqàž»C­W={íGË÷Õ™7³éOæýËøW­Ð6 1§ù–—+‹ ++ʼnÜÅà—i ‰!˜ AÈ: Y"zðkIE[["ï“‹Nå×ä¥hܲ †XÍ’œ Y¬Æ ™k@+­e¿lcÀoU +=¤ rhø-×Ê#2¥ºÆŽùü>ßðL`ztsÓãí—2v´,6vöä rI±úជø+GÖÙ?RÈ`(X…TšxÀ®•WYßí,ÌÉ:ŽÂ‘o›‹ëx+e»dKFç/vÚéVk§ –r³ÌÜç¥Ù÷8‚Ã]Ïì~{qSW]ë…sųœ-ë9/)d“:ƒÄ„† Þ|B8¬V?¥NDè7Ò“+‹ endstream endobj 16 0 obj <>stream fig2dev Version 3.2 Patchlevel 5-alpha7 basic2.figcedb@localhost \(Bastoul Cedric\) endstream endobj 2 0 obj <>endobj xref 0 17 0000000000 65535 f 0000001268 00000 n 0000005524 00000 n 0000001209 00000 n 0000001058 00000 n 0000000015 00000 n 0000001039 00000 n 0000001333 00000 n 0000001730 00000 n 0000003055 00000 n 0000001445 00000 n 0000002010 00000 n 0000001374 00000 n 0000001404 00000 n 0000002259 00000 n 0000003287 00000 n 0000004053 00000 n trailer << /Size 17 /Root 1 0 R /Info 2 0 R /ID [] >> startxref 5747 %%EOF cloog-0.18.4/osl/doc/images/basic1.eps0000644000175000017500000002040212413256474014320 00000000000000%!PS-Adobe-2.0 EPSF-2.0 %%Title: basic1.fig %%Creator: fig2dev Version 3.2 Patchlevel 5-alpha7 %%CreationDate: Fri May 9 15:48:25 2008 %%For: cedb@localhost (Bastoul Cedric) %%BoundingBox: 0 0 347 303 %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 303 moveto 0 0 lineto 347 0 lineto 347 303 lineto closepath clip newpath -152.1 333.9 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 10 setmiterlimit 0 slj 0 slc 0.06000 0.06000 sc % % Fig objects follow % % % here starts figure with depth 51 % Polyline 0 slj 0 slc 0.000 slw n 4200 1500 m 4200 3900 l 6675 3900 l 6675 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 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 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 % Ellipse [15 45] 45 sd n 6653 1522 75 75 0 360 DrawEllipse gs 0.00 setgray ef gr gs col0 s gr [] 0 sd % Polyline 0 slc gs clippath 6970 5160 m 7215 5160 l 7215 5040 l 6970 5040 l 6970 5040 l 7150 5100 l 6970 5160 l cp eoclip n 3000 5100 m 7200 5100 l gs col0 s gr gr % arrowhead 15.000 slw n 6970 5160 m 7150 5100 l 6970 5040 l 6970 5160 l cp gs 0.00 setgray ef gr col0 s % Polyline 7.500 slw gs clippath 3060 1130 m 3060 885 l 2940 885 l 2940 1130 l 2940 1130 l 3000 950 l 3060 1130 l cp eoclip n 3000 5100 m 3000 900 l gs col0 s gr gr % arrowhead 15.000 slw n 3060 1130 m 3000 950 l 2940 1130 l 3060 1130 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 7200 1500 l gs col0 s gr [] 0 sd % Polyline [15 45] 45 sd n 3000 3900 m 7200 3900 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 % Polyline [15 45] 45 sd n 6675 5100 m 6675 900 l gs col0 s gr [] 0 sd /Times-Bold ff 433.33 scf sf 2625 4650 m gs 1 -1 sc (1) col0 sh gr /Times-Bold ff 433.33 scf sf 2625 4050 m gs 1 -1 sc (2) col0 sh gr /Times-Bold ff 433.33 scf sf 3525 5550 m gs 1 -1 sc (1) col0 sh gr /Times-Bold ff 433.33 scf sf 2700 1050 m gs 1 -1 sc (j) col0 sh gr /Times-Bold ff 433.33 scf sf 4125 5550 m gs 1 -1 sc (2) col0 sh gr /Times-Roman ff 433.33 scf sf 3825 825 m gs 1 -1 sc (i>=2) col0 sh gr /Times-Bold ff 433.33 scf sf 2550 1575 m gs 1 -1 sc (N) col0 sh gr /Times-Bold ff 433.33 scf sf 6450 5550 m gs 1 -1 sc (N) col0 sh gr /Times-Bold ff 433.33 scf sf 7275 5475 m gs 1 -1 sc (i) col0 sh gr /Times-Roman ff 433.33 scf sf 6300 900 m gs 1 -1 sc (i<=N) col0 sh gr /Times-Roman ff 433.33 scf sf 7350 1575 m gs 1 -1 sc (j<=N) col0 sh gr /Times-Roman ff 433.33 scf sf 7350 3975 m gs 1 -1 sc (j>=2) col0 sh gr % here ends figure; $F2psEnd rs showpage %%Trailer %EOF cloog-0.18.4/osl/doc/images/basic.fig0000644000175000017500000001045112413256474014220 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.4/osl/doc/images/basic1.fig0000644000175000017500000000727012413256474014306 00000000000000#FIG 3.2 Produced by xfig version 3.2.5-alpha5 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 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 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 1 3 2 1 0 0 50 -1 20 3.000 1 0.0000 6653 1522 75 75 6653 1522 6653 1597 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 7200 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 7200 1500 2 1 2 1 0 7 50 -1 -1 3.000 0 0 -1 0 0 2 3000 3900 7200 3900 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 6675 3900 6675 1500 4200 1500 2 1 2 1 0 7 50 -1 -1 3.000 0 0 -1 0 0 2 6675 5100 6675 900 4 0 0 50 -1 2 26 0.0000 0 285 225 2625 4650 1\001 4 0 0 50 -1 2 26 0.0000 0 285 225 2625 4050 2\001 4 0 0 50 -1 2 26 0.0000 0 285 225 3525 5550 1\001 4 0 0 50 -1 2 26 0.0000 0 375 150 2700 1050 j\001 4 0 0 50 -1 2 26 0.0000 0 285 225 4125 5550 2\001 4 0 0 50 -1 0 26 0.0000 0 285 825 3825 825 i>=2\001 4 0 0 50 -1 2 26 0.0000 0 285 315 2550 1575 N\001 4 0 0 50 -1 2 26 0.0000 0 285 315 6450 5550 N\001 4 0 0 50 -1 2 26 0.0000 0 285 120 7275 5475 i\001 4 0 0 50 -1 0 26 0.0000 0 285 915 6300 900 i<=N\001 4 0 0 50 -1 0 26 0.0000 0 375 915 7350 1575 j<=N\001 4 0 0 50 -1 0 26 0.0000 0 375 825 7350 3975 j>=2\001 cloog-0.18.4/osl/doc/images/basic2.jpg0000644000175000017500000003012112413256474014311 00000000000000ÿØÿàJFIFPPÿÛC    $.' ",#(7),01444'9=82<.342ÿÛC  2!!22222222222222222222222222222222222222222222222222ÿÀ "ÿÄ ÿĵ}!1AQa"q2‘¡#B±ÁRÑð$3br‚ %&'()*456789:CDEFGHIJSTUVWXYZcdefghijstuvwxyzƒ„…†‡ˆ‰Š’“”•–—˜™š¢£¤¥¦§¨©ª²³´µ¶·¸¹ºÂÃÄÅÆÇÈÉÊÒÓÔÕÖ×ØÙÚáâãäåæçèéêñòóôõö÷øùúÿÄ ÿĵw!1AQaq"2B‘¡±Á #3RðbrÑ $4á%ñ&'()*56789:CDEFGHIJSTUVWXYZcdefghijstuvwxyz‚ƒ„…†‡ˆ‰Š’“”•–—˜™š¢£¤¥¦§¨©ª²³´µ¶·¸¹ºÂÃÄÅÆÇÈÉÊÒÓÔÕÖ×ØÙÚâãäåæçèéêòóôõö÷øùúÿÚ ?÷ú(ªqêÚlÚ¤Ú\Z…£ê¦ùme2¢ñË&r̼‘ÜzÐÊ(¢€ (¢€ (¢€ (¢€9½Vɤñ¿‡ï‰ä³HÒu1u |v°Šd1È`00’dohPø¢O^]ý‹S 1Ý)nU‚í11ù_,Å0íÊÜqšåüOagoñ«ÀWÚAÕ×ö‡Ú&HÀyvÛ¨]Ì9lzWq¬èz_ˆtç°Õì ½µl“&v’ܧª¶ à ž hQ^.©yáýq­~xƒUñkåÄÚKÛ›ëläF¦çzùQ…n6“ÌXvÀã°ñN›á»ÝËñ;UÑn›fû5èí’/‘qˆÈÊäa½óžôéËø“J×|C¨Ç¥ÛßϤh‹–âúÊ`·sÉ“¶(Ζ«€ÌÜ–ÈQÆêáÿ±üÿEŸ\ÿ¢ð¯\žxmm常–8`‰ É$ŒQ@É$žœÐ™é‘ë¾ø™¤èk÷ÚÖ…®Åpm×P˜I=´Ñ"»årË€çd¬¤ádœt P6 eEQEsz­“IãÞÉf‘¤ê4bêøì9`2 ÈcÀ``/$ô•æþ'°³·øÕà+Èm ŽêëûCí$`<»mÔ.æ¶=+?Çž#ñNŸâ9¬µ‰ô¾ßøéöfâb»:;o',åUön 4Üx“Çð–5Í^ I$ÁXpÒHAÎbÛ~R7cÎk ®?ÁÞðU¤_Ú>:ÒÊÆ]XÌ·s¼Å@rÓdÌH1àf±üS¦ønãÄwrßüNÕt[¦Ù¾Â z;d‹ä\b22¹o|ç½zEW¿¾·Ó4ë›ûÉ<»[XžiŸi;QA,p98ô¯'þÇðý}sÿ ˆ·¡¦Ø"ȦÃN3Cqpv²>rÀälàÔômgX¿øȉxóÛXÜxh^C¦±uòsp™PœyØÎì·;2Ûw7¤W‡ÿÂÿ“û_þ/ÿÈ¿ö_±fÿ¤ÿÇÆï3fïõ}·g¯îQEQEQEQEW‘è6? “ã—ö7š’ø¢åå‘tû«yâXäxË;…xÔ‚T¹Ã19Àû¸õÊùÿþnóüÿÏ…}EPEPEPEP¬xG^Õ|Y¥kˮ鰾’÷Î¥» ³.Â$>xÜBÈÛÏnÔk_WÄÞ º»×µÍJëG‘#H´X¥h-ÀQÏ™´æC¿ÊAr´¢€+ØØYé–qÙØZAikvCb4\’Np2I?gßxOÃzä——þÒ®î¤Æù§²ŽGlXŒœá[P?ÿ'ƒÿèTÐÿð]ÿTü_áÄW'KñÒv¢‚Xàrpé^/ð Æ/­j>'°¼ò#º»»m]$a“!ļ’@P|¬ÏÌzöï>*Xëú·€ï4¯YIsyzé ì¹XLqgsœ± °®y{+Æ>ø#Çø‡÷ö4Ÿg³¸û¢«}…Y#V;°ÇxU’90ÉP8#€¦è¢Š(¢Š(¢Š(¢Š+?N·òoµi>Ãöo>ídó|ÝÿiýÌKæcø1·fßúg»ø«B³ôë&ûV“ì?fóîÖO7ÍßöŸÜľf?ƒvmÿ¦{¿Š€4(¢Š(¢Š(¢Š(¢Š+?Nÿí[þ?¿ãíãçý_ú˜¿ÔÿÓ?_öüÊЬý;þ?µoøþÿµÿŸõêbÿSÿLýÛó(BŠ( Š( Š( Š( Š( Š( Š+ƒð×ÄûüAÕ<3¦ÛÇ5¥•¹™5çܳ1«»GœÁˆ;r84ÞW?áïùx³þ±ÿé­tÏø{þCž,ÿ°¬úEk@Q@Q@Q@Q@géÖþMö­'Ø~Íçݬžo›¿í?¹‰|Ì6ìÛÿL÷hV~oäßjÒ}‡ìÞ}ÚÉæù»þÓû˜—ÌÇðcnÍ¿ôÏwñP…Q@Q@Q@Q@géßñý«Ç÷ü}¯ü|ÿ«ÿSúŸúgëþß™ZŸ§Çö­ÿßñö¿ñóþ¯ýL_ê韯û~ehQEQEQEqþ›Â×Þ/ñF¥ jÿÚ×?dûxÃÃØÙcØÁprg Ø#·Jì(¨çžn.%Ž"BòI#TP2I'€ç5Éé_t-ÅCÑc¾Ô¶dOmnZÒðBG]‡­‘‚yÀaEPEcëڵŇØìôëo´êWÒùQ/aA÷çnÆ€Œ€FY‘r ƒ\ŸÂHÚDóI;§Š/U¥(g 'Ìv€2zðô€75›ŸøH5‡ð­«A- ˆq„¸’]HŽ0~i~lœ‚¨¬F‘«ÉþÉÂø×þß¿ô­+´ñ/à {Yñ>¡«i~>Ô´h/]­-Q†XÒ<’²¨$„ãÐv¯(øká½Jš’x†î)ô»‰eº¹PÛ¯Ö+”óçy9-î }/©jpiVë=ÄwnŒáµ´–᳂yXÕˆuÆ:zŠåü/¯ÙϬxµÒHz.~}6áÅ´¶R0ÈüŽï‚í+Ÿð÷ü‡çúÏúg÷ÿÙ­ (?ûf×þy_ǧÛ?ã¹é÷?ÖÓ?¿þÍÛ6¿óÊûþ=>ÙÿýÏO¹þ³þ™ýÿökBŠÏþÙµÿžWßñéöÏøðŸîz}ÏõŸôÏïÿ³Göͯüò¾ÿO¶Ç„ÿsÓî¬ÿ¦ýšÐ¢€<¯ã?Ž¯|?à¨FŠ÷v·zƒÆ¿hkIc1BêäívP_” §çPIÀ8#ÄüñÄZ?ìfŸW½ºµ½ºŽ;è®K*±T-·’d «‚>o”GêøcKñv‡6‘«ÁæÛÉʲðñ8èè{0ÉüÈ ‚Aò]7áFƒáŸÜ\GäÆÒE­y2H­”Fó6ª®bÊÏÝÏ¡­ÿ vÿ=.ÿãßí?ñã?ÜôûŸý½íGü%Ú?üô»ÿ´ÿÇŒÿsÓî}ÿö>÷µstPIÿ vÿ=.ÿãßí?ñã?ÜôûŸý½í\ƈÒi> ÙÿýÏO¹þ³þ™ýÿökBŠÏþÙµÿžWßñéöÏøðŸîz}ÏõŸôÏïÿ³Göͯüò¾ÿO¶Ç„ÿsÓî¬ÿ¦ýšÐ¢€#‚e¹·Št‘¨’6FŒò¬Sì@#½p~ÿ’½ñþáŸúNÕÚjZ¶›£[­Æ©¨ZXÀÎdº™bRØ'±8ãØ×'á[ˆþ'xþý£Å¬ÒØCî3¥°,1×"~~Æ€89­o´ÝPOñ5-VÂVµ¼µýæ–„`†–‘X>æØ ©¼Œas^ÁáíWEÕôh'ðýͤúz"ǵÀX€PBp…+òãZ•ÍÛxÚwˆ-µ½/NL¼ möÜÇ4d0Ù$kò°ËÎ3”^p1@Gÿñþ´+ ðOü)¯øKìáÿßï>ÍÿŸóÍ·¬ù~æî¿Î½‚Šòý?Zø‡gyy/Ão>êòPÌÿÛ¶à$j6ÇðHP2qœyÝŸð—Wñë!¶—ÂþUψ/e½¼û|mö9Š‚bٌɂn|Ùí^ÁXú†ìü9ý©ö9'í-B]Bo9Û$˜Üax'Þ€6(¢Š+Ÿð÷ü‡mÂ?™ænóÿqïÇðýݸÿc=è:(¢€ (¢€ (¢€ (¢€ è<'ÿ·ÿñýÿòóþ¯ýTê韯û~esõÐxOþ=oÿãûþ>ÿåçý_ú¨ÿÔÿÓ?_öüÊè(¢Š(¢Š¯}ag©ÙÉgiݬ˜ß ñ‰°ASÁÁþXØYé–qÙØZAikvCb4\’Np2I?X¢€ (¢€ (¢€ (¢€ (¢€ çü=ÿ!ÏØV?ý"µ­MKSƒJ·Yî#»tg­¤· œÊƬ@ã®1ÓÔV„/bÔ5ÝB“¤oª¦ð<.1gl9G‡Nãž½(¨¢Š(¢Š(¢Š(¢Š(®þ+ÄZÃý—ÉónüÏ3wŸûˆ—~?‡îíÇûïTþ7xŸTð¿€DÚDÿg¸¼»[F~ühÈìJáo öÉÆù÷Áž1ñ^4±2ê—WBþê8nVêV”Hªn9?x¸=~P:q@EQEQEq?µÛýÂ"]:_&k›…·iGÞE*Ä•=ËŒöÉÆí¨¯¼ã?Åâí2)u[»¨nn#·–+©šU*ì ÁAž„ƒôMQEÐxOþ=oÿãûþ>ÿåçý_ú¨ÿÔÿÓ?_öüÊòŸŠZíþƒá./“5ÍÂÛ´£ï"•bJžÇåÆ{dãyçÈ>)³ñÞ‹lÚÕåÝ­ÝÜV’ÛÝÎòÆRG HðÃ9wÁ €}sEPEPEPEPEPEPEP\ÿ‡¿ä9âÏû Çÿ¤VµÐW?áïùx³þ±ÿé­tQEQEQEQEcøŸÃ_‹´9´^6ÞNU—‡‰ÇGCÙ†OæA’é¿ 4 ø¦ââ8¯&6’(µkÉ’El¢7™µUpCP~î}÷*àïáò¼E¬?Ù|Ÿ6áÌó7yÿ¸‰wãø~îܱžôQ@f뺇ˆô©tíF-ð¿*Æ»2žÄˆ9ŠÒ¢€8 áo‡´V-F#wu4<Ä·N¬¨Ý˜£‘Û=:õŽÚŠ(¢Š(7]Ь¯ úºp>Á¨žiÈ\Ã'Ý•K’ªAËm$ Wa@Q@Ãßü8²ñV£s}ã3ý¦ÂW[ X¥’(làÉÚV¤a†v=ðŒçü2ŠóC×¼YàéuïìtimZÊk–-"G,YõÆÕ  Îãœ@†ÆÞ Ë›¸ãÿH¹Ú%±bBŒ*ŒôQ’BŒ ³e‰>'à½|w×F‡ÄÏ:¨4 2)/¤Êê2[Üy&1Þ$Cç†`2£ ü¥?ü_OøFð¦‘á¸4Iewcm2¸TDyJ*yj«¹”} c CdÔµ84«užâ;·Fp€ZÚKpÙÁ<¬jÄ:ã=Erþ×ìçÖ›p‡bÚ[)d~G ÷ˆÁ‚ v•Ïø{þCž,ÿ°¬úEk@Û6¿óÊûþ=>ÙÿýÏO¹þ³þ™ýÿöhþÙµÿžWßñéöÏøðŸîz}ÏõŸôÏïÿ³ZPöͯüò¾ÿO¶Ç„ÿsÓî¬ÿ¦ýš?¶mç•÷üz}³þ<'ûžŸsýgý3ûÿìÖ…Ÿý³kÿ<¯¿ãÓíŸñá?ÜôûŸë?éŸßÿfí›_ùå}ÿŸlÿ þç§ÜÿYÿLþÿû5¡EgÿlÚÿÏ+ïøôûgüxO÷=>çúÏúg÷ÿÙ£ûf×þy_ǧÛ?ã¹é÷?ÖÓ?¿þÍhQ@WñŸÇW¾ðT#E{»[½Aã_´5¤±˜¡urv»( /ÊÓó¨$ààþñ¦¿mã I&Ô¯oVöæ8îc™¤¸2†*™ Ë(çå‘ÁúÓÄþÒü]¡Í¤jðy¶òr¬¼ïúÏúg÷ÿÙ¯@¢€<ÿlÿóå}ÿŸlÿ9~ç§ÝÿYÿLþÿû5ÃüT×õ/xV²K»Y¯Š;ÛH›#uc€ä’|¿tüàp8#Þ+ÄþÒü]¡Í¤jðy¶òr¬¼Lð‡¼Cmâ­=eÔï¯ažt‚X&y.7+0jrwzmçïúÏúg÷ÿÙªþø#á? ëêðµõíÄ·²#¤oÙÀT_˜vÎq×H ?Û?üù_ǧÛ?ãÎ_¹é÷ÖÓ?¿þÍgÿŸ+ïøôûgüyË÷=>ïúÏúg÷ÿÙ¯@¢€<⦿©x{°5’]ÚÍ|P ÞÚDÙ« “åû§ç“Áuðÿâ?‰ô¿iK6³¨^YOp–óÛNò\©Ü*™'xê6ŒçŽA ýKâ i~.ÐæÒ5x<Ûy9V^'f?™H øOÃþ#—R†VæãO”$?ÚE Eö#‰c £v7môen2 €@þÙµÿžWßñéöÏøðŸîz}ÏõŸôÏïÿ³Göͯüò¾ÿO¶Ç„ÿsÓî¬ÿ¦ýšÐ¢€3ÿ¶mç•÷üz}³þ<'ûžŸsýgý3ûÿìÑý³kÿ<¯¿ãÓíŸñá?ÜôûŸë?éŸßÿf´( à™nmâ$@ê$‘€#<«Tûï\„¿ä¯|Eÿ¸gþ“µvš–­¦èÖëqªj–03„Y.¦X”¶ À,@Î8ö5ÉøVÆâ?‰Þ?¿hñk4¶Æû‡Ìél uàHŸŸ±  _x:ÛC1xÎK°Ë’‘\®÷c÷KF£/¸ûÈ2¹ÎGZáþhþ"°ñE»è¶æ‘à¶ó¤’Ó[¹˜ðÛR(v—‡3XïP 9À=§†>øs·{km%Þ©#³É©_¿pìŲw…$9¨sÖºÊùÿþ1ãüÿhWAàŸøS_ð—ØÿÂ)ÿ!¿Þ}›þ??ç›nÿYòýÍÝ{Ÿ©êaò­íáûN¡q‘olnìcs³`ìr762 ̪Ôü=¤[x_K†Â[Èæ¼»¸’iî]'¼¹}ÒHÛW8 €2B !sXz§ÃTÕ5˽\ø»Åv·[C-úŠ‹ˆ§Ý]ÍŒç©$’I:ðE¿‡u/ÛZ×5k¦ˆÃê·¦% ‚ 7Lõûƒ§9ê(¢Š+Ÿð÷ü‡Ãöo>ídó|ÝÿiýÌKæcø1·fßúg»ø¨BŠ( Š( Š( Š( ³ôïøþÕ¿ãûþ>×þ>Õÿ©‹ýOý3õÿoÌ­ ÏÓ¿ãûVÿïøû_øùÿWþ¦/õ?ôÏ×ý¿2€4(¢Š(¢Š¯}ag©ÙÉgiݬ˜ß ñ‰°ASÁÁþXØYé–qÙØZAikvCb4\’Np2I?X¢€ (¢€ (¢€ (¢€0üCâÍ3ÃVóËx.æx-Úåâ´µ’vTà¶ÐD`í` •ksòœgü?ñÄ>>ѯ5K{- ‚õícY$ ΪªÁÎÿw'êjçŽÿäžx—þÁW_ú)«Ïÿgù'š‡ý…dÿÑQP°W?áïùx³þ±ÿé­jjZœUºÏqÛ£8@-m%¸làžV5bqŽž¢°ü!{¡¨x¦ê#}U0'áq‹;aÊ8 :wõé@EQ@Q@Q@Q@géÖþMö­'Ø~Íçݬžo›¿í?¹‰|Ì6ìÛÿL÷hV~oäßjÒ}‡ìÞ}ÚÉæù»þÓû˜—ÌÇðcnÍ¿ôÏwñP…Q@Q@Q@Q@géßñý«Ç÷ü}¯ü|ÿ«ÿSúŸúgëþß™ZŸ§Çö­ÿßñö¿ñóþ¯ýL_ê韯û~ehQEQEQEQEQEQEÅüLñ&‹¤ø+^±¿Õ- ¼¸Ó&HmšQæÈ]Yj}â qœ``“€ p³ž¹¥Çá›ÝKø#ÔßPy£µwÚò!‰9P~÷ú·Î3Œdã"½ÂŠ+Ÿð÷ü‡Ãöo>ídó|ÝÿiýÌKæcø1·fßúg»ø¨BŠ( Š( Š( Š( ³ôïøþÕ¿ãûþ>×þ>Õÿ©‹ýOý3õÿoÌ­ ÏÓ¿ãûVÿïøû_øùÿWþ¦/õ?ôÏ×ý¿2€4(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š+Ÿð÷ü‡Ãöo>ídó|ÝÿiýÌKæcø1·fßúg»ø¨BŠ( Š( Š( Š( ³ôïøþÕ¿ãûþ>×þ>Õÿ©‹ýOý3õÿoÌ­ ÏÓ¿ãûVÿïøû_øùÿWþ¦/õ?ôÏ×ý¿2€4(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š+´Ö!Ñö;dèP?ÿ –—ÿ>ºçþ¯øÍð™ióë®àŠ÷ÿŒ×AEsÿð™ióë®àŠ÷ÿŒÖ^•ãûG\ò´Íf'7«æºé7²›ìðü̾WîÎÝ«´ã… üUÚV~¦}‚ûV¹ó¼Ïí µ¹Û·^!Š-¹Ï?곞>ö;d€gÿÂe¥ÿÏ®¹ÿ‚+ßþ3Gü&Z_üúëŸø"½ÿã5ÐQ@ÿü&Z_üúëŸø"½ÿã4Âe¥ÿÏ®¹ÿ‚+ßþ3]ÍÇãg™"‹Yw…öJ«¢^’´6÷\¬§±½Iÿ –—ÿ>ºçþ¯øÍhiÚgØ/µkŸ;Ìþл[»qåâ¢Ûœóþ«9ãïc¶N…sÿð™ióë®àŠ÷ÿŒÑÿ –—ÿ>ºçþ¯øÍtP?ÿ –—ÿ>ºçþ¯øÍgéÞ3Ò ö¬ö;d€gÿÂe¥ÿÏ®¹ÿ‚+ßþ3Gü&Z_üúëŸø"½ÿã5ÐQ@2xßâ·‰´‰ú³èš•ÚiåíØY_Û2®$%|¹TTf5 0‹€À…¸vŠë,l,ôË8ìì- ´µ;!‚1.I' 8$ŸÆ€,QEQEQEQEQEQEQETs‰šÞU·’8ç(Do"UlpJ‚ í‘ŸQRQ@>|BmNÇãgƒ4«{RÔ- ÅÈŽé£Uö—\„3×äŒã}_?üSÿ“…ðWý¸ÿé[×ÐQEOU’ú-.á´Ècšü¦Ûu”áž? ìå±ÎÀ'ø'ÅO…׎þ7·ñõÞ¯o,rßOpÁܲª¼;òö±\œ.0FÐÐõçþ7Ðo>#}›C²½û.owVå ;&q _ÂÛ[;Ë ªÛq¹‘Ôj|4×ï¼QðóHÖ56¯'IWEÚ¤Œ›±ÐŒ “€ÖU=6k·k}8F¶önmBÅØР¢q‚î¼¥x*@¹@Q@Q@Q@zÖ¥5šCk`±Ë©Ý¸H#pHUÜ¢IX>HÕ·W'j ë^7û:_\jzŒ¯ï$ó.®¥·šgÚçc1cÀÉ'¥Xÿ…Åá½ÆZôÚå…õγܶÍkkXmb„‰Y¥ÉÉØàe›qÌ~ÎÞ$³Ó%Õ4‹[ïZh/¥\yó[ ´IYŽÂŒ2ãc…k8ß‘ïé•óÿí5ÿ2·ý½ÿíú€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ Žq3[ʶòGåäBê­Ž PA#=²3ê(¢€<¯Ä_ 5ßø¶×Ä·^2‚ûO+ì ‡ËmË€ÒœüÄ·ÌO_Lê)yœk<Ý ï’LHÜœaK1cø¯(¢€,QEâ}3TÖ49¬4gû"âo•®Ö5Ñ;„ù—k>nqÎ0pG‹ÿÃ2ÿÔÝÿ”ßþÛEì ðÇü!Þ±Ð>ÙöϲùŸ¿ò¼½Û¤gû¹8Æìuí]PEPEPEP^ðËá—ü+ŸíOø›ÿh}¿Êÿ—o+fÍÿí¶s¿Û¥P QEQEæÿþÞ|D¼³iµè,­l·ýž4°.ÿ8MÛ˜Êå8ÂŒgõ¯D€L¶ñ-Ä‘É8@$xТ³c’’@Ïlœzš(  (¢Š(¢Š(¢ŠÿÙÿØÿàJFIFPPÿÛC    $.' ",#(7),01444'9=82<.342ÿÛC  2!!22222222222222222222222222222222222222222222222222ÿÀ "ÿÄ ÿĵ}!1AQa"q2‘¡#B±ÁRÑð$3br‚ %&'()*456789:CDEFGHIJSTUVWXYZcdefghijstuvwxyzƒ„…†‡ˆ‰Š’“”•–—˜™š¢£¤¥¦§¨©ª²³´µ¶·¸¹ºÂÃÄÅÆÇÈÉÊÒÓÔÕÖ×ØÙÚáâãäåæçèéêñòóôõö÷øùúÿÄ ÿĵw!1AQaq"2B‘¡±Á #3RðbrÑ $4á%ñ&'()*56789:CDEFGHIJSTUVWXYZcdefghijstuvwxyz‚ƒ„…†‡ˆ‰Š’“”•–—˜™š¢£¤¥¦§¨©ª²³´µ¶·¸¹ºÂÃÄÅÆÇÈÉÊÒÓÔÕÖ×ØÙÚâãäåæçèéêòóôõö÷øùúÿÚ ?÷ú(¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€?ÿÙcloog-0.18.4/osl/doc/images/basic1.jpg0000644000175000017500000004366112413256474014325 00000000000000ÿØÿàJFIFPPÿÛC    $.' ",#(7),01444'9=82<.342ÿÛC  2!!22222222222222222222222222222222222222222222222222ÿÀP"ÿÄ ÿĵ}!1AQa"q2‘¡#B±ÁRÑð$3br‚ %&'()*456789:CDEFGHIJSTUVWXYZcdefghijstuvwxyzƒ„…†‡ˆ‰Š’“”•–—˜™š¢£¤¥¦§¨©ª²³´µ¶·¸¹ºÂÃÄÅÆÇÈÉÊÒÓÔÕÖ×ØÙÚáâãäåæçèéêñòóôõö÷øùúÿÄ ÿĵw!1AQaq"2B‘¡±Á #3RðbrÑ $4á%ñ&'()*56789:CDEFGHIJSTUVWXYZcdefghijstuvwxyz‚ƒ„…†‡ˆ‰Š’“”•–—˜™š¢£¤¥¦§¨©ª²³´µ¶·¸¹ºÂÃÄÅÆÇÈÉÊÒÓÔÕÖ×ØÙÚâãäåæçèéêòóôõö÷øùúÿÚ ?÷ú(¨çžn.%Ž"BòI#TP2I'€ç4%^ÆþÏS³ŽòÂî »Y3²h$#`pÂü*ÅQEQEQEÉøuBѵùßÄ~(xon'aÙgˆ…ìÁU±¼c-­uÁ Õ¼¶÷G4¡I#‘C+© ƒÁqŠóÿ„Ckoã {x£†¼Qz‘Ç…TPà8ÅužñV…â»3u¡êp^Æ¿|!!ãÉ nC†\í8ÈÆG±\?Ž¼;àï(øƒZ»þ¾‹!5{;³\ço*¬bˆT) q¢¹¿êþ#Ô­õM7UÔõ)¼/˜íˆï,¿³çäW‰ËÉå†HÃvN[d×(¯þÇðý}sÿ ˆºOXh6ºÌÏ¥üAÔ¼E9·`Ö—ZÊ]ª.åùÂ(È àgý¢;Ðyüâ?[Ë©ë)Öt=Jt>E†“y¶ÞÍqò+à3ƒË0+’p05¡ðÏ]ÕõŸßÁ¯Kú¦•©Üi×71à,ì„ÀP/Nvç¾+ Öõ)¬íþͧ¬rê÷(âήà>ü˜ ˆ”•,}ÀfU1øcÃÖþÐáÓáo6oõ—WLû©ÛýdÎI$³y'€PÅQ@Q@Q@Q@Q@Q@eëþ#Ò<-¥¶¥­_Gih&ö‹1èTÇ©À€O@kR¸ÿ‰^ ƒÃž¹¼½ðçö݈ÛçC#D!_Þ _3~Iä‚6£r¼ã­vTsÏ ­¼·Ç !y$‘‚ª($“Àsšàïþ#ÜjŸiµð‡?ˆ®¡Þy‘ ”n2ó\#PíSó+d5zÇÝøÚ×ÁÚ>ÿ î¡cg©Ýy¿ñá òBÛ[ø~Rà ɜ÷'Ÿÿ ·áçý ?ù%qÿÆè¨ñŠ4Ÿ Ù‹Íbiàµ=fKIeD䙑H\–nÆ{f¤Ð™  ¿øA<ÿB¦‡ÿ‚èøš¹¦økAÑ®ãKÑ4ÛÙ 4–¶©È8%@8ȵ( ;oxàj—º„c‚[ÇÂhQ0UÚŠ]Ø„\œ õf<–bz xsSÒî'¾×¼A&»¨:b™­#·X"ÎJ¢/BÍ‚Ç?6ÄùEt”PEPEPEPEPEPEP^ñ·þI»ÿnÿúQzeê^Ðu›…¸Õ4M6úu@‹%ÕªJÁrN`N2Iǹ âûo&Ÿ+ßÉgy§;=³˜Rx‰fBÞdL0ã ŒdyÈâ²áñ—ˆ6Xø'ÄضúTš•ÜHë3ù+`T­¸•9=†G$äƒáÏÄkˆz]ÌðZÉgyhánm™·„ Œ¯€§° ƒÆ0HiEPEå>6Xø'ÄضúTš•ÜHë3ù+`T­¸•9=†G$äT¢¸¿‡?¬~!éw3Ák%壅¹¶fÞ6v2¾`BžÀ‚Á=¥QEW•ü@øÙcàŸbÛéRjWq k¬Ïä¬E€ePv¶âTäö“:‡?¬~!éw3Ák%壅¹¶fÞ6v2¾`BžÀ‚Á ¥Q@U=WU±Ðô»OS¹ŽÚÎÝ7Ë+ôQüÉ'É$’h9¿äa²ÿøôŸïÿÇÏ߇ý_ý3þÿ¿•Zå~øÏáŸx×O°·‚K3%¼Ñ$ú„*®Ò³DR(ÝY€ ²2V09À>©@Q@Q@úÆ»ˆôX,, —H—ÏþÒȶÃ9lƒÃ~kb¼ÿÄSj6¼z½ñ±¿ûw™c½V²Üc…P[“»ç-ƒÓk%OÏà¿i_jñ mùïgH-‘Z0û󸼛C)( 1ˆé@EyÜŸ ¦ñ3Ãuã½vïVu3û6Õ½ŒYS… ¿;.Ø°b0pu5¿øXÿÛÿ`Â)ý™òù?oûG÷FíÛ>_½»íŠì+Íþ(x¯Æ µ‡SÑâÒ¯¬f”Ämå´˜Í"i nY0ˈä$áv€:òEø»ÿõ#äÝt!ÿç„ÿì+'þ‘]Pà¿Yø×ÂöºÕšy^nRh ‡hdS†RGàFpJ•8Ågé7¾0oÝé:•Î‡&™kiÉ–ÚÖhæ—Í2*®FUÃD䜷¼vùž¿¢jÿüjÞ-ÐüÉ|'p?´m"Œbfåv ãå·'iàüþ¡áíVÇ\ñ~£©é—1ÜÙÜhö©Ñ‡yø‚AAPYEP¨ßx|}e{oàëë2ÒÒæÕîòÕ]ÌD2 ¯îWï?9àmÁèlíu}ûËo-mòNùeÂäœr0úB²üKÿ"®¯ÿŸñå7ü~¨û‡ýgû¾Ù ø[àÝO°ÜßjÍmwpÊÚ – ª»†_clrwoPrN;Øc–³l¿ÔÙ·lß3çw]ùs¿ÛvqÛ%1ËÙ¶_êGìÛ¶o¿™ó»®ü¹ßí»8íŠ!ŽX>ͲÿR?fݳ}üÏÝwåÎÿmÙÇlT”PŒøûá®»âI5!dÔ!¹U-çÝn–6U †y_,2xé€ÏKð·ÁºŸ…a¹¾Ô'šÚîá”-´,Uw ¾ÆØäî$Þ äœz 1ËÙ¶_êGìÛ¶o¿™ó»®ü¹ßí»8íŠ!ŽX>ͲÿR?fݳ}üÏÝwåÎÿmÙÇlT”PpÇ,fÙ©³nÙ¾þgÎî»òç¶ìã¶+Ç|}ð×]¿ñ$šŽ²jܪ–óî·K*…Ã<¯–ø[àÝO°ÜßjÍmwpÊÚ – ª»†_clrwoPrN;Øc–³l¿ÔÙ·lß3çw]ùs¿ÛvqÛ%1ËÙ¶_êGìÛ¶o¿™ó»®ü¹ßí»8íŠ!ŽX>ͲÿR?fݳ}üÏÝwåÎÿmÙÇlT”PŒøûá®»âI5!dÔ!¹U-çÝn–6U †y_,2xé€ÏKð·ÁºŸ…a¹¾Ô'šÚîá”-´,Uw ¾ÆØäî$Þ äœz 1ËÙ¶_êGìÛ¶o¿™ó»®ü¹ßí»8íŠ!ŽX>ͲÿR?fݳ}üÏÝwåÎÿmÙÇlT”PpÇ,fÙ©³nÙ¾þgÎî»òç¶ìã¶+‰øáÝGZðdÚ|——oc?ž!šîY™× »˜ïa‘ŒòBõÁ–<1áSÅÚä:F‘›q',ÍÂDƒ«¹ì£#óHí{}ÖÛì~\·Çì{ü¿2þy7oëænsæ{oÝ·¶+Ÿð÷üŒ+ÿ?ñé/ßÿŸ¿ú¿úgýÿ*» Ï·Ñ­m¾ÇåË|~Ç¿Ëó/ç“vþ¾fç>g¶ýÛ{b‹}ÖÛì~\·Çì{ü¿2þy7oëænsæ{oÝ·¶+BŠÏ·Ñ­m¾ÇåË|~Ç¿Ëó/ç“vþ¾fç>g¶ýÛ{b´(¨ç¦·–$šHЪËRÈHûÃp##¯ Phƒñoü•ï‡_÷ÿÒu®£Ä>мWf-uÍ2 Ø×î)¢´lÝ—Í*]˜a»ª …–v쎢€<î? øßÂo5ƃâIǽp ¾Ü|>×-½ñ>–ÝXÜB%¸Ý2Bm|¸ÕNâìRvG¸ `Ðø/Æ–ž2°šX {k›vh·;Hl ƒƒØAã¡==p ¼¨øZÂúmSdwŒƒìêCÕ7`–‚NãÀèç'¿ Š( Æm<-¬eç½õÄj ù—ÊXɨiÜpr{ ŽIÎ6<ãKOXM,P=µÍ»4 Û‚ƒ¤6AÁì ñОâ/í{VñTÚ¶“ ^Evª]‹Dʪ¸;ˆÈ8È#ÜÀ'£ø]àýGÂÖÓj›#¸¼dgRÆ©»°$w@98ýQ@p0ø£iámcû.=ï®#Pg̾RÆH@;NビØdrNqß׎üEøu¯jÞ*›VÒaKÈ®ÕK ‘ch™UWq{‚8€w~ ñ¥§Œ¬&–(ÚæÝ€šmÁAÎÒ àöxèOO\Âïê>°¾›TÙÅã û:Æ5MØ% “¸ð:9ÉÀï袊(€ñ‡ÅO kÙpéï}qƒ>eò–2@*ÚwžÃ#’søÒÓÆVKmsnÀM6à çi p{(Úx[XþˇO{ëˆÔó/”±’PÓ¸àäö“œwõã¿~kÚ·Š¦Õ´˜Rò+µRè$XÚ&UUÁÜFAÆAàŽ —ð«Æ–ž2Ô¤–(,í®mí¤A+n¸P]6˜›1œüGÇB}^¼Càoƒõ jW“jŸÙÑÜ^[0û9!®cTuÁV‚‡qÞB"ç'Û袊(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(®ÇòOáÿYþǯ¶h“¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(CÃßò0¯üxÿǤ¿þ>~üêÿéŸ÷ýüªì+ð÷üŒ+ÿ?ñé/ßÿŸ¿ú¿úgýÿ*» (¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š+Ÿñßü“ÏÿØ*ëÿE5tÏøïþIç‰ìuÿ¢š€: (¢€ (¢€ (¢€ (¢€ Ëñ/üŠº¿üzÇ”ßñùþ£îõŸìzûfµ+È~)üa±ðÍÝç†-ô¥Ô®ÞÙ’èÎÛbˆÈŸ*•Ú|Ì«dŽÉ8Þ¢¹øÒÓÆVKmsnÀM6à çi p{~üêÿéŸ÷ýüªì+Ê>xÒÓÆZ”’ŵͽ´‚h%m× ¦Ó`f3ƒ¿€CøèO«ÐEPEPEPEPEPEPEPEP\_ÄÎx“Qyµ!8Ó.bjW VÝ+„Ǹ<ç95ÚW?ã¿ù'ž%ÿ°U×þŠjè(¢Š(¢Š(¢Š(¢Š+猿 °¾›TÙÅã û:Æ5MØ% “¸ð:9ÉÀï袀 (¢€Ô¯&Õ?³£¸¼¶aörC\ƨ났 㼄EÎN·×áïùWþ<ãÒ_¿ÿ?~?õôÏûþþUvQEQEQEQEQEQEQEQEW?ã¿ù'ž%ÿ°U×þŠjè+Ÿñßü“ÏÿØ*ëÿE5tQEQEQEQE—â_ùuøôÿ)¿ãóýGÜ?ë?ØõöÍjV_‰äUÕÿãÓþ<¦ÿÏõpÿ¬ÿc×Û4ÉÑEQEQEQEQEQEQEQEQEQE¡áïùWþ<ãÒ_¿ÿ?~?õôÏûþþUvÇø{þFÿøô—ïÿÇÏßý_ý3þÿ¿•]…QEQEQEQEQEQEQEQEÏøïþIç‰ìuÿ¢šº âþ èsøCÄš‹Í© Æ™pûR¸H²°œ~é\&8ämÁç9É ÒŠ( Š( Š( Š( ¼‡âŸÆ ÝÞxbßJ]Jíí™.Œí¶(Œ‰ò©]§ÌʶHà`œ“^¯þ2ü,ñ£âÛßéi ÕÄ"[Ó$&×ËTî.À!wd{‚ ‚üiiã+ ¥Š¶¹·`&›pPs´†ÀÈ8=:Ó×ð»Áú…¬/¦Õ6GqxÈ>Τ1Sv `H$î<€rp;ú(¢Šà"ü:×µoM«i0¥äWj¥ÐH±´Lª«ƒ¸ŒƒŒ‚=Áz?…ÞÔ|-a}6©²;‹ÆAöu!Œj›°KA'qàts“€ßÑEWãŠ6žÖ?²áÓÞúâ5|Ëå,d€T´î89=†G$çýxïÄ_‡Zö­â©µm&¼ŠíTº 6‰•UpwqG¸#€Hwà¿ZxÊÂibí®mØ  fÜí!°2`AŽ„ôõÀ|.ð~£ák éµM‘Ü^2³© cTÝ‚X ; œœþ€ (¢€8|Q´ð¶±ý—ž÷ר3æ_)c$ §qÁÉì29'8Øð_-ø?Qð¶¥y6©ýÅå³³’æ5G\`H(wàt".rp=¾€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ çüwÿ$óÄ¿ö ºÿÑM]sþ;ÿ’yâ_û]覠‚Š( Š( Š( Š( ²üKÿ"®¯ÿŸñå7ü~¨û‡ýgû¾Ù­JËñ/üŠº¿üzÇ”ßñùþ£îõŸìzûf€9:(¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€4<=ÿ# ÿÇüzK÷ÿãçïÇþ¯þ™ÿßʮ¸ÿÈ¿ñãÿ’ýÿøùûñÿ«ÿ¦ß÷ò«° Š( Š( Š( Š( Š( Š( Š( ²õ/è:5ÂÛêšÞ›c; uŽêé"b¹# 1gØÖ„æe·•­ãŽIÂHå›À{àãÐ×ø÷á‘7‚µMfêöîãÄ–Öò^Üj’±&å‘K1çb!j…h É‚ì•ÏøïþIç‰ìuÿ¢š¸ÿ€wÚ¥÷ÃU:”“É7o “L¿òÁU0ÿ†Þ£®1·¢àv;ÿ’yâ_û]覠‚Š( Š( Š( Š( ²üKÿ"®¯ÿŸñå7ü~¨û‡ýgû¾Ù­JòŠl|3wyá‹})u+·¶dº3¶Ø¢2'Ê¥vŸ3*Ù#‚rN7¨®cÁ~4´ñ•„ÒÅÛ\Û°@͸(9ÚC`dÀ‚ é袊(¢¸|Q´ð¶±ý—ž÷ר3æ_)c$ §qÁÉì29'8Øð_-eò–2@*ÚwžÃ#’s€Oð÷üŒ+ÿ?ñé/ßÿŸ¿ú¿úgýÿ*» ò…^4´ñ–¥$±Agmsom š [u‚é´ÄØŒàïàÂ>:êôQEQE¨Ük±øE‚ÂÊ t‰|ÿí)Ü€ðá‹hÜ3–È<7áÖµ#žždŠXÝá}’ª°%hl7¡ÚÊp{{×â)µ?‹Þ Š=^øØßý»Ì±Þ«Ùn1¨-ÉÝó–ÁéŠÔ×üc«j®i÷wz/ˆ6‹àÈ~YS!rÉ£8ÖQ^W©xóÅnŸÅšn•gÂiË%Ô!å*ÁŒ®r8-'E*w„ô VÁµ=.âÅ/®ìLé³íŒ«*ûKÇÆFr0pG•ÿÃ8ø?þ‚Zçýÿ‡ÿP¢xgSÑo,‡‡¤Ž}7LHíx%E€ˆÕ÷ÅT¦OO˜ ’ ˆ:œþñ&¢ójBq¦\>ÄÔ®,¬'ºW Ž9pyÎrkCÁ^ Ó|£M¥ésÝÍ· pÍtê̪®ÕQŒ íëRxïþIç‰ìuÿ¢š€4-ôk[o±ùrß±ïòüËùäÝ¿¯™¹Ï™í¿vÞØ¢ßFµ¶û—-ñûÿ/Ì¿žMÛúù›œùžÛ÷míŠÐ¢€3íôk[o±ùrß±ïòüËùäÝ¿¯™¹Ï™í¿vÞØ¢ßFµ¶û—-ñûÿ/Ì¿žMÛúù›œùžÛ÷míŠÐ¢€3íôk[o±ùrß±ïòüËùäÝ¿¯™¹Ï™í¿vÞØ¢ßFµ¶û—-ñûÿ/Ì¿žMÛúù›œùžÛ÷míŠÐ¢€3íôk[o±ùrß±ïòüËùäÝ¿¯™¹Ï™í¿vÞØ¢ßFµ¶û—-ñûÿ/Ì¿žMÛúù›œùžÛ÷míŠÐ¢€3íôk[o±ùrß±ïòüËùäÝ¿¯™¹Ï™í¿vÞدø«ð{]Ükz ûf›,BIšîø¶Ø€òNùeÀÈmÜr0ýYúïü‹ÚŸüxÿǤ¿òÿo¸ÖÿÓ?ï{f€<¿àïÂ»Ï [Üê^"M—ó¸Y¤ä¬J¡†d Û$'v@!¶àrH‘oá}&Ûì~\3Ÿ±ïòü˹dÝ¿¯™¹™í¿vÞØ­Š(ßÂúM·Øü¸g?cßåù—rÉ»_3s3Û~í½±E¿…ô›o±ùpÎ~Ç¿Ëó.å“vþ¾fæ>g¶ýÛ{b¶( œ¾%|ñÏŠ_Pðų_Ù]"“·y–U C<Ï—'Œz߃¿ ï<-os©x‰6_ÎàEf“’±*†+lÙ†Û€AÉ {oá}&Ûì~\3Ÿ±ïòü˹dÝ¿¯™¹™í¿vÞØ¢ßÂúM·Øü¸g?cßåù—rÉ»_3s3Û~í½±[P=¿…ô›o±ùpÎ~Ç¿Ëó.å“vþ¾fæ>g¶ýÛ{b¼+âWÁ?\ø¥õ [5ý•Ò)1Ëw™`eP¤3ÌùpqrqÈÀgèÚ(Çþü+¼ðµ½Î¥â$Ù;šNJĪf@­²Bwdn$éþÒm¾ÇåÃ9ûÿ/Ì»–MÛúù›˜ùžÛ÷míŠØ¢€1íü/¤Û}ˆsö=þ_™w,›·õó71ó=·îÛÛ[ø_I¶û— çì{ü¿2îY7oëæncæ{oÝ·¶+bŠùËâWÁ?\ø¥õ [5ý•Ò)1Ëw™`eP¤3ÌùpqrqÈÀg­ø;ð®óÂÖ÷:—ˆ“eüîVi9+¨a™¶É Ým¸’°Q@öþÒm¾ÇåÃ9ûÿ/Ì»–MÛúù›˜ùžÛ÷míŠ-ü/¤Û}ˆsö=þ_™w,›·õó71ó=·îÛÛ±EcÛø_I¶û— çì{ü¿2îY7oëæncæ{oÝ·¶+¾%|ñÏŠ_Pðų_Ù]"“·y–U C<Ï—'Œ~¢€ßFµ¶û—-ñûÿ/Ì¿žMÛúù›œùžÛ÷míŠ-ôk[o±ùrß±ïòüËùäÝ¿¯™¹Ï™í¿vÞØ­ (>ßFµ¶û—-ñûÿ/Ì¿žMÛúù›œùžÛ÷míŠÐ¢£ž6šÞX’i wB«,aK!#ï ÀŒŽ¼‚=A Å¿òW¾ÜOÿIÖ®kCÇú§ˆ.´ýM7DÑcHÂj’§Ún%b71Ž<í!`OAsGðÆ££e¨ø‹XƒY¾Óâš+IÖÁmÙ|Ò¥Ù€f°Š ¨\)`wnÈê(“Ñ>øsF¸ûl–Òjº¡tvÔµWûMÁd?! à T` p«œã5·àí½b}GþßØyÛѬ5/*Â…ùWiÆq“îMvPŸÿ¬ÿ©÷Ç?ø8ÿì+CÆ÷þ*‹ìÖ^ðäúŒüדǨEjÁ9ýÚ3ÊÇ»ÂýÒîNŠóû [Çw_fÒcð,³;"7ƒT‚U´ˆc;"Uå‚‚`¨m¹AèQ@Q@U{ëû=2ÎKËû¸--cÆù§F‹’ËIñ  ÏøïþIç‰ìuÿ¢šº çüwÿ$óÄ¿ö ºÿÑM@Q@Q@Q@Q@gë¿ò/jñãÿ’ÿÈCþ=¾áÿ[ÿLÿ½íšÐ¬ýwþEíOþ<ãÒ_ùÇ·Ü?ëéŸ÷½³@QEQEQEQEQEQEQEQEQEQEgÍÿ# —üxÿǤÿþ>~ü?êÿéŸ÷ýüªÐ¬ù¿äa²ÿøôŸïÿÇÏ߇ý_ý3þÿ¿•ZQEQEQEQEQEQEQEWδ>‘—ÿã-ÕõÌÓ}¤Ë%ÝÓ˹‡•ÈRvG’Oª½£ëçÿÚkþeoû{ÿÚ4ôsþ;ÿ’yâ_û]覮‚¸¿ˆ:œþñ&¢ójBq¦\>ÄÔ®,¬'ºW Ž9pyÎrh´¢Š(¢Š(¢Š(¢Š(¬ýwþEíOþ<ãÒ_ùÇ·Ü?ëéŸ÷½³ZŸ®ÿȽ©ÿÇüzKÿ!øöû‡ýoý3þ÷¶hBŠ( Š( Š( Š( Š( Š( Š( Š( Š( Š(  ù¿äa²ÿøôŸïÿÇÏ߇ý_ý3þÿ¿•ZŸ7üŒ6_ñãÿ“ýÿøùûðÿ«ÿ¦ß÷ò«B€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ ó¿ü!Óüaqú÷ˆüAxð!H’Ý98U„ ž2q“è+Ñ(  ýL—HÓ’Î]RûRÙ€³_i€‘WwLå²Ä“’k?ÇòOoùl¿ãÇþ='ûÿñó÷áÿWÿLÿ¿ïåV…gÍÿ# —üxÿǤÿþ>~ü?êÿéŸ÷ýüªÐ Š( Š( Š( Š( Š( Š( Š( Š( ¹ÿÿÉ<ñ/ý‚®¿ôSWA\ÿŽÿäžx—þÁW_ú)¨ ¢Š(¢Š(¢Š(¢Š(¬ýwþEíOþ<ãÒ_ùÇ·Ü?ëéŸ÷½³ZŸ®ÿȽ©ÿÇüzKÿ!øöû‡ýoý3þ÷¶hBŠ( Š( Š( Š( Š( Š( Š( Š( Š( Š(  ù¿äa²ÿøôŸïÿÇÏ߇ý_ý3þÿ¿•ZŸ7üŒ6_ñãÿ“ýÿøùûðÿ«ÿ¦ß÷ò«B€ +?]Ôÿ±<=©êÞOöIn|­ÛwìBÛsƒŒãÁ¯?ðïÇŸk^\WÒϤ]7–¥nÓ1—n.@P‰ÂpAõÀ¨QUìoìõ;8ï,.໵“;&‚A"6  88 ¬PEPEPEPEPEPEPUïìmõ=:æÂò?2Öê'†dÜFä`C ŽFA=*ÅÏÿÂ¥ÿÏÖ¹ÿƒÛßþ=Gü!º_üýkŸø=½ÿãÕÐQ@ÿü!º_üýkŸø=½ÿãÔÂ¥ÿÏÖ¹ÿƒÛßþ=]Åø—Âq[xWWŸK¹ñÔ#²™íDzÕë±”!)…óNã»`æµ?á Òÿçë\ÿÁíïÿ­ OS—Oò–ßK¾Ôf“'Ë´6¨ÆIirG·’ˆáþ|J¼ø‰y®´Ú|V¶_gûXÀ@7I#’¢î^2 Ur$ÿ„7KÿŸ­sÿ·¿üzøCt¿ùú×?ð{{ÿÇ«Íü'ñ—Xo·…|o¤Á§]É*ÛÂÖѸÙ18UpY²­•Ã)Ç ò§pöŠçÿá Òÿçë\ÿÁíïÿ£þÝ/þ~µÏüÞÿñêè( /ľŠÛº¼ú]ψ¡”Ïj#Ö¯]Œ¡ L/šwØã5©ÿn—ÿ?ZçþoøõtP?ÿn—ÿ?Zçþoøõð†éóõ®àö÷ÿWAEsÿð†éóõ®àö÷ÿV_‰|'·…uyô»ŸB;)žÔG­^»B˜_4î;±Æk´¢€9ÿøCt¿ùú×?ð{{ÿǨÿ„7KÿŸ­sÿ·¿üzº (Ÿÿ„7KÿŸ­sÿ·¿üzøCt¿ùú×?ð{{ÿÇ« ¢€8¿øN+o êóéw> :„vS=¨Z½v2„%0¾iÜwcŒÖ§ü!º_üýkŸø=½ÿãÕÐQ@ÿü!º_üýkŸø=½ÿãÔÂ¥ÿÏÖ¹ÿƒÛßþ=]ÏÿÂ¥ÿÏÖ¹ÿƒÛßþ=Y~%ðœVÞÕçÒî|@uì¦{QµzìeJa|Ó¸îÇ9®£U“iwG’Ñ5 ™€Ý£4[½)¦GLç>/ðûãÕλâXtYZ@/]a´žÊ7e'\c†$GCÔ`’  | ¢µÂ\4ºÉ‘$:ÝîåV °ÍȪ’;í•'ü!º_üýkŸø=½ÿãÕOÆ×þ*Ò­`¼ðôº3#Ü[Ú´„“ºYDaãŽ7:|»zn9< ê -¼Kq$rN 4(¬Øä…$3Û'¦€8ÿøÚ뺽½„ºÌ×’ÙLG&·vÊò!A.Ò ÀÃqëÅy'‡g RçË›Ä:´QŸ-ͽ¢ù²yt,p¨Ã¦FñœõŸ£è ?Áß ü5ày~Ó¤ÛÎ×ÍC%Üó³<ˆX6AÈ^Š:}sÒjº­Ž‡¥ÜjzÌvÖvé¾Y_¢æI8I “W+ø•¨èö¹ÿ„‹F¾Ô´GÛö¿²:/—‰fs"7.Wîç¡ÎP“JÕluÍ.ßSÓ.c¹³¸MñJ0AÈ ò àŠ¹\߀oô]KÁeׇld±ÒJ:[ÛÈ¡YB»)Î É,¤ç$œäòMt”QEQEQEQEQEQEQEQEWÏÿ³/üÍ?öéÿµ«Û5½v ßÍšÓRºvGhâ°±–ᜨû¿"¤ä¸¨>¼xŸÀh5? ê:½žµáýrÏûGìâ ŸL›Ë ¥Á Á~_õ€äü ’8ÈÐQE‚¸{…Š1;¢£ÈneRJ‚z 1¶ãëRW—üRñ‰ôíº7…<9ªÞÌÛZêö;9Œj‡Ÿ-%ˆà²‘´îP]þ/ÇvÕ£IáÒð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.4/osl/doc/images/basic.pdf0000644000175000017500000011621112413256474014225 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.4/osl/doc/images/tree.jpg0000644000175000017500000003262112413256474014114 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.4/osl/doc/images/tree.eps0000644000175000017500000001453012413256474014122 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.4/osl/doc/images/basic2.eps0000644000175000017500000001452312413256474014330 00000000000000%!PS-Adobe-2.0 EPSF-2.0 %%Title: basic2.fig %%Creator: fig2dev Version 3.2 Patchlevel 5-alpha7 %%CreationDate: Sat May 10 21:23:40 2008 %%For: cedb@localhost (Bastoul Cedric) %%BoundingBox: 0 0 260 235 %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 235 moveto 0 0 lineto 260 0 lineto 260 235 lineto closepath clip newpath -156.6 333.9 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 10 setmiterlimit 0 slj 0 slc 0.06000 0.06000 sc % % Fig objects follow % % % here starts figure with depth 51 % Polyline 0 slj 0 slc 0.000 slw n 4200 2700 m 4200 3900 l 5400 3900 l 5400 2700 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 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 % Polyline 0 slc gs clippath 5770 5160 m 6015 5160 l 6015 5040 l 5770 5040 l 5770 5040 l 5950 5100 l 5770 5160 l cp eoclip n 3000 5100 m 6000 5100 l gs col0 s gr gr % arrowhead 15.000 slw n 5770 5160 m 5950 5100 l 5770 5040 l 5770 5160 l cp gs 0.00 setgray ef gr col0 s % Polyline 7.500 slw gs clippath 3060 2330 m 3060 2085 l 2940 2085 l 2940 2330 l 2940 2330 l 3000 2150 l 3060 2330 l cp eoclip n 3000 5100 m 3000 2100 l gs col0 s gr gr % arrowhead 15.000 slw n 3060 2330 m 3000 2150 l 2940 2330 l 3060 2330 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 3000 2700 m 2925 2700 l gs 0.00 setgray ef gr gs col0 s gr % Polyline [15 45] 45 sd n 3000 3900 m 6000 3900 l gs col0 s gr [] 0 sd % Polyline [15 45] 45 sd n 4200 5100 m 4200 2100 l gs col0 s gr [] 0 sd % Polyline [15 45] 45 sd n 5400 5175 m 5400 2100 l gs col0 s gr [] 0 sd % Polyline [15 45] 45 sd n 3000 2700 m 6000 2700 l gs col0 s gr [] 0 sd /Times-Bold ff 433.33 scf sf 2625 4650 m gs 1 -1 sc (1) col0 sh gr /Times-Bold ff 433.33 scf sf 2625 4050 m gs 1 -1 sc (2) col0 sh gr /Times-Bold ff 433.33 scf sf 3525 5550 m gs 1 -1 sc (1) col0 sh gr /Times-Bold ff 433.33 scf sf 4125 5550 m gs 1 -1 sc (2) col0 sh gr /Times-Bold ff 433.33 scf sf 5250 5550 m gs 1 -1 sc (4) col0 sh gr /Times-Bold ff 433.33 scf sf 2625 2850 m gs 1 -1 sc (4) col0 sh gr /Times-Bold ff 433.33 scf sf 2700 2175 m gs 1 -1 sc (j) col0 sh gr /Times-Roman ff 433.33 scf sf 3825 1950 m gs 1 -1 sc (i>=2) col0 sh gr /Times-Roman ff 433.33 scf sf 5025 1950 m gs 1 -1 sc (i<=4) col0 sh gr /Times-Roman ff 433.33 scf sf 6075 3975 m gs 1 -1 sc (j>=2) col0 sh gr /Times-Roman ff 433.33 scf sf 6075 2775 m gs 1 -1 sc (j<=4) col0 sh gr /Times-Bold ff 433.33 scf sf 6000 5550 m gs 1 -1 sc (i) col0 sh gr % here ends figure; $F2psEnd rs showpage %%Trailer %EOF cloog-0.18.4/osl/doc/images/tree.fig0000644000175000017500000000354012413256474014077 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.4/osl/doc/images/tree.pdf0000644000175000017500000001071612413256474014106 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.4/osl/doc/images/basic2.fig0000644000175000017500000000450512413256474014305 00000000000000#FIG 3.2 Produced by xfig version 3.2.5-alpha5 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 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 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 6000 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 2100 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 3000 2700 2925 2700 2 1 2 1 0 7 50 -1 -1 3.000 0 0 -1 0 0 2 3000 3900 6000 3900 2 1 2 1 0 7 50 -1 -1 3.000 0 0 -1 0 0 2 4200 5100 4200 2100 2 3 0 0 0 7 51 -1 15 0.000 0 0 -1 0 0 5 4200 2700 4200 3900 5400 3900 5400 2700 4200 2700 2 1 2 1 0 7 50 -1 -1 3.000 0 0 -1 0 0 2 5400 5175 5400 2100 2 1 2 1 0 7 50 -1 -1 3.000 0 0 -1 0 0 2 3000 2700 6000 2700 4 0 0 50 -1 2 26 0.0000 0 285 225 2625 4650 1\001 4 0 0 50 -1 2 26 0.0000 0 285 225 2625 4050 2\001 4 0 0 50 -1 2 26 0.0000 0 285 225 3525 5550 1\001 4 0 0 50 -1 2 26 0.0000 0 285 225 4125 5550 2\001 4 0 0 50 -1 2 26 0.0000 0 285 225 5250 5550 4\001 4 0 0 50 -1 2 26 0.0000 0 285 225 2625 2850 4\001 4 0 0 50 -1 2 26 0.0000 0 375 150 2700 2175 j\001 4 0 0 50 -1 0 26 0.0000 0 285 825 3825 1950 i>=2\001 4 0 0 50 -1 0 26 0.0000 0 285 825 5025 1950 i<=4\001 4 0 0 50 -1 0 26 0.0000 0 375 825 6075 3975 j>=2\001 4 0 0 50 -1 0 26 0.0000 0 375 825 6075 2775 j<=4\001 4 0 0 50 -1 2 26 0.0000 0 285 120 6000 5550 i\001 cloog-0.18.4/osl/doc/images/tree.txt0000644000175000017500000000054312413256474014151 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.4/osl/doc/images/basic.txt0000644000175000017500000000035412413256474014273 00000000000000 j^ i>=2 | | j<=n+2-i | |\ | i<=n | | \ | m-+-****---+-j<=m | ***** | | ****** | | *******| 2-+-********-j>=2 | | |\ 0-+-+------+--->i | | | 0 2 n cloog-0.18.4/osl/doc/images/basic2.txt0000644000175000017500000000020012413256474014343 00000000000000 j^ i>=2 | | i<=4 | | | 4-+-***--j<=4 | *** 2-+-***--j>=2 | | | 0-+-+-+--->i | | | 0 2 4 cloog-0.18.4/osl/doc/images/basic.eps0000644000175000017500000002701612413256474014247 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.4/osl/doc/images/basic1.pdf0000644000175000017500000001561312413256474014312 00000000000000%PDF-1.4 %Çì¢ 5 0 obj <> stream xœÝZM‹7½ëWèÇ°³­n©? Î!&¼;ƒñi¯³ììü÷£zõ¡Òì\|ë fgJªzUOR«T÷—8RèŸ|?œÂíÝÿ Ãa)±}|} Û¶EúKy-õ#ñë_áÓë0ÄÇ–9CyqɇjÓ’§C5ßJ®rÚ <„4oU/ÝóâìѨ~ȦŠiW@²8‚T­$€(fQJDò}Üâ¸Äôñ1äC‰ßBŠoï~Ûù>‡ûò` !jÄim §b §©1œ’·OÆD '&BŽ”¡`…6ˆRÂï› ¦Ð'•Õ¥†ÐBO©4€¥Ú@”!ª½Æ…Pz>ÙsfO4‡ûfhÏ¡RdY(*‹†õaŽÍ eýèzJ[kó!Lyª¬õ=m&¯€f{&)!èŠ[¦ÐÌ!‚[qô—°%+®™Ë2™¤nÅ9çä†h”Ü3¹[†6‰’z ªGñ@Ñp~Ͻ¥Y«•°S¬ù’šu”¸ð‡ëiiq¯ÜhâÆ4*9Åá˜#7‹²‡b 9“³Gn!j8 , C À m¥„ÙÛ7ALa^!D˜çÆ0OÆ0§ÆpÚœ=ÌD '&BŽ”¡Åê!«ŸÂ]´)”\-2çUó@I—]s®¶˜P€B¸QMI¼¡̾8W[V¬²fw¤\MÛÔÊ“e ªÏ4èàažº X197JÛ8T! _ÂSƒ@Áá׶qÜt^M.8~¤’`YN}=P ¦—JBH(p P7J»hY ”ð%•„aÅì Æ‹Ï™+ ÙêG)'  ¡Á¥ž8c•‡¶ì\pñ²Ÿ±šĆ¤Å›µ´eg_¼ì=+ß1Ÿºsß41%•%ß‘¾N­= ‡lå0©u@÷‚/nѲå3U=xt¾ÉZÚe€O‹Ó%´ô+1w¼yÊÿ'C¡eù†8 ÓP‡Ao<‡©B›Õsµç9ÑrÒp×a…øÌâTŒg6x).3½p°i/Ã>‡?_ÇÂûø¡FúX¿ d3rNX6…܇w]à3g.ûÅ ìs‹ßØïwÀ¿g> è‰Ešˆê¬úñ"ô"†9ó`óÁ¯ct31<.¤sãœ;u&¾Ç´ÍœFêÎ' n©s%Cä?T¤¾äR7ë¯Üz¯0ó—Šû@Qx" UÌ/ußã­îå QŒ/uSá‘´[Žm1¿¬¨Ô7ÜÏe“.*ê`‡¶ŠœzpYA‡· ‹E\TÈtÊ/5zëmÓùBÁ='4Íà¥BrNëo ðBqör‘w‹-_>5‹¼Kuaõ¹ç“ÅU ªàW–¾>Ö-›X–¯‡Süånï(ÿª¯5?~¯+Årȱže[<žÂ«ôãñ‰öûë‘Zõ¾p³ hC{“·ºÆ…»ž¨k-µçF»€º½«±]´›Tƒ×2¸ÀäïŸßˆUGéf™ÉQf£?È‚¦ó¦ ×Y]]ŒVVp4£ŸÞ9OÕû OÒ™ê•æø{m©¯ǚYÞ…ÿÂ>z,endstream endobj 6 0 obj 1701 endobj 4 0 obj <> /Contents 5 0 R >> endobj 3 0 obj << /Type /Pages /Kids [ 4 0 R ] /Count 1 >> endobj 1 0 obj <> endobj 7 0 obj <>endobj 12 0 obj <> endobj 13 0 obj <> endobj 10 0 obj <> endobj 8 0 obj <> endobj 11 0 obj <> endobj 14 0 obj <>stream xœmP]lKaþ¾µgß 59¢cúÌÏŒÄæ¯Éü5æÂ_§gu´=§éN§íÚmÝ‚%_YYÖD7u1¿ñ³ÄÂ…"YH„q…‰àêûêôÂÁoÞç}Ÿ÷yÿ 0¡©Vò‰ ŠÏ)Æ¥ldÓ X‰a­&çêrV®XÛÇŽ#&1ûs·&Ñ'éÝñth0@xùÁK›â$÷ÏÝWZºàofIee%®ÿfp•Ø(¹e–Nôs6ÙgÉGÄÚh;t8눑(‰ŸŒô‡³±T3áÕp$èTïÑ‚#t¦egÎúŸYìÑ@\`Iá†Q~Ô٫жåuãt’]Ž ÏP¾‚ncºq:Lj®é5 ÓâaÈ.²)B>QÃ…Z±ñ(bd„eŸCúá­)´DhI68ZÚ÷³ÖQHWѪwoŒWæ/+^Ϊ­ îo˜á‘¢žHUÿ‘©ƒŸ¯^zJø×÷ËWï^´¼Ü¢Uk[¹VVŒŠõ±}´¶¯ð˜7c/t›LoΘÆðñ [& endstream endobj 9 0 obj <> endobj 15 0 obj <>stream xœeïKSaÇŸëôÞKÎeÆ É÷M¢X9%Š8-èǨ5µ²t[›ww¿îÚ›ËR£ðI3ui%®ÜPÒ) ±…EhP„XFÐ ÿ†Èç¹]_´û"zÑ»s¾çœÏ÷{ž‚È4rn›p¨–wYå¶ï'p^ÎW¤Vñœx"#T?fA¥*Ó§ÄÆtoºµufAý:Þòq¬ÝÏ7šJJKþSʵZ-c ý0u6c=LQªØ\¼×móø1ºÔ¶ËÅ]eXWÈk³Õj³Êgf—ÍÉç\œ×˘b] S¡Ñ”ë9·¥]` ¼Ûìaô¼–9ÍÈñÿ—zÎQ^@8 N°©·A:hÓD6Ñ@,ýîR‰m0&’1âgë’ Ô)Vª%ÖGFàD×k½ã¡ ¡ëzmíCÁU=š„_h\Dáó;/3fð WÆÇ?…é˜äôQ_û&°Ž–V)š…Oqed•ë¨P¬Ø¬–Œ™ìíZZ¢ ¥¯÷ÊMZ@½QÊ>Ôý.Òõx[m²ÛÍ-qG29O&¸S¡ mI­³øWTfPÖŠŒ—q-ùöÎX74É1»üŽŽÃá¡Ááá‚ð“ûa˜~î:Û|>öìªåÇúòô›™‚ɹ‘Eøž®ëÕ&.å4çx•X˜O$ì²¾ £â¾ô¨X>‹ujiH"2®Q£ƒ#ƒƒÓáØð8¤cÛ/î¨)¨ v÷ÓÎŒRšÎÇð×(‚rñDhå)°±jôèºo€´TJ¢£èð÷…5¸™»]½)‹ÍAÖ^`µ9¾†ž!g?¼˜y“0ÞñŒ ŒðÐ[;ŒÎKªìf©HÒÐ~|„R#ØAM2¾ 1™ñ¸R‰˜)e`ô4I endstream endobj 16 0 obj <>stream fig2dev Version 3.2 Patchlevel 5-alpha7 basic1.figcedb@localhost \(Bastoul Cedric\) endstream endobj 2 0 obj <>endobj xref 0 17 0000000000 65535 f 0000002016 00000 n 0000006335 00000 n 0000001957 00000 n 0000001806 00000 n 0000000015 00000 n 0000001786 00000 n 0000002081 00000 n 0000002478 00000 n 0000003852 00000 n 0000002193 00000 n 0000002758 00000 n 0000002122 00000 n 0000002152 00000 n 0000003005 00000 n 0000004082 00000 n 0000004864 00000 n trailer << /Size 17 /Root 1 0 R /Info 2 0 R /ID [] >> startxref 6558 %%EOF cloog-0.18.4/osl/doc/Makefile.in0000644000175000017500000005133712554424237013260 00000000000000# Makefile.in generated by automake 1.14.1 from Makefile.am. # @configure_input@ # Copyright (C) 1994-2013 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@ # # /*+------------------------------------------------------------------** # ** OpenScop Library ** # **------------------------------------------------------------------** # ** makefile.am ** # **------------------------------------------------------------------** # ** First version: 30/04/2008 ** # **------------------------------------------------------------------** # # # *************************************************************************** # * OpenScop: Structures and formats for polyhedral tools to talk together * # *************************************************************************** # * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * # * / / / // // // // / / / // // / / // / /|,_, * # * / / / // // // // / / / // // / / // / / / /\ * # * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * # * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * # * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * # * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * # * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * # * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * # * | I | | | | e | | | | | | | | | | | | | \ \ \ * # * | T | | | | e | | | | | | | | | | | | | \ \ \ * # * | E | | | | | | | | | | | | | | | | | \ \ \ * # * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * # * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * # * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * # * * # * Copyright (C) 2008 University Paris-Sud and INRIA * # * * # * (3-clause BSD license) * # * * # * Redistribution and use in source and binary forms, with or without * # * modification, are permitted provided that the following conditions * # * are met: * # * * # * 1. Redistributions of source code must retain the above copyright * # * notice, this list of conditions and the following disclaimer. * # * 2. Redistributions in binary form must reproduce the above copyright * # * notice, this list of conditions and the following disclaimer in the * # * documentation and/or other materials provided with the distribution. * # * 3. The name of the author may not be used to endorse or promote * # * products derived from this software without specific prior written * # * permission. * # * * # * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * # * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED * # * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE * # * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, * # * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES * # * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR * # * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * # * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, * # * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING * # * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE * # * POSSIBILITY OF SUCH DAMAGE. * # * * # * OpenScop Library, a library to manipulate OpenScop formats and data * # * structures. Written by: * # * Cedric Bastoul and * # * Louis-Noel Pouchet * # * * # ***************************************************************************/ # # Makefile.am (or makefile if generated) of the OpenScop Library. # Makefile.am is not a makefile, you must run the 'autogen.sh' THEN the # configure shellscript to generate the Makefile thanks to this file. ############################################################################# VPATH = @srcdir@ am__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)' am__make_running_with_option = \ case $${target_option-} in \ ?) ;; \ *) echo "am__make_running_with_option: internal error: invalid" \ "target option '$${target_option-}' specified" >&2; \ exit 1;; \ esac; \ has_opt=no; \ sane_makeflags=$$MAKEFLAGS; \ if $(am__is_gnu_make); then \ sane_makeflags=$$MFLAGS; \ else \ case $$MAKEFLAGS in \ *\\[\ \ ]*) \ bs=\\; \ sane_makeflags=`printf '%s\n' "$$MAKEFLAGS" \ | sed "s/$$bs$$bs[$$bs $$bs ]*//g"`;; \ esac; \ fi; \ skip_next=no; \ strip_trailopt () \ { \ flg=`printf '%s\n' "$$flg" | sed "s/$$1.*$$//"`; \ }; \ for flg in $$sane_makeflags; do \ test $$skip_next = yes && { skip_next=no; continue; }; \ case $$flg in \ *=*|--*) continue;; \ -*I) strip_trailopt 'I'; skip_next=yes;; \ -*I?*) strip_trailopt 'I';; \ -*O) strip_trailopt 'O'; skip_next=yes;; \ -*O?*) strip_trailopt 'O';; \ -*l) strip_trailopt 'l'; skip_next=yes;; \ -*l?*) strip_trailopt 'l';; \ -[dEDm]) skip_next=yes;; \ -[JT]) skip_next=yes;; \ esac; \ case $$flg in \ *$$target_option*) has_opt=yes; break;; \ esac; \ done; \ test $$has_opt = yes am__make_dryrun = (target_option=n; $(am__make_running_with_option)) am__make_keepgoing = (target_option=k; $(am__make_running_with_option)) 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.in $(srcdir)/Makefile.am \ $(srcdir)/Doxyfile.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_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 = Doxyfile CONFIG_CLEAN_VPATH_FILES = AM_V_P = $(am__v_P_@AM_V@) am__v_P_ = $(am__v_P_@AM_DEFAULT_V@) am__v_P_0 = false am__v_P_1 = : 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_GEN_1 = AM_V_at = $(am__v_at_@AM_V@) am__v_at_ = $(am__v_at_@AM_DEFAULT_V@) am__v_at_0 = @ am__v_at_1 = SOURCES = DIST_SOURCES = am__can_run_installinfo = \ case $$AM_UPDATE_INFO_DIR in \ n|no|NO) false;; \ *) (install-info --version) >/dev/null 2>&1;; \ esac am__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP) # Read a list of newline-separated strings from the standard input, # and print each of them once, without duplicates. Input order is # *not* preserved. am__uniquify_input = $(AWK) '\ BEGIN { nonempty = 0; } \ { items[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in items) print i; }; } \ ' # Make sure the list of sources is unique. This is necessary because, # e.g., the same source file might be shared among _SOURCES variables # for different programs/libraries. am__define_uniq_tagged_files = \ list='$(am__tagged_files)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | $(am__uniquify_input)` ETAGS = etags CTAGS = ctags 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@ CD = @CD@ CFLAGS = @CFLAGS@ CFLAGS_WARN = @CFLAGS_WARN@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CYGPATH_W = @CYGPATH_W@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ DLLTOOL = @DLLTOOL@ DOXYGEN = @DOXYGEN@ DSYMUTIL = @DSYMUTIL@ DUMPBIN = @DUMPBIN@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ EXEEXT = @EXEEXT@ FGREP = @FGREP@ 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@ 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@ PRTDIAG = @PRTDIAG@ RANLIB = @RANLIB@ SED = @SED@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ STRIP = @STRIP@ TEXI2PDF = @TEXI2PDF@ 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_aux_dir = @ac_aux_dir@ 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@ 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@ MAINTAINERCLEANFILES = \ Makefile.in \ htmldoc.tar.gz \ openscop.pdf \ openscop.cp \ openscop.fn \ openscop.info \ openscop.ky \ openscop.pg \ openscop.toc \ openscop.tp \ openscop.vr \ openscop.aux \ openscop.log \ openscop.doc EXTRA_DIST = \ htmldoc.tar.gz \ openscop.pdf \ S4.cloog \ images/basic.eps \ images/basic.fig \ images/basic.jpg \ images/basic.pdf \ images/basic.txt \ images/basic1.eps \ images/basic1.fig \ images/basic1.jpg \ images/basic1.pdf \ images/basic1.txt \ images/basic2.eps \ images/basic2.fig \ images/basic2.jpg \ images/basic2.pdf \ images/basic2.txt \ images/tree.eps \ images/tree.fig \ images/tree.jpg \ images/tree.pdf \ images/tree.txt @GENERATE_DOC_TRUE@DOCDIR = htmldoc @GENERATE_DOC_TRUE@DOXYFILE = Doxyfile @GENERATE_DOC_TRUE@DOXYGENTOOL = @DOXYGEN@ # The following requires a fixed version of the Emacs 19.30 etags. @GENERATE_DOC_TRUE@ETAGS_ARGS = --lang=none \ @GENERATE_DOC_TRUE@ --regex='/^@node[ \t]+\([^,]+\)/\1/' $(srcdir)/doc/openscop.texi @GENERATE_DOC_TRUE@TAGS_DEPENDENCIES = openscop.texi $(DOXYFILE).in 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): Doxyfile: $(top_builddir)/config.status $(srcdir)/Doxyfile.in cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ mostlyclean-libtool: -rm -f *.lo clean-libtool: -rm -rf .libs _libs ID: $(am__tagged_files) $(am__define_uniq_tagged_files); mkid -fID $$unique tags: tags-am TAGS: tags tags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files) set x; \ here=`pwd`; \ $(am__define_uniq_tagged_files); \ 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-am CTAGS: ctags ctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files) $(am__define_uniq_tagged_files); \ 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" cscopelist: cscopelist-am cscopelist-am: $(am__tagged_files) list='$(am__tagged_files)'; \ case "$(srcdir)" in \ [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \ *) sdir=$(subdir)/$(srcdir) ;; \ esac; \ for i in $$list; do \ if test -f "$$i"; then \ echo "$(subdir)/$$i"; \ else \ echo "$$sdir/$$i"; \ fi; \ done >> $(top_builddir)/cscope.files distclean-tags: -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags 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." -test -z "$(MAINTAINERCLEANFILES)" || rm -f $(MAINTAINERCLEANFILES) clean: clean-am clean-am: clean-generic clean-libtool clean-local mostlyclean-am distclean: distclean-am -rm -f Makefile distclean-am: clean-am 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 -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: CTAGS GTAGS TAGS all all-am check check-am clean clean-generic \ clean-libtool clean-local cscopelist-am ctags ctags-am \ distclean 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-generic mostlyclean-libtool pdf pdf-am ps ps-am \ tags tags-am uninstall uninstall-am clean-local: -rm -rf htmldoc # Unfortunately the following is not supported conditionaly # info_TEXINFOS = openscop.texi @GENERATE_DOC_TRUE@openscop.pdf: openscop.texi \ @GENERATE_DOC_TRUE@ images/basic.pdf \ @GENERATE_DOC_TRUE@ images/basic1.pdf \ @GENERATE_DOC_TRUE@ images/basic2.pdf \ @GENERATE_DOC_TRUE@ images/tree.pdf @GENERATE_DOC_TRUE@ $(TEXI2PDF) openscop.texi @GENERATE_DOC_TRUE@htmldoc.tar.gz: @GENERATE_DOC_TRUE@ mkdir -p $(top_srcdir)/doc/htmldoc @GENERATE_DOC_TRUE@ $(DOXYGENTOOL) $(DOXYFILE) @GENERATE_DOC_TRUE@ tar czf htmldoc.tar.gz htmldoc # 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.4/osl/doc/Doxyfile.in0000644000175000017500000015151612413256474013326 00000000000000# Doxyfile 1.5.3 # 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 #--------------------------------------------------------------------------- # This tag specifies the encoding used for all characters in the config file that # follow. The default is UTF-8 which is also the encoding used for all text before # the first occurrence of this tag. Doxygen uses libiconv (or the iconv built into # libc) for the transcoding. See http://www.gnu.org/software/libiconv for the list of # possible encodings. DOXYFILE_ENCODING = UTF-8 # The PROJECT_NAME tag is a single word (or a sequence of words surrounded # by quotes) that should identify the project. PROJECT_NAME = OpenScop # 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 = @PACKAGE_VERSION@ # 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 = htmldoc # If the CREATE_SUBDIRS tag is set to YES, then doxygen will create # 4096 sub-directories (in 2 levels) under the output directory of each output # format and will distribute the generated files over these directories. # Enabling this option can be useful when feeding doxygen a huge amount of # source files, where putting all generated files in the same directory would # otherwise cause performance problems for the file system. CREATE_SUBDIRS = NO # 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: # Afrikaans, Arabic, Brazilian, Catalan, Chinese, Chinese-Traditional, # Croatian, Czech, Danish, Dutch, Finnish, French, German, Greek, Hungarian, # Italian, Japanese, Japanese-en (Japanese with English messages), Korean, # Korean-en, Lithuanian, Norwegian, Polish, Portuguese, Romanian, Russian, # Serbian, Slovak, Slovene, Spanish, Swedish, and Ukrainian. OUTPUT_LANGUAGE = English # 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. The tag can be used to show relative paths in the file list. # If left blank the directory from which doxygen is run is used as the # path to strip. STRIP_FROM_PATH = # The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of # the path mentioned in the documentation of a class, which tells # the reader which header file to include in order to use a class. # If left blank only the name of the header file containing the class # definition is used. Otherwise one should specify the include paths that # are normally passed to the compiler using the -I flag. STRIP_FROM_INC_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 = YES # 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 regular Qt-style comments # (thus requiring an explicit @brief command for a brief description.) JAVADOC_AUTOBRIEF = NO # If the QT_AUTOBRIEF tag is set to YES then Doxygen will # interpret the first line (until the first dot) of a Qt-style # comment as the brief description. If set to NO, the comments # will behave just like regular Qt-style comments (thus requiring # an explicit \brief command for a brief description.) QT_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 the SEPARATE_MEMBER_PAGES tag is set to YES, then doxygen will produce # a new page for each member. If set to NO, the documentation of a member will # be part of the file/class/namespace that contains it. SEPARATE_MEMBER_PAGES = 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 = YES # 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 # If you use STL classes (i.e. std::string, std::vector, etc.) but do not want to # include (a tag file for) the STL sources as input, then you should # set this tag to YES in order to let doxygen match functions declarations and # definitions whose arguments contain STL classes (e.g. func(std::string); v.s. # func(std::string) {}). This also make the inheritance and collaboration # diagrams that involve STL classes more complete and accurate. BUILTIN_STL_SUPPORT = NO # If you use Microsoft's C++/CLI language, you should set this option to YES to # enable parsing support. CPP_CLI_SUPPORT = NO # 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 # 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 # This flag is only useful for Objective-C code. When set to YES local # methods, which are defined in the implementation section but not in # the interface are included in the documentation. # If set to NO (the default) only methods in the interface are included. EXTRACT_LOCAL_METHODS = NO # If this flag is set to YES, the members of anonymous namespaces will be extracted # and appear in the documentation as a namespace called 'anonymous_namespace{file}', # where file will be replaced with the base name of the file that contains the anonymous # namespace. By default anonymous namespace are hidden. EXTRACT_ANON_NSPACES = NO # 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 # and Mac 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 # If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the # brief documentation of file, namespace and class members alphabetically # by member name. If set to NO (the default) the members will appear in # declaration order. SORT_BRIEF_DOCS = NO # If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be # sorted by fully-qualified names, including namespaces. If set to # NO (the default), the class list will be sorted only by class name, # not including the namespace part. # Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES. # Note: This option applies only to the class list, not to the # alphabetical list. SORT_BY_SCOPE_NAME = NO # 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 # If the sources in your project are distributed over multiple directories # then setting the SHOW_DIRECTORIES tag to YES will show the directory hierarchy # in the documentation. The default is NO. SHOW_DIRECTORIES = NO # The FILE_VERSION_FILTER tag can be used to specify a program or script that # doxygen should invoke to get the current version for each file (typically from the # version control system). Doxygen will invoke the program by executing (via # popen()) the command , where is the value of # the FILE_VERSION_FILTER tag, and is the name of an input file # provided by doxygen. Whatever the program writes to standard output # is used as the file version. See the manual for examples. FILE_VERSION_FILTER = #--------------------------------------------------------------------------- # 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 # This WARN_NO_PARAMDOC option can be abled to get warnings for # functions that are documented, but have no documentation for their parameters # or return value. If set to NO (the default) doxygen will only warn about # wrong or incomplete parameter documentation, but not about the absence of # documentation. WARN_NO_PARAMDOC = NO # 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. Optionally the format may contain # $version, which will be replaced by the version of the file (if it could # be obtained via FILE_VERSION_FILTER) 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 = #--------------------------------------------------------------------------- # 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 = @top_srcdir@/source @top_srcdir@/include/osl include/osl/scop.h # This tag can be used to specify the character encoding of the source files that # doxygen parses. Internally doxygen uses the UTF-8 encoding, which is also the default # input encoding. Doxygen uses libiconv (or the iconv built into libc) for the transcoding. # See http://www.gnu.org/software/libiconv for the list of possible encodings. INPUT_ENCODING = UTF-8 # 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 *.m *.mm *.py 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 = YES # 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. Note that the wildcards are matched # against the file with absolute path, so to exclude all test directories # for example use the pattern */test/* EXCLUDE_PATTERNS = # The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names # (namespaces, classes, functions, etc.) that should be excluded from the output. # The symbol name can be a fully qualified name, a word, or if the wildcard * is used, # a substring. Examples: ANamespace, AClass, AClass::ANamespace, ANamespace::*Test EXCLUDE_SYMBOLS = # 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. If FILTER_PATTERNS is specified, this tag will be # ignored. INPUT_FILTER = # The FILTER_PATTERNS tag can be used to specify filters on a per file pattern # basis. Doxygen will compare the file name with each pattern and apply the # filter if there is a match. The filters are a list of the form: # pattern=filter (like *.cpp=my_cpp_filter). See INPUT_FILTER for further # info on how filters are used. If FILTER_PATTERNS is empty, INPUT_FILTER # is applied to all files. FILTER_PATTERNS = # 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. If you have enabled CALL_GRAPH or CALLER_GRAPH # then you must also enable this option. If you don't then doxygen will produce # a warning and turn it on anyway SOURCE_BROWSER = YES # 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 REFERENCES_LINK_SOURCE tag is set to YES (the default) # and SOURCE_BROWSER tag is set to YES, then the hyperlinks from # functions in REFERENCES_RELATION and REFERENCED_BY_RELATION lists will # link to the source code. Otherwise they will link to the documentstion. REFERENCES_LINK_SOURCE = YES # If the USE_HTAGS tag is set to YES then the references to source code # will point to the HTML generated by the htags(1) tool instead of doxygen # built-in source browser. The htags tool is part of GNU's global source # tagging system (see http://www.gnu.org/software/global/global.html). You # will need version 4.8.6 or higher. USE_HTAGS = NO # 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 = YES # 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 = 1 # 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 = osl_ #--------------------------------------------------------------------------- # 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 HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML # documentation will contain sections that can be hidden and shown after the # page has loaded. For this to work a browser that supports # JavaScript and DHTML is required (for instance Mozilla 1.0+, Firefox # Netscape 6.0+, Internet explorer 5.0+, Konqueror, or Safari). HTML_DYNAMIC_SECTIONS = 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_DEFINED 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. To prevent a macro definition from being # undefined via #undef or recursively expanded use the := operator # instead of the = operator. 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::additions 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 # You can define message sequence charts within doxygen comments using the \msc # command. Doxygen will then run the mscgen tool (see http://www.mcternan.me.uk/mscgen/) to # produce the chart and insert it in the documentation. The MSCGEN_PATH tag allows you to # specify the directory where the mscgen tool resides. If left empty the tool is assumed to # be found in the default search path. MSCGEN_PATH = # 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 GROUP_GRAPHS and HAVE_DOT tags are set to YES then doxygen # will generate a graph for groups, showing the direct groups dependencies GROUP_GRAPHS = 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, SOURCE_BROWSER 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 CALLER_GRAPH, SOURCE_BROWSER and HAVE_DOT tags are set to YES then doxygen will # generate a caller 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 caller graphs for selected # functions only using the \callergraph command. CALLER_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 # If the DIRECTORY_GRAPH, SHOW_DIRECTORIES and HAVE_DOT tags are set to YES # then doxygen will show the dependencies a directory has on other directories # in a graphical way. The dependency relations are determined by the #include # relations between the files in the directories. DIRECTORY_GRAPH = 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 in 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 = # The MAX_DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of # nodes that will be shown in the graph. If the number of nodes in a graph # becomes larger than this value, doxygen will truncate the graph, which is # visualized by representing a node as a red box. Note that doxygen if the number # of direct children of the root node in a graph is already larger than # MAX_DOT_GRAPH_NOTES then the graph will not be shown at all. Also note # that the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH. DOT_GRAPH_MAX_NODES = 50 # 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 the size of a graph can be further restricted by # DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction. MAX_DOT_GRAPH_DEPTH = 0 # Set the DOT_TRANSPARENT tag to YES to generate images with a transparent # background. This is disabled by default, which results in a white background. # Warning: Depending on the platform used, enabling this option may lead to # badly anti-aliased labels on the edges of a graph (i.e. they become hard to # read). DOT_TRANSPARENT = NO # Set the DOT_MULTI_TARGETS tag to YES allow dot to generate multiple output # files in one run (i.e. multiple -o and -T options on the command line). This # makes dot run faster, but since only newer versions of dot (>1.8.10) # support this, this feature is disabled by default. DOT_MULTI_TARGETS = NO # 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::additions 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.4/osl/doc/openscop.pdf0000644000175000017500000116133712555415064013536 00000000000000%PDF-1.5 %ÐÔÅØ 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 408 /Filter /FlateDecode >> stream xÚ…RMoÜ ½ûWp©†Ç&ÝVŠ*õc}kzpmobicoÔüû†m“U•Ê—1¼yïÍc€iú€yÃ|@гî¾ÒëérËrñõCg*g‘êWaò„“€*ÚÿJR—¾Ž*ļlª‹÷Þ1£Uí‚cÍ.Ù«5Ù ¬éÙ7þé $¦m7Ä÷æºÚ4ÕÏ?|„vˆ Oº';d†—íª/YÇ9ZE!é‚òÆ1´B4Yí-‰!ò-‰šÀ‡n¼Ñ`»ö8ÎS¾i§>–·ùÿãøci—§ü³›—\¼km†m~u‚˜îÚévÈwcaú,Œçóþénè¼Ý熫ùþ0îŸ)6" ŸÉOB?¤˜ÊÒlŒŠ²óM?þí¥ß¼°d׉¢ä¸mËÑù”–ú៘Ûóö³Ñ)W¥WsÆ×*øXÜ•\¯§2>.%@Cš©a}° mmÒ»H µÒ´ÒÒš€/ WÂ8~£ ‡äCHàý2vÄå¿L>çÇý?7ÄGeÂù~€Š´4e?~f¹E endstream endobj 13 0 obj << /Length 1199 /Filter /FlateDecode >> stream xÚ}VKoÛ8¾çWø¶4`©¢©—»(°IÚ)ºm;{ÙîA–興,y)*‰ä¿ï ‡RlGXø`rç=â“~|’Ì'I*üT$“|{Xª¾ŸÐáöëwra$ü(pþ_1/šGVÎ;@½X}¸Š¢ üE°à“ÕŸAìó(¬ŠÉßlUªvê‰yÊŠ)gÍÔƒSÞme=…ƒqÙæZ­-OZé„ýÜѵ^æÍn†´ˈÕ:V®~<Ì3£šš8͆ ²+I¤M£·™!zVGr­t†~ŠÌdDiîrÓi0ëŸÕ7ˆ„Ç8ÇÉ9S#‹š \Ü—²ÐYEô¼ÙîTå,D‚iœd{x_0“U=å^šRjê…"`׆ÈYÕ6t:ÒÖZÁÓà*G§#4á•’Gñ$ÒwµÖ™Þ9F~=br¤n)°"d_@ƒ]18B°«i*˜–’nËfcPïiŠ!ÖdJ›ÒDvºA‰GUØ4#RMùœmw•C²i¦µ9lF’B©¾zl\ýÁ~¨ºìÇ ‰@ )ë®Ât![]þ픑$ö lAÀ ÓÿZn¤¦£µ=)’HØA1¼•/Š‘ªU;KÜ;ån]©¡dñŲ@÷l»Ê´ÄÝèfÛËɱ ìÚ“˜‘™@8I8’\Â?"ôm|Ø·óÔO)†bAЬd^ÞÊ]£ÍËEÖr>³pî‡QxlEÖ™[fûoñ(`/—¿¸ƒfP9qÄ@2^gcŽe0ý=BœDìå玬ÿHôsú[î ó7C‘dÚ误l{Ùô–}ƮƧÓÜN*þËs^fõ½³@9Ü›¦Ú팄UìòŽ`[Û¦6å‰[K¹3r»–z<{™½…2œ›}ðÛTÕ-„­{3çý½ÜdZµÞ²sQ¹«Õ#v³Ùψp¥³:—¯döXB_]‰vï}\Biaqku_Ré#dúó6Š”är‹Ã#<á6Ëœ^#OóvO î[)ŒUôÍ0kÀ_ì%Ñmlt»d¦ïA!Üøë·×ç4?¼8ò“4=š"7¤¼U­„1456f,ؽ¦¶6² ‚ »ˆàhÄi™ÀÀV°EÔº³ã&Æ™W|ÀšDµ-ÍŽBmö§ìŸ+@îêÂŽ¦¸ïuT+–Ž7R\_ÜáLf÷qÈNOË\º &B6–Ñ¡à@$¤ô‡Â•l‘ól¼}>-®~%…â áèÛ“¦= J¦9?øû€ä ƒÌ@z]ç¾KA´óŠâòöIpSe¹µ?4Üæ†"pÄ‹–Kí.ž»Ï–9çpƒ„èwKj÷³/«³ÿã¿âý endstream endobj 64 0 obj << /Length 2708 /Filter /FlateDecode >> stream xÚí[sÛÆÇßý)øVêA›½b}é4Ž“:Ó‹ci¦i ¶9¥H¤ZûÛwìå€Â¯Q¸1)Lf,‰âžÿ÷÷?ض ö?¶Ð|¡ FèÅúþm_­ß.ºo^ÿðŒ¹÷]Û7^ƒw~{ûì›ï•Z0JJZ²Åí›…âœ(&B¼Û»ÅÏËÍÕ/·?>{q)®ˆ’"SÕ¿û‘´¶Òšp¦d#Ýü¼ ´ù©Q½½*årõ붺ºZ-÷oº¯Ï÷»+Á–ǪûrhrëBI"dÁ›Ptq-¡²è"±«kƸZ¾ìšÔ{‰-ïÖÇ Ö¶g”¬ÉË(¨ ð{ ÐÝ—¢÷Sþ‹cÛýß^ü s9ÅË~úRËEa¡Ô´xeGhiÿa¼å¬ÿJ8×þÀÅN>•q¬$X‡Éd°ŽK[Ö ÅI!:Qî}Õð¹ß~|WÝÕ«mÇûëê}]í«–Øž^Õû·õêþ0ȱ šP.§äx:vR½Þ}0ã;=´Çú|ú"Ùå1“œïëöëª)H)­¬(k^i{4…‰RºüËþ¸ù÷•*–mÿÚHÊб¶—…°ÅЈe½ÚÞìëûŽ¶t}nE·ßKªGvù%”™ ‚=Â2gÊÐ}ŸÍ¦k  ^|û2Ÿ $“ƒ'*íùäÂ^6=žÜáyûn³ûçf÷¶Cq³ë¾¾ºâÚ+ ãjF&dûÍ0ž‰ÇÆxöC{ } L’3ÉÓe”cÌ¢ %±òüP™_«Ú_t-óßíïW›Ý éÌØ£|¤_ŠmR¤w0Œ'=´ÇHÄ©$é1“Ò1]Oº* ¢@ÝWù›õêhiuþûfÈñ°“¤â¹!O¥´Ÿ/ð Ä=£È{°éå0™ ÌqéÀ¹D9Žó?®×ÕáÐ0.Æ%Ê8ãDs1_Îyüb§…ˆÏŸXví¯A€!äOdºÕždd“Ã<ªíFïJÛ©ŸÈ{àÿþnuüÝ¡+ê­>ÿ0Dziãk9ƒ~Ñ馜á¸ïŒsÄ“%çµ0›gœh?ZhS’ÙµŸMw+m{ß®W»›õþ}·vÓ|åËj½ùer½²sÚôúpÉ­º™×‡¸ì`TÚy—ÿø?.×þZÐ;‘éàJ¨a69ph—].›—`aêøª®¶›ûÍnUìjï‹«û÷Û*5–æšÍå÷œg¾Ì9ÆWÓ«¦:xM𨶞1¢•ñÀû dSS¹‰5µ™CnÚí;?›l×®»ŸoÜ›}µMŽÀË’”œÏÎÐ_îòïºs<°1,¤†™$° ›`Qm?”¥!ÕØP¤_WÛ½Á­]~Fï¢Ë~ž˜Ñ¦SôÀdeÊ0› SàڌľF© `ŠO,{·ß¿¶oY¶®±äDͶCreæÉä¬Ù¾ïÆã`xBD8Mâ ²ÉÁÕxjNíáéGÍ ;x8VŽ§€ÊPÒÉ, "µ™Éü‚gw9®÷Æ`€BHxòðÌ&PT;ªJÂ쯠"±—‚2) ¢Šyü7QHÑëºv<½1F/$ˆ'׊a69ô¢Ú^Yê·Ú;z壒†Üæz_îÛ­oöÕ.†=Y‹¤àv=?À ²ÉÕó=Á‰Qn?rø¡ÚÙ²¼žî)Âe1×á§nÊŽ›ñÖˆ0k@>ÔU·8rcGñ™;/œ)BÙ|öišìûn4 Bgž1C#ªÁÎJRE?‹,?+I˜™ÆÏ@?ÃÐ{Cáíæ00„à´´¦žä¯åÌ­XO3YEæ£(ç‘nªRt}<¾T„öX­ !Å"¦’S-0áP.$%º,c½Yõ¢yN‡“Ô ˜€ýWõ›Õº·Vçm›ÿ]¾4í¶AO>aáâÌNŒÏ³Œ[»Žïë36ä‹Igƒlr¬josmç¹&z[eyÛ¶2FLâm˜ÀÛ¸‚{:(ì<[O"\ÚïÝß„S{YÌwÁ^ŒBÊ䎃ñ&0“CÜ“ƒlrLŽj“Ûd L^d™Ü¶Ò‚Obr˜ÀÁíE˜¼Ù¦ŸD×N¸.úº©Á7›§ðS§RwŒ÷x €yâ†xd“ãqT;xœÂ{!­Çu–Çm+e¦ñ8Là×v#*lÏ>Ö׺}áúƆ'ú‰ë¹óíF:&I9ŸŽ¼G58Ÿb÷‰žÊtÎO>f“ã|TÛ;ŸCXYDç›ç7­¤`S8¿—Àá¸:V÷Uj‹ŽSÚnÑM Ï©l¶èzê©-:jæqü*$Lí»|´©AÄÔ=²Ò¦†Ùd˜×¦Ö*>å¶1u™eêæ «™ÄÓPÿÐœ>¸†Ëf¸>¦6íh½§™­—óŒüRRfwTŒ7{ €™‡˜d“cvTÛþâ…õ|Üó«ë/>«Ý!y³!¥™pÍGÀŽ¢ñ>‰0Ÿô`MÞ7 ³Éñ ª.ŠÍeN†{?d8†ö|†œíaÈàáÛòšGüÌ[®çrÀÒwûx²cŒì]ÉNa69d£Úlaß^²á£;w«ûêà4„r݌ԼùÕi\o:À€îA•d“4ª€æœH)"Ðáu½j õÇ,¢™!Tóý§çü@ ÂxÚcŒöqÉ›Ra69´£ÚvZ^òH» “n!¼¾ÛìVǼ*.ùüðå¯ù¼·ïìñ<ÇÏ=¦’w#ÁlrxFµ=Ϭ,“,òìO…<ßvÅ;‡cjl =×î˹Ïc1š|!¿O_’|˜Mù¸v ßpR–€ü"®ÆÄMMíî9ýÔD³91/8·yÆc`˜÷PKÞгÉÁÕ˜%1`ºé üÙWÞgørþÿ¢\ÖÆšÃb<ø¡=Æ=d/yŽ¤’C=& WÍ9í2Rï7Ê_mŽûŽø‡]½ßn³†é‚P3?Qàë§ûîOs €áÜ£*yè f“4ªˆ¶*ˆö»Ä/ëºzû°]Õ9$ÛQŠžïa>;¼]ßÇ;Àðî!–Ü…Ùäàj»}Q&(&[ösÐ?mÇ}ýqð|#lôøLòÓzš¿Çk¼bÌ@=Š“G‡Ù<2ÐošÙ^ endstream endobj 116 0 obj << /Length 1923 /Filter /FlateDecode >> stream xÚíœËrÛ6†÷~ -å…Ü/Ý5i’I&¤Ž³J²Pe:åŒ,9º´MŸ¾ …+M@ \»±ÍÉL,ÑÒùÿ#@hõ?4x"$’ˆÉüò¶G×_&û§/ù܉þàIðɧgGO^06A(¨Ðäì" uv>ù8­ëãÌ¢Ó·Wú•œVË÷ó•~I™¾7‡æõ'ˆè|¶­WËýofËóý‹7õïëÙúÛñç³×GÏÏ\& 3À(˜¶ýôµÜ…ÎB9¶¹36¹Óã„0k3'Èg.X˜Ö“Â0 b PÌ´tå'…‹ý½~°ô{wvð¿ Öíh¨…ÔuLÓÑ€éߨô·=‰ºÞ|ÿ$ÐÓõ]™¶çˆJÚ.Èfˆí:Ú12’Eµ4%€Je¬náôÝZã±iÀh½ÆID›þ£±*tÚ}rÅýK÷Nº6ÕÎæÄ[껡1ß? ô·+sš ›!Ðdµ-4B¤…hžÎ6Õ~üxq,Ét·œ7C˦!¥d¡Çi c›r0|€¡;3`Ù #« Rʉ@ )n@ùewyU/¿è&¢”NW›…Më«ÓÂÑ$¦cPŒ¥Ÿáä\ÿòµn*&µŸ¼œ€ѯ“÷G¿™td˜†¡ât6Ûõn¾Ý­™®ªzä©”©Bù¨50À*ËŸëè”™u{¬çô õHüÈO)†L“–3ääŠ| “ Ù a(«íÒæ…$`»¢¬^ë™ËöHH1]øÑ67 éJqçt$8E…ò1HT.D,e›¡ÝÔ”³q`½­`),M•céä°ŒÐHcd3ˬ¶Å’+¨r%1XžV³óD2Ž+¤[Ý”HŽ;é ’@Y(H¢KàH~­[ FÝr”ü°K|¨´]TÌd ÃdÌE’É0›L浓BA˜g’&^,Ví*_³¼w¨ìdmÙÙÄRâfU§j«Î(«Ch2ÒVEê¢S´Eg¤~9s Ñ(Ñu¦àãhy « ¶ÊéórôE¤é ²B_VÛÑÇ)`2 ÙÉ^5ûþH[¿‰&o6ëÃà¦M¼ñÇ Pˆ–©ÇüqM0‹Å/ÖUÕÇR€ 4® ÞÂʽåÂtC9~>@¿4~A6CðËj;üTçàðã¿g‹Õò`Aªçhºlbp®nVê9ë¤s° EíbR™|§ e€ËÏu ô‚‡€ŒàÝñôÐvN9>@ŽÆˆ”¤1ÈfYmG#‘Kâi†Æ³æZ@µ9¼hƒã¨Ã¼‘ÍlSÄ)"’(VÊwˆÔ³ÍfH 嫯»Ù¢—H=ú£‘ÈÛVHiú¨L fGÌ ›!`fµÍµ:®?ˆãÒ.Ú<ÿ{vyµ0—ëVÍO³YD›Eh³åâMÛ]íûÛzQÿ³ß3Òçf­Æí,  Ó[å~ôr~ŒL‘öcÍ?fµ­JÏ4Œí‚Å«åf«'MIcIˆÂãRÚã;Õ§H1>*'ÅÈ‘Ù5MJÍR²Ú¶¤bJICÅ]L~Sϫ妷Àç H]{Œ+Z‡“ Ö=Å€2€Ä&Å)@Âl’×v€H]mÈì.I}ÝÕëê²Ú_(MmAbx\û½ÿ¤¤üoÌQî çÿȃiÿÙ ñV[O5xÂŒöw#ÄË_ßÅ;¹Û7Ÿ ƒ««¦Äš-ôkÔ»4Ë¡þ»ÄXiÝÕvQÓ‰å6ußϹ4tJÚ¤>•!Í »S4S€å=Jú þÖÍ‘f&µg1àxÆþ¡¶tÚî-w¯³oä"’ôoÍgµƒ)¶SÖ·æLly®fÛݺêw/F@±ñ´z//f[”ÛÜÈÙ<²ZÚæA6ClžÕv6'@!½ÍíÅìËúÀÚ ‚D ñÄüà¶5ZS”ûÞÈù>ò^Ú÷A6C|ŸÕ6Ë‘ …·úf÷ÆÎN!“æo§‘ò~Ýv8ÒuÓ¹%*¼/Òqr÷&veq¾ë¾È¼¶år „ã‚»M68T‹Õ•%£wµ^iòÆUÈG‘n c rD|€"‘Oi‘ ›!ˆdµmÉDÛMDnG> stream xÚµZ]o» }ß_¡·¶/ZQ$õQ·Èmê¢@oÄîmÓ•D\³ƒÍðsfDÁÊÌÅTx6‹+ñ dáú@–S1þŒéÄ5@~„èÁœçPp0ÈÔ¯ž=[­¯>ßufýró¾[­ÿ¸ß»ÝñÞ¬ªW«õ«î~ÿñpÝÝc‰:~êÞn7?î?™×šÕz " ٔ߬€r€:Ü~’þá‡Á@ͳgf}óbù‚GÄX:=Bhýò°¿¾ìŽæ5ìxqaÖWݧ£yóEÔ@ÌÎ# 1±3˜ø`ËìôÏÅú{ƒ<¶3÷ÿÛ»~¾Ûí÷ºìlŪ¥j4â¨4ÞÕ†jãkõ©Còu4¾¢øŠâ+Š¯(\Q¸¢pEáŠÂ…+ W®(\Q¸¢HE‘Š"E*ŠT©(RQ¤¢HE‘Š¢E+ŠV­(ZQ´¢<š†“¿VëËÿ>žÞÿºÝýgµþqxÛªÇÝ›2+טM¥hK#$µ[ˆzµ SC›#Aîù)H.ÍúÏû«½Y¿0¿¥ß•ˆx:¥d‹â1x‹r”‘ŸÈèu .‹Å~ùÀ(lcˆ‹2¢ÍˆÐJv6P¥”™(ÜÚ0ÂÛ,2ʨó0*b%P;N,ÎäQÊøÔØ¢&¶šJÍdðx¸ú™8£³Â gLÖÑø0é©ñƒI,gr²ªCȪ’e—Ç9u¦qzocj8Ù[I²,'Ƹá¤l™'8Ó<œH3mh¶uÁRšˆ¡<'¶Y)©dÏ)™­ãñMÏ»™8£GÌ4œDšà¤™85b\Ãæ.!ØÈãljŸi}Š{Jé¿pjÙ#–¥ÄÒHÚPŠƒ«'8y&NlèŠ<ÿÓGKº0'vt\¯NôãÒ³('cK÷Ãn+'i?¬½ÌD™œõ: “S´É/Ì0}cDoÏüL{-c]d(YLpδے•æ®K¸ÑÄ%gÚ…iÙR#àd¤%—]þêrô¼µ`´þåÿ4Ñ›NÕÝÇ››7߬6uËR¢áKU÷ûø¤*&…ó2¦<©.¨Õ8­vi‚Ö*Z¨U´P«h¹ÌrUÈU!W…\ÊhkK}ëû–ûVúVû¶¯Jº¾,éúº¤ëñ¨Ç£z¼ZÎ}Rñ®¯Dܶ¨©LÔI™.²'„4k/*Ò󩘜‹“qb´ÃÄ:ˆyaNRëÂéD/6†qN™)ˆŽl¦†“Èò‹rdt1hSÿMVÂÂœQmùßgRËDËrqñÀ‰¬rª;¥ i¤†R³u£œ)· Œœ1ø¦Ò­6i^–Ó#g$jJÝÞƉZÈlœX¹©…ÊVuYNÅÊHM-$¸`}š!?c¹[sSîfløº,g9DܶŠ¤2NíBsqbiplÆ‚Í:1Ι’e±Ô–•1nY–“±Vbó§q6èÂœX¹©‡¨–'ÊÀ³q:´ªMY_,ë§ÌUÖ'«®áÄiêÝÂœ1a\M8E;‘˜ÌF7ËS¢Ø¼,£zë´a d'jxO¦ì[•K %ã]&öÚøèæCý/,põxùß™ïûoŽ¯ÍüËîxØ¿ýx}Üîw'ƒ¿î9“¹¿ùü¡{{ØÜüˉ{Õݺ{\‚6ƒþ·$JÏþ]ù ß6·÷ç ?íÛ_¼áý÷by¼:lv÷ïö‡ÛÓר«˜Ôíî}ޞȌ«Øß8wÕ±;<ŒâÅþv³ýⱑgÚ—×›#äz²‹»ÆåßÎ0ž_ãzz®?Ò¦ûó‡Íñ7'™¿!þPwžiýý®Û]^ïïŠÈå]w½}·½næfúóyປíív·9|.Òú´¹½»éúÿöMk.¶7Ý©=ÍÿwØ÷¿ÎØ^u7}`°†×û7ƒ-ÿf÷8 endstream endobj 178 0 obj << /Type /ObjStm /N 100 /First 861 /Length 1173 /Filter /FlateDecode >> stream xÚV]oÛ6}÷¯àcú‘Ii( lËÖè°¢iߌÌddÉÕÇPï×ï\I¶eóÚCûH÷ãœ{yIY:'!].t*d¦DF-¤´xâÏäx:üÁŸ'B)Är)TJv*”#Û•¥+™gBqbC,QBgÀ$ZhÄTbEj‘›8a$â2†ò¤ÆX³‘ÿ¡™Îë8vGÈÕÐ7”3ÔmSU ÉÕŒˆï¾mÃëPù–aº‹8þÀémÚÝÚWï¶åsë÷.¯»Å%¶XäÁŒo^ß×ÞïC]ôÇ#»#äÝ°Ùâ¼Où³ñaæ»`ºRŸÖˆ××kz”ds ãŽ:°í-†nK¡ÿ)øõ> ºE„9_UÕÐ}¿Çm†bã)ÊŒ#ø3š¥‡!ziCàNYSfƒˆ0èÏ¡;ÖŸ ¾¾âΩßl«Q÷æ…þ3{^¿ôeUþ»ø¨þ0>[5.øjùëäÄß e#æ»`6˜ñu(Ûñ³ÑíwÇÂÿÚùóctäN}ôúxÓl©+_=¾¹¾Ê&›F<^W3˜»`®E2x’°Û_L$ÂÁ&:Ÿí™/ÞÎM1ЈSsþ U³¥Œýþ?:˜¯Òv×–¯ßÏû®Âþ{ùM·MW/Ñ…ÍÔYÏ¿Žú]5ùtOH endstream endobj 395 0 obj << /Length 3789 /Filter /FlateDecode >> stream xÚµَܸñÝ_1yŠp+’(êاx'^l²Æz€$ðîƒFbw3VKÏ~}ê¢ZRk¼ëÁC²X$‹UźÔá]á]Ý¥™ò3•Þ•çA»ãw~úË‹Pðö€¸Ÿa~}ÿâO¯µ¾ ?òðîþ0ß꾺{ï}s*.ƒév{¥”~µÛDZöÞ4»(ó†®Ýí¡­Ær°m(Aœi/Üýrÿý‹ïî§Su¤}«ßI¢Ã¾¡3:S? uìèŒ?ÀÒîö:QÞ›]è5;2qÐ:…õUƒ; ÞrÙáÇ ÝÆ4ïÊö‚÷Ì<Ûs[4ܶ…‡½ KûsÆeÁ\À™áT Ø˽Êà\cÜNÜ ¬6Ü?´ÝÙaÃA@²ôå3Èán«b(£:¸Ýع͇¯‰÷ •êïÕ™ `  ¶fvdsvèÔOƒVÓª~€ë”€E^¹Ó¡×6CGmÍÀ Šè¶˜›‡¾ºîös ƒwß´oùx¸1wúSÛ 0¾Ä=ÏúƧnH·ŒK×»â,ƒ¢“ ¡W’l óÀ²àÁâΦ"¶ìÃ8÷ƒ [rÇâr…3[LQ ƒAä®qa<.t*âGüбwn fê-n¤™Ÿ§Êmãïö©Î½û“á³-m¢DÆЮuQ‰.*2´9Ðz ãQê}´•lTpS¶çs+÷²ÂƒîP”†Wò™÷q§ mÇ^F~ ÏlÁ ¦„.]uH'8ábkQx ­ õ<¶½¶«œñ@l{{¾Ôöð$Г±ãN¤ôd}"*Œý<Ž¤ÄUÎ$}kz{llsDUIéÖÐô 7ý0Ç=+’ÂAgN&Oå´CCnîD _áÃV¦»>^Æy’z-lzôø¢„TÜ À‡Ž¤Æ¨ýgvr“eKûUÆé©\y&…£i€/Ìï(…¥MŶÔ3Ni*Ó ¬¯¨ŸzÛã#cȹ@ žxз£ÛŒIÑݲ[´S]?øH§öþJêöH b6uŒö(<Ã~ÙŽµlÙ>ô¦ûˆkÌÂ0ñ•˜÷QÁÓé©7IõÔëʼnÂï«"p¡ƒZAëy\éÍ ŸP½œZ™²¨ä¾@'£sÑØˈ[£9>:";³e^QµTª½Ú:ô<¢óTšx}q6 ú`‘ÕÃWŽ–BPy–—ýQ°$4²×alèeô¾ï³@uN>1®÷À¼£±¨ë'>­?ÌšbYÔ­K…áô:¡k›Ë8p—TÝ'WXíaRMœ­Úsa›žß9iÉëþ4L€Ò\‡Ç4ƒó6ELJ¤d ;ÝÓã î„7EÔ:õþ±Ë”gÜ>¨o·êUÔ=Ù95©!?k5yêµ½ÎMŒ§w‚ƒÎÔÒc»-tJ€–¦kØ GΡfðý‰Q=Y‡g†$(û?½©¦£¶DƒÚ‡)ûŠ0aUCP ÜñþMÆÆ7¯µ}è@Èj…É\”èÞîØÖARïíÛÓíjûÚyl%vÁÃÉÊ–Wß›Êuîºq§gNb~à‘¶8¾Z€ ö,s3Š£<ô@5èù±òѼ™¼ü@äJ6ôŒi‚4ÒÙûÆN–±6 N(¬{=DÃ}’½–þzC­„0Ĥ€µ-bŒoè®ìÂ)4ãÈh@ë'±ÐØP€IzÁáÓ¹¸ „ZÖÇ~¶MŒ&­(ÂŽc&ž_¡Y/—:Ny‹+öÆ~Óþá´‚°¿6Ø︽Ì8dgL KaMµ ÉÝ(4à¤zjÝ‚‡ÎØelÈnˆBY9NbòÀ;0…nIiÚóæͦx„^³J’™ž¢ÙJ4‡90A¦6çI“hæÀì"-%ÒЖÅëaÊõâÛÙöf¹Ã*&¤ã{F0zôâÁÖvÛE'ofEß›3b‘z¨gÄzp²‚9'Hˆ#Œ;°3ÒíFˆ1¾âô"‰çéÅ^ûyž/ƒd0éV*1~IE¾c`Ò1lËÒçR! | ·ðl{Ï['@š‡Sêg¶W¦¹<õFKb–±mN)¢«Í`xt£BeôekÝAÛHľŠ–jÏú¬àá·ûù\ ï­‰åÕÖ­X¬¦[s&Lyî£s—oæÀqâkÍs`Îô,Óhm% žÛ3Nliæ3‰sJ=Ù,û tãŒ9_¦¯Äü¬hŒì»Î lV!§ ×r?IVYòd^Ùùm© èÕÿ ƒoç>ßövy"ðu21ó#D…VDâ)·Nщ.q9~•GRFÀƒP$%"˜Õõ >×øƒ''7A£•#e;Ɇ‰2'î=ÚºvVL&C¯>œUvƒ’¬sî‘uò³Ê’ÕÂÓ)µvmJ,1Ì:óŸñê‹0óÞ¬Wá GÚm="ˆÃ»ÿ§ŒÕ32Ë]Ë$,c¥©\¦Í'ûŒœèêi$¦é§›‰°/“°±<1¬,4g 3†ò`ì•æ— Úô²ö‘Ìö#þnWôÓA™†~%ÐÉý0ʘÀWè¼äµòÎü [õË«É<2O4UeªM·cÓ Çöû„õjf™²ØcUâÁÕÒ¬óp/¡€%Xæ)FYê.€9ô½/bìIV™È'c™IQPå €ÿØ ­`þóo?,Ïø憯ªº³âΉµý°s.š_óLŒ 0g%DŽ4zó²d«åééÛX¦,¦©{6fàƒN0¬Á" l3´ƒ¤í0à²NêI nÊÖ¬v(JòhTSI€<5Ÿ»#}ª—<_vª¤ÎS»Ê7åYÎÎŒ“- &B(¿Éí.ôfÒÅIëÚFÙº¹uœ…Kš•‡¡w"må(S_¦UgÐ MáÞõäkÎÁšŠTrùT`„±6bMrŠÜÉ0⧎L_¹õ£ˆa&ÓDÇAû0˜P +¸ê¿f5æJˆ–Ò(Ñ2Y'§½yÑ-${¯Þ¾á:­ «¾žLë݆–3éQ|£ŽzÆDLëãÉNH„…Ù²+ t#z´>ñ`:Ã}ÑÀ¾KP±Ï׎â+&}Р 2NM4®¯ou©7¨;¹$Ò@hæžRc€Ž •›c—¹`Gq ‡q;I\öõ»oyVÖó€*FyüŒÚçó¢¦-“)¬yö@¡:Þ =î<ëÈn&êl·¡‡¥|R£4UŠÖåÅÑõC¿¶KƒC1˜‘XA¬Š]u4I°"Q,ªJÅÙÕrLDQ¡’oœe³7™á‡Ž¾ì¬8"YÄ5 u-•l ð¡³øIL#6$ÐWÌbP%;œ~´ 7›-¢ î ¨ƒ,&šŠePÅWÅ›¬ªpr÷ xþØåØÍjôiàªPP ÆgÞZœ&k3 g&`À);A*bKð¢I#úiˆûë±Àz vb]®¶qy¹“yC fÇë*Oš¸*+KÓ™—³›EWm*âù\ZâÔÅ´q2‹Ab¬ùMÄ…ÞZîAÃ(ö ;¸°ú(œCGü»}‹µ5°¨¯¥&kK„Žš¼IÏ(\;†©Æ +f«s¢‰`|–¿šç-ä2ZQhu}îݟرçÑEE#øPè¸5øvuɹâ5'™¦lÇ®8º¸i ~ŒÃXÝ,ãb3¶㱧KaýÉô/7«¨lIˆ eÊg)Â:P?¾b[‹„ÍÌ+*æò]!J\dskF6Ÿœ1´ø}©ç¥t ˜•úVxã't.@‹Èbm¹n3ÿ…@Ý…I惰èǾ°äð/ŒèWKÈú ³µü‹†dõ‹‡Àô | mV-žxm»~@íèE™¸Á¢p‹€ž7y(ÈÄ~8â§ù|˜ST@-hƒÎº„~cJ!Éy> stream xÚ3T0BCs#s c= cs…ä\.°hQº„äÎeUgbj¬gjb dcUWN" endstream endobj 403 0 obj << /Length 3182 /Filter /FlateDecode >> stream xÚµÙrÜÆñ]_Aç%Ø„„€Á-Wd'Ž•”#—¢ªT*ÎÃîN„c3ÀR¢¿>} Ž%ç,>`Žžžž¾»—ñMñM¡nŠ2 ˤ¸©»­ºã ÞýöE,pwx·‚üêý‹—ßdÙM…UTÅ7ïÖ¨Þ77 ¾>éódÜá.I’@½:Ü¥i|Pe0´O'Ó8ÝòÞ;svf4=nMz²Cëi0<ðþ÷n8:݇»¸,’(H}ÿ»¿y?—©,ÌÒä_|‰‡~öœžS„*ÎRÿ•‡Îð9êp—å@Ì!Q›Ùò€$^ëôøκ¯¹ÝÜ©2¬Š˜oyƒGJ<T žhgxàŒnlÄI艧“ì¾=W`ú?ÖÙ—š–êK·fï-lVÞQÎwœÝp¯ïÛ'ÆÝâ`è>ñ¬7¦J‹™OçV÷ü^x>%NÂ8“§è{º{¸â$:U’L抇¸Ût¤¶Ó† -± ÞL|ÂŽ té[û)0H(îL'-0ãЙ¡—+>ÚVð"Ë<(£ô™.2x§c¸{yîwvœ4ß#„|;àì#-á¡G¹½g#ÌßG[Ûá2â$tóhÇÁñN§=a¢Ç  ² ,"*ùPr=Z„_Z–¥qýørœ.Èvä³ÓÀðDíà>ðꃿ›Õöå BÅQœºqÚ¼ˆ4YzPjOz 'qÅ|ªíÄ ³i8Û:D;‰‚ï†qbhæ6^5®Ñ¨€…°±%ÔCw¶ílD¨ü ‹BÀI»Æ_Å_/Þ˜UÁ¯Íx¶“Ù“IçÙ jà¥Éà¦ñ–çE¥Á›8˜~ÐOµ9{º®'ö‡–>ð²Vœy´†•Ä¨9i|kúZоa¨£}=",'ã¯Õ¼Ò Þ—?Í—í¼ ŒQ=ÚQdŠPdqP“1uga]œü ‡:Ò`!"‹7–LxÈseÞ·Ä3›ÅÝn¶Wž´Ó‰Ì}st´?zêú† (VÖ[ÛÙiÜQ=4„ºÕãhk7ÐçjW#ª̆íB§a•¦€2ÓD1ί Ãjô°$,‘{*Î$IĆÈ+ÜyQÁ‰{"xµ}éôÄïò..·Uíg.îVPyù§žŽÌ?÷žåæï;‚zü²»ùi+uøó¼29tà΢h÷ÃäY¦·¤&àÚ–½›hv|Du±­µ„ Ä:‘gÅu{ì'H> çpÕ¯8Ìåé:ÌAˆK3„P vXìEÄX…9¬DE$_ƒT!=Û…e\z –!ÅE ²úqr—Ú7Ð-IÇ×<=Ï9Î~ˆ²hŽ8Wð.G3ì>'bŸ‘1®oM‚oPß¾;”iðþÝë?lô! Þþž¿“œþè‰o÷Ø|§àÙYÅ*¯Êüßât/0åùq¦f@•“¿ÌJôî€ÞŒrè÷.(@ìÉüø}Šã(‹4ÿ(Þ#x£ ¬§Ï¨HªªøçäeQa²HÔeÿ[ê:=9ûiS‡±ú)ÊTéðÿ‡oLÙÝŠ}$ñìÒ¯½[¢,LÕlÞS)x ä·wqfy±ÊsU´r.*¦lÙ]ÁàC/yÍ ¸Œ†!Á~14S W`­­Ñ¼ÍH$,ð&JÀ»kÔ3Ƚ&€𹕄††y¼æSàv<0¿jã*ç°R§†SAØ0ýp9žnÅ¡<:³ vÉâý[HPää4»ÙÆŒä‰l¢8öNPü}#dèÙÕÆM#C§Æ¡/XªX¥a’æj©PDê 0Æ OßQ8› ‘ȱðJJ$ö˜ ;;Tvt?‚›îêse¨G¬J¾ä5Nó ±ÎÔ)™ú2QCv‰¯TWX\²èlR¯GÞmré°­ýeÞ«ÎGÒÊ>8§¥ñ·ï¨§Bët4ô©''=Ï:ŽÄêJ„ô.€âT ü‹•HîÓ)oZôg´+Mh+·>8#txâ:Ácžö CFåTä…ÜŽ7D‰IlIó´Ó-LFþÚN©§˜¦jnãgY0ðYò¸€ù,BëÞC^û@:FÁ—á1aL‰zz!W™ ãjV·íú ì‚ØÆÿD3Û÷³Ž¶}ôdºUŸ]§Ñ p?»Ô0‹ _í%%PSUµíÍ}:à¯3Á¯ø£ùóKþܹ÷„§Í‰zs¢ùrGz?î]ñ‹õ×.O—Y¶¥ôÍÄ=[v—ŽôøÄ£¹-l¤­ë‹¶%ÁfœD¾‹@lƒøD…ΟÎûH¼|´ú=†Ñ—ŒýÂÜ…‰oÖ‚â‹XùºÏv¡æ{·õÈyVÔ‡`´!‹—°»(œ™TGkþø<]Ú©ì´`ÐXœŒ»¾¡ð70:,|Ð+|ej-yÅÙÝäëvˆh«_~›Séb5ÔJÈðqh/\®òsø‚[s§X¥ ¼ÿ…&Òb˜·é×''kϪ|¯éê5!$;º/¬Røë¥BUáCÅ4ñμÀ\Ú« âêêº5”]5o³¢ovÍ9 Ë%ÀÞMîä: }Ž8¡¨ƒTp$Ÿó *¿ªxmåñ«>Žù—@\©)â$áà^­¥J‰³<̳|ËÞMsø×ðc6&(`·òMªæûWQEy!Ñ°—µÅ.Óõoº¯†Ž—;Cu1Ñì¦9βuOÒnG/©ò0‰f–7zB ÌsìBÓDø“ ”O’·ø&ÖuÜâ¥ô–ÅaV̵é´iôˆ™n~›£ƒpwšÿCàÚŸà?¸98ÙQúeØ®Ù'wJ…ò_”Ÿˆô}ùr³KúDû2GcÄüX‚CÔgü‚{ Æé¢ÁÏ×O‡¶ýH•oYð'Ld0Eˆ+:8Ð-6q×¢hRå#®Zÿù+Åã8ZrÚ¸4 wéýi¿#9I\=sug…†3ä“ Á-ÏPÇ×·<ñ²ï#ì¨3Æĸ¥é)ýUOAt°„ÊÚdÎ@q>—%8ÁŸBmm[Žˆj,ø³©›R°/‰(÷ÍËÁ- òŸ+ÿû›<« endstream endobj 407 0 obj << /Length 1904 /Filter /FlateDecode >> stream xÚÍXÝoÛ6Ï_`/òV«ú–¼a°¬6¬Xü¶î‘蘨>\Rnâûßw_’,OR †!yäïNw¿;:¼à/¼Î£ë¼ˆý"ίËæ* ª½¿æÉï?]…rn ×g'Ø^½¼IÓë0ð7Á&¼ÞîÎEm«ë?¼dµŽÒ( ¼ß0+<ÝÞ®B¯\­C¯JÇÞ-îäžFZiÞaRªÞt-襁âÉ/æÎ*{Zý¹ýùêÇí¨÷Ó$~¦ÃégXe~&l…²å ”ß›^—ýÑ‚ªñ&÷ŒãQÝÕBé;m¥­ëAwµÎâÔ»Y‰×Yákq«Ô/Vë$Œ½-JÕŠ'”Ño¿¾EB6ÞQiWZsÇ»L:(«êZ×Æ5è&0yÆ~˜†lÅ» ú=i þä1+E|¬ œQÌœ‘ùI‘‚0rX¥!øƒþ׫5 xá'ÓÞ ïÌ‘YNÌÞÞªÖí:ÛÐ÷uÂo…);gZ‡Aáç |®Ç”™¿:Xuߨ~C¯k<L敃Ï’ÝÌzfÿ‹haî‡E8w˲`µäGú {~Ç#³~σHü†‡»ïˆk=c/Ýò|µžÔJ$fj•3µªg«õåœ%;Ÿ–¼õõs½µž}ʳËÄØ,˜^w˜tCæ…ÞGšYÌÈ òú=&TQxÖÜïq§ç%œ‡lG‰ ”‹0v‡Þ4æqm€ ŽÒ ÛÝ[Õð9&H¼Ô)Jجª€‘ôécÞ• ï'…u+·ïµ®w;ñNâo’dî8/B±Ö|8jÈ”flž†±·G-”Ý íßû2ßÀ1eïuÏó|ê^‰DG&5B®ÁU½âíuy·ƒ%Ä©3 Q÷vP«4ûžIðu¬ãéh1ù)Õ0Ž¸‡‹rº4ÝQ¸ú½êy&Þ[h2£<öÓ4:ÅVcƒIÿª¥HŒ? ¦¾R”ûK^JéusM•”*ñC´)ü ‹/ê%QºŒ#¤Íq«¶ÔÉBÌ1•*éFÌER/уósé梾däʉ¤nâÎQ•qe7}K™tìïÕ /‡Ö”z±tî@æ&šÊ+D–™ ðŒÂL‡4ö#:›v&‘½8J0Z£«A¨ÔD\L± ÁœbðÕúS6¹Îñ)“V³ÀxÔV’xŠx»;Ör'—ÒJ×KæŽïÈ¡¹¨¹Ú¾¼É!²?N²# ØâÐ/‚˜Ù"?‚\Êb„¹ö=¾rÖq.-FžxoW ù`KŠZlü0Ú°¸[CF&QÈFâ„^¶´Â÷¯Å(Á§'¤6¦I<ñ†m[š(òìT˜Xî ÀàC>t#ŽSj47©´›qžÓsL²íÕ*‚vÆõü,QÕxãÝžÚ^=r6 çH³]å¹gǬ֋YøÉf¼‡šñ€_ÍE潺Ýú8˽7-SÜ‘S™©V¬ž™,´:?6«,,G$„•u|Hj ìuœß@¼»ÍŽ©Fdákà 4 ÄfJ,È8èÙ4TQúJ£?+=¸WÑè˜ò¥î¨¿$jëL¥y®øÀXq0i1ËàZ®Öçb/§®œ×Ô<²ZaÒVùt¼• ÁkõIžý—É&™- 7ƒ:'ýc–œùjq:ï+àÞ|)HÂÈÏÒñçˆ7䔌Õ'‹ÒéÉ… 2ääÌ°5ƒL;ñË Â›œŽ?аüÔ$‰7§‚ÇÐb)+6þ&øÒô“‰n+·dNøE8fï£Ö]?~{yqáIÇŸãrg‰†ad|Ía”`NK¨)úÕ _¸NÆê„s§™5ºéì‰çµX¨ ¤¢óÔ&\Öƒ¡÷ 6¹<‚C”H‰AŸÑröÓ¨¤ã‘ž¿L“Øpõ†1“7ö†Y8Ï•hø!ù§¸ŠKîZ=tOx¤ˆRÁhB®þø¤I‚5øÌ‚Æ‹ŸiEÏ5ÄÌøôí¥–ˆ endstream endobj 410 0 obj << /Length 3205 /Filter /FlateDecode >> stream xÚ­Z_“Û¶÷§¸ÉKu“M %̓›Æ™tÒ6ß›“žY°)R%)ŸïÛw»Ad»3›9 °X,vû‡79ü‰UÜ(]fºT7Ûã‹Üïn¨ñûÏ/Ï[ÃÄu4óo÷/^¾®ª‘g›|#nî÷1©ûÝÍÛÕ‡æ4™áv]–åªøîv-eµúí¶Ð«¾}:˜ÝдôîwsÌh:|55“í;—«~OïúwCso×B«2_U·ÞÿãÅO÷¹ª¨²J–_y?ûÙqjGCSVpª:Ë+IGú# 7¿<º(²FršõËgùªµG;Ô>Ѩ3 M7îûáȇun×…Zõ·ðïa†ìv]+¹úµ‡7 ³Sj-SÇ—nM3a²#ÔY¶4d>­ñ ÀíZ”™¨qm¶gG·-7«×·º\õx{½²Ðé¶æ)T«Ç«Ù6çÑà„Íj:˜'šºvgxaÓ¶ÔÀË[-yÁaóÉoËó§@×5GnMöûnjߑîÀD`z×`ç‰: w'šÝyËŠƒÛþx²­Fê6ƒ¡F×3‰æ¡å¡©ç‘-=XóÑ] ¶óÕ`wÃäU>Üqt—f͸$x4Ã;“º:zQ/¨$tèÑiˆLr6Ï ÙrŠÓ_¬AcvO¤Ò[Ô~‹ó­Xu»Ë üšÏìDý“4¡ªJÒ£.ŠæÉIq¼ÃµBAýeL c°;»=·ýÙ"#Û[Úéšo-T–‹â5ÔR¨`¨Ø†ŠcÓÙÓ¹õ˜$yQ™OöÁ¶v"5ƒ»“‘`2÷ØŒaJ¤VÐ •ž¨7ØwvGÍ]35D–ÌcÁƒžžO‚5(&†R}n¦Ÿ‰Âé—Ð ¬àNIáQ”g]"[ÁvƒóŸ³Å=±óQÉ{h=­ù”"4¦Úvx´Ú-x¢Á1'j½rƒåÖã¾!O HÈP€ÆýгÁ«!ützr³®á®ë›u!2%kâåµXÊÍ3?$¥^ý“÷7Ü·#ÍmèÁÒmvvÆTœÒ‚§ë€e¸~~M¿†ãëíè±÷`;ã7ìšöi´$͵àˆäó ¼%š-IÃ%}Â-Gf¢U QåTöî@C×4¹R‚Ä„“@8n“Ä?µú@D,Sµ=Ó|à1 ˜´m`d‹Ší= Ó@êMSáVêr Þ¾Ì+¯<Ð2‘A—§§É™'xî›#œ¨áÑG;œuVdì0ÄšÍÓÇÞùh!,Á9Z†KÜDTöÃäYééI(É«FVÚÞ©&ètâD³)îîȽ=œc` Âs‡{ÉÎNÆ™ŒÂÓÁOD¿œ—t éùÐŒfGMò=xBÔ<6–A{·æ4w ‹:†ÅRåY]o<.Z Û*¸7ÖÙAÝ‘J@ªÚdÔ“—&ɯe•g•(: kJZhÕ~5Ân!+ÎCPçøßqlj+ƒ¬²M!0aǧBdB…­úÎ$UEdå&˜sH5 )ª;vç< |5zÁ\ ë8ã"…¡þ<¡i)Sˆci˜rhFÞ¨sîZ†Þ…S»aZ~1úÑË¢È*µ4 Ûñ¦àwAw.WGçg}âͬи¡eÄZ­~5ìÏLƹk‘ ˆUo‰Õ@ï ÑÐÍ^  m½æÍ®—ç"c@§KÔßo_ÌÁ„Õ !"ÌËLiñÜ#,(Ø Jð¦H¸ª^|—"º a¤sa@Ÿì-–V?ÐîJ~Ѷëù’ƈõ‹pÝ ¾Å cI#ÿžž<úWzT~ôÛo]|‚$™ë…Š¼zkÿ\;YXYë"b()Ä´Rðéb\BHlí8-K2—6áü )5‡ìvü²ÄÓ?z …)ïÏ#{Ü íÅп§7ûsë3‡sn¤½Øf6CôEò6AdSƒ/Þe"š{õ6.âçWüê­øü´@®øÊyå×m+“ÓžÝwJ?5!O×"F)ÓÍkáÐNçK¼¤¡(­qËG6ݶí9F3†Á›††U”|NCñÝkÛÁìÍ0xJþ N¹¼C ®«ÀÓõ´ `Û¥ bC›*ÚT`væ8É…`u³Ò¾§ˆ#Þ9X[”y¦ê€@TÇpõ‚_X]]A³þ¾Ϝ:ÆNg?º„œÚQÁ f^@«køéC_/ ðöu^/ÕŒ®Y1?Ðð2Óz!3­/e¦C¹B«ø5×àÖà \¬ðñè-xEì›fGó=W#Õ RÚ:Ì7oŠo’!AM='+ÛN¡I(þÌ_8^Wæ,4&¨‚Í"P¡}ø /ºžü$Ø€Õì‚è{Æ¡†À°^Qz.Æâ^ËsÞ4qÀC(¶wXá6s'SÅWŽƒ¯gn³ØdbäIèƒ@ûÁìX©jX5Gç{ªOíJt³-’‚I¬Ðš¶wô̧«KÔi’±¨•Ky–_/OU‚g³¼ßÑ4]2¬ëLåa]ûÂÂZ‘JÖu$§XÍ!SPÏ‚%œTq𱘳$¤!0„ìâ*Êä±eL•ýËžåJ¥¦‚žRéLˆ¥1¼)¯ÄbõfÆDL:6*Â~ìyìÇö"&Ä8 Å¾Ëvp‘Kªfh½‹Ê =‹%Á˜Î6ó 8PG@;öi,ö¥º]‰$E.3˜ãi½¿¶[ïf»îênwSóÝð§ŸþÜî|PfP—ÅxwQVòÞdåu`ôMé¹{ÍDÀAÍÈyÇ%ŽË#Ç]}çk¸T倔£˜ ºæÖÍWÉÅ %²"WÉಢœS ‰²>õp à€³ˆÔÀuÉ;G ÷°nèÔ™íù®c"<«§-Âìè®âÙ!à^†bVõ²¬CQÛH1Q–¨ÁT:ŽÂÇΚcÝíìY™’Y5§²hÎ-‚Wô‰®Dã ’sq‘ËäÌÌk\ßÓõ¯‚O‘©oÓö_e¢‘ý'{a×r‰ÙwtÀ+Ì‹’Å•ünÉÜÄÂH2 iÞŒcŸõÔ Í ™Eáó²Ò)æÔÔ™÷•3”@I¨/&»õìY-ãIÚ㉋ø® ¶¸5?ééêØèú›©#S:aÚ²m8zU,˜–V±ª‚-½¢M2°^kGî èFf˜¢ÇðõØj]ÔEVÔË0ÿ A +T¸·q îüU…³J_¶“¯#ø.sÛEAçj’œÒµJÅåê«Ê‹­Ë2eHxÙ¦oÅÊÿnâ”Ô—éK5WPQTÅgU\ÌwI*.6YYèeêøï—°c ׺ “sn˜²4-WˆŠP å6J€8 È‹E º;ÒIߥÊÐÀ  [eð8zYñâoíð&  ÝøFì¥@GåêµÆé:Ðs*Ê?zî;‹q_Huì·Ý›¶bÒŸJÜ¢ÞÇ—îûŒË ù]t|?‰£ ix‡y½$LÁ·£ p¹oÄ#gŠ©ŸMx®J©|åZîë½T,lh|èøG)®7›‡TsEzzqyRyé`³ð#4²3ÿªDªØj\/¬#z—#©¥©8ú¹¬”øÊäŠ4{-ýž£d•€Ëv§ vŽFÐLþ»²ûqO·Gñ*$AØýáyâè?R›KûWiû‡ ú¢gìßB/£ÒF`®¸mvéÚe ÉÜ&X¬üb ²¸¨Aò𿾲¹ ü>Iù}šòûÿCy³ô¿û/f¨éÚ endstream endobj 412 0 obj << /Type /XObject /Subtype /Form /FormType 1 /PTEX.FileName (./images/basic1.pdf) /PTEX.PageNumber 1 /PTEX.InfoDict 413 0 R /BBox [0 0 347 303] /Resources << /ProcSet [ /PDF /Text ] /ExtGState << /R7 414 0 R >>/Font << /R10 415 0 R/R8 416 0 R>> >> /Length 1701 /Filter /FlateDecode >> stream xœÝZM‹7½ëWèÇ°³­n©? Î!&¼;ƒñi¯³ììü÷£zõ¡Òì\|ë fgJªzUOR«T÷—8RèŸ|?œÂíÝÿ Ãa)±}|} Û¶EúKy-õ#ñë_áÓë0ÄÇ–9CyqɇjÓ’§C5ßJ®rÚ <„4oU/ÝóâìѨ~ȦŠiW@²8‚T­$€(fQJDò}Üâ¸Äôñ1äC‰ßBŠoï~Ûù>‡ûò` !jÄim §b §©1œ’·OÆD '&BŽ”¡`…6ˆRÂï› ¦Ð'•Õ¥†ÐBO©4€¥Ú@”!ª½Æ…Pz>ÙsfO4‡ûfhÏ¡RdY(*‹†õaŽÍ eýèzJ[kó!Lyª¬õ=m&¯€f{&)!èŠ[¦ÐÌ!‚[qô—°%+®™Ë2™¤nÅ9çä†h”Ü3¹[†6‰’z ªGñ@Ñp~Ͻ¥Y«•°S¬ù’šu”¸ð‡ëiiq¯ÜhâÆ4*9Åá˜#7‹²‡b 9“³Gn!j8 , C À m¥„ÙÛ7ALa^!D˜çÆ0OÆ0§ÆpÚœ=ÌD '&BŽ”¡Åê!«ŸÂ]´)”\-2çUó@I—]s®¶˜P€B¸QMI¼¡̾8W[V¬²fw¤\MÛÔÊ“e ªÏ4èàažº X197JÛ8T! _ÂSƒ@Áá׶qÜt^M.8~¤’`YN}=P ¦—JBH(p P7J»hY ”ð%•„aÅì Æ‹Ï™+ ÙêG)'  ¡Á¥ž8c•‡¶ì\pñ²Ÿ±šĆ¤Å›µ´eg_¼ì=+ß1Ÿºsß41%•%ß‘¾N­= ‡lå0©u@÷‚/nѲå3U=xt¾ÉZÚe€O‹Ó%´ô+1w¼yÊÿ'C¡eù†8 ÓP‡Ao<‡©B›Õsµç9ÑrÒp×a…øÌâTŒg6x).3½p°i/Ã>‡?_ÇÂûø¡FúX¿ d3rNX6…܇w]à3g.ûÅ ìs‹ßØïwÀ¿g> è‰Ešˆê¬úñ"ô"†9ó`óÁ¯ct31<.¤sãœ;u&¾Ç´ÍœFêÎ' n©s%Cä?T¤¾äR7ë¯Üz¯0ó—Šû@Qx" UÌ/ußã­îå QŒ/uSá‘´[Žm1¿¬¨Ô7ÜÏe“.*ê`‡¶ŠœzpYA‡· ‹E\TÈtÊ/5zëmÓùBÁ='4Íà¥BrNëo ðBqör‘w‹-_>5‹¼Kuaõ¹ç“ÅU ªàW–¾>Ö-›X–¯‡Süånï(ÿª¯5?~¯+Årȱže[<žÂ«ôãñ‰öûë‘Zõ¾p³ hC{“·ºÆ…»ž¨k-µçF»€º½«±]´›Tƒ×2¸ÀäïŸßˆUGéf™ÉQf£?È‚¦ó¦ ×Y]]ŒVVp4£ŸÞ9OÕû OÒ™ê•æø{m©¯ǚYÞ…ÿÂ>z, endstream endobj 419 0 obj << /Filter /FlateDecode /Subtype /Type1C /Length 763 >> stream xœmP]lKaþ¾µgß 59¢cúÌÏŒÄæ¯Éü5æÂ_§gu´=§éN§íÚmÝ‚%_YYÖD7u1¿ñ³ÄÂ…"YH„q…‰àêûêôÂÁoÞç}Ÿ÷yÿ 0¡©Vò‰ ŠÏ)Æ¥ldÓ X‰a­&çêrV®XÛÇŽ#&1ûs·&Ñ'éÝñth0@xùÁK›â$÷ÏÝWZºàofIee%®ÿfp•Ø(¹e–Nôs6ÙgÉGÄÚh;t8눑(‰ŸŒô‡³±T3áÕp$èTïÑ‚#t¦egÎúŸYìÑ@\`Iá†Q~Ô٫жåuãt’]Ž ÏP¾‚ncºq:Lj®é5 ÓâaÈ.²)B>QÃ…Z±ñ(bd„eŸCúá­)´DhI68ZÚ÷³ÖQHWѪwoŒWæ/+^Ϊ­ îo˜á‘¢žHUÿ‘©ƒŸ¯^zJø×÷ËWï^´¼Ü¢Uk[¹VVŒŠõ±}´¶¯ð˜7c/t›LoΘÆðñ [& endstream endobj 420 0 obj << /Filter /FlateDecode /Subtype /Type1C /Length 698 >> stream xœeïKSaÇŸëôÞKÎeÆ É÷M¢X9%Š8-èǨ5µ²t[›ww¿îÚ›ËR£ðI3ui%®ÜPÒ) ±…EhP„XFÐ ÿ†Èç¹]_´û"zÑ»s¾çœÏ÷{ž‚È4rn›p¨–wYå¶ï'p^ÎW¤Vñœx"#T?fA¥*Ó§ÄÆtoºµufAý:Þòq¬ÝÏ7šJJKþSʵZ-c ý0u6c=LQªØ\¼×móø1ºÔ¶ËÅ]eXWÈk³Õj³Êgf—ÍÉç\œ×˘b] S¡Ñ”ë9·¥]` ¼Ûìaô¼–9ÍÈñÿ—zÎQ^@8 N°©·A:hÓD6Ñ@,ýîR‰m0&’1âgë’ Ô)Vª%ÖGFàD×k½ã¡ ¡ëzmíCÁU=š„_h\Dáó;/3fð WÆÇ?…é˜äôQ_û&°Ž–V)š…Oqed•ë¨P¬Ø¬–Œ™ìíZZ¢ ¥¯÷ÊMZ@½QÊ>Ôý.Òõx[m²ÛÍ-qG29O&¸S¡ mI­³øWTfPÖŠŒ—q-ùöÎX74É1»üŽŽÃá¡Ááá‚ð“ûa˜~î:Û|>öìªåÇúòô›™‚ɹ‘Eøž®ëÕ&.å4çx•X˜O$ì²¾ £â¾ô¨X>‹ujiH"2®Q£ƒ#ƒƒÓáØð8¤cÛ/î¨)¨ v÷ÓÎŒRšÎÇð×(‚rñDhå)°±jôèºo€´TJ¢£èð÷…5¸™»]½)‹ÍAÖ^`µ9¾†ž!g?¼˜y“0ÞñŒ ŒðÐ[;ŒÎKªìf©HÒÐ~|„R#ØAM2¾ 1™ñ¸R‰˜)e`ô4I endstream endobj 423 0 obj << /Length 3133 /Filter /FlateDecode >> stream xÚµkoÜÆñ»ÅõÕê6Ü7é6Aã¤iR*Z Цè;JGûŽ”IžýûÎììòu{’l¨0à[gggfçMñU ÿøÊŠ•Í$ˤ]m¯RmoW´øç__q·ÄõóÍõ«¯~ÐzÅS–§9_]ßLI]oWÿNÌÅZh¡Óäïw°Ê’²~{Á“ÍÅš' @¤”É[|c“a›ê×”«MÑWMMo‹zK‹Ÿ«wmÑ>\üçúo¯þr=ðÄ™Vò™ìgH! Kµ")Þ7Àü9±I?&Ù7N"Ã$UGo»¢Ú¤oòÎËœÃAÙô .8xsÇÜ]hž­ûÿPömµñ{fÌiÎ$@üž×køUOgnË çmGR¤M~MuZx¬}Yt=øL OZ'ÅþXÒã¦ØïËmÀˆ0/RÎxªÎp_¶Qæ2 [îw•W, ®Ö n'7vµæ’qÍ ÇéU©¤nzZHï[g*ŽAnmUßҺߕ´(+7GoJðØÜ,Þßïš½[jºL —y‰ÏpgGZ8þX¨äõÞSsº„›æpWí=ž:” nÄÚäDz-/\©ˆä¡ÓÁ ›zÿ€+•ÜÖPièNqî=œL 43‹I5Ël4xU2³£Q1Òmn˜1ྶ«œ^} œªÜIPlzz¸G‹ ÐÅЊñ·-ïÚ²+k|ïqÁ@<Ê„‹ªîú¢Þ”=¢Æ"išÜVŸ.œmPûò0£XuóC)PÔ WàYœE»8¸+{’“+–+5Ó8q‘ìRÀiº®z·÷ûÁö³ýŽpçUïÜ‹KøH‚¸Õ7-\¹ÍòäzWyldg"P68®‘iº5;½5)9SB†{[¸mEUÇn;ã,Ub¼nÇÊOþüMQ{ßâ‚)£ç¾õŽbØ[.]‹ ]]ù»qvšK.ݦ­ü¦-íêwEý¡£÷.àÁ¯S4½, ²iÀ0Zéytç—¸mç9 ÔVͱ#é i»¢\XÎÔǼ`ó0ˆîØÔ ™ ?\dptKÐ`¯àõš+ˆ‹=Á~×Òþ`±-ÝÞÌÛ ynaähé·"ƒ|’ ·ûVÆ®’£“8ξ?(KÀ?‘r|×6·mqðb]“Q­Ö2Ì*3ó€‰-Á–Ü Ý!¸èœ == kN€ìcãn&&+ϙʆ(™§º|ïòMDh‘1#ÍÄ~•È“7å¦8v國G˜”bàÞDn(hùwEë.aˆ ’×;¸¶½WPãBÍÍ…25îß®*ƒ{; ý€ò7•³ßW]ï#ù Åñbù˜NÅAˆ1ˆ6ÆRÇO~¿c¿9î·´5ä¢þ±ú0ᦇó:n`,óá=õ..åyÈ©‡Èˆš@c³wWáÞ–>†¯å yyB^>B^ž'ïOÓó«ài–EâW'Ì]0wõsW#sK›]O´=&S™šR{Jã©ÆËÅú €„á* xጞ»mèê¸É›¼Ã*ýglspI?å’Ú²4·ÏtIÈD¹RJ7V¿Ž£"à”efLCUŒlÎÒ1º /€Ï å-)Î$·mY ZlZÝ7vžßËǽ.Í]6¢• j`NZ¦@Ѩñ¿Ëý±ªËfLkódÕ5Ä<,#!¡àñ±Û°L¥ƒ&ÞÇuÅçšÊ“ Ú¨)_ !p¢­ó’}†f(XŠ”ÙlQ¢.ÅÕ¥£-<­-•¯Ÿ0æ‡SÆ*ce[oÕ„VÕÿö¦Ùï©J§nÀ‘‚·ð_µ \ß4íÁ‡P0Ç O*)¡sç¹wëï ‘§+>­ Ù±„f’»¼E霰ÔICc7ôFÑlF§L¨|í™R3ÓãLó¡Ý»‰ëR !ºvL¸Ù•TÓ16nzpÙV¨ =ãË‚|ƒ ‹Ø‰°”£•ÿëTEЧ(¦S5'³8®d‚åŠ+³dfF%ƒŠd¢#¡¢Ït]Åèpˆüóè\E¯U09¶qÿ‡“¿¸Pïãt¸Ê^@¨œåz0œÛhâ”p†¯}¥â ¡LS¤ƒß²èhå’$üve黢«€>M…ðÊÛ)Å‚~ pô»]uT(6G?@Àv½hÇÉ¥<)|gÔúPëË[h%îvcŒœuûÃ8NõãßÌÏÉÌË,z«ò~^%û{Hw|çTü: õ>¾‚!Œ54ºók¨D¤’,³Žë¾úéÀWß7¯þqfp'…€ˆêc a€%ß‹ “Ïzxš!›R3°Îëh3̘Z]·nè· ®:Ãgת˜|Ùðº®F&¿ìJR¿kº2Šêé¶e¬(.€Sã…ë0ÕÊw»»]øÑ’ö=¶_éj6`jìѾ°p¦¡U8.ª9ø3‡Î«Ã Gç°ôªöc6}ÚóŸéÛÕ[»™KšÅ‡ŒÊ0-ålÆØìàPXlÝ°±‰NE´뙵 ‡;C<ˆZ¹u„d*µ4­9Ç Îjµ~ý|fL:mq/Ñ ñ´Ð½â½9r¶ÑP™d_¨…¡ê¿qc8¥Û5­›ÿ²W ‰lnk?–õ¦ë«W°_pñW.œh‹3[„•ûhõÔ˜~~ççxÐ[Inæíµ›Ý`i-¡®««»ãŠ^z.è‡Ì{3Døà2<6‡LÈ6ØB¦¨j·Ô²ù­3\9W ¹º²­~ HËh‰/3dXÃÊU®edHæÜ=*ÃÇa†Ü…:{¢ªˆ]Cz¾-kw8*ŠY£†SEdΈ'~r²cùgm¹ëHñ…‹ÀIWîP%£˜ªÄœˆœ4£ô|D8&!GÀÜUl·UOù–Ô"À_ŒòBVv¾Éi4œ¦Aç“©›Ó° ðÆHEÏ.˜9;"ãÚÙCAûáÊŒšÎZ˜¶÷Ii*¸FžtÆÄÒù£?E¼Cù¥N¡æ’‘﹜U=nx:êܽöÓU4 4ˆa¨ºña¿ÝV5pîg«ñ¯ 8-³ŠÏÇÞ_R:¿òÏüÜ0Á@É,g“‡`áxî}EÃb™øÏ+žÉ"€«>fø¹…:œOmØ…§?ï–L€Òg¶ôɹ…ÓQlꟇw[A–è)G¤áêÓièsÑ8w­éÍÆSïënI_FËLOƒC ¿!\¡UuøÞññˆ¥ÛÜ¥ôöì¦ÃS²ØÖÆTµör+$²dC ˜rJ¬ê>Ú$p–åÓnCŸ±ãI—úÎ~p**TƒS¡ýÜðÐÄÓ}w(ºVæ ‡‚”9øÜHÛ¥éÓƒŒeœ+„+ϱ§1Â8E‚tŽÞ;÷¸³P×dîÓ¥ƒ}`º„ü<ìOCMí„Ÿ·ùõ™–ÛX50ãP4=ÖÅòLŒW™¦Q ºå£ ¨L™MígÚDŒt=îåb†›F'³®·ŠO&âýጢ&²E›Yè#„_&›xĺ ¤¢?ÆxˆN—“o1>4A\¨;_aNÔ3÷>&A-±(S£L -j8Ñ\δ3Åñ˜ßE„ü."ä·g¾HXeW êø¥9á3> ür?ɆZÒ¸^²4ßç’ÐÇŽ—U+<ÿ$2 endstream endobj 430 0 obj << /Length 2441 /Filter /FlateDecode >> stream xÚÍYKo举ϯðQ¸9")‘Ò rÉ"³³Ák{Èä ‘Ôݨ¥†¤^ÛûëSÅ*êÑ-Û“…>´X$‹UÅz|EË›þäU76Ñ"Ñö&?¾ µÛßÐǯ?¾“¼n ·³•¿÷þSßÈP¤a*oîwsV÷ÅÍ¿‚Ùi(»ÍVk¨›mÅÁ/•mýt(‹.«iî×òÔ•}ÙàÔ UÛ = ÚÍÿÒµû.;ö›­L¬»ù÷ý?ßýã~.V±ˆ#ýšøÕ×êØKu”a‘:÷‡TP2(ÚcV5ø­‚c6tÕ#Ѫº&ê×ÍTáåç¾,ˆL›dÑ:´çŽf†Öíhëž&pŒôS×¢Q~¯ f6Èk×vG6–ãÕ\®ÛÓó;új0õ€òe= òÖyLW·H0ÀÁ¹œâ¨Qìz0>¢3¸cùŒ¡;—k·Ž¡Yö'²_^A¦A×’.‚6ËE‘ Ò¹2Ìýð3§Ÿ)ÞÜüO;ÞÈ÷ƒßEK¿ ðjú^¤($dÎïøØYÌÈEÒB•¥õ*ÃÊc™5=-Ù°¦œ³°2ÉeNBÒÌÁqxÌXeÒ` (LîDÛèw—L÷‹#Êv3ö¿Õwçúív{á>9“£ˆã있rÊ ïÕe]õÇ1­’‚Ÿ)½Å%ÇFçXËöˆ:XKúã‚)È‘<· 'ØÔ9‘š‚螎×ÈÕ ïÍh%)\>cf§øÄd¬¡Ê1¥ãÈéoñ¸ê|ÕGçuÆŽuÆyÊT_ZþnÚfë¦Ø5C|.AIš½²dSâ­"5kœ.Wå„l.#‘F)LÈ2ý¶I´ã“†AŽõ™_2O|Q(BøÄ×ç›R˜¯5+‰ä “1›Na‘Êà[…öÅÃ\öHåSœ£XD‘òoט[¡t:] çú™K‰¡Túýóùùö/ fÕ*‡ÌÛÍÍæËœÙÁzò!¥|D¬ë !+Bg[&à”é"Œ«ÏŽìâT?è~ÀaoÙÃE)ø“²úÚÈTÄr–Œ¿¯Èü([ìÒÊñÔ¯ijâùf> AÃ_[žhfL88,Ê ¬R€AÌÿÌ =zaöÎ<ð±kkð-8âÁ%3šëÊÕB°¾ÿÀwa`3 ]?myDiâàoô“ÑÏ_éçëGpÁ‚êý{"ÜɵSŸ,ò‹âŠ…ZcñÇšyN ½ædÛI3ïØ®ÁÔ¡t.jƒ1¨ ø g…YE‰8”®Œââ… ¬˜PBM¡Ýe¾[“&¡Ó¬CdÀypA|B_v(Î.&‰Ås«¿RÈ;æF/SO("k<û/¡R´L†7F¤j*VK!thÅÌ ’ÆÂBc>[…˜ÒÇÏ®3 ¥óOüüÓéâmËþ‰(kËu–íêÃÖÅœ²Fð^äceÌ`;ßÞN-ÇU¯üaÍtë:6VÎÑb‘²ãÅÊ5sø :ºpÚº#µ&ÝVA¡VË6éuùì÷ɧ^‘Ï.äÓ¯Ë'ßX@ý_ H¹"\Dx΢BqOÂ- ~Rî¿î]ÖâzUcFœ¹ž>Ãj;Ö4—åÝ1Ü}LËŽÇË1V)øbs%KœBÈ] "R%³j‰ Ñ«I)Ƈµ1ãÜÉ7ӑД1"†[[–LLI:)Žpø9Å­:–/ºn ^d&t_÷W¯8ËpÊÆëQ6 ÕBsäšk®á¦’y?‹S×JÂàÙÛ5‰ˆ“äEÿÇÛ±k'4*(ëö.ï:<ÀM 7:2€áíÙºg tÓSÅ@ÿ¢.qš£M0ð £â’èvóܤ> \ÞÆöñ–ÞNÜ>º7Rúu¸º=×…ßN­Õ7VßÒÁ-æÝË@ȵââÙ0S…éØÑ\ûÀÔ&aàÔ%w¡gŽ¤zœÇÕ2ä ó-òÔÿ7è“oªÌÛ ¾ÿ5*}3Ðw·ôýuÌ“ù æáT> stream xÚÅ]oã¸ñ}…¾ÈmÌå—Di}è½öŠCïÐä­ÛÅfbádËäMÒ¢ÿ½3Reå]®ÈƒÉáh83œïˆ‡?±2rerÅreVÛÃ;î íãŠÿøË;áñ6€¸™`~w÷îý÷iºœ¼«»‡)©»ÝêŸI¾ÞÈT¦<ùé«<±ÇÛµH¶ëH€(¥’[<1‰EضúÄ…Þ–}Õé´<îhñcuß–íËú_w{÷ç»' ÎR­® `¿–"›J!8g9È’1žj¤_ãÇÉéG|D>€æF(&RA8¿;µåã¡$”æp¢Å©l˺¶5í:»Eáºè{úü?& ¹¸†°'5lj'%˜†ç™Þñ‰á)þ~î?¤&MÞ¿'À­pd6ïWÀŸo²é)ý{ŽÏ߿ŧZâsiõ ÄÏ,gŸù%ÂÙF:ÜoZr>ò&‘Ä¥› ½ln#9Ë2ÏÐÍcµ-ÁN´’É®ìm‡K•€BÁs^~OnD›œë¾ÚU{ì@Ée}G©IÊŽP¶uã¾Ø"ê/݇õ&Ó*é÷žº[ÛõþÎ@ÅSïUɶi[Û‘‚Hvï¯`Í ­cEíˆp¢à÷Où¡Á»¸{W=½³«‡cqƒgq‡HGûÜÓÇÍуà>Ø7g`¢Ð®m×yÚJ€> ŒW˜Éy¸U»›’6É¡règ÷ „„›À ›±æï×¹Jš–ÂUuìúò¸µ´{ZS„Ã5rC Õκ´çÀM o·Àb¹ð1ü—Þˆ_e¬0*GÄ” ‰Å2•â-aéIzrçbÎ@RšÕ„ 8VΕ{S1Ë!WE úqŽ¨f¹0¾û¡Mš2Í‹è—…5× +„5¯„•¿¡°âW~ZõÿyZ¤]mrÍ$Š7¨?ø`SyG>6ðÙù#Tn·//CÀÎn_N{çš ñè`Ë#9%lš‡I´9»ªiyàè†ðƒX©eòÝ–g‡ncÃC8vL„p|3—… ¼ô\ð켦¢*ôî5u;ï|`¹8çfèHx@.BêMBÎSUc8ÊŠ1]áÆ>Û-DÕ]tÑÉGÍ1"²”#»ó©5 -mŽ‹V¿¥nFBí¬6Êž~1gLº¸ôò¥3&Š‹ìú´¯j;ËSÎLº¨$•8Î=Ò|ÊV=Aw¡ Às80çT˜äÎY-`Bç z_¸ÆR·tCp@´jâž;ûp® žÐzª˜¶f¤ƒ#à=ûù¼¥¡óYR¨ä·,Šü²¦SâU‡„ €æè8Ðh¡&é 4Ñ –:¾"l$º¿É“¿ÛÏkr(\@UpAí6¿1pP† £½‹JpÞ´X-¼¡“\ÈE{–B-Û³Ré¢=K¡Nkkh×H²úÅ«—,5ö꤀ªÝ–C „]ÓS˜…eWa½4ÃTµeº(\ªóÈ ñªñqLFÐ=ÕA°ž‡ú_m<{ÓË„A7‹ªú¶ä—Øb>$pÍLab“G ~Q­ï°Dti Žú²}´}@s;ÿ•ã‡úQ)Š•³…TýžÐºæàñÊÝ®ê+_„âU8ù¼NA¶*ï©uD[ú¾¤½÷ξ'Û¾(ª?Wö‰ŠV§Ži¡ìÜa¨‘ߊô‚+–¢üôo™®<Î…ö|íìW©p¿ž$k„’È°ŠÓö+v Å&ÜÈen^Ý á¶ Sè‹0"˜»j#‹‚qj¢lPÀ&[ËÓŽo%\vÛòŠvû[Fâˆ+®¹Jæ¥Ö?æåúÖÿÌ“"´¥¢€&±³³'*fJ%3LU°Ë®É/àåUÕ 9EÕåuXöçÖßûäsqã±Ñäé‰ÑýóäTúážkÇòQ×䘀W…Z.6,3ƒ§²B …1øN?+@ŽÏ9 @¼K¢>çH ù-z¯:ŒT”˜½q$…KÊñÂ… ø9µ^¶ë\tÒØ_ãlÅuÞ÷4 ôöùÑ¡#ù´+{Ü/dŠ!± 4£éª£6º2.v‰©qd»}éyô–ؤǺZ5ˆk3 .sõÚ ‡„œ«ä†Ð.̤óP÷à {[A >´:FÁ‚Nyð+7ËjB¤Ð£÷<&ù+Ôs7Çžep ¥ s±`.qcHËðþ?Ïô¬†q®çzÖØŽ h‚óiKú&6¥—b© 1ÓéPþÌ^’2#‡¬ï¡ç§C^3µõYäÜ}íhèâQgG:Ðs3ÕŸêd_Ö¡º¦ï×ß6Ò™LàLž_‹¿wò«¸“ËÜ]Åœ¹Ž9õU"?åH5SÈÍ4£SÕÇ_W}ÎFø¤äãb(ùÖ4„à!Ð ZÐ ãJØUä !—Ûms‚"ïK¿¢ÔPuȃѨòÍ…Ê ŠÖb¡¸‡RW-vâÒêR'Ú» z2”. ³µ€Âéâ?'“I†‰z÷œ2@Æ8°ðÁŽ^e–̸ô ¨/´Û»ê~àb$“dÌ$xÈLy`ʦٟ[ÒÈ:ËÃû SKí"¿ÙY›Qh9yAÖ‘O§=y4ß(8é å1t|°y¥€¹Qþ .æÅ…ƒ0‹È„Lþä ’ Bv¾¯=ƒñ¾ß1Ôï¾ßÉ‹±†pÂEJˆ"î‡ðÏÇÿþ7 endstream endobj 438 0 obj << /Length 1907 /Filter /FlateDecode >> stream xÚÕ]oÛ6ð=¿ÂÀ^ä­fDR”¨{ØW×PtöÐõ‘h[¨m’\'ößwÇ#eÉQ›´H ,òx<Þ÷Ég1üø,³LK¦e6+¶±ƒ6« ^ÿ|Á=ÞÌï¯..Ÿ+5ã1ËãœÏ®–CRWåìMôÃÚì;ÛÌRÊHž•oèsý T¯2ÕÿO1õ׉¯?DB:‹)þ™àï?V‘˜`áv$_1RQyG>qŸ|‹‘# —Î#k!4¸"Ðg™öx̵Œ,ćŽ£Â`Àhíê΃ºµéŒ uSºXÐÚ´»žåÈZ¿½¥Š,² ª9þŒybKZ\ÖM m=:ĪÝú°m=ߣ’´(+0~ërÛRÖ/¤ÁÚ Pïƒd*øGŠÅ‘Ý¢î@éUÑ¢nr}GKSéžbÎ1ÁH^ήÑრ  >©G^ÂÁKdðpyÊ*ðß^vr•pmÍ~º˜r3¬ º§p\[ç_9÷Òÿ7MÛM9r–°,éy7u@Îò¼Ç)Î g†3Jë[w.@ñôš Õ.Ž WJÁY’8EÞvg\nÌ4‹BÅLé>¶“)I2¦y: Ÿ!¯ O‰WŒxEòšpHßZzÃÜG ¬],¿¹Å@A)d æ2ÅÉLio&7©ü±Ç¦WÞÑ ÕΟ¸ö[œçMxË4!ˆ3£Æ³lÈ#æDÇ£ø ²;`ƒ‡´´> g.@êR9ò­X|Rïo„ÃãYÊòLjr104(àª2õ)oÚS´Îg,JÒÀ†!F)zÒÁŠ'g›  Ž%d5óIþ€¼ÌÑgSD¦“C¥IB‹RkvÖ=’¬â“e!+˜¬5{˜¨òQ³/cÖ^ÔÙB;u² :VÊ— ôaGL¨~<îB™Z ß# (ÔS7ÄN1M#¶ßÆ¡S³ï©II\ÏçÒä&Å!®ñ Ãù_2µ/™Ä.,ð3Q/κ_(² •5øŽ›E¿èÊè›NʇõÚª«f![–4 êˆÚ¢j­§FP‰‰§«ŠT¸›b€`¦›,{ëŠd#°Ê&\‰pRWÉ•øœd†ãfÄ|ö¦Z¥ãáô(û+|š‚QcMë1Œ]©‰¡J¹´S„‡÷2к¤HË@¬êlž–aZÖ[S¹;5L0u´Öž¿*Ë,fI.g©fŸñM™)Xa1tñ):×tÚÐ"{³rm…ŽÔ¹l<–,ãùL)&Óüžó€¼8aOÈrFÒq€¯î"u¯UÈ µA½!À×ÖÎ=vm<×ÔNaŠÇpgi£!àðÁ ÁKês ÿ›ÐÐ8´Qýu˜ƒûj‚mAÿìY¹×ârI¸¾ùCÕý ˜<@ endstream endobj 442 0 obj << /Type /XObject /Subtype /Form /FormType 1 /PTEX.FileName (./images/basic2.pdf) /PTEX.PageNumber 1 /PTEX.InfoDict 443 0 R /BBox [0 0 260 235] /Resources << /ProcSet [ /PDF /Text ] /ExtGState << /R7 444 0 R >>/Font << /R10 445 0 R/R8 446 0 R>> >> /Length 954 /Filter /FlateDecode >> stream xœÕWËN1Ýû+¼ HlÇcK¥‹JU%v%‘º@¬By)©]ô÷{Ÿ¶²a„˜œ¹Ïãǽ¿X7xëðO~wsq=Û‡¿Æ ódÛãõÁ”)ÚRŠƒ£ÿ×ßæþÜ8û`üì ©ç8ø˜­O%y²èéÓ ìŒO± ^Å¡·mzFôWï¢"„Vœ€˜ºº(¥’¼±Å†ÙÞâãÎÄa²ÿŒ·W††n¯œøÍÆøqª jÆql G_†Ü†ÔÙÓ 3DXÓ‰Á@ÊPˆbê\”ÍñiÄ)DD¢ƒÀ1ƒÝC#G`gJ(2”»ÎÁI°!˜)[µNâ OòÒ9”æï„ÙÕý'üs¾:ý´$õÑV˜e´”êÂ/S[cÉY] û1Ëš„SçRyµ]xâ4ë^Ä —ÕNe¹ÚÚkt«Mr×98‰#«=ÇåjÏIâ èV›ä¥s(5ŽîÅÓd§“dž4õ¦sjÒ>£¹Hâ:k§­˜IǨ̰—3î1•ÉKçPºx’¼¨xé`‘ª`,[\ÚÄt.IUèŊл„VŒóòŒ£ÍO±¤*4 )8}ng\W¼Ÿ€fë…\Œe¿×ú¯¥BjÇ õu¡ÞÛ‚ã²É`1p,®’š„SçRyu½ð´i¶Ý)< kR]¢Sݲ³,ô.¡ñd—ËNtÈOxjR0•Ø-{›ÎO@§ó>kÃ89 ‰_·{’ë©ö`ésI6Ä삃„{†#0سÁ;”G˜‹JÙíÑü:·àCû2ÝAâ+F¶Ãð£ºlÌÏeâe°.Ç¥wŽYà£ã~Äý#ófg}‰ã .g VrÉ`i˜."‡¡Î_5º™ ã:}ʦÞ"ÂL|ÄGŽFi¤ýš ! ÓH½U²‹|Äg>A8ó1k»ÎÒ!«ù{ÅÆLE'‚X‘ù1ñ†î›,%¤ÆÇÄÐC°TXÌPÍ+°‡û*'XŽ*d°RýY ® öbóæÒÙfªA§ðÍhtkTªÊZ]2ŠS³ñU®é/Æ3–ŸÝÁ~Û­¶ñ4@Úl·÷†oûðŠ"<¶³ògÛgˆ3&»½3«€oÀi]¾ß€zsR [WÒàçU<»Ý^™5_„É1¢#î±èà’g”\\¡ŽBš< Øäfõôõ¢æ4a «§/—¶Ž]ûà5ZË™“=£!E_Œoù×>%ñ{B›ï[(¹Ÿæ?ÚK! endstream endobj 449 0 obj << /Filter /FlateDecode /Subtype /Type1C /Length 712 >> stream xœmP]HSaþ>÷sFNí‡ÍÒ}‰¢ÕAMm3É Óù{c:ÝqžÜÎóLÙœæÔT83V*Å Ôø“äEtW"‰H¸®4ˆˆ"«ï[gÕE]¼¼Ïû>ïó¼¼/Ê!ÔÖ±¦û”™wX¸xMŽBr,¤)ÎKYŽUiÀ8”˜$j¢V9;ˆ_ÀOSðãý@áòZÄÄ;=.ÖÖ) ÌzscVvvÎßNnQQjóüfPÓÍÚ8”!ƒÆÎ; '#“> stream xœeËOQÆï0tf"•Z•Èc@ Ei 16B4‚i|­­í@éÔNy†ˆ‚FÃ…Š”>b•ˆP6TLÔD7`L\øGȹuXØ11.Üós~ßw(‡(ŠJ¨ÚlÒáã¢Óª´:rˆ"©q$6ÉMDŒžT¥¡âºµD¬¦±:~*Z• C{áænèÙƒhŠ’—‰în`wxùœ³¦†\.ïŸb0¼¥ûï„/·I‚ÝÅgÇŠ›St·Ù\Þ"¾,¶ít Wx»³Ûíx³Õj³*gõf§­•?!8·[ìàsÊrù½ÞP-´YÚ%Þ$¶™]|µhäOóJüÿe„Jh)4 T‰ª%# bbo£xTƒ^Q*ª’zñ«7 æðSr,¸ ùÔdÐ`%f­\'1‘þ±~láä×,¶Ü¸|ƒ“` Ä:Fúàe®‚lk›sc¸%YGV„ÅæŒ$ø!7Í‘Ÿ!…e‚Ä nRÁ5JÌ»;}¸™Ûq±õ½Þ–®ë£ßèý@zàѽqàž»C­W={íGË÷Õ™7³éOæýËøW­Ð6 1§ù–—+‹ ++ʼnÜÅà—i ‰!˜ AÈ: Y"zðkIE[["ï“‹Nå×ä¥hܲ †XÍ’œ Y¬Æ ™k@+­e¿lcÀoU +=¤ rhø-×Ê#2¥ºÆŽùü>ßðL`ztsÓãí—2v´,6vöä rI±úជø+GÖÙ?RÈ`(X…TšxÀ®•WYßí,ÌÉ:ŽÂ‘o›‹ëx+e»dKFç/vÚéVk§ –r³ÌÜç¥Ù÷8‚Ã]Ïì~{qSW]ë…sųœ-ë9/)d“:ƒÄ„† Þ|B8¬V?¥NDè7Ò“+‹ endstream endobj 454 0 obj << /Length 1812 /Filter /FlateDecode >> stream xÚ­XmoÛ6þž_á2+â‹D©]¬è6t(°—°´[¶Ø–'É òïwÇ#%J¦Õ„Ôñx¼;ÞËC³Yl¦øL¥"L…š-÷W‘¦Ö›MþøùŠ¾0.Î÷÷W·?ÅñŒEaelv¿vEݯf‹æ .U¿a–Åán΂å|Á‚ (BˆàWTP mY~Ž˜\æmYh5?¬hò©|¬óúeþåþ—«ï;¥b‡±¯´Àr¿Â ž„Q,ÉŒ¦ÍÛb_æ`A‹vÈà‘ÌÙU‡MC”¶¢1§ásGdsÕ4åãî…ÈǼÎ÷E[—K``DÛUÚÕ1œ/$l¸ß´P¶Em|Ÿ_ñ|òS[ÕD[ƒ;O;+}U ÿ…Q)7ËXpXèë$ØÄ;À…²DAØøœ%BÅ¥#ùôR`Ÿ°LÜw"LEÔ±üuî¢4ä\bq$‡bä¹››Wkˆ¹„õ‚ÛM7qéUzàîÒ'' UšË9q Gú KU×Ñÿö ÉÂ$Sÿ·MO~9LªWÙ”LÚëc86>eÁúÆ[GÀßX@©âTW¿_x^Hðk’*§@ó ºgÙàó"‹u=FJk—ÆO [ :4Ì°b#cµö–h(¬ª/J4hŸ¸U'êŽ/ ŠØ`'ÇÃéÑV•ô2èÏ&nKp0™í8æáBúËStyT3@\PÝ6I¯‡®?És1jo©"DÚ¼>8°Å~%8‹:oÒÁ"Öû‡ß𮹟´*ÎV›åÔ²˜”-¦e‹iÙrR¶œ–-{ÙçøZ…v”ãÖO„ 3ƒ ¡LœŽöe\åÙ¼lÍ\áËÕ<„ÉfÜGObuÚ^YCÍ gœõÁ;Ö ’ þM Ãbq– ¤€“ H0úH/LëBt‚öá^Á(ŽÝ¤!dÝAæI8Ý;«ËûŽðb/Ê ¼’® qö'pFØ+™Ä^b{ÉP&„½’oÃ&á¦$ã`S `Ó""õ4â J*GÍy cÙ TÎ9¿€¸ ¿õj¹@q —8ø&¾£à¥ô2–Š^k?@ÌúÇí“Ú2¦ÆP®_Á½¤¶‚Xh_ðÞíÕ•ÂÙ¡(V4ÃLÆ1?Bï:ÚuzŠÂ¤ûÁbÀÜÿô ûŸ,Óø71)Y·Qÿ¶±«6Ôæñc¥çÐÚ®G‡yŠŸ-2ÿ©,D¢â^ \ÑZœµ™ó.C[‹ïÍŒŠq:ÝcÄÅ­ñMöšöäۚܰh²9M)ÌØtçšÒ˜ñ×t½ *‹Éž7©ò7ºé¤Êñkšé•»‘ç¿a)¿c endstream endobj 457 0 obj << /Type /XObject /Subtype /Form /FormType 1 /PTEX.FileName (./images/tree.pdf) /PTEX.PageNumber 1 /PTEX.InfoDict 458 0 R /BBox [0 0 387 312] /Resources << /ProcSet [ /PDF /Text ] /ExtGState << /R4 459 0 R >>/Font << /R10 460 0 R>> >> /Length 1017 /Filter /FlateDecode >> 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 462 0 obj << /Subtype /Type1C /Filter /FlateDecode /Length 463 0 R >> 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 466 0 obj << /Length 2301 /Filter /FlateDecode >> stream xÚ­YÝoÛ8Ï_!p€ÜT´HQ¢Ô‡ÝÅu±‡C¯·Í=eóÀØ´­X¶RI®ë]ìÿ¾3J–¥IEÑðCÙáp>~¤¹Â?î)á©4bi¤¼Åî"´³Õڣί?_pGaУüñêbþ.Ž=²,̸wµê³ºZz×þO}ߘjDQä‹W³@ÊØÿ0©_§YVº o¿šûÊÔfŸÝäåç¥_®èû‡ª\WzWÏžŠ(ô9ŸÝ\ýûâ_Wv±ˆY,£gn¥¥~b?iÂ2)a[ cI{ºÚÐ)Vþý,j°˜Ü•0›úKãƇÚT5vYÒÔ¾l¨³Ñ¸ÝÏøDZlI£·½Ù…® ±Ð·–{ypšV—µÙ›ªµZ»Á¼nùUkÓЧE«!ZÐ ¸´[ xÄxÌi‹ÍF± åÞ’›ESÓ”•)Ãدp>Pr¿1Ø­ —ï×pÌq¶t‰ÿÓHbù3Jœ¿“XUE)˜g S‘ð"–Å çD5:–f‰ôÈÇ´ !yMJÔÊÉE lë²hmÜÓ?ñï«ò¶0;|:ä›7ºÎ‹Ó,•>›I"üw³4òËŠì%˜%"ukí…Ç B`i>çåœg¾5ʽ»/À0vðÉÄ™¾;èÛsQx.vx´Qr(–4¤ƒo—Ùõ aUE9ƒUÇ|2Öôù·0“¾E–2põÐ)=ihëQK£÷ËIFœ…‰ì‰§-ʪs¥rïö„žSöwd瀂öNöŽdÆÀAþ¹Ìwf_ƒ³£¡'o?Û•ûE¹Î6$a°Ô±†—g‚Êè¥ÍKÐßi´à‰½ÈƒyxåFÔËès4Ù¡¶+šìLʼnÔÊÁÌÎ%·ºå@ñwV/t ¢ˆòÞê°_`TÑòW“G‘, ›¥ ±X§b~³n‡lûo©‘¯©m§ß¸ù¤›¿¼DQ4úÃjÈ9“ñ(A eˆ àщC1ð‰‡Ý·'D‘¤|u„ÿàK.ýgä;öá$¿x¨z>PvÌrîX¾ž:œ»Ñ>1EL´®óË»ú~éVüp·3Ôüx}wãÌ1ŸSûQº´<¡úŸ½OòéO½/ãàD‚‰ÇëÿÞÚr„ùËznˆi¥ÙP¯>,ð«ij(Xóº1KGEDfy(À…1è8¸CmÈ@»Áà¨Ü [ñp¥1n‚ãaîR iÚæ“Lí*fJtémgôÃh‚— ¿Ê&c¡Š[ ›Z¶Òb§Ò˜j‰ø+L`ÕN.U%Šh–^(#qûWXRp»‰ô÷z‡ü’Rl›}`°Ímn„ž• „÷|he×+”è*=®¯‰PÓp§!óÑL[¹‹‚>=V¢œ€?ß²M^LøÅóù¼œb¢ÀøêI¬_Mê’¼‹¿ƒ.ßàq5UŽã¤û &ÓoЇ1f“™õ+)C&ø(á±+…îcÛÒèÜj×Ùè[yÐ=nò.zUÚ­% Êæó ñ%Õ¨Ž5zæ®´õ&r'‹bAByå0â˜`$¬g‚Ôanp´Ÿ¦’íðHA»Ä¶‚=Uº:ÑpQbeý‚ƒ2ȧƒÙ/Ü ?ÐÞ˜[``í#Õkú: ¨U*î¿7„+Øhaêšø[cÂk=hweÝt²&6଀3ß9{9‰“2OΚ¥#C] ÝÑø»0ÚîK›kÛ˜HBÃC=–hreM4°$Çd¤¢ÓZº|_7L‡ ;U@é<€ìÃʶ1ù²½Ô9$Wµ=x¾zpÐ=ã0L=Ä0ðWµ÷ÆßBá@%{·H06XÒ~|x¥ˆ™Pî”S‘&™L2¯Ç圇ŠI&Î6‡JÍ(` íF½"&’†b…4 ˆ@•´[øBøV É#R8OR¨ì‡$÷ÊùÿëÎúçØKš ç¢þÂtÜÒÐq’ûâ ·w¤mÑîwÀ¢â,*¿#Qù tüijÐá$Ñw…ï+¨ðö{xL¿4x¬T°¥ä„=ºe§ÏDšY#ã­ÐÎÚ$¤‹Óï˜X Ò®²%ËѵçûŸÂû_Ýçža…°D…®k{o#µÓñå5ã] …ko yï!&&0|e‚‰ÅFï×fò!d©êPÎ0ñ³¿I–ÊQý5! Ý+ êX ê{Ã74À²ƒíÉE“Ý]U;úþÇmjÄ •ÑCFöp°dŒ’RÔ¥Œq®íëÐ^1a_ãjødQVù:ßÓ9éPæ´ÝÄ9Ea…„ŠGo`°pgšÍ¹¢ ztÁKó¡qT¶t z¤Á¶­ƒÐ­s2öÑ·ÐÑF/{Q YRf^RÆÓȾì±¾±0ƒ?\Ø'¾áLÿ­¯]ôL¼õÅØý^Û:it&nì`½vêJ5ÖT&àdb èãOŽø ­F,»Ä?>¨Èº32:,IG'öt¢Ì¿=ä/B—²?´·5Å¢¡Q}rO±_hÜTö~=z‘ÍÚúõn(–›cÛJ‡–Ñ‚3*)ºW+:C}£;¼Š ¨Jíû ›J«g4Eªf`Hh*š}–³El`\Ásoix¡mëæàáfâUZ»òº)\mOê€!º~×=¼óTœ¿p¥€š3C ÒÔÖT{S0¼˜O™dPó·üuþæíû×ùߨ©w°øîÍÛ<€æYåRCAëjZજlKV7¥zå?õ´1ÚÝ@„“Pª[žèÛYQ&Ež¥‰ X;Úr~i7ýþÉ-OYl ےŶ,Çû¹›2Lno^Ø m{¦ëƒhâ½è«†ë š÷Ï&ìläŸ?ÿ6Á„ù©KƒJx‰bRIÌ×7¡·„iÆ¢,õŽ–hçq‰¨ð>^ürdï+ÅÒDy1Õ¸óOýÄì~ljcµð› ˆ[œ—[%"à˲$‘½_Š‰ÕbÓ4÷¯æóãñÈEY®YY­ÇŠñ”£Èžb Æ_í‡ÂÐ endstream endobj 472 0 obj << /Length 2940 /Filter /FlateDecode >> stream xÚÝZKsܸ¾ëWÌ‘Z[4ñ :ÙT¼ÉjË©­M%V*¯ÒÐ;CÎ’ÉʯO7àKkl+—”]l4€~ ¿n˜­øÃV_eZÄZd«rw–ØÑövEþtÆÝ^L(¸:{u™¦+–Äy’³ÕÕÍ”ÕÕzõ>büü‚Ë,M¢¿ï¡¥#S¿;gQy~Á¢F„Ñ;ü’EÇÊêׄɲ諦¦¯E½¦ÆÏÕu[´ç®þvöãÕ°©”§q*ʼn'ðÔ'ƒ«8I%ãj»“‰ˆÊ¦mMGnêuUßÒxqÝõmQöØãQ÷PŸA_|¢~ß7¿êŦAŠûšºUMŸ{Z‡G7Ív :ºG©T 2¿ÊçöКøüB¥³>lMÌQ6­ÓÎvKÄvç8ÒõEov¦Æy½ãÔÜзhß6·m±×ùxèzÏz<ùdŽŒöE¿±[ˆ½ ü~–ÄRäR“¢]t—¦*ÎtŽÊ}õv'VmÎþAjfù*sÅj™s3&À„tœz¡h/) tΊÿäÇxœÛ£c¤œÅ¹B}|òk{u©ÄÔ¡©2¹,Î¥ã÷kÂ9‘²d¥â<)Ó˜q0p+ï{ïˆJΈ8pKœoÒ÷¹åËXª|5á‚Ú íLÆ\rϪú˜©Ê¢!–`rV%#b¹dÑ÷èFÚ®^BÅŠç~¢[– ¯!aÄ‘¹¥SŠa¿à]a†p¾$Ú]˜^0Æã4SsÇzZEê4ñÏ«H}‰ŠB¬@3i>× ×©|R3à_i.¿B3ì¨ sp&ÿGrÏ(ǹéØöo!ö\Xßž›}’$O W¨X¨¯.v³?•áopE㘂÷ŸàGm‘9ý?óM'ÿooºgWùà ›2†X‰Ë8‘#ê0 ¢ë,`›à^ôÖ4`‘üR$OÎè(ú¦u OhQ‹‚Ø#Œ S”8¼¡^U¨KGd‘°´4ÚÓŒ@˜[„~uõû!†Ì'SFع±¤L£uBêÃ2€H>‹Ÿ,6" ãPÐ_~n¬`šŸ²iè·5·¦F‘˜–ªêýÁÁ¢’æ®M<Áœq§•s-"d§rEW!Äö®¨«ýaKœ¡Oœ¡A[G¶€-éY‚'ðè܉h­Œá·°˜Îqž‹˜ÌJÍn±„Ãþ›~2=¼Ë{‰[@؇¶CÛH]wãî«Þ¢YœfWômõ‰¬V$€½ä" ƒ-í‚ø €U¢'ûeñæÑiঠƓT¿PÀ‚ÎÁ‚]ʃèýÎà@ Z&“1,8½dâX’Œ‹|ïH²)I> 33[Ö|"Ò%gÅ,Ó~Þw¡Î8ù ¨ÁpÀ SG—ÖÂ[ÚÝÞRÑ4‹¶¦§¯‡Ž(ÉD2{SUës9“'Ka ‚D>·”ⶨÜÐZ—yÀÄÖÜUÍÁy²ùTìö[ìBÆJe_kQË&ž aÙ7˜#F.À²£ ÖI†­gv3Oñ¸q^l~‚ÇÖR/ L™­¦³ ôJDh¥Q«˜i>n:œŸAó³']³ì±»>ÖÐ À×á½(¥<Å¿Ñ\¸o«ÞÇ‹žìÓ[ðHƤÚ+I÷laoô×G2›@>¸‡Ðˆàž;sž¥ã*æ:[AN®s=ÁŸË|úÏA=°Xhkšó‰FW@빋µtl œådz=BÌYV•>ô²Ðß}‹ÅØ-äü‚ç³{y¶¥°„eZb—a§J0õÌâ,$F9†ÿå!¨#ÜG6?Þ…LV„™æÃRËŠ–LA«Ï«£å=|\IùIJ§+idáô ¿8MÒIùO05’ÐwQÒ¶ï+[ ƒÖ5á_ê:³¦–õJø-<hôn»±¿ûÖV 蝹cÖûT5B_&E^õ‚b²Õ© Ð|A® »À— ë@ o¬Ñõ  ö†±~@Ë4ÝtºˆºùEDøvë+ºî#ÄÐÊñª÷w8ØPë{u™¥™¼jAG‰MIrï€3c0éTqP)¦$%¤"6è‹,à‹ÈóM‘Q(o?Xßï~¿}pæþJB¦XÜ@ÃïA¬ô§É“w–Ò‰´"I8 ¿kcö²ÛeŠíÃÜÈ’š~ãè7n¼i«Ûªöl|55àê6·’ÜÙ…m ¦žkè×ÔÝ¡5'LX“ÁÚú2t릧ªôšƒ¸°³sÙˬºÐýjíOΩؤj¬œèÍ®p"-;ŠÐ|k³î“˜å|ë²ÔÖ³ò2[Ô˜š¤0µhÝÔâzëZ”rÀ'Êÿ*s7¥¯‰`aÙ»™¨ÅÔÿØ÷î7èg\»â9×n¯8²3»¦} Áí˜NÙ¹‘Ö“kãg¶Íávãøµ-ôŽúè´h¥Mïæõ›¢§ÖÝy *j+NX>ÆBnœ5^ì®è™ÒÝŽ‹ØsAcY>†!I¼t· œJÊ™ò«ØĈ%З‹p@¸v‹àµ3AÐÐõx‚Êb¶òÌ!ïÀQ[u¶D±c®1ˆ fÕ[ µû€†i¡9×S¿ÇîP³v{§»z颷Ðv6öˆ×Ž?àîšuö­¹±qR:è¿%å=;—ÉcYIF²Â™VV’Ídsæ²r€Ü­²6xºÑ˜%#§ÀßÁÐB@ÙÊÑUüßÎ+€Âü^úúü˜M]É‹fR`iÛõ#ÿ¢šMoê`)-ñ..ÕHÁÁè¦Õ–7á‚‘Ô'?oŠÓ«ƒâHu@ •ãæ¨áÛêqâ‹êqœÀÔ¤…™cJ™°/à¼Éó8OgõS‡C$Ïì' >ÛHÁ†g)øìÙ¿Q.&Ɯۣµ!‰Eá‚OÒ.ìL-þQ€T:NÆó›'ãX¿„¬Á_C¸À令ì~÷yãàë$vßÇÞbÀ†D¬6wÌoó€ü[ßcÛç ~ü¹üU=ý0T¦§¿Ç ÷Š’Ÿy‹ÊD}õ[ŒÐéÓo1™ÖÓ·‘NÞb”œ¾Ç*áa`øàö>Âgüì_WàÞ­îÿqýöª endstream endobj 477 0 obj << /Length 1529 /Filter /FlateDecode >> stream xÚµWÛŽÛ6}ÏW(O•Š+Š¤. i²h´@¤ EÓF¦m5º’÷ò÷áP^É«E …‹‡g.<$yÃYd¹`¹È‚²y;©ÝÔøðë3îõ"PŒfš¯®Ÿ]¼V*à1+â‚×»¹©ëmðWxuÐýhì&B„Éå&’R…ï7IvõýÁl­®iìƒé­L‹C£«®E¹ »¿·ÝÞêfØD)'tN@%ü­6ñDµeÅ“åV|Ïr߿ܲ9’HÄàJ»¯‡kG*GYB€•xˆÔ‰(nôh«;jßV5rpQ„Ÿ7PŸyÌ–ZŽ©`X“òš%Éf;7©«/êH§·òÖMµ5~`‚Tµ»Î6Å£¹öL@›ÁÛsü²Eq’—ûê×0žI87LƒGHz’ý«øD°@Áöt²ˆðõ00.BÎë)zXRôÞ´ÆT2Ô^XóW囟œ‚59£LAÕqɄľCðÈ®…ÏfÂÄ&R©?ôø.™Éð­¹sh^¬z_0žøy÷û0‰çaKÇuîéäÁNÜáAQ"‰ƒjM-MiïŽ#õsk·³©ÛŽdötTSœÑ}z:¤I½×Öº8ò)Á¨çkæá†*ikj¶FDnrA~¥YøåÁeè‘Ý.k|³ÑnUh•][š~0XY¶º15§‘â\B=7’…C©G(:}Á¬n·dêNy%s—-oØÅïË ¢ô¸Ro«ñÃJÄjxñLÅ9^àQ׸~ãÝbÝaª*l°},ñÿ@í®G÷`ÃasÖÔPô[v{„åIC²F{,Ç£­ ÈÛ½_8ÆËÎú–/ 0áIdXYhN+¬¤@dÉ¥ÛÊÀý”À–8Ü%¦%vƒt5ÞCúÖÙµÏèHÛÜV—#u€’vÇš,‚ƒš€º2ƾß–zSHhq” 5lõ¨×‚¥\U$XÆ@|¦®††1†›Â'NÕ!)ê©ò,á®y ÕôYÖ”OÈ=Õ¶æSÌåH²íoòà­À†¢½bìX™„³rC:Òõ=Põêžyã8xÚÃÜϤ*Âwý”Z¨ Ìe×#I`¹-Å«<6g¹ñôˆß¶©AÙ††­ö§Mݾ֥qù„om´õf´ÓnGSòÎûÛ"šåzxþ<ÞZ ú’bÆNjL¤L ®ËJÁ~£Ûª?Ö3òŽ$P1¼8>ëÏXÙ¨TyóîlSŠp½Ÿ¼jüÀÎ'RÎYRa£ðŒ™ÖZk¼~¡cFÓ;@.ÄëHʸðwN¨«lõvšÀeAÁ2N‹^bWWço)Ž¯£,i·zJ1C,.à'îMµ”ÌW~z4›Oo«t e±ˆtÇþòâ¢ïÊ’ °{KaÜÖšñc’ÃÝ9V O¿÷&íG˜Î"»PJ§s‘}S(ë#±ã2Žp†gÀdïÛIó£™ÕH.—Y„qEe×ôUmìUÅŸ~:¨“öcxçhØèðÐñµùfYû°µwG«ºŒˆa±ý|÷/yS endstream endobj 480 0 obj << /Length 53 /Filter /FlateDecode >> stream xÚ3T0BCs#s c= cs…ä\.°hQº„äÎeUgbj¬gjb dcUWN" endstream endobj 485 0 obj << /Length 2064 /Filter /FlateDecode >> stream xÚ•X[oܸ~÷¯˜"Õ4-J¢.é6@â¦é.NÚÌC4´†+ÖHŠ.™{ùí{.ÔŒ4f‚Ö†äááÑÇs—ä*€¹JÃUšE"‹ÒU±¿ˆÚíV<ù÷› iù|`ôgœ¯6—ÿPj%‘¹\mnç¢6ÛÕïêN·ƒéÖ~E^ô|íDZòÞ¶k?L=S¿/š·bï½%åz(›(Jf±'Õúã構כ#*¡âèD=q?‚žôT„RÅô0®z´öUØHžÀ¦ŠÀ"i ž+#Xùa&‚X²@ºvv’”§^»–^׬áæ_ʭ鑘xºæMóµ­Ê¢&V<ÜTwfÛ銉œ7k_² €H×À8X"Wskó²Ç½‚çEÃÜ]c%¶ºÄÚO"åýhŸ|§{žÜ° ]o'#!•½À/wµÙk+p>ðüËZ)Owe3H•HÇm€±hömYMÀkh艄 –‡®_ê™ù¶köLù Ë·Â˺Êaàq ª‡ë¨0áëÀîÍXV[+¤q^¥íÌ–Ël‚ÚŽ•î” äñ#½¡28ÏÁˆ[&nõ yÖÝX cgxyÛt{=ôÓQôc¶¸c (]*›»Tå"ŽB@LHEQ5k%=úÙ¹|0’"=ñQ]ýÜð%ÞÌP¢*ÀÁ¥Il5ÂÇŽÈ{À)AuYF¶Á±EÿÍÈ™ yëòóhžø|òë`ê¾¼©,ß})hßô–òØ9€¸t{Žœƒ¼}6ÈØÈ°Yö.â –Ý££ÆqL±Ç‘7 Ãð& o`  ë¤iâmî s¡…;„9qàýÒÐ&†¾ñ „£«j Í­ËŽa •ËÉ.±Ã_¤rÐÌá.›Æ¡ÈÃt:K$Þ˜PmͺÅ`η³—²8ãG*fÓ‰€Œ»ÔYg ú³¤:¡¤ÉPóòýUón ÉZð’ìã”_4Ä$óî´Ý+{Á»JPém¨˜­6…é{Ý=09 )x™¤™‚6­ Þ–d5cWhü…ý­Ó&æîÒ‡Þ¶wwϤ²æ‘”„“Ç~Ä=ÎÖØ5…kxlÆ¡»ÉCoöšõPàL5ŸÇ’sWeÕ ôÓ 9övBÚt'\§fÍGèQtÌ‹0Óµ®zÒ2¬T­bÂÏä©MGfì*äëÈØ0Þ–¹ÐÕyFfGq‡ò3^Xj@q75Nçƒ\È4žØ&›‹ýiw™’¿2xí)°× ÇKÉñlÕ.ãø¤ž™X'ñYæ=½Ý–¨²;¬Ëšoúøtßì͉B‰ƒ€b‡‹(NBê[¤`]‘¥S›!$6¡÷ý¿3U¹/k€l$¼FúW^þ&C‚ÂÂÌÙdĹâÌS¤âÐ[Že«…;äi8YÄ|YïìAÛ7à|R/õ H€2°ƒ² ÌöáV6gÜsdž3>…–î ŸÄ‡=ÚrãW¨r{uK0:]÷Pˆ®&£ ÇÌáÕixdÊêÔ¯¢!Лlÿ¦”#9âÌ{Ù;ò=ÜÄ°5Ÿ±û@òbòØ]·7ìxÛ†TÖ©**µ²’À»ò«¿'íTCÙRKÂçî‘Õtµ©ž[·I\À%à99£{Òvz·×Ø,úðŠÓ”·¼ýÊ5O_ðpk€Ó_褔"VgaL6/yú7{þ¯”?|ú¸,@´CS ,÷N,÷N,÷Ë7îè° =åá%Òî-í/<¼ð1^? Ñ–¨ã-—í\[³ó¼„ øÜÂǸ‘Êq¥í+S¼JDžFè?‚h‰\ÙÒ%:)Èqó. '†Õ/n8Ûñbä¾fÔáxJ´¼+¹\ÄY2/ĸÇEp~Ç󤛹2«ºë0H—šÕãÐ`eáÞJ9&¶¡›ÃKjv¬žÇ°Å„0…í£×ò@$êØ1RKäVQïßJÆÝÐB˜¡Ò š®i6©[iÉ2Δ;Gåã¢nìÉÚð£ Ë„u¤$)¼/TñO‚õ¶?Ë NÈq<ç.d¶9™‘ÛÓYqžrîÉDS«ÉŸ€º‚qªò®„ÎúL—-G."x­òÃDDÅþ÷·×Þ°jÈ^^ÿx厌ãé\„©õá×ð¶Û¬¿8”UµHýø‚½ ÷e ¤a©,Ö7rLµ„š ¬ -¿ó£Júåáž ›Ù/Úšè8¸øÓ·k© äKüð¶å x1¥Ä¹‚žØ¤õÿýñ¡7Usãî¬ÔWº¸7¨\ü¬ëݨwÆQ„¯ÈÂ…Œ«¦Fop=åêíõæõ6¶jD6·»ùÜæÒV¼_mc@Ř–¶¤Bfg¡Ï eà(ô‰þDxb%_ûÚ‹©îØÀ³Â¦y§ñµˆ>ØᲆEÏSq‰hô°IÞº®$êùždûYïóñ[]®’TÄÐû‹ƒÕÈ QDy¶:Ó:jL~ÕêýÅ¿ø;Þ¼„¤ÐZ'éJá;D6C5ÿ|˜;ÈPJ@B¢‡Pvà!P ¨UôqI™N´§ýÓq\‘' }K\>PÜ Cûüòòp8ˆª+Åmwùûî‡f¬.á•ÝTM»7õpY@¸<æ±5Güèsç[…Ú endstream endobj 489 0 obj << /Length 715 /Filter /FlateDecode >> stream xÚµW[oÚ0~çWDâ%hJðqBµ‰QVuÚ¨T"íñ‚ËŒJRÅ™ÔJûñs°Í0uB` Îñí;ÇvÀBüVˆ­°ï¹}/´’M m{ó•%”Ç»ÈyŸèìÍüµºŸƒÀä^¡+°¢§}¨hiÍlèu쇲^¸Ö·I:í€t°3Þãyž=-GB›”} ýÀOâ‚f©Ó¥P¾ÒEçoyô¥5ŽvN8pßkšý>ŒÞ~€ÛçÁô\ø"’kVä4]±AésÀs!18Ñ:å‚îá ç!,FÛÒ{òk³ ¹Ð³'!YdCÒ‚Pq ØÍi?±hª¬‰&lÖøš“çí^1Ñ\–ätÁ£íâ'9ˆÉ”=O‹ 4£ÎI?N!Ĺ.ˆÕ·Ù&¦©Éæí÷áýÄ4â‹¥X¤‰š$‘.Êo!x s6ÙkéšìžèM¡ }н¹^IT!Ûí½R n”Æ9!Ïí!è»…êÐê uoѯ·j­î\µ·ë*o•âË1MdÊϬ‚”õnŠa:FÑøñ~rg•TTÃ<0-üË9É#¦r°R<¥øJ tîÍPáª"Ó¹Rí"“;XÇ TÅ*ð¦eÄ°fœ1~šG{5‘WÚnæñŠd¾f{Ý0ðKÄÎx`ü?Ô¬Ìï0Ic¦¿?ÞGcóUµ]ÙÂ;^©…:ÌséÍ æJÃó‹^góñð<UzMJMÄMçÍ~š÷¸û³õÜ@$| "ùÆ7Ôøµ )Û¾ŠNzL5ƒÙ]‹†ÎëE¶|Ô\&³YNW4Ÿ%ëø-Y^ûø4 ?QD+7Ä52ìANÊød-½¾ä¼zËïðˆ“ªÜwí8qÑGcÒºZÖ ÇÌ%ÖøÄ]9ëe]~ý¶]' endstream endobj 493 0 obj << /Length 630 /Filter /FlateDecode >> stream xÚí˜QoÚ0Çßù‘ú’hrê³ã8LÚ¤XŤR "íñ€2Ö…¨€Hûág°=apH Q¥nƒ‡3Žïò»ËÿŒ,ÞàpâðˆúåNúÜÁûÙí“#ãû¨uH,D+ï’ÎíÆÀ~wÁI~†J~8S·÷k¾yYl=D)uéGs7"Ü]¬&éz³»¸5•fß1éü%[¯Ä ƒ(p{³äkgüa„ù, 5©õêSôð0ö#‘@ècHz¶»±‚Ä$Å 'o¼]D]ôò`†]âƒôçÙJ‡êSáûñpd»JWe¨4Ø0`ø¼‹ÛìUQd¢²"[w©l®æ_åÊ‘ùQÆîC&(mq…½Q(™4Ÿ?ivK²"&0.Ê\üdŽŽ²#çnaÒãšYèøËzôÚמE9ý²ŠìøUièä—Wæ$‹rú¼Œií[‰´ÑJDzOÄn!¶˜lõdIeÒ‹“d0Žîm5äJ᪗¸­³ÀæhôÔnTè’D¨zÀô Ôn¶ZãÆ”t¸ªwZ°ûèÇ^¨G~N¯¸ª%ª,\ E ¨¬ª\m(zQ¥šÁA]¨À€ZZú¨nžWŽ™˜Áê:8¨*Th@å ¡®®œ Å-’2·ÛVN.J¹qš.ŠÂ–ù·ñ0X´£»ÆîzÍ&o·Šf 3="3y±­-ZÚC¿{绪ô˜Pûd%Ë‘ÍísuA$éL—³r¡q߆ñ¾”ð&B€ÿJøg”@Ž”¿%Ôùe!•¿…þ†/z¤„»VNÌP©ù€v¥ü4)˜" endstream endobj 499 0 obj << /Length 1814 /Filter /FlateDecode >> stream xÚkoÛ6ð{~…à~˜¼ÕŠ¨·ºtÀúD‡¶éâû-3¶Z=ev61»ˆïûöOb[ ,Ë?º,Èx›×òjE‹·ùRr¹Ÿ^_þqòòò Tè…Nø÷Ԡþ«FdªÁXì¤ Z&rÜ0 ]\“¹®ùeaÚ368`w{ßG`y¡}õéÕ±fÀŽ;€:¾Ëˆ ´öìA ’ ÆfN@·ç-oE)ª–¶/¿¶¢jÀ¶âëgßaaŸãû]¹’ÖõÍÿ Ãz@‚-ëÕþ·r­e¾Î+^Ð.o…äm-Gyú#<5åóQ*´«x)Féåtþ‰>Ÿ¿#øÀ4¨'­Ä×­ ZiD¶çWù5º_a>¥Oö }~GØg û™>Ïx¿Ž uvÚ3ôH@=}Øß}~–Õ%Z`Կ︶G»´ØÖ·COgÅ~#V²sWY¯„^.5ÊmÞnhµ¯wÎX¬åQfðºÓó-T¡¬ÞªãaCB TƒK(tç¯iâcòƒØ®R»ª[Z¬D“É|IŽ°6ªœI¨u‚p ²¼Åž¶Ja\4­ÜeíNê-•; p@]¨tÖ•¨¦ðm:@Û©¼¡;õ®ÝîÚÇ° ý8µóFW™ÀIƒ gªžäÈ9Iì¼¢ïJlÑÐ&ˆã'µovÄ“kD¦«5l>Bõi„i/Á²›ZAà;^˜¨"í„pæ¸)üÇ¢ú¨’¼ÁH•Ôµ/)@ ›ƒ^ž½á¸¤,*ÚBXä늳ÛúˆDž0 ÏÖ¡ enYhó ‚–µÔß$B{£;lSÑð-ë¦%ãú)oÚ±/°il0ê1[òBÏç+áQ¢KÄ,´ßèë{Ì%Lm¤à+y‡ Jí‘RÇWcøî}¤Øê¬g”°$ÎHmT §Põd½–¼l uÆŽ¢áY³©wÅŠÖ¼@A÷´¹XÕŠ—y‘sI;ª¸Ò%V‹#vgqÍ×€%NèA"¹P ÝðÁùÚÝŸF‚vȆ:ã†o[¡uñèsõaÚ³4ÅF£ž]칦ٯÓø¨3ÒhTè%d8nÄ,?u( ”{f %䀨‘ªëÄ€8 ƒG]‡yšªïøQ7Ô`µ #Ï>ÇhÂ*ÅŽ &O]°p5MƒCÁ‚ý\#÷æé‘nçª>Ç<]+/UÓq#ˆ‘‚¸¨§a·yµFhhcŒ–*Ì¥×:Bh»ûfWs©Í#XŸ‡ö°úºFˆ*öZ€ßB§Ñ`‹'¹†¶œm$¯°Ù ±R,Ž¡p¯½Ö¿7èG‘¯—nMºÀøçôL¼ïO¹úêÚµVp< ¶nbi«b$TXó“?GŸAâ¤a¬(¹]¸NÆ|:±w2aùŽ˜¿2èƤMƒ§Ö¬Æ>| sFy£•±à(ãXÌãÈ(Û¥‰°ÄbLéŒtÜY˜ÀÚI’Ίœ°"bÅR1ñœ( ú> :X#û]-… ¦/SEÄõ + žá~ƒ|\ÍÀ‹S»äˆ»§ ªòF#Au¯ë ' zNâȧò^;ÉVÅ.â, Š* ñþßc1JÙ!*}ËGI‡ñS'pØpÉ3°¢ÖûeOA) ñeBä’ ºŽù̉Ö«c[ê–7¡n-»g2nàqQðœZ4`åúµ\ÖR#¬º&Ôòs¹!pYwVâ2/öOÆ àÁ(ÑŸ»‰:¨ÏË'OžÞ>²]´|MÛ¼åú½P­x$7;Q¨b“³Ã`>»ØÑ„·{Ü»vú{t„JSîçuÕŠ¯íà× Þ:‹"×sÈ@’Ãõ¾$oyµÞ©6ƒ» ¥€PX¼¨KŽêA›oØæ J仆Äï—‹f çù®œj„éö}g¾[‡Èû—>8$|©óv¯1©/ \›Øôê¢;¥íWýZqO6¿ ÔY¼•y¦i‘ï£ÎÀjÃø> stream xÚÍZÙrÛF}çWô£\Sjô¾¸R©Ø–ä8cÅŠäÄÙü@S°Ä"8$4Žça¾}Î H‰$Tã D£×{Oß­íLÁdÀK3§ñ2,R¦gRI¦£aR|¦¢Å;2c"ò³‘Êó* 4ÒMuTL ƒ®“Ò9tB ´Œ CUui™Ø‡Ô1rÐÚŠÈ\dÒI9Z"aQO[$hpŒˆ:*2ÒHõ4E|Œ¦„¤DdJJɼdJIŒ”²j`ØQ Õ WQWF¦œÒH µ³”p`ãé™V(7“±ž¥˜v`×(ðãšVAÙQD#:ôÔ9†‘ÆSçÔ(PHhEXSfƒ|AEx,p64®Wø3à#X70`ÏÄ@M½PÔB3+ñe€ªÕD2Pµ4‘„ªuŽš{Ì“¡qs’D=Gœk™³J ŒUHX*B¯JÀì'0“Ä’Ša #05è Ô±Že(Ðc“`"ÀÀG°Ä%f 8o™Gkï1ÝT7PkLXH8¨4¨¥§DQKÌ0ÞÔƒÅÑJPì)AÔøÈb)A²è!„ cÐZ‹±YŒè¤šD,RŠz7XRõ2eÑ9D] " „Âì©{,,¡V ¸%ŒI5„#±Å¸RxÈ‚!ÙžŠ4‰%1G´Ai$t@ ^ä—ãÉÕâs–>|õK.Xò2›³äˆÿU¤“ù8ŸP£ôßi–OoÒIñ„}ýõ`si§Ÿóôc:K'£t^µl|£î yûyš²älx•’ùÝs(¤…a8$çé<¿¡r©¾eÖiz9>Ïÿb¿ d@V¹¶ÁHâûzBïX¯j?›Lrtø[i@Sò ,ª·X¼åâ­Ê÷û¨]Xö3Hžç³ËtV -Þ}£‚ýUƒ‘à:¡‚æQ`²¼åB*T¹¸ýP”]¼OþDGlÐ篪¿ƒ›á8+ò§ùŽòéáåÏo®òü*K¯fùítÎGùM â:ÊZÃl"ÔÈÈ €Òr ½·ÊrkÈ.y®´G½;òî&ð,Ï>_§—³aFs}žNgé” Ì~?j6¥9©š –X$Øe.Âÿ›Èi4”„ X¸ ­#·Á£vk‰yƒÉºÀd)'ã,-ßùìfX”:5MGããÑ#Ц”ãFÀ”8 ç0÷RÝ9ìჴ ‹a¥å³ÛQq;K™<í4'#«¹WKê¢áN¯'îÕd^ ³¬3ôú‚A#ÕK~þåWr_ÞEè4›ÜfÙû«À’”CŸÀdWŠŸœù_$-Eu>è—¶.€ VÝ£§äl–.R° utÂ’·é_Ūe蘮Ø5]~ÓÕd8<Èð ¥÷Óh„^¥‘šh$‰lI¡Ó“·g5Üï8Ç맵5÷{α¾‹Ÿí‹ŸÛ˜v5Ì-i‰|µí‹Líw›È„¾ÈÄíiW³’¬¸Þ™– ´P¢ÈY®±; ”^ÞŽ`8^ž½f/¯óy1ÍÆÓ‚îÄ`7KKcK²ƒ£§Jˆ °+ ÚÿŠ§ùåæ·ã"Cчá|<’üãøªî2ÇøTˆ&ØO錂5¦¹bgÃbtQˆÁìá0›^=š<»-®©Å(½üðM–†QÊ~?x>œùmÆ^ÀóŽG¿?yÒž‚//àƒ!oÎN™¬KÑ,-ÁN~yóÝ·§Çÿx;¾Iç‡çùÍpRMÃQZá€QiSŠHÕ'•¢Îx6/^\g`Éëáâï y7¾,®)ª£Ø¶û³˜Ñú÷þ¼RÔXÿSˆYð@l'£2”f jò 1qÑp ÄÖdŽOž½°h­÷eÉá’ÿ ï‡7éf1z^ZvˆeÜ¡\¶Ù"á$^Áü@¶ç#²,È…j §ß¦ã«ëÅ'EeÔt¼Bd2=› âf¹‹"½ù©Âõt<Ÿƒø^ä”è¤öÉ÷Iú¯Ûa–\‘Ú¥³dœü‘dé|žŸò'•"ÒŠ>6mÛC,ošcX§COîáº]”ë8Ž²Å1}.9z#ÇöAŽ‰Ç|’vYT¢Ë⪓PÝðCõ ?”Ú/(Üè[ÆËtW[Z¬«Ú_ÐŒ[ãG0ÓFù;ñó›P¼L£¿ºÁJ\ª^nVwݬêëfÕvnv¥šÃÞ„mÞäM7ÍÀ ï_Wu_ ÔûJàn,¯ùѬ]0ÜN`¹²ÛBÛ‡DínÞMÙn…é7¸@Îðª·,¼ã^¨õKLá2¤*ÀpãþVa™K;oXèB·±êµVî3z))¾¿¤´W°¡){FªRȨŽ®T›…ÍHUý#Õãw?þúÝëû#UÓ/Rí†dÛǪâËEªÿ|ýÃÅÑ齑ªé©î¯þ­"ÕMb´©ZÙGTƒx l«ÂÔ0ò[Īf§Xuƒ„¬Æª´Íú¨±ª—ð\r»1Zµ[D«ÖtÜ£Uû¸Ç†°ú1¢ÕV°kÑÞëi¨ŠŽwvÇg-·á¹ð›p%7瀷 çÕ%Ÿkãœ\œ2Ú¯›¯¨bÃ6=wúÃwÏÚêÖ4B‹q¤èÚ,·[–vJ«†RV6씂¬Àb”ûYµÍ øö•%¹{Ê2€[ק7Y›ºÍCÏÂ`·°Òé­Ë¦–ž2é·Ö•izJ HuYX¤é©ëQ[JSy]F´ušòKº|KºÊ4ô"Ý|ßñܤ}‘ökø®ilbRÒ·HSŸ& =¥ñ¶ÐžÿÁÓäUŽ+¼É°ÄæN€5=Ô¾5Ï‹>Éh»Ä·nO†¬ú+k™¥DÝ÷4ë¬Ö¿ë¬ÏC"U‰´ë”Õ"Eu´\ߞį•G"ÓH7Äáý¶Îg hzé|H S3¬ò¢2wþG/²[È»¦ rÓf‰\õ@t†Ÿü¼è6¦éþ“ÎòÚ%Åõ,M+uQº¨?ÛÎÉ©ÚmHeü=ʹŽ‡r¦çÎV~‚îTô]ÀÃ)šPÁrºóaœàA1×ά]C¤Ã¨6®ÙÖ'3†…š–t ,9Ýã1ܳÕ)üuQLŸ&ɧOŸø(Ëó+žÏ®VnÎîç¶[«÷mõf?O7u\¿õ¾Wqñ¢g@ãåV›G+ÕÔ‡lì§m»K²i±ÜÞØkìÙÝíIu" }?лG†ÞöÔQ_E‘tOi×++’¶Q<™.%&"N—äŒ/¿wQ˜i>ñŠ§P™”OÒbGÕ¥[ d!ððèÉYY®éJ–-¿w¢&»-òÃQ~3… ÝGW)ŽÛ¹®Ts""²UÛœ,nÔ–8oÚ}Ô{ Ju0ôÕúøÈBçÞÝ‹Û…ÈàVµ$ì~¡«íKÈJ X©ýœI6ó³ä¿ªí©¤q»+eÃI²*”a«[0{V³>poUÛ2M»ºqWú¼Tˆ]QðûˆBŒÐwãu_nb÷À!ÊžÜDõŸéÎMô=Õ´ºò¹Ø> stream xÚ­koÛÈñ{~…Ð~¨ X{ä¾HÞ·\âR´É!qq|‡+-16Q‰HúÿûÎìÌRKjeÅAaÀZîcvvç=³é"¿t‘ÉE–+‘«l±Þ½J\ow· Æ§Ÿ_¥¯Û=éågîZ׿%©^—CÝ6ÐcÒ\/Óââ÷ë¿¿ºº1Ò£Õ7bígŸA=·¢ÐN`Eb4¡}_~V.ÿƒ(À ®¸Y†ÛÐQÛf¨¾&(0Ýg_v0Ûí´nwxÏù²íyKÜ›å! "¶­/Lºl;üË€${lÜèa¥H“¯½„Y²¬E%°i‹åã}9:uOHôCW¯‡í}5Õz…p+% ad¶X¥J¤&%€Uß—Ý1ÔÐ÷Ü>ÔÛ u•ôƒ'ÝVCEã}ûЭ«p úôòKWîªÇ ¼˜î¿4|[öÕ†F‘±ë#Ý°í›vÿ#Ýê @8ÉBØ9‹ÝR*……¾¥(å•HÔ7sW@tY¤Ë®ÚwU_5x&¤>ö9>ÃÆݶ½-·Ô®›/m·óòí—Ùl8í/¹Z ú|?Ðïºmúº÷°ýêqÕPvwOÝ–ÍÝCyW]Y5PS¦LUšD Ó#jØ^_¬àtÙck€FWÖp¤Ì §8ÒÀ︘H ÇM0,d8sG,·ŽË¢+hAûW‚}÷õ/òÞáŸLùqWâÐñö-q}#Ì Ÿ”,ï\¡Szþ¼«šªóÛÂ÷¾k8„—o@ä®KwD`ìô Ç &·ßeWÅŽ0aäz-A=õüK?]µeÔðë·Ä$}UÍõ²VÌ•ZXc…έÓËÂÀ˜cP ºSÐÓžPSûõ«@DSÏ·!ÍX­ø)JHHú¸Ù¡£ü¸ž·í¯Îµ?ñÁ~¿Dã„üpWшLççÓE*2Éð|§íŽŸ}æ4s ¬6L 4ÏR¢9©CÐÊ©š NȽsiVEB*å“Ù`Ú4sBý×ÕÆ)<øºõ íÒw!§?¶Ûªl¨û #˜º¯z?X'z̆çáþZê@êZ”ì?k‡†VÎâ¸Á¦ð*TáÐÆ¿¬¤O'8€ˆë›\ŽžàU¥ ‘æra°an^Ì«~ý*¡î|›¯~È«’p¿ù™NÒ;f4Ö3# Iuä%™Èu:9À3NÏ>ƒîèÈŒŒP3T+j!u:¥-Zõæ.꧀ÈÀ®'#øRS™Øð+Býbùõ«@äÄóm¦rn+H¤ä Ü|N哹&R 'Å°uL1e´0°{x¢Óó³Ïà?:RŒ° «xÖCZbÓY×JÄÜu%lêcäÿבy¡k>rf°ÏÙ8lLä;J2Âíj6¹çÍɇ­’êÄžpî³BØ|ô«>ÜþÑ?‹y¦…†°aŠyݳË¢µ=öy `êÎõ°Ãÿì?t4€®þ°¦ócš/ƒ§ðP¼›vÉãàpÃñ’pʸQÆú|¾QœzÐV*;¢_”|)DZ&¸‡ Ì`M6ͦ"G-jŽ0Ñ[ðAc˜ä¨¿FDà*t‘ÅiL*¿ïxÊ»ÚØG˜™d“fÈ®ÂÏ]ýç…‹)èsBiFú©ÚÒxUŽ(0/¨.›ÏÕn•¶$s‰{ö={”uI~!‚?îÝldíÎEŽ‘_ÜlÐäÞ—é*Á™&ŽÃî ”ÉcŒà_‡ Â.bnssMæ ‹f¬°½ï }ü¨›õöaÃKÛ¦â^Œa!"LtÀá »€Ø>a€týºàl`Zéûrà×)7®Ð èùå¹q¼þÌ!æÛL‰„ø‘}Ü|>œ…©8ä3Q Ic ɤ1:YJyä åZä…\ :(ËÏÆÏ^Óc¾Ï hà; .xÆFï$ˆ4U‡á¹]c`JíÎMØzs½§=oÔù*åE$ãõg7ßf&W€5‘LÓÇÍë5¹DþLu AÓ ©fN.;èI#øЙµàSçBËsYJ?{L‘l4Œ­5¨:;ÆÈ©}ømZúÝ=Ë¡EEøD=m·q<Š\šåíÃ@ýÎiÄ'yªfÍ+ºªì]à‚ðy6%Î0‡ŸìZðžÎåX£’f£¥2‘Ú©'Tî]àH6I¡• !ùcJ>½ÖÆöºÝ½èóÆ]?ø“Ô_¨Xgv‹ÝÎäÊb¢uÎ,½¤nmÄj‘@8|”<ÀQ鎠L%sT:7Øu0Íê ­0ýúxž¾/ƒa¿FДý…öc=Ü3”h,ÎI’»ÊÅÝIÜãç!¸Ç/çá`#ê½â€3ÿp]áQN‹“] ïâzÍq}Âq}ô°~Ð'§ÔJ1ËB#rùòhÞ-^«#¢7Ù`&ê1ŽÇæ$ŽWzŒ aè8*”:ûo&¨?ctyö\ç@C£‹Eãx ×2<·íæ)æK+ÀÛx>tW8æ:ÿnjøõg9ßæMFªüDÞï找ÃÈý L‚ABñ4ò³Ï ?FîÚ%¡}ðkÜTZA´›5ð‹h¹ *k'ZZu"¼ÕÂJRW^FŸ§ÂB>„>”’—\ÍŠT”2ÌRŒÙ¨°@ ž-'e‰…õ K‚ÛŒiwi5š)§»œmÀѲ¡²»­©nÐñÔ¨ºÂ% ®ØÌÃÍÌjN£>’™ õQO=§X… ì zj²—'°xý*ófÛL¥ñc͉̈́f’yÎ\C‘|•§×Nð&]E“Ï ;z/è¼Ãx²z$„ª¯%ñø’]] ~}³¯o·•Ÿ8Z"a&*ãÜqZ.àØŠk†uÔõò 0ÌCÇ©k¬†ÉÀS•áBC˜`E’|Gზ¯‚õ1¥>Ý$–©Ôœ¥¼úŠÙ/ç•y¿úPKû—4õ°TGñ Nq259Ö3õž}æs pÕ×p³¦eÔ×Èy¶ìï]•à±¡O_©À6•¥ïºr·+;dðÂúnpW›=ú·8}E VxÁ¦ê×]Íê Ÿ@Ë ê1¸§nxd_c]ÚŽ)ó|VEEĨ|ìæ4>[ãÞ„Ž/§È/©¨8`ýeL‡æRävÔÁT÷ÙX–Ý£&š3‚#kF{Ί. NåÂòdX´v ’¸ë2Ë\qõš†G:®·ö\Eç—ØÉEy<”Øéeˆ¹áûË+cbm%Ò›éñ?®p²íÆ÷Îûµ’»‚w_ÚíÖù¤À‹?P8åæ€/THÌëK‘½¼@á—¯ëcsºÉLè-×: 뛑¿ó»‹=†äNÀaøø!Îñ±KžàùæÉÏã« 8mª&øòS¹Œ\b&JÂä/ÏÝàs¤`mü9’Ÿp¢®Ãúrâ°Ÿ)ãH H Š+Dû‡gŸÁttªx—Ál·÷€šÔh‚ ~\¦X‰2'¸èO.4ž*‡‰Ücð—'ÏútV™®Â—b‡¥©tÉm ~›5¸è/1'BÇL´qŒt& ;ÁΉ/G[T§ê3&“ñ‰æëÃ2#;Û§ûjƒI¬ø[+à†gAB•Oâ½ð ðæ"½‰Ì'j<ñ' ãÙ ‘Ë~]$Ç÷H#ä’'ØUÕÞ ‘øËIB>)!rI­ŸK?î&3~öpnò$ 2«xª`WíZÿ ³Èl=§òG3Xï_[‡*ÀâÉ©Áê×y^×]u;j•=ÿâ3ý˜º\–Ž‹{Øï.¦mª¦ª` ìÕŒ`‘ñ—Ù‹r™_ BG<&0/éåÏXoqk«í!KslÒùnÜF‰?^r@šìbÐ%'ÖÑÜÕ&ê‹ÔnüTªk`»¤ŸßS)–-ÅÙ¹é# Ä’usE¿Î9¦§°ä— ’ §á°—AlŸªƒ€á•¿îIäËë ¼~ˆŽÙ6î6o~­·…ò)X Lå M^À¸LgG¾fl¤Ugä¹ ,Ï^ÓcñÖ è4†ÉAÚ½g©âW ÇQ…,ÕS asåPéùÇñœ jˆŸ/˜ôƒ9dóÜŽS¸Ê9Áóã:·z[7Õ%ÅäÁƒ9Rl†.'äõƒãtáY×χ,•9->Üùª;u¸¼${[‰ÏLB¼B›+‘¥£'û׳ªë½Xf¾¾§'¦iœ8@z!Âáì$Ȧá£>˜¿«‡ÁŸô‘²ÈÖ|ùmø©…ÐZ?tBmÙ6î¢{UêµüvRñÕfyuÐ:Á8Ý]®’††×0õ¾ìgƒsçÚ'6±_Ý+V¸»"=[¥rB²üÜîN˜qÖ#Asr¿ˆá ¾«›fÜÒçžOe£ì}H}…)Ô×RØÜLŸªHFþ5͵CZŒt˜¢=¶‘_÷#•a¢ã ÿpD¹'(d£.‰aéµ:%!žhßsÈ‚ÑY0tgÎ-c6C&M2.àfÇxð !Öq¦ÖðÙçæç@=¥ÿ™W˱Ç>öôcŸ}x{õîý‡«·çßJüHe‰1‘†˜î4öÉj!¿©7?\_ýûúü3|Fi| µ_‰’œÎ]EáØïAòíǾ~ÿ!ek¡¬>…ãÄûSìÐõqìtqXñ=Ø}~óúúúêÓû?Ÿ¢5ÇpêGªsD. ¶ÍGõ?]½Ž²”Ø<…]W•›ƒÛŠÅº8^`ìŒÕßsw¿~z}E,‡hËžB챫‡*‚z3ÿ1‘/ endstream endobj 530 0 obj << /Length 2623 /Filter /FlateDecode >> stream xÚÅkÔÈñ;¿b¤|ˆG·cÜ/?P.ÉÁ‰(,¬EpÊyg¼¬aÆ^l°R~|ªºª=Ý^³l‚"¤u?ªëÙõêA,ø'™\d¹Šs•-Ö»G‰]íÞ/hðú×G‚áV¸ò ÿrñèñsc"‰‹¤‹‹+ÕÅfñ6’Ér%uf’èÕ Œò¨jÞ,E´^®DÔŠR*zƒ;YTáÚº~—½.‡ºmh·l64ø{}Ù•Ýíò·‹¿=zv12e¤‰V÷”ÀAß#Õ¾"‘f@œ4NŒ&Y€³ ©ƒÌi,ã´Ô˧ÿü×?^¿¸xÆ zŒ°hôÉr¥µŽ®Ú%ÔÑ®\‚†nW_ºz¨Xúõºê{ÔLÕŸ!ÆÅ*ÏñÅJ¤±H™3/WišDOéжn*Âø¥®i-¥Oƒö»%èû’´Þ^ KVh-±¾¾Ü‚™niçªÝn[<øÿTZ½´ÌÚu»ÛU÷Ð?±lJ§!“‚™®«‘—,ÚŸ¤ÞÑ~{Eߎh÷DÖ­ŽhÖmÓ]Yy§É¡«¿’Â’ ùP6Öív¿kzQ?˜ õ.è>åþ}ÊÓ8•ã}j÷ÃÍi›<ÚÔ`¼¨Ÿ»‡p®È…;ÇKd*N“‰Õô`´nîò9ÇflÜű™ªØd!—æGp wÞ`¨‚?å¹ÍNiUƉÒîø»Ä$Õ׺Ø1êr»e‡úŒíKËã`^Å1î€N‹QàLJœþ‰o¬¬ý»«ˆ G‚XnF1cfRëXE,2Žþ–¹"z900ä7°0¸mÙ´uÕî;ZƒTnåÈ1H1žëv¿ÝšÆShw#àiDN£m ¨«¶6Ç3²º¡ïxÖùLÇóW\#4oÖ¶l€%ô›m5'TËW~S%9„æýzØw•»­&Ns3é¬Jd¡ï„t\Ã\”A.X­Dô¬\ãæõa­¼T]WõœT›MO x9q·-iæ0A­ÔX´Zã8x• *jÚ¨Ù ˜DMõuàxt@ÔÓ^ÙMãݺ%'ÒuB»(:µ,²>RË9‡°Ña`|‚ÖÝDEyB&®öÂa@WÝh¦nÁåO{Î*cÑ¢¡9å& Ps8=b?¤’oä$ìc¨6€øÚ¶ê~®þ.ýêûóVPä˜Ô–&2‘Ž¢Ðê£ê5c瀫E¹}b—eïÖ®ÀEm*†q_}¶Vê°Á…›}G½nÛW6šeiôìk¹»ÙVî¸;[ž«4ÈŽŽ¸ˆ6-– ŽÎ×WÕ´ó…^[ëbXn›ÞØÀrœ€ÅBÚî7\™6òÞÙùFÞX}½©Öœ‹Òº‹XÐäí ÐtyØüŲNãלÂ~;C…H°üûŠvd2Ga26HÇûx>!Ä傘¸3ÖèÖË‘©Që8!­ÛÖ{ʪ–9àM¬~wþûS2Ç !Ùm›‡5“߯Žf)&ÂlD&B()¦rK)ã R¦–)DÍSo-zåÏH9Eê[ ê¡ì…fKkd+(ócΡ P!«ßc"wþóS2¡‰?2‘"Þß¾ „ ´o '³œÈú†#“ha")§rŠ‚Ðø z÷o[„WôŒL”^Ñ‚,Ptz|šÂEÏ&8=b©á®Ê"`ö{lâΟàJ&´ òG6ˆ«iþö©'‹ïZ™QûzFû4ã\ª{ªßAŸàŠtj€ŽÙ¹¡zþs½±™¶ê†Ý?Kˆ‹®ö¤2nzR%àÇÏ3`@ÎAëÀäc©âÂî­Š£½Ieä{•™C$ÉŠ›«Ý0Ågqª¸×ò°èÔpÜÅq¦ãžö)Ãf_ ´‚õ~k›õ×6±¦é¸Ì wŘ\;Ê µêˆ’þX]@ºÎµÿXíæÝjªö´€¦ËXwPaˆï–¾$î…§d(?ŠÁòá¡–+ÿÕ•¢9ÖâKÛ S%(žÌ—Ôøtf;ܼ¸ó€mŽ?`%Õ`ëÍñqyªû¹p£c•(wþ—W/Ÿ¾8Ÿ££.ÕÁsÞ”kQ,¥ [ó{3îTïÊħüÞè¿°!O@}K¹ûQƒnHÛõÎrî5Ûk¾ ö¥ Ÿ´]/¼ríÊéXº²#?Ç–ß¾qH9:&K Á¡ï÷;º/ïR9Ðè÷Ù.Tgb4\=ßf2sd*¿ûäÐé}8Œ8£wd©Jâ4ËÝ‘÷Fj/‚Õ7Ó0ö-$C yæ㨪t\ˆñî¾üÒÿWÒ٦ʕtÝÓ®Ö6\g“ ã"¯½z•mØ\¤:ü¾ãµYsAiòðh;™š·ùös€Å¢ˆ‹T¦V£9¸–ðTªˆÇÜÅZˆ^)WSãoJ¹ŸÎf¼W :a¥ˆµú]’̾[ä±ÎÍ7/>ÆÍÑ5~šÃAÃÉ•9ª°ÈN>lˆØsxؘ L)$ä¼-z/áf1‹ß!Üù¬p&6ªx˜pê¤pÿ£|˜ã;þ˜C<g¯[ ÷Q>@~êigàù+ …ZÆݺlœç¹ÇX¬ ºzÀ§Ê¿ÍäÇO/³ñ{8Õ ýÔ]]‘ h0s®˜‰?,ñ7r~Á‘û"sv~(}pÊdæçPLŠ'A'™Òù~w‰U)Ž±|ïWY’LËJƒ}Ãe攦¢ýŒ>> stream xÚíXmoÛ6þž_al&7+R¯N×]»nh<ìC[`Š¬$jɵä8źÿ¾;ÞQ9u±¬Ã€Á€IwÇãñîåȃŸÅj'¾Hüx”]xšº<QçåO’ù\`t{œ?Ì< ÑôÄÄ›ÈÑì¬/j6½rž\¤‹6_Ž]ß÷ÿhìAè¼XŒ];yu’Õ œ œ&eÅkOYÚu”P&£äøÍì—ƒg!¡ Eø{Zm¸ošõM—ž'Ø@$¼0 ë¿ãbgvQ4Ô3mZñöƶâp^_¦E…Ö‚fWúB†’$=}qüøùÔš¡ ŸVÆÔðȳ5v'Aèk˜gY¯›ûÖâ¬.›#‹§^µ‹U˶—ñóN06‹t™ÂÜ€Õ¬1P|äýŽ]Æ¡ó–ÛwDæÙc¦N-ª>½‘Œ…L¤-^¿s%/ô¶Ú:J³œ–ã4>ìÔcóý#ã½›Þî ÜW³¥ñ­¥qz›Fi«ì··ªÞ¨d÷²z—šwê·/¤„b¢ ûdÓã†.$†1Þ¾ü:½\”9Ïj¾®« c Yʱt€A:-O²ˆ XŠ9ÝðÀi/ˆ ûguYÖc•8ë¢:'æE“¯æµ›ÕàÎÄ™çGl±uU×ÌUd®¶wøÇá=ˇ–›¾còÔa¤ÁˆRp¿­3*Î6ò{:Œc72>~¼a‰Ñ©îi>Í»KÑ‰Ô ‘ç¡fr•‚'Vþ9xŽ=·ð)Î.ÐÓ2ég!_NLÒSõµ¿yZ*O¨$†ˆeã†ëm„†ç[—¥¬ë”Ò6+.® ælT…gßÖ4Õê@À?&,M<•`9ô!ŒhBg'°^m›³dánk¶­ËH²)#@Ââq¬=+})â@Ù6&ÈupÆκÙ3ÿÑZÀ3ʺúÓÕåiΑ_s„.óRë06°2íìè;{K*ÿµê „´Ï¥aZ ¹»4…&—&hn)MáÒ$KÓ]T¦¿Y‰vœ.YóÉèñV‚;JÍ`ž¿YZú"» ö©Z²«†Übæ1_Œ|"<Ôÿáñ K¦Ú+Û Á>–/dÙCbúŸ CP,–`›Õ—„êF‡IO#Dò«±þæä•„Nòs"Àw5#`^å,ò”°Å·ä´T_P” “Ž§‚3 ²íÝK1™lᯆöŠXun@0Õ§•Ÿ¢ ¨ßjàB`j@c@·sÕ ¦‰ð#i8ð®´Ë”]°ž> |ãä׋eÞh#ÂßS‰Spáð; _vkà~7¼€…ZÞGÂ`\øøA®cf9ßAž‚¸f•¡‚ v×EÚR”ž*­0V-<ßÈ,HÊ#Ú‚º7lG EäG‚üðÛ8ñ;çU]Z1KEÓYX½3ýš¿Íˆ©Ê×4.i±Î¥8îòàÑpÔ…"‰"û¦~¹çŒAP ûÍ€‚ûÖdYk× Îi ðY8¡œ[Ð`_ àm´ý*pW€)¶v<ƒ›B=ˆ9 '(_L~Aó…R ^‹”óË—pï¯1Ë€–§æKú/ùËfèry´F~Ы8 $Aæ¢D‚•ïu5'1¸‘–Òñl‘­ÊtIä,mX – ¤ô¢ÉYž®»Mžo¿Cú±'BØj—?–úR„0>?©ô{¤Mé?LšåîfýÀ“ê–ª‘yf õØÇ’¬~õ¼¿ ϸ˜Šü$!}ýP0~s±Z~:G¿„GyÛû•a$b°.9꯮†×í˜öf Ôö–Aýk*"Øm7ÝTw"Ï©+ÄŠH² XÃ|T¹jL8Ö9 çð<iUSŸs+¾"à¡^j„‰™\yÎϾùa! hc@ãºY4&·sÖo@)'ôí"Ø{µÁ|®Š_ÛÖEÛ¯|»È2Z Lø_ixB›G\|dŽí/6ã’û endstream endobj 543 0 obj << /Length 2112 /Filter /FlateDecode >> stream xÚÝYmoã¸þ¾¿Â@?œÜ¬¹|“(íá ¸×ô°Åm®È¸Ù ÕÙÊF»¶åJrs Üï _dJ¡'M>´ØEH‘Ãy!9gÆlBá›(>Q© ©P“åæÕ£õ§‰é\þðŠYºÎ<Ê?.^½ùsO%ÍØdqã³Z¬&WçÓ—*¦ÑO;è¥Q±ý0eÑr:cQ#BˆèΨ¨À±eù‘2¹ÌÛ²ÚšÙ|»2Ë_ê¼þ:½^üåÕù¢S*æ1‰¥8ÑG}ÏŒDúf¤Ð•1X“Kc (¦PøÐdÆI#ÔPµ·…Q·‚M_;Ó„QÙØõ‰¿>–DPáÖÿÓÅâüo‹ I ö,ákCÒ×{ƨ"TfЉqð‘š×VwPT+Líçv·oMwUnŠm‡3"ÞpÔÒÙó¯öí}éÄpTÀQÀ¦ ¡ 3’À_Aàè4WA8aDLgq£p«Ú¢.·Ÿ€™Š£Ëbm®Y@9 &(’{ôþR™±¨vKõ×&ß5¦—Û‘ˆ=‚UµÉKÛo+Kjšuõ©\æk;æ9F«7UmúÍ._Úá4¦f z¬“ nõu†fh½a±ÛTИ—žû-+})yÔxVáw¹½©êÕ[4Ø 0wWM¡µÅÊLænÜY»î:z±@e›¢ú«¤¡©š$x)ÓþJb˜ƒs„?ŒkÇíøìÖÏ< Š1çX,ÖéËaT½Õ/Ñw®°ëøy }Ñ'pý”«÷×òÛåŸì¥eÙÐNFS"À=À4~–ñì@°iÀÒº^Tá®loçttS­×žÚ¹õ0´ë‘þ=Õ—AŸ(ÙÛ ;sE${*˜üW0øáûùbq~ùî⇬X8ÁKÂÅ (8“–U ž`¬©ÌÃ$µK#±ïOýŃåãvÙ= nªºqGì”L’Â*)ƒXÞsÇÊR’$©‘4o¬·o§¿æ›Ýº0ƒÕÌCx"<”4:àоµßÚ`§„Ž[ÒÞæ­¡úgèŽp%I¬Ü.”Á«AOÅ7¯qâ03ØR–%Žôó³NÜ7=;Ĉ†‰;ñ_VÐò¬ g¿ÝZï„5w'lÀH¦D*Ñ#(%Ùˆb’$5£“„dJ¤F!ÆqáuO,ÖŒè ãQás’ (#»-(¿…(¸Mp±m?x HÉROUâ*úÎ4cÂàKÞYETÖQœaôD<¸]àî¼ '¿ Fœ$•’"b)a"9˜AEHR(èµ ‘ò sHYF`/†Ï¸ÙÞ$¼½a49crôî"è·{Éôa…Ά’ô ómˆáLÆÙ0Ñ‹Ò~ž¦"²¯å2·YÏ!äRQëPÞEãÑoí{xåïð3×OïÛ ¤$í=¿›bjÍMã#9~×^¨<ˆ1ûu7Ùg+,›êý»ŒšvY­÷ ?|º¡xÿ!õé:T´ÃÜ40 ©$ú ˆ^C£q[Š7åo x+î:–ÁoV3Ž!ÇølÛ/½Ù÷vô¢7ª/ÕÒ–²ÞS+cÆì::Ò>4o÷Ç‚F`ûi>Ÿ­öy•' §}á¼'\ü¾<ûüø£jŒí;´¾xÑÿåìâŒSJ .‚Çq/©”&©œë¢Å²hLÊðȼrŽ+qYœxÑ~™œ{¹ñrJüt9%öulç‘æuë¤Ð|êÒ@žè<_âÌm0·ê@´²B„[“å‰XÇW Ám®í— b³ß–ÿÚ¦_®\ªÑ«îÀŒ¸ý'1 jš®V$ö¶™úéªh™‡ÚÔªéóbÃHÊ qEª²‰ˆ5!EylÆj—ϼõän ¤Ÿ¯"¦Û|ÿÊݱæúµ™<–‰òÂx<}ýÇSQGý€ºC¦/ŸŒ2E!–ä/š:ÓÖÒ`V3®øÛp„Õ‘T3×ëò|þ§`tȵ…]~kÕ¨bu‘Û¤Î8l1’_Š˜ÄXSÙ¯#zý|ùnqT,õ#¢¡bw5€Ô)šIFxÆž¢Ùûùßÿ1ª\ÉXÆcÚm:¨Ãû髪1üˆºi<ˆ–^¸ÐÝ<ŸÅF‹zP ¹zC§Ê­›Ö¨£íƒwÁ~vâƒUˆ¦_†èè÷¬÷¬|AcbZ£ã²6ÈŽ¤µ:%0x7R¯:n lÀª9ø={3ØãQ U–;ÿpš c0¢àm“Op€ÿ›2Uù¼õ)õœõ©ôª>%¥Q,†›?ª>…¼Ž3‚ˆCAèâs5S4;Ú\)ã~}J¢ýEkHöi!”i¹êÁBÏ5ga1G)º ˜_qL‰®¯àyvqR=KˆL™WC¢(V€’0ý3à!@¼*Eçã3…:e‚ÒýÚ ½ÓHrƒ#3‘ºÚ¡Rf³pzoÉšýÎú}S’öÖ±pmnì ìNMš3x×6ŽÆû}ªKRS©öë•ù´ †-0º­J2B75ðÝ«Ÿ¨lðÃH¿„bôƞ˪F )¬ ŽÔäý ÕP,^¼¯ÏY>1ÊȾhù”êɼ®ÍÇ»¶î:âúy*(ü~á¤Ê)-2’Üt§~¯N®YðÓK(N¦fh1âEê&GdþÁI.7(ÿ±µ,› 6;4Ä ÷?ýõLC endstream endobj 550 0 obj << /Length 2648 /Filter /FlateDecode >> stream xÚ½Yëoܸÿž¿b{Ÿ´½¬">ô Òš"wuÑKØ ¸A ké]õ´’OÒÆ1Ð?¾óÒÓrœ|)Xäp8Î g~äªMÿÔ&Ö›81~bâM~zµ9l¸ñá—JøvÀ¸›p¾½zñêç0ܨÀOƒTm®n§¢®ö›kï/Çì®sÍvgŒñÌëíÎÚÐûÇÝv§cÏU—y}‡CÖ»R^ü;P6Ϻ¢®€ªÄzÚl?^ýíÅ»«A‘P‡~hÍ7jÝs?£zù©µ°ƒÈBËê_mãÕ u{çj˪=ö¯;-·w׸ÖU[ TRýåv*ëåuÕ{Ü> èŽYÇÈÉ`ÌòÜ8åµ®Jã˜ûà*×d%wNîT7hÍNYÒx§Œ¯BÅ“’¡S㑲بê¤6êù Âîƒt£¼«£cº,Cí¢å©­s•ÌêÅóÀMqþ ôûFSû•ú*ŠÀ'¤è¯î$\3/èÀ7±í™îE)Û3Ú`eUv‚ý’EŒIÁÕb‘× 8‡ ^£90»Z¾¸_Œ?Œ:p.S÷ÅÉãê ­b­÷WWåÂWŸ%–Ý—ìtW:ÓdU[fš¹@üš´ñã$™àÚê×úÅÿùx ÿ‹ß\³‰‚NÓ´Ÿèó^­±~‚a £V¢±V 6jBÜÞâ׊¹Ý¸’TX(ƈ§,k4é=þq{Øx„ÞEÅ£ê8!ÏZ÷›©ç²™Ìr®èÄ"Ï]ÖtL\ j‰éÑßhm8QpÔà»)7??¡›Œ??Ðâ ãk_ƒ#íý‚'¸È[qn2u.ÌR±É8 ÖYØÈOƳ1Ë: $¬“U½™ ž¾¡¤Z7™{&Vuµ“³P>ÝžòŠ‰”WT·us’¼‹œEÅlM ,’Žñ bî¼$zÎóe3€yQlá!´V-7BCGá†X‚È  ‚¬S-•Ž·QÜ3Cê„äëN3AìÚþî˜6Û*0á—ƒ¿,YZÆ9%˜ïC‚ JÕ—Nb³DyïÆóÃö#wæÆEBËß½+‹SÁÞî¹-ª7ÿõëßweñÛ¶@¬,™5¦´SÚ0‡³HïæªKjøpÃÊ@® È¿Ÿ÷?¸ÒZ.½‹Ùé+;¬J LRlr£ïç-ÔåºáE…U1w2VÜ2™-ÑÐ9¢±gè×Z¶ #_›>Øoëz53ƾJTÏD Ä£d9À e\2;ˆÆíÚŠ;ß*5wøXú§µµ o€;²ö2ûX8(=…–5O-›BÅ‹†SýæÕ“ëYà ‚þðûŒ©±„RÄÛWÌ]tïaISÁ,Wk´RÊ¢¡Dµ]Áµž‹`-“L´ ,qšŽb_ÛM¦JtJ0ÍaR&üQšðÚœ2n2}7™¿‚Û‹>—.—ã »§Dì+î\_vÍÉ¡e‚$Üb›»ìàxà1ì´1(«Õl?OÃΞûõ—Bï²W«XÂWj†›zÿ°æ$À•–YD?á¬Ô@á6!À´(N¾ÛY2}7™¿²ÛÅ"sgzgAÝ4¯ßŽ™'¾2¡ÙW8ðØW:Q`V;ÛÎӾ깟Ñ~)tâ+Ô‚ÑW­ŽI„4ú‚†„e’€ÓÅÝG(¡£¼†ÀÙg@>|äu²¾JÆÌ©¨ †2'Šêˆr^>ðpåftçåT—cåÝœ‹r/QÈŸ¼FÌÛÉ2\5v]½ëëR¥, èâq!ºÅ’Îé©ù 6@¦Î`“öß™¡èz@¼ÆÊÄeú3ý%ð¤C†ã¹y&BFÇ‹9݇5fðâaÃ1?è…º–ú¡Ž0,“5ËšÊp`J‡€ˆ)øÍD¡÷ ¹ßÀ»²×¦$ì6Áˆ­lôèÆ ,ºâDÅyrñlyð¾(KnµÈ'R‹CUSˆB`{¾,Ø@Œ§†„ždŸ%"d ÆK %î ЮáÖ}ѱ¥ÆÁ—q˜Æl:B:Ô ·t†ö\9䨀h+ ï’uGtÛÍåU[Ô·‚ŠÜ£Øľƒá>6h¶ß»¡š7õùpì16ÞíúÛŹ{r9ç1«ŠöôÕûA<¹`Y #ãM«’‰Ã>Ó­…_a0RèIŸ’ĹƒµDQœ|bN>kÀ#"¸ð µÞúÊ (k„s š€,,E™ ú#–É`@ÊøSt¯šª¤;=vÈë3#(N0VW²¡²¨d³XÃî… nAp‚“h©§áâ'“l'tÁä‘Å?øÔ”Œ»|Òa;ýNÙI<½¥ ™$¨IÐsœŒáºïÙø&4rÅãý5}Dy‹xѵvŒê!.×ÁeÀU,ý?†È\¢Ù¢kÇ’’oØå’Á<Ãó Ôñv‚oëþaAn)p[²æõ*‡ü˜ÑÊ^²ÖŸ†ÀÓ‘½×¯ÿ„÷ÎÐûál맘 üýè«qxÅs”L…~búTà'ö»‚ÈóþË…ŸëbO` éÄOæ›ù3¡?©mqSºñE Áæ¨þ¹I*ú£²Ù‰Çæ»]\|ÕUëÞQQàëù~ã¯÷=¾:¢¡ècŽTǯiØ»9Ëx$£,ëk²F?®åV±ô£÷~1Þ[¬-°OÍXòÛ2¬fØH/3l$I‘~2ÆРŸCé:ò“H?N¯øÓò:”– ¿L¯²47†t™ÇÏ9™¼„œû§"þð“ †ä:FA~‘¤ªµGñâEUGpêþ¹üâ¶>aƒŸŸ(NûÈS7ÅëpEOÚ@(:~bZÖÕM+ìÕBöðD‹¬øü£Ó‘Ï'-1]jºN3,ÌX‰·Öåò\lqµ1õá¡MY3‘Ÿ1òú̶qM»8Á=làB7{¨"ò¹¤1<æL$‹ ¢Zœ×qs”Pšk±OA7š®£©mt˜ŽÁƒCã£YLÇiî FÚ^ÉÄ^ÀåfÏÍÁ\ÊCà®R.W8Då ëå À²ÿüy ýØÎ^H"­*Q©­ú:…íáÍŒêãqúdMÛw«eíÒøµ‹Çû@XKÊFA{€LRLÖubߌ¯\͹”µé7—¼àoåÒn y¨(ݨ0ñmb¾ûÖÞÏßM¬\|—ËÌïí¨ð€f5=²lÌqaÕóGÜ_Üõê#K¨¨gj¶£¯ü¶'ÜÏè¿:\Ü×뜅ôoQêô§•·Ž#±:¦ƒµ È9 x|Ë`®ÄN弿ù4ÉRH¹® $½âZ͉˜«ùéªïò*¢œ-·¿ ºQÅbe3Xó5\ýpÑWŠo8^û¿a¬þ> stream xÚ­kÛÆñûý ýPʱx$wù‚Ó±c» Ûí?]Æž¸'ÑàC!)Ÿ¯Eþ{çEñ!:q€B€¸3;;3;;¯]åÁÏ_ÅÁ*N”›¨xµ-/<Â6»þýúº nF”ϯ/._…áÊ÷ÜÔKýÕõý˜Õu¶ºq½Þ:=çÝF‰c««µïl×ß©£”r®p&v,â¶ù/ž¯·¦ËëŠgM•ñàM~טæq}{ýÓÅËë“Raº¡V߸ƒžú|Ñx¾ç¹ l&r½PóN¾¿«³Ç¿£tà´ñ•ë‡>Ïüel·ÇòÎ6<®ïåÛ仼2CygÓÕM;á"†úÎﾋ¬È™æÓ‚„Efmg:[ÚªcÐ~94¶mÑø ̸ɿûtË”ßý¿ÏorÁ<áÏ‹›O·Ï–Vy²à嫼F»JGš̽‰7ˆ"¦V®~Qà¼C·@OñÑw¶ä4qèüh:ã«®9n»ccÚ‰'‘Ì©§¢v©ë Ë»Þãz_³ŸÆƒ,@µ_wP_95 ”…ã ZÃȶ4E!«m'„÷ŒxÁ`Æ;@Š~­ÌØÏk•º³t5O4ÇVkÐF˜ ‹«õûE@%“Ä)mYCìÀ8ñŠ‡†g·°HRm•`î‘ÿ׉rÜõ&òRçC›W;&èö¶Æ"¬­K+s5}]0X7ü-$”iU)Ìif×XÓÜ›m^äè¡ ç]û•=ŒŠ-ŸJ‚Úy·ÇQ fÜcX"ò¤NËp-xÖ'·-¯xØç[d¹çÙÆ¢BD_1A·ÏÛ~®?ànñ¦gE&- 0›öSçåg´¬m„º’-2z;œGnUãY(Ϲã @:Ç–òNóXðü=†?»\Ž”ÁñiHÄÀ¨? >]­•óƒ,·U¨›caçRÈÅ´‡L‰OèE%€h/Raoº^EÊIÞÕÊs#¥aÿ´ñ·Þ¼YŠÝMO7ñ.0õÉ0h5ŸqLÄÊÙø öT»žîó: aGGËt%×T`Ý– h“¼,Pö‡¡ sÂÅ£(E‹óa»=±«ùk+HÇÖ6O4‘—öé’Ÿ÷1¬½€Dj )Ù[s`PN8âõ):†¤¬ëþÚò¨D’cïçˆ94õl×Ü"„öƒÃÜïòÙE¯ tžˆã GœxµÈ1åAaï;&°å¡%”…­¾d¿¥¥ÿ'JéQ¾€ M¡A)[ÕÇÝž)Ä[9S‡b"–˜PÓ˜PNO< íü³_°g_ÖÎÖ´–q¹(Á3jf[œiì¶.¡ÎfÒÏœò{á PÎ3ËßÊ>ðÀ~élÕrép”¨eÒh”+h,d‹¬Ÿˆ$7ª$ìÓIÓ¿x¡ÇH;oº´—¸^¤V:ò\Mì¹Ü¦\/…?? ækŠwaýòÍ°~¡—œ !K]YÉñ¨ r5n^övio9tÀ苘d³“SÞ|K>HS‘^i»*Mÿ ì©7#ò…-Ì™’`WŸ½~ø®†žZ¥Ðg*q}sª=©?vO)™Á÷T@ƒ4Žgöf¨ä‚óa˜#ÈÉGëÁ‘ µpКRFFÖwûºÔ(Ž²)$t‚íƒ`b@Fèò ⑉·u;ã毮²¥DE‘«©€P:gæ¹7§n€Áî±ØÝöŒéC‘X×Pã¨U/$8eا†rEb-ò†ië&£šB$šŒ[,¥ž={ù‹4'°(ÌŽ{ ÐìTÒJˆõ*/¤Ö¼Â.BŒ{zïH¦7ÔÛ§<×W(íøÉÜA Zh_Ï…ëÐT¨žz3"_Øúœé´BñE]mÁºtQ‡ŠE\uä&Axº«»>ßÖë¶èÕþu(­Aì¦ 6 •›@8&7·Þ*ƒÉŸðô’`õ@¤åJ»Ð­Â¨X]]ü‹õjà+–«0R§ Üø»Áaàz^ðÿÆ®ý©äné†p£›„.)By¬È—èQ¨->æý‹Ë9ß@ΪeQc‚¡$ö!Bœöðl½‰“8t.å¹å Ò:Ž!´¶y{’s’ñär)ù ü‡QvÆÿÇúx÷'ù3ûÏuž=Á åÛ÷pMëú×2Lø5ü)E—¾QèfÉt¿->@u›Yy™[:2±@»gKúï³x2>ž-^^ù±k\Z¤kš;R¸1¤¹ Ÿ[b†nJzgƒÎÊMÍïJ06‚›Ü}a‡VŠ{¨"iC`jÄ*6G¾"ÀµÛŽˆïPD0îmdªçÃU û;>[:»8q|SžôèÃyëªûñ XÓ1»!ü.>(S•ªŸ0hô‚àR׫Sp9ºìKl´qA9 #iI¥è !Í\â¹ûŒ÷ J‡6y”fôN QûGßÅŽ•K0•^h!l–C± ß+ªO-ƒ¤0”ÚÒl›Zpló¶iŸk¸[FÁO–=ì-_m·¼“ócR÷y+kß9u÷xúì1ÁØ^ü¦‰•¢á/•|[ßµ\5ÏžãS=~*K!à‡®öNÑ2<DèÁ}€çE´…š¿†iùßg"Z6Þ²’gTtu¬ÝQ G¸sqåq n{Ð¥höªsøÏrH«€‚CösßÔeÿ!Âë·óúç÷ ¯R ÿÊZµ endstream endobj 561 0 obj << /Length 2116 /Filter /FlateDecode >> stream xÚµY_oÛ8ϧðÛÊAÅŠ$RéS®u‹,'—¸Ø[t C±•VXYòJr³½Ã}÷›!)Y¶iÇIzQähf~ÃáÌpLüÑd©8Q\f‹“@ÏV_fpóá„Z:ýå?&'¯ß‡á€$b:˜Ü÷YMæƒÏÞÛoɲI«¡Ï9÷øÙÐ"ô®–CŸI/-ngå—„wk§fÙ³¤ÉÊfBª„ÇÂá—ɯ'£I§HÈB ~¤Ö-õŽêTç$Ý[ÕYD‚PÕ9á„ ý0b^Yç­ u|)“$æTÄEˆ\? sXüuP±Áƒ&] TÁ(ÜžüÓ%›r¦6åWinÌ°+pÈèçV1a0ÜÜ HØÙ¨¿³¾RD¥O%‰¸¥¬›j5k†hb4Ò´ÓYÏüù (%8û •†æ³¬°ß4?–雡Ç2ô^Ÿš¹ß¾%íê·¬6£M¾ílZÌÊyV|5o§¯µ¸ÀJ¢[¢–8W <@žäaÐÉ»n,ŒûVxj‹¤©²¿­Ä<]¤ES%±¸›VåC ò”ÖòÆ«Åžˆ¾0¤sòÜe9+óÕ¢@®‘báA®–ôXeËU³\5Óy¶@îB>ÂÝ›1|“hã…eEO̶¦>JÔ®¤¼œ%ùÑ’4õsA-“*Y¤ïŽµ¦>ÄȘ6§–ÕbÛ/{ºÞúÎf’=â«ßËln¹¬ê O¢è1þT§•¿HŠäk:73÷YšÏØ}_<†4ÎEúwcL³¶ L9y±uWE·feû¡ÅBúïP 4óÔgÔÒJö§¦ÍÌ£¸îNM—olhÝHš>SDÁÿ€piëP;‚0ƒ42g¬õt1V‚È·ôFÑUö4†×²Jk3NÌ<²1#ô#Á/)ÌûªRO›gõ*̶Òk.Pï¼%6”-Ÿ¥yƒnö/P„R¾¹U‰ 8 yÐ!úøÑ…—1¶T>­EV$ z¯Â˳âÏ!VÝ{ݘ‘VSt>†Sh‹Ú ÿ¯p*SÇ Xí÷§1Iã“´þ3õ™‰ /%u6ÝpHZÊH3íÓ3nUÌS„^à΢*ûvL}¹ºý8ý4~7z1½s‰“BǗθ!}åàÓP‘ -Ÿ*Â@â00 6îV££!Úm^.’ÌÚrœ8„ c}8“߯GÓ·WãÉè_—pð؈‡G Šc"³ˆäSq‹(ƒã×ùƒ8  POîzwuy~1vF¸†ê8<ÏB#,šzÙÁK•A(Ä¢s×ç÷ãR;˜nßžO&£›‹ñ§•c 6J²ç¸^d¡UibM2›¥µ=·}dB „2ºƒîftþ¢ÅJΆI‹ê¡|>¬˜ÝÁúíæb2rú!„PEÀ/a,ž³]êl+¬ë0Ü¢ä%:©é×ÒŒØAzyþû~´4ÀäÚ^Ø ø$B­+Ÿ‡Ôû> #/©²rU› ðV LK&¹èJW6’N4-“yÚ$YnÉ4¶þj2¼eMæ÷fŒðë4Ýn$ˆ@BA8TLpÝH !¬ixàÙº£°9Óo-´ßû=Ž®È¶m˜Ût¶Ö•F¨~¾i«ª/Öªœ‡FJ/A/¡(Ç–‰òh¼Š‚8ÑbК?Òi©ý¹Ã6Ónëß²Ü*Ôì©g v]²Z8O‘–°]Ë Ï¥©> Àë2-¨\ ÔƒîÖ£©Ìœ¹¾,\#㌚ßúÒ¯XÿmrƒTbÑ«TSÁHó•›|ÍÅ’¨hëbZ­ºlÚŠ¨çÝs3s×;Ñ{¬G¹èŸÓµþ3†áf0Òv$&z\4F™YbC“ü‰ÚØPi‹9îÝ—y®Õ|ÈL®ãx€C/ÉWi}æα ³÷s 9ÞVAœ53–úÊ–“hVÜ’ži!öUn£EÝe)/[xawh$ðˆò^Ls†K¡Ïo/X^ߌÞ^Ü^\§·×/)¸8£DÅѳòx[£Dâÿo½v$öÙQò~‰}ÈŽÌmÇw/³£PP¸ÒçTA›`u^Ê›l™§Ìh‚AÏ„zðaüɘçÃåµ™ù˜ÝUIõã—Úy¡—dçQ‹å¿Ý7yŽdìÞyy¤U‰‰h˜±›LO½þ.Óyþc¨¸÷ê`°ÂëP§Çª®œ× \µì×WGá”p)5ƒUV¿X2}u2ÆŠ .œ)17{Ý~̉Œ™n·P®»üüˆ.?…›†dìgtù‘•àôÈ.ÿOl»ü’u÷cG*‘8T?E,£ .›bÝ?.à="Róë?ÜMœšÆÍžŸ¨£;¶lÛ÷Ívß|d:ú{zÿkAîþéA ­„ƒ=Ïôiâ}Ç)/hxZCîv=q~»õùdƧ{æè‚òÃ]Pw(êlƒűƒ=sôB¹ˆMÄÊÝ{Œ 2ê½G”`zÊ3ïÊn-®À®»’/ðS2~B¯ò®êêÃyÒ$6’Cêàœºüà×Ä¿#ø¤ àpjœ€©æg‰´#d|ônbðÖ«…Íz:>M¹ ƒÛ˦ÔÆ H¨ÅÜi(/$“¶\#0žÚÖ­“¶y›Ð?OãriDwd…iÆí`.¼RŠ·ŽH[Dã&“6ÆþÑïØö endstream endobj 567 0 obj << /Length 2039 /Filter /FlateDecode >> stream xÚ­YÝoÛ6Ï_áG9¨YñC…¼mk‡Å>Úô©+ E¦cm¶äJrÓ`Øÿ¾;%K SÛ[P &ä}“÷;…ÏBøÇg‰˜%Z2-“Y¾½-µ¾›ÑàÝÏÜí[ÀÆÅ`ç7/_GÑŒ‡, S>»Y YÝ,gÏB%Qüºƒ‘Lù~΃|¾àA)eðW’À -/þ¹Ê³¶¨JZÍÊ% Þ·uV?Ì?ݼ¹xuÓ+‰ˆEJžhA·û‘ ˜!Yvtfˆ˜…‘"3$“LÍQ,‚ªÙt*|éùr‘°Tr{Hª¹~üΖ°øf²H‹Ù½Ýº)¦¸†ÑföþâwŸl.AšË/ʹäAkêU–x²8~&ñiÄ8‹oQ$„:†z‘*&/xÂbÙm|Ø™¥YÍÑÏÁת€Ðñ‚ÿüw žû\,÷ÛÝçÌ9m•××o_]¾8êÆEÙâÆ+”*/@Kyå묾<°³‚š] ÇI-ßÇÜøz?bW›l9ÕÛÊýï<·ÙfSåO²ÕçÔUmL§[¿ò? Î7Ui¦ŸÁœÊDÉ€¥ù²Ï6^–ÃØØc>‡Ž}ÓÖû¼¥6•Êî>XÒßö çLAÖŽô¤Ç‡w×WsH\ðÑËŽT_ö¦WzȲXš²-V…©iå/_ú\0Hq ;™*CÌß*+‰&må~×½X8BÃÕ¾Ìé)ôÈ<ˆì’Ý©ig(S„á‰2éÌ B†º;á µ³ó µGΓÙÝÚG³ó,¥3g¹—î—Kgœ\Ù§JÄçYé.Ÿó¬çY{ä<™îv:™vvžL{äd¿>y›¬Ò|kÉͽø_€ä¿§åD•MÑ´#Ù ß»ðÏñWì;oŽuÓˆö¹=úz³zÌowåêîbŠbDDL¥)ɸY_…‚qÀ:áàm:èêc 0BĪ;@Êîk0V†:¨Í®èfaZcÊ9€¹¶Á¥$ÈhGYYˆ·4DÅ° 9óéÆ#É’¤õˇ·o} i¨»] P~[”Yk–ę⌲ªQ Ò‹Œl$°ŒƒWYŽÔ5¥‚К…:G} ºR ˜^Õ¦Á±¶YEªéÒMYõÎí;ÐCKTÌ´è]‹ê"ïŒÄÝ™ÒÔEN´PÎ!ãzu‹Ø3øÓäí ¼“qP0úaëÝ»J†'ÊlkˆŠEÖ›±`Zõ¾…ÊèSÀôè6Q鶊#*GAÎ;³… ÁÂ0»õð(dXÕÇõÖ±}IpfØ{Œ+·YcˆÔ1jhZ´´a9ñˆƒ]]!ó¯Pº!ø)T…WßZS6N‡Ñ†Ú½/Hp`ïQBŽ/=÷¸(WU½u‰RîÃf_‘›!ŠU×UãH«=°;¨”¢ì6¹-â-°Õc¶Û±ó¥iòºØdcPc¦½¼ÖL@ï Óž»ØöB,‚5@÷ð¶)S†ÝQw~1`àiò¦b¬Þ›ü Ÿb¢ËŠ8³âãW!‚×s-ƒ.¶Ÿ0£• vÙ[–éÔDžÆLi5“IÐ0:Òîu»ƒíƒ¦L‡ÉZP²‹.fBÂû×+0:Ë"§GÉnªè÷¾.Z qbº,lˆÁSŒ%Kc=²î¬ºóG슙P`Á#B™râ9 áàZasþ“é.6sìí·vLW‹»(°8Rjjº€¶W'éLÆ Ä¨#ív/Û=†N™öeôØ[ß9q…º‹ôÐûG'ôþRÁa?Gï¬ü®8xº~H¥ŸG°F8‘Œ%ûÛ~ ¹‘&㾊kú‚öýÎlÐx.³6¼§Ócx³©¶æpär`© r¼r®“u=†”´ûªþËŠv=™O*À¿ë•1µMÅi»ìðÈ¿ÏŒq{Þ=Âu”ÿ€oÇyýolËYé!¶íµô1ƇNH²±´ÈÖ -Ò2úàBœbñ¦U/¤ ™ŽÔI˜6õbZdM˜Gñ·NÌÆlQS@^Þ \·ØBYN”šæ !Y‘„îêàˆ2G¶¶‰8µ_cñ¯3Vp•’G‹*‚³Kc±’UH-ºîÁq`Tâ0pvq„œ,¡!‘™ý 8½)n7†híº®öwkoÖú3§°¥Ïk™Ïë1Kát»¦HŠRœ÷ëÕÀ¡½s2ÖcËh¾HÃà‘ËìjíNfùÁ2bI–õü=¶H®@ÍdÚUx;Š(bQ$ž²ˆ9üÅcúÞ=¸±×Ø3E†AB¿²ol?tAŠ»‡NdÊ»q9™ $ü¬‚{ï-1ˆ„Ÿõ¥õ3œ±!*°Ý¹läC Ðé4{×±ë†~›‡-RoÉÔSÃáÉ–âòÖúðq‘O(ò"ÀŸÏRä‘•èÐ3}Zl<‚áåR¡~ÁZ¾(K~¢È FGŠüðs葯¯—èPô9(½øPŽžA$fu=8Y«áéæì¢wBêY÷5ÏQ¦5ŸÎìòå9>è¤zôA§WÓ[ô4‹þðsŽVîŽã|Ë:Þpí ®¹ï-šb‚”iJ·5«³œSí¢EÃz5€š¥Ipã–Ž‹`¥Üþ!ix{Ë<Û5û“-e÷eIZqhLûÕþ-¢£Ö6 o³²Øí±?éÿÀ¨ï²”ß¾äÚ ãâæ®è¿çƒ› endstream endobj 574 0 obj << /Length 2356 /Filter /FlateDecode >> stream xÚ½YÝ㶿¿Âè“|ˆy")ŠR÷© ®Á‡Ínûr9´6×bK®DßÆú¿w†CêËòî6Y ¬ø1‡Ãß|˜/bøã -:“,“z±>¼‰Ýh³]Pã§ïÞpO·ÂÕ€òïwoÞýC©Yç|q÷0du·Y|Š¾ÝGkšåJJÉ¿.WI¢¢˕Б©n×õ§’èÖ­ËŸcž¬ [ÖŒ(ž%‘ÐËÏwß¿y× ¢„b*‘/”:P_ˆ®AtÉb=ˆ.R«„D—L2½\©TDu»"ü§ãË…f¹än‘Lrýô9^l`òûEÌT&Žô°HXÂ3hí·oþ9·7—°[6Þÿ4ãþ‹hsžÙ?M™ùëì¯ã: `qO¸àtxÁ+Í™Ê×,•ž²µÍim—¨iÔÕ—ûv½ßÇ‚s–×ìÈ-A2XVVÛöË‘hK0”ÂÖM{7Ïã8z÷–&~lÊmYû uß¾s[Äž;¿ÊÞüzlLÛ‚a®´ºÂ¿µ…5SÙé²Ñ~«Ñ™ü®ÿ½ÉâÕx>šyÌç4ÅcwÝ/öfîDϲy;î~9Þøû=ЕÈXæn/Ó’8ßíÌÜM ÉÑ©“d›ã™r–fI %ÙNÇ'ЭAØVQ†œ†áÜQµšƒ‡Níþ£Vp¬¬è[k~µ'¼({¨›[®R•¹#¸±u}8î5D^‡‹u7–%,Ë&76¼]ûþ 7±)³¶û3 DÁç¼:-Jl— ٜꀔïaQ ^#Á˜7çT1ðäã[ˆ&¥ên1àCKµ–öø#Q1{.b@Ù ’ËRŸExL’ìš#“”ý!¯rL™ê©ºôÇfWÃÁ\Þ…]ÄX8Å×rch`„ßxÎÂ'”'KvGŠ Õ _=9–Ì)ÑcuŽrRXV(cJÁÐ׆ºˆî2ÖÑSD(è³ ¡NZ—Ú›o0–€²­9ÞžeUûM°¬±¶~ŸpÄ%üÐΩåq,X`‚ ™ßñÛ7éÝ^I¸æ $gR¦/®$ªéMaQ=Y2D™IRª1ÓbÜ Ë!î“1‚š«õ1S -qáŠ~ã‘aõ/,_õëgê–“MÈ)™µ¿ÕWQÎO³å@)ræ”ã¥É4à é›dBËqú6Ò[–Ã1†Â\â¥*c) RÈ Á†ØÏh*y (¹5¤”ËÊlÂÆ!{\ÖõÂl ~új&,=03Î1‘$Yœ‰Ãíû¶¦Xµmy¿÷&Ag"hç tRiáŠÉKŒ:“‡LjÀ@÷<›Ø7Ä÷ždõÏšÒ‰FD¡`‚³¶¶Å+Q8s(*Ðü&QÅQ…šæp³Õ˜†Ë¦5‘ünÆÀEúPIï«[,­Í”µ…Ëx^e×T3Žw/ƒ¤)ËÓgŠ îÇŠ§ëeHg¿šÆçîY2ÈÝÿMÃãÂA—ò2ö9¦CÆ«YýzW4ží¾¨¶'° Ø.ÍÙö]ÑlÓ¼¸â a‡¥<n¤gý-M¶XÄúÊC=Mà!˜‚´"Þÿ·òÑ/œê? ]¼+´Ü;ïþ‚íæòçã¤qQE—(.*3G}˜æ¡X›À¼1[XÖœ§GùÉ›&[ºP4”C<ŸW+½opõ0rÉÕ¸Z4ªÊEÝëûó*En˾HÝßUêر¡ªÐ\¨ßéJ$%újдœ#Sî"OtÌû*NPbz­¢ƒytöG*:Èš.[møÅ“´è¨A~.ü „mŸó>mq’ºW¾òw™'LÆ“zO¨CHM ™tÕüàcƈ;‘i¨_ئÞÓ€Ïï.WA2±ø zb?è‚rªâàHéW‡*ÎCWÅéâQã~«‚éPÂÑX ЉÆLt qJœàÿ–($Æ endstream endobj 579 0 obj << /Length 1990 /Filter /FlateDecode >> stream xÚ½XÝoÛ6Ï_áG«9Q"õQ`]׺¶k¼a@ŠÍØBeÉ“ä6úÇïŽw”%Gvã´ü@òHÝ÷Aˉ?9‰ƒIœ„" ãÉ|}æ[j½œÐäÝ‹3Éç¦ppÚ;ùëììççZO¤/R?•“ÙMŸÕl1¹ô‚ä|¨XûÞ› ÌÏ”çÒ›ŸO¥W% CïwbÏ mž¿÷¥šgm^•´›• š¼Ê¯ë¬þr~5ûýìÙ¬SJZhÞÓwúf‘ðµ"36µÙd5hª gÉÜš¤†I{êÃŽùtU±EÒ#¤)¯]´„F}¡A _¥ ¨•ùÉÔ ²¡“õè„î Š4ł䵦(ž®XaPÜKÜ,¡ºÙ;±ÈÚŒ-iëí|ŠB'Ó ŠD‚w.C!µ$ií¶6â|Ë—-|“*¯YU[+?ÕÞµ»K\4†O´’†›ª¦e…ÞùLÔ÷¾öé¶a±ªØ¥7Û¢øB´ŒëQHHB<ª¤ß#)G*ªrÉÂóµÞ’µ~ž×MˇrÖožm–—µÝg£Ùfô“=_‚êk{½ R¤—‘ÁÕ¶¥uwÔ±4·- Ž#oæ¶Ú¬^š–ÕÌÊå6[ú:/‰jnqMcNìŽùpÂÄì€Ó±AŽ†“©ÚCŽ ëV¡/´ ‡×m•Óíl€ƒ¬U - `lÝ©eQ]gÎ"&[›ÖÆu AÏßPÁdaÀß…YÐ*ï± Ž4Q9ÍAôìhp(¡TpÇÄi¤¤µf„¹ƒ£.ž0ÒQïºcJF"ˆåÐM»ÃwñN¨-Ä?å C„„ˆ`”‚p;Üù¯nhñÑäåÜ1âó«Œ÷3–¦4u>gf(ü ‡’½Ú Øe­éè™, ²b|ˆÙ–‡|Þ±¸^u_2Ñr€õ€‰úøÊ3b)ì4„ÜFmr·ã°ÃzÕPrÙ|ECœˆØïÐÀyŽ”ßÎ1—‘jÖ·ÆìH~‘ŠÑ%XV„ªðA¸­/CÊ~©Ü}:^bxßjvaæìê òBŠˆ¦—`¡Óêߎ½ÔDƒ¶ÂÄŠ¸¼ò' Ø„k*ž|¶'ד°ŠÈ.&gŽé!u’eØ£#r“TÈ0ø!rS ºd ·½Â 8ÚØŒˆöÑþPý é_Ìázï¿‹=– [1 •@Å(3,BT\à !´Ô K¡à‚I‘7|ÈV[›6k!±¸:n?©ì’œû`Ø VÚe¿qÐ`.—"NÒa’b•”æ@{µYÍÔ6 Ú³»©o²¹iˆFÅ&»Ä‹Ab7FBíj ‰¢þíNÊN…N¤;I=Ê öD(¹ŸiKñˆx Ý”JºÈ·꧆¾Ä[SìnØ• ?äF›É°9-ìlBåQ[5 V»üÊ]ahÇö>!æ6GXÁ®×Y‰d×n›zLÛÀ‰Lö Ü#rm0L,BAU 85¨Útºµ KF¬×Y ‘·p'ñŠÎ¦³¢æ~AB¿Ø/¤0F¤Îí~VÒhn³õ¦ÀÒj>i‰¼åcô(©;ÇÁdaoÔZf¸fF¤¡vÖù-רâ¶hóµ(Po—P6iq «cpø:žD¾„´žœÛÝ÷Óƒ‘¬²/f/σ~(š\¾­M‘¯¹ïuJüûÁ 9¨æ>øùôÊÍÔ%Kh§¥Þ7U¦hB<ÑI,R(9dz¥;=íMÝC¦ý|‰6÷ŒÊ+±EãÞ^ª%W[å-sz’4ƒ¾ž’ „P~]ðAxvAÌ‘ÞõLŠ›EÀ«YWä—§°ß_å #T&dOß‘O«·˜D°ÅÈÊ Ï+G3t%oøUÚ½òR×=Àf×=ð×4q0§ˆƒ Gš)i™Ái°ÚÔ.×.ˆemê`ï£Hiš zPîç)Þíç©Åv½M!ð°ëÒÌͶ´˜ä–,ŒCìñÐ æଥYóÅFw«ö‘aj†ýxÎo> ìºVæUÕù2/mš¡9lfmU3J÷( «PȤè?Û |l] Y‚38>NÅ~}£—E¬‡°±†ç×ç¯ÝÎÊÑä‹`9­³Ôª«ÕŸWPA‹XT®2Ú%õÌ ?ùq ;w±ë€pà¯Ø¡ÜÞ}£wÕ^“DC;6ðÆþß½¿P¨B`Y÷cëñxÃ-’aŠÿi:=Ç?RvlÏ–ÿÄK߇ñîÛÂíýMÿJ<&~òþlö6_ñ“—=="ò(Ÿi’­[À> stream xÚåXQo›0~ϯà´™ù0¤S²4«2i­DXû@£(£4s•’x™´?'¦4Œâ°JUŽ—û¾;û>Ù óhŽ¥9.1]âháSï¼ÉRÞeò8ÄQ!ò‹ßûô•R °9ÀÐü‡b*ÿ^ ôѯÅ&‹Btrf Û¦úõÆ@–£Gñ4\o¶¯l}š»Bv‡Á[ÇÜCÁµuk`Ìüo½±¿'B-jR›H²~Ž>¤Þ/RŒM—Ð71µû?œwØÛ´ú:]Í“hµ£;Ï„ïS|ëMüñGñXÂþdYÊßÁ¶N 1B=г%"…›g&Ï‹…)ç•K¨³KœµŽ à± °gmj *rV’¨!¥¼)‰Cð×°¥ˆJ•öß2Š£„…|û)§RÆb>΋0šggÂûÛˆ‡ó|Ÿ¯ï7[yÞ%*i–°x™î‰0aÛƒÃ裀͂ÇY©ØÄŸÿ˹©GÝmqQÄ"‹ž¢8+Š×Ô’—©¦›µJ,/®¿'W Ô²/~Ú/©$n­’Á‹Ñ—ÇÆzTĨUàbÀQ(­•µ9Ä?…Ty!TúŒREõ•œrb¦£¡ï½ÉÕ¥‚©qòÉÈçÅ©šž6cÓúPÑÀ¶^\¬àäÓ ¹Su²í|cU¡£Æ)m$œ˜\#’ÐͪªjdƒÆµÖÈK³áS>;¼ö J’\§ÌÐѽ¯vº»þ½‰kà$ä»v#™x²+#á‡ïu"¶Yý A04 endstream endobj 502 0 obj << /Type /ObjStm /N 100 /First 879 /Length 2227 /Filter /FlateDecode >> stream xÚÅZïo7ý®¿‚¯_(’óƒ$H.uqÀΈ´wi¨Ê^+T– I98ÿ}߬֎+É–¬•\ é®v¹äpæÍãÒ¢ .«‹”]TüÃ=×ìRT'ךœrÂve§EpWBÆU]¥ŠvÕÅPx xSb') G hR\䊛Ñ?þ'3[ïhSÝE¼ª_Å„q£ÝK  ~$ô3(.qÆ“„6RÕá>eë"GÜ°Y¡¸)MªK¥à ,¡ 3‰£hO(:"²'ꈵ „’Ø`ÊŽ2‘ËÅ‘™3>ªÁ&ƒ'•Ñ„ÄqPë†ÃdÜdÇ×äꘋM(8†?Ð/ãFjë8V|)ðf`®Ä«‚)›ƒ0E|„)#ÅæŽqc; ÌY¸µÞnl43˜ñþ™/>5 ÷! )Ãσá»f¼r`•ì+f„ø q-¾PF“×îÕ+7¼rÃïçïçnøÖýír>ýò[ói1šþ8¼knͲ™­F«É|öûöÛþ3CÞº\ Fzç†?þç¿bP=â=û<þüD3ÊÁ[®ÿ©ÝÅ|¶jm¹¼ºöÀB·¾s{‹†—‹ùøªÁäÜðòí…¾onWµ.G¿6ƒáßÑ/Ì_"3Ú^Í+ËùçŸY¶9ß>úWói2z3¿]»Nªø„HŽ˜œt9Z  d]×¼õþƒµ™IFmë«tW]_ñõïµéFlëߥû»ß]»Ø½Ýs`~}íÆé¼a|¶þ~ý~cæÏA` (¥¬ÏH(®ÑgPœ*{dïNˆ´>½]>ÞίG“Ù)Ó-Œ<ßâê£FÊžBöˆƒS*žt7b¿ofÍb2^ö9Jõ q­yB¼HØ °¨ hˆºsä«Õb2ûuiÓïŒègÈùi/Þ¸ ÜíÅ@Ôòv§ ÿX5‹Öñç²Kœ!ãy*íRîkü lÁ"êÛ•­3èÞ9Ot5­`‚tZŸDð'V>ãÓbËeª>ë‹Y@ b2Ò™qï‰ÇÍx=á-Oë„ ‚Æ4=¦^C}‘Á+yÈLV0©É¹i ᜠA˜bÁ*~72XßÃ?5ò›ù§/'£(3ÏXÆ!<ÂMŒ„€#böDõŒ‡‚ôØ¿'“ª1á Ú„Ü9ðw·Xu—ˆt_Ÿ'…rb‘àVA¬Á>`™‚èÆó´sì;-{Cœ‡M°"ÓüÙçÏèj.¾EM‚õ.@òÜ¥¶¡¼Þ9ò“i¥Þs… †G¥V\+¥H@2Ž•gåÞbp³a¡¶„0ˆñî~'‡N )l‰ÄTzŠÄÔ‰¶Ô‰6êÄ]êD"u"/å¾bþdÊÞ*Np¼‚ª)Z_~±Ma|½3çÆOÙsFUi~¼Û}ä3T:Ý^Ü£± tÖÜ»å kÎ$a8Â’l;/½f`ü—ŸÃ‚„´I©Þ›Áq¥üSv<-#Œ[R=ˆ‚6šJðû)è!Ó>«º„–¶­P²ÊÞö%zoBï9|d§ƒð¸ÑL ʨPö¶³úBKêÁhð!;ÆJ”^à–m¹Æ¥'¸¹“iÜÉ3îMIj6q‰*":6¦´³ ØÛ¸8ñÎàVy]¥WAyQ°äµ'-ûzþÊÕʸ¨P¨$‹mçÂÊœ¸«ò.hzØr¿ÑLáöjÙ׎‰|F˜öµk¥ ÕcyýOòáè<­<ê™Ò•)ÒåteŠäþd_ÚmN–ÜŠ¾{¬ÅçGh÷T Xf¯¶ wlÏ¥”xÖa9G$ø=T×_·ì(F€lçÐÿ¾ifWãù%ÀÅdÚ´×ùâzÔV&W7Íxò¿Éø4R)p¼‚l‹Ç¶jñ’Oi–%ŽðAùºÑL ËûÛÙ.U~qy¥q;ójßÌëN‡4õÏ´ ˆCfÄêí´ëvXŠ°öž{û,(F×vK)Û±c4q÷Lq£á Ð×,çé Úï!_?ÀÏWÉs4€ò€TzH»ªNï€Ôét­½•»Òž(ç;v¢¬œ(¿-×,ñy6>°2{;]U=†5‚닌Π%¿Þ™pï€'L¸_DÚò²ù3ß\#týý ÑÛ®B¢®š@tˆôh#Ú ÑÃé¨fd§Ì÷¶ƒVôéø¬<¢Ê¼•–9=+-³l¦eýOë3dc}Æ5XmfG0<¤Ly¤”˜/§˜ÿ¸êLÅð¸fpW[åìk—H*åØ`ߺßÜ7¾bÎb.ñú µÊÉN€ÈW!sè‘l¡^®Ë¦=Ù… Å©ý%ˆê׃( ÕSØ]±].šéäz2-ÚÊñ»ÛÑõÍ´éÐÜ @û{´°>w­v¶q¬ -÷ÿÝÒåx,ìÊ6­”£håÁl w61j endstream endobj 590 0 obj << /Length 1580 /Filter /FlateDecode >> stream xÚíkoÛ6ð{…?Êk¤ŠeI{aí–®²hÓa@ŠDÛldÑ£è´öãwÇ£KvÚ$h‹~( øÈãñ¼b“~l’F“4‹ƒ,N'åêAh±z1¡ÁËß0Gç¡¿EùäøÁ£§I2aa‡9›Ï·YW“/§~ÄÓ$ô^¬a”y¢y5e^9õ™§DZ÷ WRO ®”oBÆËÂHÕÐjÑT48’çºÐWÓÓã?÷J%Q$<¾¥õ®³m3X3 „“%ÿ’€¾ž€úIšxá ÁnŸØÂ-½S4”öY°„Ý_‰û*³«ÄÇt¸ƒÂß’Øj­ÚúL‹ÚÅY-[sf>—^}Ÿ,È4„{ʼ<|üÛMãˆà¹4-,±û8,&¹ã8ÎìN¶îÆÁ^¿ßFŸ8¿þŒø€Rß2â[Ftª|ÞŒ¸W0~w»KèÝD{ †ƒ°\ˆFhYŽ’à“¨²GšlŒÐó¢gæ{¾~ùœ?¹øWÕÕýU¹KB¶FËfÑöšHo \|‘¢0Öá×yzòötp"ÜCwqúÝøƒµ¾p}`±7ï¯×GGî`;§PðÝxº°½½šÝà=M¡ñæAÌgv¬Ð[CÇ }t0Ë»Þ;à gy‡ØY¿7¢i¡t·´{ض£€<`QF;—ÐŒGùÌ+•v£u¡ Ôœ éˆ®;û[zDi±Ö¢ÍðÆ5óˆ«)túç×ý~×RïݲpdK«4õÍQŠ¶Å‰WÏ7²®hXtJ¯ü}gº®…¡1k«6º¾Q>Kv¨új)*]Ô„œëb%Þ¡!J_SŸÇÜ{¦pn‘â-šˆ¥!¸*píŠ&rØs:'šˆFmKË0öžÙÃhº—‘8@šñÉîF‚‚ÇR,4ŽK«΀"ïåy-h.º8 ynÝ :Ì8÷—fSÔpÚYì|Îœ‹q—jjǯ„2ºäZ¡+¸µyä «N³#§²í7íñ‘ÿnD‹|cæÄÇá8µ²*¤]¤6èÜ2WšÖ šo µ­,5àW¨X³8·µDb 9.bcS´„uz0'CZ¢Ä=ú›¥F·Ò‹ÕîÃÁHD­ÐÏ…¬Ay(žˆã6rãçmÄá%šæ–ÄAFöy$°„9ü±È¾s‡˜ío·ßßb°çÁ;CᵆóýJ\ŠZ­W¢1¿,”ZÔbf®ÛRm¬0O¢ Íf…o~wÔ»ê êÓ˜©U;ÌÀ:ÁgIñØÀ‹=ηªÔÇ>¯eyE X„-:a.X;¬q¸ ®«%ÌS´vcÇr®êšŠyh LßjHUИ® @¹‚*QÇSf‘ãè”%£"æC‘Ï9†ÙjXZcæD¤jL%©EE3k2Àv3°•Y½‚0é ·…)÷žÏw3”²ÖÊrÁ’L'@œ,|á>èt ¿ê` Â1¦(ª0ž‚ú²Z„7Oœ…p/À ¢0©2†¨KÁ–¬XXÙ.mã}TwŠÎÛ'!*¬¸yDvÂâ wnZ7ÃjÀìƒÆ²°…¿ÐNÅDFd#ÊÞ¨4ËýEÂÕëFðMÿ± ïÖAå° kÃÎJ£há·OöõŸÏІÈÙS¹hìÝŽ4 %£óÉV ê}ôm%Öá ;80‚…ƒ;ͯýÏ89çÆG@z)+«?2™{~œwÙÆ]béá¾: ÁÓUãxöA ä­“ï>&RéJèàæ”:,úh ÓÁ)†Ô‘ ¬D-W’ΨzKÌý!ÿùóȯåÅ´»ê¡j‹–ÖÀ苜Ϛª/þ¡KPeœ,r}˜Zω` Ý vÌ݆¥c­ëžX[ØLe™k×`€|©Ü3¸Dø ¶Ûms¥öõ‰, XÆ:¢jÜzή¿Y`> stream xÚÝYmoܸþî_±¸OÚà–ßD)¹šäâCúåÚóö“/0­l Ю¶z©cýïáPZj͵´E_`Àâ’£áp8óÌCŠ/bøã #&•,•fQlÏbÛÛÞ.¨ñëÏgÜÉ­@påI¾[Ÿ_h½à1ËâŒ/Ö7¾ªõfq½¿Ë÷}Ù.WRÊH¾^®”ÒÑ/ûåJ˜¨Ü]͇Tt麊귘«"ï«f=š§*’|ùiý‡³ëÉ-4ÓJ¾ÐêQú¦‹„ÅZ‘éû¶¼)۶ܠ…Yt¿ûò¥H£êèxª8ºo«¾¤fWÒXù¥/w]ö¶‹yx{ó°LeÄÀ‰Œ>Œr VK¹wr÷§yº¾Š~hÝü[4oèzÖŽXqɸ洶¼(Ê®«>×%Ú¤Áð¶nïèG³s½{kpSíP-ì" ­õ]ÕáH‘izí¾ªkj}¶ œ¶®o¬3±]íÆy­y°‰¿2ÎO°ÚZk×Kb³ÃÝâé(…SÖn‚憞àÅ€~•±DÊñŦ«¯oË]ÙVŵuÖJ¦Š¥Ü8Ÿ‘T² cšOzŠ†üW;ñÊ€M:îÊò8~a˜ÈÌ"É2f´´ñË4Œ±8ƒ\Ø@ž÷ø=¾¿ò"úxkåeYô.0M$™dššWà†ÑοLS )˜VC–¦8ÏÕ§x±1ˆ)¦ÌâÞ n’ ƒž¨—g #dÂlÃÌçöÀ¼–ŸªÉÄF±DÌçí?}«Öq´ÏoKZ¿HŽwInÍvé4ÊŒÒÏìɱRº°S\Rë;€0‰G­3ÌOjsH)üÑìꇱåºfÈc û;Ši¡%Ùçã€,uù¶$$þó¯© sŸˆ` €Ú˜rµÓÐ8ÁIÀ‰Y ¸b™R0¿a2sIõá`­0 Ai‹àb`Ý#Øâ²(”SOw×´=õlY‹a[º tåÄrrX3€[{ê‚EW-5ËùüéØ="'iØl,lyã=" õê´¨P<²wÖÄÑÅj™õ’ˆ]ÕÁäÅu´eÞ5;ŒJ%I¿í>µ4 ˆwRqзÝ×N&á6ŸR@¨'pYÄLÄÞmAa•f\ñ `÷4V¼Sˆ˜i–e¥J€’äëѽ¿ò„ñhš9"¢}’)Æ©yõÞ.Ðzì¨\#|¨ ,‚¨$ÄSø4“j¶ªÓ2J?³†c¥>‚¤€kä ¼)»¢­&ÌÀ.´6y©à)NSûApÓ´Û¼‡•ê8‹*tTèð©¢¼®ôÌ=þÃüÀNŒ<jË¡+]—úÊ/ø*&!h¹¥Ñv¨ËQánC‚€Ûj—×®hXwØC¸4Óü ñ”˜pÌ[[…È"ž>JéØ0! NcÈ) ÕOÿ(½òÄC |¤tV>y½Ãz뵡VBH¹`Csz„Ñð{°a6¥¡’IõqG"û¼í«b¨óÖ9[jrF¸VúèH¥¢›¡¶°uÚZÛÑ'¬¢º*²Ê±”o¨±v<´èàýhì°„*öù…ßKˆTˆUð}Œ$x¹ 8‡”:‘Jôøn)…Õd´WÛ©@cËévð'/­t¢|銬ž3Pª<\°z\å2ó:XÈà÷éK &êTÈXȸ•S@‚›•0“˜¯1ïí€ÓÚS±ŠÞã.ü ¹´p¹A^l·ð]G§¡­ƒ#@R:}?„¦Ô̈I¢°zÙgRùûaµï† »iO)OU6¾úã³ÊÃîÚ0éoñχÖA»Òyé3I4„†zɆJßbŸ-cfáµ#¯ç.‘@dÈëq¼4a¡€†TA3‚8‡S©ËY‚Z|õÂVe µ«âyp¯OÐ/<‹ýÓ‹\HÉR!F /-Ø—bo{”–sLœ]IY _—©Ìæ &ú†Û2÷úêð~è¬=Ÿäèë~Ïcþ8Ñ,–NÛ.4&’goÚ1vé¦Z€!Ç7íJ³Ø$þrž¸hwÂO¤rº'Wo¡ RX^¼N5ãÀW¹63¾:EëÈX½:ã8«/òø>Ê—7¾î§Bj]ú8µVRd#@Ë/ìÇâ·.|Òº–'9z7hüƒÇ‰Îhö“ÃólqËm endstream endobj 602 0 obj << /Length 1564 /Filter /FlateDecode >> stream xÚÅXëoÛ6ÿž¿ÂH¿ÈFň=œfÅ’>† CW4Ù§¶0d‰I4Ø’!Ñ]ƒmÿûŽŸP ã6]î Û³#Œ?…ùû…Ë ÔýFæ²õÄýŠyc õÎc‹Í ×Ù;ÜP;”Ï"îUu.kÛ¼Á¯jçúVÓýžÕt×꥛E9Zº2ç¡[YUײA`ªÊÜ.PÕhÁr8ÌÕI'h”AyNÐÞF„ÉœYjNá`ºˆyç ë:ræÝkGCïMŽpÖÇ$â­^Ë&«‹ê¨#ѧNÈ\ŒÂp7ve$‚œ¿}¸tF eB“–*Éï¡ÎAèCâ’Í™Ÿ ÝùVÝUõéÔBx¯¦T>ŒOEÌ=™×E†8q‘6ªÚ®\jP ã–ß™­HÌ:ŠÌð%KdùãÖß4ÛœÜÔû˜'bÞ.}ù(s·yX“pþ¤Ó{¿­­³7R[) #;d MÆg rîDî¹·© )rÙàˆòÄk¤Â¾Ž&ýíðPÏêÝôÑÝc×F²&…«‰}M¢Ö°A]À2'›cù&È`!—¥ÞF™ŠCÖ6›lië¢Dw±ù*‘,“%«åÊÔ(m\s+%ìžÊç¸ûÛbeÙ¼&RÖ©ú^Éõ¡óÙ“UµÎ«.oa¬^Ö¾2SÃüÊÛü›üŠC·uº^§µ;Ùr0C}Ψ‹[YJŒG ‰çôôLÇg¨ÊËcì#u;wÒM:¶%yŸá»å¢PrmY\BsaÐßÁÀLÚTÚv<ôÄx½éþ…ŸO;¿TE_ê¨ãpy"‚žX—à{ª¸)tV1b‚»dÚ‰ñþúÅe©ä­¬z y?¶Ên¤ ¹¸RmZ;8i‹À+uŒm×ú‰žTã„Ivqhèm¦†fa¿=àÈíÚתví¿µIãÐY¥|Í0Ñ%Ê4ÓLî°7¨ »Up±ü²ÊÈ­Ò¢´B¤íÄv³rHÒˆ¯5B Œ¤c\@ŒÄ& I£Ò2Ó"†p´z|$“’_ÓµÞ×5øMñcÐO—[ºÓ"¦#îxÆÀ†9‰’ø| ¡"2ÇìÔ,†E[éFï¤Å®&¶ŒBR<ÝÞ¦ë¢Ôw<3°3FÄM”5RŽo"€¢'L&,‰ xû#!ÌA”™kàp¤l×û=Žkíxc+8 ¨Z>°6>¾•zªkrâ6½˜{ƒê}~ŽPºIo-Óp¬% ç¦.`± tþØ·¥ö{äÆLmR7š‡P3²QUÖÂõâwÛõ²…¹öúcVí½þ¶Å°¦ìÝ÷~ž¹ÁÔYE÷4—®Ê¹»Í.¯ŽÝB˜Ù‹7äOÚð¹!³‰ïÁ Ù“6 ¸â¢÷ê`oúÁ®3{e/rà+X°{l8ß}ÇÖŠ`ß’:gzp«ì.­g³á«Æ@G7úV›ïônÑž@÷hOy±À•³ñ€}«Ðüa4va endstream endobj 606 0 obj << /Length 1551 /Filter /FlateDecode >> stream xÚÍXÛnÛF}÷WÉ e„«½ñf§AÇ)Rh«OI 0äÚ&@‘I%1Šþ{gw–ɬ¥E‹ÂÞË\ÎÌΞY‘-(ü±EÄQ,H,¢E¶=£fµ¹[ààÍÏgÌÊù è$Ÿ¯ÏV/ƒ`Á(IhÂëÛ±©u¾xë]ݧ»N5K_ቋ¥/eàý¶[ú<òTu“Õ;½%½»”ï(“YÚu+‹¥'Äòýú—³ëõ$à ¤8u/}tH„~fK{÷0á^•nŽîÓé|§íš¢º³›UÞð‘«JÛëL„ª\!÷º{«\tÇ=}áòðÃ1|$Ž$„lÐk•ömñÞŠN" (¡É ©‘‚З" I/|& îÎa»\Ë€DqÜÛ+ò#nyLBöbE"‡&ZÄ$‘\.|.ˆ“F†Dêl 惘40¯nò¢J;¥ÓÞõçNU­®ô½Rˆ'ÇöT_¨6kŠ]7H‡r,“D ™àÖ=ĹÂaœ„°bÃùýÍ« Wn ¢b6ä&«Ð&C1ËÎœÏ('2_ò=ø~Úw÷uc. ô®–p×ÞQ.–`ÍSySdx Ÿ§mWïKW Œ…Ũ·÷ÔYX$âƒDfì’hòǽ¿k÷9¹mŽeÒ«>û¦qw~x‘ ù[ç÷zßh Š½ºU&Kx5XÀ@ªN=Ñ 5¯†B…lSo×Ôúj}„;¦+™'– `«¨nëfkiP/¤ AÖûçƒäÍUý•ËÚ´Š ¯6Œ$bz³Ñƒˆ›â"(q–¡•ÜdADÇÄ4”vGsÍj—v÷O4¸%óÌ^„•6²"H"+Â@Uù°X•‰_û¸ÅÿÖiÒGK6:¢h±¹ € ŒßÑ€UVîÛâ£Î°ja…¡B€Í Ë=Ç ™^©P³$.Rñ9#! ‰IDCDò²@ïÂ{¹Œ…gNÏUtz{×î"ãÜðàÉE6"ÖI‘Mó‚5…ëj±àUÖµ“Œ+¡˜ Ü>á!ÁÒ]“n·iãä8?¤„‡Ó[wu€¼¹S•2Ø»¸øžŽÂzöGj½Ôj*æ(‚‰’ŒÆNô©l°}êé®Æ.¸ñ<«ËýË‹‰ˆÈ ¿)ö!På#=³ fþJW­{×Æ&Ø¡:zQ4¸¹:ú<¬X:RzUuê›±[«G(9ý–Þ<ÈPÐ]ÍRq¢Ö8a³Ó«Í‹J•ÄÓ[›z¥Á˜šhx¨xر/'}ºWB®×³ì#|jÁÞ¼ªÂu¸LMšu*Çia¥FÌmwÌuÛÖ(š¶Ã‰Î¬&GÆ´À jhÒ‘¢iR "3'£'H_0è/(¼5˜ýVßXlªiQÊ*ퟙ°`B~z2¬W¸a%øšµkë—õ¿qŸ7ôË­_Ñ÷ÐY±A„ÒÚ†A o…òLj'tѳ–ì駚ðG6pÀ‚ÿí.ÍLÇ ßø©9döÕáå¯]aFúƒ'DZó³¤ú öºûüíÍ 5}çÉ*3¥áàßxà_Àô9ÝîúÓ÷¼÷²ºi€Å­(Ù}ê|ÂÁ‹€pÆÿYWqwÆ„ÊxÚÛ&ï(ƒÇŽÆ‘¹­Ž|’XèVég?¯Iæ’x<âs“3=;¶©0=QýK‚ûâ+ƯíÅ8Ý´ÕgJÈã9˜w‘™îZœvF÷3å Î|‘v) 4ž}Öíõx¥ä–Ô¿p-¬I©¯5}7€‡çÉÉ/4Œé®Ûr“ÍŸà €A÷–ÓLg@燽\‚ahâ«sg›ÑùÊudEÕY]CÚ0×ÈéÓÓ¬£ÿ› ˜"7]KŠj¶ÕÖû&³ãÛÕ Ë >ጀüšþ8¾È‰az-ÜC™<FV|×Aýy鈴{Ø©\Yô_­s³ÕMwéüáq¢Ñsçêfwéüü÷Õ|üH?üTtU¦KÁ¼‡ïøè!¾û£Gò/|ô(Óç÷ ®‡“_ôú#ß_CV endstream endobj 612 0 obj << /Length 2068 /Filter /FlateDecode >> stream xÚÅkoÜ6ò{~Å¢Ÿ´E“õJzÅ%©S¸8àŠÆý”†,Ñ^Zi«GlãîþûÍpH­$ÓvÚ(x©™ápÞ3dĆÃ?±I‚M’†, “M±Á5´»ÙÐâç^Cç¡?£|{ñâô}mgÏÄæâzÎê¢Ü|ôB¹õ™DÜû÷V©§š[á[_x-@Â0ô> &ñŠê²È‡ªm›7%-þU]uyw¿ýõâÇg“PQ±H†_¨¥~ F,çj¤°”h3IRKððµÊ"`1@8Q½‡]Û½ÚúRJïÝôúăp+“ÐSeW¨‹ôÞæýÐŽµa/؉˜Å ˜á÷­ëȈ%ÁDQh¾ìŠXþsôýX²ëî1æ©ÌìÖïžeΈbi?ˆeÑÆ Èú‡ìóÓØQ ´½2VvÊ%k±0““–u~ïâŠäÄ]Ý ªé§Ø‹tª'“çzWç[8ýž€}ÑU‡Á(% %…Yf mÈb!è€÷U­ˆÑûmzm·Ï—XögL)m»p«L_§"¦ ‰$½kGÃAo“pÅÐíLtm]··UsCè›.ßïs]‡ ~À™ˆ3£TF’€)ï/oT£tXË€sïÕ«l1Ǽo¾Em¾û†¾ÒÂO NÑV ™ˆŽü¶~*ç|./@_—Q@5–.åycL¢îòýÁÚ¤½6eÄ¥VÀnñUö¯Lxã†àmÙT[ÖmÌ$ci/#„ìµ°Š ¹ëªÇã>ñˆ Nį'dñÚaÆ~€˜ÞW¢–> ßhN›„×ÛB»M>Jm<éÌ™sŒ~ßçƒÉÀC7ÃØ©¿5oJ#D{yfgËóue±%#¶}}YL9ðmM!˜„Ö2÷\±Ë»—DC…é5´Dð†wúrG„§uÞ›_úáþ :ð>¨ÒCD`–ãúå©>Ý_o<ú?§Ÿ‡ûƒ*ÕõÄÊ¡•Ò~^®¨|–ËËåçåá5™:Ÿ†Œƒ­g‘®M3cèIÃæ8ðÎp„¸®ÀqPáôß+}yg“ûñÊ—ì{Eæ¨WÞ Îþ²Þ÷ËÏçÎøAmD: Ô«¶tF´ä WOöf(.Q,BáŸ]~l©{Ô” ?a¯hDzÃÖ1Þ¹g ‰ëg—IÑßìŒ@d¼ŸŸ`’4ýú &b)Oþ‚ &O0X€ä—øU2!„«RÅ©wèt£þ\•`{=$÷„Àúg^]m5HxÁu˃߂ìÛv¥.=‘-ak¨­ YçVº9 (To¶©¼¯ê{[;¸6È¢LTͪn^‘Sõ): õ@†•È=o‚Å_7leO7 Á@©/ñ¸;q8#ãiÜ Âd·¾·­ ¸E!œ™µäš¼ó‰ÉØ«Ùn‡!Ôí”O±øöà–#IR.ëÙÆ—lŠEƶß+µ¾^epMJ2(Q’Ei¤oW,ÃL›ëkÖ2¿o™íþl¿ãÖ¸:DËó,9uëøëãÛV‡Vi†øhʼniù‰¸w­´ RÁê<~Y´ÔÏH¿fjÍ)œ³‚€»eÈãeÈžQ4§iAÏšMÓ&\í@m觙úˆ~Øy´Éœç»Ö†ËfÜ_©î¸®zÓ£m˜­GƒÄK±ßèúqÙy7, µjn†Ýþ—~0&?·UiùÄùsŽ·‡ófP7ªsXe)[("þÌ6±Øg5âÇÎ{êÂ2M·zØbQòíg©qÜT€:²3ÀÉ“Ck‹!“?žžv¿?càŠðÕ1«ÙŽ S‚šªÈy‚ŠÈ&( &¨ä±¶õ\¡ÇÔR?#þš©™ | uöÂZ·Á =îñïUòŽº‚VØ u÷ÅíÊl¨EFš'CÔ5`@=N¦AAË0b*H˜6ªèCý>æ5.…îãúw§hÑà”°V¨þÚvŽŒ:Uë7¶žPؼÌ /µ×újà `®X¦Þ™h ¹ ¯¦dÇõ¥J‹Ð÷T»‹Š®'¼­0“l:¾h;ÓQa‚hJÝ7—*ðI…¹‹¹»’sJ nÄcšíªD€ :béAŸ‡KUu AÜœ„ÑCP“¬pU¿ÒC €@+x ¼!úãL%½]nƒ~‰Aö˜¹Gb6S) .¨ÛÄé¨~‘r¸BånwªqU² iRòþÅÝI¼òòô¶«ô\ð½IfeµO¥wÞnØÙÝEÞz­‡²PCØ©CÚ6ŠŽÒ©•Ú‡ôíH/7Huma& ÀšÇIÒqƒ«Ü¥êî $H=_ácHdí:’è©g§yë:é!9ͼÃhhšß ‹'3¯Ï÷´ž¶OLúZcO/m°£Päºk÷t×.Þ Öˆ@ÿ†k´ç ÜܧûórÐp AØÔ—I½~½²ƒ í[è„œŠaèÀž(#t”$Gá{Xj5…ze[õÿêjž£ endstream endobj 615 0 obj << /Length 1844 /Filter /FlateDecode >> stream xÚ­XmoÛ6þÞ_at_ä´RDQ¯IV¬k›![_‚&Ã>´…!ËŒ­N–‰Nlûï»ãQ²¤°I: Bòxw<ïå‘ÙÌ…?6‹¼Ys'æÑ,Û>rµYÏhòþ—GLóÙÀh8¾|tx3æ:‰›°ÙåÕPÕåjöÁz±Ik)š¹Í9·øÑÜöýÀzWÏm/²Dy‘U5nùÖ…&eùG—ùY*óªJÀbßâÁüÓå¯^]ö†^à> Õ÷mÓáéÌu.:nà“õ'â«\V«›gh(³wXÀhó‡9j¶Þî¶K¼ Ϋ+Ó,m;"~‡¢7i]çåš­LyXˆr-7J&p"/˹s›¹k1ƒ(èô¤4dUÕ¬ò2•¢%ÂGàmDº‚‘)•öP'©´ñÚß¡óK“KÑ+5Øj;“±Îåm·¬ºßÕU“¯Aº XÒ¤²jL¾wïðý…„ó·¢”Ú4xsš‰¯uO‰ÑhNŸÛ‹!úÀAŽqx™Ê”çB6»Lî¡%G)玥.7×(º=Ïñ=˜“¶Ä¤ÎçÊÿ{FQªë+CVÚ$´3Imä-r#hÿª*ŠjîÅÖˆé#“E6žYOjõӶŢ3TþR^eÌñ!A‡®ENd[Ôû÷;6=XÞ½p¹\P’ë <<88ÑQ¶4%³C‹ƒÃ;Õ ²4{¡7Ôü¼iÒ›±òÞŽ ù(óIT!ð((_ßuIŽÏ²G¾Õ—ûÇèIyS‹•¸êÌþÆ«©¼PÒ”Ñup‹²¨)¬"ˆ_î¸WƒD‚x"Ý„¸ã;ȇžõl²*Qø­^þU↴DC#'äº!¼mÖäµì¹CÈ;‰ŒÚYdJ3æ9!Ptšýþþ̘#ÐŒbw\E6tÁ]ñòšË1Yf‡žÃcï¿Øö|'7U£Z·o]Îc®ºAh}¦Œ³Û¤Ûmº¢Õo›´4]„žýMNLÇÃÂ#õ!ÎœY‚ÒŸò²ÉSçª1iaÚK>»W·ÙC^)t@.ò¾ÇEç»ñK á)Ž0P=U –†¡†÷?hè$abªÁ‘gÕª«×ù »0Ô{àÆV¤eKSYé±Ò•Â_À——WU³ÕØ ·Ó¥B]ÕNTlµ®ÛN@«¡ËÌì„C.Lšó¾sæC;WŽX ¨,>­3ItUÙZšÉÔ¨µ ˜”x¥Ýÿ/•e3l`õ± ½d¬•iC /ªs N‡–§s@Ž•V"Òl÷Ú TE”ÿ¨I[؈ H‹ÎƒþÊÓJ¯0¡ÕéVÙŽÅ'»D‚‡¦¥ÂÆ¢¹%ƒf´tzwHÝä×sÈPf(¸´ù´,jÆ–:…SÝë§Çv}]ƒùwñ¢|sN„ºI×[ XV9xS‚ Èá˜ñsBU\£D[ušMœâCªPý¿ÏeNUbZòð ¯_ô°FY¥è µ29†?¼ƒ?‘‚?DZ7X'3 ]Ç 'Xè5T‡ÅZ”¢É³¹rhðGG?R||‚µãÙã/p­[»,òVv¼‡šùv$ $£šaÀ⬔b-S ô…pÃhÂßûÏ…ë*ß‚h\õL§Üüƒh‹VneÛ÷­¤³<Xé|¬øÒÞ~qÝ=I¾Ôaª«ÛX”$§§G#'0Ç÷5\eobìos—_÷™øUmä«éuäÚjÔ'Þ_Ùà3>ðö{ÇÞVÓ$Dä%ɸÿA½²LU|È(Ê1,LéZ//éh‘¹ú"³ê#0ŽZjÕã «®H•J<¦;ë@ƒnÇÝ"/U‹ó¹õê3….U1ÆeJr-$°h{3 éïsWaÌ{`Ýñ|݉©o”˜‘˘nÞ 5¿ØÚaKœpŒ0Ñ牫ýìýÅÊ/DÎ*jiN¨$ÙKP.!»z–áV×`õ!%ùV©#¿FñŽ0P>Çþ0B ßeÔalñ•FM˜èè0©¯Â¤Ç´ÜÒbxa˜ u‰”›^2ׇQ÷„hÍá)tßÆ¡NáŠ&ù¶N3õŒ¡ë°B åÓÛ9=q0ë¼È’à”î!z›ÐA Ð"Œ‘0wCå‚vÊáÎ;8b ÔYÀ| {\ëÌøËJ–¶¨3 z»™¥~k©t“²"–!ØQ„éu€Wj^D\‰¬m+Z´ Õ¯]¸îŸÿé«ý¶ÿ±R¡ÞP}´êJ8Í0ß&Qøßûm‚uœ"¸(ºZnø*ûîÔ™8‘ëuí¦Ú+J_}OÚc#ê"¯Ç0¹{äŸîƒ±¡Æ9 ‘žEoiÇê qºŸlÿÒÅê endstream endobj 618 0 obj << /Length 1190 /Filter /FlateDecode >> stream xÚµWßoÛ6~Ï_a`/R3¢HJr“K—´ÈàÆFâõe Z¦2eH´—`ö¯ï(RòÒ®töOäñî»#ù‰;üq';qBPBâN:? êÞò±c„»Ï'ØêuA±»¡ùqtrö‰±P/èáÎh¶ij4íüá‘Èï†4f7X€”xBÞûØKý.ö è!„x÷z$ö„îK³‡Ó”«¬f”Ë©úÙ¤äå‹ÿçè·“ëQ Š… 1JŽŒ ÑþNI„z”B4 5¡|òâ%€ ˜—ÉJq™ŠSøÄØSOB÷GÞ¬Èó‡8ÿÊä£QÏ|¾ÈíxV™Nn>Ó¢,EªLŸÏjÉs à‰6ñ„A1#C %/ wFm«¡†˜²2‰ó&çRƒS<“->UÃõa Óè•*Õ{X«aÒ!@AÂŒ³ éƒÖ÷]L¶?ù:éÞír>¥‘‹™iõ”jk 6sBW§5ôóñ¿ýhú:µ$7páno”(¹*¬¦äsáRVáë2P©¹rfà”{Å•˜ ©Ìg61›e¢¬Î–Ù L™/3>É…N>Y.'«ýÁ]ezg+ñÚ`þÇå ôrâ7¬ç[NçÑxãr>,Ë<‡ö2÷¢ˆèâ¬e]jFAÉ6eŒ4iRÚó%œs#O­OMJv8åÒO\÷n²f¦UÍ©Ð…DŠ©ù\ù H7_ 7§…½Ek˜spß÷ƒáøêæîú×ÑÍ×ëñíàöÚ&A™hfžº¬'ÀÊdÓv».%à”Э´îx^Þ]öû×ý·zŽ ªè@T_†7NÓP%{½ÞÚt]€á´¸R+J¸ø íàÎé…BÜ næ"«omÆ( ÂísÅ·wU.Sµ,…ËAðí~s"Ò#J+£ÌUZÅÔâ¡@ žz .÷КûŒoÝö”×áh§º³–kª|œ·„÷w½—0F”mï¤ô‰[rzg‰(ïÜïF Èg¶ïFç™þ˜®ÕwÒX;süLÓZñäd\³ ¸bq¼vå¦KK}•õ)-–'±¾!çömµïq6Õîi­û˲ä/{¼C¼ÈésO^†vÇÀ¸Úk—߆ ×ù­Ž‹´aHq^ë¯Cl³6XùehäVÛê6X}%]Çîö¹×YÎÁ¹…Õ XµYèÆ] MÏ0’pøï:öñ?çÎÊü²SÑ.¤ 'fñús¬Þjf#ÜÖØâÜœÜ(‚ Žîf‰‹QÂ,x‚(J`rzC}ýΗ:#$¦ÞR–@ZfÞõ³ª?²‚§‘&jàq]. Š*-³…jµ#º]qz@V[å0vs=ŠXKl¿ßݸ d„œ4Z Ç؆à°%P™âbßF›Ê"4 Â8| ÄË¥z*Ê÷º®S¯¯ß-AH|x\rÃsì_Ÿ$=ݤ†v?òÇúá]!h†ž(ÍÍh7NÂ’­}]¸à°Íàrð™¥h´Í_2 ÇÍœ¥E,nëñ‡ïGÍc÷?~îð2 endstream endobj 621 0 obj << /Length 1266 /Filter /FlateDecode >> stream xÚÍWKoã6¾çWÛ DŠ(’´=t»)²‡6h ôÐ- V¢µ²dPòf‹vÿ{‡J–læÑöRˆ¨á<¾yð£LgüÑYÏRÉBÉÒY¶=‹:©ÙÌpñãwgÔé Œ4¿Yž]Þ1£Q¸ˆt¶\]-óÙÏäíƒÚµÚÌÆaWó€sA~Ø̓8%ººÏêÝâäÞ‰²âCDy¦Ú¢®@"¨ä„¥ó_–ïÏÞ- "¡à앨{íè C—°ä2HÂHp„`ºàÇiÒ8L@¡ÖÝÞXø’Ô¶)Ò”´ÚÙ%c»„‡"b½Ý®Ü·õj_™º,}QR¦É¢×ÖŸZ]5X—tAv¦žCÈE®”(|lµªœ¤­ÝÓ¨jN H)YÃBÛ…±{’¸ð^Q­k³í‹‚µ©·Ù, , cÛÊB*¨KÜ& L8˜âÓ& AîßÖwsè^ˆ¯#ÕFuÀí? Ýî:+pâÚÚà[¥¶ú–iLŠ5j:¸”6‡.­<øMmqw0¬[\¨*?Šp(7³ÁdÖ*ÃÀ0©k\V8*q§¬±Ó»&t-KÇ- b&ð?¹p~oŠR£íÍ\2ÒØ×m‹F†L¸“³ôOõóWOP²„y&ȱ' ¡q‚}G¹Ñ Ž³ÎÚEX=«õ†X0z)y,ª noŒÚn•¹ò.d:MînŒ; ‘ˆÈÕÕWs{TÉ›/ÇY}ý¥·ÍjÀtÕâû·ªU«²hÚÞèòÈê´Ác1F!W·U«7@Sc#7ã·n"WvQý`wß[ŸY³zo§’Ç/rcâÆï.„-A§5Ò÷ í‘Øu䨢O8wõ“qÎG…@¿ðñšù±.rxRßHÂ`…r: ?íØEØá´¶jÓt @2;·0†¦qg¼,ªž=ª¼€»Y…9Îà$ï0Z‰2NsÄž90”`‚|Ç7³z‹.,­ÑÖ†i€ÞE$,M!…™Ú×κ›„Â6‚'I%ù½ê@<Ú·Ô¡•Ä‘™td–öd&{2KûRÈÛ ‘¿l2\ɤCuä´:‡x•~ÄEn³ÁJÉ®Rž±×í¿n³Ž g”Ãʧ­u”c-m!šVU™­‹ˆÌ‚K@^[B“Š•êOj»+µ3mP¨ð‘ÕÆ;y ’Çáâpk¾È<Œ˜ô0$†ÁÖ©¢`µØ2{àÍÈ PŸI0`ãeÄÓ0e<Ï4Q_/¾˜y|ëνG¹e·Îƒ¥ÉsA‘œºäÏuCù½KOd=]Orô_dç‹ãLŽn+ÿ—Äɘ ×Ú3÷Î>k÷Fÿ/>$¿ÚÏ¥W·Qœ|>à·ƒìŽùë?Ð-–¹nÊÕm'ýˆÂgŸ–:{PæÜ]«öëòz¤ ®ÌËsw_QÆ#\Â€!s|/Ng¯[_zúük ,ðöÁm™Š! $àŒ-í TºÀÕZ•Û¬¡Ræ±hüniŠM5€ì¿ˆÿ!p¢Czã"­G·¿ßõË…vn+k\^ŽD}3†ò]œ&{Àðy%˜tñ|¾örÙ;kWÇç!S‘žŠWíu;ªÄ‰óÝ5Îu ˆ… öè8ÃKKŒÇB¸0ÁI“[¸Î6ûRÙ¿Ηûáû7 Ñÿ endstream endobj 624 0 obj << /Length 515 /Filter /FlateDecode >> stream xÚ­”MoÛ0 †ïù¾M>Xµ,É–wL±uŠµX¼]Ö[I hVá=í¯•.X;¬Š¤ù>$a–äðcIU$•âTñ*i¬ò`÷ ^>_¬XŒË 0;‰\7«³÷R&,§u^³¤Ù¦jºäá*Í QÉœ\ÝÂM3lRFÚ4cÄ…sN6ÞSãmm“3Ñê¹wzõÐáå²ßŽz¼O¿7WïšQ²T þL‚cô#Œ 0å¢,ŽEIs)"•i&Ë‚|ð"û f‡Zþî@žd¬¦¬PøòvxžÃ©ˆÆ¿;g­Kár—-1Âí0âÒ-ý”}¯"¿RQÄXŒ¸ö&·´þÝÁÌhÄ[úfB“¯ C»Þr7Æè;r’³­>ATØÏ“±QËVO¦‹òH9e’!é¹y“…v#ä ƒ[ëiv‹Îjôcáznõ€ÎÙ…Mp–¦™)»µ#ûÁ+ýØm8L÷à ®€ç´ãXC½ÌÔÇ‚z4oqt¥8¢µURÆk„‚ŽUOM™´KþLô'Še1E('^RíK§}½{$[Ã4é¾3Ë~±ú¿Å^ÆÖ¤Š·íulÞÅè¦ÉŒ¯‹ôE‡rמ+,º ‹þºp\¢¸<_S :v.,³ÚìÍñsó¶Z=t endstream endobj 627 0 obj << /Length 2994 /Filter /FlateDecode >> stream xÚÙrã6òÝ_¡GªÊb¼²µ™Ùdv¶&Élì­<$)LQ7©%©ñøï·/€‡8—«, ÑDw}CmøS›4ܤYägQº)N7A»§ ~yw£oˆ» æ›û›o~ˆã ü<ÈÕæþ0Ýê~¿ùÍ{{4ç¡ì¶»(Š<ýív§uìý|ÞîÂÔ+›»¢=ã’ö>Té^®µò¢|ûÇý¿n¾¿w´ã0öc½’Q‹}Åm ܦ~¨bm¹ ?Àr«·»8‰ˆ¿Hü¥±ã¸ZŠlvQ쇩â=î%|,e6î »Ky·‰¼¶ä»<8XHl»A°ªža¦áßò³9k¢£¼ ‡§²Ù±Á U+H퇿`¨P±CÉPù*Qªß¥ ÚÒßî’<òÞÀ‰V©÷ÝÇ÷8Hˆ5ümÚWΦ„ à/1€K‹{GP/ bIK-ÙV¢²¦¯ ^8\šñM] U)| íš$'ÓTçKmä$N…¥8]ž ‚öf0<ê‡îR —ŽöŽ3ï÷ L]o•×ÒWÀn 7¤³Ü;°+aSåa?À±— ýåt–a9>l§¶» ˜6Íž)â!ÔÂhÂÉ 3iXd£+Í•#H¼sWñÝÓ«Þ'‚Jû¹Ö@/óã(dz¨£lÇš’Ø0ý/ÔwíaØÂï3 `:^úªybt±ÐÌ‹vEm.½ÌÞÜýƒQ?TEÙô%–Ž¼]ûÔ™Ó‰LñÀS\@ÂzÏÓCYÖ2r,€UÄí]±bíœP£zµâ­ISïå›3ªHª)çXÙ*Øö%O«†×MÃÚOÀs×¢gõþ ç*—ãî§wí¥+d f@Š¦7‰Ÿ§QFʘ&¨r›ÈÏAK‰aµ¦ŽÚ×)8æËg, Út"° ü(ÍSù:³aÀWÈnè}D¡;pN=ŽŽuÝýƒê«0›¹ÿkó¶gÇ+û–Ý Ý(HŽ.fà1¸w6¢^66²ò6÷ž¼@ºö"+ ’ YMƒ[ï[¤ã.¶3èG@W쨫>ó¸Œÿ’Â3g'ó¹:á7—È°>Wx–ಉMtäòÑ –é€FÅ“p—8&¦Þ‘ö#V‰%œéêä3 ”¬ÀÊ›ÅK2¬yE´þrækƒpŒ$0ÓsWÚKôb$ö>â3¨‡Š#6@¦|Á”ýyýÂþ¼yï~úÞýø‘ƒN•¸îy:t¦é!èZÉX®ZÜëŠ@ßIìöâÄ6Øp¨Nå­uYrê1øaÜåþ+Ϲ¸–ìîÈ ÈGƒ¬ô%‘ÇÌ@JˆaÌJÀgC—¢¬=Å»~p{§²7ª‰ã4 Õ¬„ÐkI“Üå<{®€;þ™ÞN 8ár[`4ŽCaú²héîq“ñ @|Â/ñ™àe¢Ä¨–ˆžÝ~°Û±¢~ªº¶±J»v«Ÿ¶à_MW™Çº7•Ìü¡òÃ\Ûð éæÃÇ_¾ûþîýÏ?­yµügYtQ;NQ”ÖïyƤë y/˜³·Iðz+v0‚;S(\á4 2ßQS[Ë5bê‹ãè‘]Â/áH×]Ûí1„~œ§v+0ãrèü ˯r ¼2Ŷ¿bû0šª L úÙý*ùÂOè¤ Ö¨ç~šFsYaÏ…W™%…L½_¥ÐdžG3-!ˆ]›D+ÏÏIÁ7÷*âI¬iO¤³½$8ƒ<™YënšCRp0À#O¦‡d0c&a`qþ¸½`fŒc#¿ƒÛº®ùµhFÕÇè ž´²›Ä˜Pܶ ÏG¨9vkú!a ˜MUºL ˜‹> ð¨7­U–?m|•BDôͯ† ÝÊ㊚CõÓˆé¬-³…¾NQ5öa`Ok0ÇÌÂÏž¼»¶Z K‡ƒ(,>sâk“ªE@ü³a4†>KØ¢ã%2iR÷†çO•œ”åÂ滕²ÅñÄ(—90,öô&ùE°™ ;«Õ®LÔ$Äè+m¶jÄ`Û¾~€ÉCÕ?8×ñ€\¨DÕ­£2üí•ö"Š‘%ÓãÏRpªÃ¥kúõ¨ù Á6¨¨õ°“kvÈ{dÒÊÁÍgÎ<ÁóÎø¼Y_Ã25?ïõ œ¤~è¯DÁ ;-jÐsE%qh¨Ópÿ¾¯8¬õYN’Ùœ$ãÎÏ »0WPÄÍãØ(ä Cq )ËA\6ÈEÛR›4ðÃ@}%·ÑÓf‹TnšsP‰CAÍÁ‚sSZ?ç(‡ªø+ÉÑ×Wô)^Ñß·—ÇUúr Íþ ‡­ý4çöû…k’3`…‹äýߘü¬•ù¼Í¢È¹Èc(Ö§1d9k¶¡þÕµ~|]±ÆÓŠ5Ng^ãk¢E@, 7¶d§­ò^ Ü’Œ¦-IÙÆ0WT°NM_œÞsljÑã­D'òÔPÃHs5ŠÕØ1%eP2aÜ2|uèÚdÛ—åö%yåäÖ¯÷ŒÀEólÏëoÊ~¥¢³AÓ±cN1 ª%¹/ì,™Ç,Ï#3…N #6fN_õƒ-¿xsÛ¦26N1·rœ å–’¯b7ÒrqÀ®xì•K¥Ú™cÅÌ*þ}Å žµ Ôú4âŠGÜÞ†*#jÆÓ9mÄn9†Ñ¡¦¡÷¾Yl„ÁžúÞXäÃÙaîE1>“§, F”<ÛÏW${*›²£.>¦ï´ðX\é>gŸ¤™uNob”b­ï—ùaê<eu9öðt^0D¤_Û ÄÉò ·z‡£éáä*‹\´Åˆ³]¢@ùIºðÁš¨I‚°Ñ¼»&ñ¼²ý\¹XþpÂÞFΙÜòZä»(0I”R8+î3»,œ°>E*ô #_<º ŸÓi°N¯T(o2W)SûQžOÅÖ¯-nzCÖkÀ˜D$\Xd¯ ¤ÂÙË>¯H ¹X¸³lìWTjY…”ú1Ó@ÕØ6,÷«\ã·¸œÑuÞB±ìIÛ6„À¾ÒT‚àœ¼ôÊ~›îø´(i6 ^n¸ºµixÀ–rW~9¯ž¯½¼(¶ò ɯÓçÅÔ6!•g»·j €5+Äv0¾˜â£V)ÏŸöɳ’ö×0'îLšžE‡ÅKçPrLmªÂÔ+Áb/Í¿ËòÙtR}Õ¥éd »¸7pd¬÷íeX” ñ¸m;²ø®ý?÷XЩŸƒ†§›ßþ6{Ç`Ùæ™NÌ þÖ›»›óCöôM>Ï’t“ žæ³”>Üd~ž$šS© ¥'‘,¤·uÛã±jLÓåÇøàC/6½Ø`ØÉ&•t–p@¤»ÂyYü5%'M±›žd´t°Y2¾u¸jÎxH†ßBG À[¬Œ ö 8æÆ#„ ¼ˆÜMàëÄ6=š¢ílõ!þȦ…€œLbY ï blN^­­¯ÀoŽ`ƒî*ÿMï¨ê endstream endobj 636 0 obj << /Length 3092 /Filter /FlateDecode >> stream xÚÕZÝsÛÈ Ï_¡Gª±ÜïÝëÓµI:é¤Iûžr™ -Ñ6§”¨#©8é__`±K‘;v{Nf¢ý"€Åø»f‹ þ±…á cEj…Y¬·Ï2?ÚÜ,¨ñá¯ÏXX·‚…«ÁÊ?_>ûã+¥,K]æØâòzHêr³ø˜Èl¹âÒ¨,y·‡–MŠÝÅ’%ëåŠ%5Œ!’ œ1Icëò׌ÉuÞ•õŽfó݆oÊ«&o¾-?]þíÙËË^(ÅUª¤xàâê“m؆H3ØGÜ×i¦dØFÊS¶\)Í“‡í¾ÜÝü„=‘Ômú­çÂœMÔž„ y|ü”-60ù·E–*Ëw~év!SÉ,´ªÅų$,( ËHžÉT85–§íšÃº;4Kå@o'p »´ò‘ŒUÁ K3!Æü7 8£Âñ@£ôc ˜„šÄŠ™,å@©—º„á8P…Ÿé;͇ß)'%A´ÑŽ‹9~©ŠK?£$¿f*{õúÍË?&‡n螟#&•J<†åž(·À–ý ×/VÜñ4³¶ ‡©þû».½m ZöpžòdÛC¹ëB£×Ã4@¬Ø‘fÒ[7š½Ì×K·Ë•´b*Ö#¤åÉ&ïrš<Šç»·yK+Âô†Ü“:ׇÝÚG–´4’‡ßö¶F†w»0|å9ú±/ø_‘.WÖ‰èíÄb[ä»Ön6:Õ»¦ìh„©Í‘0ôºÛ‚ñv8×ôCõõdeتoº¤•º D64zµ„Øùmî¬Ð¹âý¹Î4Öã —]K ŒÈEµ ½¦Xš¶ü‚l‹êtX¶œ“ù‹Œ§&SAQŒtÅ×îW¸P%×u³Å–NºšFP3q↉B’MÏmF¸”±Áf˜¬ "Œ ÖaLVj–öÔ-O[^U`*³Êd™I­UG'ÙÔg„€p­{ \ÈJq‡5Ép!;u´÷^/Ôv…*s4Š%—¤ .8:wF»Âð ]l•dþØÜÕ5¼2°1ñ5aX¯¸H%ß\B#2·EC«›bß-š´IºˆÛ0¾®ê–Öp¿ë×hÃÍ.¯fêHÓi2çM ·Å¶†LÀ· €˜M¶x„y‰Î^}ëד¿mŠ xÝbcS\nn¼×bwh¢% ëK™E]O AhÀFÙGË!ìí2ÖÛK‰<74r§`Óz|ŒyÌ|6›¿ñ'J†:.n¼Z1 äM¾-ºØ½»-׸►ëº%† ±C÷ÅQ>­Â_éÔ3>>˜¯ ŠƒUJ›'p\HeRÓ#NéÑ{<…DpÜ÷æI<ÕÖ.”ܵúiy&]L1æÔÃò$åRÁÍ#˜äIZ¦ðlÄï5Á’n>1SrFÿ~‰ŠÓýR„‡fê$#+}J„˜ÀИ”1Ö Ÿ@BI×!­oF›dËsúÏZ¦â$E0>E0R%¯» Ýð}³>´ï^O“n™O ¤S€ÄÚydêpÓ¸Iœ?Ípíù\]ífS›kO2$ë3äzÌ°‡2QÑ{Lð³| !h㵌Ë1òŒö8[ºe øòHq=,9u„%§½¨mQLëB&¡3Òׇj!¬ Ssà±ðã¾@ +Åøýj@`¦à²ñ¢^1؃¬C# úqŠµ0ùª¤-éäÕÒÊd°­X{Åøª8j VÀH½û„É[Èo f§Z"K­c#-œ¯Žãê{ö<%-†‘bÜÙlNBY$Ô²9›jc'Ùœ7 ‰žÎä(eè3<2VŸá!ÂE\ÇìnÖ7,Ë…–Ù‰Af‡¬|´A6X)LA™v)û@¨fv3øºb̸S˜³ÐŠ|–ŸGØL›…´6ÍŒ{*šT1 ÄŒCXë«€Ç pŠ°L©1ÿ”p\…Rcp=‡oœCÓ>¡ð?GXbpa!Œ›@u¹W9£ÌI(QÜyÍN*kŠ8šqjˆ2„…, +²8ê Q3 +3BMP3#Ô4‰ë k#"jÉði(вÙZyI4W>•Õ'›Ã)ÚN6‡è€wK$p*\ê=†)œh6Í>p¨#h÷`ßž#i@n.¹ ·? FñûÕ€À\`ž°™€ÈŠ`D14cDq¨Ñ)BqkBqkG…ý³÷¶,AhâÎhÂŧÐÄ ˆ€âï}·qõj°|FS¢hB)®A¶¦ÞRç >)hªÞ½ÏÍ¢ƒtŸO/.A%GÔhä5r18˜á­M†9ÇŸ< =@#¤Þ–à´©Tv‘Þ®!a="t†%ÃÝ6‚«‡» yz,Í€íZêäô3IGÈ0,º†rôÖ—æ8VU>LÀfŠÙ.x–Öåï†n÷˜;{¬L¥œÏR¥Â:áø|>Ÿ—;Š ñ.ÏW×; à­£%ÁùÏèU^G~ѯ¾ô<ƒ$†»…0øËžøä€ú0DŒ‹‡á¼úBÛGòŸ¾8b33b¿Í{]œycЩeæÿíýþÖ9華±NÆÉ!B—2WKî ?ý¥á=èÑA >`|p…«A¥ì‡{Ì•2ãëbß‘dõn¶@Føç±1NUD_ûìÆÇn(õS''W?ƒÍs VêíÚ{vý]þÞ–-µ®òÓ7Ïíº)‹ã’3ù†véø›¢òN9 ³úä°Y§Oï¡‘#ÝûèݦøíP‚3uI¡”Õå]qéïÁ …ÔÇ+èÑɺÄÃŒ?ƒÃý?Þ†Œ¢Øç‹÷sÛqPµ/Fú+oÁIÜ+ÿšD¶6<¶!ñ/.G|„ü6³óň©å“Ä4óï?"¦Ï«X¤uå¾*¢Ï%=yS€ÿ„szå Â_6¡Èæ¹p`/ŒÆÉ'Þ7 @à,@+Ëxß`uÊ™xûÉuƒcà |Äýº)Šù{¼_Ôü÷{²GI0Ø¥l†öñ¤?YD ÿ³læ endstream endobj 644 0 obj << /Length 1945 /Filter /FlateDecode >> stream xÚµXÛŽÛ6}߯0Ð9XqÅ›.I[ MÓ6E ‰û”,Ñk¡²äHr¶éåß;ádÉÖ^°Al4‡ÃáááÐ|À?¾ˆÄ"Š%‹e´ÈvÕ6× ^ÿtÁ†þÈòûÕÅÕZ/xÀ’ á‹Õfìj•/ÞzÏ·é¾3ÍÒ—RzêéÒWJ{¯öK_Dž©Þdõ»”÷k±nÒæ3ê•âžâË÷«_.^¬†¹µÐL+ùÀ@{ëD+BhEѾH³¥ˆ½-ÄÅC˜KŸ{Õ’{.ZèÉÓ.%©íštehÓ¡Ôêئ- Ö0òvfWãúìp“–e Îc/K»¢®Èds¨²¾ãZÒ¶ÛcºéÕk;Îê>á†-} v/;2hLvh|L¤Âç’qÍiumAJLs½McLKb·5$ôa¢<ÒänLÝ G`²îиæžÂ+*œj¶ÆÖg ¶ oH‹±RŒÎf²MšE"î-.ÑcâÌ0exý\M•–'1¹å¥]Kjk›È´.Cä’3Š ‚$ Œ2 8Ñˤb‚…öPxÏ˺*ªë§Ø’^Ý–=p?häqÂ`™‹0’”€Å·ïƒE°GLÇbqcMw ÅÇ•–‹7¿by 1P$ó¥È™ÐÂeÍ­w©€ëYBk–HùȦ™!gLæÏ fnw}’ŸG,”î˜A–>u(&X }ÖŒcÍa%º7ý¨ƒ#«c0”áØ®ì] ƒÛ\‡s’|AÌ-xçÏæ`M˜‚}óyÌ"yFQ±$ŠŠL *ÇM N&6‰‘@pÝ´iVæH â ´t#,EÄA¨^[b´º#%’8 ,éÆÎWï ã"{ŒÊÁ¨v'™>0‰V^½Á¯t„£'ËÂæ á€övÂá!~¬ï%œhL8á@8Vtsa¾ÈñÄ:œCN·FKÁ¤}¬–~¬d“\ãÃq³iCec`lÕš]^CìÅ#Îb.¦üÞÕtÍÚLá¥Úï0è0‹“¾18ä\Q{G`žÅYZõy3Ð>c׈øtµL”gÚ®gXqÆÀ°r¡cÅàÎüR†åÀ°Â: âè 4 ù#8aXÃN§7i9O°:÷S~-ªî>Ô€žè1¤eùù_Þ|(¿Ä»¸ƒnášp˜n¡[(NéTŽnAŸ(hÝbÍAŸŽ`LQ©‡ÎrL³¨ž£Ùk¢Y0 ÐŒýüá|Ül œñÆÍiÝ-m½8Sžr ¸P ºB¡1Ó46hl"¿à0Ô®C ³©Q?®º°01EƒmÇ&VžN}6…¥)ë3Ý™ïÔ¬›aÄùE’ï.M3„'•š„‡í›m1ì-4ûË'-*RUâ@JEõïΖì#¤ï(¤í€^¢ï¥¥}ls7hsâo†k§áÍl•«`UŸ|}L¾­‚…Pù¾)ZÄŠ’Â[m ŠH$ÚbÌŠž±ã «C¥ªƒáÐdKͽº‚û¸ó×(§­ÁO>w|ˆI5ʹʇ‰è[!ÁUn\{J(x­××ØÜ—!·Ž¶×žÐ!‹U_VјҢ£í'ï¶$!­r°ë©K é]M‘ݼ—S ¼Î>ÓUÞ˜= ÆŒŽÒ覗_¬E\«ptÕ¥€bé™#áò‹û{XÒûÇÿ™îö¥}Üjª&"zÈÃö |ªá!ß»¢,þ¢'î dpy ã"¡ù~6v} Y‘=ìVÚÂiµ3Dúž2iÙ p¯eç§#eáœÑƒ¾nÛb]º©lÑ&‡¶WlëS²U¿8¨`ñÔ |¥·‡Ý0¹EÆ9ÙŸ,œªìj²Þé êÖkoÑá9«è}9f|÷„ü›4u endstream endobj 648 0 obj << /Length 3054 /Filter /FlateDecode >> stream xÚ­YmoâHþ>¿NZG Žßç´q¯°ØìÜhfµç€I|clÖ6›™õÖ`V§Hqwuwu½Lìwf^'ï®n]·gz`f/YwY%«Þ'ͱ.ú–㻆6ÝBk ee|ajË‹¾©U@±m[‹qÄ×2¤-óφé,Ó6¯JMË7ÆùcÖß.~O~y&{¡\ËÕ]ÇþA ÔìWjø †­ ‡RÃòtÃuD ÝÑÍ‹¾ëYÚÅÌ—YÙ€Jsj£×7}ݳeím^7-ª¯ñkiiQ\2%o™òr¶©vÅŠÉl+îü…chN3¿ä¥Lj+þÖÙ:«y°}&¡¨½­³&+q­ì¾ªˆër·é--/y8%â7îlwE~prN[µ]³+Ú5'UmÝtYÓu]m.úŽ³3nìi êŽaFxX"Ô9hÒÅ1©ù[¶vtÌ@k²ì¶ëém÷¼ÀÕ-Æ…îÂ8þ™ä˜ÒEŠZÞ?¬?ƒ÷“MÈ Ÿ®ÓÆ4ɶé“hìø§":6`,º"¾ ]5ùû9Ž¡;ƒc>®‘² ùc›}嶠…Ýœ]Ú·½q`ÏšÌb[W8ù¯|•!ú@/è3ÃäYjäm!MV[}šûômËÐ6 ¸]J±`aTTåÏzÉÉÇ\%ˆÏ:zVèrYµŒ ¡©ƒŽ¡%jÁ1ÀºhTB¡ìBRÙŽ¶Ø¡®þ^WÜ•+Ž0[ä†Ý§|U¤;XÑ`[®ãn”%²÷´·éèã€ì 0:£ˆ€î¡FÌÆ2Li-Ê\rAyDÙgHLë¼éÇ;‘˜—8‡ìMæÑpo…Žól•7m?î$؃¬‚Æ‘nϹèMµ«—ÙÉäǼdsB{]Õ›†"ÀQÎ*Æ/²yQÞ>W»–Ç6œV@Ö§µì$­û Ô½I;>Ýäm«¼v‚Y°†Jb7®«¢ i/9f-«r•ãþœ@µÌÝd-;ÓÕÈyGfDøyžqbΚOàǯ2¶—¢¯t7èÏØ«³6E[c›DÅFÊ!ÇJ]ðùÀœ¶ @.!Éׄ Ç%.Hä!¹ÈÕ>J0>Kà 4'̺º7p ¼”XÐymA˜4ù&«uq•âÔ±˜õ–Ål7` Áw)h#¦¸µ¡ÄA§*0¨³m ’‹=w„KWe'»ùµØ 'e¢ìíe{žÊT@f{a‹²--ûošèK åˆ8Ök{é`/î“öÝ5¯Žnu2óW•,¬`…47i›ÕyZˆGÁp&Jv+nÓ’g¾ãJ[\ɹ×pµ2ÝPËc‹…¹!ÝAÐ×Lܤªä€D_ÕrûPÿÀ,¨!V¤âá¬\Uu#ÃÌÌC 7U+DTWàÐ6L‚.ésÅ ¸\aáò·ßTë–ÜÅYVŒƒöâÜ&k$3IõªÒO^É¡ñRcZ*Õ CEN½É)³6èH²¬§{®Gµc`IE•ÜG1Š8Ðâé-Ø'Á.LÓÒ†óGx†¯Íæð)Jù[tÞ0õú#ÏJîeú',’ûéœ'|6mg+Vÿ`âpr#³'²>ü÷lbé.Saù›I8z˜#ÀÂ¥5AÚùp’Da|ÉÔh2/n¢Éô¯ 7&Sj˜Ú8zˆÅ$™Êò iÛ(™„±,½%óÎe föEI4ZŒ‡2<[ÌgÓ8”¹à©×ÅòMÆÃè!¼¡ÂM‚_,Àýð·p’p3¾ŽÇ<Êp¬#?âÀµÐÇÑðz2íçð‹]‰Ô›hŽ’Ës¶Š&j°ïXX4ŒIb¡±ãY8Š¤ç.‡ÀbÌVø(ä)æÜM'qøëØÀ*fqƒr H…;pÍI°ê‚Äv‰ wI Rö Á‡gäÛéh1Ȇ8ŠžÇÁxq'Q²HB¦ßM§7±L™Ÿ“$¨ ¼~‹Faü/¬-=mÅ|”ÄÑdÖ ˜4 ïÆÑ]8…Ý…®6-Øg¢8d[áøpŸø,ð1“øbhHJA„2å%6±}•‹È°ÝOÒ6R m'*;…—LÃÀæV$œ†7œµÙA'[¼v,¤–8R ÏB -ñbtÏ”ãÓù™âøxZ–îƒÃ‡ÅOsªøÿÜåu†õÞþ›xè›—qzµ· sׂqª«à›ò§i¡„éãí/ãÉë½Îv¸E?ÐizXö˜6ù’›P!Pˆ9üž)˜2Ù©äÂ*¼Œï¯Fç¹;+.ÚÒâ8ZfVxá‚ÃÐC1úI½ÜÌl¹Xàä•pŒpå£zðÂNúXdÌX ócPý…©X "jÎÿîJõxÖâõ©’!.ÞH6.‘HRCÙ‹ õéòƒ“àæowˆgÀŵuÑæÛ"S… 6º²URÆðåfKµV7—'äÝdÁ”;8#äNܹs/Sáµ·v¤ÜËW£.±Ü¯¶û:ôGÀ¬^ìxsßí€:˜O˜aZPŠø€£+ѪAЭP q!’¹Büe%j±op,/›´ÌŠoL/ÒúI–ËU0ƒâÑ[æRá_r‘*u3a¼V‹‚9 š¦öÍKucoAS!ö\È#¸ôA¹ø Þgäp¾`x»‚sê£åئ]Ê°1Шê[9—€¾¨P\xX˜b°Ç«‚sw3òƒÓóôÀÇûźgù®>°¬ž­n wÇsÞ§{A¯ß™1éºêZ»‰ ¡Åб—Õf›2NÙÃC@Ë㊇2Ä[¼«QÁk Ý‚ 3ÄwŸ6p+yLPÏÚ‡Q¡!7–ªUwhðB[ÕßÞ³®žÓÕuU÷É% Ðã‹Y¼îTÓ‚{… >f“\AYçO»:;Ç·/³ÿçMúåo±tßf9,O2A-9­}Nï"GâðÓ^ 'LQœÛ®ï›º¨K—×9Ç tCѼN!^ø“ sÜ¿L›òxúÊ@ž¡Ûž©DºÚ5õUQ-Ó³²¸¾nùÖÞOpœ8.È‚™—dPxà ÷Wg£ã û¬äP.hò•´åÙݤøI^z-ÛÒ]ß?†òQ†Þ¦í3]Oœ}òãJÓ+|U¯jûƒ¢‚D¸9=$êðžü¬~â€vÖž3™5ÐÇPɾn!³\àO7Úøæqt=Î?þ1&÷?ÿó„ðþ`â+Pä¬Ë_ï¯Y¤oü#LÍb7ÏæY~2ýI¿”3+mäÁrÙ÷‘lgå_gaâÿQóF i=¥ é¬wÐÆ.t´kB1ºZñv ,(rªÌT1¥c)èéh‹š+ìWŠŽ\ë%/¥óV^ Éä„àQHJ‡# Ì?PÁlD[Á¿káOB|TŸ­Ñ|öúrÁµöäÍZKdøœ–Oßö¯0p$ÓÖ­ÎïÃRj(\ÕT…<‹cy¹û½Òæ 7(QÐ~ÏP)‡—•J‘Š Þ´^)Iàl…áu)ö¸ÿAΆ Ú(xÃ’ÁùÚ­ŽxJµ>yæûâTJû~TE¢Óò-dSqWûÏY;’mÿÜùAŒú}cýÁz6¥;¦n Åà']ý öçþ·-H{ž¯;¾ƒ?j}úÝè­€ ÖÐí`Ð{¡Iàƒ¹½èÅï~徺5‚ïëÏï¹núƒ£Á6ñ°ôàL‚in`¾³õ!AùܶÛ÷WW///zóR}Õá´¾zÚl•Œÿ’mËÍ endstream endobj 653 0 obj << /Length 3316 /Filter /FlateDecode >> stream xÚkܶñ»Å~‹°x")êa ’ºN\$pZ_ŠŽêVÚ]ÕZi+i}¾|èoï ‡¤Ë=?pÀ‰ÉápÞ\¾‰àoR±I3É2™n¶Çg‘†öû 5þñÓ3nðB@ g˜?Þ=»}¥Ô†G,r¾¹ÛÍ—º+7ï‚¿ŠÓXõ7¡”2ˆ_Ü„q¬‚7§›P¤AÕ¾Ýv'Šƒ_êû¾èÇ<ˆåÍû»¿=ûëÛ[ ÅT,¿P‹ýj³„åq D',R1Q|w¨€$••ÙD%€•2‰‚C1tìè{Oø4z®oxÐŒÔ;u»7؃ñÓ¯¿¤q«êE` ³Ã`ø´­w4€£¥oÛµˆûñ†6åA ÖÓ`DömBëó…\2®8¦ýñxîa’ˆe0lûú4R»;u‡ë ÔÇ£áNSÈÁLÓä‹X @c?àD ø#RÑ )ªÖ·(…dyšmR.ाE¦`ŒE9üãB_ç2¿W;?œ-à¹×õ6úào«íhhQdðGÍwoì¡‹† ¯n2TÅ,Þ?XƒS±7÷È&ϘHùâTOȦÁþÌÖ‹ê3k9Ãío_¥€-IÀ&À½JhU!XjeO)oB•ˆàu;ŒEÓÄ™* éÏš'-¹$ ¹IY"ÍÖoÚ-0 Γ ìPäÚ¦+ʪD˜ Š¶¤Ás{*¶8þAË¥¢HTlÏnÂ\r« 8O‹büÛÌIqÆR®€MÂXCþùé㎠GwªÚ4„Y,b€ÂöúŽÃSÉd"ìZßÑþ[Óî’¾ÄÀ¼(M— s„³!ßAd$@7AÜ»3ÈBÛå ×鎧º©¨3nPöu{eEVƹƒ¾Uy=U·Oš?ÂòwÚuMC|wc°'Ò6POK6 š³épÑòTÖôJkÔ¾ˆ¡=ÐÖé™ÝH²îé<<ØŽ]ÿø‚Ø›Ä S –FÁ`wn…•§¾[N”»Tv[œÇn_µl8ø ú7- ÆnWkS÷Ù•Å׬|,>TßB¬º¾ä¨Ax…½ˆN[ÿn|á£'AÓ¾ GO®IÍ}Û½a*O´V穘y»8Ž‚SßíûâˆÜ×mÑ×Õ@C¤ÛîÀÃ)ü ) #i“. ÔùA„öÕ±›ÜTI»¾3;vÿ¡;÷[3gKòWš!¿J ž]¸òxÝÁÍTÈÃ7©ÏpÁ¸mSý¶)˜q'R7R¨à=D‡ô¤à5ÝJ‚^ëÈü¼„a™Îù…Ðb¤y8î¹4ƒ s´®dyEeÂbgÛ¬GÇ]¶=82â{JžÙýˆ¢ÓXtvt°ŠIgíÆƶ!Ÿ(üñtf^%öÜuÆBô)k8²¬z•hà‡ÚŠz·3̇Î&¢™¥…Ì%Iò¹†L0ÅÕåE–õ0^½Là(¶Üeú<)Y,‰’KO“'}ƒ—¬C†#Ôhú|̸Í,Ý'¿ ë«Œ1’R0.ó•5ÚW:Îø䦱S·ÞðK°l"aâÁí}íu à,•Â³hÝn›sYùe_êÜÛ<*ËLU$ãÖ@g|3¨œ)µ4nƒ1BXºÀ ŒIKߥÔÁ<ÒsíNñÐùDðI+y¯AD _±ü2YL$¹ã°µ$¸ü¾þx%\T_á‘S¦ÜêZôpiSQñ, LŒÀ)Ê¥†á©ßòéûß~¸ûÙ+üˆ¨x¬²,e<Ê¿Õjˆ$µV‹YD·/’ä·&™8¸53s8Ÿ©ë1ðÀYRÐÐ}=fÅ$ž@„¤‚¨°zG#õhúƒù:5¯Ì´Ïø5Þ{í¤·-‹^#gACÙÅVKà ž ~§’Ž_‹Æc1Âð¡áþèõBòÜ鑽:„¼¾ø‚ò˜/3¸ÿÉ¢’×OlàÏÔ$´ÔA:Z1R«íŒîF à|É.*LJJ¼9”„frɉïiÕ§%Ö–RdFIB qMõ£ æ‘úõt¹OQÁEÐC…ŽN>Jòt^2T§îdÞ&!©eŠ²ÍŽ°P,VŽ^]"mJjÒÂ9„#Éœ…‹ B;tgÚ^Ì‚(ÀÈ™QZýº%ж̠οÙfìÏ9oV‡õ9!Yå 98?.’…½_Zu b¸P3iÉÄƬRžÏÄÍ¿Þ;É]Å<¹“ 9Eºbc=4Ÿ³ \F,éÜuê}ÐÞàwž´‚x<·^¶Ë×µaðµWCò¿Å•ù±CÅN—•å’µåR.®²Ò+eVTŸªíçøÚé‹£¹ë~«¥ý ‡Q­Š(¯Û©üaªCåöÓCunaSËd¬cÙye…ÌN1e¨©.“® ábK§qpxŒù3µëµKinïÔQÂ=w ÷€Ðú Ñš¢ YBˆ2þø²,¡¨,ñ{»Á/«A„’ã:¤-gKTÅP£9FಂG0r;òâ)A‹ò6ô©Ø‡³ÚƒCÃXhÝv9¬\U¿a ígaæôSQ»:8€o[m«a€Í´Qô8Úþ‰ìmöþHQŒNb×¹šœ%G^c”€kñ¤1çö©D&[DÚîÚ!´± AbDÞ¼6„ò¹½vsé/uI'Øž`¬ 1>yù @"›_~&/.0“³·ØLèrZ_ߟMú ‘é2Ä@8ôØGÌêõ#uAw 9¨Ïø-©¦Môb^_˜§7†eÁ«ºtЙۂ†[Éw·³B1•KV î”æ,¬0ßÒh2íœQEaŽpDèYç‰‡åˆ g‡¡¾o*Mhbù­IÀ7³™}ÌÐh§¼Ôüûô¸¯Z3RѶmm2wN:æí.eWF•°ü¥rSͬJã8–W°Ø«Áõ”«Z`âMÂòrJ]:Á$ž2#½I(ËÐbÎа¨†«ã£Îè„5f÷½{¥Ö¾©©ÑésÉ ¬?±X¨åÅ_㦠Π@ûé·éq,=J[v[oi/a‰˜¢úþÚ;‘³äegn¥‡.t“·/~­~È•bà¢\t2š“\MÁ§°¦¸‘\7VæL(5¯õ`·ØéŸi`³?·-™`e •Z à~7mzò¿|îÁ'rôc|cúõÏýf~8[À÷Ü¿ÚfõÜô™‡pl¾[¾„#hþþÞ„{$Ù­Òobžx~ù6 ÐÀ3–óÏý>Åb‡3tÏÁÖ‹Î~&¹XZ¤ËÔ  °Å£¡÷ª1g¨±ƒY›Ÿï~ýå95)î0êªþE]z„Ʊh)ÁŽw%H !Ê¡3/y{;ÙwOOaí¼:éfõæõv¤\Ö_ç®ÌÕåY®Ÿ%f…*uAlHGþT·»Žöœ3ín#P@=L/ ±‡ç4SxŠ™C-iL×›ãô'õ#ÝTŠ¸b­ =ΧdwVi–ÚÛf±=iBGÂ!X(oSSŽ«b]”APm†ªšªu8öÛËWÜuý±0ˆ(YæéV÷Ÿ6Í‚•T9[;Â5ˆSiž ío>‚ý5-9“/cIÑPˆ¢½&1¶$fôºŒÚý_§²©Ø$¥§1ªê»÷Ѧ08j¸ˆló ‘Ž¸¡3i6oŸýÔyîR!ÉÊÀ8©\?@Ï}ªäXæO@u9\ÿE²,2ÑÞaO/noX®íÖ6·ÿ+ëc Ò|k]Œ!øÿm‚ endstream endobj 661 0 obj << /Length 3811 /Filter /FlateDecode >> stream xÚ•Z[ÛÆ~÷¯òR-q9œ!‡ôSQ×S¸;OIp©Y‰5E*$åµûë{nËvÖ^Ãðrî—sýΩM ÿÔÆ&›ë(×vS^ÄÔÚ6\øù‡JÆí`àn1òïï_Üþ3M7*ŽŠ¸P›÷÷Ë¥Þï7¿n¹Ù%Ʀñö§3”ò­kßݨmu³SÛZ´ÖÛwØc·Ûªú·X™ªë®åÞ²Ýsám}×—ýç›ßßÿëÅë÷Ó¡Ò$R£Ÿy?ú×H²(N _c¼£>×í·‡ÑÙr´Ö‘56 ±§òƒ«ÛûŽO½ÛÇSƒevíPuçhtŸjYhµ­Ê”§•¾‡iªØ^†§ö5Qž¥~ôn×v»áÜÔché,Ž¬ÊüØî,VÜ XÁŃk]_ŽŽk%`wqh¤õÍû¿Å 6»¤PQ¢ÓÍNéH¥ŠWFö5î·8U|ÿ®ç»Ed¨Üwý©y Ü÷eR+üSi˜Ö_§o¢¡œûÙxʈÇYg"m²Çí’¬ˆL¢±Åy&²e7»4K¶ÿpo´Úº¦;Ÿ\‹Åq^EG1l‡«Ä0=Š"¦GŠx¢³>÷õáÈÓwÚ¦Û‡áâB熕”2-Òøþ¼H´è”EªP™°ÉkÉ.IŠm=pcÙr}ÒA®¾ë.}%K{ bšnÿëªÑOÚó°ÏÈ‘î­ñ»4Òqï\í÷½sÜ6vÜRxÁ´±¯ï.£ôy6Óêû½°˜n· ûK[¡t– ɵØ”¤¤n¹|.û±®.MÙsÝ}ï0c@†‚Ò$™†ýû®‚{Р»ËA–êhZ¶­AOhsÎP€Û!?NÃ÷Qªº ƒñd‘¢›QéöM‡Mø$ÿö߯n"!ÙñÀ £—†+åþT·õ0‚žÕ<™Û{WpÒyˆ£4#c‘j$*xnîîù»×;¿[/ƒhx@þóx¤Ëa»ûT¹óèËKâ…øá9®u¾m;ÒZ ¬ÜÉÑ¡µ>Ëjt2fVf‹¢cAtz®=P­ÿ€dLíök+‡÷Õ ©÷´â*ZOh^I¸K2‰½H¬ÀO%K–%Ò‘ü&,¶Í~‹u šf1"*Q˜Z¼Þ‹¹žÇJ/ðP)‡\˜Õ *÷Œ-ååTÉ 41±»‹Ô“— GÑ´Ö,H •sƒb‰ˆß}ÇFh¸T8ðÈ­%Bä†ækr#3s°õbϦûãØYb òPîjûz¨.à tC,Õdiµ‡z<úî§ùHºÊ,`ï¢L?Œ(q Õ¯'açÞù€ä¡ªæ²wܳÅn:aÿ™#º¿C~SC˜ !gD*Nfg°3ø×rˆ…À?õØ1ÆyŽбéÅRïø¬~jdCa½¡°×>›&yÆ Pþ aé<£ÎiÀN9!¬(…>¸üQ A­uËsùù»ÅŒ¹ÖhæjºæqÏ/ooáj]ÔõQõ¿Û‡ÛÉÍê,Ïjr by֧Ѡýød+Ò_/J'C‘Òa”ƒ"ð¼äB'BŠ³…ØA…ì„CÙµÅÁ¦‡²ÇrŽ“;þv³‡—5O² Hp{0Võ(òPV•†õ*¢Pº–)Ðî(¤{?µ ž.÷ž+å˜laCÇ;S×äR`¼÷ \cÛS¶7¯€‰Ê"kÕ ‡VhÎ.N€ˆØòÀ½4·3÷V,º:!9zp[\#§Â'«{Âi%y¾¦Û ÂØÖolÁ¬ %’ŸbûIÚñ¨’0íV數õ¢Àhw 1*{ñì|t+GW9¶ÙsõB–VÙ)óµÚa 4aâ{¼h€€œ•5Ó¨F[ŒòÆF­L’è‡NlƒXêK–Þ>×pj¢a“d»glâÝxõÏHÞæÙ8ÚhûDlŠê=)C¥ÀïC_#ª5’ç§â+þp¼FŲåeº;<²€kìèúZ|<Â&l˜Á°Ä_—ÞÓ.'!d?NÞ—cmc©Æ (jLH0:D߇”ɦQ>‡¯<“]Û}×…Èâ®rµŒ¢x—c9p¡¥@¨•€º]¹G=ça˜8.롨èé`âŸo»¡¹…ƒEÇÐÑ éL?>ÚÃÑyZ4Toq ØÀ½×JŒQ½ Â-M’¯€;£JÔ\vüò*P ^Pi¢>"“eóq :D$±vYüöî~àq ¿¶8W‘z]ëžš7àµF´øþDJ_ Pø ðÁD„Ì©I—)Š"—$ Z²– w*ÁJîñÏ夓Nîö \H" 0纘²rÎó×Ï)‘!žuÚ ÌéØ­0ðiÈŒ-Oõñ²ìëî2ˆpÄ*Ê’"¸" èš’µ;a˜‹ìY±$ …’¿³B„ýMÃýmyâeÒÉ´$ `Û¹w¨MŸÂ™)0ŤªßyŠ}¤˜›ø±h†T!6ö#A‚ðœxå„ yж*Žœ=&Z—i‰¹Ÿ™JØ^Ëó0íc½ç8ñ¸$ù38ˆÎÊÑ÷¾šñ}ãæLR,d:Jí”û(ëA&¤ fÊòÈ&öQŽhƒ-Ò)2=¥¼õÿ2Ö³LÀÆ/î‡ÕºÝ;ï]ösX‡ûîÄ%Ž5S屉¥K“FÈ‚sP •)¨Â Ät’‡·•ÙB5^Ÿ¯Î·Q&*ŒY™7&&E^vá2ÏÀOìEûw#Èæ¸KHKU™X‡ì6D‰MØp«¤/ž˜ÄÅÚ•8A5¼cчVW ¦½‚¶&2©^sx‚` <²TÍî¡ö»‚Š|NŽ¢€âZêCwsîkÊ<1<ñ–T†ž˜$þDŠS%*D¾SYõÝð•¹6Ìáâ Þn>ƒX '™uŠ¬ƒ8‡ˆl"Ôw?½{¶Ú,½®¨ 8ÖȨ|­.¶fÊ竲xÅá “Á5÷ÜE€ÉOÀ÷ο`e‚aX0¦ë ÂL?Í4ü lå<6ô¼ ÚK]m&)üë_ƒ”N#O€ù•Úúr/§ sY »ˆ²<ýæ@ÚÏß-Ò×ÛÌ4¦a··˜€…¿®&¼äR˜’i7Œp‰Ã…´À$è]s_Õ­+´d†–FKý±j `KûaQ¯Îçë5?šG9‡BE9\+)2Pmó•8ÞÞ-†âx]à“ŽšõêO`åáHÏàò+Ê!~9Ÿ9´5ZyÅhBâCk®xn.%&°‘£g ɧ,%v âóÜ'ÂH7¡ê“23hÐ.Ù0(ëÃÑ #WÎRzï(¤Úe±xqìŸÒ½2¼ìGÙ÷„s.ÃÈ vÜkÁ ‰3ó!Âäק RJ¬]ž—R£|I1Kw—qåÜ9æÂ4ÁŒzÝœÖÕ“‰˜6˜‚%1¤>ŸGw@›×?ƒ±«jÄ Ï. G—¯ñ jYóô»Ï£ÌGL&6ÞÞ—u”IJ+*±mÃ⯡©äOëdÒúLØäg_§©­ÀÁ1G÷ä àRb‡€Þ"'òÄ +÷Ç‚ÂB¨°JÙé\ û)OŽé ÏŠi±¥©?Ü°5Çš<qyÞ „çp(éd¤ÃXv‰á|ôív5—-"]˜ç¯úƒrJvãa{÷ç¥f”5ôM××L‡Ù¥9„Ã*šN$eÈâ”Þc.UäcVZ+ —f§¶VfIé²ÄÝ z*ÛòàüdR$<í…À8öÆõÞ=Ëü#‡ö\ÙÒh_|Ib¼O/lΣQ‡AüË?—×h™›æ„8ëÈæ‹TV0{‘ÄQ®–oÀ± hŠË'4²+ÐÆ›8ý„‰[ÚðuL3ÇÞ58|iG×ñR¸­ò(+Ô !ÍE8dij$™–šŒâÀе @ÎÊ|íÖÀ‡Ø ­Wk/“µœc›Ä'QÅ2J;öá±~ië?/ÒWò‰1ÑÓVÒFn S¤‚.3®ƒÉµWøQ_–d$D¸¿üücÄ-äÇ°@´ Ò”ÿÀ‘7Ò!iÛ=¸œ¬(èÙwÙ,{,ÂJ\€Ý*v\ \ë„©CˆèF©È˜µBóçüÑj»QYåa’_7{è͈ŒÝ<ÐÈÓFCÜè¹Ù¼{ñŸ¢KABRkh© "ÐgZ¨éEìºl¬Âê!ü̬ —Ã%ÀÜ¡`|æ.Î:ˆ…`Ïî}¶Ä…8*˜›¦éÝj}푦Éùäe%×™a,¡ö•Gâ›4õðè%HA$Óíßþh%Ów‹ùÆ\m"¯=ü<µƒ‹È%Æ¿1l>ôÝå endstream endobj 591 0 obj << /Type /ObjStm /N 100 /First 880 /Length 2062 /Filter /FlateDecode >> stream xÚÍZm·þ®_Áé‡PgHFÐ:©ƒ-jܹ@[×Ty{¢Ó ’.µûëûÌî]­“tÖË:µ¿h¹Ü!9|攔ꂓ¢ŽbtxÄB.¦ä8Zwq¬xVu‰ïm{.“µÙ!<‹£ÊHjrDBŠ Š _˜1¥D4²G‰‚Ó@Ž„ltu¤‰ÐÃŽrV‡e©†ŒA`«&ih€; âbÀì`;’ý`±cA#¡¡$h0F+ÙNBA> [è:ì!æ*£¨øR8=%[£kWÉað£cì _ ±F:’öÇ,˜,3'Î#xl+ Öds£CsIuœ ´Ÿ Þ×V‹5°… ¸€=€Y2£dRÄ*†mŠ0L4˜jÈȶÂh¤„ýspɶ¬À?el[óTL¯„ÌÎxª@˜Ù códr7as°Vg*‚O E Âp“5ƒÑnQÐh7!æÉ&@lIJ £N‘jĶc2M²†‰Œ1Ø€¸Àa²F©ñ±`§{µÔ”ÀxÒd g•È#†š*–G7>™ö Ûi6aa€±ï ®63^2t²ËÐÌS\f(cTf[ÒÍ\ddJŸ/F*6½ËØzÄåܱâUT…ác:Q"ۨ⠄ŠOf ÑPM0.¡Ñ³g£ñ«÷ËÆ_NnšÑø»v±i›ugWÁ]ÆWͺ½[M›ug~]×›·³Éóö{m4° o*WùRߌ0Ó SvéÉ·X´˜ñugÖèqoFß~»µr÷}4~Þ®Þ6«~ÎðÆžnÜkXŒ/PT’àMúI¢Ïæ”<—ºë»lºyþ0[üŒÙܳgn|íƾú±ÿùêv2›oÚoÚe³XOÛå×o›_šy»¼—¿½iÛ›ys³jï–k?moãÀÛ={ß»×Òù£+7þË_ÿ1¹¬›t‹»ùüÍGÈ"W_!¦Gt/€mÇÜ È¬ôô/Ì¥¤û6¶—»&Œ_®Úéu šï_¸ñ«æÝf¹=™å=™U*³ž%ó±ý“ïŸåþ™>"ÓG²yJÄðº>v‘}€‰Á™ù?–Cö•tÿ“éí«Öð¯Úõü§›fѬfÓŸ6Û2»`y`QÍ8 i”ͳ1–5S%ppùïÚ[Óž¿‡~ÿà¯gíb±’‡«6·}G,ð{ð>Éôý ‚B_C¡³yÓ=ÛÕí¤cìzÙLgÿœM'›ÁÌes‡Áçˆ0 ¡Äh‰¼ògæ‹Rí™hNÓ‡lN:yøðƒÌ]oV³ÅÍÚ8ù¡W ]“¯z’ÉïI†¶êQ²–C­—ztgh(Ý¿ É â24Ä]—aÉÍ0—Q{ghp k@ºá-z!ñkFÃK¬åûrÕÌg·³Ådõ¾7ÏÉírÞ Öÿ˜aŸjq¨W¹X¢ç|) P Ë7OP³]2A„¯8S)Í–2}ýÑ}ýIçè†>hmoYNCf‡,°Or”Œ)ôÅ í …Kü`€V`ôX‡`å.ûŠÈ¶Š˜Ö“'ˆUˆGPûŸ·oß?á]/‹A9ÈÙ$ã)¨G¾€ô¯ø,g3`ú@§ÙÝY¢‚ìà”ŒîƒJœbƒ«ì« ´»V!ó˜,qôEõ‹ñHTö‘Ñ¡ÈäÓyL†Ò±â‹&Ò>0u 01œÌ¨2ÑcK1íãP`ø4`Ž“æÓ*FÞßÿYe£Æº·=mÿ‘I)(BòQºˆdIÏ„Ù&ÑCréaÊGúŽe漟7qºó­°Ï½•ÙùZÿ¼Ïù/Ýíp­œ—S*¾æ„„œ½=&`Žœpò¤Ÿ¹*L™½p¡œöéóCÕ*4úì•tfÅNJ™qȲÔÏ ™BnH¯¢fxfùPh傺ëðÌU3ïV^¯­$yQARg«"»Ä3åôk®Z“vÈt²ØI}B>›PgöŸù©ªn:Û=è1§Ã§•+—‘Ù¹K€?:F'F‡DùÃuá£tE|‰zžë$;òæ|À_ªñ—O°Ò~ÀNq`ÀJ§ì2œtàØg—NªúŽÏg†B9¾nõvAsqûXTij/–Ï~ žt`pK44h±@ˆ}Z#ÜŒ.ÚÅõ‡ÃóÉšh×àÓiÕÀedŒÊ–å6;t±Vo—MgYèv>óTnm·s:LþÂ{ò*ÿžW»@럃ï¸æâ2ÙÁ¿:A‰3\;ø—'"²ŸÉ¼‹ÄÍds·jF"NæàÅÝZÞG^BwL‡Ó‚ëÍdÞÇAcÄÞWwÓOŒ‰ÔÛM6¸ ÊYT-ƒ1õ•x’5ì’…èYõ(=’ãóÅl‰Ž§C"`åüy¥ÃvÄÛ²®m«ûÖ¥ûu¼ÔÖ%ÖÕóiwÈý{¾ÞŸ(*Ÿ}ƒË!yFt‘û´¼Z„Báîý¤Üm6ËoÆãU³l}»òÓÿŒÿ=~¸Îõ7³§oŸHwKê®gÙ.³ôC…ÀdïçpÔ_½Þ¼Ÿ77w³·ï{¦-šÓöv¼þe1†M,~O—ËžâÝíüL~;wª!dÇÕNbíï(è äÕîâìÌÞ Q»ÌµÊ‚rü_÷ºþß‹ò&Ûgàá¶\/òøÿtñkNÅ´­‹üÄn1 <£Ä‹–7O¦?’û/`-Æ endstream endobj 675 0 obj << /Length 3013 /Filter /FlateDecode >> stream xÚµZmÛ¸þž_áC¿h‹3#¾è-- ¤¹\›¢í’í‡"=,›¶…Ø’+ÉÍåßw†3”%-m'XQÔp8äpžy¡å"†?¹ÈÔ"˵Èu¶XžÅ®·Ý.¨ñö/Ï$Ó-p9¢üóý³ç?&ÉBÆ¢ˆ ¹¸ßŒYݯï£W»òØÛön©µŽÌ‹»¥1IôÓñn©²ÈÖïVÍ?™èïÕ‡¶l?c¿122ÉÝ/÷{öú~˜;Q‰HŒþBA=õ-i3QÈ„NEœ’X‹»ešÆÑ«Ö–½’8êwÜ°¿ö¶îª¦¦×õŒÊ¾¤—®oO«þÔZ\e¬£ª§þª£g ÄÀFF+Ûu´VS벿1É0ê¬iÐxä“—+dX}Ø[ܳ…LDš'‹¥ÔB&’ÖÔïÚæ´Ý‘šzÿÙ·,í>飩ê;x€º„ã´X¥Bê‚X¿=“aB茅×y”ÑãCÙñ—Í©^õ°˜Ž>lšv6bX.p6RE/Ÿ‰j¼@{¸ƒ9O]OoǶÁ÷ÿUg)*ž¦³LÓlæb\Ú¤ÿÄI\—‡ªÞ¦H­`Rä~çŽ*6{'~+G·‰rØNi¢jC=neØ ¯(Ò÷em×LÛÐsШ#d=l[83¹3¢Ü.*æõÐr‹BM¯í¦<í{zÄê`ÉòŽ}þcjƆ‘‹Â°âß™e’Ž)¥)ULTM·Ø4ÍCµ>ŽL>µ¸\`+>oygíÜÖ¨G¦Å"MŒÐJ;[ |ƒ±ðO*gôÓž±õûñ˃€õϧq"½³+V3–PB’‰¼ÿVT¡ oùž­¦ÜZ¦‹çKЙIa&K¸ Wžú†Às¦~eH…`Ñ°;¦˜šïש±;¶U݇ôˆ°*sO¿+;Ú:°7›f¿wÆù‰ì ¾µöM}Ÿùè¾I²Lëñá[íJ@ õè÷ô@yÑj<8U¢( /րȡy bX1/äEÞ¹ÈTöÞGÚ™ÛB»¹T©©L§ºzöš^¬š¶µíYS¯;êE@pOÜrl[ÛÓöú÷ŠQ 5€=#(ÆW„ÆÔC OÄ-ò9ØÖɃ.˜¬[R‹¤P"GúµK£—£áÓ?bf¬2sƪ°™Gï­Ý™«Š½¹ÂçÇæªÒ [:YÀesõÔ7ž3=›«“÷SÕïHÆô,ZW`ŸÚ¶¶^Yÿ Ãü6MŸ¾¤ŸÊ= i-œ„¥÷à<:ºŽ½YéÎkýÔV=86æ†>–ô 'a°e<pÜN-92ŒœöôpàxÑ][×ÛrMŒñbgé™J³·"fŒOß‚e-Î{É%ý&Hf ¡Š ]Â¥°ù Ør‰±‰ÅÓøºíB5°—Á—Âe0“…y^<3]Ä#0ËÌ°×µ‚c`ÎNû ½þóezwrÆô]ØEÐ…}Û= :#\@0“’SM´bïÅ0?~9b…ù43ùÇ4™¯†$‘çØ|ß¿¥½A\3‰f\3:áZ yPº…3®oÂ/GÔ!T›²šQƒ ãTƒ]SP£Ojøˆ k–:*jHè@m\HTQ<¿,b¡‹IüëÌŒSF›¶9P«¤‡G2lãiå<Q`4àX¶åÁBbD Å®ÈðÅ%grd yÝ»<?®×°„n:¢÷_Y¦qï“7´Tñ‚°åОDzë,÷9ÜJ KÝ'–˜¿Ö³¡'®5'Ð㧙æ‚<êp°ë h]ªƒü6ëOä¡ …ØŸSïUÊjÕ§ ¸¨ß ñ0M³º½^ÊBT,ò"‹U˜'d!<~9b²§Ù4á,Äpòr¿@£Ü{UáËááˆmÙiX³Vr²š+ Sß}ÎôFB’Ç"ËÒoH+7­µAˆ™ê[úŒ R-ŒI…ŽŸ O¿1âãtš°>ŸUZ<¤Îäfê¼–\抶}´’kºT¬Ë«rÏ™ÞJ.‹³.Ÿfž«=ÖŸnd7Jààiž^"1¸R"ðTae¦¬ÌW°¢‹%ùH‹i"L¦&K¸¢E¦¾!ðœé -b¾ 9íÓ-Òþ]ô·*Q«oQâ™Á5%2UX‰+ñþ.7‘í.Øb@‹Zk¼†kZ$êÏ™N´ˆ@ J.²©ñ% ³“\¬VË)͹€_>cðӜ襶®F•íïÜlH€‘F¢9MõOʇˆÙÞrYñÄìVÀ")ž«'RœÓÈ•›Í¤l«¦CÌp>ƒ?V­«ñ ’×H‡ªˆÇKÐ?. ë«ûrw[cÔˆo%βžRÔ sÆ2¬K_ñ£U˜Qe‡P¸9ÔaÏ„‰Äê°KÐZaÌ4 òåØ\G ¨Äèè ¾4å¢5¶V®hŽ­³JÒ ¶‰{ÁUP£³=3yW¨ ½[[ÛÖÝY8â:dÅ*KEfäØŒ«¶lS®ìC¸ÒW@sð­®|?’ßœJ…Íîåºì õC™LšŠtØâEA©ÂÀ‘ íT‡ž’ì›ÜÛÓ“Î446'˜ˆsÃd%ZÄSÌê@I­ÝV½·Ã!B€:£ä¬î”ð XöiW­PÒ‰àtϵuò7O+Ž§$Ÿ4îFË{¡Jgç£ôæÇf5¾;Ðz8ŠNQlYlPeíËú•C­àNJäYñh'‚O2¡À…0-ß)Ï0@´!%ÆCUw`ýã…Ù§ÊbhM¬‹hyPL×7Øp‰>|9_`¨øQ ºÎ·jtÖ]¶GÔ8Ûpæ­ž0Ì«ÙŸz†–Œ->‹º3Dlº«½áSê±»¸LÛû#‚¢ ÐѶ®Œi¡VÎú º²*2gýå\Å {6x°©cÅÏÆÕ[9±ŸK¤_2á•D_®lµHÜ%èD±r~ Zè3âM WG;Hál¶?)´À¦ªWûÓÚ>‡Ó÷ü¬¢çFˆ]Øð´HÒa8m6Ö!›–%éwt§ÊÕº¸ ªŠ‚ÏîxSN«±OŽe´n¾Ôä:úºÉ_€J§Çú;€Æó§r@!R*êsnÐ|o‚¬sL“l Ën©Fæ"Ïõüú×z×<‰ ¨þj×k»+ÀŠÆË5lA³'ÄÆšÓÒÓaZ§ÁoÎoL¨Gæú|¦ƒJ] ­Þ4DàwÛ(81Cã Î}õš· ûƲHã·tݬž7G0F $!5Ù,ñ”`Áz¦iÕ85¼rð°òœ¶¥^w cH!Ê -‡VÍDm“A€&ÏÒ‡uS]ˆÆ -`ê"ùŠnðr4:ÕN&x„CÈ;\¶¾rë$Eº¯ýi¡˜\1¹‰ôã˜<Nrº˜+19Sß~Îtиw*‘“8Öÿ–äÍÔÕ)_¹ÆÆ·b¼Gq7x*/ì»:%Ó;Ìš ¥¬/ŽÂˆ¬ƒwÙý… ñW¦KHåpÈöÕŒ$öåûŸþõöÕëwÁëБHr9µÂ —›_<ö½SÌpñåG»©öV”‡ $Æ°ñ…9#¢î÷ÞQ„§É…Ñf]vF‰øµíZÎIÁåÕÀ®ÅzØñºÁÇ<?nÙ!>üõõË^¿ ïžÊs‘¥úqàŒ?j)×ëÉi²ù]1U#Âé<àÅ€+¿cQȶþòÐ î9¦ù:?{ø³8!€- «ÕópÀìN ˜ü§gtSxýWJÎIM®ó8ÀÖ›}¡ó?¡Kc÷ë‹`ê´µýǨœ^´Ÿ¯%X%Ìåàù½ãå%i@}3…ŸÞÿ3HÌ 8HçþjûèèçÖ‡þ’è:€‘½¥6ºŒ_±NŸÇ²÷9 ‘ÌÑ–úñ˜»çŽyCxº’A¦›3Õ%'ւḠ“šîãLq‡’gƒ§ÿA¡lœ^ÁYgꪟRŒØtÃï!e¨iÝ»ÿÇ=ò endstream endobj 681 0 obj << /Length 53 /Filter /FlateDecode >> stream xÚ3T0BCs#s c= cs…ä\.°hQº„äÎeUgbj¬gjb dcUWN" endstream endobj 685 0 obj << /Length 1070 /Filter /FlateDecode >> stream xÚ­VKo7¾ûWèV.à]‘Ü·oŽ§r“Ö°Täø@íR‘}»Wí¡½3ÊvP¡h€@€8ü8ÎÌ73’XpøˆE.yGEœ/ªöŒ;Ô>.H¸w&¼^Šá+Í7›³åMš.J^ŠÅf÷ÚÔ¦^|bW{5LÚaÇ,½Â$IÙ½Þi«»J€ó"MY’›Û³·›ç·R™FiÿOÇŽÚÿò.ïòHŠ49z'³ˆã½Kƒ0Íâ×þ€Ë›,yR•IºeñÒßûÌENªßF/d”ÂIëÓ5òX=¡ŒSváš1§~nÎaßEÂüÉ ÊZÍ“5Ú–ÉVí`û@ì«éÉP­&EšÖ‚Uª1êHaû,g¬By_s÷Lx³WW? IÚ«O£NM¦ïTƒA¡ˆ#‘ Ocßù“}‡kx;˜æÈ/h“+´sNÐû_¯Ö¤*3)=8¨GG=ˆ±ä°¦ç¤ó3 ì¨Ð¥'^Ö4¤-9£S…>ó¡È"ñÝ$ Å)wá X <‚5˜³2e¿ .Ûº[Wý€•œì’ô×þ¨2ðhR¹DÒ‰êj/à"Ø{³µÊ‚Õíw½¥ókÇ*Joÿ ÒT÷¨ 1ÞØ] sÖ7‡ðŠ(Ž½®­jŽ< +G/Øpæ|ì›ãI5½Õ™Š.'Ð  ¼c'OÀª(kÆp=×dð÷Î|ETÛñXz`ÌÓ{ƒ²UP,¸;í‹€ ñ£ tÏiUJl´${i©$?ÑR)[÷­¦S /d•ÑÔt{ì›7Òvêýº×$(¼Óy#eO×sCí ЯÛF·Øß–ºõ†W.ý« ÚµHåÜLP æµiu7R? lÀŸèX§qëªÕ>ïû­ž>Õ4ÚvgûG«Ú|vnLŠÏ<å|‰‹¸(ÿJ$÷'׺ÒÎÙ­« hõãA”¥üÑ´¾³†'Øzœ}ˆhLo±Kàñržú2PÑÙàC4úÂGs€«›”PӃץŒ´s=ˆBm`|™í<隀V·½=œ GYbÞLºšf«±§²4f?«­a|ô€Kè2${ F£0Ò”Ô$ª‚ø;H9̇ õc¶sŽ†õ|üAAb´_h?ã\AŠÁMwœs¾;sêÎgó'x£ÒG5Ÿû“'žÈ´xMNVF<GröÓ4\,—OOO‘évý8wÑ®5ÑÜ™p ÀœÉ¨Ö˪YBê±Þ/OI!¢\dT$qù]UòÑ4eŒÓ;–캇¡Câ/­p\k?ï. jÜ>ІÆ/uïÅÁÏÉ$öeªºÜ·ŽÝÿœ¢ÒOѧ(y?r'(Xݯ֗~NÞë®Ó£§Â®—)š`“ÑþMú\ãz— endstream endobj 690 0 obj << /Length 53 /Filter /FlateDecode >> stream xÚ3T0BCs#s c= cs…ä\.°hQº„äÎeUgbj¬gjb dcUWN" endstream endobj 707 0 obj << /Length1 1908 /Length2 11745 /Length3 0 /Length 12912 /Filter /FlateDecode >> stream xÚ¶P›ë¨ (®Å¡w/î.ÅÝ-’àÅ¥Xqw‡B¡x¡Å¡¸»w/.½l9{÷œÿŸ¹w2“|ÏÒw­w­oBC¡ªÁ"n5É@!.,¬ìI% v;;+;;' &ØÅô·…Fää †B~3t™¹<ˤÌ\ží” €‚«€ƒ ÀÁ#ÀÁ+ÀÎàdgçÿ!ÔI eæ¶(± 3 $ÔÁÓ leíòœæ?z €ƒŸŸ—ùOw€¸=È 4ƒ”Ì\¬AöÏfv ( rñü¯ôBÖ..llîîî¬föάP'+f€;ØÅ r9¹, P6³ýU+ @Óìü—\jéânæ< ìÀ@ÄùÙÃbr<'hÈ+T@¿Œÿ2`üÝ+Ç?áþöþ#ò§³µw0ƒx‚!VK° "£Èêâá 0ƒXüahfç }ö7s3Û™™?üyr3€Œ¸Àì¹À¿Ës:\œYÁv”ÈöG˜ç.KC,$¡öö ˆ‹3Êç“;€Ïm÷dûëfm!Pwˆ÷ß` †XXþQ„…«›ìè ’—úÛäY„ò¯Ì äàfggçåဠ 5Ûá5=@*ÿ?WàëíuX>ò[‚žP¼ÍÜ@'W¯÷ïŠÿ&€è0Y!(ÿFƒ,ÿâçËw{ ØŸgÀþÇçŸ'£çñ²€Bì<ÿ5ÿó~Ù´UÔäÔ˜þªø„ÔàÍÂà `áäfp°?§ç}~ðýï0ÿ4à?Åÿ)U5ÿ}¸ß"ÊC,¡þ¿jxnÞêpû{,èÿ^ÀgP†>Ï2@ÿïè²s³Ÿ¿8þŸàO—ÿ¿¹ÿ#Êÿmôÿ÷@2®vvªéÿÔÿÔfö`;Ï¿ žGÙÕåy-” ÏËù_SÐ_«,µ³ø_¼‹ÙórˆC¬ìþi"ØYì²P»­ÿš ÿÜÁsp;0¤ uÿñª°p°³ÿîyÝ€¶Ï¯çç›úSzÞ¦ÿN) B-þX;Nn€™““™'ÊóÅ?7À›ãy?-@6€uyv<ç °„:¡üqŸ<Ü6ñ?D/€Mò_â°IýC¼ì6™‰ À&ÿ/=[*ÿKü6•ˆïÙOõ_zöÓø—ÞØ4ÿ!þçìfÿÒsLóé9&ðú£Sl¿!€ ôrØ,ÃçœV¿ásRëßð¹àßð9­Ýoøœ×þ_|^66Èoøœú>çuøß<Û:<¿p!v K—¥KÿZ‹Ä<Ïâçe€þ[×sjGWèó$þ—%Çóù~Ãçó;ÿ†Ï~7~î©ëoø\ÛoøœÂý_ä|>±ÇŸø_3tuz>¯ËŸï€çüÿùž<@@”ù(P0ØæspëMµ8‰;ËÖˆð$Í–N*‹÷¼ÓW×;Œ—I Ÿ2W®Ä“ú;±–6¤é/ÅȽšë^†}IPk¹÷y0‰SßjA™Ãï-<¯í!C&eÑÛöytôÑ°}Ñ Û¦@“ëèʇ¡š{ãÞ-ëQÛS¾8:³¥¶ý‰ç-êCùK´V”a@ÉMžyÖ4!%¢ #ΩæÔåÕ$NÎè/r…8&ßÃh®"oýœ1·Ó^Ë59Û‰¨‰ô É^\â ÓzKì&+Ìz—G­ ÏfóFÄ~_~«MDé§Jè\Æ"œá¯Ø†KÝžãÌp²ÓŽ*héÈk‘¼ChJe-ª¨úKM²HÁïn©È4âua-˜¾v¼n?<Öjcbü•Ó¸@k ÅJšÒ×ôï*ZÊζ¼[&¾ç{œ‡¥‚wÈÁU‘²1%ïmäDúQVý«Ù”ߣxê†n¨æ!(SÑõøë#§Oh&š™ ìŽÝ ‰f.:2ø­k!¦Çï V‹^Ÿùñ ÍŽCB›°ùo—Ë´›Ž“9x4«ª£ÙŠìpô×íµ¾‡ýøÖäF„ñ¸œWÏ^TPe•5V¿lñÙý€‚tiЖ>ó']Uý™Úx9ì<7ö2•ÓÌ]-PÉýè2ÚéìéO „(ÈÛ±E&tÊ/;AšFûA+Ƀ³Ö>úaÆë3´14ÑjXž8{ú1öÇJÑ€ÒF=4÷þ›W‡›ú÷UºrN÷$Dâ AŽaâÙ-*D¥×‹19/ãò~¨47¢üÌ/@N9™ÂÒæU¼Ñòi°Æˈ ÝHjÈ íšñŠrt`„„:ŽJ»Ô}H”"T(zwsÎdUj­W½­3U-/œ#Îé±G«6¹mƇe/m-EýOɉyb®AS=#ñæL5ï¶.ó;v¤Ý2DM›¦»/`ÔˆÅîDj¾C8,k?áÝ™<Ï»ƒV®äBE©—÷“ë1ý›W£‰[èe e ®Ýß}mì5LÄ`E†¨"Ò~}þÉVH“ã:6Ó`›Ö6y_z¡`ø1»‹16-ÿ+I/r‡‘Ë)Í ¶”™)ÒïTQ÷ªU*ùožŠ¸Òº3]ù°0S¶ËÞía³ÃyetoõÖ îq#ÂÃý¿ØK-ìs*05¼žSws&ß•=˜ÁNeˆš¤¶”ÎÛ:Çrä3¬9ðï}GÇ>lü(„H@ Jus73áFŸ>ùúJ•,šïŒ<£x?] uaøȺµYŸgŒ0ÆžyeÜÚ$Ãçê‚œ?”ã1 Žø}‡(ÝOËZ¥ª ¼®±q}ʯ­ˆ·£Ù‹}Ìr\­ï1Ô«‡x|Âì¾6VHÂeYH7LÓR ¬Š9¾#uتIu¥îÚeˆ]C²ìPƒ= † \¸-I2ßJ…–Ä=„]ÌQ¢ûßÁl×>§“˜s±Ô”—«:ïOm]×½eù«àãÇâ#ˆ$–SE:e8|>#¡7zµwG¨:˜ÐI½|<Ýêwúik†…e,Ë´ƒìQU¥ƒ­M|» ²’`¾À!¦p¬ˆ¦–žx†Å#å]‚,³¹[]Ó¿Fsë¸<³´• ˆG~fx„©s,^ŒÇ%*Š¨×â}ÁÓNÝÐã#`6~f“l"z}$!bs?qÆ›ŠÐiéÍa–*Ls¶m8³øÃGK£õé !‚—ç(:‡±œ0Ñz«õM Á†\ÊTÙ Sjõ"Oö5RûÒ=õªFÚ¡-ï¬ABÆËÏÇ ¡Ž¥¯5¾æoËœÝ^4¥Œ#ò#°Ì.6Ú_'Ó¬Ëg³áB½¾{§\úå¼–lmÿ¸ßtãðÆ4†û-ÂVp?å N–SÝj䤆Ž;ÐP/TËΞЛODum÷«‰«“P½eë6gŒ¥Àc3a³¢U²=ˆ«?<³Ó%!ù3žšqva}ˆJÈKL_‡Å×ÕQÛnrŒYo¨&¨mýt˜bnÒ8®Jý‡d=óÏ5 F'î=Þ»»kV¤Œ9¥rbquIæÔ¿lI>{—šø_N!aMq»ypòüܱ¢3_xךÚýAóŠbX~)©ÕKBQ{$.| ÀhigÜw\u2Ó¸/„#ª-7?²)êº «Œýu”z™9ù“í-BЗ¯ˆh¡Ý©za3ïTÚãù†Nð¡æÊøÎœ]öu¸ï ‚úiAK÷ðgì›åŸÜëiìw¯òߌú¹u¤È“ í]A¨ìE:ëT“M_>«ã‡Ê[*êF_|éko@ÃPZ…OIja‰n=+)–‚Wµ3Öfáy×Ù²Û„EŒ×ìä›Z*¢5ºáz§].(Ø£z8ãE“Z|-à\y¯QM0βÇêð§‰w¥óS€ I·Ç¥&4‚° Ë|¦êo9 ™úš«¼’Àù"7²‘ÍY%É-߶rŽ{ƒ~¬Ë“ß÷Òð3&^óÊ)[(íy]YQúKì`cÇc¹¤õ]Ê[«Åø|±ü´¶•`v>­9r¯áö™Ê¢’z–„])ž8-Âð{Bþ±…ÀÊ–o}×ßG8ˆ ÕÃÌ9=º¬#¢ç„á4•±’ô–G¤2‚þøGù06;¯ïM¼ÔÁcüúA66Ï häU?Ã%ÎÂ>Ω¥Ÿ¦°öÝw¿Nd7p—={¹–Yñ ƒÃX†8¦‚)`Ç}Œ ?‘2×Y¿šªè¼¶Ó 7^Ížÿ0Ûl'ß'›½x[MDeCW\¨¥Ú…WxÝça|Í!i a¥ºæÑrw8Ø—6•&5ñü¦ hŒ^ÛTõ–tË£õ{rIÁ9°°.oŒÒ–>ÄFñk™w„„ùÎyý“±ûm].m<_Ž¡šÏ5¢ÛÃœRÈVàß ,ˉ¸§f/ÈÆ{L(ÅÕy.™ð Kå‚i9 £'_6Eo…Z àz¯¿¯ÓÓS¥qEû%P&[ˆw˜ÜÒN$,ÿ‹™ðžx?L›b&â\Vñu€[‹­I<<#zÕn/ò˜ˆ®;_ß—þ<2 P 9œ…²eôÓ©$OÒ$ Â5!ô EÅjÁO$2ú£´ú^R±o Ò|tÁ‹Óy’W±Rît².¢›™¡o cŽ¸âi> dS¡†àócÛ•¨—[}ÖYD×âÒ÷{RÕÝKü‘”GsÈ¥GýTØÆFV)j{ÕJBÓ½µr½?_s×*{ˆT˜ ¦#€`ZV»(~‹ŒÊÄŒ‹'ÿ£§‚‹¥Ôè|•M!£5×n:д^ÐÔ2[¶hrÒ­¡L–JK@¨ÂßÁDO׿Ö".)y瘮ŠgáßRï†üÖ¬°'áäöSìfO/¯g;7v”¼à¤Jàz9ìxÒFD͸ÎwD[š<üü¥6/°Ò0Ù‘]èÃaîpÏ38?(¿>äö‰±š tO4U:ºNÒtÐÂ\Ó¿X°°£Ûç€5P¬˜jvýyx¼q‚*~(’„h‚ëtÁ³êœR$ø½0žÛÇYº2øÒ~±¦©/è$•OÞ6Ã!<Ȉwðùxñe1@‡oAü„ ™êUÛL#Í 1ÙðÃ÷;©ï‰fŒîñZeÉ!ºèÄïš·B‰\hÕ¼qZ£éê/¯’ך¶e5?­¢™…m•ŸrxDаȪþåõÝî¡ÚÏÇ(L¯û{I ÐõÞNåY¿CHñõ±äNr 챑ˆÉËËÄø²2™ ˜å Ûû¦á!œ bÜ$ªÎ¹Æ"LŒtR‹,•Ûn ;µ¥Ä ²_œ·ŽãND?zoœ_Tl­ÕoÁoÖ·†®sÖQÁ£dÔ*;I- ´mdIíp¢N–:ªâk9"5ó3ˆP}ºžZyu™Þy‰w–¶´>jÎN¸WÚ¯ÇéŽDF¬gZ <’PÇh‡^£ %Ü~ÇE´{M>¨¼Z—O¹üB-I¯«]f•mýIŒá1 !Ô™b>ä婺H‚sz@Ù5û$:BHŠï$Õ%‹XŒ2Ë»¶yâ×k×hvEW-v·Š A^â¡û BÞÅ(û™g×Wœ——f…ƒž‚œˆYï£Y¾úGœ'Ýû!r|< kÜqos?äW:6ØhH§«¡äJe¸Ð™g“øEG ˵œ,:¿Øz\Ë'¸jZßk*’ç;]0ÖRÔûšØwëÚ1›ù“Þq“SBK3êÖe™ÏyìÜ7ïn'•fN¼­MJND;ôà)” 2Pê'CWWÇ•ªÝ‘ÌÊK—#œÙ¶DW{¾Ò$»ò¯¼QÅü¹êþ/DëKšÜQ’„Ð_Õ†Nòt ¬ <•“&˜Yh Ýy-ek¾Ðhuïñº¹µ»÷Ÿ¦UÅþ±-IÝ4ŒClnC{˜¥(}a×½Ì~Œw¬nU#›®ctÍÔfÎòI?äFRœø ¡O-™éEuIÙlÇNË5_n$6AÎf¿.ßPˆ4.}WġÅþbvÊ„+£™kü´ü* øD¢]­ ÑÁp•Ñ-çöÅ;;æ_†î¡4N0G&Û:ìmNñ3×…dé¦ý ”|Ž¯h˜‘Qó·ÿ–ƒ¶ô;óÎöquêçⱌ ž!ÆîZ#øÅh©*ØÕS{ï#“–nm¼Û}ȯÕ0Š‘óï®p†¯ ;6ÏA°ñ2’óÃ5‡*ãºUðnQÈ™>wä`ÑpexuV‚Ìl {´ƒQÁ¾A©þܪí¥h˜$†©è×C"äAõ8Ö “`kLYU7¦ÎÌ•ÍI­óp¬¬’®±˜õjY§FÄT2"¬6Bŧ6ó«)Y:£¶Ø1_b´f,!mÁ”¨«;ÎŽÌÎ~ –Ö^*á"«Œ ý†ùq>q¦ºjeªîâ«3úó~%¾Ëqj‚Wd×/ ¿p‚‡?‹ˆ¾¯ D•0½Úµ·ÙlñNI’¾ó)ÄÝ–4Fýh‚T¬¢ßm (þeÄ-Ab­^L_8¬`w’w··Å¥ý¾ Aðþ»•ŒÀ€¶ªÃWm”‰!ºÃÛs¹—ù¯‡ŸÐüÑF×?„~$~Éàí¥Õ&d‹-eZÊ°ˆmMp§#­ÿy…Á˜'Á¤ ^ ùfZGŒ“Îþ-§é|%lo¦ó´Ñ(}pç;d8ë}\œÅœœš›ß"º”ßÅW3õ([ Ý|Ob!nf2Êäe‰Ÿ]§óó)e¢/*X)k$î毡J9+Í®DÆß?ËI³d!wÖÂß³‰Û6ðù0aT›SU"e4·Q4¼Ì §\½xA™Â5š2ÁùªÖª‹èχ¢È∹®Û»Q™%<¡šˆéwY?aø¢>_Œë»”p.Ñ«|ŒÒóí;¼«5tméEÖ_sïú…² ˜Ì¶Û‰e¼œ[C \Óz‚“|àèØO.™`[˜OYtïÇ,Aä¬Î‹»ÆâŽ\Ò}ÎsGÛ ¡Ñ ´˜q/a÷HžŽó¨ðF<|Þ¹yÃä^(­×†} ‹(–5•£IÌ©` è‹²BŸ¯Ú OŽ¹YÚ€##F¯¨á•9Vò ewˆ{Ôß!)O_8¢@xõAQñ„Šœž, eùk…îVN¶Ó#`¼Ï|ëîI„´©YC¸O»_b…20èæ•kâènå–JWçª^@|×Ú…V&EdÜ^5-2ÔõÂQͼ¨ùŠcY®ÍgâhfÝ:X´Ì>ÎùÚa“Ò6±EHƒ†—¾^ü;)œÛ×.A®'Ï¡1ÎdÈ»>D]ùu¼"‚AÔ6£ÃåÌJápóyÀrw ê…-‘¼ ÃäA4Z›ÑLÆå¯`Þýü¿|s”_D%šzÔï}Þ#?ˆ¨ØúLê#$zš.?6Æ÷…ú—'éóÁz–ãÑ+þb¬€ë¸­æ0ì;¥ÞÏ^ÄzÔ—Á ="0ئW;øžö -‡¤¼ÜøzÈ<·$Etµ úù¹\RëKÉ„äí^HO»;s?¿…aØTüì§1/6§‚‰x-Ål ZgQÅNŸbhN³§nôîMëlÎ-Ä—Z†i{…)Ýcéø¼ ÚM'ú%ê õËãªÅÓr?„l¶jµæ"f†}€wSR"­N_¡Î3ÐÐZT ëàˆõÌ&i/Å]Å=ÁÜÇ|¬Ä\ní€y¬Æªü„Nv]äæ?9è½¥ÊDN 0,Ëi{àŸˆ%ŒfyócsYåziâ¡HüU.©Å(Õ .7v‰|ú¡Œ%-Õxˆ¨eVš€è½€“Q\;çU%3â…´ßë¥÷)“¨x€°ëu·µÏN´ ´%ùXÇ7±!h!ÄãßåÖŽ>)ȸè5íõy¶Ì;M¨¦DOòyðÝ5oT2¿ÂÅÊóbùš~nß“JꫛĎëŒp#nÕzú†rx±¤æìã„™ù¶‘ï×Åã=\÷WŸ‰Ž÷×)³_ƒÇГÈoƒð¿Ô; àõàRA2°jѼ¥²CXSÇ/2WYòR ?,“êƳé*l¾JïIw2š|>™ a¹?AXªv´*[“u;mÖDU[8âGÞ…¦>ì(0ò_JGÅ0„Í<ÿuÅ#‰,÷zÏÈS;¹‰é]ÏW멅 Ù1ß³ÞÚ†7”ßYú¾›H€%ol°})<½®RL«3,‚ø]2ê½°È›Á^D WtYðîŒé£3ÇúH8 8Ëx¡&úŸ)¿›Ÿ7Î|ü&Bð¬¶PÃûU×Ûn¿Ú©QŸ±]®­˜à1T$*«¹«<°;²ºu8[X5~ÉÞö®C¯ùN}±lÉCõÁâc´ó`šíô ‹jë(2ÃöšfÅõQ87¶?ý$øÍ}&-ð}¹2yŽrÙGjbwÍW¨–Ç~Þhk›<­¸êÝ·I3¡_$œE§¦Áu¥ …m¯—3F Y–?|1  –S÷¸pPÄj½~sª©¸ž“þ¹x«ÏgÊàŸ¬õÑùY”ï&y4Sy6ÅN º!p¡†¡8o‘–EuÙóí¢U`JŸ©ÄùÄÙ/ ×%ª¢ziE¥ç^áÂNLT6Ã=`×URN.H·T Žv G¶Gw5~ëÇ¬æ± ¬#‰¡ýþ&•¤óÎ/ÂÍ?Znžqº ]OØ%ù'âde”+-ëUßžråüñ'+‹œHߤÊ[ùâsÕ0ëzÜ8â¥@¾P±GÏxr…˜_ó·t áa¾HF²‰ÑK ¾t|¯÷­šJäAïÓ÷Ã<{¾à®5c\ŠJæâŒeþ”tïòéZ©ß—o Äp…»`ÖΡULÍí$X¦vs¥¡_•×@@°?dŒÉÓÉ2¸ËçZËËÖD¤5Ÿ˜V<0fÖÖÆ°I¢ÒÎm]¯1$h(špËÕ‚é»6„\ôœžÚÁã‘1ôËá1eû"Û·›j¤VSOó É4J1"‹ Û±²¼©‘§rÅj‘7Ç%’íN€Ò=àÕR*M$ŒþuH;"ðTyP£3èÁ!Fn¢Dø×9ª…}¸ áSíZá]‰{Pœí¢Ñ-KPÏ'÷5“ì ä'ÙaÎ-cŽ=uoå°¡\@x)’8ï›Òwžº%0;.X%Ö ö”ßøè+,ˆ”–¼žÔ¶x11NŠ’&ùÍh"à’tŸÈÜx(Lù‰ã*„ðz<ž$÷1!‰‡8ÚÉÞщa^.'ªm˯^þn|¶væöwYXÖÓb«{/o¡hCÚ†1= ¡ãT™½€6ßååv'ò㠾ܴXÄcv]â'± b01ù-\ZM›#e/bÀ®áiÙP «FÔb2`5¾Ž·/2ÕƒJé@_Ý• —ËPu•Ö‘8Šåd‡d:·´Å77žW&0È‹L½0ßooOŒ /·\»lk±_Ë…7Jr ÑCÐI#„i‘÷aÔž™»æÀ>9³VÑÁ¬\ ¸ÄKÕ+OæçsŒãA°çCÀ©PÎp¯væõpÌÑ·RÛ­„ö1£JÛžõÌÄleÛä»ñdL”Ê:Z:.é¦;¡V§™­Ƭîþ¦Ü=ûø4xmØ0«³]ï¡0£k¢óŒü‹l&SbÙkw&u¾V‡Fö‘< áôùOè¨ï`|l+XÊVÈ=M'dÒîÈ afùeXºdêa)Ö 0*–ã9Ï£‚8I-Òp›såÇ›/ÑóãQ «Ô!œ¤92PÛÍ"õ Ù›6%¥iv¤ù±&Ú ËA©[…l!ŽvÊ+3ÿ@))•Yƒ­›éè~R|Á¢é>¢ê‚Œ‡^¦^%øN²•»%¾Hu‚µ€%—ºÑž~u£K 7 é‡uù¸b~2is ‹=Ü׃_5ñŒ#Õ ̤Ã'™„7÷]¥W~¸!}bÆ 1%DK2Hzh1xË@%™yIÔWJBø1u£¡g_—âúõžÚ£|´¬èÙ†¯Ç`lHG8™H[0 s®÷¬Ö;g¢/ƒ5D—MÉD{yål‰jS&­Ó¸$_T¿@» Á¨™ÙéLËÚóc”ûÛZo›âqJ²ÜN_±nŽ®“*#3”_—ªexk_ Øw—R~Tc‰×Ò¯›¶Ð3ݺ²_'†™ÉŒ_~ñð¾èˆÞµ‹xXGÂ-Ï3¶ƒš†ó[œ˜²Ì6Yz–Õö×b÷añt"Ø (qzÅ7mû ì|C{’÷/¥2œšÈ<Yëò¦!Ö¾ašH‡’oÔTZ FkÎ!Mš²/ÜÏ£VŸu¥¢÷šKëEö„( ßè!V†½âCŸgÅ%j‚¼ÐÃul ‹<òµÙCu›”F„¯SV-ÓÑ> ú*I& ½[9^/»viËyì=ÊÕZEO4™Kví–Ç϶pITžf/‚ES¯ÇâÀÇ°Ç:0-Ka^ÿFº¼Ôš¾À¬ ‡þ6}ƒp}íh åMO-ÆDŸ1 ’öÖòç §ëŒüýúuÑìá"†Ü_’'†É/ÑìÞ 3Ì)’.'îñGb<íñF[ˆ"zÓ\_÷b/DÑÍ%Ôç¸+qš¦Lóöò öŒf¢>Ö”¼å’T+’G Oê àÕ óiê°Llz·‰4͈ӶžˆÅ®›Å}–íµ§ÚP'&xßü%T´K2µ›OÛÑ^|V¦ë—Ü龟Êë æÜ$3ÊÒ#"e¼U‰ë ç«&ÇÎ-ÃvœÝéw6ð•ªzƒRÄï=hÛ¾90žk”3xaZÔšv_‰9 Ø_ ÄãÓVˆ6d}(oNydwQLª¤6äüìÊØm|÷‹ßI"êOÌ|ZÎ!厇ÿ9uF`d΃µŽ±,#Ò][¤Ã@øÝzçáMjzMCš)A8náNk"¥=.¥"»÷S$‡ ¤Å¸8ó´&ü`5Je™ÇÑèSÉ-M>Îy`Ä?‹KÇ^£¿ð ~Zi˜ÎÆ+MO¤{U‡‹Ž|”†¡Hz²³zPÈ}$ãfƒƒ'ÝãmÃQÙ4 EI¢µÉñ˜Ä[,EÓZe&z⦺ÌVJd»xÚ~3pùAÝòõ‹;WZ$þ)n_½»3-e úò-Ž+,.½fÿ`ÑUxC^SÚ(+O¯e… |Z¯ÁŒÙ.ŸuhÇÔ2‡î]° ˜ÝÇì z,×;ÑÈ!„?¼Ø=•s†|PàEA£ Äp»Q¹ §^Ž«ívrË>5˜K²¿:ê\ÂàÂl"’ôÙIŒêBwÀsúá¡\?‰Øò¤yöŒDÊg>ó“LgÏso³U¥g.Ãh|”ýÍ®òOJyÄaÓT`‹ÈnŽj‹5¼¢Ó" ‡Qr3î5 Ðÿ8ÂLMR™VK¤,m+šñ½ìñáéu¾¹eS-¢÷oÚzí¡få½”xWÞõL߉öú6ùf¶Ò’y+*û[Íõ±NþQÓ%î;…ÇímºžOÕùkòŒ‹‰ý·Ø8CQ?¼k8r·|ÃqFV:VýÝbEÆK‰ä¨Ÿ*½O‰æëwéî`Ú½ò{wƒ~ZZvèIÏî6}Á›Ï”ýPç}]ÍÍéîi‘àPßÿÃüíË*¸ºªº Ž—òUäç®È*‡{ØûLq¹B/¿’º¿ ßeÞÜp73çœcNS¦íî=ý$­cÄ¿Ϻ üþƒÏ ¾T+onÀ¬kþfí¢Î)dõXE1¼ÝÿÛ+Ãö€C·SK¼h‹ÈÏÝ ”Å –tmC‰k»ÔSDÒüMpöáE7E¤Y«Íc ø-+1 ­ß5EËí`W²Nz /Òœ"ÿt‘GkñL¸å &¨Sçê›~mÜFbþ¦öÉÝûÎ{Û°. ¯€¹qÇþo…Ífš3@Ì›—JÁl6C³ÈüñŸ L#z`¬‡Þm€ô,Þ˜^×^ Îü2ò‚²1ê®C–²· õW—.#J¢ož ×MÃÞ½Fx6oú´–cë½,"Þ~ÁLk‹ÕÖì®2VÊ#ÙL µqÆ´¸{ëQ[Wª|¸kòk®f3`R]WŠù=+ÑÛ^.=‚ׯ‚ç«ËÉ&}{4àSËûR±»…Õ\g[ﳸÙôšíEC¥ƒµœpmæËÐÌî€0Mu«~Îî9õ[=~m Ûx¼Bºª)–èÁfo—Ž…Bâä¤‘Ø‡Ì ™oÛø1U^Ñtl›È*FL廵ƒ|Q›—êÝ#ct­© Œ™7 .Ó(,û¼–ÄT…ôòãè£Å×Úòx•ûá}$£;Vý;¨¾t Ò+<ª Ø´”æ¾µóKææNäÌÊ?úl­ÓEë:ì„. 9gëÄgcÁ; W‰ÓìaaVÚÐd"çÒ¼WP§0ôÎÕËxõæhz© ¬ªÁ¤ÕÜlzÛé‰ L.ü|5V)¿vÚ%S¿LÅ í-9»ÜçAlU;2§XÛ&Û[’TW Á‡\­–cÎjŽ.jÈ»ÉúÁÊì bÚrf%_ù*\h[àœ_ßH…‰äéO›§Ûà³Ìï5ÄFNWÙßñÎXÖANˆÙ&„— ^ž•XÍPVdF Dð”i!á6Ž¸á`î‚o0Hºz¼h?MMÅ\µ2é‹ËïÚwºòíÀÜUMnäÏÑF”V)&‡0xÖû/ªT–#Ö·O¥>ùÆçM¦m[EY#•õ({¦ /¬~’ôOôïHÆOÚÇA;ÁÒÔOŒ#Ò”SZwlã\{ÃKxšI¾H½Ÿ*Åñt²65ÄýÞú.FÇÈOè±>…óï\º¥#X‡ôþr7Š¸pm‡·È#U)ëÓe%w}>u2•²D*þòlmn’ÃâØÙBY)ºÌ–Q"105#óÕ¬?n×¢»¼‡ô°J…¼1 „,0®l2Ît"XLÇ IZOÁm"UyCÞLèNADã¥äÇßžÎãL•nž_˳Áìˆ3,rL©æ1'"ÇrŽ/t5Xº+Þ™w›¡^æéÞëiPYL­68¾ð~©ËVB™,QíЯӜ€Ù1Ït(•”À%È1K L⸹aFhBo-ÉÚç[ÐqYCö’‚›5–jÎ]ÂqŽ¸Þ­B"+ÀM€îmgâ«…<Äâ0 ŸU^ññmÓï/pQ¡¨'!ª„ÂM«|òÌ‹'B2Fï63ŸÈøo¨¸>ÿº§;LäÔ3+o*ÙÁà ÑÈÇWÖd7n–·Ý¼{^›tcˆ½xœuœæîzú~…wG«¢Åw¿®,rvIX¹²XI;U¶éH«&ò.‹cI}ɘòÎòˆ@’¦³_Xëc t¶ŽFh˜Ïe=<}lœ—À¢dNXèYxYŸ¤7nrõº»ÇHXLìO&_-쒢͂m'ˆ+â ä >‰`Œ·ŠkŠe®BIí —€LÅþµ–!¤‘8U­ÿCCØ endstream endobj 709 0 obj << /Length1 2312 /Length2 16262 /Length3 0 /Length 17617 /Filter /FlateDecode >> stream xÚŒ÷p¤[Û ǶŽmÛ¶ŽmÛv&¶LlN&Oì '˜dbûdï³ßïÿ«Î©®ê~®›ëº±žj e53GsIG7Ff^€˜‚¨6 +€™™‘™™Ž‚BÝÚÍÎü?r8 MsWkGÞXˆ¹˜Ý>dâ@·CG€¬»€… ÀÂÉËÂÅËÌ `efæù¡£ /@èamP`È::˜»ÂQˆ9:y»X[Z¹}äùÏ#€Ú”ÀÂÃÃEÿ·;@ÄÞÜÅÚèPºY™Ûd4ÚÔM­Íݼÿ'5¿•››/“§§'#ÐÞ•ÑÑÅR†àiífP5w5wñ07üE ´7ÿ75F8 €º•µë¿jŽnž@sÀ‡ÀÎÚÔÜÁõÃÅÝÁÌÜð‘ &#Pr2wø—±ü¿ èÿ.€…‘å¿áþíýW k‡¿¦¦ŽöN@okK€…µ9@IRžÑÍËt0ûËhçêøáôZÛM> þ>: )¢~0ü7?WSk'7WFWk»¿82ýæ£ÌfbŽööæn®pOÜÚÅÜô£îÞLÿn®­ƒ£§ƒï…µƒ™Å_4Ìܘ4¬ÝÍeÄÿmó!‚û#³4wp033sqòÌæ^¦VL%P÷v2ÿ[Éò—øƒƒ¿¯“£À⃆¹¿µ…ùÇœ¯+ÐÃàæânîïûOÅÿ"8€™µ©ÀÄÜÒÚîOô±¹Å¿ðGÿ]¬½zÌãÇ`þëóß'ƒ 3st°óþcþw‹™ä%UÅÕTéþMù¿JQQG/€/€•ƒÀÂÂÆàâ`øÿoœÿVà?ìÿ–*­ÿ}:æ?e,<ÿ"ñQ½ÿñø÷dPÿ{mhÿ›AÑñcžÍÔÆ_Ÿ™ƒÙôã‹åÿóüíòÿoöÿŠòÿ:þÿ÷D’îvvë©ÿeðÿ£Ú[ÛyÿÛâcžÝÝ>vCÁñcCþ¯©–ù¿ZÔÑÎìÿêdÜ€"â`i÷ß2Z»JZ{™›)[»™ZýkˆþÓ…àvÖæÊŽ®Ö]8fæÿ£ûØ9SÛKÅõ£W«Ì?VêSJ8˜:šýµ{¬œ ‹ ÐŽùcÀX98¾,Kjfîõ÷l˜Ý>\äüŽ.pu”“À$ò—è_ˆÀ$úq˜Äþ n“øÄ`’ø/âb0IþA,&©?ˆÀ$ý±˜dþ |òÐG>…?è#Ÿâô‘O鿈û#Ÿòô‘AõúÈ ö±˜Ôÿ ¶ÐG>­ÿ"žü/bùÈ4ýƒ?úó˜üAzÓÿ"Ž©£ÝGÿëÿÑK&³Àšü‰õÑ*¦Ñƒà_Èú=Û_ÐãþÒ;º»üÃÿÃÄòðƒ·Õ?àqëÀ®¶ÿ€Ç·ûüàfÿ²|0ùCŒãÃÕác4ÿ¡ÿ æø_Èþáìø?ê£:ýQsúx9Ø™[üaÏÎòo©Ëÿ…ý£LNw„ã? ùñ&frþ3†!ws׿è?ÂkïCèø±Âÿ[b–šü£b,5qýÃë/dîaþ¦æ®wó‡ãü ÷q—1¹Y¹˜ÿ£)ÜÜ<ÿáðQ+÷À2{ü£ÅæÿˆÎúÏûð£l>ÃÿÙwSw—2¹ý}#\ÿÁ¿xÍͽÌMáV—MùÂlšÂz>‹à{2ìO ÌSìkeÒ0ø®ºôº?!A§Ñ4ä†l¹Ü‰¤ ¡lìIPß ¯¿úžt¶@Gv¥ªt?û½%«ÎîwíÌ`|/=iþJKÀ .|à÷êì§l Þ Ú/KQèìΤ\Œþà9,åÕüµz}2bi_å Sþ¥zŽ!^#N?¸b¢È$o‡Ê†í yáön­àû;±l2œÿïx¶2_ÝmÖ„ÇEŸµê¬®¸ä¸º8„à·h“³”¾¢Gé²Ø˾•å‰²±å„†K킽È@göF’þUþê‰ï;8¿Œ‚Ū‘÷f#MUv)DÇ~Ù©ôá 6sU̽²•À¹ªô¾bùÄÖ-亄 غ*³Ff}I±# »¥‚ê;Š/¨R½EÌ 4.:µ©1¼Ë c¦Å X¢ˆUE\2š‹Á¯Kû…Zï9ªˆ­¹<úº9„ö~¦ØŽa‘IÁc!2úöŠ YŸŽ÷Oî q™õq_-är\ V– Òz‚•†ß`Ö~L&äÔ ƒ‚ó†QS­g Z4†"¾0•™je„Šg~{Å­ä R¡ÖG® ëšF/†^ëÏ~!wº@O%™!%ܸæiŽSpé^ùWån$Ðø˜‡ãhBëeÃâAÙ·2ôÑní l³—c¯~Ò×ehH¬ÏZÐZ“Kwjm@8+îh+ Pw¿/»XR:ifÁL®%y &æPr±—†BÆýÚ˜ëÿ M/ÐE7Q­)‰mzÀö•íóî7nÛ¯ðV¿ O¡ìº1E`’¶€Ùû­!íwŠßúy/Š*ô²È§ Ìxg¬M1—²l^ÅžXOr¸ÔË'^ó–àül.}Ú®ë› Ø~3-D[V0†­ÜŽF'±à1T>nð‡‘,­º«„\9ÈDOkË„Þ‡aOí!äö1Ó€¡“Å9…|ĵEÅEग¨7¬Õl@EÛ  àÁN—*`À0 £û¾ •ÁúГdŸm}ð8ÇâÒ˜Võûæ« nÍÙä¦Ð÷„)î]e]Pû£$(2{sqå›ÙìÊ(Î.üäO<åVFÚÔ#ÞIŠ™ÐÔMóœpþ\O¢Ý=|ØÉG•Iëñlwp%ÐHò 5ÕÞ*µÚÜ⊪§#èPÏ9§½†1oIŒÙ@£øžðw/eõþ:½È,¬'){3ùf™à\gi¦Y½¹°­XDtƒ„уlï§oð&„Ó%‘%׺f‰UV‘éIM±‰Ã‚^Š§UÅ›N{‰®àåyRòA«JeV‚×óŽñ7ó'…•yx k²|²túöpÓIJ¸Ïœ8ãC¶¸è KöÁ<¤PŠcñ¹A½Þ À‘§§¯²)¿Àf½‡Î$²2ˆXÙÌmŒŸ«ÈrÆo ¹º›:’àºøŠT5‡ÇÒ¯{dñF¨´„ù­úÖ$˜²SÖ¹ãΙö²¹f€Eoa”7­Ú#(’ÿ]´µ”&§'°{‡Ü¾)ƒÅGWßP~ñYñXÕ9ûŽd–kÌ]^©gZÀ$p*àìÅè‡,ì«XˆŒ?Çe$¼:‚kEË©¿»¼qºÂJPu)W¾\ß<<øÙýa÷ÕψÜÞJ€Xß««¤R¿Bc¢!Fñ¶¢Õƒ49ò4\Œ’#ج=[`SvúÜ×/yâØÝÛóªïÑ©eCêˆmA“¦Ð5¬¿“C)‚_¼ÅõZPÕx¤W.Tâ{ó\,n¤* _ô98"ÓÈöV=0õÂu¾·Ð`bÉýT+3$h pè̪SÀÓ~¦ç¦,á"Ž˜‘¿eüHƒ7tcÒB ^ñþÞØ?ŒSs]ËÞ¡"çK³*0®%Þc&Øíˆg~¼¦›ã´š†gÆ`Ž,¬œ"ÿn’èW{GæIÊÙ/$O¬¬=±åc‚T^ a:wïÿ|JC-¿"g¡ÄŠü£>xw@­¸Ð¢‘ÔÀÐbþÞëXw厠ZÓé§nk‡%ØEµÝ$}:°É3Âð‰æ±ÿÙ½nÀîÅìö'{믟*Sy×ÈT¬uY(=^ÈZi¼—ðƒ8!­hŇXLÚ.ÄÏŠÖçgò×’ LBð% “ŸQ¦'€S$…ˆ»¢Çn·>!ú½Ø9µ›ŸT™²\ØKOŽN°ž*Ó±Ar–%=GÏÍ9¨ ®[t”§ˆœFA–—ÛÊ]„F•“€acÈÓò©T àø_á¾›b¢VÇnܳIù—©ƒâRe¯%:  ‚%Î.Q2ät@mmH>ôy*(©'5ˆ»ÊfN¨àwµ< †úBÃ>÷ªoöµß°Ökâ&×+ºnÍ%<_!öQˆ†®YÅ]­“,Óï\ Dâ];þ’ËX#•ÎûÞ€´€\è¨aE©Ô˜â¢’m¤n;ï&ü–3{UgÊ¢,ó#içžÑ®PeÔfL’¦ R¹Žå¬ÛÇ„u¬¾Q+hSÎ^®=¬sä›=é[@Épßó]:W1×`À„#á*EPÌÁ¶C:¬h°Ãè;§ó¯!« UIžÏêK¾IÔÅ”™ä[áI¼7Výx÷ï·‰ ï6‡Ð•+ø¿)’$Á°5ÃÞ×¢¤vG=ÚC „ŒÕx·OxeÍTG&ÛÆwyrj@â '~ðëÜë9Œf´ÕÝ|ÛK8Á˜ßîÛY å>&ê'#5‡™@[´%„'¼´Ø´+JOŒ+˜€¯G« iAPöÄ—h婸ýN®Ø¶Æ_üZùEj£ Ù­í þªà‚·r,ÑÐò;oQþ…ôˆä7­] ¨†Htò÷q0z!6´=/®ôKN2üþw ÉuŒ@ÔÙ(úó+üXÚ˜{v¬IqSê–Tó@Zù^¿JßØdgo‘üÎE fJ(‰©ïž'?Ç]Tåød•«ž±£jG´mOUÕ\Æ$ÅÑ$Aߣ$ôBe±<¨8©uδMHøÇÐe鉈oèù!­w^ŸýSÞ¥æ!”4RÎQ’ÙÌ$ ˆ×õ÷}²`Ó‚]Êp²Ö6…Ú÷ðËïLVëÛ¦ƒ¹lûŠ ^Ú„ið¢fcÁˤÕؽ+Útq`ÌÓˆQ«kNþˆZvÞ!=ЭÒÛ´ñrvÒå­“¢åJ’ ÷Å¥¬ l3–²XÁe½r”­@ÜvÔÊ8^¿ÀÅÝLpë’ïÞºSߨï,ÎQÒh6ËÔöV1g!öØÁ¸øÉcs‘†5;m=+å'9Ù)"çã¬ïÛ9ÌKÍán}›¾¤Ç­Æo-Bøþ »38 /H=Ë–”Óp΀241øÌ Ò”C[;±¦soä® ‚7bš ‡6­EÉ\%& ”,ïºÀ1Œ…Àk]çÞÓª5bk™âð`òò± õZ¯Ðê¯ÏÕ‡é47ÄÖ  nìº9éš öûÑÁšó ÉkJÏ©ÁAõ·=4– ÖopW `²#…zŸÕµ¹˜ñÂM#±bƒa4 ¢èﭸιŠÙ¿ÀúñðîM6ïؼٻxÜæ(ß$! ¦˜y]uïÝw—OÈé.€÷®‰¨N ý|óyVU˜É×âDEìÒ¿Æl|ftù.`eÏ¥ùI8{÷kÁlÒmwœ…r‰cûiP¿Â)3C&†@É*cP ðìR~)ÛôÜ5|'… …ì£éÔæ8Ä°Wœ *¢¬4UQij@î.y@±lXz±s6sKß%c¼]·*Þ¼Úï*±Vöb¬ö™üxß/íŒu+’¼ò¾:hÞ¿½¤<÷½öTÑ£Ó‘M)vë܆?ß³w ß²Qp°A°‡¯T•"lЀ¨kÑAjàÊ~P Ç®,yÏ“C‰áÅ7.%©þŠ­($‹s~Hµ,Âxg;à˯<:”!´OÎdR¼GaªÚ±ãÐCAºw•]ăÁC¼¡ˆìn¤žwœÍÒ†@LyF i^ªhHYá.ãwûF÷¾Ä\ÕJ Ï šd†­}QW3ÄY¯áy«D*±üH8squ" ™ø…„¸yV4Ü‹uï>ëV××7$þËÍ&1cÂ)÷Ä7ª6]Ø–Á)# …¥b@w`’ÉÞ‘œÖB͉F¡OÄè]qì¸b^Dñ½ `ÆüÌöÌN°íå°nÇt¯$b’ŽÉN´p6Ü'üžá ¾O2W ]Ë´Û%qýWx4vœPà&½Y¨>9_y­ºê†÷ øïÀŽùWßhñ2vø‡Pq_`•¾ _;¹CŠÙxÕÔ”œB:•Sê>pžènÃH ”eÉ éeü(!´ÁNÚ_ίw3Zßá‰rJ½Žžˆ¦½ŒšiŸ%µbÜ&tjKøƒ4枆‡˜k¡uØÙ©T¡s¾BY;V†§Hò7'á±-d½è‚¿ýØU¤ÀÚT2ôœÆùûÅ7‡R¢.Ž·ØV€ý ÿ2›@´²±]Ư, ® `q-§ÁB®ÊÚÖ« xæ3hßÚ€Ÿg{Zm°?µ…S-a( lßsé–nÆÐDq¹EЉ ÇÝò¾O¯ëž¬P’—°!-&û´¡ñþü ‰í·s, 1l8¶X…Å :CÎû•ï÷Vù_ûHZÔe¶åÕ;ʱCžX½C¬`С«›!¢ Lê=\øzw8¢ow»|“ð»~)ýÌmí´Gé™9a+p¦¦S"d…¯¼‰ ËZ¾¡9É1ÀxŽvELåÈ„E¦‘7± ÎV0Ô³ÃìšJ ÿü‰ÕA U2ìÏt°® =æùh·ÇD*]ï Oý©MÍÃí íê«¡¦ˆ}õpŸ¢þÜ ¡“Á@1|cé¼- Q‹ÇÉò‹½|!åkmË)HÙlбq‰a—UžX´S¤TpÀý£U ËñÄÎü¥ª)8ßàûß,ñe…;ñ°3F´n¹ˆbpÅœ®‹8fÒ ÅÍê»®&˜ÁFlYH1¹v!EºB¬E„>S6NJm³jB`8»EW0– ŽUL`˜Îéy¢¿z>I)Kܲ2#☠†ýÉl¦‹DÎånãýã`˜/ÅÅow#ܧ¦E=B¸ÖLŽ’c¶A§­SàIͳ™£úô·ã,ʃí~Y½Ñ·Ï?ôŽ‚„¿õS’Ir[ïÁòä´ñ§Æ†yÎB›Ó1Tص÷Š™åæx Ÿ þ­‚NbuÚ!Ò#ÅƺƱYŽ4d6­}7wµ }cg†B¯ A¾©3^^vÌ/A›M–7\4ÎB€W ‹âͤ \Vh5©+£û4‰•ˆÍ·L2ÀËÎjÓ‹'–š$Ñô¿Îø}ºKs JôjZy/Ìj1[Ùfs£&Oêjcg>À»€Ú­TeSQòTn§Cß÷vYÇn±ã‡Lnåï K••õN71€7.Û¡kÀÚK. yX}»v§ÃŽ™=B;|:rŒcÙ¨²vìô³©ÖùúÝ[}¡}EŸH˜[¬•)@b¦$á ­•Û7lmf²öÉQßÒ„ ¿Ó7tœí [Ý¥D¤–ÄWs#:ctádwQ¾ÏCÊÎòÄ° j ?°0—90vv".ß~Ñ/¬6!£f#‹§Ýâ³Þ]³S«œhSbHX°Nï¦7yeJFéµ9÷’š ‚Xìš`¡Z» += gv²¯#µ\´m¦c÷9ÝaÔÀ‡!µ@‰à@óÓFÈ—Ï9ÑÞ‡HêËi2Ý1’D€ûTç§3fì»…¾Žkþ¸OERtiWîútÇfTW†e Gµ®NdÝ£DÑ—ÛLàºÆÐoˆ»Úoð¤¸ßÝ,ëžqMÆÙÖ0µÉ¿L‘˜RCÖÞþì>r$hDí`\q~ƯPcJf? ëä»Gïגб'ø­íØå¹Bˆg W›ã^\¤H^çž(0P¹èoÚ-Ø34¥Û’Âóe·Ÿ<Æ¿Ï0…ê2 Y›‰/x›æGm¬W¯éä\Ü/ Â3QoÈk^E‘65‚‘+×ê•á4aéE#KËÑZ s#ñû¸wyÞHµÝ¶™T¬ÖŽÀì®JÑ;d4¬Á¶Q;Ä×ÌþR\ÙqƒócøÖiP0Pòü3œÏßI¦¿)£aÉ©ÛC)Š×hÏwÞ_¨’‡æÃC¾•¿NIö›ÙþÖ×ù*lóæ9x°øáQè„X­¸5,¸#ž;ü)ù¦diž‡>îÁV/wx$Îöw‡â`ƒÒýàö R®(1XDß“°ôx¥ej [ñào÷/¥z ÃKoivc)øO(V6ºô² ušßÅÐ;v\ý°ì¾ÖPð"¶ùîn5æ´º§]™Dĉûj*Ö“GâîÚòøLÝL"©(óñ)-Á:¦pF&*—ê`³&ÿÚ'é휯¼b7ä6CÇS#D²êÔ©8àÈ®?TS¡;ÚèncÑŒ"RÄÖУ֜Jƒf4Ûö™Ô±ùýÎ9Êâ¿q}P”åœøFÀ„ƒ4’Dü#w1·Êö×¹½’„3GH¶Ç¤à¼‘Ž¼Â«Ÿ9˜1ŠaßóâØb—¾²#íD-•i ¥Úî¾¢×¾Öt7œœ<=™3Éõäq½ã'iºP î3h ¬Ïï/Ùæ,:pª‡F½Ý©¸T—$R_G÷²Þ&<±26žé¹Íæüi “/­Á5ð8W ¸ˆÒü ”õCdZ¶­¯%€ë´d•-žŠ¸ÐU¾¯“ gë ÚU½rêº\£ $% ÿÆ„©¥S­^bv.ZmR6ÝÎòIŸ¯7Ojj»±PÛC®K±>Ó8Ì`Àã惄võ6 8U  ¥bl>EûH8:®Œ À¦¬iX0Ýü…¶WÏÖ÷è®k¢M ªQ{€ å¢z8­âB5èÝ"‘Ë{€zá­ÄkSüÿàEÑ|2 £÷r§êË ì©C.ÑrÌ«Ÿª0”÷¼røšLãO¿!8¿²Å÷»‚nærKèä̬¸kËŸ]d†(”YÓ½j}ÿi³÷ò^²¬“Üw¾]Õ§F^„òg-Wž”ÐSÃ)Á¢¡»„¡Ë¯ˆÕå¨Ø÷eQk_¼žøb÷¦FÙÓŽÒâkįà'Êá–ßTŸå´¿`Ëy?ÖÞ­Âgyñ·¼ßàØy+M¡Ú´w ß“•v€ªª Ý(Ò~¡ñ£škö°=ž¥¿×ˆxg)ß =ÐÂú¹D¾Ÿ]0‹( .F9ô¾È›'õ‰´/@N(‚%>.ŠÁWöÒ˜‘ôu¨ld• ËÄÿ—DyyˆM{¾ .ÐVŸX\üaÓ[öiæq„—šš,Ä5 ^¿„[Y 64F/þQ€Õ‹¼D¾]ÞQ–õtŸné’ýïÚ ÈkñWIr‹56ö¢+ûùJ•† p0Pb‘Y_ÜšïO¾ÐG¦ë®ífþúÀâØa!¡¦ëù²«ü¡É[JüÄÔ™#mðÎÑ•îq’ÃkÌXùš“@¢4å£9ñÁU¦Ìè­ª®¥â™J ñ{b3­f³FÛ®u-”XvzATàÛo•¨‚ÛÂ.!‚oÃhÉ×8ð[en±1c?çãC~G@Ñ}ü[ª :ºjU1ßLÀK¹\™'MX-`ã,9†)õ3“Íc‚Á=RAK…c>4 B£J“­¢ØõÇD«8Ž¦lü` HaV”-w]ÒTEýEÖ!†;/yk¢³'íÅW%P? >ÿ1 y–ÏwAåH^ñäCªÎ£Ç¾¡b¥KõIeªÉÎÙl¿xsà HS<­mŒ {]À âahµ’g7–Ö”7l’zJ m9²ûÑ!Ÿ_øs†òc“U²•{ë7³=¹ìK’&9 QDË×Çàø_i!g Ÿ Ú²‡€Ì÷x››™çÇ,ìwÃò7Û%zîwX¥jšóVÄ€Ý_Au“qøžrή!ƒ,ØNQ°Gç¶ –ʨ¶jœËº¹S‰Ü)|îÐ3v•Ï- É!ë++K ø=ëÊ#‹w¾4!|/î¡¡ØGïuöa¨n0pe~÷F}Ÿòï°áJ¸‘Hí6Ë!ÒG"y5É´þ YåndÒ-—ð°|½fg—ÄU*È¢=¥žÁ*C‹úèypYQ2^)(ÚêÌšg—ÌNì•¢³¤Rª*Ìðv‡6·ÊýÎZã²å©T.²o"©4²Éd²|‘ãÝŸ¥1so Ïcm9YWÔBåÏTÌj«›®Iž]M.$‚Øü¢F 'Y›swû$§´»ys­óNÊeÇfQ ÛqU )W¨P_IóÖG`$|d«uª+²°$Æ%•c‘“"`´cq%N€ÌÿúÓ¾RE+߀£+—¯Óˆ¯¨,Ž|±òÎäíå›q¥D“›}†r•’ÃvÏà -|%'½8Ç@„v°A™ˆy(ctžÕ‹â¯ù¹m‘Ø"å¶$@Ò¥¸pqg‰M®2t€ür‹NCÔ{ 6Èu Ç+.t,Å~ü³’N7¼óR¥[Œ—™@²ý§üå'¾IÿN`,ÆMá\FRÆCf±7ÚÕ|ï/gULi,UG €³þUÎo0¶NÖ¯#Â,ïìÇsPUç¸ÞÍu¤Syr"Š‘f3.×Ía€“I_ µ7R¢o4®CÆؤŒ8ÉY(œ”N/ø¯*¢8ýÖ%žu °Í<ô|M0ivŒx\¶^$íGoG™ R~NLšùfÊœ¾h›É4³økâò«‰øözÓYÜíÚ²„ýlQ£0f¿¯ahB¦R•ë¢=ÎÉ6³A—Øðä,\éZoùi¶Xý¼È<ý:2J`Ûš¥Ëbq¼ÏM¢½IðúOC%©žÌOG§Ç+-àÚ‰ž„w[êïaùŽàÙº1˜O3®7N\ùæk)’„CM,„!ÑAŠó¹%¸ä!¬ƒßõúï± IwUØÞg\©55] ;…¾wÕ‰¿;Óû§ò+.>ìgÉñ—Ô41›ùLóh‹‚Ei”MK>î8úØí1Þ¶­Óå)–ãóKÍ^UÎíFQ'”h­Sì 8H÷Ó,_|”e"<ƒK'ÎÂÜmZf•&ùGêÄ-Va~ö/±;ŸÜº¦Gƒ¯ðO —›Mÿ~ÿLƒ¥”ãª8OïdLº1ÊDx ©üæ¿ýˆÀ³¡+Ìåº ¬ k«~¬nªŸþ~cËñ²M¯lʦ‹"+ r˜yYÜHêF„HŽMo²8»r,õ”H¥10.½*2)Î:ðÝyÑbcŸ <ÛÖyú-¨êÚb!p4ªüÓÒm=Ö@){gj#ÂgzûuÕ€áGø&Em?ôr –½þé ÅXÏõ'A£›|¾“Ÿ:Ý"Ñã_¯×uD}_g0’çD> ÿj½û=É¥"%fìõ~p+üÙ‚-%^¸ }FªTsÅð„h/^èÊ8¥¹€ü ÌW²¬nÒ,8’ݬÝD}¿œáŸ¼|T€ò^û.6öÓ#r_€‹ô‹â¹Kõ¨=`ô¢Ì9©ôÔWËêK,¾Î¤ ¾Eè~U[xÐ~º ½ï˜ì¬#‚Ȥü6»ùZ?‰¿(ÛØ+p#Cô%—¢\å2 ô“`רxvS[±^‚ÑS–;„J6|ˆRÄÃw|ÚÆþìDHmL>Vµž,8i¥êl£ÛVáãáÅ)¶ów_ †ð 銖e{quÜEç7²\½õºZA T€ZuðN£:Ñ ZÜiPKeéžÜí1¾Õ«3ŠÞx°Rái¿gEÓ­+㊔jüJñ[1óÏsÍŸ&U/}: ‰ù·¦[SB°ä22Û-‰«Š 8šCín†¥H¦4%¡š‰ßB±§@ô!‰>j¯b+ü.‘H“µÉ× ¯ [ ¡ï#?# Òÿ3E öm!(#Ê„áÆ Ç&ÿ¶45÷¶˜88‹:'âÙþºúe]b()Ï'bÓ? )OÏØ?ú]ÂOýHëóÞ—=mÙß%Lj#Vn[t¡x§™S×g:5î6*÷ß‹Á”ÛÄH˜$ æhßÉ”’ÅÁOË®ƒíEéÌt:Dmû'¢Ä…ŒC-4œ8z¬d΢”²Š&h¨tÊküýž{]ßÕ‚4c­`¶r=ˆ ÇµÌWùT•ÃIì%ž®³"™ý zr 8ž  6G€m+Ï~Ê”å^7%öÎÂgϦB¼å×®¹{v3y(¯µËAðUbÌJæÔ³)YÀ–¾ NÁ tzîÙ&_;¾e\${DKbʽNÞÊO´yçÏÚ*ØÝíì /:¼!KÆ"©3m‘(arªû–»èþqƒqÚ–t‰OÎ?nç·–'ò*¦ƒj¼9õ›þ0°‘Œq”*Ý”ý)1#¨öõ!\–Š.a¶j*ïZq¿8°‹Þw Ïšj·5•®æ49öþ¥¾\êp:AwÄ­©Q¬.¥QÂWI;…þ³4OœAúõ²Š2xÅÊc«ænX·å~¨ñ­/Ï©>\FÆØA²9?ßs bÕ}¬¨kB,KN\ü&;l«ž1t‘Œºàv3ÏÔP0€|ä‡ne¦‰g!SÆ«ÎÒ¡åïŠtLÞB–l^—e¨–mÑ„d}/´›[­ñdŠDRœ½¢«9(¾‰cŸE ïùºáZ’âN·P#F‘ÏPìâaõx_ÓòðçAIÒ A›³Â*û?ÄDQvè.[Ï‹ü{p…æ#Åo2Á˜=töØØÑ~ùpá!Œ0µ‹ñé%‚˜¦U×Ì—ÂÑE¶“?„=¹¾û„aó§ òÑÍÿYÝ3 .7¬ëYí„á3qÔôÆJïÍ…=Sˆš¯¶p¸Gã§z®ëCíô®¶©í˜þ„áC…µ¸ø5žKÿs†a6eazA'ÛSÔ¹’™Éw¥VÏÁ°¯Ô‹#´°gKt”õîØ£R­[Ö_¾ 0ƒ,¨wb‹'á¬aSxS¾§KÁŽ>ãÉùÜÚó¹Ð(oD#M§Ð¬ P4G¾•‚}£),Fc›ñÔ/ö¢2ïI¼hìÞ¨—ô¬Gx-ôך“&½à… S‡Ñsºy¦»°UN;m$kÊ~mÜÏ0ð۶̯Ÿšñ²‡d žÿVÍÅ‚êv­²4Ù»«­õÐ1ç°$w1ÖS^ÙQIV—k lÊ°–îq6;Ý>-k+6kC&ö%26•¥Yr² ¡ÖdQá©'7mt"ÏgŽGjÿšïÕÓáBI½ir+©ÚØ´äLPmÿV‰}}H{BYª*DâxŒ·&ñªŸKh·}ÂPÉýbø#4¬þÖu“êõ•¦ö¼”´øA„ÒÇ_îÂz¿õ„¦ß¼æÉnÍÞÈ\<ŒëA¼&Û«?'Þ`×O/3kf¸÷†2ïççÿª@Œ[……Ã¥ ÞJ!¤ à~º `àJ£EGòZÐœ~R¬r;=¤üJ>OA¨šqa$Öˆqy9ìOgˤ'ñNÎPšú‹ H«™Y¾NÕaòlêJt2à*çvy=Îߘß=UÝùë€c–X#ÛF×–­¨áÀýçÍ|ｸlÕ(¬æ¬gRÛ1%èè­J,3ﲕ þËxI^ýtd©zωtv™ž¨ñÞiwWÖY|gGPFñÚp’uˆN=— ‘ÑA´žŠ·^œ@²žQ'¿ïŦz…RÇ’'ß/HmŠ¸!$9×xXC¾AŠ+bpFÙ«LŽ"¢ÜuwÚêtRì E9;Äž¡b¿$ÑVßX#‰ÚÖÖÆÆ™`}mæ(‘'û9¡ìš-c!ª´±“½bóJG¡v{6LãËNÿæ—ßTX"Ñ ½Íèg©»ü¬O§Y`…íÈÍ^ì†{º§ìYlÍp’lv;Ÿ®õ3P¡§Cx$~.ØÝuxÁwHãæç«õŠƒQÉ4ÖäA­Þ«ëA áùÌäJê±a „ÜršêZU<9,†j$=¢¯N¬æÌ Ã—Z÷âŒèþv_­÷Ý-JD/ è]ÖzÀºÔ_Û’,ŠÞÅì!ýÎ+æ.£ÝØ*‹fHƒm²*J”x6¸ÔTA/C-­6Ç6šÏùiåJ2ƒî}ÿkþ%`þ«4±ðè8;‚SÙÄøž`þÑ Ù¤WL äÈK©ÕW*. ïg;z Ž¯®öÞ<„¹FÇpˆLª ©´®}t=ws CÙ[BP-Tø·!E§ÚŽùÜ%¢hÂ-Ó¦¸Hã@Ù9v¹Š6aÎÞ™Hö¢~¢¾Ñ¨æH<Àä7ݹÆØÓƒcÕ5þØËÆáC«œmL¢Ä%º¬‹uü2¾R¸Í·g!çxO¹–áIåÏ‘™šHWŒj&ði Ãëup:1»ö1⽧¹´5Ž¬û›`ZÛ8w5Ôß\ÂÝ*WŽDt× GgÀdä^ ^kýÂ,™û„«<Ý®;Zœ~ôþ˜w¨”Î|Z¯d0©©½¢Ò{ƒ¥ûId¸3¦eÒ7R[õ6 ‹úŒu´Ìœ[0kˆ?Ü4ÑA„2|ÏÎNÜÿÖà?œX÷(ݦŒ¤&leEM· ÕKÖ¬Ù^$yW ›ˆ®ïÉÊPÅÍþl4æ†Ø>>ø x¨ñ ºî {gì•‚°þlv¯‘×Uiâ/º]åÀæ˜êwÿáf®e0Êð'l±Jí÷Àýü·Fiõm÷öS0NÅÉÏjus½’ßÚsØ¥²Ö5¸Qq‘À _E~…ɘR^‚:h´³· ÙM¨f·€o¿²t‡éü{ÞÞƪÐJSno/Ê·’&´9ÆËv#ƒE«¸\Ó,>¯4ï†[*çq§v³;~Zº“F#1w03¹ jÇ—2V7­hÄÇz7†ù…òEdFg™K†§ÞrþíÖŠïöÞ¥.k7[Ô#ÜÜé†zÓÅä=4o½šç•çÛÐ_”‡`eùË‚nèÜ Œá»JmÆ—Çd ™)¸®¹azÔ$ˆ´*¦¡ÃúðÊ ]7Ó¨í»ìÖ*dKƒ1,ƨ-¤SŸÅD¥þwK.—øfB|ƒŸÑ!mŸ;ß± +^àPs'¿1àÙØ€ÀÜÆIŽã"úú\¡ÜûæwÒ3z&ÈÇ™÷Ÿð~W šU\wLþ]“J"ŸtÀQ:z_ÒÆÿ^ü5候-ôse‚ug;®=·¿xlü€«R¬dŠ®"åö[¼D"ѳ†Á¹ÈYÿ2·ß!Tf}1î×±œŠXÑŽb„o¾{>Ú(Ú0î?©¹¾±±Íבð#)Á&óåeƒ!H@ê…è-%ÐQ%9p3j#× œ—ÔG÷£§“²É1ßMt9JDò]Ù™L«úØ9GY ‚Ź“36]‘†ÚéA6~OÜ’œ²”¾Ôˆ$qµ?CŒnc eî²ÆNX>ðVçB©…}`~¾–NÖà ^9*u@õÀž'âÞ†õdÃf=ÒSÆ˵ÈÛ(”—ƒ¨G€n‡äÃvY¼³S€Âk$Õ|í¾¸Y%¥ÍŸç%[hϬ¥¼ õùwæxC{_…õ^N ú´¶IΫÙ-Ì0eñŽ”&IqW°î/g4…ýTês á‹ij¡Ù¥jj¤[ÏvnèCð9Ø®öU_XgÅMÁŠV!èòªSŽcì9[Á‰@æÒ¯Ô5¼Bû 1çA¡\~œ¹#AVŠpû1æ·ö2ìñ„$‡æ¤„3Éß  ’ÄüÑÉÐÞ$·3‘î¬u”æøV,e·šúUï«TvEà×Ѽ?)=ùñMa·FäJ ò»:æ [Âp9£ˆ|Y£>ÁORè_eµÙYÞ’E±f`°‰œuÏï”<'¥‚)jÈü¶õÍÛ²°QðqeÅž¶—7ÿ›è>ºÜ&l-M`–eéÌ)?!n31’U4¾Ît²îmi:žÑÊì›o¤„(hˇ>#5˜Ž“ž 汜è0ϳλÆÀšž>K .Üzzƒ8¡ ÷YÍ!C·å_sÆ_è]›F‚íWp.6íGC„Ú?éQ½.š4ãM‡Ò׿ ÓèŸ#Ã4Õåü´“Ε¿±`Tv@¨Ž±ÝNâÝõMRÔS."¦w1¹²O'2ã•Ãü¹2¨˜: †(÷o¶b…ÙB^Ð׺GqæF4áDkn¦6žšj^\xWд(ï_Ã."¥ÉæÄ~•‘©ù› „øßÁζš½ä”×#£Ü=ùÒ¼¸Ò=íÔšD뚀Åõ×ñÛ^p¡Nn¦¨àå H.¼xû6™Dz·îl¸‰ÝäAy ùÃ0£„IÞþ5B\Nñ+ãðs [+ô}¤Nèk:Ѽš…™µôj2OÈÝB#l§°·¢2‰5M*ãí÷â@”ò¸Õk1hï´¥€”ÄkT¤)àõ¬q)jL øÚ¦ù–lÐ ‰ñ–öl»†ý¦Ô-™L‰8;ê’m×ë|+å¬èn”‘ñýiDõØ"éó,ëøH\=ÃòÓ"2‘ʯ]M¤N*GÚ˜OξLhÝ¿p³N07wóÆ tž5оI ܬY׆²£I©¾*,RDÐd!Ü‘—¬4·Éž·^£hâöUÂ~3ÃONƒ÷‘vÓŒòà©ü<ÞÉ©á£õe{¡€Ï {RƒèÎI£+k'è"6ø·Wy×g—­ì„Y ½háö‰2…Ùþõ/!¥+ïÚ£ÔŸ©Ø1‘õ/Éâ¨õÒ€òZØ»é¥ÇMWŽÍd¯ìfùðcY™Ó?˳ýY(úkA\}Ÿ+æê·Ç]ßB`³™¤‚–7ÙŒ÷}Ý ™L«5ýÓVª_4éL¦ k}´üî œ£ò)”FOéØ"‹B„*©Ñ4$âÜç¬õp•ð¹úùU§ÅO-2Ï.äi×ˬ߽ Ôdh%GyTº²”:7„¹†;÷ô¶˜—!'¨s åÿ 2Íü¾GŒ>ß©T¤[®«ÍÄë 8,ÞÝàMÅrÚsßâZùkaÁz78w@3ÌlÅÎ3Îj#ª¼øµß7iº÷¹<i…Ѳ— ½\áÛ Å~'[HŒbù:-3˜L±j”}Ï·§r á!¦û˜o“닳ö\eì효ÑéÁóí™ "P³\>‹qMEô†îE!×°‹WZ XdmMbžDñÚÑ­NG£¦Éé^WÍåãçåóÛ;£2eB6 Õ-dz„Dàâ¨ô”îƒnéâݘ¢ìëq¿¥œ÷íПZÍ{o.™×mÑ-êU<¼>£ø*"uï%‚ûE®=z|„QñÚÅ„Q1ÍAé…)émIXÃåüÎŽÍ·5ËËOªø˜¶\g$óR|b’4Â{ HKE¼§7Ú"¼,VÿSv°#-ÌGe S|8Ì@¾†ÅÁ…–#ƒ±MžˆÌÖ° \\)Qן㕠´;à*õ'@ôÛ«êE©ø¤¢¡ý&ÿ;IgÒÖâwÜ(óÓ[•²ÖßP9l­µ1íöíýù*ÉòúŸ_¼Õÿw^<%½•"½… Ð#ÿ%DR!ëù§Jº¤aÁ«c`¹E²,%™Æù}gZ"U\Üó×Ú»Æ -þ|ö'âu_ó#A avÑ=W~=aKà dÍn3´žŸÉÈ»?X©ècgŽ¸‹td_øׄhp…EeÀ30ådê}fëÙù¬®«FŠ9«¦ÝNm¬“l ß•"§r¦ãiì °Y6&C%Ód²Ò4‡ô];|ð̵öçN²kÎÿ¥²Ðø°ÃׄíéÙW$íì ëõ>uOy èQ·]äx™Ç$OŠF¶ˆL»’Ûö6î$KñYl;˜Nu³#ÞìTãʢ ©< _òYùµ…%Døl©ígŵ €ƒÌÏ•'L¤íå§ú£ØŽî°·At\ %)¥I¹Ðj£c•Å”ÆíŸdäÜ\|ז΃ð[¸i†ÀQÿˆÁ¢¼Ö¬]srBz¯¾úóœr°³û³;ó‘® óv§öÒ|ܳóÈvsÒBÍŒÄõÖã†O endstream endobj 711 0 obj << /Length1 1487 /Length2 6796 /Length3 0 /Length 7777 /Filter /FlateDecode >> stream xÚwuTÓï6 ÝÂ@ÜèF$'Ý  æc0RIAZ$T¤»A:TZº»¤…wúíßûþñž³}îû¾îzžëúœ3n}# ’Ò F"Ð@°,@EGÙÜXCD ,,%åæ6†¡áÐ"¤Ü¦P” ‰ýF… ±>U ÕA"šžp€ˆ@DRVDJVX *,,ó‰’¨B¼`@‰€zr« Ý|P0'g4¶Ó_^{>€ˆŒŒ”àït€ÒC( fAt hgèClG{`„´‡AÑ>ÿ)Á+ïŒF»É a0䡉rRà``hg€!ÔŠò‚:~­ Ð…<„þ½ˆ”`ì óø#d„tDc ((ë€Ãì¡l’'Š`ûŒ4´znPÄ`í?‚€? ù»ÜŸÙ¿ Á¿“!ööȇn„ áp„Á¡=°6í@¿€¸›ñ‚Àà;,à÷ðXÉÁîøç†ö(˜ÚäƒÿÚRèWìA«!TBhÒ_ó©ÂPP{ìÉûý}Å®$á÷íC88þZÅÁÓMÈs÷„j¨þ‰ÂºHÿñ9AÑ aaa))Ôõ¶wúÕÄØÇ ú;øÛÝ#ÀÏ épÄ® €9B±?¤~/(ò„øý;ð_‹TDà³Gì N0é?Õ±n¨ã6–(˜7ÀJKB€ð¯ÏßOÖXž9 pŸà¿/ZHÍòž¡¾ŠÀßKÿVVFzü€¢2 ¨„0@DTJ %!øo¥¿Ïà¯ý{õ!°?çûWE „# óÇØóûk¯?ùÁû§|øÿí ‹Äò àýG÷…%„í±_"ÿßbøòÿÒÀ¯*ÿ2øß™Àžpøoï_ÿ yƒûü‰Á2ÛU‰«ÄÿBÍ ˆ[ wøߘ‚ÕŠ Ëw ˆ8HXü?Ì ó†:èÃÐöÎðé¯ëÀv€ÃP}¤ì×›%,ü?1¬í]±oì¥ýA± ûo_5„=Òá—E%$ âCŠåÖ’ø‰`5ëõþMs€DcSØ ŽH鯫•‘Ùÿrý¶D°$‚þcŠˆ„Pÿ2%Bÿ2%Bè™R!Ïßæ&´÷D¡°bþM&ìøÙ¿ßP¨7Ôžtji/ìRÜtV¦Ä‚®}'ï>zvrÍlUÙkà HEþû±XVä¤RÛØzä÷EšÑü«ZWsaW›ÿ—‘² SUM„Žv+‚þC4wÎw<´=E×µZ[-mÅN _ê {1'Š£|Œ‚î‡kãi[÷äoוœ;!æ©Ù‘á}ŒŽ$f’–#à nVJk.Q.WkÑàò8Rü¸¼õýe×€¨Är÷t¡ .lé%Ëö6¹›ÖIÚ¶BÊæ{ÉZ¶C€QîÕ÷jL±¼A'MÁ¼vƒú‰ÅZ›©“=> G“/5ïU¿ xŠ–ѳ£ÑÝCiÔ iÀäLËÓ† ©dîÖ!ä?ÊY=ªKª†¶Îã3‰¸ ?ÖáŒ]UgI2E³I]Úu\Jš¼á¥K‘l!¸ã¾½Œš<5êûÙ_¾¢ûÞwóôCáò”kN—ná±S×ÓRçfsß ˆå¤¹¯bû•Ô?ü^7ûÑÚ³pµ£²Ch’Š‡2ÝôA«Ü5¬Öë Ô±3UŠ ‰6ƒ5›rŠ±NZ#¤ì ÜaÝZƒS?Àot†F#Û^ájž†o)!ï±O>&ó™ÿùŽvû«eØ“o@{þø¦x ]L/£íÔiÆ£ñ+&Ã^õAñàûš²Qéí¦ÿâäuRòFÍc¶7_•Òœ›Æžf÷º6'¸¬‘îFÒNDå=™Ð‹Ø&‡-¬Ó‰qYrVû{Êôâ6n@$G<òëfn-çŒd#<¸ÈÞ8lÙYãß_Î&yY€¿1ø…Q\¥NSÊ›5jWÅã·ñ…ÝzÕá«<ì#EQÊ¿'¼‘#d¡y\Ofá §õ2áx.5*×@>Ô€àfÊÞc0Í…j=˜KÚ½ŽQŠÍJdÐ,%MßîU˜#aéÃ8ê­ó“¢Û>781ßn"–ŒB%_¤HZ·¶$úiæw… YÁ‡ç«¸ä톬vÒu>‹¡O^Må¦Ó,íiK–¯\pCzRÅXöÔ 8å¥ )2~N²ÅÍæŽ4àU¬V‹ƒ/df(‹C©;:â¦t óö‘â_L~TÈUF9¿¾»Ó¸•Ê¼]nåFÏ|ð¶½w¡[./ö°®5©Ò¸6Ï3þyâÊœ2¨Õ– Lë³:šà#$Dv#'ý¼(Ìúé~c«âèšÁ>»ßÓ˜Ätû†j Xƒ°„Ž¦×:pÊíÒÍAL¬õ™çfH-¯lUmªLåe îc0Î&™åIi»T̓k­ö¡ãD¦9x)«Yr_Íœgñ×döÂƽg_W¹ðèæ’õf…sxrðÎÀ0n$¯TOBkªVðV­Ã‰%ì$Üšº/ÅÒV%JQ†Ët² œ\"¨V32ÌÝG‡´ uQBbÚFYÔn›â«)ᕵ ž‚ARh綠æHŽáeÉØæz/Ÿ÷Óè;ûü$i¡¾n\Þ9Á6}&ü_¨*_;â £+8‹%L#…vwÇÌ Õ¤²¹”y9õ¸åžåÜ+Y¾º¿+T$þ–k”åIáWºçÂp¤F<ÍÝeñ!MËÌcü”EýŒ‡_÷Ürù,»úN£Sç=A”XÚ†w(™AX••ãXó«G¬ynéfB¼ì~¾÷칞D4©¾»‘©Î鎪Ç:]Ë8ò4[˜ÂÒÉtt—ï^aðmÞ#Æfر(á,f}¨ ( ÷ß­ï¼½”Ï'ð(æ‘{[GØ7’NS½:ØÇÅÔ˜¤Çm#ª9Ìø_zFÔ˳\”˜ij—ŽŸôó¢"}«Ô)Éxöi¾éŠ™^àé´Ä ¸iuzȦŒ M Öaò¢÷›ö© êÊ9Öª~¼9y‹¾Û¥ÒZž’/wF.H:K¼§¥<³Ïó¸­˜8±1o¤ê”ºâdªÑÜ˹H‡ÇWKè0áÜ!‰s¶>±ËÑÔ£3ÉQÅsv°½žQU¬5¹õøò˜]fܸ%–R[_5RígÌ-C¹ÜLeA¬¨îÃyV4k ‘Rã ³¢-0”5u:©qöœ²pL‹O‡}Ì^,Áæm¦Ø(”p*Te@¬}_ƒÈø˜s%9ùñ2Í„£OÞ»ª[·TÁvFÜ+NÂ탉’¹ŠÇÓônë 2Ùr©ÊTMßÀërh7 T»wÏzËþÇk‘‰ã’I“ôa^^ MzeUò×H¦ÏöëªDì´ÖJFîïàAÝ‚¼w‹Ú)¦.]ç•ý>óË<n·R†•O”å#bÓ‹úK‹¿ ·+èÚølÚîAÕ±®:8fò àm€«x–g',=dH¿¢°÷J27³FU´Ë‡¿ª•ñj.N#©s­×.êù ¸Cægß`éø½–@®OÝZDî!Óíi·zöÈ0°ùy-錒.’iv‹o¢º‡ù˜\Í™€þ®qÃ:튔 \ÇÙÖø+£ÜH~¿ ü³Ž~¸ qCl’ëíf­ÏûO{ÉÜ?IÏîX}ÍW0€£D\ú4•îŽ­Ê ÒÄfz×ïd†YFÏñ³ÜMEß­ÊHK)ÏÜ·²É²¨ñ¤åÿ–IØQCGÙdÀÃŤyëip%³ 1 0a½ n,-‘[ö©H‚¯¶Ã+*Ð~ÅrWÁGO營Ñ¢"ÖcÇy¿ïN­¼ùQßNœWÔ Ü\±YH5eÃÍy?Ìv ©]º±¾WH¿“ hLKO."ÚkÂáM¡œ½›Í¶oÈÙð #”©YRäL-âÞæyxIM%˜‘hRÂÕEèzaÕïú}èÌ“`e$ |dÆݤG ¹H%º]+Åš?y13*_WþÙŸCÓäø»%.= n.­–î Ù«2—›&®¬S̚Ŷ…dl{©påä(ɺŽs7S®áܾ>-ž•ù¢\<¡k²ï:‰tEæõÉAÝŽ 1cÏú¿b ÷³;~ð\ÜR8¸“#à¨n´åÔV%¼OÄT‡ÙjÅßho5+úêÖÁ[FmmH´™[F¬Æ —¤%võô¢â²éÛÅNå ÔÑ;vð7ОqVs0SiçJì»r¢R45åâþ]8š4]ÝïŸ0ýß]Ö¿w_Z>ž›ž?D&íŠhóhªü~ðéY\¸ÐíçÜÖkÑX*¥± ísÎïØùš­Iu½ªíymk¿¨ Ðfúª²9Þ9‡Ã2ÄÕ1±8ƒžL«ßx«ŽÇÔIÍÙ[i”,û”]ÿF†}ö#F°ÈVÏs=,îfʇ˜4>ø‡¾¿Mü·~.+cç¹êìÀ$ßÛÇ|¬†3­¼Óq8¦k^ù÷EYvCÆ­ANò É¥¤†·|ºÊƒùÆ&œ—vëŸ®Õ &”µRÍÇÆ›`šÖ~v´rØÆFöì9t™Œ¶6#]ôvž¡¸3¥5»ËV='T[Iù¦åÎpÄÆ»¿Ê°\.»yRåÞ?Ÿ«æÛõ̾v¯¹|·þÎ€Í Á£ìÂ`˱Ç;@fÙÝ!ºêEÔRcUѨ÷ƒc$¨U5¼"Ø0‡/ðN-aVvžå åÍŠ|ÈFÝÂAQ¢Á§U˜[¯æüÒ‘æ¨÷Ì=„‚^ =;.ƒ1ª°³[g 4ðH9yGùD̪§Ìø¼nšN-³±i»¦ö(‡†‘6>&º’d8t3ß-'¦›ú¬ý©¯%£õÎí9©aL&>»ƒÒöæPÕ‰¤s¢<•GÓ$î‡Z ðõÁä$$nÞ!pxñy•<¼TR*ÏàDÛ¢Íâ)Aóc@›8 ½)_”ðü›ÒŒŸÅ:Jk±‰áŠqÕ11àÁ½B弩XÑç§Ï½p*t=Nï½Äþq¾\'à¡ kXX‹Ñœ;ôÇXýfEoš¾ºµøÁBO®6áõ]Ñ:dÇ€£ka/^Ý›²—s–Ñ(šÜ¦Ë7×ú”ý½záâÞâ9þ´Î£0~z˜3úÍ«˜å¯ñÒj¡Íˇ¦ùð7©ŠÍ¤ÌµìW—ïƒà’/ï½½y¼0—xÀg™$¾Ë£$9ŸüãÒà©oÐFg“ȆšäÀ@ºRÁ}Ì÷‘LEi3<ü Jþédí8ƒ ^Yð€}Ñ$ɨY.;°žþ(ÄnPs¥‘Dy^„¶šÖÿÈ 5WùãÞšWª:m„b¦ .ÈÅ—ké…j‰DEf ãæ‹øqùzMŠ;»ýù}\8Å|†tþtÃ8®OOo |¬ï.ÜQ;òJê¤Ý‘¢ë¾õÎpzJtOý“Ãwp2¨·‰GG‚8_†<äk¬AÅÍ,eÒQ&žýæë™—Ã@á–Jþ< þõ{œ~iO§»¼7©;xѶòÕ7Õ4_Ea04Ç–£ú[íh›!c¢9Ž[‹)Ú*õ&mÅSðKþeç[_׋%ç<¾7OÇ ñJ£9™@Í&‡nõ„ ¥µÖáíÆ?ÎÛä¿?®zoªé©ô#û à]³#->0{kB¾•Ý_›f¶=Èioñ‰ïçtرkÉÔíô¯s@Á/Yû9êñojHŸ“µ;_.‹mšž°I§Õ¥•¾/Oè(D=~ÚLlX£XNÊè¨É­MÅÓK:¤:TyÕ˜ÀÝÈk!˜êÃoá§éÈ<Âsk,>á“õóiyn¾ž¦mõ'1‰Fn2Ö¾ º—ˉwöVh’”S]ñÆÍýú%PŽ½c¤mYW”Þà|mnÎýóSª1ÛWæ?Låò­6Ç^LáÅ~üQäúø̯õ(5ûÖè¡qÀZW㸘ܽoò——úœÝÃœfÈã3àè”áÀžþ”S¶¯~Ôå è£e“¾°*ØÏxD×rÄ°$Á2ÕÃófÚ“†‹Ï«ÅyïçÈË I7–#ïÆ‰á —óàº?Áœ- P¼ÆµE7é òèßßå >§1~ÙÚqìo"æk´ÉÓf•)ç§uYÆÃ߉ƒÚw*g‡Oë©Ã7Ö2v4ýºÔ•Zdh’—{Â[·Jg…Ë9SR`×I+9C+”Í; T©OÌXHÏ KWôëËêËï«uZ ‚ÂNøG™ÜLˆ¶4éJ¯÷?zã{Ë$¿–µßfi¡®Â|ñÎ~LÃÅÙ¸»Ä•–U·‹ÄR‰bœ1b¼˜d„O]—ÐPýáAjÀÒ,«WÏX3Yp7ÔŽÅ}ˆµ*A…”÷¬ï¬+ q{¸ä[è)œÀQë!³Z÷™+Í"³û’ãhßöºË±¼ö«˜{ËKßr„ô,+>ˆzª¸ÙVP¸u¥vP1ñcþºå¥•]QŽé!e,æºÖè6 ø3~õ¦âÅ¢7éÖF» M¨$j[Ÿ7É(§YüV®pðƒ´ý¹%[}‰j¶J°`v­˜ó<ûϼPëÝ`Gf ¨æTNƒxäK‹\÷³øµ`í°¶¢µÂ¥Í`øôg·—Ò7ˆxt§eçjb>Æ¡‹”g:2-<º%hº‰ˆÌUMê¾’E—16µä1›¾iú|ˆ"Tˆñ˜ØÉ*'&5tt—¿}ú»<›{Y ùŽùZä™AwY"[´2ZT½©·ºg?›6ù{ÿ×7E³÷[s.S¾7s<ŠâþNÎûjã±M%n빿©ÆTÑ£4¿m']²òw5^í4=†©YF‰1¹ÕŸ7äøX,^¬ìsº~zR[¯ô,‘7e~™ÁLŸ‰»• DÛ¿Ç…Óè¾2lÅðNÏëÊòü û7#dÉe×ö¸Î$ë&‡ë­³'æ•;ôƒA>§´c‹ŒLQûx¡ùw¯U>PÓÖ=Ì~ÏÑ\mÙÐ?¡²%˜ã½#XÓö`xdDù)Á¹Äçþ¶GùÁ ½`àk’»"ïÚYC{•ÏO;IO¬³¶oeïlÜNK-Ie< ÍÚ_n¬ä'ëpÁE÷TžÝz 0‡È’˜|yÜ3ÁŒËn×Ê4áÜ,`zZ%,ê{Ü­šTÚz—à5*|<8I( —ˆôN¯Q´j0æDéŸî$ÙÞD¼ÜL´I—®SËS%í²Õ~c 7”÷ô³ŒµÈÆ;S+°~€b“ESô’Å•6`€Vó$_é «*ã¶ú]¶’nU8]F,¬´KI`vÔ–¶ó þ3\©÷¨ÃÿÔa||7cîºû{#Oi.oÐœU. “fKÛ°ÌbJìÍl¤¶£BÔ[trýòÃÃEíVæIŒƒÿèê’+R”—äˆ}Ž›ŒD(Åü)?T•7Xü°ŒOv•-åsˆqʘz¾b/‰ îÇl>߈æ%àìÊubI¶[1—íIû˜*I<7‹ŠJi6™S®;¶d§ûÛ—²Ìã¶r{FŠ+k¤„¥D¾¶ÚŠµ c@¦øîI§Pwn‡K?ýÓvOÿÖ~‚¦¹+«s™óƒÑ ݇†u$“jÊW^²í‡ÂÌ–™v3wˆz´Û˜Æ P5_ÖÁ./,Ñ›&=P™qÁÇ!úFñÑ žuúÑ a2Nz;™Á± iúMQáß 2>rÝø!@Š´Z€ËÍ‘Xž8ö'T“3Ì] šÁ½>S ùÎà®<ŠEä˜Ü^²N%ÑÈúÚtp‘’zþ%FfyõýnÐ]‰¼ŽýS>àâÙ9¯{R©X††Ízo4Ž‰Xk8Íã=è©êY¹‚FW¤¹·œyC¥ ­VÑ{ò­²½ÀsAj9ÑY ßL¯ôµ`8—M`2Güd}ˆŽ†_0ATX~¿¬(®€Çúìk—øÑ*%ìª?—JTËX(][Ú_¤†Le°?Z îÍo½W3<$ؽaè*_²ï1!5Ö¦·ã ”I,p£s“»g.”„áÁ‘Âg(Úk4y;þÎO%Œµj7ï-щâžò~¡ôòÌ'™ÇÆ®{ÜúæÒª5j ¬õ^©Ú¯Û‚Üõc UKBßÍ´¼??auz­õ; ZÔ&w¥ñ¹B^â$>»±4Ûz%“ÝRùm iý¾µƒÿœ I¯ž!ñð/YÆ'É—·ßW ¿žÅnve¾Dæ—è«ùsÆNêÛÓa3árÏh¤.Q󺽿“f(×9âša^dzÊŒÉNtM`a‹÷Ä#8KD™N~?w!&è™I9coFN¯ýdq¶×RKí°×òX\¤qÉ2öÍiâ‘|…J!jãx¡hwám\½àÈfsZîÉÅ÷H _ endstream endobj 713 0 obj << /Length1 1836 /Length2 7533 /Length3 0 /Length 8618 /Filter /FlateDecode >> stream xÚ¶Tê6N—t£ÄÒ¹tI‡Hw ,°Ä.,K#Ý-RJww( ’H Ò‚H×·z½÷ç½ÿÿ9ßwövßç™yfæ™÷À¨­Ç#g ³+à /¿@ACÉÈàçäåçÀcaч œÁãx,†`¸;•øÃB!˜"4Ô€A<œ@APD(*ÁÏàçÿÛ—(‚w8ÄáÎëqþY#ßOä5+Am`..`(Âïg~Š8Øyï>|¿›ë…yAýþ>ÙA ¶v?Ë°õpå3€BÜ<ÀªŠ¿mÞÿ0{0 Ì/. *"»ÀÞ6|?èû¸‚‘ÀŸ0²†'~®0W€² ðˆù…ççòpð¿?‰Ÿð€@€-Ä°ÛC xÿSGÂ`»¿ÎÈþÃ!Þ3~äøü??ÿü²@N˜- êìó?ó_-æ“×ÒWÔÓæú]ò?¤¼<ÌàÇ# àá…„…¢¢€'ÿúç þ.ÿª ‚üNïIU¨ þWÈëû»ÏߣÁþ{o8ÿŽ  C4Àþ¿ù7çæ·Aþþ?oÁ/—ÿ¿áÿ©òÿÿf¤ìáìü‹gÿËàÿÃ\ Î>¿-í@.‡ ¹"ÐÿšÿÚh °-ÄÃ忬*„\9¨½ó? qW†xƒmµ!‡¿æèï> å!P°6ÌòóÍðùùÿÃ!×ÎÆ ù®¸#»õ‹#·êß!• 60ÛŸë' ,Áá ÿæþ9·2&öo½?#ÿa~Ü¿C þ‡ü#–ð¿©?ƒýGòh"È ]‘O*ô¿$òþ‡”ØøŸ:¿ñÿ¦%"ú'ñ§’øŸÄo© „I#~--rZþ>ÿzœ‘MÛàÍNÃl$ÃÂ:Îêäîyñ¬>øȲn”ÁÁã7 ïô¸ ÄNå¨Í ù ?‘K}óšxaU‰ýXvŽáÚo§µ ;²í™Nû¥ÿ•åSÝñõv¼™1ÊÁE;rt¸´<ú²þ×nþ†ÁNè­¨ÝXòÜ<ĵ ÈμúU¼*æßGL¯ëlÔŠ¨Ý¹ª˜à‰7ˆ3.dɷΞ¢fÂBðÐáp’xMŸ|$ÍýpËðè)Þ“ÝxÁb?Óe„ó)ßÅ*}÷šû4¦ÔtèǤïÇYýä7ÓQ}ò++^*œdL°s½U‘1;ÑF8yd± Sják€ßGÌxkäßȧîÊÃøSFÞÂpT$ƒ ¿{åîÜ;®RаUæE`57Ñ÷cö¬"pyèÀRmS øœÏ"h6PþB4Np ›R‚ÕC3ßB~ ÷˜äNÑèçåkvÒ/Qh¢PT •µø0L9ÐJœ‚ŸùV>ç-6öðôzÑOW:qfÏ:[epµOÎ¥Xm$W<°üy²‘~nmhJ;Û[²ÅžM"[´ŒŠ}›K’¯‚Z³´·`wñH(lGlæÜÏ3EYãGÁYàÙ——L™U_1“·½^xV}šŒ¼¡6ïÜô諸 à»<2vº‹ë„‘@>µ5 ¤P̉Z¢4{gsu^}̾÷M’bÂ+dEÊèZËx·ŒÒ5Èä kžÒ+èÓŠì3t›ôr6UŠñ½”‹nÒŸ—ÁõKVª…$r©ãØö°]ìchÚz"3Ë5‡ºvmeÔ+ëRË]j‹t¨!÷äÅ)mh§£Ù$ÅÆÉFÃpdGk±â­À™Ä±©üú ö³MÈJ±]OGp³™6®JGoÐÙ K¼oñ˾ºã]loå¤ Í•±¦¼Sõ=}^^çs?½à>¿éÞ,/_½·ãˆ˜`&1öñüþŠt¨¯ôÝN"ñSÍñ,Ož¹ïž…ËWúú…ŠœtíªêOr[Ühë¾”Í[{’>=¡ó |Ò™Tú%1ºóÀÙbŠ~÷ù8Lâå˦Èí"¥g±ÕùÒ=³D¹Çi®O¢†ÌÒùˆÖ•tG$‡u·â%S™EØÊÕîÉ(0ŽHKÚ;ptMá«€Z¿áŠCuÊ{¤Bd©6"²ÙɤæP£â3ïùsEp<™Ò|I.ÀZ^oKŸææbsõ™yU•Ð¡¡e³o]ù¬zɥ׈A—3‹Æ]ûúÞ߯؆!ÊÎÇ3^ˆ¿æòõŽ…§V¤Ìáb¬)é‡è·šÌªû5l¨æâ ^o.ûµkÐ]n0Û¬¶;!Õ»ìkï41iP}íŠ ¾×ÆÉu¼}j&ó4ðüíí“ôÀ¢šó<ˆcŽ¢Ç•Jªì’5̈>&:_íèÛ•™uítß{绸嗷pN¬0-PÓmrdóEa h³x Š¾íÜnýšêÜó´Zß^_Þ~ö±][˜y‘QÕpâ.AµEû¯ƒÍ™g`é{'çš­áIŸRÏH«JNÝÊ€3z¼ï¦ ¸;ø‡£¥VNK-ZÞ{æÔL»`›žîç½ÁϬe¸|Ðidè`BĪ{ãWÍ(8¿Ð±É¶£ ¡{SŸhŸçTdJ=W>¾Š³UwC™KÕS~wde‡­G6Š8H±"ØìGx ¡¶˜dyri9Û¯ZÔï–C·F}3ÂoZ&ï·V”O`;½Þ‰%ðè$­fMú ªû'zT­J4n#ãSbÎø U¯>±äpÝæn5—™P’ü' mj7Ž›P€¤h^#ò(ôp#4½ÓvÖO‚©eãK‡fêë{ç•'Ùüâ®´9 ß7äËsgùM-èô/ã§ÈÁ’d?Š.A/jEðüir§è¸•H‚óš/B¸Þ¶³ÔYÊŒ¶‰²s܉¸ ÷¦PyžråöºOçú€ÌyQ‚ª·ä•ÛÞ¤Ï7Hî‘¥Va†èù 5Æná:v÷mj;©·Jü8í½–Lw¤í›JûGbSê4cÅ×%ÅîÈÎ}~.ô¡Šu›'‘]1”ŸÿåAÙ“6¹YpnMÚ‚7MÜ"Ûïˆ^£À‡ßËï@ðÜ KcH)®«¼"Ïãã µŠ:ƒ ·k¢Â!™“"Ô—©?^°$§ÒøMù,f )£Ð\1IàÕÌÍnú¾e™@§ÝÃÁ9+<Šë¼iß3²l¬–i ÷sV³U-g2++Ø ÞŽ~;QT‰ÔÃê×¹?äŠz¯b*¬êöëY]ö“âV·ýT|™6‰ÁÇ%vT¼"½`’Ý‚v×8‹«æÃØv]õÉDxWtW¯„U¥1‰FïÂ.a~;ii+À;®ó‡MW…ÕC›§kžäLY\cèŒö« ètÎÄÔ’,N›£­Ì!q/it‹ŸÌA¹˜”½’˜»lÏ–£í*eW2Ÿ{Î|©Š¹1½®u¼£)ß`ZL~Àëó rl$Øw‰+ì7|Ÿ …LòÞÖ'“+‹Ê«Cë„bÛqîÕ“úÖâ+Ä‹lšæ‹(-P»óºžÙ6CÓv®ù]L•hHa¼úÕvÚ·É7!^rÃÒ~úŠ¢m·;olWvýžWãLЬ!(¾‡j¸’EäAæ‚ÙÉòO¹Ì¹©\M-Ä^v÷´V{Ù8[*Ýݹêy5¤‚Æ|ïüÓäÇúÞ×-¤ÛÕ/X˜ˆ’rf%LÃCunŒF: ÃàÇ'ö¨Ë¶âô=¡w9ÛµM]´ hYË1ÖŸÃ*·äÛ¼1ˆÀÄø'²@]-G̳pJœðsóÓŒy/ _ÊlÂÁ·ŽbpsóÇ?É$ l‘6ᦤâ»n½W ¡%Ú\+¡à­r R}V³l#d/5½ÕNµ6/¿ÝvnºcÞ&OA_.ì’ o‰ ¢Q*Ì £°}L6àUñ:mÒüÒP ‰},€OÍ$3°gaeYOYn  ÆÓ¦G5ßýá•‘ÅL*Î"žGBu”i¦'8Ic/ó$"Žk5GýIÙ£}dço7 ;ì~ w¯ÆÀ 4.•{ÜÊ|¶kt1“tLEïʼvÄÏ2|r’&€·áŒ§ÕälÍ®l"6¢Brñ¹~O¨Žw€¬GˆƒÒ`Q&UßLn-ë÷þM‘*¯^Á;é8Xωzá`¾H:ßâ×2­‡5`¹•¢HŒ¡£ÌÄŽûëxM¢wŠ{Dš‰hMÖzÆëzÒÁ›¶d0›¨4Ϧ 'TÇg}Í%Þ³µå¶F§n?Tmœå¨e3`z ’õnŸZ™†.«èZÑë§Ú î>ìZÉþÄ6VÓ%°ªXvÊæzY¹D³²DLâè¿Ò*º[n¨©åFDòÈ~ Kh"pok¹Ðïœ)î+š&Î!öâ£os3¼[‡G˜è?–ÇT`f'>džõOyU³õ:¸’†Ä‰)G šÔm¹¢šŸÙy¤t¼+îpÑɯ·£ïsW9ÔµãØÖ5Xé—®ñ°~€ñ*t”¦Ý€(õ#¼·3sõ½E,B–SŠS¦ymƒñ81‰w×'×BÛ!Jsz¬rHöÞ-¨ïÛÜ„Ì~¿¡N#¡Iwè _,!év/ÞKã73£kí];p6¹Ï®`2®ww­L°¥Ý"FßU:Dl¿Ev™'tRV‚ ²ÖÉ"oqBRŽ/²ô[Ï Þì}³Œ íø8–gcœÍ Zõ¡Ð2-”ÐZ»™”1HH©,Mêô•T†ƒV*ˆ1JŸ$ñYdò,)æ²ÁiµÖtØbßÖ«žÈfà—Ïð2x} ë:>0x0Z¬è¶Q¯Vò9™5ÇC|ëcÄ-sTQJâ3 ¹6–dEݺ“W°ãð60Ìfí“eÎÛ¢òS´$FMuo?:þUç:h¯%C×'"—`ÞtNb*¾ÏùiB×Éãàsè'_bBÆw|ð+ƒ¸´©’}!Ž­—Éضý#Ä­É7Óø;@¡ã&>ãËè—î :j~¦} ¹Êªæ¡c0üùJK²sº¼&QL™jî·V}pÛáÀâ)~̆ Ä^4 —'/n*ÖHe ½P¾u˜,žŸä3Š]ßIo9ÙQný œœñ¬‡G§HɨcLQ©Áw\Ø=‡™WKH¬Ë¶SU/qyñ W(œs«Ú(%0'ó3h©ÆÀº;ËÜB©ÌÓÛ¿OFÝ ÖP” US4yRŽŽñNa‹ö®œS؆ö]ˆyaãòfß=°bʪcQÃy ïïUð?µ {ôu J(ßá8Ó÷T!%c82%8v¯¿úî¤ x3z @Ìü÷³,#ˆBƒ!Âú»R=ÿauo&Ú¶L­9`ÅÚ¤ècçNä©jh‘ËÛôc^Ò!+ošï\3d!ÏÜL%0WëK¶FÔuj’ƒbµƒ%rYønWæ0·²¶CGL ¤FÐ)8å>ôø蘚¼ïAœ3gž‘¡!~gžê²¶ŽØuÐÕktéÉå@þ”µµ îk’"Èeàú‹·]ã¼ÚV Fü#ãlGüÓ (£ž—^μàXççc!{tç‹tŒ5&éé¾™ÓLï®C•?;鎋‰BEÝìèWá£Ä·Ã,;°˜K#¸T£DËÝ.çQ·>lŠÍBh€NßÝA1¶¹åٗ鵡q"%\ÑyÞ(fÅpûA¬ƒÂ’3üê<Íjf¬}hÀP†WOg÷ð …!’ ¥l#¥NÙæ…”}Äö£©/Õ†Ôð³Äñ ‡Ó¹•ÏˆÏîÚ‚§0«Òk"‘Â%ÁDTžõŠN‚³FþΙ·‘K¢Bê7ßÒ—i€œÒœÁŠ*ÍÂA‰'XÝ_=¥öæ<4”à–¼ºîNï^«T4¸.zŸÊùüF{;Ó3…³ØÉGøEñRd#^¦Ê{CpÙožååX­ÒQY3Äð¶'ïÖqðcYmkiŠva(½¦·Ù‹“;ßÆÊ¡?I´?Í阰Ç<‹3åÄ–ºEòm}Ÿ½ÊVß;D¨ì[ k_e{qófw&2Û·cU†ÇÝŒ)KÌöì£]KxɞʂhµÖ3,ÓÆpÏMÔÐÕXž¶çËRNx´ÒÏè‰Úún™}ïoMi…“u-ãQ‰Gï–=÷kkmÉ/"›óÅÞ"%måJ6育…3¤{°›¿— Ü¡m´Ñó²ÎªN0À•`k·Á &¸“ë¾$d )vû"Í“îÒ=’ƦÈwô_uiŸ¹3–²h\=¯i¢°Ê ™ð«}T…‹ºy“"x=ct´¯ÕX°…½jÁ™ÛÅxGqÌyþÔCŠC¾`ooáê²… ÐS¥÷|t] n±er^³`µÆkSÕßl%+<åšMCîÿYjzØ]wû^/âÍÖL·†Á÷Ò“‰‹ ùd6‹rû@7S·XÀ–ûãÃñºZž&„9Ë7eÆ\íµh¯p‚ùb]¦q ëôH£.œöO1Å fæš*Eî¥FÜÉÀ¬àŠ®4µø(úý:šˆ5VoGÜ×í5I šoˆÂ…»o¹!±Î"S”ÕýÁÏ ž¥%¡ 0¹ò c…öT™#û¬.÷÷9(þ!(ŽŠÍû럟_U°vH¼V @§ÊÐâËnF°þÒ»cz¿ã¡pgÀöì#÷FdÜ‘)&ùe¦4•ùm}_xjȽw§×=v©ç´_íkŽ¾í²ÏäûcñáIxP^ÛUHFPµ5wL\¾‘¨ØKU¸$ w9aÕ‚?®µÊ¤ž×©qÞÜÝæ+VO2H Š—k§§oÆtØrç¢Ϩq¸^uuîP ½TÔÈÐó;mìEÅ ¹ßR=µóbVÖ+†ãeðI¤ô ‰êÂPÿðY½ÉBÎÊ&·[8/­Éˆb‘s_-¯'šå_»ÇèQ×úš;ž‘pàà7ü˜ë €¹®¶üûîܧhéÌٽ㵉ÅQîÃW Ã4§*ôïôÉŒ©ùÁéâQwà‘\’ Ï·#t•Äö}ò5 Crì(’1º[w«p¢!¾/Ѩ#é)r“ë ’ ¤V wïm/•®ª­|¯ñ Áìܹ±qDQËh«îŒ¼ }½!ÎÚ—{s? ¶¢÷Ê ÕÅ>#©«Kìüý«“†ñ½E¥4rcë%º‘öнgen3ºËÇ¢¨k]2Ì\ ¨6a'‰e=,a®yý^ÔSŒ2à1êù¡ÐÀ«®AšgIµûÇÏMEœ;á™r*!´+&øV/Š _ynè;<U™­Î ¾.h&ãáOg܉3›'¯­&×­ê«ÝbÈ]v+! •I;± Ÿ VM«­6Új§0¢ÁÕžÐ6cÅ!Ç’óª¢r’›kËèY!ѳ7Ô•¡iS'4 ¹5Ö *²7÷f²1ø×¢=è›Å8ÃjfùŠÚP°.*èÍè½EùñT×òâe¯¦gÃKç¿J — aHõìS&iúûÛ—ÇÜ„`÷Y4±Óáù ¿÷Ž™Ç¯´iÐð6f2Íñæö#Jév”öé\ ªÝi „»wÿÐ9¥`¹Z‰bÇJH2LÿÆüÔáü±é£ùô~©óc¯§‘Ùg ÕY&%UYDô¸83ß^t%/òTeãÊ™zòmœáÔµG8Í—pòv}é¯óš‘†‹U“Z)P­*·õà˜ŒÊÄ Ö/e®ƒ©KMB%·åèïº] iµCRõ{+<Ìš¬©hLJ×ÄÅ¡@2¡¸—Ÿ­ï·úìÌ(¦<ðCAa-¯*Ä4¼®8˜RVãfa¥=5grM{™QO´]¦¸ 0;T¾IéVuˆ†#2vA6úþTj$ñGE³/«‘ÌxÌIm„qb軚äÁyÖ.oÖtêÁ—²w—B*ím.±×…·[Gé)÷ƒµ«ú£hqzWuϧ6¯È$yfI›µ¿ße&¿Tiyœ©ž™±€“AÜÈÄ‘N-ÎÀ>/¦W” %1’ÃH·¬)Z.Æ5?ˆu¥buSè¿Žï ÷}Hn4CÎ;~Ö)-`3gÀ6Î%K‘X–­b5t4Àáä4ÎÄíW¤pT¹DA³â®§yBäÚa¾Ã4b4ƒÃŽîÜTµVªÍŸ2ôÜÐF•%ÝeOV{Á‰NðÃ3Ôl!"Ëm¯»x–å\ú|™ü®Ñš‹jäbU:j;$df—Žy§XŒ¹85:J.ëb"÷G@*eÔßi.߃Æ>ÈMRI‘YW›~îq˜ÑNjؘ9&kl$ »þtØóŒÎz®LY;©“¼ÙMêô…,§ÇÀ«ŠZŠ«Áæ‘aÏÙÜÀ\@½"§¨iû"êÿ{Ií­ endstream endobj 715 0 obj << /Length1 1615 /Length2 8740 /Length3 0 /Length 9804 /Filter /FlateDecode >> stream xÚ·TÓ?NIŠ¤ˆä@@šÑHw‡À(‘0`ÔÆ6én éF@Bni$¤”$%¤»ó‡ß|žçÿ?ç÷;;gû¼n¾ï½¯ûÞÆÌð\—KÆ fQ„9¡¸x¹¢9 ^ äçùð™™AP”äo9>³>„ÂœDÿÃB£îdò`Ô¡Ì  úÊÀËàå|@೿ aQ€<ØjÐà¨Âœ H|f9ܵ±EÝåùûÀjÉà}öL˜ów€Œ#µ;4À([ˆã]FK°@f … Üÿ+«¸- åáquuå;"¹aI6N€+e Ð !ˆàwÉM°#ä¯Ò¸ñ™ [(òO….Ìå F@w¨%Ä yçòÊÉ ‚Üe誨´à§?Õÿ4àüÕ/7ï?áþòþêô‡3ØÒæ;¹ClÖP@KQå†â€¬~‚°;° 궸3øãè`€¢Œ6|Wá_õ!-P8 É„:ü®‘çw˜»6+8YÉÁ!N($þïóÉCË»¾»óü5\{'˜«“çßÈêdeý» «Wp='¨ó+ˆŠü_6w"üe6@("Ì/"€8 n–¶<¿€Üá?”¼¿Åw5x{Âap€õ]o¨5äîß vPˆWoÏÿTü7ÂçåXA-Q ˆ Ô ÿßèwbˆõŸønþ¨ÀxG?^ð÷ëŸ'“;†YÁœÜÿ5ÿcÄ<šºšŠò²•üRVæðäâçpñ ¼@€ð݃÷Çù§Wÿ‡ô9ú×éþ#¢Š“5 ð;Åï*îÚ÷w%.Qƒõ¯½aüw MØ¡!Öùÿ(´¼{ãýÞ‚?\þÿÈÿ;Êÿ•ÿÿ{"ÅWèYÿ4øÿèÁŽP÷¿,îý u·°»qú_SÈŸ­±‚¾rü_­ |·$2N6wDçâà ü)‡"¡n«çP”¥íŸdú{w9 Nç0$ô÷Åsçþîn÷,íï.äÝÌþT‘w‹ˆúc¼¿1änÕþû N–0«ß;É'(#`wü;JÜ!A€'ïÝòZAÜþà<€‡Û †ºsÜÕì °†!ðZHÀ#ÿ[ôxÿEÂÑ¥æ?HäÎòù?èÙzñ|๻,ÁÿHx‚è@!ÝÀ»DöÿB^>üßhwyáwüYýkq'º#ê?ðÝÀíø_í±|…@Üõï^ßõîoüÇý¸A,ñ§&`–bAv•AMgå2Ô®\+Câ÷vSÎ ù¸†òLqQ] #f‹qºo3¦ÕŠ§>ó*šÚµjÊ:ŸeÎMz.WÑW» œpÑ+®ÙÐ[ÄLÜž Å{žÒ0NÕ£½3H’¥-@t¡=§ nÓ²²éÒe&òzZÙù=Þ•…¼PQX5¸I³¥­¼0C‚æ™þÖOTƒE/hEðˆòiÖOÇèÀ¥È—¯“5ÓÕÄ[Îñã\ˈzúzgH>Ó¶Gø«º¬ì1… HÄziäpÊôgr\e¸l¦‘zZ(‘IoZuϳ%UjØ.lš0°&´ Ûš'XGònyœÓ’ÀgÈeSÙ¹«áV?2Cé1ëz$ãO‘ú©P厹?iíUCƒÕܧÇ:‡®^©%«íbåÔˆ“¸)YÞò®anŽr±Áh|ZžD²¬ÀA‘Á¶ám˜ÓÍäðvæ„5xÌ€ÏX$Ŷ $ù~æYP£Ÿ! ??¡ 4¥TïOͯœ|£O›œÃ–Y–i粧(ÒH…ª¯´¼w»¼<_ª-S+"å<\O¼ÊÜMÔ{aùÞ=š·&IÞDÂDô™6Zâ(¹_3~ü±ô9옮#Æ ­P3»øâÈŸb°Ö„ÆïRèy±éq½‰‘ÐćW{Ü+zþPL¤ÕF¨'§‹CrŠóv_²1YËOUÀQ8p­Ã_;ÑÀNÞëÙ‘CѸLúŒd1újå«F²–4‘­7ÙÖ7„äÚ½ëqÑ‘M2 G Yl£ÔcÛ÷› %üq¹Ÿ}ø•±yÄoCMu˜!ñ€Þ¸ÅŒþÖâföpO–F?oþ¢; §öÀ€‘~û1ÆríÛôŽðÁ:ì…"R+–-(!y׊ï Á5RóÓÇQeÉcyïã=Üoc»Œ4mWWðÚ½( ´)|€ÝÊkÑÒ¡Zö2o±*°ðekw5 ܵ4fÚ%ìU¢ »ŸÙà“¥Ø>Ö­ Îa¹çëM ¿áÙ°ž0€/'Ìð»¨<ô×לtZiÍ¢ ÒeUì^I±‰PîºglozRÓeCtßÌ#ù¿FGÛgsšFZÄ¥íyô7à‚ úƒÌd±—6Èî‘Î\v]ðîr O“Œ¢mÔTòõÁaò—ů1[Ü$û¬'•«.ŒéM@ 'ívi:½á><—ËË€´âY‘eÙ8xåQVú[eýÓ«Z†Z?1+œ\P>Ñ” (çÒ… ùKµhö™ 1¯q #ËH=íò´Gç]»$ÁÎÝB+¼Q* CjÄ,ÁRo㧱aÖ µâ{vjWoF™ìëNæ˜ÍŽ™LˆSŸ-q}Ì^ydVï÷¥š9O}}ÎëùÍŸŒŠÜ)ûõ›ñLÅiO Pó@“5vÈÏí잯ÕG6YÂÚÚðû ß>[ê{¿pqºS3/)åO6½\ ÊþÞ ÛÑqM]Å¥K‡4ìâóà½n\£¥i§¤p¿Ü®à”ŠZ6Ì ldö;pF-X_x·‘®'°•‡ˆ`éêŒ&º?"Ï@VóÙ%j™6-63·ÝÖ{Û¼à)9Å“]RöAÎ6¿b.ñ~ÿñÈê—§-…€d8i8Ž©«üû=iˆö‘ՃϘ`¨•Ñ°é‚tk.ü>”_Œ¦Ò_¶«A†ryI×st|s˜ñ£šåúª>þ‘äÕ—+lX"†¬þKÿ…{žßÔ86SªÞ ø½_¥ß[Am¾ü¢”oë¨{Å”†=yÏn-õU—c ±š!4Ï^£‚­üüg‹47CøL,¡àÅÃ[‰]ÚADê'÷e¶¦ìíÊjS^/¾½v%«¡ÒØÌåçd¯ùî"èÍ]”ÿìý£ò,F!pS5ɈÑzšw ¦Ð>oµ@àŽ™~9ÅЧHœ<Bm>ý¯ö²qaÝ7;’®qs†â?•¢Ê»±Ü\H›É¼ý–¹˜ÒÓ-ÈXk<ìåµu,PbU=Öíòê?¿µ'XÖ||"ðq[à<õh¾jæÖN†=ÝÜf$T»¨¢õý/±~ÿrmB=ú 9¸ÅÚ ´ØY§Ú3È:‹¢1k~ÎUðyÌù{©!Ê(ZøvJS£ÙQi0Ɉµ®ÁÜ7Œ¥Â¬ÂWçÀÙÓØ({ž¸R–2Áãû_F ÏkÆ¿ãùWpÍ«é¿(²Ø0Ì4¾°£T³¯ô«d0ìjSi©={׫—\~’¾Ðu¸)Óô:ܸ§†èuwß^!ƒe°f2ÂaÁüôC^&ô€2“ÔåUjÿYÍR–Dª¥q=^éšnžgb=Ã*è_=˜Þ·øé}çQÃÀt˜´rs^ȦÅsǯtõ®PVæ©bg¾øa‘h_veTásûVkWº“ì–[©Ûœ‚ùÒ½†Íé‘Tc¦þZ€jícºslú^j{pp¶1…ÇÌ€uJ…iò¤µ û¬±õc R þQ6æ¦ý¥ÄñÎE¥µZ¬÷Z_r½`ˆ|L—¹©Ú‰¯ÌFƒÐ>‰©¡Õ<ÉõQZ¨{óH Ú“nQžJh»æhÝS^…=¡MœäÌÑ3£P.[ÓÓ÷HS®tUWãdº;N8-™ø€¤ûëiØÊý•}~öI»'oå7DÖ"˜F½2êÃçûÂëo¨Ö§ÕãÅÌ|ñ­´“TU˜j“:zY¿SR8ê8¯‘æªSÆùXOc>ãL*ªúùÈŒ÷"wÔÇ@ðió.ç=)Þh©@\‚à ™±®ywÖ€%uô†¯¨OÙô˜»z1¤;[kxm‹¥GØ).c@äÏb~(4`ähÙpM'M´G•+¯ÃW)€•±éq_zä]wóŒŒÒ)Øéßó|Ëûúw T‘¨¯~="èn æåá7r¸”¼ç5]‹Âɳ“µZÖ—(õ˜âŸnM¨ú4­W¶ÔÜŒó›_»dßÀz÷5ô ŠÒO¸‘q¡ÖRSÖË?Vòy¼ß ÊG Å×BñÖ8|ž5ÿd‘¶Ž–Õˆ¦²I1LkÆööEêᘄXá.Š0_ÏRpkPnQ:"Ö%HÜã¦.?Ø*“^ë{Ý¥ùžö›.@=b;úÛm•Ož5)`À)»rz"ãt&ªèëð‡H$açTSTàÏ nÄn9&Ý¡‚ñ.̒뺭ãk…þÍI+шÒ{D #Lù²Eê<á1¿Dëe)Žs“,~JÔ™#C¼¯„€&Hsü¸£D¯´ÆxÖ ¬ùÖõ=ÙÊk.û¦O ™ÝIöù‹G—ŸÔèJ#f¥çÌòdž®N¶½hm#ÅådÒà9ŽÉc~Œj‹‚ûôï•î½&À6œ‰—¹q”ñ˜:þ•eÕ¢)ƸœêC‰=WØŸo:I~XÿXNéý¿xÍoYåo>Ï{‰Ôpv„ˆÛdæOÇzÌÍ—[ìDy0¡½¨Šö»½Ñ{ÏÌ~!Dýòûa­ìêbüt¬xßÆÊóH&8¦ÝG¿¶îu×NT0´pZš§Z4–Yw5hÖËïêßC®5¾µ öÎÁÙR–ÛÀÙí;§KåÁ—_\|êÃó„B>/ÝOÅ,WFݲñõÚ«ƒÛ3Ù²<Ôá ø&7Œµ€bÚW7…cg¦žfêEý œ À²O . ªfR(ŠSTŽrDc›4—ǯ5¯³Mw`2»Ù3\Ë¥Šú=[ÿe6ÄõÉÛÞG}Xú×vIa¿’ÄgÓbÛïlöeé P<‹ÑØ3i¤é£37¥[îØ\¢MJ­Ó´;veKŠä ™¦o„œLàÝ@*åHë„êܼï/ý,íya«¾¸¡«óX~í ¡»œr¥Î‡,!׆d›*¹éÝc)Xˆæ—?j;¾Üþ¼ÔÀÌ]âVàR[_ÇJË2¬Çå†bW|˜h0¸w;´ÇÎ ê•É¦'f2ÑX~¢©a@IÁvŒeMêa`0 —l¡”Ú<ñí’ô³†ØKiõx0(ÙDE°EäÑZö”Š½ýTO,„Ka˜j%8ö dñs¶Up¹¬®õª™/¡E²xKÍÍ™¿3ዪ€öcúzÌ7¯aƒIæ0`î€ÄªB¬tYc÷.Ÿé¢*_4‹•VY²²6ý|`¶jL¬ìô{Ïä» oGƒŒu®ýE™!¤9ÒÂ;&3rêºY/MnlâÁHÎ\R k "ÒŠSè(Nv؉˜³}©dn~¦ÉK«cb;è5Õã'+sN«;Þ]:”»ÇX|ëÒQlwC‚%•’u1Ó/C;Z·*È]ˆm1é¡Sæ+ n®”rh­®´$']¾A{žzÄÁÍý±Á…â}󇊧'ÖB<$1~æÚþ’gÅs{}8–>”M=ع´•/¢ÄLò>Ôôe³»Nc_t4ñÂ麃ÉR×o“Z¡(.³˜þsZ:˜!©ÖgYoô‰ˆØ}ßwÕ·‡H,Ú,Ór ¹½œØjÿY©óµÍI±(3“ø&„ÏÝ_Våø²×<¨+‚ÎÃ5!¹ÂJ6oRοP‹ËJOÀÙäi¢»º›ÌO¼Ì˜Aò9;îÜHerÏW«½8ó<>5‡´euDhæìŽ/`·Øo.|¶ZpkW±Uè ,Ë7‰3A@qmÞ„;*—Ûé|³KŸæ‡b¥Þltã•'ãÇY¾ºvoÐÓñ·_ÀŒ¹ûERÓ÷šºxп5$È«ÉðùX¶~sëºÇÜð†£§Kó›NM{ÖÀ~š%1š|jÅU™Ê~lŽ+ýí†-sAAí=ÅÂóÝÔÇ÷Ïf·+©Ð1e´²XKC_¬+˜Yg.áCò?”ùXî¥pÁà Ôv}Ê_[,ñ3H¼R8Ô^OHÆeÝ”«²+ÿÜWw1?¥²r·$§Í©¿”©¶ QŠÔÔí ·ìæ»jœDr‡Ì. ˽1•“Í^ŒX+'—˜EÄ ›'g88då3™mMÕ„P¿U[KVÑnIŒÀy“N÷ L£R?$1î£{K/¡6{+¥p¾ªFžÎRÅqø:ñ’‰Éx2’ÇmÎß‚¶ùÓHï]‰sà½v ólàé ÁÇx=‘îž.X ;yŸæœP!ÿÄÁ¾ÀBÚI›ãp@L'6Ò)3î5Ÿû×2Š ©ZoºOkjëßÕôAOŠE¨#3á ¢-®}o3‡),I â³:K:%TŽ×_¨ö˜ï}I0dÓqÛ‹[Áüì†'8Ì=m[ø·Q^ùñFÖ°òƧ½B5ÿþRHý®¾¨3Ew¯­»Úlõ¢˜¸ÑmÖ·à+ŸN¯ƒâºy¼1²#¢õú=}Ù®Ìg‹¦žÜêËe‡f#`Øù+^þ¹œ¦€ÚËÚÙƒU)…'û:N#§‰Œ‹öOf³Žâ¤u³/¼T Øn”_bQc“{s&Œ¸èIÉ‹³ùõ'íšä¥_çí$~Ú‹+ù9·®ô­‡¤=þZ]ˆiMEãdÑ=-M„B€GƒÖ«¼®õI–„¹U÷=Œ{±(B²!û>:hζ¸ÅybFV:þRe˜a:–Ò__ba]œ%¤’éµýñò ônÍû”°†_XGÒ#ò'}•¯Ë”#‹²Ÿt©÷Qê¡"ÃÀä¾0¯¯£-ZtlóÎßVˆQxIZY¹n•ù]÷"¦ ¿¿7[í’¸'¾æH.Ñz¶"ã=@ùî%Á¢»)§„›Yd{±Þ½OÑmóï„´pCíd§—D¤‚¥‚~­Èßû…KcüæÈ]>aªÇÑà½Ù“8‹ðm’—+‰ŠùÑÇN(ìîF6sq«¾Áù{e¤YVÝ¥›·)~Žð`cc´%ÁxN¢QÃTn‰‡Çìµ»Ê_ÍδÅ(y]Z~ ôªöã‚ÉV†È‹$å7VöpágwñºE7‰#® —0¬+¥¯äÞåF ;–©cGe_¹Ø ûŽúó¬%êiIK6ÐoC<D­,¼Š o“ý&þwóºÌ4,õîQ¹Fry xçKõï£8ðd\ªåâŸ6h>Æfàå*-Ó: BűnÎ4ų́L@a©>OS\Êh/¥´Ýñí‚¿eæ-&ø¶¤xq•[ªcUƒ°H²v<|zIH02n©Õ/¨B„Çò?*q¼hëÏ’¬˜oݨÇegð ‹øø†Æ&ÂJz×íçÐG¼Û=üÒç±ÇC&—NX’|~ê´MÈ<î»ÿùFö˜ì‡—SV<›$oÒ»rº¹8fç^¶.ò‚•ŒŸ£ž<=YiixÍ®”£°ƒ««úÕ ?q ˆJ“PëÅÏaDðùÏ%†/°ízŠ­<Ƭ@ÃkÅ‘N®³¶l,&S£‹^Ðh€Î‡n,Á[ -›A9'°ˆ{ ßWÈPÞ ŽÉX]üÐò©îK€W%çä¨óÈC'u,Bß³ˆRá– eîb®÷ó¥Ç|º 4ãqšÓ—”xò¤3иê÷cµ/Úæv4u!ñƒ·äÄ#ï1°^]‚'EžgÃÉÔg–güéùÝÛ%L܉| Þ2R·,ÄzWR¿ÃK»¨zh#Þt½®^ë¦po—–sß .'CYû§_7 –}{q{ÈUίÄÐßL‹,†€DñzâcO|טÀ­²±d£þö<oÔ_UO:‹‚„®|ytÂf7¼¾š°úÓËêÓ«œ3‰j¥òý€âûƒÏ*Ç—v2"+´ÓžP ""ÆÓ^±›ò9„îeQøÉ{2÷ï¥]`fÔ|K¢±Gœê´¼*‰³q@šÒÝ$LzÏ(0G»V‡ñÐê• Åò~+¦Þ$Ž1ûá1÷4•Õt-Ç“‹Î&t Ü"Ð,¡j$áML3{uô°Bk©v—}2nO4Ôñ€Ö·H'æ[Ð;0è¥,‰8ÄÔb&?ÿLÓXuRX•¥™o†gfkœ=qÅS‰a6¸¬WêN‰æÓ¹µ¼$ÅZç“‚_ísô+âN#iñæn-€ÜˆÃ@—з[9dzAQO;úO´$–íÍëí7ô3êÂÈ?0^=íâÆò±ðÇý>mܘÊÁ½Ÿc㎹}„:NÛ¡é}þª„‚^Ý”íûRœË¦æ\±n,ž"áÊ7Lt*ú¼×’Ì»ñÔ÷ÃÆC•· ªÒæEøû˜\m¬K8}t†¿©o÷w}Ù>…'nÕ@®²B‘åTÖ ñ­Ÿ«‚ö^½›Éz)ªäL¬÷â†Ú 4{Ä¡|}`§ž”H÷‹‰ó%º©ýÚ.ºÃdS‘‡xv6Æ@ïNY=ºƒY£¸ëÛ¾¶Վ혤“×ÚçÛsDöù‰ód…)o«˜H ?ȺYU¢?ßÒŒòÕ~µXë^$ È\åcê ß›A[ö`ÿ0TËAvãÍ(U¤VüfP1ÖM”µ€µ÷ç ûÅW5…¾í.>û¡Ã9s¨R,×éldÞJ@¹É÷ë¥sY‘SŸÁvƒ ”g”,´YÁ0ÿK‰¯O@Ú›¼ºq¿”¨â)8Û•Å”äæ©”bµ÷ò^¨G˜Ê±‰› ŒùŒ Ê:U‚[νó},²ÉÛº¾g|Å tn[m6ññÖÁÇ+,^œLY4pCÎ_ôjyln¯Š‹íæëÝ/NÞdw˜¬gAòŸØšT§ÞÞŸ2î¸z(`µ«Êñ1lÃõ¾+±¦¥j„Ì'æM¸}ß !HêæP+aº}Medܬ5¨¬ppªe¹ÄâvÉ÷éèKWΊ²”IDгúò0i[7=¶_¤ÚL g¶3Dl6«4Ý;¿ÑÜÑ\µ-rÃò–6¹ •ßÿæ5I_:îÒ}Âw‚õîQÙDP,á‘šë¹1y W’à·æí g¢çCjÛo÷¼R´¿\â„Ø’SÜfR>†`ÚæÚjùt½ç©ª9ŽÕzD«5‰ô9&GÆz kš®Ý?öx0-ù$ãɇ&Î_¬PÆhH{d[álAcü•¦>ûȱ™‡?±Ó¾\Tnñ2Ú:Ù…#g0v¿ôK\8yǶD4!y©³€RqÖqžkZ–LížòåP2ò ¶xIŽ…­d¨QÏ;ïÙþct£Ãr„2êõvKÝCGkÎÊp¹«4g#u VÛ„kW}Ãäí)ïbóÐP;±àšl­3á µÑ×WD?ió|•V‚)±qÅ %džY­6KÏ'ô6?íÀ#,îEhˬàÝ6›Ú†:ñ!‹Ë-›[ú±MòD¿`› ’@˜£bêÑ$çS;…Af13µ“Yß´¼wË4¬1ò¾ÀæªÑ_›J:CÜ5˜ï´ì?ÜìµÃziwÙ«˜uFÑ>õ:ÅÐÉØ>ûMV)PÓÇ|EQTS}û¦»¨V€¦á”­žiŽeÙt¨þlÒ‚Á™™RâЪÿ¼*³g$ý!c§«æwÛ•–¼ûýÄu'º·‘ g@£“O¦7CÌ·ÎK5ÎÞÞ.ξ ºÁ• nƒÞ:*:^Us?!:ÑÙ,¢Ïûkë&?¡ýØ¥é·OŸNdB•o3#”¿oÖwoÔ—yè`9G³s=ÐÚžÄN?´5xZY׸‡~|ù°òðé‡2GÙÃAL†%…[aßþ}c¢=e¬Í†Ü_ß”*Ö¼ËgÛ<ø5\È[G©ËN …‡;r¶±Œ<×åz$GL¢úèSÅ÷"¿wáåì~ÎFÛ§ô̦ée‡)žø|¬ÍÙ™ìr¹ìõîÂ#íjd³"RRB0Äâ9o`£5&Ÿ`?…tòØ<¯~_¦áøè m:Och¥xFöÿ¸ qj eÒ´Í’0ÞHbÕkÉ„I±Š‹›«_zâ†i™úçï(FŽN‰ŠpÓü‚£>s8³¢¯.‡{Ðí»³?šÛUBöøS(Ò©HTB·£ ­‚ Îcì"™y¥?/p6FôsöËL.E·†ú+^íC>R\è´òÞi¯ŠÈ ý|•ö¹¨éBs/tÈqµ£³C× Ž=Á¥Žà^H¬ÝwÎ vÓy&ÖAsïi8ÇÝ Û¸cè›q´ÓÏ?ÎKâéÑ)”âŒëÝ¢ÚÉjícïZTd@H\»Š‰Õ]l:…éÁ"ÍQ©Ø¢"­ãGm¶"TÓ¨zØgJ¬“Ý"YKdÅöáú§¥è}µqïö×ð­ªX˜oð(á?·S¤”„rË1ž— eÃM§|àÍË 7ßæê—š«ïK°i¤p›Ž}¬~nZm«4Š–§‘}÷Ž´RÒ1’vA¬g‹´¾Q§Æd&qoI)Úþˆ²ç^ˆ' U:ÐL¢Ï_UI`ü‡è—éþÖLìë6üv0ÇŽG?e_GœræãrvúÆÔPðá¢ìA3~´_ª"  û ÄÄÆhlÚ¦¯¹¶«ÑºÕú¼p“µÖÅ*èêá‡QÖ”6%—O„Ü^ÁV4ØCå¸Æ–6û‰6ÑàTûVûâÝÊ+”©·Êì1†hÜ‹îfm“¥Ã'Jüöþ”Dº‡?ã.~å‘>¼ '5žÎìj¶Oÿ)Q6ø ¥¶õ¦qþÆYeþj¦ÚPtÊ+z@[ºÙ3vvÕs‰6–[Rä~}Ë _y ã&´‰º)?~¯B)£%+<êbÁVþ?A&&Ú endstream endobj 717 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 719 0 obj << /Length1 1420 /Length2 6302 /Length3 0 /Length 7268 /Filter /FlateDecode >> stream xÚtT”kÛ.)¡€H— Ý1tIƒt§"0  1C Ò‚4ˆt7HƒÒ]"­„„”¤Hóº÷·ÿý³Ö9kÖzç½ó¹¯ç¾®—‰NK—KÆnQ„Ã\@n^1€œºº²0€——Ÿ›———‰IŠ°‡üåÆe2€8»@á0±ÿ• ç !>y™§‡T\í@~PH (,ÆË àãåý;î,¹A-êÜ8 â‚Ë$wôt†ZÛ Çüý `³€¢¢Âœ¿Ë2g(¨ƒ6ä‰`=@†BžÿjÁ*aƒ@8Šñ𸻻sƒ\¸áÎÖ’lœw( q8»A,¿4@?ȸq™z6P—?~]¸Âä  öP0悬p…YBœÈúÊjMGìO²ÚŸNÀ_wrÿÓî¯ê_ °ßÅ 0îà‚yBaÖ+¨= ©¨Æð@p@0Ë_‰ {8²ä‚Úƒ, ¿'e´ $À¿à¹€¡Žn¨ý/ˆ<¿Ú oYf)wp€À.¸¿æ“‡:CÀÈk÷äù³Y;Üæý—a…YZýaéêÈ£ƒ:¹B”åÿJAºpÿñYCA^a~>Ä ñÛðüj¯çéùþr#øz;ÂVH_¨ù‡ëírƒή_ïÿø·… ,¡`Àb …áþÓé†Xý±‘Ëw†zžó"¹ðþúýçí’^–p˜½ç?é¿÷Ë£©£­¬£Âññb²²p€7ÀÅ'È …aä‹ï¿»üÿßØ{µ@пfãý§¡2Ì òþÁ€¼¼¿q¸ýE Ö¿$Ãø÷p$—!Ö¨oÂ+È F>€ÿßø]òãý¯.ÿ/êÿ÷@Š®öö¿Ã¬¿ãÿGäµ÷ü+IeWRêp¤8`ÿjù#euˆ%ÔÕá¿£ÊR20k$Ź€ܼüPE¨ÄR ŠÛü!Òß»@ža…A´à.Ð__d/ïŪÛ!¿*.Èý \Dü^î/‚Ù¿çP€á–¿ÔÈ'(9;ƒ,µÝs‰îÌÄÅŠÂ*!mï«‹3ÕH©E öÖtÍz‚§ä,ÙkqA_£M"R4ÒéU%:.pÜ«®ô ,öÐ|ˆ Pq Ü8d E*ˆPË `U,åâ_g¹í¦?ò¶xJ$«Äö|Š-±8~#£×pÃ/¬jÈa3fÓ5O¼Ëßv·ô:Sæsp=c¦¹öHßÆ÷ºš“€%•SÚ»!rô€{mq•ü‡Òoïå+µñRWÙ÷”áôרŸè^€b§é8³´^ú|±tå³CU¸#Í4ý¨{„BKÌûFt–¯Ÿ—¾Œê¶Nü\=uQ™b½ûìVÏ’LªÞ—Ófí²_Úþ$®¸x…÷6â¥y «Ý+éo¬ØéñÆJﾕ4„wxo—H¾w™ž+ÎÏ­ûòs® ½xÃ+ óé-ùöÁH˜VK'_ŒåcщÄrWD“äN|E‹#üÕrlì ~oå+0Àà9éÐw“dÆÑ•ÊKQ5Ä>xËV l”¶3¼¼)Øϲ¼Ô$-¨aÙ[¾ÉÅ €š—‹÷œ‹óà‡†U»Fîqk~`Þ°(ö&ú5›…¡½Ëõ³ѪáxæŸÚXïH(™Ñn7ÇݨϯyÌùм¯¨ùüKö‡?7F„r³t›'ÀEÂFñ‚ö;ïLØ$ŽVEú”òËcˆ ¬\Uw»3.:eie»€»¶·³ÂŠ²™ŠË¬©5}¾{ñ9¦ÑžYÿ(Û ¾´Nzò&áŽBú«É£XkSÀݵ‚À ÊSQòM¾ôÔe:™ gõåda}TwAêa}seÊ«’£x‰ÇNÞsë}þÇE±û<ÉáÔH0⃉“T¯nvEz<‡væèúôsnq82ú“Ä*ÚƒýrŸK¡\fú :ˆK,«ó,ÌXƒ^íàÁm2qÓÄ ÝFê—èïÊk ØlSs¦´Û¶c®K¦ÝÒsè ÍQâuXsŠZÄBJµêX1OŸ݉j»¡Y:Ýn Ë=/È|cø‚>×"™ Ö¸ŽT¾áaâúþ†zåJ¿®9ƒyøì][KæóÑÄ+tµ¢sôzãÑÁ÷tjÜø «³\¹7ÎàeúAGûPFü¶õa †×ݤa»7§³½•¹ìD”™¦\Ï”l^Ä_Ü„«w[Ž3W»[ÁƒÖžÕ™y¤½ÓÌmøxþn¸Êñ2C,ÑÚJ¤»BÖèÍj;έªcý£óš„Á5ô{Rs×××…)0±O3¯Ã{Ô ï*ÔÄ®.좵Ç<öNa°´#t£þ<ÛB©j°ìbùêÛÔ-èä‡î±äm«Â.ךª>Ü”]*J)L£iBܶ?C” ¥7‡9’öÖß™oçÝ« ÂC¦}Bå ©Ør£S .ÃGg…ÒÜ|O‰ ødÃ%ñÑz‹§FNœÊ™Ž^~•¨¨ð0’wåØWu&éÌiÜ›Í"£øÖЭtÃAú‰«014¥õÌ kÊ?ª$ÇÝV‚ÈüT±ºII.o\¡AÏhßu¾%_,~ë©HƒMp–¨·´¡b'U1ƪ覕ÄkØä®^WáõYÎ÷§£¥œ ÉqFð0ÅÑÒÚ‘·?Uëa¢’Ùx¿ø%¬ÓO¸¨epeº±ÆC:gµ, qwŸc:¶(6¢ìeç þWS¼VN²Ô1ú`†T]Cû‚a='å9Fö|áçsÚáfÊFR!òƒ|é&_õk^‰]šM€*dƒ¥Záu@©B陵¬ùF–N’Õ·chátÇ!ˆïñÍSŸtÞER†xY“Íâ]S„,¥:Iw»ªê,z]½ÎÌ…IîC®3Ñ]Ò qšÔ~m\÷æÀp5&Û*‰U+ô)%gê¬8õ¡l Ö“¡Â§#Ó2¼_#ø•Ÿ¥é¡:—Ú{ºdI憾ÀúžÚbÚ9Ì¿ö²Þ4†(Rô¼ ¨¾ÇÎp»Wñ¨k}úx‡£ÌÁeS¬t37]_Ÿ ½½?„š»9!ÒgQÆ´F‚*«{5Üã¬Z6î‹ÇõàÝ–ÀWÍŸ éÝcVE ›5ÝT—,Ä®·‘Òt5>Ùïq Õ˜×­Àk2Ĕ螋$ƒ_&ï‰DΨ§¾½‚²ÈþàoB´æD}4_i¼¶c—2ÕµxÒ„–@š»Vðª õÖŽ“M$÷íÇþ¡©[õîfr˜qbS›Æ/#˜,(,²ggC62‰€uAB'•ç¢#:Õ¥2÷>¹9¹Þ'ö‘iœmöjé×Ø”¯&$¡2%.¾:UnD{ú6}k2HŽÝ]¿dž\5›:NžÕ½‹ + 9m_ôBì|½]‚=Z:Ñ(q‚f‡—=«C0p(¶ßšø ¤bû¤1d,kNŽÐa’Ê2cDI {ú8¨Ðàçö×£@q(j)Ô†³Çù!"³mqYBO„m{4¹ µêÌEòíX⇳â—`ê¨õ]Þg{s ­iQ—Ž5ÎÖüÁ¶5R³KtŠ'ëe-¬õ$R½áš4*DÜøÍ(ÒE‡t ,àJá ç>ç£íóåàÒºO{õc{OmQTqóqúš•ÁçØŸù}ƒÇ#¿Îøj¶º‰#,k.Œáyòáùö‡U_Ö}üø{ãÆ=¯ôM§%q9Þ¨=%\¯ç<žîß —ÄdaùI±`mEYwzÍ‘Ú×'†îp¾Ý «ch*Lo–y'§X‘–lìð&Äôþžt47QáœËLKü$•Ý ê¹Y·Så>½©v%oÙþ¤M;å)×Viè2Oú¯»z9¢6@YŠPqÔ_e¿2|Bð-†™«ÂhðvÜŽ‰¬§g‰t?ÙÍžáŒEè(ã~TÈybžÒr‡LàœpFÞ‹jèl8!?Ä{Ácxd}#œÇ“ÂêÅ!îŽä9ª“é†yÂqÀem áæK–º,_tóþ[ŒÛÇÓ¬›ëÀ²™EÚ—]Û^Ó:¶2î箕 „ÆPµSÎæ$~Q`>ãCÔ/IAįt53'4Irw¤_UtF5´R­{Òx÷{ËF°’»ƒØ"MUü}U¸Ï'¤i†¼–€¯¿Êó3¢ÙQpð’|ÈhP͈`ä”QD^TQS¿ uÔú¬íÜ ×-O˜³{á$û’–¹ ˆ8¼òæÍk“F-=C_–Aü¾‡€þ¹l¯¬8ˆÄkóg’÷˜Ô.v¹ùßàGXõ¢tÁçsRÄÁ“)k ¯V<ïDí^KxsÖ¤"ɼB!x„C® NŸ<¥x<äë'(°á ¯ŸÜf3½­êTg³ë;œÃfÓ:Ãfââ±'ôAìb6¥Þ‚Û¯ÈüWõ˜Ù¼_¶©A=Š±;N ël[zEó.lP®¡Æpº‚b0Û±ð¶¤6¤ì=ˆ;¨v3‡Û‰2ÍñŸÕW òÍõ‹8_úm¿Ú²+¡%£ç…Ù?xµØoyÏœËÅðký+óm “©(–¾Ûíáývº5ÅúO“iV5"²M3Vó!=KE¬l(uUiôÚ1+L“Òä½N ¦ZB2ë®´¥=¾+ÁZbOY10mƒ”ØU|Aôæ: ÓfÙ üÁÞ–§(§Ô™…Ø»ÞêË"´òìµ:œçëL\e·•„:3_füÌÆsµ¼zµGì6–1œîM«³ D¦[¤;?ñjMìUã²cÐ* /ÖwsKyh$ÉÈkÙ"´dªãõæE¦A‡áécØx¥²ä 3Í!fàJL؇|núì¿dèÓ²4­{úl) äÍóS]ÓÔ+Âßšw½ptÁÄ‹Hbj;ÜðZ”ÇëB ËÿX>˜º·òúÚ{ïÚ–]y.GÍA‰ØɖϾiªÔwÚÌúò×Hïñßñ×6 0\èßfy(ÿî~>…ÜÆ{sA7ÕM…K¨ÁºË¦­‹æúq§$‚„ÇØ›ˆøkM&aC¯Ä“”}Û—5]úÖÆNmÁû[q±º¨“ë— G‰%¬>mA5ÛFö% ŒTcÕøè{%E«#²hÄ>Vˆõ»—0·ÃUÄS¬þ€JM.kkŸAè#0{)QêZß¡º@u@±GÿäUD„ƒ›Ÿì¦µÅtŽ{W`â'™y&Åæk9¯„—“k÷(#§ÏËù»Ð½‰ô[^^§A7>q 0Œ†ô½c~Bé3®Wûs‘së0zòÉhWqYú#¹,RÓÜ5[¼«ÍÅ5ëÚ£&oã¡ ûÈŒû²co¨÷ñ]óñVßÖŒTþZŵÝü¬Óœà“D*eú±2©ì¼' Cé¥Ðz˾!jߌ­mvvÆÙipùõ‡…y<Â.å°¹\ñ=þû'Z“#ô˜ú³ÙI*ÍžI[}ܦ꩸æ‹U§ÓÒq_8 ùu”N­QVvžµÊ= £‚Þ³|%’£ŽØÇñäÒŠ ú™HÔ¢¾ø\>v²w/Ƚ'=våâdÈÆ$µ§¢×†³pÖŸ½§+//øž‡’¹ˆCøàF)=v¸ùD[,oð ñƒo¼3ßå¿×ÖTÅz±8ž\³žÎ…ïý|ˆWV_ÃÿuŽË*Ho_XÝš-ˆ†²x©weHíc_Øõšðº¨?ò¡¹GÍO+HI7ˆxÇe°éŽ4«Í*$Ny½I ä\Vé:. ×¼Ô©/?‰i,h+ç-$œ;¦Æ'?Ãïx 0Ïß¾g‹jÀÿ5ç±Ãƒ+Cs¤šùR£&j‘L©ä)D —fTÆîNcH€lÿ]‰Æ(é!y‹XÓé<š>2P„ªˆ™Mya'A:¡ümt®ë“âçN~NÏ»mðj™ñ¼š/Ú•Z wMlÞyמ/.]¨û4·™™Ao!Ī{çkiÀ =£Z¥dbg,#ÎãäÞØò‹*6H€[…€¹Åó?L|oŠ¼O ºà‰ªrdØò³/~{·ˆÃîJO®>bs!”ʹ~]HA,Ôû¥@[ÒÖêT‡°è¥Þ‡ïj[û½E øõDÓÞØ.ø´½hE¶q(¬6KÊÉÞñ1mðörS¼2‡×ykb°Q@]­‰Þ}#K”eY#»´  f“H£“`\æÏs¦àp ^J`Uy{9¿OÚ2#fe°AõwbJ¬ZË,}ï¯\i53N,'‚°ï0œýÔ:t¬°àRJ4‹ð8®ï¸% ?ädÈ09~Z92Ä ÛXzÂÀ…¿UØÍÆ7ÿ´s» Ï”Êû9*a¶èEntY‹ KJ¿e£Ïš,¬'Ù8#Jôá¿-Õ æ¶õ¯ßü ôþ~­ü@xëÈ@H–„j-jb«%š:ÖB*óËïmÉzLÕK{r Œ¡0°³·ióá”®e¥Uøy®YÏéI–ž3ž?¯H~d”è-ÜFJ©VºÝj†½osg[¦l¿d¦Ýn“„Ñ 0yËíz£X÷–j‘7CgÄéå¨Ó›I q+iè+¦Î%†‡÷ô„'-ñj¤©qðØ7?úª=¼WáÔaD<‹[{á~:9jj¸ëÞs}Xª-ÿ‚<£û¥´ÈKÖ×ô·Ï¦nô³H?¤«Ò£N ÊëÝžàBSR])éBí9m%ªüŒÈµ­<侶%‰Ý?ÉdúhïŸ4Øê4Ü4;¹Ëy˜ˆKµÓÑÔ :–°ìì1ßsbÄ¢ hi²¡xÞ›š*œäƒ}‰BÚËdœûmÞµ`×óÁ‰æu¿¿ÚØq ÅTpý…¨oÞUæ‘ßýP¾3Òé²x=¢Š¼‚¶±¡‹³1`^RjÉXÚ’¡ž…¿×Uß^ë}?¿é¥î¥·K³–S›ŽÃý8wE_<žø6îñ¸=1CæN.–(i¢¬¿ºm»QÀ{¿þ©Š…ê³]˜E‹Ÿ¹Þ®Kñó†wD£ ÙÔصUËŸR ¶kÜò߆¹áÝçÓÔQdŸÚ‚uS-Šë/àÏ_ìÓ8ÜõMhè~…)¶rÀ¾OJÜàÉ‹·Ûéû=uwÿÞm‰ü NdeÛוS±}u#]aê~}æJj¢ ÿ¢ ô=¡›õó.« øˆ‹vJi‡Þ:WÈóênü ·Q•õF¸ôáÛ­oÅvÚJSDm{Ú—Ñ ½! Ô õ¦ _GG¿þ‡­»ÔdÐmÝõN]ÛKiÑ™4“ÏÖÄ'‹)*á—’3dé’Th¡Ïð®†Aòñ©s5 Ó±Ò^sNÓ|s5ÑÉÓ)¢Þ?í>ð™s Õ9ö# ¾ƒ<β’í–ǵXî7šeYÑÓàŽMý8”k¾7YAÊ’Xûäºþvœ"² +§+x%yAåÎI·¨aZ>bÈ©6&Fã½G³ŒFM å';ýôÄó²ÏEg_ôßÍÍx<ãØ!»  b‘NóØ䦆Dãà@¾Æ7Zv¼ýn#¡wP³—nÂ#}e›œR­ª)kÿád²)ˆ‘*ß~á©)Ä€¾â<~ÂÇÇ W¯•¥n=_øXî#üÌ»ÉêqôÑ•WCálWAè<³tqn„ÇanÐĪ¥«—î¢ï ÚgAF×?öá=+v}§ ÿ2 ‚Ãkyz¿SZþp-½É®cÈŲ'=‰¿áÐácåDáŒ3yêÈ°ÍHG-–'W?ûn^8•ã•‡Àwê¯wÙÓV ;myˆªZÊêncîª/]•9ù Àñ ¡&j…hδl¦$¡¶g.†{ªUë]Ï€~ƒ´o_Î[n 4éÚJˆ¤¿[ÄTacwj¾—WGáêNhh$å¦6  Ɔ¯5*«ŽOhrŠ,9àÄ;‹þ¦þæáiÌøÈ­J>&‡Ý<ü%?ÕÏ ['w ÏåâªëxòF%µæU–̼‡K/¦'R´¢;t¬¥Ë: £5ûÖò«¾™…G¤%Ø|4BsYùêÀñº{¤w§´œ¾ÀTÒzÝ°¬4o9~Qª¼h–Øؼ5…éæ½Jñ7U´ªD]zï'›÷šZÂMùE~T¹ü·Ä /#[ÑX)˜ ÿç®!j endstream endobj 721 0 obj << /Length1 2832 /Length2 24124 /Length3 0 /Length 25702 /Filter /FlateDecode >> stream xÚŒöPœY× ãžÜ¡qîîîî. 4îî‚Á <Ü!Hpw×àîp;3óN2ßÿWÝ[T5½¶µ÷^çyš’TYAÄÜÁ(é`ïÊÀÂÈÌ SPea03³123³"QRªƒ\mÿ˜‘(5Î. {Þ?Äœ&®`›¸‰+8NÁÁ ëf `a°pò²pñ23X™™yþèàÌ 7q™²ö@$J1G/g¥•+ø˜ÿ}ИÑXxx¸èÿJˆØAf&öW+ øD3[€šƒèêõŸ4üV®®Ž¼LLŒ&v.ŒΖ‚´ô«@ètvš~5 P4±þÝ#%@Ý äò·]ÍÁÂÕÃÄlAf@{p†›½9Ð> &#PrÚÿ,ÿw=àŸÙXYþ-÷Oö¯B û¿’MÌÌìMì½@ö– - $)ÏèêéJ0±7ÿhbëâÎ7q7Ùš˜‚þbnQ˜€ü§=3g£« £ ÈöW‹L¿Ê€§,ao.æ`g´wuAúÅOä 4Ý‹éïÍÚØ;xØûü,@öæ¿š0wsdÒ°9¹eÄÿ ›~Û,®fff.6Ð ô4³búU^ÝËø—“å—ÜŸ£ƒ#ÀÜÐdÿCòq1q\Ý€~>:þ‹XXæ 3W€)Ðdô»:Ø ´øƒ—ï òè1ƒµÇ`þõ÷ï7°¼Ììm½~‡ÿµ_&m11iu-º¿;þ×'*êà ða`g0°r0X~‰Œ üÅï¿eþÀÿšÿ˪lú‡Üeì-<÷ÞÿúpÿG4ÿ\ZÀOPtk ù-}}ff3ðËÿç ðWÊÿ?Ýÿªòÿ&ýÿKHÒÍÖö/7Í_þÿ·‰ÈÖ런”Ý\Á×BÁ|9ìÿo¨ð﫬4¹Ùý_¯Œ« øzˆØ[Úþ;F‹$Èh® r5³ú[CÿÛ¸¼-Ȩìàúõ°0€ö|à gf~ ¸€wõ— ¾Oÿ=RÂÞÌÁü×Åcåà˜8;›x!WFð 5zþ%m£½ƒ+8nÏ`áàŒôk£œ&‘_¦¿'€Iô7â0‰ýFÜ&ñ߈À$ñ/âb0IþF,&©ßˆÀ$ý±˜d~#v“ìoæ"÷¹ÈÿF`. ¿˜‹âoæ¢ô/âsQþÀ\T~#0ÕßÌEí7sQÿÀ\4~#0ÍßÌEë7sÑþÀ\tþE<àH“ Øgb×ï)‚Ï4qý.eú©›:›˜ÙÁ¯+‹?¢Øþµÿ}¹þu€ë›ý‹8ÀÅÌlÁÂúŸ…ý—ÅÎîF`Å1™ÿ†¬`¾æ  3ÐüÐþ× nÞÜÌÁÅôG&˜ÝïFÀÚcþ‡ +˜&X®&.V¿Ûý•ãä¾äÿ³°ý ò4³5±û£2xI¿!8ÇâÈþ þÁãWðoÈÁö ºÿ&ÆòËðû<Ž_ánÎœ°ü ÁC³t6ù³3øÄß-°ƒuaååh´ÿ#lûs2àYXÿÁ3µù‚O°ý‚wöGïàÇ9ÓïÊàT{ðcà?x¿É€“þã·çøÛ .æ~çÛÿG>ì,ÿXÿ+v0kGðóØá·ØÁ£q´uûC ¿¦éô{¿Ð寧׿"dýetpš›Úþç\6öߎÿ£[Î<ÿçùÇúß`–_ øc,àáÿfÈNrÚþ+|Ž_1@÷?vÆ.â~íþÛ*xÒ.¶j•å—ì ~s1¹Z9ÿ\p8«‘ȃ4ǺÇ:¦g¤§ /¢˜J_KÎZzIr|Œó8S{Oá[ùä Â?²;’‚ŒÛCº†,(»VÚµ¼f|ÒïÚ —xæÙߌ˜RÕé$P¿©i‡]‰ÝT/ÃèF¦)¯êäkå#Ö÷³(|æU¢/ç ²w Ù:ÌeCqî>œ«¸gôo»PÎÙNédlx7гÔ'tä—äpÐvÒãH Êù˜¼Ó•úÔŠDLäµHó:RŽú]7«ó¤fJ§Œ2…íÃþ}YC"Κ^îÁpx ê¶Onh–Š•Òò£i¥wøì^½›ƒ¿Bk®÷Š[BZNøçÛôæ·E¯z»^}ái)^êÉ—ûˆmF‹ûcôf]ÿÔ2ÛµœJ¨d3v´çòÁNýÀ£5q§…"Ç\Q_¬!£`dAézfT¸P‹Õ“dÛ‰TÞ|¢b“ÀáÀ‹E“)º_T@¸úòþˆ”9¡S'×ÁûŽâènì¦/²§¼}|Ëc}eÕÀ¡´{Paô$$cõÕm/WÔîX‡·Žå5Â\²9BI¿çMpÇ €HòUq(®¼=‡Ú¹U ÃÁdUå')ïÛbžŸ¸ýÔ [4CO-2VŠ÷µ3>[Jè€×©,ÐòîfÓvX° º¢ª~2…ßv=ÂõZÓïÊq Êí–L)™çSaßÞ§À÷ä&®&2Y\ugÙ¶R*K°æòkŠÐª‰Ê3íð—bs`”Š}É_½É²å«ðùÑLCÞ4§ k/ —@†‘ Êí£:ç€ÖÙ£ŽC³e¤u e*ò çë €l„13™¢…¶úLßúÊkKaï…3ðKNµaë‰ë'a%–ƒ\¦,É3’ßؼˆÉÓ6ÍPfǤzuŸ–õ íÊ^š¼G£%àÑmKï¾uÉ Vaæ4Eã´D ýv5i?À,©õ/‚ðèsO‚V>Ÿ¨¢c7`¶6KÆôA—¶*g1îµÊÃŒzÞÂáéhk¾GÃ黸TÉ©|¥®ürå’s‡¤Op|^Àq°J¼oHtÃ>ûmLgëƒpT¹™ù`$lÃɆ/½ªlâ>î§1ŒeT•=Œù]÷ ñÛÒ­¾ôÊ8º>SÇÀw|>Ë¥CˆAå*lØ{šš|s¹-Ãï'_¿B¯PbTú´¢oáæþ2CrØý.Ì2[@_`M˜Lrí^NòV=×ô!5¾M3(Ö–ÆÖ²¢3kÁt¢¦ÎSÓëªnm<‹Ì€ÜÛ7å³£ûyç«,¢wñi×s½ÅŒÎ¢<Xö :båb,÷=®¥æÂä7ÅÜc6ŠáSQrU9“|ù?§mƒ$ïiàç¢/"‹ ùÖÖ ÍŸËºŽ Êß<®¾m‰äÿ^”›´Ù‹ŠQ íÒQÄÃ_'÷JLÂ8Ls?Ïj­u ‡K%qD²ÐA¹µgc-$€¢ôC+Ù8[Ë2Ï,Ï¡nŒ O8$µñf9ñ«Cç­;^Å…‡ý.“W}ëI„á,BP2 ‰´–èXÙ=ÐKl½‘w(¦XµN0j<–þ*ñ˜¾äo“)ec ku¿•D7Xf*2ö*V©F|?ðQ_%©‹@òméHû,fÏPpmn”¯`RðNRý«b“W\%jÚÌ¡žsaÆc¿ÎU/Æ‘ŽЯ¥zŽ¥0êfN'\ùþiDRC"ïðâ9útR.¤cU:šº¦NRWExUf~Í•2ë%9³C¯˜–«‡ªí1ÇjÄ> ¥o_‡zjѤë›z÷µ¶sÀÔj“½‘}´¬|.62M²0RÍnαt¤ò:E"9ɺÕÅSC› Ó•.ûŸþØGÆò•ù‹&¹½>ïÑÝ7NäW—švòØ/YR)0œíD^Ž]’0»¾_œÛë®B¿Mk(¹t¹:uÈÀ4ö‰÷šAF #‰òÁ1C`Ô ÐývxB¼ÃŒc¼fêf颜jNÁ0®]92•A%Ïï؃ހj‹âÛèŸQ˽wÏ8ГüÎb¤ÏÛ«Ø=„dݨFÔ»b0<ûÝ%«ûT ÔÏ‹–«ÙðnmH“|Rn¼é;¤äÅp\KyRx$„[®mIDa/5ÿ³°l¨´ò;[Ñ™ý²DD’ä,wR滽úHÉÁ(Ë«÷Ç%«&zïƒ-n•=Ù¥Ãr°|Âk=Öò-JÏ`¾ÑÁ c½ä˜¿xܹ]—Ö'›ü¢wË’<’vdÆ¡xËSê(ÈÊ%Û,útQçÂ}ùÍ’æ²ÄK…þµ« ^Å÷p¢”KoC/‰*'&Õû{;¯ ZP^¤ûÀ¾u×µVq”|ª¨!‘ª¨‰mûçW£œY,Þ…Ï•0«;Ç‹˜'‘ð±Íå¨uÅLÖak½ó¹¤~+ÆÄ©´ûK·fT´)à¤W?ʔ· ôO3Îëž ÏÙc}qN~ctyh¿Ô…ðªMéqÓUD–Aþ•}rTŠ¬Ñ ¶¡QØ¢%fBÿ'ìïq|1ÆÄUcGÅr¢á+§œÀžoK$•ñ H‚÷lÛUãßáÉ ˜¤íx÷-ë®®ðœ)†^ Å°ñŠwËF¶ÚZø'¦ç—¯!4ÌRƒ|#MX‹*NP±%}mÔ©O?½áûÄÿÁ‰À~nË-ÈÕV^Œ%Q»À1ŒŸ‚ä?Ûã4Q$´5æÍ"¦F×A˜¯ÌÒíO €RcFfû"›¬°0šdKs6YG@ÜPÙf²sTäã‚ÔzFúÒv/έ˜DJ'—¯é6NV²»Åhøµ÷öìv_ÃajÆI$ë$þ„¸#‚”A˜ÒÙ.žÌÆ“£Ü3+”¨l8$~È’1 Tƒc¹_L6¡Y½ÒSy'oUªÃ°ì¯æüìeÂPPÖ‘*™ã#æ‰!4€)ÇÑÀŽ æLX^§ÁGºÍŒDÎê©—¶Ï{³é‚åŒì¹”Œ´ÃØ%¸06SY™;j“R±`ÛÃG•\Iο»^uü@k1¾%éa\ßW/”·)c!¬&M•ÌÿÛ’p t·‡àÆÊ’ &ÔßÔ¬.eë½0)!õòjÙä=›¤ÃüdFšïy ›l:ªð<±ÎdáǶšœqð£¨o“Lª$­|—ÚBÁe~ŠD[KãÉïñº®¾A§§.Æ9pj–Òz¸Tºí$JIúa`8–Äèî[ß^xÍÈy@ü†lƒ{îëš ƒ%r$ŠyøRÔEj1+¡ Ž4þP5Ü'¢æ£Ug‰å¸Yˆé&eµ ˜i"f‘ïöm´ khÎãàœ!ê?“/ÏŽÙëøX/³ùÚB¹U7QËØæ<¬U“n×>æ^M*w ú|̃“¨L=q4Ù3Dš³:P²6Ϊ?ÎØt¼½G)çvóZ¢p>O^¾HrC²ð3sê¦ãèôò'}Z6˜Îº'¸í8|­A_ÙæšC»â•>ÏiS ëY¤©0*íIj¶=;Áa –¹í­õ0Hñ¾_?ëñù–!­«O§qä>×AüjÌ{Ówí‡hŒe ¢úFÃ76Ü íƒ5¡;LÙ„[l†I¶Ð"Ð欴ðÒ‡ ‹Ñ'›UƃŒ«'wêÀ>;FtêaµÍ.ñæ¡y[¯G\®Dì<«±¯å½vûu†ß*¥Ü8Œ¤2àoëæYŠP]™¢§Ÿ×b†6N‘ÖØ#ªYÊíß=ˆ ú9ÂÑíX”ZòXQÝ÷BŸ(ÜÏN4JÉ]óq|+ðè;h†Ù’qv:)f³ ^ÕA¹•v-ouŸ·ŽŸN ë8¿Ù'¿ºæ‹Y0'†W-„^$Š¸¢¡0”~ Ç¤Ýh2)-h²ÚåÑ›úìö‚ ¶‹Ë#—€ŠÖ£.Wb¢M±åa9øM)DoÊ3ŠÀ©/$ß F†&ù¥Åú ‡üçR™³:?_+âŠxoñ Ñ®Í:1t­Oeº¼#'»=£½™,íçu¶óÀ‚>Hc·[a(|_˜²C¬™¥÷{µéß 8 Ž™>y?›œæ¢õ¿ŠÔ«‰|c<Ñ6$ñ)¿Ë¿öЄ˜%×{t.oŠƒîg=Xµ; ü¹í×à‰ºs¢õ >mÛ>Ü%6•ÙþíkŸ×•¶Bº%ÞQIƒèQ‚ »ÜG$Ž òãTýùÐ'rÆ‚ãÚbÊ.ãä¼ãåö—R¡&÷Íß õ#Þ&`Í<© ®+šZ„Ñ-¶´­„~r CŒ™ÿ¬Øâ=~aùÓrØd+öƒ[­dÎx7†ö½×rCiÙÔýÛ¨~Ëëv!mVƒ®ìÅÒéÃy³çé†cNò@‡šÌT£ ”›Â„„1.ÁCÚïiÒö>A5—‹p‘íûˆ¿Sågbu}Rèí»¼sÙ. |°á‘ѾL°È/ɇÞx}z Ã˜/Ò–8üœü¦Ÿñç:iÇX7Ù[ÙE5®× :Ä•„{°'Ö‹¯ˆ¨&æEödQè¾ì¼oolF@_@¸JVÌݦàt¯QÃW×A‹ _Ä­Oyaù|¼+”1J}}xÓ} ‰c®)%?CO·‹í‚U&õ\°fÈÔPâTÛ 3p iÝ‹Zvw§K\æ*^â*ŒÂvDOÏÈÞS˜´¦åײ2ÞRhy/ø2›7ðâ¿\;Ò—öMijÒFõÿ,æÙó]½_¤Ù÷ *5?ᣲl$Ùd‹Üõ$ùH¼zNýkÉ›{ý]ü§éDh"|hd¾4ÄߟªqýžàWÒnSœ/*½Oc©ÔY*lý¦|žä ±$l$jC¼¥Ö¦hG‹” ®²ñðL‚ƒ¹J/Ç™DΚ+A]xžUp-‚´'Ùu¶YwÐmoôvsÇ$ùÞÐ+RSc€J"õ«U:eÎ¥§†/ÇH:„Ôy„ç$Opv_áÕ´;—™«ùËh›­Ö´fà‚ZÙ-%Åë­â羪CѪÁŽ3‡Ù{ø=Ñ#¿×UlÀƒ¼¬¼AÖAŽQ…ÖywM]Ÿ²µLè#}›s=z~ÖYç0ŽÃ‘ô7ÊðìŒ ÖøäE­P×*%Œª1ó†SYŸ$-twéZð‘w@Óèj@pºˆç­ ³öd>™Ï ›Æ‚÷÷³·-ÉL è¡ù‚°+åÕâAZ‰ï¹Qƒ5 3ï=h+N-1"`9Mñ®™[“6V.a½·‚wêC.ÌlqqxÅÐ(œ€$-Å·IVî«2µSz¿ Ð=÷vñ öËï‘Ÿ®UÈ,ä ´(¶kùÜ%Âv7sª†ÌÚ#€?£÷Õ¼~.ñQ6Sé+6q9á9¶Ùánàãª/Ü×6k–ñï"»ÎÏ‘XãÏxC²î]ôr$¾ˆçµa£Iš+>d"¥>f¨„Öê-­ðktjóÂ/, ™Ñ]S®U#)6/‰ªqð¼» éü Sú‰¬{¦'ó«åžú~Ëò–¡i‰V/Ü"MÍ[ @´\Ùí-Vdtâf˜!¦"©sy·Žw!á;*ç>s1c¦÷A~H ÖHNoý¶ç¨CO‘™rìøo‡ƒäðf—µ Õ¶•£†+DJ¥¨Cz°{–îq¾ŽM Iœ°ÎI+suâTéli 0ÔH K(ÄϤ÷‹FldS Cœ±Rò«4îløï@[®oîVä÷‘/ôù˜9zŒ‡A€îA?Ixœ‡5|ì½øqª\(maEÔ©ZTÔU Uõ>GÞ(9ç)V/ͦb¿±4¸E?ôÚJ[Œêâ·ÞlP¶ïóóp¿Öu5$‚œ!Š¼âý:qåûÒÑ£ãLÙæÄ ±=¢äh Bi듼Óãºé¡ñkÔÉ…n¸d‚(õMaë†c[•hen­v"8‘>÷èúT(ݯo‡Z[ëŠXSªŽ1*¾ïŠéy`Ædé6?_RÌkÕQy Ñ× GÇ·,B¼–­¿òj–˳ç oÏÊ¡ZòžÈ 5e¿º¹¾‹)ÞZušÕ>”\‡¥ï–:3‹†9n²ÎÚC ¦ÁUé×çš<þùÍ«ôxƒ·q?½YÙKÌn®ûäÙ)ÎX%«á¾xðÏo¯qѾ.ûbÔ=Âœƒ)3vq2§ÒlkјZ¹ÌÑv²¦¿wäzì¯)ðj°…j‰ .ÿs£†M3ãkF*jÓ]b‡ÇlŸËsõüËöd×+áÍ*J­ ß§žz`ktkOù.ÕÌ’ýé}°•­Í… êˆb¯õ‰jèº R$ìúèâ—ùŒFÉñ"‡› O½úç£Í‚»DÇ;ê õµXó—ø¡ÓTŠßÉé Z¤—D‹3¸]õ<ÂÓª+ðøÇцX,Ë8T{~Ÿi¸-®½ZÃ$°Y¬¿AI,ÛˆÝhß­2¸iTA~É3¶è¦¦t­^ÄÒ©ÏqpFºæ1½D!Ìšn³[<ØË ÁÖ¨F¤a¿’a8fºášÊ¶rg–2/ ñÕÖž,e‘±ùøc΀ø /¥·FšòYcXÖ?%j•ó½Êt„Eï ¹$üÄÍOBë ÷Õùmxæõˆ§»V9ÌðŒçÖYV*Ö¾åêªB¯Î}£§äç{£vÚ˜ìÒÏqßÌåß'R~{.ÎõsŽ–&ꢗRÚ&á]ÞH|"¯Á» åm°Ú—÷hÒncàcûôÎéÃ{þƳ…:>žm²¼ÖQmÁ‡õnÍÜ0ÿ-? Ù¼ojŒÜ/¹ÜÉÅeW^¯†fÞ;°v­ÈP+(½;}° YÁã³{øÚy„UtÚsûŠ4 ¾¡QöMV DÙXv°iÒ;Ñýœ}mêgT!’ê倇T~„txµëØz%~¸÷y6ßæŒWý–éûWåGƒ÷E‹.DÑá=Þš¨[½±Ù•:WSuãà2ŒKpú®¶ý ç,KÍ  š¢·¬?ƒÐ¶x”>ê¾ ¥’öÚ†{òÔ?WÙ÷’ÎF‘m¨³Å=}¡ðÞmÍV6oÞ-¿Š ‡Ï–AgØÉH3³¬Ý¡î³¿À•¥Êóñ·4˜0 Y•‘å" Èÿ¦©JÍüµæ‘Óž¶Ð+æ»% ᧰­œœ6 ‹Ræe# ÒröE¥ªââ3u¨'^2ë›W,f#s.£-‰–á·²„qŠNøÃ.:rĘýdͬËïG×·‰NÞ$ÄÂ7YUÈ".<) Z)3ø9Ù‡ùî«&}MIYgòÊÕ°>c»I׈ÅM•"eõ×.Z¶—¼Ldc.XŽ´K•Ó?$F!é×‹É *º¹ÊNd{òØ!¹h -*%uWö–;kPrì£ ߎ_÷+u–ìdáR¾lk.K Üùço›—¥¿|ËXÇl´8ðŒ§M¼>Ì#&²0$ŒPH¢[TEDãË›R4¼-(×ðÑmü®.ª<_ÓÓîkß[(+)º±äåNûÑäCéº7_VâãÁyͶ'W¾ßy3è~Š¨¿A–^7"ûS僀IÿSw!Û–’ÈHBöäÛ«äá8+/ΔzôÄŠ†0ƒ"3éWT€› <íaK>‡óy¯Æç¦ðÙw£1{! Æû8ÉØHÇH·ûdZ‡B.ê®;kÔ?n=4_ƒöãñÉScEõǵ´%2JM¤³¼õ Ù¤U¨b„ñÓ^rØž‚…ÃÙÓ¥‰˜¸Ö»n¼›ðƒ—»¯pöŒ y>½mx]n…:?Ú4F‡É Ù iÙ¥e6ü#©$·ŽïÄö‚m>œ-[òV¦¯`ô£¿­{Á,͸¶ÿº¹Î„Ç>ãý6ì´ê>K¨ÕÀbkÍø×0̲¥GñûÛiìr™;èQ¯/gwSÏ°—M‰´DðóXÚ£ÓA±§e ‚b=›r[—?§÷>L±4‚!¶b#³{ó­ú yT|ç4M½#ì{ R÷Ù·(ý|}[)"çmS^nmd_Qs?Ùw½u‰—T*´Å½X}'=!îBÛC¬©äI™±?X—G¸3ØרQ&%X§cEhï~s«‚ÛòYú¶ÌÖJ:· B@‘HZö`J² ÎR®¡jG«sO¦•áöáÒ?¬ž)·”ÂDó­éÎÛ(¾¢xnÆÂuÍs¹ù5¿ÿmYÒÌQøçòOc3ŒèFгíÅo§„HÂú“F¨&í"Þ_®’⽩9%²%ë_e~½.¡åÊ,vð“µ*ÝÝÜbàÃTaÀÓ@¨CÎÚ”] ãñBÕuŽo¡U7_w2Öý/piI !‹NqÏ8P›7»io¿x‡~zE.ïfÍËòƒð©U©®"µ òJ 6›¶ûÖ³W’3]Ø,¶Ö/Jý£\¦ö¹¾¨¦ ò³Ÿ„Zx¼®ÄG‚ÛwJu ཀྵŒ3özº›1vfŠÍ’v¼ó0%׮ɓ¸È Úì¹¥Eç¼b}ý «ÑÜÊjù¢OWËr˜þ%%ÕFÿCü žÊ,ÁgÆ™€ µ#%|ã‰mV†(„"]Ûï#n(jÞ›(ŒK"Çžä['ÉP£cAÛm#Bî+ ÀjYXÅnÕš)ò×›ÎR…–=Ú§T W[at+?öbð‹·«W•‰™ëŸÀ÷ ž…Ó†ÎÔ뿧t“­»/C½_@Oƒ«j¹7 r²«8kG6f«k¶?½{ó¤tmzSËvœÐ}ÕýA÷YÌ4:W`¯þ ˜[¶ÚË'fkèVÖ²PËËlµgvFm j†D^ïDW;UJfc˜rJÏk/fÛø~3ȶƒærb‰ým‰HÏåG–Ö™Þ•´—eˆsß×Ä)´F#({ˆÖêW†2V;~Ñœ%GfFôhE!E+.[uºï2“?Cfpszª6$u›Š=Üà>:è†ù¡a`Aó9غM›×ÝÛ&9ÓxrªBÈ=Zåßâ­ñÊKQQÖjÓq¶ý#‚è  '?ÄúÄ{¸èž3‘ÕÔ¨hØI8N/]gdGqz¾níø]É ØBãÜ®¯û´¿ÅŒr6(ê–ªlc"k¯_:5ÃnGm|ÈBŒ=rÏ-M)óhmR÷¢y$H¾´„­ßdeø‡ÇïðíÄêx¼ÇãlE1ÆfÜø¶•Æ‹Æcµ{Ckð þ嬬9ÚÙg²-ÅNÆìÛLtÌÅ;i§o|ÍÚË|âIdN·¦>(ã~‡Ôå|\`}êH©N58|C«‡3½X£ «*JLØq‰Iß±D^|§‡U÷²°ÎÃñîdÄŒµŸ•@W¸5ÝÐ3€ùâàÚ(:„Ý!fékšóOøŠ—Ï$Y!9?µûy†W` .þµ‹·A õ,µý.6q8 k0ÓÄC³{këú2óHMqC7þÝËÛñ¤„Á“¹ù¾â“½4ÍÞ`2øõ2c@ì¶ìÛ…FJ¾Y>¢€zÊ:€0îÊŶ82×ê. ÅØ+Êû͈ܪš®õÕϽ×ÕKò¦aF Ù^­“h:FIT{>t `Ž ‹{Äãi¿G-Ârãüøýb.c’Wš ––€äæ¦M·[¨5–÷cËý4<ŸyçÏàVq‰BVÎr‡²7ÌnΘö,ÏE_¯{[õ{º9é'–zOdœÕTîvçH¶#M…ò7"Lb<ß,œÉž+?›ÉÈ|nµ”ؘ‹Q¤Þ>zé¤v~[^´Îê.þD†o´ÜÑ‘¯0"Yc Ï9¥Îc” ¢ø,”X»‹31z6Eï‹Ç³þ÷sAE]ìB5ÿ•ñ¨=èþ11¿ž'ÓB.}b2öÝEÛbÀÎî÷n Šp˜Ãâ‹)ihŒ6¬,Æn‘ªqe¹ÇÖaËiˆŸeg2ò¡´iÔCŒ×Ò>¶Å|ÊO[Þ}ˆ_>£ÌM¾E€ì¸øZ·M&ìÑJÓÌÜáÆm‡Gê"ߨUôNÖ]³¿nVÆ9~mGÌËçÝš»}ÏOzR"‰ñ@¯¦BÛTìn¹.¢ Örk^’^w0”Ðѱƻü5ŠšeæÂÌdæo÷ ýÆ(Ô{ÍI¾ò*Ïe*>üðw*TCêÉ{ñÇ&;}®~k‰þ;á^Yx=0Ôn„ÈSôÃä±üÒßúA˜YPóö_½2Þf,~Ž\בú®$ä¨C~KsÚoîi\»õþ¢Š~…£I­*ºK‹bšºaô¿fãññà' //§ÝÓÎÕ§Y«Žì´ÁÜ•¬=Z)[î×»±¼³ui,V±çë×wÁ8qõð#û{HQƒx%´ƒq•gJC—RÚäòîîú¶g½ ó êÁ×3Ä/“áY§ƒZ—O¼#å{•ôN!ÏÍåg4AÊ9U_¤ìȽ”¯«KlžÒÏê»ÕÙc1’ó±… ‡Ò5Ú\ÇYêAÖyssü§2—Àœ±¼CùýX÷\¸š„´óŽÁvNDÐAÚ‹- ߓ+ݨ¬nT¯[©¶)zvºü(—zO©4{Xo¤Ç‚ŠPwÜÊ °Ýà¨úu^í*ÚGÄo~¦b,—AgûÚŽÙÛr'PÙŠ§¸T·Ežý†.yŽa0Þ=šžåȯ‡ÆAÅ» vÂÔÌÑÅ.›¸#g¼(W dH˜ >ûèM]‘êɵJ™Ñãç.Œ(k…Ác3Ç/ŠcuM?åaõ­A$òe\d=ªßfÌ ¥°ã¿I´ß-”¢ÌÖø¤¸‘É=¿1Vàühﵿk(¼;j‡†b%hœ½?$2poÅ–' ¥‹=«M÷ æQÑœ=1Ç“pMŒ3a¦¹]óƒËÌQ׈šÑ:->Ç-_°ÌÙò‘ò½ BîŽsÞžlÕKãÊDßb)aù ¦@½-Þ”Mò©¨:v0ÏqÁµ'®eÍy±×Þ$µføÁñÁÖ›tæÎK¬™¡Þ|ëvßÔ&79©¢ -€kËðd¢j+Y´É-üs‚ï©2ÏOû´ RŒžJ x'¨½ÈJ¹ TôÍ_’.áÂ*°­¿ZPÌØGÝófà÷åÛµ‘è!Õ6ž¤Œ™­Â‘`{@â¹~ XIá«c4)ñ^îЉ0ÔªnDô} Q ¹DoÅ#?©uše …L席Um[Š°–;ÐÛ¯*Oy‡K2J.ôã®Ô‘ø$~0G^‰eb¦N#®S"èW•˜V%ŒE%E°¤uïa‚5“&êÅÓÂâ†wô0úºnÒ‹V›•Å'Vè;ÕŵàóÙ—\Í¥^»ô<ÑÍ@²K×5‰b‘öV­õÈMüL2þH¹µ--qÏW¹™îGu®'Ð5K#ŒòÈt‡dL0´Ú>#]¢WÑ©ÉÂþÉV±‚¡Ú½e턧o_'û’…»í®«Ôª¨þ<Á)4ºçHNד:Í«<¥s´§¹r9w¢r(W”Ú‡bçÍý`³ô(@Á}öÕ¢RÜÓƒ¸/èfFŠÆKþuƒ×WÚgcÑSzÌX¿ŽŒµg*Ú(jlZS2©ۉ„Á†ïìþ!ð‘oú)n¦"ðƒŸÏFGÏâÙé°šŽõðº*ãqgôʸ•([Å¿6Åû­üÐú1·Á!—·¿Bãt‰?ŽL”„þv: ?uÖ'éigU¢ƒ“gÚà ,‘²Ç$u^ðš*äÝE Ú0¿X¶Ã*½ê¤ŒÔ‹‰ý“}¾È !k°Wé'K”Òudøž# Îf6‚.­BJY’Í šJ”Q€N\(v¥}cõݳX¥ŠÚð™f¼¹dxÈž‘Œõ„KC‹£s½)¬Xw¡šƒõ]ÍÖ`Aà2žk­è¨©…cÁú¸ÏåA^§cÜ·,òó¦ á(¦m¼bmŽ82œ% 겯íç¬ËÙnf›‘,ù6øXìc y^ýPä9 ¶mD$24Œ©†ä€UþìøjzSÕÊLöüE‘0¥j¤/ãÔ!È ºÉøž.+5|×—f“ÝCꋦëQ10ünÔ($‰è¸T&Ó®Ö&ª0˜¾r€šBösd‚¨¥I¿6°9RЀ0#?FàŠÛòda¦âÝí¶@Õü1“dÊV´`קñ[Á Ö’;™·rXT~ŠÊmÃ9¬jî´wzpÛÛ¢Ù®âàšø–½éIç™ÒAªŸ¶÷Åï#b´FÐë÷¡ÈÊ×jئԆôŸf¯Ó¡ Ð.TvÓ[’vuÍWô¿«¿$ ¾P2FCšµoHƾ·‰bNÉDÝxúÖt/ƒ ûZCtU<@íÑ Ìf,)—µù…ùeF·q¸Ú@ÍHvsÉñDq%(ÇŽ0ÙŸQrû>Ax¿œM©EôýZ¼kËÄD_m¦y¬¿ßùµ¥§iæW€–³8/[º›9£ù&}÷´éŽïЋ×þ»Œ¦Äóèç@»)ÊÚ '(œ;Ñ^~c%)¹Tõ»a©å jÒÑ~ÚîãËSŸ¥ah½Þ¬Z¯é®â \é]ïaz©A%ÆÖ/f&3c=ÅÚºÉ×÷õ}wHÔpݶÖpæ“"A¸ïÔ¢ÇõÅœ ŽÝÊ<4V…Í£ØsŸò ƒjÒ¶5½ø1-d«ß¡D>õH˜~õ·>ÓD‡íØÕíQ2Ez]¥“R0_aúd'£U¯(Îì˜Qy-½”°—q- ³´\áºåÈ•ãJ€Óu&-£í¡ØJ=¶¿óÆzÅÂHªGλÓ:ùœG´¿Å?¯E6ÁµÒ ‘øvUé4^nŠw"‚AÍÏï„å"fãu_«]¡Ž.8Ê+Ãó±'ˆ?·éÓF5„ÕÍ{,Ö¯éŠ ý},Óâ—°ð.Î=]bó8ÌzåZê¢$í]qÔ6Çqí쇀ώù—÷ŽÌÊo$ž)œ:©Ïíà2î¿vPÍ刱ÁÙÂ7?]­-ß7KÀ<ùlàßââ-8Ln¨Ö˜)>~nv£VÌ»“]³ ç™iË(úÒ#0(§2YK §˜ =£ôöã(à¨/í{æ¶Úà¢a9ÍV£qÞhRå ˜NxCºóF/ñµÖÝlò´ƒWÿ;¥Qðß#[‹R6ß  ÷úœøÃÊ;œè­‡ ¡ Þw ûTxo]0àÕ^PSevúvƒdKÒBŠšBÊgIèL âçJNãMä&/¼‘&I"%S’ËSfB„œQ_¿K¿]ž¿ÅA!5ùÿ3ãzÎ`Ê×C!ËÅ,”ËŠ÷ºß’m›~ÜJ:PÈ;ÂÞ,?Ò‡ðù‡-’Yâ]»y†»å€>ïº{Klá'g²—7ˆÒÙÁþcõµð‰ˆ áÛ,hÜÉí$ç[Àèyù-‹ÎGAÛI™J3¤'☬ow’Ûƒ¡K-1+v?8øŠ²O¼ƒ=¡ùQs9#n—ì‰.Ý}øVͶs5¨¦+ç®me@Œÿ–ÿÓ®‡1­Öžr{Ý3Ì—ŸÕ"‹H_ž?o<ÚV¥¬Ì%4#,_5&˜HCÑ =,„ãdº-îeLÃj¥ã-û>eÖÁçÅ&!Á]¹$mÃí°¸0õ-WÉ+C žŠå×¾‹Ø›f¶ìýÈ @õÁGY¯y¢ÊŽGEÅ)d™éx³|„xß,è‹N¡ÓÚÊjJñó«^äiºßj‡á שþˆ¹Ph”¡óT•2LsnÄÌPØ+õˆ¤n2­Ñ ºÏ;Ôq¹†Ï¶}KXœBõ{óåÆ.'þß?[Þã}ЇZÝÓ`¢¼XN®UW÷F¢Ñp^^ñÞ‹Å7oN?e# ÕQFÅ$8 [žÎ¿ÏŽÍäð­»áƒ9²€Ôjl ªO3¶ç ýHÍSƒÔήQzÐl¯¾öÄ…c½”¬<ÑpEš0ß_ŠßÉû1&E÷Äž!nµR¨ ù-…{x‹={U!)E€ÖÅ¡I§ kªi^'P†bÎÝšZf†fë}x02h Žµd¾s:Ž‰>\¹¿¸…鯡ÆÓczÚ ‡µÑ[€ÆÃT¿hÒ_¯è‚YMHyUG¬Yõ¢Dh0`yŒ¹LèGøZÁqZÎKn÷0²Òf¢õ²Ã°v>æ¡ÓS¾jþ¹nÜáÚ×fsßï³/Webš~®ÐNP»¸è°u_PÅà -ÚVÌæ~¥µ’Ø3ŸG9ŸH’/èéቊŠÅž0r¡úðölâ‘È”6ºv~è½<–’zü–ìYÏ&ië¦o¦1ùâômP艥֗êÅsmSLØË—9—A<´êþøîÅ=„÷ÒQï¯Liö>yá:K¡Ž¾[–dÀa…‚ÒÝ…¸9{ˆ¥A-ôKŒlb OèzºŠdRäàGæ;Y½íHx½¶›és%KÐSŽý(§åˆG?¯è’ÜÔ¿ˆŠ¯2Wù|IÜts-_› fõ Žl¨ª2&ôö§.ò#ת vŽ›ÕÏåÑÂÑOÐûT˜v"y“µ.yÌ7MÍùQsšÒ,A±øÿ,o8`ÞRh+ɯæ6œP3\5vª;·‹}Ü?Åb~ [„’ œì$îòÚú().Ճ͎¸uSLŒøXþ\—•óÎ8ŠUý[q_&{„yŸ`éJH±L•ëÌáâê!¡õïSªŸ¸3Ð6)6Ø0uë?&ßr G}Ëg‹ ¿E„+0ÊgJÝ- …Ru°›­ÚÆ]1ï=dìt9Yµ€\ÊŽÇhŸòLë¡&ÕEŒG¤÷»ª6a ˆãr-àeŠüNÁN=¦#Z…‚éñT|·ºeŒÎ”b/}ÍCž!ré,€f&T†Žbe:J^¦* Å:ÖînЫøð†m¾Ãg–N–Ñ]Ö¢o¦b/e€œÝ%x œá±£;ÅËlßM”1 $q}…íË!ºÄ¸ÄgbêdóÉLB\È3mï¤DGËy?Z…8' m4Õ9û–f§sêYèÔ¦³{¬0x­-Á#ôàbûX²àÇbÿÌÄŸ)ãlQ@ C”­Ù• m~Q‚qnÝMŒ?&MÃð툹ñÜá`‹IÉòh4ƨlý6·Ì¦=Ž½¤Ã ÎÙ9_ ¦hæYˆ‰Þ¼ãõ"©òSJ­Eâ™ý+¤¶Æl†¥tf¨«b±¶Þ<§kîmšXËöäò2-—ò9Ì‘Î9½Iô+¿‡³3|H˜Ït¬Ð7N£w©Rzuñ/,.©»K¦ rÿmXoP 2R/`~ê“æ—TñºÏîm[ä_Ñ(5v,äjõÑ“\¢ú_V:õ7æ;×7 Ö±;`ð>ÒS²ßB{àç-¾•V¾lK7f«)Nýi•’,ú}(ò]í;?ÍmÀÍa¡(OËN_vÃ2Ü)ÔëÂ~¨ã¸}€VŸ Æҋ嫽·ŸÑFZ!…¯Âu¸Éng1ë‚Ýï{jɺ2cZcö-ÍÄp‚›fê^îÕ,'H\aœ§ ½þŸo"Ý1`W‘ÔõMk®±¶S_œÊÄuÁͪòƒI|¾Àß6o¬žî?G’µ>¨ó®Ý¢\xƒ²SL@K;®araÆ® d랬T®ák´£ê‰‚’M³ÈÑ8äÙ½c‡¥5šÓìË=Œ³²DúŠzuþ~®˜<a•ä3­Êü¹ï>æßOôó`.59ï§ë¥‚ät`·úUïí{ßç2SN¦È"§C+ò€éì|T¹ÄÓ#ó‡"VCÑ!´|XÈ°¤9!¡~À/¬;S¬ySŠ*E‰þVš5>“ÉXR=×P\K¥Â¸Ç ÒMRÍò㘴D-8¨ªýw2!¼?´­E—Ç(é~Àìëœ í; wXKØ©cûÜ磎U ^”WÎgŠ?Ýr\ôˆqYM‘u˦Þ|×(EÍc•Z¦E‹A°gîw¹–ÿa ®Éñ5ÉjîýœTƒK-4pøþLŠ2Â"¯6¸ym»zºn L°Ë½u.ãh"”fªÁmò–Ö‹ŒU7ÂzÍõá.ëÛ©â‚Áô£”2;§ÒöÃÝz‹q,h)ƒZ}zì äb‡>"4¦~Am'_="Q‹9‘'ÔTO†Ö\ýØa´/b‘ç˜ZÅ€^­¼¶1ï>4ý>‰QN Éú;‘rJŸáºÐï``k,mJOõ[ò<†£KKêá ©i®„7·äçböÇj-äÑCò'kÊÉ7³CÝ­‚ktÅ@s0->Æ؃>Êø‚‘ØÞ ™=È'Ç߯§&2Éì²Ú §Í{gH\Ìë¹C@$7RæŒBM,å¼·|¨Uî®GqxüÙª„´NïJýÈŽ*ó5ÛšCà$\rØçį«ö&5‘œu[ÇŠ°BPt‹ÚíìZ§ëÐó|¼6½³}ϧjLDÄ!Å£(O79ŽHðÐgÊ}á§|ïëûÄhu–µIÓ 5E*èRtêÍŸúí¸ØÇýõáÐ@÷s.CØ;‰­b¢¤˜žúVÈÄ]ÝΉÎ«ØÏXðF0qjÍß{)¯ƒ²EØ÷¢õ”^Â2\/@:4R#*-P‚çÆë£tò\A»[yHÜ©'5£c‚>kþiáÛê_;-¸ráòÊ }5òŽ\`í{6Ùã©Ëû~l¬hòÛŸ¤x{=ãXÖ­œÿŸ†êqÃ%>VúZŸ™°îŽÃ€¹y^Õ_—'‘FâïÝ©]ëqñ RÓì¥^õï«ÉÞã =òœ–±}Æ= ›áfý@D`rãÛShÔWuaÍ‚ \µ·y²Ì¡ù>K¯T šrm´·Z©ÂàÂ9äG…¤ÍEþ72s\ˆHÚ"HH “c‚‘ý€ø±½Ù58ó•UÆ o` çÉÏŠç‘"] ÖåÎRÏðºÕ6\Q´†ÄgPÌŒgCªÔÀu¾ 4Óô'}ò1¿aݽî$•¾mß|qaM9Û‹VÓo X{v™ä 'cúYâ”Íaº‹=×:? ÎPëœA<—?½1tRdÚ•ÙìdÉUPn¢;Çh®g5\ÔIW±ŒšZÚz¿s$oû Z¸J¡Êê{Á>Vœ·5íz?Õq9CupfÞ"¨\°· &i£ð¦NC3L×ÃúÃ&* æ%Å.F>B5ÕÿÞ0oŸ×¯ÎiÄé&mòöÖÝUYúå˜ý+ÈР®@ô»%ùÅþÑrç­YÚ¦¬ñLs—=MҚ̀­#·²°‡„{ æ^œâìB$óC®Ð²v¼ÑÅ@$UCÚì>‰Ó𔿈a{Ðáõ E†Qµü*3l߈]úojK"õªä0ÙÙú½ãI÷?¯ÙßÕ”ëRWÇíë9ÙÙãE±?*Ø%¦®U kjñÑi–68'Ì Óx;[º˜ŽÛ€Ñiå •ÔMaJÒÇ mvØhWJ­{Õ©üfRŽym=è»B_¥BÀZÔl"”Ö , ðZ˜P~«ŸwÜÁô@8°âB Kä²Íb¨Ú"Äž£èÂÒ«&د)½X…Ž‘n/7Îj A´*)ç·}Ô=€ðýìžø£Z|pÁ„í1.ƪ˜0Œ ÁÔþ!ƒCÆÉÁŸÒ1uÇ8‹ª¾è;€΀ßé$§ó°âI:0âçdÑ=6ëüäŠó}¿¼5P°çñO÷w†ª5™Ìk/‰KíÙtÝ{•n,â̦J…$ÔÁýÀ‹–Öšb@<ƒË ÃóŒY%·ª°[jÚ0˜24XÒÈ—ðåTÏ°Bw™×™…mO8„Vù‹ ¡­=!=96Œ±Ã¹ïÎ8qûbRÆa9¯W˜»a®*`}Ö_"âÅ‘´Ò}ÙÓ£=ª´Ç³ûj3¹Ê/¡6qŸW¶hÏ•ù8þZÜ{0" ” Jìrm2õøIym–¾ts‹0‰¦¨ŠgÓû zœçñ> ÄÓ¶ìH„pÎOEëh þö[Nt],Í!Ý47´\Öu÷bý|Ò~ D§3BÕŒŠ_’®{ôøü7|Ť¼H™¸Î}l_õè´w@²¦Ù1êÈã¼ m÷‘½¹ZêâÖ£[€[¥7ê(zHÿÚ,£í 5ËÁ[§y7ÑÞxt®šÌp‹c=¹ð¤‘çŽXènñr2kn >H-“jò)”Üou*ìíÌ*‹e+–ÍsDý&ÝJ½ÇY®Nè[ÝUžZì5³à7þôvzZ’²di ÛjˆÃâçP1<.!E:Úî8Éöüá¶7ô6%;8f‹ýŠ-9ì~ýÛM|ÒOÛ1ì9µý©+XwŸOÏ®ºh1poflHêëÆÆæ'W¾[íÃ5¤“8Ä(ö¹„³M•mPØ#_Q¨p=à:Ċ̤ü{_!vvµ+›¡§úH›Ø!ᛃ&„¥E 7áàµw½vs4ÅêaÓø,xšPüGOöûX¯kh´ßˆÄò gC üerí XnÝà œêQç0Šó}ÎF=ÌóÇXvÞÆ‹Y´ ;É:QÆΩ†ç¬Ë•ÂvœÈÙšs²x;žË»ïôÅijMʳÑñê}æŒLzìsPõ̯.A;zÎ(æ‘F^ Z¤ü}cr·¿($Y²½©#¯<Ê1^´ŸEEoqÉ»žúŽ%žjבƒÁpå (âz˜¿=|œ\µr|ñœŒ r”§K´Oë!íè:3Õ+O7 y‹u©ÊlžlÖ©.«Þ¼lQhŽ,|Xh¼Ž÷ÜÜßúÜ¡0s0Õ¯ê-¶'ÀHvZöÓ¾Âýè7IòÒÀº!«½|øVK—da±=²ï¦‹jŽñ>x€$0’NjÉ Æ¶@ù2þ8]ñ1 být/„)*|LX„»@é‘X„sÐcïN¶ö†Ië>½bw㢿'AwwÒ‰Xèܪá%˜m ú}¼G±’GKj@µôÙ}rn'…ß”‰QG9R7RÂÚÖ—Ž”©ªÉÓ \‡ã/ˆŸ«Óÿó²Tì£lMšª‰›®î”²™½»„-û¹±Wgv¡¼ä¿ 3³WWB®¯åNN¸e‘i¬JÝh„ØÅÛŒ sw\ŸÊŠ½#—!I$éxÁ7lHtì¬ÿÐòÄû¡+f@z¶êG­ûã¥ä’L“0¦ÑDw¸^Eü$ØRK©±;F«(õÙ…s‘ÉmÂc4Õur( ½%xßZ£Ëâü »i8Yµ=£Úù;+~®[¬5åd«¦5dœ”ò/¦K)f–ñd âÒ^@âÆrüýżSp&Ü܉æs]6@ÿhGréàQw5¡ì†áæÙ¹zÝÉN 9ÚŒ&’*‡¾mõ¸Ï*ŽZÕcÊøcÞû*G€¡¶ÎK|§ QË­[©Ï†¿Æº\H¿Ö˜1(l·(JÅŠçö³¿«Ÿœ™MoÀ i¦÷ßtÉýëE“Œý««Ù­ÈögZ›+šæô–TÒ)›li<,Í}{9Z á°oõù¡:ªî惔Ÿ¡¯{0F©~%ï¨ìI€gg ›vå¯ÚÛù§RêˆU«Ìôë"_¥ÏoàÒ¿ÞKèÞ+¹q[ð‹wÐCèñ« °®ÀlP“º:ñíJÓz·d@ß™æÜI丘‘À_¦_oc=rÞ%ðíÞÝ¥çºbzb+Ë<Äê·¡4ï*'}Ÿ‚)LÛîmª¹s½»š°ÿŒoú‡œÑ! ÷¥i=ÞŒ ë&«V:Šz™²·‡â/ÅâûÿO”'‡­‡.o¼ÓE¸K­ó³o«=õx¦V¶º±4X6ç«+A·|%Ÿ;•,එ^õåÇŠ%Þ˜³šº7® ±ªlôû˜ÿ±-y+WA‚ú0x§̈ëH$uF°š¡ø›—ÿF}¢uôþ^¸üŒÞMZþ‘éc^¨k5ÅÑë<˜>Ëàä»]4Ý÷S¸Ži,âØ®QË­ØST$Cú—½²/ƒÒº~mC•É@²`r ¦:µð3Àc"KHLǾŽæVD#æÿOz†´[–ºSñ¹sø#wÓD`46S£#³!Æyž¯ù©B@E}¥.”G‚ßø°­RŒßôoÙÈ<&-ÚéC¹[ÝØÓLøi­ÍÄøÄ÷òÞïyîEeã]LµÝâ6hnÇY*G8˲„êI–)ƒ A¥0üfëËïdþ´ðW” CƒmàV…Jh·ß!î3ùÕëð¼¿/ŒŠ˜2" _1ʧW×T™›PѼá¶Yÿhyz|†î)ˆ$àÀ(Çý~;²žÎ;&¡kýÔz”üZ´™ZÃì¯"RÐkt¬Áð69Qͦr°‚ qü¢òl¼=éz‰ãð×›èÅ CH ùä>jüûÖ¼¥H1þùÖyŠª„Sm'þ\Ê$§åɤ‡lQhÌñÙ涣Ï.Î\llò96˜WôJya‰ç$ÑÈ&C€‰i'Õç!Þ2!ØU ‹ðS_5£&x=“T°";ýfãÛ.®bNžæŽÂ‘?®¥ Ä3Å£çg³²û?¤éÚF€(<“]  ÄOœÈ—I.P %€¯z †ÀÞV%a¾ø”…e‚ÇÍ /0ñ'},ù¦/¢øKØf):úŒº§Â7¥ÒY˜™K0o,eÇíàìfSO^€Üð.«¬ˆ©ä«#kó„3I¶´§06³ÖÿFc’–D½ÈÐV.‰  åN ñH(QÕøOºÏá}3 üXuͧ¾Ô·~|Cƒ~$H´GIÇ,^#r÷ùЛÐU«èFi•)/ënÞ4‡z“x7Dúûý4¾«<^&ýS¸± ÆÂF*ÛÚ´…ÄÅë"¿M ¸jf“Ì,¶QÙJLð4ªPŸ¹"â :†£ VŒ {¸Øû‰@i־󳳺°1X]-¥¹¥X2¬ZÙ%‘ž‹IƒK²7ýŠµEjÑžâ®ÝH–øC&–‡¼”«¯ÄŒ]îcll>7›Êd•4h7í­AiÌ‹ÿœO®Ñ”Õèëéž?9wr!IaÉù|M¿·øh!³¯?A²¡û‰¨Æ€Ö‘Š+¬JÞJ ¬E+†²<¥$I¿ÆU¯×" ˆŒŸdÙÊ·ùE/ö½sf7‡d6<—ŠØqF܈©…üRR“îxÁÁWÕCèësÂT´%Hrߪ‘®©!äÀ³D1l—c–‡[ƒÏIKîxƒT¦Yc¼#ËbxN.N¬GŒ˜ª%x¼òÊd•Q«2•˜Š;)šhZLM8¯ôæœ{Á‚Ø!Ýi¡ôn¿Ý¥cPî3'J½£KjP‡KCÛ¸îöÏÏ[•1ô1ʱaÎUr”acn•¶¿µ´‚5É8õBÈÉ/^Ã!ýxÝbu9%ZéL/!µÁ~–«ÿ"/° Ó'¡~»U ›ÚûŽK¥cvè[i²ŽWƒ/këã;‰l9R "¿}ÆCIÔø€½ŽzàWaµ3NÇ3ñ,mÂlx êíé«·h—R`1N»ŒtµÕZœ~–g ~„ËJöW£at»qìÆÁÜûnYª”ðbÔdïµ@ýñmsß ;;a»cœÃVŽ\Åy…÷UeJ6îAÔ.<òC<ऌ1žÎH8ç‘`c–jÿŸÊe%í„  ÛòÔi~.l×Fü¾'N|ü–¥Ø†R{ìW ;Bûþ{Ñbb“dUD\ñã’_ê õ£zNt¡ÀªKZ|ˆß’G4-ô¾\ €Ã/>º[±x$§›¥a*‚æh-ÜHhl‘*hŠ* ñ{K}W`æ'ø ÷%=¶”bÅȶ’(âmÓÅ¡A“#W@™y¾O2¼ÅïÙÀC¢ycd°Š-{•O&ytŠ±R€­ëŒÏEèû-|³s/éCñä×­{7žlä¢8Ó±BNÃNÄxh(aÐL‚™™0•JF¢˜_ÊOħû¨¯5.U9˜·`¦·W' úê ÖÌ\<‚8w~ Ò`RõL°aZ+HÆ[-„˜PÊت:»ì¼Ãr›•Tpá›NeÅ‰Þ hu#t­5ß1{”µ£ôf÷ªÇÐ ÷„›ì_øÀÁaÃÏØÝlÅ9ZŠÚìÑ_:UV^=òT¶×4 zƒknÐø§±eáz3Ćò‡gtøåÑÄPž0(Ï®,‘MêÉ´ÞÇgCÄ,ŽbÀ•P¡Í°¨ülª<,.E Þ€{„,>K÷RNM MÇÙÿÎܵ‘ã®OA/¸[öáÐ(TUsoÔZû¹××^ð̾ÉpÌ7nÙUÛ¾¯k \ð3”°@ŒÊE¶nnfµ®ÄG`nÿô»Âñ¯\8SÊKÜ<#— D Nq=iÜÖæÕ|6âÏ!$.¿áwÎYü¬Ç>bXe” « .=ñ—Úv:»Ùï½É2w΄÷j«`%<ñ¤;{µi3Œõ÷És™<*;Y· ¯ËÕûú,ˆÈƒiK€h2'…pªìþRxˆ[GX• úן2xx=Z'©ÒŽD9uNÓ¾sªÜ'ÒKVj eи”Ï<Œ2‚‰½™Â¨ê³©àŠÆÔ“Ð/ËÑX™YÚÚyZÒ5¢<Þ¿{r:·£q†‡þ„&ÞZ¯2aBÆß]Ž5é…‘‚Ø>î0-¯ ú¬ðÔ&*y ¦K.$|D£¾3ûâ>š<Ü@‡ÁÍ]†zD'ê¦.é&­BœÍ@Ô¹O²ß„¹7åãKjñíWžÈ"kŠžÊEAQeGºG‹»Æ‘T¤ü™efcÊÛ…d{YÈxÑq9rƒn¬Y“K÷ŠpnsanõsxF|Ž}‚ý¹#-Þ4³à8ÒÕÉzè3¯a ¾'œö¬>Á-¶ˆPée9ÞRw £½„èíßA}|6ù0˜¹§É¥µIb,bºHpPÎÀØQ‰2bµ35hrœóã[-MK©Ðmýà¢).ý§’tú\OUss~ýRß8Ôˆ7ð¡@‡BË—lR|Ä̱ܼeø!Ö:)¶ŒèBý¢ÀµÑñß}Ó.öá¨0\Ñä¡ãzñ©¨b’¬ºz´RbßãdIx¦‘:æé¤iÖ”ñ§ŠwµNêj"wøGd+OA¼Mp ë }˜ëgÎ 0œ2t2¥"r“Ú{ùÅÞ¶g‚¼q gâ ¾&.S çÃx,íx ×£uŒUh¬q¯ÿîÅ%H~‰#W¶’™ÙÙhX›á‚àÖÑ>G8øÏù'‹Ë-¢YÇ”>È'H|jè.¡ß_EYŽçÒ:êì29µO›‘Öáòc6xƒRDveϤÊå{‘ÚÀdòÑÉÃ2ü®…¿Ÿ¥±ð¯„{v”‰SÊÔ9HŸ;‡8,µ/ϧéç@ç(gJ«?\â÷Ô¡¾¦j½õÌNß› g%®kˆQã§I´mPõÄð*S§ËmRòÖüÂV?Q Løós-ßè æÀa¸°áã I+Ü/…_Ÿ¦Dœòƒá´çqU¯–Û*ï¦Q‹Õá,Ôòœ$[ÛѨrm§ÐÔl›|†,)påR³"õ u…ø-ø«¨¾§CnœÞ¹|×ýEq¥­l‚)”Iå{ä­¥‡)¾ëWÏò,|º¨å0x¨^»ZJm¦}Ò¶`Ü QÏ|{]‘¼§¼<‘ŠÅy BqÞåÇÂY:™FúÓƒ]¾}º»Zè¤gªÑrÊcŽÌÈÜÆW?‘ô<ŽyH>䨺cc«*0Ö9Ò€í ®8&<Â<‹ü4=O‘M<äÒr–T;£ ƒk¼yœÇ¦9T#ÜuèWÓ$â¤G+iRG5"æHiµ"ï&áDÚÝI‘çÐB˜déCÒã5noIÏ´¼Óã(ºt9>é»ç :&µ)0IâÓ’Ï>ë¼ÄŠ endstream endobj 723 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 725 0 obj << /Length1 1758 /Length2 11224 /Length3 0 /Length 12334 /Filter /FlateDecode >> stream xÚµPX.Œ»»†ÆÝÝ‚»»4ÐHã,¸»{p Á%Xp·à44àÀcfvwf÷ÿ«Þ«®ê¾ßñïžsnÓRªk±JZ;[åœÁ¬œlBiMA7 -­6ÈÃø—…Vèær ýC/í´ðx•ÉXx¼š©8ƒŠžŽNn'Ÿ'¿€‹ƒCð߆ÎnB /5@…  è º£ÐJ;»øºlí<^³üû`°bp ò³üétº¬,À ; ÓkF+ G€–³èáû_!Dì<<\„ØÙ½½½Ù,œÜÙœÝlÅYÞ ;€&Ðèæ´üA jáü“ -@Ûäþ—XËÙÆÃÛ x8‚¬€`÷WO°5Ð ðš ¥  Ps‚ÿ2VþË€ð¯«p²qþ'Ü¿¼ÿÿélaeåìäböm6 G @MN™ÍÃǃ`¶þÃÐÂÑÝùÕßÂËähaùjðgá9I €Å+¿±s·r¹x¸³¹ƒÿ`ÈþG˜×K–[K;;9Áî(Ô'rZ½Þº/ûŸmu;{ƒýþ:Û€ÀÖ6P°öta׃\= 2ÿ²x¡ü-³zx988ø¹@WÐÇÊŽýàÚ¾.À?•œˆ_ëðsqvؼR€l€¯?(~î^@€‡›'0ÀÿF(œœk•Àh £üýU ´ù ¿vÞ ä0âx@ku‡•Ý_ô＆wêÎî ?ž+'Çÿè^wÍÊáõ)qíÔŸ*àë*ýwJY°•³õ;ÇÅË°ps³ðEymü+âøq¾.§5ÐçϹ°³=^]¯ô6În(ô“À.ý‡èOÄ/`Wûà°ký ¾ZZüì–£W?«ÿ žWôº«[ÿÁŒÝúÀürØm@ÿоúÛý÷ùºØ½¾K[¼ÊþéÀ`·ÿ|­Íñðµ8§¿!çk)ÿõºŸìÎÿ€¯µ¸üû5°Ëëˆ:ÿ£vÎ×êÜþ_Kqÿ|õðø|½4ÏÀ×ʼþÁû5·ïŸð¿zjåéæöúÎý¹s¯ ÿ7þóQ}€V(«KÎVÂaöa]÷õ’¤Þ¬iÑyZˆ^#«ßª[·ç#b:c]^È–Û­dúX?Ö·ï² 7k¿ýNÚ›#;R5:Ÿü™%kÎB:QV¾ Ï”žH6 ‘#“±jKìûÿvõ× v€m‡îQ¤ýàê)€¡^Œ{ï=(ïÓ4T½>±ÑدãSBýU=ǯg\±@[d™¿HD…àÁJŽÄ„sჹps;S8óB¡˜ÌŒpÏ]æg¸Í•ð°øn£F›Ë½—˜†Øˆögr–ÎOê0C‘pÙ¯²ìÛðŠO»HE!:Kæ7V,¶C®Ü:f,¸m Ákrõ çÞ‡t@=é0î^jCUž™•~]§Y,®G·üð‹ÔF×­nŸ}&Ùšà\Ó `‘Ÿ2µ½ Ú{jC_¨»¨°TÑûÇTéYr–‚ýΓ ±Þ/Âß $§l^Ò“zf¼ ñ¶ëz†7™z·j¿¿™P*QùŒŒ¬DϺyž*.”ʼnËM­ñ<(æºFC‰Á–^J™–ÌÚ`Ћp}I¶LÞK!Óú„ðŽ NŒ½Ýakߢ{wì‹ú'*ûËþà”oDÛF8kÔø™F.ûÉ3L3TijËb\‰#ijU¼[ʱö'÷¯ØÓžß–áØ£T€Ò\Ì~ÉK>D˜4LͧþeOß"óÛêeOGÆи¥çbÒbt2ºqÉd¼'.ŽRÙ“ÒgcRjJøa=Ó´¸^®½:7¦ƒOÑ£ö}=n'”¬©Æ!6”†ù3áâlÇ­##eç“7ÚN-ÅR¿÷ß^ç}˜Õ1 3” i¬2׸öe4ßœ%üvok $–SÈ,sÓaV |!õ¹±=ã‰PÒ?ÿ„žè×·TÓt—š“Ž¶ÏDóÜ ¹ÌR“Pyª.7Î@` UÆ‹†Û­JÈAzG[·H¢¤ªø+Õ|ðcé\À’ßçâÁD’Hñê¤X|ªGq¹T1üæ]ßR=UQJ´Îõ%~2æYž}Öó˜ÔØ©2zQÛP<8…iCF'_hч EKO.ÔERÌÅËkï;Ÿîñé‡Ë5µL?”Ì«O´d[DÊÝÕ#2| Ìo$j¾Å Æhï­ ÛÀ«Yï «^‘b˜U £C”èÇ.Üÿ>µGͺ“%äñ•„¢ùì$tM?P>_koj|ü2Ø!öÝý÷0cÔvhç<%Ë·– ö4Ï‹62VhÁVÏ€”2`r‹‚/üŒË|«; y‚õù貪û×yÁ²BŒ9ó}èfæaÙNÂk<žIVDp>nŸ({6”¥Ð¤{»’<©0"±‰”dŽÔ±œ3f»¬Þ‰8h;öÄ‹çí˜P>md/¯‹µµo~y¿Òf–V2n/*FÆÙ”¦à$øHiþdHW¤S„¯e§1á ĆŒ6"/÷¢qÈ—‹~7äŠ ²]î—ŽT­‡‹L2ð{îuRxë>V‹ž— ÍÁ-²V‘n,¼{CÁ‡™œOgû ‡Nã{½¡‚Q‹ˆ^º¹x+Í@±s ®åžúôôÉ™ŒhèÕt§±mBMcoE/äM—ÛúKC`Ä€ƒjQT¼æ±% ­¾qWhsj'¥(ÓÒe[v•ù û´¤•µþ3tþÇ\e\3¥k¥Ö³ó•ß ŠlÐŽññçý¾TkNµ½”fÔk>–sw.¼ªFÏLš¾î™i4'B–ìgMƒlÉq¥G8\?›ÊÕ­À,þÚyŠ;䤱<ƾ*†èI4"òvy©™VFi"›¼aÇè^ÛÏ¢_KŽ â~7 Õ”u Œ¸PãÊ~?IhíHÌp¦žÓ»µÈú½XhéüøV¨¨Ô=ÅtÑæÊÁ¹? Ž wG¾W—#.{#ÚÃ}ó-À|kjR›$þž*^@²a :!î˦Ò3ŽYs½ÞÂ7×ý©þo zUÇ èÏ$<…ðî‰f›_ò?RÕ°Y²|ŸýFPðýð]NÁ dÿ‹nH¿m‰cË=ñº€Y;¼|¥½ýŒ´œvÍ`‰U§Y>]fª.¡D€”@š^EEqǘÇxA$[Û_w›ßÝ—‘7”ÈÈQ|ŒnF(Ù ¥m7$ Ök(&o`¯E½fÞÈ0ÌZÛ Î°¼‰uVšåùú^¼GhŠ·”HðfPöG¯XtZ+‚HcžhB¬@ù¥2/÷ͯ3”豫J8†#ØL.±mRJ¦øà`Rz’ÚØ"Õ`4BŒ%~2˜…b1lôŸzn¸=œˆÝcP¨ª~Ê«BÌõb¿Ë®˜a¦22n> é$LÜ"2žØýœ©ØðX[ „)³çDÓ(¨eåÈN/¡ø¦‚§åÉjBÇtcîÇÒÄ ÛúµóàÅV9ËšWsÏ@%óÂ’¡Iù5Õ>8ÔO[šVa0r¥**ãÛÎm®Lè‰ÃM²Ü>ñk­ó&æ ÎjEˆ7dL¼»xNÇÐ:É`ÀÆNxcØ£ëËÌ/9ÀSØúåië¨m»Þ·«w}ŽûŽqå;ï •šŽKŽÿ˜SS‘bãkù'ViÒëÖ"‚¦3È&-ø¿¿%!nn ,Ì¿À}¼+ív-ýì©S8·êÆn¯Ì§* ,Ó5þînq®0ɯ]¹Bˆ–㥮µÂ«¿#~ôxPèFEÆì%þn®ÜAÇO=˜úÁk‡7?÷ÆkíäLk;X~&à®õH"ƒ[VËJ­Øö-NeÈ'yˆn‡¬ÚZû=[Q²]þp‚Cé;´ ïÁvæ(Óé(‚ˆÞ$¼Ù.»bþ!ªZítºU/¿EÚßHCŸ²•W¿É9®éÊ :mÕM|Ú(¯uòž«åÀïã#Ð4ÈC;zK'h†X,ö°Ê9 z3¦W—9  >œ6Ô4ZÎEÑŸ~a ì;bëLð°ZÑÑðÔ c:ølRöIïI£¶ß׬‡Xéç°™þ[?sŸà¬DŸ«z3ÛF[ã!…6èsŠÜ†„Ø(^§AÚB Ù?ÇY/{·6è÷)\èÞ¼kÀxF™êÍþCÅóvÓ3t™‚$Pþ]”>A_~cZ 2îÄ9ÎD|ñWPuâ™ÍàÄ$f4x//xØ\ÞgÅfÉ/ ¿ðéË'<­Ÿ ²¥‹SŠ_e‚04-Ã}Í-ÁA-LQõéMÈmòØ'ä™ÎRŒ…xQüø”)Z¡Ç åÓÏ[æÎh∂µÑv~rñ‚RØ(Êœµw'Ÿ|4ˆä“i8²—ëM¸?Qð¨)– øîœSÅý˜9o_Pkt¶eìô9Ü•Þ²=KëDà PDŤsvì"âH¿£ïEo£ 2{œÖíTu> Y‰ »vÞÀ@²/öù÷<øé:w¼Ÿˆ°J)åÑعb£hB΀t3Îå÷äÆ/Àžag04jÀ)i+¢ó°œ6iw¤ópýÝís+¬)«ŠsÌô”å÷&—@Çõdo^6ŒžA ,ín¤D‰%ÆÒop>P~Á2³¦D^lä'²@7â¡’þ!Iù©áElĵým¨§{ír=·pÿÈYRrÊD澪8I “ªm…D ó¥ÃG23ÖÛÇrì‡,úõ\N®ƒbÂÆçëF1Dùô°; +KVÐÕ ´w³–àL«Iƒ8u[7ü õTÍÅ=ÿÔz®Ì¢ u tÆçš±åS}ÑõŸDqV©qµáÓ¨©<â®b{±”§þ\ziÍ´F¡—7Æ Wnòº pã-vÜS¡u˜œéf¡«DE÷(‘‹=óa×£Ñî–^(¤Q³]ƒ4b¾ç¢'¬»þ152=ßÞJ}|î˜|Ó6ÁÎÞ¿· ·uZz€×$”{P#Å’íóÏmžêl%Äè¤Û¬n/wÉb`~õùýÉ©¬sàKÄÚ‚Yv|…L©¦Å Ùòý˜¸ošiQôf·Îk+}‹ëwÊéÈáöMù²Ç1ùÔq?©kKß?ÑÓ>8À;ÅÔæ—šyéáÓ6Ši‰¿Ô7ç“J§»T Ò(?Š»|×xE Fɘíc”W²¹ÁK÷½÷™Ü˜ZâÂ6 ö ï4bèŒð…Ó{Ÿ*Fÿì!ˆf¹‹ 2“ÜDú[\Ü^w ÖP ¦ƒ/C¢,i4<ðïN a–d^âQŠÚ²ï8¶ôÍlµ¨6µ7zd¿,¤NÙl¼ùÕœe‰J¦Epn.˜‡•¹ÖTꃋîòro%24^¹".3¼pmR÷p›A†ôä¼HÈ‹4 P5SUzÌ ÊÞk1ŽâÌ Iíù9[ì‡Û"ÕÅÊÐeš‘Š<3 óß¼äªf(ÓwÐΛq>õhÃîÔò ÂúºÈÅ|þ9(¶ua¼E/í¨¬ÚÉ87ôCw>q3í¦éÇ5Ž ª§ú¢œëèybI€qúPÕfÐè wÎóÔ‘ïÍ;U*îÔÐä"f ƒ TTÈFÑU:_¼yäû—#3¦wv šVêˆnx`¬Eôºá@Í.¦ð¼¿€v®O>„¬íÞh5“uß,®/®ÅÜÖ"^p«×*),r2Eaàiâ1[ö²x§ÙÕ­púÐœØu%9û¼Àxvﯰç›WÔ–C*AˆRœô"IŸÃ¶"E¶Š$pËš`VcÆŠ’+],T0J Ô¾wVpŠt';žKÇîA϶+zð$²Fšä„Þ°8 Œ¥„Úr[ÁÓ¡}ž,¨„ÊQˆÚ™› § w䔎|.°3 ÷IšŠt<ÑséÈw2 w@½›¤£tÙÏj€ „³vË·ª‚gÇ¥8 PÓ×ñ\®c*‰TQŠ.w¤[M8] ÉÄ~åeÁNTû0?Su ¤›å sú¶ZLdgoõ3î,ût1UØpeWv†fj•R] ê‚cEáÁâê1hn,W¾%ý` ›ªñIä_*X•" Y¿Ž0Õ?[´ÛÇRŒ ëI€ ˜„Š£kΊ¤‘•¨bÈ*Bá¬ÍÀZ¨¤ïŒ§.ˆzæêˆLà…‡®NF¨ÍZºWNDƒÓÌ%Òa¨iXD*r˜n[z-YÅ÷ù#k(R—Hl+l~ïÔ‚ œLòÿ.&ÅÌ‘¨‚AsiÏk)ãh´©÷«3ÏþHLâyɨù­rûkæPä€ÊÓyžp¨Ž\ý׳­–ª•N>+A†«Þ‰7½MNGŒNvȸÍG¸Ý VN·í hp cžFÁ hì•æžÞ¦é/'Þìi~ÇW¥É¿¶ð£¸…gxlw®ÝY¾îC¢‰òû²ûÖϬ5ÜÑö»¢ÈOÃÍ´˜C}c¡SêËÃ/ÅüVH/(dÊð”¸a‡XÉÞáÒK‡'E±$[R’Ua¼µ1P–œ üíz°DÈq¶Îf““À¾±rf‰­µÝà­s£Žø|ëæTÇÁ»‰8™sV¼v|w)ÝÜæìé‡zFŽSú¬Î@°„ "¢ÓFwè+¦¼p0vMŽƒA1ï¯Â-œ\ƒ0VsÚ)c1¹¶›/ž“Ɇ* rqrpC:Ý2ëeã ”eêäg´˜%T¢y¥‡×Yr‰¼oî[ærxD»ø¨TÞy$˜¬K*2š(§æ!¸Å1)€3ê ¥M4(ºq* 4tSòê/²c q†¿p¬b¸Ö“t°"J…§‘¤â2{0ä,/åëÒ“®ƒáÀú…-™ ä)p’ÊÓ¸›d¦þÜ0g¶£ ãG­ó[È*\¢‚ç©/‘¾û'q\Ô7“œä½=W_…Jåák­ë\¡+¯Uim«áÁÊî{~R®ã&öÄé-6ÏRkn' 1ga7?A_ˆ&®x]´â>öI75~pB ôZ!˜hÎû½“n€ì÷UëÐZbÛgÞÖ¦6ÿ¥ÈÔÂTY«æ6µ,„ÊÉÚØ%oE%§oÙ…È•5¤&Ç,øN®žè‚7¢ÍhÅ`¢û¢„òª¬¡Ó0e¶h2þI"*jã‹šP~ãž[ƒi¾J¹ {5ÚsxᬫD“LÊ£A–Vм”‚¥˜ô%Ðè<¡]âk… myùè{Rj%þXŠü…ãÇÃQMûä<.É\1Y¨iãÆ!±æ»YQìè£ Æ{[{ÉTzŸHK)uk‘ºïe¦s ,ó”˜E^‹§TEÊä&‘Úv­F˜Ñ~Q•IÁ}r£uMîGI.fÕPëª]/(9>dÙ›£l˜EÓ󆪪!2¤äßû(ìˆðãJü)p.”ÄxçbÙx”vñçŘ#B™y:}%*ñ7áó¾J-žP|îJ»A®!g5ÿ…—–|9•LYVÁê_u£©«âƇlMƒm÷Ñ»HRØñ)þŒ–Íœíö'ºGo*Š9ÑåhPTÁáms"˜bÀ¿›]jæo¿§?8íámªÕÃ<¯Fy÷{«y2©ŽÜc8@ùXÅäg¿è–,ô Ö¼íw¨ç+Áæ¾,žþùs9h1÷º8”-X+y”P‚³;&ÙxpÖ¤7ßRo«ˆ²Xu³Ìeßbàœ#Å&±Ë1qÜ9"+Öì‚x(í&tYEŽ Y8ÕÀ‚-ÙƒJ>ÄÛÌ×k!…%ð{“ì$­³Ò&ܦáñLú=ߨ6Æp«Û~8§ÙßVƒ‡bt_Zß8³rNè¼y” ‹?ˆ»Ò•€«ÂïÃÐ䋼+/BTØ`²Å•©tãí.dz%niB-çsó0wõÀæ?€¥P¿\;^†¿sùI‘¯0ö^´w‘épôÊ¡]àù^ù!œ“W$'¡ç`=/‡ÐÕÌöËéu¶É€‰\rEô²,¯Bd!zß){=©½YÌ:\‡¦Êéw9÷n/n¹nGÞZclÄewcyé®rè5׶ê(+ÏMº¹u}sS£v£³Âçðc%9T-%æ “ù㪠ÕȺÏjpÿ^VĨa\ÉSõê.—X5êoƒça·¦Ffz ÀÔ-Nfq0?¼ø9æXà‰·§ [|¾Áf.á/ú2uë ï9Šçᆻp6Q¯³‚ÌbwϤE&â±lãÙ'Qø{5®>­Û³·nàÚú_"ÅÁï¯ Ú9eÿ²°å<øwcOF4— Ÿáê È}\}¾Ø–(ºR›]ˆ®ŸQ‹;~1„3Áº(ЃA´¡ð…%Cü Ly9ð«Ý-kœ'DÉUì‚Ÿ‡KÝ´ÉdŠ6žµs+ôÖ‹Ø(Šl9èñ§çL뎲§MÓ-“”Í®î±H²fÍÐe/QIvåLêy\lCHUkTpj¦ìÃâù)äW›/ÅÉ.œEÙžž$Žôõp‹{°¡P•ïÔë\µ­ãš& ²Ç~ñÚ©âg¿¯*•‘žù†ti<Çmóá¬õÁ:?FΣp鬊ŠäY1t‚ÊÊÕµÞsóeìf9Ã+|Óõ£2õš ¥Ð…èÙñáibc™rœB¦¯¥}|p.•‹‡Çͳz§i¬—¤-=…—ucY~žA(‚J…õ‘ßiñà “Ý?Hîb¯+PŸ˜wSBy/þö&q̺4‚}7ÈïÒ©yÄ~*ÏðãkÇíX·áþxµš§xop|)C^ZëiøIz´ÅZÉ&„ñãúZ‚w#¶§ì:§yú{’N "Éúõ#¶õͦ¿NðïFɼ@2ñ9&¼@1i~SŠ`Á ´}´¼X¶…¼^~âÇBúcoj¼ge•qåTn_Lf ôo’ü¿-+Jgvèvð *ËÁS"Ñ£“á« ;Ì¡ŠNЧäê„’²4)†.g_ø«­ó`ŒHÊ»BE†Sg?m`Kÿ ‚GoÆÅtõßjJâ|—HŠü¨F!öØrÝÙ6$Ìë¡q‹x_ôëùƘ‘ûÂÑüÛ›Á‚%l(Kû‹$˸' €j“Î…¦º’£Çl¥Qi÷÷¢JŠØé" ÒpsþX?ûÓÒàûÎN·'úú7rx+nãüƹ­ª} 繈×MêÓÎa4q¾qÛcL¤ öÅü BŠIº0}dÈK,$>¯á±5,U}ÏóÑsý4¸£úº±nvÆ:>ãËlÍuJ·¿Ä>ZAÞK‘\< öÜÃ=' !eRVNèƒM%#mDçÀ}M*4ã9=Ãdÿ‚ÀYÑ°º%¼º4¬õh ùOš 16J5GÑ÷´@5‹ƒSÛ™éìæõR15Ü›žDAlßC,çÓ‹Ó‰.]_'cö%;15ûÁJÄÏ²©µ­ïÎÊ‘S zNÆ !U-ñ×ú¹HòŽ[Z*ñÎŽ%[å•`Ÿ†«®å:ÐÎßÁÏêïs*ÕÓð°¡]ßt ù‚ql*·‰3ËØrSýÂQÄÝ ^ü¶eÏy—Àµ‹G žé'SØ3‡œxœ€)WBQ êÍ›”÷kºD£É‹éÇËϺgó}+ btéŸïxÊÐkF«rîwõï#5ÇÔ\Xi¼¼y‡7P%Q±¦Æ«m…^Àµ’«Qvu¬/)×|-%œò'”Öožn5Ÿ=cMñÇHÂ(• †‰8vÆ¢*Ûhiš¢áŠwãœ]ĆŒ·ý½1Áˆâäc·Æ4e©î€ÏÉÕï‰ë !ë3a®ñÛ¥`D“]ã‰×? ™ÊY“Ø=)ƒÞy%>þ=L*n{ž…ëÕ¹ÐåŽ×؃c!?„|Ç.lGÅ›d¡|„ú™­”qn ¹Y$Ÿ¶o“ý)èË+³E>ŽΈ>¸ï¼Ù{¼ˆ8*™ùÕ…)¯I\%SP£™®´ÕA˜9êTZc/îû_ˆ…U¨æTü‰o°Ê]RáìP«`2<½Kˆèå dQ¨žœ>q\Y¨Œâg…â]´Ë}È–ïh)|^ž1‡×Jã>™‹:gˆw³`l1ž<ÄT+8"šåt.ôª{ˆÅgˆU®¡ c´=R¬«=g*8ãÕ`ß2aRoÄe§qì½ Ôײ‡>´¥Í›`ÓCqôÍü ÈøÒí*¡ì*¼=ài ‰w1+¿ÞáÔP˜$ãPŠ¶?å­.Ř„OhžSç%t1®ù™Èªõ²tH¾†À5>¯Œ4µåo:fD¨S)ìY¿o鸰ÀqR¶=é÷•è-sJékzxéEU n%o}¿XÎ羚ö3Æœã‘Æ”qÖ|˜œ#ë²{ w¥î°ÁLjY«lòùÊ9Ÿ½ òbNFNÔ„`ÚñW‡Úý K½¦æúÌ/c“ÏZxQ¼záTÉRÓuS,¾} pü´"WO9öM+îhÛ“[ 1¹Äî÷;PÍFàíC;SØ8Jó† <2eY›^2‡=$R°MòY2¥¼x²Ë~OWË(¯¡üzÚ¢96¯t´¿‡búsdÒ»›K¾&Eä¢*fÄsaTÝrúêj2ÎT#úÞaÃoKÁ SÌpêú{´[ƒfŽà:"Ü#]Rt³ò¦™–ªòXŽ×¯/&~,N«_«È=Üa”ª-8Éš¯3¡« `Øö“žûNزeøڞvÌŽ‘ÅÅýÃfUKס,B1·ö­bú‚IL±ì(+g……¡½r­\¥–ÞñÞÚÊØ\ë6 ß2L¤ð‹ÀPÒ¼•ÌYgi¢È?- Yœk°“ûR¼/_I."·QÁQ(û0£ám÷ðük&Á×ÆÑü•Öõ¤©@†TÖ5ž{Øcѳ4bÓåNgØe Qt)N|/N¤OO“r–jÐT…:ØÓQ4µèÞcšcŒ\m±hÖt£+Z_ Ù5kâû¬LCì`>ÆŸÕ&.j}ÿm³‘wFÚ+=ª_Î¥ï/L1b·˜çY^Lw:e>;{4¶E^1&X«R 7èy9¼Ÿ<™DÓ!µCE¢7Ø—èÏ€2%”G A*µØñçeL“å×ù8‰š’á†Vå˜×UµÞ±·ñˆé·|fxt4M_Ùu~R ùV÷§Ð7,$‘·³„.n—=œîÒ´e¤=Ç”Ä2¨D³9{¾êZûäoc7îßË~qâ2~Ù »÷¯!âŒX´TéhǼýOp~ü›öÌäê»f —À“¦Až ¿‰R@X„ó#IâÚ–‘¢dÞjŠø3cºüÞJÙšÞ'³'¯<´ DŠçŒop?+:âÇ 0’è¬W®j¦éêÀj^jq©ë³žÙ5•RW¬µ½P’©DÈ.QícöæœE-ͧ~ ¥Êȳ´ˆŸ©;îhðr¶é}ñ‰cW|¯iTd,»~}€¹Ù@4|wfa£“½ÙÒdäÚYr)6Od“`I[d«ßHí§ä;ä[~Rª—:D‘ÕW±EÑS.K6©^i¹éÏ–¡G— Gªóî(—·‡Íª ‘à4VŠÓÃ3×\m/kÇÝTnâتæX+ àâ vFÇn²]I»bãÁù ÚÕÔ#ú7£#hf¥Ï)}÷Õò ó½¾íj¬ L "̦Ëä(lXç“ÏÚ×MतøÉå—ó0þ4õå|uÒ1îAíO9…ôÚŒ U™çA {ÉÇ߃b/”·wn¢c‘h|­SÆÊøg¨©ˆ ‰`°þËB÷ÆÇ@è&JÞötê:§ÒÈìé ëpV_‰eMªTGI”}Ë{_Îz X²k—Ͻ.‹Á”DwbÍk#ON6ÐûåjAÐLt›fEÔHÛS»]y¶c;tÀ ,¦Æšw)šÔy‹ûØ ¸¦oyË¿|퀗t€põй4ÙŒ”1ëZÖqÒ>=s.EÕ… K”šn±·¦˜>lï¶ßÜÔ°îâ¿Ê™ ,Ù+1ßé–÷™YºkÄ dúÌ™ C™E÷Z½\=˜BUìA”`Œ7]eÑçÖqÜ:¦wuߧ›üÊ!MßãŠ^ûÞÄ/•Êê6‹–i0ÉyOçß´ h”û¼ô5òÝÑÜé:B»ÛiÄìÛ‹ô›oO™.]^_³Ú¯Œ{Ê(äÈF{Ë”á6ÚˆŸ‡â‚,äN?ÃoæKBI ë;¦å÷XDú>ÔŠFS.ŠG§8^Ìáôß:™ŠüÉ|Å…Ã~öža™›ä~ºqm#EqõP¯øCŸ&%¼Ï õr{ !€žV¦3çRñžJý ;)>ˆó‰·ÔP#€FìÛ¤M¸0ÄSÉÛåI,€á~è¢^¡Éd»“ûÒF20% s¼¯wVûAY©Ë¾jj·WŽón‘P O•ûŠõ§®TöÀûwÐÜA¥¥áHí)v•Y–J‹}‡ì2ù^VYËT[1xìÀ¯ë‚vÛ):íÜþUÓ •‰Pìó(Ç÷TÑ^Í~ˆbWã¸ËšíÃq‰èüq¢BF…½P ùl[·ÆåÁq›+#i×׿jfgNØiç¼OoPßøÖÁõÙÔ6D4z^ðÓ¬ #lj—Œô›rÆ<¡v·H:Qúñnw1-ØïÅu+\-ôs·ˆLÚ+”òk•úx7¡º×£Ìó¹ Ö­jØ´‡°Ö$qº af@(‡x04ÐК»É>õ臣ú/—ömªs]ÅH$Î,¬š<¥aâÜfý~˜©Ê€å÷ð}͆,8ÊÇD†óaÓ?{4Y˜F€g²½WÆÀ$¯½ûdžd1§à —ì¥G¸¦ Ûe!2jï!ÇöRZÿ‡óZœV°<Ï ìuï›ÉjÞÃèv©/MüÌ„7ì¤È"=g‰dk¬ Ë?í`b¿2uõåZ ÜSV?ˆÐÄÄŠt'EëhP‹øP®·ëZV¥œ—×\?b‰ ó’|ð —m²È5Œ~)÷:“Í‘í3ÚÚ ×9³^w ’D¸r¡±–­8`Çÿ¼È¤$2®Î#Ә녔ß8ôÐIü€åaHpó¶5$\óB’{1³”uTqy?n à ¬4ÇŸ)¹Ò~`¬vü;{Ã@êã‘åȶÂllÚô^S´ £”ãÍG1Ö°cŽ’¸Ÿ«Å%vÀè¼eÉRëÿB¨Ä‰K…ÌÇ__Ô«ü;tތҋ2@(OFâŸ7ˆnG1¸ÏwMWËÐj²:n¯›Z¸ÓªDîCI%±RbCSF­I™þ]?7©q,“Ž8!?÷8£3…³#èÃCH„¼—*kt$¿¦‹ÒiS>§X>B î0•©çԈό¨zFøÞ |iwo’Vœ{ˆ©GêÓ¹^ܱû J¥{åØ3t ¸þ䥿˜ô›¦ÖY+@ñ{\¡ÅneÎ2k4sZŒ’¹fDõÍZk]³>’C®2°þlCóä@šc=ÓØÀw—+Y~-óxÈLmôŸAŸ¼Ä9¯µ ¨ç áåè¥+8\Å,KôÊö?Ý1*͉rÇqÊƯn…#ì™<ÐåÚà¶ã55„Ð{¨còOË°0¾á3¿Ù…2' J|R€· ÍÔÀçr%™ö´; ú¡0ë\`<×9Mî9Ï|÷ ˆÜi‘ï™JïU°[A¡ÿŽNñ¶ þŽuÅu…ñlI¸÷ß(ùc2F—œ°,jìË# —Y¶”3ò»>$;––â<ú²?Cΰu‚ÎÇâ³ HâôkrÿçVÊö|±FM–RD?Ñåç6£Ä÷e:UÚ®æ¿ñeŸ)2ÝùZ:Uòôu{ ¥~Õ3Ò$þ/0š endstream endobj 727 0 obj << /Length1 1486 /Length2 6660 /Length3 0 /Length 7645 /Filter /FlateDecode >> stream xÚww<Õô¿•qPd{#ÙwØ#d콹ƽ¸×–™™‘MIˆdgS(Q)Ù#DÈ^ )ÊøÞúìïï÷Ç÷q{ßçœçY¯sž¯Çûò󙊩 ±Î(M,/Cå5}S=33€B%ÀP¨8ˆŸß ÷Dýcñ[ |qh,Fþ_5_OЩÃñ¨>èúy0 &-“‘‡Bq(Tî/ ÖWP‡û£‘€>ÐÅbP8¿Ö;Èíê†'dúëD099ÑßÊ€c}8Þ åEȈ€{¦X…úOÁ«nx¼·<†{áÀX_W%!Q wLP8”¯? üj0€{¡þn âÌÜи?L¦X|Üžh ƒ#8ùa(_€0ÕÑ ½Q˜?ÀzD?€a‡ûÓûW 4æ·3ÀzyÃ1AhŒ+à‚öD†šz`| ^€c¿€pO–à÷‡£=áÎÀïâဦŠ1'ôøg‡8„/ÚãО¿º„ü C8h R ëå…Âàq _õ©£}QÂÉAþ±€ ùGvAc.¿ZAúyCÌ1h?”ŽúŸ(‚ ôÎ…¤ P¨,a°(ˆpƒüJbäúm„ýRú¸âõ\­ n ]P„Pîð¾~¨!ÿ6üWÁ`ÀÎ(W4ôOt‚åò‡LØ_t ` %,! €þúüýdOØ3$ãôü÷ !zÚ–ú×Dþnúo³ª*6‡bâ€4L–“nü7ÐßGðWû¿µFpôŸåý+ Æ ÈýÑáøþêÄÿÏõü“=BÀ3` kÿaT Š |ÁþÏ\øíòÿ£À¯(ÿüïš4ý<=#ÿ‚ü?¸Ú3èO a±ýð’èc TÁüo¨%ênë£h?¯ÿmÕÁà dQÁ¸^L,)ý‡ÓD¢Fh<Âí÷òü5BO4e„Å¡]@€쯡üm#0áA¸dp„¡ý6¡ûoV ‹üÅDq)iîë A «&.%„À”E¢o9c°x‚ @èðà‚õý­œAüRý–`„„ þa’Ä÷_¢ÁýK” ø‰2Äï·øŸ ~¾¾.ÿ^&BùÉ¿/*…MM` 7Ýëo¶>Va[è–6ÿvæÇ- Jö$^“¼0`ñ(g—,:ͺ§nÔç¦TcKªOJ{›]#Y&ÀCNµLÁx!†‘D;m ÜpÕ@žæ ¥àÐ.´›--‰%çþºZÐ+ížÊoÖüJjýŒ¦±X¦pÎC›Õ5Crv®ÊÕT†kBrÌ?¢>j{†Ë“½éT‡ºGÅåPë>k>е¡nÞú~¡ºƒÑi|¢G•V*|,V „¯ÿâÌn].#ßÙÿLü‡[ÇõkÄÏEK V÷EKß|ŸÒ#M㻬è+cÌü4ð{‘ùP]sb»_üÉN²¡½w€Òà˜ðMù š\w*—€ÈÍR7íÏ)Á2å›o"¤Gµwî3Ž„åH…ZPfh‚ÕYÙ#BjÎlŠqgqE§¨~zT5à†Ü-»· O}‰ ½^·tÎ ³øšoDwT£c¿UÌ¢G<7?€ØŽõ‚YùYLÁÈ1OÜk½Ë¹w$é §;2<\•}BñcÅ—çƒ]/øIHí´óºJ²y+¤›§³ûvG ¾Õï‡/çÔ—…J±PÕ´lA´^fÉÛؘý0¶WÓ§+ !ÏÏ)%3¼›/ã.º]ë£|BGîѪÂÆ%¤¦³?ìj0±v½â>XÃøÝ>ûç˜Úw&ÿÅön[U\YOÔûî€aÑÁ*­xöL„ÏaÊ5یȒîŽBþY«ÃÒÁ`•èñ4íGÈ:âäK–ÿzNÖX”šãÂeQù­èAéÝFôaìšîÊnQ%'ì©&²Çjûyðq- öáá95ÕΛñ#I Ư;3ÁèÔ2ê<ÓÈ•f÷í²ò³}ƒŽ¶vŽ|åæÓŠ.)ʇñI8¾\_EH±K‡×;·[t¾¶ý£ÈÙ÷˜ãóïâ/ì×74šA“oʉ oÇp³ëÁ½w"s¦‹)YHpüV¢ä.ë›ßŒoî #~Ȇm‰zÞ]õX0a+ NíÏÛ€…m«ö[]ªOl40>Ÿ áa¨:NÙ_CêÀΧ¬%¹Ø:N©·ÙS«ä)YH¸t¬çU¿Îà;Ô”I.›ƒë\V6W RŒ;ßÕL¶g“I'‡ÐÒƒY~åu(.c%§øãÛ°;¯L) Å%Øéý±skoÚê%«ÜéÜá«Æ…\Ù§ye¬yù—ÅLK Qö [ß«³_$)" ¿ýêǤ?Âj-õȈÑÂ7h6sŒî¨¶Èß}ÿ3k˜ëôgÓr°$ùÉw9}ÕbF¥«oÈçûû‚Õ²ODì¿IJÝ ”µØ®}Qùñ[øO²:(ŽfÿÅçPOïNŽøt– ƒ¨Ùa]w‚²:üÕéNûîšÜ¾ú£™ü6“+ðV‡Šu’_¡Ø½ÒDaÂ`¤V¥½5Ç ¹TTaf»Ž j§G¦™!’\¢R"â¸îƒ+ Šu®é9 ×w:>}„ob“¬ÓêÇq·ŠÖ;U;_%—±±) Þ.«þ¼†(Qéº,7|ß$Í?1mV££ IÙkÄÝÎ|ÿAK;Û¨ôUηaðOPŸ~wÇÖ&¥£c’—¡ÌÞ*â‰ülv˜<ãXMUKÉÛROL,_‰îsý`Ë×Kè_aZ¨ ‘'ªž².Û‹gîá=ÛýÐÃ.õz'ê2”sò4²æxÛ@-ApÔ«dôèÑ‹;uÐà½È’a¯ìÄá.[UtÝ1Ȭ\ßúTžÉ±Ty-9àî‘v'÷º†~¾LRë~ãÎø+UÏpN׸H‹d'Yÿ• _Î:üŸˆ?¿ jâøÀçÜwl ÿ2áaß:¸ÞB«÷ÆàÒ {œÐÌ’w¡¹w4ŽÛÌŒúÄ'„ó†¶WFé‹ÕÚ½ù™;— ÂOY^]hð<19’ ­½xNÖÑœ¾e s­?~ì‡Ñ á‰Ý«öžìÒ‘â{èl?Ô¥¸.\âm?ãœ2ytš!XßÐÙÎë‚$S|]ôŒŠ‡«µ™Ž½½.Ôû0|÷D«0Ô:w,’ ‰Å)Ö%Lmh,4Ÿ/¢·bxÑÇUœá2›Ð@’Ÿ¸Î7Y œd)}WbÔáQrѶ~J4ºœ 3“ÌB'jÏbÊ˺–^AÿŒ|P ,Ñ(@²Ïþ‘|áüεж§¹· ÍNl-ªJ£yÈ=ˆí×Á³¸‡Ô7NìR·N: ï4šOŽ}©tIyϪtý-sZ‚&_ÍÇ¿“QnÈ«ú¤0>Á·5„Ñ>žÝŠ½^cý°doŠEvNÞžñ_T»}—·×_×Õõí×9·ù–‹ºëœ% ¦ƒGÝÍv‚-Èô¸£UvªKL7Ǿ¤®†Ð;ad—ù‘{‘â¡¢¤\Z[]BŸž0kO+–¯šS?—7…ÚH]¶uBËp+{‚™¨ç΄\ºpO{üY– ÝõNŸPòVØؽW¸Wô“¥ :‘tmGÉþÊÒ×õ¢n“,ì}pæ³[¶nŽv>Ε%ϲÛ43¿Î²ß^z3(y›A—B‹‡vÚ·|©Ò(ϹÜDü Jaó^eWë=*Iî‚©¢ÄñY[X,„Åý{¥æ¼ÈƒO?F&­úxêœBRå4Wvq ¥DI.ÔuùíjÙíá^rTQñ2OU2!st@:Òæ%!òe·v#ÊšÙ×Z./|©E­ÞÌjyˆs~–ú¨ÅõÔzt]ZÈ\lŽôûP'$»ÅæƒðÃ-]O³ ŠçžŸ^ˆ·¿ŽD¼9uþV†çlK¤¦é©†Ç\ÿ(r[¾‚Ysck†#xIÎ=òšQÒU»[Îw„Ȥ›æÆgægYt±9‘ûr]—Ȳ¡:8óÓQ"oHâmÕ@~Œ%âð¦D8<¶›røŽ¤Žz]‘g¦6/§øƘökõ§•Ú\q›l·.f-ŠÞTxtÿ27Ìð9§íÏK¥Gã]$èm ˜ ^A¶ËìÎK4ˆP´T–g°‡/è—ÔãˆùW/>X¸I6åüˆ²wV#ï»*˜¬Âú2Cyx/£8óÙ¼ù[þ±SDmõ} ?Ÿ2swÀ9O 󮯅Ì>{rÌžK1"ÄÁøÀØYCT‡† +ê/*¹¨lVõ#¶¡ïäæû›¤IÒYs΃ßë/ó^·¢¬°À“Œþm†¥ [º÷lA×ÏezÑšäEæßâb‰Š H‘i2ºÅØ–Ç~‡UïIðH#Í[ùS|Úü±c^W`‡Î2u¦lFoÄÈ4jÓKûÑyd2í~KuÊoc" ¯è,Î,é̆lñŠ|@|­ß#•M?ÕÔÄK%'¤¼Á‘$Rcó‹ÎÙ©¢û+`!‚šoõÂ>IAý‹µ3žÞŒúB»á”ÊpIçÓºÚÄ¢BLô¡ü–ªdò´ËáÙ^†žÛ¡•U˹‚àw¨¥Ÿ›ʪMÉî¾èßN²p=ÛU¢zRKkG¦hóªÚžú@¢·4βÀ||Ëæà'†Ül“¯À L˜á†íCŽÖ]ïC=‡*n—¬Q“-Q÷”õRW,Ô\v¯#V²n-gXgavÜ¡ Q$þYræÁvN91\ºaz2Cgð}Ïêl¤é›Ë£Y¼ü+ÜÙF»™Uì¹ý'6{ÄѓׂxÒ!;Û\úŠsvËÅ{-:æo|6 šL6•÷]F”Ï—)kŸí_Œ»0FÆŸB,ñ“QÞ}1~Bfힶ½ü Puâ*´ð‹Ôœt™¨É†$Ð#ûÃßÖ-ˆ~ër—P‹”x¥öòy;K.ÓÄ n‹Úãc¾7Ï.ñ›lÉhª§¾»Œý³û-Ò÷¯´`Ÿú¡§×j[.ÊHÜ먗N´þÜL¼œ.!â8×ÓËU™Î1ïf[ÚÏDÕ-.=Ûú1s@ob—Äq”þZ)f'Ž\ØýT;/$ "÷K›Ž;fµ5q1ó†E'²É²ømF¤\kCêÕn§kx›…ÚÄ–gÖIë¬õ+§2ÙGÅD½w[$:¶c†!ܪ‰ùd —–ºð 7‡ºÃŒ¼qRC<œÝxÿ­£·7_6™”ÕÅ$Om­ƒ\CÛe7M”ù×Ì.Q˜ÅÍ1¡§7ùBDãLÉžñÈMMRž#¯º·®¢ÆÔ2źsçÜ£5;Ÿ~¤ß/6(7Ìæ ïÌ_jÞÏͺÍÆjVªú–ö0±ã`ë;žé Æ1Zu¥{Àî+{Þ%ØœÕ>HÇ[ Öã&úeñ˘òI/ìøŽ¹°J·îeƒ²ˆŽ¯Ô¡'l«&3Þï§Éá ã^2P6V^rЧÒv¸šÆu¯;Zw:5{l€þÀØŸ—nNøËn*ÔzÐç…$¯§Ï» Õ•7‡\+\ÎÍ|É.:B5rï§%LµCF!ÓÏ_Õ”$ï[î]3køÈîZƒ„äUy¾³”ÖzKœ‚ »÷Š[ô.r1™n^*e²à¶±Gç®.òL$öGÌ”à‹6Ežßõþhâuÿ2EKápIG±B)¹ðq¬ŽÖˆtãºü-m¨‡ Äè=°h2º6 vŠp÷è7îãX¸u%HC†¨^:#hlú:Ü¡À%{ÒU}¤Ü\f¬’}îósgÕØÀ¯åu:eO™¸<Š®p-©Vvö&‰ßI›]}ËRÚ^í±ƒ£†åclßg%¶š ›]-iÚôJÐ2êÐ,‰çü «¸ö‘X „o¼É ;Jùj²Þ€½ œg¶Š¤zÓ­ºRh„+HV$°8$†peø(ælI… 8ªjøß|y\.kw*ƒ÷O£nŸÚ&ÛlÕè[âÌÒ3ã "ú6`/ã%ª}¶AëpjÐ$q5'ó~×ð®ëǧWŒsÖFŪ{¹¤ìÓe”Áˆu")-w¥k÷–õØ]ëšE¤Ø$žˆµÐH_úðn±hæ­ó>¤¦lç=×É’§ª9Æ–ß½™nŽqIH voq߸Zÿ9ì•…²Üøí¤—ŨîNM‘}ã…â¤Â± ì~^¸å¡g!ô-s®¸y°V»adðŠŒ°ÝIçk6¹ÁÍãcQ¢RP¬¯ËÈ âé‰,oÃÂ}êÅ×}¼Í-çeÇS¨8è3 Œu®„e<=íÑ™½näCuY¨Ôc2[cñ)ðö;Kø%}£•w€M³63ƒ×ugtTû^àÉÎP¯KFá«M¹¼Á#/¡TM¼-.w ^+ÿº;"rv^ÚY¸X³>¦9%Œc«PT5iYÑŒ‡0Ò5€OÖKgRb²†T5ècéèÃmMžáŶÌÞÆCÊp’ÉsmF9'´ˆ1vׄJ:bq?Çb‰ÊÉ^œ½fL¦ð«QM¸‰Ãg÷y§¶nx–78$T?ƒ{VPÁÉhÎßW3ouêg·%›[—Â.Ù½B)¾àò”—µ]Há\„„±•2Þ!mÉ?—˜n’2šsÞ½145RÃ’ñÄc÷…ôÑÅÅäöSÐ-‘PÀÊaú¼,³¤”Åózõ€[‰@´à{ÏM“Ï1jQ¦L…½Óù~,>2ÞhÉrÅ1µc€bõr¹q£Èψ«¯/Ô Î^n]ÚU'ª|¦zw'íXÅgM1Æ;žXä|©- endstream endobj 729 0 obj << /Length1 1623 /Length2 7422 /Length3 0 /Length 8499 /Filter /FlateDecode >> stream xÚ¸TTk6Œ€€Hw3 Ýt#Ý3 3ÄÐRÒ]‚ ÒH#-!)%RÒ!  ¢|£ÇsÞ÷¼ÿ¿Ö÷­Ykf?×]ûºŸë~ö^ÃʤgÈ«FØATp$¯ Ÿ€$@IÛÐ\P Ì' „ËÊjE 㸬&w(.ù_Jî …)‘(Gm á  Å$Å%B;"Ü%Ê@/( ÍÐ@À!¸¬JW_w¨ƒ#UçïKˆ (!!Îó; àq‡‚€p€6éqAUaC Aúþ+‡´#é*ÉÏïííÍtñàC¸;Èrò¼¡HG€Äâî~Qè] ¨ñ᲌¡ öHo ;€`Pî ñ„ƒ!îTu€¡º@×ÿËYë/ÀŸæùÿI÷'úW"(üw0B¸¸á¾P¸À ƒtUµø>Hþå„y Pñ@/ ´C9ü¾u @UAD1üÃÏäuEzðy@a¿8òÿJƒj³ ¬„pqÀ‘¸¿îOê¡úîËÿgsáo¸ÿß+{(lÿ‹ØÓ•ßuó„¨+ÿñAA¸ÿÁ H€¨€„˜˜¨ â€ø€ù0òu…ü6þ†Qý]®{ H Ô‚úÁõ÷zAHwOH ÿþ½Â€¡ $Àâ…ãþ'; †ØÿµFí¿;Ô`)€’Ÿ @à×çŸ+k”ÂÀ8Ì÷?î¿·˜_AGOIK—û匊Š€?¯€WBL (((þ;Ï?ø›ýoTýswÿ•QnHüEÕ½¿‰xýQÇŸ±áü»‚¥g€ã?ò·¡¾ÿŸ‡àwÈÿŸöeù¿ÊÿïHÕûmçøËáÿcº@a¾×Peê-VDNÏÐr_OøXõæ…®f¨ ÑT7Oy G¾ž÷:@À‡Iñ̘Mâ“d}zÂÇ–˜–쩦ó7OÄû„w^~*þÑí±c!qp”^1eÐ"ãò»Пš3±¬#GÍ­ˆHÜ-³<Ô' ?…&\)vÆQõÝ´LÈýðáMÞÐ`¦ðY‘f­XM$)5™ŸSþXÊ05yržÆ+46EÑK¥Šô$fê—H¶UŒÇâ«ßg‹†:’‡…=›t”Bïë·x6"DçeòûVÏèl·r¾òãSµ¦Ä8òÔe²(²Ö‚Ñ.G³Nj…aý˜ ¬Æîå[íYDYù•¹úû–8ì pa›OST×ãs’…¬Óe`‡?¾PÓƒ1¸ŽÙ›¾¿‘NÒ°’ê©cè09­{Ž=àáûòbZeƘ ¿Øm}Ó9ÚuŠ`9¦'Ÿ M2ëÊ9ØO~¥.zùŽØ„KE Y¯¹€è±åLÌOœ 6(ÈÇÔëè~$e!/±8Åœh"LXhD¼`¤µƒ–¥sÏ\ò‰BÈ,©óqýË÷ÕbãÏeÂZeÒ†-OÞQÖ?L$ªß¼¯ß÷õ®M’û)¿ŽfA·…ãã2v ¤H´å éfWÑ|&ôT|~µ@ñ§q°-iyU}ü÷„/;Í'f Ñ°˜´ž™àMÛãô]C tY¯§û»ØÓw|Ôš¿]bž’Ú>’fŽ(Uµ$Š¶+}"1¶ju^´â¸÷Û·\|Å´¼’Ù uµÙmÖ9qý^馨 !d_|"!¼Y£Â&á‰m¬Œÿå! >pª9Lh·æhß‚»“Ó|OQt`Éò´5–¸ñÛ#×ÓË~º¤íõtüÃ~ +Œ’0Շ߽ô„W>ò›éŠ½ñU@ôÔìX›ºÑ*‡i·aE›‹¬•G¶™'Ι驜jýÚ´j»_ÓVPK÷Ǥô™¡&Ùgïéô¤è@à__~3Õa¤7ÈQI;+=ÊnKœE¿øΖ¶™cT½¥° Ö"F7p|É šo÷¹´f2; †¯tm (-YîãÀ‰ ó²ŸC„sÛORåi16^Áäè@\«ÑÌÇ56ÁÕŸ¬+]"·ˆÞAË"4+uGf˜ÔïÇ5Ì6|ß¡úb@üÓ9k*•Ý3þ9kØSžãA%’k¼Œtö¾ñó<ÿ€Í/_ôÂÛªå0Œôîó‡>˜Õ´ØÅ3È5S…ò¾š ©F¦÷&«S?ñ•ÚGÉÂM™Ë^íù‡)r}iŒRiyõ2c+²<C›eUÝVÌU_[Òs(§ Žîz(¥/–`æé+;âRÌÊÛòäSŒåv9“PÄÛÙÃvÔ¯õlÐ+³½—rHKÁê#j~Π+ápŸïI ±#¡‡†£Æzêöþšo=hžà¿5¯í,<â?ôêMœ´,lû¾ÈЪŪ[(­™J"½ªÇž ñbl9Ø+yŽgˆ¥‰ÙѸL[î¢ñ@n=Õ•k>BÜ‹`RfYOÐ#póaª|±NŠ¨Í©pzŒÑvãCûöH¯~iTx›.gD~µ€øì§V‚'÷"áK1ð{Az~n¿ç5eC¬ì¸r!½U䟽¡˜>¶?øíõÐR¾‡=»Ò¹ïêFíðËÙ—òÖ †‡©õpq7öpêOw4£oDœue(~VÉÏRÊW`<ô*OW)?9£¿Ëæ"Çqð|Ï„uxõíÕÄâ#Ìfå[Üöù™5ñCXzâÖ+6¶ˆˆ^þ¤ Î&£í þ9úzõñÒTã:Eh—!s¡Tânú§ ša ®‚èY¶˜¢ ñr‘|9Ûh§&;±~²“ùÉôU©5?Ö[Þà@ÿèé¡ù‚Ù î§t9P‚;?*@À WøÈòfÓìÇ9ÿJ|Š0´GV¯•{§ù´¶…ubŠ°­íj“÷[Ãá=ÀŠë‹]¹9<ô£3;d!,5Ë‘H,ùV7ګ϶ Ë`o¼Q"É`ƒ¡wĤïzu¯7‰öªÍ]쪳Wª¤Ñ"c·ghËk‘AÂÏ—8¢Y-Å×UŠFydaêD}$˜7%yja]ý!×Îï‘’3kXäC‰7Ón}Æ[±ø±½]–O¯Ú$o»ÞqŽt%¨÷Â2ÈÜ7}ðmGIAî\R[íñ¸yå±HL°~в_äMÖO]V ËGŠ ÁrêÍÈ1I9ÂÍß \9ë˜6›¿>R]”ÞU lÌØsn\îÇ^38âx?7i#´ÈJ$€®póãÐ%¢-n‚pàŽ˜}sX!B­¿ÝN^QèûŒ4 5ñ½#É wPRqÃ@šJ3(á]ÃFŠöÐÁÍ%=Årñ Æ$'rIO©iÏKçx‡ù‘X ^é!þ1vA¾u³`¡eÒë¸4î€:Ž­6“¹Ïk±Ê«aâašö´¦d~«î¶G2ß1û³WŠŒEšiJ9z¨úÓë#O¨ýøW[–üf´ú-"Úb”ï0 ‰ð~]P9rm‰¥±0üÖz®0¼UÝøfz±Ua+­­· 뮟PûQh‰fêã1¡]DÿD/†«é9R‘Xj_Úæíü>ŠŠáZMS§<Ê?ÕÆ"@¿ø3´©ªßDÚCBãw¾óph0 §D|ëäk”Úßlâ2ü)sÚ­lÜAi”:ù<ùdñu{Î ¿»ÛFÑJ«ÁüÈ öäÁ¬È»ez®£L‰¸!÷É9õ§…§Zã#ÍKR§Âv¾{ãõ«ç”µNô-0„C¯Zôxላγ.vé)ó®5,ï¡ ÿ5A\xh—ŠèƒLpÔçbDB†¿µR¥,ËO Õ{~LSÑ\/íh³wbßñê|=z[ò¶qö0qPÓ[ßáC¼k—  )Aß|lô³‰¾ƒz<-“˜ ‹7·7×.ød0à¾5+Ù!sé㤎 Û—ú¯ tÁ4[®¯/F±±=RÐE}ùÌÂ1èfÞ¾äüü‰®È¨ð­ô,¨YPä\U5ëô!¸ª‡.àGYùè%ý:£[Ì«Ä`…©þ«_Ä,•FCÛ¢Y1MQŸ0RÝW` ûæ샘AËÔÅôáÊTÞ…¥¸ºÖªrU•©_Íò:q×OÀÅá÷‹‰g0ì%¹jiÍ$¿tïÈwæHr½]Õ¢·GOÞ/‘ÂLq’â¦÷'Ç9õ^!Å¡¿N“k?ÔL³}Ù¤…ÝoÉâ|\þ=ç=øñåäýÆ9£Î4âþì¤e­‰5ƒ“³=ehùËÒSIég+­B}LŸÉV£¾ä¢e<Àú*jq`?m»ï¦xu3 s—ƒzŸéÕ ÐëÇÚõÈ‘ø\ƸµÊ…KÏíàªÂSÇÓ+àT%$J¬4&žûe/å$£¶9s‘Ž(˜o_µœ–v¤mL (i·Þ‹ÎÇLç Ás¤¡î!Ð yÙšwq=;ÖˆB4É×Õod„ÞÚžî+Ì —mè“ïõ(2˜\±œJ¨µS$9Éà>µ–Tí>ó÷¾[kK(*|U¢zì0ÛÓ(òL1{w+÷P¡¼Šd½Ë­aòtŒqíõê´H3v,CTqÒÔ±àK={ªw÷ªÏyæ  Ä.6;ïÒ=w/.³LþÐëõø#^gsý÷xÊ‹ž`Ÿ«G,·´%û“|…m÷ÇÓ^•S®Lv«¾ÍNÕÕç$‡ÉPÕôÚ3QÞaäëªäÃâßñƈ1xØÎ!¿´ô4ÇÔÚ%߯æÿá…¬Ó—tÈçQù é-󌉒Úîõ³‡ïœ)ç’ïJû^çéxâÓ°÷KÊ»ùJ‡NБ:M%Ñ0¡¢Vguë(NJíkÂàâO·æKðfš°x,¬ìÄ9¶r.›úádö<áÕ Û«‘鵉ÁâÌ«n†iš£:’Ûý¥Jî4AMH‹ta/»Ë¡‡t¶ñ^¨„+“m7z™~çû/[ì¥:¹šNÖïfÉ –¿}ídÝD?6“Õ(ô“[R> ‘ѹ~r§ËŽOïïFigÎ!˼ôk÷i÷È[çr_ákÄFì5Ú ämö;ŠUÜÕsîOOTÖN,‘Óït5éâõ_°|ci!£ù¶'·–qY WÒdìÏÑÍ¡±riªÑõÓdï•äK)_¬gÝqwí¢®$súQ JLCÔ zâAL?zÄ~µ¡d•ÑîʉYÃy‰õ3Ï–1‡¸ˆ³~Ž£í[nIó}mívÜæÆ|·!/¶–ÚÑ+¥µma´- Fo#=Oÿd Îöɺk½ü§Ü¼Ïj* ŸfÖ«~1¾ÖcîÐœˆŒä®êœ1“Ê Tq¤_â@Á´´9ZMRÎؽ$æê¼Iq°Ç/¿K=ž#ßù¤0…£&Ùôòùº¹½`jóF‡Ú°«wø°ùt5îsÕòwjÊKg&4r®gؾәmdz«¬ª2a}ÃCŠQX—K—…4õƒtš,[1ÕGm÷£C”pN(üVgìïíÜ“žÍH‹» ½óXõTVœ×`ïü±þåq Á=,Â0ì÷ÁVå!Ä:BÎöEÀs„§†¸ð³`¢ý¦3¯õýž‹`ÍeSÿ<íÙUa¹…Äø í3믒¦ÔRdÄ^ŒIOˆ²îšmHÝPdL¹SfFšÈ§·®.%WÀdT à»ÿʃâãÒØzëexŠÌ´YìÏû?RD›^dž¸‡h#e}ej#¹6Cí”0ºƒl𻃴 îõ…0ö–ëÁÒô›ó;VW‹#tZ¡èá…z©lâH$!ú¥ç#?)M‘÷çÓñ R¯<9™÷¥¾­¦gôyuÞ|Q j”ëÑïàOQe3æ«ÝÁB¿à^ÑÔŸ f­š–9ýì±·zîƒÐ°^_¨d÷¾ÓýÀø4?y0,J|Zd²1VÑÈ]M\òªºæõ ½xl£±GXÎËùŠ!ßíÑTl£‚8%Ñ›GîÆXD¢ã,‰Q™qlu‰Í=±8AéUn->ÌÏÜÇ/¬ÅÒöÚ^ãp¢D–…o®ð?OÁ?åZOX꣛R=Ñ]L¦‰v!à‹{‘PszÏÀ²›r* ¡#íôàÎOö°NÁÒE‚×RŒ„§O¬´ƒŸæ9$!‰õr—O"7I-²E4£¢0+w‹û*vIåãòŒªÓsìÀKfÖ!Í€Çúš‹Þlžy*Gæ¥Æž³…üx(Á÷c¾¬cÇŽÆKĬÒÃ-‡7"ZÍ“¸0kÓ“‚;\ÜSWÝ‘”ëC¦-&aëN€†œ„”\,K>VéŠË†:›~s.)ªèB3«eo8¦/¥È#$ï“6.kXÐY~¨…;-{,EÉâe? ¥ùœ1d7K“Kp«ˆ×ŸêlaádƒãúZŸÅ¹´=㢾?ô™(¿c!¼LãEýÔ=Ë<ãò'£7•ôb/›)[e@ª‚jrÀIPb㬆9·×!U1öYÜÄà’ÞqÂ…”¢~¢nEªð×.ÅûÂážð –WkêCû·¶ºXŸßá2f±¼^{È+A®Ï?P²­Ý É—[ìÙŸ©k¾Ã@t踅a[jwÚsïÇ^Ç~•í¾ôôõÛŒ!nL¢C$]_eåd^}4µFáÏ ]ùbVídõ°Õ=|dió¢VxäœM¿Ýætÿ™¶‰*ù¨€èí·³ú¶©„¬}F`Å+ÑÔõ@Ë…02ª¥ê¶½Ð©2²´?€¹¬éÓÅqÒÙ=¸Ì½c™ëç;™2Ç‚ ¬^vžÍ(>æ|"ïŸ$s××T¶ç4zKö[r펯ü§ÁÛ6ãõo8¿ÿRèW“ùgœJû*Ú‰WÀ˜Ø|ÛOïÊWD½;IÇáb.wyní[¡õ½EÿÄœ|Åîy<@Î$»,ü] )ž²¿ó…ÍÜË4*ιl^ÿWº‰muºóß„ˆ Êûš}Þìà0Fëâ\x+:L%otþ0üÑ‘ŸË¼P ˵;½ô“j«ÏR÷³RY¸Û;¶ãê^î¬÷JK¾Âöú¹pz¬4ixõi€•>ôˆs—ßÕ`øzuéu%3•P³'n– $Eôš{`©Î£Ì⌇¬¾­ìKÖÇ»hýš‹Ó:CIÓà% ‰šÆÛ‹h5d#ˆ•TÓÏJ‡¬06bçfóŠBe›gb"4C,£M‰ å$ã Õ ›|,–œ¡1^šn•Œ^x“ÊLØ£oÚþ<\÷Ç—éd.]¿ïí| Ös'PZ•9ÛÍÚÊââ$iâá¾Ì8Iš9UvÓåõ›Ó}Qø¨úšjl:žÜÍxlö:¾5Ѓ¯I‡ÿ§Ò\:’rå‡Ú“G¢>z; œLCj¶¯yÕ8{¡ÛîÝ«4ÊÔB’ï†^ ëÔXõÈÙˆ°çíÚUŒtL2¾f—Ôœyìí š4"ÍHdZY¶½Å»TË¢­»Žm‹ÿ™|þ“Þ?câ}àOµ $"ícÒê¾øhU÷Zr~þð«î%;¨ìJž…nqÃóˆØTp;Xu®Âea®ÊºpJêÈ ¡ï…£ÈNcõ £ñ-ë¸XßVƒðn­'¶B˜e·QßYLåëã²k´ÎÈÑxwø›Í|ßJ'’GÓƒûsϧöàÜ“‰”‘’*IªjhUÑùo¢t ò5.…+èók¸ ‚ŸÐmìà‡0Íãññz~t·’“Þtb;ÚÀ0œ*×Y僪§ƒÃÈëÍëŽT‡•ò7³K\†*8Øp¾1 –œÝž—é6OWWlÝÃ!c §H¡jŽÍû{F>®Ê>V·²0Zµ,ÑÕoa±\nv_•ïn9¦*( ¾~%DMžš|=|éÒ­r¯ ã³-9½¼r5ÚsíÌ vv ÍÛÀ¢+´B¦Ã‰-½ÓÅf^ƒrù‡Ì×· ЖÖïØ !úêö­XVùx ƒF0¦>ÿEB³ã:_;F¯Yx½5[úô2ö(¤ŸiYüòñ3­$Éç,L¤ç'¼cªËþÅ/ÇgîmÙ<ùÒK‡Ö§ðÝ:ƒKÈÓÚßòfY¼»;5vÍySõÑù£¬×lüðÅ=bó&ì £ž'Ռ೷dÇ3A¯oÓzÂÆͦãáwé;¶ŸÖèzëû¢KŽ’pR¸Ëàâ6Y.Íà‰¶ßLƒ,Z­_Xh Åí0DÊt‰ö°2ž¿XªóiŒT˜|Ë´3©Û#mZ"£VÚžûð1âû÷GIÝwz—˜©ñ)Ç–nøÐcÙVùe|e=~@¹T¾T¶nÖH1…T”Dy´xê¤]4hß”°ßò÷% {%ònï=c¦DžäÌhŸÂ'ûÜLß²mË×±ÏÐMkö…êÝÆ0{|Œhx‹ÑiöËDo·+RýYnª²Gç_j/, ò_`Fµ‘0§­‡œd+®¬ŠluYØŸ%/Ÿ/:š”€¿Y\|܆®¼{†#k°Kí$Ñæ‹G_Ž¸ÝE ƒåÅŽ¤:Å£Òš°ŸLç0^㜠ˆÞæÁs¥=¾1Îý§Ç"²wŠt|y%¼«¥…ûV{G,f_|æzýuO†*Ô_ºFÜrDû¾Ó·û6:®œ‚'$™&ÁQ"~Æ÷ü:1FƒÉ¨ªñàÈ`úŽ§¸RøäaØ;*jS£BîÇžózD'¶>¤31vd~&¯-¹ >™¤•ß™7³ýÐ8œ¿èLJ,ßï‘›o 9‰ÖðÑMg# æ>…÷“«æØ÷ø|fÛùB[ 8kÁïö)Ÿ ÉÈy¯lÇ¿ÇÑp£Äðz‹ZŠþ ¿p‡©¢]"ª¤4¨UÂô@týUÌf¾Úúø.“«]5åú(¾#K×L´²³÷VO÷ÓÑûLhϦŽxšzû×í.?eMzã‹›9 °æ¾¶¿ƒn§²ßmý"Þ36 s‡µ^èE¥Õ, $nH½%X²3ž°Ì\¢7—ºùM ©¨Sê k*Ú òœåñBå0,êÁdŸ¤HG¯SÏõ Q´Yå.굆 er!]ÀÊD‡…ˆŽâ Ôói"êÚՙGD½(ø6Ô·á°æ,‚¿ºó<þ‡2“ÕÒø«ÌO’É–qç^ÏaÞvî5†"¢ƒ×”Ä` ¡MÒurZ°½8gŽÛƒ…$E¾çÇÏš|p§_d¨ƒîHŽÉO“åaî}ßvø(áŒý2·YëˆrÕJ ˆ¨ÿ€ #V2Uí¢æ1™ùazq¾àU©…diµnÑp}j¨L¤j"s§ÀEA²\b•”:è'LhóN$3ïRÂtp0éP뎙jtófº#]é×eÉæ*bù¼ùÅÍ]~ªeçÒ² úõ;§Ä‚}¡еÜ@yEP+ꆼ¯¯›ÙBž@n¸ùÊLSî;J܆è9œ=È(ç#¼,¾Ã‹AÅ“Òy±Ð˜!÷Ï}?×xô*¸T5-†|¬7«¾ÙçÆ„ȇ©ºãkÑQïþk—Éê¹Yz×õ“¾6ÞŽüånt½gAtvtýä¤E7x` i1ß]ý†kdÍŵÁÎàùj3 N–¨f‚ÉÉ>;&¥íŒ÷"lź•ÉÖå†/}FcºÃ!@ÒIºk/Žv* ‹YJÂèÁƒÿÛìxÄ endstream endobj 731 0 obj << /Length1 1930 /Length2 14270 /Length3 0 /Length 15462 /Filter /FlateDecode >> stream xÚöP\[Ó ãîî îÁÝÝ58 Î`ƒk€„îÁÝÝ݃» îþqï#7ÏûÿUßWSuæ¬îÞÝkíݽëÐP¨i²ˆ[:™eœ@`Vv€¤²–<;€‹•‰†FËìü‰Fèêfëø#BÒh~³I™ß•@w€ã¯;;€“ÿ?N®)3[K€2+@Á tC¢‘trövµµ¶¿ÕùÏ+€Þ‚ÀÁÏÏËü÷r€¸#ÐÕÖ P6Ûß*Z˜94,l`ïÿIA/d; °±yzz²š9º±:¹Z‹00Ãÿi5 wW×·Ûøï;á­ÿƒÿ¾ú@/ Ò✓…`¨]uhë]¥8±'˯qNnÔþ‹ˆ+ÝiB=õ`I¡ûK®ÜÈñΙÝÈû ¬#ÎÂ×{=³Ëù¯Ù´Y!ÚÆòÛ2›Sxºú߬(PãQ‘ð||\(P¡mâimåUâÓ3íòÔnbãÇq¤2÷É}#œ<[ýKÅ̶›É懨ΊWi‡"ß÷»ß)šN¦ivº¥ ¿Ñ_µ†~ 7wÕ¥L—ß™¼»Ø‰’×°n”Ø€îK‚–ÜøFy¶(žéeN·e,ÈØ!Uر˜ •ïÃÅCWÜ]R"‹-,ƒˆÜ»€(3õ;´š5SÑO©jh*ÖXË-!}:9Ÿy$»^MóÒwžcÊq$2Ä5Ú–Y¢t;P#"# ÞnÞÁd5x\¥×Úƒ.‡LCqþHvD¬“Gâ÷nâdT–ß67iô‘­•Ž­i+–í¢ê„p Çò!ËiŽã²¿Ww$ÒDösïRwxF•Š‡¥³´æC"KaAŽõ^}˜?ø¢eSÌ—6¡hRú:Ý4\)Äo9Ç sÊÖjú¹i›d$Ìè5´Fê3ÏSÕoÛ×ÔD‡ô3ݤפÚU£V1È%þÙ.QÆÌÅJ|?׌¼ë8]PÐì¨.î­ñ¸¦Ž¯¹²­¡¤>¯Vý‚”“Bž©³¨#z±ºÀ qQRÊõ®Ø=²pdÜÔ«Ú= ·ºb‹¬l;7‘ÿºãWOÕ˜²p!¼«9ÖÅô`É6Q` ª,Ù4JÃQÑïÙ3”Šä¹ÄXK™ÅÉ3ùdC•Æöý3õ¬åcFhÁ^Yn"8 ,BvzêñƒY="FÝ/nQGj0/‹ rD½mA¢|Ö>3r^½Ÿ{rýÈZ›è ×v?Dƒð{I7SàŒ‘f•lÊÊ<ʃñü1HSðÛ8´í{Ìâjõwè×g¿U¼…Aüʛۓ{û’Vê^”B_â–ÖTlÊ"hØOM—¤Ê~m0…E»œœ/PcØÎoôê² Ó”!š!P< ,+m¹N»u"“w)™¨éyfÑüXã5nO¢Mdß—àzM,(ó»ÑÖð¸Ð 0 Ï×_ÑÄ=g¢#øÄæ*pɈÓ‰}³ÏŠþI¾qùÓ’-ªÄ(Ãú²÷C0çÈÍÀ!ÃÇpšõ8Є.}»<Þ:íÏ5Ë\yÄ<+ÝÊVp‰QÒ½lû!'ù5”ùÅAQ¬TÝ”f@êuQyê>m¼éó͆ž›¬8eÍ6ÍzLÿXå”ÍI‹Ðk]´//V¹ UVq2¼ÖÄDD6FI’Ì:}¦YCã™+gÙ_ÙÂß´û"1&ïùC²lQ…!›ÍÈÕhΫ†Ÿ 2ÝßÎ?f²ú>s§u ãƲhRgÓ¨¼¾(W¿P䌱àK,÷x*Ôˆ©€5±ºuJÞžäœÒL½zé+µ«Ús]›Ú^ˆ…±6# \ù…ìŸåšý]¥q?JIéJO‰Ý´¾¶üƒrör.ZçKÜêîŠß=Û®˜@’37s`'ˆŒš`$³fTï`rCxB}¾“6%€Û¯ê®³‰‰ ¼|Ë‘NìÖ˜nç aQ8)ús”˜a‘ÎÀƒ)Çð ÈEŸlž§ÏˆXDy(h?/™G¨9Ù(!Ðq.­ 2ße“Ó0hÐ ›¯ò-Úe…¼ƒ%w<ÅM­sA‘Vg‘$GsKTl˜y•úPvQgX,¬Á…?„û`)B¡¿<}ÄߢüY½n†áSåÝ¥qBœDeˆ­‘§y’»Üø‹c¾Ö¢Q]MÊê»öSÏeïN3/•v:ûîpÚøâlŽìHmÓ¤~Y„ñÙ“°Þ8Wt£û9øabÆ Õ°•Ü­¤Ò%Ósª !n‚n§«fî {%Ÿ‚6r6¿¤Ñù±L»{ÄãnHÄ“1¥Ã'ƪ¹–’Ðòä$Üõ²çð$€È›‹‚<ÊD¾2RXPá Ÿœë™8¡F6N':\‡›R¦>o(pÖþô6bå¸G؆ æ|¡cßÛƒ0,<ÄRn |ý`ݹÞß¿/Ãä|èÏ5‡W]Ĉë)»k@+‘gÁÎaæ÷IÌpCþ‚‰UsÄHïµ :ì¼t¼/3çn\»WÑ(r mA aW$Ú8`ÝnþmÎ׫•“,éÁ¬†ë~Ì CC‰ÔÞŸÊ5ֻЌye¬¨)¿ìÓT˜¹¸cu¿Yí¶‡ÑAW”,cë)KË9lžO(%¤÷ýzRnü¶Úcf:øYD/‰ûÓqß í&%ØÈ£]›ëbÈ%»©ûÐ~à ֜Œó>ð¬ÉQÎ.œÃßå¹¥ÄDÏoÕŒïwþPÀç‘QûjµÍn§û&G{a¿I¶„…aâF!^&ç{¤ÎÄ„]Fa\– ­/ñÝió¼o2™F;Dîšb8¸ ;o>  ¼>7rÌDa˜7@¡JýàÆ÷‘1 ƒžë(c¿µØkØåh¬„tÊß|v®õ¶ÕõáqÆÕhZº\¼¯l#^QÕÓtÞEoæ%‹8Ÿxh9ÏÏrðZ t'¨_:”ÕÔ&ZG; O:Ç=Ü´°]zˆÙ5 ¿n˜(%ˆ}Ê¿-öìQùÙê/³b©'ˆÐ3qâ9°{:NÓl¦\hÑ“xÄ–sBrnnN¨È„›šÊé²Vbe…©ŠÑe C‰ÚÇQBŸwb‹øD絇ŒPj̨‹oV]˜Ÿö9Ü©þü1b“-!Ýá„“¡–ˆý€´Pûñ¶Ýú%7õ3òókèa;Eµu-jU¨KgK8x>M1Ç`ö|{M ;•Å,DñÌ°¥ÿÙçû}ŸOädG,üî Š„<ˆ¬úÊšOº”ÎîO€xÇ+3 WŽÂõmק§Jl1É0zdãôTpý櫆1ûO‘cŠ`¬SßÙtk‰šGÊÙõ‚ÛS)«;Šua¿ÈØ"õy$èm§ó8úÄ÷=…²˜QndvÉÃqö%jÈÖ$Ûlg5Âpsè—7ßLŒ´!Ȳê»|ÉãP´N™©uŠ¦ø1íÆN– Ö뮾¾b¾bólµ¯7€CgGÔ]FË“ÊÚ[Œßlžøæ¥#úh4ßC=+Ab ïã÷áxHŠÛìS÷£Óód{ó‹ð‰óñ9¢sŒÜå¡U†‡gk«¢ˆ{ˆŠF&Åg­·ÌBm7ÅèØ» ;x˜¯MäBBñ ùUö¶™Ðøžý,¬¡¥õ!‘‡ÇM»®DÓ}ÐiÓ|°Õ:ÕÉeZ…˜Ž¥”òEi½–½~ÚO [)ù¡÷˜Ž6œ0"Ó¥MoŠVä=b±vˆOxOƒ¬0[k˜ÜZ²¥|²8ÝÎû` _ê¹™ºÛÛà ˆˆƒ´Øæiõ^£g†òW³—µ¢™Å´B> z– ¿ÜÍfžTû ¶NlàMúgo Wíc-„}ήÍvîåLgM©ño¸{1Б&"7°äeÓØèÀº¯ºÏSÃO{ãî$<Œæ}ÐðüO*[CÐQµ´3þK TéŒ+Hs¼Ÿ„÷ÂØüê$óõ8Ó‚fFtñ:)<Å“~ÛÑi) ‰iN‡F•·Ù«ñY–4‰ˆ–ì_–}üÒ‚à Rd«ÛÜëPì0DY'¢NšYŠ˜_8®RÒTAåé–^c易šçƒú -ŒÅÍXW%À™¨”Ï©C5b_¯e¦À¦Å-j‹?uDÃZ ‰™à×®–Ÿ!mê„ *g­óø€_ ”Oëlû_Ú>Ï/TyÚ:ví÷(dßlZüPn˜Ê²‰•“/@¸‘˜TT™<êŸA°åá¬ÈÑÈM X…Çš`¡P~Ü„œãùÆÄ/=ù‹S«~´qpW²ö,Zµéý§šYìòé;Ô‹ŸÖ÷ÂaBgb5œJÜýÆÐí³ (ã(¾ ®g%ß·n~y7xYþzÒj˦÷zvs¨Ø5XnFßÑ­ZÀÍû…Í¢ëeÌ·&U»æƒÛ…Ee¶7(Rx‘4^ò!Œ6^àOZêêJ¼G§Ø‹-çeˆl£É|ô˜Ø¹ö;¹žßâ4¿¹Á_¸-0»Dõ¤ƒ7+=œ~'÷80Ng÷Gi8퇓ñÝGU<ÉcØÞsÖv/¯Wœ c«µG‘'Þå¢0S±´Ã º%ŽnÍÍ>&,öÛÛéß½Öí‘ÇÓØæÐh+»6é‚Õ8¥4½€Z‘.u—ëÏ‘;U꟰|…]hµÅ:{œšO.\/›M™œ œº à dý¹|¨{&–b"«R¤µÖT|^ ’ÇEaõ?[S‹¬¸Âc‹ÝI|ôÑl€´=\Iúè}«­ŠhЛ%+šî=Uª4pòº7ç æXñ³ît¹ØY ÄìØMÂ=‡7æV9,Ð祒Z—Ž¢¨gÆIõ€„ íö¤¯Z$ó†õaW×næïÏo¡‰´ô/}¾c–Y]zYÉ™< ª yËiDz­RQ2;‚áNY‹F‚Š:)&Rm=ý2â I}Q¼%¯VQ$Íý"'Û Ê1Z’«¶x±í»ââóvÒ_49.Ú¾ï(˜ñ×ù¬êvºåŽÄOXJUÂ"èÉ=`¥Z.§ÇÚµ2py­Ð€žéí¸ŠªŽ8†«ò<ζ¸ª<"“ÖbúË<; LDSÝüÏ[ó qìCµ50ö|bhOáC(o*™Ñ\ŇºãV ¤ŽÂ›¸U$ŠÝ.:·½Áè“>FÎ¥Mƒñ”ùщ¬¢Ý£±S3l++ïViÓöpˆ°Â5¾êzJPä^ÅÞ>‚Œúù˜äy<õä<°WªÛµ)¾“_…l|Q!$èZÅj:ã¾Hý4±Ê¸ ×{-ìkþ[ûÝW'&%š±UáçÊ;@mKÇP¦»‰‹[epg!³úV¥L…¨F»¬£YlÇÝŠíѯ Qoï§#ó¯I+m|¥o_u1ÕoóÄÐ?i¯°¼+.,653ÉãÕô'€Ï(t­=ûOÅUF[ƒ”6¯¶› Ÿ fõ§”–UÏäÝz+”ªÇ1tªABsBP é ´ÚÐI"ª’UÂL¢¥¿Öà‰ƒÞÃM}èŒùÊ 8ͳO°Æí‚\ÈŽ’`?— ÙH¼;­1¶k:X"ñú2-b.\-_«ú‘Û eíjKU¡ðì6ï¦æe/Ê5ifZ :\àÓ™}Ó §hV2Ì óƒúý=Dù¦ÇƒÐ éX…vZ×VsD¼áJUÍ~Á™~‹Aª»%I„ÍsÉí–Jyæìý‰#˜‘)k6}ógÕ!8 ÆÙbd™¯‹„Û¾‚’t@y =G&sÚBØ»œ¹dÚ­iǤK!L«†ìöë˜ø'`uq(Ä@_Þg².©’¢`R|Ñ UÚë[í#Å=nNô *²ò˜øuòŒ`ÅíÂ@„?šùë6j{çò×Ïn ÆØ…+07¶7E‰k‘i¸} ×ú ‚¾Äþò’¯1ûäÖÜäSÕÜl]}zÐL“~òV桾Ù6ã(ÒÙŸƒxBÞƒ˜SýøŒÈ*$³˜ñ[%f!u†(U‚ó f†’¬ã+ÖMkEŸ–¿Á§ç«}ŠD– mɸ¸dPš•–ZÂè^ùyJ¤©9áDV5G,6L×f[|¼z rœê»îë$¼©—ˆJþ¨Q³’Á/¸IA\a5;N¤—¤XX‡”2ïºF M…“.ò"Z´£9nœÒ?îë>UÔ}Žå¸HZKÜËfÓ·‹µg±òò\Ü{ õ¨ Y,4¡ý^’ƒý9Q *ܵM¾ŽZöö”RÑ0ÀËu] – žJ:Ê%Ö×qIµ”æw;ƽ¢MÐ?ÂÎHùö.U~ 0ž‚ØÉÄA“›>”i·è]R‘•<[›ƒ²%?p‹›:Û­O ¨þ 5Qa€Å'þ.>^Ñ@Ù†8ÑQúVÖY/c&ëf;ËD°…hÇŸ lBÛÜZ]n¸œ”•.’öÚN÷bUìIln$âgúúD’2:$ã¶'{[/µ4“î»ã3™…×*äüu–Xà,ÊɘÈùKùJäÍV® ʵ©ù–3é+L¿]DÈ9—în§>Ì£ÈÕ‹tšùG+´!C_Ó–:-+\ȾÕÀ›ô0ð3&ÂÁ!¸'¢5‡?…²óáŸì[¾Qá('- ¹DÝ’Ç·Àœ_ä9Œ¦L6ñÐs Y jËÇD Ç¿QÿÊæŽh,õÚÖ!^¿‹yÇ·’|”gq—SòÃ%®hMÿ.’g¾ÜþXˆÆ—ô)ë´î@þÃQ¬Ñ GôwÌÃNgÝ&̨'áñÓ–R'ŸÇiíqª[ß{Ô…O®ÇDÛÝæ9pÊ»A?“YÝ¥¼ÇÞ%2xà‰§gI3@צh@n`ÎJÝôAQdÚú¢_䭦̋ík ÀÒwbçvD¨k<°D#_‚e™ }ë!!]-^ Bò'Je,ÅO·Ð§âÓo2S«p> ewhUå‰éª4˜–I`’ÿšÇOc‘zªC4ïJ‹Wë9ú¢ªÐÿ0|ý óç3ƒ›œóR—C–U‰|îÚš)l¦JLzKÿ³Ræ†tÀ¾ùöÌ“`ßÁ˜•3x¶LAþç°³‡»ñ†ßd0M3ëë­ÎW¯ïÄrèû„ÀÍ1Âæ-&·}0 Õø•]ä';zDRÓÏ“$É-}2°ù:? £ì»¦p7_êXp†çÚ<ÑpÛ ó×N v3]Ä¢¿éœÇ2ÌG à·÷=²0åÝ …Z»/÷·V Vž j ¿*ƒÐOüÁžbÑÞŒ¾Íâ ‚3Ñ6P@‰hÏâ.CãÓc¯Èý ÞæñLÊw”iæY?`w7Ë¡›ÝLI'ñHâyü¤g*¡Rp=–ÒMÊ‚îüU§Ó·áÁ°ë—­ü%©šç\t¯]—¹×Ñ’$¥u7Yʳ k2·ÂÂÜ»°’ÚGRkÅÄ‚>’Ȩ×a ö•GD€a;—°ì´M¢ rÁ/S¤’âV ‘ ²´{ëå;@4!ö€Â@yù¤È>|ŽÄåé» ·ïƒ”¸X©}¨Íñà•N2)(k‹ßIm44ûáexWɪ}v²Qžß’n#ȳ ;ÓÔ“víøµ—ׄÞøž]0ÞÚ vhû´PyDæ>U2_ñÃ;  ï7)'nŸKÒݶEMˆ‰vÕø:½Ïx*ÛÜ-Ö©4rØû±•tNÔmz±s£¿SS.´¼áµ²Â“©ËïU±†ÚlŽß}ˆ_Û$(ÓW`Ôr¹üòyL ¨³$vªï×ö–j¼òÙ¹ži†ï6Y«¹9Sçß BÆ6át“ÛK]‡ÿäõ'Å!WÜþŠ/åG¡i¿ØÎW BMÂñà3ä†jGŠŸ}ïí!¯´DJ’ßÙ©y¡Y¹OHŠ©‰1­ÕdÛÅÞvÁén˜cÉjMé9-îem´óŠ‰ ãO|]…þ/ÚOEÙ`ÃÝ1ÁÖÜ$UoC{º0‚GÚ*Ü`FŠøX{eKað;59.R2Ü+ú#9lY(W©¤"W а¸Ó¡„iÇ¡ïH0m¶QYt6¸kVÚfhE$û¹@ïS§‰$œX­môª²}MºÙ ùR›• Ý{‚6JòãRI©…@*Ì3jC¾ó¬vÿe&Ä{aÃÍfxUv3çÔõ/|¤íËeû?”úàù/–k#L7`Rò3;hgšòW¬Ís¿ßý¨n+¶8öEYp¸ΓErQL‡Š$Û~Z)õ^|SÏJ]¾¢ž¨ ‚ÐÝ“ Œ*ßlÍF˜0,+•½IÐåØÊP-„ˆ700V¢„¤N¡$³¢3¾ÄH¡þ0z(Îk-k讎±éã*XÏflHì‹s"Ã铼®Z3×qäÍù ®ÞŠ—½tÑrt/s``¤Hxà@9Ÿei>ÓÆžuů»‹O+g§W÷ Ô™3·jˆ?e$|a:TÍ ëk1ëz¦ap!üÆPÓÇøq;Ëv–ö½×:Y„Í3×ýàWÛë;è'@]zDüu’ç+@NàL¢Í »~K`å6÷1¡–¾;hCóѼÙyDö½H¯å¶GãsÍ`ýT=ýR^÷¯'Ž‘0ÈíëfÁòk›FáÀwÅ+Ðåxâ;œ²LUƒ×êxÔ"Ú#_~’jþÅ2ç€w²ýwµ”[öZùJhQˆ„Žî¡ðDi»A…'èã!¶Üñ/TÂ=tr½Y'òæªÂ°ƒ7d[pç!SVr*c{z ÷äþÃ…²Noíg¸>ÖÈ©äIáÅx˜Ã©q:;7"T Uð‹åO#¯¿¦‹TácÅ¥Gug(Q”Z›ˆ¥Å}töjQ*Úx<<âGGñ¶êŠÎ#ø¥u” X¸}„Õ0¡‰á$˜E¾É ¿Ð)æo?zÙü†h™æ}ÿÐ é›j¯54ãAàÙô ³Õ(2^Xµk`Á$è•A•«´zL+Gúë ÔîÀEy×Ý»j9ƒiBL«ºŒýíñØÈó·_•hZJÄi ²=áßÏw}¾üe¡Ý#'ëϹ!óŒFA’’ÚU¸TùðÄððß1Ç=â/1~°#Išcà o‡bí깪¾ÎÓ(rº›BT@kVŠöI‚Òaðqcû:[äƧ…q;^hTï»dÖ^%¬Ïá&–°sžkê@È?-½Ï„ŸõJYGÇS¼Ý~ôÛ§z\9ÊL‰¯ƒ®8zŽŽŒà‘hÒHFV—1࿳ôI^Ý©¹Jÿ‘_%ÑeI&ÅàN\è§m-Ð>Az­—¢²O·ó K&kyÉn¼Ÿð‰¦;,RˆÐ"ʪ>k=æ "‹Ù2?yü³ñòû]ÿ…“¿¸Ù @ –Êæ!Ê4Š—µ@Åìùzç¢ãõ÷VÝt òÚ¼À¥W9SfÓå%›¯0®zù¤±¨ÕžÑh¥ýhõQñ—„lÉs^¯ºh­rÂE¥Ä#ãm¤}Öâ^§æÝkQâdk¥åŽ/ó¯„6‘‘íQ òwXí¤ZužŠšÒÙ•‡Î•Ö­+ü2ï¯$›nDÊ –¤_éf»‡ ®ìíš×;Kª3—qGª£Ú&Zƒ³|Y,Ú僊+n\ŽˆÜkâ’?å“Êcx·öŠ Ý»¹|´Ëª0BXÃhü”\H¥E¾µ 6T¥°tõKÙΘä&ë[Xœö¤…’÷/g<2\»Ë¥OÅû» ÇÚø}? »˜üF_ÑA.Ïb3åˈ¿³ØǨzº•N¨o»kñ^ð»™Ø.µ¼,ÛÝ?]ù‡'ùÝ~¥ÅL¡æ„I¦?N®Ú %tY*± ÁM'ðæ îiŸ¸î*¶FnyémFÙÐýÞ²ÏÁÊ1ßá~s'þà31“E„@æüå'²@=Rk9‘ÀRîÓ)—]bûF2›H ÝáCûLJŽ —è-ÙA Û–BÇ/è¦IìÑc }$Ø3Ø\Y‡baØWGáñ9&cH¶oHÄZùA8×\JÚ/üZ¦´^ºZ»7«¥±þ:~±°—έ-ºBÆMš«|0¬D…./1¡ƒìÊ·ÊÂe$Y„§:û?møTê•tH‡?bêêêO¸¿‹¯Xøg i>§táûxv¿ƒP|Þ—m€?‡Ùv²¼E°ÞGœ¢‡ ³Í¼¡‡ù”s!%dƒÔù00f·U‚Ód1H£ÊmOðöii"hƒcºÒw½:ª”¿Ëx„»±åMCrâL»Ô`þ “9Q8‡q0q·…ðzÎÿ}ðh« C¼ýD‹ZÜ|àð±R|4æCý¼B»“6aæ;ÂU™þ®„îqÊœ™VÇeaU,‡û "„CÞd˜ Ÿ‹k]1]Ç£‘BÔ-˾hî“5.ú.u³çeù^Œ ù%™ IÔwÄð6á fÆþ çõ_²n‘Úp •#[RL­.M帙kº_0b4‚·I­!`,qëIøꇩx#Òí-7Ñ"ÈÇ¡ªÞK…çCš,&V+ÍajëJ¼NÔõä%[ í€®{7ï ýŽÈ!„E5–8~ËFnÊŸ:üd 6'Õ–Ü“z6è{¨KDb‰yn´Ršáï)!Ï€ óƒ§®ˆ‹N“[u0Bë¸ÚÒæ丑šJ Ï~ºhGÉ’)“$ V —ëKØxhÚ‘ 3ðÑŠIXJR/¹–cÜOb¾T•(©¯yÖË<ËäÄ&Í5 /"GßA% )ÿæ€Sk‡¬Æг Jýûr)DÒtî³±2GæN×#óqjñÜvV>ÜçËÁLåæ‘~•¦VtÛÀÕLˆÃ¸„ Ëݽ̬žŠ(óÍrI:ÇÑåäª-ž^<¥â ÔxóŒ/Æ^²ô+˜ ½º-î¶I"ÖéÝeÚí2øå©‘`"K¸ïä'ßGŠH*ƒÇõÊ=òv ¹³ˆði.@“ƹÂÅ}êJ@çйí-»í¦¥gÉç™Õ1¯Q¢ÎscÊeÏÐ}à!z:„EI‹éµJ,%WJh¨œAXO˜TLê$“'BEúLRd¿ƒ‰ªÀj">6é*P÷qò+1ç·øȧlWP#ª‡?¯ži?îÛ.Û†RO$¸©©'!N²ŽG*éM“Ä®_(Üï]E³Ï:*[è%«G:Cñ‚Œ°ûT6 êù‡Ã̼ÇtªO|ÜK¥n#“÷“à¤îÝö–üº°Ç+•åÌ.ÌMÂûÌX›|ØFtoY×áqë2[þé¶À,½7Lvñ¹Õü®ÉÕST‡£­É¦ÏçPž&XÎ<¾‡òÓAž‰ÃåyËB6†·„@TÔ²Î7ž“÷$ûðÁo„ë¸Wrðͤ[Û¼IÑéa16ãV0ídÈÖ{êðð'KsÞR/§‹6}6ìîÂkãHĵz$Ê¡¹Gë`”nÀóªãÑX)¦±¡ìY­<߃ùü÷ÙåÕÍ wÉ£‘`úŸNyA84eªJ˜Yš>•»=Ž_DŠC_’5™ 3 jÚ º1 ¸­<'Ô~ßÌY´{=4kwWpö9£*ŠÙ2;ífâ-'wôÙ™ûú…jϯ-RÁ3@au•Žóƒ<(FÆt{)ÞŠvêÁÊ“mãz¢Ù cÃâbbnLÞ+¤æt6§M,ºc™q[Ìôy>µÙ¼<ÐtØQÁ€¦Hãâa±*QšIœÙ cÞ‰»L“Ð-—““EuŒñ|Žº¶tàú¦Ëx £Qü~2œ}&NÙRÞ5,$–xÜÃ=Ê>ÃzhS®H7ÅŸÌ É¸”ÁnQ¡å8]Ö\—\±Ó“wÅÚcKœæúo”u1`{Ž­{Ôzßo‡éMŽ Q;}Žã¦XSØNb¡ÓkdÉPÿH³X­H8ÃÓ¸*v…£¯‰þN‘,1¾ç£·™(Ø :õY›Ý¨R„‰s.}GdÅý¤ ´qsˆjòŠ–¼5¼‘ô8µ“5Ôg œÔmã Bãžxtœ‚®]öëPëÚûƒý •Ç“aqufF[üÑwË1Ô ³ŒÑ]ÖÃúXe¿ Dû×U6m­_a'[äÜ«JB‚Âœjµ-Ñ󹢦¹ÖÔU1q0ß׆3/ð¯äɾòP¸qVþ}¬©ˆÜuiŒˆÄ+fï ¹$&Ôh!æONÜÜ)ÂïæÒü)·ƒ¸„Üûΰ —¼6HöƨHJÒp‡÷RYP¹»ŒÚåà—”ÌÀGJ3u„Êѯ|¥)zp1öÞ?—\8a‘- ¯¹ß磜?WîÁ»¯‰ï“ó3û‰°¬_t*‘P?H}´tÚñ%ð{YˆÕôFºÑ5)]MûÅßü¼•ÖöI(QÔe ïЫa#\é׈¸ h>„ÒèáÌÃÒ|=ÞDp¨M¥>9}¢ I¼«¥_ê:ÌíjÆfiðš{á‰ELéà”çy,æD·no¿ÖÅUÒÈ4T=×in×ëfQÑ誡Ò:ôÝšÁÿ=à”šê}";Ø°fFvzùÁ9ÅÞKv÷ñ;±=Á,݉¹`fï÷.gU˜\m©4Dôvµ½Ïý°ô~?3fY¤…pÎËß“É·4ÀtÙØÃQ™:ʈ݃®;t]^ B®)ŠÒØY±8 õ.[Žl×¼s¼óߟHÌš [ˆ*÷œû,Æ|¿Í0g‹zîMÑŽ´Z2†`•jŽOCñq¯º2 Ó³F?aÚw:?N¨ÊW=£ïZYÙ^+%ZÏ@ëLkîáõ1ÊÕBŽýŠ|«½[µñ†kEXSÌÂÄW>ã<ô£†åKÖµpå—÷J~¯^ãÙsÚ¥öËðVv*­˜K"±©ð|TMÒcbß;VN9ø .\³Cxˆ”›V¶¦l GÚˆú+öüüûE $ŠÛ¨Ó¼ôE¯Å¿Bš=œá ­Õ ‹×ìƯuÞ#OÁîDð,¥îʪ­že N öè~¶Eª0Ô*Ÿá­ñ„ãG äŸÝã‹&¨íÇCt›°S1S8Ãç®-JÀ+“=ÞwŽ¢d?2vkW t½ˆîmÐƱeÍ¡|–Í¥¿ `ú²aìâ.ÂÓŽ¹ A“áeç&V:jø¬1ŸðZãWqTTøC²Yu3®Ùµ µÇ€([²AÁäÙî•,f≗´Op NWG­a×uŸru ð:Égf³bpg«–ë«Ó®%Óï­Äw±µá‚VEÌöŽW‡ˆéüˆ‰¿„ëóK£ª+AÌâ…\ÔFÏO)ÒÇ{rx©l¥•²Y_ Öø{¼“Bdáú†1É$_ }ƒ¸åƒ5ž¥€Ÿîô˜§'d8ýĽNÔÙq@9É棟¡ê ÚÄ]•è{ì]Ý€1œÓß}'ˆÀh{€ëŶÊ0¬ÀÍjN‡ø”8c)L•h*ÁmäT@™ #iá¥;ÿRÙ€9“˜®³àFöˆ#+›;‡ ËÏëÖæže^HöÃh9Ø“Trbˆ' ×a_I„kñ—ß«.ß ŸK°´È×:×é%Í{g\W]%Ñ—u<ëŒÈñÍ¿TßÑÅn1ZÖé'}ÀÍý‘LX;#[_Ì1íEº½4gwì'þBWºNe©úJK40Óuæ¹q]fWíV/òV…‡—¹KƒÍÚNøØUZ0ûqBAEÜd>ÅÄÕLZÝáÅ~¡Þa·ø.4kW„UMêAÇBûuÛr7\ã(1$éf†²1Sp¸góõÖsg/næ*€‡ðª%£ RÝ_Æ9‚§ !êñEÂO‹G{—u~"ÄKÇ]&rÕLòBÄ*4#Ïù»J-²ß&Ñ;ødÆÊŸ¿Aàg©MÏcy2ŘoØàί Ÿ}ïþd¯bHC•s»raS8uUZËpÄä{ŸâÓv¢¦ýºæ—•~*;–£]ûâ —²ËkÓò´¶T¦av#^ÊÕÊà”.Û^ÜJÈWù&l~Ƽú}N;ç}‚÷-QÏ{ç½¥:v¿f% éõ"…r>N:¡-Y~TE&a>N:å5B,…XpŒ©´Mÿ— ŽDK€0§ð‹AÛÁŒæÞŒÀÑ%gÊ•c…Åý»öBÐGüѹ|äRË/Gx%ú’¡?zª”Æx¿hÉÛWÅÔÜ@ŽU„ù‘ÁÉY ußÌ<ß8ÜMú^nc`ÎMhÎ4È,Åø·MœAoºYaþV4¨$âC÷O"Ù>ò®)Y^„©ýn1hõRjHé<»ž<®‡Ù,Ó„»Š_-âøN60‡]h$‘ ÓŠ*AiˆGÅ8áYï5I«¦m‰çB=¼ëÙÑŸiÄEÏ”'ÁŽ ¢}?¿„³’eGs¦ wD¢XÙ-²×“Ã+xÒ´ôŸs?í²¹0C Ÿ WŸöë,%iº W@½Œ„z5¯‹¦FÞ<ŸH«E¿§ÎÜÊ—*§X8Pˆ“ ÂF|fÏ,:lª–ÀøÉ:qR«_ $ÛY·¯ƒ¢g45qúù+]jßÎ\y»ï m@¿[éF÷Wëép4Ø¿æ¡ ð»D\öµ33{l¤b°ÍÄa´›œ îÿ’»¨ã<ÆŒ(ù”&¥ÁÃ+…§„?K3—~à‡“òý¥1sýžð| Y Ú` fq×½!»u¡ù^‘rŸ “ÀC„hþ­÷ëxË~§$ûFšV5‰…á$Ö™Œ¦bÑ3ì;uCÏYÅáÙBáÅÅ4£Ô!‘´KU&Ÿäž’æ!©.Jyûü¹tš"ÿHÏDÐL7€g;¤’ãEYúFUäÌš/½eãcÁ>jÞxwy½@ÔîMÎW9n%;7þ¬Èëä]÷rëˆ+_O'¶ÿŽŒÒ“EÍð­ìˆ6‘öo#Tgõs½†ìF*Æ{j eW·úó'úŸòf·‘òàÊOÅ4ë•?_Ìê+šûÓJÚàGÿ&ÌB‹šçÂ:ßü¶È­eÆ âìíU5Y [ô ‘8ytîb…êì,ýAÊûÞ‡s¤ž:‡N¾BD`ÖÔ)"U;Z¯¸@`YT£\Õñ’Ç«XQ‰– ç{“ÿÚöJ‰ôM¾¹T ûéØ`Èk4!¯|Y¥ÿK;9¾ÎgÍchð»a”y.ïÊø¶çaÂùp‘( ÁΉÜß»®"ºáÊÀQ‰)ë(sCø,f9Ueoòm´<±,Áç¢ÿ>ÐÏ‚j‡ö;vÅ{^L`nТ¿€µœ¯ÃÙÐ`÷…ÀDG×ñ -ÑÅAï›Ö¯¤“`–:›{£å¬D¦c¥Åyã­T[šÏ™ƒ òÑ÷g>´«ºï~¬Ø=ý²‰ßÌòOœ [€V—€ð_ÏKò¤>¯g&hI{Ÿ‡ÅÁ¦ûz÷âæH¾ŒÉ[W¢òvj¼Ó[×(z-A RRt5.yiL²uÙ}?kpcÜ›aæy¨²>*[+-猆”»­Ãª–ŽÛÉ;dø¸Ðµ&§Äº¢´#(7‰P§\àмÉܺëf®d‘œ]a«x˜Ö&˜#ÇIZXË3"«“³£FÂ7s5ˆªT¨¾IŠq.ÿ™ùÝ°–ÄT™ ¯!£TkˆÒ±a»àò:ËÖñx¬Ÿ1‚?ËH÷§ÀM FƒÇµcR/ñÈ•@0ÊÛœV¼3T^tû¸D¥J˜_ÑŠÍ8ÃÖr8MÊ°[-¢M6"­Quõ¢q\é<«ð+¸Ÿ,v]·\@*Öšñ$Œ uéPÊaô5qØÉ”¦éËBñ ¡MÀx?n“0?°Ùˆƒ"‘KÝ¿Ù”Q»¿þqbÎá§ÂºóÃîµ`¤4’ÖÖni´#âËBÛGÙJ­ÛZ|Þy ˆ$‡b:ÉŸßÕê&Yœ@3Ü%*ãdzHöð"ôÚˆ·Ë=ÃÑ¥у³BlgfÊ{#î™'‡ßívFëIh¿6XíÂ.ïf»êý.Ž¿µåX3M³dwdvB;Ìr³#>ÜSæ­ÛYûg¤!$—Æ óRþÜN€Ó˜‰.2Pú½êiÆLì,»ºƒÐ9&uj“±—÷1x¢ù3Ø‚V¹>8ÐúÌ,0¬Y*°w¡ŽÛ,ÿa3û°ópkÈbW?Ðõ å4êëç+o[f6œ†±®MuÒƒˆÒ´ãð]ÞbŽmˆ¨¶÷œ!«/÷!]îïàWq%ÊëéÓõÞ_N.0"UK¾Ã5ì´©ä‡g7͸õç;OF5)ŸoêÎ{1­Ís„uŒËÇ·®J®!8/}âå  ‘+®9£ *½—c¾HÔhŒ‰6qgÍåìô$&úH1´ö¡*áªJFRëu’gñ9·mMÁ@Ôâ:)èøsæñðp–¾¼¸îÅ :./|ÌdÉÙ²—àëÈÈ1æyÚ¬{9ÊÿàRÜ endstream endobj 733 0 obj << /Length1 2805 /Length2 19898 /Length3 0 /Length 21482 /Filter /FlateDecode >> stream xÚŒ÷PÚÒ ã$¸| ¸»»»»Ûà0¸»×à–àî4¸ÜÝ!‚CàÍ9÷Ü“Üïÿ«Þ+ª`Vwï^­{¤Êj "æ S $ÈÁ•…‘™ ¦ ®Î `ffcdffE  P·vµþWŽ@¡ tv±9ðþa!æ 4qËÄM\Á† €¬›€… ÀÂÉËÂÅËÌ `efæù¯!È™ nânmP`È‚€.b G/gkK+W0Ï?¨Íh,<<\ôˆØ­ÍL &®V@{0£™‰@ df tõúÔüV®®Ž¼LLŒ&ö.Œ gKAz€‡µ«@ètvšþJ hbü'5F €º•µËj Wg ,°³6:¸€¸9˜`v€šŒ<@ÉèðcùÿÐþ)€…‘å_wÿœþË‘µÃ߇MÌÌ@öŽ&^Ö– k; @IRžÑÕÓ•`â`þ—¡‰ |ÞÄÝÄÚÎÄlðwè&I€ 8Ãòs1s¶vtuat±¶û+G¦¿Ü€Ë,á`.²·:¸º üŸ¸µ3Ð \w/¦škëòpðù/²°v0·ø+ s7G& k'7 Œø?6`Âo™%ÐÀÁÌÌÌÍÆ :€žfVL¨{9ÿV²ü%çàçãrX€ÓúY[Á|\LÜWg7 ŸÏŸŠÿE,,sk3W€)ÐÒÚá·w°hñ µ'@<~,æ¿~þýdž0sƒ×oó¿[̤¥&*¥©H÷OÊÿ*EEAžv+€ƒ ÀÉà ðû_/ÿæÿßÜÿ–*›XÿÛþd,@žÿ¤®ÝÓpÿg.¨ÿYÀÿ2(‚ÀÓ Pÿ~}ff3ð/–ÿÏ+ð÷‘ÿ“ÿ——ÿ×áÿ¿IºÙÙý­§þÁÿÞÄÞÚÎë ð4»¹‚7CÞ‡ÿkªüÏ:+Í­Ýìÿ¯VÆÕ¼!"–vÿÒÚEÒÚh®líjfõ÷Äü· `ïvÖ@e‹õ_÷ €…™ùÿèÀ+gf ¾S\ÀÍú[oÔÿ2J8˜ÌÿZ=VN€‰³³‰3x¾X98>,à5zþ=Ú&F+øœÀäŒðWK99L"‰þƒ8L¢¿€Iì7â0‰ÿF<&‰3€Iò7b0IýF¬&é߈ À$ó±˜d#0»üofWøÀ슿˜]é_Ä fWþÀ|ª¿˜Oí7ó©ÿFàÜ5~#0»æof×úÀìÚ¿˜]ç_Ķ4ù±ƒÙM\Àãcíbû»X`Z×ß'ÀÞL#ð S3[;«¥,¬ì‰ÿ€31u61Ú-\ÿsü#þϦýë•å?b[ ëÿØó°ý+ÿ?ÀI™ý‹8À!šìÀSùobìIìí§ú׸2™ÿ ÙÀõ3ÙÙý3øcþv ¶þ)ç_z'7ðÚÿëx\íLìÿð®Åo/` k÷?Üþ¥¹ýI 6±üMÖ[þõVÿ4§ó»Úìà"Zy9Zþ°Ë¬ÿ€ààmþ€à®ÛþÁõú'¸0vmío=¸ºd¾´™~Sq€}9€·ýwÀÔnö¦ݳ–„~N˜@¿ƒûýqŠ…œ¨ão5˜Ãüæ;üOÿÙYþ‘þo÷ÁO“#Ðü¶ÿaÊù·Ìô»ÇìàÂ:Ú¹ý‘ø{“Óo7àª:¹\榴”çáÿR²°€ÿè 8éߎ9À‡\€öÖÿ;„ÙÝÿh؉ øýü7Bp"ÿg“XÀyü¦¿AL®VÎÀ?æ\(WÐÀ>Ü~/˜óï¯J.f ç?« n¹û°Çk vêù³zýÁòþ3Ø“7Ðù?üÏínææ n•ëß0øêÿ/þû[è 4CX^™ñ…ÚÔ‡~¹¯!ð`ØŸ˜¥Ø×J§aðYvît{DO¥©ÉÞt¾IéC[Û• ¾^!ùåsÚÖÑž¬Òñäûl”¨:³ß°438Ux*Ò0@ô–A]øÀ÷—“¯f-td·,E¾“7Šò'Ì{~)φòÕñð…}•ƒN9Äçòo ±1úA%s¦9óïÈà\ˆÞÐb\x¢ÎÝÜÎbäM½’È&Ò!øŲùèn±Æ=Ì{¯Wª³ºôà‘ãé¾#‚¾ÁŸ¡ô=ú(‹»èSZ³)°˜ËLñ9>@â;ÖMzΫ'/ƒËlç¼Ì#5Nî×ÑÀ¤ýémö¾š±#m½ã)Êâ;: I©OJ­Åý†Ãoï"éÌÜãá½|¶—antNoäNÏë§ô¼Gõ,vÞ"ì`¯µˆ®‹ÿŠpòÃR€#¼>àîñ-´É*#¯óùj3uæ8ëyà©Ö9X!ñÝ ¾05 ³0³™‹b$ñ¦“]ÿm O‡)Ä[ý^½¼IUF§Ëƒöó‚qÝtn¹'oÂ&/»”©bSŒ³Äs]ìJ(”Œ(úd®¼Â…‘r¹:Þû÷²«æÕÂ3’g ‡w½FåOæèï-éêOZŽO£`æts"LZ[Ò´£o°¢¤9t˜Vvùuë "’!q$&ŠôÆ&)óceûØæïn‘cöà>¢¾³r´µh‰TԫʦÀ}½ª‘ì²TÍ+k0ø0‘À¯6«ÜÚóŠ_Y$pS¾£7Nø5yÙ ö½ú¸îl¯î’רçpML}DÝP¥¸^âì1D%FÓ~û<aG˜²ßƒ_Wâf÷ד›F£_“±ù+cÒ$M뱆'÷ƒñ#³ -³´žö­ó8:ÕiXã‚gkÈŒÎû˜• Ž>Ìâ=¾œÂ‡yÇ9|'L5]V¾SÓŒ÷%ª"0#µrsÐöÙv·†k”Zk¸ÑëC>Ä-Ÿ.~ÙKöã¯ÿ¨ ÊiLë&X™ÏaK”ó—Á /âÆQçYSxRRF‰bä‹[Oˆ‘¥³×®Ëåó«OºÏÅ:°ÐѾ‘Xt« ùò™c¨Ãq5ATæKñvA”ç¹,ŸËQ¥3–Ù R:cnžýÂMï ÙC§óëÇÌÜýÖ/z®ÓßFF?®|Ži̲ºÎˆj5ÍÞ~¡]&‚"D0,2Ž"(‡!…e}à B# ο,£‰+óÕ˜ù1Xvc ÷P)ÞTèz6gžÖW’/P™•Í1ñóKAsáw®^ŠSká×4œÌat<È™È1u&ˆi§H|µiÉ㺻„6–W‰©ào-럄‘g>â²à}ý\/i¨*ô‘!'5çª¯Ø 'Þ0›ô)Š–ÅÒã€©8?¯•­[¸bG¿–Ë{ÕÄûd†…ð˜æC ãVÆÅÏ h Ï`ªöáò»ŽHI³›.ÖÎy¸3¬£¤Øçûñ#¶@Ó<ƒˆì¨^¯ÖzÞ¸ñ=d‹…‚²µ“èäý“Ëâ§R Ë3ŠnÇ‚'~ëK%bj*Ÿ²øùú1Šµ5`·øëåØ ÁNëÔdÏñdU è|)h6¶=ñÓ&¤7í»nqâéò+UjBU8 ¤’ÏŒdú‡¯&ÛYZÃAO÷S|ëÙ…Êö"sÃtùš‹£Þ룟“²ÌpH"Þ³ª£ ä)»#Pâ×ÖîöžT&Ü©ªf•‹‰ÁÖpüây-r¾M'4$zJ~¸6Ds"œTÏ[B­Eu@ñ": UŽ„Çàœ4®^ž:£cƒ*Jo›]zH‰0Y!A–åvÙ±¬³õXfüC}ÆИ¢‘:µj– Î>ã‘QŽ Ung™J0=[bKY‘žWáÈ'JMŠUE˜S?oKˆábÞG;–*põè&@‡ÑÉ*ý+ìAÞÕ“]°Iy©Çø²bµ†ãD‰qUÕõN¦OÜž–¬å7SÒ4¤ñ/.ýA£êßR ªÄ{ MƒGxµœH ¬ <:’_ Ë`àc¨öûŒ·¬ áúÔÕãe*¤?íöš?¡wN$]ÅÝ}Í7ÆX¿]Ø J¼]\P•;Fn¢P ÀTè°´ÜV|È×èž©,e:Sz„UG 0¦<#ô ¥~'7ÀË(vf=!Çó©ÛSz€Ó}GâyŽÝÓˆƒ8r?>¹ý9*³Ÿþ:·Ä|ÇŽƒÊtÌt݉þ£ô-#@)¹öˆ{`û­¢¢Ãn¿Ô,¼“ÛqËPÝ‚B T×u¯åÓñœ94#<èÜŸ¶¿ó#Æv{êh7Ëñ~¬ å{½5PâŒúãüi…]"c!:RnÓ˜š/ÆU6F©á·•ê§–n÷<Híç%›RM˜Ÿ!¶'ƒ”Y:gÖÄË?ÃÇ|qKßå„»‹ÕD+½w%aê6b%Cvdá•H{*^¼ †¾~–`¤áþ,’íjL—6 :Y>IyS]…âe|@êûPeB[=a~¨˜OÃè*Ch唸øILË ïô=°½.°Fð0T{HãíÛ Épüj ’k³›oì‡33ôÏ6ÇÁ¥—§%nøÍT­tB'qùÎ/q>kçÆõXÉÃæ)¾‹¡ÈR²¯ÞL-ÙGÒT]ºä¡–!2–& ¹c ·ââuÑÆ#ã ßðsmúÔÈ;n ½Ó¤¡ÀÄØ>²]c =ËP>‹9ø± ¶è¾:×út8ãöjè¾òH”ç-ÌIUo»%²ó¬nƒðœº&˜‚ ·ýQÆ«…ùf[ð,V õh_2º ‹zZH™J<3zhñ=…e€è{Þâ‰ÊÛÚÊ5ùÀóX¼±´|¦‡´;ö­ üBøíŠÂ° íç9òÛDÝîïךϸ4ÎÌŽ&¾6ÃW@Pµ@aE8´*¢NgL²Ädkm V¼À—.¿j®!•¥+ºÁÑñ¼® ²s¡G{I¡RÏô½ln"—!÷õD‘Uyî €”úŒR|+Ít_½E B„[tEHÖ»¶„M>=?î˜ % ’Mb§B¾ŽÀëô„ýøž½€ûáX½ØR´Ñs9–Gã—ä‰l†ž£Aâ ì¨ã¤UÌRoþdORée¸wàÔ|²wÁáF—|¸PCà#T2î3/±\4_õÍcÖ+ŸvJè ùR/®éãn£¤¡y¦è$ñ‚¬*5$§ƒ:í9;iv쌗„1•BÓ/jhĪ75ç£ ˜Ê"ï-ÕÉ,cÈ`„€wi/Ú%”Iª]ýC§ˆ¥¬ò'áýœ0H—BV4Ü”ãØL¢&h!·“IqÛ™#›.\ÑZø¢¡µ™!½;Y6É9ɱ[üž‚´ø7Ylö­w¸8‘w±×!k‡eòûôî“ên*G 6Þõ+K?¢&‰Æ±Rê]µÑ± fÆäîš8– Dó'œè÷?Geà&ø:• p1:Gš.ÛpT!»_RŸRÛe éSȆ…²r’ƒnwMEó¦&‡Ÿ¹}×V¥¦r7ÖèóµK#!8 nÙ±FnÖx’hOÂaå³ ñnao£·}ÜGÃq}Oüu Gˆ¢mæ.Õ24J­¨ç™œ€óŒnZѤ=ŠŸ!AÛ0<†½ í?S åt¿ñv+L6 y=ðÖÚ³ÑlpÝØyƒÒ¹çEæì#/~¥ÍHýM2‹Ú‰š9ì5Ä»}òïaÆ4…}U73ýïya£p¾w§¢ Þ«bLKÊT«Ûz^dÙXšæJ'›¿a¤æEèÝùQ‘MÈ3 •FQèèÔ]~-ˆP)hxìíI¿âc˜4afàœµÃ ªn oj»)Þ¨t•NV_û5µHUâ›vÚ 2à~ ÇòjmÉ;#úXô4W’S$ïühoB(h£Q0Ë]Í]>ád‰A*z›5wd–<sHùO,õµæ'¬ÑDsæ„Q»¦.ÞTÝüûS&Z"å‚ìïè~As¸m È«_=V%KGbCr—êl·à8´bNOù<×1¡~¹|“ëúúÍOùù,ŵûS‰¬gC*÷âð¬*áê6#®¾Ï¨±Ûú«v$ISÉ5ÅqdüsWŸþ¼³Cp¸¢,IÓÉKôÔUƯ|É*ÛÊzÄØ«.%›î´NüêÍ•ºFx- þü´K™Â¼fZ4Mù}úÇŸ½[ðå²—:š—cYÜg=,½¿àÌßËʳàa*4 a’ d™–Œ«ô¢þèj³0k™žÍsnì¬Aä·´óý‘–È¡S#7%¤¶ipjŽ YhÏ1/í²üt³†=xÂtµÓ=n«I¸îv`¹ò« zá;š»]êtʾðCM·‘’Ìf^Ö“O‚!Œ·ƒ¹óÄ;Od ‚‚Îq’G .ÙÍ™…ËûÐÅÙž»Fµœ²]ª<|o¼¶SÓ¦¢Y3[eÓ7þƒAKÌu}_ï‹'¼ vef«HC‘ÕCZ£UËÉg鋈ƒKϘòD! Ïv‚(%Òá¸{2†žÞzhÜeŸ±§-­ôÓgoYGèo¶Ñ— tèb® i[rüÛ z¼×Úù7¼‚4Ħ…ÃÓt>‡ä‰´mÚ»å„Or>ù)ãI0ª›6é¢Ï·ùg¢±Ei~jüŽ—×HÀ®zLO„SX?Ýtr±‚‚\ —M‹Óê¥ìÆnóÕÒ¥~=™––;"|1Ée®ôõóÁh¨“Vt¸Iâ^ÍZn.¯ .¼;1-™ÿ8qº×ñ⎠¢Œ>lú G¬Õü:*ƒ~rÔÞ<±év/}¥’7öÈópyU5).¾Ä\8ÑK  b7<{4€ 柳î Àî°t¶ò–ë¬`Ò4Pý›ðG2‚ÇI›,ìäy+m–»>ª›ÒiØFÃb'Tþ)ê?{9¤zCÜhF &“†ˆ$FoÍÓèì*ÔÉ|ˆ­9kÜ5•Vq>…¿L°€ûx˜\n²iÉ”áÙQP«8s>8«Á*te)öK%¨ë½#‚ŸŽ ¼œ^ðÃ@$}×ìHúUåqxe[kþ;-uÈýäÂä­SãH×I¥È$åÁL»ñø[uZ}fuÄ bŠaÑ•ý|Å|¤z!Xæ”4G¼×óù‹ÆíÆ:ä•ñE¸}A“ ç/ì‹ÉóÂxæ]åi½)‡î5X P'íÙ@ì~q Uº3ek¨W—ŠUíDn¢—̹i{ûèÀÌU>‰ªù“~ƒliß*µä¾ÚºˆÀû›ánøî’‹û1¢Æ’ýÃÚžŽAÔr»C”›z‚‡Œ]Àð]éU¨' ÎCÔÁ°ð{o7)dàQuK´t¸¸:?õu“ôÉÈàȼŠ)( ì¬9˼⎹— íb#:×–V‘ŸÍÒû»f!‹µù‰¥ÞÊ´*ceij‹ªûæ´$‡vŠç¸Kñ¦˜6#eXPnF%Ðï™7ß±uÛ€f:Ú P¹¼np³¸Þù„pI%óVæSǎЦ“Mùe ÂhÜiæl=]nsÆÐ Ñ´ó§Ž2NJéé1ž{gX߯\Îõ?¥(x#®d_šù7¨+,¥ ûúük<•á åv6æðp{·tuÂÄÇ’Éî[Sȱ„,Z¸ˆÓV27ýÐÛ’´Çö@G‘‡lÏÙT;têa@_®ÿ<Ï{É®¤¸Ñd@*–ÂøôëÝ7V<Š®èxDIa<ÁnÖf.{²fº¾Í½X°äbÃz3ÄÖQ‹À‹ÄodwOõ[]ƒ|øl¾"‰Þ’Û:ì·ZðKj„Ò£é²Û%¹Ç4þ¯XÙ%¦zÝèJB_/ø°óT="6Û†$ª8> ‘åjíûòÍWËp~…Jц¢Ò7:’{¸vñcÁóQ¡ñÀ—=q…×ފöfs‹QÅ`ƒRÏrâH4õ%ö?}Lâ?f}êáÂ3ñ ÊËÀ/’מSâ<|bB£‚2æ%™š»ì„jìnL,%n‡Ä¾ä¶Œ‘$¿‘¢O}W0öò“:)ÎÆ¢1KZƒÝøù1ó•k[‘”[t´3Îr„q tC<…Ó4ïéŽ ×ª&4Á¬Ë_NôåJÁ0$µ½ð#™_;ÒÜ(‡lè?´ÕH÷–¥k‹ß^ªÍ=ÖË’™G°¤‘Œ˜å¸ø\¿ 8Y)ÓŒ¤æ‚>"*£Þ3?ç~…± ¾ë[ø6'øy}—:ý&€D¹P4©E‹–HWld0+J)÷D-(ðí)sÃqà¼I,Ãmá"Q雺 {ðÕxÎJ‰ÔRoñÒ18wI°¾Äâ±ÞåØ4Eÿ¥xWOBLå!߇Œ ¹OQoC–z ¡åÞà¥0ijážÕVø@HI?. _‚6ÓüEJ/Ø"ì¼›2¹L¹Ç³µ‘Rã]fÆëia¼µ5êXZþ‘7o°ž “üäQpfÆ ±àPÆνÚKùzùÙÀ ¡Ç+ô¦}qI¼–ü¶\ódÍ/µJ¤à” &F=îCÐRi‹HR&{~ÅÓËj›•u`Âa< ÕH=*Ê+Òê…P[ ý¤"8’E(Bœî¥Ó8#m[¦’Hã+×-CEž¸Ë`^Èê2†¼«V;mrîã¶<Å™áËwRŸ¹¨ÉRœ=Ñ” ’ÅU; ¬8v6–þñRn¶ÎŠmqÝisRY%÷­*JƒµŽ™k˜(Y„ϵϾ‚ð-–ÒBaŽicy«šõ4p ÊOÊ÷¡¹»óŸ#\M™;/òøW eÚJ|J[MrE kò÷'­Z~Hþ§÷ø™ÙôƒbŸû×|çÛ—•Ö«†µ#×`sº‚Žs¤–à×Ö|ãØœ –ªw#40Š i1 ÷–ݯ¬?JØ.¿…L™Ï=ò^;WßLYÞÝÝáxm LÀL~‰¨|Ÿ§9ÎAPälf.3‡Û,ØW§M¥0d4W<±@«}ä}Œ9oAm9Ò®éØS­óg£×±"mG -_µWŽ' ÕB*v`Ó|ÙLÿˆs”,[6í£Dr’6—b!§%w‘IŒd¾òÌÝ2÷3aýÐX®lŽE…¼÷°»”ãàUœz%ó.C‘ù*5Vûâ@ô°V=ùöã–Ôúƒš.Às]PùÝ+,ã8RëX\‚¢Ç”¯UÈ“`eU†êk+Ö‹JÓhY˜Ó®ÂF%wCi™•Vóž—z†K]ç¹½Y…ؽE‡Uàt {°ܺ =ÝE9P^â]šonÅÖâßéÂò²‹+ëˆs­¸"ÖŒ›Å9oVBn°?‚öêŽËéÜ<…ãôž<׋†nZPdWÁÚ>‹=‘)ü>Ofê¬Ü’¨ïm6͵_8ÆF¾ v‹+kdÎÙ8m‡:ám1/…Ò¹§+KY¦²|y¯ò¸vJ6xëA0*%A8œ˜óšn=Îø~­çS}#5@ŽO¶l(_x-‹BRöy§ýÔÎ\`ÄÆ®)ö˜ücoÖm"pÏ`ì8j ëBuŸª?“–'é=l,û°Û¤Ó¼žܺ[m½m #Þ]Iç‚d„JmrÊzòÆÆžoƒ#]©7ð>%+Ú*>åluó Îp2éØaÓ»–nγ\²@\»•Q¾þ쪭¨3êùoPÍJ2VN‡3wnܶçÃÆ* Ê S"Õ5tzÍÅŒTóMƒÉwœ³ÓòsaœAÖóÊ°)»ºIFzC$Ëz–Ÿ£F¢Tqb}::mž¬3ÓðÒw¾j;žÐæ}¢°~šò®:ÈK¾J=>¿ v:—¨õ¾/Óé6?ËRs*C$žú ¥43ìmýƒàNX~þ±feM¯àz²øJÐJ•½åë:“v:i€¶„ÂZ‹³µ¡¹‰§æ‰%Â6÷’«/Ü;„QÒ(¬{ÔJY‡O‚Ì Õ7£piWïiÌîÄNð—]2ãgJýF…¤úO„~¶©fžH¥<¶ñw“<\l¤°öùM#t«Q;Ò…²ùï¯md23XÕ¤ºÛ‡w$ ÛÃÚåD·vºÊ”·JžìRšaÚÄÇ«$Ÿˆ¯‡Ñ×ñ<¯1Å©Ð]T“Ëš(O‡ŒôŠÃOƒSÉ’÷ñµé|âß9 =‘©Hn7öM®t„}WÝ ç_ïÕÌM· ƒTäÙQö²Ï8WR U%~ÿ$ ²2(̺V4nOŒÞþ‚0侓œ­dжDÕc"Rü÷_nèI£†8 @ûÔ cøŸ’ê–­ÝN¢‰„›î¤oÆ œ§äö˜B6–˜mBèn@&¾ãk Ágél„–ˆ“>|òà˜Ð´ 5t}^„³ø®¿n§?ùñ~¡÷‘öW…yùç/ÎB+”’Jjª7ž®¦Ñ¤z0÷ÉËëï<G1Ÿ©TÈâÓƒ?.‚}Á_B —®Ñ³R÷jË¡Õñt¢ÝÐÉH%‰· Í€¥Uà¥×«z ’tÍèÍ®ó2as-…ö´Õ§–}#k9›Tºß°ß¢ô~ŠêPpÁSP•ÏPùAÊ%ðë'òhpš¬¢lXžh‚üŠãÕòûj¿¦0?]†t‚ÉžkéV„%A¤ í«6S„†áJ ž])têT÷o±Ng>ïrʵ=éš„œF˜H˜ËáÓcx…†é›‡¨–F¶’ûÇ8à4G5ÞÏÑ{½Úú"ë[ËfùC¹>qFsÐúî±×oB#fs£±Ô©'|xv/à/‰îÚŒV¯™ó\V=瓵ü¸áâB¾§4”KO4‚ë(|ݳnx–ŒØçÊ×9åö“*@wû LÏêó°àå² É3#ÖåØP?Û‡bQÊ&ŒCB\Úý'%(‘JëÏ¢ƒfƒ”Ã=£Xš4Ä7ÞÜ ÍlRk1¢gEÖ:h‡«cSª{R 2}#)µøÖ%‰En»‹TãÒäMa{õ3žgÛþ`ªó Ãn,ö¾PF«%K%ÆÓøA {f£³"€ø0‚ Wˆ•2Æ5%ÖÓ „UJàóêä«Øx©ÐIŠÄñ6ôÆ ;ʱ.ÁÀÈmFí`¼$á¨-£p%†#QÑ~¢Æ{››atßy‰Õ[¡ÔÚàn»÷_\æ;ä3ŒŠ\Ä?[hû¥ ÄË *Œ'îu’I‘Ï-äoöÂμA¬|p¼’°ºŸPzƒÚÁµû¾¨‰N_yªáÎL‰^ϼ¢:¹•Ð ³J)þó PJ·.™0ì“è1·4 ËË.ét’ÓÖe·:}sà(óéÃòŽv.5Q­,tNŸ–j ì÷eD¥6—0,µ‰{¬uÌ‹üJß…IA×Ø«¥·ˆG]Ó;®äÛµh:QÃondpa@øAº‹=aƒä»? ÃÈ‹ó_eÆð£ìo4™+âéÞs‹Ï ë(é"ô@þº@¡ºŽ'‘]󦾭Ž¢fUÊÄxåÇÕ³ óÖÃ>5;¾S¥7¨'„e-„ˆ¸tš~¦‘zóÊ.Nü´_ÐîæH3W±Ù×ݲ#ˆÍ‚ Œ‘WCûfX?íN•±’3Î’ôP ÂRûéØŸ»†àõ@…Ü´Ô¢”ªèuç¶ðôÙ]u9zV~7M¤Í·ë…ÑÂ#©ãm,î‘5}¹„”jØBôzÇJàdÐ`“o `rnK²ÌÆ(¯áÛ-Œvös’½µ9iŽŒYKÇ{"TšPâ<7ÇÍvòU•O)Fž‚EÚãi¸L ÜšÇ /ÏuoµJü÷æ¹[FHÓ_d›Ý½ePwè Ík¿Â|k•kmœ,Áöšƒ;yÞÌ5NíU/‘- #,,ÎÛ è$žÆ`wú:âæ³uxÎuY¯Ä¶z3t:‡ö= ÞƒïÀkÕ]ÖÍ1}w²ìzbQ•áÇ¢´IAƒÒrýN;´ž¤£V0¬¨¥4ZMcqÓç8î·uχQ†ÃDsŒXù1È–w ¢×:Q–ȸº²ëßä¿ùæßÛUæ<´P¦‡;Û*s÷yj—±ÌK|wpˆOð9ÃÒÐ¥°Ú’&ˆ¦ âöŠZB²ö¿Ñ½pŠ6†ØŒˆ°yÖÞÿœ~"ˆœ´ç¥Ñáhk8î9Úõ¥þTÚRäþa¸W¡xu!·råˆE?x¨‹SìÍvzF™)¬ŒæÝYT±±’w]L\çâ·9ïò–½[e_ýŒtÒ8Ÿ.3å³z¥p¸c )ÆäÞOÐtúƒ=ÍAȘˆXK_¡Cð?µöùvÃCMvíeš‡æ0=~©C£ëä'#'ŽÝ]æ¬CYoº T\´Øñ·ƒbû¦pªáï)£êèvb I’Ó+6[£è–ò¾(%³ÝÇ„OæÍr]+#¯ŠÄÒ÷0<ƒ£§F`^æ}ªb~Y×T3ü¾ïí9m P’ÆïYyOý©òæ8}ƒÛbPa(]£zã'÷ÎUšŠŸ4Š@ˆ#uÍt8šŠžÒö1»Û™É»{ÎïNó6ãnY«oFAžL_¦.¼Ù~E{R{F ïX=’GËÛç°¨kõŸTlj+æçÑÛ&Cà±äÂ阛±~}–Yæ(išŸEEg† KWP¨018e xK¬õªEÊÈÄ;\•Îv€± aÁPm}‹±-ïå¨í•³cC"¸î]ÏãÀ`®Õ–Ü%?Ž~Å·‰ªþ+“õ¨QEIÛ óáxÙáTﶙUâ;1– aRϧ’üǤÞ+ØÕÖÙÚÅî %Ås"ë$“›7G¡=FÀ;áWÿ÷Ž¶ZÃæ/f=´&)ãGªÖæœ-èñþQÐ'y #uP°­4¨Ë_‰ gŠ˜;¬×È?US yöØ"hJ F!7$03¢—‰ãèᲦFïwtÕ(±÷ñT/¶}8h›²å½³î–1½+<3ÞzY¥é«zñªÎª) dy‹[.¯^Ë’h·ˆšªfg’¯Õ$Lkñ5ØѦÅ{\~¿è¿ÜÔ©º"è.pÐH*;‡s>¤æ¬8XH{剹Åâ8{ÎB‹úèö!ÈýÏJni}ød9#'à¦|ÞS,ÿÜ!nös¦ó°”VÑ‹çpÓ|­ë=2·£ú™‚ )\¿Î=ŒO>š¤ÄùÖu…Sxk¼K v ŸR–“,ö?Ññôºò.šÝý30s„ë̽u¥Ž/\բ̗0µÉ $?;›Rw׫Ap¦ Îs˜ŸS?YºÕ…Ñô^šb fÔ;>)êŒLœ­Ó)Ñã›3ªsYY¥ï( Á§Ä1´'—PëžßáP­e]·ÐVïèe†ú5}èÂábŠ>ä¿Ñ“Á†^°,ËAúР{³¨‚Ý”í@ ôþZ¦˜é±ùÌš.±µf‹›.[{&b¼N-W^]w›àØGT¤mÖ<[Ü›œµÅS aÿ•onŽöiúøm8A;;à9ÏA¡,ì 9Í>íáÃyRõ­ã»©¯{Ô‡÷çOTi¾äˆe/èé0(ì¶#¼âC.ás¿š â õxÇ['²ýW&qN•8­~וGyŽt›ƒj»¿fênÂÝ UZš-T ‘§š%²SË[•i«CO¤B„ÚÜ n~æµÚ£Ã>1Q®ÿ¨Ø 1u‡íhTâ†)^ŸVv¦ãû˜óز1O¶Bk¸)œ™Sù$'?{äÔ'¡ûL*6üôqÞ³'ïl‡’ìæ.ŽíTÄløÔ¡­¹(eÊFÜIöð¶íWÄ9*ë"œãש¼ T¿ˆN©:û` è¡ô  ¦O±nuúJ4ASBQºò®½Ç϶‚É[P»âÜÜ 2³ˆTMÓ‰ ÐW*DKk–bk©çwSÌßÑ@œj¤“VoËmüÏé¢Õš¥·\Þw!VøâDB>eîɽ¾t?Ê“W üø±Ñ6öíÆûRÇ]l§êª°Yªuÿ «Ü |ŸŒˆ‰Q—àïž4²àËB,˾ô¹ EV-›Ù묾%hŽ«û“cUŒ1%ªLõømÁË…§ßÖ÷+q´ Þœ†ü:°¤²Vjù’MÑšÀÔXºiMþ£‹Ñ@ Ân͇ÂFèßY¨à)>#kFÃr”{ª×ë|G;ÍOdÍõªŽÜA^^¹‰Äb´’MFIÖüðþ¹/fë"…“­§­æúlŠ^ÙÛ}¥ÑcØAØÒ ”1s³öoª;ž¦Òv= b‘׸Ü>4£;Šñí‚âê ÌVnäm? 9¹×™biöÏó£a "ºKz-~²‡I½àŒâåcû¦ ï8ˆ¯óî+7,->º zÏÙ7¸¾›û”~þ\%Ugg€nMœï3jhèv¡ àfÚþØkÛÍ×ðCøø:-Ö˜žš Ù^æ“æbɇíûðÃ÷]’ƒ?Õt,½ˆî¸jß@4~Tûæ%x'HrÍ«B˜{e1à×âÕep‹è$— ©0€ö©“‘åºd®·KÇå~'‰Ý1gè‘Ú –¨•±`šòTÁ'j«rÞ9cï¿›ïðõq!°º-[÷ IToÒí ñC¿BÕpϼeo_ï¡Íƒ+yºÅþÎØ–Ô÷;>”GïÉmH& Eqk­X+ß9¾îïòvD‹ÚêœÓ¹C݆BÕgÜ Q2G¸‘¥ò¸ËÎtõ¯t?*&é·Æ™92`HÛSªAHŠO7gs”È©TŒˆëÔ?”4¹OLÕ±Q¬§{à2¡à¾¦Á?-nÛØÑÐrä:ÛqµåR•Û ô&;œRý[ŸkŒ¢Ž©0ëüú–ÍèÊa¯Bô…'¦£­?­óÌ÷#+݈“Ú<°x5eiJ)7—a„ΰÒlÀÈ´yÅA¡•åP‡E¾õàQ—²½´2~HÍ×)@–8 ²‹1[9¡÷$XÎ mƒHC‹™¢®Z®×ž~Òƒ(ª©y&–v¨‹}jw*DêX+æÈìb€¦A#A¸(“çhŽ>è}N¢Ä®…yCø±yˆâ”ÉÛ–YˆãQ)KãÎGÞÓRû ½ÅË”¶R¨‚Øï99Ö¯š,¹‘¹ä¯œ1ŠÑ $xÑΫÿð]d”ôÍ£X—À˜ìç,„lƒPcx1ó=qÞ—h¬¹6ûfmŠ´1Sáç3qQ³8˜F믫ߜMoÚ•Ä OeÊüÄÎp«ñcÛøHn×hó´‘^uÛ<æ¯;þµ¼Ä¿b1®/½0jØyd1“-÷^a§ÇÈÖ4¢Þ%É7Á[¹¼ñB1zµx”¯6üâ;›´Ú<îX #üX¹äRÛxóåÐAAàÀ@Š5äñÌàÌä$–+·Ïa¦ÉÁ00¸ø.ÕÌ@µœV€ B…•ÐÖÃ̧p±\ª·ÁŸá¡lsÈžgéEKTN‡TÙØŒ‘&Ûe±h„nÛ<ÝÜ¡ž†í²R#msÍ4<Ò¤YÓÉ©­]"¦¼*F-ÂÙ ´gî©öŽè'95eO;k,5û«OŸ€l2ýX=KÍøj›áËò7°œEÝ,Ò:Êlë$¨§s5ÖÆÙ.³xJÃÂä¸jE×N«Uhôó(M>ßö¾ãË-üÒ¿u¬ZÎœÔ$÷qbÐcѱ­ 2h²M)5'Êcå‹÷»ð^o(î¶ ˜cXÓ’o—ˆ5¨2ÏŸ»O¹ÚEVïÛ)ÅF>e"hà–{G8Îe¸œËäÎæЋ®áZ|X¨úVqf÷ÁØsùÚŒl£—Ò¸ø"™¡ÏŽâ•è‚xL¾¤_~‚‰8}„Ñ9fª¼ôÿêÈu49OtéC³Ä&z7·1æ÷I£¿fVîòAÕV=&ˆ²³8ˆ‰¦u»“SŠ(7"ø±hHA/™#ÙˆïyWvsì>îOßk\NŽÖ‹WʶÅ8n?ÑŸœŸFïS‹ùQÀC™æ o:Ìø@oIsR{“:K C:–FúHükW°§Š­MÇU®Ž¬â¢˜zyt$—ôøç!h TkÂëü#œˆ¦Ž;­H‹BïE¶&_fž[îcbãØ“3ÀU…/g÷ÓÙW.ruŒT@Ø ésm’£p@Û2ébö籑íËö‡C‡òìÅÏáÔbζŽZ‹Ó?´-7sq²Ò¯üoA©sT."¢ùÁËŽúá‚_=µªkc#&p?ÌB‘n(´à“Mç×p™ôÀ–¥xU®31Iñ#qúSÛ¼'¥†ý²öRšL 37²êT:õ¥ŽŠ)╲¼«} ¡íÖòóUš¹G¾MsÜq¾ÃZ-µ”tÝ‹t/ôû;øõÅlÿüòöRÙÁ¶?³ÔÀ<•ŸèK€f-y¢¤É3ÕâbA­Ç 8J[sþôaj›Õz[3ÉÆTöCÍe“rjû‚o³Û¨ 'Ÿ³Ø–súe¤qã_¡§NöFÖ9ê½K+Ä;ð¹(уÉô(Â6¼Î,œFŸI­Ó‡£ùôAhM¨_¦)’X#©%ä³Óe–!-u9žë±·F…UÐmaEP©¶é2–Ÿ± /¥3íî«UÄS(Òs}0£j^0ðØw]âeTÆÆÃLBé‰@a›MËqPFg¸úCé›—kÕî¬ÞÚìúVý…•×?•=À¡'¯–Àê¯Ûâ£<&¼,y}µ]v­”¡¨” ˆƒ{g0/H}¥éW‡/û‚‰rþI$ÛpÏ€­þ^´(pUàÓ1kÙnzAuÊ:©ˆ+ Sþrôx'ô¾]¢ý‚ÅU>Ý|~;nK,sôPEoJ-00éÞ/[Í.f¡¾TÆóÂ2ÍËÉÛdýÄS÷jP™ ßè]ÚÎ&‰d!Š˜ár 'ý~r¥‰{GgDE$(ÄÄ[”ÂÂPæFÊèÓ˜¨ˆ©åG ažQí´a,&TÍ‚}|‹™ÓïÑêk<§¯ÔF5; œ|9”y˜¸áÎ:æ_P¹wßÚÓ÷NBе`¨<À¬=c›üª|²›joó68Êæ&ʇ9z­%?í@CIÃöÌý‘¸@|†Æyú§´%73IKVÕr‰Ædçû—IŽn¡Ý&3#­R/ì؆5ʧœWhUôdû=’®Œº"üT[2âW÷ æ‚s§ÚòÅ&÷øgæ_@ËâuÉ‹·'Ã&’c„€3Ææ¤o™¨4Ê"ÎÓ‚_ÑüˆÏDÏŽ4è >sH:I=I!PH£áé;=|bI›ß‘RóÎZ†éöÚ}7q—Ô—ÑóQ¢â~• ¢ú2‹ümVH‹ ©[IÛ„†û­bg©[þI@-N7dX$pšaÕ©ñ4AŒ¦]º»qºh ![»”[xjÀÞ”0§ÙY3iœÙ!òõÓôƒ3âþ}¹ùXìµ?„²›«ÏG1ë·zü²ùÄ4ô\ôõðÛêë˳Ö¶»¶ †Ã]–Y„ë«M¶§OÂgê^xÈA·=ùJ.¥ÜáËA¥¦êÂ<Ÿ% œkÉy¥¿ó‡MßvÜ)ùÊO$zÙ!4WØ3ºcÓµ2¢×ÏiØC´&ÿ¦¸ëC¢ŠŠYêft‡Êéuï˜Ofñ ÅG¼¾{z>x±ì‘;ŒXv¡[IÕ[׊Ý4lŸh««kj…Ø÷ã7 þ÷_S~úwzõ¹PHWZ==¸FゆQXš¾Õ6馵; ïeöS n…}iðî/Êç'$y£:æÄáQupuÅD”7F‡7šHçjòâHhÂÐnµ`é1QE1ž‰ï& ú2uÌÎ;Zgåƒ%ˆ“ƒÇ‡kÜcðÒk·^„·Q¼ò™ ó‹{€7òæ¾æÇ4a®ü]ï÷ç|Yã?HÈO×!Mz±âe‡Ó„˜<Ä9H¾ År„+™²RÉ®‰ÞrM†:®P âÄ°‰aj^cäZíý0ŠÌl;„Y™0ƒ‰iÄYš[w©Zêµ<|UÉ1`>»UíÕ°è„k-û¡ {”Çts ùÐî°(å”MåD4°}›ýîs»Cªtì[ç²ì…Ó1–«3ÖÓmCè±ÂͽvÛ§hŸ¶—Ë‹çSôOå9&N™f'½Ü²_oÝ_aã} ̸µß1ú“6!­aµ„+¹ayAMãúYæ‹Ç™mº0ýl´l™œOæ}cÅu…†@ÄrÉŠt3$”ª5rŽ1¾Ë6n\\zÕí´Ù ¼Ãÿþkbl–1í2a)qGˆ3»„–wÄ ]-íi¼éz]“ ‘•B0OÄ05ˆ÷p¤Cýj>2 iw]í¸•èGlƒ­Œ/ÚQùŒÖݦŽÂ4ʬétn¦ü¯¦|R²UQÚâ{^ð=Û/à‡@h”Vꟊ#~ÆHäÓy³ J—rn ¬(†Uáf!ó\a­$fíå(IÛrþÑ—FhènŽØ·PùØȪÂ-k|»òpøÁQÃÞ=›<¡:¨*eûÎÞRÍ•þÀ«÷–Z‚Û)œúRÒ9k>ßChzßÂq¦¸öð;MDYœÇÆŸVfz•ÃMžã º®¼‰Ð‘Ùÿé¡Asû¤¶Þ+ôY 6¶–ßÅ!# ]Ñ£çÀ„7á“ÇS™†ýÇ÷ä…WÞ’náöî“1a¸\7{Ð/d[ô°©XÉ´uCÁn#«“+ëó˜ä u“AÝÃœ Ë©cWªÙÞþe/È?q‹¥Fœ?^•gPnÊH~í–¾ó¬pZG–ÒM®BêíyBï;ØoK´ lÛúÂd…¸£ä$%n7?˜$§â>È•5¿ã+=8Ø@ibKBG:’åÿÜÅÆÔÃ6Ò¤¬ÃS×A úQ$à¬Ó,—ºõêŸRñ ’3JРǤ»7áô”Ÿ …ƒí¨%e¿Ï "és•u¨«í<:aBåfË¥¥,¿¨$pp€»á+/Z sÑ¢÷².î„JõäI#&ÕÚ\+²jŽ¾–ææÁ¬Ÿy®4j¿ÔŤƒÖ5Ë*c™ÚA°” ù}Ï¢&ÝdŒ¯\ „Šh0~y×!ÎUFZV赧 òí×4sÀh¶î¬•û¹ ûåÞK^­X‡q÷[_l4HÀ–ò€È‡¥Óí¹³ÛéE#Ÿ¸e¼»RvÃÆé”–»$¡Þ”ª5E…äJj×¹óÅÀôÁ›@<*¦k\ç ÇЯ.;OµæÃCë7'7 ÏEx‘°Îþ"QL3thÂQß>ËÑgtPV?…„Hå2>­s©?Òµ½ôôÜ2•sȧZúùÅÈòëXb&÷Q,Ï[¶ÞQ¸ö¯EÕ|V@^ʶ•l ñ" x£céµ+3öOdÇ·ÈÓU?Öñ—ëƒN'α4‚ñ(Ý$_Šî]?MDRön$‘ooÆãþ ¹6Xˆ?Ã× !Óižûç¡¥ÄiXDíÎ# ðÂœmW"Ѳš#ò°°V3W!·j¾©b Ås$ÒÞ6{<½ËžÍKÆå(Øë¯l÷H®ÓâA0$ÂC ™‡Ïá…°JHðÏ‘/a9ÐH Ä,ìc…€ä<Ž*Ý™ïí £®|Ç’LJRÇ''³x¯AÒÚûÿüî–újÀ^ÿªû¥4eïô(øå¾ý_¡÷0]n‡Gî£ÓW®Ž-‘@<ª†jx øöµj—¥ˆÈó¥¾n·8vÔëœÎ††jWa&ë¢Lë¸vë_vŽPœ¥\v4O™Œ¥õßõÓ%®NÇ2†)¢ø´8¾ˆT fFŽ›hÅÿ¹ -•TßdW[Îï>¾¾¶êàd\™ˆpkL3 ·ŠJ£@ Ñi²yˆ txÐÇ襾§ X‰]AzF•K{Œ>ªPGšöá:Ñ¡_~~Î/eB7Qª§4j`óÛﲕÅÜ̾:ï=yÿù5 jW´+Ô‘êÏNØm€÷͵ƉÛã½E>Â?¬ŽÚkÝ Ü}Ëðí’X1¬±!ž Pñu-hŨ-w´uËÿ4m/¯ïåut%g#ÔÅ.H#5ST>¯†êy½º²•ÏDÔtAçŠ èi ò7µÉªl>¥3LÖi?".ëîýû,­nt®Äö¦‰¢0t_ŠÑéPI¥Î¬ªà—uIÛ ¬óaŽûx\ÉôïØP1ÁûT´•F“3ÍWDÝG`cœ} 5~äs­×šo ïŒÈ<¨3©›ÍØÐ*Nv ”àrVa:iÎê_äÀÏv’ÔFóòœJ™¬Ñ“KáI¥ÿáD¬nÐé%‹Sgü7°¢]¿,v½GÁ _‘&€:·Ùœ¤V¬ê”d÷ùe ’õœ)¨ùÞÑ #2)M‡Q«Ýl½¢®‘2më»Í6¸¡ÚD;Ñ«Ý!™Ê?~…ûÉÔãÞH ¨•ü\„>ë…iÃGAeŠï o“2YI•KŒãN-{Ä9͈H¥±âü´‰î6wqÝpÃ'8ù)rÖ…Ýý‚%PŠ'Aí¢­ý½}y KdÔ€Œð2)V‡p£ ¿q‘dRbYs×Cº%›fø¶dŊ䞱ᵬ2ÍNßpö«çìë»Èžü‘¾‹©ÙcéÏÎj«M€Ýxû¡Ø¶\Üöz9îõsE»º¡.Y>¹ø©Ö™ý·:n9:‰¼#­‹l°ÏÇ?Gבfƒì68ÛH³òŒ~o JJ£2oQÝe¾@ý:§NöhÍ.ö‹Zwç™›º£“s“û„­BcWáу%T²ÃÚ8´+ƒ£/¥ðv.£+JÄ»{CŽb½0+.Á¥rß[B‚«—Ò þ-[û˜®IzÄóÆ#ÔFµiJ˜mká|Å<ŸØQkî'Ž›tñ)Ø·±£kȾrbo]Óâ±? š–µœ¶~ÌÉb‘‚Sw2­údM9˜Á¹œY½ÀÓÅW®Ç:šjTƒˆ‚ÙÑÑ6໥:>K;»okŸxŸ m9ùê>½©•uho!S²póÒ¦$)Ó9ª)…¥/D­© EßÝ÷Vøé#¶¸Lë'xRÊQúH0—Rt„)ÕèYJÁ)\„Æ+ž³ÁZçݨŠé‘'î´hA>ÉÐþ4Í .@çänŽXôóÃ=–b„¶»Dh[£±,’¶Jqyíps ¦r@ ðC3íÒ«$,‡µašØ9½0å™b}r}<+—4Ê6°`$×L5U0p#q· ut’½† ÐMGÙívý/Qö‹‡ðì—PFþ‘8;(šQµUaŠ¤ÊÌ×”ËÊÂaɶ1÷ªuų\kNÌK™b¨–aQÞ\”+m„rÞÁm3~'^Ý#[·'À/(Ò~ðôÜï_gŠMo9qõ7ž™ƒÊyžSÖ­ð×±1»¥0£ÀûzÎtëuû‘¨ÁoK n#÷ø©k%ªŸMÏ\úuàö™â©°§/Ï̧5 LÏ‘‡´¢Ú¶¢ºž¼ÅõMîRhþT /[Ò}ᔃÁÔŽÝ×äâÐþÉC+SúçБ ÐÈIáê98*…a8h• ²“n¯&h çÝE †¼¿þ—Ödy4¬é&øÓÈYÐyFÖFfÒ$ÈÆ5-½¢šç‚Ãzn æítüã{B2[±µý®¢“Èü$˜½¢sÑ5þ“È(ÇØØ0ÚL&q’ñ¼*måÔZõ7ÏL_×]9;ÕW~?BßAf±MØÛ 5Ðì“Þè˜îcó;Ô­/W- ä ô7óò¼»Š{£ÔRÙ€”;ˆ´ÉÅÆ 5¿ÚÀ¥÷ˆ’f:øüÃfÜý¡2×*Üù,úÇÿt9­LÔ3Ñ*`;Ì=˜‡ tÖWPŠd°è_0öfñ&{,ŸWoÐVÙ¦RžœÇêÁ’’‡Þb=è¹ÁDX²Ø3°LK.ìëœ]û†öOæ&´èm4Í N¼¡¡‹ ,ç¢î[”âáŽn%á< ß%!ÄL\€Î {˜`ÔUCŸ|®ÄQ^ða;ÉÌ\7«j¦+o³‚ƶcŸ‡ÙͱD„ÇrZ4^”BeGŒ‡k›’"­ Ϭ¬=<ŒðPr6PGŠ‘¨»Áß½kRˆ·ú:kÑÌvW+Ã6ÙØtp#£g²Ô ·ñìÜøïÌ“ÿ¯þü´ëÙ½‰ ž÷H|•ÈwèÎá"V¿?1ˆ÷²–ì>@)pM×_Ž`tÐöIqŠºà£Â-ô]çpø˜ ù°ÖƒÐ_ú%(Q¬Ÿ0IΞçE·Ó°±|Ÿ¾ï­ÈÃUaf‘V²v6£«xDZFø† 6fü=¹o»ÌøÒ‚|Ÿûæ›a3¢¿-çRy–l³°UÊ}³ø¤´ðÏ¢ø«÷O¨ÕqÃ%ê›Òî:ÓE>ââˆB({”¢NÇ‹À^ù6S”PC/Ý‚¦ð3û c±†Vº#"%ùç¡+ÇW'Â-8Ò{Ú}œ{YбÐ;Áð²”ñÈd•q@ïNã.ô> e™Éð³ùôURô¼ŸIQAÞ+Ãø¾òo#—Ä`(ü(päy²ø°³¡¿ú”ªÄ3µFGÆxƤǬ2¾JCÌÛÏKžÉàïv¡ûûaÎFÏœø´M«WRXL/$ÑÇË®—þ0Õ)½aÑþ‚P('ñvZsC|(¯sµq' Ÿâ戙셟{$\¡oïžÏ(9‚þxÉEþ %Ý—m¹MðáxJ m0Sš¢´ˆ5r¥¤,Ðß®9oL ÉGEXqå&[à4o)'¨ ªÙgÿ#²s†#Àf;€ðÂB‘ÿÍá+Z“ –.zËâ)uÎ쀄3ÂH£ç$ÞÒ5U÷E§Ë«4.§÷z‚bäh'¼±"ÈÊr æ"YHµ…Õ=]’œd °¿g]<¶³ÝÛ§­Iuª²ƒ\´§%C/F¾?‡3šåÊÆ»­j.Âä§ÄŠ4OÅx,f¹‰‰ÿu³¯ÿZetvOã;!×0f\0m ëqÐ7U>ß {!×­ýwÙTÙÏΊô»^2”|z·$S\I |²,×k…‚™šH$x}ú5™›l¬#EÉýœíšóä9êÕ’xáCÇWZÒ£…¿ ´*¼vûRž­8hù M-5ŒÊPÖQ=sÁ}oñ6{æÚqøzª•t‰LoêÛg]6œVêPë õ¿J˜<°aaFÌíŒâ)¦Î)£·Ã”ÃQoäÁ< DÒ.¦ÊµŽ2©-­,üœ“ð€‹ µÞP.~ÐÕyáΖ',wq_HrßÖæ­±÷(is«y©ë0a«Ò\¬Ž½ŒçU£`ð¿ã=þ£’v;á×$EÍÎ~¸Re4I(Méw† GÙyoZøÕ+Ô:±² }í~fÚTZò8në‚ .PÌ|Î5H|tg)Þ01Q¸ó—9n¿^vn×íÌâ•[÷áí˜â¿Wè›nÀÚ”þÑÉ ÃK‚›,që/ls;+uaØý:>à;!¬ƒ@èïNºeø2ù"0ôYùKÈ‚£_T]>-í}½XM툸1×^‹‡;â¼R;¨ KÇ7˜˜äSS¶[ÚeÇ:AkÝmŠž%jG„Ùû÷§fœ5°iÊvZÓú@•ùùúµðË ×]…ž%_6€N£ ÆòúÛå,·Bq)›j6ÑaòÆŸ†Yê\íÿæ‰Ý^›=70éüPÚKr£*+]iÛ-3"¤.NFà ¹û6<;©Êùno§ô†cMÝ~Ál§ÀlNmqeÉ2®;¬l38œ,rb©½p]‡Á¤t°•tºjø¼˜Ýà…ë?-Òé~—¾Bó7CØŸÑøs…à9†ÎNŽxÂÜ[(æC†áuX8T˜¬¼x1©zvÝe 8†¯£ˆYòå ýéHƒ6Û&¿M¥(dG$Τ†úm˜ŠWz„G•,;pûp=è£áêþ뵓 ‚°%œl{Ë»ÙÐ,±0Køy3”93cœ³û(ñ‹Ûdî MàqNS/mãügLþÚØâZ•£³Âî÷û[ëY ʱ¬éЙ+"ÓòÁ6&ô ÓÓ(ÖäÀ†¶rJ¢· ÎàÌùž¤Ið3d”pέÆ ³tóÅaôðž8–‹:ž†‡-–I0E\ݦƒ»„ÂûpôÓƒÞWqš—{ös¡Ðïaü óöîÐø¸g˜ΘŒø"¬&‘Í/òiÕ$VØԜپ=Ë+á öû³ èÓ^Rbôw‚kô¥„ñÊö̱JcþÖªxü3±|ê‡lSsÆñ.Ñ€s1 þÜWû§tUQ:)¨ŽÙá¾±Þ-Æg6išÿÚJ3ïd„ƒDV£û÷•\é`háËô$‚p éöÔ5qèÆó^’â l㢟(e%l+¤¼o§aþ-qõ×TMÃѼ=Ÿ””¤Ž¯Å{©n÷ïìúå;áA„Ï ¨<<ÏÉàlPlð‚Žœ¾k÷ÏŠS„ü<³ÞxHÓç«öóeÀ¯BÚ€GL!+ ‚.éÇÞg±aFª3<9 ¤×Ôpd§ÌÞ{“Ò]Ÿ(®(øòµ§}ùpÒ|7*Û;O âw2h¯!¡ÏÖ¶<—î^ãê¹½ÌaÊÉÆ\ºü“ÈÙ¯„v]Uù _ ykÙQHû‡{pIiì¿ ÕÆ k»ñÁÒC`fªo¯0/µÄr苬òƒ.*é<ÌN´0ßî“Ðnél,JËÁ’d#½Áöä‡ÖSÑD"•B 4Qûb[øMÆÛ*'9óòŒù•¡Ë¼% f¿ŸI5S£m!Å;ôp7ªÄ‰y>¾ÃHÊÎ;ön÷K±XÞQ—L8aH·ßÿ'/$áK¿2¡œùþÖ9ߟ<¡Ñ+ÅQî÷®^)™Œ›6Y)§TÆEIDZ×ù§ÕßW°¡4ô1Ù,íš-Jóø+õ•,Q‰¯ŸÝèǹyj™›øþc‘=3Ò@ ¼W¦ÏìSYãBzø²Ñôš¼ñjÇ endstream endobj 735 0 obj << /Length1 1789 /Length2 9755 /Length3 0 /Length 10881 /Filter /FlateDecode >> stream xÚ´Tê6LI J Hwwƒ´Hà =tw( ÒÝ!‚t§4H·tʇžsÏñÞÿ_ëûÖ¬53Ï®÷yÞ½÷KC©¢Î$fjk –¶µ1±1³ò%^khðYY9˜YYÙ44ü·@£ vp„ØÚðÿ áÁm’ ØcÜk[ ¼ÈÆdãægãáge²³²òý'ÐÖ( r†˜_3åmmÀŽ [;7ˆ¹ìñ˜ÿüÒ™ÐÙøøx§ŬÁ ð5f¶~<Ѫۚ@À0·ÿ*A'hƒÙñ³°¸¸¸0ƒ¬™mÌ…é.˜P ìvp› *¬Á)cÐ5, ŽÙÕmÍ`. 0ðÑ…˜€m3œlLÁÀÇÃêrŠ@e;°Í_ÁŠ0ÿ¾ 3Û?åþÎþUbó;dbbkm²qƒØ˜Í P0PYZ‘æ c‚lL‚ Ž¶ù g 2~ øÍ”S‚þ-ÏÑÄbsdv„@IdùUæñ–¥lL%l­­Á60GÀ/~’°Éãµ»±üÕY+[¿ÄÆÔì—S';–76{'°œäß!&À¿6s0 ÈÅÊÊÊËÁÛÁ®&,¿Êk¸Ù;›xyØÙÚÍE€½ fàÇ€‡#È „98½<þtü7°±M!&0 1Øbø·ú£lö~l¾Ä¨Ëú8{l@Ö_Ÿþé?Ž—©­ Ôíßðßýe“’“QÓxõ—â|âⶮ@&n ;‹“ÈÍÇ ôúï"ÿÈÿôßVäoj¬ÿÖ“³1³òý¥àñêþ£Âùï¡ û{aèÿ}‚’íã$ƒtÿ¾+«ÉãÛÿóøÿNùÿ›ú_Uþoƒÿ¿„¤ Ðßnºßþÿd ºýð8ÈN°Ç¥xmû¸6ÿúü×"¿›Bœ¬ÿ×+=.‡˜9ôŸk„8JC\Á¦*˜‰ÅïqùO«C!6`[Gȯ—ÈÄÆÊú?¾Çm3±z|M[õÛ~\¦ÿ>QÊÆÄÖô×Ö±sqA 7ëãp±sq=Ø×Óìú{®,Ì6¶°Çà£:/ ™­àWCùx€, _¦ßˆû:š@AMÁÿØgˆÅø_Äd1ùq=úLl¡þ©ò¨ƒÅôÈdÿÙ,f@ ‹ùÈbñä²@þ€t­þ€gCÿ€Ä¬ÿ…l4þ`õ¸‰,¶ÀGvÿ@ÎGávÓhûo¶G*ÀG*Žÿ&<2q„‚ÿàÊöXö|Œpú>ruþ>ruùã⹺þ¹ºý†ÿÕm'‡Ç7ð÷:>ŽÂðï v›¾MÛšZV6_Uˆ‘º0m MÐl¼M¤gòøæÐâtƒ…G_žê¿ìp!×׉³ð]Šî\tŽâÞc¯¡%¤1VµéÖóÎ0Zml£ 0;Jðu$gO¬º› í9“†è¦ç½½§¦Ÿb|›ôo€ Ö¹éãÑYœ¯ˆm©³(ÞÔH™|”b(½3D”DŸ?ëG1e.iz“=Á7ru1—û"Q“—3AÝ‹”ß”CP¼CÕ{A1ÎÉ+¥)ˆ)œ¤$Jòy%}aã¢E—o€4–2—*ÇÊðÝD05œÚØ„1áTâ˜y÷)*FŸS¤kÁ„æk‹ýIEj„Äùƒ§ãßÜš°¸RKž2¶ÙRò¼ Ýjd@>Ê DªÔ˜ØÉ7iúQ4dÌá@m$ݾŽº”ÏR™vãpqvдxÕ©ïË/~~Š¸!§Gí 4U³ë;P—™HðmàéUojoåún|UG¥j{:’¡â°ÛºV¿9C å qiÓ§n7|˜ÎÒÌ®´o| G¶ÆMÂtÇwZKo,ÏJ ?0«–5R™,,ë'‘ÚcPù§«vMº'²\I¯½GÍÉ­ˆX}’ ²uâõ‡ jhßsp˜¿ÿÁ±¹ëbÍ~‰Ôi'þ>UnÐ÷ V¿w”}‰4ÖÊŽ˜“à¢ܱœ”ÐØü(s©ŽKð¸É!‡î4/é¾vå43Ž¥‚˜c„@CîqWSä¥Ñ°šÁ¤…„*'ª[ShäR/ÖÆçZb§¨cUsiÀ(q®3´J%󨾰"k°£ÐÞê’qƒº\õsqѳioÚpmùÌêæ ªÍv5ÝKcn(Öª“TËÒˆózCíoPðÄᜊÐøw¶ÈBJ“{ÜxöÖ³Pš£ÒÔ^nh´ „5"Œz˜ø9¤²›9 º×/}E!b2T¸·˜óN:\Dg—ÔO” ƒèÜãâß™¹S¾¸Ï r^Ôqj^†ÓÙ¤ÒüòFªïÓKéÕ=Óüs8Ñ&äïÀ‚Ïß Àõ[Ü«Dtµ]œÁ¶J•ø‡¼V­f 7¸e,¥ýÕ¡ex¦_·¶çá“e |ÖšîÑÓ9b‰yXdß;œ0ŽRŒÙ/A_ % ;Hb®CÃÐLh0*ëg“æÝÊå%„ ÝŸì~< Ä×…“’>ö ûknvsX'=”ñvø§ ½µË }õ:Õa3BÁažQð‚ç+¿ªQ‡h­Š÷8Ó¾“èD¥ä‘¦©£zaŒÀOW@€|YÉfÙK»¨ø@£›ÈàÏ(‰¾s¼“k9ÌÏÔde´3`F$˜¨Ø;zó„Š©–4÷f%©Ãˆ®=;ûêÈ)(sïöZ ž²þJ‡ T¬ñÍx=&'l ”Ø©¥ Y]ªŽj:+’‹3àï¦ìÙæÄl°6¦„»åtJ’êbl´?Æ×È%\•sµ„j*/„QÑuÌzpvªõ!ï¸Ìîâ’î0ìtqŸüIŸÓ6…ÍlÞ‰ÙËs«†O&’œE·¥P&ñ  Kø,Z_KnÛ\jÓ@7O0ñUoâ}+òÈü>~÷õ¿ÇMÞÓBìóO!"PÙšæ$ú“„-Þ(å2³œ,k-ÆðjòÄåL•d„äçlŸ¾-VÜø­«I"YO‰Ùs©ÖÐ¥²VIRØÊ–û4ŸÍ€[¦xyw0å;ìÚ:çûP¤ŸýÏ°3ìf¨³D]iï=ɺ 8e½9ñßËóˆû¯$ f¥Œv?•¨ìSÙ…OõëðrrßîôL»4ÿ‚ ïÀDŒËO’±í´šI|¶¢ûEr[O(¨u¾`äB2ÁEÖ'g¡?P¡¤ïöèÉ>¿Zw÷`÷l•–Hœ ÐjGåž»ðbJFÞdM:í‚\;Ý6 µM,1oÿvb5e€~/êÞ\ª÷ ÏDÍ4Á®qëôú£¡4NJ¶­'¾ÓºnÉÚÓ‹IU9&“gÔŽåñ+HjG·…8±CÌ;Î{' ú‚iÉr#>ê…ØšL‰Lá=®ÒX€¸ç0ê=ÿœü‘íÃ8^µÃ×é$3(¬ì›)~KЈ ƒl«2ÅþâRltE º¹I*Å/“äþBá—éê–·8q?Ðï=ù­<>Á[&´UÑ^µLÅöB¢ž=3à²ô-,mŠIzq/S«R·8`À©û:^ï Þo7þ¼44zË͘Û?§óCÏ÷Ñ\×'S‰è£@K¾Ïîæ½ÌI½',kœÒ„ëÉ9áY9¹óËXÅxnŸ!©{} #šÙòì¬wiÁ¥u}C­v¶®­÷3Fiˆ©K„§Í£ˆ*—ßï®e#›©žðüh_?I†”JtÏÏEñ£»E¾Öñ$â _ÁàxÛ§÷l)iT&ˆr@<)ËÎ _ð.ñ«šd†gÖsZ»ª[„ÅÀ¾!;¢cSìí¡Åp$ŽKÉçÞøÒÓ6À×=вšˆM¯dþ‰©// š?ÛHÇCû4; 8\~Kœ¦ïÝ`…? ½àTÝß•Œo!/ëïÕÕ‹TÐx›÷1b}6ó(*vƒyIÃ'F‡Âí˜ÅÓpëÖütê ýHC—£jU´E')9ò)W`t~¥¸¾AelZ…ÐÅî±,òi!̾ö–@…ûù(ã~ê2P<ÆçåÙ"¾VT]O|A¿§zÞ¶oõ×2¼„ìTd•y(踚µþ½p-ZÍ[²Ôê¹"/¶ ÷‹êgå_ÑKfkÔ’ðÖðßJ¼gë°OÊDîLj·Øá›ßêt†t¢ciÇ¿÷YHþ¼ô¬S]–‘òë½ ¯7EŒ|go¸ð²Í~â„4JÉzß°ÜôQ\Æʦ¯9ŒÚÍnRp•“Ym”œ+Ñ%Ïæ‡ÇòiL±üíOÌDm«¾ªœœ°QÔ'dhç_¼Lòyçà%< *»Íhšµ‹)ø˜ßGŸÔŠ¤œ%Ã7êF_ùúOa}Q÷»8’ãdôz‘á'5’t¡O£1(YÄ5•}%Œ5Ù WYÅæ.ßxS¦ÝxTø²´àÚ0ËŽ åH¨âN߀ߊØMdÜö„c¼ÊÙ Aïg@TT‚erpÙ–MÚÍ9ûà»QU¿h8B|ç1¯I.wë•Ùä–¯çåÕ%Ÿˆk ±ÃN½ÛvFeÌŽáeö‹¢c9?ú3æ–¾ÛÊ㺽¢ÉœkÐ_—J“ 7³é›÷u}÷UíyÍÉÍ'EŠ— @TæÔºï?ÀO.GZò?”‡„‚Æe¼6‚ˆ¶;±ª2Þ—ôÅú‚ÔqOŽËÙjsHïOf”Tð=³ÄzïdH¬rÑ™QT´K¿ŽM+ 4µˆ«¥>§/-´-ÙÑÜ­ør¬þsS°Ë?QÔ­JÎöÞÉ5T¡‹†L­ÏÞÆ\ Ú£Ìùܪ¸›ôptÝ{6ÌfÀ %¬Wt©©Hû¢nªžn–¤Ìõø[¬‡‚VKû„©©”‡¡˜ô„õÈ5–~Pê&Ñæ"`¢bãêÒ×5«†2£­lëDlæ ÊGš|˜rtYш -.ÌÓ¬¿§— ’-%†1>rgÕczwr]Î|I%™-˨éyr»Úщ²lºNôÜ™þs´æ"3®×Õ°Š\$Tµôí{J2´àû&Yø昧ŸòŒ1“tüÖ˜>süó2µ4Ég'+¿KÞ*¯H>©OÑ—ì,ëT|B!„IJ‘Ô›ÕŽuÞ¡pˆÓs^Z‘c4½Ò'`®jØ/X{öÄæÖ^¥¼©±®Ø.Ñ|V†TÖº«VïÞ¹sWj_d‹>cÄ™ïΙÃÁƒÊfudŠí÷Á¥@ÏSçS /b 掛^R²ÚgÒ¬åñýã(Ü è$¹ï|JÐéÂfgm 5RAùñЋw}¤ —u“þ ÕøÞ P˱ MñDZîoj|X´Ø0Ô3×í…êZÐò8#Éœil£ŠNvpt½¾»^[õî4Jm"°†T! ÈÐ öôÞNÎÄy_Y,Õ~y·~ÃØ—còm¼b/*N;îóY´-wh ý²‡ªøÇ-ÝK]r–?Á§1¡,J¾ˆŸßhá¾ÊÙ#†›6 ÙŽ¦ ‚£¢«w»и.¦Õ"ñ„ä Åĵ)¥°j`$©CŸA–0tã0Àí|b2tååI‚bµ ÝE"® °9Ljf.yàJ—÷`cb$?Íê`I–Úçy%‚EjT;ùŠ§SƒlòIb_(KÖ'ïlö˜,iðÆûð:¹”S.zõ2\­oÎJá5à€ÔØ ^4ññ²6k·Î°.C¶iNØ]÷ƒŒËIh«Kü€CÁ ±v½0W:øE¯~¢Ùý(2ú¼(DŸÆ8ÉîÞAØ ²?€Lʦ~¦$±¿Bm²9{Eƒ†=øôœš¢3Q#ó52{øˆ„òâf&ø“PÜU:ϪS¶_œaT –‡k*fÜõ>ÿ H+[H4Ý óËgOÕÛôÌ Å‘P“6ZâQY›úT´‘‚þë^O 0Ñ¢EÌv¯X)rW¯GÎP³zâÞN3`¿bÒ)Ù[f4]*r3Ë,°vžLч¡ý@"#5šÃõ³­™%ÖÿþV¶¯â`Eqы𥊒Q£º“¸5cÚÑTÜ„âÅäúiÐ ¶u5«5©&*ÎäZ<Ô/ =TCÙFœÍ=óšJk àûó ?ûæ ÉH3Ö~kG>²®ôdÃä¨MkY£ïbAb3¸ÖãÉÄ€é…ÒXPÌQV<ÜöûCK3›Á7³óIï¿H¤§4€²au,ﶺ6[àNœçf–çTìŸKQ+©~ ò7½Þv®¬¿È§ÂÖø'¡ üÙæYЂ•ç2îÇæɃw– N3ñðyÛÌŸ"›ðmi•iû*7ª*Š¨år<-«[ŠyU°U= ’zÝ‘€?•D?õª6}f´IÛH-*!¼Œ‹2DÁVQ½)AiŠ<æÂBÅb]òxî³ZtSk`Y‰úÉÎæ»À­&4¿“¼©uÞ[$ŠpÊ¢ÆþôÀbç%ÂçUºˆÍ@£>*qÐfL'×4Eç‹HbS—F”·4ÚаVoB~–á2ð¤t‡‡Ò‹ ñ¯~·+s~¢±z]PÆŠL' ƒ˜`[U‚VÁÙ Ú?)_—ì‰Ã=ƒY¢v•š–Ö27n]¦uîï•5”+Σ¯îYTT#Zeˆ¬$­{¢ÚiÞ§U甬É8CUDcø¡ìƒâp`§óBCnç·Bgß/M:=ç”OSƒ‡·ËÚ¢WŠáaO=|—£_ù¡¼VbÐ&ˆxeÑ¿B=d1P¤ÿN^NCjí¶ÌF"t¢°[‹‰™Tîí©…yŒÛ̉¼ a¯2%a¬]oIÆu=„E/W÷]~¼`j–^*Íà ÏA•†£+¢¹…!š}Ý”y½ík˜å¿ÈêÀONÚ0‹ÐÕAÂ5Õ¸>Ñ×ùž²©$,Û4“ëÝ÷á,ÈM Õˆ€½ÙÛªÈÔ²ï¬Ô¸æ¶Gå ·§™Î»ÖÌwCYâóí,&¢éüm¦T¾b7uDÎ#Wú*^(Ç ´(V®ýg™V¾Ü ÁãX®}4S˜ZìcŠïÍõ3c®HOƒ5­ËëJáó^[¸^®R¡=¢õøDºyâo~›5j0MØ{Ö•33àyPÙH·ojÕ»AҶϒ9¼Ð!ë;ùÑ~Dþ¥K‰øa6¬¬…4ß7ÁÏ'Ý\yÑH¹2#wÙdò¬!£L/Uá”%q÷¶§¬5©ÙüCŸÎ… «óºxtÝù[¡ŸuÕh}ŽàH»¦ Sék°±ç’o¶=iv;U—ÁÈà -?Ãs'Êq×ò0¦*ô™¢wçÜaih­ GF<Îï H7QÒêLMþ"­-‡_MÜûº|m!CÑ)S²ö—xã\s3‹y='õm7A0Ê/ºlfë—ò{±·dO­n7EŠFªÑŽrLÄ`a¶W“B'ßäŽÂþQš7°ûÅhHU’Pl¤h”ìå´M7ŠrÁ½ÌøwêUTÉ¡˜3 ]Õ¦-^GA%IîDsþr¥¸¯(Þ¨¡§X¯l*êºv½ÖžÉOÊÌx ŠßuîœS •Ê—F'@¨Ý^ñu"ù ü÷oÎ#7Š­“s8ROlÄ’¦hwmµf9g¯fIJýç‡vFÆ›9—W¾ÌÅÚ¤Ôë¯}Y¯»WkÉ\hAÖþéÞÔé*[ɧé1ªöœ/æ’„Tˆ£Ì½¥–Ž[gãÿpulúWF~ÓHðLæMDJn*’/’'¢ ¤™°aÒ8û8#j{¸‹¨}gtì'JÁ/PXÜòÕ(dz](ßß¼_{Èn_BÂ3>V²mÍž·BnβkZ§+¿—“R ¸Ï°XXcvÑŸ1—7–>Q nJ@G+¾@ 4pNOŒvvnõË“\Åͦ‰®¦¨¥“²z2q/•#;•ã Ô¢àQ|q/ºW(ªü–q µ_ÓÂ$ã;]"yc #›Ë|6²Ïâ¸öƒ.,CÓŸ±oðš©È0"/ÔZ«**»‘É/I2žÌ²"uÉïî0zeÛð´–œØ~».ÜÉïE†‡À·q^g,ÀQ¯¬iÝ_± |7[.›þ¤8Ö½wÑ\€ì| ®F³ëTÅ8)~î+œ«©cõ³5§ä3§…‘õ>¼ëŸÛfwù¤6þÌþ¸'ZŠƒÿæ­g ‰ßÑ@jÁ`æÀKÙžÛS¯þ  HøŠQ×ù í5ü' u™¬¹ñºK»>Ä;Êà;HÚÚÀMmC®·tÁPÓU;ý1ðFL¾Ð"êꦵÈ~ÿù3ŠR@Ò»®#¡9Uæ÷=MçLÒ¥*g;Eˆèk/ Uý ‚-ð¥Dá¯$´¥¹^'^tÎéHï=å\Å·ÂíÍ UtÔ¨ùþn!B=½t#Åó9i»Q ú«4¯"™äÃñŽÚÑáלª,Q‡6z['%ó­å„Ã$/:'ÃV.d“Ž6õk¿¸¦/Cjt­séŸY ›×ý,or›–5zôÆg¬‚CêIà£Z⑈Ìæ\ÖöÖ RçÂcÅF¨‹Ó¬Æý_݃.¶€NzQ¨ÊbÝÞE=3¶Å; ®Ó¤-Ò‹c=S£®-Ys:Ó‡âÝLgÏ ‚~°ã¥Yä<Í0zÂÉ?˜²HpÒr±,O¾…ÈîY”‹ñgùôõ# f7r]ˆc÷<} °ô 6MCÌb+ðfþÌÁñðÌ-ÐXÈ«©{#ðE“~(o‰1VöâNMÎsˆÜº¶6¿>ª\ ŒÅ:Î5xky#l8]mÎrÝO뜯>—†Ó¿`Rßi{5ÿ‰šû­’ysc8|é×çNR»™P4zʧŽ/G‹ùî¡"nöÉx®xHþù±ÝÅDîõšµð…Oý¸åußç{àóú†°©Há4´Å£JycŠoŒÌ¦ú{,·RíÔn-–°|ðÞ¦‰d7…{ÃZ™¥VÐùm Ò—ºÎY‚¶¦iÍ0TãþruêWE Tfø»[+Òë7øöG=AhHŸ§åÍ"Frsï7dc£Ò9†ÂMç7ôô „É£¬Ø‹nÃTžc_FBÑzï7à¸j b9sƒùšQÚð]&Ÿ´÷ópy (XP…ó‡ŒoèäE-‡h”#»þ¼e%. ­˜±ø1Éóvø­1YÞ€(më›äïòÌX»± í ,CŸ;,¡)ÃÌø¸`Rób¸Ý§Ö3Û|#Iˆ©©éyš sb´L ‡+7¢9\f$þ‘k*ÂûÊýÅj¦Ïdl†ÙBy'‹† ï²f¿e ¨Ò!(Ž¿Ë,6\ͯÂueš7T'0Ê“î“ÅK8Mƒ'©Y QoLœ¥£ÍeLâDגȱ¯?•k‹Gö ¼+Ý;D¶²iCh&POZ<Ö±uújK oeT—+Ü?¯:tøË»žeà-Qsk¥»ï=Ò„&z¥·#©—ž¶l=›`…,OZþ殿¶èš€¯¼;šµZ âå´Žºÿ¼‚ø»÷'Àwóš‘<Æ[„û±?ú§XAb.OF|­vCùP¬›cFbqúÙÎ'Ò=Vd—üü=س†Û~˜Ó/¨piÏ‚ÐEE¯É81»ø’Лù#yUJ… ïüÅ3)nì ©y`hò æRpÐňHµ›d¹éCÖ6³‘þ„>ÚÊ»””¬b±Ð£djkßdOÑrºŒ!ôm‹k éGhJn·/9¿‡Þ/Üp Ù°Ûþ„—z1!±¹'ÓÁK'¬zE1·­c0¡Y/bWOÊÇ á=pƒiV ÀD k/9¶9{â݉“-tVØ—3ºuè΢…½S½. 8CÊ1ÁÊ¢Ãfü¶BÛ/K®9PŽÉð üÝ 1µJì7f…™Þõ¤æ“sÜÉ?ÁªÅê¼Ì}ÝWEæXâ&É…£T)Á~zÉ¡¨ØŸH|sž%×[qùUç¥á&s/ED°ºWˆ)Ö˜d½ÙY¶•ïÛ˜V‹[5üLR-•™IßôG™Ëèeá´kfêj`Ul4ʺ¹ô6(æÞ˜ù" ucˆëg?†5Æç¶^ÑU¹ûÙTùy¢_…yd?´qJ]¢8| üÙ`¬Í°ŸoBûmK¿Š&±¸Þ@Ñ`wéS²ø¸+öªu¶ÁµBGDnxÖ`aÙ”%ˆ*¿Ù# AkžÒëÛº{™;× T0êÏóuQ¡?F*/W“8ú‰GMÉ ×kþ6ëyÖ6þç³$;Ï´SÇ`a¥ym¸D²Äæk¢ Ó­|ÿvw8Òµ§—¬2)ÕíK0’–ìŠ[€ÂKŸ#EO¹>yžoã¿S´öá}+\,t©ãB&žˆ¦Ó»›wÂfL FÊëIܾ~¹š»¬¾†sÀìvz¤ö"0îÅ} äìE¿Þ‡îµ³‘5×—Ym~¡ñ»y6@Twv°®aÏÌb™K,?è³VmòqùtCÌë¡Ðè;›¬Þ¹Lâ}„ÅœV^©xW0?!='¶~ýÄäå éíº_Ê)‰MÒÍKü#äR–ˆúÊ(—ª²v8·†zG¬Bu¡oÅ™Æê \ôàÍÚÝÌpØ„ÎïŽò-kyZã÷ZGË®/TÃKଛe—8záÜùóœ³FœÊb{ìÔE³’g¶öòŸë¤¨?èX«ÓçZDØÒuaò?ÓÇBy{Wdz-ï¯*óëêÉäó=žïRj-[Îv‘l}†Ð¾qðž¶ÂDó6Hq‹‡|· Vžß¾AnþÈò EÑM`à°ÍYíÚ´Ãÿàlz‰_Wj~BÒ”³ÛŽ¬Kd{_Ûë»Ø«ÚJ×æ¬wäqU'ãþàm2z]ÒÈé䂸óöE|»•!t«ÂR¦‘@ð/€VÖ¹B_r¥Ð8R]¡Á©é“XñÇT‰ÎfË&u‘ܽ½)|ÓxB.ø< ÈqÙ«±7QÊ€†™>)7)iîÑ+—Lœ0Ô¹€‘9«U §Ÿ§ØšÕ"¢òm“çYÃuaã74SÏÆ%ráJݪä)£$m£T£oy#=5zû0¼»ˆä¾‡£žÀÃâŸeXécíçC)1âé?—Š)-’‹Zú pŸ2§t#÷ϼíG oížÿšáìÓ׃ŸÒêøz4sÒ–ü¥ÖæçžÒ8×»PDj}]Šå½KQ^þ¶\ÿÎ|ØSEÞ7dátõ×°·æ-O ³#ÛgäÅRËÐ &:ø¿r©·„i#Ó²[AÛ¸Íd‡³ƒrmºæ.?£QCõàt닃z:•ìJêÏÕ=ªM‹ž'~~ÀÑB¾È¯žÙLWC×%I½©%Îúäqöôãå7ËرÜJô2óÁËÃ÷ítáÌâ® =Xú…z¾©•Ñ6ÛÃX©4Ã!«½C¦^‹:_¡ ²fŸ}ĺOK’ÔÓ&¢Â–'X››21<>‹09½Q±±žb˜ã!J®ýV¿ÈÕȳ™2¾¨ÉQdZ„"¹—¥š~Ѓ͓¨Æî¼èu8£¨UþÓUCzY›ˆÆyw.\Är7éíÙÕ¦ÏDK”i< «Sh.¡Áúûî:ÇùiìçHÌÎ=Œ‹-ߪyèO<-¦Pˆ{l&„ã­cÞí”ôNJ,»sAš¸EBÈÓ²UÜV¦Q·ù^ÑÔôÓÏ]'‰/„XÝüÛ³›û>ú=Ä{‹æ¹¢@›ÁyKȆÒzÆÌgœ/eŠéXË…pkŽÚkµïèܱ93ùxÇw0É0³:ƒ”e®­@Ø¡;žÒJ~‡ }áóënÃ\áÈ ×“MÍ©Dõ‚“Yôº%…!{½+3´{v ¢ïˆÜ¨\ÛÑH‰¢é»Á7Ǭ=ip¦So`ƒl”6}¶Ï.+æŸÏ+½6G¿?÷¼Zó"̱”ú˜Hè€ù0ó¢1~Œß(3=Î߯ì^s]˜ÃÃTuùñùDY My¦«Çc/$U5ú[¯ÅVÆ™uÅrÜ–[ž²°¦Ã3Às{ØPpyŸ“F—,ë’PX’?Ù¶,jŽ‚ù í&ÖÁ¢ÿX/R endstream endobj 664 0 obj << /Type /ObjStm /N 100 /First 919 /Length 4515 /Filter /FlateDecode >> stream xÚí[[s7²~ׯ˜ÇÝ:eÎàT¥¶J¾;‘mERb'>~ ¥‰ÄcŠÔ’Tbï¯ß¯»A’’(ië<œS%b0˜FßÑÝ Œ·US+“*tèâ+¥pªR.U?•p ¶Ò1V޻ʢｯ\r¸†*(·çC¨¢ñ¸Ur WÌkBS)Ý`$£Ñ])k : åY0•ò #À¡¡`bCx'ZÀD‹°+íÀ°šè*Ý4à-zt,˜³ ˜* êZ wÚTZ+ð©ãžœ6,'UiKÓ!Ÿ¶˜á“®´S˜žìèÄ÷¤ÈlŒ¦Ž‡ê¦ýñ)ÒgÀÙ†¦©,Qß)O]¹`¨c¨“ÐlÆ0)KYt|ŒUèD˜ ª©¢öa/(]EOx#l”¯’ј®Hñ°hÀM :ºJ ú ªkœ…¥´'«J Mª* :WÚú½` tå È£=Å mµª,ô¡4Épú2ÔK0•ÕèŒB2²#A‡¼È’½ŒkÂ(ošžrâÂDÒ+ð)ÛXò:t¬Ð3p  ‡qv¥!mB# ~h¡hzm³gi²MP¥äX zŽÐ:E=SN£çàv¤r«)g©ΑH(硲Às÷.6j/=Èg˜FRÔÓÔƒ3C&øqƒyF<šžÒBð*ÑB^;8õÆ™Ê8šaÁÝ¡—ÔÞ?ìÕÏ«OÞ7XGUýñ·ß+ZœMÓƒÓŒ®‡ÃÏ{ÿøÇ60¬®ñrÌÜkàr·ÁY¯{´ÈoƒÓ¾é%èeîåx4«~ø¡ª_©¢À¿tž *ý@Þ”‡#[œn0»>œŒOÛYõ©ªŸ¿¬ê“öÛ¬Z >ù~ÕâAÿ¼Ý«ŸH;šM!º£é{õQ;_ONÛ)GzÛž úOÇߪOÄ6"WOCIѪ^LŸA­? vßÆÀø‰ã±DñN®Â/Å;¹ùšòx“¯*_5_;œ3þ½úøúˌ{õÓñ䬋Íg’ã @Ôê)O¡XõEXØ%Za¸6pû¬ããª~5>W°Îßž__^ Fç'UÞ›0bAŽ’àwX߈?=Eá~˜ŒßHöp2ÍL×zÛ3šbvìY¸…Ó®ç/œI=ãÃFÊGmÿìÁ„iY@fƒ¡ÐL í{ZùÿI­x "›K=äQÙ5CÓC¬ØHx8Ÿö®gݤžµXâÖô…¯¨…¶³=·8VÛ,êÙ­‘;zAá±g)à˜ØCZÞHýÙp´Š ÝX\¹pÁò²›Å_^",ý72Ù‹oˆqÓÁxT²@a8ØÕ,áüéQ•‚r"²×œ‹†£ZÃé>a¸36·ŠÙaõ6&×sE4eòv[ÜŒ]•f/ù»úØ£„tH ©á.È<ûñ.>R¼ƒÙÅ^ ¤fݺñ¡ÖM÷rÁOH_Õ#ý>›Ñœ”U[ îÛ¦©ÊQƒÊÎçVÆ5lªdaTÍ|vÃ5 ¨›{‰÷Ui‰©¡Œ¡_t¾çr«#Rce1œ2€ßÖ¤0Jl¾ç# [¤<’üaíÆê<,È¥!ZöKHƒ~Èm&R>A¿‚í!mÉ›´B ¹bI+#"z€p ¡I©ü "DŽ KÂp†”ŒZGñlÄ_ž‘H'‚Gæ fiE'˜—± ·Øé¡fYòŒ¼TÃzEIAÍíƽ|…½ƒ*} ÌÕl-!å¹mÈO‘àç¦Z<¤ÏíçG]1ÿW¬EZ[¹¥²rC ÊV"‰| I±ûQ[ÎBÐKÚØPÌYo•¼ÌåÅÜ"ÐÛ+òÓÛ™ÆÚ Ÿqçi!Úé¶xQ~ƒT‚œÑKÆÒ䢅lÉ»£Œs\Åò%=è*a&9ôBKO@PÒO¬P 0Ud§Ø"{zÄ$E†–Ö!ÍÏ )[úôì®?]â`VT×”.¸•‘ÀI"°)‚æqQ8{v€¤ X@ƒÅK¡À)‚‘ì¡‚&ß‘ ù±x© ®Äå%z±S4F™bF4j=ÇþǽŽ@–Ù¤–¡rŸqY„‡ÏARÛ[‹­Re’f×Û¹öK§gWúÿþ«äEY#)‡ XT’E‰ÔùQh]Z¶tiºOæE•÷ö˸±Œö¹ªZôVŠÙÿp¡[Æ°M….ýƒUœ_Ê\’BrA®9$Fºf9 9±œª$E¯›s.s3v³¬I3þÅ~J/È»y Z Úí*X/p­&/p oèr+Ù\àÎ â…O¬]üàr¤Ö×Ò¥ùå 퉨Úq[[ÊÉN°ÞoñLÚ±És¸P¥è_<>ÇM9×E•) ´ô—PRûØ¢À°èÝÌá]ÚŒ±àŒ%à DZÞƒ²¬ô'ÎåôüòÆP^ ×µðB‚æZ@%–0Fzaäƒãš‚þ —(e$.‹]îGC2GˆôB%zËp‰uˆ|"]i}\ÚŠè”Ú(%rÖsÝ-vâ«ÔË…}itÅê‰Z«ð¼¬<§z9þ÷SÌVZ> I?·äoËW¾ôFùy;= ®f㉼a~׿ē_ßÿüúèÇÿzöö©j0>ìŸO++OùÅïhâ‰æå©-LúïËô”ßû&@>ë_½nç3ú´d¯&*ô쉢‡ofýáàtt>l+ ?žµ—¿Òίþ˜'a½ÇEB¯‚ÿVï×ÏêçõËúMý®~_ÖÇõIݯ¿Ô§õYÝÖÔçõE=¨‡õe=ªÇõU}Eo ‡í3éMg}ÕNã³úŸ×ãY+#“zZÏêëúÏú¯úÛßE¼—0O*_]ߦ­ƒ—GÏH[•Þ¬.gH]¨”I¤®tƒºž²Â^@e¯ê×PÛAý6«îˆ•÷Ký ìŸ^ÏZVãéx8±2!TúÇB¹ãëIÖï׬áÑ`ÔBÍc´·¨ʦÿúuGëÓöÏvTOß ÿÙŤmëÙ_c¶Ä·ú{ý¯U[¤]lñâ÷WG‡ÏØ'o¶9¯NÙy5}äãì}­ñDÙ¥=ÂV{œB¯Ù×V$SjÉž¾?y~|É^|Ü*—…\ÉÓ‡=Ž^¡ë¥`¶)åj ©°Úâc¶ɨR¤/“þiÛ~“+™ÿËlÙ¿œ-ofWÜÿÚÎlp~¾r?+ï2Â|·œÉŽSN•ÙÊír2ßÎ ßü2[ö¶èÏaæè–7s¨ŒjÕlf³½;~÷òùS˜ííVw4‹Xjã-ÁÁÜуÞj: ¤ ëß±î//ûXÚÿƒÅ}5_¶³‹vÖïDùÏâ]e~u¸ÿîä£È¼% 5—YûG’Ù»­2‹d«íâßýü†âÛ7a³@syTP$OT[åÙ¯W…Ù)F~|öìõÉs´Í#m3·N“"Í"”øtƒ,ÝlõcýS‘±~^ä¬_‘µ>Ö¿-2W  +ë‘ÕÄÇÏê³A;i§ƒi}6ôt:Xd»vtÖŸ^Ôí?¯ûúýv:ì_R¤¿Á2ç¹ð|ÒÇýE}ñýêYLVÏŽ©ñjx=]Ëg_† >¿‘|·/“èå@D\¦Óé$é&Õ¿$­Öÿj'ã¿Ñ;e w?“ßlY:ÌÖâ6a»Û°1HÑ QW%Û)H¿~úñà`Ÿ$K[ÂÕ¼bhŒÉìVÉžÁís};wÞ–üpÅåŠjW\jYÍ~_ÕÄN¡ûàõ‡·?Q•q|pr²µÎ ð`è /}éí e(µ¢ º](Ck݉uéáa[ñ¤wŠßû'±~»©(äÚ‰¾) Á-¥‚½ïÁ©èÚ"VJKyúõ²?»¨¿ô'Ë‚Iz²Ì¿\#" ” &§Ãöt|õ}‚h5lé“6„¡¶µ( åÞø|pÚöGgõå`t=]UÚNyâ·—?þrðJÛ^I·Xñö±Òx¼!U¼ÊÉà÷Åú˜o\r´òfe±N¾n^'ó0YÇ=™ââ‡ã§¯~}GzÚºb¬,g´`î›N×·E*ÍŽ˜³)¨(g»OÞ9ᎇC YdÙNz-v—Ù•×s*¹õ2±Ž®/¿´“éà|tkŽ%®åZɪ÷M£×£3?OÚ›2ªÙ)ïì¿xóêè„=gKâñÙq¬¦Ó1vœÒ¹Âé`0 ÏÚµµµúà¶Õ´ª‘-ù§øä—ÁËÓþ´å¯»ïŸVôLJzø;Ä—ƒÉtFTÚ;èç¥1çÃàlvAŸ1æÏfOÆ¿Œ`泶R»³Ó}ÁÓáG5]~ªàG/ø¡“Içgý%G—#Ýå(­hH…BC¦Ë‘Þ£îˉ.?¶ËÙhÁ/Ùñ»Sïî±»Ôýš}â¡cf;“ïnw»ä×ÜÕ•äéfAýªïlM;ÄõšoÒ6yAœ²òBóqwâ­d—øšR˜* ÑÝ#,ŒÕJ—›5'´å¢pºPEØöê¢KÛß"TAÜ>FÈZ«ã»ÅB„îrdvç¨[‚wø1kŽZFÕøÂUîA½[Ëv©¯{ªÙ›G˜Ýš±ËÏš¯šU~\Á} ë¬V"]vÖÜ×úv|á,îìÐiƒ)7¸¦Zfqf€ŽŽòäŸgÓê“gdVy#wùƒ‘e‚+;òçûà·o±Oóù*¬Îã:ß‹{܆ÜVÖ ÿ6‡´ùx£ ™¶ð¹|‚ÄÊ ÄµÌ¿è†¿;㫾? 'uW¢rÝ8'´]>Íêä˜çýhÈYÓÊ…ÌwÌ÷ùàˆKù©dé»Òˆ% ßäã¨*/Íç¶|Ö‘×ùø©¼Aº ùÌ:óÖäk¦á²K‹În¢a·ÒÈÇÖæçºæ§ˆò!››pš’ñT"•J–O„óÕf"ËÇÚœ¾‰†ÚJÃ7sEÏÏûÞº€)5Ëäì0set&½¿ž ±Qœæ@E‡ì…2E*>oÎwébî›Y<Í®¸nŽ¨slŽø‡“öÏJÇÕ—(y¶YÎnVfïŠÙ&„ ³‡¦ù£Š›fg2ïè›ß€Ë.q©›pùTâÚÌW³ÀåÃf\y¶Ù0Ûûål³2{®Ã9'ªH/KƲÕtiµ'¶KD/ˆ¸t³¢:ï60ì–fp3Ìg .·I\·T¼S7Ͷ+Šw Åÿ}Ì« endstream endobj 769 0 obj << /Producer (pdfTeX-1.40.14) /Creator (TeX) /CreationDate (D:20150727134700+02'00') /ModDate (D:20150727134700+02'00') /Trapped /False /PTEX.Fullbanner (This is pdfTeX, Version 3.1415926-2.5-1.40.14 (TeX Live 2013/Debian) kpathsea version 6.1.1) >> endobj 741 0 obj << /Type /ObjStm /N 83 /First 730 /Length 2548 /Filter /FlateDecode >> stream xÚZÛŽÜ6}Ÿ¯ÐÛz ‹w ²ðzb¯±vbø‚<ì†Ò#…íiͪ» O¾~O‰¤(Rl%Æ’X·S§Š,uÏÙTu%¤ªŒÆ…UŒËJSqÑà**Q³J𦒠r®*Ùp\Y¥ô˜©´€9•©õ•¨›ÊXÈkUYe'ÛFÈŠ7¦j«¨þUÜ6¸17 ­Å B UWܘŠIÆqeií×PVn4”µ„Ž†² ® l€ˆ+([ ?ȇ5ÊH‰×5tg@Ì)+fiq®š+Ž¼ð è‰ô CzÒ’"~”†"rãdp$Ç #¯ŠPB^O™pÄCBX3¦¯È ÑP–xTÈ€ˆ‚2S‚(n!IÉUB#Ó UFyWÂX([i¯@I%Vƒ(7$#²Æ2šÊ‡‚W’rµ•‰Ys܈J*dj`.5§Õp{e$Ì-H2Ò Ì’”m¥È³«Šuƒ )¼F¡$@ü( " J ¬!Yi6­¨ ~e…VøÏ ^ÚRPt‡©A›QÐã‘2\HÜ@l8­À{¢ R²5Z€ËPwƒN°\°+£ueEMV7–”me‘éÕ?\=ûØŸö]EmUWﯞ=ÍÆݾkÇîpš:Ü=Ý·©ÿ§§Ÿ»ï)'ûñÇ¥/4û©/oéóY_4[±…YÆ–^÷e?OÓþœߴ˧Ã~ž²,¤°1¤*‡ôAJ€Q‚Ùš%Ö´k€y³ô¥Y8dã+“VyÈXn6BÒ9²)Jõá±><­Ïlíá—’ç±Z¬Ù²f ® ¾X,S›¾’¢q±Xƶ|ÕIQ<ÊÌWd»6›¾Tâ«ÄvÙ®7Ù®“åQf¾fîys{o]`›76Z«ÍJÙN÷Y€éÚ–§ûÌä!e ya§LAüÌz.·iŒ¬€i,[½ôÅEÁW$^ò²/g]F‰v‹‘l •¼:Ï0]§x˜x‘…‘xqx¸D¼ˆÄ‹z«Sx²›BzÀ"ÙM!› €y¬×å.ˆHêós{ß«?yÊ®+·;ª'Où5}[çhÝúÛúº’Ê+1¤J°pgÆo€Ûß÷§à“D¿åÁ˜€ºô¦~Ü!„A !p‡3 ={]¹“fœ’h­º œ²ö>9Ò1>5¨îÌÅ=”lÐS. $Z…âHÆâ#7p\¬GÏ‘Šõ9rd¢æX =¨<ù$Ù* iY 7‰pT¬OWP*>EA©}øtÔ.#¬!“ÆWH “Æg(Iã3È$ÔG4Ô?>"™u$x|Rˆ$‘ãžÉèÁÇ•Ô“Ü–‚|d)¯§/±Ýëuo_’­jjïàÖ'_i‰^ÚÒßRW†hÐwã'‰ HV¡àO oØн'èùn×ÿ©eýò|ØúáŠåÂ÷ݾõÂPÑçûý°ÃâáîºÌ'ñ|ÛÇÉâ§ï§îpœL¸ZQ8EÝî´ÇZ´D“o0,Ðæײ™Ÿ»%ü#â5Aw¸}$Ù«îÐýîš¾¢w’ûö1G©e —_µN€3+­¿n±N¾?œ÷¼æÅp1+mN8"I|3Ü·ý!ç=@†!ÚS·âYÏ*c÷uröúx<ŒpŽÞtmR¹UmV¤&«ŒoºoÝ~x Ü(ŒgñfØiÉÃÛÍùþÁEµøé{{ÿ°ŸŠ8|¡ÿyèvÃÝ¿éÛqªÕ§S¿ïÿþ¸ Ö§ß}™*¢Ø­M¼&H×'k"¿lºb`֤擞€—]ÛÐNÉWoß-Bü è»¶,œm¯Æ¾–Ôôþ$ýg< dÄÝ9¾½ >+® ¾>O(b`Oø@Ëå©Yð<žÃF¡7_Nãp{ç÷°^cwwÞ·cÎ~èÕקnœ}»®†¹¥YÏ›Õ $;Æa¿_‘è ~7ì¿v·£óó¾{€—x00ᇠ^Iw½7 ûk{äwð'€?)ˆœÕëÞF>—ܬ8y7ö,†š½ïÚ[¿bÃÊ—o¶»‰Šð*Ž6q˜ÕÈt8önߊÐQï»ÿû±£sdÚ`« 1¤º+°ÞîWÓÖ‡"l–/Æ»4%…å¨ñÉ£«!<&#”…áú±;z®Â Éǯýá¿Þ›Û‡sé©ÎMžê¥ 6­xø„9œœmÊüõk{úÛä›>züúÚWë×~ßà%N…—¸á¸ÿLCä3Ž}ŽFZ¼sYOë!KZG‰¦µzµ s4 õr/êÆ/í®s1êcôõø¼Ç™>I™.H'Áò{`Z” _@tšúÈe¨—’©Ä.ú*›ÂÌfNé_ý-ôût=ýÚß]¥¿*ÕþjŠŸÖäÚ¡õîD2î‹„éïÜÕT¢øÒýç#ÜÇQ¨ïã{ȸo@¦? p×fsüþ¥Æõ!ý ‘Ñì/õÐeÒµç@{Òý˜ÑªHòg7ØÎÇÊøï§ûLJ®zöCn?ÜÑGú;4® ¿Œøå|Ú÷Z™?ãOm⯶Ã-\|:vA›|ÿkƒîæ endstream endobj 770 0 obj << /Type /XRef /Index [0 771] /Size 771 /W [1 3 1] /Root 768 0 R /Info 769 0 R /ID [ ] /Length 1850 /Filter /FlateDecode >> stream xÚ%—YlUU†÷º÷(C …RÊL)ÐB¡¥”BKËT(H±§TT(SDc4š¨ÑÄ›˜hŒ/j‚Ƈmâø`ˆC4.õÉ8¼ˆÁhÄDM„côè‹cŒûÅ=ßß—/gÿûÜÓsöú×ÐBøÏB¨J¯¨ ¥j Ëé¯ËRÜ †-¬:¨å(»eP²Pû¤´ÃàZ ˜¦ƒ Ì³Àl0Ôz0Ì `>XÁBÐf°,KÁ2°¬+Á*ÐVƒV°¬ë@hëÁкÀfÐ ¶€°l ut`ùü}`¨¬:Ì‹ÀRЂQpSd`!X Ö‚`+؆AŠ_”²˜ÀB° ¬k@;ØÈ[õ‚m`;èý`ƒ`'Øvƒ=`/ûÀ~0 €ƒ@áî´Ð|¯Îà:>„?¾ ‚ýàz ·?Ï-ŠågPX ”ëýƒëÑ éÅe3¾¼Úˆ¦cGКÑqp‘+PGÁhëÑÁ›ÀÍh¼i®ÐÇÑ24Å|œ@»­“åIp 횢œ!2%׉O‚³hMh2Ò9på8Ì‹Üj¿Ì©¹,°Ž üç%PFÛ„†1½jÐ:Ñp¬“`>­ +;©æµhÛÐð¸“t> m;æwÒÏç ‘Ø9Yá$¢×£íA#]œ”ôyhÐÈ#'9g§ƒh$˜“¦Þˆ6†Fæ9Aö&´#h¤¤“ºÞŒ6ŽF®:IìKÐtØ$±“ξ M‡­¥n^v´wý!ù¾Œ¦Gé%W£ÍF£P¸>P©!Ãé5t8{6Òâ:Xe‚§OPP6 -B£9Qu2>[Ž¦ÏÇNx²4Ê—ã&W.¬EÓÑáDß‚&cRðûV4Å\ÇN8a̺Ñ(‘N{È2ÒÙw õ QTÄv¥ßN4…›÷]h § ;Éî„;“dÒÞ‡Ðä ·S\™¼M6£8¶È†Ñ(õNQpr+“_dQj„«(È/4'Ù]EA‰({“ìNf£ht'ÙûdJN¥Éî7 Ék4*'ÙýF4yHiE²;Ë Åó,IvÇ>ˆä¥“ì~mí,K’ÝO±Tk#§d÷3, œa©³,)Q·è¡*sx2ªdÉþÃHàJ¿­€“,K@÷a¸¨šSÓÙ]%«3I\­56}¡çÍdhµÞÂà¯ÒæzJµÁÂÎ{ô ª¢‹A“…‘nÝ·,±0þ—nÙeáÌemeUúQuh«A«…[ß(>æöŠî[ÖX¸³YK<qI$úq/ÚÐfዺeè°ðÈCZÒéª]` (:ɦn@âÄ1 O,­Ð«½`Øú,<óAñVÏ~¯ûöÐoá…Ÿ¤íC.NEaìtØên ¯ß¯=€†[Ýká­w¥é‹0kÔù,¼WÖîa ¾5F,\º¢ õ£#>_¬å8P?R³9Zl¼¨cW/“&,|3õùò¥zÊ·ˤ4–ª: ¢:iáÚÚ=‡ÌÆÞb™Ô+ðPR‡À% %æ’„‡’J=VI*ð @e}`jIÅtóÛczžzŠšˆºí82Ó$Ž$©z«\«>ã—Ôlá__Ò}x-µ‚6°ÚlÆ~íR•#‡“Öƒ€#R»YÝ5Ý‚‡ŽH¸$áƒÔ6›5Ý¡[ˆo"ª ×¥~³–FmàƒD¤¶H×!³ /iw?`ID0²tȬ§W»„61ª%â–ˆQšGÍTðô RHç¨4Tl dEÜŽUàÚ—<4›f€™ Ô˜MÑn-˜ ”²z³ÛÖÆ<ÀP”5šÝõ»Þï(Ë%`)X›Ý—éê’+Í|GK5ÃV³Gû´TÏk3{¬KKµ¶³ *(™ºU—ÙSŸèQÛ£*°Z£FÖ€ÚI¯ÙóŸêfKT›P/Sóâ߇ìØgöZ§þ†ª¼ÊÿˆÙÛÍú­>PŸ¥š=nöá1ݬ?NÍÎNƒI Ò\ÃÕI³ÏžÓ}”ðìœUÞoÑó8ìÈaG62XG‡È¤9ûX8Ý8ÍìÇ1ýŒDÂk#¡ˆ fÜ¢]&ŠÈ,‹Püñ‹4¦‡H(âJ°ÜìïÛµAP"CLdpˆ%¶¥†Š*‘‰m€á$28DÂ;€þõ`pˆÅCÿÔC»¬ÔvUW›­tg«®º­ôø¿ºÚb¥7WèªÇJ_ÿ «­VúsJëµòœtµÍÊwO=e»•/ìÖUŸ•?úYWýVþn@W;¬¦´« ^ÒÕ Užj×3H¤GubµÞ «\ÙÃn®©äø%Ç 9¦É™_rÍ/X4¡h$Ñ ‚¥rþßʩϹf š24VজÉ#Ç\9%<×l¡aBÓƒFÓq«|Ѭrõåð?Üš`P endstream endobj startxref 318117 %%EOF cloog-0.18.4/osl/THANKS0000644000175000017500000000042412413256474011350 00000000000000THANKS ====== The authors would like to gratefully thank the people that have been involved in the (lively) discussions for the definition of the OpenScop formats and data structures, in particular: Uday Bondhugula Albert Cohen Tobias Grosser Sebastian Pop Sven Verdoolaege cloog-0.18.4/osl/COPYING0000644000175000017500000000306512413270135011462 00000000000000BSD 3-Clause License Copyright (c) 2011-2013, University Paris-Sud and Inria Copyright (c) 2013-2014, University of Strasbourg and Inria All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. cloog-0.18.4/osl/configure0000755000175000017500000157332412554427653012370 00000000000000#! /bin/sh # Guess values for system-dependent variables and create Makefiles. # Generated by GNU Autoconf 2.69 for osl 0.9.0. # # Report bugs to . # # # Copyright (C) 1992-1996, 1998-2012 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 # Use a proper internal environment variable to ensure we don't fall # into an infinite loop, continuously re-executing ourselves. if test x"${_as_can_reexec}" != xno && test "x$CONFIG_SHELL" != x; then _as_can_reexec=no; export _as_can_reexec; # 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 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+"$@"} # Admittedly, this is quite paranoid, since all the known shells bail # out after a failed `exec'. $as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2 as_fn_exit 255 fi # We don't want this to propagate to other subprocesses. { _as_can_reexec=; unset _as_can_reexec;} 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 test -x / || 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 : export CONFIG_SHELL # 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 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+"$@"} # Admittedly, this is quite paranoid, since all the known shells bail # out after a failed `exec'. $as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2 exit 255 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: cedric.bastoul@u-psud.fr,pouchet@cse.ohio-state.edu $0: about your system, including any error possibly output $0: before this message. Then install a modern shell, or $0: manually run the script under such a shell if you do $0: 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_executable_p FILE # ----------------------- # Test if FILE is an executable regular file. as_fn_executable_p () { test -f "$1" && test -x "$1" } # as_fn_executable_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; } # If we had to re-execute with $CONFIG_SHELL, we're ensured to have # already done that, so ensure we don't try to do so again and fall # in an infinite loop. This has already happened in practice. _as_can_reexec=no; export _as_can_reexec # 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 -pR'. ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || as_ln_s='cp -pR' elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -pR' fi else as_ln_s='cp -pR' 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 as_test_x='test -x' as_executable_p=as_fn_executable_p # 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='osl' PACKAGE_TARNAME='osl' PACKAGE_VERSION='0.9.0' PACKAGE_STRING='osl 0.9.0' PACKAGE_BUGREPORT='cedric.bastoul@u-psud.fr,pouchet@cse.ohio-state.edu' PACKAGE_URL='' ac_unique_file="include/osl/macros.h" # 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 VERSION_REVISION VERSION_MINOR VERSION_MAJOR abs_top_srcdir ac_aux_dir CFLAGS_WARN PRTDIAG GENERATE_DOC_FALSE GENERATE_DOC_TRUE TEXI2PDF DOXYGEN 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 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_gmp with_gmp_prefix with_gmp_exec_prefix with_gmp_builddir ' ac_precious_vars='build_alias host_alias target_alias CC CFLAGS LDFLAGS LIBS CPPFLAGS CPP' # 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 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 osl 0.9.0 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/osl] --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 osl 0.9.0:";; 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") --enable-dependency-tracking do not reject slow dependency extractors --disable-dependency-tracking speeds up one-time build --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-gmp=no|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 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 osl configure 0.9.0 generated by GNU Autoconf 2.69 Copyright (C) 2012 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 || 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 "## ppppppppppppppppppppppppppppppppppppppp ## ## Report this to cedric.bastoul@u-psud.fr ## ## ppppppppppppppppppppppppppppppppppppppp ##" ) | 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 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 osl $as_me 0.9.0, which was generated by GNU Autoconf 2.69. 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. am__api_version='1.14' # 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 as_fn_executable_p "$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; } # 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 ( am_has_slept=no for am_try in 1 2; do echo "timestamp, slept: $am_has_slept" > conftest.file 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 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 if test "$2" = conftest.file || test $am_try -eq 2; then break fi # Just in case. sleep 1 am_has_slept=yes done 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; } # If we didn't sleep, we still need to ensure time stamps of config.status and # generated files are strictly newer. am_sleep_pid= if grep 'slept: no' conftest.file >/dev/null 2>&1; then ( sleep 1 ) & am_sleep_pid=$! fi rm -f conftest.file 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 --is-lightweight"; then am_missing_run="$MISSING " 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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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; } 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 as_fn_executable_p "$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 # 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=1;; 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='\' 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='osl' VERSION='0.9.0' 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"} # For better backward compatibility. To be removed once Automake 1.9.x # dies out for good. For more background, see: # # mkdir_p='$(MKDIR_P)' # 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}' # We'll loop over all known methods to create a tar archive until one works. _am_tools='gnutar pax cpio none' am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -' # POSIX will say in a future version that running "rm -f" with no argument # is OK; and we want to be able to make that assumption in our Makefile # recipes. So use an aggressive probe to check that the usage we want is # actually supported "in the wild" to an acceptable degree. # See automake bug#10828. # To make any issue more visible, cause the running configure to be aborted # by default if the 'rm' program in use doesn't match our expectations; the # user can still override this though. if rm -f && rm -fr && rm -rf; then : OK; else cat >&2 <<'END' Oops! Your 'rm' program seems unable to run without file operands specified on the command line, even when the '-f' option is present. This is contrary to the behaviour of most rm programs out there, and not conforming with the upcoming POSIX standard: Please tell bug-automake@gnu.org about your system, including the value of your $PATH and any error possibly output before this message. This can help us improve future automake versions. END if test x"$ACCEPT_INFERIOR_RM_PROGRAM" = x"yes"; then echo 'Configuration will proceed anyway, since you have set the' >&2 echo 'ACCEPT_INFERIOR_RM_PROGRAM variable to "yes"' >&2 echo >&2 else cat >&2 <<'END' Aborting the configuration process, to ensure you take notice of the issue. You can download and install GNU coreutils to get an 'rm' implementation that behaves properly: . If you want to complete the configuration process using your problematic 'rm' anyway, export the environment variable ACCEPT_INFERIOR_RM_PROGRAM to "yes", and re-run configure. END as_fn_error $? "Your 'rm' program is bad, sorry." "$LINENO" 5 fi fi # 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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 struct stat; /* 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 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 whether $CC understands -c and -o together" >&5 $as_echo_n "checking whether $CC understands -c and -o together... " >&6; } if ${am_cv_prog_cc_c_o+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF # Make sure it works both with $CC and with simple cc. # Following AC_PROG_CC_C_O, we do the test twice because some # compilers refuse to overwrite an existing .o file with -o, # though they will create one. am_cv_prog_cc_c_o=yes for am_i in 1 2; do if { echo "$as_me:$LINENO: $CC -c conftest.$ac_ext -o conftest2.$ac_objext" >&5 ($CC -c conftest.$ac_ext -o conftest2.$ac_objext) >&5 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } \ && test -f conftest2.$ac_objext; then : OK else am_cv_prog_cc_c_o=no break fi done rm -f core conftest* unset am_i fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_prog_cc_c_o" >&5 $as_echo "$am_cv_prog_cc_c_o" >&6; } if test "$am_cv_prog_cc_c_o" != yes; then # Losing compiler, so override with the script. # FIXME: It is wrong to rewrite CC. # But if we don't then we get into trouble of one sort or another. # A longer-term fix would be to have automake use am__CC in this case, # and then we could set am__CC="\$(top_srcdir)/compile \$(CC)" CC="$am_aux_dir/compile $CC" 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 10 /bin/sh. echo '/* dummy */' > 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 as_fn_executable_p "$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' macro_revision='1.3337' 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" as_fn_executable_p "$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" as_fn_executable_p "$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" as_fn_executable_p "$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" as_fn_executable_p "$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 "$withval" = no || with_gnu_ld=yes else with_gnu_ld=no fi ac_prog=ld if test "$GCC" = yes; 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 "$with_gnu_ld" = yes; 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 ;; *) case `"$tmp_nm" -p /dev/null 2>&1 | sed '1q'` in */dev/null*) lt_cv_path_NM="$tmp_nm -p" break ;; *) 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 "$lt_cv_path_NM" != "no"; 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 as_fn_executable_p "$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 as_fn_executable_p "$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 /dev/null 2>&1 | sed '1q'` in *COFF*) DUMPBIN="$DUMPBIN -symbols" ;; *) 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; ;; netbsd* | freebsd* | openbsd* | darwin* | dragonfly*) # 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 $i != 17 # 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"} { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the shell understands some XSI constructs" >&5 $as_echo_n "checking whether the shell understands some XSI constructs... " >&6; } # Try some XSI features xsi_shell=no ( _lt_dummy="a/b/c" test "${_lt_dummy##*/},${_lt_dummy%/*},${_lt_dummy#??}"${_lt_dummy%"$_lt_dummy"}, \ = c,a/b,b/c, \ && eval 'test $(( 1 + 1 )) -eq 2 \ && test "${#_lt_dummy}" -eq 5' ) >/dev/null 2>&1 \ && xsi_shell=yes { $as_echo "$as_me:${as_lineno-$LINENO}: result: $xsi_shell" >&5 $as_echo "$xsi_shell" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the shell understands \"+=\"" >&5 $as_echo_n "checking whether the shell understands \"+=\"... " >&6; } lt_shell_append=no ( foo=bar; set foo baz; eval "$1+=\$2" && test "$foo" = barbaz ) \ >/dev/null 2>&1 \ && lt_shell_append=yes { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_shell_append" >&5 $as_echo "$lt_shell_append" >&6; } 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 "$GCC" != yes; then reload_cmds=false fi ;; darwin*) if test "$GCC" = yes; 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 as_fn_executable_p "$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 as_fn_executable_p "$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 # which 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. # func_win32_libid assumes BSD nm, so disallow it if using MS dumpbin. if ( test "$lt_cv_nm_interface" = "BSD nm" && 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* | netbsdelf*-gnu) 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*) if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; 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 as_fn_executable_p "$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 as_fn_executable_p "$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 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 as_fn_executable_p "$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 as_fn_executable_p "$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 "$ac_status" -eq 0; 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 "$ac_status" -ne 0; 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 "x$lt_cv_ar_at_file" = xno; 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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 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 "$host_cpu" = ia64; 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 # 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 -e 's/^T .* \(.*\)$/extern int \1();/p' -e 's/^$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 -e 's/^: \([^ ]*\)[ ]*$/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([^ ]*\) \([^ ]*\)$/ {\"\2\", (void *) \&\2},/p'" lt_cv_sys_global_symbol_to_c_name_address_lib_prefix="sed -n -e 's/^: \([^ ]*\)[ ]*$/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([^ ]*\) \(lib[^ ]*\)$/ {\"\2\", (void *) \&\2},/p' -e 's/^$symcode* \([^ ]*\) \([^ ]*\)$/ {\"lib\2\", (void *) \&\2},/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 # and D for any global 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};"\ " \$ 0!~/External *\|/{next};"\ " / 0+ UNDEF /{next}; / UNDEF \([^|]\)*()/{next};"\ " {if(hide[section]) next};"\ " {f=0}; \$ 0~/\(\).*\|/{f=1}; {printf f ? \"T \" : \"D \"};"\ " {split(\$ 0, a, /\||\r/); split(a[2], s)};"\ " s[1]~/^[@?]/{print s[1], s[1]; next};"\ " s[1]~prfx {split(s[1],t,\"@\"); print 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 con'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* \(.*\) \(.*\)$/ {\"\2\", (void *) \&\2},/" < "$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 "$pipe_works" = yes; 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 "$GCC" = yes; 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 "x$enable_libtool_lock" != xno && 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 which ABI we are using. 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 which ABI we are using. 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 "$lt_cv_prog_gnu_ld" = yes; 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* ;; x86_64-*kfreebsd*-gnu|x86_64-*linux*|powerpc*-*linux*| \ s390*-*linux*|s390*-*tpf*|sparc*-*linux*) # Find out which ABI we are using. 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-*) LD="${LD-ld} -m elf32lppclinux" ;; powerpc64-*) 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-*) LD="${LD-ld} -m elf64lppc" ;; powerpc-*) 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 x"$lt_cv_cc_needs_belf" != x"yes"; then # this is probably gcc 2.8.0, egcs 1.0 or newer; no need for -belf CFLAGS="$SAVE_CFLAGS" fi ;; *-*solaris*) # Find out which ABI we are using. 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*) 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 as_fn_executable_p "$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 as_fn_executable_p "$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 "x$lt_cv_path_mainfest_tool" != xyes; 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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 $_lt_result -eq 0; 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 $_lt_result -eq 0 && $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 "$lt_cv_apple_cc_single_mod" = "yes"; then _lt_dar_single_mod='$single_module' fi if test "$lt_cv_ld_exported_symbols_list" = "yes"; 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 "$lt_cv_ld_force_load" = "no"; 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 test -z "$pic_mode" && pic_mode=default # 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 "X${COLLECT_NAMES+set}" != Xset; 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 "$GCC" = yes; 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" # 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 x"$lt_cv_prog_compiler_rtti_exceptions" = xyes; 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 "$GCC" = yes; then lt_prog_compiler_wl='-Wl,' lt_prog_compiler_static='-static' case $host_os in aix*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static='-Bstatic' fi ;; 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 "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static='-Bstatic' else lt_prog_compiler_static='-bnso -bI:/lib/syscalls.exp' fi ;; 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' ;; 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 which 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" # 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 x"$lt_cv_prog_compiler_pic_works" = xyes; 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 x"$lt_cv_prog_compiler_static_works" = xyes; 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 "$lt_cv_prog_compiler_c_o" = no && test "$need_locks" != no; 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 "$hard_links" = no; 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 "$GCC" != yes; then with_gnu_ld=no fi ;; interix*) # we just hope/assume this is gcc and not c89 (= MSVC++) with_gnu_ld=yes ;; openbsd*) with_gnu_ld=no ;; linux* | k*bsd*-gnu | gnu*) link_all_deplibs=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 "$with_gnu_ld" = yes; 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 "$lt_use_gnu_ld_interface" = yes; 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 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 "$host_cpu" != ia64; 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 (1st line # is EXPORTS), use it as is; otherwise, prepend... archive_expsym_cmds='if test "x`$SED 1q $export_symbols`" = xEXPORTS; 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 "$host_os" = linux-dietlibc; 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 "$tmp_diet" = no 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' ;; 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 "x$supports_anon_versioning" = xyes; 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 "x$supports_anon_versioning" = xyes; 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* | netbsdelf*-gnu) 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 can not *** 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 "$ld_shlibs" = no; 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 "$GCC" = yes && 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 "$host_cpu" = ia64; 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 $ld_flag = "-brtl" || test $ld_flag = "-Wl,-brtl"); 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 "$GCC" = yes; 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 "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi link_all_deplibs=no else # not using gcc if test "$host_cpu" = ia64; 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 "$aix_use_runtimelinking" = yes; 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 "$aix_use_runtimelinking" = yes; 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 "${lt_cv_aix_libpath+set}" = 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 "x${allow_undefined_flag}" != "x"; then func_echo_all "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; 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 "${lt_cv_aix_libpath+set}" = 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 "$with_gnu_ld" = yes; 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~linknames=' archive_expsym_cmds='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then sed -n -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' -e '1\\\!p' < $export_symbols > $output_objdir/$soname.exp; else sed -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' < $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 "$lt_cv_ld_force_load" = "yes"; 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*) _lt_dar_can_shared=yes ;; *) _lt_dar_can_shared=$GCC ;; esac if test "$_lt_dar_can_shared" = "yes"; 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 "$GCC" = yes; 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 $output_objdir/$soname = $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 $output_objdir/$soname = $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 "$GCC" = yes && test "$with_gnu_ld" = no; 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 "$with_gnu_ld" = no; 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 "$GCC" = yes && test "$with_gnu_ld" = no; 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 x"$lt_cv_prog_compiler__b" = xyes; 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 "$with_gnu_ld" = no; 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 "$GCC" = yes; 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 "$lt_cv_irix_exported_symbol" = yes; 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* | netbsdelf*-gnu) 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*) 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__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; 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 case $host_os in openbsd[01].* | openbsd2.[0-7] | openbsd2.[0-7].*) archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec='-R$libdir' ;; *) archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' hardcode_libdir_flag_spec='${wl}-rpath,$libdir' ;; esac 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 "$GCC" = yes; 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 "$GCC" = yes; 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 "$GCC" = yes; 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 "$GCC" = yes; 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 "x$host_vendor" = xsequent; 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 "$GCC" = yes; 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 can NOT 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 "$GCC" = yes; 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 x$host_vendor = xsni; 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 "$ld_shlibs" = no && 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 "$enable_shared" = yes && test "$GCC" = yes; 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 "$GCC" = yes; 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` 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" else 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 "$host_cpu" = ia64; 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 can not hardcode correct # soname into executable. Probably we can add versioning support to # collect2, so additional links can be useful in future. if test "$aix_use_runtimelinking" = yes; 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%'\''`; test $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=yes 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 "X$HPUX_IA64_MODE" = X32; 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 "$lt_cv_prog_gnu_ld" = yes; 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 ;; # 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' ;; netbsdelf*-gnu) version_type=linux 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='NetBSD ld.elf_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*) version_type=sunos sys_lib_dlsearch_path_spec="/usr/lib" need_lib_prefix=no # Some older versions of OpenBSD (3.3 at least) *do* need versioned libs. case $host_os in openbsd3.3 | openbsd3.3.*) need_version=yes ;; *) need_version=no ;; esac 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 if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then case $host_os in openbsd2.[89] | openbsd2.[89].*) shlibpath_overrides_runpath=no ;; *) shlibpath_overrides_runpath=yes ;; esac else shlibpath_overrides_runpath=yes fi ;; 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 "$with_gnu_ld" = yes; 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 "$with_gnu_ld" = yes; 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 "$dynamic_linker" = no && can_build_shared=no variables_saved_for_relink="PATH $shlibpath_var $runpath_var" if test "$GCC" = yes; then variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH" fi if test "${lt_cv_sys_lib_search_path_spec+set}" = set; then sys_lib_search_path_spec="$lt_cv_sys_lib_search_path_spec" fi if test "${lt_cv_sys_lib_dlsearch_path_spec+set}" = 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 "X$hardcode_automatic" = "Xyes" ; then # We can hardcode non-existent directories. if test "$hardcode_direct" != no && # 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 "$_LT_TAGVAR(hardcode_shlibpath_var, )" != no && test "$hardcode_minus_L" != no; 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 "$hardcode_action" = relink || test "$inherit_rpath" = yes; then # Fast installation is not supported enable_fast_install=no elif test "$shlibpath_overrides_runpath" = yes || test "$enable_shared" = no; then # Fast installation is not necessary enable_fast_install=needless fi if test "x$enable_dlopen" != xyes; 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 ;; *) 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 "x$lt_cv_dlopen" != xno; then enable_dlopen=yes else enable_dlopen=no fi case $lt_cv_dlopen in dlopen) save_CPPFLAGS="$CPPFLAGS" test "x$ac_cv_header_dlfcn_h" = xyes && 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 "$cross_compiling" = yes; 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 "x$lt_cv_dlopen_self" = xyes; 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 "$cross_compiling" = yes; 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 which 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 "$can_build_shared" = "no" && 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 "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[4-9]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && 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 "$enable_shared" = yes || 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: for ac_prog in doxygen 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_DOXYGEN+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$DOXYGEN"; then ac_cv_prog_DOXYGEN="$DOXYGEN" # 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 as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_DOXYGEN="$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 DOXYGEN=$ac_cv_prog_DOXYGEN if test -n "$DOXYGEN"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $DOXYGEN" >&5 $as_echo "$DOXYGEN" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$DOXYGEN" && break done test -n "$DOXYGEN" || DOXYGEN="doxygen" for ac_prog in texi2pdf 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_TEXI2PDF+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$TEXI2PDF"; then ac_cv_prog_TEXI2PDF="$TEXI2PDF" # 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 as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_TEXI2PDF="$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 TEXI2PDF=$ac_cv_prog_TEXI2PDF if test -n "$TEXI2PDF"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $TEXI2PDF" >&5 $as_echo "$TEXI2PDF" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$TEXI2PDF" && break done test -n "$TEXI2PDF" || TEXI2PDF="texi2pdf" if test -n "$TEXI2PDF" -a -n "$DOXYGEN"; then GENERATE_DOC_TRUE= GENERATE_DOC_FALSE='#' else GENERATE_DOC_TRUE='#' GENERATE_DOC_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 as_fn_executable_p "$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 () { #ifndef __cplusplus /* Ultrix mips cc rejects this sort of thing. */ typedef int charset[2]; const charset cs = { 0, 0 }; /* 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 sort of thing. */ char tx; char *t = &tx; 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 sort of thing, saying "k.c", line 2.27: 1506-025 (S) Operand must be a modifiable lvalue. */ struct s { int j; const int *ap[3]; } bx; struct s *b = &bx; 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_header in errno.h stddef.h stdlib.h string.h strings.h unistd.h do : as_ac_Header=`$as_echo "ac_cv_header_$ac_header" | $as_tr_sh` ac_fn_c_check_header_mongrel "$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_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 gmp_flag="OSL_GMP_IS_HERE" # Check whether --with-gmp was given. if test "${with_gmp+set}" = set; then : withval=$with_gmp; fi case "system" in no|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 no|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 build) CPPFLAGS="-D$gmp_flag -I$gmp_srcdir -I$with_gmp_builddir $CPPFLAGS" LIBS="$with_gmp_builddir/libgmp.la $LIBS" LDFLAGS="-L$with_gmp_builddir $LDFLAGS" ;; system) CPPFLAGS="-D$gmp_flag $CPPFLAGS" LIBS="-lgmp $LIBS" if test "x$with_gmp_prefix" != "x"; then CPPFLAGS="-I$with_gmp_prefix/include $CPPFLAGS" LDFLAGS="-L$with_gmp_prefix/lib $LDFLAGS" 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 : cat >>confdefs.h <<_ACEOF #define HAVE_LIBGMP 1 _ACEOF LIBS="-lgmp $LIBS" else as_fn_error $? "\"Can't find gmp library.\"" "$LINENO" 5 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 ;; esac ac_config_files="$ac_config_files Makefile doc/Makefile doc/Doxyfile include/osl/scop.h tests/Makefile" 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 { $as_echo "$as_me:${as_lineno-$LINENO}: checking that generated files are newer than configure" >&5 $as_echo_n "checking that generated files are newer than configure... " >&6; } if test -n "$am_sleep_pid"; then # Hide warnings about reused PIDs. wait $am_sleep_pid 2>/dev/null fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: done" >&5 $as_echo "done" >&6; } 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 "${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 : "${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 -pR'. ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || as_ln_s='cp -pR' elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -pR' fi else as_ln_s='cp -pR' 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 # as_fn_executable_p FILE # ----------------------- # Test if FILE is an executable regular file. as_fn_executable_p () { test -f "$1" && test -x "$1" } # as_fn_executable_p as_test_x='test -x' as_executable_p=as_fn_executable_p # 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 osl $as_me 0.9.0, which was generated by GNU Autoconf 2.69. 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="\\ osl config.status 0.9.0 configured by $0, generated by GNU Autoconf 2.69, with options \\"\$ac_cs_config\\" Copyright (C) 2012 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_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"`' 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_c_name_address \ lt_cv_sys_global_symbol_to_c_name_address_lib_prefix \ 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\\"\\\`\\\\\\"" ;; *) 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\\"\\\`\\\\\\"" ;; *) eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\"" ;; esac done ac_aux_dir='$ac_aux_dir' xsi_shell='$xsi_shell' lt_shell_append='$lt_shell_append' # See if we are running on zsh, and set the options which 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' TIMESTAMP='$TIMESTAMP' RM='$RM' ofile='$ofile' _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" ;; "Makefile") CONFIG_FILES="$CONFIG_FILES Makefile" ;; "doc/Makefile") CONFIG_FILES="$CONFIG_FILES doc/Makefile" ;; "doc/Doxyfile") CONFIG_FILES="$CONFIG_FILES doc/Doxyfile" ;; "include/osl/scop.h") CONFIG_FILES="$CONFIG_FILES include/osl/scop.h" ;; "tests/Makefile") CONFIG_FILES="$CONFIG_FILES tests/Makefile" ;; *) 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"" || { # Older Autoconf 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"` # 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'`; 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 which 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$TIMESTAMP) $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 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 # 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 in which 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 "X${COLLECT_NAMES+set}" != Xset; 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) if test x"$xsi_shell" = xyes; then sed -e '/^func_dirname ()$/,/^} # func_dirname /c\ func_dirname ()\ {\ \ case ${1} in\ \ */*) func_dirname_result="${1%/*}${2}" ;;\ \ * ) func_dirname_result="${3}" ;;\ \ esac\ } # Extended-shell func_dirname implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_basename ()$/,/^} # func_basename /c\ func_basename ()\ {\ \ func_basename_result="${1##*/}"\ } # Extended-shell func_basename implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_dirname_and_basename ()$/,/^} # func_dirname_and_basename /c\ func_dirname_and_basename ()\ {\ \ case ${1} in\ \ */*) func_dirname_result="${1%/*}${2}" ;;\ \ * ) func_dirname_result="${3}" ;;\ \ esac\ \ func_basename_result="${1##*/}"\ } # Extended-shell func_dirname_and_basename implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_stripname ()$/,/^} # func_stripname /c\ func_stripname ()\ {\ \ # pdksh 5.2.14 does not do ${X%$Y} correctly if both X and Y are\ \ # positional parameters, so assign one to ordinary parameter first.\ \ func_stripname_result=${3}\ \ func_stripname_result=${func_stripname_result#"${1}"}\ \ func_stripname_result=${func_stripname_result%"${2}"}\ } # Extended-shell func_stripname implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_split_long_opt ()$/,/^} # func_split_long_opt /c\ func_split_long_opt ()\ {\ \ func_split_long_opt_name=${1%%=*}\ \ func_split_long_opt_arg=${1#*=}\ } # Extended-shell func_split_long_opt implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_split_short_opt ()$/,/^} # func_split_short_opt /c\ func_split_short_opt ()\ {\ \ func_split_short_opt_arg=${1#??}\ \ func_split_short_opt_name=${1%"$func_split_short_opt_arg"}\ } # Extended-shell func_split_short_opt implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_lo2o ()$/,/^} # func_lo2o /c\ func_lo2o ()\ {\ \ case ${1} in\ \ *.lo) func_lo2o_result=${1%.lo}.${objext} ;;\ \ *) func_lo2o_result=${1} ;;\ \ esac\ } # Extended-shell func_lo2o implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_xform ()$/,/^} # func_xform /c\ func_xform ()\ {\ func_xform_result=${1%.*}.lo\ } # Extended-shell func_xform implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_arith ()$/,/^} # func_arith /c\ func_arith ()\ {\ func_arith_result=$(( $* ))\ } # Extended-shell func_arith implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_len ()$/,/^} # func_len /c\ func_len ()\ {\ func_len_result=${#1}\ } # Extended-shell func_len implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: fi if test x"$lt_shell_append" = xyes; then sed -e '/^func_append ()$/,/^} # func_append /c\ func_append ()\ {\ eval "${1}+=\\${2}"\ } # Extended-shell func_append implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_append_quoted ()$/,/^} # func_append_quoted /c\ func_append_quoted ()\ {\ \ func_quote_for_eval "${2}"\ \ eval "${1}+=\\\\ \\$func_quote_for_eval_result"\ } # Extended-shell func_append_quoted implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: # Save a `func_append' function call where possible by direct use of '+=' sed -e 's%func_append \([a-zA-Z_]\{1,\}\) "%\1+="%g' $cfgfile > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: else # Save a `func_append' function call even when '+=' is not available sed -e 's%func_append \([a-zA-Z_]\{1,\}\) "%\1="$\1%g' $cfgfile > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: fi if test x"$_lt_function_replace_fail" = x":"; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Unable to substitute extended shell functions in $ofile" >&5 $as_echo "$as_me: WARNING: Unable to substitute extended shell functions in $ofile" >&2;} fi mv -f "$cfgfile" "$ofile" || (rm -f "$ofile" && cp "$cfgfile" "$ofile" && rm -f "$cfgfile") chmod +x "$ofile" ;; "Makefile":F) test -z "$CONFIG_HEADERS" || echo timestamp > source/stamp-h.in ;; "doc/Makefile":F) test -z "$CONFIG_HEADERS" || echo timestamp > source/stamp-h.in ;; "doc/Doxyfile":F) test -z "$CONFIG_HEADERS" || echo timestamp > source/stamp-h.in ;; "include/osl/scop.h":F) test -z "$CONFIG_HEADERS" || echo timestamp > source/stamp-h.in ;; "tests/Makefile":F) test -z "$CONFIG_HEADERS" || echo timestamp > source/stamp-h.in ;; 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 # 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 echo " /*-----------------------------------------------*" echo " * OpenScop Library configuration is OK *" echo " *-----------------------------------------------*/" echo "It appears that your system is OK to start the OpenScop Library compilation." echo "You need now to type \"make\". Then type \"make install\" to install it on your" echo "system (log as root if necessary)." cloog-0.18.4/osl/source/0000755000175000017500000000000012555417256012021 500000000000000cloog-0.18.4/osl/source/extensions/0000755000175000017500000000000012555417256014220 500000000000000cloog-0.18.4/osl/source/extensions/arrays.c0000644000175000017500000004042612413271020015567 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** extensions/arrays.c ** **-----------------------------------------------------------------** ** First version: 07/12/2010 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #include #include #include #include #include #include #include #include #include /*+*************************************************************************** * Structure display function * *****************************************************************************/ /** * osl_arrays_idump function: * this function displays an osl_arrays_t structure (*arrays) into a file * (file, possibly stdout) in a way that trends to be understandable. It * includes an indentation level (level) in order to work with others * idump functions. * \param[in] file The file where the information has to be printed. * \param[in] arrays The arrays structure to print. * \param[in] level Number of spaces before printing, for each line. */ void osl_arrays_idump(FILE * file, osl_arrays_p arrays, int level) { int i, j; // Go to the right level. for (j = 0; j < level; j++) fprintf(file, "|\t"); if (arrays != NULL) fprintf(file, "+-- osl_arrays_t\n"); else fprintf(file, "+-- NULL arrays\n"); if (arrays != NULL) { // Go to the right level. for(j = 0; j <= level; j++) fprintf(file, "|\t"); // Display the number of names. fprintf(file, "nb_names: %d\n", arrays->nb_names); // Display the id/name. for(i = 0; i < arrays->nb_names; i++) { // Go to the right level. for(j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "id: %2d, name: %s\n", arrays->id[i], arrays->names[i]); } } // The last line. for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "\n"); } /** * osl_arrays_dump function: * this function prints the content of an osl_arrays_t structure * (*arrays) into a file (file, possibly stdout). * \param[in] file The file where the information has to be printed. * \param[in] arrays The arrays structure to print. */ void osl_arrays_dump(FILE * file, osl_arrays_p arrays) { osl_arrays_idump(file, arrays, 0); } /** * osl_arrays_sprint function: * this function prints the content of an osl_arrays_t structure * (*arrays) into a string (returned) in the OpenScop textual format. * \param[in] arrays The arrays structure to print. * \return A string containing the OpenScop dump of the arrays structure. */ char * osl_arrays_sprint(osl_arrays_p arrays) { int i; int high_water_mark = OSL_MAX_STRING; char * string = NULL; char buffer[OSL_MAX_STRING]; if (arrays != NULL) { OSL_malloc(string, char *, high_water_mark * sizeof(char)); string[0] = '\0'; sprintf(buffer, "# Number of arrays\n"); osl_util_safe_strcat(&string, buffer, &high_water_mark); sprintf(buffer, "%d\n", arrays->nb_names); osl_util_safe_strcat(&string, buffer, &high_water_mark); if (arrays->nb_names) { sprintf(buffer, "# Mapping array-identifiers/array-names\n"); osl_util_safe_strcat(&string, buffer, &high_water_mark); } for (i = 0; i < arrays->nb_names; i++) { sprintf(buffer, "%d %s\n", arrays->id[i], arrays->names[i]); osl_util_safe_strcat(&string, buffer, &high_water_mark); } OSL_realloc(string, char *, (strlen(string) + 1) * sizeof(char)); } return string; } /***************************************************************************** * Reading function * *****************************************************************************/ /** * osl_arrays_sread function: * this function reads an arrays structure from a string complying to the * OpenScop textual format and returns a pointer to this arrays structure. * The string should contain only one textual format of an arrays structure. * The input parameter is updated to the position in the input string this * function reach right after reading the comment structure. * \param[in,out] input The input string where to find an arrays structure. * Updated to the position after what has been read. * \return A pointer to the arrays structure that has been read. */ osl_arrays_p osl_arrays_sread(char ** input) { int i, k; int nb_names; osl_arrays_p arrays; if (input == NULL) { OSL_debug("no arrays optional tag"); return NULL; } // Find the number of names provided. nb_names = osl_util_read_int(NULL, input); // Allocate the array of id and names. arrays = osl_arrays_malloc(); OSL_malloc(arrays->id, int *, nb_names * sizeof(int)); OSL_malloc(arrays->names, char **, nb_names * sizeof(char *)); arrays->nb_names = nb_names; for (i = 0; i < nb_names; i++) arrays->names[i] = NULL; // Get each array id/name. for (k = 0; k < nb_names; k++) { // Get the array name id. arrays->id[k] = osl_util_read_int(NULL, input); // Get the array name string. arrays->names[k] = osl_util_read_string(NULL, input); } return arrays; } /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ /** * osl_arrays_malloc function: * this function allocates the memory space for an osl_arrays_t * structure and sets its fields with default values. Then it returns a * pointer to the allocated space. * \return A pointer to an empty arrays structure with fields set to * default values. */ osl_arrays_p osl_arrays_malloc() { osl_arrays_p arrays; OSL_malloc(arrays, osl_arrays_p, sizeof(osl_arrays_t)); arrays->nb_names = 0; arrays->id = NULL; arrays->names = NULL; return arrays; } /** * osl_arrays_free function: * this function frees the allocated memory for an arrays structure. * \param[in,out] arrays The pointer to the arrays structure we want to free. */ void osl_arrays_free(osl_arrays_p arrays) { int i; if (arrays != NULL) { free(arrays->id); for (i = 0; i < arrays->nb_names; i++) free(arrays->names[i]); free(arrays->names); free(arrays); } } /*+*************************************************************************** * Processing functions * *****************************************************************************/ /** * osl_arrays_clone function: * this function builds and returns a "hard copy" (not a pointer copy) of an * osl_arrays_t data structure. * \param[in] arrays The pointer to the arrays structure to clone. * \return A pointer to the clone of the arrays structure. */ osl_arrays_p osl_arrays_clone(osl_arrays_p arrays) { int i; osl_arrays_p clone; if (arrays == NULL) return NULL; clone = osl_arrays_malloc(); clone->nb_names = arrays->nb_names; OSL_malloc(clone->id, int *, arrays->nb_names * sizeof(int)); OSL_malloc(clone->names, char **, arrays->nb_names * sizeof(char*)); for (i = 0; i < arrays->nb_names; i++) { clone->id[i] = arrays->id[i]; OSL_strdup(clone->names[i], arrays->names[i]); } return clone; } /** * osl_arrays_equal function: * this function returns true if the two arrays structures are the same * (content-wise), false otherwise. This functions considers two arrays * structures as equal if the order of the array names differ, however the * identifiers and names must be the same. * \param[in] a1 The first arrays structure. * \param[in] a2 The second arrays structure. * \return 1 if a1 and a2 are the same (content-wise), 0 otherwise. */ int osl_arrays_equal(osl_arrays_p a1, osl_arrays_p a2) { int i, j, found; if (a1 == a2) return 1; if (((a1 == NULL) && (a2 != NULL)) || ((a1 != NULL) && (a2 == NULL))) { OSL_info("arrays are not the same"); return 0; } // Check whether the number of names is the same. if (a1->nb_names != a2->nb_names) { OSL_info("arrays are not the same"); return 0; } // We accept a different order of the names, as long as the identifiers // are the same. for (i = 0; i < a1->nb_names; i++) { found = 0; for (j = 0; j < a2->nb_names; j++) { if ((a1->id[i] == a2->id[j]) && (!strcmp(a1->names[i], a2->names[j]))) { found = 1; break; } } if (found != 1) { OSL_info("arrays are not the same"); return 0; } } return 1; } /** * osl_arrays_to_strings function: * this function creates a strings structure containing the textual names * contained in a names structure. Each name is placed according to its * id in the strings array. The "empty" strings cells are filled with * dummy names. * \param[in] arrays The arrays structure to convert to a strings. * \return A strings structure containing all the array names. */ osl_strings_p osl_arrays_to_strings(osl_arrays_p arrays) { int i, max_id = 0; osl_strings_p strings = NULL; if (arrays == NULL) return NULL; // Find the maximum array id. if (arrays->nb_names >= 1) { max_id = arrays->id[0]; for (i = 1; i < arrays->nb_names; i++) if (arrays->id[i] > max_id) max_id = arrays->id[i]; } // Build a strings structure for this number of ids. strings = osl_strings_generate("Dummy", max_id); for (i = 0; i < arrays->nb_names; i++) { free(strings->string[arrays->id[i] - 1]); OSL_strdup(strings->string[arrays->id[i] - 1], arrays->names[i]); } return strings; } /** * osl_arrays_add function: * this function adds a new variable at the end of osl_array * * \param[in] arrays The arrays structure to modify. * \param[in] id The new variable's id. * \param[in] name The new variable's name. * \return Updated number of elements, -1 means error */ int osl_arrays_add(osl_arrays_p arrays, int id, char* name) { if (arrays == NULL || name == NULL) return -1; OSL_realloc(arrays->id, int *, (arrays->nb_names+1) * sizeof(int)); OSL_realloc(arrays->names, char **, (arrays->nb_names+1) * sizeof(char *)); arrays->id[arrays->nb_names] = id; OSL_strdup(arrays->names[arrays->nb_names], name); arrays->nb_names++; return arrays->nb_names; } /** * osl_arrays_get_index_from_id function: * this function the index of a variable given its identifier * * \param[in] arrays The arrays structure to modify. * \param[in] id The variable's id. * \return index of the variable, array->nb_names means error */ size_t osl_arrays_get_index_from_id(osl_arrays_p arrays, int id) { size_t i = 0; if (arrays == NULL) return 0; for (i=0; inb_names; i++) { if(arrays->id[i]==id) break; } return inb_names? i: arrays->nb_names; } /** * osl_arrays_get_index_from_name function: * this function the index of a variable given its name * * \param[in] arrays The arrays structure to modify. * \param[in] name The variable's name. * \return index of the variable, array->nb_names means error */ size_t osl_arrays_get_index_from_name(osl_arrays_p arrays, char* name) { size_t i = 0; if (arrays == NULL || name == NULL) return 0; for (i=0; inb_names; i++) { if(!strcmp(arrays->names[i], name)) break; } return inb_names? i: arrays->nb_names;; } /** * osl_arrays_interface function: * this function creates an interface structure corresponding to the arrays * extension and returns it). * \return An interface structure for the arrays extension. */ osl_interface_p osl_arrays_interface() { osl_interface_p interface = osl_interface_malloc(); OSL_strdup(interface->URI, OSL_URI_ARRAYS); interface->idump = (osl_idump_f)osl_arrays_idump; interface->sprint = (osl_sprint_f)osl_arrays_sprint; interface->sread = (osl_sread_f)osl_arrays_sread; interface->malloc = (osl_malloc_f)osl_arrays_malloc; interface->free = (osl_free_f)osl_arrays_free; interface->clone = (osl_clone_f)osl_arrays_clone; interface->equal = (osl_equal_f)osl_arrays_equal; return interface; } cloog-0.18.4/osl/source/extensions/symbols.c0000644000175000017500000004766712413270135016002 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** extensions/symbols.c ** **-----------------------------------------------------------------** ** First version: 07/03/2012 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul * * Louis-Noel Pouchet * * Prasanth Chatharasi * * * *****************************************************************************/ #include #include #include #include #include #include #include #include /*+*************************************************************************** * Structure display function * *****************************************************************************/ /** * osl_symbols_idump function: * this function displays an osl_symbols_t structure (*symbols) into a * file (file, possibly stdout) in a way that trends to be understandable. It * includes an indentation level (level) in order to work with others * idump functions. * \param[in] file The file where the information has to be printed. * \param[in] symbols The symbols structure to print. * \param[in] level Number of spaces before printing, for each line. */ void osl_symbols_idump(FILE * file, osl_symbols_p symbols, int level) { int i, j, first = 1, number = 1; // Go to the right level. for (j = 0; j < level; j++) fprintf(file, "|\t"); if (symbols != NULL) fprintf(file, "+-- osl_symbols_t\n"); else fprintf(file, "+-- NULL symbols\n"); while (symbols != NULL) { if (!first) { // Go to the right level. for (j = 0; j < level; j++) fprintf(file, "|\t"); fprintf(file, "| osl_symbol_t (node %d)\n", number); } else { first = 0; } // A blank line. for (j = 0; j <= level+1; j++) fprintf(file, "|\t"); fprintf(file, "\n"); // 1. Print the symbol kind. for (i = 0; i <= level; i++) fprintf(file, "|\t"); if (symbols->type != OSL_UNDEFINED) { fprintf(file, "+-- Type: "); switch (symbols->type) { case OSL_SYMBOL_TYPE_ITERATOR : fprintf(file, "Iterator\n"); break; case OSL_SYMBOL_TYPE_PARAMETER: fprintf(file, "Parameter\n"); break; case OSL_SYMBOL_TYPE_ARRAY : fprintf(file, "Array\n"); break; case OSL_SYMBOL_TYPE_FUNCTION : fprintf(file, "Function\n"); break; default : fprintf(file, "Unknown\n") ; } } else { fprintf(file, "+-- NULL type\n"); } // A blank line. for(j = 0; j <= level + 1; j++) fprintf(file, "|\t") ; fprintf(file, "\n") ; // 2. Print the origin of the symbol. for (i = 0; i <= level; i++) fprintf(file, "|\t"); if (symbols->generated != OSL_UNDEFINED) fprintf(file, "+-- Origin: %d\n", symbols->generated); else fprintf(file, "+-- Undefined origin\n"); // A blank line. for(j = 0; j <= level + 1; j++) fprintf(file, "|\t") ; fprintf(file, "\n") ; // 3. Print the number of array dimensions for the symbol. for (i = 0; i <= level; i++) fprintf(file, "|\t"); if (symbols->nb_dims != OSL_UNDEFINED) fprintf(file, "+-- Number of Dimensions: %d\n", symbols->nb_dims); else fprintf(file, "+-- Undefined number of dimensions\n"); // A blank line. for(j = 0; j <= level + 1; j++) fprintf(file, "|\t") ; fprintf(file, "\n") ; // 4. Print the symbol identifier. osl_generic_idump(file, symbols->identifier, level + 1); // 5. Print the data type of the symbol. osl_generic_idump(file, symbols->datatype, level + 1); // 6. Print the scope of the symbol. osl_generic_idump(file, symbols->scope, level + 1); // 7. Print the extent of the symbol. osl_generic_idump(file, symbols->extent, level + 1); symbols = symbols->next; number++; // Next line. if (symbols != NULL) { for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "V\n"); } } // The last line. for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "\n"); } /** * osl_symbols_dump function: * this function prints the content of an osl_symbols_t structure * (*symbols) into a file (file, possibly stdout). * \param[in] file The file where the information has to be printed. * \param[in] symbols The symbols structure to print. */ void osl_symbols_dump(FILE * file, osl_symbols_p symbols) { osl_symbols_idump(file, symbols, 0); } /** * osl_symbols_sprint function: * this function prints the content of an osl_symbols_t structure * (*symbols) into a string (returned) in the OpenScop textual format. * \param[in] symbols The symbols structure to print. * \return A string containing the OpenScop dump of the symbols structure. */ char * osl_symbols_sprint(osl_symbols_p symbols) { int i = 1; int high_water_mark = OSL_MAX_STRING; char* string = NULL, *temp; char buffer[OSL_MAX_STRING]; OSL_malloc(string, char *, high_water_mark * sizeof(char)); string[0] = '\0'; sprintf(buffer, "# Number of symbols\n%d\n", osl_symbols_get_nb_symbols(symbols)); osl_util_safe_strcat(&string, buffer, &high_water_mark); while (symbols != NULL) { sprintf(buffer, "# ===========================================\n"); osl_util_safe_strcat(&string, buffer, &high_water_mark); sprintf(buffer, "# %d Data for symbol number %d \n", i, i); osl_util_safe_strcat(&string, buffer, &high_water_mark); if (symbols->type == OSL_UNDEFINED) { sprintf(buffer, "# %d.1 Symbol type\nUndefined\n", i); osl_util_safe_strcat(&string, buffer, &high_water_mark); } else { sprintf(buffer, "# %d.1 Symbol type\n", i); osl_util_safe_strcat(&string, buffer, &high_water_mark); switch (symbols->type) { case OSL_SYMBOL_TYPE_ITERATOR : sprintf(buffer, "Iterator\n"); break; case OSL_SYMBOL_TYPE_PARAMETER: sprintf(buffer, "Parameter\n"); break; case OSL_SYMBOL_TYPE_ARRAY : sprintf(buffer, "Array\n"); break; case OSL_SYMBOL_TYPE_FUNCTION : sprintf(buffer, "Function\n"); break; default : sprintf(buffer, "Undefined\n") ; } osl_util_safe_strcat(&string, buffer, &high_water_mark); } // Printing Generated Boolean flag sprintf(buffer, "\n# %d.2 Generated Boolean\n%d\n", i, symbols->generated); osl_util_safe_strcat(&string, buffer, &high_water_mark); // Printing Number of dimensions sprintf(buffer,"\n# %d.3 Number of dimensions\n%d\n", i, symbols->nb_dims); osl_util_safe_strcat(&string, buffer, &high_water_mark); // Printing Identifier sprintf(buffer, "\n# %d.4 Identifier\n", i); osl_util_safe_strcat(&string, buffer, &high_water_mark); temp = osl_generic_sprint(symbols->identifier); osl_util_safe_strcat(&string, temp, &high_water_mark); free(temp); // Printing Datatype sprintf(buffer, "\n# %d.5 Datatype\n", i); osl_util_safe_strcat(&string, buffer, &high_water_mark); temp = osl_generic_sprint(symbols->datatype); osl_util_safe_strcat(&string, temp, &high_water_mark); free(temp); // Printing Scope sprintf(buffer, "\n# %d.6 Scope\n", i); osl_util_safe_strcat(&string, buffer, &high_water_mark); temp = osl_generic_sprint(symbols->scope); osl_util_safe_strcat(&string, temp, &high_water_mark); free(temp); // Printing Extent sprintf(buffer, "\n# %d.7 Extent\n", i); osl_util_safe_strcat(&string, buffer, &high_water_mark); temp = osl_generic_sprint(symbols->extent); osl_util_safe_strcat(&string, temp, &high_water_mark); free(temp); symbols = symbols->next; } OSL_realloc(string, char *, (strlen(string) + 1) * sizeof(char)); return string; } /***************************************************************************** * Reading function * *****************************************************************************/ /** * osl_symbols_sread function: * this function reads a symbols structure from a string complying to the * OpenScop textual format and returns a pointer to this symbols structure. * The input parameter is updated to the position in the input string this * function reach right after reading the symbols structure. * \param[in,out] input The input string where to find a symbols. * Updated to the position after what has been read. * \return A pointer to the symbols structure that has been read. */ osl_symbols_p osl_symbols_sread(char ** input) { int nb_symbols; char* type; osl_symbols_p symbols; osl_symbols_p head; osl_interface_p registry; if (*input == NULL) { OSL_debug("no symbols optional tag"); return NULL; } if (strlen(*input) > OSL_MAX_STRING) OSL_error("symbols too long"); // Find the number of names provided. nb_symbols = osl_util_read_int(NULL, input); if (nb_symbols == 0) return NULL; head = symbols = osl_symbols_malloc(); registry = osl_interface_get_default_registry(); while (nb_symbols != 0) { // Reading the type of symbol type = osl_util_read_string(NULL, input); if (type != NULL) { if (strcmp(type, "Iterator") == 0) symbols->type = OSL_SYMBOL_TYPE_ITERATOR; else if (strcmp(type, "Parameter") == 0) symbols->type = OSL_SYMBOL_TYPE_PARAMETER; else if (strcmp(type, "Array") == 0) symbols->type = OSL_SYMBOL_TYPE_ARRAY; else if (strcmp(type, "Function") == 0) symbols->type = OSL_SYMBOL_TYPE_FUNCTION; else symbols->type = OSL_UNDEFINED; free(type); } // Reading origin of symbol symbols->generated = osl_util_read_int(NULL, input); // Reading the number of dimensions of a symbol symbols->nb_dims = osl_util_read_int(NULL, input); // Reading identifier symbols->identifier = osl_generic_sread_one(input, registry); // Reading data type symbols->datatype = osl_generic_sread_one(input, registry); // Reading scope symbols->scope = osl_generic_sread_one(input, registry); // Reading extent symbols->extent = osl_generic_sread_one(input, registry); nb_symbols --; if (nb_symbols != 0) { symbols->next = osl_symbols_malloc (); symbols = symbols->next; } } osl_interface_free(registry); return head; } /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ /** * osl_symbols_malloc function: * this function allocates the memory space for an osl_symbols_t * structure and sets its fields with default values. Then it returns a * pointer to the allocated space. * \return A pointer to an empty symbols structure with fields set to * default values. */ osl_symbols_p osl_symbols_malloc() { osl_symbols_p symbols; OSL_malloc(symbols, osl_symbols_p, sizeof(osl_symbols_t)); symbols->type = OSL_UNDEFINED; symbols->generated = OSL_UNDEFINED; symbols->nb_dims = OSL_UNDEFINED; symbols->identifier = NULL; symbols->datatype = NULL; symbols->scope = NULL; symbols->extent = NULL; symbols->next = NULL; return symbols; } /** * osl_symbols_free function: * this function frees the allocated memory for an osl_symbols_t * structure. * \param[in,out] symbols The pointer to the symbols structure to free. */ void osl_symbols_free(osl_symbols_p symbols) { osl_symbols_p tmp; while (symbols != NULL) { tmp = symbols->next; osl_generic_free(symbols->identifier); osl_generic_free(symbols->datatype); osl_generic_free(symbols->scope); osl_generic_free(symbols->extent); free(symbols); symbols = tmp; } } /*+*************************************************************************** * Processing functions * *****************************************************************************/ /** * osl_symbols_add function: * this function adds a scop "scop" at the end of the symbols list pointed * by "location". * \param[in,out] location Address of the first element of the symbols list. * \param[in] symbols The symbols to add to the list. */ void osl_symbols_add(osl_symbols_p* location, osl_symbols_p symbols) { while (*location != NULL) location = &((*location)->next); *location = symbols; } /** * osl_symbols_nclone function: * This function builds and returns a "hard copy" (not a pointer copy) of the * n first elements of an osl_symbols_t list. * \param symbols The pointer to the symbols structure we want to clone. * \param n The number of nodes we want to copy (-1 for infinity). * \return The clone of the n first nodes of the symbols list. */ osl_symbols_p osl_symbols_nclone(osl_symbols_p symbols, int n) { osl_symbols_p clone = NULL, new; int i = 0; while ((symbols != NULL) && ((n == -1) || (i < n))) { new = osl_symbols_malloc(); new->type = symbols->type; new->generated = symbols->generated; new->nb_dims = symbols->nb_dims; new->identifier = osl_generic_clone(symbols->identifier); new->datatype = osl_generic_clone(symbols->datatype); new->scope = osl_generic_clone(symbols->scope); new->extent = osl_generic_clone(symbols->extent); osl_symbols_add(&clone, new); symbols = symbols->next; i++; } return clone; } /** * osl_symbols_clone function: * this function builds and returns a "hard copy" (not a pointer copy) of an * osl_symbols_t data structure. * \param[in] symbols The pointer to the symbols structure to clone. * \return A pointer to the clone of the symbols structure. */ osl_symbols_p osl_symbols_clone(osl_symbols_p symbols) { return osl_symbols_nclone(symbols, -1); } /** * osl_symbols_equal function: * this function returns true if the two symbols structures are the same * (content-wise), false otherwise. * \param[in] c1 The first symbols structure. * \param[in] c2 The second symbols structure. * \return 1 if c1 and c2 are the same (content-wise), 0 otherwise. */ int osl_symbols_equal(osl_symbols_p c1, osl_symbols_p c2) { if (c1 == c2) return 1; if (((c1 == NULL) && (c2 != NULL)) || ((c1 != NULL) && (c2 == NULL))) return 0; if (c1->type == c2->type && c1->generated == c2->generated && c1->nb_dims == c2->nb_dims) { if (osl_generic_equal(c1->identifier, c2->identifier)) { if (osl_generic_equal(c1->datatype, c2->datatype)) { if (osl_generic_equal(c1->scope, c2->scope)) { if (osl_generic_equal(c1->extent, c2->extent)) { return 1; } } } } } return 0; } /** * osl_symbols_get_nb_symbols function: * this function returns the number of symbols in the symbol list provided * as input. * \param symbols The head of the symbol list. * \return The number of symbols in the symbol list. */ int osl_symbols_get_nb_symbols(osl_symbols_p symbols) { int nb_symbols = 0; while (symbols != NULL) { nb_symbols++; symbols = symbols->next; } return nb_symbols; } /** * osl_symbols_interface function: * this function creates an interface structure corresponding to the symbols * extension and returns it). * \return An interface structure for the symbols extension. */ osl_interface_p osl_symbols_interface() { osl_interface_p interface = osl_interface_malloc(); OSL_strdup(interface->URI, OSL_URI_SYMBOLS); interface->idump = (osl_idump_f)osl_symbols_idump; interface->sprint = (osl_sprint_f)osl_symbols_sprint; interface->sread = (osl_sread_f)osl_symbols_sread; interface->malloc = (osl_malloc_f)osl_symbols_malloc; interface->free = (osl_free_f)osl_symbols_free; interface->clone = (osl_clone_f)osl_symbols_clone; interface->equal = (osl_equal_f)osl_symbols_equal; return interface; } cloog-0.18.4/osl/source/extensions/dependence.c0000644000175000017500000005457512413270135016400 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** extensions/dependence.h ** **-----------------------------------------------------------------** ** First version: 02/07/2012 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #include #include #include #include #include #include #include #include #include #include /** * Most of these functions where extracted from candl and ported to osl */ /****************************************************************************** * Structure display function * ******************************************************************************/ /** * osl_dependence_idump function: * Displays a osl_dependence_p structure (dependence) into a file (file, * possibly stdout) in a way that trends to be understandable without falling * in a deep depression or, for the lucky ones, getting a headache... It * includes an indentation level (level) in order to work with others * idump functions. * - 18/09/2003: first version. */ void osl_dependence_idump(FILE* file, osl_dependence_p dependence, int level) { int j, first = 1; osl_statement_p tmp; if (dependence != NULL) { /* Go to the right level. */ for (j=0; jtype) { case OSL_UNDEFINED : fprintf(file, "UNSET\n"); break; case OSL_DEPENDENCE_RAW : fprintf(file, "RAW (flow)\n"); break; case OSL_DEPENDENCE_WAR : fprintf(file, "WAR (anti)\n"); break; case OSL_DEPENDENCE_WAW : fprintf(file, "WAW (output)\n"); break; case OSL_DEPENDENCE_RAR : fprintf(file, "RAR (input)\n"); break; case OSL_DEPENDENCE_RAW_SCALPRIV : fprintf(file, "RAW_SCALPRIV (scalar priv)\n"); break; default : fprintf(file, "unknown\n"); break; } /* A blank line. */ for (j=0; j<=level+1; j++) fprintf(file, "|\t"); fprintf(file, "\n"); /* Go to the right level and print the depth. */ for (j=0; j<=level; j++) fprintf(file, "|\t"); fprintf(file, "Depth: %d\n", dependence->depth); /* A blank line. */ for (j=0; j<=level+1; j++) fprintf(file, "|\t"); fprintf(file, "\n"); /* Ref source and target */ for (j=0; j<=level; j++) fprintf(file, "|\t"); fprintf(file, "Ref source: %d, Ref target: %d\n", dependence->ref_source, dependence->ref_target); /* A blank line. */ for (j=0; j<=level+1; j++) fprintf(file, "|\t"); fprintf(file, "\n"); /* Print the source statement. */ for (j=0; j<=level; j++) fprintf(file, "|\t"); fprintf(file, "Statement label: %d\n", dependence->label_source); tmp = dependence->stmt_source_ptr->next; dependence->stmt_source_ptr->next = NULL; osl_statement_idump(file, dependence->stmt_source_ptr, level+1); dependence->stmt_source_ptr->next = tmp; /* Print the target statement. */ for (j=0; j<=level; j++) fprintf(file, "|\t"); fprintf(file, "Target label: %d\n", dependence->label_target); tmp = dependence->stmt_target_ptr->next; dependence->stmt_target_ptr->next = NULL; osl_statement_idump(file, dependence->stmt_target_ptr, level+1); dependence->stmt_target_ptr->next = tmp; /* Print the dependence polyhedron. */ for (j=0; j<=level; j++) fprintf(file, "|\t"); fprintf(file, "%d %d %d %d %d %d %d %d\n", dependence->source_nb_output_dims_domain, dependence->source_nb_output_dims_access, dependence->target_nb_output_dims_domain, dependence->target_nb_output_dims_access, dependence->source_nb_local_dims_domain, dependence->source_nb_local_dims_access, dependence->target_nb_local_dims_domain, dependence->target_nb_local_dims_access); osl_relation_idump(file, dependence->domain, level+1); dependence = dependence->next; /* Next line. */ if (dependence != NULL) { for (j=0; j<=level; j++) fprintf(file, "|\t"); fprintf(file, "V\n"); } } /* The last line. */ for (j=0; j<=level; j++) fprintf(file, "|\t"); fprintf(file, "\n"); } /** * osl_dependence_dump function: * This function prints the content of a osl_dependence_p structure (dependence) * into a file (file, possibly stdout). */ void osl_dependence_dump(FILE * file, osl_dependence_p dependence) { osl_dependence_idump(file, dependence, 0); } /** * osl_dependence_print function: * Print the dependence, formatted to fit the .scop representation. */ void osl_dependence_print(FILE *file, osl_dependence_p dependence) { char *string = osl_dependence_sprint(dependence); fprintf(file, "%s\n", string); free(string); } /** * osl_dependence_sprint function: * Returns a string containing the dependence, formatted to fit the * .scop representation. */ char* osl_dependence_sprint(osl_dependence_p dependence) { osl_dependence_p tmp = dependence; int nb_deps; int buffer_size = 2048; char* buffer; char buff[2048]; char* type; char* pbuffer; OSL_malloc(buffer, char*, buffer_size); buffer[0] = '\0'; for (tmp = dependence, nb_deps = 0; tmp; tmp = tmp->next, ++nb_deps) ; snprintf(buff, OSL_MAX_STRING, "# Number of dependences\n%d\n", nb_deps); strcat(buffer, buff); if (nb_deps) { for (tmp = dependence, nb_deps = 1; tmp; tmp = tmp->next, ++nb_deps) { switch (tmp->type) { case OSL_UNDEFINED: type = "UNSET"; break; case OSL_DEPENDENCE_RAW: type = "RAW #(flow)"; break; case OSL_DEPENDENCE_WAR: type = "WAR #(anti)"; break; case OSL_DEPENDENCE_WAW: type = "WAW #(output)"; break; case OSL_DEPENDENCE_RAR: type = "RAR #(input)"; break; case OSL_DEPENDENCE_RAW_SCALPRIV: type = "RAW_SCALPRIV #(scalar priv)"; break; default: exit(1); break; } /* Output dependence information. */ snprintf(buff, OSL_MAX_STRING, "# Description of dependence %d\n" "# type\n%s\n" "# From source statement id\n%d\n" "# To target statement id\n%d\n" "# Depth \n%d\n" "# From source access ref\n%d\n" "# To target access ref\n%d\n" "# Dependence domain\n", nb_deps, type, tmp->label_source, tmp->label_target, tmp->depth, tmp->ref_source, tmp->ref_target); osl_util_safe_strcat(&buffer, buff, &buffer_size); /* Output dependence domain. */ pbuffer = osl_relation_sprint(tmp->domain); osl_util_safe_strcat(&buffer, pbuffer, &buffer_size); free(pbuffer); } } return buffer; } /** * osl_dependence_read_one_dep function: * Read one dependence from a string. */ static osl_dependence_p osl_dependence_read_one_dep(char **input, int precision) { osl_dependence_p dep = osl_dependence_malloc(); char *buffer; /* Dependence type */ buffer = osl_util_read_string(NULL, input); if (! strcmp(buffer, "RAW")) dep->type = OSL_DEPENDENCE_RAW; else if (! strcmp(buffer, "RAR")) dep->type = OSL_DEPENDENCE_RAR; else if (! strcmp(buffer, "WAR")) dep->type = OSL_DEPENDENCE_WAR; else if (! strcmp(buffer, "WAW")) dep->type = OSL_DEPENDENCE_WAW; else if (! strcmp(buffer, "RAW_SCALPRIV")) dep->type = OSL_DEPENDENCE_RAW_SCALPRIV; free(buffer); /* # From source statement xxx */ dep->label_source = osl_util_read_int(NULL, input); /* # To target statement xxx */ dep->label_target = osl_util_read_int(NULL, input); /* # Depth */ dep->depth = osl_util_read_int(NULL, input); /* # From source access ref */ dep->ref_source = osl_util_read_int(NULL, input); /* # To target access ref */ dep->ref_target = osl_util_read_int(NULL, input); /* Read the osl_relation */ dep->domain = osl_relation_psread(input, precision); return dep; } /** * osl_dependence_sread function: * Retrieve a osl_dependence_p list from the option tag in the scop. */ osl_dependence_p osl_dependence_sread(char **input) { int precision = osl_util_get_precision(); return osl_dependence_psread(input, precision); } /** * osl_dependence_psread function * Retrieve a osl_dependence_p list from the option tag in the scop. */ osl_dependence_p osl_dependence_psread(char **input, int precision) { osl_dependence_p first = NULL; osl_dependence_p currdep = NULL; if (*input == NULL) { OSL_debug("no dependence optional tag"); return NULL; } int i; /* Get the number of dependences. */ int nbdeps = osl_util_read_int(NULL, input); /* For each of them, read 1 and shift of the read size. */ for (i = 0; i < nbdeps; i++) { osl_dependence_p adep = osl_dependence_read_one_dep(input, precision); if (first == NULL) { currdep = first = adep; } else { currdep->next = adep; currdep = currdep->next; } } return first; } /****************************************************************************** * Memory deallocation function * ******************************************************************************/ /** * osl_dependence_malloc function: * This function allocates the memory space for a osl_dependence_p structure and * sets its fields with default values. Then it returns a pointer to the * allocated space. * - 07/12/2005: first version. */ osl_dependence_p osl_dependence_malloc() { osl_dependence_p dependence; /* Memory allocation for the osl_dependence_p structure. */ OSL_malloc(dependence, osl_dependence_p, sizeof(osl_dependence_t)); /* We set the various fields with default values. */ dependence->depth = OSL_UNDEFINED; dependence->type = OSL_UNDEFINED; dependence->label_source = OSL_UNDEFINED; dependence->label_target = OSL_UNDEFINED; dependence->ref_source = OSL_UNDEFINED; dependence->ref_target = OSL_UNDEFINED; dependence->domain = NULL; dependence->next = NULL; dependence->usr = NULL; dependence->source_nb_output_dims_domain = OSL_UNDEFINED; dependence->source_nb_output_dims_access = OSL_UNDEFINED; dependence->target_nb_output_dims_domain = OSL_UNDEFINED; dependence->target_nb_output_dims_access = OSL_UNDEFINED; dependence->source_nb_local_dims_domain = OSL_UNDEFINED; dependence->source_nb_local_dims_access = OSL_UNDEFINED; dependence->target_nb_local_dims_domain = OSL_UNDEFINED; dependence->target_nb_local_dims_access = OSL_UNDEFINED; dependence->ref_source_access_ptr = NULL; dependence->ref_target_access_ptr = NULL; dependence->stmt_source_ptr = NULL; dependence->stmt_target_ptr = NULL; return dependence; } /** * osl_dependence_free function: * This function frees the allocated memory for a osl_dependence_p structure. * - 18/09/2003: first version. */ void osl_dependence_free(osl_dependence_p dependence) { osl_dependence_p next; while (dependence != NULL) { next = dependence->next; osl_relation_free(dependence->domain); free(dependence); dependence = next; } } /****************************************************************************** * Processing functions * ******************************************************************************/ /** * osl_dependence_nclone function: * This function builds and returns a "hard copy" (not a pointer copy) of the * n first elements of an osl_dependence_t list. * \param statement The pointer to the dependence structure we want to clone. * \param n The number of nodes we want to copy (-1 for infinity). * \return The clone of the n first nodes of the dependence list. */ osl_dependence_p osl_dependence_nclone(osl_dependence_p dep, int n) { int first = 1, i = 0; osl_dependence_p clone = NULL, node, previous = NULL; while ((dep != NULL) && ((n == -1) || (i < n))) { node = osl_dependence_malloc(); node->stmt_source_ptr = dep->stmt_source_ptr; node->stmt_target_ptr = dep->stmt_target_ptr; node->depth = dep->depth; node->type = dep->type; node->label_source = dep->label_source; node->label_target = dep->label_target; node->ref_source = dep->ref_source; node->ref_target = dep->ref_target; node->domain = osl_relation_clone(dep->domain); node->source_nb_output_dims_domain = dep->source_nb_output_dims_domain; node->source_nb_output_dims_access = dep->source_nb_output_dims_access; node->target_nb_output_dims_domain = dep->target_nb_output_dims_domain; node->target_nb_output_dims_access = dep->target_nb_output_dims_access; node->source_nb_local_dims_domain = dep->source_nb_local_dims_domain; node->source_nb_local_dims_access = dep->source_nb_local_dims_access; node->target_nb_local_dims_domain = dep->target_nb_local_dims_domain; node->target_nb_local_dims_access = dep->target_nb_local_dims_access; node->next = NULL; node->usr = NULL; if (first) { first = 0; clone = node; previous = node; } else { previous->next = node; previous = previous->next; } i++; dep = dep->next; } return clone; } /** * osl_dependence_clone function: * This functions builds and returns a "hard copy" (not a pointer copy) of an * osl_dependence_t data structure provided as parameter. * \param[in] statement The pointer to the dependence we want to clone. * \return A pointer to the clone of the dependence provided as parameter. */ osl_dependence_p osl_dependence_clone(osl_dependence_p dep) { return osl_dependence_nclone(dep, -1); } /** * osl_dependence_equal function: * this function returns true if the two dependences provided as parameters * are the same, false otherwise (the usr field is not tested). * NOTE: the different pointer to statements or relations are nto compared * \param[in] d1 The first dependence. * \param[in] d2 The second dependence. * \return 1 if d1 and d2 are the same (content-wise), 0 otherwise. */ int osl_dependence_equal(osl_dependence_p d1, osl_dependence_p d2) { if (d1 == d2) return 1; if ((d1->next != NULL && d2->next == NULL) || (d1->next == NULL && d2->next != NULL)) return 0; if (d1->next != NULL && d2->next != NULL) if (!osl_dependence_equal(d1->next, d2->next)) return 0; if (!osl_relation_equal(d1->domain, d2->domain)) return 0; if (d1->label_source != d2->label_source || d1->label_target != d2->label_target || d1->ref_source != d2->ref_source || d1->ref_target != d2->ref_target || d1->depth != d2->depth || d1->type != d2->type || d1->source_nb_output_dims_domain != d2->source_nb_output_dims_domain || d1->source_nb_output_dims_access != d2->source_nb_output_dims_access || d1->target_nb_output_dims_domain != d2->target_nb_output_dims_domain || d1->target_nb_output_dims_access != d2->target_nb_output_dims_access || d1->source_nb_local_dims_domain != d2->source_nb_local_dims_domain || d1->source_nb_local_dims_access != d2->source_nb_local_dims_access || d1->target_nb_local_dims_domain != d2->target_nb_local_dims_domain || d1->target_nb_local_dims_access != d2->target_nb_local_dims_access) return 0; return 1; } /** * osl_dependence_add function: * This function adds a osl_dependence_p structure (dependence) at a given place * (now) of a NULL terminated list of osl_dependence_p 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-. * - 18/09/2003: first version. */ void osl_dependence_add(osl_dependence_p* start, osl_dependence_p* now, osl_dependence_p dependence) { if (dependence != NULL) { if (*start == NULL) { *start = dependence; *now = *start; } else { (*now)->next = dependence; *now = (*now)->next; } while ((*now)->next != NULL) *now = (*now)->next; } } /** * osl_nb_dependences function: * This function returns the number of dependences in the dependence * list * \param dependence The first dependence of the dependence list. ** */ int osl_nb_dependences(osl_dependence_p deps) { osl_dependence_p dep = deps; int num = 0; while (dep != NULL) { num++; dep = dep->next; } return num; } /** * osl_dependence_interface function: * this function creates an interface structure corresponding to the dependence * extension and returns it). * \return An interface structure for the dependence extension. */ osl_interface_p osl_dependence_interface() { osl_interface_p interface = osl_interface_malloc(); OSL_strdup(interface->URI, OSL_URI_DEPENDENCE); interface->idump = (osl_idump_f)osl_dependence_idump; interface->sprint = (osl_sprint_f)osl_dependence_sprint; interface->sread = (osl_sread_f)osl_dependence_sread; interface->malloc = (osl_malloc_f)osl_dependence_malloc; interface->free = (osl_free_f)osl_dependence_free; interface->clone = (osl_clone_f)osl_dependence_clone; interface->equal = (osl_equal_f)osl_dependence_equal; return interface; } cloog-0.18.4/osl/source/extensions/comment.c0000644000175000017500000002743512413270135015743 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** extensions/comment.c ** **-----------------------------------------------------------------** ** First version: 07/12/2010 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #include #include #include #include #include #include #include /*+*************************************************************************** * Structure display function * *****************************************************************************/ /** * osl_comment_idump function: * this function displays an osl_comment_t structure (*comment) into a * file (file, possibly stdout) in a way that trends to be understandable. It * includes an indentation level (level) in order to work with others * idump functions. * \param[in] file The file where the information has to be printed. * \param[in] comment The comment structure to print. * \param[in] level Number of spaces before printing, for each line. */ void osl_comment_idump(FILE * file, osl_comment_p comment, int level) { int j; size_t l; char * tmp; // Go to the right level. for (j = 0; j < level; j++) fprintf(file, "|\t"); if (comment != NULL) fprintf(file, "+-- osl_comment_t\n"); else fprintf(file, "+-- NULL comment\n"); if (comment != NULL) { // Go to the right level. for(j = 0; j <= level; j++) fprintf(file, "|\t"); // Display the comment message (without any carriage return). OSL_strdup(tmp, comment->comment); for (l = 0; l < strlen(tmp); l++) if (tmp[l] == '\n') tmp[l] = ' '; fprintf(file, "comment: %s\n", tmp); free(tmp); } // The last line. for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "\n"); } /** * osl_comment_dump function: * this function prints the content of an osl_comment_t structure * (*comment) into a file (file, possibly stdout). * \param[in] file The file where the information has to be printed. * \param[in] comment The comment structure to print. */ void osl_comment_dump(FILE * file, osl_comment_p comment) { osl_comment_idump(file, comment, 0); } /** * osl_comment_sprint function: * this function prints the content of an osl_comment_t structure * (*comment) into a string (returned) in the OpenScop textual format. * \param[in] comment The comment structure to print. * \return A string containing the OpenScop dump of the comment structure. */ char * osl_comment_sprint(osl_comment_p comment) { int high_water_mark = OSL_MAX_STRING; char * string = NULL; char buffer[OSL_MAX_STRING]; if (comment != NULL) { OSL_malloc(string, char *, high_water_mark * sizeof(char)); string[0] = '\0'; // Print the comment. sprintf(buffer, "%s", comment->comment); osl_util_safe_strcat(&string, buffer, &high_water_mark); // Keep only the memory space we need. OSL_realloc(string, char *, (strlen(string) + 1) * sizeof(char)); } return string; } /***************************************************************************** * Reading function * *****************************************************************************/ /** * osl_comment_sread function: * this function reads a comment structure from a string complying to the * OpenScop textual format and returns a pointer to this comment structure. * The input parameter is updated to the position in the input string this * function reach right after reading the comment structure. * \param[in,out] input The input string where to find a comment. * Updated to the position after what has been read. * \return A pointer to the comment structure that has been read. */ osl_comment_p osl_comment_sread(char ** input) { osl_comment_p comment; if (*input == NULL) { OSL_debug("no comment optional tag"); return NULL; } if (strlen(*input) > OSL_MAX_STRING) OSL_error("comment too long"); // Build the comment structure comment = osl_comment_malloc(); OSL_strdup(comment->comment, *input); // Update the input pointer (everything has been read). input += strlen(*input); return comment; } /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ /** * osl_comment_malloc function: * this function allocates the memory space for an osl_comment_t * structure and sets its fields with default values. Then it returns a * pointer to the allocated space. * \return A pointer to an empty comment structure with fields set to * default values. */ osl_comment_p osl_comment_malloc() { osl_comment_p comment; OSL_malloc(comment, osl_comment_p, sizeof(osl_comment_t)); comment->comment = NULL; return comment; } /** * osl_comment_free function: * this function frees the allocated memory for an osl_comment_t * structure. * \param[in,out] comment The pointer to the comment structure to free. */ void osl_comment_free(osl_comment_p comment) { if (comment != NULL) { if(comment->comment != NULL) free(comment->comment); free(comment); } } /*+*************************************************************************** * Processing functions * *****************************************************************************/ /** * osl_comment_clone function: * this function builds and returns a "hard copy" (not a pointer copy) of an * osl_comment_t data structure. * \param[in] comment The pointer to the comment structure to clone. * \return A pointer to the clone of the comment structure. */ osl_comment_p osl_comment_clone(osl_comment_p comment) { osl_comment_p clone; if (comment == NULL) return NULL; clone = osl_comment_malloc(); OSL_strdup(clone->comment, comment->comment); return clone; } /** * osl_comment_equal function: * this function returns true if the two comment structures are the same * (content-wise), false otherwise. * \param[in] c1 The first comment structure. * \param[in] c2 The second comment structure. * \return 1 if c1 and c2 are the same (content-wise), 0 otherwise. */ int osl_comment_equal(osl_comment_p c1, osl_comment_p c2) { if (c1 == c2) return 1; if (((c1 == NULL) && (c2 != NULL)) || ((c1 != NULL) && (c2 == NULL))) { OSL_info("comments are not the same"); return 0; } if (strcmp(c1->comment, c2->comment)) { // Well, the test does not apply well on textual content but the idea // is here (see osl_generic_sprint if you want to understand the problem). //OSL_info("comments are not the same"); //return 0; } return 1; } /** * osl_comment_interface function: * this function creates an interface structure corresponding to the comment * extension and returns it). * \return An interface structure for the comment extension. */ osl_interface_p osl_comment_interface() { osl_interface_p interface = osl_interface_malloc(); OSL_strdup(interface->URI, OSL_URI_COMMENT); interface->idump = (osl_idump_f)osl_comment_idump; interface->sprint = (osl_sprint_f)osl_comment_sprint; interface->sread = (osl_sread_f)osl_comment_sread; interface->malloc = (osl_malloc_f)osl_comment_malloc; interface->free = (osl_free_f)osl_comment_free; interface->clone = (osl_clone_f)osl_comment_clone; interface->equal = (osl_equal_f)osl_comment_equal; return interface; } cloog-0.18.4/osl/source/extensions/textual.c0000644000175000017500000003043312413270135015757 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** extensions/textual.c ** **-----------------------------------------------------------------** ** First version: 15/17/2010 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #include #include #include #include #include #include #include /* CAUTION : TEXTUAL IS A VERY SPECIAL CASE: DO NOT USE IT AS AN EXAMPLE !!! */ /*+*************************************************************************** * Structure display function * *****************************************************************************/ /** * osl_textual_idump function: * this function displays an osl_textual_t structure (*textual) into a * file (file, possibly stdout) in a way that trends to be understandable. It * includes an indentation level (level) in order to work with others * idump functions. * \param[in] file The file where the information has to be printed. * \param[in] textual The textual structure to be printed. * \param[in] level Number of spaces before printing, for each line. */ void osl_textual_idump(FILE * file, osl_textual_p textual, int level) { int j; char * tmp; // Go to the right level. for (j = 0; j < level; j++) fprintf(file, "|\t"); if (textual != NULL) { fprintf(file, "+-- osl_textual_t: "); // Display the textual message (without any carriage return). OSL_strdup(tmp, textual->textual); for (j = 0; j < (int)strlen(tmp); j++) if (tmp[j] == '\n') tmp[j] = ' '; if (strlen(tmp) > 40) { for (j = 0; j < 20; j++) fprintf(file, "%c", tmp[j]); fprintf(file, " ... "); for (j = (int)strlen(tmp) - 20; j < (int)strlen(tmp); j++) fprintf(file, "%c", tmp[j]); fprintf(file, "\n"); } else { fprintf(file,"%s\n", tmp); } free(tmp); } else { fprintf(file, "+-- NULL textual\n"); } // The last line. for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "\n"); } /** * osl_textual_dump function: * this function prints the content of an osl_textual_t structure * (*textual) into a file (file, possibly stdout). * \param[in] file The file where the information has to be printed. * \param[in] textual The textual structure to be printed. */ void osl_textual_dump(FILE * file, osl_textual_p textual) { osl_textual_idump(file, textual, 0); } #if 0 /** * osl_textual_sprint function: * this function prints the content of an osl_textual_t structure * (*textual) into a string (returned) in the OpenScop textual format. * \param[in] textual The textual structure to be printed. * \return A string containing the OpenScop dump of the textual structure. */ char * osl_textual_sprint(osl_textual_p textual) { char * string = NULL; if ((textual != NULL) && (textual->textual != NULL)) { if (strlen(textual->textual) > OSL_MAX_STRING) OSL_error("textual too long"); string = strdup(textual->textual); if (string == NULL) OSL_error("memory overflow"); } return string; } #else /** * osl_textual_sprint function: * this function returns NULL. This is part of the special behavior of * the textual option (printing it along with other options would double * the options...). * \param[in] textual The textual structure to be printed. * \return NULL. */ char * osl_textual_sprint(osl_textual_p textual) { return NULL; } #endif /***************************************************************************** * Reading function * *****************************************************************************/ /** * osl_textual_sread function: * this function reads a textual structure from a string complying to the * OpenScop textual format and returns a pointer to this textual structure. * The string should contain only one textual format of a textual structure. * \param[in,out] extensions The input string where to find a textual struct. * Updated to the position after what has been read. * \return A pointer to the textual structure that has been read. */ osl_textual_p osl_textual_sread(char ** extensions) { osl_textual_p textual = NULL; if (*extensions != NULL) { textual = osl_textual_malloc(); OSL_strdup(textual->textual, *extensions); // Update the input string pointer to the end of the string (since // everything has been read). *extensions = *extensions + strlen(*extensions); } return textual; } /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ /** * osl_textual_malloc function: * this function allocates the memory space for an osl_textual_t * structure and sets its fields with default values. Then it returns a * pointer to the allocated space. * \return A pointer to an empty textual structure with fields set to * default values. */ osl_textual_p osl_textual_malloc() { osl_textual_p textual; OSL_malloc(textual, osl_textual_p, sizeof(osl_textual_t)); textual->textual = NULL; return textual; } /** * osl_textual_free function: * this function frees the allocated memory for an osl_textual_t * structure. * \param[in,out] textual The pointer to the textual structure to be freed. */ void osl_textual_free(osl_textual_p textual) { if (textual != NULL) { if(textual->textual != NULL) free(textual->textual); free(textual); } } /*+*************************************************************************** * Processing functions * *****************************************************************************/ /** * osl_textual_clone function: * this function builds and returns a "hard copy" (not a pointer copy) of an * osl_textual_t data structure. * \param[in] textual The pointer to the textual structure we want to clone. * \return A pointer to the clone of the textual structure. */ osl_textual_p osl_textual_clone(osl_textual_p textual) { osl_textual_p clone; if (textual == NULL) return NULL; clone = osl_textual_malloc(); OSL_strdup(clone->textual, textual->textual); return clone; } #if 0 /** * osl_textual_equal function: * this function returns true if the two textual structures are the same * (content-wise), false otherwise. * \param f1 The first textual structure. * \param ff The second textual structure. * \return 1 if f1 and f2 are the same (content-wise), 0 otherwise. */ int osl_textual_equal(osl_textual_p f1, osl_textual_p f2) { if (f1 == f2) return 1; if (((f1 == NULL) && (f2 != NULL)) || ((f1 != NULL) && (f2 == NULL))) return 0; if (strcmp(f1->textual, f2->textual)) return 0; return 1; } #else /** * osl_textual_equal function: * this function returns 1. This is part of the special behavior of * the textual option (the text string can be easily different while the * options are actually identical. * \param[in] f1 The first textual structure. * \param[in] f2 The second textual structure. * \return 1. */ int osl_textual_equal(osl_textual_p f1, osl_textual_p f2) { return 1; } #endif /** * osl_textual_interface function: * this function creates an interface structure corresponding to the textual * extension and returns it). * \return An interface structure for the textual extension. */ osl_interface_p osl_textual_interface() { osl_interface_p interface = osl_interface_malloc(); OSL_strdup(interface->URI, OSL_URI_TEXTUAL); interface->idump = (osl_idump_f)osl_textual_idump; interface->sprint = (osl_sprint_f)osl_textual_sprint; interface->sread = (osl_sread_f)osl_textual_sread; interface->malloc = (osl_malloc_f)osl_textual_malloc; interface->free = (osl_free_f)osl_textual_free; interface->clone = (osl_clone_f)osl_textual_clone; interface->equal = (osl_equal_f)osl_textual_equal; return interface; } cloog-0.18.4/osl/source/extensions/extbody.c0000644000175000017500000003417612413270135015757 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** extensions/extbody.c ** **-----------------------------------------------------------------** ** First version: 07/12/2010 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #include #include #include #include #include #include #include #include /*+*************************************************************************** * Structure display function * *****************************************************************************/ /** * osl_extbody_idump function: * this function displays an osl_extbody_t structure (*extbody) into a * file (file, possibly stdout) in a way that trends to be understandable. It * includes an indentation level (level) in order to work with others idump * functions. * \param[in] file The file where the information has to be printed. * \param[in] ebody The ebody structure to print. * \param[in] level Number of spaces before printing, for each line. */ void osl_extbody_idump(FILE * file, osl_extbody_p ebody, int level) { int i, j; // Go to the right level. for (j = 0; j < level; j++) fprintf(file, "|\t"); if (ebody != NULL) fprintf(file, "+-- osl_extbody_t\n"); else fprintf(file, "+-- NULL extbody\n"); if (ebody != NULL) { // Go to the right level. for(j = 0; j <= level; j++) fprintf(file, "|\t"); // Display the number of ebody. fprintf(file, "nb_access: %d\n", ebody->nb_access); // Display the coordinates. for(i = 0; i < ebody->nb_access; i++) { // Go to the right level. for(j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "start: %d, length: %d\n", ebody->start[i], ebody->length[i]); } // Display the body osl_body_idump(file, ebody->body, level); } // The last line. for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "\n"); } /** * osl_extbody_dump function: * this function prints the content of an osl_extbody_t structure * (*ebody) into a file (file, possibly stdout). * \param[in] file The file where the information has to be printed. * \param[in] ebody The ebody structure to print. */ void osl_extbody_dump(FILE * file, osl_extbody_p ebody) { osl_extbody_idump(file, ebody, 0); } /** * osl_extbody_sprint function: * this function prints the content of an osl_extbody_t structure * (*ebody) into a string (returned) in the OpenScop textual format. * \param[in] ebody The ebody structure to print. * \return A string containing the OpenScop dump of the ebodystructure. */ char * osl_extbody_sprint(osl_extbody_p ebody) { int i; int high_water_mark = OSL_MAX_STRING; char * string = NULL, * body_string = NULL; char buffer[OSL_MAX_STRING]; if (ebody != NULL) { OSL_malloc(string, char *, high_water_mark * sizeof(char)); string[0] = '\0'; sprintf(buffer, "# Number of accesses\n"); osl_util_safe_strcat(&string, buffer, &high_water_mark); sprintf(buffer, "%d\n", ebody->nb_access); osl_util_safe_strcat(&string, buffer, &high_water_mark); if (ebody->nb_access) { sprintf(buffer, "# Access coordinates (start/length)\n"); osl_util_safe_strcat(&string, buffer, &high_water_mark); } for (i = 0; i < ebody->nb_access; i++) { sprintf(buffer, "%d %d\n", ebody->start[i], ebody->length[i]); osl_util_safe_strcat(&string, buffer, &high_water_mark); } body_string = osl_body_sprint(ebody->body); osl_util_safe_strcat(&string, body_string, &high_water_mark); free(body_string); } return string; } /***************************************************************************** * Reading function * *****************************************************************************/ /** * osl_extbody_sread function: * this function reads an extbody structure from a string complying * to the OpenScop textual format and returns a pointer to this * extbody structure. The string should contain only one textual * format of an extbody structure. The input parameter is updated to * the position in the input string this function reach right after reading the * comment structure. * \param[in,out] input The input string where to find an extbody * structure. * Updated to the position after what has been read. * \return A pointer to the extbody structure that has been read. */ osl_extbody_p osl_extbody_sread(char ** input) { int k; int nb_access; osl_extbody_p ebody; if (input == NULL) { OSL_debug("no extbody optional tag"); return NULL; } // Find the number of ebody provided. nb_access = osl_util_read_int(NULL, input); // Allocate the array of start and length. ebody = osl_extbody_malloc(); OSL_malloc(ebody->start, int *, nb_access * sizeof(int)); OSL_malloc(ebody->length, int *, nb_access * sizeof(int)); ebody->nb_access = nb_access; // Get each array start/length. for (k = 0; k < nb_access; k++) { ebody->start[k] = osl_util_read_int(NULL, input); ebody->length[k] = osl_util_read_int(NULL, input); } // Read simple body. ebody->body = osl_body_sread(input); return ebody; } /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ /** * osl_extbody_malloc function: * this function allocates the memory space for an osl_extbody_t * structure and sets its fields with default values. Then it returns a * pointer to the allocated space. * \return A pointer to an empty extbody structure with fields set to * default values. */ osl_extbody_p osl_extbody_malloc() { osl_extbody_p ebody; OSL_malloc(ebody, osl_extbody_p, sizeof(osl_extbody_t)); ebody->nb_access = 0; ebody->start = NULL; ebody->length = NULL; ebody->body = NULL; return ebody; } /** * osl_extbody_free function: * this function frees the allocated memory for an ebody structure. * \param[in,out] ebody The pointer to the extbody structure we want to free. */ void osl_extbody_free(osl_extbody_p ebody) { if (ebody != NULL) { free(ebody->start); free(ebody->length); osl_body_free(ebody->body); free(ebody); } } /*+*************************************************************************** * Processing functions * *****************************************************************************/ /** * osl_extbody_clone function: * this function builds and returns a "hard copy" (not a pointer copy) of an * osl_extbody_t data structure. * \param[in] ebody The pointer to the extbody structure to clone. * \return A pointer to the clone of the extbody structure. */ osl_extbody_p osl_extbody_clone(osl_extbody_p ebody) { int i; osl_extbody_p clone; if (ebody == NULL) return NULL; clone = osl_extbody_malloc(); clone->nb_access = ebody->nb_access; OSL_malloc(clone->start, int *, ebody->nb_access * sizeof(int)); OSL_malloc(clone->length, int *, ebody->nb_access * sizeof(int)); for (i = 0; i < ebody->nb_access; i++) { clone->start[i] = ebody->start[i]; clone->length[i] = ebody->length[i]; } clone->body = osl_body_clone(ebody->body); return clone; } /** * osl_extbody_equal function: * this function returns true if the two extbody structures are the * same (content-wise), false otherwise. This functions considers two * extbody structures as equal if the order of the array start/length * differ, however the identifiers, start and length must be the same. * \param[in] e1 The first extbody structure. * \param[in] e2 The second extbody structure. * \return 1 if e1 and e2 are the same (content-wise), 0 otherwise. */ int osl_extbody_equal(osl_extbody_p e1, osl_extbody_p e2) { int i, j, found; if (e1 == e2) return 1; if (((e1 == NULL) && (e2 != NULL)) || ((e1 != NULL) && (e2 == NULL))) { OSL_info("extbody are not the same"); return 0; } // Check whether the number of ebody is the same. if (e1->nb_access != e2->nb_access) { OSL_info("extbody are not the same"); return 0; } // We accept a different order of the start/length, as long as the // identifiers are the same. for (i = 0; i < e1->nb_access; i++) { found = 0; for (j = 0; j < e2->nb_access; j++) { if ((e1->start[i] == e2->start[j]) && (e1->length[i] == e2->length[j])) { found = 1; break; } } if (found != 1) { OSL_info("extbody are not the same"); return 0; } } return osl_body_equal(e1->body, e2->body); } /** * osl_extbody_interface function: * this function creates an interface structure corresponding to the * extbody extension and returns it. * \return An interface structure for the extbody extension. */ osl_interface_p osl_extbody_interface() { osl_interface_p interface = osl_interface_malloc(); OSL_strdup(interface->URI, OSL_URI_EXTBODY); interface->idump = (osl_idump_f)osl_extbody_idump; interface->sprint = (osl_sprint_f)osl_extbody_sprint; interface->sread = (osl_sread_f)osl_extbody_sread; interface->malloc = (osl_malloc_f)osl_extbody_malloc; interface->free = (osl_free_f)osl_extbody_free; interface->clone = (osl_clone_f)osl_extbody_clone; interface->equal = (osl_equal_f)osl_extbody_equal; return interface; } /** * osl_extbody_add function: * This function add an entry in the list of coordinates */ void osl_extbody_add(osl_extbody_p ebody, int start, int length) { ebody->nb_access++; OSL_realloc(ebody->start, int*, sizeof(int) * ebody->nb_access); OSL_realloc(ebody->length, int*, sizeof(int) * ebody->nb_access); ebody->start[ebody->nb_access-1] = start; ebody->length[ebody->nb_access-1] = length; } cloog-0.18.4/osl/source/extensions/coordinates.c0000644000175000017500000003412712413270135016607 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** extensions/coordinates.c ** **-----------------------------------------------------------------** ** First version: 07/12/2010 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #include #include #include #include #include #include #include /*+*************************************************************************** * Structure display function * *****************************************************************************/ /** * osl_coordinates_idump function: * this function displays an osl_coordinates_t structure (*coordinates) into a * file (file, possibly stdout) in a way that trends to be understandable. It * includes an indentation level (level) in order to work with others * idump functions. * \param file The file where the information has to be printed. * \param coordinates The coordinates structure to print. * \param level Number of spaces before printing, for each line. */ void osl_coordinates_idump(FILE* file, osl_coordinates_p coordinates, int level) { int j; // Go to the right level. for (j = 0; j < level; j++) fprintf(file, "|\t"); if (coordinates != NULL) fprintf(file, "+-- osl_coordinates_t\n"); else fprintf(file, "+-- NULL coordinates\n"); if (coordinates != NULL) { // Go to the right level. for(j = 0; j <= level; j++) fprintf(file, "|\t"); // Display the file name. if (coordinates->name != NULL) fprintf(file, "File name__: %s\n", coordinates->name); else fprintf(file, "NULL file name\n"); // Go to the right level. for(j = 0; j <= level; j++) fprintf(file, "|\t"); // Display the lines. fprintf(file, "Coordinates: [%d,%d -> %d,%d]\n", coordinates->line_start, coordinates->column_start, coordinates->line_end, coordinates->column_end); // Go to the right level. for(j = 0; j <= level; j++) fprintf(file, "|\t"); // Display the indentation. fprintf(file, "Indentation: %d\n", coordinates->indent); } // The last line. for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "\n"); } /** * osl_coordinates_dump function: * this function prints the content of an osl_coordinates_t structure * (*coordinates) into a file (file, possibly stdout). * \param file The file where the information has to be printed. * \param coordinates The coordinates structure to print. */ void osl_coordinates_dump(FILE* file, osl_coordinates_p coordinates) { osl_coordinates_idump(file, coordinates, 0); } /** * osl_coordinates_sprint function: * this function prints the content of an osl_coordinates_t structure * (*coordinates) into a string (returned) in the OpenScop textual format. * \param coordinates The coordinates structure to be print. * \return A string containing the OpenScop dump of the coordinates structure. */ char* osl_coordinates_sprint(osl_coordinates_p coordinates) { int high_water_mark = OSL_MAX_STRING; char* string = NULL; char buffer[OSL_MAX_STRING]; if (coordinates != NULL) { OSL_malloc(string, char*, high_water_mark * sizeof(char)); string[0] = '\0'; // Print the coordinates content. sprintf(buffer, "# File name\n%s\n", coordinates->name); osl_util_safe_strcat(&string, buffer, &high_water_mark); sprintf(buffer, "# Starting line and column\n%d %d\n", coordinates->line_start, coordinates->column_start); osl_util_safe_strcat(&string, buffer, &high_water_mark); sprintf(buffer, "# Ending line and column\n%d %d\n", coordinates->line_end, coordinates->column_end); osl_util_safe_strcat(&string, buffer, &high_water_mark); sprintf(buffer, "# Indentation\n%d\n", coordinates->indent); osl_util_safe_strcat(&string, buffer, &high_water_mark); // Keep only the memory space we need. OSL_realloc(string, char*, (strlen(string) + 1) * sizeof(char)); } return string; } /***************************************************************************** * Reading function * *****************************************************************************/ /** * osl_coordinates_sread function: * this function reads a coordinates structure from a string complying to the * OpenScop textual format and returns a pointer to this structure. * The input parameter is updated to the position in the input string this * function reach right after reading the coordinates structure. * \param[in,out] input The input string where to find coordinates. * Updated to the position after what has been read. * \return A pointer to the coordinates structure that has been read. */ osl_coordinates_p osl_coordinates_sread(char** input) { osl_coordinates_p coordinates; if (*input == NULL) { OSL_debug("no coordinates optional tag"); return NULL; } // Build the coordinates structure. coordinates = osl_coordinates_malloc(); // Read the file name (and path). coordinates->name = osl_util_read_line(NULL, input); // Read the coordinates. coordinates->line_start = osl_util_read_int(NULL, input); coordinates->column_start = osl_util_read_int(NULL, input); coordinates->line_end = osl_util_read_int(NULL, input); coordinates->column_end = osl_util_read_int(NULL, input); // Read the indentation level. coordinates->indent = osl_util_read_int(NULL, input); return coordinates; } /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ /** * osl_coordinates_malloc function: * this function allocates the memory space for an osl_coordinates_t * structure and sets its fields with default values. Then it returns a * pointer to the allocated space. * \return A pointer to an empty coordinates structure with fields set to * default values. */ osl_coordinates_p osl_coordinates_malloc() { osl_coordinates_p coordinates; OSL_malloc(coordinates, osl_coordinates_p, sizeof(osl_coordinates_t)); coordinates->name = NULL; coordinates->line_start = OSL_UNDEFINED; coordinates->column_start = OSL_UNDEFINED; coordinates->line_end = OSL_UNDEFINED; coordinates->column_end = OSL_UNDEFINED; coordinates->indent = OSL_UNDEFINED; return coordinates; } /** * osl_coordinates_free function: * this function frees the allocated memory for an osl_coordinates_t * structure. * \param coordinates The pointer to the coordinates structure to free. */ void osl_coordinates_free(osl_coordinates_p coordinates) { if (coordinates != NULL) { free(coordinates->name); free(coordinates); } } /*+*************************************************************************** * Processing functions * *****************************************************************************/ /** * osl_coordinates_clone function: * this function builds and returns a "hard copy" (not a pointer copy) of an * osl_coordinates_t data structure. * \param coordinates The pointer to the coordinates structure to clone. * \return A pointer to the clone of the coordinates structure. */ osl_coordinates_p osl_coordinates_clone(osl_coordinates_p coordinates) { osl_coordinates_p clone; if (coordinates == NULL) return NULL; clone = osl_coordinates_malloc(); OSL_strdup(clone->name, coordinates->name); clone->line_start = coordinates->line_start; clone->column_start = coordinates->column_start; clone->line_end = coordinates->line_end; clone->column_end = coordinates->column_end; clone->indent = coordinates->indent; return clone; } /** * osl_coordinates_equal function: * this function returns true if the two coordinates structures are the same * (content-wise), false otherwise. This functions considers two coordinates * \param c1 The first coordinates structure. * \param c2 The second coordinates structure. * \return 1 if c1 and c2 are the same (content-wise), 0 otherwise. */ int osl_coordinates_equal(osl_coordinates_p c1, osl_coordinates_p c2) { if (c1 == c2) return 1; if (((c1 == NULL) && (c2 != NULL)) || ((c1 != NULL) && (c2 == NULL))) return 0; if (strcmp(c1->name, c2->name)) { OSL_info("file names are not the same"); return 0; } if (c1->line_start != c2->line_start) { OSL_info("starting lines are not the same"); return 0; } if (c1->column_start != c2->column_start) { OSL_info("starting columns are not the same"); return 0; } if (c1->line_end != c2->line_end) { OSL_info("Ending lines are not the same"); return 0; } if (c1->column_end != c2->column_end) { OSL_info("Ending columns are not the same"); return 0; } if (c1->indent != c2->indent) { OSL_info("indentations are not the same"); return 0; } return 1; } /** * osl_coordinates_interface function: * this function creates an interface structure corresponding to the coordinates * extension and returns it). * \return An interface structure for the coordinates extension. */ osl_interface_p osl_coordinates_interface() { osl_interface_p interface = osl_interface_malloc(); OSL_strdup(interface->URI, OSL_URI_COORDINATES); interface->idump = (osl_idump_f)osl_coordinates_idump; interface->sprint = (osl_sprint_f)osl_coordinates_sprint; interface->sread = (osl_sread_f)osl_coordinates_sread; interface->malloc = (osl_malloc_f)osl_coordinates_malloc; interface->free = (osl_free_f)osl_coordinates_free; interface->clone = (osl_clone_f)osl_coordinates_clone; interface->equal = (osl_equal_f)osl_coordinates_equal; return interface; } cloog-0.18.4/osl/source/extensions/null.c0000644000175000017500000002446212413270135015250 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** extensions/null.c ** **-----------------------------------------------------------------** ** First version: 28/06/2012 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #include #include #include #include #include #include #include /*+*************************************************************************** * Structure display function * *****************************************************************************/ /** * osl_null_idump function: * this function displays an osl_null_t structure (*null) into a * file (file, possibly stdout) in a way that trends to be understandable. It * includes an indentation level (level) in order to work with others * idump functions. * \param[in] file The file where the information has to be printed. * \param[in] null The null structure to print. * \param[in] level Number of spaces before printing, for each line. */ void osl_null_idump(FILE * file, osl_null_p null, int level) { int j; // Go to the right level. for (j = 0; j < level; j++) fprintf(file, "|\t"); if (null != NULL) fprintf(file, "+-- osl_null_t\n"); else fprintf(file, "+-- NULL null\n"); // The last line. for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "\n"); } /** * osl_null_dump function: * this function prints the content of an osl_null_t structure * (*null) into a file (file, possibly stdout). * \param[in] file The file where the information has to be printed. * \param[in] null The null structure to print. */ void osl_null_dump(FILE * file, osl_null_p null) { osl_null_idump(file, null, 0); } /** * osl_null_sprint function: * this function prints the content of an osl_null_t structure * (*null) into a string (returned) in the OpenScop textual format. * \param[in] null The null structure to print. * \return A string containing the OpenScop dump of the null structure. */ char * osl_null_sprint(osl_null_p null) { char * string = NULL; if (null != NULL) { // Print nothing. OSL_malloc(string, char *, sizeof(char)); string[0] = '\0'; } return string; } /***************************************************************************** * Reading function * *****************************************************************************/ /** * osl_null_sread function: * this function reads a null structure from a string complying to the * OpenScop textual format and returns a pointer to this null structure. * The input parameter is updated to the position in the input string this * function reach right after reading the null structure. * \param[in,out] input The input string where to find a null. * Updated to the position after what has been read. * \return A pointer to the null structure that has been read. */ osl_null_p osl_null_sread(char ** input) { osl_null_p null; if (*input == NULL) { OSL_debug("no null optional tag"); return NULL; } // Build the null structure null = osl_null_malloc(); // Update the input pointer (everything has been read and ignored). input += strlen(*input); return null; } /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ /** * osl_null_malloc function: * this function allocates the memory space for an osl_null_t * structure and sets its fields with default values. Then it returns a * pointer to the allocated space. * \return A pointer to an empty null structure with fields set to * default values. */ osl_null_p osl_null_malloc() { osl_null_p null; OSL_malloc(null, osl_null_p, sizeof(osl_null_t)); return null; } /** * osl_null_free function: * this function frees the allocated memory for an osl_null_t * structure. * \param[in,out] null The pointer to the null structure to free. */ void osl_null_free(osl_null_p null) { if (null != NULL) { free(null); } } /*+*************************************************************************** * Processing functions * *****************************************************************************/ /** * osl_null_clone function: * this function builds and returns a "hard copy" (not a pointer copy) of an * osl_null_t data structure. * \param[in] null The pointer to the null structure to clone. * \return A pointer to the clone of the null structure. */ osl_null_p osl_null_clone(osl_null_p null) { osl_null_p clone; if (null == NULL) return NULL; clone = osl_null_malloc(); return clone; } /** * osl_null_equal function: * this function returns true if the two null structures are the same * (content-wise), false otherwise. * \param[in] c1 The first null structure. * \param[in] c2 The second null structure. * \return 1 if c1 and c2 are the same (content-wise), 0 otherwise. */ int osl_null_equal(osl_null_p c1, osl_null_p c2) { if (c1 == c2) return 1; if (((c1 == NULL) && (c2 != NULL)) || ((c1 != NULL) && (c2 == NULL))) { OSL_info("nulls are not the same"); return 0; } return 1; } /** * osl_null_interface function: * this function creates an interface structure corresponding to the null * extension and returns it). * \return An interface structure for the null extension. */ osl_interface_p osl_null_interface() { osl_interface_p interface = osl_interface_malloc(); OSL_strdup(interface->URI, OSL_URI_NULL); interface->idump = (osl_idump_f)osl_null_idump; interface->sprint = (osl_sprint_f)osl_null_sprint; interface->sread = (osl_sread_f)osl_null_sread; interface->malloc = (osl_malloc_f)osl_null_malloc; interface->free = (osl_free_f)osl_null_free; interface->clone = (osl_clone_f)osl_null_clone; interface->equal = (osl_equal_f)osl_null_equal; return interface; } cloog-0.18.4/osl/source/extensions/scatnames.c0000644000175000017500000002626312413270135016255 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** extensions/scatnames.c ** **-----------------------------------------------------------------** ** First version: 03/12/2011 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #include #include #include #include #include #include #include #include /*+*************************************************************************** * Structure display function * *****************************************************************************/ /** * osl_scatnames_idump function: * this function displays an osl_scatnames_t structure (*scatnames) into a * file (file, possibly stdout) in a way that trends to be understandable. It * includes an indentation level (level) in order to work with others * idump functions. * \param[in] file The file where the information has to be printed. * \param[in] scatnames Scatnames structure to print. * \param[in] level Number of spaces before printing, for each line. */ void osl_scatnames_idump(FILE * file, osl_scatnames_p scatnames, int level) { int j; // Go to the right level. for (j = 0; j < level; j++) fprintf(file, "|\t"); if (scatnames != NULL) fprintf(file, "+-- osl_scatnames_t\n"); else fprintf(file, "+-- NULL scatnames\n"); if (scatnames != NULL) { // Go to the right level. for(j = 0; j <= level + 1; j++) fprintf(file, "|\t"); fprintf(file, "\n"); // Display the list of scattering names. osl_strings_idump(file, scatnames->names, level + 1); } // The last line. for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "\n"); } /** * osl_scatnames_dump function: * this function prints the content of an osl_scatnames_t structure * (*scatnames) into a file (file, possibly stdout). * \param[in] file The file where the information has to be printed. * \param[in] scatnames The scatnames structure to print. */ void osl_scatnames_dump(FILE * file, osl_scatnames_p scatnames) { osl_scatnames_idump(file, scatnames, 0); } /** * osl_scatnames_sprint function: * this function prints the content of an osl_scatnames_t structure * (*scatnames) into a string (returned) in the OpenScop textual format. * \param[in] scatnames The scatnames structure to print. * \return A string containing the OpenScop dump of the scatnames structure. */ char * osl_scatnames_sprint(osl_scatnames_p scatnames) { return osl_strings_sprint(scatnames->names); } /***************************************************************************** * Reading function * *****************************************************************************/ /** * osl_scatnames_sread function: * this function reads a scatnames structure from a string complying to the * OpenScop textual format and returns a pointer to this scatnames structure. * The input parameter is updated to the position in the input string this * function reach right after reading the scatnames structure. If there * is nothing to read, the function returns NULL. * \param[in,out] input The input string where to find a scatnames. * Updated to the position after what has been read. * \return A pointer to the scatnames structure that has been read. */ osl_scatnames_p osl_scatnames_sread(char ** input) { osl_scatnames_p scatnames = NULL; osl_strings_p names = NULL; if (*input == NULL) { OSL_debug("no scatnames optional tag"); return NULL; } // Build the scatnames structure names = osl_strings_sread(input); if (names != NULL) { scatnames = osl_scatnames_malloc(); scatnames->names = names; } return scatnames; } /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ /** * osl_scatnames_malloc function: * this function allocates the memory space for an osl_scatnames_t * structure and sets its fields with default values. Then it returns a * pointer to the allocated space. * \return A pointer to an empty scatnames structure with fields set to * default values. */ osl_scatnames_p osl_scatnames_malloc() { osl_scatnames_p scatnames; OSL_malloc(scatnames, osl_scatnames_p, sizeof(osl_scatnames_t)); scatnames->names = NULL; return scatnames; } /** * osl_scatnames_free function: * this function frees the allocated memory for an osl_scatnames_t * structure. * \param[in,out] scatnames The pointer to the scatnames structure to free. */ void osl_scatnames_free(osl_scatnames_p scatnames) { if (scatnames != NULL) { osl_strings_free(scatnames->names); free(scatnames); } } /*+*************************************************************************** * Processing functions * *****************************************************************************/ /** * osl_scatnames_clone function: * This function builds and returns a "hard copy" (not a pointer copy) of an * osl_scatnames_t data structure. * \param[in] scatnames The pointer to the scatnames structure to clone. * \return A pointer to the clone of the scatnames structure. */ osl_scatnames_p osl_scatnames_clone(osl_scatnames_p scatnames) { osl_scatnames_p clone; if (scatnames == NULL) return NULL; clone = osl_scatnames_malloc(); clone->names = osl_strings_clone(scatnames->names); return clone; } /** * osl_scatnames_equal function: * this function returns true if the two scatnames structures are the same * (content-wise), false otherwise. * \param[in] s1 The first scatnames structure. * \param[in] s2 The second scatnames structure. * \return 1 if s1 and s2 are the same (content-wise), 0 otherwise. */ int osl_scatnames_equal(osl_scatnames_p s1, osl_scatnames_p s2) { if (s1 == s2) return 1; if (((s1 == NULL) && (s2 != NULL)) || ((s1 != NULL) && (s2 == NULL))) return 0; if (!osl_strings_equal(s1->names, s2->names)) return 0; return 1; } /** * osl_scatnames_interface function: * this function creates an interface structure corresponding to the scatnames * extension and returns it). * \return An interface structure for the scatnames extension. */ osl_interface_p osl_scatnames_interface() { osl_interface_p interface = osl_interface_malloc(); OSL_strdup(interface->URI, OSL_URI_SCATNAMES); interface->idump = (osl_idump_f)osl_scatnames_idump; interface->sprint = (osl_sprint_f)osl_scatnames_sprint; interface->sread = (osl_sread_f)osl_scatnames_sread; interface->malloc = (osl_malloc_f)osl_scatnames_malloc; interface->free = (osl_free_f)osl_scatnames_free; interface->clone = (osl_clone_f)osl_scatnames_clone; interface->equal = (osl_equal_f)osl_scatnames_equal; return interface; } cloog-0.18.4/osl/source/extensions/pluto_unroll.c0000644000175000017500000003625712413270135017041 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** extensions/pluto_unroll.c ** **-----------------------------------------------------------------** ** First version: 26/06/2014 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2014 Inria * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #include #include #include "../include/osl/extensions/pluto_unroll.h" #include "../include/osl/macros.h" /*+*************************************************************************** * Structure display function * *****************************************************************************/ /** * osl_loop_idump function: * this function displays an osl_pluto_unroll_t structure (pluto_unroll) into a * file (file, possibly stdout) in a way that trends to be understandable. It * includes an indentation level (level) in order to work with others * idump functions. * * \param[in] file The file where the information has to be printed. * \param[in] pluto_unroll The pluto_unroll structure to print. * \param[in] level Number of spaces before printing, for each line. */ void osl_pluto_unroll_idump(FILE * file, osl_pluto_unroll_p pluto_unroll, int level) { int j, first = 1, number=1; // Go to the right level. for (j = 0; j < level; j++) fprintf(file, "|\t"); if (pluto_unroll != NULL) fprintf(file, "+-- osl_pluto_unroll_t\n"); else fprintf(file, "+-- NULL pluto_unroll\n"); while (pluto_unroll != NULL) { // Go to the right level. if (!first) { // Go to the right level. for (j = 0; j < level; j++) fprintf(file, "|\t"); fprintf(file, "| osl_pluto_unroll_t (node %d)\n", number); } else { first = 0; } // A blank line. for (j = 0; j <= level+1; j++) fprintf(file, "|\t"); fprintf(file, "\n"); // Display the names of iterators. for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "+--iterator: %s\n", pluto_unroll->iter); // Display the names of iterators. for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "+--jam: %i\n", pluto_unroll->jam); // Display the names of iterators. for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "+--factor: %i\n", pluto_unroll->factor); pluto_unroll = pluto_unroll->next; // Next line. if (pluto_unroll != NULL) { for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "V\n"); } } // The last line. for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "\n"); } /** * osl_pluto_unroll_dump function: * this function prints the content of an osl_pluto_unroll_t structure * (*pluto_unroll) into a file (file, possibly stdout). * * \param[in] file The file where the information has to be printed. * \param[in] pluto_unroll The pluto_unroll structure to print. */ void osl_pluto_unroll_dump(FILE * file, osl_pluto_unroll_p pluto_unroll) { osl_pluto_unroll_idump(file, pluto_unroll, 0); } /** * osl_pluto_unroll_sprint function: * this function prints the content of an osl_pluto_unroll_t structure * (*pluto_unroll) into a string (returned) in the OpenScop textual format. * * \param[in] pluto_unroll The loop structure to print. * * \return a string containing the OpenScop dump of the loop structure. */ char * osl_pluto_unroll_sprint(osl_pluto_unroll_p pluto_unroll) { char* string = NULL; char buffer[OSL_MAX_STRING] = { 0 }; strcat(buffer, "# Pluto unroll\n"); if (pluto_unroll != NULL) { strcat(buffer, "1\n"); } else { strcat(buffer, "0\n"); } while (pluto_unroll != NULL) { strcat(buffer, "# Iterator name\n"); sprintf(buffer + strlen(buffer), "%s\n", pluto_unroll->iter); strcat(buffer, "# Jam\n"); sprintf(buffer + strlen(buffer), "%i\n", pluto_unroll->jam); strcat(buffer, "# Factor\n"); sprintf(buffer + strlen(buffer), "%i\n", pluto_unroll->factor); pluto_unroll = pluto_unroll->next; strcat(buffer, "# Next\n"); if (pluto_unroll != NULL) { strcat(buffer, "1\n"); } else { strcat(buffer, "0\n"); } } OSL_realloc(string, char*, (strlen(buffer) + 1) * sizeof(char)); strcpy(string, buffer); return string; } /***************************************************************************** * Reading function * *****************************************************************************/ /** * osl_pluto_unroll_sread function: * this function reads a pluto_unroll structure from a string complying to the * OpenScop textual format and returns a pointer to this pluto_unroll structure. * The input parameter is updated to the position in the input string this * function reaches right after reading the comment structure. * * \param[in,out] input The input string where to find an pluto_unroll * structure. * Updated to the position after what has been read. * * \return a pointer to the pluto_unroll structure that has been read. */ osl_pluto_unroll_p osl_pluto_unroll_sread(char** input) { osl_pluto_unroll_p p = NULL; if (osl_util_read_int(NULL, input) == 1) { p = osl_pluto_unroll_malloc(); } osl_pluto_unroll_p r = p; while (p != NULL) { // iter p->iter = osl_util_read_line(NULL, input); // jam p->jam = osl_util_read_int(NULL, input); // factor p->factor = osl_util_read_int(NULL, input); // Next if (osl_util_read_int(NULL, input) == 1) { p->next = osl_pluto_unroll_malloc(); } p = p->next; } return r; } /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ /** * osl_pluto_unroll_malloc function: * this function allocates the memory space for an osl_pluto_unroll_t * structure and sets its fields with default values. Then it returns a * pointer to the allocated space. * * \return a pointer to an empty pluto_unroll structure with fields set to * default values. */ osl_pluto_unroll_p osl_pluto_unroll_malloc() { osl_pluto_unroll_p pluto_unroll = NULL; OSL_malloc(pluto_unroll, osl_pluto_unroll_p, sizeof(osl_pluto_unroll_t)); pluto_unroll->iter = NULL; pluto_unroll->jam = false; pluto_unroll->factor = 0; pluto_unroll->next = NULL; return pluto_unroll; } /** * osl_pluto_unroll_free function: * this function frees the allocated memory for an pluto_unroll structure. * * \param[in,out] pluto_unroll The pointer to the pluto_unroll structure * we want to free. */ void osl_pluto_unroll_free(osl_pluto_unroll_p pluto_unroll) { if (pluto_unroll != NULL) { osl_pluto_unroll_free(pluto_unroll->next); free(pluto_unroll->iter); free(pluto_unroll); pluto_unroll = NULL; } } /*+*************************************************************************** * Processing functions * *****************************************************************************/ /** * osl_pluto_unroll_fill function: * this function fill the osl_pluto_unroll_t with the iterator name, * if jam or not and the unroll factor * * \param[in] pluto_unroll The pointer to the osl_pluto_unroll_t * \param[in] jam true if jam, falsee otherwise * \param[in] factor Unroll factor */ void osl_pluto_unroll_fill(osl_pluto_unroll_p pluto_unroll, char const * const iterator_name, bool const jam, int const factor) { if (pluto_unroll != NULL) { // iter if (iterator_name != NULL) { OSL_realloc(pluto_unroll->iter, char*, (strlen(iterator_name) + 1) * sizeof(char)); strcpy(pluto_unroll->iter, iterator_name); } // jam pluto_unroll->jam = jam; // factor pluto_unroll->factor = factor; } else { OSL_warning("osl_pluto_unroll_fill can not fill NULL osl_pluto_unroll_p"); } } /** * osl_pluto_unroll_clone function: * this function builds and returns a "hard copy" (not a pointer copy) of a * list of osl_pluto_unroll_t data structures. * * \param[in] pluto_unroll The pointer to the list of pluto_unroll structure to * clone. * * \return a pointer to the clone of list of the pluto_unroll structure. */ osl_pluto_unroll_p osl_pluto_unroll_clone(osl_pluto_unroll_p pluto_unroll) { osl_pluto_unroll_p p = NULL; if (pluto_unroll != NULL) { p = osl_pluto_unroll_malloc(); } osl_pluto_unroll_p r = p; while (pluto_unroll != NULL) { osl_pluto_unroll_fill(p, pluto_unroll->iter, pluto_unroll->jam, pluto_unroll->factor); pluto_unroll = pluto_unroll->next; if (pluto_unroll != NULL) { p->next = osl_pluto_unroll_malloc(); } p = p->next; } return r; } /** * osl_pluto_unroll_equal function: * this function returns true if the two pluto_unroll lists are the same * (content-wise), false otherwise. Two lists are equal if one contains * all the elements of the other and vice versa. The exact order of the * nodes is not taken into account by this function. * * \param[in] a The first pluto_unroll list. * \param[in] b The second pluto_unroll list. * * \return 1 if a and b are the same (content-wise), 0 otherwise. */ int osl_pluto_unroll_equal(osl_pluto_unroll_p a, osl_pluto_unroll_p b) { if (a == b) { return 1; } if (a == NULL && b != NULL) { return 0; } if (a != NULL && b == NULL) { return 0; } while (a != NULL) { // Iter if (a->iter == NULL && b->iter != NULL) { return 0; } if (a->iter != NULL && b->iter == NULL) { return 0; } if (a->iter != NULL) { if (strcmp(a->iter, b->iter) != 0) { return 0; } } // Jam if (a->jam != b->jam) { return 0; } // Factor if (a->factor != b->factor) { return 0; } // Next if (a->next == b->next) { return 1; } if (a->next == NULL && b->next != NULL) { return 0; } if (a->next != NULL && b->next == NULL) { return 0; } a = a->next; b = b->next; } return 1; } /** * osl_pluto_unroll_interface function: * this function creates an interface structure corresponding to the * pluto_unroll extension and returns it. * * \return an interface structure for the pluto_unroll extension. */ osl_interface_p osl_pluto_unroll_interface() { osl_interface_p interface = osl_interface_malloc(); OSL_strdup(interface->URI, OSL_URI_PLUTO_UNROLL); interface->idump = (osl_idump_f)osl_pluto_unroll_idump; interface->sprint = (osl_sprint_f)osl_pluto_unroll_sprint; interface->sread = (osl_sread_f)osl_pluto_unroll_sread; interface->malloc = (osl_malloc_f)osl_pluto_unroll_malloc; interface->free = (osl_free_f)osl_pluto_unroll_free; interface->clone = (osl_clone_f)osl_pluto_unroll_clone; interface->equal = (osl_equal_f)osl_pluto_unroll_equal; return interface; } cloog-0.18.4/osl/source/extensions/clay.c0000644000175000017500000002702212413270135015221 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** extensions/clay.c ** **-----------------------------------------------------------------** ** First version: 09/05/2012 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #include #include #include #include #include #include #include /*+*************************************************************************** * Structure display function * *****************************************************************************/ /** * osl_clay_idump function: * this function displays an osl_clay_t structure (*clay) into a * file (file, possibly stdout) in a way that trends to be understandable. It * includes an indentation level (level) in order to work with others * idump functions. * \param[in] file The file where the information has to be printed. * \param[in] clay The clay structure to print. * \param[in] level Number of spaces before printing, for each line. */ void osl_clay_idump(FILE * file, osl_clay_p clay, int level) { int j; size_t l; char * tmp; // Go to the right level. for (j = 0; j < level; j++) fprintf(file, "|\t"); if (clay != NULL) fprintf(file, "+-- osl_clay_t\n"); else fprintf(file, "+-- NULL clay\n"); if (clay != NULL) { // Go to the right level. for(j = 0; j <= level; j++) fprintf(file, "|\t"); // Display the clay script (without any carriage return). OSL_strdup(tmp, clay->script); for (l = 0; l < strlen(tmp); l++) if (tmp[l] == '\n') tmp[l] = ' '; fprintf(file, "script: %s\n", tmp); free(tmp); } // The last line. for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "\n"); } /** * osl_clay_dump function: * this function prints the content of an osl_clay_t structure * (*clay) into a file (file, possibly stdout). * \param[in] file The file where the information has to be printed. * \param[in] clay The clay structure to print. */ void osl_clay_dump(FILE * file, osl_clay_p clay) { osl_clay_idump(file, clay, 0); } /** * osl_clay_sprint function: * this function prints the content of an osl_clay_t structure * (*clay) into a string (returned) in the OpenScop textual format. * \param[in] clay The clay structure to print. * \return A string containing the OpenScop dump of the clay structure. */ char * osl_clay_sprint(osl_clay_p clay) { int high_water_mark = OSL_MAX_STRING; char * string = NULL; char buffer[OSL_MAX_STRING]; if (clay != NULL) { OSL_malloc(string, char *, high_water_mark * sizeof(char)); string[0] = '\0'; // Print the clay. sprintf(buffer, "%s", clay->script); osl_util_safe_strcat(&string, buffer, &high_water_mark); // Keep only the memory space we need. OSL_realloc(string, char *, (strlen(string) + 1) * sizeof(char)); } return string; } /***************************************************************************** * Reading function * *****************************************************************************/ /** * osl_clay_sread function: * this function reads a clay structure from a string complying to the * OpenScop textual format and returns a pointer to this clay structure. * The input parameter is updated to the position in the input string this * function reach right after reading the clay structure. * \param[in,out] input The input string where to find a clay. * Updated to the position after what has been read. * \return A pointer to the clay structure that has been read. */ osl_clay_p osl_clay_sread(char ** input) { osl_clay_p clay; char * script; if (*input == NULL) { OSL_debug("no clay optional tag"); return NULL; } if (strlen(*input) > OSL_MAX_STRING) OSL_error("clay script too long"); // Build the clay structure clay = osl_clay_malloc(); script = *input; // Pass the carriage returns (this allows to remove those inserted by // osl_generic_print), and copy the textual script. while (*script && (*script == '\n')) script++; OSL_strdup(clay->script, script); // Update the input pointer (everything has been read). input += strlen(*input); return clay; } /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ /** * osl_clay_malloc function: * this function allocates the memory space for an osl_clay_t * structure and sets its fields with default values. Then it returns a * pointer to the allocated space. * \return A pointer to an empty clay structure with fields set to * default values. */ osl_clay_p osl_clay_malloc() { osl_clay_p clay; OSL_malloc(clay, osl_clay_p, sizeof(osl_clay_t)); clay->script = NULL; return clay; } /** * osl_clay_free function: * this function frees the allocated memory for an osl_clay_t * structure. * \param[in,out] clay The pointer to the clay structure to free. */ void osl_clay_free(osl_clay_p clay) { if (clay != NULL) { if(clay->script != NULL) free(clay->script); free(clay); } } /*+*************************************************************************** * Processing functions * *****************************************************************************/ /** * osl_clay_clone function: * this function builds and returns a "hard copy" (not a pointer copy) of an * osl_clay_t data structure. * \param[in] clay The pointer to the clay structure to clone. * \return A pointer to the clone of the clay structure. */ osl_clay_p osl_clay_clone(osl_clay_p clay) { osl_clay_p clone; if (clay == NULL) return NULL; clone = osl_clay_malloc(); OSL_strdup(clone->script, clay->script); return clone; } /** * osl_clay_equal function: * this function returns true if the two clay structures are the same * (content-wise), false otherwise. * \param[in] c1 The first clay structure. * \param[in] c2 The second clay structure. * \return 1 if c1 and c2 are the same (content-wise), 0 otherwise. */ int osl_clay_equal(osl_clay_p c1, osl_clay_p c2) { if (c1 == c2) return 1; if (((c1 == NULL) && (c2 != NULL)) || ((c1 != NULL) && (c2 == NULL))) { OSL_info("clay extensions are not the same"); return 0; } if (strcmp(c1->script, c2->script)) { OSL_info("clay scripts are not the same"); return 0; } return 1; } /** * osl_clay_interface function: * this function creates an interface structure corresponding to the clay * extension and returns it). * \return An interface structure for the clay extension. */ osl_interface_p osl_clay_interface() { osl_interface_p interface = osl_interface_malloc(); OSL_strdup(interface->URI, OSL_URI_CLAY); interface->idump = (osl_idump_f)osl_clay_idump; interface->sprint = (osl_sprint_f)osl_clay_sprint; interface->sread = (osl_sread_f)osl_clay_sread; interface->malloc = (osl_malloc_f)osl_clay_malloc; interface->free = (osl_free_f)osl_clay_free; interface->clone = (osl_clone_f)osl_clay_clone; interface->equal = (osl_equal_f)osl_clay_equal; return interface; } cloog-0.18.4/osl/source/extensions/irregular.c0000644000175000017500000006717012413270135016275 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** extensions/irregular.c ** **-----------------------------------------------------------------** ** First version: 07/12/2010 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #include #include #include #include #include #include #include #include /*+*************************************************************************** * Structure display function * *****************************************************************************/ /** * osl_irregular_idump function: * this function displays an osl_irregular_t structure (*irregular) into a * file (file, possibly stdout) in a way that trends to be understandable. It * includes an indentation level (level) in order to work with others * idump functions. * \param file The file where the information has to be printed. * \param irregular The irregular structure whose information has to be printed. * \param level Number of spaces before printing, for each line. */ void osl_irregular_idump(FILE * file, osl_irregular_p irregular, int level) { int i,j; // Go to the right level. for (j = 0; j < level; j++) fprintf(file, "|\t"); if (irregular != NULL) fprintf(file, "+-- osl_irregular_t\n"); else fprintf(file, "+-- NULL irregular\n"); if (irregular != NULL) { // Go to the right level. for(j = 0; j <= level; j++) fprintf(file, "|\t"); // Display the irregular contents. // Print statements for (i = 0; i < irregular->nb_statements; i++) { fprintf(file, "statement%d's predicats : ", i); for(j = 0; j < irregular->nb_predicates[i]; j++) fprintf(file, "%d ", irregular->predicates[i][j]); fprintf(file, "\n"); } // Print predicats // controls : for (i = 0; i < irregular->nb_control; i++) { fprintf(file, "predicat%d's\niterators : ", i); for(j = 0; j < irregular->nb_iterators[i]; j++) fprintf(file, "%s ", irregular->iterators[i][j]); fprintf(file, "\ncontrol body: %s\n", irregular->body[i]); } // exits : for(i = irregular->nb_control; i < irregular->nb_control + irregular->nb_exit; i++) { fprintf(file, "predicat%d's\niterators : ", i); for(j = 0; j < irregular->nb_iterators[i]; j++) fprintf(file, "%s ", irregular->iterators[i][j]); fprintf(file, "\nexit body: %s\n", irregular->body[i]); } } // The last line. for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "\n"); } /** * osl_irregular_dump function: * this function prints the content of an osl_irregular_t structure * (*irregular) into a file (file, possibly stdout). * \param file The file where the information has to be printed. * \param irregular The irregular structure whose information has to be printed. */ void osl_irregular_dump(FILE * file, osl_irregular_p irregular) { osl_irregular_idump(file, irregular, 0); } /** * osl_irregular_sprint function: * this function prints the content of an osl_irregular_t structure * (*irregular) into a string (returned) in the OpenScop textual format. * \param irregular The irregular structure whose information has to be printed. * \return A string containing the OpenScop dump of the irregular structure. */ char * osl_irregular_sprint(osl_irregular_p irregular) { int high_water_mark = OSL_MAX_STRING,i,j; char * string = NULL; char * buffer; if (irregular != NULL) { OSL_malloc(string, char *, high_water_mark * sizeof(char)); OSL_malloc(buffer, char *, OSL_MAX_STRING * sizeof(char)); string[0] = '\0'; // Print the begin tag. sprintf(buffer, OSL_TAG_IRREGULAR_START); osl_util_safe_strcat(&string, buffer, &high_water_mark); // Print the content. sprintf(buffer, "\n%d\n", irregular->nb_statements); for(i=0; inb_statements; i++) { sprintf(buffer, "%s%d ", buffer, irregular->nb_predicates[i]); for(j=0; jnb_predicates[i]; j++) { sprintf(buffer, "%s%d ", buffer, irregular->predicates[i][j]); } sprintf(buffer, "%s\n", buffer); } // Print the predicates. // controls: sprintf(buffer, "%s%d\n", buffer, irregular->nb_control); sprintf(buffer, "%s%d\n", buffer, irregular->nb_exit); for(i=0; inb_control; i++) { sprintf(buffer, "%s%d ", buffer, irregular->nb_iterators[i]); for(j=0; jnb_iterators[i];j++) sprintf(buffer, "%s%s ", buffer, irregular->iterators[i][j]); sprintf(buffer, "%s\n%s\n", buffer, irregular->body[i]); } // exits: for(i=0; inb_exit; i++) { sprintf(buffer, "%s%d ", buffer, irregular->nb_iterators[ irregular->nb_control + i]); for(j=0; jnb_iterators[irregular->nb_control + i];j++) sprintf(buffer, "%s%s ", buffer, irregular->iterators[ irregular->nb_control+i][j]); sprintf(buffer, "%s\n%s\n", buffer, irregular->body[ irregular->nb_control + i]); } osl_util_safe_strcat(&string, buffer, &high_water_mark); // Print the end tag. sprintf(buffer, OSL_TAG_IRREGULAR_STOP"\n"); osl_util_safe_strcat(&string, buffer, &high_water_mark); // Keep only the memory space we need. OSL_realloc(string, char *, (strlen(string) + 1) * sizeof(char)); free(buffer); } return string; } /***************************************************************************** * Reading function * *****************************************************************************/ /** * osl_irregular_sread function: * this function reads a irregular structure from a string complying to the * OpenScop textual format and returns a pointer to this irregular structure. * The string should contain only one textual format of a irregular structure. * \param extensions The input string where to find a irregular structure. * \return A pointer to the irregular structure that has been read. */ osl_irregular_p osl_irregular_sread(char ** extensions_fixme) { char * content,*tok; int i,j; osl_irregular_p irregular; // FIXME: this is a quick and dirty thing to accept char ** instead // of char * in the parameter: really do it and update the // pointer to after what has been read. content = *extensions_fixme; if (content == NULL) { OSL_debug("no irregular optional tag"); return NULL; } if (strlen(content) > OSL_MAX_STRING) OSL_error("irregular too long"); irregular = osl_irregular_malloc(); // nb statements tok = strtok(content," \n"); irregular->nb_statements = atoi(tok); OSL_malloc(irregular->predicates, int **, sizeof(int*) * irregular->nb_statements); OSL_malloc(irregular->nb_predicates, int *, sizeof(int) * irregular->nb_statements); // get predicats for(i = 0; i < irregular->nb_statements; i++) { // nb conditions tok = strtok(NULL," \n"); irregular->nb_predicates[i] = atoi(tok); OSL_malloc(irregular->predicates[i], int *, sizeof(int) * irregular->nb_predicates[i]); for(j = 0; j < irregular->nb_predicates[i]; j++){ tok = strtok(NULL, " \n"); irregular->predicates[i][j] = atoi(tok); } } // Get nb predicat // control and exits : tok = strtok(NULL, " \n"); irregular->nb_control=atoi(tok); tok = strtok(NULL, " \n"); irregular->nb_exit = atoi(tok); int nb_predicates = irregular->nb_control + irregular->nb_exit; OSL_malloc(irregular->iterators, char ***, sizeof(char **) * nb_predicates); OSL_malloc(irregular->nb_iterators, int *, sizeof(int) * nb_predicates); OSL_malloc(irregular->body, char **, sizeof(char *) * nb_predicates); for(i = 0; i < nb_predicates; i++) { // Get number of iterators tok = strtok(NULL, " \n"); irregular->nb_iterators[i] = atoi(tok); OSL_malloc(irregular->iterators[i], char **, sizeof(char *) * irregular->nb_iterators[i]); // Get iterators for(j = 0; j < irregular->nb_iterators[i]; j++) OSL_strdup(irregular->iterators[i][j], strtok(NULL, " \n")); // Get predicat string OSL_strdup(irregular->body[i], strtok(NULL, "\n")); } return irregular; } /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ /** * osl_irregular_malloc function: * This function allocates the memory space for an osl_irregular_t * structure and sets its fields with default values. Then it returns a * pointer to the allocated space. * \return A pointer to an empty irregular structure with fields set to * default values. */ osl_irregular_p osl_irregular_malloc() { osl_irregular_p irregular; OSL_malloc(irregular, osl_irregular_p, sizeof(osl_irregular_t)); irregular->nb_statements = 0; irregular->predicates = NULL; irregular->nb_predicates = NULL; irregular->nb_control = 0; irregular->nb_exit = 0; irregular->nb_iterators = NULL; irregular->iterators = NULL; irregular->body = NULL; return irregular; } /** * osl_irregular_free function: * This function frees the allocated memory for an osl_irregular_t * structure. * \param irregular The pointer to the irregular structure we want to free. */ void osl_irregular_free(osl_irregular_p irregular) { int i, j, nb_predicates; if (irregular != NULL) { for(i = 0; i < irregular->nb_statements; i++) free(irregular->predicates[i]); if(irregular->predicates != NULL) free(irregular->predicates); nb_predicates = irregular->nb_control + irregular->nb_exit; for(i = 0; i < nb_predicates; i++) { for(j = 0; j < irregular->nb_iterators[i]; j++) free(irregular->iterators[i][j]); free(irregular->iterators[i]); free(irregular->body[i]); } if(irregular->iterators != NULL) free(irregular->iterators); if(irregular->nb_iterators != NULL) free(irregular->nb_iterators); if(irregular->body != NULL) free(irregular->body); if(irregular->nb_predicates != NULL) free(irregular->nb_predicates); free(irregular); } } /*+*************************************************************************** * Processing functions * *****************************************************************************/ /** * osl_irregular_clone function: * This function builds and returns a "hard copy" (not a pointer copy) of an * osl_irregular_t data structure. * \param irregular The pointer to the irregular structure we want to copy. * \return A pointer to the copy of the irregular structure. */ osl_irregular_p osl_irregular_clone(osl_irregular_p irregular) { int i,j; osl_irregular_p copy; if (irregular == NULL) return NULL; copy = osl_irregular_malloc(); copy->nb_statements = irregular->nb_statements; copy->nb_predicates = (int *)malloc(sizeof(int)*copy->nb_statements); if (copy->nb_predicates == NULL) { fprintf(stderr, "[OpenScop] Error: memory overflow.\n"); exit(1); } copy->predicates = (int **)malloc(sizeof(int*)*copy->nb_statements); if (copy->predicates == NULL) { fprintf(stderr, "[OpenScop] Error: memory overflow.\n"); exit(1); } for(i=0; inb_statements; i++) { copy->nb_predicates[i]=irregular->nb_predicates[i]; copy->predicates[i] = (int *)malloc(sizeof(int)*copy->nb_predicates[i]); if (copy->predicates[i] == NULL) { fprintf(stderr, "[OpenScop] Error: memory overflow.\n"); exit(1); } for(j=0; jnb_predicates[i]; j++) copy->predicates[i][j] = irregular->predicates[i][j]; } copy->nb_control = irregular->nb_control; copy->nb_exit = irregular->nb_exit; int nb_predicates = irregular->nb_control + irregular->nb_exit; copy->nb_iterators = (int *)malloc(sizeof(int)*nb_predicates); if (copy->nb_iterators == NULL) { fprintf(stderr, "[OpenScop] Error: memory overflow.\n"); exit(1); } copy->iterators = (char ***)malloc(sizeof(char**)*nb_predicates); if (copy->iterators == NULL) { fprintf(stderr, "[OpenScop] Error: memory overflow.\n"); exit(1); } copy->body = (char **)malloc(sizeof(char*)*nb_predicates); if (copy->body == NULL) { fprintf(stderr, "[OpenScop] Error: memory overflow.\n"); exit(1); } for(i=0; inb_iterators[i] = irregular->nb_iterators[i]; copy->iterators[i] = (char**)malloc(sizeof(char*)*copy->nb_iterators[i]); if (copy->iterators[i] == NULL) { fprintf(stderr, "[OpenScop] Error: memory overflow.\n"); exit(1); } for(j=0;jnb_iterators[i];j++) OSL_strdup(copy->iterators[i][j], irregular->iterators[i][j]); OSL_strdup(copy->iterators[i][j], irregular->body[i]); } return copy; } /** * osl_irregular_equal function: * this function returns true if the two irregular structures are the same * (content-wise), false otherwise. This functions considers two irregular * \param c1 The first irregular structure. * \param c2 The second irregular structure. * \return 1 if c1 and c2 are the same (content-wise), 0 otherwise. */ int osl_irregular_equal(osl_irregular_p c1, osl_irregular_p c2) { int i,j,bool = 0; if (c1 == c2) return 1; if (((c1 == NULL) && (c2 != NULL)) || ((c1 != NULL) && (c2 == NULL))) return 0; if(c1->nb_statements != c2->nb_statements || c1->nb_control != c2->nb_control || c1->nb_exit != c2->nb_exit) return 0; i=0; while(bool == 0 && i < c1->nb_statements) { bool = c1->nb_predicates[i] != c2->nb_predicates[i] ? 1 : 0; i++; } if(bool != 0) return 0; i = 0; while(bool == 0 && i < c1->nb_control + c1->nb_exit) { bool += c1->nb_iterators[i] != c2->nb_iterators[i] ? 1 : 0; bool += strcmp(c1->body[i],c2->body[i]); j = 0; while(bool == 0 && j < c1->nb_iterators[i]) { bool += strcmp(c1->iterators[i][j],c2->iterators[i][j]); j++; } i++; } if(bool != 0) return 0; return 1; } osl_irregular_p osl_irregular_add_control( osl_irregular_p irregular, char** iterators, int nb_iterators, char* body) { int i,j; osl_irregular_p result=osl_irregular_malloc(); result->nb_control = irregular->nb_control + 1; result->nb_exit = irregular->nb_exit; result->nb_statements = irregular->nb_statements; int nb_predicates = result->nb_control + result->nb_exit; result->iterators = (char***)malloc(sizeof(char**)*nb_predicates); result->nb_iterators = (int*)malloc(sizeof(int)*nb_predicates); result->body = (char**)malloc(sizeof(char*)*nb_predicates); if (result->iterators == NULL || result->nb_iterators == NULL || result->body == NULL) { fprintf(stderr, "[OpenScop] Error: memory overflow.\n"); exit(1); } //copy controls for(i=0; inb_control; i++) { result->nb_iterators[i] = irregular->nb_iterators[i]; OSL_strdup(result->body[i], irregular->body[i]); result->iterators[i] = (char**)malloc(sizeof(char*) * irregular->nb_iterators[i]); if (result->iterators[i] == NULL) { fprintf(stderr, "[OpenScop] Error: memory overflow.\n"); exit(1); } for(j=0; jnb_iterators[i];j++) OSL_strdup(result->iterators[i][j], irregular->iterators[i][j]); } //add controls result->iterators[irregular->nb_control] = (char**)malloc(sizeof(char*)*nb_iterators); if (result->iterators[irregular->nb_control] == NULL) { fprintf(stderr, "[OpenScop] Error: memory overflow.\n"); exit(1); } for(i=0; iiterators[irregular->nb_control][i], iterators[i]); result->nb_iterators[irregular->nb_control] = nb_iterators; OSL_strdup(result->body[irregular->nb_control], body); //copy exits for(i=result->nb_control; inb_iterators[i] = irregular->nb_iterators[i-1]; OSL_strdup(result->body[i], irregular->body[i-1]); result->iterators[i] = (char**)malloc(sizeof(char*) * irregular->nb_iterators[i-1]); if (result->iterators[i] == NULL) { fprintf(stderr, "[OpenScop] Error: memory overflow.\n"); exit(1); } for(j=0; jnb_iterators[i-1];j++) OSL_strdup(result->iterators[i][j], irregular->iterators[i-1][j]); } // copy statements result->nb_predicates = (int*)malloc(sizeof(int)*irregular->nb_statements); result->predicates = (int**)malloc(sizeof(int*)*irregular->nb_statements); if (result->nb_predicates == NULL || result->predicates == NULL) { fprintf(stderr, "[OpenScop] Error: memory overflow.\n"); exit(1); } for(i=0; inb_statements; i++) { result->predicates[i] = (int*)malloc(sizeof(int)*irregular->nb_predicates[i]); if (result->predicates[i] == NULL) { fprintf(stderr, "[OpenScop] Error: memory overflow.\n"); exit(1); } result->nb_predicates[i] = irregular->nb_predicates[i]; for(j=0; jnb_predicates[i]; j++) result->predicates[i][j]=irregular->predicates[i][j]; } return result; } osl_irregular_p osl_irregular_add_exit( osl_irregular_p irregular, char** iterators, int nb_iterators, char* body) { int i,j; osl_irregular_p result=osl_irregular_malloc(); result->nb_control = irregular->nb_control; result->nb_exit = irregular->nb_exit + 1; result->nb_statements = irregular->nb_statements; int nb_predicates = result->nb_control + result->nb_exit; result->iterators = (char***)malloc(sizeof(char**)*nb_predicates); result->nb_iterators = (int*)malloc(sizeof(int)*nb_predicates); result->body = (char**)malloc(sizeof(char*)*nb_predicates); if (result->iterators == NULL || result->nb_iterators == NULL || result->body == NULL) { fprintf(stderr, "[OpenScop] Error: memory overflow.\n"); exit(1); } //copy controls and exits for(i=0; inb_iterators[i] = irregular->nb_iterators[i]; OSL_strdup(result->body[i], irregular->body[i]); result->iterators[i] = (char**)malloc(sizeof(char*) * irregular->nb_iterators[i]); if (result->iterators[i] == NULL) { fprintf(stderr, "[OpenScop] Error: memory overflow.\n"); exit(1); } for(j=0; jnb_iterators[i];j++) OSL_strdup(result->iterators[i][j], irregular->iterators[i][j]); } //add exit result->iterators[nb_predicates-1] = (char**)malloc(sizeof(char*)*nb_iterators); if (result->iterators[nb_predicates-1] == NULL) { fprintf(stderr, "[OpenScop] Error: memory overflow.\n"); exit(1); } for(i=0; iiterators[nb_predicates-1][i], iterators[i]); result->nb_iterators[nb_predicates-1] = nb_iterators; OSL_strdup(result->body[nb_predicates-1], body); // copy statements result->nb_predicates = (int*)malloc(sizeof(int)*irregular->nb_statements); result->predicates = (int**)malloc(sizeof(int*)*irregular->nb_statements); if (result->nb_predicates == NULL || result->predicates == NULL) { fprintf(stderr, "[OpenScop] Error: memory overflow.\n"); exit(1); } for(i=0; inb_statements; i++) { result->predicates[i] = (int*)malloc(sizeof(int)*irregular->nb_predicates[i]); if (result->predicates[i] == NULL) { fprintf(stderr, "[OpenScop] Error: memory overflow.\n"); exit(1); } result->nb_predicates[i] = irregular->nb_predicates[i]; for(j=0; jnb_predicates[i]; j++) result->predicates[i][j]=irregular->predicates[i][j]; } return result; } osl_irregular_p osl_irregular_add_predicates( osl_irregular_p irregular, int* predicates, int nb_add_predicates) { int i,j; osl_irregular_p result=osl_irregular_malloc(); result->nb_control = irregular->nb_control; result->nb_exit = irregular->nb_exit; result->nb_statements = irregular->nb_statements+1; int nb_predicates = result->nb_control + result->nb_exit; result->iterators = (char***)malloc(sizeof(char**)*nb_predicates); result->nb_iterators = (int*)malloc(sizeof(int)*nb_predicates); result->body = (char**)malloc(sizeof(char*)*nb_predicates); if (result->iterators == NULL || result->nb_iterators == NULL || result->body == NULL) { fprintf(stderr, "[OpenScop] Error: memory overflow.\n"); exit(1); } //copy controls and exits for(i=0; inb_iterators[i] = irregular->nb_iterators[i]; OSL_strdup(result->body[i], irregular->body[i]); result->iterators[i] = (char**)malloc(sizeof(char*) * irregular->nb_iterators[i]); if (result->iterators[i] == NULL) { fprintf(stderr, "[OpenScop] Error: memory overflow.\n"); exit(1); } for(j=0; jnb_iterators[i];j++) OSL_strdup(result->iterators[i][j], irregular->iterators[i][j]); } //copy statements result->nb_predicates = (int*)malloc(sizeof(int)*result->nb_statements); result->predicates = (int**)malloc(sizeof(int*)*result->nb_statements); if (result->nb_predicates == NULL || result->predicates == NULL) { fprintf(stderr, "[OpenScop] Error: memory overflow.\n"); exit(1); } for(i=0; inb_statements; i++) { result->predicates[i] = (int*)malloc(sizeof(int)*irregular->nb_predicates[i]); if (result->predicates[i] == NULL) { fprintf(stderr, "[OpenScop] Error: memory overflow.\n"); exit(1); } result->nb_predicates[i] = irregular->nb_predicates[i]; for(j=0; jnb_predicates[i]; j++) result->predicates[i][j]=irregular->predicates[i][j]; } //add statement result->predicates[irregular->nb_statements] = (int*)malloc(sizeof(int)*nb_add_predicates); if (result->predicates[irregular->nb_statements] == NULL) { fprintf(stderr, "[OpenScop] Error: memory overflow.\n"); exit(1); } for(i=0; ipredicates[irregular->nb_statements][i] = predicates[i]; result->nb_predicates[irregular->nb_statements] = nb_add_predicates; return result; } /** * osl_irregular_interface function: * this function creates an interface structure corresponding to the irregular * extension and returns it). * \return An interface structure for the irregular extension. */ osl_interface_p osl_irregular_interface() { osl_interface_p interface = osl_interface_malloc(); OSL_strdup(interface->URI, OSL_URI_IRREGULAR); interface->idump = (osl_idump_f)osl_irregular_idump; interface->sprint = (osl_sprint_f)osl_irregular_sprint; interface->sread = (osl_sread_f)osl_irregular_sread; interface->malloc = (osl_malloc_f)osl_irregular_malloc; interface->free = (osl_free_f)osl_irregular_free; interface->clone = (osl_clone_f)osl_irregular_clone; interface->equal = (osl_equal_f)osl_irregular_equal; return interface; } cloog-0.18.4/osl/source/extensions/loop.c0000644000175000017500000004507012413270135015245 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** extensions/loop.c ** **-----------------------------------------------------------------** ** First version: 03/06/2013 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #include #include #include #include #include #include #include #include #include /*+*************************************************************************** * Structure display function * *****************************************************************************/ /** * osl_loop_idump function: * this function displays an osl_loop_t structure (loop) into a file * (file, possibly stdout) in a way that trends to be understandable. It * includes an indentation level (level) in order to work with others * idump functions. * * \param[in] file The file where the information has to be printed. * \param[in] loop The loop structure to print. * \param[in] level Number of spaces before printing, for each line. */ void osl_loop_idump(FILE * file, osl_loop_p loop, int level) { int i, j, first = 1, number=1; // Go to the right level. for (j = 0; j < level; j++) fprintf(file, "|\t"); if (loop != NULL) fprintf(file, "+-- osl_loop_t\n"); else fprintf(file, "+-- NULL loop\n"); while (loop != NULL) { // Go to the right level. if (!first) { // Go to the right level. for (j = 0; j < level; j++) fprintf(file, "|\t"); fprintf(file, "| osl_loop_t (node %d)\n", number); } else { first = 0; } // A blank line. for (j = 0; j <= level+1; j++) fprintf(file, "|\t"); fprintf(file, "\n"); // Display the number of names. for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "+--iterator: %s\n", loop->iter); for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "+--nb_stmts: %d\n", loop->nb_stmts); // Display the id/name. for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "+--stmt_ids:"); for(i = 0; i < loop->nb_stmts; i++) { // Go to the right level. fprintf(file, "%2d, ", loop->stmt_ids[i]); } fprintf(file, "\n"); for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "+--private_vars: %s\n", loop->private_vars); for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "+--directive: %d\n", loop->directive); loop = loop->next; number++; // Next line. if (loop != NULL) { for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "V\n"); } } // The last line. for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "\n"); } /** * osl_loop_dump function: * this function prints the content of an osl_loop_t structure * (*loop) into a file (file, possibly stdout). * * \param[in] file The file where the information has to be printed. * \param[in] loop The loop structure to print. */ void osl_loop_dump(FILE * file, osl_loop_p loop) { osl_loop_idump(file, loop, 0); } /** * osl_loop_sprint function: * this function prints the content of an osl_loop_t structure * (*loop) into a string (returned) in the OpenScop textual format. * \param[in] loop The loop structure to print. * \return A string containing the OpenScop dump of the loop structure. */ char * osl_loop_sprint(osl_loop_p loop) { int i; int nloop = 0; int high_water_mark = OSL_MAX_STRING; char *string = NULL; char buffer[OSL_MAX_STRING]; OSL_malloc(string, char *, high_water_mark * sizeof(char)); string[0] = '\0'; sprintf(buffer, "# Number of loops\n%d\n",osl_loop_count(loop)); osl_util_safe_strcat(&string, buffer, &high_water_mark); while (loop != NULL) { sprintf(buffer, "# ===========================================\n"); osl_util_safe_strcat(&string, buffer, &high_water_mark); sprintf(buffer, "# Loop number %d \n", ++nloop); osl_util_safe_strcat(&string, buffer, &high_water_mark); sprintf(buffer, "# Iterator name\n"); osl_util_safe_strcat(&string, buffer, &high_water_mark); sprintf(buffer, "%s\n", loop->iter); osl_util_safe_strcat(&string, buffer, &high_water_mark); sprintf(buffer, "# Number of stmts\n"); osl_util_safe_strcat(&string, buffer, &high_water_mark); sprintf(buffer, "%d\n", loop->nb_stmts); osl_util_safe_strcat(&string, buffer, &high_water_mark); if (loop->nb_stmts) { sprintf(buffer, "# Statement identifiers\n"); osl_util_safe_strcat(&string, buffer, &high_water_mark); } for (i = 0; i < loop->nb_stmts; i++) { sprintf(buffer, "%d\n", loop->stmt_ids[i]); osl_util_safe_strcat(&string, buffer, &high_water_mark); } sprintf(buffer, "# Private variables\n"); osl_util_safe_strcat(&string, buffer, &high_water_mark); sprintf(buffer, "%s\n", loop->private_vars); osl_util_safe_strcat(&string, buffer, &high_water_mark); sprintf(buffer, "# Directive\n"); osl_util_safe_strcat(&string, buffer, &high_water_mark); sprintf(buffer, "%d\n", loop->directive); osl_util_safe_strcat(&string, buffer, &high_water_mark); loop = loop->next; } OSL_realloc(string, char *, (strlen(string) + 1) * sizeof(char)); return string; } /***************************************************************************** * Reading function * *****************************************************************************/ /** * osl_loop_sread function: * this function reads a loop structure from a string complying to the * OpenScop textual format and returns a pointer to this loop structure. * The input parameter is updated to the position in the input string this * function reaches right after reading the comment structure. * * \param[in,out] input The input string where to find an loop structure. * Updated to the position after what has been read. * \return A pointer to the loop structure that has been read. */ osl_loop_p osl_loop_sread(char **input) { int i; int nb_loops; osl_loop_p head; osl_loop_p loop; if (input == NULL) { OSL_debug("no loop optional tag"); return NULL; } // Find the number of names provided. nb_loops = osl_util_read_int(NULL, input); if(nb_loops == 0) return NULL; // Allocate the array of id and names. head = loop = osl_loop_malloc(); while (nb_loops != 0) { loop->iter = osl_util_read_string(NULL, input); loop->nb_stmts = osl_util_read_int(NULL, input); OSL_malloc(loop->stmt_ids, int *, loop->nb_stmts * sizeof(int)); for (i = 0; i < loop->nb_stmts; i++) loop->stmt_ids[i] = osl_util_read_int(NULL, input); loop->private_vars = osl_util_read_line(NULL, input); if (!strcmp(loop->private_vars, "(null)")) { free(loop->private_vars); loop->private_vars=NULL; } loop->directive = osl_util_read_int(NULL, input); nb_loops--; if (nb_loops != 0) { loop->next = osl_loop_malloc (); loop = loop->next; } } return head; } /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ /** * osl_loop_malloc function: * this function allocates the memory space for an osl_loop_t * structure and sets its fields with default values. Then it returns a * pointer to the allocated space. * * \return A pointer to an empty loop structure with fields set to * default values. */ osl_loop_p osl_loop_malloc() { osl_loop_p loop; OSL_malloc(loop, osl_loop_p, sizeof(osl_loop_t)); loop->iter = NULL; loop->nb_stmts = 0; loop->stmt_ids = NULL; loop->private_vars = NULL; loop->directive = 0; loop->next = NULL; return loop; } /** * osl_loop_free function: * this function frees the allocated memory for an loop structure. * * \param[in,out] loop The pointer to the loop structure we want to free. */ void osl_loop_free(osl_loop_p loop) { while (loop != NULL) { osl_loop_p tmp = loop; if (loop->iter) free(loop->iter); if (loop->stmt_ids) free(loop->stmt_ids); if (loop->private_vars) free(loop->private_vars); loop = loop->next; free(tmp); } } /*+*************************************************************************** * Processing functions * *****************************************************************************/ /** * osl_loop_clone_one function: * this function builds and returns a "hard copy" (not a pointer copy) of * "one" (and not the whole list) osl_loop_t data structure. * * \param[in] loop The pointer to the loop structure to clone. * \return A pointer to the clone of the loop structure. */ osl_loop_p osl_loop_clone_one(osl_loop_p loop) { int i; osl_loop_p clone; if (loop == NULL) return NULL; clone = osl_loop_malloc(); OSL_strdup(clone->iter, loop->iter); clone->nb_stmts = loop->nb_stmts; OSL_malloc(clone->stmt_ids, int *, loop->nb_stmts * sizeof(int)); for (i = 0; i < loop->nb_stmts; i++) { clone->stmt_ids[i] = loop->stmt_ids[i]; } clone->directive = loop->directive; if(loop->private_vars != NULL) OSL_strdup(clone->private_vars, loop->private_vars); return clone; } /** * osl_loop_clone function: * this function builds and returns a "hard copy" (not a pointer copy) of a * list of osl_loop_t data structures. * * \param[in] loop The pointer to the list of loop structure to clone. * \return A pointer to the clone of list of the loop structure. */ osl_loop_p osl_loop_clone(osl_loop_p loop) { osl_loop_p clone = NULL; osl_loop_p head = NULL; if (loop == NULL) return NULL; while (loop) { if (clone==NULL) { head = clone = osl_loop_clone_one(loop); } else { clone->next = osl_loop_clone_one(loop); clone = clone->next; } loop = loop->next; } return head; } /** * osl_loop_equal_one function: * this function returns true if the two loop structures are the same * (content-wise), false otherwise. This functions considers two loop * structures as equal if the order of the array names differ, however * the identifiers and names must be the same. * * \param[in] a1 The first loop structure. * \param[in] a2 The second loop structure. * \return 1 if a1 and a2 are the same (content-wise), 0 otherwise. */ int osl_loop_equal_one(osl_loop_p a1, osl_loop_p a2) { int i, j, found; if (a1 == a2) return 1; if (((a1 == NULL) && (a2 != NULL)) || ((a1 != NULL) && (a2 == NULL))) { //OSL_info("loops are not the same (compare with NULL)"); return 0; } // Check whether the number of names is the same. if (a1->nb_stmts != a2->nb_stmts) { //OSL_info("loops are not the same (nb_stmts)"); return 0; } if (strcmp(a1->iter, a2->iter)) { //OSL_info("loops are not the same (iter name)"); return 0; } // We accept a different order of the names, as long as the identifiers // are the same. for (i = 0; i < a1->nb_stmts; i++) { found = 0; for (j = 0; j < a2->nb_stmts; j++) { if (a1->stmt_ids[i] == a2->stmt_ids[j]) { found = 1; break; } } if (found != 1) { //OSL_info("loop are not the same (stmt ids)"); return 0; } } //TODO: necessarily same ??? if (a1->private_vars != a2->private_vars) { // NULL check if (strcmp(a1->private_vars, a2->private_vars)) { //OSL_info("loops are not the same (private vars)"); return 0; } } //TODO: necessarily same ??? if (a1->directive != a2->directive) { //OSL_info("loops are not the same (directive)"); return 0; } return 1; } /** * osl_loop_equal function: * this function returns true if the two loop lists are the same * (content-wise), false otherwise. Two lists are equal if one contains * all the elements of the other and vice versa. The exact order of the * nodes is not taken into account by this function. * * \param[in] a1 The first loop list. * \param[in] a2 The second loop list. * \return 1 if a1 and a2 are the same (content-wise), 0 otherwise. */ int osl_loop_equal(osl_loop_p a1, osl_loop_p a2) { int found = 0; if (a1 == a2) return 1; if (((a1 == NULL) && (a2 != NULL)) || ((a1 != NULL) && (a2 == NULL))) { OSL_info("lists of loops are not the same (compare with NULL)"); return 0; } if (osl_loop_count(a1) != osl_loop_count(a2)) { OSL_info("list of loops are not the same"); return 0; } while (a1) { found = 0; osl_loop_p temp = a2; while (temp) { if(osl_loop_equal_one(a1, temp)==1){ found= 1; break; } temp = temp->next; } if(found!=1){ OSL_info("list of loops are not the same"); return 0; } a1 = a1->next; } return 1; } /** * osl_loop_interface function: * this function creates an interface structure corresponding to the loop * extension and returns it. * * \return An interface structure for the loop extension. */ osl_interface_p osl_loop_interface() { osl_interface_p interface = osl_interface_malloc(); OSL_strdup(interface->URI, OSL_URI_LOOP); interface->idump = (osl_idump_f)osl_loop_idump; interface->sprint = (osl_sprint_f)osl_loop_sprint; interface->sread = (osl_sread_f)osl_loop_sread; interface->malloc = (osl_malloc_f)osl_loop_malloc; interface->free = (osl_free_f)osl_loop_free; interface->clone = (osl_clone_f)osl_loop_clone; interface->equal = (osl_equal_f)osl_loop_equal; return interface; } /** * osl_loop_add function: * this function adds a loop structure at the end of the list * * \param[in,out] ll Pointer to a list of loops. * \param[in] loop Pointer to the loop structure to be added. */ void osl_loop_add(osl_loop_p loop, osl_loop_p *ll) { while (*ll != NULL) ll = &(*ll)->next; *ll = loop; } /** * osl_loop_count: * this function returns the number of elements in the list * * \param[in] ll Pointer to a list of loops. * \return Number of elements in the list */ int osl_loop_count(osl_loop_p ll) { int count = 0; while (ll) { count++; ll = ll->next; } return count; } cloog-0.18.4/osl/source/interface.c0000644000175000017500000003576412413270135014046 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** interface.c ** **-----------------------------------------------------------------** ** First version: 15/07/2011 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include /*+*************************************************************************** * Structure display function * *****************************************************************************/ /** * osl_interface_idump function: * this function displays an osl_interface_t structure (*interface) into * a file (file, possibly stdout) in a way that trends to be understandable. * It includes an indentation level (level) in order to work with others * idump functions. * \param file The file where the information has to be printed. * \param interface The interface structure which has to be printed. * \param level Number of spaces before printing, for each line. */ void osl_interface_idump(FILE * file, osl_interface_p interface, int level) { int j, first = 1; // Go to the right level. for (j = 0; j < level; j++) fprintf(file, "|\t"); if (interface != NULL) fprintf(file, "+-- osl_interface_t: URI = %s\n", interface->URI); else fprintf(file, "+-- NULL interface\n"); while (interface != NULL) { if (!first) { // Go to the right level. for (j = 0; j < level; j++) fprintf(file, "|\t"); if (interface->URI != NULL) fprintf(file, "| osl_interface_t: URI = %s\n", interface->URI); else fprintf(file, "| osl_interface_t: URI = (NULL)\n"); } else first = 0; interface = interface->next; // Next line. if (interface != NULL) { for (j = 0; j <= level + 1; j++) fprintf(file, "|\t"); fprintf(file, "\n"); for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "V\n"); } } // The last line. for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "\n"); } /** * osl_interface_dump function: * this function prints the content of a osl_interface_t structure * (*interface) into a file (file, possibly stdout). * \param file File where informations are printed. * \param interface The interface structure to print. */ void osl_interface_dump(FILE * file, osl_interface_p interface) { osl_interface_idump(file, interface, 0); } /***************************************************************************** * Reading function * *****************************************************************************/ /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ /** * osl_interface_add function: * this function adds an interface node (it may be a list as well) to a * list of interfaces provided as parameter (list). The new node * is inserted at the end of the list. * \param list The list of interfaces to add a node (NULL if empty). * \param interface The interface to add to the list. */ void osl_interface_add(osl_interface_p * list, osl_interface_p interface) { osl_interface_p tmp = *list, check_interface; if (interface != NULL) { // First, check that the interface list is OK. check_interface = interface; while (check_interface != NULL) { if (check_interface->URI == NULL) OSL_error("no URI in an interface to add to a list"); if (osl_interface_lookup(*list, check_interface->URI) != NULL) OSL_error("only one interface with a given URI is allowed"); check_interface = check_interface->next; } if (*list != NULL) { while (tmp->next != NULL) tmp = tmp->next; tmp->next = interface; } else { *list = interface; } } } /** * osl_interface_malloc function: * This function allocates the memory space for a osl_interface_t * structure and sets its fields with default values. Then it returns a * pointer to the allocated space. * \return A pointer to an empty interface structure with fields set to * default values. */ osl_interface_p osl_interface_malloc() { osl_interface_p interface; OSL_malloc(interface, osl_interface_p, sizeof(osl_interface_t)); interface->URI = NULL; interface->idump = NULL; interface->sprint = NULL; interface->sread = NULL; interface->malloc = NULL; interface->free = NULL; interface->clone = NULL; interface->equal = NULL; interface->next = NULL; return interface; } /** * osl_interface_free function: * this function frees the allocated memory for an osl_interface_t * structure, and all the interfaces stored in the list. * \param[in] interface The pointer to the interface we want to free. */ void osl_interface_free(osl_interface_p interface) { osl_interface_p tmp; int i = 0; while (interface != NULL) { tmp = interface->next; if (interface->URI != NULL) free(interface->URI); free(interface); interface = tmp; i++; } } /*+*************************************************************************** * Processing functions * *****************************************************************************/ /** * osl_interface_number function: * this function returns the number of statements in the interface list * provided as parameter. * \param[in] interface The first element of the interface list. * \return The number of statements in the interface list. */ int osl_interface_number(osl_interface_p interface) { int number = 0; while (interface != NULL) { number++; interface = interface->next; } return number; } /** * osl_interface_nclone function: * This function builds and returns a "hard copy" (not a pointer copy) of the * n first elements of an osl_interface_t list. * \param interface The pointer to the interface structure we want to clone. * \param n The number of nodes we want to copy (-1 for infinity). * \return The clone of the n first nodes of the interface list. */ osl_interface_p osl_interface_nclone(osl_interface_p interface, int n) { osl_interface_p clone = NULL, new; int i = 0; while ((interface != NULL) && ((n == -1) || (i < n))) { new = osl_interface_malloc(); OSL_strdup(new->URI, interface->URI); new->idump = interface->idump; new->sprint = interface->sprint; new->sread = interface->sread; new->malloc = interface->malloc; new->free = interface->free; new->clone = interface->clone; new->equal = interface->equal; osl_interface_add(&clone, new); interface = interface->next; i++; } return clone; } /** * osl_interface_clone function: * This function builds and returns a "hard copy" (not a pointer copy) of an * osl_interface_t data structure. * \param interface The pointer to the interface structure we want to copy. * \return A pointer to the copy of the interface structure. */ osl_interface_p osl_interface_clone(osl_interface_p interface) { return osl_interface_nclone(interface, -1); } /** * osl_interface_equal function: * this function returns true if the two interface structures are the same, * (content-wise) false otherwise. * \param interface1 The first interface structure. * \param interface2 The second interface structure. * \return 1 if interface1 and interface2 are the same, 0 otherwise. */ int osl_interface_equal(osl_interface_p interface1, osl_interface_p interface2) { if (interface1 == interface2) return 1; if (((interface1 == NULL) && (interface2 != NULL)) || ((interface1 != NULL) && (interface2 == NULL))) return 0; if (strcmp(interface1->URI, interface2->URI) || (interface1->idump != interface2->idump) || (interface1->sprint != interface2->sprint) || (interface1->sread != interface2->sread) || (interface1->malloc != interface2->malloc) || (interface1->free != interface2->free) || (interface1->clone != interface2->clone) || (interface1->equal != interface2->equal)) return 0; return 1; } /** * osl_interface_lookup function: * this function returns the first interface with a given URI in the * interface list provided as parameter and NULL if it doesn't find such * an interface. * \param list The interface list where to search a given interface URI. * \param URI The URI of the interface we are looking for. * \return The first interface of the requested URI in the list. */ osl_interface_p osl_interface_lookup(osl_interface_p list, char * URI) { if (URI == NULL) { OSL_warning("lookup for a NULL URI"); } else { while (list != NULL) { if ((list->URI != NULL) && (!strcmp(list->URI, URI))) return list; list = list->next; } } return NULL; } /** * osl_interface_get_default_registry function: * this function creates the list of known interfaces (of all generic types, * including extensions) and returns it. * \return The list of known interfaces. */ osl_interface_p osl_interface_get_default_registry() { osl_interface_p registry = NULL; // Internal generics osl_interface_add(®istry, osl_strings_interface()); osl_interface_add(®istry, osl_body_interface()); osl_interface_add(®istry, osl_relation_interface()); // Extensions osl_interface_add(®istry, osl_textual_interface()); osl_interface_add(®istry, osl_comment_interface()); osl_interface_add(®istry, osl_null_interface()); osl_interface_add(®istry, osl_scatnames_interface()); osl_interface_add(®istry, osl_arrays_interface()); osl_interface_add(®istry, osl_coordinates_interface()); osl_interface_add(®istry, osl_clay_interface()); osl_interface_add(®istry, osl_dependence_interface()); osl_interface_add(®istry, osl_symbols_interface()); osl_interface_add(®istry, osl_extbody_interface()); osl_interface_add(®istry, osl_loop_interface()); osl_interface_add(®istry, osl_pluto_unroll_interface()); //osl_interface_add(®istry, osl_irregular_interface()); return registry; } cloog-0.18.4/osl/source/vector.c0000644000175000017500000003435212413256474013412 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** vector.c ** **-----------------------------------------------------------------** ** First version: 30/04/2008 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #include #include #include #include #include #include #include /*+*************************************************************************** * Structure display function * *****************************************************************************/ /** * osl_vector_idump function: * Displays a osl_vector_t structure (*vector) into a file (file, possibly * stdout) in a way that trends to be understandable without falling in a deep * depression or, for the lucky ones, getting a headache... It includes an * indentation level (level) in order to work with others idump functions. * \param[in] file File where informations are printed. * \param[in] vector The vector whose information have to be printed. * \param[in] level Number of spaces before printing, for each line. */ void osl_vector_idump(FILE * file, osl_vector_p vector, int level) { int j; if (vector != NULL) { // Go to the right level. for (j = 0; j < level; j++) fprintf(file,"|\t"); fprintf(file,"+-- osl_vector_t ("); osl_int_dump_precision(file, vector->precision); fprintf(file, ")\n"); for (j = 0; j <= level; j++) fprintf(file,"|\t"); fprintf(file,"%d\n", vector->size); // Display the vector. for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "[ "); for (j = 0; j < vector->size; j++) { osl_int_print(file, vector->precision, vector->v[j]); fprintf(file, " "); } fprintf(file, "]\n"); } else { // Go to the right level. for (j = 0; j < level; j++) fprintf(file, "|\t"); fprintf(file, "+-- NULL vector\n"); } // The last line. for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "\n"); } /** * osl_vector_dump function: * This function prints the content of a osl_vector_t structure * (*vector) into a file (file, possibly stdout). * \param[in] file File where informations are printed. * \param[in] vector The vector whose information have to be printed. */ void osl_vector_dump(FILE * file, osl_vector_p vector) { osl_vector_idump(file, vector, 0); } /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ /** * osl_vector_pmalloc function: * (precision malloc) this function allocates the memory space for an * osl_vector_t structure and sets its fields with default values. Then * it returns a pointer to the allocated space. * \param[in] precision The precision of the vector entries. * \param[in] size The number of entries of the vector to allocate. * \return A pointer to the newly allocated osl_vector_t structure. */ osl_vector_p osl_vector_pmalloc(int precision, int size) { osl_vector_p vector; int i; OSL_malloc(vector, osl_vector_p, sizeof(osl_vector_t)); vector->size = size; vector->precision = precision; if (size == 0) { vector->v = NULL; } else { OSL_malloc(vector->v, osl_int_t*, size * sizeof(osl_int_t)); for (i = 0; i < size; i++) osl_int_init_set_si(precision, &vector->v[i], 0); } return vector; } /** * osl_vector_malloc function: * This function allocates the memory space for a osl_vector_t structure * and sets its fields with default values. Then it returns a pointer to the * allocated space. The precision of the vector elements corresponds to the * precision environment variable or to the highest available precision if it * is not defined. * \param[in] size The number of entries of the vector to allocate. * \return A pointer to the newly allocated osl_vector_t structure. */ osl_vector_p osl_vector_malloc(int size) { int precision = osl_util_get_precision(); return osl_vector_pmalloc(precision, size); } /** * osl_vector_free function: * This function frees the allocated memory for a osl_vector_t structure. * \param[in] vector The pointer to the vector we want to free. */ void osl_vector_free(osl_vector_p vector) { int i; if (vector != NULL) { if (vector->v != NULL) { for (i = 0; i < vector->size; i++) osl_int_clear(vector->precision, &vector->v[i]); free(vector->v); } free(vector); } } /*+*************************************************************************** * Processing functions * *****************************************************************************/ /** * osl_vector_add_scalar function: * This function adds a scalar to the vector representation of an affine * expression (this means we add the scalar only to the very last entry of the * vector). It returns a new vector resulting from this addition. * \param[in] vector The basis vector. * \param[in] scalar The scalar to add to the vector. * \return A pointer to a new vector, copy of the basis one plus the scalar. */ osl_vector_p osl_vector_add_scalar(osl_vector_p vector, int scalar) { int i, precision, last; osl_vector_p result; if ((vector == NULL) || (vector->size < 2)) OSL_error("incompatible vector for addition"); precision = vector->precision; last = vector->size - 1; result = osl_vector_pmalloc(precision, vector->size); for (i = 0; i < vector->size; i++) osl_int_assign(precision, &result->v[i], vector->v[i]); osl_int_add_si(precision, &result->v[last], vector->v[last], scalar); return result; } /** * osl_vector_add function: * This function achieves the addition of two vectors and returns the * result as a new vector (the addition means the ith entry of the new vector * is equal to the ith entry of vector v1 plus the ith entry of vector v2). * \param v1 The first vector for the addition. * \param v2 The second vector for the addition. * \return A pointer to a new vector, corresponding to v1 + v2. */ osl_vector_p osl_vector_add(osl_vector_p v1, osl_vector_p v2) { int i; osl_vector_p v3; if ((v1 == NULL) || (v2 == NULL) || (v1->size != v2->size) || (v1->precision != v2->precision)) OSL_error("incompatible vectors for addition"); v3 = osl_vector_pmalloc(v1->precision, v1->size); for (i = 0; i < v1->size; i++) osl_int_add(v1->precision, &v3->v[i], v1->v[i], v2->v[i]); return v3; } /** * osl_vector_sub function: * This function achieves the subtraction of two vectors and returns the * result as a new vector (the addition means the ith entry of the new vector * is equal to the ith entry of vector v1 minus the ith entry of vector v2). * \param v1 The first vector for the subtraction. * \param v2 The second vector for the subtraction (result is v1-v2). * \return A pointer to a new vector, corresponding to v1 - v2. */ osl_vector_p osl_vector_sub(osl_vector_p v1, osl_vector_p v2) { int i; osl_vector_p v3; if ((v1 == NULL) || (v2 == NULL) || (v1->size != v2->size) || (v1->precision != v2->precision)) OSL_error("incompatible vectors for subtraction"); v3 = osl_vector_pmalloc(v1->precision, v1->size); for (i = 0; i < v1->size; i++) osl_int_sub(v1->precision, &v3->v[i], v1->v[i], v2->v[i]); return v3; } /** * osl_vector_tag_inequality function: * This function tags a vector representation of a contraint as being an * inequality >=0. This means in the PolyLib format, to set to 1 the very * first entry of the vector. It modifies directly the vector provided as * an argument. * \param vector The vector to be tagged. */ void osl_vector_tag_inequality(osl_vector_p vector) { if ((vector == NULL) || (vector->size < 1)) OSL_error("vector cannot be tagged"); osl_int_set_si(vector->precision, &vector->v[0], 1); } /** * osl_vector_tag_equality function: * This function tags a vector representation of a contraint as being an * equality ==0. This means in the PolyLib format, to set to 0 the very * first entry of the vector. It modifies directly the vector provided as * an argument. * \param vector The vector to be tagged. */ void osl_vector_tag_equality(osl_vector_p vector) { if ((vector == NULL) || (vector->size < 1)) OSL_error("vector cannot be tagged"); osl_int_set_si(vector->precision, &vector->v[0], 0); } /** * osl_vector_equal function: * this function returns true if the two vectors are the same, false * otherwise. * \param v1 The first vector. * \param v2 The second vector. * \return 1 if v1 and v2 are the same (content-wise), 0 otherwise. */ int osl_vector_equal(osl_vector_p v1, osl_vector_p v2) { int i; if (v1 == v2) return 1; if ((v1->size != v2->size) || (v1->precision != v2->precision)) return 0; for (i = 0; i < v1->size; i++) if (osl_int_ne(v1->precision, v1->v[i], v2->v[i])) return 0; return 1; } /** * osl_vector_mul_scalar function: * this function returns a new vector corresponding to the one provided * as parameter with each entry multiplied by a scalar. * \param v The vector to multiply. * \param scalar The scalar coefficient. * \return A new vector corresponding to scalar * v. */ osl_vector_p osl_vector_mul_scalar(osl_vector_p v, int scalar) { int i; osl_vector_p result = osl_vector_pmalloc(v->precision, v->size); for (i = 0; i < v->size; i++) osl_int_mul_si(v->precision, &result->v[i], v->v[i], scalar); return result; } /** * osl_vector_is_scalar function: * this function returns 1 if the vector represents a scalar value * (all but its last element is 0), 0 otherwise. * \param[in] vector The vector to check whether it is scalar or not. * \return 1 if the vector is scalar, 0 otherwise. */ int osl_vector_is_scalar(osl_vector_p vector) { int i; if (vector == NULL) return 0; for (i = 0; i < vector->size - 1; i++) if (!osl_int_zero(vector->precision, vector->v[i])) return 0; return 1; } cloog-0.18.4/osl/source/statement.c0000644000175000017500000007431712413270135014107 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** statement.c ** **-----------------------------------------------------------------** ** First version: 30/04/2008 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #include #include #include #include #include #include #include #include #include #include #include #include #include #include /*+*************************************************************************** * Structure display functions * *****************************************************************************/ /** * osl_statement_idump function: * this function displays an osl_statement_t structure (*statement) into * a file (file, possibly stdout) in a way that trends to be understandable. * It includes an indentation level (level) in order to work with others * dumping functions. * \param[in] file File where the information has to be printed. * \param[in] statement The statement whose information has to be printed. * \param[in] level Number of spaces before printing, for each line. */ void osl_statement_idump(FILE * file, osl_statement_p statement, int level) { int j, first = 1, number = 1; // Go to the right level. for (j = 0; j < level; j++) fprintf(file, "|\t"); if (statement != NULL) fprintf(file, "+-- osl_statement_t (S%d)\n", number); else fprintf(file, "+-- NULL statement\n"); while (statement != NULL) { if (!first) { // Go to the right level. for (j = 0; j < level; j++) fprintf(file, "|\t"); fprintf(file, "| osl_statement_t (S%d)\n", number); } else first = 0; // A blank line. for (j = 0; j <= level + 1; j++) fprintf(file, "|\t"); fprintf(file, "\n"); // Print the domain of the statement. osl_relation_idump(file, statement->domain, level + 1); // Print the scattering of the statement. osl_relation_idump(file, statement->scattering, level + 1); // Print the array access information of the statement. osl_relation_list_idump(file, statement->access, level + 1); // Print the original body expression. osl_generic_idump(file, statement->extension, level + 1); statement = statement->next; number++; // Next line. if (statement != NULL) { for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "V\n"); } } // The last line. for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "\n"); } /** * osl_statement_dump function: * this function prints the content of an osl_statement_t structure * (*statement) into a file (file, possibly stdout). * \param[in] file The file where the information has to be printed. * \param[in] statement The statement whose information has to be printed. */ void osl_statement_dump(FILE * file, osl_statement_p statement) { osl_statement_idump(file, statement, 0); } /** * osl_statement_names function: * this function generates as set of names for all the dimensions * involved in a given statement. * \param[in] statement The statement (list) we have to generate names for. * \return A set of generated names for the input statement dimensions. */ static osl_names_p osl_statement_names(osl_statement_p statement) { int nb_parameters = OSL_UNDEFINED; int nb_iterators = OSL_UNDEFINED; int nb_scattdims = OSL_UNDEFINED; int nb_localdims = OSL_UNDEFINED; int array_id = OSL_UNDEFINED; osl_statement_get_attributes(statement, &nb_parameters, &nb_iterators, &nb_scattdims, &nb_localdims, &array_id); return osl_names_generate("P", nb_parameters, "i", nb_iterators, "c", nb_scattdims, "l", nb_localdims, "A", array_id); } /** * osl_statement_pprint function: * this function pretty-prints the content of an osl_statement_t structure * (*statement) into a file (file, possibly stdout) in the OpenScop format. * \param[in] file The file where the information has to be printed. * \param[in] statement The statement whose information has to be printed. * \param[in] names The names of the constraint columns for comments. */ void osl_statement_pprint(FILE * file, osl_statement_p statement, osl_names_p names) { size_t nb_relations; int number = 1; int generated_names = 0; int iterators_backedup = 0; int nb_ext = 0; osl_body_p body = NULL; osl_strings_p iterators_backup = NULL; // Generate the dimension names if necessary and replace iterators with // statement iterators if possible. if (names == NULL) { generated_names = 1; names = osl_statement_names(statement); } while (statement != NULL) { // If possible, replace iterator names with statement iterator names. body = (osl_body_p)osl_generic_lookup(statement->extension, OSL_URI_BODY); if (body && body->iterators != NULL) { iterators_backedup = 1; iterators_backup = names->iterators; names->iterators = body->iterators; } nb_relations = 0; fprintf(file, "# =============================================== "); fprintf(file, "Statement %d\n", number); fprintf(file, "# Number of relations describing the statement:\n"); if (statement->domain != NULL) nb_relations ++; if (statement->scattering != NULL) nb_relations ++; nb_relations += osl_relation_list_count(statement->access); fprintf(file, "%lu\n\n", nb_relations); fprintf(file, "# ---------------------------------------------- "); fprintf(file, "%2d.1 Domain\n", number); osl_relation_pprint(file, statement->domain, names); fprintf(file, "\n"); fprintf(file, "# ---------------------------------------------- "); fprintf(file, "%2d.2 Scattering\n", number); osl_relation_pprint(file, statement->scattering, names); fprintf(file, "\n"); fprintf(file, "# ---------------------------------------------- "); fprintf(file, "%2d.3 Access\n", number); osl_relation_list_pprint_elts(file, statement->access, names); fprintf(file, "\n"); fprintf(file, "# ---------------------------------------------- "); fprintf(file, "%2d.4 Statement Extensions\n", number); fprintf(file, "# Number of Statement Extensions\n"); nb_ext = osl_generic_number(statement->extension); fprintf(file, "%d\n", nb_ext); if(nb_ext>0) osl_generic_print(file, statement->extension); fprintf(file, "\n"); // If necessary, switch back iterator names. if (iterators_backedup) { iterators_backedup = 0; names->iterators = iterators_backup; } statement = statement->next; number++; } if (generated_names) osl_names_free(names); } /** * osl_statement_pprint_scoplib function: * this function pretty-prints the content of an osl_statement_t structure * (*statement) into a file (file, possibly stdout) in the SCoPLib format. * \param[in] file The file where the information has to be printed. * \param[in] statement The statement whose information has to be printed. * \param[in] names The names of the constraint columns for comments. */ void osl_statement_pprint_scoplib(FILE * file, osl_statement_p statement, osl_names_p names) { int number = 1; int generated_names = 0; int iterators_backedup = 0; osl_body_p body = NULL; osl_strings_p iterators_backup = NULL; int add_fakeiter; // Generate the dimension names if necessary and replace iterators with // statement iterators if possible. if (names == NULL) { generated_names = 1; names = osl_statement_names(statement); } while (statement != NULL) { // If possible, replace iterator names with statement iterator names. body = (osl_body_p)osl_generic_lookup(statement->extension, OSL_URI_BODY); if (body && body->iterators != NULL) { iterators_backedup = 1; iterators_backup = names->iterators; names->iterators = body->iterators; } add_fakeiter = statement->domain->nb_rows == 0 && statement->scattering->nb_rows == 1; fprintf(file, "# =============================================== "); fprintf(file, "Statement %d\n", number); fprintf(file, "# ---------------------------------------------- "); fprintf(file, "%2d.1 Domain\n", number); fprintf(file, "# Iteration domain\n"); osl_relation_pprint_scoplib(file, statement->domain, names, 1, add_fakeiter); fprintf(file, "\n"); fprintf(file, "# ---------------------------------------------- "); fprintf(file, "%2d.2 Scattering\n", number); fprintf(file,"# Scattering function is provided\n1\n"); osl_relation_pprint_scoplib(file, statement->scattering, names, 0, add_fakeiter); fprintf(file, "\n"); fprintf(file, "# ---------------------------------------------- "); fprintf(file, "%2d.3 Access\n", number); fprintf(file,"# Access informations are provided\n1\n"); osl_relation_list_pprint_access_array_scoplib(file, statement->access, names, add_fakeiter); fprintf(file, "\n"); fprintf(file, "# ---------------------------------------------- "); fprintf(file, "%2d.4 Body\n", number); if (body != NULL) { fprintf(file, "# Statement body is provided\n1\n"); osl_body_print_scoplib(file, body); body = NULL; //re-initialize for next statement } else { fprintf(file, "# Statement body is not provided\n0\n"); } fprintf(file, "\n"); // If necessary, switch back iterator names. if (iterators_backedup) { iterators_backedup = 0; names->iterators = iterators_backup; } statement = statement->next; number++; } if (generated_names) osl_names_free(names); } /** * osl_statement_print function: * this function prints the content of an osl_statement_t structure * (*statement) into a file (file, possibly stdout) in the OpenScop format. * \param[in] file The file where the information has to be printed. * \param[in] statement The statement whose information has to be printed. */ void osl_statement_print(FILE * file, osl_statement_p statement) { osl_statement_pprint(file, statement, NULL); } /***************************************************************************** * Reading function * *****************************************************************************/ /** * osl_statement_dispatch function: * this function dispatches the relations from a relation list to the * convenient fields of a statement structure: it extracts the domain, * the scattering and the access list and store them accordingly in the * statement structure provided as a parameter. * \param[in,out] stmt The statement where to dispatch the relations. * \param[in,out] list The "brute" relation list to sort and dispatch (freed). */ static void osl_statement_dispatch(osl_statement_p stmt, osl_relation_list_p list) { osl_relation_list_p domain_list; osl_relation_list_p scattering_list; size_t nb_domains, nb_scattering, nb_accesses; // Domain. domain_list = osl_relation_list_filter(list, OSL_TYPE_DOMAIN); nb_domains = osl_relation_list_count(domain_list); if (nb_domains > 1) OSL_error("more than one domain for a statement"); if (domain_list != NULL) { stmt->domain = domain_list->elt; domain_list->elt = NULL; osl_relation_list_free(domain_list); } else { stmt->domain = NULL; } // Scattering. scattering_list=osl_relation_list_filter(list,OSL_TYPE_SCATTERING); nb_scattering = osl_relation_list_count(scattering_list); if (nb_scattering > 1) OSL_error("more than one scattering relation for a statement"); if (scattering_list != NULL) { stmt->scattering = scattering_list->elt; scattering_list->elt = NULL; osl_relation_list_free(scattering_list); } else { stmt->scattering = NULL; } // Access. stmt->access = osl_relation_list_filter(list, OSL_TYPE_ACCESS); nb_accesses = osl_relation_list_count(stmt->access); if ((nb_domains + nb_scattering + nb_accesses) != (osl_relation_list_count(list))) OSL_error("unexpected relation type to define a statement"); osl_relation_list_free(list); } /** * osl_statement_pread function ("precision read"): * this function reads an osl_statement_t structure from an input stream * (possibly stdin). * \param[in] file The input stream. * \param[in] registry The list of known interfaces (others are ignored). * \param[in] precision The precision of the relation elements. * \return A pointer to the statement structure that has been read. */ osl_statement_p osl_statement_pread(FILE * file, osl_interface_p registry, int precision) { osl_statement_p stmt = osl_statement_malloc(); osl_relation_list_p list; osl_generic_p new = NULL; int i, nb_ext = 0; if (file) { // Read all statement relations. list = osl_relation_list_pread(file, precision); // Store relations at the right place according to their type. osl_statement_dispatch(stmt, list); // Read the Extensions nb_ext = osl_util_read_int(file, NULL); for (i=0; iextension, new); } } return stmt; } /** * osl_statement_read function: * this function is equivalent to osl_statement_pread() except that * (1) the precision corresponds to the precision environment variable or * to the highest available precision if it is not defined, and * (2) the list of known interface is set to the default one. * \see{osl_statement_pread} */ osl_statement_p osl_statement_read(FILE * foo) { int precision = osl_util_get_precision(); osl_interface_p registry = osl_interface_get_default_registry(); osl_statement_p statement = osl_statement_pread(foo, registry, precision); osl_interface_free(registry); return statement; } /*+*************************************************************************** * Memory allocation/deallocation functions * *****************************************************************************/ /** * osl_statement_malloc function: * this function allocates the memory space for an osl_statement_t * structure and sets its fields with default values. Then it returns a pointer * to the allocated space. * \return A pointer to an empty statement with fields set to default values. */ osl_statement_p osl_statement_malloc() { osl_statement_p statement; OSL_malloc(statement, osl_statement_p, sizeof(osl_statement_t)); statement->domain = NULL; statement->scattering = NULL; statement->access = NULL; statement->extension = NULL; statement->next = NULL; return statement; } /** * osl_statement_free function: * this function frees the allocated memory for an osl_statement_t * structure. * \param[in,out] statement The pointer to the statement we want to free. */ void osl_statement_free(osl_statement_p statement) { osl_statement_p next; while (statement != NULL) { next = statement->next; osl_relation_free(statement->domain); osl_relation_free(statement->scattering); osl_relation_list_free(statement->access); osl_generic_free(statement->extension); free(statement); statement = next; } } /*+*************************************************************************** * Processing functions * *****************************************************************************/ /** * osl_statement_add function: * this function adds a statement "statement" at the end of the statement * list pointed by "location". * \param[in,out] location Address of the first element of the statement list. * \param[in] statement The statement to add to the list. */ void osl_statement_add(osl_statement_p * location, osl_statement_p statement) { while (*location != NULL) location = &((*location)->next); *location = statement; } /** * osl_statement_number function: * this function returns the number of statements in the statement list * provided as parameter. * \param[in] statement The first element of the statement list. * \return The number of statements in the statement list. */ int osl_statement_number(osl_statement_p statement) { int number = 0; while (statement != NULL) { number++; statement = statement->next; } return number; } /** * osl_statement_nclone function: * This function builds and returns a "hard copy" (not a pointer copy) of the * n first elements of an osl_statement_t list. * \param statement The pointer to the statement structure we want to clone. * \param n The number of nodes we want to copy (-1 for infinity). * \return The clone of the n first nodes of the statement list. */ osl_statement_p osl_statement_nclone(osl_statement_p statement, int n) { int first = 1, i = 0; osl_statement_p clone = NULL, node, previous = NULL; while ((statement != NULL) && ((n == -1) || (i < n))) { node = osl_statement_malloc(); node->domain = osl_relation_clone(statement->domain); node->scattering = osl_relation_clone(statement->scattering); node->access = osl_relation_list_clone(statement->access); node->extension = osl_generic_clone(statement->extension); node->next = NULL; if (first) { first = 0; clone = node; previous = node; } else { previous->next = node; previous = previous->next; } i++; statement = statement->next; } return clone; } /** * osl_statement_clone function: * This functions builds and returns a "hard copy" (not a pointer copy) of an * osl_statement_t data structure provided as parameter. * \param[in] statement The pointer to the statement we want to clone. * \return A pointer to the clone of the statement provided as parameter. */ osl_statement_p osl_statement_clone(osl_statement_p statement) { return osl_statement_nclone(statement, -1); } /** * osl_statement_equal function: * this function returns true if the two statements provided as parameters * are the same, false otherwise (the usr field is not tested). * \param[in] s1 The first statement. * \param[in] s2 The second statement. * \return 1 if s1 and s2 are the same (content-wise), 0 otherwise. */ int osl_statement_equal(osl_statement_p s1, osl_statement_p s2) { if (s1 == s2) return 1; if (((s1->next != NULL) && (s2->next == NULL)) || ((s1->next == NULL) && (s2->next != NULL))) { OSL_info("statements are not the same"); return 0; } if ((s1->next != NULL) && (s2->next != NULL)) { if (!osl_statement_equal(s1->next, s2->next)) { OSL_info("number of statements is not the same"); return 0; } } if (!osl_relation_equal(s1->domain, s2->domain)) { OSL_info("statement domains are not the same"); return 0; } if (!osl_relation_equal(s1->scattering, s2->scattering)) { OSL_info("statement scatterings are not the same"); return 0; } if (!osl_relation_list_equal(s1->access, s2->access)) { OSL_info("statement accesses are not the same"); return 0; } if (!osl_generic_equal(s1->extension, s2->extension)) { OSL_info("statement bodies are not the same"); return 0; } return 1; } /** * osl_statement_integrity_check function: * this function checks that a statement is "well formed" according to some * expected properties (setting an expected value to OSL_UNDEFINED means * that we do not expect a specific value). It returns 0 if the check failed * or 1 if no problem has been detected. * \param[in] statement The statement we want to check. * \param[in] expected_nb_parameters Expected number of parameters. * \return 0 if the integrity check fails, 1 otherwise. */ int osl_statement_integrity_check(osl_statement_p statement, int expected_nb_parameters) { int expected_nb_iterators; osl_body_p body = NULL; while (statement != NULL) { // Check the domain. if (!osl_relation_integrity_check(statement->domain, OSL_TYPE_DOMAIN, OSL_UNDEFINED, 0, expected_nb_parameters)) { return 0; } // Get the number of iterators. if (statement->domain != NULL) expected_nb_iterators = statement->domain->nb_output_dims; else expected_nb_iterators = OSL_UNDEFINED; // Check the scattering relation. if (!osl_relation_integrity_check(statement->scattering, OSL_TYPE_SCATTERING, OSL_UNDEFINED, expected_nb_iterators, expected_nb_parameters)) { return 0; } // Check the access relations. if (!osl_relation_list_integrity_check(statement->access, OSL_TYPE_ACCESS, OSL_UNDEFINED, expected_nb_iterators, expected_nb_parameters)) { return 0; } // Check the statement body. body = (osl_body_p)osl_generic_lookup(statement->extension, OSL_URI_BODY); if ((expected_nb_iterators != OSL_UNDEFINED) && body && body->iterators != NULL && ((size_t)expected_nb_iterators != osl_strings_size(body->iterators))) { OSL_warning("unexpected number of original iterators"); return 0; } statement = statement->next; } return 1; } /** * osl_statement_get_nb_iterators function: * this function returns the number of surroounding iterators of a given * statement. * \param statement The statement we want to know the number of iterators. * \return The number of surrounding iterators for the statement. */ int osl_statement_get_nb_iterators(osl_statement_p statement) { if (statement->domain == NULL) { OSL_warning("no statement domain, assuming 0 iterators"); return 0; } else { return statement->domain->nb_output_dims; } } /** * osl_statement_get_attributes function: * this function returns, through its parameters, the maximum values of the * relation attributes (nb_iterators, nb_parameters etc) in the statement. * HOWEVER, it updates the parameter value iff the attribute is greater than * the input parameter value. Hence it may be used to get the attributes as * well as to find the maximum attributes for several statement lists. The * array identifier 0 is used when there is no array identifier (AND this is * OK), OSL_UNDEFINED is used to report it is impossible to provide the * property while it should. This function is not intended for checking, the * input statement should be correct. * \param[in] statement The statement to extract attributes values. * \param[in,out] nb_parameters Number of parameter attribute. * \param[in,out] nb_iterators Number of iterators attribute. * \param[in,out] nb_scattdims Number of scattering dimensions attribute. * \param[in,out] nb_localdims Number of local dimensions attribute. * \param[in,out] array_id Maximum array identifier attribute. */ void osl_statement_get_attributes(osl_statement_p statement, int * nb_parameters, int * nb_iterators, int * nb_scattdims, int * nb_localdims, int * array_id) { int local_nb_parameters = OSL_UNDEFINED; int local_nb_iterators = OSL_UNDEFINED; int local_nb_scattdims = OSL_UNDEFINED; int local_nb_localdims = OSL_UNDEFINED; int local_array_id = OSL_UNDEFINED; while (statement != NULL) { osl_relation_get_attributes(statement->domain, &local_nb_parameters, &local_nb_iterators, &local_nb_scattdims, &local_nb_localdims, &local_array_id); osl_relation_get_attributes(statement->scattering, &local_nb_parameters, &local_nb_iterators, &local_nb_scattdims, &local_nb_localdims, &local_array_id); osl_relation_list_get_attributes(statement->access, &local_nb_parameters, &local_nb_iterators, &local_nb_scattdims, &local_nb_localdims, &local_array_id); // Update. *nb_parameters = OSL_max(*nb_parameters, local_nb_parameters); *nb_iterators = OSL_max(*nb_iterators, local_nb_iterators); *nb_scattdims = OSL_max(*nb_scattdims, local_nb_scattdims); *nb_localdims = OSL_max(*nb_localdims, local_nb_localdims); *array_id = OSL_max(*array_id, local_array_id); statement = statement->next; } } /** * osl_statement_get_body function: * this function returns the body of the statement. * \param[in] statement The statement to search the body. * \return the body if found, NULL otherwise. */ osl_body_p osl_statement_get_body(osl_statement_p statement) { osl_body_p body; osl_extbody_p ebody; if (statement == NULL || statement->extension == NULL) { return NULL; } body = (osl_body_p)osl_generic_lookup(statement->extension, OSL_URI_BODY); if (body != NULL) return body; ebody = (osl_extbody_p)osl_generic_lookup(statement->extension, OSL_URI_EXTBODY); if (ebody != NULL) return ebody->body; return NULL; } cloog-0.18.4/osl/source/relation.c0000644000175000017500000031677712413270135013731 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** relation.c ** **-----------------------------------------------------------------** ** First version: 30/04/2008 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #include #include #include #include #include #include #include #include #include #include #include /*+*************************************************************************** * Structure display function * *****************************************************************************/ /** * osl_relation_sprint_type function: * this function prints the textual type of an osl_relation_t structure into * a string, according to the OpenScop specification, and returns that string. * \param[in] relation The relation whose type has to be printed. * \return A string containing the relation type. */ static char * osl_relation_sprint_type(osl_relation_p relation) { char * string = NULL; OSL_malloc(string, char *, OSL_MAX_STRING * sizeof(char)); string[0] = '\0'; if (relation != NULL) { switch (relation->type) { case OSL_UNDEFINED: { snprintf(string, OSL_MAX_STRING, OSL_STRING_UNDEFINED); break; } case OSL_TYPE_CONTEXT: { snprintf(string, OSL_MAX_STRING, OSL_STRING_CONTEXT); break; } case OSL_TYPE_DOMAIN: { snprintf(string, OSL_MAX_STRING, OSL_STRING_DOMAIN); break; } case OSL_TYPE_SCATTERING: { snprintf(string, OSL_MAX_STRING, OSL_STRING_SCATTERING); break; } case OSL_TYPE_READ: { snprintf(string, OSL_MAX_STRING, OSL_STRING_READ); break; } case OSL_TYPE_WRITE: { snprintf(string, OSL_MAX_STRING, OSL_STRING_WRITE); break; } case OSL_TYPE_MAY_WRITE: { snprintf(string, OSL_MAX_STRING, OSL_STRING_MAY_WRITE); break; } default: { OSL_warning("unknown relation type, " "replaced with "OSL_STRING_UNDEFINED); snprintf(string, OSL_MAX_STRING, OSL_STRING_UNDEFINED); } } } return string; } /** * osl_relation_print_type function: * this function displays the textual type of an osl_relation_t structure into * a file (file, possibly stdout), according to the OpenScop specification. * \param[in] file File where informations are printed. * \param[in] relation The relation whose type has to be printed. */ static void osl_relation_print_type(FILE * file, osl_relation_p relation) { char * string = osl_relation_sprint_type(relation); fprintf(file, "%s", string); free(string); } /** * osl_relation_idump function: * this function displays a osl_relation_t structure (*relation) into a * file (file, possibly stdout) in a way that trends to be understandable. * It includes an indentation level (level) in order to work with others * idump functions. * \param[in] file File where informations are printed. * \param[in] relation The relation whose information has to be printed. * \param[in] level Number of spaces before printing, for each line. */ void osl_relation_idump(FILE * file, osl_relation_p relation, int level) { int i, j, first = 1; // Go to the right level. for (j = 0; j < level; j++) fprintf(file, "|\t"); if (relation != NULL) { fprintf(file, "+-- osl_relation_t ("); osl_relation_print_type(file, relation); fprintf(file, ", "); osl_int_dump_precision(file, relation->precision); fprintf(file, ")\n"); } else { fprintf(file, "+-- NULL relation\n"); } while (relation != NULL) { if (! first) { // Go to the right level. for (j = 0; j < level; j++) fprintf(file, "|\t"); fprintf(file, "| osl_relation_t ("); osl_relation_print_type(file, relation); fprintf(file, ", "); osl_int_dump_precision(file, relation->precision); fprintf(file, ")\n"); } else first = 0; // A blank line for(j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "%d %d %d %d %d %d\n", relation->nb_rows, relation->nb_columns, relation->nb_output_dims, relation->nb_input_dims, relation->nb_local_dims, relation->nb_parameters); // Display the relation. for (i = 0; i < relation->nb_rows; i++) { for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "[ "); for (j = 0; j < relation->nb_columns; j++) { osl_int_print(file, relation->precision, relation->m[i][j]); fprintf(file, " "); } fprintf(file, "]\n"); } relation = relation->next; // Next line. if (relation != NULL) { for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "|\n"); for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "V\n"); } } // The last line. for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "\n"); } /** * osl_relation_dump function: * this function prints the content of a osl_relation_t structure * (*relation) into a file (file, possibly stdout). * \param[in] file File where informations are printed. * \param[in] relation The relation whose information have to be printed. */ void osl_relation_dump(FILE * file, osl_relation_p relation) { osl_relation_idump(file, relation, 0); } /** * osl_relation_expression_element function: * this function returns a string containing the printing of a value (e.g., * an iterator with its coefficient or a constant). * \param[in] val Coefficient or constant value. * \param[in] precision The precision of the value. * \param[in,out] first Pointer to a boolean set to 1 if the current value * is the first of an expresion, 0 otherwise (maybe * updated). * \param[in] cst A boolean set to 1 if the value is a constant, * 0 otherwise. * \param[in] name String containing the name of the element. * \return A string that contains the printing of a value. */ static char * osl_relation_expression_element(osl_int_t val, int precision, int * first, int cst, char * name) { char * temp, * body, * sval; OSL_malloc(temp, char *, OSL_MAX_STRING * sizeof(char)); OSL_malloc(body, char *, OSL_MAX_STRING * sizeof(char)); OSL_malloc(sval, char *, OSL_MAX_STRING * sizeof(char)); body[0] = '\0'; sval[0] = '\0'; // statements for the 'normal' processing. if (!osl_int_zero(precision, val) && (!cst)) { if ((*first) || osl_int_neg(precision, val)) { if (osl_int_one(precision, val)) { // case 1 sprintf(sval, "%s", name); } else { if (osl_int_mone(precision, val)) { // case -1 sprintf(sval, "-%s", name); } else { // default case osl_int_sprint_txt(sval, precision, val); sprintf(temp, "*%s", name); strcat(sval, temp); } } *first = 0; } else { if (osl_int_one(precision, val)) { sprintf(sval, "+%s", name); } else { sprintf(sval, "+"); osl_int_sprint_txt(temp, precision, val); strcat(sval, temp); sprintf(temp, "*%s", name); strcat(sval, temp); } } } else { if (cst) { if ((osl_int_zero(precision, val) && (*first)) || (osl_int_neg(precision, val))) osl_int_sprint_txt(sval, precision, val); if (osl_int_pos(precision, val)) { if (!(*first)) { sprintf(sval, "+"); osl_int_sprint_txt(temp, precision, val); strcat(sval, temp); } else { osl_int_sprint_txt(sval, precision, val); } } } } free(temp); free(body); return(sval); } /** * osl_relation_strings function: * this function creates a NULL-terminated array of strings from an * osl_names_t structure in such a way that the ith string is the "name" * corresponding to the ith column of the constraint matrix. * \param[in] relation The relation for which we need an array of names. * \param[in] names The set of names for each element. * \return An array of strings with one string per constraint matrix column. */ static char ** osl_relation_strings(osl_relation_p relation, osl_names_p names) { char ** strings; char temp[OSL_MAX_STRING]; int i, offset; if ((relation == NULL) || (names == NULL)) { OSL_debug("no names or relation to build the name array"); return NULL; } OSL_malloc(strings, char **, (relation->nb_columns + 1)*sizeof(char *)); strings[relation->nb_columns] = NULL; // 1. Equality/inequality marker. OSL_strdup(strings[0], "e/i"); offset = 1; // 2. Output dimensions. if (osl_relation_is_access(relation)) { // The first output dimension is the array name. OSL_strdup(strings[offset], "Arr"); // The other ones are the array dimensions [1]...[n] for (i = offset + 1; i < relation->nb_output_dims + offset; i++) { sprintf(temp, "[%d]", i - 1); OSL_strdup(strings[i], temp); } } else if ((relation->type == OSL_TYPE_DOMAIN) || (relation->type == OSL_TYPE_CONTEXT)) { for (i = offset; i < relation->nb_output_dims + offset; i++) { OSL_strdup(strings[i], names->iterators->string[i - offset]); } } else { for (i = offset; i < relation->nb_output_dims + offset; i++) { OSL_strdup(strings[i], names->scatt_dims->string[i - offset]); } } offset += relation->nb_output_dims; // 3. Input dimensions. for (i = offset; i < relation->nb_input_dims + offset; i++) OSL_strdup(strings[i], names->iterators->string[i - offset]); offset += relation->nb_input_dims; // 4. Local dimensions. for (i = offset; i < relation->nb_local_dims + offset; i++) OSL_strdup(strings[i], names->local_dims->string[i - offset]); offset += relation->nb_local_dims; // 5. Parameters. for (i = offset; i < relation->nb_parameters + offset; i++) OSL_strdup(strings[i], names->parameters->string[i - offset]); offset += relation->nb_parameters; // 6. Scalar. OSL_strdup(strings[offset], "1"); return strings; } /** * osl_relation_subexpression function: * this function returns a string corresponding to an affine (sub-)expression * stored at the "row"^th row of the relation pointed by "relation" between * the start and stop columns. Optionally it may oppose the whole expression. * \param[in] relation A set of linear expressions. * \param[in] row The row corresponding to the expression. * \param[in] start The first column for the expression (inclusive). * \param[in] stop The last column for the expression (inclusive). * \param[in] oppose Boolean set to 1 to negate the expression, 0 otherwise. * \param[in] strings Array of textual names of the various elements. * \return A string that contains the printing of an affine (sub-)expression. */ static char * osl_relation_subexpression(osl_relation_p relation, int row, int start, int stop, int oppose, char ** strings) { int i, first = 1, constant; char * sval; char * sline; OSL_malloc(sline, char *, OSL_MAX_STRING * sizeof(char)); sline[0] = '\0'; // Create the expression. The constant is a special case. for (i = start; i <= stop; i++) { if (oppose) { osl_int_oppose(relation->precision, &relation->m[row][i], relation->m[row][i]); } if (i == relation->nb_columns - 1) constant = 1; else constant = 0; sval = osl_relation_expression_element(relation->m[row][i], relation->precision, &first, constant, strings[i]); if (oppose) { osl_int_oppose(relation->precision, &relation->m[row][i], relation->m[row][i]); } strcat(sline, sval); free(sval); } return sline; } /** * osl_relation_expression function: * this function returns a string corresponding to an affine expression * stored at the "row"^th row of the relation pointed by "relation". * \param[in] relation A set of linear expressions. * \param[in] row The row corresponding to the expression. * \param[in] strings Array of textual names of the various elements. * \return A string that contains the printing of an affine expression. */ char * osl_relation_expression(osl_relation_p relation, int row, char ** strings) { return osl_relation_subexpression(relation, row, 1, relation->nb_columns - 1, 0, strings); } /** * osl_relation_is_simple_output function: * this function returns 1 or -1 if a given constraint row of a relation * corresponds to an output, 0 otherwise. We call a simple output an equality * constraint where exactly one output coefficient is not 0 and is either * 1 (in this case the function returns 1) or -1 (in this case the function * returns -1). * \param[in] relation The relation to test for simple output. * \param[in] row The row corresponding to the constraint to test. * \return 1 or -1 if the row is a simple output, 0 otherwise. */ static int osl_relation_is_simple_output(osl_relation_p relation, int row) { int i; int first = 1; int sign = 0; if ((relation == NULL) || (relation->m == NULL) || (relation->nb_output_dims == 0)) return 0; if ((row < 0) || (row > relation->nb_rows)) OSL_error("the specified row does not exist in the relation"); // The constraint must be an equality. if (!osl_int_zero(relation->precision, relation->m[row][0])) return 0; // Check the output part has one and only one non-zero +1 or -1 coefficient. first = 1; for (i = 1; i <= relation->nb_output_dims; i++) { if (!osl_int_zero(relation->precision, relation->m[row][i])) { if (first) first = 0; else return 0; if (osl_int_one(relation->precision, relation->m[row][i])) sign = 1; else if (osl_int_mone(relation->precision, relation->m[row][i])) sign = -1; else return 0; } } return sign; } /** * osl_relation_sprint_comment function: * this function prints into a string a comment corresponding to a constraint * of a relation, according to its type, then it returns this string. This * function does not check that printing the comment is possible (i.e., are * there enough names ?), hence it is the responsibility of the user to ensure * he/she can call this function safely. * \param[in] relation The relation for which a comment has to be printed. * \param[in] row The constrain row for which a comment has to be printed. * \param[in] strings Array of textual names of the various elements. * \param[in] arrays Array of textual identifiers of the arrays. * \return A string which contains the comment for the row. */ static char * osl_relation_sprint_comment(osl_relation_p relation, int row, char ** strings, char ** arrays) { int sign; int high_water_mark = OSL_MAX_STRING; char * string = NULL; char * expression; char buffer[OSL_MAX_STRING]; OSL_malloc(string, char *, high_water_mark * sizeof(char)); string[0] = '\0'; if ((relation == NULL) || (strings == NULL)) { OSL_debug("no relation or names while asked to print a comment"); return string; } if ((sign = osl_relation_is_simple_output(relation, row))) { // First case : output == expression. expression = osl_relation_subexpression(relation, row, 1, relation->nb_output_dims, sign < 0, strings); snprintf(buffer, OSL_MAX_STRING, " ## %s", expression); osl_util_safe_strcat(&string, buffer, &high_water_mark); free(expression); // We don't print the right hand side if it's an array identifier. if (!osl_relation_is_access(relation) || osl_int_zero(relation->precision, relation->m[row][1])) { expression = osl_relation_subexpression(relation, row, relation->nb_output_dims + 1, relation->nb_columns - 1, sign > 0, strings); snprintf(buffer, OSL_MAX_STRING, " == %s", expression); osl_util_safe_strcat(&string, buffer, &high_water_mark); free(expression); } else { snprintf(buffer, OSL_MAX_STRING, " == %s", arrays[osl_relation_get_array_id(relation) - 1]); osl_util_safe_strcat(&string, buffer, &high_water_mark); } } else { // Second case : general case. expression = osl_relation_expression(relation, row, strings); snprintf(buffer, OSL_MAX_STRING, " ## %s", expression); osl_util_safe_strcat(&string, buffer, &high_water_mark); free(expression); if (osl_int_zero(relation->precision, relation->m[row][0])) snprintf(buffer, OSL_MAX_STRING, " == 0"); else snprintf(buffer, OSL_MAX_STRING, " >= 0"); osl_util_safe_strcat(&string, buffer, &high_water_mark); } return string; } /** * osl_relation_column_string function: * this function returns an OpenScop comment string showing all column * names. It is designed to nicely fit a constraint matrix that would be * printed just below this line. * \param[in] relation The relation related to the comment line to build. * \param[in] strings Array of textual names of the various elements. * \return A fancy comment string with all the dimension names. */ static char * osl_relation_column_string(osl_relation_p relation, char ** strings) { int i, j; int index_output_dims; int index_input_dims; int index_local_dims; int index_parameters; int index_scalar; int space, length, left, right; char * scolumn; char temp[OSL_MAX_STRING]; OSL_malloc(scolumn, char *, OSL_MAX_STRING); index_output_dims = 1; index_input_dims = index_output_dims + relation->nb_output_dims; index_local_dims = index_input_dims + relation->nb_input_dims; index_parameters = index_local_dims + relation->nb_local_dims; index_scalar = index_parameters + relation->nb_parameters; // 1. The comment part. sprintf(scolumn, "#"); for (j = 0; j < (OSL_FMT_LENGTH - 1)/2 - 1; j++) strcat(scolumn, " "); i = 0; while (strings[i] != NULL) { space = OSL_FMT_LENGTH; length = (space > (int)strlen(strings[i])) ? (int)strlen(strings[i]) : space; right = (space - length + (OSL_FMT_LENGTH % 2)) / 2; left = space - length - right; // 2. Spaces before the name for (j = 0; j < left; j++) strcat(scolumn, " "); // 3. The (abbreviated) name for (j = 0; j < length - 1; j++) { sprintf(temp, "%c", strings[i][j]); strcat(scolumn, temp); } if (length >= (int)strlen(strings[i])) sprintf(temp, "%c", strings[i][j]); else sprintf(temp, "."); strcat(scolumn, temp); // 4. Spaces after the name for (j = 0; j < right; j++) strcat(scolumn, " "); i++; if ((i == index_output_dims) || (i == index_input_dims) || (i == index_local_dims) || (i == index_parameters) || (i == index_scalar)) strcat(scolumn, "|"); else strcat(scolumn, " "); } strcat(scolumn, "\n"); return scolumn; } /** * osl_relation_column_string_scoplib function: * this function returns an OpenScop comment string showing all column * names. It is designed to nicely fit a constraint matrix that would be * printed just below this line. * \param[in] relation The relation related to the comment line to build. * \param[in] strings Array of textual names of the various elements. * \return A fancy comment string with all the dimension names. */ static char * osl_relation_column_string_scoplib(osl_relation_p relation, char ** strings) { int i, j; int index_output_dims; int index_input_dims; int index_local_dims; int index_parameters; int index_scalar; int space, length, left, right; char * scolumn; char temp[OSL_MAX_STRING]; OSL_malloc(scolumn, char *, OSL_MAX_STRING); index_output_dims = 1; index_input_dims = index_output_dims + relation->nb_output_dims; index_local_dims = index_input_dims + relation->nb_input_dims; index_parameters = index_local_dims + relation->nb_local_dims; index_scalar = index_parameters + relation->nb_parameters; // 1. The comment part. sprintf(scolumn, "#"); for (j = 0; j < (OSL_FMT_LENGTH - 1)/2 - 1; j++) strcat(scolumn, " "); i = 0; while (strings[i] != NULL) { if (i == 0 || (relation->type != OSL_TYPE_DOMAIN && i >= index_input_dims) || (relation->type == OSL_TYPE_DOMAIN && i <= index_output_dims) || i >= index_parameters) { space = OSL_FMT_LENGTH; length = (space > (int)strlen(strings[i])) ? (int)strlen(strings[i]) : space; right = (space - length + (OSL_FMT_LENGTH % 2)) / 2; left = space - length - right; // 2. Spaces before the name for (j = 0; j < left; j++) strcat(scolumn, " "); // 3. The (abbreviated) name for (j = 0; j < length - 1; j++) { sprintf(temp, "%c", strings[i][j]); strcat(scolumn, temp); } if (length >= (int)strlen(strings[i])) sprintf(temp, "%c", strings[i][j]); else sprintf(temp, "."); strcat(scolumn, temp); // 4. Spaces after the name for (j = 0; j < right; j++) strcat(scolumn, " "); if ((i == index_output_dims-1) || (i == index_input_dims-1) || (i == index_local_dims-1) || (i == index_parameters-1) || (i == index_scalar-1)) strcat(scolumn, "|"); else strcat(scolumn, " "); } i++; } strcat(scolumn, "\n"); return scolumn; } /** * osl_relation_names function: * this function generates as set of names for all the dimensions * involved in a given relation. * \param[in] relation The relation we have to generate names for. * \return A set of generated names for the input relation dimensions. */ static osl_names_p osl_relation_names(osl_relation_p relation) { int nb_parameters = OSL_UNDEFINED; int nb_iterators = OSL_UNDEFINED; int nb_scattdims = OSL_UNDEFINED; int nb_localdims = OSL_UNDEFINED; int array_id = OSL_UNDEFINED; osl_relation_get_attributes(relation, &nb_parameters, &nb_iterators, &nb_scattdims, &nb_localdims, &array_id); return osl_names_generate("P", nb_parameters, "i", nb_iterators, "c", nb_scattdims, "l", nb_localdims, "A", array_id); } /** * osl_relation_nb_components function: * this function returns the number of component in the union of relations * provided as parameter. * \param[in] relation The input union of relations. * \return The number of components in the input union of relations. */ int osl_relation_nb_components(osl_relation_p relation) { int nb_components = 0; while (relation != NULL) { nb_components++; relation = relation->next; } return nb_components; } /** * osl_relation_spprint_polylib function: * this function pretty-prints the content of an osl_relation_t structure * (*relation) into a string in the extended polylib format, and returns this * string. This format is the same as OpenScop's, minus the type. * \param[in] relation The relation whose information has to be printed. * \param[in] names The names of the constraint columns for comments. * \return A string containing the relation pretty-printing. */ char * osl_relation_spprint_polylib(osl_relation_p relation, osl_names_p names) { int i, j; int part, nb_parts; int generated_names = 0; int high_water_mark = OSL_MAX_STRING; char * string = NULL; char buffer[OSL_MAX_STRING]; char ** name_array = NULL; char * scolumn; char * comment; if (relation == NULL) return osl_util_strdup("# NULL relation\n"); OSL_malloc(string, char *, high_water_mark * sizeof(char)); string[0] = '\0'; // Generates the names for the comments if necessary. if (names == NULL) { generated_names = 1; names = osl_relation_names(relation); } nb_parts = osl_relation_nb_components(relation); if (nb_parts > 1) { snprintf(buffer, OSL_MAX_STRING, "# Union with %d parts\n%d\n", nb_parts, nb_parts); osl_util_safe_strcat(&string, buffer, &high_water_mark); } // Print each part of the union. for (part = 1; part <= nb_parts; part++) { // Prepare the array of strings for comments. name_array = osl_relation_strings(relation, names); if (nb_parts > 1) { snprintf(buffer, OSL_MAX_STRING, "# Union part No.%d\n", part); osl_util_safe_strcat(&string, buffer, &high_water_mark); } snprintf(buffer, OSL_MAX_STRING, "%d %d %d %d %d %d\n", relation->nb_rows, relation->nb_columns, relation->nb_output_dims, relation->nb_input_dims, relation->nb_local_dims, relation->nb_parameters); osl_util_safe_strcat(&string, buffer, &high_water_mark); if (relation->nb_rows > 0) { scolumn = osl_relation_column_string(relation, name_array); snprintf(buffer, OSL_MAX_STRING, "%s", scolumn); osl_util_safe_strcat(&string, buffer, &high_water_mark); free(scolumn); } for (i = 0; i < relation->nb_rows; i++) { for (j = 0; j < relation->nb_columns; j++) { osl_int_sprint(buffer, relation->precision, relation->m[i][j]); osl_util_safe_strcat(&string, buffer, &high_water_mark); snprintf(buffer, OSL_MAX_STRING, " "); osl_util_safe_strcat(&string, buffer, &high_water_mark); } if (name_array != NULL) { comment = osl_relation_sprint_comment(relation, i, name_array, names->arrays->string); osl_util_safe_strcat(&string, comment, &high_water_mark); free(comment); } snprintf(buffer, OSL_MAX_STRING, "\n"); osl_util_safe_strcat(&string, buffer, &high_water_mark); } // Free the array of strings. if (name_array != NULL) { for (i = 0; i < relation->nb_columns; i++) free(name_array[i]); free(name_array); } relation = relation->next; } if (generated_names) osl_names_free(names); return string; } /** * osl_relation_spprint_polylib_scoplib function: * this function pretty-prints the content of an osl_relation_t structure * (*relation) into a string in the extended polylib format, and returns this * string. * \param[in] relation The relation whose information has to be printed. * \param[in] names The names of the constraint columns for comments. * \param[in] print_nth_part Print the value of `n' (used for domain union) * \param[in] add_fakeiter * \return A string containing the relation pretty-printing. */ char * osl_relation_spprint_polylib_scoplib(osl_relation_p relation, osl_names_p names, int print_nth_part, int add_fakeiter) { int i, j; int part, nb_parts; int generated_names = 0; int is_access_array; int high_water_mark = OSL_MAX_STRING; int start_row; // for removing the first line in the access matrix int index_output_dims; int index_input_dims; int index_params; char * string = NULL; char buffer[OSL_MAX_STRING]; char ** name_array = NULL; char * scolumn; char * comment; if (relation == NULL) return osl_util_strdup("# NULL relation\n"); OSL_malloc(string, char *, high_water_mark * sizeof(char)); string[0] = '\0'; // Generates the names for the comments if necessary. if (names == NULL) { generated_names = 1; names = osl_relation_names(relation); } nb_parts = osl_relation_nb_components(relation); if (nb_parts > 1) { snprintf(buffer, OSL_MAX_STRING, "# Union with %d parts\n%d\n", nb_parts, nb_parts); osl_util_safe_strcat(&string, buffer, &high_water_mark); } is_access_array = (relation->type == OSL_TYPE_READ || relation->type == OSL_TYPE_WRITE ? 1 : 0); // Print each part of the union. for (part = 1; part <= nb_parts; part++) { index_output_dims = 1; index_input_dims = index_output_dims + relation->nb_output_dims; index_params = index_input_dims + relation->nb_input_dims; // Prepare the array of strings for comments. name_array = osl_relation_strings(relation, names); if (nb_parts > 1) { snprintf(buffer, OSL_MAX_STRING, "# Union part No.%d\n", part); osl_util_safe_strcat(&string, buffer, &high_water_mark); } if (print_nth_part) { snprintf(buffer, OSL_MAX_STRING, "%d\n", part); osl_util_safe_strcat(&string, buffer, &high_water_mark); } // Don't print the array size for access array // (the total size is printed in osl_relation_list_pprint_access_array_scoplib) if (!is_access_array) { // Print array size if (relation->type == OSL_TYPE_DOMAIN) { if (add_fakeiter) { snprintf(buffer, OSL_MAX_STRING, "%d %d\n", relation->nb_rows+1, relation->nb_columns - relation->nb_input_dims + 1); osl_util_safe_strcat(&string, buffer, &high_water_mark); // add the fakeiter line snprintf(buffer, OSL_MAX_STRING, " 0 "); osl_util_safe_strcat(&string, buffer, &high_water_mark); snprintf(buffer, OSL_MAX_STRING, " 1 "); // fakeiter osl_util_safe_strcat(&string, buffer, &high_water_mark); for (i = 0 ; i < relation->nb_parameters ; i++) { snprintf(buffer, OSL_MAX_STRING, " 0 "); osl_util_safe_strcat(&string, buffer, &high_water_mark); } snprintf(buffer, OSL_MAX_STRING, " 0 ## fakeiter == 0\n"); osl_util_safe_strcat(&string, buffer, &high_water_mark); } else { snprintf(buffer, OSL_MAX_STRING, "%d %d\n", relation->nb_rows, relation->nb_columns - relation->nb_input_dims); osl_util_safe_strcat(&string, buffer, &high_water_mark); } } else { // SCATTERING if (add_fakeiter) { snprintf(buffer, OSL_MAX_STRING, "%d %d\n", relation->nb_rows+2, relation->nb_columns - relation->nb_output_dims + 1); osl_util_safe_strcat(&string, buffer, &high_water_mark); } else { snprintf(buffer, OSL_MAX_STRING, "%d %d\n", relation->nb_rows, relation->nb_columns - relation->nb_output_dims); osl_util_safe_strcat(&string, buffer, &high_water_mark); } } // Print column names in comment if (relation->nb_rows > 0) { scolumn = osl_relation_column_string_scoplib(relation, name_array); snprintf(buffer, OSL_MAX_STRING, "%s", scolumn); osl_util_safe_strcat(&string, buffer, &high_water_mark); free(scolumn); } start_row = 0; } else { if (relation->nb_rows == 1) // for non array variables start_row = 0; else // Remove the 'Arr' line start_row = 1; } // Print the array for (i = start_row; i < relation->nb_rows; i++) { // First column if (!is_access_array) { // array index name for scoplib osl_int_sprint(buffer, relation->precision, relation->m[i][0]); osl_util_safe_strcat(&string, buffer, &high_water_mark); snprintf(buffer, OSL_MAX_STRING, " "); osl_util_safe_strcat(&string, buffer, &high_water_mark); } else { // The first column represents the array index name in openscop if (i == start_row) osl_int_sprint(buffer, relation->precision, relation->m[0][relation->nb_columns-1]); else snprintf(buffer, OSL_MAX_STRING, " 0 "); osl_util_safe_strcat(&string, buffer, &high_water_mark); snprintf(buffer, OSL_MAX_STRING, " "); osl_util_safe_strcat(&string, buffer, &high_water_mark); } // Rest of the array if (relation->type == OSL_TYPE_DOMAIN) { for (j = 1; j < index_input_dims; j++) { osl_int_sprint(buffer, relation->precision, relation->m[i][j]); osl_util_safe_strcat(&string, buffer, &high_water_mark); snprintf(buffer, OSL_MAX_STRING, " "); osl_util_safe_strcat(&string, buffer, &high_water_mark); } // Jmp input_dims for (j = index_params; j < relation->nb_columns; j++) { osl_int_sprint(buffer, relation->precision, relation->m[i][j]); osl_util_safe_strcat(&string, buffer, &high_water_mark); snprintf(buffer, OSL_MAX_STRING, " "); osl_util_safe_strcat(&string, buffer, &high_water_mark); } } else { // Jmp output_dims for (j = index_input_dims; j < index_params; j++) { if (is_access_array && relation->nb_rows == 1 && j == relation->nb_columns-1) { snprintf(buffer, OSL_MAX_STRING, " 0 "); osl_util_safe_strcat(&string, buffer, &high_water_mark); } else { osl_int_sprint(buffer, relation->precision, relation->m[i][j]); osl_util_safe_strcat(&string, buffer, &high_water_mark); snprintf(buffer, OSL_MAX_STRING, " "); osl_util_safe_strcat(&string, buffer, &high_water_mark); } } if (add_fakeiter) { snprintf(buffer, OSL_MAX_STRING, " 0 "); osl_util_safe_strcat(&string, buffer, &high_water_mark); } for (; j < relation->nb_columns; j++) { if (is_access_array && relation->nb_rows == 1 && j == relation->nb_columns-1) { snprintf(buffer, OSL_MAX_STRING, " 0 "); osl_util_safe_strcat(&string, buffer, &high_water_mark); } else { osl_int_sprint(buffer, relation->precision, relation->m[i][j]); osl_util_safe_strcat(&string, buffer, &high_water_mark); snprintf(buffer, OSL_MAX_STRING, " "); osl_util_safe_strcat(&string, buffer, &high_water_mark); } } } // equation in comment if (name_array != NULL) { comment = osl_relation_sprint_comment(relation, i, name_array, names->arrays->string); osl_util_safe_strcat(&string, comment, &high_water_mark); free(comment); snprintf(buffer, OSL_MAX_STRING, "\n"); osl_util_safe_strcat(&string, buffer, &high_water_mark); } // add the lines in the scattering if we need the fakeiter if (relation->nb_rows > 0 && add_fakeiter && relation->type == OSL_TYPE_SCATTERING) { for (i = 0 ; i < 2 ; i++) { for (j = 0; j < relation->nb_columns; j++) { if (j == index_output_dims && i == 0) snprintf(buffer, OSL_MAX_STRING, " 1 "); // fakeiter else snprintf(buffer, OSL_MAX_STRING, " 0 "); osl_util_safe_strcat(&string, buffer, &high_water_mark); } snprintf(buffer, OSL_MAX_STRING, "\n"); osl_util_safe_strcat(&string, buffer, &high_water_mark); } } } // Free the array of strings. if (name_array != NULL) { for (i = 0; i < relation->nb_columns; i++) free(name_array[i]); free(name_array); } relation = relation->next; } if (generated_names) osl_names_free(names); return string; } /** * osl_relation_spprint function: * this function pretty-prints the content of an osl_relation_t structure * (*relation) into a string in the OpenScop format, and returns this string. * \param[in] relation The relation whose information has to be printed. * \param[in] names The names of the constraint columns for comments. * \return A string */ char * osl_relation_spprint(osl_relation_p relation, osl_names_p names) { int high_water_mark = OSL_MAX_STRING; char * string = NULL; char * temp; char buffer[OSL_MAX_STRING]; OSL_malloc(string, char *, high_water_mark * sizeof(char)); string[0] = '\0'; if (osl_relation_nb_components(relation) > 0) { temp = osl_relation_sprint_type(relation); osl_util_safe_strcat(&string, temp, &high_water_mark); free(temp); snprintf(buffer, OSL_MAX_STRING, "\n"); osl_util_safe_strcat(&string, buffer, &high_water_mark); temp = osl_relation_spprint_polylib(relation, names); osl_util_safe_strcat(&string, temp, &high_water_mark); free(temp); } return string; } /** * osl_relation_spprint_scoplib function: * this function pretty-prints the content of an osl_relation_t structure * (*relation) into a string in the SCoPLib format, and returns this string. * \param[in] relation The relation whose information has to be printed. * \param[in] names The names of the constraint columns for comments. * \param[in] print_nth_part Print the value of `n' (used for domain union) * \param[in] add_fakeiter * \return A string */ char * osl_relation_spprint_scoplib(osl_relation_p relation, osl_names_p names, int print_nth_part, int add_fakeiter) { int high_water_mark = OSL_MAX_STRING; char * string = NULL; char * temp; OSL_malloc(string, char *, high_water_mark * sizeof(char)); string[0] = '\0'; if (relation) { temp = osl_relation_spprint_polylib_scoplib(relation, names, print_nth_part, add_fakeiter); osl_util_safe_strcat(&string, temp, &high_water_mark); free(temp); } return string; } /** * osl_relation_pprint function: * this function pretty-prints the content of an osl_relation_t structure * (*relation) into a file (file, possibly stdout) in the OpenScop format. * \param[in] file File where informations are printed. * \param[in] relation The relation whose information has to be printed. * \param[in] names The names of the constraint columns for comments. */ void osl_relation_pprint(FILE * file, osl_relation_p relation, osl_names_p names) { char * string = osl_relation_spprint(relation, names); fprintf(file, "%s", string); free(string); } /** * osl_relation_pprint_scoplib function: * this function pretty-prints the content of an osl_relation_t structure * (*relation) into a file (file, possibly stdout) in the SCoPLibformat. * \param[in] file File where informations are printed. * \param[in] relation The relation whose information has to be printed. * \param[in] names The names of the constraint columns for comments. * \param[in] print_nth_part * \param[in] add_fakeiter */ void osl_relation_pprint_scoplib(FILE * file, osl_relation_p relation, osl_names_p names, int print_nth_part, int add_fakeiter) { char * string = osl_relation_spprint_scoplib(relation, names, print_nth_part, add_fakeiter); fprintf(file, "%s", string); free(string); } /** * osl_relation_sprint function: * this function prints the content of an osl_relation_t structure * (*relation) into a string (returned) in the OpenScop textual format. * \param[in] relation The relation structure to print. * \return A string containing the OpenScop dump of the relation structure. */ char * osl_relation_sprint(osl_relation_p relation) { return osl_relation_spprint(relation, NULL); } /** * osl_relation_print function: * this function prints the content of an osl_relation_t structure * (*relation) into a file (file, possibly stdout) in the OpenScop format. * \param[in] file File where informations are printed. * \param[in] relation The relation whose information has to be printed. */ void osl_relation_print(FILE * file, osl_relation_p relation) { osl_relation_pprint(file, relation, NULL); } /***************************************************************************** * Reading function * *****************************************************************************/ /** * osl_relation_read_type function: * this function reads a textual relation type on the input 'file' or the * input string 'str' depending on which one is not NULL (exactly * one of them must not be NULL). It returns its integer counterpart. * \param[in] file The file where to read a relation type (if not NULL). * \param[in,out] str The string where to read a relation type (if not NULL). * This pointer is updated to reflect the read and points * after the tag in the input string. * \return The relation type. */ static int osl_relation_read_type(FILE * file, char ** str) { int type; osl_strings_p strings; if ((file != NULL && str != NULL) || (file == NULL && str == NULL)) OSL_error("one and only one of the two parameters can be non-NULL"); if (file != NULL) strings = osl_strings_read(file); else strings = osl_strings_sread(str); if (osl_strings_size(strings) > 1) { OSL_warning("uninterpreted information (after the relation type)"); } if (osl_strings_size(strings) == 0) OSL_error("no relation type"); if (!strcmp(strings->string[0], OSL_STRING_UNDEFINED)) { type = OSL_UNDEFINED; goto return_type; } if (!strcmp(strings->string[0], OSL_STRING_CONTEXT)) { type = OSL_TYPE_CONTEXT; goto return_type; } if (!strcmp(strings->string[0], OSL_STRING_DOMAIN)) { type = OSL_TYPE_DOMAIN; goto return_type; } if (!strcmp(strings->string[0], OSL_STRING_SCATTERING)) { type = OSL_TYPE_SCATTERING; goto return_type; } if (!strcmp(strings->string[0], OSL_STRING_READ)) { type = OSL_TYPE_READ; goto return_type; } if (!strcmp(strings->string[0], OSL_STRING_WRITE)) { type = OSL_TYPE_WRITE; goto return_type; } if (!strcmp(strings->string[0], OSL_STRING_MAY_WRITE)) { type = OSL_TYPE_MAY_WRITE; goto return_type; } OSL_error("relation type not supported"); return_type: osl_strings_free(strings); return type; } /** * osl_relation_pread function ("precision read"): * this function reads a relation into a file (foo, posibly stdin) and * returns a pointer this relation. * \param[in] foo The input stream. * \param[in] precision The precision of the relation elements. * \return A pointer to the relation structure that has been read. */ osl_relation_p osl_relation_pread(FILE * foo, int precision) { int i, j, k, n, read = 0; int nb_rows, nb_columns; int nb_output_dims, nb_input_dims, nb_local_dims, nb_parameters; int nb_union_parts = 1; int may_read_nb_union_parts = 1; int read_attributes = 1; int first = 1; int type; char * c, s[OSL_MAX_STRING], str[OSL_MAX_STRING], *tmp; osl_relation_p relation, relation_union = NULL, previous = NULL; type = osl_relation_read_type(foo, NULL); // Read each part of the union (the number of parts may be updated inside) for (k = 0; k < nb_union_parts; k++) { // Read the number of union parts or the attributes of the union part while (read_attributes) { read_attributes = 0; // Read relation attributes. c = osl_util_skip_blank_and_comments(foo, s); read = sscanf(c, " %d %d %d %d %d %d", &nb_rows, &nb_columns, &nb_output_dims, &nb_input_dims, &nb_local_dims, &nb_parameters); if (((read != 1) && (read != 6)) || ((read == 1) && (may_read_nb_union_parts != 1))) OSL_error("not 1 or 6 integers on the first relation line"); if (read == 1) { // Only one number means a union and is the number of parts. nb_union_parts = nb_rows; if (nb_union_parts < 1) OSL_error("negative nb of union parts"); // Allow to read the properties of the first part of the union. read_attributes = 1; } may_read_nb_union_parts = 0; } // Allocate the union part and fill its properties. relation = osl_relation_pmalloc(precision, nb_rows, nb_columns); relation->type = type; relation->nb_output_dims = nb_output_dims; relation->nb_input_dims = nb_input_dims; relation->nb_local_dims = nb_local_dims; relation->nb_parameters = nb_parameters; // Read the matrix of constraints. for (i = 0; i < relation->nb_rows; i++) { c = osl_util_skip_blank_and_comments(foo, s); if (c == NULL) OSL_error("not enough rows"); for (j = 0; j < relation->nb_columns; j++) { if (c == NULL || *c == '#' || *c == '\n') OSL_error("not enough columns"); if (sscanf(c, "%s%n", str, &n) == 0) OSL_error("not enough rows"); // TODO: remove this tmp (sread updates the pointer). tmp = str; osl_int_sread(&tmp, precision, &relation->m[i][j]); c += n; } } // Build the linked list of union parts. if (first == 1) { relation_union = relation; first = 0; } else { previous->next = relation; } previous = relation; read_attributes = 1; } return relation_union; } /** * osl_relation_psread function ("precision read"): * this function is equivalent to osl_relation_psread_polylib() except that * it reads an the type of the relation before reading the rest of the * input. * \see{osl_relation_psread_polylib} */ osl_relation_p osl_relation_psread(char ** input, int precision) { int type; osl_relation_p relation; type = osl_relation_read_type(NULL, input); relation = osl_relation_psread_polylib(input, precision); relation->type = type; return relation; } /** * osl_relation_psread_polylib function ("precision read"): * this function reads a relation from a string complying to the Extended * PolyLib textual format and returns a pointer this relation. The input * parameter is updated to the position in the input string this function * reach right after reading the generic structure. * \param[in,out] input The input string where to find a relation. * Updated to the position after what has been read. * \param[in] precision The precision of the relation elements. * \return A pointer to the relation structure that has been read. */ osl_relation_p osl_relation_psread_polylib(char ** input, int precision) { int i, j, k, n, read = 0; int nb_rows, nb_columns; int nb_output_dims, nb_input_dims, nb_local_dims, nb_parameters; int nb_union_parts = 1; int may_read_nb_union_parts = 1; int read_attributes = 1; int first = 1; char str[OSL_MAX_STRING], *tmp; osl_relation_p relation, relation_union = NULL, previous = NULL; // Read each part of the union (the number of parts may be updated inside) for (k = 0; k < nb_union_parts; k++) { // Read the number of union parts or the attributes of the union part while (read_attributes) { read_attributes = 0; // Read relation attributes. osl_util_sskip_blank_and_comments(input); // make a copy of the first line tmp = *input; while ((*tmp != '\0') && (*tmp != '\n')) tmp++; strncpy(str, *input, sizeof(char) * (tmp-*input)); str[(tmp-*input)] = '\0'; read = sscanf(str, " %d %d %d %d %d %d", &nb_rows, &nb_columns, &nb_output_dims, &nb_input_dims, &nb_local_dims, &nb_parameters); *input = tmp; if (((read != 1) && (read != 6)) || ((read == 1) && (may_read_nb_union_parts != 1))) OSL_error("not 1 or 6 integers on the first relation line"); if (read == 1) { // Only one number means a union and is the number of parts. nb_union_parts = nb_rows; if (nb_union_parts < 1) OSL_error("negative nb of union parts"); // Allow to read the properties of the first part of the union. read_attributes = 1; } may_read_nb_union_parts = 0; } // Allocate the union part and fill its properties. relation = osl_relation_pmalloc(precision, nb_rows, nb_columns); relation->nb_output_dims = nb_output_dims; relation->nb_input_dims = nb_input_dims; relation->nb_local_dims = nb_local_dims; relation->nb_parameters = nb_parameters; // Read the matrix of constraints. for (i = 0; i < relation->nb_rows; i++) { osl_util_sskip_blank_and_comments(input); if (!(*input)) OSL_error("not enough rows"); for (j = 0; j < relation->nb_columns; j++) { if (*input == NULL || **input == '#' || **input == '\n') OSL_error("not enough columns"); if (sscanf(*input, "%s%n", str, &n) == 0) OSL_error("not enough rows"); // TODO: remove this tmp (sread updates the pointer). tmp = str; osl_int_sread(&tmp, precision, &relation->m[i][j]); *input += n; } } // Build the linked list of union parts. if (first == 1) { relation_union = relation; first = 0; } else { previous->next = relation; } previous = relation; read_attributes = 1; } return relation_union; } /** * osl_relation_sread function: * this function is equivalent to osl_relation_psread() except that * the precision corresponds to the precision environment variable or * to the highest available precision if it is not defined. * \see{osl_relation_psread} */ osl_relation_p osl_relation_sread(char ** input) { int precision = osl_util_get_precision(); return osl_relation_psread(input, precision); } /** * osl_relation_sread function: * this function is equivalent to osl_relation_psread_polylib() except that * the precision corresponds to the precision environment variable or * to the highest available precision if it is not defined. * \see{osl_relation_posread_polylib} */ osl_relation_p osl_relation_sread_polylib(char ** input) { int precision = osl_util_get_precision(); return osl_relation_psread_polylib(input, precision); } /** * osl_relation_read function: * this function is equivalent to osl_relation_pread() except that * the precision corresponds to the precision environment variable or * to the highest available precision if it is not defined. * \see{osl_relation_pread} */ osl_relation_p osl_relation_read(FILE * foo) { int precision = osl_util_get_precision(); return osl_relation_pread(foo, precision); } /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ /** * osl_relation_pmalloc function: * (precision malloc) this function allocates the memory space for an * osl_relation_t structure and sets its fields with default values. * Then it returns a pointer to the allocated space. * \param[in] precision The precision of the constraint matrix. * \param[in] nb_rows The number of row of the relation to allocate. * \param[in] nb_columns The number of columns of the relation to allocate. * \return A pointer to an empty relation with fields set to default values * and a ready-to-use constraint matrix. */ osl_relation_p osl_relation_pmalloc(int precision, int nb_rows, int nb_columns) { osl_relation_p relation; osl_int_t ** p, * q; int i, j; if ((precision != OSL_PRECISION_SP) && (precision != OSL_PRECISION_DP) && (precision != OSL_PRECISION_MP)) OSL_error("unknown precision"); if ((nb_rows < 0) || (nb_columns < 0)) OSL_error("negative sizes"); OSL_malloc(relation, osl_relation_p, sizeof(osl_relation_t)); relation->type = OSL_UNDEFINED; relation->nb_rows = nb_rows; relation->nb_columns = nb_columns; relation->nb_output_dims = OSL_UNDEFINED; relation->nb_input_dims = OSL_UNDEFINED; relation->nb_parameters = OSL_UNDEFINED; relation->nb_local_dims = OSL_UNDEFINED; relation->precision = precision; if ((nb_rows == 0) || (nb_columns == 0) || (nb_rows == OSL_UNDEFINED) || (nb_columns == OSL_UNDEFINED)) { relation->m = NULL; } else { OSL_malloc(p, osl_int_t**, nb_rows * sizeof(osl_int_t*)); OSL_malloc(q, osl_int_t*, nb_rows * nb_columns * sizeof(osl_int_t)); relation->m = p; for (i = 0; i < nb_rows; i++) { relation->m[i] = q + i * nb_columns ; for (j = 0; j < nb_columns; j++) osl_int_init_set_si(precision, &relation->m[i][j], 0); } } relation->next = NULL; return relation; } /** * osl_relation_malloc function: * this function is equivalent to osl_relation_pmalloc() except that * the precision corresponds to the precision environment variable or * to the highest available precision if it is not defined. * \see{osl_relation_pmalloc} */ osl_relation_p osl_relation_malloc(int nb_rows, int nb_columns) { int precision = osl_util_get_precision(); return osl_relation_pmalloc(precision, nb_rows, nb_columns); } /** * osl_relation_free_inside function: * this function frees the allocated memory for the inside of a * osl_relation_t structure, i.e. only m. * \param[in] relation The pointer to the relation we want to free internals. */ void osl_relation_free_inside(osl_relation_p relation) { int i, nb_elements; if (relation == NULL) return; nb_elements = relation->nb_rows * relation->nb_columns; for (i = 0; i < nb_elements; i++) osl_int_clear(relation->precision, &relation->m[0][i]); if (relation->m != NULL) { if (nb_elements > 0) free(relation->m[0]); free(relation->m); } } /** * osl_relation_free function: * this function frees the allocated memory for an osl_relation_t * structure. * \param[in] relation The pointer to the relation we want to free. */ void osl_relation_free(osl_relation_p relation) { osl_relation_p tmp; while (relation != NULL) { tmp = relation->next; osl_relation_free_inside(relation); free(relation); relation = tmp; } } /*+*************************************************************************** * Processing functions * *****************************************************************************/ /** * osl_relation_nclone function: * this functions builds and returns a "hard copy" (not a pointer copy) of the * first n parts of a relation union. * \param[in] relation The pointer to the relation we want to clone. * \param[in] n The number of union parts of the relation we want to * clone (the special value -1 means "all the parts"). * \return A pointer to the clone of the relation union restricted to the * first n parts of the relation union. */ osl_relation_p osl_relation_nclone(osl_relation_p relation, int n) { int i, j, k; int first = 1, nb_components, nb_parts; osl_relation_p clone = NULL, node, previous = NULL; nb_components = osl_relation_nb_components(relation); nb_parts = (n == -1) ? nb_components : n; if (nb_components < nb_parts) OSL_error("not enough union parts to clone"); for (k = 0; k < nb_parts; k++) { node = osl_relation_pmalloc(relation->precision, relation->nb_rows, relation->nb_columns); node->type = relation->type; node->nb_output_dims = relation->nb_output_dims; node->nb_input_dims = relation->nb_input_dims; node->nb_local_dims = relation->nb_local_dims; node->nb_parameters = relation->nb_parameters; for (i = 0; i < relation->nb_rows; i++) for (j = 0; j < relation->nb_columns; j++) osl_int_assign(relation->precision, &node->m[i][j], relation->m[i][j]); if (first) { first = 0; clone = node; previous = node; } else { previous->next = node; previous = previous->next; } relation = relation->next; } return clone; } /** * osl_relation_clone_nconstraints function: * this functions builds and returns a "hard copy" (not a pointer copy) of a * osl_relation_t data structure such that the clone is restricted to the * "n" first rows of the relation. This applies to all the parts in the case * of a relation union. * \param[in] relation The pointer to the relation we want to clone. * \param[in] n The number of row of the relation we want to clone (the * special value -1 means "all the rows"). * \return A pointer to the clone of the relation union restricted to the * first n rows of constraint matrix for each part of the union. */ osl_relation_p osl_relation_clone_nconstraints(osl_relation_p relation, int n) { int i, j; int first = 1, all_rows = 0; osl_relation_p clone = NULL, node, previous = NULL; if (n == -1) all_rows = 1; while (relation != NULL) { if (all_rows) n = relation->nb_rows; if (n > relation->nb_rows) OSL_error("not enough rows to clone in the relation"); node = osl_relation_pmalloc(relation->precision, n, relation->nb_columns); node->type = relation->type; node->nb_output_dims = relation->nb_output_dims; node->nb_input_dims = relation->nb_input_dims; node->nb_local_dims = relation->nb_local_dims; node->nb_parameters = relation->nb_parameters; for (i = 0; i < n; i++) for (j = 0; j < relation->nb_columns; j++) osl_int_assign(relation->precision, &node->m[i][j], relation->m[i][j]); if (first) { first = 0; clone = node; previous = node; } else { previous->next = node; previous = previous->next; } relation = relation->next; } return clone; } /** * osl_relation_clone function: * this function builds and returns a "hard copy" (not a pointer copy) of an * osl_relation_t data structure (the full union of relation). * \param[in] relation The pointer to the relation we want to clone. * \return A pointer to the clone of the union of relations. */ osl_relation_p osl_relation_clone(osl_relation_p relation) { if (relation == NULL) return NULL; return osl_relation_nclone(relation, -1); } /** * osl_relation_add function: * this function adds a relation (union) at the end of the relation (union) * pointed by r1. No new relation is created: this functions links the two * input unions. If the first relation is NULL, it is set to the * second relation. * \param[in,out] r1 Pointer to the first relation (union). * \param[in] r2 The second relation (union). */ void osl_relation_add(osl_relation_p *r1, osl_relation_p r2) { while (*r1 != NULL) r1 = &((*r1)->next); *r1 = r2; } /** * osl_relation_union function: * this function builds a new relation from two relations provided * as parameters. The new relation is built as an union of the * two relations: the list of constraint sets are linked together. * \param[in] r1 The first relation. * \param[in] r2 The second relation. * \return A new relation corresponding to the union of r1 and r2. */ osl_relation_p osl_relation_union(osl_relation_p r1, osl_relation_p r2) { osl_relation_p copy1, copy2; if ((r1 == NULL) && (r2 == NULL)) return NULL; copy1 = osl_relation_clone(r1); copy2 = osl_relation_clone(r2); osl_relation_add(©1, copy2); return copy1; } /** * osl_relation_replace_vector function: * this function replaces the "row"^th row of a relation "relation" with the * vector "vector". It directly updates the relation union part pointed * by "relation" and this part only. * \param[in,out] relation The relation we want to replace a row. * \param[in] vector The vector that will replace a row of the relation. * \param[in] row The row of the relation to be replaced. */ void osl_relation_replace_vector(osl_relation_p relation, osl_vector_p vector, int row) { int i; if ((relation == NULL) || (vector == NULL) || (relation->precision != vector->precision) || (relation->nb_columns != vector->size) || (row >= relation->nb_rows) || (row < 0)) OSL_error("vector cannot replace relation row"); for (i = 0; i < vector->size; i++) osl_int_assign(relation->precision, &relation->m[row][i], vector->v[i]); } /** * osl_relation_add_vector function: * this function adds (meaning, +) a vector to the "row"^th row of a * relation "relation". It directly updates the relation union part pointed * by "relation" and this part only. * \param[in,out] relation The relation we want to add a vector to a row. * \param[in] vector The vector that will replace a row of the relation. * \param[in] row The row of the relation to add the vector. */ void osl_relation_add_vector(osl_relation_p relation, osl_vector_p vector, int row) { int i; if ((relation == NULL) || (vector == NULL) || (relation->precision != vector->precision) || (relation->nb_columns != vector->size) || (row >= relation->nb_rows) || (row < 0)) OSL_error("vector cannot be added to relation"); if (osl_int_get_si(relation->precision, relation->m[row][0]) == 0) osl_int_assign(relation->precision, &relation->m[row][0], vector->v[0]); for (i = 1; i < vector->size; i++) osl_int_add(relation->precision, &relation->m[row][i], relation->m[row][i], vector->v[i]); } /** * osl_relation_sub_vector function: * this function subtracts the vector "vector" to the "row"^th row of * a relation "relation. It directly updates the relation union part pointed * by "relation" and this part only. * \param[in,out] relation The relation where to subtract a vector to a row. * \param[in] vector The vector to subtract to a relation row. * \param[in] row The row of the relation to subtract the vector. */ void osl_relation_sub_vector(osl_relation_p relation, osl_vector_p vector, int row) { int i; if ((relation == NULL) || (vector == NULL) || (relation->precision != vector->precision) || (relation->nb_columns != vector->size) || (row >= relation->nb_rows) || (row < 0)) OSL_error("vector cannot be subtracted to row"); if (osl_int_get_si(relation->precision, relation->m[row][0]) == 0) osl_int_assign(relation->precision, &relation->m[row][0], vector->v[0]); for (i = 1; i < vector->size; i++) osl_int_sub(relation->precision, &relation->m[row][i], relation->m[row][i], vector->v[i]); } /** * osl_relation_insert_vector function: * this function inserts a new row corresponding to the vector "vector" to * the relation "relation" by inserting it at the "row"^th row of * "relation" (-1 is a shortcut to insert the vector after the constraints * of the relation). It directly updates the relation union part pointed * by "relation" and this part only. If "vector" (or "relation") is NULL, * the relation is left unmodified. * \param[in,out] relation The relation we want to extend. * \param[in] vector The vector that will be added relation. * \param[in] row The row where to insert the vector (-1 to * insert it after the relation constraints). */ void osl_relation_insert_vector(osl_relation_p relation, osl_vector_p vector, int row) { osl_relation_p temp; temp = osl_relation_from_vector(vector); osl_relation_insert_constraints(relation, temp, row); osl_relation_free(temp); } /** * osl_relation_concat_vector function: * this function builds a new relation from one relation and a vector sent as * parameters. The new set of constraints is built as the concatenation * of the rows of the first part of the relation and of the vector * constraint. This means, there is no next field in the result. * \param[in] r The input relation. * \param[in] v The input vector. * \return A pointer to the relation resulting from the concatenation of * the constraints of the relation and of the vector. */ osl_relation_p osl_relation_concat_vector(osl_relation_p relation, osl_vector_p vector) { osl_relation_p new, temp; temp = osl_relation_from_vector(vector); new = osl_relation_concat_constraints(relation, temp); osl_relation_free(temp); return new; } /** * osl_relation_insert_blank_row function: * this function inserts a new row filled with zeros o an existing relation * union part (it only affects the first union part). * \param[in,out] relation The relation to add a row in. * \param[in] row The row where to insert the blank row. */ void osl_relation_insert_blank_row(osl_relation_p relation, int row) { osl_vector_p vector; if (relation != NULL) { vector = osl_vector_pmalloc(relation->precision, relation->nb_columns); osl_relation_insert_vector(relation, vector, row); osl_vector_free(vector); } } /** * osl_relation_insert_blank_column function: * this function inserts a new column filled with zeros to an existing * relation union part (it only affects the first union part). WARNING: * this function does not update the relation attributes. * \param[in,out] relation The relation to add a column in. * \param[in] column The column where to insert the blank column. */ void osl_relation_insert_blank_column(osl_relation_p relation, int column) { int i, j; osl_relation_p temp; if (relation == NULL) return; if ((column < 0) || (column > relation->nb_columns)) OSL_error("bad column number"); // We use a temporary relation just to reuse existing functions. Cleaner. temp = osl_relation_pmalloc(relation->precision, relation->nb_rows, relation->nb_columns + 1); for (i = 0; i < relation->nb_rows; i++) { for (j = 0; j < column; j++) osl_int_assign(relation->precision, &temp->m[i][j], relation->m[i][j]); for (j = column; j < relation->nb_columns; j++) osl_int_assign(relation->precision, &temp->m[i][j+1], relation->m[i][j]); } osl_relation_free_inside(relation); // Replace the inside of relation. relation->nb_columns = temp->nb_columns; relation->m = temp->m; // Free the temp "shell". free(temp); } /** * osl_relation_from_vector function: * this function converts a vector "vector" to a relation with a single row * and returns a pointer to that relation. * \param[in] vector The vector to convert to a relation. * \return A pointer to a relation resulting from the vector conversion. */ osl_relation_p osl_relation_from_vector(osl_vector_p vector) { osl_relation_p relation; if (vector == NULL) return NULL; relation = osl_relation_pmalloc(vector->precision, 1, vector->size); osl_relation_replace_vector(relation, vector, 0); return relation; } /** * osl_relation_replace_constraints function: * this function replaces some rows of a relation "r1" with the rows of * the relation "r2". It begins at the "row"^th row of "r1". It directly * updates the relation union part pointed by "r1" and this part only. * \param[in,out] r1 The relation we want to change some rows. * \param[in] r2 The relation containing the new rows. * \param[in] row The first row of the relation r1 to be replaced. */ void osl_relation_replace_constraints(osl_relation_p r1, osl_relation_p r2, int row) { int i, j; if ((r1 == NULL) || (r2 == NULL) || (r1->precision != r2->precision) || (r1->nb_columns != r1->nb_columns) || ((row + r2->nb_rows) > r1->nb_rows) || (row < 0)) OSL_error("relation rows could not be replaced"); for (i = 0; i < r2->nb_rows; i++) for (j = 0; j < r2->nb_columns; j++) osl_int_assign(r1->precision, &r1->m[i+row][j], r2->m[i][j]); } /** * osl_relation_insert_constraints function: * this function inserts the rows of the relation "r2" to the relation * "r1", starting from the "row"^th row of "r1" (-1 is a * shortcut to insert the "r2" constraints after the constraints of r1). * It directly updates the relation union part pointed by "r1" and this * part only. If "r2" (or "r1") is NULL, the relation is left unmodified. * \param[in,out] r1 The relation we want to extend. * \param[in] r2 The relation to be inserted. * \param[in] row The row where to insert the constraints (-1 to * insert them after those of "r1"). */ void osl_relation_insert_constraints(osl_relation_p r1, osl_relation_p r2, int row) { int i, j; osl_relation_p temp; if ((r1 == NULL) || (r2 == NULL)) return; if (row == -1) row = r1->nb_rows; if ((r1->nb_columns != r2->nb_columns) || (r1->precision != r2->precision) || (row > r1->nb_rows) || (row < 0)) OSL_error("constraints cannot be inserted"); // We use a temporary relation just to reuse existing functions. Cleaner. temp = osl_relation_pmalloc(r1->precision, r1->nb_rows + r2->nb_rows, r1->nb_columns); for (i = 0; i < row; i++) for (j = 0; j < r1->nb_columns; j++) osl_int_assign(r1->precision, &temp->m[i][j], r1->m[i][j]); osl_relation_replace_constraints(temp, r2, row); for (i = row + r2->nb_rows; i < r2->nb_rows + r1->nb_rows; i++) for (j = 0; j < r1->nb_columns; j++) osl_int_assign(r1->precision, &temp->m[i][j], r1->m[i-r2->nb_rows][j]); osl_relation_free_inside(r1); // Replace the inside of relation. r1->nb_rows = temp->nb_rows; r1->m = temp->m; // Free the temp "shell". free(temp); } /** * osl_relation_swap_constraints function: * this function swaps two constraints (i.e., rows) of the relation matrix. * This function updates the relation directly. * \param[in,out] relation The relation to swap two rows (modified). * \param[in] c1 The row corresponding to the first constraint. * \param[in] c2 The row corresponding to the second constraint. */ void osl_relation_swap_constraints(osl_relation_p relation, int c1, int c2) { int i; if ((relation == NULL) || (c1 == c2)) return; if ((c1 >= relation->nb_rows) || (c1 < 0) || (c2 >= relation->nb_rows) || (c2 < 0)) OSL_error("bad constraint rows"); for (i = 0; i < relation->nb_columns; i++) osl_int_swap(relation->precision, &relation->m[c1][i], &relation->m[c2][i]); } /** * osl_relation_remove_row function: * this function removes a given row to the relation "r". It directly * updates the relation union part pointed by "r" and this part only. * \param[in,out] r The relation to remove a row. * \param[in] row The row number to remove. */ void osl_relation_remove_row(osl_relation_p r, int row) { int i, j; osl_relation_p temp; if (r == NULL) return; if ((row < 0) || (row >= r->nb_rows)) OSL_error("bad row number"); // We use a temporary relation just to reuse existing functions. Cleaner. temp = osl_relation_pmalloc(r->precision, r->nb_rows - 1, r->nb_columns); for (i = 0; i < row; i++) for (j = 0; j < r->nb_columns; j++) osl_int_assign(r->precision, &temp->m[i][j], r->m[i][j]); for (i = row + 1; i < r->nb_rows; i++) for (j = 0; j < r->nb_columns; j++) osl_int_assign(r->precision, &temp->m[i - 1][j], r->m[i][j]); osl_relation_free_inside(r); // Replace the inside of relation. r->nb_rows = temp->nb_rows; r->m = temp->m; // Free the temp "shell". free(temp); } /** * osl_relation_remove_column function: * this function removes a given column to the relation "r". It directly * updates the relation union part pointed by "r" and this part only. * \param[in,out] r The relation to remove a column. * \param[in] column The column number to remove. */ void osl_relation_remove_column(osl_relation_p r, int column) { int i, j; osl_relation_p temp; if (r == NULL) return; if ((column < 0) || (column >= r->nb_columns)) OSL_error("bad column number"); // We use a temporary relation just to reuse existing functions. Cleaner. temp = osl_relation_pmalloc(r->precision, r->nb_rows, r->nb_columns - 1); for (i = 0; i < r->nb_rows; i++) { for (j = 0; j < column; j++) osl_int_assign(r->precision, &temp->m[i][j], r->m[i][j]); for (j = column + 1; j < r->nb_columns; j++) osl_int_assign(r->precision, &temp->m[i][j - 1], r->m[i][j]); } osl_relation_free_inside(r); // Replace the inside of relation. r->nb_columns = temp->nb_columns; r->m = temp->m; // Free the temp "shell". free(temp); } /** * osl_relation_insert_columns function: * this function inserts new columns to an existing relation union part (it * only affects the first union part). The columns are copied out from the * matrix of an input relation which must have the convenient number of rows. * All columns of the input matrix are copied. WARNING: this function does not * update the relation attributes of the modified matrix. * \param[in,out] relation The relation to add columns in. * \param[in] insert The relation containing the columns to add. * \param[in] column The column where to insert the new columns. */ void osl_relation_insert_columns(osl_relation_p relation, osl_relation_p insert, int column) { int i, j; osl_relation_p temp; if ((relation == NULL) || (insert == NULL)) return; if ((relation->precision != insert->precision) || (relation->nb_rows != insert->nb_rows) || (column < 0) || (column > relation->nb_columns)) OSL_error("columns cannot be inserted"); // We use a temporary relation just to reuse existing functions. Cleaner. temp = osl_relation_pmalloc(relation->precision, relation->nb_rows, relation->nb_columns + insert->nb_columns); for (i = 0; i < relation->nb_rows; i++) { for (j = 0; j < column; j++) osl_int_assign(relation->precision, &temp->m[i][j], relation->m[i][j]); for (j = column; j < column + insert->nb_columns; j++) osl_int_assign(relation->precision, &temp->m[i][j], insert->m[i][j - column]); for (j = column + insert->nb_columns; j < insert->nb_columns + relation->nb_columns; j++) osl_int_assign(relation->precision, &temp->m[i][j], relation->m[i][j - insert->nb_columns]); } osl_relation_free_inside(relation); // Replace the inside of relation. relation->nb_columns = temp->nb_columns; relation->m = temp->m; // Free the temp "shell". free(temp); } /** * osl_relation_concat_constraints function: * this function builds a new relation from two relations sent as * parameters. The new set of constraints is built as the concatenation * of the rows of the first elements of the two relation unions r1 and r2. * This means, there is no next field in the result. * \param[in] r1 The first relation. * \param[in] r2 The second relation. * \return A pointer to the relation resulting from the concatenation of * the first elements of r1 and r2. */ osl_relation_p osl_relation_concat_constraints( osl_relation_p r1, osl_relation_p r2) { osl_relation_p new; if (r1 == NULL) return osl_relation_clone(r2); if (r2 == NULL) return osl_relation_clone(r1); if (r1->nb_columns != r2->nb_columns) OSL_error("incompatible sizes for concatenation"); if (r1->next || r2->next) OSL_warning("relation concatenation is done on the first elements " "of union only"); new = osl_relation_pmalloc(r1->precision, r1->nb_rows + r2->nb_rows, r1->nb_columns); osl_relation_replace_constraints(new, r1, 0); osl_relation_replace_constraints(new, r2, r1->nb_rows); return new; } /** * osl_relation_part_equal function: * this function returns true if the two relations parts provided as * parameters are the same, false otherwise. In the case of relation * unions, only the first part of the two relations are tested. * \param[in] r1 The first relation. * \param[in] r2 The second relation. * \return 1 if r1 and r2 are the same (content-wise), 0 otherwise. */ int osl_relation_part_equal(osl_relation_p r1, osl_relation_p r2) { int i, j; if (r1 == r2) return 1; if (((r1 == NULL) && (r2 != NULL)) || ((r1 != NULL) && (r2 == NULL))) return 0; if ((r1->type != r2->type) || (r1->precision != r2->precision) || (r1->nb_rows != r2->nb_rows) || (r1->nb_columns != r2->nb_columns) || (r1->nb_output_dims != r2->nb_output_dims) || (r1->nb_input_dims != r2->nb_input_dims) || (r1->nb_local_dims != r2->nb_local_dims) || (r1->nb_parameters != r2->nb_parameters)) return 0; for (i = 0; i < r1->nb_rows; ++i) for (j = 0; j < r1->nb_columns; ++j) if (osl_int_ne(r1->precision, r1->m[i][j], r2->m[i][j])) return 0; return 1; } /** * osl_relation_equal function: * this function returns true if the two relations provided as parameters * are the same, false otherwise. * \param[in] r1 The first relation. * \param[in] r2 The second relation. * \return 1 if r1 and r2 are the same (content-wise), 0 otherwise. */ int osl_relation_equal(osl_relation_p r1, osl_relation_p r2) { while ((r1 != NULL) && (r2 != NULL)) { if (!osl_relation_part_equal(r1, r2)) return 0; r1 = r1->next; r2 = r2->next; } if (((r1 == NULL) && (r2 != NULL)) || ((r1 != NULL) && (r2 == NULL))) return 0; return 1; } /** * osl_relation_check_attribute internal function: * This function checks whether an "actual" value is the same as an * "expected" value or not. If the expected value is set to * OSL_UNDEFINED, this function sets it to the "actual" value * and do not report a difference has been detected. * It returns 0 if a difference has been detected, 1 otherwise. * \param[in,out] expected Pointer to the expected value (the value is * modified if it was set to OSL_UNDEFINED). * \param[in] actual Value we want to check. * \return 0 if the values are not the same while the expected value was * not OSL_UNDEFINED, 1 otherwise. */ static int osl_relation_check_attribute(int * expected, int actual) { if (*expected != OSL_UNDEFINED) { if ((actual != OSL_UNDEFINED) && (actual != *expected)) { OSL_warning("unexpected atribute"); return 0; } } else { *expected = actual; } return 1; } /** * osl_relation_check_nb_columns internal function: * This function checks that the number of columns of a relation * corresponds to some expected properties (setting an expected property to * OSL_UNDEFINED makes this function unable to detect a problem). * It returns 0 if the number of columns seems incorrect or 1 if no problem * has been detected. * \param[in] relation The relation we want to check the number of columns. * \param[in] expected_nb_output_dims Expected number of output dimensions. * \param[in] expected_nb_input_dims Expected number of input dimensions. * \param[in] expected_nb_parameters Expected number of parameters. * \return 0 if the number of columns seems incorrect, 1 otherwise. */ static int osl_relation_check_nb_columns(osl_relation_p relation, int expected_nb_output_dims, int expected_nb_input_dims, int expected_nb_parameters) { int expected_nb_local_dims, expected_nb_columns; if ((expected_nb_output_dims != OSL_UNDEFINED) && (expected_nb_input_dims != OSL_UNDEFINED) && (expected_nb_parameters != OSL_UNDEFINED)) { if (relation->nb_local_dims == OSL_UNDEFINED) expected_nb_local_dims = 0; else expected_nb_local_dims = relation->nb_local_dims; expected_nb_columns = expected_nb_output_dims + expected_nb_input_dims + expected_nb_local_dims + expected_nb_parameters + 2; if (expected_nb_columns != relation->nb_columns) { OSL_warning("unexpected number of columns"); return 0; } } return 1; } /** * osl_relation_integrity_check function: * this function checks that a relation is "well formed" according to some * expected properties (setting an expected value to OSL_UNDEFINED means * that we do not expect a specific value) and what the relation is supposed * to represent. It returns 0 if the check failed or 1 if no problem has been * detected. * \param[in] relation The relation we want to check. * \param[in] expected_type Semantics about this relation (domain, access...). * \param[in] expected_nb_output_dims Expected number of output dimensions. * \param[in] expected_nb_input_dims Expected number of input dimensions. * \param[in] expected_nb_parameters Expected number of parameters. * \return 0 if the integrity check fails, 1 otherwise. */ int osl_relation_integrity_check(osl_relation_p relation, int expected_type, int expected_nb_output_dims, int expected_nb_input_dims, int expected_nb_parameters) { int i; // Check the NULL case. if (relation == NULL) { if ((expected_nb_output_dims != OSL_UNDEFINED) || (expected_nb_input_dims != OSL_UNDEFINED) || (expected_nb_parameters != OSL_UNDEFINED)) { OSL_debug("NULL relation with some expected attibutes"); //return 0; } return 1; } // Check the type. if (((expected_type != OSL_TYPE_ACCESS) && (expected_type != relation->type)) || ((expected_type == OSL_TYPE_ACCESS) && (!osl_relation_is_access(relation)))) { OSL_warning("wrong type"); osl_relation_dump(stderr, relation); return 0; } // Check that relations have no undefined atributes. if ((relation->nb_output_dims == OSL_UNDEFINED) || (relation->nb_input_dims == OSL_UNDEFINED) || (relation->nb_local_dims == OSL_UNDEFINED) || (relation->nb_parameters == OSL_UNDEFINED)) { OSL_warning("all attributes should be defined"); osl_relation_dump(stderr, relation); return 0; } // Check that a context has actually 0 output dimensions. if ((relation->type == OSL_TYPE_CONTEXT) && (relation->nb_output_dims != 0)) { OSL_warning("context without 0 as number of output dimensions"); osl_relation_dump(stderr, relation); return 0; } // Check that a domain or a context has actually 0 input dimensions. if (((relation->type == OSL_TYPE_DOMAIN) || (relation->type == OSL_TYPE_CONTEXT)) && (relation->nb_input_dims != 0)) { OSL_warning("domain or context without 0 input dimensions"); osl_relation_dump(stderr, relation); return 0; } // Check properties according to expected values (and if expected values // are undefined, define them with the first relation part properties). if (!osl_relation_check_attribute(&expected_nb_output_dims, relation->nb_output_dims) || !osl_relation_check_attribute(&expected_nb_input_dims, relation->nb_input_dims) || !osl_relation_check_attribute(&expected_nb_parameters, relation->nb_parameters)) { osl_relation_dump(stderr, relation); return 0; } while (relation != NULL) { // Attributes (except the number of local dimensions) should be the same // in all parts of the union. if ((expected_nb_output_dims != relation->nb_output_dims) || (expected_nb_input_dims != relation->nb_input_dims) || (expected_nb_parameters != relation->nb_parameters)) { OSL_warning("inconsistent attributes"); osl_relation_dump(stderr, relation); return 0; } // Check whether the number of columns is OK or not. if (!osl_relation_check_nb_columns(relation, expected_nb_output_dims, expected_nb_input_dims, expected_nb_parameters)) { osl_relation_dump(stderr, relation); return 0; } // Check the first column. The first column of a relation part should be // made of 0 or 1 only. if ((relation->nb_rows > 0) && (relation->nb_columns > 0)) { for (i = 0; i < relation->nb_rows; i++) { if (!osl_int_zero(relation->precision, relation->m[i][0]) && !osl_int_one(relation->precision, relation->m[i][0])) { OSL_warning("first column of a relation is not " "strictly made of 0 or 1"); osl_relation_dump(stderr, relation); return 0; } } } // Array accesses must provide the array identifier. if ((osl_relation_is_access(relation)) && (osl_relation_get_array_id(relation) == OSL_UNDEFINED)) { osl_relation_dump(stderr, relation); return 0; } relation = relation->next; } return 1; } /** * osl_relation_set_attributes_one function: * this functions sets the attributes of a relation part provided as a * parameter. It updates the relation directly. * \param[in,out] relation The relation (union part) to set the attributes. * \param[in] nb_output_dims Number of output dimensions. * \param[in] nb_input_dims Number of input dimensions. * \param[in] nb_local_dims Number of local dimensions. * \param[in] nb_parameters Number of parameters. */ void osl_relation_set_attributes_one(osl_relation_p relation, int nb_output_dims, int nb_input_dims, int nb_local_dims, int nb_parameters) { if (relation != NULL) { relation->nb_output_dims = nb_output_dims; relation->nb_input_dims = nb_input_dims; relation->nb_local_dims = nb_local_dims; relation->nb_parameters = nb_parameters; } } /** * osl_relation_set_attributes function: * this functions sets the attributes of a relation (union) provided * as a parameter. It updates the relation directly. * \param[in,out] relation The relation (union) to set the attributes. * \param[in] nb_output_dims Number of output dimensions. * \param[in] nb_input_dims Number of input dimensions. * \param[in] nb_local_dims Number of local dimensions. * \param[in] nb_parameters Number of parameters. */ void osl_relation_set_attributes(osl_relation_p relation, int nb_output_dims, int nb_input_dims, int nb_local_dims, int nb_parameters) { while (relation != NULL) { osl_relation_set_attributes_one(relation, nb_output_dims, nb_input_dims, nb_local_dims, nb_parameters); relation = relation->next; } } /** * osl_relation_set_type function: * this function sets the type of each relation union part in the relation * to the one provided as parameter. * \param relation The relation to set the type. * \param type The type. */ void osl_relation_set_type(osl_relation_p relation, int type) { while (relation != NULL) { relation->type = type; relation = relation->next; } } /** * osl_relation_get_array_id function: * this function returns the array identifier in a relation with access type * It returns OSL_UNDEFINED if it is not able to find it (in particular * if there are irregularities in the relation). * \param[in] relation The relation where to find an array identifier. * \return The array identifier in the relation or OSL_UNDEFINED. */ int osl_relation_get_array_id(osl_relation_p relation) { int i; int first = 1; int array_id = OSL_UNDEFINED; int reference_array_id = OSL_UNDEFINED; int nb_array_id; int row_id = 0; int precision; if (relation == NULL) return OSL_UNDEFINED; if (!osl_relation_is_access(relation)) { OSL_warning("asked for an array id of non-array relation"); return OSL_UNDEFINED; } while (relation != NULL) { precision = relation->precision; // There should be room to store the array identifier. if ((relation->nb_rows < 1) || (relation->nb_columns < 3)) { OSL_warning("no array identifier in an access function"); return OSL_UNDEFINED; } // Array identifiers are m[i][#columns -1] / m[i][1], with i the only row // where m[i][1] is not 0. // - check there is exactly one row such that m[i][1] is not 0, // - check the whole ith row if full of 0 except m[i][1] and the id, // - check that (m[i][#columns -1] % m[i][1]) == 0, // - check that (-m[i][#columns -1] / m[i][1]) > 0. nb_array_id = 0; for (i = 0; i < relation->nb_rows; i++) { if (!osl_int_zero(precision, relation->m[i][1])) { nb_array_id ++; row_id = i; } } if (nb_array_id == 0) { OSL_warning("no array identifier in an access function"); return OSL_UNDEFINED; } if (nb_array_id > 1) { OSL_warning("several array identifiers in one access function"); return OSL_UNDEFINED; } for (i = 0; i < relation->nb_columns - 1; i++) { if ((i != 1) && !osl_int_zero(precision, relation->m[row_id][i])) { OSL_warning("non integer array identifier"); return OSL_UNDEFINED; } } if (!osl_int_divisible(precision, relation->m[row_id][relation->nb_columns - 1], relation->m[row_id][1])) { OSL_warning("rational array identifier"); return OSL_UNDEFINED; } array_id = -osl_int_get_si(precision, relation->m[row_id][relation->nb_columns - 1]); array_id /= osl_int_get_si(precision, relation->m[row_id][1]); if (array_id <= 0) { OSL_warning("negative or 0 identifier in access function"); return OSL_UNDEFINED; } // Unions of accesses are allowed, but they should refer at the same array. if (first) { reference_array_id = array_id; first = 0; } else { if (reference_array_id != array_id) { OSL_warning("inconsistency of array identifiers in an " "union of access relations"); return OSL_UNDEFINED; } } relation = relation->next; } return array_id; } /** * osl_relation_is_access function: * this function returns 1 if the relation corresponds to an access relation, * whatever its precise type (read, write etc.), 0 otherwise. * \param relation The relation to check wheter it is an access relation or not. * \return 1 if the relation is an access relation, 0 otherwise. */ int osl_relation_is_access(osl_relation_p relation) { if (relation == NULL) return 0; if ((relation->type == OSL_TYPE_ACCESS) || (relation->type == OSL_TYPE_READ) || (relation->type == OSL_TYPE_WRITE) || (relation->type == OSL_TYPE_MAY_WRITE)) return 1; return 0; } /** * osl_relation_get_attributes function: * this function returns, through its parameters, the maximum values of the * relation attributes (nb_iterators, nb_parameters etc), depending on its * type. HOWEVER, it updates the parameter value iff the attribute is greater * than the input parameter value. Hence it may be used to get the * attributes as well as to find the maximum attributes for several relations. * The array identifier 0 is used when there is no array identifier (AND this * is OK), OSL_UNDEFINED is used to report it is impossible to provide the * property while it should. This function is not intended for checking, the * input relation should be correct. * \param[in] relation The relation to extract attribute values. * \param[in,out] nb_parameters Number of parameter attribute. * \param[in,out] nb_iterators Number of iterators attribute. * \param[in,out] nb_scattdims Number of scattering dimensions attribute. * \param[in,out] nb_localdims Number of local dimensions attribute. * \param[in,out] array_id Maximum array identifier attribute. */ void osl_relation_get_attributes(osl_relation_p relation, int * nb_parameters, int * nb_iterators, int * nb_scattdims, int * nb_localdims, int * array_id) { int type; int local_nb_parameters = OSL_UNDEFINED; int local_nb_iterators = OSL_UNDEFINED; int local_nb_scattdims = OSL_UNDEFINED; int local_nb_localdims = OSL_UNDEFINED; int local_array_id = OSL_UNDEFINED; while (relation != NULL) { if (osl_relation_is_access(relation)) type = OSL_TYPE_ACCESS; else type = relation->type; // There is some redundancy but I believe the code is cleaner this way. switch (type) { case OSL_TYPE_CONTEXT: local_nb_parameters = relation->nb_parameters; local_nb_iterators = 0; local_nb_scattdims = 0; local_nb_localdims = relation->nb_local_dims; local_array_id = 0; break; case OSL_TYPE_DOMAIN: local_nb_parameters = relation->nb_parameters; local_nb_iterators = relation->nb_output_dims; local_nb_scattdims = 0; local_nb_localdims = relation->nb_local_dims; local_array_id = 0; break; case OSL_TYPE_SCATTERING: local_nb_parameters = relation->nb_parameters; local_nb_iterators = relation->nb_input_dims; local_nb_scattdims = relation->nb_output_dims; local_nb_localdims = relation->nb_local_dims; local_array_id = 0; break; case OSL_TYPE_ACCESS: local_nb_parameters = relation->nb_parameters; local_nb_iterators = relation->nb_input_dims; local_nb_scattdims = 0; local_nb_localdims = relation->nb_local_dims; local_array_id = osl_relation_get_array_id(relation); break; default: local_nb_parameters = relation->nb_parameters; local_nb_iterators = relation->nb_input_dims; local_nb_scattdims = relation->nb_output_dims; local_nb_localdims = relation->nb_local_dims; local_array_id = 0; } // Update. *nb_parameters = OSL_max(*nb_parameters, local_nb_parameters); *nb_iterators = OSL_max(*nb_iterators, local_nb_iterators); *nb_scattdims = OSL_max(*nb_scattdims, local_nb_scattdims); *nb_localdims = OSL_max(*nb_localdims, local_nb_localdims); *array_id = OSL_max(*array_id, local_array_id); relation = relation->next; } } /** * osl_relation_extend_output function: * this function extends the number of output dimensions of a given relation. It * returns a copy of the input relation with a number of output dimensions * extended to "dim" for all its union components. The new output dimensions * are simply set equal to 0. The extended number of dimensions must be higher * than or equal to the original one (an error will be raised otherwise). * \param[in] relation The input relation to extend. * \param[in] dim The number of output dimension to reach. * \return A new relation: "relation" extended to "dim" output dims. */ osl_relation_p osl_relation_extend_output(osl_relation_p relation, int dim) { int i, j; int first = 1; int offset; int precision = relation->precision; osl_relation_p extended = NULL, node, previous = NULL; while (relation != NULL) { if (relation->nb_output_dims > dim) OSL_error("Number of output dims is greater than required extension"); offset = dim - relation->nb_output_dims; node = osl_relation_pmalloc(precision, relation->nb_rows + offset, relation->nb_columns + offset); node->type = relation->type; node->nb_output_dims = OSL_max(relation->nb_output_dims, dim); node->nb_input_dims = relation->nb_input_dims; node->nb_local_dims = relation->nb_local_dims; node->nb_parameters = relation->nb_parameters; // Copy of the original relation with some 0 columns for the new dimensions // Note that we use the fact that the matrix is initialized with zeros. for (i = 0; i < relation->nb_rows; i++) { for (j = 0; j <= relation->nb_output_dims; j++) osl_int_assign(precision, &node->m[i][j], relation->m[i][j]); for (j = relation->nb_output_dims + offset + 1; j < relation->nb_columns + offset; j++) osl_int_assign(precision, &node->m[i][j], relation->m[i][j - offset]); } // New rows dedicated to the new dimensions for (i = relation->nb_rows; i < relation->nb_rows + offset; i++) { for (j = 0; j < relation->nb_columns + offset; j++) { if ((i - relation->nb_rows) == (j - relation->nb_output_dims - 1)) osl_int_set_si(precision, &node->m[i][j], -1); } } if (first) { first = 0; extended = node; previous = node; } else { previous->next = node; previous = previous->next; } relation = relation->next; } return extended; } /** * osl_relation_interface function: * this function creates an interface structure corresponding to the relation * and returns it. * \return An interface structure for the relation structure. */ osl_interface_p osl_relation_interface() { osl_interface_p interface = osl_interface_malloc(); OSL_strdup(interface->URI, OSL_URI_RELATION); interface->idump = (osl_idump_f)osl_relation_idump; interface->sprint = (osl_sprint_f)osl_relation_sprint; interface->sread = (osl_sread_f)osl_relation_sread; interface->malloc = (osl_malloc_f)osl_relation_malloc; interface->free = (osl_free_f)osl_relation_free; interface->clone = (osl_clone_f)osl_relation_clone; interface->equal = (osl_equal_f)osl_relation_equal; return interface; } /** * osl_relation_set_precision function: * this function changes the precision of the osl_relation * \param[in] precision Precision wanted for the relation * \param[in,out] r A osl relation to change the precision */ void osl_relation_set_precision(int const precision, osl_relation_p r) { while (r != NULL) { if (precision != r->precision) { size_t i; size_t j; for (i = 0; i < (size_t)r->nb_rows; ++i) { for (j = 0; j < (size_t)r->nb_columns; ++j) { osl_int_set_precision(r->precision, precision, &r->m[i][j]); } } r->precision = precision; } r = r->next; } } /** * osl_relation_set_same_precision function: * this function gets the highest precision of the relations * and set this precision to the other relation if necessary * \param[in,out] a A osl relation to change the precision if necessary * \param[in,out] b A osl relation to change the precision if necessary */ void osl_relation_set_same_precision(osl_relation_p a, osl_relation_p b) { if (a != NULL && b != NULL && a->precision != b->precision) { if (a->precision == OSL_PRECISION_MP || b->precision == OSL_PRECISION_MP) { osl_relation_set_precision(OSL_PRECISION_MP, a); osl_relation_set_precision(OSL_PRECISION_MP, b); } else if (a->precision == OSL_PRECISION_DP || b->precision == OSL_PRECISION_DP) { osl_relation_set_precision(OSL_PRECISION_DP, a); osl_relation_set_precision(OSL_PRECISION_DP, b); } } } cloog-0.18.4/osl/source/strings.c0000644000175000017500000004242112413270135013563 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** strings.c ** **-----------------------------------------------------------------** ** First version: 13/07/2011 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ # include # include # include # include # include # include # include # include /*+*************************************************************************** * Structure display function * *****************************************************************************/ /** * osl_strings_idump function: * this function displays an array of strings into a file (file, possibly * stdout) in a way that trends to be understandable. It includes an * indentation level (level) in order to work with others * idump functions. * \param[in] file The file where the information has to be printed. * \param[in] strings The array of strings that has to be printed. * \param[in] level Number of spaces before printing, for each line. */ void osl_strings_idump(FILE * file, osl_strings_p strings, int level) { int i, nb_strings; for (i = 0; i < level; i++) fprintf(file, "|\t"); if (strings != NULL) { nb_strings = osl_strings_size(strings); fprintf(file, "+-- osl_strings_t:"); for (i = 0; i < nb_strings; i++) fprintf(file, " %s", strings->string[i]); fprintf(file, "\n"); } else fprintf(file, "+-- NULL strings\n"); // A blank line. for (i = 0; i <= level; i++) fprintf(file, "|\t"); fprintf(file, "\n"); } /** * osl_strings_dump function: * this function prints the content of an osl_strings_t structure * (*strings) into a file (file, possibly stdout). * \param[in] file The file where the information has to be printed. * \param[in] strings The strings structure which has to be printed. */ void osl_strings_dump(FILE * file, osl_strings_p strings) { osl_strings_idump(file, strings, 0); } /** * osl_strings_sprint function: * this function prints the content of an osl_strings_t structure * (*strings) into a string (returned) in the OpenScop textual format. * \param[in] strings The strings structure which has to be printed. * \return A string containing the OpenScop dump of the strings structure. */ char * osl_strings_sprint(osl_strings_p strings) { size_t i; int high_water_mark = OSL_MAX_STRING; char * string = NULL; char buffer[OSL_MAX_STRING]; OSL_malloc(string, char *, high_water_mark * sizeof(char)); string[0] = '\0'; if (strings != NULL) { for (i = 0; i < osl_strings_size(strings); i++) { sprintf(buffer, "%s", strings->string[i]); osl_util_safe_strcat(&string, buffer, &high_water_mark); if (i < osl_strings_size(strings) - 1) osl_util_safe_strcat(&string, " ", &high_water_mark); } sprintf(buffer, "\n"); osl_util_safe_strcat(&string, buffer, &high_water_mark); } else { sprintf(buffer, "# NULL strings\n"); osl_util_safe_strcat(&string, buffer, &high_water_mark); } return string; } /** * osl_strings_print function: * this function prints the content of an osl_strings_t structure * (*body) into a file (file, possibly stdout) in the OpenScop format. * \param[in] file File where informations are printed. * \param[in] strings The strings whose information has to be printed. */ void osl_strings_print(FILE * file, osl_strings_p strings) { char * string; string = osl_strings_sprint(strings); if (string != NULL) { fprintf(file, "%s", string); free(string); } } /*+*************************************************************************** * Structure display function * *****************************************************************************/ /** * osl_strings_sread function: * this function reads a strings structure from a string complying to the * OpenScop textual format and returns a pointer to this strings structure. * The input string should only contain the list of strings this function * has to read (comments at the end of the line are accepted). The input * parameter is updated to the position in the input string this function * reach right after reading the strings structure. * \param[in,out] input The input string where to find a strings structure. * Updated to the position after what has been read. * \return A pointer to the strings structure that has been read. */ osl_strings_p osl_strings_sread(char ** input) { char tmp[OSL_MAX_STRING]; char * s; char ** string = NULL; int nb_strings; int i, count; osl_strings_p strings = NULL; // Skip blank/commented lines and spaces before the strings. osl_util_sskip_blank_and_comments(input); // Count the actual number of strings. nb_strings = 0; s = *input; while (1) { for (count = 0; *s && !isspace(*s) && *s != '#'; count++) s++; if (count != 0) nb_strings++; if ((!*s) || (*s == '#') || (*s == '\n')) break; else s++; } if (nb_strings > 0) { // Allocate the array of strings. Make it NULL-terminated. OSL_malloc(string, char **, sizeof(char *) * (nb_strings + 1)); string[nb_strings] = NULL; // Read the desired number of strings. s = *input; for (i = 0; i < nb_strings; i++) { for (count = 0; *s && !isspace(*s) && *s != '#'; count++) tmp[count] = *(s++); tmp[count] = '\0'; OSL_strdup(string[i], tmp); if (*s != '#') s++; } // Update the input pointer to the end of the strings structure. *input = s; // Build the strings structure strings = osl_strings_malloc(); free(strings->string); strings->string = string; } return strings; } /** * osl_strings_read function. * this function reads a strings structure from a file (possibly stdin) * complying to the OpenScop textual format and returns a pointer to this * structure. * parameter nb_strings). * \param[in] file The file where to read the strings structure. * \return The strings structure that has been read. */ osl_strings_p osl_strings_read(FILE * file) { char buffer[OSL_MAX_STRING], * start; osl_strings_p strings; start = osl_util_skip_blank_and_comments(file, buffer); strings = osl_strings_sread(&start); return strings; } /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ /** * osl_strings_malloc function: * This function allocates the memory space for an osl_strings_t * structure and sets its fields with default values. Then it returns a * pointer to the allocated space. * \return A pointer to an empty strings structure with fields set to * default values. */ osl_strings_p osl_strings_malloc() { osl_strings_p strings; OSL_malloc(strings, osl_strings_p, sizeof(osl_strings_t)); OSL_malloc(strings->string, char**, sizeof(char*)); strings->string[0] = NULL; return strings; } /** * osl_strings_free function: * this function frees the allocated memory for a strings data structure. * \param[in] strings The strings structure we want to free. */ void osl_strings_free(osl_strings_p strings) { int i; if (strings != NULL) { if (strings->string != NULL) { i = 0; while (strings->string[i] != NULL) { free(strings->string[i]); i++; } free(strings->string); } free(strings); } } /*+*************************************************************************** * Processing functions * *****************************************************************************/ /** * osl_strings_clone function. * this function builds and return a "hard copy" (not a pointer copy) of an * strings structure provided as parameter. * \param[in] strings The strings structure to clone. * \return The clone of the strings structure. */ osl_strings_p osl_strings_clone(osl_strings_p strings) { int i, nb_strings; osl_strings_p clone = NULL; if (strings == NULL) return NULL; clone = osl_strings_malloc(); if ((nb_strings = osl_strings_size(strings)) == 0) return clone; free(clone->string); OSL_malloc(clone->string, char **, (nb_strings + 1) * sizeof(char *)); clone->string[nb_strings] = NULL; for (i = 0; i < nb_strings; i++) OSL_strdup(clone->string[i], strings->string[i]); return clone; } /** * osl_strings_find function. * this function finds the string in the strings. * \param[in,out] strings The strings structure. * \param[in] string The string to find in strings. * \return the index where is the string, osl_strings_size if not found */ size_t osl_strings_find(osl_strings_p strings, char const * const string) { size_t i; for (i = 0; i < osl_strings_size(strings); ++i) { if (strcmp(strings->string[i], string) == 0) { return i; } } return i; } /** * osl_strings_add function. * this function adds a copy of the string in the strings. * \param[in,out] strings The strings structure. * \param[in] string The string to add in strings. */ void osl_strings_add(osl_strings_p strings, char const * const string) { size_t original_size = osl_strings_size(strings); OSL_realloc(strings->string, char**, sizeof(char*) * (original_size + 1 + 1)); strings->string[original_size + 1] = NULL; strings->string[original_size] = malloc(sizeof(char) * (strlen(string) + 1)); strcpy(strings->string[original_size], string); } /** * osl_strings_equal function: * this function returns true if the two strings structures are the same * (content-wise), false otherwise. * \param[in] s1 The first strings structure. * \param[in] s2 The second strings structure. * \return 1 if s1 and s2 are the same (content-wise), 0 otherwise. */ int osl_strings_equal(osl_strings_p s1, osl_strings_p s2) { size_t i, nb_s1; if (s1 == s2) return 1; if (((s1 == NULL) && (s2 != NULL)) || ((s1 != NULL) && (s2 == NULL)) || ((nb_s1 = osl_strings_size(s1)) != osl_strings_size(s2))) return 0; for (i = 0; i < nb_s1; i++) if (strcmp(s1->string[i], s2->string[i]) != 0) return 0; return 1; } /** * osl_strings_size function: * this function returns the number of elements in the NULL-terminated * strings array of the strings structure. * \param[in] strings The strings structure we need to know the size. * \return The number of strings in the strings structure. */ size_t osl_strings_size(osl_const_strings_const_p strings) { size_t size = 0; if ((strings != NULL) && (strings->string != NULL)) { while (strings->string[size] != NULL) { size++; } } return size; } /** * osl_strings_encapsulate function: * this function builds a new strings structure to encapsulate the string * provided as a parameter (the reference to this string is used directly). * \param[in] string The string to encapsulate in a strings structure. * \return A new strings structure containing only the provided string. */ osl_strings_p osl_strings_encapsulate(char * string) { osl_strings_p capsule = osl_strings_malloc(); free(capsule->string); OSL_malloc(capsule->string, char **, 2 * sizeof(char *)); capsule->string[0] = string; capsule->string[1] = NULL; return capsule; } /** * osl_strings_interface function: * this function creates an interface structure corresponding to the strings * structure and returns it). * \return An interface structure for the strings structure. */ osl_interface_p osl_strings_interface() { osl_interface_p interface = osl_interface_malloc(); OSL_strdup(interface->URI, OSL_URI_STRINGS); interface->idump = (osl_idump_f)osl_strings_idump; interface->sprint = (osl_sprint_f)osl_strings_sprint; interface->sread = (osl_sread_f)osl_strings_sread; interface->malloc = (osl_malloc_f)osl_strings_malloc; interface->free = (osl_free_f)osl_strings_free; interface->clone = (osl_clone_f)osl_strings_clone; interface->equal = (osl_equal_f)osl_strings_equal; return interface; } /** * osl_strings_generate function: * this function generates a new strings structure containing * 'nb_strings' strings of the form "prefixXX" where XX goes from 1 to * nb_strings. * \param[in] prefix The prefix of the generated strings. * \param[in] nb_strings The number of strings to generate. * \return A new strings structure containing generated strings. */ osl_strings_p osl_strings_generate(char * prefix, int nb_strings) { char ** strings = NULL; char buff[strlen(prefix) + 16]; // TODO: better (log10(INT_MAX) ?) :-D. int i; osl_strings_p generated; if (nb_strings) { OSL_malloc(strings, char **, sizeof(char *) * (nb_strings + 1)); strings[nb_strings] = NULL; for (i = 0; i < nb_strings; i++) { sprintf(buff, "%s%d", prefix, i + 1); OSL_strdup(strings[i], buff); if (strings[i] == NULL) OSL_error("memory overflow"); } } generated = osl_strings_malloc(); free(generated->string); generated->string = strings; return generated; } cloog-0.18.4/osl/source/names.c0000644000175000017500000002541512413256474013213 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** extensions/names.c ** **-----------------------------------------------------------------** ** First version: 18/04/2011 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #include #include #include #include #include #include /*+*************************************************************************** * Structure display function * *****************************************************************************/ /** * osl_names_idump function: * this function displays an osl_names_t structure (*names) into a * file (file, possibly stdout) in a way that trends to be understandable. It * includes an indentation level (level) in order to work with others * idump functions. * \param[in] file The file where the information has to be printed. * \param[in] names The names structure whose information has to be printed. * \param[in] level Number of spaces before printing, for each line. */ void osl_names_idump(FILE * file, osl_names_p names, int level) { int j; // Go to the right level. for (j = 0; j < level; j++) fprintf(file, "|\t"); if (names != NULL) fprintf(file, "+-- osl_names_t\n"); else fprintf(file, "+-- NULL names\n"); if (names != NULL) { // A blank line. for (j = 0; j <= level+1; j++) fprintf(file, "|\t"); fprintf(file, "\n"); // Print the various names. osl_strings_idump(file, names->parameters, level + 1); osl_strings_idump(file, names->iterators, level + 1); osl_strings_idump(file, names->scatt_dims, level + 1); osl_strings_idump(file, names->local_dims, level + 1); osl_strings_idump(file, names->arrays, level + 1); } // The last line. for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "\n"); } /** * osl_names_dump function: * this function prints the content of an osl_names_t structure * (*names) into a file (file, possibly stdout). * \param[in] file The file where the information has to be printed. * \param[in] names The names structure whose information has to be printed. */ void osl_names_dump(FILE * file, osl_names_p names) { osl_names_idump(file, names, 0); } /***************************************************************************** * Reading function * *****************************************************************************/ /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ /** * osl_names_malloc function: * this function allocates the memory space for an osl_names_t * structure and sets its fields with default values. Then it returns a * pointer to the allocated space. * \return A pointer to an empty names structure with fields set to * default values. */ osl_names_p osl_names_malloc() { osl_names_p names; OSL_malloc(names, osl_names_p, sizeof(osl_names_t)); names->parameters = NULL; names->iterators = NULL; names->scatt_dims = NULL; names->local_dims = NULL; names->arrays = NULL; return names; } /** * osl_names_free function: * This function frees the allocated memory for an osl_names_t * structure. If the names are not character strings, it is the * responsibility of the user to free each array of elements (including * the array itself), this function will only free the osl_names_t shell. * \param[in,out] names The pointer to the names structure we want to free. */ void osl_names_free(osl_names_p names) { if (names != NULL) { osl_strings_free(names->parameters); osl_strings_free(names->iterators); osl_strings_free(names->scatt_dims); osl_strings_free(names->local_dims); osl_strings_free(names->arrays); free(names); } } /*+*************************************************************************** * Processing functions * *****************************************************************************/ /** * osl_names_generate function: * this function generates some names. For each kind of name it will generate * a given number of names with a given prefix followed by a number. * \param[in] parameter_prefix Prefix for parameter names. * \param[in] nb_parameters Number of parameters names to generate. * \param[in] iterator_prefix Prefix for iterator names. * \param[in] nb_iterators Number of iterators names to generate. * \param[in] scatt_dim_prefix Prefix for scattering dimension names. * \param[in] nb_scatt_dims Number of scattering dim names to generate. * \param[in] local_dim_prefix Prefix for local dimension names. * \param[in] nb_local_dims Number of local dimension names to generate. * \param[in] array_prefix Prefix for array names. * \param[in] nb_arrays Number of array names to generate. * \return A new names structure containing generated names. */ osl_names_p osl_names_generate( char * parameter_prefix, int nb_parameters, char * iterator_prefix, int nb_iterators, char * scatt_dim_prefix, int nb_scatt_dims, char * local_dim_prefix, int nb_local_dims, char * array_prefix, int nb_arrays) { osl_names_p names = osl_names_malloc(); names->parameters= osl_strings_generate(parameter_prefix,nb_parameters); names->iterators = osl_strings_generate(iterator_prefix, nb_iterators); names->scatt_dims= osl_strings_generate(scatt_dim_prefix,nb_scatt_dims); names->local_dims= osl_strings_generate(local_dim_prefix,nb_local_dims); names->arrays = osl_strings_generate(array_prefix, nb_arrays); return names; } /** * osl_names_clone function: * this function builds and returns a "hard copy" (not a pointer copy) of an * osl_names_t data structure provided as parameter. * \param[in] names The pointer to the names structure we want to clone. * \return A pointer to the clone of the names structure provided as parameter. */ osl_names_p osl_names_clone(osl_names_p names) { osl_names_p clone = NULL; if (names != NULL) { clone = osl_names_malloc(); clone->parameters = osl_strings_clone(names->parameters); clone->iterators = osl_strings_clone(names->iterators); clone->scatt_dims = osl_strings_clone(names->scatt_dims); clone->local_dims = osl_strings_clone(names->local_dims); clone->arrays = osl_strings_clone(names->arrays); } return clone; } cloog-0.18.4/osl/source/generic.c0000644000175000017500000005547412413270135013522 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** generic.c ** **-----------------------------------------------------------------** ** First version: 26/11/2010 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #include #include #include #include #include #include #include #include /*+*************************************************************************** * Structure display function * *****************************************************************************/ /** * osl_generic_idump function: * this function displays an osl_generic_t structure (*generic) into * a file (file, possibly stdout) in a way that trends to be understandable. * It includes an indentation level (level) in order to work with others * idump functions. * \param[in] file File where informations are printed. * \param[in] generic The generic whose information has to be printed. * \param[in] level Number of spaces before printing, for each line. */ void osl_generic_idump(FILE * file, osl_generic_p generic, int level) { int j, first = 1; // Go to the right level. for (j = 0; j < level; j++) fprintf(file,"|\t"); if (generic != NULL) fprintf(file, "+-- osl_generic_t\n"); else fprintf(file, "+-- NULL generic\n"); while (generic != NULL) { if (!first) { // Go to the right level. for (j = 0; j < level; j++) fprintf(file, "|\t"); fprintf(file, "| osl_generic_t\n"); } else { first = 0; } // A blank line for(j = 0; j <= level + 1; j++) fprintf(file, "|\t"); fprintf(file, "\n"); osl_interface_idump(file, generic->interface, level + 1); if (generic->interface != NULL) generic->interface->idump(file, generic->data, level + 1); generic = generic->next; // Next line. if (generic != NULL) { for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "V\n"); } } // The last line. for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "\n"); } /** * osl_generic_dump function: * this function prints the content of an osl_generic_t structure * (*generic) into a file (file, possibly stdout). * \param[in] file File where the information has to be printed. * \param[in] generic The generic structure to print. */ void osl_generic_dump(FILE * file, osl_generic_p generic) { osl_generic_idump(file, generic, 0); } /** * osl_generic_sprint function: * this function prints the content of an osl_generic_t structure * (*strings) into a string (returned) in the OpenScop textual format. * \param[in] generic The generic structure which has to be printed. * \return A string containing the OpenScop dump of the generic structure. */ char * osl_generic_sprint(osl_generic_p generic) { int high_water_mark = OSL_MAX_STRING; char * string = NULL, * content; char buffer[OSL_MAX_STRING]; OSL_malloc(string, char *, high_water_mark * sizeof(char)); string[0] = '\0'; while (generic != NULL) { if (generic->interface != NULL) { content = generic->interface->sprint(generic->data); if (content != NULL) { sprintf(buffer, "<%s>\n", generic->interface->URI); osl_util_safe_strcat(&string, buffer, &high_water_mark); osl_util_safe_strcat(&string, content, &high_water_mark); free(content); sprintf(buffer, "\n", generic->interface->URI); osl_util_safe_strcat(&string, buffer, &high_water_mark); } } generic = generic->next; if (generic != NULL) { sprintf(buffer, "\n"); osl_util_safe_strcat(&string, buffer, &high_water_mark); } } return string; } /** * osl_generic_print function: * this function prints the content of an osl_generic_t structure * (*generic) into a string (returned) in the OpenScop format. * \param[in] file File where the information has to be printed. * \param[in] generic The generic structure to print. */ void osl_generic_print(FILE * file, osl_generic_p generic) { char * string; string = osl_generic_sprint(generic); if (string != NULL) { fprintf(file, "%s", string); free(string); } } /** * osl_generic_print_options_scoplib function: * this function prints the options sections (only arrays in the * SCoPLib format) * \param[in] file File where the information has to be printed. * \param[in] generic The generic structure to print. */ void osl_generic_print_options_scoplib(FILE * file, osl_generic_p generic) { char * string; osl_generic_p arrays = osl_generic_lookup(generic, OSL_URI_ARRAYS); string = osl_arrays_sprint((osl_arrays_p) arrays); if (string != NULL) { fprintf(file, "\n%s\n", string); free(string); } } /***************************************************************************** * Reading function * *****************************************************************************/ /** * osl_generic_sread function: * this function reads a list of generic structure from a string complying to * the OpenScop textual format and returns a pointer to this generic structure. * The input parameter is updated to the position in the input string this * function reach right after reading the generic structure. * \param[in,out] input The input string where to find a list of generic. * Updated to the position after what has been read. * \param[in] registry The list of known interfaces (others are ignored). * \return A pointer to the generic information list that has been read. */ osl_generic_p osl_generic_sread(char ** input, osl_interface_p registry) { osl_generic_p generic = NULL, new; while (**input != '\0') { new = osl_generic_sread_one(input, registry); osl_generic_add(&generic, new); } return generic; } /** * osl_generic_sread_one function: * this function reads one generic structure from a string complying to the * OpenScop textual format and returns a pointer to this generic structure. * The input parameter is updated to the position in the input string this * function reach right after reading the generic structure. * \param[in,out] input The input string where to find a generic. * Updated to the position after what has been read. * \param[in] registry The list of known interfaces (others are ignored). * \return A pointer to the generic structure that has been read. */ osl_generic_p osl_generic_sread_one(char ** input, osl_interface_p registry) { char * tag; char * content, * temp; osl_generic_p generic = NULL; osl_interface_p interface; tag = osl_util_read_tag(NULL, input); if ((tag == NULL) || (strlen(tag) < 1) || (tag[0] == '/')) { OSL_debug("empty tag name or closing tag instead of an opening one"); return NULL; } content = osl_util_read_uptoendtag(NULL, input, tag); interface = osl_interface_lookup(registry, tag); temp = content; if (interface == NULL) { OSL_warning("unsupported generic"); fprintf(stderr, "[osl] Warning: unknown URI \"%s\".\n", tag); } else { generic = osl_generic_malloc(); generic->interface = osl_interface_nclone(interface, 1); generic->data = interface->sread(&temp); } free(content); free(tag); return generic; } /** * osl_generic_read_one function: * this function reads one generic from a file (possibly stdin) * complying to the OpenScop textual format and a list of known interfaces. * It returns a pointer to the corresponding generic structure. If no * tag is found, an error is reported, in the case of an empty or closing tag * name the function returns the NULL pointer. * \param[in] file The input file where to read a list of data. * \param[in] registry The list of known interfaces (others are ignored). * \return A pointer to the generic that has been read. */ osl_generic_p osl_generic_read_one(FILE * file, osl_interface_p registry) { char * tag; char * content, * temp; osl_generic_p generic = NULL; osl_interface_p interface; tag = osl_util_read_tag(file, NULL); if ((tag == NULL) || (strlen(tag) < 1) || (tag[0] == '/')) { OSL_debug("empty tag name or closing tag instead of an opening one"); return NULL; } content = osl_util_read_uptoendtag(file, NULL, tag); interface = osl_interface_lookup(registry, tag); temp = content; if (interface == NULL) { OSL_warning("unsupported generic"); fprintf(stderr, "[osl] Warning: unknown URI \"%s\".\n", tag); } else { generic = osl_generic_malloc(); generic->interface = osl_interface_nclone(interface, 1); generic->data = interface->sread(&temp); } free(content); free(tag); return generic; } /** * osl_generic_read function: * this function reads a list of generics from a file (possibly stdin) * complying to the OpenScop textual format and a list of known interfaces. * It returns a pointer to the list of corresponding generic structures. * \param[in] file The input file where to read a list of data. * \param[in] registry The list of known interfaces (others are ignored). * \return A pointer to the generic information list that has been read. */ osl_generic_p osl_generic_read(FILE * file, osl_interface_p registry) { char * generic_string, * temp; osl_generic_p generic_list; generic_string = osl_util_read_uptoendtag(file, NULL, OSL_URI_SCOP); temp = generic_string; generic_list = osl_generic_sread(&temp, registry); free(generic_string); return generic_list; } /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ /** * osl_generic_add function: * this function adds a generic node (it may be a list as well) to a list * of generics provided as parameter (list). The new node is inserted at * the end of the list. * \param[in] list The list of generics to add a node (NULL if empty). * \param[in] generic The generic list to add to the initial list. */ void osl_generic_add(osl_generic_p * list, osl_generic_p generic) { osl_generic_p tmp = *list, check; if (generic != NULL) { // First, check that the generic list is OK. check = generic; while (check != NULL) { if ((check->interface == NULL) || (check->interface->URI == NULL)) OSL_error("no interface or URI in a generic to add to a list"); // TODO: move this to the integrity check. if (osl_generic_lookup(*list, check->interface->URI) != NULL) OSL_error("only one generic with a given URI is allowed"); check = check->next; } if (*list != NULL) { while (tmp->next != NULL) tmp = tmp->next; tmp->next = generic; } else { *list = generic; } } } /** * osl_generic_remove_node function: * this functions removes a given generic from a generic list * \param[in] list Address of a generic list * \param[in] generic Pointer to the generic to be removed * Assumes a single node is to be removed. */ void osl_generic_remove_node(osl_generic_p * list, osl_generic_p generic) { osl_generic_p tmp = NULL; if (generic != NULL) { if (*list != NULL) { //target is the first element of list if(*list==generic){ *list = generic->next; generic->next=NULL; //free below removes the whole list! osl_generic_free(generic); return; } //find target tmp = *list; while (tmp->next!=generic && tmp->next != NULL) tmp = tmp->next; if(tmp->next==generic){ tmp->next = generic->next; generic->next=NULL; //free below removes the whole list! osl_generic_free(generic); } else //target not found OSL_warning("generic not found in the list\n"); } } } /** * osl_generic_remove function: * given a URI, this function removes that generic from the list * \param[in] list Address of a generic list * \param[in] URI Pointer to the URI string */ void osl_generic_remove(osl_generic_p *list, char * URI){ osl_generic_p tmp = *list; while(tmp != NULL){ if(osl_generic_has_URI(tmp, URI)) break; tmp = tmp->next; } if(tmp!=NULL){ osl_generic_remove_node(list, tmp); } } /** * osl_generic_malloc function: * This function allocates the memory space for an osl_generic_t * structure and sets its fields with default values. Then it returns a * pointer to the allocated space. * \return A pointer to an empty generic structure with fields set to * default values. */ osl_generic_p osl_generic_malloc() { osl_generic_p generic; OSL_malloc(generic, osl_generic_p, sizeof(osl_generic_t)); generic->interface = NULL; generic->data = NULL; generic->next = NULL; return generic; } /** * osl_generic_free function: * This function frees the allocated memory for a generic structure. * \param[in] generic The pointer to the generic structure we want to free. */ void osl_generic_free(osl_generic_p generic) { osl_generic_p next; while (generic != NULL) { next = generic->next; if (generic->interface != NULL) { generic->interface->free(generic->data); osl_interface_free(generic->interface); } else { if (generic->data != NULL) { OSL_warning("unregistered interface, memory leaks are possible"); free(generic->data); } } free(generic); generic = next; } } /*+*************************************************************************** * Processing functions * *****************************************************************************/ /** * osl_generic_number function: * this function returns the number of statements in the generic list * provided as parameter. * \param[in] generic The first element of the generic list. * \return The number of statements in the generic list. */ int osl_generic_number(osl_generic_p generic) { int number = 0; while (generic != NULL) { number++; generic = generic->next; } return number; } /** * osl_generic_clone function: * This function builds and returns a "hard copy" (not a pointer copy) of an * osl_generic_t data structure. * \param[in] generic The pointer to the generic structure we want to clone. * \return A pointer to the clone of the input generic structure. */ osl_generic_p osl_generic_clone(osl_generic_p generic) { osl_generic_p clone = NULL, new; osl_interface_p interface; void * x; while (generic != NULL) { if (generic->interface != NULL) { x = generic->interface->clone(generic->data); interface = osl_interface_clone(generic->interface); new = osl_generic_malloc(); new->interface = interface; new->data = x; osl_generic_add(&clone, new); } else { OSL_warning("unregistered interface, cloning ignored"); } generic = generic->next; } return clone; } /** * osl_generic_count function: * this function counts the number of elements in the generic list provided * as parameter (x) and returns this number. * \param[in] x The list of generics. * \return The number of elements in the list. */ int osl_generic_count(osl_generic_p x) { int generic_number = 0; while (x != NULL) { generic_number++; x = x->next; } return generic_number; } /** * osl_generic_equal function: * this function returns true if the two generic structures are the same, * false otherwise. This functions considers two generic structures as equal * independently of the order of the nodes. * \param[in] x1 The first generic structure. * \param[in] x2 The second generic structure. * \return 1 if x1 and x2 are the same (content-wise), 0 otherwise. */ int osl_generic_equal(osl_generic_p x1, osl_generic_p x2) { int x1_generic_number, x2_generic_number; int found, equal; osl_generic_p backup_x2 = x2; if (x1 == x2) return 1; // Check whether the number of generics is the same or not. x1_generic_number = osl_generic_count(x1); x2_generic_number = osl_generic_count(x2); if (x1_generic_number != x2_generic_number) return 0; // Check that for each generic in x1 a similar generic is in x2. while (x1 != NULL) { x2 = backup_x2; found = 0; while ((x2 != NULL) && (found != 1)) { if (osl_interface_equal(x1->interface, x2->interface)) { if (x1->interface != NULL) { equal = x1->interface->equal(x1->data, x2->data); } else { OSL_warning("unregistered generic, " "cannot state generic equality"); equal = 0; } if (equal == 0) return 0; else found = 1; } x2 = x2->next; } if (found != 1) return 0; x1 = x1->next; } return 1; } /** * osl_generic_has_URI function: * this function returns 1 if the generic provided as parameter has * a given URI, 0 other wise. * \param[in] x The generic structure to test. * \param[in] URI The URI value to test. * \return 1 if x has the provided URI, 0 otherwise. */ int osl_generic_has_URI(osl_const_generic_const_p x, char const * const URI) { if ((x == NULL) || (x->interface == NULL) || (x->interface->URI == NULL) || (strcmp(x->interface->URI, URI))) return 0; return 1; } /** * osl_generic_lookup function: * this function returns the first generic with a given URI in the * generic list provided as parameter and NULL if it doesn't find such * a generic. * \param[in] x The generic list where to search a given generic URI. * \param[in] URI The URI of the generic we are looking for. * \return The first generic of the requested URI in the list. */ void * osl_generic_lookup(osl_generic_p x, char const * const URI) { while (x != NULL) { if (osl_generic_has_URI(x, URI)) return x->data; x = x->next; } return NULL; } /** * osl_generic_shell function: * this function creates and returns a generic structure "shell" which * embed the data and interface provided as parameters. * \param[in] data Data to put in the generic shell. * \param[in] interface Interface to put in the generic shell. * \return A new generic structure containing the data and interface. */ osl_generic_p osl_generic_shell(void * data, osl_interface_p interface) { osl_generic_p generic = NULL; if ((data == NULL) || (interface == NULL)) OSL_warning("shell created with some empty elements inside"); generic = osl_generic_malloc(); generic->data = data; generic->interface = interface; return generic; } cloog-0.18.4/osl/source/int.c0000644000175000017500000010722012413270135012663 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** int.c ** **-----------------------------------------------------------------** ** First version: 18/07/2011 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #include #include #include #ifdef OSL_GMP_IS_HERE # include #endif #include #include /*+*************************************************************************** * Basic Functions * *****************************************************************************/ /** * osl_int_is_precision_supported function: * this function returns 1 if the precision provided as parameter is supported * by the library and 0 otherwise. Possible values for the precision * parameter are OSL_PRECISION_SP for 32 bits (single) precision, * OSL_PRECISION_DP for 64 bits (double) precision and OSL_PRECISION_MP for * multiple precision. * \param[in] precision The precision to check for. * \return 1 if the precision is supported, 0 otherwise. */ int osl_int_is_precision_supported(int precision) { switch (precision) { case OSL_PRECISION_SP: return 1; case OSL_PRECISION_DP: return 1; #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: return 1; #endif } return 0; } /** * osl_int_dump_precision function: * this function prints in a human readable fashion the precision * corresponding to the "precision" parameter. * \param[in] file The file where to print the precision. * \param[in] precision The precision to print. */ void osl_int_dump_precision(FILE * file, int precision) { switch (precision) { case OSL_PRECISION_SP: fprintf(file, "32 bits"); break; case OSL_PRECISION_DP: fprintf(file, "64 bits"); break; #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: fprintf(file, "GMP"); break; #endif default: fprintf(file, "unknown precision %d", precision); } } /** * \brief Initialize the osl int * \param[in] precision Precision of the osl int * \param[in] variable A osl int to initialize */ void osl_int_init(int precision, osl_int_const_p variable) { switch (precision) { case OSL_PRECISION_SP: variable->sp = 0; break; case OSL_PRECISION_DP: variable->dp = 0; break; #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: OSL_malloc(variable->mp, void*, sizeof(mpz_t)); mpz_init(*variable->mp); break; #endif default: OSL_error("unknown precision"); } } /** * \brief Initialize the osl int * \param[in] precision Precision of the osl int */ osl_int_p osl_int_malloc(int precision) { osl_int_p variable; OSL_malloc(variable, osl_int_p, sizeof(osl_int_t)); osl_int_init(precision, variable); return variable; } /** * \brief variable = value * \param[in] precision Precision of the osl int * \param[in] variable A osl int to assign * \param[in] value Value in a osl int */ void osl_int_assign(int precision, osl_int_const_p variable, osl_const_int_t value) { switch (precision) { case OSL_PRECISION_SP: variable->sp = value.sp; break; case OSL_PRECISION_DP: variable->dp = value.dp; break; #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: mpz_set(*variable->mp, *value.mp); break; #endif default: OSL_error("unknown precision"); } } /** * \brief variable = i * \param[in] precision Precision of the osl int * \param[in] variable A osl int to assign * \param[in] i Value in a int */ void osl_int_set_si(int precision, osl_int_const_p variable, int i) { switch (precision) { case OSL_PRECISION_SP: variable->sp = (long int)i; break; case OSL_PRECISION_DP: variable->dp = (long long int)i; break; #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: mpz_set_si(*variable->mp, i); break; #endif default: OSL_error("unknown precision"); } } /** * \brief Get the value in a int * \param[in] precision Precision of the osl int * \param[in] value Value in a osl int * \return the value in a int */ int osl_int_get_si(int precision, osl_const_int_t value) { switch (precision) { case OSL_PRECISION_SP: #ifndef NDEBUG if (value.sp > (long int)(INT_MAX)) OSL_overflow("osl_int_get_si overflow"); if (value.sp < (long int)(INT_MIN)) OSL_overflow("osl_int_get_si overflow"); #endif return (int)value.sp; case OSL_PRECISION_DP: #ifndef NDEBUG if (value.dp > (long long int)(INT_MAX)) OSL_overflow("osl_int_get_si overflow"); if (value.dp < (long long int)(INT_MIN)) OSL_overflow("osl_int_get_si overflow"); #endif return (int)value.dp; #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: #ifndef NDEBUG if (mpz_fits_sint_p(*value.mp) == 0) OSL_overflow("osl_int_get_si overflow"); #endif return mpz_get_si(*value.mp); #endif default: OSL_error("unknown precision"); } } /** * \brief Get the value in a double * \param[in] precision Precision of the osl int * \param[in] i Value in a osl int * \return the value in a double */ double osl_int_get_d(int precision, osl_const_int_t i) { switch (precision) { case OSL_PRECISION_SP: return (double)i.sp; case OSL_PRECISION_DP: return (double)i.dp; #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: return mpz_get_d(*i.mp); #endif default: OSL_error("unknown precision"); } } /** * \brief variable = i // including initialization for GMP * \param[in] precision Precision of the osl int * \param[in] variable A osl int to initialize * \param[in] i Value in a osl int */ void osl_int_init_set(int precision, osl_int_const_p variable, osl_const_int_t i) { osl_int_init(precision, variable); osl_int_assign(precision, variable, i); } /** * \brief variable = i // including initialization for GMP * \param[in] precision Precision of the osl int * \param[in] variable A osl int to initialize * \param[in] i Value in a osl int */ void osl_int_init_set_si(int precision, osl_int_const_p variable, int i) { switch (precision) { case OSL_PRECISION_SP: variable->sp = (long int)i; break; case OSL_PRECISION_DP: variable->dp = (long long int)i; break; #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: OSL_malloc(variable->mp, void*, sizeof(mpz_t)); mpz_init_set_si(*variable->mp, i); break; #endif default: OSL_error("unknown precision"); } } /** * \brief Swap the osl ints * \param[in] precision Precision of the osl ints * \param[in] var1 First osl int to swap * \param[in] var2 Second osl int to swap */ void osl_int_swap(int precision, osl_int_const_p var1, osl_int_const_p var2) { switch (precision) { case OSL_PRECISION_SP: { long int temp = var1->sp; var1->sp = var2->sp; var2->sp = temp; break; } case OSL_PRECISION_DP: { long long int temp = var1->dp; var1->dp = var2->dp; var2->dp = temp; break; } #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: { mpz_t temp; mpz_init(temp); mpz_set(temp, *var1->mp); mpz_set(*var1->mp, *var2->mp); mpz_set(*var2->mp, temp); mpz_clear(temp); break; } #endif default: OSL_error("unknown precision"); } } /** * \brief variable = 0 // including cleaning for GMP * \param[in] precision Precision of the osl int * \param[in] variable A osl int to clear */ void osl_int_clear(int precision, osl_int_const_p variable) { switch (precision) { case OSL_PRECISION_SP: variable->sp = 0; break; case OSL_PRECISION_DP: variable->dp = 0; break; #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: mpz_clear(*variable->mp); free(variable->mp); break; #endif default: OSL_error("unknown precision"); } } /** * \brief Free thr osl int * \param[in] precision Precision of the osl int * \param[in] variable A osl int to free */ void osl_int_free(int precision, osl_int_const_p variable) { osl_int_clear(precision, variable); free(variable); } /** * osl_int_print function: * this function displays an integer value into a file (file, possibly stdout). * \param file The file where the integer has to be printed. * \param precision The precision of the integer. * \param value The integer element to print. */ void osl_int_print(FILE * file, int precision, osl_const_int_t value) { char string[OSL_MAX_STRING]; osl_int_sprint(string, precision, value); fprintf(file, "%s", string); } /** * osl_int_sprint function: * this function prints an integer value into a string, it uses the * OpenScop Library formats OSL_FMT_* to format the printing. * \param string The string where the integer has to be printed. * \param precision The precision of the integer. * \param value The integer element to print. */ void osl_int_sprint(char * string, int precision, osl_const_int_t value) { switch (precision) { case OSL_PRECISION_SP: sprintf(string, OSL_FMT_SP, value.sp); break; case OSL_PRECISION_DP: sprintf(string, OSL_FMT_DP, value.dp); break; #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: { char * str; str = mpz_get_str(0, 10, *value.mp); //TODO: 10 -> #define sprintf(string, OSL_FMT_MP, str); free(str); break; } #endif default: OSL_error("unknown precision"); } } /** * osl_int_sprint_txt function: * this function is similar to osl_int_sprintf but it prints the value * using OSL_TMT_TXT_* formats. * \see osl_int_sprintf */ void osl_int_sprint_txt(char * string, int precision, osl_const_int_t value) { switch (precision) { case OSL_PRECISION_SP: sprintf(string, OSL_FMT_TXT_SP, value.sp); break; case OSL_PRECISION_DP: sprintf(string, OSL_FMT_TXT_DP, value.dp); break; #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: { char * str; str = mpz_get_str(0, 10, *value.mp); //TODO: 10 -> #define sprintf(string, OSL_FMT_TXT_MP, str); free(str); break; } #endif default: OSL_error("unknown precision"); } } /** * \brief sscanf for osl int * \param[in] string Integer in a char* * \param[in] precision Precision of the osl int * \param[in] i A osl int to save integer * \return the number of char readed */ int osl_int_sscanf(char* string, int precision, osl_int_const_p i) { int nb_read = 0; switch (precision) { case OSL_PRECISION_SP: nb_read = sscanf(string, OSL_FMT_TXT_SP, &(i->sp)); break; case OSL_PRECISION_DP: nb_read = sscanf(string, OSL_FMT_TXT_DP, &(i->dp)); break; #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: { nb_read = gmp_sscanf(string, "%lZd", i->mp); break; } #endif default: OSL_error("unknown precision"); } if (nb_read == 0) { OSL_error("failed to read an integer"); } return nb_read; } /** * \brief sread for osl int * \param[in] string Integer in a char** * \param[in] precision Precision of the osl int * \param[in] i A osl int to save integer */ void osl_int_sread(char ** string, int precision, osl_int_const_p i) { // Update the position in the input string. *string += osl_int_sscanf(*string, precision, i); } /*+*************************************************************************** * Arithmetic Operations * *****************************************************************************/ /** * \brief variable = value + 1 * \param[in] precision Precision of the osl int * \param[in] variable A osl int to save the result * \param[in] value Value in a osl int */ void osl_int_increment(int precision, osl_int_const_p variable, osl_const_int_t value) { osl_int_add_si(precision, variable, value, 1); } /** * \brief variable = value - 1 * \param[in] precision Precision of the osl int * \param[in] variable A osl int to save the result * \param[in] value Value in a osl int */ void osl_int_decrement(int precision, osl_int_const_p variable, osl_const_int_t value) { osl_int_add_si(precision, variable, value, -1); } /** * \brief variable = val1 + val2 * \param[in] precision Precision of the osl int * \param[in] variable A osl int to save the result * \param[in] val1 Value of first osl int * \param[in] val2 Value of second osl int */ void osl_int_add(int precision, osl_int_const_p variable, osl_const_int_t val1, osl_const_int_t val2) { switch (precision) { case OSL_PRECISION_SP: #ifndef NDEBUG if (osl_int_pos(precision, val1) && osl_int_pos(precision, val2)) { if (LONG_MAX - val1.sp < val2.sp) OSL_overflow("osl_int_add overflow"); } else if (osl_int_neg(precision, val1) && osl_int_neg(precision, val2)) { if (val1.sp - LONG_MIN < -val2.sp) OSL_overflow("osl_int_add overflow"); } #endif variable->sp = val1.sp + val2.sp; break; case OSL_PRECISION_DP: #ifndef NDEBUG if (osl_int_pos(precision, val1) && osl_int_pos(precision, val2)) { if (LLONG_MAX - val1.dp < val2.dp) OSL_overflow("osl_int_add overflow"); } else if (osl_int_neg(precision, val1) && osl_int_neg(precision, val2)) { if (val1.dp - LLONG_MIN < -val2.dp) OSL_overflow("osl_int_add overflow"); } #endif variable->dp = val1.dp + val2.dp; break; #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: mpz_add(*variable->mp, *val1.mp, *val2.mp); break; #endif default: OSL_error("unknown precision"); } } /** * \brief variable = val1 + i * \param[in] precision Precision of the osl int * \param[in] variable A osl int to save the result * \param[in] value Value of first int in a osl int * \param[in] i Value of second int in a int */ void osl_int_add_si(int precision, osl_int_const_p variable, osl_const_int_t value, int i) { switch (precision) { case OSL_PRECISION_SP: #ifndef NDEBUG if (osl_int_pos(precision, value) && i > 0) { if (LONG_MAX - value.sp < i) OSL_overflow("osl_int_add_si overflow"); } else if (osl_int_neg(precision, value) && i < 0) { if (value.sp - LONG_MIN < -i) OSL_overflow("osl_int_add_si overflow"); } #endif variable->sp = value.sp + (long int)i; break; case OSL_PRECISION_DP: #ifndef NDEBUG if (osl_int_pos(precision, value) && i > 0) { if (LLONG_MAX - value.dp < i) OSL_overflow("osl_int_add_si overflow"); } else if (osl_int_neg(precision, value) && i < 0) { if (value.dp - LLONG_MIN < -i) OSL_overflow("osl_int_add_si overflow"); } #endif variable->dp = value.dp + (long long int)i; break; #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: { mpz_t si; mpz_init_set_si(si, i); mpz_add(*variable->mp, *value.mp, si); mpz_clear(si); break; } #endif default: OSL_error("unknown precision"); } } /** * \brief variable = val1 - val2 * \param[in] precision Precision of the osl int * \param[in] variable A osl int to save the result * \param[in] val1 Value of first osl int * \param[in] val2 Value of second osl int */ void osl_int_sub(int precision, osl_int_const_p variable, osl_const_int_t val1, osl_const_int_t val2) { #ifdef OSL_GMP_IS_HERE if (precision == OSL_PRECISION_MP) { mpz_sub(*variable->mp, *val1.mp, *val2.mp); } else #endif { osl_int_t mval2; osl_int_init(precision, &mval2); osl_int_oppose(precision, &mval2, val2); osl_int_add(precision, variable, val1, mval2); } } /** * \brief variable = val1 * val2 * \param[in] precision Precision of the osl int * \param[in] variable A osl int to save the result * \param[in] val1 Value of first osl int * \param[in] val2 Value of second osl int */ void osl_int_mul(int precision, osl_int_const_p variable, osl_const_int_t val1, osl_const_int_t val2) { switch (precision) { case OSL_PRECISION_SP: variable->sp = val1.sp * val2.sp; #ifndef NDEBUG if (!osl_int_zero(precision, val1) && !osl_int_zero(precision, val2)) { if (variable->sp / val2.sp != val1.sp) { OSL_overflow("osl_int_mul overflow"); } } #endif break; case OSL_PRECISION_DP: variable->dp = val1.dp * val2.dp; #ifndef NDEBUG if (!osl_int_zero(precision, val1) && !osl_int_zero(precision, val2)) { if (variable->dp / val2.dp != val1.dp) { OSL_overflow("osl_int_mul overflow"); } } #endif break; #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: mpz_mul(*variable->mp, *val1.mp, *val2.mp); break; #endif default: OSL_error("unknown precision"); } } /** * \brief variable = val1 * i * \param[in] precision Precision of the osl int * \param[in] variable A osl int to save the result * \param[in] value Value of first int in a osl int * \param[in] i Value of second int in a int */ void osl_int_mul_si(int precision, osl_int_const_p variable, osl_const_int_t value, int i) { switch (precision) { case OSL_PRECISION_SP: variable->sp = value.sp * (long int)i; #ifndef NDEBUG if (!osl_int_zero(precision, value) && i != 0) { if (variable->sp / (long int)i != value.sp) { OSL_overflow("osl_int_mul_si overflow"); } } #endif break; case OSL_PRECISION_DP: variable->dp = value.dp * (long long int)i; #ifndef NDEBUG if (!osl_int_zero(precision, value) && i != 0) { if (variable->dp / (long long int)i != value.dp) { OSL_overflow("osl_int_mul_si overflow"); } } #endif break; #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: mpz_mul_si(*variable->mp, *value.mp, i); break; #endif default: OSL_error("unknown precision"); } } /** * \brief q = a / b * \pre b divides a (without remainder) * \param[in] precision Precision of the osl int * \param[in] q Quotient in a osl int * \param[in] a Value of first osl int * \param[in] b Value of second osl int */ void osl_int_div_exact(int const precision, osl_int_const_p q, osl_const_int_t a, osl_const_int_t b) { switch (precision) { case OSL_PRECISION_SP: q->sp = a.sp / b.sp; return; case OSL_PRECISION_DP: q->dp = a.dp / b.dp; return; #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: mpz_divexact(*q->mp, *a.mp, *b.mp); return; #endif default: OSL_error("unknown precision"); } } /** * \brief q = floor(a / b) * \param[in] precision Precision of the osl int * \param[in] q Quotient in a osl int * \param[in] a Value of first osl int * \param[in] b Value of second osl int */ void osl_int_floor_div_q(int const precision, osl_int_const_p q, osl_const_int_t a, osl_const_int_t b) { switch (precision) { case OSL_PRECISION_SP: q->sp = a.sp / b.sp; if (q->sp < 0) { if (a.sp % b.sp != 0) --q->sp; } else if (q->sp == 0) { if ((osl_int_pos(precision, a) && osl_int_neg(precision, b)) || (osl_int_neg(precision, a) && osl_int_pos(precision, b))) { --q->sp; } } return; case OSL_PRECISION_DP: q->dp = a.dp / b.dp; if (q->dp < 0) { if (a.dp % b.dp != 0) --q->dp; } else if (q->dp == 0) { if ((osl_int_pos(precision, a) && osl_int_neg(precision, b)) || (osl_int_neg(precision, a) && osl_int_pos(precision, b))) { --q->dp; } } return; #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: mpz_fdiv_q(*q->mp, *a.mp, *b.mp); return; #endif default: OSL_error("unknown precision"); } } /** * \brief r = a - b * (a / b) * \param[in] precision Precision of the osl int * \param[in] r Remainder in a osl int * \param[in] a Value of first osl int * \param[in] b Value of second osl int */ void osl_int_floor_div_r(int const precision, osl_int_const_p r, osl_const_int_t a, osl_const_int_t b) { switch (precision) { case OSL_PRECISION_SP: osl_int_floor_div_q(precision, r, a, b); r->sp = a.sp - r->sp * b.sp; return; case OSL_PRECISION_DP: osl_int_floor_div_q(precision, r, a, b); r->dp = a.dp - r->dp * b.dp; return; #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: mpz_fdiv_r(*r->mp, *a.mp, *b.mp); return; #endif default: OSL_error("unknown precision"); } } /** * \brief Compute (q, r) such that a = b * q + r * \param[in] precision Precision of the osl int * \param[in] q Quotient in a osl int * \param[in] r Remainder in a osl int * \param[in] a Value of first osl int * \param[in] b Value of second osl int */ void osl_int_floor_div_q_r(int const precision, osl_int_const_p q, osl_int_const_p r, osl_const_int_t a, osl_const_int_t b) { switch (precision) { case OSL_PRECISION_SP: osl_int_floor_div_q(precision, q, a, b); r->sp = a.sp - q->sp * b.sp; return; case OSL_PRECISION_DP: osl_int_floor_div_q(precision, q, a, b); r->dp = a.dp - q->dp * b.dp; return; #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: mpz_fdiv_qr(*q->mp, *r->mp, *a.mp, *b.mp); return; #endif default: OSL_error("unknown precision"); } } /** * \brief mod = a % b * \pre mod is always positive * \param[in] precision Precision of the osl int * \param[in] mod Modulo in a osl int * \param[in] a Value of first osl int * \param[in] b Value of second osl int */ void osl_int_mod(int const precision, osl_int_const_p mod, osl_const_int_t a, osl_const_int_t b) { switch (precision) { case OSL_PRECISION_SP: mod->sp = a.sp % b.sp; if (mod->sp < 0) mod->sp += labs(b.sp); return; case OSL_PRECISION_DP: mod->dp = a.dp % b.dp; if (mod->dp < 0) mod->dp += llabs(b.dp); return; #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: mpz_mod(*mod->mp, *a.mp, *b.mp); return; #endif default: OSL_error("unknown precision"); } } // gcd (greatest common divisor) for long long int static long long int llgcd(long long int const a, long long int const b) { return (b ? llgcd(b, a % b) : a); } /** * \brief Compute the gcd (greatest common divisor) of a and b * \param[in] precision Precision of the osl int * \param[in] gcd Greatest common divisor in a osl int * \param[in] a Value of first osl int * \param[in] b Value of second osl int */ void osl_int_gcd(int const precision, osl_int_const_p gcd, osl_const_int_t a, osl_const_int_t b) { switch (precision) { case OSL_PRECISION_SP: gcd->sp = labs(llgcd(a.sp, b.sp)); return; case OSL_PRECISION_DP: gcd->dp = llabs(llgcd(a.dp, b.dp)); return; #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: mpz_gcd(*gcd->mp, *a.mp, *b.mp); return; #endif default: OSL_error("unknown precision"); } } /** * \brief variable = - value * \param[in] precision Precision of the osl int * \param[in] variable A osl int to get the oppose * \param[in] value Value in a osl int */ void osl_int_oppose(int precision, osl_int_const_p variable, osl_const_int_t value) { switch (precision) { case OSL_PRECISION_SP: variable->sp = -value.sp; break; case OSL_PRECISION_DP: variable->dp = -value.dp; break; #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: mpz_neg(*variable->mp, *value.mp); break; #endif default: OSL_error("unknown precision"); } } /** * \brief variable = | value | * \param[in] precision Precision of the osl int * \param[in] variable A osl int to get the absolute value * \param[in] value Value in a osl int */ void osl_int_abs(int precision, osl_int_const_p variable, osl_const_int_t value) { switch (precision) { case OSL_PRECISION_SP: variable->sp = (value.sp > 0) ? value.sp : -value.sp; break; case OSL_PRECISION_DP: variable->dp = (value.dp > 0) ? value.dp : -value.dp; break; #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: mpz_abs(*variable->mp, *value.mp); break; #endif default: OSL_error("unknown precision"); } } // log2 function for long long int static size_t lllog2(long long int x) { size_t n = 0; x = llabs(x); while (x) { x >>= 1; ++n; } return ((n == 0) ? 1 : n); } /** * \brief Get the size in base 2 * \param[in] precision Precision of the osl int * \param[in] value Value in a osl int * \return the size in base 2 */ size_t osl_int_size_in_base_2(int const precision, osl_const_int_t const value) { switch (precision) { case OSL_PRECISION_SP: return lllog2(value.sp); case OSL_PRECISION_DP: return lllog2(value.dp); #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: return mpz_sizeinbase(*value.mp, 2); #endif default: OSL_error("unknown precision"); } } // log10 function for long long int static size_t lllog10(long long int x) { size_t n = 0; x = llabs(x); while (x) { x /= 10; ++n; } return n; } /** * \brief Get the size in base 10 * \warning warning mpz_sizeinbase may not return the same result with same integer in different precisions * \param[in] precision Precision of the osl int * \param[in] value Value in a osl int * \return the size in base 10 */ size_t osl_int_size_in_base_10(int const precision, osl_const_int_t const value) { switch (precision) { case OSL_PRECISION_SP: return lllog10(value.sp); case OSL_PRECISION_DP: return lllog10(value.dp); #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: return mpz_sizeinbase(*value.mp, 10); #endif default: OSL_error("unknown precision"); } } /*+*************************************************************************** * Conditional Operations * *****************************************************************************/ /** * \brief val1 == val2 * \param[in] precision Precision of the osl int * \param[in] val1 Value of first osl int * \param[in] val2 Value of second osl int * \return 1 if values are equal, false otherwise */ int osl_int_eq(int precision, osl_const_int_t val1, osl_const_int_t val2) { switch (precision) { case OSL_PRECISION_SP: return (val1.sp == val2.sp); case OSL_PRECISION_DP: return (val1.dp == val2.dp); #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: return (mpz_cmp(*val1.mp, *val2.mp) == 0); #endif default: OSL_error("unknown precision"); } } /** * \brief val1 != val2 * \param[in] precision Precision of the osl int * \param[in] val1 Value of first osl int * \param[in] val2 Value of second osl int * \return 1 if values are not equal, false otherwise */ int osl_int_ne(int precision, osl_const_int_t val1, osl_const_int_t val2) { return !osl_int_eq(precision, val1, val2); } /** * \brief value > 0 * \param[in] precision Precision of the osl int * \param[in] value Value in a osl int * \return 1 if value is > 0, false otherwise */ int osl_int_pos(int precision, osl_const_int_t value) { switch (precision) { case OSL_PRECISION_SP: return (value.sp > 0); case OSL_PRECISION_DP: return (value.dp > 0); #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: return (mpz_sgn(*value.mp) > 0); #endif default: OSL_error("unknown precision"); } } /** * \brief value < 0 * \param[in] precision Precision of the osl int * \param[in] value Value in a osl int * \return 1 if value < 0, false otherwise */ int osl_int_neg(int precision, osl_const_int_t value) { switch (precision) { case OSL_PRECISION_SP: return (value.sp < 0); case OSL_PRECISION_DP: return (value.dp < 0); #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: return (mpz_sgn(*value.mp) < 0); #endif default: OSL_error("unknown precision"); } } /** * \brief value == 0 * \param[in] precision Precision of the osl int * \param[in] value Value in a osl int * \return 1 if value equal to 0, false otherwise */ int osl_int_zero(int precision, osl_const_int_t value) { switch (precision) { case OSL_PRECISION_SP: return (value.sp == 0); case OSL_PRECISION_DP: return (value.dp == 0); #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: return (mpz_sgn(*value.mp) == 0); #endif default: OSL_error("unknown precision"); } } /** * \brief value == 1 * \param[in] precision Precision of the osl int * \param[in] value Value in a osl int * \return 1 if value equal to 1, false otherwise */ int osl_int_one(int precision, osl_const_int_t value) { switch (precision) { case OSL_PRECISION_SP: return (value.sp == (long int)1); case OSL_PRECISION_DP: return (value.dp == (long long int)1); #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: return (mpz_cmp_si(*value.mp, 1) == 0); #endif default: OSL_error("unknown precision"); } } /** * \brief value == -1 * \param[in] precision Precision of the osl int * \param[in] value Value in a osl int * \return 1 if value equal to -1, false otherwise */ int osl_int_mone(int precision, osl_const_int_t value) { switch (precision) { case OSL_PRECISION_SP: return (value.sp == (long int)-1); case OSL_PRECISION_DP: return (value.dp == (long long int)-1); #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: return (mpz_cmp_si(*value.mp, -1) == 0); #endif default: OSL_error("unknown precision"); } } /** * \brief (val1 % val2) == 0 * \param[in] precision Precision of the osl int * \param[in] val1 Value of first osl int * \param[in] val2 Value of second osl int * \return 1 if val2 divises val1 without remainder, false otherwise */ int osl_int_divisible(int precision, osl_const_int_t val1, osl_const_int_t val2) { switch (precision) { case OSL_PRECISION_SP: return ((val1.sp % val2.sp) == 0); case OSL_PRECISION_DP: return ((val1.dp % val2.dp) == 0); #ifdef OSL_GMP_IS_HERE case OSL_PRECISION_MP: return mpz_divisible_p(*val1.mp, *val2.mp); #endif default: OSL_error("unknown precision"); } } /*+*************************************************************************** * Processing functions * *****************************************************************************/ /** * \brief Change the precision of the osl_int * \param[in] precision Precision of the osl int * \param[in] new_precision Precision wanted for the osl int * \param[in,out] i A osl int to change the precision */ void osl_int_set_precision(int const precision, int const new_precision, osl_int_p i) { if (i != NULL && precision != new_precision) { int v = osl_int_get_si(precision, *i); // TODO Fix to avoid overflow osl_int_clear(precision, i); osl_int_init_set_si(new_precision, i, v); } } cloog-0.18.4/osl/source/relation_list.c0000644000175000017500000006667712413270135014765 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** relation_list.c ** **-----------------------------------------------------------------** ** First version: 08/10/2010 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #include #include #include #include #include #include #include #include /*+*************************************************************************** * Structure display function * *****************************************************************************/ /** * osl_relation_list_idump function: * Displays a osl_relation_list_t structure (a list of relations) into a * file (file, possibly stdout). See osl_relation_print_structure for * more details. * \param file File where informations are printed. * \param l The list of relations whose information has to be printed. * \param level Number of spaces before printing, for each line. */ void osl_relation_list_idump(FILE * file, osl_relation_list_p l, int level) { int j, first = 1; // Go to the right level. for (j = 0; j < level; j++) fprintf(file,"|\t"); if (l != NULL) fprintf(file, "+-- osl_relation_list_t\n"); else fprintf(file, "+-- NULL relation list\n"); while (l != NULL) { if (!first) { // Go to the right level. for (j = 0; j < level; j++) fprintf(file, "|\t"); fprintf(file, "| osl_relation_list_t\n"); } else first = 0; // A blank line. for (j = 0; j <= level+1; j++) fprintf(file, "|\t"); fprintf(file, "\n"); // Print a relation. osl_relation_idump(file, l->elt, level+1); l = l->next; // Next line. if (l != NULL) { for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "V\n"); } } // The last line. for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "\n"); } /** * osl_relation_dump function: * This function prints the content of a osl_relation_list_t into * a file (file, possibly stdout). * \param file File where informations are printed. * \param list The relation whose information has to be printed. */ void osl_relation_list_dump(FILE * file, osl_relation_list_p list) { osl_relation_list_idump(file, list, 0); } /** * osl_relation_list_pprint_elts function: * This function pretty-prints the elements of a osl_relation_list_t structure * into a file (file, possibly stdout) in the OpenScop format. I.e., it prints * only the elements and not the number of elements. It prints an element of the * list only if it is not NULL. * \param file File where informations are printed. * \param list The relation list whose information has to be printed. * \param[in] names Array of constraint columns names. */ void osl_relation_list_pprint_elts(FILE * file, osl_relation_list_p list, osl_names_p names) { size_t i; osl_relation_list_p head = list; // Count the number of elements in the list with non-NULL content. i = osl_relation_list_count(list); // Print each element of the relation list. if (i > 0) { i = 0; while (head) { if (head->elt != NULL) { osl_relation_pprint(file, head->elt, names); if (head->next != NULL) fprintf(file, "\n"); i++; } head = head->next; } } else { fprintf(file, "# NULL relation list\n"); } } /** * osl_relation_list_pprint_access_array_scoplib function: * This function pretty-prints the elements of a osl_relation_list_t structure * into a file (file, possibly stdout) in the SCoPLib format. I.e., it prints * only the elements and not the number of elements. It prints an element of the * list only if it is not NULL. * \param file File where informations are printed. * \param list The relation list whose information has to be printed. * \param[in] names Array of constraint columns names. * \param[in] add_fakeiter True of False */ void osl_relation_list_pprint_access_array_scoplib(FILE * file, osl_relation_list_p list, osl_names_p names, int add_fakeiter) { size_t i; int nb_rows_read = 0, nb_columns_read = 0; int nb_rows_write = 0, nb_columns_write = 0; int nb_rows_may_write = 0, nb_columns_may_write = 0; osl_relation_list_p head ; // Count the number of elements in the list with non-NULL content. i = osl_relation_list_count(list); // Print each element of the relation list. if (i > 0) { // Read/Write arrays size head = list; while (head) { if (head->elt != NULL) { if (head->elt->type == OSL_TYPE_READ) { if (head->elt->nb_rows == 1) nb_rows_read++; else nb_rows_read += head->elt->nb_rows - 1; // remove the 'Arr' nb_columns_read = head->elt->nb_columns - head->elt->nb_output_dims; } else if (head->elt->type == OSL_TYPE_WRITE) { if (head->elt->nb_rows == 1) nb_rows_write++; else nb_rows_write += head->elt->nb_rows - 1; // remove the 'Arr' nb_columns_write = head->elt->nb_columns - head->elt->nb_output_dims; } else if (head->elt->type == OSL_TYPE_MAY_WRITE) { if (head->elt->nb_rows == 1) nb_rows_may_write++; else nb_rows_may_write += head->elt->nb_rows - 1; // remove the 'Arr' nb_columns_may_write = head->elt->nb_columns - head->elt->nb_output_dims; } } head = head->next; } if (add_fakeiter) { nb_columns_read++; nb_columns_write++; nb_columns_may_write++; } fprintf(file, "# Read access informations\n%d %d\n", nb_rows_read, nb_columns_read); head = list; while (head) { if (head->elt != NULL && head->elt->type == OSL_TYPE_READ) { osl_relation_pprint_scoplib(file, head->elt, names, 0, add_fakeiter); } head = head->next; } fprintf(file, "# Write access informations\n%d %d\n", nb_rows_write, nb_columns_write); head = list; while (head) { if (head->elt != NULL && head->elt->type == OSL_TYPE_WRITE) { osl_relation_pprint_scoplib(file, head->elt, names, 0, add_fakeiter); } head = head->next; } if (nb_rows_may_write > 0) { fprintf(file, "# May Write access informations\n%d %d\n", nb_rows_may_write, nb_columns_may_write); head = list; while (head) { if (head->elt != NULL && head->elt->type == OSL_TYPE_MAY_WRITE) { osl_relation_pprint_scoplib(file, head->elt, names, 0, add_fakeiter); } head = head->next; } } } else { fprintf(file, "# NULL relation list\n"); } } /** * osl_relation_list_pprint function: * This function pretty-prints the content of a osl_relation_list_t structure * into a file (file, possibly stdout) in the OpenScop format. It prints * an element of the list only if it is not NULL. * \param[in] file File where informations are printed. * \param[in] list The relation list whose information has to be printed. * \param[in] names Array of constraint columns names. */ void osl_relation_list_pprint(FILE * file, osl_relation_list_p list, osl_names_p names) { size_t i; // Count the number of elements in the list with non-NULL content. i = osl_relation_list_count(list); // Print it. if (i > 1) fprintf(file,"# List of %lu elements\n%lu\n", i, i); else fprintf(file,"# List of %lu element \n%lu\n", i, i); // Print each element of the relation list. osl_relation_list_pprint_elts(file, list, names); } /** * osl_relation_list_print function: * This function prints the content of a osl_relation_list_t structure * into a file (file, possibly stdout) in the OpenScop format. It prints * an element of the list only if it is not NULL. * \param file File where informations are printed. * \param list The relation list whose information has to be printed. */ void osl_relation_list_print(FILE * file, osl_relation_list_p list) { osl_relation_list_pprint(file, list, NULL); } /***************************************************************************** * Reading function * *****************************************************************************/ /** * osl_relation_list_pread function ("precision read"): * this function reads a list of relations into a file (foo, * posibly stdin) and returns a pointer this relation list. * \param[in] file The input stream. * \param[in] precision The precision of the relation elements. * \return A pointer to the relation list structure that has been read. */ osl_relation_list_p osl_relation_list_pread(FILE * file, int precision) { int i; osl_relation_list_p list; osl_relation_list_p res; int nb_mat; // Read the number of relations to read. nb_mat = osl_util_read_int(file, NULL); if (nb_mat < 0) OSL_error("negative number of relations"); // Allocate the header of the list and start reading each element. res = list = osl_relation_list_malloc(); for (i = 0; i < nb_mat; ++i) { list->elt = osl_relation_pread(file, precision); if (i < nb_mat - 1) list->next = osl_relation_list_malloc(); list = list->next; } return res; } /** * osl_relation_list_read function: * this function is equivalent to osl_relation_list_pread() except that * the precision corresponds to the precision environment variable or * to the highest available precision if it is not defined. * \see{osl_relation_list_pread} */ osl_relation_list_p osl_relation_list_read(FILE * foo) { int precision = osl_util_get_precision(); return osl_relation_list_pread(foo, precision); } /*+*************************************************************************** * Memory allocation/deallocation function * *****************************************************************************/ /** * osl_relation_list_malloc function: * This function allocates the memory space for a osl_relation_list_t * structure and sets its fields with default values. Then it returns * a pointer to the allocated space. * \return A pointer to an empty relation list with fields set to default * values. */ osl_relation_list_p osl_relation_list_malloc() { osl_relation_list_p res; OSL_malloc(res, osl_relation_list_p, sizeof(osl_relation_list_t)); res->elt = NULL; res->next = NULL; return res; } /** * osl_relation_list_free function: * This function frees the allocated memory for a osl_relation_list_t * structure, and all the relations stored in the list. * \param list The pointer to the relation list we want to free. */ void osl_relation_list_free(osl_relation_list_p list) { osl_relation_list_p tmp; if (list == NULL) return; while (list != NULL) { if (list->elt != NULL) osl_relation_free(list->elt); tmp = list->next; free(list); list = tmp; } } /*+*************************************************************************** * Processing functions * *****************************************************************************/ /** * osl_relation_list_node function: * This function builds an osl_relation_list_t node and sets its * relation element as a copy of the one provided as parameter. * If the relation provided as an argument is NULL, NULL is returned. * \param r The pointer to the relation to copy/paste in a list node. * \return A pointer to a relation list node containing a copy of "relation". */ osl_relation_list_p osl_relation_list_node(osl_relation_p r) { osl_relation_list_p new = NULL; if (r != NULL) { new = osl_relation_list_malloc(); new->elt = osl_relation_clone(r); } return new; } /** * osl_relation_list_clone function: * This functions builds and returns a quasi-"hard copy" (not a pointer copy) * of a osl_relation_list_t data structure provided as parameter. * \param list The pointer to the relation list we want to copy. * \return A pointer to the full copy of the relation list in parameter. */ osl_relation_list_p osl_relation_list_clone(osl_relation_list_p list) { osl_relation_list_p clone = NULL, node, previous = NULL; int first = 1; while (list != NULL) { node = osl_relation_list_malloc(); node->elt = osl_relation_clone(list->elt); if (first) { first = 0; clone = node; previous = node; } else { previous->next = node; previous = previous->next; } list = list->next; } return clone; } /** * osl_relation_list_concat function: * this function builds a new relation list as the concatenation of the * two lists sent as parameters. * \param l1 The first relation list. * \param l2 The second relation list. * \return A pointer to the relation list resulting from the concatenation of * l1 and l2. */ osl_relation_list_p osl_relation_list_concat(osl_relation_list_p l1, osl_relation_list_p l2) { osl_relation_list_p new, end; if (l1 == NULL) return osl_relation_list_clone(l2); if (l2 == NULL) return osl_relation_list_clone(l1); new = osl_relation_list_clone(l1); end = new; while (end->next != NULL) end = end->next; end->next = osl_relation_list_clone(l2); return new; } /** * osl_relation_list_add function: * this function adds a relation list at the end of the relation list * pointed by l1. No new list is created: this functions links the two * input lists. If the first relation list is NULL, it is set to the * second relation list. * \param[in,out] l1 Pointer to the first relation list. * \param[in] l2 The second relation list. */ void osl_relation_list_add(osl_relation_list_p *l1, osl_relation_list_p l2) { while (*l1 != NULL) l1 = &((*l1)->next); *l1 = l2; } /** * osl_relation_list_push function: * this function sees a list of relations as a stack of relations and * performs the push operation onto this stack. * \param[in,out] head Pointer to the head of the relation stack. * \param[in,out] node Relation node to add to the stack. Its next field is * updated to the previous head of the stack. */ void osl_relation_list_push(osl_relation_list_p *head, osl_relation_list_p node) { if (node != NULL) { node->next = *head; *head = node; } } /** * osl_relation_list_pop function: * this function sees a list of relations as a stack of relations and * performs the pop operation onto this stack. * \param[in,out] head Pointer to the head of the relation stack. It is * updated to the previous element in the stack (NULL * if there is none). * \return The top element of the stack (detached from the list). */ osl_relation_list_p osl_relation_list_pop(osl_relation_list_p *head) { osl_relation_list_p top = NULL; if (*head != NULL) { top = *head; *head = (*head)->next; top->next = NULL; } return top; } /** * osl_relation_list_dup function: * this function sees a list of relations as a stack of relations and * performs the dup operation (duplicate the top element) onto * this stack. * \param[in,out] head Pointer to the head of the relation stack. It is * updated to the new element after duplication. */ void osl_relation_list_dup(osl_relation_list_p *head) { osl_relation_list_p top = osl_relation_list_pop(head); osl_relation_list_push(head, osl_relation_list_clone(top)); osl_relation_list_push(head, top); } /** * osl_relation_list_drop function: * this function sees a list of relations as a stack of relations and * performs the drop operation (pop and destroy popped element) onto * this stack. * \param[in,out] head Pointer to the head of the relation stack. It is * updated to the previous element in the stack (NULL * if there is none). */ void osl_relation_list_drop(osl_relation_list_p *head) { osl_relation_list_p top = osl_relation_list_pop(head); osl_relation_list_free(top); } /** * osl_relation_list_destroy function: * this function sees a list of relations as a stack of relations and * performs the destroy operation onto this stack, i.e., it completely * free it. * \param[in,out] head Pointer to the head of the relation stack. * Updated to NULL. */ void osl_relation_list_destroy(osl_relation_list_p *head) { while (*head != NULL) osl_relation_list_drop(head); } /** * osl_relation_list_equal function: * This function returns true if the two relation lists are the same, false * otherwise.. * \param l1 The first relation list. * \param l2 The second relation list. * \return 1 if l1 and l2 are the same (content-wise), 0 otherwise. */ int osl_relation_list_equal(osl_relation_list_p l1, osl_relation_list_p l2) { while ((l1 != NULL) && (l2 != NULL)) { if (l1 == l2) return 1; if (!osl_relation_equal(l1->elt, l2->elt)) return 0; l1 = l1->next; l2 = l2->next; } if (((l1 == NULL) && (l2 != NULL)) || ((l1 != NULL) && (l2 == NULL))) return 0; return 1; } /** * osl_relation_integrity_check function: * This function checks that a list of relation is "well formed" according to * some expected properties (setting an expected value to OSL_UNDEFINED * means that we do not expect a specific value) and what the relations are * supposed to represent (all relations of a list are supposed to have the * same semantics). It returns 0 if the check failed or 1 if no problem has * been detected. * \param list The relation list we want to check. * \param type Semantics about this relation (domain, access...). * \param expected_nb_output_dims Expected number of output dimensions. * \param expected_nb_input_dims Expected number of input dimensions. * \param expected_nb_parameters Expected number of parameters. * \return 0 if the integrity check fails, 1 otherwise. */ int osl_relation_list_integrity_check(osl_relation_list_p list, int type, int expected_nb_output_dims, int expected_nb_input_dims, int expected_nb_parameters) { while (list != NULL) { // Check the access function. if (!osl_relation_integrity_check(list->elt, type, expected_nb_output_dims, expected_nb_input_dims, expected_nb_parameters)) { return 0; } list = list->next; } return 1; } /** * osl_relation_list_set_type function: * this function sets the type of each relation in the relation list to the * one provided as parameter. * \param list The list of relations to set the type. * \param type The type. */ void osl_relation_list_set_type(osl_relation_list_p list, int type) { while (list != NULL) { if (list->elt != NULL) { list->elt->type = type; } list = list->next; } } /** * osl_relation_list_filter function: * this function returns a copy of the input relation list, restricted to * the relations of a given type. The special type OSL_TYPE_ACCESS * filters any kind of access (read, write, rdwr etc.). * \param list The relation list to copy/filter. * \param type The filtering type. * \return A copy of the input list with only relation of the given type. */ osl_relation_list_p osl_relation_list_filter(osl_relation_list_p list, int type) { osl_relation_list_p copy = osl_relation_list_clone(list); osl_relation_list_p filtered = NULL; osl_relation_list_p previous = NULL; osl_relation_list_p trash; int first = 1; while (copy != NULL) { if ((copy->elt != NULL) && (((type == OSL_TYPE_ACCESS) && (osl_relation_is_access(copy->elt))) || ((type != OSL_TYPE_ACCESS) && (type == copy->elt->type)))) { if (first) { filtered = copy; first = 0; } previous = copy; copy = copy->next; } else { trash = copy; if (!first) previous->next = copy->next; copy = copy->next; trash->next = NULL; osl_relation_list_free(trash); } } return filtered; } /** * osl_relation_list_count function: * this function returns the number of elements with non-NULL content * in a relation list. * \param list The relation list to count the number of elements. * \return The number of nodes with non-NULL content in the relation list. */ size_t osl_relation_list_count(osl_relation_list_p list) { size_t i = 0; while (list != NULL) { if (list->elt != NULL) i++; list = list->next; } return i; } /** * osl_relation_list_get_attributes function: * this function returns, through its parameters, the maximum values of the * relation attributes (nb_iterators, nb_parameters etc) in the relation list, * depending on its type. HOWEVER, it updates the parameter value iff the * attribute is greater than the input parameter value. Hence it may be used * to get the attributes as well as to find the maximum attributes for several * relation lists. The array identifier 0 is used when there is no array * identifier (AND this is OK), OSL_UNDEFINED is used to report it is * impossible to provide the property while it should. This function is not * intended for checking, the input relation list should be correct. * \param[in] list The relation list to extract attribute values. * \param[in,out] nb_parameters Number of parameter attribute. * \param[in,out] nb_iterators Number of iterators attribute. * \param[in,out] nb_scattdims Number of scattering dimensions attribute. * \param[in,out] nb_localdims Number of local dimensions attribute. * \param[in,out] array_id Maximum array identifier attribute. */ void osl_relation_list_get_attributes(osl_relation_list_p list, int * nb_parameters, int * nb_iterators, int * nb_scattdims, int * nb_localdims, int * array_id) { int local_nb_parameters = OSL_UNDEFINED; int local_nb_iterators = OSL_UNDEFINED; int local_nb_scattdims = OSL_UNDEFINED; int local_nb_localdims = OSL_UNDEFINED; int local_array_id = OSL_UNDEFINED; while (list != NULL) { osl_relation_get_attributes(list->elt, &local_nb_parameters, &local_nb_iterators, &local_nb_scattdims, &local_nb_localdims, &local_array_id); // Update. *nb_parameters = OSL_max(*nb_parameters, local_nb_parameters); *nb_iterators = OSL_max(*nb_iterators, local_nb_iterators); *nb_scattdims = OSL_max(*nb_scattdims, local_nb_scattdims); *nb_localdims = OSL_max(*nb_localdims, local_nb_localdims); *array_id = OSL_max(*array_id, local_array_id); list = list->next; } } cloog-0.18.4/osl/source/util.c0000644000175000017500000006356012413270135013056 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** util.c ** **-----------------------------------------------------------------** ** First version: 08/10/2010 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ #include #include #include #include #include #include /*+*************************************************************************** * Utility functions * *****************************************************************************/ /** * osl_util_skip_blank_and_comments "file skip" function: * this function reads the open file 'file' line by line and skips * blank/comment lines and spaces. The first line where there is some * useful information is stored at the address 'str' (the memory to * store the line must be allocated before the call to this function * and must be at least OSL_MAX_STRING * sizeof(char)). The pointer * to the first useful information in this line is returned by the * function. * \param[in] file The (opened) file to read. * \param[in] str Address of an allocated space to store the first line * that contains useful information. * \return The address of the first useful digit in str. */ char * osl_util_skip_blank_and_comments(FILE * file, char * str) { char * start; do { start = fgets(str, OSL_MAX_STRING, file); while ((start != NULL) && isspace(*start) && (*start != '\n')) start++; } while (start != NULL && (*start == '#' || *start == '\n')); return start; } /** * osl_util_sskip_blank_and_comments "string skip" function: * this function updates the str pointer, which initialy points to a string, * to the first character in this string which is not a space or a comment * (comments start at '#' and end at '\n'), or to the end of string. * \param[in,out] str Address of a string, updated to the address of * the first non-space or comment character. */ void osl_util_sskip_blank_and_comments(char ** str) { do { // Skip spaces/blanc lines. while (*str && **str && isspace(**str)) (*str)++; // Skip the comment if any. if (*str && **str && **str == '#') { while (**str && **str != '\n') { (*str)++; } } } while (*str && **str && **str == '\n'); } /** * osl_util_read_int function: * reads an int on the input 'file' or the input string 'str' depending on * which one is not NULL (exactly one of them must not be NULL). * \param[in] file The file where to read an int (if not NULL). * \param[in,out] str The string where to read an int (if not NULL). This * pointer is updated to reflect the read and points * after the int in the input string. * \return The int that has been read. */ int osl_util_read_int(FILE * file, char ** str) { char s[OSL_MAX_STRING], * start; int res; int i = 0; if ((file != NULL && str != NULL) || (file == NULL && str == NULL)) OSL_error("one and only one of the two parameters can be non-NULL"); if (file != NULL) { // Parse from a file. start = osl_util_skip_blank_and_comments(file, s); if (sscanf(start, " %d", &res) != 1) OSL_error("an int was expected"); } else { // Parse from a string. // Skip blank/commented lines. osl_util_sskip_blank_and_comments(str); // Build the chain to analyze. while (**str && !isspace(**str) && **str != '\n' && **str != '#') s[i++] = *((*str)++); s[i] = '\0'; if (sscanf(s, "%d", &res) != 1) OSL_error("an int was expected"); } return res; } /** * osl_util_read_string function: * reads a string on the input 'file' or the input string 'str' depending on * which one is not NULL (exactly one of them must not be NULL). * \param[in] file The file where to read a string (if not NULL). * \param[in,out] str The string where to read a string (if not NULL). This * pointer is updated to reflect the read and points * after the string in the input string. * \return The string that has been read. */ char * osl_util_read_string(FILE * file, char ** str) { char s[OSL_MAX_STRING], * start; char * res; int i = 0; if ((file != NULL && str != NULL) || (file == NULL && str == NULL)) OSL_error("one and only one of the two parameters can be non-NULL"); OSL_malloc(res, char *, OSL_MAX_STRING * sizeof(char)); if (file != NULL) { // Parse from a file. start = osl_util_skip_blank_and_comments(file, s); if (sscanf(start, " %s", res) != 1) OSL_error("a string was expected"); } else { // Parse from a string. // Skip blank/commented lines. osl_util_sskip_blank_and_comments(str); // Build the chain to analyze. while (**str && !isspace(**str) && **str != '\n' && **str != '#') s[i++] = *((*str)++); s[i] = '\0'; if (sscanf(s, "%s", res) != 1) OSL_error("a string was expected"); } OSL_realloc(res, char *, strlen(res) + 1); return res; } /** * osl_util_read_line function: * reads a line on the input 'file' or the input string 'str' depending on * which one is not NULL (exactly one of them must not be NULL). A line * is defined as the array of characters before the comment tag or the end of * line (it may include spaces). * \param[in] file The file where to read a line (if not NULL). * \param[in,out] str The string where to read a line (if not NULL). This * pointer is updated to reflect the read and points * after the line in the input string. * \return The line that has been read. */ char * osl_util_read_line(FILE * file, char ** str) { char s[OSL_MAX_STRING], * start; char * res; int i = 0; if ((file != NULL && str != NULL) || (file == NULL && str == NULL)) OSL_error("one and only one of the two parameters can be non-NULL"); OSL_malloc(res, char *, OSL_MAX_STRING * sizeof(char)); if (file != NULL) { // Parse from a file. start = osl_util_skip_blank_and_comments(file, s); while (*start && *start != '\n' && *start != '#' && i < OSL_MAX_STRING) res[i++] = *start++; } else { // Parse from a string. osl_util_sskip_blank_and_comments(str); while (**str && **str != '\n' && **str != '#' && i < OSL_MAX_STRING) res[i++] = *((*str)++); } res[i] = '\0'; OSL_realloc(res, char *, strlen(res) + 1); return res; } /** * osl_util_read_int internal function: * reads a tag (the form of a tag with name "name" is \) on the input * 'file' or the input string 'str' depending on which one is not NULL (exactly * one of them must not be NULL). It returns the name of the tag (thus without * the < and > as a string. Note that in the case of an ending tag, e.g., * \, the slash is returned as a part of the name, e.g., /foo. If no * tag is found the function returns NULL. * \param[in] file The file where to read a tag (if not NULL). * \param[in,out] str The string where to read a tag (if not NULL). This * pointer is updated to reflect the read and points * after the tag in the input string. * \return The tag name that has been read. */ char * osl_util_read_tag(FILE * file, char ** str) { char s[OSL_MAX_STRING], * start; char * res; int i = 0; if ((file != NULL && str != NULL) || (file == NULL && str == NULL)) OSL_error("one and only one of the two parameters can be non-NULL"); // Skip blank/commented lines. if (file != NULL) { start = osl_util_skip_blank_and_comments(file, s); str = &start; } else { osl_util_sskip_blank_and_comments(str); } // If the end of the input has been reached, return NULL. if (((file != NULL) && (feof(file))) || ((str != NULL) && (**str == '\0'))) return NULL; // Pass the starting '<'. if (**str != '<') OSL_error("a \"<\" to start a tag was expected"); (*str)++; // Read the tag. OSL_malloc(res, char *, (OSL_MAX_STRING + 1) * sizeof(char)); res[OSL_MAX_STRING] = '\0'; while (**str && **str != '>') { if (((**str >= 'A') && (**str <= 'Z')) || ((**str >= 'a') && (**str <= 'z')) || ((**str == '/') && (i == 0)) || (**str == '_')) { res[i++] = *((*str)++); res[i] = '\0'; } else { OSL_error("illegal character in the tag name"); } } // Check we actually end up with a '>' and pass it. if (**str != '>') OSL_error("a \">\" to end a tag was expected"); (*str)++; return res; } /** * osl_util_read_uptoflag function: * this function reads a string up to a given flag (the flag is read) * on the input 'file' or the input string 'str' depending on which one is * not NULL (exactly one of them must not be NULL) and returns that string * without the flag. It returns NULL if the flag is not found. * \param[in] file The file where to read up to flag (if not NULL). * \param[in,out] str The string where to read up to flag (if not NULL). This * pointer is updated to reflect the read and points * after the flag in the input string. * \param[in] flag The flag which, when reached, stops the reading. * \return The string that has been read. */ char * osl_util_read_uptoflag(FILE * file, char ** str, char * flag) { int high_water_mark = OSL_MAX_STRING; int nb_chars = 0; int lenflag = strlen(flag), lenstr; int flag_found = 0; char * res; if ((file != NULL && str != NULL) || (file == NULL && str == NULL)) OSL_error("one and only one of the two parameters can be non-NULL"); OSL_malloc(res, char *, high_water_mark * sizeof(char)); // Copy everything to the res string. if (str != NULL) lenstr = strlen(*str); while (((str != NULL) && (nb_chars != lenstr)) || ((file != NULL) && (!feof(file)))) { res[nb_chars++] = (str != NULL) ? *((*str)++) : fgetc(file); if ((nb_chars >= lenflag) && (!strncmp(&res[nb_chars - lenflag], flag, lenflag))) { flag_found = 1; break; } if (nb_chars >= high_water_mark) { high_water_mark += high_water_mark; OSL_realloc(res, char *, high_water_mark * sizeof(char)); } } if (!flag_found) { OSL_debug("flag was not found, end of input reached"); free(res); return NULL; } // - 0-terminate the string. OSL_realloc(res, char *, (nb_chars - strlen(flag) + 1) * sizeof(char)); res[nb_chars - strlen(flag)] = '\0'; return res; } /** * osl_util_read_uptotag function: * this function reads a string up to a given (start) tag (the tag is read) * on the input 'file' or the input string 'str' depending on which one is * not NULL (exactly one of them must not be NULL) and returns that string * without the tag. It returns NULL if the tag is not found. * \param[in] file The file where to read up to tag (if not NULL). * \param[in,out] str The string where to read up to tag (if not NULL). * This pointer is updated to reflect the read and points * after the tag in the input string. * \param[in] name The name of the tag to the file reading. * \return The string that has been read from the file. */ char * osl_util_read_uptotag(FILE * file, char ** str, char * name) { char tag[strlen(name) + 3]; sprintf(tag, "<%s>", name); return osl_util_read_uptoflag(file, str, tag); } /** * osl_util_read_uptoendtag function: * this function reads a string up to a given end tag (the end tag is read) * on the input 'file' or the input string 'str' depending on which one is * not NULL (exactly one of them must not be NULL) and returns that string * without the end tag. It returns NULL if the end tag is not found. * \param[in] file The file where to read up to end tag (if not NULL). * \param[in,out] str The string where to read up to end tag (if not NULL). * This pointer is updated to reflect the read and points * after the end tag in the input string. * \param[in] name The name of the end tag to the file reading. * \return The string that has been read from the file. */ char * osl_util_read_uptoendtag(FILE * file, char ** str, char * name) { char endtag[strlen(name) + 4]; sprintf(endtag, "", name); return osl_util_read_uptoflag(file, str, endtag); } /** * osl_util_tag_content function: * this function returns a freshly allocated string containing the * content, in the given string 'str', between the tag '\' and * the tag '\'. If the tag '\' is not found, it returns NULL. * \param[in] str The string where to find a given content. * \param[in] name The name of the tag we are looking for. * \return The string between '\' and '\' in 'str'. */ char * osl_util_tag_content(char * str, char * name) { int i; char * start; char * stop; char tag[strlen(name) + 3]; char endtag[strlen(name) + 4]; int size = 0; size_t lentag; char * res = NULL; sprintf(tag, "<%s>", name); sprintf(endtag, "", name); if (str) { start = str; lentag = strlen(tag); for (; start && *start && strncmp(start, tag, lentag); ++start) continue; // The tag 'tag' was not found. if (! *start) return NULL; start += lentag; stop = start; lentag = strlen(endtag); for (size = 0; *stop && strncmp(stop, endtag, lentag); ++stop, ++size) continue; // the tag 'endtag' was not found. if (! *stop) return NULL; OSL_malloc(res, char *, (size + 1) * sizeof(char)); // Copy the chain between the two tags. for (++start, i = 0; start != stop; ++start, ++i) res[i] = *start; res[i] = '\0'; } return res; } /** * osl_util_safe_strcat function: * this function concatenates the string src to the string *dst * and reallocates *dst if necessary. The current size of the * *dst buffer must be *hwm (high water mark), if there is some * reallocation, this value is updated. * \param[in,out] dst pointer to the destination string (may be reallocated). * \param[in] src string to concatenate to dst. * \param[in,out] hwm pointer to the size of the *dst buffer (may be updated). */ void osl_util_safe_strcat(char ** dst, char * src, int * hwm) { while ((int)(strlen(*dst) + strlen(src)) >= *hwm) { *hwm += OSL_MAX_STRING; OSL_realloc(*dst, char *, *hwm * sizeof(char)); } strcat(*dst, src); } /** * \brief String duplicate * * osl_util_strdup function: * this function return a copy of the string str. * * \param[in] str string to be copied. * * \return a copy of the string */ char * osl_util_strdup(char const * str) { char * dup = NULL; OSL_malloc(dup, char *, (strlen(str) + 1) * sizeof(char)); if (dup) { strcpy(dup, str); } return dup; } /** * osl_util_get_precision function: * this function returns the precision defined by the precision environment * variable or the highest available precision if it is not defined. * \return environment precision if defined or highest available precision. */ int osl_util_get_precision() { int precision = OSL_PRECISION_DP; char * precision_env; #ifdef OSL_GMP_IS_HERE precision = OSL_PRECISION_MP; #endif precision_env = getenv(OSL_PRECISION_ENV); if (precision_env != NULL) { if (!strcmp(precision_env, OSL_PRECISION_ENV_SP)) precision = OSL_PRECISION_SP; else if (!strcmp(precision_env, OSL_PRECISION_ENV_DP)) precision = OSL_PRECISION_DP; else if (!strcmp(precision_env, OSL_PRECISION_ENV_MP)) { #ifndef OSL_GMP_IS_HERE OSL_warning("$OSL_PRECISION says GMP but osl not compiled with " "GMP support, switching to double precision"); precision = OSL_PRECISION_DP; #else precision = OSL_PRECISION_MP; #endif } else OSL_warning("bad OSL_PRECISION environment value, see osl's manual"); } return precision; } /** * osl_util_print_provided function: * this function prints a "provided" boolean in a file (file, possibly stdout), * with a comment title according to the OpenScop specification. * \param[in] file File where the information has to be printed. * \param[in] provided The provided boolean to print. * \param[in] title A string to use as a title for the provided booblean. */ void osl_util_print_provided(FILE * file, int provided, char * title) { if (provided) { fprintf(file, "# %s provided\n", title); fprintf(file, "1\n"); } else { fprintf(file, "# %s not provided\n", title); fprintf(file, "0\n\n"); } } /** * osl_util_identifier_is_here function: * this function returns 1 if the input "identifier" is found at the * "index" position in the "expression" input string, 0 otherwise. * \param[in] expression The input expression. * \param[in] identifier The identifier to look for. * \param[in] index The position in the expression where to look. * \return 1 if the identifier is found at the position in the expression. */ static int osl_util_identifier_is_here(char * expression, char * identifier, int index) { // If there is no space enough to find the identifier: no. if (strlen(identifier) + index > strlen(expression)) return 0; // If there is a character before and it is in [A-Za-z0-9]: no. if ((index > 0) && (((expression[index - 1] >= 'A') && (expression[index - 1] <= 'Z')) || ((expression[index - 1] >= 'a') && (expression[index - 1] <= 'z')) || ((expression[index - 1] >= '0') && (expression[index - 1] <= '9')))) return 0; // If there is a character after and it is in [A-Za-z0-9]: no. if ((strlen(identifier) + index < strlen(expression)) && (((expression[strlen(identifier) + index] >= 'A') && (expression[strlen(identifier) + index] <= 'Z')) || ((expression[strlen(identifier) + index] >= 'a') && (expression[strlen(identifier) + index] <= 'z')) || ((expression[strlen(identifier) + index] >= '0') && (expression[strlen(identifier) + index] <= '9')))) return 0; // If the identifier string is not here: no. if (strncmp(expression + index, identifier, strlen(identifier))) return 0; return 1; } /** * osl_util_lazy_isolated_identifier function: * this function returns 1 if the identifier at the "index" position in the * "expression" is guaranteed not to need parenthesis around is we * substitute it with anything. For instance the identifier "i" can be * always substituted in "A[i]" with no need of parenthesis but not in * "A[2*i]". This function is lazy in the sense that it just check obvious * cases, not all of them. The identifier must already be at the indicated * position, this function does not check that. * \param[in] expression The input expression. * \param[in] identifier The identifier to check. * \param[in] index The position of the identifier in the expression. * \return 1 if the identifier is isolated, 0 if unsure. */ static int osl_util_lazy_isolated_identifier(char * expression, char * identifier, int index) { int look; // If the first non-space character before is not in [\[(,\+=]: no. look = index - 1; while (look >= 0) { if (isspace(expression[look])) look--; else break; } if ((look >= 0) && (expression[look] != '[') && (expression[look] != '(') && (expression[look] != '+') && (expression[look] != '=') && (expression[look] != ',')) return 0; // If the first non-space character after is not in [\]),;\+]: no. look = index + strlen(identifier); while (look < (int)strlen(expression)) { if (isspace(expression[look])) look++; else break; } if ((look < (int)strlen(expression)) && (expression[look] != ']') && (expression[look] != ')') && (expression[look] != '+') && (expression[look] != ',') && (expression[look] != ';')) return 0; return 1; } /** * osl_util_identifier_substitution function: * this function replaces some identifiers in an input expression string and * returns the final string. The list of identifiers to replace are provided * as an array of strings. They are replaced from the input string with the * new substring "@i@" or "(@i@)" where i is the rank of the identifier in the * array of identifiers. The parentheses are added when it is not obvious that * the identifier can be replaced with an arbitrary expression without the * need of parentheses. For instance, let us consider the input expression * "C[i+j]+=A[2*i]*B[j];" and the array of strings {"i", "j"}: the resulting * string would be "C[@0@+@1@]+=A[2*(@0@)]*B[@1@];". * \param[in] expression The original expression. * \param[in] identifiers NULL-terminated array of identifiers. * \return A new string where the ith identifier is replaced by \@i\@. */ char * osl_util_identifier_substitution(char * expression, char ** identifiers) { size_t index; int j, found; int high_water_mark = OSL_MAX_STRING; char buffer[OSL_MAX_STRING]; char * string; OSL_malloc(string, char *, high_water_mark * sizeof(char)); string[0] = '\0'; index = 0; while (index < strlen(expression)) { j = 0; found = 0; while (identifiers[j] != NULL) { if (osl_util_identifier_is_here(expression, identifiers[j], index)) { if (osl_util_lazy_isolated_identifier(expression,identifiers[j],index)) sprintf(buffer, "@%d@", j); else sprintf(buffer, "(@%d@)", j); osl_util_safe_strcat(&string, buffer, &high_water_mark); index += strlen(identifiers[j]); found = 1; break; } j++; } if (!found) { sprintf(buffer, "%c", expression[index]); osl_util_safe_strcat(&string, buffer, &high_water_mark); index++; } } return string; } cloog-0.18.4/osl/source/body.c0000644000175000017500000003456712413270135013043 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** body.c ** **-----------------------------------------------------------------** ** First version: 25/06/2011 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ # include # include # include # include # include # include # include # include # include /*+*************************************************************************** * Structure display functions * *****************************************************************************/ /** * osl_body_idump function: * this function displays an osl_body_t structure (*body) into a * file (file, possibly stdout) in a way that trends to be understandable. * It includes an indentation level (level) in order to work with others * dumping functions. * \param[in] file File where informations are printed. * \param[in] body The body whose information has to be printed. * \param[in] level Number of spaces before printing, for each line. */ void osl_body_idump(FILE * file, osl_body_p body, int level) { int j; // Go to the right level. for (j = 0; j < level; j++) fprintf(file, "|\t"); if (body != NULL) { fprintf(file, "+-- osl_body_t\n"); // A blank line. for (j = 0; j <= level+1; j++) fprintf(file, "|\t"); fprintf(file, "\n"); // Print the iterators osl_strings_idump(file, body->iterators, level + 1); // Print the original body expression. osl_strings_idump(file, body->expression, level + 1); } else { fprintf(file, "+-- NULL body\n"); } // The last line. for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "\n"); } /** * osl_body_dump function: * this function prints the content of an osl_body_t structure * (*body) into a file (file, possibly stdout). * \param[in] file File where informations are printed. * \param[in] body The body whose information has to be printed. */ void osl_body_dump(FILE * file, osl_body_p body) { osl_body_idump(file, body, 0); } /** * osl_body_print function: * this function prints the content of an osl_body_t structure * (*body) into a file (file, possibly stdout) in the OpenScop format. * \param[in] file File where informations are printed. * \param[in] body The body whose information has to be printed. */ void osl_body_print(FILE * file, osl_body_p body) { int nb_iterators; if (body != NULL) { nb_iterators = osl_strings_size(body->iterators); fprintf(file, "# Number of original iterators\n"); fprintf(file, "%d\n", nb_iterators); if (nb_iterators > 0) { fprintf(file, "\n# List of original iterators\n"); osl_strings_print(file, body->iterators); } fprintf(file, "\n# Statement body expression\n"); osl_strings_print(file, body->expression); } else { fprintf(file, "# NULL statement body\n"); } } /** * osl_body_print_scoplib function: * this function prints the content of an osl_body_t structure * (*body) into a file (file, possibly stdout) in the SCoPLib format. * \param[in] file File where informations are printed. * \param[in] body The body whose information has to be printed. */ void osl_body_print_scoplib(FILE * file, osl_body_p body) { int nb_iterators; if (body != NULL) { nb_iterators = osl_strings_size(body->iterators); if (nb_iterators > 0) { fprintf(file, "# List of original iterators\n"); osl_strings_print(file, body->iterators); } else { fprintf(file, "fakeiter\n"); } fprintf(file, "# Statement body expression\n"); osl_strings_print(file, body->expression); } else { fprintf(file, "# NULL statement body\n"); } } /** * osl_body_sprint function: * this function prints the content of an osl_body_t structure * (*body) into a string (returned) in the OpenScop textual format. * \param[in] body The body structure which has to be printed. * \return A string containing the OpenScop dump of the body structure. */ char * osl_body_sprint(osl_body_p body) { int nb_iterators; int high_water_mark = OSL_MAX_STRING; char * string = NULL; char buffer[OSL_MAX_STRING]; char * iterators, * expression; OSL_malloc(string, char *, high_water_mark * sizeof(char)); string[0] = '\0'; if (body != NULL) { nb_iterators = osl_strings_size(body->iterators); sprintf(buffer, "# Number of original iterators\n%d\n", nb_iterators); osl_util_safe_strcat(&string, buffer, &high_water_mark); if (nb_iterators > 0) { sprintf(buffer, "# List of original iterators\n"); osl_util_safe_strcat(&string, buffer, &high_water_mark); iterators = osl_strings_sprint(body->iterators); osl_util_safe_strcat(&string, iterators, &high_water_mark); free(iterators); } sprintf(buffer, "# Statement body expression\n"); osl_util_safe_strcat(&string, buffer, &high_water_mark); expression = osl_strings_sprint(body->expression); osl_util_safe_strcat(&string, expression, &high_water_mark); free(expression); } else { sprintf(buffer, "# NULL body\n"); osl_util_safe_strcat(&string, buffer, &high_water_mark); } return string; } /***************************************************************************** * Reading function * *****************************************************************************/ /** * osl_body_read function: * this function reads a body structure from a string complying to the * OpenScop textual format and returns a pointer to this body structure. * The input string should only contain the body this function * has to read (comments at the end of the line are accepted). The input * parameter is updated to the position in the input string this function * reach right after reading the strings structure. * \param[in,out] input The input string where to find a body structure. * Updated to the position after what has been read. * \return A pointer to the body structure that has been read. */ osl_body_p osl_body_sread(char ** input) { osl_body_p body = NULL; char * expression; int nb_iterators; if (input) { body = osl_body_malloc(); // Read the number of iterators. nb_iterators = osl_util_read_int(NULL, input); // Read the iterator strings if any. if (nb_iterators > 0) { body->iterators = osl_strings_sread(input); } else { body->iterators = osl_strings_malloc(); } // Read the body: expression = osl_util_read_line(NULL, input); // Insert the body. body->expression = osl_strings_encapsulate(expression); } return body; } /*+*************************************************************************** * Memory allocation/deallocation functions * *****************************************************************************/ /** * osl_body_malloc function: * this function allocates the memory space for an osl_body_t * structure and sets its fields with default values. Then it returns a pointer * to the allocated space. * \return A pointer to an empty body with fields set to default values. */ osl_body_p osl_body_malloc() { osl_body_p body; OSL_malloc(body, osl_body_p, sizeof(osl_body_t)); body->iterators = NULL; body->expression = NULL; return body; } /** * osl_body_free function: * this function frees the allocated memory for an osl_body_t * structure. * \param[in,out] body The pointer to the body we want to free. */ void osl_body_free(osl_body_p body) { if (body != NULL) { osl_strings_free(body->iterators); osl_strings_free(body->expression); free(body); } } /*+*************************************************************************** * Processing functions * *****************************************************************************/ /** * osl_body_clone function: * this functions builds and returns a "hard copy" (not a pointer copy) of an * osl_body_t data structure provided as parameter. However, let us * recall here that non-string elements are untouched by the OpenScop Library. * \param[in] body The pointer to the body we want to copy. * \return A pointer to the full copy of the body provided as parameter. */ osl_body_p osl_body_clone(osl_body_p body) { osl_body_p copy = NULL; if (body != NULL) { copy = osl_body_malloc(); copy->iterators = osl_strings_clone(body->iterators); copy->expression = osl_strings_clone(body->expression); } return copy; } /** * osl_body_equal function: * this function returns true if the two bodies are the same, false * otherwise (the usr field is not tested). However, let us * recall here that non-string elements are untouched by the OpenScop Library. * \param[in] b1 The first body. * \param[in] b2 The second body. * \return 1 if b1 and b2 are the same (content-wise), 0 otherwise. */ int osl_body_equal(osl_body_p b1, osl_body_p b2) { if (b1 == b2) return 1; if (((b1 != NULL) && (b2 == NULL)) || ((b1 == NULL) && (b2 != NULL))) { OSL_info("bodies are not the same"); return 0; } if (!osl_strings_equal(b1->iterators, b2->iterators)) { OSL_info("body iterators are not the same"); return 0; } if (!osl_strings_equal(b1->expression, b2->expression)) { OSL_info("body expressions are not the same"); return 0; } return 1; } /** * osl_body_interface function: * this function creates an interface structure corresponding to the body * structure and returns it). * \return An interface structure for the body structure. */ osl_interface_p osl_body_interface() { osl_interface_p interface = osl_interface_malloc(); OSL_strdup(interface->URI, OSL_URI_BODY); interface->idump = (osl_idump_f)osl_body_idump; interface->sprint = (osl_sprint_f)osl_body_sprint; interface->sread = (osl_sread_f)osl_body_sread; interface->malloc = (osl_malloc_f)osl_body_malloc; interface->free = (osl_free_f)osl_body_free; interface->clone = (osl_clone_f)osl_body_clone; interface->equal = (osl_equal_f)osl_body_equal; return interface; } cloog-0.18.4/osl/source/scop.c0000644000175000017500000007616412413270135013051 00000000000000 /*+-----------------------------------------------------------------** ** OpenScop Library ** **-----------------------------------------------------------------** ** scop.c ** **-----------------------------------------------------------------** ** First version: 30/04/2008 ** **-----------------------------------------------------------------** ***************************************************************************** * OpenScop: Structures and formats for polyhedral tools to talk together * ***************************************************************************** * ,___,,_,__,,__,,__,,__,,_,__,,_,__,,__,,___,_,__,,_,__, * * / / / // // // // / / / // // / / // / /|,_, * * / / / // // // // / / / // // / / // / / / /\ * * |~~~|~|~~~|~~~|~~~|~~~|~|~~~|~|~~~|~~~|~~~|~|~~~|~|~~~|/_/ \ * * | G |C| P | = | L | P |=| = |C| = | = | = |=| = |=| C |\ \ /\ * * | R |l| o | = | e | l |=| = |a| = | = | = |=| = |=| L | \# \ /\ * * | A |a| l | = | t | u |=| = |n| = | = | = |=| = |=| o | |\# \ \ * * | P |n| l | = | s | t |=| = |d| = | = | = | | |=| o | | \# \ \ * * | H | | y | | e | o | | = |l| | | = | | | | G | | \ \ \ * * | I | | | | e | | | | | | | | | | | | | \ \ \ * * | T | | | | | | | | | | | | | | | | | \ \ \ * * | E | | | | | | | | | | | | | | | | | \ \ \ * * | * |*| * | * | * | * |*| * |*| * | * | * |*| * |*| * | / \* \ \ * * | O |p| e | n | S | c |o| p |-| L | i | b |r| a |r| y |/ \ \ / * * '---'-'---'---'---'---'-'---'-'---'---'---'-'---'-'---' '--' * * * * Copyright (C) 2008 University Paris-Sud 11 and INRIA * * * * (3-clause BSD license) * * Redistribution and use in source and binary forms, with or without * * modification, are permitted provided that the following conditions * * are met: * * * * 1. Redistributions of source code must retain the above copyright notice, * * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * * notice, this list of conditions and the following disclaimer in the * * documentation and/or other materials provided with the distribution. * * 3. The name of the author may not be used to endorse or promote products * * derived from this software without specific prior written permission. * * * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * * OpenScop Library, a library to manipulate OpenScop formats and data * * structures. Written by: * * Cedric Bastoul and * * Louis-Noel Pouchet * * * *****************************************************************************/ # include # include # include # include #include #include #include #include #include #include #include #include #include #include /*+*************************************************************************** * Structure display functions * *****************************************************************************/ /** * osl_scop_idump function: * this function displays an osl_scop_t structure (*scop) into a * file (file, possibly stdout) in a way that trends to be understandable. It * includes an indentation level (level) in order to work with others * idump functions. * \param file The file where the information has to be printed. * \param scop The scop structure whose information has to be printed. * \param level Number of spaces before printing, for each line. */ void osl_scop_idump(FILE * file, osl_scop_p scop, int level) { int j, first = 1; // Go to the right level. for (j = 0; j < level; j++) fprintf(file, "|\t"); if (scop != NULL) fprintf(file, "+-- osl_scop_t\n"); else fprintf(file, "+-- NULL scop\n"); while (scop != NULL) { if (!first) { // Go to the right level. for (j = 0; j < level; j++) fprintf(file, "|\t"); fprintf(file, "| osl_scop_t\n"); } else first = 0; // A blank line. for (j = 0; j <= level+1; j++) fprintf(file, "|\t"); fprintf(file, "\n"); // Print the version. for (j = 0; j < level; j++) fprintf(file, "|\t"); fprintf(file, "|\tVersion: %d\n", scop->version); // A blank line. for (j = 0; j <= level+1; j++) fprintf(file, "|\t"); fprintf(file, "\n"); // Print the language. for (j = 0; j < level; j++) fprintf(file, "|\t"); fprintf(file, "|\tLanguage: %s\n", scop->language); // A blank line. for (j = 0; j <= level+1; j++) fprintf(file, "|\t"); fprintf(file, "\n"); // Print the context of the scop. osl_relation_idump(file, scop->context, level+1); // Print the parameters. osl_generic_idump(file, scop->parameters, level+1); // Print the statements. osl_statement_idump(file, scop->statement, level+1); // Print the registered extension interfaces. osl_interface_idump(file, scop->registry, level+1); // Print the extensions. osl_generic_idump(file, scop->extension, level+1); scop = scop->next; // Next line. if (scop != NULL) { for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "V\n"); } } // The last line. for (j = 0; j <= level; j++) fprintf(file, "|\t"); fprintf(file, "\n"); } /** * osl_scop_dump function: * this function prints the content of an osl_scop_t structure (*scop) * into a file (file, possibly stdout). * \param file The file where the information has to be printed. * \param scop The scop structure whose information has to be printed. */ void osl_scop_dump(FILE * file, osl_scop_p scop) { osl_scop_idump(file, scop, 0); } /** * osl_scop_names function: * this function generates as set of names for all the dimensions * involved in a given scop. * \param[in] scop The scop (list) we have to generate names for. * \return A set of generated names for the input scop dimensions. */ osl_names_p osl_scop_names(osl_scop_p scop) { int nb_parameters = OSL_UNDEFINED; int nb_iterators = OSL_UNDEFINED; int nb_scattdims = OSL_UNDEFINED; int nb_localdims = OSL_UNDEFINED; int array_id = OSL_UNDEFINED; osl_scop_get_attributes(scop, &nb_parameters, &nb_iterators, &nb_scattdims, &nb_localdims, &array_id); return osl_names_generate("P", nb_parameters, "i", nb_iterators, "c", nb_scattdims, "l", nb_localdims, "A", array_id); } /** * osl_scop_print function: * this function prints the content of an osl_scop_t structure (*scop) * into a file (file, possibly stdout) in the OpenScop textual format. * \param file The file where the information has to be printed. * \param scop The scop structure whose information has to be printed. */ void osl_scop_print(FILE * file, osl_scop_p scop) { int parameters_backedup = 0; int arrays_backedup = 0; osl_strings_p parameters_backup = NULL; osl_strings_p arrays_backup = NULL; osl_names_p names; osl_arrays_p arrays; if (scop == NULL) { fprintf(file, "# NULL scop\n"); return; } else { fprintf(file, "# [File generated by the OpenScop Library %s]\n", OSL_RELEASE); } if (osl_scop_integrity_check(scop) == 0) OSL_warning("OpenScop integrity check failed. Something may go wrong."); // Generate the names for the various dimensions. names = osl_scop_names(scop); while (scop != NULL) { // If possible, replace parameter names with scop parameter names. if (osl_generic_has_URI(scop->parameters, OSL_URI_STRINGS)) { parameters_backedup = 1; parameters_backup = names->parameters; names->parameters = scop->parameters->data; } // If possible, replace array names with arrays extension names. arrays = osl_generic_lookup(scop->extension, OSL_URI_ARRAYS); if (arrays != NULL) { arrays_backedup = 1; arrays_backup = names->arrays; names->arrays = osl_arrays_to_strings(arrays); } fprintf(file, "\n<"OSL_URI_SCOP">\n\n"); fprintf(file, "# =============================================== " "Global\n"); fprintf(file, "# Language\n"); fprintf(file, "%s\n\n", scop->language); fprintf(file, "# Context\n"); osl_relation_pprint(file, scop->context, names); fprintf(file, "\n"); osl_util_print_provided(file, osl_generic_has_URI(scop->parameters, OSL_URI_STRINGS), "Parameters are"); osl_generic_print(file, scop->parameters); fprintf(file, "\n# Number of statements\n"); fprintf(file, "%d\n\n",osl_statement_number(scop->statement)); osl_statement_pprint(file, scop->statement, names); if (scop->extension) { fprintf(file, "# =============================================== " "Extensions\n"); osl_generic_print(file, scop->extension); } fprintf(file, "\n\n\n"); // If necessary, switch back parameter names. if (parameters_backedup) { parameters_backedup = 0; names->parameters = parameters_backup; } // If necessary, switch back array names. if (arrays_backedup) { arrays_backedup = 0; osl_strings_free(names->arrays); names->arrays = arrays_backup; } scop = scop->next; } osl_names_free(names); } /** * osl_scop_print_scoplib function: * this function prints the content of an osl_scop_t structure (*scop) * into a file (file, possibly stdout) in the ScopLib textual format. * \param file The file where the information has to be printed. * \param scop The scop structure whose information has to be printed. */ void osl_scop_print_scoplib(FILE * file, osl_scop_p scop) { int parameters_backedup = 0; int arrays_backedup = 0; osl_strings_p parameters_backup = NULL; osl_strings_p arrays_backup = NULL; osl_names_p names; osl_arrays_p arrays; if (scop == NULL) { fprintf(file, "# NULL scop\n"); return; } else { fprintf(file, "# [File generated by the OpenScop Library %s]\n" "# [SCoPLib format]\n", OSL_RELEASE); } if (osl_scop_check_compatible_scoplib(scop) == 0) { OSL_error("SCoP integrity check failed. Something may go wrong."); exit(1); } // Generate the names for the various dimensions. names = osl_scop_names(scop); while (scop != NULL) { // If possible, replace parameter names with scop parameter names. if (osl_generic_has_URI(scop->parameters, OSL_URI_STRINGS)) { parameters_backedup = 1; parameters_backup = names->parameters; names->parameters = scop->parameters->data; } // If possible, replace array names with arrays extension names. arrays = osl_generic_lookup(scop->extension, OSL_URI_ARRAYS); if (arrays != NULL) { arrays_backedup = 1; arrays_backup = names->arrays; names->arrays = osl_arrays_to_strings(arrays); } fprintf(file, "\nSCoP\n\n"); fprintf(file, "# =============================================== " "Global\n"); fprintf(file, "# Language\n"); fprintf(file, "%s\n\n", scop->language); fprintf(file, "# Context\n"); osl_relation_pprint_scoplib(file, scop->context, names, 0, 0); fprintf(file, "\n"); osl_util_print_provided(file, osl_generic_has_URI(scop->parameters, OSL_URI_STRINGS), "Parameters are"); if (scop->parameters) { fprintf(file, "# Parameter names\n"); osl_strings_print(file, scop->parameters->data); } fprintf(file, "\n# Number of statements\n"); fprintf(file, "%d\n\n",osl_statement_number(scop->statement)); osl_statement_pprint_scoplib(file, scop->statement, names); if (scop->extension) { fprintf(file, "# =============================================== " "Options\n"); osl_generic_print_options_scoplib(file, scop->extension); } // If necessary, switch back parameter names. if (parameters_backedup) { parameters_backedup = 0; names->parameters = parameters_backup; } // If necessary, switch back array names. if (arrays_backedup) { arrays_backedup = 0; osl_strings_free(names->arrays); names->arrays = arrays_backup; } scop = scop->next; } osl_names_free(names); } /***************************************************************************** * Reading function * *****************************************************************************/ /** * osl_scop_pread function ("precision read"): * this function reads a list of scop structures from a file (possibly stdin) * complying to the OpenScop textual format and returns a pointer to this * scop list. If some relation properties (number of input/output/local * dimensions and number of parameters) are undefined, it will define them * according to the available information. * \param[in] file The file where the scop has to be read. * \param[in] registry The list of known interfaces (others are ignored). * \param[in] precision The precision of the relation elements. * \return A pointer to the scop structure that has been read. */ osl_scop_p osl_scop_pread(FILE * file, osl_interface_p registry, int precision) { osl_scop_p list = NULL, current = NULL, scop; osl_statement_p stmt = NULL; osl_statement_p prev = NULL; osl_strings_p language; int nb_statements; char * tmp; int first = 1; int i; if (file == NULL) return NULL; while(1) { // // I. START TAG // tmp = osl_util_read_uptotag(file, NULL, OSL_URI_SCOP); if (tmp == NULL) { OSL_debug("no more scop in the file"); break; } else { free(tmp); } scop = osl_scop_malloc(); scop->registry = osl_interface_clone(registry); // // II. CONTEXT PART // // Read the language. language = osl_strings_read(file); if (osl_strings_size(language) == 0) OSL_error("no language (backend) specified"); if (osl_strings_size(language) > 1) OSL_warning("uninterpreted information (after language)"); if (language != NULL) { OSL_strdup(scop->language, language->string[0]); osl_strings_free(language); } // Read the context domain. scop->context = osl_relation_pread(file, precision); // Read the parameters. if (osl_util_read_int(file, NULL) > 0) scop->parameters = osl_generic_read_one(file, scop->registry); // // III. STATEMENT PART // // Read the number of statements. nb_statements = osl_util_read_int(file, NULL); for (i = 0; i < nb_statements; i++) { // Read each statement. stmt = osl_statement_pread(file, scop->registry, precision); if (scop->statement == NULL) scop->statement = stmt; else prev->next = stmt; prev = stmt; } // // IV. EXTENSION PART (TO THE END TAG) // // Read up the end tag (if any), and store extensions. scop->extension = osl_generic_read(file, scop->registry); // Add the new scop to the list. if (first) { list = scop; first = 0; } else { current->next = scop; } current = scop; } if (!osl_scop_integrity_check(list)) OSL_warning("scop integrity check failed"); return list; } /** * osl_scop_read function: * this function is equivalent to osl_scop_pread() except that * (1) the precision corresponds to the precision environment variable or * to the highest available precision if it is not defined, and * (2) the list of known interface is set to the default one. * \see{osl_scop_pread} */ osl_scop_p osl_scop_read(FILE * foo) { int precision = osl_util_get_precision(); osl_interface_p registry = osl_interface_get_default_registry(); osl_scop_p scop = osl_scop_pread(foo, registry, precision); osl_interface_free(registry); return scop; } /*+*************************************************************************** * Memory allocation/deallocation functions * *****************************************************************************/ /** * osl_scop_malloc function: * this function allocates the memory space for a osl_scop_t structure and * sets its fields with default values. Then it returns a pointer to the * allocated space. * \return A pointer to an empty scop with fields set to default values. */ osl_scop_p osl_scop_malloc() { osl_scop_p scop; OSL_malloc(scop, osl_scop_p, sizeof(osl_scop_t)); scop->version = 1; scop->language = NULL; scop->context = NULL; scop->parameters = NULL; scop->statement = NULL; scop->registry = NULL; scop->extension = NULL; scop->usr = NULL; scop->next = NULL; return scop; } /** * osl_scop_free function: * This function frees the allocated memory for a osl_scop_t structure. * \param scop The pointer to the scop we want to free. */ void osl_scop_free(osl_scop_p scop) { osl_scop_p tmp; while (scop != NULL) { if (scop->language != NULL) free(scop->language); osl_generic_free(scop->parameters); osl_relation_free(scop->context); osl_statement_free(scop->statement); osl_interface_free(scop->registry); osl_generic_free(scop->extension); tmp = scop->next; free(scop); scop = tmp; } } /*+*************************************************************************** * Processing functions * *****************************************************************************/ /** * osl_scop_add function: * this function adds a scop "scop" at the end of the scop list pointed * by "location". * \param[in,out] location Address of the first element of the scop list. * \param[in] scop The scop to add to the list. */ void osl_scop_add(osl_scop_p * location, osl_scop_p scop) { while (*location != NULL) location = &((*location)->next); *location = scop; } /** * osl_scop_number function: * this function returns the number of scops in the scop list * provided as parameter. * \param[in] scop The first element of the scop list. * \return The number of scops in the scop list. */ size_t osl_scop_number(osl_scop_p scop) { size_t number = 0; while (scop != NULL) { number++; scop = scop->next; } return number; } /** * osl_scop_clone function: * This functions builds and returns a "hard copy" (not a pointer copy) * of a osl_statement_t data structure provided as parameter. * Note that the usr field is not touched by this function. * \param scop The pointer to the scop we want to clone. * \return A pointer to the full clone of the scop provided as parameter. */ osl_scop_p osl_scop_clone(osl_scop_p scop) { osl_scop_p clone = NULL, node, previous = NULL; int first = 1; while (scop != NULL) { node = osl_scop_malloc(); node->version = scop->version; if (scop->language != NULL) OSL_strdup(node->language, scop->language); node->context = osl_relation_clone(scop->context); node->parameters = osl_generic_clone(scop->parameters); node->statement = osl_statement_clone(scop->statement); node->registry = osl_interface_clone(scop->registry); node->extension = osl_generic_clone(scop->extension); if (first) { first = 0; clone = node; previous = node; } else { previous->next = node; previous = previous->next; } scop = scop->next; } return clone; } /** * osl_scop_equal function: * this function returns true if the two scops are the same, false * otherwise (the usr field is not tested). * \param s1 The first scop. * \param s2 The second scop. * \return 1 if s1 and s2 are the same (content-wise), 0 otherwise. */ int osl_scop_equal(osl_scop_p s1, osl_scop_p s2) { while ((s1 != NULL) && (s2 != NULL)) { if (s1 == s2) return 1; if (s1->version != s2->version) { OSL_info("versions are not the same"); return 0; } if (strcmp(s1->language, s2->language) != 0) { OSL_info("languages are not the same"); return 0; } if (!osl_relation_equal(s1->context, s2->context)) { OSL_info("contexts are not the same"); return 0; } if (!osl_generic_equal(s1->parameters, s2->parameters)) { OSL_info("parameters are not the same"); return 0; } if (!osl_statement_equal(s1->statement, s2->statement)) { OSL_info("statements are not the same"); return 0; } if (!osl_interface_equal(s1->registry, s2->registry)) { OSL_info("registries are not the same"); return 0; } if (!osl_generic_equal(s1->extension, s2->extension)) { OSL_info("extensions are not the same"); return 0; } s1 = s1->next; s2 = s2->next; } if (((s1 == NULL) && (s2 != NULL)) || ((s1 != NULL) && (s2 == NULL))) return 0; return 1; } /** * osl_scop_integrity_check function: * This function checks that a scop is "well formed". It returns 0 if the * check failed or 1 if no problem has been detected. * \param scop The scop we want to check. * \return 0 if the integrity check fails, 1 otherwise. */ int osl_scop_integrity_check(osl_scop_p scop) { int expected_nb_parameters; while (scop != NULL) { // Check the language. if ((scop->language != NULL) && (!strcmp(scop->language, "caml") || !strcmp(scop->language, "Caml") || !strcmp(scop->language, "ocaml") || !strcmp(scop->language, "OCaml"))) fprintf(stderr, "[OpenScop] Alert: What ?! Caml ?! Are you sure ?!?!\n"); // Check the context. if (!osl_relation_integrity_check(scop->context, OSL_TYPE_CONTEXT, OSL_UNDEFINED, OSL_UNDEFINED, OSL_UNDEFINED)) return 0; // Get the number of parameters. if (scop->context != NULL) expected_nb_parameters = scop->context->nb_parameters; else expected_nb_parameters = OSL_UNDEFINED; // TODO : check the number of parameter strings. if (!osl_statement_integrity_check(scop->statement, expected_nb_parameters)) return 0; scop = scop->next; } return 1; } /** * osl_scop_check_compatible_scoplib function: * This function checks that a scop is "well formed". It returns 0 if the * check failed or 1 if no problem has been detected. * \param scop The scop we want to check. * \return 0 if the integrity check fails, 1 otherwise. */ int osl_scop_check_compatible_scoplib(osl_scop_p scop) { if (!osl_scop_integrity_check(scop)) return 0; if (scop->next != NULL) return 0; if (scop == NULL || scop->statement == NULL) return 1; osl_relation_p domain; osl_statement_p statement; osl_relation_p scattering; int precision = scop->statement->scattering->precision; int i, j; statement = scop->statement; while (statement != NULL) { scattering = statement->scattering; if (scattering->nb_local_dims != 0) { OSL_error("Local dims in scattering matrix"); return 0; } domain = statement->domain; while (domain != NULL) { if (domain->nb_local_dims != 0) { OSL_error("Local dims in domain matrix"); return 0; } domain = domain->next; } // Check if there is only the -Identity in the output_dims // and the lines MUST be in the right order for (i = 0 ; i < scattering->nb_rows ; i++) { for (j = 0 ; j < scattering->nb_output_dims ; j++) { if (i == j) { // -1 if (!osl_int_mone(precision, scattering->m[i][j+1])) { OSL_error("Wrong -Identity"); return 0; } } else { // 0 if (!osl_int_zero(precision, scattering->m[i][j+1])) { OSL_error("Wrong -Identity"); return 0; } } } } statement = statement->next; } return 1; } /** * osl_scop_get_nb_parameters function: * this function returns the number of global parameters of a given SCoP. * \param scop The scop we want to know the number of global parameters. * \return The number of global parameters in the scop. */ int osl_scop_get_nb_parameters(osl_scop_p scop) { if (scop->context == NULL) { OSL_debug("no context domain, assuming 0 parameters"); return 0; } else { return scop->context->nb_parameters; } } /** * osl_scop_register_extension function: * this function registers a list of extension interfaces to a scop, i.e., it * adds them to the scop registry. In addition, it will extract extensions * corresponding to those interfaces from the textual form of the extensions * (if any) and add them to the scop extension list. * \param scop The scop for which an extension has to be registered. * \param interface The extension interface to register within the scop. */ void osl_scop_register_extension(osl_scop_p scop, osl_interface_p interface) { osl_generic_p textual, new; char * extension_string; if ((interface != NULL) && (scop != NULL)) { osl_interface_add(&scop->registry, interface); textual = osl_generic_lookup(scop->extension, interface->URI); if (textual != NULL) { extension_string = ((osl_textual_p)textual->data)->textual; new = osl_generic_sread(&extension_string, interface); osl_generic_add(&scop->extension, new); } } } /** * osl_scop_get_attributes function: * this function returns, through its parameters, the maximum values of the * relation attributes (nb_iterators, nb_parameters etc) in the scop. * HOWEVER, it updates the parameter value iff the attribute is greater than * the input parameter value. Hence it may be used to get the attributes as * well as to find the maximum attributes for several scop lists. The array * identifier 0 is used when there is no array identifier (AND this is OK), * OSL_UNDEFINED is used to report it is impossible to provide the property * while it should. This function is not intended for checking, the input * scop should be correct. * \param[in] scop The scop to extract attributes values. * \param[in,out] nb_parameters Number of parameter attribute. * \param[in,out] nb_iterators Number of iterators attribute. * \param[in,out] nb_scattdims Number of scattering dimensions attribute. * \param[in,out] nb_localdims Number of local dimensions attribute. * \param[in,out] array_id Maximum array identifier attribute. */ void osl_scop_get_attributes(osl_scop_p scop, int * nb_parameters, int * nb_iterators, int * nb_scattdims, int * nb_localdims, int * array_id) { int local_nb_parameters = OSL_UNDEFINED; int local_nb_iterators = OSL_UNDEFINED; int local_nb_scattdims = OSL_UNDEFINED; int local_nb_localdims = OSL_UNDEFINED; int local_array_id = OSL_UNDEFINED; while (scop != NULL) { osl_relation_get_attributes(scop->context, &local_nb_parameters, &local_nb_iterators, &local_nb_scattdims, &local_nb_localdims, &local_array_id); osl_statement_get_attributes(scop->statement, &local_nb_parameters, &local_nb_iterators, &local_nb_scattdims, &local_nb_localdims, &local_array_id); // Update. *nb_parameters = OSL_max(*nb_parameters, local_nb_parameters); *nb_iterators = OSL_max(*nb_iterators, local_nb_iterators); *nb_scattdims = OSL_max(*nb_scattdims, local_nb_scattdims); *nb_localdims = OSL_max(*nb_localdims, local_nb_localdims); *array_id = OSL_max(*array_id, local_array_id); scop = scop->next; } } /** * osl_scop_normalize_scattering function: * this function modifies a scop such that all scattering relation have * the same number of output dimensions (additional output dimensions are * set as being equal to zero). * \param[in,out] scop The scop to nomalize the scattering functions. */ void osl_scop_normalize_scattering(osl_scop_p scop) { int max_scattering_dims = 0; osl_statement_p statement; osl_relation_p extended; if ((scop != NULL) && (scop->statement != NULL)) { // Get the max number of scattering dimensions. statement = scop->statement; while (statement != NULL) { if (statement->scattering != NULL) { max_scattering_dims = OSL_max(max_scattering_dims, statement->scattering->nb_output_dims); } statement = statement->next; } // Normalize. statement = scop->statement; while (statement != NULL) { if (statement->scattering != NULL) { extended = osl_relation_extend_output(statement->scattering, max_scattering_dims); osl_relation_free(statement->scattering); statement->scattering = extended; } statement = statement->next; } } } cloog-0.18.4/osl/NEWS0000644000175000017500000000001612413256474011131 00000000000000Some news... cloog-0.18.4/osl/README0000644000175000017500000000077612413270135011315 00000000000000* * * * * * * * * * * * * * * OpenScop Library 0.9.0 * * * * * * * * * * * * * * * Install with Makefile --------------------- $> ./autogen.sh $> ./configure $> make $> make install Alternative: Install with CMake ------------------------------- $> mkdir build $> cd build $> cmake .. # -DCMAKE_INSTALL_PREFIX="/your/install/directory" $> make $> make test $> # make install # sudo make install # su -c "make install" $> make doc Support ------- Please contact: openscop-development@googlegroups.com cloog-0.18.4/configure.ac0000644000175000017500000002245112555417074012134 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], [4]) 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.4/Makefile.am0000644000175000017500000001565312413277160011701 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 AUTOMAKE_OPTIONS = subdir-objects 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/util.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/util.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 \ cmake \ 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)" rm -f "$(DESTDIR)$(libdir)/isl/isl-config.cmake" rm -f "$(DESTDIR)$(libdir)/$(PACKAGE_NAME)/cloog-isl-config.cmake" 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) test_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.4/CLOOG_HEAD0000644000175000017500000000001712555417257011212 000000000000000.18.4-b2b4f77 cloog-0.18.4/m4/0000755000175000017500000000000012555417255010243 500000000000000cloog-0.18.4/m4/ax_cc_maxopt.m40000644000175000017500000001604612413255517013073 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.4/m4/ax_gcc_archflag.m40000644000175000017500000002141412413255517013474 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.4/m4/ax_cflags_warn_all.m40000644000175000017500000001420412413255517014226 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.4/m4/lt~obsolete.m40000644000175000017500000001375612413256725013007 00000000000000# lt~obsolete.m4 -- aclocal satisfying obsolete definitions. -*-Autoconf-*- # # Copyright (C) 2004, 2005, 2007, 2009 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.4/m4/ax_create_pkgconfig_info.m40000644000175000017500000003420112413255517015414 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.4/m4/ax_check_compiler_flags.m40000644000175000017500000000632312413255517015236 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.4/m4/ltsugar.m40000644000175000017500000001042412413256724012102 00000000000000# ltsugar.m4 -- libtool m4 base layer. -*-Autoconf-*- # # Copyright (C) 2004, 2005, 2007, 2008 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.4/m4/ltversion.m40000644000175000017500000000126212413256725012447 00000000000000# ltversion.m4 -- version numbers -*- Autoconf -*- # # Copyright (C) 2004 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 3337 ltversion.m4 # This file is part of GNU Libtool m4_define([LT_PACKAGE_VERSION], [2.4.2]) m4_define([LT_PACKAGE_REVISION], [1.3337]) AC_DEFUN([LTVERSION_VERSION], [macro_version='2.4.2' macro_revision='1.3337' _LT_DECL(, macro_version, 0, [Which release of libtool.m4 was used?]) _LT_DECL(, macro_revision, 0) ]) cloog-0.18.4/m4/libtool.m40000644000175000017500000106011112413256724012064 00000000000000# libtool.m4 - Configure libtool for the host system. -*-Autoconf-*- # # 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 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 57 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 which 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 "X${COLLECT_NAMES+set}" != Xset; 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\\"\\\`\\\\\\"" ;; *) 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\\"\\\`\\\\\\"" ;; *) 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 $lt_write_fail = 0 && 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 "$silent" = yes && 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 which 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$TIMESTAMP) $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 "X${COLLECT_NAMES+set}" != Xset; 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) _LT_PROG_REPLACE_SHELLFNS 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' TIMESTAMP='$TIMESTAMP' 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 $_lt_result -eq 0; 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 $_lt_result -eq 0 && $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 "$lt_cv_apple_cc_single_mod" = "yes"; then _lt_dar_single_mod='$single_module' fi if test "$lt_cv_ld_exported_symbols_list" = "yes"; 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 "$lt_cv_ld_force_load" = "no"; 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 "$lt_cv_ld_force_load" = "yes"; 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*) _lt_dar_can_shared=yes ;; *) _lt_dar_can_shared=$GCC ;; esac if test "$_lt_dar_can_shared" = "yes"; 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 "$lt_cv_apple_cc_single_mod" != "yes"; 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 "${lt_cv_aix_libpath+set}" = 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 which will find a shell with a builtin # printf (which 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], [ --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 "$GCC" = yes; 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 in which 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 "x$enable_libtool_lock" != xno && 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 which ABI we are using. 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 which ABI we are using. echo '[#]line '$LINENO' "configure"' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then if test "$lt_cv_prog_gnu_ld" = yes; 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* ;; x86_64-*kfreebsd*-gnu|x86_64-*linux*|powerpc*-*linux*| \ s390*-*linux*|s390*-*tpf*|sparc*-*linux*) # Find out which ABI we are using. 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-*) LD="${LD-ld} -m elf32lppclinux" ;; powerpc64-*) 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-*) LD="${LD-ld} -m elf64lppc" ;; powerpc-*) 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 x"$lt_cv_cc_needs_belf" != x"yes"; then # this is probably gcc 2.8.0, egcs 1.0 or newer; no need for -belf CFLAGS="$SAVE_CFLAGS" fi ;; *-*solaris*) # Find out which ABI we are using. 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*) 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 "$ac_status" -eq 0; then # Ensure the archiver fails upon bogus file names. rm -f conftest.$ac_objext libconftest.a AC_TRY_EVAL([lt_ar_try]) if test "$ac_status" -ne 0; then lt_cv_ar_at_file=@ fi fi rm -f conftest.* libconftest.a ]) ]) if test "x$lt_cv_ar_at_file" = xno; 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 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" # 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 x"[$]$2" = xyes; 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 x"[$]$2" = xyes; 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; ;; netbsd* | freebsd* | openbsd* | darwin* | dragonfly*) # 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 $i != 17 # 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 "$cross_compiling" = yes; 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 "x$enable_dlopen" != xyes; 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 ]) ;; *) 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 "x$lt_cv_dlopen" != xno; then enable_dlopen=yes else enable_dlopen=no fi case $lt_cv_dlopen in dlopen) save_CPPFLAGS="$CPPFLAGS" test "x$ac_cv_header_dlfcn_h" = xyes && 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 "x$lt_cv_dlopen_self" = xyes; 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 "$_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)" = no && test "$need_locks" != no; 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 "$hard_links" = no; 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 in which 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 "X$_LT_TAGVAR(hardcode_automatic, $1)" = "Xyes" ; then # We can hardcode non-existent directories. if test "$_LT_TAGVAR(hardcode_direct, $1)" != no && # 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 "$_LT_TAGVAR(hardcode_shlibpath_var, $1)" != no && test "$_LT_TAGVAR(hardcode_minus_L, $1)" != no; 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 "$_LT_TAGVAR(hardcode_action, $1)" = relink || test "$_LT_TAGVAR(inherit_rpath, $1)" = yes; then # Fast installation is not supported enable_fast_install=no elif test "$shlibpath_overrides_runpath" = yes || test "$enable_shared" = no; 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 "$GCC" = yes; 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` 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" else 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 "$host_cpu" = ia64; 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 can not hardcode correct # soname into executable. Probably we can add versioning support to # collect2, so additional links can be useful in future. if test "$aix_use_runtimelinking" = yes; 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%'\''`; test $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=yes 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 "X$HPUX_IA64_MODE" = X32; 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 "$lt_cv_prog_gnu_ld" = yes; 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 ;; # 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' ;; netbsdelf*-gnu) version_type=linux 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='NetBSD ld.elf_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*) version_type=sunos sys_lib_dlsearch_path_spec="/usr/lib" need_lib_prefix=no # Some older versions of OpenBSD (3.3 at least) *do* need versioned libs. case $host_os in openbsd3.3 | openbsd3.3.*) need_version=yes ;; *) need_version=no ;; esac 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 if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then case $host_os in openbsd2.[[89]] | openbsd2.[[89]].*) shlibpath_overrides_runpath=no ;; *) shlibpath_overrides_runpath=yes ;; esac else shlibpath_overrides_runpath=yes fi ;; 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 "$with_gnu_ld" = yes; 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 "$with_gnu_ld" = yes; 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 "$dynamic_linker" = no && can_build_shared=no variables_saved_for_relink="PATH $shlibpath_var $runpath_var" if test "$GCC" = yes; then variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH" fi if test "${lt_cv_sys_lib_search_path_spec+set}" = set; then sys_lib_search_path_spec="$lt_cv_sys_lib_search_path_spec" fi if test "${lt_cv_sys_lib_dlsearch_path_spec+set}" = 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 which 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 which 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 "$withval" = no || with_gnu_ld=yes], [with_gnu_ld=no])dnl ac_prog=ld if test "$GCC" = yes; 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 "$with_gnu_ld" = yes; 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* | netbsdelf*-gnu) 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*) if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; 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 ;; *) case `"$tmp_nm" -p /dev/null 2>&1 | sed '1q'` in */dev/null*) lt_cv_path_NM="$tmp_nm -p" break ;; *) 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 "$lt_cv_path_NM" != "no"; 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 /dev/null 2>&1 | sed '1q'` in *COFF*) DUMPBIN="$DUMPBIN -symbols" ;; *) 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 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 "x$lt_cv_path_mainfest_tool" != xyes; then MANIFEST_TOOL=: fi _LT_DECL([], [MANIFEST_TOOL], [1], [Manifest tool])dnl ])# _LT_PATH_MANIFEST_TOOL # 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 "$GCC" = yes; 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 "$host_cpu" = ia64; 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 # 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 -e 's/^T .* \(.*\)$/extern int \1();/p' -e 's/^$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 -e 's/^: \([[^ ]]*\)[[ ]]*$/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([[^ ]]*\) \([[^ ]]*\)$/ {\"\2\", (void *) \&\2},/p'" lt_cv_sys_global_symbol_to_c_name_address_lib_prefix="sed -n -e 's/^: \([[^ ]]*\)[[ ]]*$/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([[^ ]]*\) \(lib[[^ ]]*\)$/ {\"\2\", (void *) \&\2},/p' -e 's/^$symcode* \([[^ ]]*\) \([[^ ]]*\)$/ {\"lib\2\", (void *) \&\2},/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 # and D for any global 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};"\ " \$ 0!~/External *\|/{next};"\ " / 0+ UNDEF /{next}; / UNDEF \([^|]\)*()/{next};"\ " {if(hide[section]) next};"\ " {f=0}; \$ 0~/\(\).*\|/{f=1}; {printf f ? \"T \" : \"D \"};"\ " {split(\$ 0, a, /\||\r/); split(a[2], s)};"\ " s[1]~/^[@?]/{print s[1], s[1]; next};"\ " s[1]~prfx {split(s[1],t,\"@\"); print 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 con'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* \(.*\) \(.*\)$/ {\"\2\", (void *) \&\2},/" < "$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 "$pipe_works" = yes; 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_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_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 "$GXX" = yes; 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 "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' fi ;; 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 "$host_cpu" = ia64; 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 "$host_cpu" != ia64; 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* | netbsdelf*-gnu) ;; *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 "$GCC" = yes; 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 "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' fi ;; 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 "$host_cpu" = ia64; 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 ;; 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' ;; 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 which 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 ;; linux* | k*bsd*-gnu | gnu*) _LT_TAGVAR(link_all_deplibs, $1)=no ;; *) _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 "$GCC" != yes; then with_gnu_ld=no fi ;; interix*) # we just hope/assume this is gcc and not c89 (= MSVC++) with_gnu_ld=yes ;; openbsd*) with_gnu_ld=no ;; linux* | k*bsd*-gnu | gnu*) _LT_TAGVAR(link_all_deplibs, $1)=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 "$with_gnu_ld" = yes; 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 "$lt_use_gnu_ld_interface" = yes; 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 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 "$host_cpu" != ia64; 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 (1st line # is EXPORTS), use it as is; otherwise, prepend... _LT_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; 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 "$host_os" = linux-dietlibc; 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 "$tmp_diet" = no 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' ;; 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 "x$supports_anon_versioning" = xyes; 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 "x$supports_anon_versioning" = xyes; 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* | netbsdelf*-gnu) 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 can not *** 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 "$_LT_TAGVAR(ld_shlibs, $1)" = no; 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 "$GCC" = yes && 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 "$host_cpu" = ia64; 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 $ld_flag = "-brtl" || test $ld_flag = "-Wl,-brtl"); 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 "$GCC" = yes; 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 "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi _LT_TAGVAR(link_all_deplibs, $1)=no else # not using gcc if test "$host_cpu" = ia64; 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 "$aix_use_runtimelinking" = yes; 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 "$aix_use_runtimelinking" = yes; 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 "x${allow_undefined_flag}" != "x"; then func_echo_all "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; 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 "$with_gnu_ld" = yes; 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~linknames=' _LT_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then sed -n -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' -e '1\\\!p' < $export_symbols > $output_objdir/$soname.exp; else sed -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' < $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 "$GCC" = yes; 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 $output_objdir/$soname = $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 $output_objdir/$soname = $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 "$GCC" = yes && test "$with_gnu_ld" = no; 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 "$with_gnu_ld" = no; 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 "$GCC" = yes && test "$with_gnu_ld" = no; 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 "$with_gnu_ld" = no; 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 "$GCC" = yes; 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 "$lt_cv_irix_exported_symbol" = yes; 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* | netbsdelf*-gnu) 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*) 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__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; 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 case $host_os in openbsd[[01]].* | openbsd2.[[0-7]] | openbsd2.[[0-7]].*) _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' ;; *) _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' ;; esac 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 "$GCC" = yes; 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 "$GCC" = yes; 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 "$GCC" = yes; 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 "$GCC" = yes; 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 "x$host_vendor" = xsequent; 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 "$GCC" = yes; 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 can NOT 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 "$GCC" = yes; 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 x$host_vendor = xsni; 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 "$_LT_TAGVAR(ld_shlibs, $1)" = no && 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 "$enable_shared" = yes && test "$GCC" = yes; 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 which 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 "$can_build_shared" = "no" && 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 "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[[4-9]]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && 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 "$enable_shared" = yes || 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 "X$CXX" != "Xno" && ( (test "X$CXX" = "Xg++" && `g++ -v >/dev/null 2>&1` ) || (test "X$CXX" != "Xg++"))) ; 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 "$_lt_caught_CXX_error" != yes; 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 "$GXX" = yes; 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 "$GXX" = yes; 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 "$with_gnu_ld" = yes; 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 "$host_cpu" = ia64; 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 "$GXX" = yes; 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 "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi else # not using gcc if test "$host_cpu" = ia64; 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 "$aix_use_runtimelinking" = yes; 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 "$aix_use_runtimelinking" = yes; 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 "x${allow_undefined_flag}" != "x"; then func_echo_all "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; 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 "$with_gnu_ld" = yes; 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~linknames=' _LT_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then $SED -n -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' -e '1\\\!p' < $export_symbols > $output_objdir/$soname.exp; else $SED -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' < $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 (1st line # is EXPORTS), use it as is; otherwise, prepend... _LT_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; 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 $output_objdir/$soname = $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 "$GXX" = yes; 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 $output_objdir/$soname = $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 $with_gnu_ld = no; 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 "$GXX" = yes; then if test $with_gnu_ld = no; 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 "$GXX" = yes; then if test "$with_gnu_ld" = no; 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 "x$supports_anon_versioning" = xyes; 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 ;; openbsd2*) # C++ shared libraries are fairly broken _LT_TAGVAR(ld_shlibs, $1)=no ;; openbsd*) 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__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; 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 "$GXX" = yes && test "$with_gnu_ld" = no; 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 "$GXX" = yes && test "$with_gnu_ld" = no; 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 $LDFLAGS $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 -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 $LDFLAGS $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 -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 can NOT 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 "$_LT_TAGVAR(ld_shlibs, $1)" = no && 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 "$_lt_caught_CXX_error" != yes 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 ${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 ])# _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 $p = "-L" || test $p = "-R"; 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 "$pre_test_object_deps_done" = no; 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 "$pre_test_object_deps_done" = no; 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 "$solaris_use_stlport4" != yes; 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 "$solaris_use_stlport4" != yes; 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 "X$F77" = "Xno"; 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 "$_lt_disable_F77" != yes; 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 "$can_build_shared" = "no" && 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 "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[[4-9]]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && 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 "$enable_shared" = yes || 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 "$_lt_disable_F77" != yes 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 "X$FC" = "Xno"; 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 "$_lt_disable_FC" != yes; 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 "$can_build_shared" = "no" && 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 "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[[4-9]]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && 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 "$enable_shared" = yes || 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 "$_lt_disable_FC" != yes 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 "x${GCJFLAGS+set}" = xset || 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 $lt_ac_count -gt 10 && 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], [AC_MSG_CHECKING([whether the shell understands some XSI constructs]) # Try some XSI features xsi_shell=no ( _lt_dummy="a/b/c" test "${_lt_dummy##*/},${_lt_dummy%/*},${_lt_dummy#??}"${_lt_dummy%"$_lt_dummy"}, \ = c,a/b,b/c, \ && eval 'test $(( 1 + 1 )) -eq 2 \ && test "${#_lt_dummy}" -eq 5' ) >/dev/null 2>&1 \ && xsi_shell=yes AC_MSG_RESULT([$xsi_shell]) _LT_CONFIG_LIBTOOL_INIT([xsi_shell='$xsi_shell']) AC_MSG_CHECKING([whether the shell understands "+="]) lt_shell_append=no ( foo=bar; set foo baz; eval "$[1]+=\$[2]" && test "$foo" = barbaz ) \ >/dev/null 2>&1 \ && lt_shell_append=yes AC_MSG_RESULT([$lt_shell_append]) _LT_CONFIG_LIBTOOL_INIT([lt_shell_append='$lt_shell_append']) 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_PROG_FUNCTION_REPLACE (FUNCNAME, REPLACEMENT-BODY) # ------------------------------------------------------ # In `$cfgfile', look for function FUNCNAME delimited by `^FUNCNAME ()$' and # '^} FUNCNAME ', and replace its body with REPLACEMENT-BODY. m4_defun([_LT_PROG_FUNCTION_REPLACE], [dnl { sed -e '/^$1 ()$/,/^} # $1 /c\ $1 ()\ {\ m4_bpatsubsts([$2], [$], [\\], [^\([ ]\)], [\\\1]) } # Extended-shell $1 implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: ]) # _LT_PROG_REPLACE_SHELLFNS # ------------------------- # Replace existing portable implementations of several shell functions with # equivalent extended shell implementations where those features are available.. m4_defun([_LT_PROG_REPLACE_SHELLFNS], [if test x"$xsi_shell" = xyes; then _LT_PROG_FUNCTION_REPLACE([func_dirname], [dnl case ${1} in */*) func_dirname_result="${1%/*}${2}" ;; * ) func_dirname_result="${3}" ;; esac]) _LT_PROG_FUNCTION_REPLACE([func_basename], [dnl func_basename_result="${1##*/}"]) _LT_PROG_FUNCTION_REPLACE([func_dirname_and_basename], [dnl case ${1} in */*) func_dirname_result="${1%/*}${2}" ;; * ) func_dirname_result="${3}" ;; esac func_basename_result="${1##*/}"]) _LT_PROG_FUNCTION_REPLACE([func_stripname], [dnl # pdksh 5.2.14 does not do ${X%$Y} correctly if both X and Y are # positional parameters, so assign one to ordinary parameter first. func_stripname_result=${3} func_stripname_result=${func_stripname_result#"${1}"} func_stripname_result=${func_stripname_result%"${2}"}]) _LT_PROG_FUNCTION_REPLACE([func_split_long_opt], [dnl func_split_long_opt_name=${1%%=*} func_split_long_opt_arg=${1#*=}]) _LT_PROG_FUNCTION_REPLACE([func_split_short_opt], [dnl func_split_short_opt_arg=${1#??} func_split_short_opt_name=${1%"$func_split_short_opt_arg"}]) _LT_PROG_FUNCTION_REPLACE([func_lo2o], [dnl case ${1} in *.lo) func_lo2o_result=${1%.lo}.${objext} ;; *) func_lo2o_result=${1} ;; esac]) _LT_PROG_FUNCTION_REPLACE([func_xform], [ func_xform_result=${1%.*}.lo]) _LT_PROG_FUNCTION_REPLACE([func_arith], [ func_arith_result=$(( $[*] ))]) _LT_PROG_FUNCTION_REPLACE([func_len], [ func_len_result=${#1}]) fi if test x"$lt_shell_append" = xyes; then _LT_PROG_FUNCTION_REPLACE([func_append], [ eval "${1}+=\\${2}"]) _LT_PROG_FUNCTION_REPLACE([func_append_quoted], [dnl func_quote_for_eval "${2}" dnl m4 expansion turns \\\\ into \\, and then the shell eval turns that into \ eval "${1}+=\\\\ \\$func_quote_for_eval_result"]) # Save a `func_append' function call where possible by direct use of '+=' sed -e 's%func_append \([[a-zA-Z_]]\{1,\}\) "%\1+="%g' $cfgfile > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: else # Save a `func_append' function call even when '+=' is not available sed -e 's%func_append \([[a-zA-Z_]]\{1,\}\) "%\1="$\1%g' $cfgfile > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: fi if test x"$_lt_function_replace_fail" = x":"; then AC_MSG_WARN([Unable to substitute extended shell functions in $ofile]) fi ]) # _LT_PATH_CONVERSION_FUNCTIONS # ----------------------------- # Determine which 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.4/m4/ax_submodule.m40000644000175000017500000000316012413255517013106 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.4/m4/ax_compiler_vendor.m40000644000175000017500000000702612554423530014301 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 15 AC_DEFUN([AX_COMPILER_VENDOR], [AC_CACHE_CHECK([for _AC_LANG compiler vendor], ax_cv_[]_AC_LANG_ABBREV[]_compiler_vendor, dnl Please add if possible support to ax_compiler_version.m4 [# note: don't check for gcc first since some other compilers define __GNUC__ vendors="intel: __ICC,__ECC,__INTEL_COMPILER ibm: __xlc__,__xlC__,__IBMC__,__IBMCPP__ pathscale: __PATHCC__,__PATHSCALE__ clang: __clang__ cray: _CRAYC fujitsu: __FUJITSU gnu: __GNUC__ sun: __SUNPRO_C,__SUNPRO_CC hp: __HP_cc,__HP_aCC dec: __DECC,__DECCXX,__DECC_VER,__DECCXX_VER borland: __BORLANDC__,__CODEGEARC__,__TURBOC__ comeau: __COMO__ kai: __KCC lcc: __LCC__ sgi: __sgi,sgi microsoft: _MSC_VER metrowerks: __MWERKS__ watcom: __WATCOMC__ portland: __PGI tcc: __TINYC__ unknown: UNKNOWN" for ventest in $vendors; do case $ventest in *:) vendor=$ventest; continue ;; *) vencpp="defined("`echo $ventest | sed 's/,/) || defined(/g'`")" ;; esac AC_COMPILE_IFELSE([AC_LANG_PROGRAM(,[ #if !($vencpp) thisisanerror; #endif ])], [break]) done ax_cv_[]_AC_LANG_ABBREV[]_compiler_vendor=`echo $vendor | cut -d: -f1` ]) ]) cloog-0.18.4/m4/ax_gcc_x86_cpuid.m40000644000175000017500000000634312413255517013542 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.4/m4/ltoptions.m40000644000175000017500000003007312413256724012456 00000000000000# Helper functions for option handling. -*- Autoconf -*- # # Copyright (C) 2004, 2005, 2007, 2008, 2009 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 7 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=default]) test -z "$pic_mode" && 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.4/include/0000755000175000017500000000000012555417255011346 500000000000000cloog-0.18.4/include/cloog/0000755000175000017500000000000012555417255012451 500000000000000cloog-0.18.4/include/cloog/input.h0000644000175000017500000000112412413255517013671 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.4/include/cloog/int.h0000644000175000017500000001312112413255517013324 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.4/include/cloog/stride.h0000644000175000017500000000147512413255517014035 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.4/include/cloog/loop.h0000644000175000017500000001422412413255517013510 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.4/include/cloog/constraints.h0000644000175000017500000001504412413255517015107 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.4/include/cloog/version.h.in0000644000175000017500000000460112413255517014627 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.4/include/cloog/block.h0000644000175000017500000001351612413255517013634 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.4/include/cloog/program.h0000644000175000017500000001317112413255517014206 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.4/include/cloog/pprint.h0000644000175000017500000000640612413255517014056 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); void clast_pprint_expr(struct cloogoptions *i, FILE *dst, struct clast_expr *e); #if defined(__cplusplus) } #endif #endif /* define _H */ cloog-0.18.4/include/cloog/statement.h0000644000175000017500000001041412413255517014540 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.4/include/cloog/version.h0000644000175000017500000000452512555417255014235 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 4 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.4/include/cloog/matrix/0000755000175000017500000000000012555417255013755 500000000000000cloog-0.18.4/include/cloog/matrix/constraintset.h0000644000175000017500000000072112413255517016740 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.4/include/cloog/names.h0000644000175000017500000001204412413255517013640 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.4/include/cloog/domain.h0000644000175000017500000002201412413255517014002 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.4/include/cloog/cloog.h0000644000175000017500000000635512413255517013650 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 #include #endif /* !CLOOG_H */ cloog-0.18.4/include/cloog/union_domain.h0000644000175000017500000000324112413255517015213 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.4/include/cloog/isl/0000755000175000017500000000000012555417255013240 500000000000000cloog-0.18.4/include/cloog/isl/constraintset.h0000644000175000017500000000175012413255517016226 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); __isl_give isl_val *cloog_int_to_isl_val(isl_ctx* ctx, cloog_int_t c); void isl_val_to_cloog_int(__isl_keep isl_val *val, cloog_int_t *cint); __isl_give isl_val *cloog_constraint_coefficient_get_val(CloogConstraint *constraint, int var); #if defined(__cplusplus) } #endif #endif /* define _H */ cloog-0.18.4/include/cloog/isl/domain.h0000644000175000017500000000146112413255517014574 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.4/include/cloog/isl/cloog.h0000644000175000017500000000053612413255517014432 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.4/include/cloog/isl/backend.h0000644000175000017500000000027212413255517014713 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.4/include/cloog/matrix.h0000644000175000017500000000426512413255517014047 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.4/include/cloog/options.h0000644000175000017500000001740712413255517014240 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.4/include/cloog/clast.h0000644000175000017500000001140712413255517013645 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; /* Enable execution time reporting for this loop */ /* Variable name to accumulate execution time this loop */ char *time_var_name; }; 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.4/include/cloog/state.h0000644000175000017500000000140412413255517013653 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.4/include/cloog/util.h0000644000175000017500000000524512413255517013517 00000000000000 /**-------------------------------------------------------------------** ** CLooG ** **-------------------------------------------------------------------** ** util.h ** **-------------------------------------------------------------------** ** First version: January 8th 2014 ** **-------------------------------------------------------------------**/ /****************************************************************************** * 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_UTIL_H #define CLOOG_UTIL_H #if defined(__cplusplus) extern "C" { #endif double cloog_util_rtclock(); #if defined(__cplusplus) } #endif #endif /* !CLOOG_UTIL_H */ cloog-0.18.4/genversion.sh.in0000755000175000017500000000060212555413554012762 00000000000000#! /bin/sh srcdir=@abs_srcdir@ PACKAGE=@PACKAGE@ VERSION=@VERSION@ if test -f $srcdir/.git/HEAD; then GIT_REPO="$srcdir/.git" GIT_HEAD_ID="$PACKAGE-$VERSION-`GIT_DIR=$GIT_REPO git rev-parse --short HEAD`" 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.4/aclocal.m40000644000175000017500000012261512555417250011505 00000000000000# generated automatically by aclocal 1.14.1 -*- Autoconf -*- # Copyright (C) 1996-2013 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_CONFIG_MACRO_DIRS], [m4_defun([_AM_CONFIG_MACRO_DIRS], [])m4_defun([AC_CONFIG_MACRO_DIRS], [_AM_CONFIG_MACRO_DIRS($@)])]) m4_ifndef([AC_AUTOCONF_VERSION], [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl m4_if(m4_defn([AC_AUTOCONF_VERSION]), [2.69],, [m4_warning([this file was generated for autoconf 2.69. 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-2013 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. # 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.14' 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.14.1], [], [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.14.1])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-2013 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. # 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-2013 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. # AM_CONDITIONAL(NAME, SHELL-CONDITION) # ------------------------------------- # Define a conditional. AC_DEFUN([AM_CONDITIONAL], [AC_PREREQ([2.52])dnl m4_if([$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-2013 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. # 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", "OBJC", "OBJCXX", "UPC", or "GJC". # 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 m4_if([$1], [CC], [depcc="$CC" am_compiler_list=], [$1], [CXX], [depcc="$CXX" am_compiler_list=], [$1], [OBJC], [depcc="$OBJC" am_compiler_list='gcc3 gcc'], [$1], [OBJCXX], [depcc="$OBJCXX" 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 10 /bin/sh. echo '/* dummy */' > 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], [dnl AS_HELP_STRING( [--enable-dependency-tracking], [do not reject slow dependency extractors]) AS_HELP_STRING( [--disable-dependency-tracking], [speeds up one-time build])]) 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-2013 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. # _AM_OUTPUT_DEPENDENCY_COMMANDS # ------------------------------ AC_DEFUN([_AM_OUTPUT_DEPENDENCY_COMMANDS], [{ # Older Autoconf 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"` # 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'`; 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-2013 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 macro actually does too much. Some checks are only needed if # your package does certain things. But this isn't really a big deal. dnl Redefine AC_PROG_CC to automatically invoke _AM_PROG_CC_C_O. m4_define([AC_PROG_CC], m4_defn([AC_PROG_CC]) [_AM_PROG_CC_C_O ]) # 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.65])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], [AC_DIAGNOSE([obsolete], [$0: two- and three-arguments forms are deprecated.]) 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], [ok]):m4_ifdef([AC_PACKAGE_VERSION], [ok]), [ok:ok],, [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([AC_PROG_MKDIR_P])dnl # For better backward compatibility. To be removed once Automake 1.9.x # dies out for good. For more background, see: # # AC_SUBST([mkdir_p], ['$(MKDIR_P)']) # 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])], [m4_define([AC_PROG_CC], m4_defn([AC_PROG_CC])[_AM_DEPENDENCIES([CC])])])dnl AC_PROVIDE_IFELSE([AC_PROG_CXX], [_AM_DEPENDENCIES([CXX])], [m4_define([AC_PROG_CXX], m4_defn([AC_PROG_CXX])[_AM_DEPENDENCIES([CXX])])])dnl AC_PROVIDE_IFELSE([AC_PROG_OBJC], [_AM_DEPENDENCIES([OBJC])], [m4_define([AC_PROG_OBJC], m4_defn([AC_PROG_OBJC])[_AM_DEPENDENCIES([OBJC])])])dnl AC_PROVIDE_IFELSE([AC_PROG_OBJCXX], [_AM_DEPENDENCIES([OBJCXX])], [m4_define([AC_PROG_OBJCXX], m4_defn([AC_PROG_OBJCXX])[_AM_DEPENDENCIES([OBJCXX])])])dnl ]) AC_REQUIRE([AM_SILENT_RULES])dnl dnl The testsuite driver may need to know about EXEEXT, so add the dnl 'am__EXEEXT' conditional if _AM_COMPILER_EXEEXT was seen. This dnl macro 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 # POSIX will say in a future version that running "rm -f" with no argument # is OK; and we want to be able to make that assumption in our Makefile # recipes. So use an aggressive probe to check that the usage we want is # actually supported "in the wild" to an acceptable degree. # See automake bug#10828. # To make any issue more visible, cause the running configure to be aborted # by default if the 'rm' program in use doesn't match our expectations; the # user can still override this though. if rm -f && rm -fr && rm -rf; then : OK; else cat >&2 <<'END' Oops! Your 'rm' program seems unable to run without file operands specified on the command line, even when the '-f' option is present. This is contrary to the behaviour of most rm programs out there, and not conforming with the upcoming POSIX standard: Please tell bug-automake@gnu.org about your system, including the value of your $PATH and any error possibly output before this message. This can help us improve future automake versions. END if test x"$ACCEPT_INFERIOR_RM_PROGRAM" = x"yes"; then echo 'Configuration will proceed anyway, since you have set the' >&2 echo 'ACCEPT_INFERIOR_RM_PROGRAM variable to "yes"' >&2 echo >&2 else cat >&2 <<'END' Aborting the configuration process, to ensure you take notice of the issue. You can download and install GNU coreutils to get an 'rm' implementation that behaves properly: . If you want to complete the configuration process using your problematic 'rm' anyway, export the environment variable ACCEPT_INFERIOR_RM_PROGRAM to "yes", and re-run configure. END AC_MSG_ERROR([Your 'rm' program is bad, sorry.]) fi fi]) 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-2013 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. # 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-2013 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. # 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-2013 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. # 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-2013 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. # 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 is modern enough. # If it is, 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 --is-lightweight"; then am_missing_run="$MISSING " else am_missing_run= AC_MSG_WARN(['missing' script is too old or missing]) fi ]) # Helper functions for option handling. -*- Autoconf -*- # Copyright (C) 2001-2013 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. # _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])]) # Copyright (C) 1999-2013 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. # _AM_PROG_CC_C_O # --------------- # Like AC_PROG_CC_C_O, but changed for automake. We rewrite AC_PROG_CC # to automatically call this. AC_DEFUN([_AM_PROG_CC_C_O], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl AC_REQUIRE_AUX_FILE([compile])dnl AC_LANG_PUSH([C])dnl AC_CACHE_CHECK( [whether $CC understands -c and -o together], [am_cv_prog_cc_c_o], [AC_LANG_CONFTEST([AC_LANG_PROGRAM([])]) # Make sure it works both with $CC and with simple cc. # Following AC_PROG_CC_C_O, we do the test twice because some # compilers refuse to overwrite an existing .o file with -o, # though they will create one. am_cv_prog_cc_c_o=yes for am_i in 1 2; do if AM_RUN_LOG([$CC -c conftest.$ac_ext -o conftest2.$ac_objext]) \ && test -f conftest2.$ac_objext; then : OK else am_cv_prog_cc_c_o=no break fi done rm -f core conftest* unset am_i]) if test "$am_cv_prog_cc_c_o" != yes; then # Losing compiler, so override with the script. # FIXME: It is wrong to rewrite CC. # But if we don't then we get into trouble of one sort or another. # A longer-term fix would be to have automake use am__CC in this case, # and then we could set am__CC="\$(top_srcdir)/compile \$(CC)" CC="$am_aux_dir/compile $CC" fi AC_LANG_POP([C])]) # For backward compatibility. AC_DEFUN_ONCE([AM_PROG_CC_C_O], [AC_REQUIRE([AC_PROG_CC])]) # Copyright (C) 2001-2013 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. # AM_RUN_LOG(COMMAND) # ------------------- # Run COMMAND, save the exit status in ac_status, and log it. # (This has been adapted from Autoconf's _AC_RUN_LOG macro.) AC_DEFUN([AM_RUN_LOG], [{ echo "$as_me:$LINENO: $1" >&AS_MESSAGE_LOG_FD ($1) >&AS_MESSAGE_LOG_FD 2>&AS_MESSAGE_LOG_FD ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&AS_MESSAGE_LOG_FD (exit $ac_status); }]) # Check to make sure that the build environment is sane. -*- Autoconf -*- # Copyright (C) 1996-2013 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. # AM_SANITY_CHECK # --------------- AC_DEFUN([AM_SANITY_CHECK], [AC_MSG_CHECKING([whether build environment is sane]) # 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 ( am_has_slept=no for am_try in 1 2; do echo "timestamp, slept: $am_has_slept" > conftest.file 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 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 if test "$[2]" = conftest.file || test $am_try -eq 2; then break fi # Just in case. sleep 1 am_has_slept=yes done 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]) # If we didn't sleep, we still need to ensure time stamps of config.status and # generated files are strictly newer. am_sleep_pid= if grep 'slept: no' conftest.file >/dev/null 2>&1; then ( sleep 1 ) & am_sleep_pid=$! fi AC_CONFIG_COMMANDS_PRE( [AC_MSG_CHECKING([that generated files are newer than configure]) if test -n "$am_sleep_pid"; then # Hide warnings about reused PIDs. wait $am_sleep_pid 2>/dev/null fi AC_MSG_RESULT([done])]) rm -f conftest.file ]) # Copyright (C) 2009-2013 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. # 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], [dnl AS_HELP_STRING( [--enable-silent-rules], [less verbose build output (undo: "make V=1")]) AS_HELP_STRING( [--disable-silent-rules], [verbose build output (undo: "make V=0")])dnl ]) 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-2013 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. # 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-2013 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. # _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-2013 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. # _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}']) # We'll loop over all known methods to create a tar archive until one works. _am_tools='gnutar m4_if([$1], [ustar], [plaintar]) pax cpio none' m4_if([$1], [v7], [am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -'], [m4_case([$1], [ustar], [# The POSIX 1988 'ustar' format is defined with fixed-size fields. # There is notably a 21 bits limit for the UID and the GID. In fact, # the 'pax' utility can hang on bigger UID/GID (see automake bug#8343 # and bug#13588). am_max_uid=2097151 # 2^21 - 1 am_max_gid=$am_max_uid # The $UID and $GID variables are not portable, so we need to resort # to the POSIX-mandated id(1) utility. Errors in the 'id' calls # below are definitely unexpected, so allow the users to see them # (that is, avoid stderr redirection). am_uid=`id -u || echo unknown` am_gid=`id -g || echo unknown` AC_MSG_CHECKING([whether UID '$am_uid' is supported by ustar format]) if test $am_uid -le $am_max_uid; then AC_MSG_RESULT([yes]) else AC_MSG_RESULT([no]) _am_tools=none fi AC_MSG_CHECKING([whether GID '$am_gid' is supported by ustar format]) if test $am_gid -le $am_max_gid; then AC_MSG_RESULT([yes]) else AC_MSG_RESULT([no]) _am_tools=none fi], [pax], [], [m4_fatal([Unknown tar format])]) AC_MSG_CHECKING([how to create a $1 tar archive]) # Go ahead even if we have the value already cached. We do so because we # need to set the values for the 'am__tar' and 'am__untar' variables. _am_tools=${am_cv_prog_tar_$1-$_am_tools} 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]) cloog-0.18.4/examples/0000755000175000017500000000000012555404750011535 500000000000000cloog-0.18.4/examples/polyhedral_compiler/0000755000175000017500000000000012555405226015571 500000000000000cloog-0.18.4/examples/polyhedral_compiler/Makefile0000644000175000017500000000207012555401032017137 00000000000000# Please enter here the locations for the CLooG, OpenScop and Clan # include and library if they aren't the default values # (i.e., /usr/lib and /usr/include). CLOOG_INC = $(HOME)/usr/include CLOOG_LIB = $(HOME)/usr/lib OPENSCOP_INC = $(HOME)/usr/include OPENSCOP_LIB = $(HOME)/usr/lib CLAN_INC = $(HOME)/usr/include CLAN_LIB = $(HOME)/usr/lib CC = gcc LDLIBS= -lcloog-isl -losl -lclan CFLAGS= -DCLOOG_INT_GMP \ -I $(CLOOG_INC) -L $(CLOOG_LIB) \ -I $(OPENSCOP_INC) -L $(OPENSCOP_LIB) \ -I $(CLAN_INC) -L $(CLAN_LIB) example: poc.c @echo " /*-----------------------------------------------*" @echo " * Making Polyhedral Compiler Example *" @echo " *-----------------------------------------------*/" $(CC) poc.c -o poc $(CFLAGS) $(LDLIBS) clean: @echo " /*-----------------------------------------------*" @echo " * Cleaning Polyhedral Compiler Example *" @echo " *-----------------------------------------------*/" -rm -f poc poc.exe core cloog-0.18.4/examples/polyhedral_compiler/poc.c0000644000175000017500000000337312555405226016444 00000000000000/* poc.c A complete C to polyhedra to C compiler */ #include #include #include #include /* Use the Clan library to convert a SCoP from C to OpenScop */ osl_scop_p read_scop_from_c(FILE* input, char* input_name) { clan_options_p clanoptions; osl_scop_p scop; clanoptions = clan_options_malloc(); clanoptions->precision = OSL_PRECISION_MP; CLAN_strdup(clanoptions->name, input_name); scop = clan_scop_extract(input, clanoptions); clan_options_free(clanoptions); return scop; } /* Use the CLooG library to output a SCoP from OpenScop to C */ void print_scop_to_c(FILE* output, osl_scop_p scop) { CloogState* state; CloogOptions* options; CloogInput* input; struct clast_stmt* clast; state = cloog_state_malloc(); options = cloog_options_malloc(state); options->openscop = 1; cloog_options_copy_from_osl_scop(scop, options); input = cloog_input_from_osl_scop(options->state, scop); clast = cloog_clast_create_from_input(input, options); clast_pprint(output, clast, 0, options); cloog_clast_free(clast); options->scop = NULL; // don't free the scop cloog_options_free(options); cloog_state_free(state); // the input is freed inside } int main(int argc, char* argv[]) { osl_scop_p scop; FILE* input; if ((argc < 2) || (argc > 2)) { fprintf(stderr, "usage: %s file.c\n", argv[0]); exit(0); } if (argc == 1) input = stdin; else input = fopen(argv[1], "r"); if (input == NULL) { fprintf(stderr, "cannot open input file\n"); exit(0); } scop = read_scop_from_c(input, argv[1]); osl_scop_print(stdout, scop); // UPDATE THE SCOP IN A SMART WAY HERE print_scop_to_c(stdout, scop); osl_scop_free(scop); fclose(input); return 0; } cloog-0.18.4/examples/polyhedral_compiler/poc0000755000175000017500000003302312555403342016216 00000000000000ELF>  @@"@8 @@@@@@øø88@8@@@ŒŒ àà`à`ø  øø`ø`TT@T@DDPåtd@@DDQåtdRåtdàà`à`  /lib64/ld-linux-x86-64.so.2GNUGNUiè ¹ŽÔ²0ç!Ògý3!ªÓîˆÁ €P !(ŒBEÕì»ã’|fUaØqX¸ñ9ò‹ëÓï ¥6/Ò—ïç= ËqƒUóz¸L ³à` !ÄàËà `Ø `!`¾è `Ø `Ú  @Ùð `Ô„@libcloog-isl.so.4_ITM_deregisterTMCloneTableosl_scop_free__gmon_start___Jv_RegisterClasses_ITM_registerTMCloneTablecloog_state_freecloog_input_from_osl_scopcloog_clast_create_from_inputcloog_clast_free_fini_initcloog_state_malloccloog_options_copy_from_osl_scopclast_pprintcloog_options_malloccloog_options_freelibosl.so.0osl_scop_printlibclan.so.0clan_scop_extractclan_options_mallocclan_options_freelibc.so.6exitfopenstdinstrdupstdoutfclosestderrfwritefprintf__libc_start_main_edata__bss_start_endGLIBC_2.2.5©ui ø` à `è `ð `  ` `( `0 `8 `@ `H `P ` X ` ` ` h ` p ` x `€ `ˆ ` `˜ `  `¨ `° `¸ `À `HƒìH‹Ý H…Àtè›HƒÄÃÿ5Ò ÿ%Ô @ÿ%Ò héàÿÿÿÿ%Ê héÐÿÿÿÿ% héÀÿÿÿÿ%º hé°ÿÿÿÿ%² hé ÿÿÿÿ%ª héÿÿÿÿ%¢ hé€ÿÿÿÿ%š hépÿÿÿÿ%’ hé`ÿÿÿÿ%Š h éPÿÿÿÿ%‚ h é@ÿÿÿÿ%z h é0ÿÿÿÿ%r h é ÿÿÿÿ%j h éÿÿÿÿ%b héÿÿÿÿ%Z héðþÿÿÿ%R héàþÿÿÿ%J héÐþÿÿÿ%B héÀþÿÿÿ%: hé°þÿÿÿ%2 hé þÿÿÿ%* héþÿÿ1íI‰Ñ^H‰âHƒäðPTIÇÀ€@HÇÁ@HÇÇ@è×þÿÿôfD¸ß `UH-Ø `HƒøH‰åw]øH…Àtô]¿Ø `ÿà€¸Ø `UH-Ø `HÁøH‰åH‰ÂHÁê?HÐHÑøu]úH…Òtô]H‰Æ¿Ø `ÿ =± uUH‰åè~ÿÿÿ]Æž óÃ@Hƒ=ˆ t¸H…ÀtU¿ð`H‰åÿÐ]é{ÿÿÿésÿÿÿUH‰åHƒì H‰}èH‰uà¸èYþÿÿH‰EðH‹EðÇ@ Hƒ}àtJH‹EàH‰Çè·þÿÿH‰ÂH‹EðH‰H‹EðH‹H…Àu3H‹  º@¾ @H‰Ç¸è³ýÿÿ¿èIþÿÿH‹EðHÇH‹UðH‹EèH‰ÖH‰ÇèËýÿÿH‰EøH‹EðH‰Çè[ýÿÿH‹EøÉÃUH‰åHƒì0H‰}ØH‰uÐè@þÿÿH‰EàH‹EàH‰ÇèþÿÿH‰EèH‹EèÇ@dH‹UèH‹EÐH‰ÖH‰ÇèžýÿÿH‹EèH‹H‹UÐH‰ÖH‰ÇèHýÿÿH‰EðH‹UèH‹EðH‰ÖH‰Çè‘üÿÿH‰EøH‹UèH‹uøH‹EØH‰ÑºH‰Çè±üÿÿH‹EøH‰ÇèõüÿÿH‹EèHÇ@hH‹EèH‰Çè]üÿÿH‹EàH‰Çè1ýÿÿÉÃUH‰åHƒì ‰}ìH‰uàƒ}ì~ƒ}ì~*H‹EàH‹H‹Æ ¾Å@H‰Ç¸ètüÿÿ¿è ýÿÿƒ}ìu H‹• H‰EðëH‹EàHƒÀH‹¾×@H‰ÇèÏüÿÿH‰EðHƒ}ðu(H‹m H‰Áº¾¿Ù@èÆüÿÿ¿è¬üÿÿH‹EàHƒÀH‹H‹EðH‰ÖH‰ÇèÏýÿÿH‰EøH‹ H‹UøH‰ÖH‰Çè8üÿÿH‹ H‹UøH‰ÖH‰ÇèMþÿÿH‹EøH‰ÇèfûÿÿH‹EðH‰Çèjûÿÿ¸ÉÃAWA‰ÿAVI‰öAUI‰ÕATL%¸ UH-¸ SL)å1ÛHÁýHƒìèÍúÿÿH…ít„L‰êL‰öD‰ÿAÿÜHƒÃH9ëuêHƒÄ[]A\A]A^A_Ãff.„óÃHƒìHƒÄÃ[Clan] Error: memory overflow (%s). usage: %s file.c rcannot open input file read_scop_from_c;@úÿÿŒŒûÿÿ\yüÿÿ´'ýÿÿÔíýÿÿôüþÿÿlÿÿÿ\zRx (ûÿÿ*zRx $ˆùÿÿpFJ w€?;*3$"D½ûÿÿ®A†C © dKüÿÿÆA†C Á „ñüÿÿ A†C  D¤àýÿÿeBEŽE E(ŒH0†H8ƒM@l8A0A(B BBBìþÿÿ` @@ @Id©  @ „@à`è`õþÿo˜@@à@ %  ` @ @` þÿÿo€@ÿÿÿoðÿÿo6@ø`F @V @f @v @† @– @¦ @¶ @Æ @Ö @æ @ö @ @ @& @6 @F @V @f @v @† @– @GCC: (Ubuntu 4.8.2-19ubuntu1) 4.8.2.symtab.strtab.shstrtab.interp.note.ABI-tag.note.gnu.build-id.gnu.hash.dynsym.dynstr.gnu.version.gnu.version_r.rela.dyn.rela.plt.init.text.fini.rodata.eh_frame_hdr.eh_frame.init_array.fini_array.jcr.dynamic.got.got.plt.data.bss.comment8@8#T@T 1t@t$Döÿÿo˜@˜DN à@à0V@%^ÿÿÿo6@6Dkþÿÿo€@€ z @ `„ @  Ž @ ‰0 @0 p”  @  âš„@„  @¨@D¶X@X4Àà`àÌè`èØð`ðÝø`øæø`øë ` ÈôÈ `È úà `Ø ÿ0Ø $ü ˆ)p. ø18@T@t@˜@à@@6@€@  @ @  @ 0 @   @„@@@X@à`è`ð`ø`ø` `È `à `ñÿ ð` Ð @. @A @ @Wø `fè` ` @™à`¸ñÿ¾@ñÿ̈@Úð`ñÿæè`÷ø`à` `) €@9 Uà `i È `t’¥è `¸ÆØ `Íá„@çô%È `2G VgÐ `t@ƒ¯ @e¿Ó @®ä!`é   @ðÿØ `  @ 1BU i ;@Æy‹ŸØ `« ÅÚî  @ôð `crtstuff.c__JCR_LIST__deregister_tm_clonesregister_tm_clones__do_global_dtors_auxcompleted.6972__do_global_dtors_aux_fini_array_entryframe_dummy__frame_dummy_init_array_entrypoc.c__func__.7354__FRAME_END____JCR_END____init_array_end_DYNAMIC__init_array_start_GLOBAL_OFFSET_TABLE___libc_csu_fini_ITM_deregisterTMCloneTablestdout@@GLIBC_2.2.5data_startcloog_clast_create_from_inputcloog_options_freestdin@@GLIBC_2.2.5osl_scop_free_edatafclose@@GLIBC_2.2.5_finiclast_pprintclan_options_free__libc_start_main@@GLIBC_2.2.5__data_startfprintf@@GLIBC_2.2.5__gmon_start__cloog_clast_free__dso_handle_IO_stdin_usedcloog_input_from_osl_scopclan_scop_extract__libc_csu_initclan_options_mallocread_scop_from_c_end_startosl_scop_print__bss_startmaincloog_options_copy_from_osl_scopcloog_state_freefopen@@GLIBC_2.2.5_Jv_RegisterClassesprint_scop_to_cexit@@GLIBC_2.2.5fwrite@@GLIBC_2.2.5__TMC_END___ITM_registerTMCloneTablecloog_options_mallocstrdup@@GLIBC_2.2.5_initcloog_state_mallocstderr@@GLIBC_2.2.5cloog-0.18.4/examples/example/0000755000175000017500000000000012555400427013165 500000000000000cloog-0.18.4/examples/example/Makefile0000644000175000017500000000163712413255517014555 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.4/examples/example/example-isl.c0000644000175000017500000000515012413255517015473 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.4/examples/example/example.c0000644000175000017500000000135212413255517014706 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.4/examples/README0000644000175000017500000000557212555404750012346 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. polyhedral_compiler ** # **-------------------------------------------------------------------**/ This example shows a complete source-to-source polyhedral compiler based on the OpenScop polyhedral representation. It requires both the OpenScop and Clan library to be installed, see: - OpenScop: https://github.com/periscop/openscop http://icps.u-strasbg.fr/~bastoul/development/openscop - Clan: https://github.com/periscop/clan http://icps.u-strasbg.fr/~bastoul/development/clan This compiler takes as input a C file with a SCoP inside, raises that SCoP to the OpenScop representation, and converts that representation back to C. Simply add your optimizing algorithm in the middle and you just have an optimizing compiler in the polyhedral model! cloog-0.18.4/Makefile.in0000644000175000017500000022350312555417251011711 00000000000000# Makefile.in generated by automake 1.14.1 from Makefile.am. # @configure_input@ # Copyright (C) 1994-2013 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@ am__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)' am__make_running_with_option = \ case $${target_option-} in \ ?) ;; \ *) echo "am__make_running_with_option: internal error: invalid" \ "target option '$${target_option-}' specified" >&2; \ exit 1;; \ esac; \ has_opt=no; \ sane_makeflags=$$MAKEFLAGS; \ if $(am__is_gnu_make); then \ sane_makeflags=$$MFLAGS; \ else \ case $$MAKEFLAGS in \ *\\[\ \ ]*) \ bs=\\; \ sane_makeflags=`printf '%s\n' "$$MAKEFLAGS" \ | sed "s/$$bs$$bs[$$bs $$bs ]*//g"`;; \ esac; \ fi; \ skip_next=no; \ strip_trailopt () \ { \ flg=`printf '%s\n' "$$flg" | sed "s/$$1.*$$//"`; \ }; \ for flg in $$sane_makeflags; do \ test $$skip_next = yes && { skip_next=no; continue; }; \ case $$flg in \ *=*|--*) continue;; \ -*I) strip_trailopt 'I'; skip_next=yes;; \ -*I?*) strip_trailopt 'I';; \ -*O) strip_trailopt 'O'; skip_next=yes;; \ -*O?*) strip_trailopt 'O';; \ -*l) strip_trailopt 'l'; skip_next=yes;; \ -*l?*) strip_trailopt 'l';; \ -[dEDm]) skip_next=yes;; \ -[JT]) skip_next=yes;; \ esac; \ case $$flg in \ *$$target_option*) has_opt=yes; break;; \ esac; \ done; \ test $$has_opt = yes am__make_dryrun = (target_option=n; $(am__make_running_with_option)) am__make_keepgoing = (target_option=k; $(am__make_running_with_option)) 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 = $(srcdir)/Makefile.in $(srcdir)/Makefile.am \ $(top_srcdir)/configure $(am__configure_deps) \ $(top_srcdir)/autoconf/Doxyfile.in \ $(top_srcdir)/source/version.c.in \ $(top_srcdir)/include/cloog/version.h.in \ $(srcdir)/genversion.sh.in $(top_srcdir)/autoconf/depcomp \ $(pkginclude_HEADERS) $(pkgislinclude_HEADERS) \ $(pkgmatrixinclude_HEADERS) ChangeLog README autoconf/compile \ autoconf/config.guess autoconf/config.sub autoconf/depcomp \ autoconf/install-sh autoconf/missing autoconf/ltmain.sh \ $(top_srcdir)/autoconf/compile \ $(top_srcdir)/autoconf/config.guess \ $(top_srcdir)/autoconf/config.sub \ $(top_srcdir)/autoconf/install-sh \ $(top_srcdir)/autoconf/ltmain.sh \ $(top_srcdir)/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/util.c source/version.c source/isl/domain.c \ source/isl/constraints.c source/isl/backend.c am__dirstamp = $(am__leading_dot)dirstamp @NEED_GET_MEMORY_FUNCTIONS_TRUE@am__objects_1 = source/libcloog_isl_la-mp_get_memory_functions.lo am__objects_2 = $(am__objects_1) source/libcloog_isl_la-block.lo \ source/libcloog_isl_la-clast.lo \ source/libcloog_isl_la-matrix.lo \ source/libcloog_isl_la-state.lo \ source/libcloog_isl_la-input.lo source/libcloog_isl_la-int.lo \ source/libcloog_isl_la-loop.lo source/libcloog_isl_la-names.lo \ source/libcloog_isl_la-options.lo \ source/libcloog_isl_la-pprint.lo \ source/libcloog_isl_la-program.lo \ source/libcloog_isl_la-statement.lo \ source/libcloog_isl_la-stride.lo \ source/libcloog_isl_la-union_domain.lo \ source/libcloog_isl_la-util.lo \ source/libcloog_isl_la-version.lo am_libcloog_isl_la_OBJECTS = $(am__objects_2) \ source/isl/libcloog_isl_la-domain.lo \ source/isl/libcloog_isl_la-constraints.lo \ source/isl/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 am__v_lt_1 = 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 = source/cloog.$(OBJEXT) cloog_OBJECTS = $(am_cloog_OBJECTS) cloog_LDADD = $(LDADD) AM_V_P = $(am__v_P_@AM_V@) am__v_P_ = $(am__v_P_@AM_DEFAULT_V@) am__v_P_0 = false am__v_P_1 = : 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_GEN_1 = AM_V_at = $(am__v_at_@AM_V@) am__v_at_ = $(am__v_at_@AM_DEFAULT_V@) am__v_at_0 = @ am__v_at_1 = 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_CC_1 = 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_CCLD_1 = SOURCES = $(libcloog_isl_la_SOURCES) $(cloog_SOURCES) DIST_SOURCES = $(am__libcloog_isl_la_SOURCES_DIST) $(cloog_SOURCES) RECURSIVE_TARGETS = all-recursive check-recursive cscopelist-recursive \ ctags-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 \ tags-recursive uninstall-recursive am__can_run_installinfo = \ case $$AM_UPDATE_INFO_DIR in \ n|no|NO) false;; \ *) (install-info --version) >/dev/null 2>&1;; \ esac 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_CLEAN_TARGETS) \ $(am__extra_recursive_targets) AM_RECURSIVE_TARGETS = $(am__recursive_targets:-recursive=) TAGS CTAGS \ cscope distdir dist dist-all distcheck am__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP) # Read a list of newline-separated strings from the standard input, # and print each of them once, without duplicates. Input order is # *not* preserved. am__uniquify_input = $(AWK) '\ BEGIN { nonempty = 0; } \ { items[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in items) print i; }; } \ ' # Make sure the list of sources is unique. This is necessary because, # e.g., the same source file might be shared among _SOURCES variables # for different programs/libraries. am__define_uniq_tagged_files = \ list='$(am__tagged_files)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | $(am__uniquify_input)` ETAGS = etags CTAGS = ctags CSCOPE = cscope 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__post_remove_distdir = $(am__remove_distdir) 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 DIST_TARGETS = dist-gzip 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 AUTOMAKE_OPTIONS = subdir-objects 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/util.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/util.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 \ cmake \ 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) @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 " $(MKDIR_P) '$(DESTDIR)$(libdir)'"; \ $(MKDIR_P) "$(DESTDIR)$(libdir)" || exit 1; \ 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)'; \ locs=`for p in $$list; do echo $$p; done | \ sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \ sort -u`; \ test -z "$$locs" || { \ echo rm -f $${locs}; \ rm -f $${locs}; \ } source/$(am__dirstamp): @$(MKDIR_P) source @: > source/$(am__dirstamp) source/$(DEPDIR)/$(am__dirstamp): @$(MKDIR_P) source/$(DEPDIR) @: > source/$(DEPDIR)/$(am__dirstamp) source/libcloog_isl_la-mp_get_memory_functions.lo: \ source/$(am__dirstamp) source/$(DEPDIR)/$(am__dirstamp) source/libcloog_isl_la-block.lo: source/$(am__dirstamp) \ source/$(DEPDIR)/$(am__dirstamp) source/libcloog_isl_la-clast.lo: source/$(am__dirstamp) \ source/$(DEPDIR)/$(am__dirstamp) source/libcloog_isl_la-matrix.lo: source/$(am__dirstamp) \ source/$(DEPDIR)/$(am__dirstamp) source/libcloog_isl_la-state.lo: source/$(am__dirstamp) \ source/$(DEPDIR)/$(am__dirstamp) source/libcloog_isl_la-input.lo: source/$(am__dirstamp) \ source/$(DEPDIR)/$(am__dirstamp) source/libcloog_isl_la-int.lo: source/$(am__dirstamp) \ source/$(DEPDIR)/$(am__dirstamp) source/libcloog_isl_la-loop.lo: source/$(am__dirstamp) \ source/$(DEPDIR)/$(am__dirstamp) source/libcloog_isl_la-names.lo: source/$(am__dirstamp) \ source/$(DEPDIR)/$(am__dirstamp) source/libcloog_isl_la-options.lo: source/$(am__dirstamp) \ source/$(DEPDIR)/$(am__dirstamp) source/libcloog_isl_la-pprint.lo: source/$(am__dirstamp) \ source/$(DEPDIR)/$(am__dirstamp) source/libcloog_isl_la-program.lo: source/$(am__dirstamp) \ source/$(DEPDIR)/$(am__dirstamp) source/libcloog_isl_la-statement.lo: source/$(am__dirstamp) \ source/$(DEPDIR)/$(am__dirstamp) source/libcloog_isl_la-stride.lo: source/$(am__dirstamp) \ source/$(DEPDIR)/$(am__dirstamp) source/libcloog_isl_la-union_domain.lo: source/$(am__dirstamp) \ source/$(DEPDIR)/$(am__dirstamp) source/libcloog_isl_la-util.lo: source/$(am__dirstamp) \ source/$(DEPDIR)/$(am__dirstamp) source/libcloog_isl_la-version.lo: source/$(am__dirstamp) \ source/$(DEPDIR)/$(am__dirstamp) source/isl/$(am__dirstamp): @$(MKDIR_P) source/isl @: > source/isl/$(am__dirstamp) source/isl/$(DEPDIR)/$(am__dirstamp): @$(MKDIR_P) source/isl/$(DEPDIR) @: > source/isl/$(DEPDIR)/$(am__dirstamp) source/isl/libcloog_isl_la-domain.lo: source/isl/$(am__dirstamp) \ source/isl/$(DEPDIR)/$(am__dirstamp) source/isl/libcloog_isl_la-constraints.lo: source/isl/$(am__dirstamp) \ source/isl/$(DEPDIR)/$(am__dirstamp) source/isl/libcloog_isl_la-backend.lo: source/isl/$(am__dirstamp) \ source/isl/$(DEPDIR)/$(am__dirstamp) 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) @list='$(bin_PROGRAMS)'; test -n "$(bindir)" || list=; \ if test -n "$$list"; then \ echo " $(MKDIR_P) '$(DESTDIR)$(bindir)'"; \ $(MKDIR_P) "$(DESTDIR)$(bindir)" || exit 1; \ fi; \ 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 source/cloog.$(OBJEXT): source/$(am__dirstamp) \ source/$(DEPDIR)/$(am__dirstamp) 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) -rm -f source/*.$(OBJEXT) -rm -f source/*.lo -rm -f source/isl/*.$(OBJEXT) -rm -f source/isl/*.lo distclean-compile: -rm -f *.tab.c @AMDEP_TRUE@@am__include@ @am__quote@source/$(DEPDIR)/cloog.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/$(DEPDIR)/libcloog_isl_la-block.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/$(DEPDIR)/libcloog_isl_la-clast.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/$(DEPDIR)/libcloog_isl_la-input.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/$(DEPDIR)/libcloog_isl_la-int.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/$(DEPDIR)/libcloog_isl_la-loop.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/$(DEPDIR)/libcloog_isl_la-matrix.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/$(DEPDIR)/libcloog_isl_la-mp_get_memory_functions.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/$(DEPDIR)/libcloog_isl_la-names.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/$(DEPDIR)/libcloog_isl_la-options.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/$(DEPDIR)/libcloog_isl_la-pprint.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/$(DEPDIR)/libcloog_isl_la-program.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/$(DEPDIR)/libcloog_isl_la-state.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/$(DEPDIR)/libcloog_isl_la-statement.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/$(DEPDIR)/libcloog_isl_la-stride.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/$(DEPDIR)/libcloog_isl_la-union_domain.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/$(DEPDIR)/libcloog_isl_la-util.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/$(DEPDIR)/libcloog_isl_la-version.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/isl/$(DEPDIR)/libcloog_isl_la-backend.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/isl/$(DEPDIR)/libcloog_isl_la-constraints.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@source/isl/$(DEPDIR)/libcloog_isl_la-domain.Plo@am__quote@ .c.o: @am__fastdepCC_TRUE@ $(AM_V_CC)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\.o$$||'`;\ @am__fastdepCC_TRUE@ $(COMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\ @am__fastdepCC_TRUE@ $(am__mv) $$depbase.Tpo $$depbase.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 -o $@ $< .c.obj: @am__fastdepCC_TRUE@ $(AM_V_CC)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\.obj$$||'`;\ @am__fastdepCC_TRUE@ $(COMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\ @am__fastdepCC_TRUE@ $(am__mv) $$depbase.Tpo $$depbase.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 -o $@ `$(CYGPATH_W) '$<'` .c.lo: @am__fastdepCC_TRUE@ $(AM_V_CC)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\.lo$$||'`;\ @am__fastdepCC_TRUE@ $(LTCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\ @am__fastdepCC_TRUE@ $(am__mv) $$depbase.Tpo $$depbase.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 $@ $< source/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 source/libcloog_isl_la-mp_get_memory_functions.lo -MD -MP -MF source/$(DEPDIR)/libcloog_isl_la-mp_get_memory_functions.Tpo -c -o source/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) source/$(DEPDIR)/libcloog_isl_la-mp_get_memory_functions.Tpo source/$(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='source/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 source/libcloog_isl_la-mp_get_memory_functions.lo `test -f 'source/mp_get_memory_functions.c' || echo '$(srcdir)/'`source/mp_get_memory_functions.c source/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 source/libcloog_isl_la-block.lo -MD -MP -MF source/$(DEPDIR)/libcloog_isl_la-block.Tpo -c -o source/libcloog_isl_la-block.lo `test -f 'source/block.c' || echo '$(srcdir)/'`source/block.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/$(DEPDIR)/libcloog_isl_la-block.Tpo source/$(DEPDIR)/libcloog_isl_la-block.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/block.c' object='source/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 source/libcloog_isl_la-block.lo `test -f 'source/block.c' || echo '$(srcdir)/'`source/block.c source/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 source/libcloog_isl_la-clast.lo -MD -MP -MF source/$(DEPDIR)/libcloog_isl_la-clast.Tpo -c -o source/libcloog_isl_la-clast.lo `test -f 'source/clast.c' || echo '$(srcdir)/'`source/clast.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/$(DEPDIR)/libcloog_isl_la-clast.Tpo source/$(DEPDIR)/libcloog_isl_la-clast.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/clast.c' object='source/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 source/libcloog_isl_la-clast.lo `test -f 'source/clast.c' || echo '$(srcdir)/'`source/clast.c source/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 source/libcloog_isl_la-matrix.lo -MD -MP -MF source/$(DEPDIR)/libcloog_isl_la-matrix.Tpo -c -o source/libcloog_isl_la-matrix.lo `test -f 'source/matrix.c' || echo '$(srcdir)/'`source/matrix.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/$(DEPDIR)/libcloog_isl_la-matrix.Tpo source/$(DEPDIR)/libcloog_isl_la-matrix.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/matrix.c' object='source/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 source/libcloog_isl_la-matrix.lo `test -f 'source/matrix.c' || echo '$(srcdir)/'`source/matrix.c source/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 source/libcloog_isl_la-state.lo -MD -MP -MF source/$(DEPDIR)/libcloog_isl_la-state.Tpo -c -o source/libcloog_isl_la-state.lo `test -f 'source/state.c' || echo '$(srcdir)/'`source/state.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/$(DEPDIR)/libcloog_isl_la-state.Tpo source/$(DEPDIR)/libcloog_isl_la-state.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/state.c' object='source/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 source/libcloog_isl_la-state.lo `test -f 'source/state.c' || echo '$(srcdir)/'`source/state.c source/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 source/libcloog_isl_la-input.lo -MD -MP -MF source/$(DEPDIR)/libcloog_isl_la-input.Tpo -c -o source/libcloog_isl_la-input.lo `test -f 'source/input.c' || echo '$(srcdir)/'`source/input.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/$(DEPDIR)/libcloog_isl_la-input.Tpo source/$(DEPDIR)/libcloog_isl_la-input.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/input.c' object='source/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 source/libcloog_isl_la-input.lo `test -f 'source/input.c' || echo '$(srcdir)/'`source/input.c source/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 source/libcloog_isl_la-int.lo -MD -MP -MF source/$(DEPDIR)/libcloog_isl_la-int.Tpo -c -o source/libcloog_isl_la-int.lo `test -f 'source/int.c' || echo '$(srcdir)/'`source/int.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/$(DEPDIR)/libcloog_isl_la-int.Tpo source/$(DEPDIR)/libcloog_isl_la-int.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/int.c' object='source/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 source/libcloog_isl_la-int.lo `test -f 'source/int.c' || echo '$(srcdir)/'`source/int.c source/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 source/libcloog_isl_la-loop.lo -MD -MP -MF source/$(DEPDIR)/libcloog_isl_la-loop.Tpo -c -o source/libcloog_isl_la-loop.lo `test -f 'source/loop.c' || echo '$(srcdir)/'`source/loop.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/$(DEPDIR)/libcloog_isl_la-loop.Tpo source/$(DEPDIR)/libcloog_isl_la-loop.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/loop.c' object='source/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 source/libcloog_isl_la-loop.lo `test -f 'source/loop.c' || echo '$(srcdir)/'`source/loop.c source/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 source/libcloog_isl_la-names.lo -MD -MP -MF source/$(DEPDIR)/libcloog_isl_la-names.Tpo -c -o source/libcloog_isl_la-names.lo `test -f 'source/names.c' || echo '$(srcdir)/'`source/names.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/$(DEPDIR)/libcloog_isl_la-names.Tpo source/$(DEPDIR)/libcloog_isl_la-names.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/names.c' object='source/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 source/libcloog_isl_la-names.lo `test -f 'source/names.c' || echo '$(srcdir)/'`source/names.c source/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 source/libcloog_isl_la-options.lo -MD -MP -MF source/$(DEPDIR)/libcloog_isl_la-options.Tpo -c -o source/libcloog_isl_la-options.lo `test -f 'source/options.c' || echo '$(srcdir)/'`source/options.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/$(DEPDIR)/libcloog_isl_la-options.Tpo source/$(DEPDIR)/libcloog_isl_la-options.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/options.c' object='source/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 source/libcloog_isl_la-options.lo `test -f 'source/options.c' || echo '$(srcdir)/'`source/options.c source/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 source/libcloog_isl_la-pprint.lo -MD -MP -MF source/$(DEPDIR)/libcloog_isl_la-pprint.Tpo -c -o source/libcloog_isl_la-pprint.lo `test -f 'source/pprint.c' || echo '$(srcdir)/'`source/pprint.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/$(DEPDIR)/libcloog_isl_la-pprint.Tpo source/$(DEPDIR)/libcloog_isl_la-pprint.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/pprint.c' object='source/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 source/libcloog_isl_la-pprint.lo `test -f 'source/pprint.c' || echo '$(srcdir)/'`source/pprint.c source/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 source/libcloog_isl_la-program.lo -MD -MP -MF source/$(DEPDIR)/libcloog_isl_la-program.Tpo -c -o source/libcloog_isl_la-program.lo `test -f 'source/program.c' || echo '$(srcdir)/'`source/program.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/$(DEPDIR)/libcloog_isl_la-program.Tpo source/$(DEPDIR)/libcloog_isl_la-program.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/program.c' object='source/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 source/libcloog_isl_la-program.lo `test -f 'source/program.c' || echo '$(srcdir)/'`source/program.c source/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 source/libcloog_isl_la-statement.lo -MD -MP -MF source/$(DEPDIR)/libcloog_isl_la-statement.Tpo -c -o source/libcloog_isl_la-statement.lo `test -f 'source/statement.c' || echo '$(srcdir)/'`source/statement.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/$(DEPDIR)/libcloog_isl_la-statement.Tpo source/$(DEPDIR)/libcloog_isl_la-statement.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/statement.c' object='source/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 source/libcloog_isl_la-statement.lo `test -f 'source/statement.c' || echo '$(srcdir)/'`source/statement.c source/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 source/libcloog_isl_la-stride.lo -MD -MP -MF source/$(DEPDIR)/libcloog_isl_la-stride.Tpo -c -o source/libcloog_isl_la-stride.lo `test -f 'source/stride.c' || echo '$(srcdir)/'`source/stride.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/$(DEPDIR)/libcloog_isl_la-stride.Tpo source/$(DEPDIR)/libcloog_isl_la-stride.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/stride.c' object='source/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 source/libcloog_isl_la-stride.lo `test -f 'source/stride.c' || echo '$(srcdir)/'`source/stride.c source/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 source/libcloog_isl_la-union_domain.lo -MD -MP -MF source/$(DEPDIR)/libcloog_isl_la-union_domain.Tpo -c -o source/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) source/$(DEPDIR)/libcloog_isl_la-union_domain.Tpo source/$(DEPDIR)/libcloog_isl_la-union_domain.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/union_domain.c' object='source/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 source/libcloog_isl_la-union_domain.lo `test -f 'source/union_domain.c' || echo '$(srcdir)/'`source/union_domain.c source/libcloog_isl_la-util.lo: source/util.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 source/libcloog_isl_la-util.lo -MD -MP -MF source/$(DEPDIR)/libcloog_isl_la-util.Tpo -c -o source/libcloog_isl_la-util.lo `test -f 'source/util.c' || echo '$(srcdir)/'`source/util.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/$(DEPDIR)/libcloog_isl_la-util.Tpo source/$(DEPDIR)/libcloog_isl_la-util.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/util.c' object='source/libcloog_isl_la-util.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 source/libcloog_isl_la-util.lo `test -f 'source/util.c' || echo '$(srcdir)/'`source/util.c source/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 source/libcloog_isl_la-version.lo -MD -MP -MF source/$(DEPDIR)/libcloog_isl_la-version.Tpo -c -o source/libcloog_isl_la-version.lo `test -f 'source/version.c' || echo '$(srcdir)/'`source/version.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) source/$(DEPDIR)/libcloog_isl_la-version.Tpo source/$(DEPDIR)/libcloog_isl_la-version.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/version.c' object='source/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 source/libcloog_isl_la-version.lo `test -f 'source/version.c' || echo '$(srcdir)/'`source/version.c source/isl/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 source/isl/libcloog_isl_la-domain.lo -MD -MP -MF source/isl/$(DEPDIR)/libcloog_isl_la-domain.Tpo -c -o source/isl/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) source/isl/$(DEPDIR)/libcloog_isl_la-domain.Tpo source/isl/$(DEPDIR)/libcloog_isl_la-domain.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/isl/domain.c' object='source/isl/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 source/isl/libcloog_isl_la-domain.lo `test -f 'source/isl/domain.c' || echo '$(srcdir)/'`source/isl/domain.c source/isl/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 source/isl/libcloog_isl_la-constraints.lo -MD -MP -MF source/isl/$(DEPDIR)/libcloog_isl_la-constraints.Tpo -c -o source/isl/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) source/isl/$(DEPDIR)/libcloog_isl_la-constraints.Tpo source/isl/$(DEPDIR)/libcloog_isl_la-constraints.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/isl/constraints.c' object='source/isl/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 source/isl/libcloog_isl_la-constraints.lo `test -f 'source/isl/constraints.c' || echo '$(srcdir)/'`source/isl/constraints.c source/isl/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 source/isl/libcloog_isl_la-backend.lo -MD -MP -MF source/isl/$(DEPDIR)/libcloog_isl_la-backend.Tpo -c -o source/isl/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) source/isl/$(DEPDIR)/libcloog_isl_la-backend.Tpo source/isl/$(DEPDIR)/libcloog_isl_la-backend.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/isl/backend.c' object='source/isl/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 source/isl/libcloog_isl_la-backend.lo `test -f 'source/isl/backend.c' || echo '$(srcdir)/'`source/isl/backend.c mostlyclean-libtool: -rm -f *.lo clean-libtool: -rm -rf .libs _libs -rm -rf source/.libs source/_libs -rm -rf source/isl/.libs source/isl/_libs distclean-libtool: -rm -f libtool config.lt install-pkgincludeHEADERS: $(pkginclude_HEADERS) @$(NORMAL_INSTALL) @list='$(pkginclude_HEADERS)'; test -n "$(pkgincludedir)" || list=; \ if test -n "$$list"; then \ echo " $(MKDIR_P) '$(DESTDIR)$(pkgincludedir)'"; \ $(MKDIR_P) "$(DESTDIR)$(pkgincludedir)" || exit 1; \ fi; \ 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) @list='$(pkgislinclude_HEADERS)'; test -n "$(pkgislincludedir)" || list=; \ if test -n "$$list"; then \ echo " $(MKDIR_P) '$(DESTDIR)$(pkgislincludedir)'"; \ $(MKDIR_P) "$(DESTDIR)$(pkgislincludedir)" || exit 1; \ fi; \ 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) @list='$(pkgmatrixinclude_HEADERS)'; test -n "$(pkgmatrixincludedir)" || list=; \ if test -n "$$list"; then \ echo " $(MKDIR_P) '$(DESTDIR)$(pkgmatrixincludedir)'"; \ $(MKDIR_P) "$(DESTDIR)$(pkgmatrixincludedir)" || exit 1; \ fi; \ 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. $(am__recursive_targets): @fail=; \ if $(am__make_keepgoing); then \ failcom='fail=yes'; \ else \ failcom='exit 1'; \ fi; \ dot_seen=no; \ target=`echo $@ | sed s/-recursive//`; \ case "$@" in \ distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \ *) list='$(SUBDIRS)' ;; \ esac; \ 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" ID: $(am__tagged_files) $(am__define_uniq_tagged_files); mkid -fID $$unique tags: tags-recursive TAGS: tags tags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files) 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; \ $(am__define_uniq_tagged_files); \ 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-recursive CTAGS: ctags ctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files) $(am__define_uniq_tagged_files); \ 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" cscope: cscope.files test ! -s cscope.files \ || $(CSCOPE) -b -q $(AM_CSCOPEFLAGS) $(CSCOPEFLAGS) -i cscope.files $(CSCOPE_ARGS) clean-cscope: -rm -f cscope.files cscope.files: clean-cscope cscopelist cscopelist: cscopelist-recursive cscopelist-am: $(am__tagged_files) list='$(am__tagged_files)'; \ case "$(srcdir)" in \ [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \ *) sdir=$(subdir)/$(srcdir) ;; \ esac; \ for i in $$list; do \ if test -f "$$i"; then \ echo "$(subdir)/$$i"; \ else \ echo "$$sdir/$$i"; \ fi; \ done >> $(top_builddir)/cscope.files distclean-tags: -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags -rm -f cscope.out cscope.in.out cscope.po.out cscope.files 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 \ $(am__make_dryrun) \ || test -d "$(distdir)/$$subdir" \ || $(MKDIR_P) "$(distdir)/$$subdir" \ || exit 1; \ 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__post_remove_distdir) dist-bzip2: distdir tardir=$(distdir) && $(am__tar) | BZIP2=$${BZIP2--9} bzip2 -c >$(distdir).tar.bz2 $(am__post_remove_distdir) dist-lzip: distdir tardir=$(distdir) && $(am__tar) | lzip -c $${LZIP_OPT--9} >$(distdir).tar.lz $(am__post_remove_distdir) dist-xz: distdir tardir=$(distdir) && $(am__tar) | XZ_OPT=$${XZ_OPT--e} xz -c >$(distdir).tar.xz $(am__post_remove_distdir) dist-tarZ: distdir @echo WARNING: "Support for shar distribution archives is" \ "deprecated." >&2 @echo WARNING: "It will be removed altogether in Automake 2.0" >&2 tardir=$(distdir) && $(am__tar) | compress -c >$(distdir).tar.Z $(am__post_remove_distdir) dist-shar: distdir @echo WARNING: "Support for distribution archives compressed with" \ "legacy program 'compress' is deprecated." >&2 @echo WARNING: "It will be removed altogether in Automake 2.0" >&2 shar $(distdir) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).shar.gz $(am__post_remove_distdir) dist-zip: distdir -rm -f $(distdir).zip zip -rq $(distdir).zip $(distdir) $(am__post_remove_distdir) dist dist-all: $(MAKE) $(AM_MAKEFLAGS) $(DIST_TARGETS) am__post_remove_distdir='@:' $(am__post_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.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 u+w $(distdir) mkdir $(distdir)/_build $(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 \ $(AM_DISTCHECK_CONFIGURE_FLAGS) \ $(DISTCHECK_CONFIGURE_FLAGS) \ --srcdir=.. --prefix="$$dc_install_base" \ && $(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__post_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) -rm -f source/$(DEPDIR)/$(am__dirstamp) -rm -f source/$(am__dirstamp) -rm -f source/isl/$(DEPDIR)/$(am__dirstamp) -rm -f source/isl/$(am__dirstamp) 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 source/$(DEPDIR) source/isl/$(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 source/$(DEPDIR) source/isl/$(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: $(am__recursive_targets) install-am install-strip .PHONY: $(am__recursive_targets) CTAGS GTAGS TAGS all all-am \ am--refresh check check-am clean clean-binPROGRAMS \ clean-cscope clean-generic clean-libLTLIBRARIES clean-libtool \ cscope cscopelist-am ctags ctags-am dist dist-all dist-bzip2 \ dist-gzip dist-hook dist-lzip 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-am 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)" rm -f "$(DESTDIR)$(libdir)/isl/isl-config.cmake" rm -f "$(DESTDIR)$(libdir)/$(PACKAGE_NAME)/cloog-isl-config.cmake" 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) test_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.4/doc/0000755000175000017500000000000012555417260010464 500000000000000cloog-0.18.4/doc/cloog.texi0000644000175000017500000027622512555413051012412 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.2 @include gitversion.texi @set UPDATED July 27th 2015 @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-2014 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. @item @emph{loop} to add loop decorations such as OpenMP or vectorization pragmas. @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:: * Source to Source Compiler:: @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 @node Source to Source Compiler @subsection Source to Source Compiler Here is an example of a source (to polyhedra) to source compiler. It uses the Clan library to raise a SCoP from C to the OpenScop representation, and CLooG to translate back the SCoP to C. You may analyze the polyhedral representation and apply optimizing transformation to that representation to build your own high-level optimizing compiler. That example requires to install Clan, OpenScop and to build CLooG with the OpenScop support. This example is provided in the @code{example} directory of the CLooG distribution. @example /* poc.c A complete C to polyhedra to C compiler */ #include #include #include #include /* Use the Clan library to convert a SCoP from C to OpenScop */ osl_scop_p read_scop_from_c(FILE* input, char* input_name) @{ clan_options_p clanoptions; osl_scop_p scop; clanoptions = clan_options_malloc(); clanoptions->precision = OSL_PRECISION_MP; CLAN_strdup(clanoptions->name, input_name); scop = clan_scop_extract(input, clanoptions); clan_options_free(clanoptions); return scop; @} /* Use the CLooG library to output a SCoP from OpenScop to C */ void print_scop_to_c(FILE* output, osl_scop_p scop) @{ CloogState* state; CloogOptions* options; CloogInput* input; struct clast_stmt* clast; state = cloog_state_malloc(); options = cloog_options_malloc(state); options->openscop = 1; cloog_options_copy_from_osl_scop(scop, options); input = cloog_input_from_osl_scop(options->state, scop); clast = cloog_clast_create_from_input(input, options); clast_pprint(output, clast, 0, options); cloog_clast_free(clast); options->scop = NULL; // don't free the scop cloog_options_free(options); cloog_state_free(state); // the input is freed inside @} int main(int argc, char* argv[]) @{ osl_scop_p scop; FILE* input; if ((argc < 2) || (argc > 2)) @{ fprintf(stderr, "usage: %s file.c\n", argv[0]); exit(0); @} if (argc == 1) input = stdin; else input = fopen(argv[1], "r"); if (input == NULL) @{ fprintf(stderr, "cannot open input file\n"); exit(0); @} scop = read_scop_from_c(input, argv[1]); osl_scop_print(stdout, scop); // UPDATE THE SCOP IN A SMART WAY HERE print_scop_to_c(stdout, scop); osl_scop_free(scop); fclose(input); return 0; @} @end example @noindent The compilation (with default isl/GMP with OpenScop support version installed, along with the OpenScop library and Clan library) command could be: @example gcc -DCLOOG_INT_GMP poc.c -lcloog-isl -lclan -losl -o poc @end example @noindent A calling command could be: @example ./poc scop.c @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.4/doc/Makefile.am0000644000175000017500000000025512413255517012440 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.4/doc/images/0000755000175000017500000000000012511231702011714 500000000000000cloog-0.18.4/doc/images/basic.fig0000644000175000017500000001045112413255517013420 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.4/doc/images/basic.jpg0000644000175000017500000005127412413255517013443 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.4/doc/images/basic.pdf0000644000175000017500000011621112413255517013425 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.4/doc/images/tree.jpg0000644000175000017500000003262112413255517013314 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.4/doc/images/tree.eps0000644000175000017500000001453012413255517013322 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.4/doc/images/tree.fig0000644000175000017500000000354012413255517013277 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.4/doc/images/tree.pdf0000644000175000017500000001071612413255517013306 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.4/doc/images/tree.txt0000644000175000017500000000054312413255517013351 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.4/doc/images/basic.txt0000644000175000017500000000035412413255517013473 00000000000000 j^ i>=2 | | j<=n+2-i | |\ | i<=n | | \ | m-+-****---+-j<=m | ***** | | ****** | | *******| 2-+-********-j>=2 | | |\ 0-+-+------+--->i | | | 0 2 n cloog-0.18.4/doc/images/basic.eps0000644000175000017500000002701612413255517013447 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.4/doc/TODO0000644000175000017500000000453712413255517011103 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.4/doc/Makefile.in0000644000175000017500000003052712555417251012460 00000000000000# Makefile.in generated by automake 1.14.1 from Makefile.am. # @configure_input@ # Copyright (C) 1994-2013 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@ am__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)' am__make_running_with_option = \ case $${target_option-} in \ ?) ;; \ *) echo "am__make_running_with_option: internal error: invalid" \ "target option '$${target_option-}' specified" >&2; \ exit 1;; \ esac; \ has_opt=no; \ sane_makeflags=$$MAKEFLAGS; \ if $(am__is_gnu_make); then \ sane_makeflags=$$MFLAGS; \ else \ case $$MAKEFLAGS in \ *\\[\ \ ]*) \ bs=\\; \ sane_makeflags=`printf '%s\n' "$$MAKEFLAGS" \ | sed "s/$$bs$$bs[$$bs $$bs ]*//g"`;; \ esac; \ fi; \ skip_next=no; \ strip_trailopt () \ { \ flg=`printf '%s\n' "$$flg" | sed "s/$$1.*$$//"`; \ }; \ for flg in $$sane_makeflags; do \ test $$skip_next = yes && { skip_next=no; continue; }; \ case $$flg in \ *=*|--*) continue;; \ -*I) strip_trailopt 'I'; skip_next=yes;; \ -*I?*) strip_trailopt 'I';; \ -*O) strip_trailopt 'O'; skip_next=yes;; \ -*O?*) strip_trailopt 'O';; \ -*l) strip_trailopt 'l'; skip_next=yes;; \ -*l?*) strip_trailopt 'l';; \ -[dEDm]) skip_next=yes;; \ -[JT]) skip_next=yes;; \ esac; \ case $$flg in \ *$$target_option*) has_opt=yes; break;; \ esac; \ done; \ test $$has_opt = yes am__make_dryrun = (target_option=n; $(am__make_running_with_option)) am__make_keepgoing = (target_option=k; $(am__make_running_with_option)) 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.in $(srcdir)/Makefile.am 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_P = $(am__v_P_@AM_V@) am__v_P_ = $(am__v_P_@AM_DEFAULT_V@) am__v_P_0 = false am__v_P_1 = : 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_GEN_1 = AM_V_at = $(am__v_at_@AM_V@) am__v_at_ = $(am__v_at_@AM_DEFAULT_V@) am__v_at_0 = @ am__v_at_1 = SOURCES = DIST_SOURCES = am__can_run_installinfo = \ case $$AM_UPDATE_INFO_DIR in \ n|no|NO) false;; \ *) (install-info --version) >/dev/null 2>&1;; \ esac am__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP) 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: ctags CTAGS: cscope cscopelist: 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 \ cscopelist-am ctags-am 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 \ tags-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.4/doc/cloog.pdf0000644000175000017500000106235112555417260012212 00000000000000%PDF-1.5 %ÐÔÅØ 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 342 /Filter /FlateDecode >> stream xÚ‘=OÃ0†÷ü ¶„ÏgÇöHQ[©bà#0¤MÒF* „tè¿ÇŽÄ€ò`Ÿu÷¼wï‘áñ’XDáµ#»·LN¿Ãž¤Çã:ƒKžFî?SxÌáðªÜª‰·(²ë•5DI‘gHÑÄžLÂ礨È3½½ëG ýš½›lYdߤ˜j‚¢Ÿc! ¡&MöøÆÂK‘ CŒVBc’¸ ˆ4 )Gû÷®ë®ʱb¨éŠ9MçàiWv]ÛíSæ=‹eÇ󡮆2vI‚ Îú`‡Þ¨¤²¬Ú±í»T¢u•ÞÍLFU6Ž:ÅR€šoÕV7Ö&p0Êåx!C"oNÇókÇCªUL¬˜Ü-Pç*NÏ1x«tX•–680»Ì”¡/R!3èhÍ8Ðjhwe ]0 åçØŸŽ¿®$ ü¹ƒ°>ó¾E!‰î endstream endobj 13 0 obj << /Length 1504 /Filter /FlateDecode >> stream xÚVmoÛ6þž_¡|ª Xª¨K0l©ë¦)ÚÂhÜÛº´LY\%JÕK7ÈߊíD(¦x¼;Þ=÷FfyðcVêYq¸i˜XYuáij»·èãÓõ3|aàÃúS'ò}Ë9ÑöjsñòMYÌsS/eÖ&Çë‹ØMÓÈÚ쬿í/^äÝŠ¦ÕÌOìíÌÑÎœ lßóœ³Ù?›w gqªÇ³–ºÌOHÍò‹ç³Èl±keFò¯x××CiÄÏ̈bw—EŒ4Ü.ß®^~¿ºYÙ׫«OW³$°7+¢\^^Îœ0íÚÿ;t=})!vôÕ×´ò¦)†T€kðåÛªFï渋í»B´‚2®ˆ×hþâ±PíÐlí扑œÛ×'úß-3;aX„-ïk ehÿv9¢c`8rÍ0­áàCßJÆÿÂïmUU.ä膿Hí\p¸Ý=À€÷D“9­„¢èø7€ü¶®®D_Hµ§mcÜEøf~ ’£•x$T=ì‹92ø£Ö¥9,8¾k¢`€p½ke/Î&/dOÎPìcvÛ(³Ëœ4Ž#p¾Kê“è¦ø¿ˆí ÈŸ—D£³ÄÎ1"HX¾7A¼¦ý÷™ÎüNÖŠ8=—%nèlým˜Ç1xabsWçý#ó©wd>P R`R@«Js_cöhÉDŠuJ#2fÿåìËC•Å!‹8_1 È »9V3þÄäóí¦¥ýnÈ´@â$r’©¸ý.;Ù?^(ø£ ¨]¡ƒ½Ø·G 4t‰9 ZÓʧü!%ÄkÃ[ùÕÊX·a”ŽZN&,=ˆéFhx‡–{é¡“cG˜\¸ŽY¢Ò\Õ”Þm][yD[nظ:ªzžœi¢!¥l4ý€2¼=ÐN@ÿXdRŒ…õŸ™`÷QïÂe!é½A&ŸQBÃÄŽâ{c3¦³oŒ¦•jGDÝî`mE®{¶¥nòº,©bul‘Ôp™xutõJ¥r Í°-eÆ{5}‰Î5}͈w7”}Gìy[W#Ÿ˜Œg°ªs‚‚,Âi|qÿ¼¨´˜FRßò¥Ü¢!¼=ü2ÕSýÄMÝ % ~¿Që¶Î`HÝ=L%/œkSsÃ(|Ò⇾À;q–ý ö1ϳï—.ÌD{˜OdG/ûRå°Þ/ë!]S3Шâ^šU£ë1ûKÚQ=:­8|nåMG\+Þá„ÐßÐŒÒ?±³Iª¯ÆZgJ϶®¿žŽËýúj¹yÁÚݬV+ó¥zÑ*íÅhæ²V{BeFø÷Ìæq²o¥0rWmV@FgýÐI]{¤²jdy‚ÕFd…’ßÑýÌ•ƒwÆ‹€E¾_ÂùTN6|/º'¡ŠHšÉÀVµê‹'Ü~2mEû0yßíZѯ`Q BﮜRtÎZªî<™JÁ‡©‰ïù˜øihž‹¤Ø˜c.8×ã£Çýï%L’ZÍ)eoTæÎ)­£”Ö ²Šª)Í4Z—<†ýÖŒd g_Õö£ÂWDô|ƘàÅ´ÿ|{¥ëâbµ¹øÊh•^ endstream endobj 59 0 obj << /Length 2697 /Filter /FlateDecode >> stream xÚíœ[sÛÆÇßý)øVj¦Üb¯:žtêK’vÜQ)íCÛ˜‚,L ’&@Ùî§Ï‚{;¤ö"Á’%EœÌD2…=çhÿ?œsv±ždò?<)³IN)*Y1™_¾È¶Ÿ®?LÔ7?ÿðëëfò¸òÕé‹?}Ïùg¨ÌJ<9=Ÿp\ 2·æNÏ&ÿ™6Gÿ;ýû‹·§Ö'䆇+¯yÌ¥ÇÌÙàQÆ$ †0eÊÛéQɦÕû¶>šÑœO—çêëëåâˆâi_«/Ý“2Åe‚ ¦äoÇ0ʘP–ðÑ c§SCÖKi OÏ6ó¾‘ƶãq–AX~Ï“†¶þ, ˆ\};ÿºù‡cÇ}³ƒ—ì‰ÎäÔ–t"EY¡tG\þe¥ü&[v?$èá30ÞÂàØs¢eÜD:a„ñ®¼æqxœ1 '›"àÚ#ÐɲlúªêšyÕ¶_Ž :ý£ä‡Ò駋ªÿC§¾ï/L)›®Žf$Ÿ.›Å‘üÒ«þE1&èŽ?QÎÅ£EìÛw-yß1nD¸=[jøÌ÷(½ç$–‹"…VÌŸ% SÄÊÒ E4Zoêÿf˜-šÅEK¥@:9ÂÓ¹¼dZ-äwæÇlz¼>«×rþäo1=™W}_¯íÐï:7‹m^ë|Ð^"’ã‘Ð}ú!¡õœŒWÚˆI §žxµ¤ÄÞs¹›¹d㲌±¬0ÞTñù¥S2ɦ’ÅPËÞ©R´üAýûdyÞ%êÓð¿j]{k‘•¹ÈË»Lw ¶¿H˜™[$Àøp‘Ø™nwߣÿVæ"º#%°-Õwa³îzu³¾ý\]®ÚÚ›ÿ³1BàVüÝzä-ÖèãÆG2 $ÂÏ ‹"…`ÌŸ%3T`“Ñl1ù÷PÖMß ECWŒSÕ›PÙÿ®6½a4@%Í–•ìI5¾a,Äš–eZÅ-?WD¦GŽñZU…Ð35žg Ƥð2I1ui+æˆ Û÷ܨõqæ…D’‚1êӘɄ-ŒÌÀèøÛòx¼ .©±´0ìn> ¦,>´Vã1tbB$°wcF’Â0êÓÔEVHßBX msõ®êtÇþ¦^õª¡ï—ŽÊËæÿº»6Ƈڸ^¶ŠS.v\•ÑÌ®7g­õòl°ûl.(¿Í5 ¸™–ÑŠÅwf߯8Œ$¡xܧU<ç¨ÄÜ)n:!»{p’Sĸ]ÌÍÎÓ’(c÷¼=ÒZOÈx­˜ÖpÞZƒHRZG}Z­A¹Z›žçD6²õ¥îigŸšN?D T‹3õÉLc§] –Bƒ`¹ä+&3LæXE¶TEnöÝy§ŸpØOÚ.´YP<‡>,„,+‘Àì+ubÈꫲÞÝkI Ù¨O‹,ˆIµ-²¦3:i¶š0ý\ «ýú³úìÇMëÏETgrQw¡“Ñûå²­«…7É»KÐÇÝZ…ÐÐó7 g †”)€ˆ$…FÔ§EƒPD1@ƒk4Žs Æis©Óé£Wêo[™¢`õ¾I.†OÃȲooI!'QÜ$!yõŒ—×ˆÉ §S¯¼ ’”¼QŸV^¬æÓÊ+´¼o?nª¶é‡;þ‹’ådµ®«³aÑîÓ’rýePÌênu31ÉèÅÔõՉŒ™ß]«ÒRÿÖãÅtbjÂÉ È "IéõieÃQ(¨Ùµ|½¼\5­>»»](noþ³Úß(¢œŠó½Á/¯ªvSîøBðp7|Hs=1ã5wbšÃùh"Iiõi5—Ëx  9ÏïnªxV"Zº¥Á|gh"LJßØ#+ú!ôdçÀˆq5ÁÞÓ 0’QŸ–\ÈüÌžæñ¦NydÏól­ÓûËåv€¿ÏlçÏüÑZ.­Àx¸œ\Phì=%#IÁõiáÎr—Ù}<^mÓJ½8™ËNÒ×òeöK¿G‘DChjýÆ£é ÄЄ˜Ð‘¤ÐŒú4çõ'ˆr‹&ß{óf{jØlþD_¾‘fòâPnïŸE-Øx‹‹‹ ’‹{>¯½áGEÄ{ÏoÄèÎûxòdtœ3CÊ@D’B.êÓ"ÇÙöˆ EŽ^CN¿‘ì]÷É”YÒÃëíwyÐÍ(26g žxÏ:ÃHR°E}ÚŠ;ü1sJf ›­¸? gÜ–í¹¢óö{øPyï+¹iQÆóæ ÄxƒÚïI[IŠ·¨OËÉQ s›-¨‡ï7xJµñ<Úñ1])cm¡Å å¹c‘]_ìº?Ú૵#^äÏüÜ}}¶S2Œ‡ËŽÁ´ÀåÂHÁshlÄ„ù6[º…õá «eþªUÍ£Á¢á§„q Æß_ N endstream endobj 103 0 obj << /Length 1518 /Filter /FlateDecode >> stream xÚíšKsÛ6€ïþ:J!Ä›è1Nœi'gü8µ=° írF¢\ŠÊ4ýõ‰—:lN¬ñŒEBäîûi±» ž%úÏT2“”"ÅÒÙjs–´£ÕýÌ\½9Ãöº¥¾p ®|ysöâ‚óNJžÝÜAQ7ïg¿Í‹b±Ä’6?»],‰œoß,–”²ù²ù óÌ|¬›/ÓùöÁœÞçe^eõ¶2×Þ™:ß­²²,Ê{sö`îYü+_e‹?n~9{}ã­å„<ò±š+Gž c…Ò4I=–PiŽ"Œ¸~¾$Iæçî îoËb[¾Ún²¢lLzq!hOM¦Tkneü¤ïÒ|ˆÞYpð—üÏÁo!ìÀsŒ*ÔÌ–›ìÆ{ˆëïô¨þ‡IëÆþô§» |z¨¦õaGÖh=Ð’aŽš+GtbÊPJÉL(¡y‚!lI*vë7œ"!ÅóÀæÛk Ò¹m2‘@@„Èa"¡%#DÆuºÈ&RŠ$‘â(²]×Yoòr¡Ïê`lÃIÂN±í‘ƒC”YWL§¬£ zœð eÀ’1Ê¢:=eRÛŸòŽ2yDÙåC­Ð]¯#¢ÔD¾ž;tC´Y—L§­£ z~€6`ÉmQž6.£€¶ôˆ¶ŸË‡}0–¥)¢'Ò>£¹CøYMǯâ@D?`É~Q?ÆIY‡Ÿ²ø½Úol¡cª¢ÔVEtnpl‹ž‹b›Á‹EJçûrç+-@/½x®#d0@*…Ä÷´þAagn:€ÐAPKÆ ˆêÄ Óõ%› ŠÛúÏBA\D:ár_¦v”O74}‡•À…ÖUÓ)ìÄ(„D P,£0ªÓSˆ%R©§Z ¯òº*ò¾Ãò¡Iõó&èT:è욃BèàÓ†¨¢¼ÛV›¬ŠF’¢T‘g°ˆdgy:@€@=g&A€€%cEuz€ÓÈ°1 Ðë²Íƒ[·¶w“·ÅŸš*«>šóÛºXÿF°1¢ü*r;·Ó±éÄ°é¹0Œ °d ›¨N—q…‘H±ÇÆw½^f»be°Ñ¸<ž®µbö|òôdܼNFˆ Ów_hÉ2q™"N2.eºîm4mÓöà:¯ÃÍ,PBä©951ë‡éˆubˆõ܃ˆKÆ‹êôˆ ŽhÚæÒ¡ëí¾ZÙŬޚ€¤ÇšÅ¬­ÄìWçÛ̓.Öª u¢É~dè†p1s: è8d¥3c •¾B©j˜ v_“S¡Ë;e”5ù&\×ë»:[¯M’Ü”q7e\ ƒÆŠÁLéæß×r55™Ñà ì§íÓA0÷/€€cÕ‚íEhÉ :Ã90o·¡ªKeÞ«¼Üå¡h ”ŸJwùT·œK§‡­N@,nArh–ŒÑÕéiM’ŽUâ þ¿÷Eå7õ‚‰“"ú×&OÐʯ[MÑÝðCbBoÂm.ËbŠ"ΔGÐÌw óOÓ'hªßžlÛmÀl­q0±"±Ÿ°üT®œ&“DØêy;L´d„¯¸NOXš ªa.̽ùõÝQoᑘqŒÊžfCðØžO' t$ ¶Ä¡%cðDuºõ‘ ‰ˆ{o±«7f|£Š¹ä?«mO<„“Kzzmk<õró?­N@ -èæ´€%chEuz´8Óº}òåšå—6ö€]Þ<«÷U>п:åa_,¬YMg¯cr@e=`É{Qž=¦Ç˜gϽ¯|[>z…C—^q9®¯œõ;wM'±#RAÓ ‰À’1tõÎƺBµ¯rÛ;{eZe«}S}ꃠxØ7£)õY“ý'Úa袹 œÜE"]´žŸ¨ b,Ã"ªScA¥BLZ …Åâ*¿Ë«¼\¹Uð…D›š’/ŽÂ“é«Æ  ÅÍëdZ€€-=÷±àV ´äˆ–ÿ;œÆ endstream endobj 9 0 obj << /Type /ObjStm /N 100 /First 820 /Length 2098 /Filter /FlateDecode >> stream xÚµZÛnÇ}߯è·8€ÕÛÕ]} ’9Èiä¢èaM®¬E¨bwÉùúœêÚ&wF–Ì@Øééé>§.}©**gØTgÈŠlˆŒçdb1ÁCÉd‡oÙ£˜êÉP5ä‚7=Ä~!]>ã™Ç9ˆ%S‹ñ €ñìÑåÆW㉣ øäc^ˆR5BÁ…Lt¬ÁÈÐì0Ð"@WLh:Æ8ÈL#ÈÔ ;LÍy!Ÿ¸TÃS  cH†žÌ˜9„ºj³“Ÿl˜"~ ¦@Æ¿9"¦r ‹ˆ©É±‰˜š)PrR°>“†b2 ¢+0†ó&RÁŒe°EØ7F±)š©. ¾g¼`l,PC!'›M"À†Éƒ d“´+à`HRL^¼—R†ɤ\Ò¢z“ ¨ì`ðÊ&­ÑdE+¼ GÍ&3äÀСh­&'ÈA0RÎU$ÇÌêxAŽÐ`q8Äp0:ÁûÅœàþâ2| ™Å€ @ð0%ƒ!´‡½ >-¾ÈBšÊ+ ˜ŒàÆ :¦0º Ž+œñ‰Å0„¬’áGA/úœSR•ä”Ñw”TÝ‚`æ’e±‰©3K )ÅAžä"ƒ±\aqY @®0%ØÍU ƒx‡é–ó€§Шuqr²Xžÿt½6ËïV?®ËgÝö°Þö&a3½Z,_­÷ÝÍîb½ÇÎj[_nVO»æµCGÂVËÕ¿Y`úó`æ6ìñã†ühæäÄ,Ÿceù‚&–NiM Z~·ë.ÎÖóœ>7Ëóõǃys;P2 ÷EÃxˆl? „¦¸ªo'ñÄCõ¾ 1‰ Ë'Ûmœ×rv‰¤&$•–¼]íAúðúúP]¼ªáÅ+ŠW¯(AQ‚¢E Š%(JP” (AQ‚¢°¢°¢°¢°¢°¢°¢°¢°¢°¢°¢DE‰Š%*JT”{†o†Z,Ïn~8´÷›í˧Ýîr½S»7⇠ø™,΃ÄÁ:œ> ¶ÑŽ„!OÚŠ83ËoºóÎ,OÍWôGqÿØØFèœ<ž°u£ l½O³ÒÙ{íC(¶„¾4E›;6>«=Ÿy">çm z¾ò–‰fåó¥Z$êé—´çåÃHQ×'ö‚So¢ÛÝ' ª•-ãru^ºè¬ºZ|¬Eg¢ÓCÌ{gqß*úÆbx?Ñ]ëq@g×ór†\gåÃÅgcìùœlüyéŠCJ¤tT úfVç³zQf„že^>ä Rlj|‰l®#|Å.„ó¹êV'ƶçá«ÝOJ϶êI†[gš—§sê“>Bâx^>ÎÜ'}„¼F’¾©è°þ9)²7Vße;5¯c_¸úÇ?ÿ%¥ÓìÙÞ\]½ùd‘ëWµ8)&º-x“üQ!ì÷VéÜq™ÎÑï+E­E­•·¨¨EëBE…-:²ô#UÍ¢Š­.U­.UE©ŠR¥*JU”ª(UQª¢TEÃ=´Õ»>#¨¤)jFhøóÅÈ ¬ô9@ÆÃ#1Öd|­:¤Sƒ8k˜o¢˜5%ÙK#'Ä?8{çåCHﱄ;ÆÐM"'Ƶ’z:¤#ÎdtOò}áR²«2/2€ÛŒ1I‡ùÂD¢„  ý-¶“Ȳ›—Ù)²š¾TZäyér‚J}­T7¼\ÂDAOD€P¼¯ÍJ 0¦‰ÉcšWÏÇ ÜÇKˆSÕ/«-}çå“"MîõC@‘gåãê¬þ!Yê¥ZÍË—³Ôdûú¥/Ãt.œ²õ}q‘ÏóòI&ëvgäi¤ºòTåY‡¼¦¯ï! ˆ~d;L”3áê3©ñ_†/d„åYõ 8IGâd¦{q²ü¿…/”Í¿ßëÛía×]Þ\6ݶ x·çhüÓÕ~s±×‘­½ººúéë;vÞ­ØKëðn-ën³=HãÏÇ0g«Ãa½ÛlT¨ÓõÛÍo2|%?°½íx)æÿSßÛO“·ç7Û&åþÿÙ‹®û¦ÍèÞ> †Wšï÷ýÔ^ÄãaGHOÓf·oªüåãêýõU6üéáï»Í¡§=WÚo·×7|‹õ[ƒŽPO»÷«ÍV¾¿Z_ïÖ{d)«_œ8úõžÃ6úç`?Ãâè§5K+ÞQï¸÷^^«uÞýÞ£y/VêŠÓõõá]ssw;þýæêñN–÷•"~þxi>j¿'—2øñ1ùÏ ásÙ¿`B£ûIú38aý¾xôa³_ßY™«í¥<îh»ÿ '…”f§Ž{ôøíþë;ïWÎ<ÛÈvêþ»þ(­¿â|ìeùÚ,µoÖ<ù¡ë®Ö«í€±^n/ÚÜóÍûöÄʺn{ø boYûÿÆiÞ¿ endstream endobj 368 0 obj << /Length 3537 /Filter /FlateDecode >> stream xÚ•ZYÜ6~÷¯˜·h°nEÔ­ Ánbl /ì$›õÓ&–#±»ië舒Ǔ_¿uQ­îÑÄ ¸y”ÈbU±ê«â¨›þ©›*º)’$¬Òò¦îžE4:n¸ñóËgJèv@¸[Q~÷öÙ—ßgÙŠÂ*ªÔÍÛýz©·ÍÍ/Á‹£>Mf¼Ý%I¨¯nwiš¯úÛ¸ ¦q¸ÝÁo3דzlgJêö··ÿzöÏ·Ë®Y&{Hùˆ¿ø+ÂXe©ð——i¨’”ùS·»,‘£D1Gðë9F®Ïˆ³0ªät¯ùÃKø®ÈëøWóÏ~4[Eà†ý„g¾Çÿôh„¬o¸ÑÚ»QÜ9À¬ ú[Pc„†žlà•Zܱ†“ãþ~ù3Wë¾²<øïîÄœµGÓŒ:„sIðö¨'Ïês<H%¡ÊŸÈât™¿F*íÇÍ?µèËx’,2áVΣ(°=¾xοßß—?ï?ß–°ïÏßþ†!|¢˜|bF€p4ºF© í–¾ÏÓ–mÅFÝòˆL&xlØËo/Ì‘T`±naoœó¤GÝ°Lû‡A%dQðH`i•/P¯Eæ/™ð¨‘ÓLw4lLÏãÃh¶×mûÀýûÑN“Ÿœþu¸àЂ`> „ŒÌ¥±–1t¦7£öƸBÎ0w­éàƒª;ɧÉvö²œ¨‡îd[3:ž¾ÓŽŒ”=SðæK @ L CÆ;>cZ”J’?˜(|3§­qŽ×!ÛAS­fÚ gúËàP>yÒÈÀÐF;ÌŽà–h´¥ö+£fÅb„ٻٶ 7ëÁ»4" ô< ž4O³` q´‡ã®ÎQ -»þ ÐÊÞ|§¢e7¾ ÜfiÁ¤hŸ:mÚ˜7¨~è,Y¯Š}ÕƒæPùmǺ…Å6Œü³Ÿ{òB$òâÒÕÀt§‘éî€NÜ"qâ"ýjÚÙi^6Šƒû£!{óè8€)´˜ #»¸xäö»rƒ7ŸxÔí¸E"Š‹lÑÄ]7éÉì†ývz”ïV&Ý•ÉS_·¸XÓ±ãîûžDwïgW[n¨àß`&`û(‹_£8¹M‹˜ŒZ›™øW³Q—ëpÝ›3æ:ʼn •*n²<«²¢ˆf0‡A! UL¡érd£ü÷»Õqôz:Í/pœ(ú ¯‚ªÀ…ä(飘™Deê‚˧㦧þO׋OìÒ‘‹{·†y”]ûž;¶#³/¾ákçD t¿P/Ág:P¿#…îb%Ì­õú„r”Š!´‡Y–Iù—•ã¿ß­ØÄõ6¬œï´‹RR QNVl(GU°q_pù´r<õ§xºZtQF~•Bä'~r¼¦#s&q pÊܶÜ"_Z€;ÜAîÈÈmd¹¿˜. ¾¶…Dª"ø}Ö­Øé@À§]“àÇÞ¯!»AÏ }gÎyR>±½›FN‰T¸ ’çü£<á…Ç5ÁYòù¡Y dŽa¸Ãugô“I W w3yhh£*+ÅŒ+úN7Ü¿ }0Ðé Ï_-¦nXˆ¯€¤&ÏJ'Q^xó=¬Soe‚.½‹/¡U=ùfËŸã¯Äc\ÅKÛÙJãÛ§sfÀ0¨GÓÌ}£ýÁpè0#4Ç]¿.žÖ|äN+Qóäw¡¬ÑkãxQ6ÊÊ@äÙÔVàŒ5€lhQΆ!Vön° ÕùÖš‚Á•'FË*ìaÚ/·…ñÐ|úÀß@(ymÏzVpOªRH‹R8nfÞ?¬ tÏâT¤'N€ÊµŸ)ó°„4+òéÝÜ¿`¸÷ú ñ@ÿ!‰TðoómhdZ»r¤à¬ªÔ¯†é!8 ;1V8ÑüsÄ Ä•7BlÐý!Vˆ¥xò©©€¬/õkÆ=Jž!a& óüÒ&‘¨,NK±Ü´ —ØóªÏ¾(%ÔW¡Ž¿y X·Å @”0Kó¿,äûÝj-`qµÍ9v%ƒWœç¼ð È"ËÂré5›‚,„úL]/º^)`‚W":²TÀrõIݺÇ'ù½óÙ N³•à(»ï÷;Ñx.¼­UnèÆ’Q¯$¶ y# Ê"Ñ(µµKd£~"ÀcOh"F¨ÀæÒ¬ “*ûË÷ßïV l ÷jÖøËÑ Z3´¬n(¼Ì²¸`òOôÍÄŸâèrÉ m§1@Ž†Ì‘•pe¥Ïi39¾8“ìVC,J­˜¦Xˆ4N1K—ëˆöƒ ŒÆè%mQmƒñé%Zª7çV¦Æá0ꎿœFÝ; `¯kÄÖ`®T¨"x£mñÑsUó1®ÙtAxàdqô$=è²® ¯kaÿ”wóm›÷Ö¹(5øI[ûiàe)sÈ› ƒ‰ê¼êè'V† }óÑçc¯j#Ôv«ÌB? —rîdÙ½î|yó$ŒråñöqšN_}ùåýý}™Àð2ÆÃ6L/!S÷_ òšãåæ3áÈÑt—sµiF[‡wÚMÃÜþÃöhuV‡{9tcGðSCÞßkÒ0Ió·Þ©R…qŠø6óÊ¿Ú„òn¸ÕÖ”’U © È ¢éé Çm)Ö’r“˜ àgâÉ¿?ñÀ£*¸RÞzE…‚te€ÐaŸ½„á2Õ@¹ñby3x.ìÙ ååÒÔzùhµIÂåÍMð¥‡i¸RqžYêÔH÷6¥!Lªzgãy1VtùÒWùÕK‹ãAJ¾*ªEØíO—ãŸQ„tTrÆ47¨VásþŠžÝ œâL«Ê)lÊo¸à}†ö0½ ;½áç†ì)¬±..¥ù‚ %ŽÃˆÀ í¹}¥œ%dCM]O³R*l¶åÌ”+5éX…žë(…Åù:bç m°~>(å¡€X$3z$•´¼$^lµàü³$©d[¥¬I0 ¶W2BšU‘»—By´—¯Íû¼KO¾uÞÀ í<¡(©¾“쨮lQ–éQxõÐUfž‡vèŽG8M÷ÏòfXœ-¹L7,Y éûãàäËFwœVžßÏ/å9UÀönBG‡ šÀ*Ž¿ÿ“×®û£]7c”USõH8{vq¼“ê ºö>07 î\vfTºçYÍÝ‹ãx4ÌuT$¾|f…Ï$ú‰,…¬.Ÿ= b뤎ðRòÔêë0Œ)ªLäQ<”iå1²ŠƒÖ|´5Þ”Ó‘2p˜ëlo¹\Ú=çƒN¼‘ïq!;6ò¼&¯_Ë%Þ/Þ¶Á%ª¶f/˜ÀL5é+ ~“0üÀgMÑ> stream xÚ¥XMoÛ8½ëWðØ"‹¤HJ@ iÚlýp³ØÝ6Åa¡²äê#hö×ïR¶K±ÓíÁ!9œy3|3$Åp£YĸI˜JO8ã~‰`<Öhn¬™PmÊD y1Ã,•LÇ,æiÀSÃâ8)àxälÆ"€F¤˜–­f.E”2™€®‘­dFs´13‰ 7,!ž°DGp–hƒV°˜B(– àÍREó)KSàÉˆÖ 8ã‘"IŒNBb\ÒT‚N‚`b,<Š«ð±BGŸ8Ê´(!dIÊ È2&^€,5‰ Øé9¦°±“Ž&>5ã€È*¢) +  d¥©dM8&¦Ž„²Ž*8㚣D™Ê”©â&F`Èw$"YÜ 3Ùâ é ]ï~fËUÑ3ý‚$»3ã,¡"ÏÝþɯꬾ÷¶M¿qÚ[Ÿ©]­Çqβ6ë+¼[´]½®ü= ¾Œ›E¯èà™/ªê›ÛŠ=Öv¼Gw–7…קδ⻠›ïçµLkŸUË,/Ú½`ŸöìCU܃6oµìµxBÜóEÖ¶¶Þ»ÂCV¿ÕÀê ‘]”Hረ¡ô Ý“XÌ»ádÓ6ï]y5‹µdZÿM¹9nã‘îY·\=Ø$NÏí¾ÜŸi¯»rÑn†_Ð|› ÏÂ]áÈê“EQÛ»~O΢¼Äm¹Ì¶±=Isü àOwHÝ Ž w!µy‘ÿ;pñT呗ӬɇÐ)oþEV–ýzQnîd²m_$MŽQª®ö_TþÞŽý%jëð°ÞûMÙ´Ùàêߎ7U4ñõ‘/p·õçåz0Q¸]j·gšu $#ý©Sƒ‚øú¬r;)+¾>[¿û0ºaÊclòÚ¯~òMùOëL|ônh§ÙlpGMÎL|‰å£vdã3¢ZtÄéÀä¡h"57¶¶øLß$f3†n0û|¿²lö!ûfƒÙ˪l)aø¸OðxþÌ>ÙÆU‰´½³×yvZýd_"4̤â2`[>/Font << /R10 379 0 R/R13 380 0 R>> >> /Length 2027 /Filter /FlateDecode >> 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 384 0 obj << /Subtype /Type1C /Filter /FlateDecode /Length 386 0 R >> 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 385 0 obj << /Subtype /Type1C /Filter /FlateDecode /Length 387 0 R >> 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 390 0 obj << /Length 1970 /Filter /FlateDecode >> stream xÚ­X[ܶ~ß_1}Š§ÙñZ²|K²zK‘ƒ¢EO8m´¶vÆ[Ûr}ÙÍö ÿ½¤HÏØ'ib,‘E‰äGjÄ&€ŸØdÁ& C?Sé&¯/Gíöü÷» Ár;ÜÍ$¿º¹¸zEøY‰ÍÍÝ\ÕM±ùÙ“ÛHT’y_o·;™zö»í. Co‡åišUÌliº7éô`;šÞÑ@y}®›¦löDniMõt0E§·¿ÞüçâÛ›£±‘”óT(ù‰c‰@WmâTù"Tt¶ïÍ€ÄÞØã7òtÕ[¢ä¶éËÂt4z ‰Ç-XlˆzÐ8y˜Q4}ZÝ ¥®hÅoE‰ÇÊ{³w“ZC2°@×f˜¶{ØF «M „ ¬Ñ,'Y\7LæÜ :àN„¾ˆè|pÜz0ï^²¸“0ò•Tp…Nø’|bÞµé{Ü͹·'²þ%qch’CLx [x=Ž†N—0†½o˜äùûˆDSU—‹@½²éÝäæ/Îû±Ä£Ä~J2¯þâZ¢,˜;?bÃäó³¡L Z:~°ž Ø¡a$¼q:E‰çÙñèžÄKþÚv(m£Ýi¢È+ïˆü„·lGšèÎ’ÆDÉm çômÅ»?–ÃF3Çã’ZïÜ—Î|Ô²+Àö*½{0xìq“4ó:ÓV:74©iÄ[ÁH»Xx¢ äa¥;£mZ«Y%¸\?W$3åCtL¡SÀ 2qÖ³”nŠU]ÂOE6 }ÈŸRÂ0¤üí.Âû’ìÜwº=”p"º»0Ž})ä"Làv ª ¥ƒ»CXª(C…Iå\¬\îµçlC¹+ÊÚ4`¯oáÚ1 ÜöÁ8ïÏ—”œƒ`eÅ[@"'že﫧…ø…#:³[D<ÇÁtŒ)EÇþ¨CôDÓÂR:*‚-;V1nðš3p.O­qèÒœ2qù÷‹ÀS)²Œ xš@ÅP\y#ö^½©Åæ{ñÓÇPX…Ê—YHç¹q7ËÆÀå„*@tþ€/Ùo]hÃt˜4¶Æ¤­)θ‚Cé˜óH1#Fó0ì*«Š¨mç0ü*ë´ÎÓE¡”A!|˦þD³Sd®€Ê€jF>RV¼?èöè%yD,LfÁèv.P€Ç\èôyWÞºs,@ ÓÁžòF©€ovŽ6¹»…ïÌü•à+'|§i{3v—Ó6pAN >S'îYNœZYN€˜3 ˜äAW5È\Ûìj,Ryn»â˜ÓÞ¼LÍëàj½‘©Ÿr¥àcºœˆdDžº–/ËW×ÍËòùs¼Eâüß]¾ŠÎ`±øß¿º®Ëgõå®|Þ<—¨æåý'Ô‘¶·ÂÙpy’}ÉÁ·²÷ŸŸ`}¼N²ä¼÷TÎêLîLåêؘch¦‰}«û2§¡y§ëÖÕ:˜¸€™t™‰ìÀä܆è™a„z‚Òi+ßsHº¨.ˆ–£Šö4Ÿê–<àÕ$udÐñµÛmWj×€„†ÀáÃc©‘S÷›PR—Â…¥u5^ÉHF§¶€ç.Š“yÛ ¢½KSê)€xÖ ; d |õ¦_KGÌï­F^~]à ×µCt&C!ÃFB$x Õ“3Ô»W¬dÂd·¤ÓMT» Ú3ÑâWœ¶9Ù2!âB§/WÚ7~'L}¥­Û²â>Éåí9¬˜!w¦¼ÿmShV+XbæY¯N`q ƒg ZcoºgŒ-û‘ÀÈŸQb$ÐÖ¨Xbb€Ð¾$ü ¾DO†Þ7h 6FìÎ$r1 Ÿ·'ÃìÇ/h pˆõ#ïõÖù4&¯ž'%ÞQæ É›¿PSa<‹ÁK"ö4±Mõ„#I2Ðüä³ÏIÞÑw‰Â(ò ;–×»~@74så•õ—ÑØ_‹Á©½¿²xn}¸ÌÒiÅ.JŸë«Õ²‚B[5µßw™úwK"¾–þØÜó`–v k»‚ú쀓h$s\ ŒÚöܽãeÆyÉM×J OQj02“ª+õ’€òŵ†É´¥roˆºü¶¼Âîv•›—RÀ°,wДÕ0Êò")"¬ù}óŒ%jýu3+^8½$¶°´OÎï ¤*¾NÌn hÛ/¹ÔfÁ€[×>º¯ÛÛ°¼öS›Syçòx;3ƒ._*z4jâ¤Ê½LPÏx!6§îqãrÒvooiõgÔé¬ú5b†óC_ h0îï ÷ž bã(2Ró‚}ù°¥âÌE`/c5˜ÒG§[`Ñ)]×:DÀ“÷ø¾y+^ˆW×Øs¬ÁC”ø2‘§wûŠ¾^öÉQ›ü˜¶8ðã ›?ÒÈzú›aƒ…ÈÏÂø,,vSÎtö¤|Òeg?{¶;[UôÇÉéï¢e³i¦V´;µyî?S,ûÀÅkÇü>‚#ü¯‡£qý/ˆPúi–,ÿ?¸úœú¯/éû=˜a ù »½áñÑV Hùüj-$ÏMækfä'2Yk ßk ç’‹®ð_ÜZþ³­ñùø8 D’ endstream endobj 394 0 obj << /Length 2559 /Filter /FlateDecode >> stream xÚYK“Û¸¾ûWèHíŽh_v\)Çeom*•C<·õ0$$!¦È IY;›ÊO?>4œGMÕhFwãënHl"ø›"Údq*ß”§7Q»Ã†ÿúåpóv0q7›ù·Û7o¿$ÉFDabs»Ÿ³º­6¿ŸŽú~0ÝvÇq ÞmwJ%Á¯ÍVæÁеÛ|«s9ضÁv"Do¿ýû›Ï·ã®‰”¯g>–/Ë'Dæ›4W¡ˆ‹øö§-¬L‚M;QTì”móÃ4Ö4÷ÝŒkß÷æ\µ»²­LÈ”ŸÞ¢Ð ÄNÄ¡H˜ï¾u¼¾EId?ˆ÷ö/þùÞþü3ôü—–%a&3·TðÚ¯‚M3ß/6ð³äê¬Ýœ!Ïü\Û 'ä žLÂ$v»=0V’•Ùës=pçŽ,eŽ ÷öçŽéíž¿ŸþÁ¶lá¾íñ›CËýƒiL§Çzð{ôô\9V¹V*ƒÞ6¥›`‡%¿ö~°'û§qklà L®–ÊÎÎËj°’ið+0“Š™I•=i wíž¿è†gjndAÓò·Òƒæ¡ÊܳNšÊ€¸Ž¥ÓÓ€l/øϘƩ~á†2aœ'`Pgî5ûÀ©„Jý ŠZã…2ÍFFr•‘U¢üвLUpwvç¾tmsàCѸØüšô ÆQî<$ó‚;£E²˜-”I¶|ÛýG¦¡óV@Ùc³f*¹L„ëAV†&M*uÓÀ,‹²Ìçu¦wš.ÝVš'ìÒpã6î*Óá}º=zq€+7œe¸S³9ñŸñ ¹S«(2 ¸}îQPÖu6×5"KZx]÷¥þèP*Jƒý¹a°CͬXªHBúv«á4i*‚¯WLðløÕ,Jl»¡DkÒˆ:ØèKÔÎÑTçV‚Ñ•Œ]×|&` bܸÃgE(³%bðj²tó·Nã`‚»#ôLA·„†äKÚ~ß²ªqü2¶1°ñ-Š×‘–ëÁàC1áìNŒ ÛÓ½­5‡ Þc@<9wÎS¯€ñ–¯pì¯p AGs¿nît¡3º§Ó ‘œN¥ÞnŽxt¼,#Š9tºæ!öÌÖ ô<9ÏÖUíI[¿Avˆ‘CåbšÓ'ÃŒÖÎ ÍH£‹¯„"'€Ï}ׂT'4sœ8'É•âp_ƒö¾66h>P5œ¨6µýsœ ;t¼Äaîl„tŠCwA8Ž¯ImþÐ'Ø«ÇãÆYðe›+b‹h<Â>0Cü£Â©ÆÏ=YHäDzR2 ÒqŒÉLec:>-ÓzŒÛHèÛ“ã|ß™ÒnóÄ ð9=šñq0_v@/n–Ï,˜±”@#W€I0àôÁT\!¨áŠ[O9] Z…Æ$FÃbBÍÜo\øàJæ™o:J†×­ëW½ªt¶##@ŠFKà["$vB§jùKX_P²­Qãà:w^û@MŒß0€~ÎFÂ|lÎTÀ²Á4D”Q tpq‹ã+ðbšÇÎþ#g/b\ž‡2R˜†Yî¬ö-’. Šh“†E†YÎ.!!]aêcÚWž¥“d6ÆÌÕø¬BH?ã‚G^“M…RIÏÊ®±ŠÃ,ƒkI‚á>à'#¾‚¨+Ìw2 ]*cQ¼öàé³½,ò‰ƒg›“Wûßkœ@ ‘=qîœøJn»HÃM¬Ò0 õ“G±ödtㆆ£¸et‰žväÞБ²tfDP9<ÇãùZ6Gòˆ—òº$̳1¯›‰ß4˜ØRhwâÖíÁ– gcPÙdi²À¥ “êµ´t/“gÝ·ã)»¼-¡R,YEû©wó€rÏ 5ªi9±ô×Z>£"QðÂÖ$Œ&¤\xŽÂŽ¦Å¨!Þõ m¸#i&žuj.š¦ÌK)|t;kÞ 2¨ˆ\Ò§dzr §ì"Î/ǶvͧUQÈPdògIÃX.|…Óç+j¬Ík_ÜPÈ<Ì¢äåÏwäôN¥ÓÉ|0¡Î>¸K¹f@î°1†;ÅuiN&€XâªâõbÅ ÏÇ—…2*¤K T!\F $ òØ0H»î~·_è {)~5œ!m ³ ]2hÒ‡\Ðh¾÷LÆðKßã´jÀà´{º” ¸NU$Qðy¼_€nÞXÐÁQ÷L´ƒk´”o4Ü™ï‰ý±˜ Åd)$›ÿçÉà¤9|¯dcÁ”Hœ¨¨»«,¤8=0ÐXV‹HäÁÇgæðÐxIñ‘‚.)¯p»y±_Oé¶H%ø Së¾÷LÔxÓ¯Ò4Œ亻9¹€ãMå6ÊãàæÎysbô:æÆ eÈ‘ß.¾øwé“TSúDÔñl=÷ÝAî§Á©å¹ÚCcquérWzˆÈ‚Ïà“>­h~n²Š¶qKìN6ã±é‚G!_‚³×nدa\FBgËO‚Ì9óžû¨A›Õð–da1U·öEu5F,}5²`±q2;¢€ÌEzu[L×sÎ÷¬4ð$Sm^% ³¥Ä³OPu­_µY^`óõ7s¯("D(’%˜}ÄJ$&´ÂÛþ\s{ª„KéÁsNè4ï±×`ÚÞÏ(°r?•ëص=™C¸ú (‹ ßMû œ\î­Î=åe3öñu0›ÞûØûHb »šßl üï º(y?·Ñ“aËÐX~ ÌBÐ쥑OÃx?×îآܠ²a\(óÈíxeA˜ õ‚0Üîé"^ð=Â…é sr¯„0…ÑHM;¸Eg >¥uu"‡–¿¹;Ûºâ% (@µöïœ á¨EJþ{¡L{”5^ùEÊ¡mS¤O´¸pzhÀõdD Wˆd1 ã˜÷éãšhe×ߥp¥nýæ'Ûû³kS8#G™{¬‹ò€ëbÃûóÀÃTGþD0²J˜û:tuÏÓÜülî~{læ=®ÌÞ(R'3¬;™áØ’$•cÔ:9ÛÓní$ éê»uüçlýPoݵNØbê®ñŠ«± üÕ›(DÂìþXR濃øõ»ƒ•ßj®·¡3üö£¤Ñ…ü®¸¼>8q•x$i eœ.$}ú÷?û%¹®˜ÎðBNHa+£—zö¿7¸k„Mò)üÞáOé Ó?°ë?ÜÂŽÍBF^Èéš1üŠéijºwÂe^4ÜŽ¯PÕbx b„àhV”Ò{ß)Dò)kX¾‰åÛÔ‰ôÆtz–‡/¾hYLeWÜtð<{~xÉLJsz\ô0 S¹ÀS\ ÅÁ',oúïîÝgj…»ÅO„ï¼ü³)Kq endstream endobj 400 0 obj << /Type /XObject /Subtype /Form /FormType 1 /PTEX.FileName (./images/tree.pdf) /PTEX.PageNumber 1 /PTEX.InfoDict 401 0 R /BBox [0 0 387 312] /Resources << /ProcSet [ /PDF /Text ] /ExtGState << /R4 402 0 R >>/Font << /R10 403 0 R>> >> /Length 1017 /Filter /FlateDecode >> 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 405 0 obj << /Subtype /Type1C /Filter /FlateDecode /Length 406 0 R >> 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 409 0 obj << /Length 1117 /Filter /FlateDecode >> stream xÚíWÝoÛ6÷_¡G9h~I”–dÀÖmE‡¡ÀVï©Íƒ&ÓŽbGJ$ym6äß‘G9’K§ÎõiHŠä¿ûàÝùÈ ,Èh „ ™LƒâfBíj³ ðã·×æp£òûùdöSŒ’Œf,˜/‡TóEð>”Óˆ)©²ðÕ/õ4âiX¿žFBˆ02ƒ sœmÜæ-NWºÒMÞÕ N—ø!öȫª¬V¸|‹g6÷WzÑäÓËùÏ“ç;ecÎ´Ê ?7+šÅXJÒ I%aB¢e³“)œŒÃïpxuUot»¾ÇÙ2/@ûò¯¼+ë —Öº©ô†àädfÔñ„ÅÈhÍ4»hLË vVž_¼=+OOaÎpço{Œ1"céÎ2Ïák8|}~QF0w<_^Â?¢ íâµ[<ƒA©xg÷;62%±"éÃÈHŸ$'¨½k:£·Û{T„JNé£PîõŸßå©õÂÛ/úÀsz \£×NÇûv]û<‹ëËkØzàI>p¤ð8rüÁ.#³á••‡®L>å½Ï=>±5ØÙ/BE,!Ì¥ËüJCÖò$,ê¦Ñ­ËÝjÙl4ÿ£íHDµ÷Õ]þ ç]£Ýù²ÅqUþiºrËnìz9ËzUˆ.–ÉնфRòðM‡’e£‹ns?æ…¶În ¥aÏ%(ªÔ¤®Ó«J2\n«Âd}‹Û&˜ÚÂ0B•ÚB‰ÀX²È) ûÊ–o6ˆäíòNßX5ÐŽ°^Ž€2¼mêU“ß¾ÞM(‘ÂÔ2[êÜ7f!àŠÒÌ”¸Ù›üPO~ÅbDz #YÂs{œsB“84!\¸{NûˆI—àÚ·ý·´×ÎwѦH&Ä‘‡ÝÈ7`‰•cJ%Á`p÷ñrŽPFƒ„dJ¤Æ¡ÄP8­ß!JŽ@Ø(î3_DK"“,°˜kõi& —¢§*!Y¢Âk%“â;¨ŠÏÕG:øeŠ‹æ>*® /ƒhƒjÀUjµôªÉáŒ÷š ®_OSŽÔË;›!pý„`Mw„,ÏH’)åcÉã)±ÅRF³cCA üéPPÏ D@œŽ" RÐáíA‰ð’'œ¤ê_Üû¢»Ó'ÝM¡ÁÏô÷‘©'þ‹Ô³ah¿×ÞּܶDŸ¤_)ù‹çá!B¹G¸† =ÄCI{©Ä–IŒ´—®ñòÿÿ5c‹=3öºI'DãyLßµ“-ô?’ÑpÔ]áÒBc©«,Ð,40³a›&óQvøÀtòh»?:Tß¡™ofç qeýYU8œéÉv˜ÔbŒbØÁa÷v¸“4O`%ÃmUÞmMK »þ¤‹->ÍÖxÌÃ1IÃß[l4Ôn{av6lCÕ¸ U¶¿¬úq:zü«‘¥Ñ‘{{;M:ðøÌó\(«Ûm‡­hd ½ëAÿ!Ò endstream endobj 418 0 obj << /Length 2015 /Filter /FlateDecode >> stream xÚXmoÜ6þž_±À}¨6T‘zâ©áôz¸¦Àe= -p²DÛJô²•´qößß¼qw%kcûlÀ$‡ÃáÃá3ÑÕʇ_µÊüU^¦«¢yá“´¿]qç_?¿P¢ç‚¢{¢ùÓæÅï¢h¥|/ó3µÚÜœšÚ”«Îå]¾M¿vƒ pô뵆‘óï¡joY4Þî\þ³[»:uºŸyü¡»×:qî× Ì{ÐÒZû‰­ÿÜüãÅÕæ*Òú‰èQóüà'žVQ(ðã4ôT2|½v£X'‘†4†1†ñý:Pp²ùÐ ÂX£yp_è{Qj­{Ší¿eïª~¹{õ5o¶µ™ºŒ¨ÌSÚzøÔqiìŒùgt™x˜S›8U»Ý"âæ_…µ‘Ew¹L6èôÝZ9°N9"¼†Ç°¥û¾GÓŠ­¢èú¼SïÅR7Ùä¶Ï›&ïyei†¢¯ÄXiqáéP§"Ň*Ív¼²!*@¡AÞìz¸‚žeƒ)ƪkyæ?òcæüÐ!ø?U«X)O'Š8âE0çùüQšÈ2•œ²Æ®wO ,¾ ãÃ_·­èÇß×ià€‰T(Ù ©P縥5¹GïªÚüù ú±ïló[ÃÊñü„@.OÇáä„ç£Àj?rž¹Q:¸Xyk7 Sç×®7í ±­§[êŠñÓˬE0j·Ý2Uûq`Q“·¸|Ï£n‹Þ’)"¶»ÖHïÎvòþÖQíÑ©”©moˆ¸†ìŽ9»ŸŒ÷ÜþµËk@tÜ5— Ëj(vÃ@Ä„a%ëòe~–U‘¨«ƒìÈC¤çx¨²ÐÓY°‚è÷²8{6íz÷ÄÀ½ͷ™òÁj/` /óº&¢˜óHy)‡¦j*~š Ž=_¥“ÓœçœÕ~ûÜè)çB8'ÂÑ‹`¾`ž2=BLˆø:ª‚!ïòî†'y’¨ªÁD÷*LE*€NÛÜrïyTt˜“¿ò oKî0î#ý„z, áðÎÚ>pwr"Ö鸽5­é\v¥±»þò0ìa3 ¨SðQÉ&<§˜Ž!wˆƒPbä…¡Á)÷AÍä}]ÙWû\^M#x6õ*ŠR/ŽÓççUYïžXÊ«³m¦|F| _QDýñ'<Ý€ôE9Ó—4dLx“uL°#cŠö#HçFOØ˹Ñϼ@gp?1ÂnÊü‰«»®MƒŸyèK„Ÿj¢ÌvÅ)P—ŸpЊ¼97Ú-«Æ´ø,¯YIˆSïïLÙ“+Aï^V1÷_)=âI€Bz’ÜÂá²TžD^¢«ñÀ°à—­7²Ã’O猦G£äÏP§,›Ð Å@k5ÚÙµŸÛŽ É–HçÃìxH({â§0{Lì Û¼0x«<”,,ŸL'¾—ªðæIþ:ZÕgýLJ%í“Î|ƒÕ™ò|˜º†éª´—Ù$?û}u-ܱ©¤wø’'Î8 o$KCÄå¬À2yt!VuÿMWלß½í Dηöû¼âÄ:¼^tuê¥Z‚U¿¹¨Þ\L«ËÃ̧7ÍRºyû½v‰í·°ÑK…–e p¼:ìi‚[•T£&‚(_ʈ’päÚ”TÕ%L4œ"ÇȾ–YGP×X,pðqäÇÆñÍ¡ÌÍËóöóÀÆîhrᬠžÏá¾b*·ÀûÏóºuIóã…^Ú­ù¯‚R F'FÞbÉö£»ökûœê°7{™ï¬^E’²r8Áb9†a¨“ŸeÕ Vˆ$âÆ>Ã¥Ýên·—¯8\ ùgá¬ðmrËø,’ Aßf–þ \”91tßw£ÌJN‡÷kùƒ~Ùñ,W)(8|WÉ‘#‰&E5˜zoMŠÜí®wVSŽ(,ÜÖ>âf)pÀm: ¸¾ ­³á3èpU(=W<¨ªÔå%*y~ñ ëÝKÅÃl›Y1 øè£ ;Ó2”ÐÓŒ_˜…x4ø"³HUr¬l• z?Ì´òÂ,œœòe†h?r¦P‡ž “陈»ˆaØx9w ·ja¢á åS!¶ÉÀôMRížÞÂg€cjÓ'´­)8û y¿ÇLÿĬð7HV:rÜÅž»üíýæê?›o*.ñ’ÈuÞÞîèBp„„$Óv¡H¾š@ºìÚÑ|y€l=¤½QV#U°ï;îŸMª@iV ×n–%p"…O.#¦)èD›¢«w ” &ņùë‡Jð@­¨/Ü*Êú¢òšu7DòHkøûwÏã/üWÜógšS½ ú\i( üé'ì ¢„v"bÇ…ÃññìêeÃïe»—­U|©,™D•g<9é™7Åîí=°´·?Û[=goûnyäð§$Röý.¼»Ï[!Ô(”¡’†Ž’·à×ZÜJÉxB)Ù‹,ƒ´Sb}k5¡ÕG!O}ؼÝ\ýzõ~óá¼êBE5uÃû]sm±àë@á%…Òz\6]/ÿ,{mcQVvM^-wm,¨Š7#Vˆ§ÞŒÎ‡iü„i%äü$íð}zdÍ[ËöçUSBŸ´àž3= æ©é7–„òÜýéìÒõ endstream endobj 421 0 obj << /Length 1689 /Filter /FlateDecode >> stream xÚ•WYoÜ6~÷¯X´ÑÆ‘LRwhÒÄp¸m¼@ÒÀåJôš®Ž­¤µc´ýïr¨ƒk9q½€yÍÍ™o(º 𣋔,bß÷Ò YdåÑ»Íf“§Ôй@èN(_¯ŽÞ…á‚/%)]¬®¦¢Vùâ“-]qê¼y_/]–8õéÒõ}ßqÕ8W…9Üâr#*Ñð®npy…“Ài3^U²ÚàöyŠûk‘7|ùyõóÁÛÕ`lÈؽR”ÝŠ¦nÑ€z1IQxÔÐ7 ¾…qèIHôZdC:.Ãñ{npøáG¦ì;\ê{4| X  _W` ~e—–`:JVœJ¤%zßÛæê¹ò‡“-Òe â’Ø‚ÉCÓâ$èÔ“]·kÎëm'ëªííd‘ç“ÑΉú†áŽWκÇV˜’W;^÷æøÚpÈ®Ï#í/E;9D0MG£¿Â<µÕP»sxtñæÇÕê퇳óÓÇIç̲ï÷¼÷9ãX¦ËCZeC ÷ëQÉK —]š€Å)Ê]]ËJˆçwBƒbåÓB¸d±s‹µ®-TDVä8ÿÃh±ËƒBYD1دå¯y+3/+êz3gSä÷„Ïz+BÒ¡M Z|áå¶0ª{C·M½ƒneÞ"+$×w­6,„u.Û®‘ëÝ’:]—¦Ì£”ÚAV¡†˜8¼óͼˆ&½Åh»#L¶Ëo¸I}À õœà$5zª'wKãXÅx°âOœXþÀZå¼U(Ô~&Úwd·'¸'58*Œûä@XPƒÑK©“¡ÐÜ,×Ê´{œsZi®%e:#$VC1¬µB A›c´öïdw'p¿@ßâövJz‹£¬¶»î%¤tôH’ù0À|OŒ»n߸ˆ4ôXL‡œó–.\¨óú£Ћ!VRäâŠïŠîÊßï]w²(°!m¡ U¤:<ÀhŽ Lç*õÁ…ÜÑÙ;å€(@€.‘7†¯Þu:(3Ñ`‰—ØU}ôñàtÔ­–kƒ‰àDmðç–xÀ¸k¶®âØ ]…#ñi=œ??šƒ¥ÌUÝÊv,_TÇòðS\ü­ù(õ‚ÐÎ7‹÷xo^”²R«ò…+¡Ó()Ç7ßfL¹ Ú†7#ñ±IöêgŽ&'GïbÈ›j$b;1ÆPÆ=óT_Œ|çã2 œFvø–±Ò÷“3•Æ8}' 1—*œ©GـƊ5 ±pÚ‰/f6”JAa²qYµxÊqHX¢ÄE.Ú¬‘º·ªüMGzB%=!&Ý€H‹ŠµC4åu9Q !%Á–úð¥2íE>óÇ^ú‚€:¯EÆw­ÀC `Øî;·›{\=Ëêr+ ¾. [†\¹YšÒBÔ†uÝHaù3å‹z(ôÀªØXg’˜·­Q©ÒeAä´uif<Ï¥RÁ µVW‰[rl³šB!žÏ”²k\aì”óž-ËÄwŒ@˜†j\÷:­gj…vII,øKàÙ5´Ø¶«Kï¡™ †¦ãŒƒL^+˜v~Šo(ßx»Â Žè–ìy­wZ$^°7k-M¨ï¿ÞŽm³ ©S«=ååœá~âÑ4whÆÐd¨Ð?Tl7¢Å/‘uƼ®gÙ4¼,yƒ»kG¾5`¸ëß²€wQj%µ~Žˆ`‰-¢3oDø"øQ»äÜ‹PƒDCÓù®ÿ:ùkøì`,öÂ-|F5†Ã‡Ç§Ïd‘Ã!$«Ä‹;MY.|h_êÉT,.~›û:a ,L-ŠÄÁDå~€¡Õ±xú"™í-€‰êž8é/ÎÜ(úzùÒ|düÚÔ*ÄsÖ):2r¼©+7ý05ëNf$NY'ßój³ãýŠ…ýŸt ^î*]Nú;ꜗû"Mû˜è÷£xâØùú²Ý7®__ð²4d%÷ip¥5†Meovü\©Ÿ$Üœ¸a<µù—-Bˆá(ê¡×ã™vyÑ!”÷QëÉ´ýÿŒû¶–¹î¸sŽï…IËT §Çô‰zÌ=O ýÀ3£Û"d”<Ý“ýKÑW5h±ÍNßÿáÎ^Ôöïä¬3Ýî27NéGÚÞ0cý<ã¼õ‡×xÇ"fÇðH˜Èz$݆´´’•XÑ™ÿXØA> stream xÚÅZÝܶ÷_±@ªC½¬ø!J ЇÔùÀ©SØWô! RÝ®öNÍ®t•´±¯}g8CŠÒi}¶´X`ÅoÎÃ™ß )7)üä¦L7¹Ö¢4Åfwz‘ºÒþnC‰7ß¾Ün ·QË?ß¼øã7Y¶‘©(ÓRnnñP7ûÍÉ«ûêa¬û«­Ö:Q_\mÉ’¿M{GEã}M‰WßuW[U$Ý·”ÛÆ+•'ï® °ê¡•R*Í“ü꧛¿¼øú&•)õ‘ÔcËgÈ—©Z³±…Râáu7Ö@y–ɤ9u…E²‘$L6~ó¤kTÒµ\µïNUÓR5}mRÑçŸÈÌng³—J@[Jó~åºÿ|n›®åæ3bm!re}ëß¿„ÅMÓ¤µ€¤.K¦6_ŸÌdBg¥ïýúög¢vX›)Ë…ÊU˜iθäÙ`M™›­ÎK!M¹ÙJ-dFÆ{×vVâÇ$§ wö‘ÊnÝÞ³(t§fë½ J¬‰))`{²ÍV¥"U<ò©Ì׈–JX(a¢W×@‹Tû¯ºv¬ßk#˜­”ûª0I_?ôõ,áã@eãý•D.0Ý´‡®?U#l^¨­FLi–g(î!¹§Â[÷Gnp<ú>5• c5Ö§«-ŒÏS ØoH\ó˜;˜§ƶÀÀÊ+É; ‰ðEP—þ̕ɱjïÎÕçÎR‚©Ó,}wßìpž{*ÚáÌ€»•'Üm]’óB¤yÍݪPôæ±LÁ`°d”xEŸ]$“"SÆpøä9¾Aþ¾s‹wóæË×TX¦À½¤tÕî+vwìn«#-±2R¤™™I9nÂØã¡g©Ð¥¡u‡ïCÕW§´!nUYrsDu«˜`¢¼ 50»+ºãZ Q©“»æ×+ÞÈÕGª OçRA¼å:qœOøÏDZ§Šî@ßnÇʳ‘Y•\s½WŠtgÇ츫g³Š¶5ª~Ê=NÛ.ú/×èÿ×yÀP¦÷˜«ð#CsÕñ6$4PÙ'uUbÜq„ŽÇæ—+ÒI˜“kÊH¥V˜,èëA%­*"SÎBŠçV§Î* ¾®Nh(W†ÔFh«c„,8í02C¤9€ôhí±¼…ÌÀ4\X”Á”d¨WŸ Fª°ÙkHw¨Ð(½ÊA©ãCù=5¿Ä‰&ŒèľΤ¤%’Ž2Gj¤‡è©¹á»%¦& ™¾®öL/Ó:1ƒ:Þ¥ŽM[»u0xArÝRH•‹¢(f§Ú 'fFÚi&ÌÔï«Ýˆ†3Õ€ß L[˺sLîÔÀ.4AIG+™˜ðkŽi¿æ8غ3…2ûŒEÇá&*}ÉÖ»PÂäå\"!Báy‚¤SR.q;´w;0^TtW·u_9[¾µÆ)¼©?¥P¹àwôUx{·ÖYLë¶{EL›ZpRÚùë%[Q,Ñ™€‚wá‘îpÃ+®²În²žÐs2ÌÐêΔ1û°“‰t–È5–éÆŠ2שQ–ÀK ]ø¨^@º€}ŒÆz(ß7=Г£‡¯‡îxìPâß þ<ë9³N«²Â°‚tQ¨Ç3&,(œây`”P Ïc.dú” §§&ZJ~ùöÕµ†k¯þ]n_{7r—êYK*D?=ª{ { €ê¶96#Ul†6Õípî¹+㺥ªeEµj´šÏE×3$f V}Wôíƒ{´oN0i\Èzͧ=6pMàÄhÐ_dáVQó–±ðŽA ûò[âæ·˜ÖíxÙsˆ UfŸBçÌf´X9ÇÍX‚Üã74YÅÂRê žŽÊÀ™l¸:ÃiÎ è ³ ¹a` À D[®˜Ê Ý*†Â <0`ÉFóì}¨G÷ëÃH}wÂj(C<%P€e*Ëàcðtyr†ü  Ëg3^²ʈ¬0Oöpu ¥ÃÑr ½ÐÞ¯Hnayöù±9û÷67|P)J[<¡âç#82k¤©Åäˆá’›]Úuð@>“C$8hF„½}=Äâ¶àm.²–±+ÖT”uÈ´ áØG–%xïvŽ3†X0œÂÊ“›+ð&Ë4©«à’8šµ¦„ŸÀqÒ{»­/Ò'%RrôÅãån<("5Å€ÏwýbM¡=«&®ýPgX5‚RX=4È3Š1LŒ÷a[jrÿS÷ĪÃ#® jcL-Õ –ΣÓÛ˜&\…º#×ò’e ¡Ùgrœ`¨½;® 6Û¬l™k€9°²ä%œ^‡%3ß#nÓ`òŽJ8¿Uš‚þÏ?(Æì82šÆ¡sYLÔÄô¼‹I†ç šÉ1…ŒƒçäxhÔµ³C@ øÈ 4±CQ@ì#vWêtŸC瘛  d:ÇqªÛtŽ¹@­æ8á0’Æ9kr*”m–Ôíëúåo¼léy[$!>Û´­Ò&'O ÒÓfªKÑB)Œ-?k3%o¦DÔÿdå´*’&føž¶”l¡Õœãôcô#R‰¦ÐʃIÍñ­¦Xpw†–§Îm)”9|ñ@µ,T:öùô…5‡W{Ñ<!z9ÃcI+´Ó ”°0ÀL‚‘ŸÒ» eN äÄdQ?a½­EkB—Vä¹zÆg0:v¥Hšp}Í‚_.}LXÄUà}™/9°³-€,q˜:Oéìƒ, Ÿ0qÙ°m4©`oæb#{Ü‘Ùÿ¯oé«ðqn¬|Ië_+H«œã5±g€å‡s»óæ«P¼^•gRGÈ7t»x¡…Ky3r¡ó…RCâ¼÷dÐÓYýع÷Ðଇ©] bf¤VQ€¥T“­ÀLýï3†<ÝlݧÎ:,¶«ë©.¥ls¸u(Á’§ˆ_ŒUâw¾2l¢Ü p2)ÌmËÖi“ÓPéÌpYå癡ÄlÔ£ïÎw÷3?YJ/Ãé “1œ.Óâbü¤,íGâ Y„©(¹mÅ«ù}ã¼w2Èß5k˜¬k¬Úí#˜˜"<䘇ƒî®7cÞ=FÒYtÀ0ÝßdF‚L5ø˹€‘ ¾A¶T˜‰AYMIØFoA³ Û@º Ëü©Rý)å¼ä{ˆ’PN9×¢XÇW ë…$ÁLÌÚX#œ¬PŒp¸?¥ºƒwŽ…^ÃýkQBоEñÄ̤EZÌâ~Œ+™©±ëšÀ¤ÙƒµÜµHˆC(l¢sh›‰:M4F m¦!‘‹”‹k gXHºWúÊ{ªy–¼ñÚQ»ðÉH]˜Ðú‹û/Yë ÷ZÊÞr|ÿm4ÀÚÃÅ4ŽÞþÑKý;|Sn#—T*›ÁÙ´3*/?Dñ­Ÿ¡i9(cX3رb}ï®2}Œ)zWc"ðÿðH2T½ÿ‚-§-áÐÈù³ œÅкà§9Ýë. 5ÞXŸ¢à“&ïœÍŠ»¦mƒ…x׌÷P+à)•_íwã«ñ5<4pÒWL|ðßúŽÅîúÇóÉÇÖ]a&¿óäü Cs{|ô’ë—Õ-úÞó==iñ냧cºˆhÔ3­^)*ëÙqCJrG1ŽÎpï>º¹ØTêÞXˆ\LQø)x~3E¡p!Q}ï¨Æ]”ñÕa™ [,îŽ'åƒYañ13AÌ{ƒ4Gø­èƒ¯ÄŽ®ªtÂÅ•¸y˜pW8ð]ì=Ýš‹Ø@:’^zHèêf‹´Ôqàͺ1øuNŠ¿'Z1í9ø³ÓK­‡uÙ6E9½$X¿H‡Úoùýª »Ü@µ6ù~2çó¹ø. ¿ )mtçŠÌgw+Ü…9F e0°ÍœÃ¶<ûRÚÁ‘ÿ ó+‘¶B=ûdC‹l û>·l„ôL xKÏ,8.eXFe(ê Ë)W#96†ê±IÔ‡Ók1ã/+¡äÜþÒHƒ5;Š0Õ@‘uÀ¤ñC¼¤ó³r" ›×W8&_b®H>G]ÜDÓ$‚Þu†Hß±Ø(xnro%ü+À` Üi«bCrÀÓõÂÛØÿԇȒ endstream endobj 429 0 obj << /Length 1943 /Filter /FlateDecode >> stream xÚÕYYoä6~Ÿ_Ñ@¢Ž#†—®õ8@Ž™ ‹Eb¿í‰ÜbÛ²[RGRg0Ù俧ŠEl«íž`÷aÑ€I‘¥ºXÇ'Z¬8üÄ*ã«D)–étµ©^q»ÚÞ­hòãw¯„£ 0œQ~}óê‹·Q´œe<«›íœÕM±úw®C‘è$ ¾ùW³e4ß­C¥Tâ ƒœžvnsOw¦6mÞ7-=ni¢ƒn“×uYßÑòžÞÙ}¸7E›¯ºùç«77£²‘”gZ…”/˜%¸†]½ŠSÍ„ÒdÛÛuªR- ʺëózc>‡G-ƒ¼ë•Ó4 úû¼Çuü‚j÷Øã®2¦uÚX¾¥£ñ4ˆX"ÓâS+Eœà&Y*¢ôá³ddFšåuAÊ.2U‚ñIÃdz™¶†&e¿ÌE@ç*‚n.ö”g2ÅD4Š­^vÌÇÛR´-{Ð>oóÊšÓ›¶ûY¬B &8Ä’@­éÝþÞP°M•—5…qaÞq¡ëÁ#QÜ®!š?Ðܽ¦!ôw°ñ~ ûM¡Ö"3Xî;¢ûY!²UƲXÆ6’ˆ)ZÈ@–¥rHHÔò8º˜Ö^kH¨-:Ž±öó€Å ¬d,r þŽsî(Õœ2e:ÕÏFtÌDªŠ‹%4=:}_!³4Oê—Ñ’(!X4¥_bÆÿiêÞY¶-&XÂ"-^´MÅà‘i‹Tú÷LS§M/‰üˆ#yXÒÛ³ý” }>‹±C0Ê¿aÿ*”gœÇ0Ì&îAï û†ËË÷mÙ÷Æ%fY{é§`aèiŠ)»sY™wCc²ÓOC¿ÞÈ”¡óc¦•KšOÖÐt¢àæ¾ìh6ŒV0N\¹òrvpŠ¨"ŠøÀË-ïÊÚ8^¶:R6ÍîPÕÇÓSÇüú:ÀêÜ90pã£+7Ön–›”`ëQ| G~4.¬£dÐE ï•ô|ACE×W4ò%Ï Ç(‰NçHö$>xëç$úÅÄøYÁ“@çã™8'<¤áqAøqä‡*fI¬ýÈz“o0ï!Óº.¨²Á°N“©ÁÖ2tsâ!›¾^ÿy Ç'€2LEóV Ì›- Ìéñ®ü •2N4¥Þ`$á ö0§lGcNïj§÷À.ž¾Ð%:$88ȃ–Å¢RA÷ëÓ·Ö°ŸIØREL Œù”­Ã˜ÇÁWNEèàõè]Ò?…vîú:V ¤0@ƒOlƒGbÛ¸ab=p¨ð¯«K-m >4;S™©×Ÿ6 4 Ò·î̺Ex“0™HïК`‚EˆMš°$;Jl_!º¥ÓìÌŽÎÙ­/‡1uOçÿ]Ùõ‹î‡Ê’es÷kÉxk ¼QÊ xËD;á$cœ—Ê´£®49V¸´ïÌ¡h }‹f±˜ƒ/4K¸xig¿P0SßAž—Wâ²|}U_–ðìªÂ¬O¡]éH{U¤ÜN¯Ú×ýܯ&ü1BÓ׎J~fé,í9îä®›K:Ý%ÏŽ‡«òB\>¼¾ª.œ%'L¸–ç¥~ðçb {ÚolëͤW»21Õ.ز©‘üüQÏÆŠt-N ´a–À–ð¬åo>í8ÐÝÐVo㳺¡í£/RK”#Î/h> 4ÐIëG‹-Ø ³ ËTæ»pB Ê!ù÷Aw&ö^úáPÝwæ Äýd€íSõ6‹å2Œx[¶Ì硘h¦šŸb¢Ó F¼„bÎ@-Ë ý¨q‡bô]>ÊTq ”,â §(dÎsÈëú9 ó ÞxFÍj!I=^¨™ÅÿÛ ŠÿþþoOÐã)Ï:ÂYµ§dO ªžÁO),§‘` :Dj&qÉæ;ƒ¼Ëàz“Cùié&|ôv)È櫲°ò£Ù·¦ƒ ¥ ºQõ]¨žtS÷`[)ƒ­cÙÑ#Ý›À¤0ûrÓÛR*]ùƒ‘ÊŸ”ã·LÇJg÷óúq`EC;h‰µxè°Nè£ý@O›]Ó <šIÖÓ[K’MmdD© ¾r+®ä›;f|D³í“þ)?äç–¶/Ž®IOÜyÉ„3É’›ú2B%‘ËñÀLß°<0rð c–ß ttµ8ù¡=3-¦+*˜çtÑIÎC`§ó¯ØÂ"@´Özhuã[´¸iZäZg]8ùöÈPLMo˜_ù®öŠ†Mw‘F‘guZȵ¢¼ÚQpêrŠk§ , NAtĦwîÖf4ê`æZ@˜äÝl1g"e:¼•·z›$l‚cK¼KH0×;ùnçkÓ‘€ …: †—æÑ{Ÿ£Ë)$;Ë´TAgï(íl–¢ø<ó >Z“0:­8ŒÞ£w!Ú$@ žŒŸOà³Dèàû-ñÉIC‡¡ ïQ­|üZ°Ú˜†¦bõ%õ¼€Ç[êëû²Ç8‹ÑˆeÚédâ™…5=…-$5Þ›'<°Gkð]GÔ6Ú`ÜàwLSíá+¸{7é*8#›ÒðbS»ÕI‹ßMKq` Ð <ÛYâò½ý>tÿ­ø €Ë8 endstream endobj 432 0 obj << /Length 1356 /Filter /FlateDecode >> stream xÚ•XmoÛ6þž_a _ä¥bHŠ’¨º°iaë€ÅÃ,àÊJÌ@/™DÍ-Öý÷É“mºrâ$@øöðx¼;>w ›Qøe³ŒÎÒ("™³¢>£v¶»Ÿ¹Î/ïÏâB†{Èï—gïâxÆ(ÉhÆfË»}QËÕìàj?ê²›‡QüÍ<"~íUsï¦ôºt«ÛyÈeоwã›öNÏylæ0™w€âœÓ4Èæ.8»^n•Š9?Q{ƒ|^ýD Â"áÔ¯óOª6 5¨%y°RuÙôªmòJÍY`Uü<—" ó0–YðÎôÛÎUÓë¼)Ê×0Ì¢ *µ™gÁлõ¢Q+k˜u¦€Î][U­½»3LÎ8+DäÍÊuúÂàÖåje*ëÀmC»;Ü M¡AãþY„'û7æ’H€'DÆâú1ƒ[SuÉêíe³Pçç0fnå_{ cDÄÏbn³ºÛíµûÝðÛK×Ö;_¾ìâºoÅ¿±8‹=vÐ ŠYXDèA&îñp©ÎÙâáíe½xÀ›•Ì=Éœƒ­¤ùÏY’e³Œd OŒ!DJÌHš¢-oiÄ6‰¼8#<ƒX$™qq "di$ ,&ŒCà2’D *çPÂñ4ŸÛu†>ö¢Z‘Îö„ƒLi%|”¤¦$E$…0¡[1à. ìÁq<•Ç§Æ+£àÅ”dIšŽ::èÀI²”ÈÆX]NJI"ðMÈàXšjáô4 ó'-œ¾Ä‹9<¼4x˜’á–rá™úkí8céÙã@˜A&³p÷Œ¿X ~Þz£A=Õáqº ‰óIi¶;B&o n`é —ž½,Ü‹)˜é€Ð1NÖªwyeǘ@—@š6‰ È·þÑ-&¥M§´.QÍAÊRÍã ]÷–2Q•—ãIHã2؜ʼH<¯\óa¨?–Ha-Òj_ä Pgó‚o¹Ýã}d)”óNu½öáSh<<_GILÇÝ8 Æ*{׵ɡ¦)Új¨4ð(ÿ¾0¶³XdíÄ2>ˆ)×ÖØ6Ø:zžâ^ bÔ ’:‰áÞø°µøW8UÀ\£¦l1î¡[mŽÊž>ƒ{gЉLâY覄R`u²äé>’Ç}Ä^줇ÓuÔWÇÚCâC˜rYs¢ËF‘Ï…‡w”ï9u>IWa”4þë]^Ô”uõ#Ôzv´e ³0²„éÛêĬëqÛЗ8µY1µØ·õocþêw´nÃ}Ù”]®q;ʉökŽƒ @¡€òSn4ÄÊI@=|Pm”^‰ d5ûcWåʤ0ohTŽ4ŠsìíP­ÜpǤ00™Æ)àFH— xœ{ì,Yþ1 °„ ÔAøß0^©^wêã`Ÿ‹Éû)¦=]öú¢Î›!¯þÚ*)ª¶½ŸLq %Q²MÛ“d0È |[áä[»úùÃòú÷å“À¯™µð2E•7÷C~_bÌ"\ûxB"Ê=®ÚF—Ÿô®>nÚ‘(à›¥ËU£QJ‹¤ 7ˆxÌ»¼†èîúm}`_|rbfYºU’')ñòDrz¾0?N㩇%;õ¨ÿ¡B_£ŽÕ&ÿŒúên(}&·–õoâ~Cglò­¬Ñ~}‰.«Ï¸¼.ì‹dƒIÞ®G2ô¬üÔî}mŸŠLÌIËï–×?]XÞ‡>‘£ž*b4|FëIÍüý{ÅËvÛ›ƒˆ\µ5ì‰%Oa#ˆ}ƒFÇÃ6~yؾ¼Ü×O™céì‡1ÿ[ò?è1} endstream endobj 438 0 obj << /Length 1297 /Filter /FlateDecode >> stream xÚµXÛnã6}ÏWèCån¥u[l ´Á&Ø¢h­>dóÀ•èX©,¹ºl ß!‡´%™²½-’áEÃùœ’¡ ¿t‘’E^Ê’E¶½"j¶y\`çãÝÕr.ºÉŸWW×·a¸ ÄKIJ«õj•/îJ–.Ò8un~­—®Ÿ8õÝÒ ‚ÀqeÃŽ£RÜáðQT¢á]Ýàpæ´¯ª¢zÄé®)_6"oøòaõËÕûÕ^ÛÐ÷/4KJÛ í¢Œz1IQÂ<0mØFB⸦Ct;û”ç›%ì:6ï~À¶’ƒ. < Ã8”­9B¶#þ¨· Ñõ}Ð;Ѹõ‚?DVW9öózË‹±Z8@pé¦)(£×êÙ²¨D‹]n Bl²ºì·Uk±KCˆ¿¯aG£º²h«Ûjï;¹ÚfÂÀ7SŸ_ð µúJAú…Ð@úß"9†Š“C€Tš¨NßõÀ~½ëŠú?òr°^JX¨Ñv¼[Quo5H%Îq†¡@4æ ›çL4ÏzŽ4O—“ç,w¦¸äQÈB¥ch;“æ éEZ?µ.ÞÐ…†L ÍÌcèwçëÍ«RõO½à™WöºZWè‰-¯z^–/úóF¯(:s®(¯ó­°2¯Ø›;$ó‰ÅJWD[×ö£Síæ§ÕêýÇ¿ÝÍ‹Zbæó5ã(¤NCôd•ügI¥Û¢i»±¸MZoÍ÷çs9þúú¿Ó!Ý™úøõ‚©¤ô8æ’|Xy&Olž0KÈ|zœÜÂmA,ù2{<_ äâ%ÿ¡ØÎFè««¯%P窰¥øLâU]¯a…tÏÔ{ØŠ7OãÀ½Fej'éœpþ¶2þ§KÕ0JIzÐäR¼ëÛnðÌ XäË›.\©=ibìEi¤ÙæÉ«_ä;7 7Þ¾têBøòB¯`Æ©eêQ?Eˆéí¿hñBŸ¢Èqîó^°¯Ü"Öu oøð¼¿ögõ|˜¿ÕÛŽîé(ŸÂÖ‘G½uVÖµöÁýøœQƒt¶¥ăÍ7”¯ƒ‘õõ%uôSêäbÍû²ÃÁge§Øp©ô—Bžrº^c;t„KGÈVÒD¶à¹ž1ðEµë;Ó…ƒsËUY ŽZê;ëúõ?ÊJ½^á;¹²Ü‰ ñOKíÏXbc2Lr˜¡¹þ* ”í®}^»Ó¯¶{0¸YV9o4VÝw`›'ïÃâ·-~¶øRN+ƒ ª%%U²4j+‡í†ã«QãØé«\48…ÔƒNßš)(ÊÊYM]^ýÕê~-pR ½àhÏ19xÞ™4aƒ›ñFï‹ŽÈq˹¹îЧÁŒkauðPPŸ tµBL_¾4‰TŠƒ#©g«'ŠÑEÂR X©¢)4 ,ç0/­[%Ç߀´]Žï¬£JÄHàÑ$YÕži¢þM+I;"“„)¸dm;_–!\ Ê^ÈW]-E…ò@õ¢Á(Û+ ³Ö¸O[õ¡Â¬‚Ĺ]&Lü 3¡±ž—:ÓàSÆ+Ó)Kì x¡Ãþ/Ú•P endstream endobj 442 0 obj << /Length 1941 /Filter /FlateDecode >> stream xÚÕÙ’ÜDòÝ_Ñ<­¬²êÒm0ØÁBÄzö xдª§eÔR#©}püûfVfi¤FÃÌìÃÆDŒª²òª¼*³å&?¹)’M¦µ(L¾Ù%Úßlhñ¯W$ãÅ€Ï0?¿zô䥵™ˆ")äæj?guUm¾^ÊÓèúm¬µŽÔ§ÛØý{¨ÛG‹ßtÛXåQ÷Šö¯»ý¸UYôn À²,%³$‹¤Üþxõõ£/¯&­¬RT1ï×?ÍÚþ#h¥e½+G\æ¬2Àêötf؉4CÍ€a:g(#Ò\žßu9Ô;±kºî†±âÓT˜Ìäwõx Q•Û—ç­Œš‘öÝi¬»v Í5šè+‡6ûpT0ñ§« Y%tš¤Š7ù=º¹ÈÌD×õkÌc£”P™ÞÄR i õØõî`¢ß>Sb«º]/S-ŒÕA¾ 0–4B›Tyñ X‰\„ª„ÙÆ6UcÛXFÞ£g™¾cKNÜ´H@$rƒ`W©È‹[6B#ϧ##qù¼«`é#†ë_í^tí¤Ž}×(™,d)››Ép»¸!²g2þlÕÔ$–™HC¼zB0ã’paHk…Ì'I˜’* ®Ì?Í¡…k nhåƒM‰wFĆöD™OÆŽ@× ;¶GE85‹Ø,@BÃT%®‚¨C}sÀÒáY¢~pHbRŸLÒ%¼ìÇHΚšÄF\¥sèpûÿ¹þàÊ $§©Œ^nñþ=áÔí0–íÎy¶šs†îèŠ/(Œ «PÒñyp=îÊ–@7®u}9úJñ5Ë’ªÚõŽt¥üÀD0Øܹ‚eãz‡æÍàÒ!q™¯_òXKÿ BÚÁý䵕(јÇSÙz»µiT6ç ²8[Þ”ïZ_{ÅDVn±¶2O„Và@•ˆ$çÜzò1$–²Ñ+¶OEÛ3=¸,ésS¿…Ëù%[—ûŠ/¡µKÍæR•\1ÓuBŒã(cL$×´…`3&P}ü„"PVPÒçÞÛcØ ?$6©Ÿ'OëgÏÿù´þäØK:ùÕSK Ê,Ã÷5c<]„…\áü8¿yöüÛ§oîá̌՜q¼&û÷¿]¦þk2_›»é.Èþ»ÈñCyt:×çq=tRÈ„?‹uWäèâ2tt"Eÿÿ-t.}õ¿õñe-B„Ì»püWè…"Å—Š$nÜûòxB‡âÆ·Ž¼öXÎ:ßÐù¶KÌarðœh‡œe{3Ѻ€M"o¢rïÝî¶Þ“Êõ|_çò¾üDŽ¾Šz}±¼a“ ¯ÏèŽXɳhà…ʲ"úÆtzèÛ»c %Ö†o„Ðy3ûŠ¶Ž‰ÚŽñŽåOl#Ü•-7’^ü‰Hvç†ï†":V®rñš™¦­<œhÐ4»¼aF7Ä“ÛÂ[å±s©è¢‹_¥Ð´ê ’Z&«|Ÿ/,œAÿ¤ò ÿ2ïü}>K]êo Ôs•/ô¿{N Ø÷h{ÉÔk‹© ÁbMZöÌ~¨÷¤88ÿ@ã}ÉNpuR,wîÓaº'67P0Ï­·Ç@Eăºþº®Ú`§†})8 3 Cåû°¡†l˜0-JŠ‘YWðoÜc_‰øS_‰÷ó¹æö„“sZÚ¯ö+]Èô³džEÔðf`ü¦‹‹"|º(ÜF…¤ÇȸúèM{$ÀÔ1áúl„Áe²û/x!Ò©çJJúxµ¤ï¤Ï®xÕíé›\ª|žúÈ>ô0F(}Q³§2ÑþÃ÷ŸÊKÙ4hÝ:|\qUÒg6à–{Û®§íG˜Zù®ÌyÜfl?•…¦‘Éð H2÷«*ÅÀC/â¡'ßÕƒ[«Ch¦Å FB—Ü4¼¢ŸZÚ‘J&Áv-ÔÓΧ Ó©¼´AÛ \ý}S>ÝpÞ᥄ƒ?öeM5ŽsÓ¤ 9ˆq,ßßfÁ„[¦ËaçMèBjnÉcI{ œGÚÚÝA,Ôï/ðw„†‡‹¹¤£%ñ1q×tœÁ³<›ŽMÇ/ëþoœ‹µ(nÛ¯xÿ¹˜H–sñþ/ÌÅ:ÌÅ:¹‹uæb„RômF׆MÃuïDÛà­„FcM%,°æÑÏj–r1ƒk®‚´¦»mz=pB–i˜žuQ@ƒƒ?ŒÌ¦dú)n6%ãËç3ràF¨… 9êg@\ÜÜöä^¥På8 SÈ—_ÎGnÐÓϵ+ÙM¸ÆοÀùÊ8T9ŸŒ‰Ö©<'vš: ˜fq¿ûãø ÀÓswOŠæ˜=`àÖ6Z>hàέ]¸AdɾÕy!d¶ì!çC¸^Gì’‚#N@’ UÀÚ»/™Ã$³‡ÜÂ&ÙüõB¦þH~,?ý^Eù›©C®DH`â œµw8z×d.2uñ®Íªž^Üwªz:"سýIÀr endstream endobj 446 0 obj << /Length 2284 /Filter /FlateDecode >> stream xÚµÙrã¸ñÝ_¡§„Ú5)‚7ãñT%»;“¤6I%ã7ÇDIðP¤–‡=N*ÿž¾@‘ŽÇ“Ú”«  Ñ>(µðáO-r‘†¡—GÙbs¼ð Úì<ùÇû %x. º#Ì?Ü\¬ÞÅñBù^îçjq³³ºÙ.n,]•äiîüðs½tƒÌ©ß/Ý0 ‡ÈѼ*eóÄË}Qîꆗ;žDN»ÑUeª=ƒOLS>Šm£—w7¾øéfÐ6‚W 1??W2>—R™—-’,òTñÑVß-2vÞ³®Å–—}KúáTó°7EÅSSúŽ§;S‚VmQw™ŽE‘ïÅQ*’¸úÔ™ºÛíØ¡ÐMTc/BKöÝ qn'^Å W…žŠyÌŠüÓ}s­®Ì›ë¿^™ï¿‡µâµR^GB«fˆïøþÍõ_®î_GüA0®ßhev#¾<}{Í£òg™ÇϘcæîÊF[ÑDúÜ΄” ábÔ«½ ;È=·úX¼àkͺ\\úe/à‹^<÷‚Ð<_ÿ_/Èÿ7/øòmø/Ëô×{Áu¾Í?VïRˆ¡çÃEà=@„‚Àᆑg ã^ä… ' œ¸Ì¢C¨œÎ}4-øB˜ÆÎ;Ó´O1:ÐägmA?§îÐò¼«yü8ÆÑüKè §kê’•RþD«0õ’0õ#ˆyÑصZ÷í®½d.¤lÅÅ&±Þ¸à8áâι$Ø0·.ùvŽ%8mYŒÝª\ºQàÓ=oêãLá–¦*ª›}¦ƒе¿[º‰ÊèIÐ 'nÉ>óSS/ƒÔyX*Çl‰‰Ö*jÖ„xF\’ÅiV< œ Ak´:Žµµ:¿®ÜK’tâ.›šÄ‹px¬¢2k…Þ2Tw2ò°/뵂A4.#²…Þ4uÛò6Eœˆ%L#k8í¾ÑG^¬˜x*GµÖõÈ~l%D]#à‰çèŽ Ò¬cëŽ"’®æžN{*M'8±Nè­¦R©\Ê™õ åg^è§_uŽc×®ð2P”.AÈzÄ¥‹¼ø¥7Ë8 kÝ:~8b’b_`)R ”,hê–×ö±ÍZ<+óƒo±>á(‘kx©J^Ï´MÛCÝ—[ž¯Á,©SÈ‘J¹õ 'BF`wÂ9ÝLav´Vx4ÝáëçwbG:Í[¯±‚­ Š=åC (!Å•{·wþb ›àÒ^”. ó¸!íbU.>\ü}®ÖEŸUID¬‚<Œô¹L)5[Âa²xhäDôµš}GÊ‹£á©I/†Bá*Öf+š|I`’xÉÙ`Vžÿ-òÈ7pÒ·Ÿ³=À͸äˆc/WùäQŽÝVŸ¤üd Ô)ŒIìN¹§À‘}0U¶ñcâO ;PqDi—P)ÊÃŒ™ÙBgG‡E]¥ØTI·ï÷#„k…f+ÎÉF—¥°1Õ3¥L;¥×zƒÂ9˜V[éS‰õAj3ÎŽVOÜoŠ¶/e…áØÒ»hxÁ©¡`¢>(Hœò;ܳ~‡sNÞÍÇ–ùò“Ç zª8ÙŸ¿¯á’ÒDÛÙò ‹š2”•NᮡÛöЫnìíe=àbABÝäú'¼ïºgªƒ>·îŒJ·ãkÂb6Ê&PÒŸ¿Ã¹»9§U1¢ÂcÅ­Qå`›O¿_ÈMdÜgþ¸ÂeUP%)éä6DÜŠ¾adßëfk‹ý¬øK=ºZ 4Õù éÊoXÉçþÀûz. ™„ªä+‹ùïM©áÞš£UW}&ñ6e]ïgž¢/ZBqÉv‰‚Ìû¬á¸+Å/äIW#›Òjk@¿°h†ô»E[ôÛÚ¼R2ž–‘L‡¥póXM’_iS–E‘óc±ÓôQùÖÑ‹h#)Ú÷lGú_=yâ endstream endobj 449 0 obj << /Length 1027 /Filter /FlateDecode >> stream xÚíWKoã6¾çWè´âŠæP¤µ½‡n³ÝhÜS·%–&²äJrÒ¢èïP¤l)–%EQ( ˜¯yq8óÍ,Š?°"jžG"Z7ë3Úì–·–žüxy†ÎEB·CùÍòlúQ (‰hÖ2íŠZ®¬Ÿíwñ¦NJÇõ<Ïf_;.çÂþ©’ù­Þªï=ùð]á¸,´‹K½¾*ÒÚaýäàf\"ƒ€6xÎ/ËOgËU‚±‘æ+ÊCûý®ý! -?ä<®¯0=wSØ—Iž”q¬ôr«/¡¦uRÕÓm.‹œÜdEavã|¥LE AWc¡aˆ5Ò‹M|úÎnªFn»`Ö™ñ›Ù.”/Õ_R–r•ñý 0A˜Ø‰?Ÿ*"Ëõ'÷-<BŸ¥E©-ýB• :“óÀLN&¸ú膀pÁ 3 pß/ÖñojB¿çÒTI˜ÝÏk™«mjfœ™î4&êå|¡G-LÏß½ëØ2D6¨OôÜqefÚc= cÑŸÍeæûVÿI+[*1ÖH6ÒHwÈ£CGÏnÆ ¼Ñ¯²WMªxmf2ßlk=Mef6¯qk(¸OXð<m·ºÓ0ëÔŒí:Ó#SC423¸ <ð2#ü“™AU€ø?êßõðrØ¿)ê»GÓÖ0PŒ(X†°¸%F6#œ4À÷ìòU°n/庙 [U.aüêåE&õâ&˜é@{â †pönQgšq~]Yç×mÙ\ˆßÖ&ÃŒ5â9s¯*!joª"ìE˜»²Rv{ûĘgY“KOæL=Ú9QD8ÝÝÁè^ÀrDpÑ’ê×nÔ–Z%¦Ëµ\½ ÏÂBþ\}>Ýj ÂJ®7™üBßì^ Ÿ› èU‘jçf¦7ÙTz]nó|×ÂMH€MTsÃío“4Þfµ>{t6ÙÖ49Ò𺣻Wp¬‡[ù˜ä'ð÷X+Â1Ä9lEL`q{ø9úˆ@)Äøq(½_` à°Æáá@ñ#¥|Ç¢µzu‡}Ôypà> stream xÚÕkoÛ6ð{~…?ÒM¤’"õZšë¶šnh ìú´LÛŠÉÕ#AQì¿ïŽG©–£¦M‡˜Ç#ïÉ{)bÆáOÌR>‹¥ôS•Ì²›n±õfFÀ›—'ÂÝóà¢wpóùâäé‹0œ î§<³ÅúÕb5û“ 5÷D”Æ)ûñU5÷‚„U/çž”’y¸(¦iW¸Ã=m7¦4µn«š¶kk2]–y¹!ôžhŠ÷[³ªõü¯Å¯'?/mà øB³ðæ}»¢C»„Hüd%ÊR‘iOŸÌ2d/IW³¢m×Xýl·†€Fß8(/÷]Kà:/r (PdƇ2ùA *ZqվͫÒùÎ4{rˆp„#e£ØO"Ù>yŠwfž¨¼œyBú"¤3ëXTá-ùîâò48ß=»x}zy¾;=œ Ó–ƒ¾ •£ÄàJ eN×.h.g]ð¯?2<'•¦8þMÅVÒç`Zï î÷dàGi@÷_ù1p‹ö"¯pªŒCöÊÜÎ¥`¦ -WûÚ辌å.øˆ}À%xlpµ·¶î²g…¹5Å÷SNöz"OÄ~~=$…7“Ž’$Š€ ê¥}7÷” XŽ)ƒ'`i£ÛЦk̺+n+ZãH4-o¹PäØ€ô9’Ñ8¦›Ü 1ï:]€h@¾w\{Où¨—d¿ã™®Û<ë ]ïéåœ £—»Û䪆@°ü›ÚÖÔ S0‹ŽØº+3Œçæ ÷ ¥ ‘šš ¤Ô½f€¸³š”øÛk 1ŽÚ±‰°PH§Æ*¿1eC ÛÛy2]t¦±æð±!yÙ´àÒ¬Zãô‹C×´nó£ôôZ’°_ÖtÜ›uã4¬¥¦ÃùÙT¨Iøj” XSq顆´Ï›‘g xæ@|%ˆ*œ•+JùaŒ=Ó´ ßyk$d?™µî ‡ÇFÖ±Tž¬€þ”]”ÔòÓ@|iMÕ´lò[ ¶O–T]®¦K*÷CLÖÔõÃ55òîÕTyMã“5õú‚Ÿ_SE½þúŠúˆÊ9Äò7SæòqÊ<îy¿]Ë sðˆç…Ä“ñQ™ËÄøm]ñyçgâßy?_ GŠ_N). ›L|KÍßþlÿ’]µÊZk Âcïw“Às)a›!n7Ùö…Jý˜Ó[U¶sYU…Ñåtëï ©õ«#rlþGä£2¤PƒÂÃöÏAë-ÖÊ pµë¬€}çÎЫS¥‘Š!|ð 1%=‡ÒéIªûvÍ µÆ‰§ª>y—:/¢–v`‡ÛsøÙÎ d 3Ú¢·„Æ®oÌ=z Áiü(©ò–æ}8gØ–b†>Ha4ZÓ Å¡6ÕÐZ•0‘XH»ËVÔ»„Ò`Ãø(†Í a±í)³ž`˜³pÓÏYV†½ ¡Õ¯zj§HEë^×t#`3Ô¶‰¼Ú7¦[U^F_;+ZEQÈþÀÉiâYç~Ê£wzUlÖRö~Åcš@…qå´àCáJ›½€ê#àÔ·ˆûB—›NoÜiÏø†Âooæ‰d‹7?¼>sé¬B_&ã|¦¸¶qW]}4¬òF/ ³²³„:œ%Ôx–ŽD1þ?˜%–î{6C?íœÞSjDZFâ~ßI É£9þÈz ~_¾E •úèð¿Ò¯ï»PNOfÖ…÷<ÀÇÙø[÷ƒSï!7Nõ²“ß²Ÿ£ºú²N÷@÷ÆÿeüœæKç endstream endobj 455 0 obj << /Length 1659 /Filter /FlateDecode >> stream xÚÕËrÛFìî¯Ð¥Sª)×û⫉{¨c{ÒIãL¤œšÖeÑ¡H I9ÍtúïKJ”hÇÉ©Ïx± €°x­Ä„ߘ$|)ÅOÒõ ·ØúvBÀ»«áè| ô÷(›Ÿœ^ÁDp–ðDLæË}QóÅäOï|e6mVO}¥”'™úZÞû&/o Õ®2Î_WS_Æ^uEûYµl§2ò>Mij ’"â‘'‚é_óßO.æ½V”OT)ô@Å8àôcÍ„Ò¤¿dš%S?¥÷zê ”TðKx³¶ÎYƒ^ >$¤fJ‡p²ä7ŽÖ2¾¸©ª"3å¯Ä„û>ô;V_D,TêH¸çPÀà8Iº£ÑëI®Î‘9HP}áµyUº½)Š ÝüÉí?ð€)2½“ëT8c:‚:èHA¢ Ù-z0ˆ½•)EF¸²*ým™·ôeg'|ZV5a 'Õ¼ÄúïØ5Òߢ‘ÓH?]#LêNÙ¯Š!›4f=D7€ ¢ÉèK1¤<ñ` ‰£Rœ) XwD² ¢3ù¨Ç¿*¾§‹>l€>ÕH¿.¨ï‚c5UÞ%tŽ¼nZjc/³M»"ÐÖuXß—uUã1NXë¾#.Q~Ë@mqhŠŽ›š¢—q cØEÌD,}1Á¾Fax…bx!÷š¬uXªð€‚­ÉzÀÚ–Ñ0Û…sYgÀJza#’¡÷¦j”veœCˆƒæÖé9Œ"ÐE îUeñ!á¤c*"þÓ k7BØHñ{ÇÑl7’_·õ ¶>'ÇZg‘&EôG×…W‚c ~…Þ+'=5MF|Ø"ãøñÀbDP¹ø°Š£±øqh,D+µj¹gšŠ„M ÄÚ ö+ãÈ -nz±§Õ„º¡3¶¥á\_Ü œ#wÄ™;Œ†2‰N w†Àß„“6¥qzÁÊԆؠ\Á6EÐfèHI0kPÍJ§ µÓtÈ6_g ËK>’“‚rò¼ZoòÂÀ™7v¢‚D:Ç”8zŒ&b9!úáÌOI@Ïýâ‡ÒÐñÓp “p á`8 Y$Ãý$Œ£~8 \º)¦6Ïð!`QúÑáTÆ}± Œ¯$ x|wjiç>Ï»QÕ•4X»±Î©Dt‹½öh>Õš"7d¨Ã'n66jà…ÔÐ~e0*úÁ0®ö„˜ŽW·5œ“±ÇÆA¸§@ª/ºÊ~¨z·`ÉÒ²›áŒ]] =Èð†û`hY›´®¤‘€ŒªÀªóHžH†yд ©›ØáЈ‡Þ 2 ŠäƒG!î­ö¶´ÞG¬PôÅXQŸ!œp.±˜®´´§j¼ƒ³é[Smë4k°^i*7Hˆ_ÍŽ}$¡­ývDB”Û>¡åÆ4yJàà‰B(Wš‚˜ÂËÅb²%+lO°Í\µöÒÖJØ®ñ¿+_5} RÏ((t¥­SöXŠÛºãw!ïKÇÅxn#OD0åYá­ë¸¡Û5å­#ËÀÌÂ}k;ÞÞ1›4­ê½ýEHùh 2¨Œ—´)³lo8 vÏw$]Üá6Ô†›&Çl¹WéñéÔÕÙÞ©ÃWì¿ÚúÇ–FÒïŒÖ½šÆ hú»x  +÷o4ÁÓÇóµV, ä£ó5Ú#m„÷xï÷îi¼Ùc#øL~Óm¦fû¿¾–[±xàF! Cut¥AÀ„RÏtƼ¼~óãœÀËëwWž_Óú~vA€_¬ ¸~;uýfHu~ýÇÛW¯/íèXü1ï?tgW endstream endobj 459 0 obj << /Length 1153 /Filter /FlateDecode >> stream xÚWÝoÛ6Ï_at 7CRßKR  ÖC×·—e´L[ dʨÁ°ÿ}GeKŽ’~Ðy÷»ãñ>h6£ðc³ŒÎ’ Y˜ÎòííVëÍ ‰owgÌÉù è$^œ]~Š¢£$£›-ÖC¨Åjö—Çâ¹Ïâ,ɼÛÏÕÜç©WÝÍý <ß~BO WºÍ²©e-LU#»F"ôš\h­ô—w¨S>rU‹ùß‹_Ï~Yì½8?ñXVòå¹âá¹KI:‹Ó° Ä£]¾ŸƒfäýÑÈu["]H±’uC{i}> ‹Pí¥ó²]I¹nÌJU¤ø0’d¯‰–jyšìV˜b ÉcP6öû«¨ÅVY#û]”­œv¼7±’k¥…¯¿ýùñ3ÒŒ¾eçÞ#·Rd·"¯«éÑ])Eã@i`‰îÅ=³êâѪáÒ?¦2¢†¿×j£´pY¦ Góf öÕ~ñs5—9q"´¾ÁO uÆ(Ç ôHh1÷nEYŠe @}ÜB¸=ªCbtÅBJ84]Š0~>Ò½^V4 ýuÇÍÙïu}–8^"À°8F-Fc’ð½qˆf˜RO­§¬Á$~:Ô6 ­, £^Š$ˆ H ©-Å<12ƒ^ÅÈÆLC¶$AÚK­[U9Ô'U–H-a>&žDÆT¹BÖ Uˆ¦_’xû< IœÕÏnß,*÷Dÿ­çÞnÁ óô²±Í#ä¡w¯¶ªu Ï(l*÷-äÔÙ9å„%üÕv§ð'‚G$‹Ã^¸ÚÙ\Ø'A÷ª°fºYcI†½Ã®I‘[' ä7œ:¿Ýéã†||ÔñlŒÂìE{ÄŒz‹Bm »’”…ZYŸ:Õ´+_»goœR? í¶¨Ý¢p¦ÚfÖBC°QÞ ‘Wu-s£eÓL•·Mx+Ù´K¹·lí}c쟑Êí• LaUºe÷°’½” —ЛÎ$€]XxÞƒ!ÞÖ¸mïØ®4­r Üâ^5‡||rµ”«nÌÄ ÂØ´ñQB5£ªÒ—PÑÂúñ}%%Ô ÐÕ¿è<¨7Ò¸w&œ£›^´A‰[‚<Þ&0èE[ܱg_Gc%J&S"…<>š­w‡ ±ìº®¶H­ªœ'yYU\yR¦pàɸ>bÀÍÆ)ïžÓÃnÎMù–BbÓ}çr£ÝçYHx:žkScú·SÇôý[3gj†yu†GÐ=kn§Û!fxššýgñ[aKN endstream endobj 465 0 obj << /Length 1861 /Filter /FlateDecode >> stream xÚµXYoÛF~ϯÐ*6×܃‡b'’6)Š&jç)ÉCR]‰H*¶ä¿wfgyze9E‹ Ös|;3;3K>óàŸ-¼Y(%[¨h–lžxzµºšÑàÏ7O¸¡sÐP¾¼|ròÚ÷gÜc oÁg—Ë¡¨ËtöÑyµŠ·MVÍ])¥#žÍ]¥|çCW´Ô¬2¼ú£œ»"rÊ74¿(—Í\„ÎÍã ¨½ÐááüóåïO~½ìPùB<>RÞÇ ñs±hDŠq©è'OçÀé;o²"«â&Kiº¬Ê Òr÷e±d]–W´r“7+„ Òátጇ @£%—Û&/ :¯›Äëu rpªnØG࢈q/h¹Ÿž ÍÌ ÅDäÏ\.÷i/»£æk™È«¸^}ò|//ø᧚\*&=1>í‡:[îÖ4ÞÄIUÖŒ&F­7Ò÷Sš-ó"3–CT)**Žñ‡Ó2.´ÿ \>óúÍŸÇ4zßÅ‘pÄñïI7'âg=O1Þ×4C”Ü3Éòõ%‡É£a u4G{ñ(˜›ønïHà^ò¶Wý¢W}g|k…ygbÑÂqöáåÈ×1ÜKù6ŽnN±=ŽøÁÚ÷C'½šåøz¯ q@E»v½W­ÍÓò^ùÿèUT=Ö ÚeFCŸuš¬nLÖ¡…·ÇôÛ-¼Ûw¾éEΙòÕÈ_m–:¯ò«¼ˆMžÊLÐeµ'U¡ÚÜà¸>µ‘-˪Îü¹wšŸ={š í´Þ½=¬á4\Ÿ=wz½Gƒ?f¶©U‰%¨ˆÎI%bk¬Ü !¿Ó~·l vN^‡Ð-HæAEª-Æ æª †¥Â9‡”ììší®!fÈÏCîEÀAWL]èdù§Ô/lÔ5,.YÐÖwÍxÂ8jkF­*lc +iVy ¬žè ¹Ç:kjQoƒÛ xŽ'¡é'+èl¹±Pugªè- ð[²Ü(ŒI~½…ì:Y’ãÅÀ•¯s?pâõ.ÓÈÎÍ*3hwu–ã0tÊÎÒà?„«N.NM†ª›¸Hã*¥N¥;£æî—lïÖ ‘‚bã¾il@ˆíÜ¡bAßÚS<ÔµW(ÿGÀkì¥þSáßÞÍžc„,Šøè‡"x Ù‚Æt\õŠpšÐ=HÍ®Nˆ‘דo×qb†ºŒFÔÈ¡ SB š^¼*ß·j¢ô—Pº ÷èN]’Ívdl­X¶ ÈèrÑF»œæu›ÜaÕô‘š±•¤Ódm³½ó¢Îø.YË‚.Tv£+Þu…à#›G%„¬ ÕBîì•«à¾ò®×) Qcc˜5ö(“p“ ëÿ7a¶¦³öB2ÉéõˆSÓ]¯Kʱ[š¦YRV1Y˜nÍ.Aׯ [Md]ûÞx¥jûqÝàÁ9ÿ;nºËµ­â«M\ÛÛi¥ ‚¤¥ö©þM[mm$ötÝUG8ÖMáÔÓÓ–<[uDîÊÞŠ^ON:ñÞIžŒîEW0®@ÞS9®¸ô<u•g ¿òÆõ_öÏÝäxôÜm|[zãe4ñjÎMïtxÖV’™o¾ endstream endobj 472 0 obj << /Length 2134 /Filter /FlateDecode >> stream xÚíYmÛ¸þž_á¢NNN\ñUÒm÷C$‡ëKŒ¢À^Ppm®­]Yr$y“´èïCÉ’,ï:½»$ Äâp8r†ó ‡tÁ¥Ñ,朤"™-·Ï"G­Ö3üøÛ›gÔó…Àö8ÿ´xvñZÊH¥t¶¸í‹Z¬f×Mæ!Uiœ/(ç!K‚òÍ<䜡ýÆVî;wØ\›ÂTº)+lÞâ‡ê¥.Š¬X#y‡còO³ªôüÝâûg¯¶’±3—e9Öú8‰`a~]*„rëbjJÅ‚¿ÏS˜ªÎÊÂêpñšFñ1IS¹‘aøÐçN£$‘\µ¬°ê)y4!,‰;yÈ$Uß!M(I"1QœOÎ=4”çŠ-¸GSäPJ„ìx¾›‡Bˆ Ùd5š°Ü5Vg@]ßãÇØ9š™wUVÌÞ ¹.·;,Õ¯Åue8ÉV[Ù5™ÚÚ0NIš¦³YË%=3ÆhÆ¿‚§ûÌ4“›žH¢’ô`Ä÷Îá<’‘HñÏ3áûiJE"žzŠ‰™‡/8‰Y|†ùÑÄÇ”g°1y^O›°(äG[ò±-54âàÓ‘õtŽ¤­©k½6}c Â…bnoTB¤`L»‘´5¦DKþ$Ä2xmÏå>ϱõê£Þîr3µ`ˆj4%”¥(çcUŒÀìÒ¢(X‚Oe+S!µÙüй‹Zq°Ô~G€¸«Ê›Ül±QÞ¢Í7z_×™öœ&϶°# ÇŽþÖ“ #†À†Ãú?8GV÷­»Ý³J”ø»Êê¦Ênö[˜[ 'TâBœ¦L08-RºÊJ»"K¨ݘ­i%ZRV±XǪ[r'cYnwv×{omgªÂäž%•ÈºÊ~Š(7Õ@>lŒó˜¡.«Ú®’Š`±ñË*[gÖøýexÃ.qäÊxgñŽØl`ó|<¸-­1€é ÃwSžž’€XEx£X‡*’Éà§HFÙ½¼ûÃÕ!½Ì^¼ ž;…|Lh5~w•½@—wO ÷kºÎÞ]ß½C®+üÑ@ò…¶}™ï»„µSð¡‹çØ~ë%?¿˜ÚªR÷N©{«Ôý ¥äp¸ÓàÞÏzµ¼ªÏZ÷µìO§h„£ìÿôzF[ùT×øÀ†ÇÆtŽÄáÀß8_1uƒM ®¨ ßçOlr8±@¼ÝKØ\êb È3•ûbÕÒ}ÜJ¹?“¾±öÕ3ì›ÒƵ%6wºàäÿËE äÙ=ôããÛÔ¿ÌQªõ}kÖÚ˜q®C…‚øEg‚2È5R—ï }€8ðe.ñRúP;>ì ˜ÈîÆÓ85¯ßTY$Þ}ë£<Äl<’‚ŽµdŒÂ09ÐòtVÖr?¡ÓX¨ÓÉúº4ð+¦,3äxÂ怿Šñ–—3d`짲„ÁGh“·–‘±ÍgŠ¤1OàãÎQÀhï‹o‘K ˜XÜÁ.Do"T:ëI±¦žÒK&:Q٥ͯãànÈmBÐebîü«oűä¾ÒïÝbJ‹‰…ÛÛ•…¾ä¤–T’X&šS2yŸã ÝPNYwÄ“aPxÚê?ÒÛ+|oìô¾eÀ3d–‡„Ÿ†Ñýúm·Êqèçx¬‘ŸÇVþ@ëG"¿ç~BѱÐG#È`SàÊuvèÿ¢‘?>7ð³_#ð'O~Š!&9?ÄÄ=='¤‚ ¢ŽeRŠìßAýZ§eÁb{¬'…‰‘0§§ÂÎD]ŒŒNl_JäžÇÛ7‚/ N yw‰§Qú…ð+>¾Øÿ¾ÔgÃW|€¯Ÿ²aD’˜~Y“Ÿçañ((<-ð±õÂÆ°ó]ö1«„,z!“>Åé•:¤‡oô-¬ñþÙvÿ‚|mqî¡+oÈv$@ ÞzR‡™:ϼcÁüh(í•F¤+Kä¦1#àÖ'ªº™¼"{uæ^‚Y³Á/¸’•þîh ¾ $*XùþbÍ~/hÖ&D„7ìFÜÆ1ѶÀ³Âï]e°c¹{LO©Ìû}VuIŽ],SAÖL\ ëM¹ÏW¶‡{*4`xiG£ôU[]ó%7_+Ù7h> õ´ð(¾*‹o|åÎísYUm‘®ùÆ×úôM]æcåŸ17ë¶l÷»SLI¸-´àß ‹óãúõøŒð8iÔDü²2~f" c+ö5øšüöEä ÎÊ"•Ý¾ÁO ¶¹'Ãm»2µ™-üÅèîÁÂþz4°ªcUŸÑöÉ×s["ðo)–Ýnb¹ª> €Ïé`ÝÉîkÔÒì„M<²àâD^Т$æ¼Å÷Ø¿h‰Ã[KïýròM0ÒY¬1us±ÕÅ^çÿ\Û÷²ÌËr=í]l§oS‚L€C05,~ÿÞì'ÿaßË?ÿ¸xõÅ£ŒÇyÆù½ü\ë½»äKŸ 9Éí8ð±F/Ë¢1›Ã“DQú7ÈzšJgEã¥Ø-Å_/Þ–Ê·ØU] j¨šËàà4:èèÉyÖÊѶnï9qæ|¿-ê)ð"Ìû‹Ìk?´ºRö£XØC endstream endobj 375 0 obj << /Type /ObjStm /N 100 /First 887 /Length 2562 /Filter /FlateDecode >> stream xÚíZ[ÓH~ϯ¨GлΩ»„F‚†fA°ôÐh`—å!ÓmèÌt'(qk™ýõûÇv;ŽCn³³¬´WªNUûùÊ 1+­Œ÷Êâ‚"ËxFE‘ðLŠ­U&jE,hlأÊ]À’h‡(¯8r™Ð1Bœ¤”·Š 9ù€™¨ŒÖè$£ 1NH g“Ðqʇù>L²à SN§‘Õq6b«<:˜ö†Ñÿ›Y¥ƒÒʦj$(§9a &VÎÈr2ÊYçG–¬rXr R9åñŒRfÈ€$±¬öèxtX+¯MTÐ'c@‚>y9))ÏÂ1$ó,Ü`¡—ã ¼w`X´ì— záš±:0) úˆCÈbßèä ,ŠP‡…ƒ¦8²8-¶³`/Å‘Ps`(Ú§‚Ø |‡} RgeÆ£sY‹m¼“E  ÁbS ´9ô$% $ÌZN‚{Dí¤ãT$‡½HEv°*ä £¶‰ÌZœ—NTÑ=‚Ö£ƒN [Fƒ8ŒÐH:p+‹­bˆ`À¨1M`5&„°wLΤ$«’ÃØ.ŒLp‹0›XNJI%£…Ö c¥UŽHœ…ÛÂ’ÃIÖ•<Œf¡À˜GÖk•¢Wh)Á½-¤$MâUP iñÕ C‹>†a¸i ³p®­ø›ƒÚ‰Ã™õ&>åOÔQ’VoTþþo‡D Â@Mo¯¯?Ž~ü±¢;MKõð¡ÊO¡ƒ¸¤?…õÒS X»þ"ŽÓô`°‰|ÁVùÙ|vq^”êƒÊÏžœªümñµTí)˜½¼½(æêÞÓó3õìj¶(óÉ—R…L‡û ÙÛß¿*úµ|v^ŽËb”ÿu|ƒ7S8óùe1-'åï£üõÙ+E£üü•Ò™æfùùí/eµƒìƒéÇãEQÉ—Ÿ• ÝM…aºbzj«˜Äb‰ÔæÙo×ÔýX÷›ùv 5¹Š©ZÕ<ò7#OÊÓ±nµ¿o«”ïò½×ZE|‹¨¶Ó„ÑFAiÉ4s¡3f¤¢ÔcºnlGÀj|¹>¸»æ:ê·Öz•;tZ¥åNkÕîÒmÂXãý&®ÓZq  X­ß*wZëCûÔnÞxIÛîÖ|Üž –YàÍìf<Nf ði@ðBú8y¨% ~qwÏ}²@«2¬mš¨4¡ÐwMÝ5Oc®Š‡ÚÜ2;¦oèdm•ˆÚ¹6[ÔëºIÀúÔúxüu ¶Û‰‹®¹¹q¯¡,'8¯3×Oå“¥§CÉÿ³’€èkïБ+x9Ç·>ÐŒµ9@ƺ9@dtf5Ðz°ûô›ðÜTƒnëëbÓúJ÷~óþM(…¹4ïÃî)`Sóv[\|åO§³ËÉôsuƒÀ]«Á½ öeìà™|üxöqý€Ÿ+8 p,y9êôzüy¡ Ê£Åð‰ ò“ñ—¿“ÏW% 2…œ&s²x”?/Çד‹GÓÏ×…íyYÜü ¤›Fù«Éb¶«L"¦åïëml@V’\# ë^>›yùÏY>ÉÍoòéý%Ÿ§“ëBBÆî#óJ:\“V.f@Ÿ‚€í ´lW¤ ¾#-o’–è›ÒzZ•È­KÔØçM>}*æÅô¢ìk]~3™Þ.ªJ­Á¥už?Zž`w0 a’^æö7Åbv;—Mä Y ½*.'ãJBãq· ‰¡†³ñ\$ÝeK wL+; ê¯Àíö)‹´ ,ï@îU,ÞâuAâï_ÿòkq±\ýüFîÙ~G”¾A=vM=‰wRIµM§³Rl#7qá¥wd5ß)Ù/'ÓßP±góK\ª½%ÒÞˆT˜)órÓœá~‰;ÌnŸ¸±f>zÐ=ªD?Wù³ÙÛ™‚ÊïãÄ÷E3$ómS ›`ø”Ÿâæ¹î“`R_œþG®Iß½úéÅ£¶¤õ{’¼,ù6@¢#R[¤ÿŽHßCëÊJ¢ÇžlïtÓúC÷Ùõì\ï)ɸ;ý6ë«ËO{m« Ç0±KÓ§ßzÜ¥µ2øµ¹Æ¥„FpÞÐzq¿¸µv‰Ú>RÀ÷ î пŠù¬ÅAåÕ¼(òO(PùyŠ~[DV·‚؆ÍÕÎêÔ¯vòŽwŸjwWb$½Wbäµ!Ñ~%fµþsu›8¢þ[Šk!`ý—·ã‹¼­^>mýtGãk3y[çu̪7Òž3ygí)eÈ ƒ¸àÝ|RÂ×þ¡­~{UÈãùôËm)ñ›.bØŸ!J6ã$¯ÆÀˆüîá}¦¡L—LFŽ:__× ¼œÍžÇG—±üá\–äu8£ŽÀItƒ L.GK1“ß%ŒYBú²@l(Òݵ„…­0ûï|Fvß7äm¼aLë–Í9¬·‹Ý£A†Ë" ô~¹iøG‚ƒuàÖtÀæÐ,Ã|l6¡«P! !”<öYÒ'xHÃ><¹N¦ï©lw0Ç*d²àÌžæðòÃÚ¶J±rQ<ÈLëå‘.wÐÍ* tŸ9c*£Õõç}~ÛV”á5E½“¢¬±}Eú/àˆƒ¤^Ç Æï%u'Š;>Š}&P#¦ÌËÿ < WàN4\«²+eçõ—r2›.úñlv¨*=É{‡óÑ‘j×ÐêƒM‘Ž†g€cŠa«3ƒdwÌ"Ë}…26vÐçã²,æÀ}+XÚn…w:“¿l¥c†“l%#OàÂá5“äïÖüqÇúuƒÛC3Žu;(ØõP„Ë"®OÛè(XÐ…c^¶mPãÁš[/j6¬¹ŠZ×–,±ßJǸÚD6ß‘æÜz’qW9·CP»~°âN…l²ÎhÜÁ’ÿž4·ŽwÝnx×:¿¦¹@æ4’£uò[éŒÑ™ö¼ßµ©—ÿýgÑí®G´ kw‡ˆîÑ0®ÑÙï¨:øuóûù[ø%/òÿµåÓ×O>&Àƒ¤˜]æ ›u™†^ØCm~gAtÜ+ h7î™8sÈÄ7Hf“Ù (q Ç×Õû‰b\Þ΋#_šT81e²㎓„q´ Üô/™¹úïA&IŠRÈȘÝ/‘àwÈ3~=ô ãÀ™&ÚJGpÿ?‘ëWïŽÀK°^>ƒ>8(c„¬þotMyB endstream endobj 476 0 obj << /Length 791 /Filter /FlateDecode >> stream xÚ½WÉnÛ0½û+ô"¡•ÃE›ƒ¶@8A‹6‡XEE¬-ÇJ,J•eùûRâHmJõÖ؇!éáããðq†Æ_lŒáS:91M¨Í Ù¸¿`ð³…£Ýòü.n\×Àh8B#l„ó6T83~š× –QnÙ”R“\Z¶ã¸æ÷UÌäP±ˆdãúkjÙ$0Ó[ÙŸ¤óÂ"¾ùl‰A– /‚}ä›xdý ¿ ÆaÃÊ%dOú¥ç.¯Í;xè£Àðgˆ©#7-»¾k"a‘‹JëQ„Ì7–€¬†KóñtßIË–Ïìe%ÛE¾ŽJÞ†MˆX+ÖR„üÒ à~DÒ>3^ÀìTÚU ãk¶\¾ÀÏ ˜‘±œ%Qî²ËE§ZTœ¦CìÂr\lƒ ¿Y°gZ›%xÛºüi^…ãoã»pÒíª#D”ýß­“ß5—t;/X%/V:fjünâ|UlM»8‘š¥ ‹¹Ž‹#\#Œ6 0¼ŒyGÊøL6¨4Ót¹NøJÁTý¹KVÍ„ô–ƒÅÕìZ"mZµñF‚µ­"-Æ)vIƪ$±n§5”½‰{1ß&·±f¯; ¸Ÿè£J4~ÛI.` ² ®m˜ª7¯ ŒvÃŒ6§>OA‡óu±ÎA;iVÄ)<`M¢iZKæ]zÒÁÛÒ¥÷_uùt}nåwjôªÁ>^¯}ÄOÓ-Ò,¶ ®ê÷€ÛÛGü©ŸxgÁëºwì׿wH[@—u¹o‹òY¡”ЦhÆ¢ð±"m?u ²wõ»¾ Ãñýç»Û=«Ÿ®øM¦¬„ª÷‘ Ÿ*ÛÖd–VÁ«ÝuÞÜ1*cÞdKzÖ’ÁmÌ`_`dPA3,d®Ì€¯¨|"Ô—{þeµ·³e‰·9¢z‡õ Òź¦„º³Ê©V¡DJHsRÛŒŽ`vPèáA:Ú^”œž íIéj]ÑR(¹ ¥ÇS(5…’w´”ÎÈLaäŸïÜN ¦P 4”´…NóøÓæh5E;gIÑøÕr´öXþGÿ j €ˆ endstream endobj 480 0 obj << /Length 1005 /Filter /FlateDecode >> stream xÚ½WQoÛ6~ϯÐÐ8‘- ­lÅVtha5°‡mªLÛj-JåÁ°ÿ¾£ŽtÍDq”Ô+˜wäñôÝÇ»#CƒþhÇAÊ9É“,(ë«x˜í6 ¿¿¾¢Ö.ÃèÄò§åÕ÷¿ИäqNƒåúÔÕrü²xÑyžæá«·Í,bYؼžEœó02C¨íìb‹êF*Ù}Ó¡ºF! uY(U© N·¸gw³•«®˜ý½üõêçå­`lbXÆòn\óÓ¸hBIgÁ>…´ èAvÐæ4z h NªÏôÑõyA„g‘e#™1m.ƒqNxÌ m1vßÇC¡z”úG-íD]¨}±ÛÝØå­Ý »ïe7´l£¯ªZ*]5 UUÔRðãZœk(®z]©¸ÄtYà(w>{Ü×oßbJ\]„Úfÿ ¢%ñéev‡ªß¢4ÜUF¨”î 5£a ‡Jœˆ1BÙÔ@Ù p,-ïÖa"# OœB¹k{õEkÝâ•ÈìYìµ&h1å‚Ìæ<A˜ ’˜q¿|> !Jà gqø¹’”š5Ž@Ža$ ñ_3ù¤ÞÑ¢í²RjÝX‡jûÚüÚÙ…J㸩>›Ei~0ÊÍSœQ"¸pñµt”Jq´tNOÐNo·ƒ/À+¥ƒ„€ÓÚñíz«úë@çP0¹—¯ëÆÄàöq’…}ÑmLqpn{àf%Qí·EFEÙÛª1ZU·; jõÚÙΆää®PŽ®8&Käḷ®>’2é#ˆb¤Câé$ÙIeŒ›2’Íó¸…æ‘pgcÚƒqëEdJ%MCI6ÄŠï~{ƒv% íäa[•Æ~k]hUcÎ#ÉC½E¦Îoegc¨ LA¹}‰)H<¿,'Œ2Ÿx?VK,&/K)WûVãÔw£õ™‘ ›ÏÑOµÆÖbRßv™l·e&áPüg2¤câã¸õ¶³Ú‹‘9”°ûT+ìE+^.ü>>åKï©ÙXùŸ»þèé­øâ 1Dc®þY:]¹•t>rjS@Q§a÷=ðìä/-5.øS\ˆì£1(¼ØÞ³»¶üƒ×Ÿü :N©x˜R:Æé=ÑЇ£™í·Iˆ šZ4.qÔ7Êú5‰£ÎçÍÄ´¹ÉüëüûpŸ‚ endstream endobj 485 0 obj << /Length 2434 /Filter /FlateDecode >> stream xÚY[Û¸~ϯ /r±fD‘Ô¥- ´³ÝEŠt[$SìÃîb ˲­F–\IÎdþ}ϲdk’A1À˜<¼}ç~Hé»þô]Þ%ƨ̦wÅñMHÔnÇ?¾Ñ2o ד™}xóöçît¨²0Ów»éVÛ»_‚ûC~Ênµ6Æ櫵µ.øw_5{& ‡’÷ïÛÕ:JƒöG6]Þ=-Ò™"½úíáïoþö0‚qQôJÔ8óv°igvœZ¥eØfµvq4Mœ…5…¾ ð®…Òr¡2&áMp «Sá5¡-°?òŠ§H!ï¹SOuy,¤ å‰I0´<˜×u‹OÜüöç>YÀÔ壷UWC-gïºöÈ+U! Ú(í4³pêÚ}—ûï€÷N®†C{Piðk¨mMBJ‚¼(ʾ/{i;¦öÏýP™†zbúÃA–1rZÒÔ+ °_oÈ?ˆ ‘(Íh 0½/ ‹bÛÇLj•±q$9Ïd*·áDª4§Òû÷Ä"Ä1u~/ží‚S@‰ ¾ŸÄ—åĪ3¥£Œy‡C놈Oc;Ò†­EX^.ø=gµ)G,Y ¸ŸÛj‹ñK†Šƒ¼zºx —Þœ@Ããf׶²fŒB3—Bl‰(íãö䘅]ãHÅ.¾‰ñè·†‚·Í,e¬àª¢‚‹“0Žc=CÅ\ƶ€4NceáâÈ#y#–…ÃÓ¢û­ŸŸ³'®3Ä»óK«4Jæ2í¡P«)ýº`CÆYr‡+ 9SÁ» ­JM4/U¦J]’c0Œq‘xÛŽSZÄ&ä;ÐñÁ5ró ‡6hÁ ìô²²»BO|GQ¤lloòÆ”]~ÀèŒ'úðäY†,ž.pŒ–¸˜÷Š³Ô¯Èw|ñ3¨ü6‰aNÜÈ Pù%)0E´S6ÜÅö˜À!u½˜Æ%o4¹à a,Š¤¡Ž6³@ 9Í|]­á@%´°z]’ƒUᥜù†[håt²à¸>ø…ÐçG¢:–¥mìŸeÚë¢}&\,:X©Tpì8y¼XGb0§Ív‡¿q ÙçÆS(ã´y5ã&vKŒÃþ¬.4í çÖx»![|ºØ¢“ÊÕRQÃ:9ç ăR›A‹$„øG«šL›y††{hœ¤sɈè¦÷p;J h$%ø¥c y(`PK1€ømüJa3½ØbŠSŽ•…›:g*;ÉT>WU}ýºüô»ª)êóVrÇŸÈ­ßÂê·ÔR‡?/%¤’,»IlH+†/~ÞðåU‰IÀý|@¯·ÖG%jò½Þ2ÔØätUøÄ•ä'Îæ)f=UµÌ÷æÔAµLW} ±ypûxI5Óc¦aP’„Á»Ý&ºIÜ,¼{Ï7ë1Ìcg†ÒdW)òaCAr; †PÔ¥Ú+â_gºö¼?,›ˆù*qm[¼Ç?ò•X/hˆÖÎlA²˜^Ô..ºn¢£dÞ™²ñž¥¼ÂÀÑ–ù'õ¡×s´ÈP¶(yŸ^†I8z• RWŸW’Î3¹øL1P]z|È4ä7/o¶KR™ó¬JÛD´( >4£™úÊØFó”~k’©¡;O¢åŽJ«IÎýÀ]~óõ‚•›!ü–ˆŽÐT‚ *^_! > stream xÚÅYÝܸ Ï_1@_¼éŽ¢/Kö]ûpMsÁ—¢Èí[.Xxg<³nfì‰ÇN²-ú¿—eùc´ÙÜõ¡X`-K4ERäG¬8ü‰UÎWV)–ëlµ9>ãn¶Ý¯hðöõ3áéÖ@¸žPþåæÙ‹Ót%8Ëy.V7»)«›íê]"åÕZ˜ÜæÉËŸ›«µÌ’æõÕZ)•¬ñ¡“‚Þ~ñD¯û².Û¢kZzÝÑ@'çMQ×U½§é}sx¸/·mqõþæoÏ^ÝiS)¿Q-¤¼ÔËLõ"cÙÊdš ¥Iµs×ö›î ¾N“Í¡iöÇ¢k«/(°] ÅDJ”ÿ&¢¾>WûºÜÒÛßïÞ6ŸÏ4þœ'/žûµþxW¶4nvôlšÑðù ·‰L§Úï$h«å/›C¬Çmðñµ]6D?߈Ï÷pÊÞVuwëµþü„˜ ïÚ¶x˜³>5ðIÙzYºÆ?ïKxë=¢ëÜ —œnª«n¡à›ËAź«ö}ÓŸ^ªö"”Ǧ}˜o¼ŽYù?ßÇìÒ=œÊméµ}Ì;ÜÄKœ é'i˜âžÓdÝ CÛâph6¿ò”Ç<ê:îlÞà+þSSm'Ò[Z°2nõãO?¿ò²ìšæúB¿v¼Üà«üwmY"û'÷Ø-"°…Yci‹t%¥óäó}spÃ,xNWgš;® aÜ\íéÜÑÓ\Û\¬|¦—bw%’¸‰¤%ÒùrG“èÆ$å 6d–3iØÂIH^SGeL3ÐÛm[ž!",µbÆæcŒYÎÒ°%) ‚zE L”ÿ¼[eœ•Í}#Ve„¯6°Å(tqúó}ÙFµÍ,Ó£dïª÷1á¤e<-Bî·pH‡ ¸‘ÃüÊ…nÏ­–‡òX=­âv÷pT^0°ù½d&¢UD#øÊ°Ü‚öx̦üÏÓÜGó}Lz!™Òì6zˆµÍƒ²òãÇŸ*Ž¿ÞF™ fGûŽØ‹o¸±‹Í"¸%®–íÍ%Mòãf›–æ+G¸)=ó°í¨œ»§ÐPåLø‡Ø?ç3Q9;7Ҹ÷)ä¬8¡Âáþ²‘ ªf@ghîOA} .®hò»˜ÓÁÐX˜Â PÔ1‰d ¹:û­!Ùjm ŠÈµ×ÿ 6_8s¹ñàä(vÜ„s>¢ÎE“’¿C¨ÙSÎ8‡òI¡-MØÒ¥ÞWtßoË>ìË@áB @áZ³°Ã)_J A¶¬ÌÃõÁ‡ÓèâQ~|—i츩MáPèùÁ?þYûçæL  jå|q Üßí¹ç¹þ#wOAµèâk~É-Â%0qkb²sT¤™(µe u(_Þ½4Lšlî†þ¨»¦õ‡®:8¯?“)5‡•ÛEnŽ{ºùÌÓ ïc}$lîPð†2ÄÕcôTü‚ýts8Û\3@$ôø+†Q! á@¨k°EÜõmí Z\þ@³®ëˆbzBùö­ :Š³µ†t•ÏÁéñóWQ:T|Ûò¼i+ÏXì[_ã`È28~ļŸ:îHéùém«åV®C·l«ãæ1|Žõ ½ru÷ÄËxiÙPÉe‹"Ããk:â+èXtè—ɾ- ßßCÙÊ äléåHw*w7Óîæ_Åc‹Ñl©¯±˜âò[ïj–OqŸ±0l:€×5c?˜ endstream endobj 495 0 obj << /Length 1990 /Filter /FlateDecode >> stream xÚµYmã¶þ~¿b~‘ƒ3駱 @š&AŠ+ph¶Ÿ’`¡µµ»Blk!ÙIïßw†C½šòÚ ŠÃHš‡Ãgž™wþˆ»œß9¥X®ýÝfÿŽ‡ÑæùŽÿþþˆóÖ0q=šù÷ûw¾3æNp–ó\ÜÝ?EÝoï~ʾy)^e³Z+¥2õ×ÕZk“ý§­Ï4t|)©ñÍÇzµ–>«¿§þÇê±)šÏ0&E.2©V¿ÜÿóÝ·÷½2FÊ+µÆ™o«m½fBiRû4„a¢O”ž9bìͮ®Ÿ¶õ¾¨OMYÆSÑŽ)«º%lµ6\d÷/eƒ72+úÆ®­©ÕÖû8öXlV`”_WÒeåaKƒÛòÌÊþr¤ñ§Óas¬êC»uCMSÇ…ó¬…´L Å„‰—†çúG8VêDV²<Ï»µŒæ€Y@‡IAnœ×ÇŒw4v`ðL`eöi¥DVï>ÃE/ÚƒRŽÙîNþR6»Ó,c¤É¾ Æÿð vÕã‡Ðc/CQ ÙÒiÂÒ/f÷Vð})·M}ø™Vþx,ŽqÏ/Zl¿{H™3î}ÜIÐVŸúåqÁ{úV‡#5°EÑ€lñeʲkióAªaÚÅ7toDkÝ_pÊ^Ö1còÏLž0¥€‚qÙI9¿¢÷•-m_ÐçŽ-_œ ˆèD|º¸8‰ývE,»Öà3RË©i«Ãë Œ(­Í |Òº¬)§Ý=ŒÒç•Pî>ypæ±î&%4F2.t§ÆMÞïÔ W”r✩þéÓݧD*Ǥë¦Áœb_FÍ-œ{[mÀëÚxôÿ´Ù«µÈ2¢„{°³w]?¶ö[ R(áØ€19#´¾ïFã„ ű V{lN¸†2ŠŠ[Ê ¤EÜß´o«ŸÁÌå6ÎðKž8EP½Ü&±„§PDŠTíîO ¬N#‡¸:@ÆC[/B^MÜ%þÔG˜DQ´ð¹ú-¹0öh»±=FMTì[²Í`¤æ—Ôå~`:[ m˜ËMVpÓ"¹ Òý£¸ \Kæ¸aHÚÁ…Ê#\ÀØ8JcgpA'—ÌÂ6gbtC$gÖÛ? !ÂÇKùOðº{é§}0WØ> óâ°‰‹:åàwp&" Im˜r~•u9<Ù¦?VûjW4»Ï+¯³÷)ùœkX†â#²sš0eìûIÏNz‘TÌé>² VQ SAŸ‘U°‹VQ"_€}iÆýÖY¦m¤àS´aô© DÒØN1cŵ¶ƒ±S´JÃëÍÝ9 j‚C8¨"3 -4ÀŸ—iì ‰ë ‹p4rûÐöS.¡OäH€Úˆé3úî‡ßƹOu= âz:ûm­MÆþ³/ŽMõ߷؛а‡O€ý¿Âò¸€d%8nýµÙ‰=~««-MOœ¡,µçG¾ ÎÝç©;WÌr1q÷3'™%EÌÉ "B~&¼ |¨FùÚ”mIØH¢$’(²vtìw‘ ÄYŸ}ÆPÐp B×jØ)$<¸YÑ¡gÖÍÜ/à¢_ÂÅœ9u- SÐÞ>ìí&†|1Ørz(4€Th§-f›BÃ媫ùLŸ„J€6ÓŸ„ìâ² ’¬:\¡9–[²•r@¹šÚŠ”VJ¤Tiæÿ?Ÿ4~Úl/å×F¸ÅŸ=ôäés naÆQ Ò–Hc/“‘ÙÎòûh ÁÒMC×­ŠYÃŒó©ôÊù´!&ŸOŸD€´„xƒiDˆOb­ÈK„¸öæ<“ÂL"ªðà÷ &ק†qHC§ë5îìÐ¥˜ÔÉ4PÉÈë°1Ä`¸Ý‚ÆÎÓ@ | LJ¦–yq üxM? Ø3‡b~ð§eÏ€ 07=}Ü–í¦© jÛ¨z羃ӽ§ß_ª]ða9¼&m§ŒákJ[9¾è4Ñݾӂ1óA懈 ñSh„‹9íñßxІ~À$Uä´VÝY?ÓÏÛj_ZªraŸØý ’%øfÀ¸fÁÄ Öyóô…Cx‹ ƒ0i¯¢¼?‚ <º>ßp]nŒƒ}nÜRŸ¬àFÙ1ŽžeÇ8²cœŠ´`wû:Â衼Ám×Ý’‰_„&sÓ:a{j.b6x™“ùÌNF¸’tb ÓJv•QÜ°è¡2Š-ªŒÊÜŽ*£ž*£ø3UF}WE¢Sä¯#Ë"=MëbÅT©X1UúbŽœ‘„[Pb¡\* þ  çÄþöz©ú£õRq;éNNƒTHú}ÿœÄY›pòÐ9«žBo­£:ŸòŒCšæ.W9€:øü2ÿ¸²”ªà&µJ{Ô¡ ÏµTç˜ÊíuµT pH{f ÖC´ìë!ؤ.Fq3ŒÒç~ôeÕ†H0•Où¬|Êcù”FåÓïì˧¼/Ÿòiù”Çò)—Oy¶´=¨2.¡ò$΋‰1b\WHÕÿŸB*þGÝÿ°Œ~Ò endstream endobj 498 0 obj << /Length 2492 /Filter /FlateDecode >> stream xÚ¥YÛŽÛÈ}Ÿ¯N0¢Ù6›Ø €ãlŒ]8ÙÄž}Ú]‘š!B‘ IÙ™ù÷TuUó"Qò =¨ï]·>uº)VüÄ*V‰Raªíj»¿‰\kû¸¢ÂÇ÷7‚Ç­aàz2òO÷7oþÇ+…i”ŠÕýnºÔ}¾ú%úv-Lš¤Á»ÍíZÚ y»VJküÓAFµŠ;T},ê¢Íú¦¥êŽ :è¶Y]—õ#5hNõüTämvûÛý7ßßÒÆR¾P-y®—™ê%„ íÊX ¥IµwUÓ<~Úf}_´N¤XÆÁï·Øºé†æÍ®mö›²«6ûìðkGWé³4ƒ»x: ß¡2§¶eA†µHBaX†û'XE™8Øëm_65Ï›ÉnâÐjªº)W\ÚV$Q%ÂÏÉoÁêEGg‹[j&Vú)W×ÖdËxѲ>{¿~N…¶èmíwŵVk%a“‚MT(bZƒƒ¢¬QJP'$Aßжh  i½§~]ÚÆP&„à;{_$AsìYü$ÈË}Qwà˜Žûvøo‚/H"böH_h¸ttjÓ¶EǪ“żÎÃ^`.„2²l.AS»Ik!&ßAƒÁ—§²*¨WrvÐ|<ÕÏDq›“òfŸ‹NVœÑ\@²+¢€q[Ü»0„>†‘¶ØmQo ã,ͽ_â±ü|+“ X Z)ÓPŽÁxÍøp"ÒÑýnD#4C‡;«& •QPÐaª86A«0†h1£ D’Aóøs :ý™ì±$•?ôÆOQ÷t–Á~›þùÀxò_ú{÷᧟ÞoþþöãÛ¿ÞM[~¸ÿþã¬áÓ»·÷TÿßwÞüÒ„*“ã0•qŠsGlß37YU5[„¸²îiTý°9díh§ž}ÅÒyÎE\ÿ¼c~çvÑ€w"™ Ë´}ÊZžPgûÂÛ—œ­FÛÝ]”û ùǃÄk~nÊÜ‹ÖM¬°ž øj[tE¿AÉ_k ñ’èÁ‹?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˜”Ðþr`;óÊÉP[MÓI1£9ÝóHƒF2„5Ç’]&;®nz$ÛÒ?쨧nøß©áæðXGAálË_#¡ ȈÐlñ¼Ô4…NŽìaçýˆæØù¥DÄÞ‰îÙD˜Z37ã¹´ÀB·À~sò‘•Ž~b³Û Ðéü}˜Ý°‰àÎÜù¡ÏÜáŽ@Ë3œ-K šV vù!ðêdêƒÅCš1ë]½™(Tñ06ó’úÃëO…µ ó+Zƒ>“~0ÉŒ9HÂÝîÂÕ(Ž§)çEÇpS™«èŒ¬Z¼X]aóáaa‰Í¶ (Ì^ò«ÇCbq’ÁbÁ¢¤äìÇŽk>.]iYÙõÃÕór¶Óà[û5YÖ:JC,Ï‚¼qp¢!ˈ é©|âFhq´ H :,ªK "R¡±É·¥Þô+¾í5Šâyô2¯L¸¾.Ç4¤ÑSÛkÄÚœJî¼ÃG¹•ŸxîÕQs1þ\"Æ$ì|nÁÕôìÅãÖqE\Ї'¸à‘Ü>½9¯µ ëÃfS(g?îˆM6rl©f®4} ÀúìýoÝD¶ÊjÊÃj4†›_ô¼"1:w7wPŠ‹´Màa„ˆ¦š­Uð&#ê9¯5³¨xxhyb驺fö"ð96ɘÄZæ¥Ehà#³ô°ÃXç‡GG6.ÐHDà |=4uËO*1¡Àlsö„ zD(»êeO¿+ëmuÌù’÷wÞÀì7®>ýq!T^~#^©•:/Þ@—^@‡™þÎ7}ýÖó Dç Ù\Ù%™\,ÓÕÞÍûú4ž¼XÉÔ^•ÕpÁWðéܪ‹© ˜Y¢Î2M—Ÿ;• !d§Ï\Ww$_³Ž4#RL>Ua ä}jN®h|µÅJFç/´ÒÏhYdÜZjý-Ùð1òøyR/™\¢,Xá@ *è*åH#>.2^`cwȶë j×PÊžÜU1àÎ'§À?ô:Δ©ZÉrÐÆVêºò¡z¦¦ÅeF„ƥΖ)ªÛf¿w7…”EFk(o @Ù€õ”ü¨-mâi^B@"¹‰'¹É|<Ñ\¾‰f#ÓMFA¤¿`㔊S“·µ°9 rAåËûÜkûùQç‚$ Ìi½bÌÉTV“”µý• mÑ«ž:Ù0 Æ·€§¦ã¾“$…!æþT0ß›õr’^òŠ‹-çëCº/ÈéC‘”‚‚{‚·žàã2ž|94éé[Ò,ªa§kè›ÀENª— /ús‰€Ú(LÆÇ‚’oWîË*kïüå¡VÍÂï> i‚ê„?¤iwûÇO[à’ñ½;ü§÷Ý‹ó+Í:V6ø×+ùÛXÝpC^ Kë‚? ÑGÔÙNlüjú¯ás¨Æ÷&°M*ÝûÉvóËoÑ*‡>pn7È/nà~¥økIµútó¥ÁÒ¶‰S\IÅÌDÀœxO¤çzÛìØñGÌñCULO® ¹g”Äbõ·‚‰´9Äv}0̾ ‰ÏeOà“ˆcun Î2Y%i¨•ýHübl4®$#5˜ ›³Öc=øêŽ{˜§»÷ úð=ãå%¯phéVz¢ŒŠü]€Û endstream endobj 502 0 obj << /Length 1995 /Filter /FlateDecode >> stream xÚ­Y[oÛ8~ϯðÛÈAÄŠW‘-æ¡´Á,‚f¦IŸfb˱PIt%9Ýìbÿû^$K²7žA€ˆ:<:üΕ‡4žEð‡g*šÅ”"ÅälQœE–Z=ÎÜàóÕö|!0†=ÎݽùÈù GHE ÏîV}QwËÙïÁå:Ù4i5)¥};ãÁ—:+©Y§npy­ç!‘¾rï×ÙC•TÏ@#Xá€ðùŸwÿ>ûp×á„ü jù;ØE€ÛÃ’!L™ƒMFbrA‚Ë€QèÇÛ&iÒ"-çðÖ8 ¼è+O$’³ÇHPêäÔMµ]4 ˆð`‘kýX{ö{€̱ãþŸcÌJÿE¹-ŒíÌøÝû&Ï­ÄûNä}‘ä¹^üñhÇîY-ÌàwS6Þùu,rSÄ¿\ð².c?ß_âØ «*M‡§Ä«Sè3”#Â|†š<šJe‚bÆΔ'$Ûâ!Z~çÀmej› A•nª´†Âõ­©-™ZGŠ[1Ÿ¾\_O-.–‚·\0EV¶¥“ 9ÇÁ×9‰G"6>ݤ cC8hë™…eâ Û/¥‹_Â0R±z|W¤Á›ŒÇ …}Ô}IŽ”Õî©ËüÙ–à0ÌJƒÉ¼>f?•5ž»­^fl¥m £Ç¬ ÚTnÂø}ÒgJ !:ëùê9a?ÊsM´€òû¢Ê8, ´&j×\$¥GX§Î@”b>Ìbû=!ÁÆ™)séP àr‰(Q- S§\Q,»¸²%ÑÈ_[óÂ@›¾—y}²®wEÒM4Ú=MÍzIÀØ@ÄnÒdºŠlÖÞ2BóÑÆ¢+øØ£\š]Â1FXƯÊ5)é^®c{B$_ƒuîߊ¤LûºQl“Á<›5²1bø¸‡¤ì‚iÏñv0¶‹É‘R##mË¥mb¿¹˜AÏjuöåYã³ÅLÚŽÅŽÛlT èi“TM¶Ø扛àÃþ*6;ß“™š oW¯²´öCíÅT^/¾¥›-Ê[˜Íb¿pkßñY~ÊS®%q"-´éîÌ䃕9fâö«›Ùq騾fLUNIÁ䈯 5Æ– 9–a'b¥U°sÀ±Üõƒñ¸¼Ù˜t¨Oìõîëc}`}ÆPlºF)Ì}Wb…@äc!£È7¦Kþ¶ë“9C‘3ª$1i{e†”ÄyV¥³ÕÙo¾—Ú”Fˆ@Ce ­³÷ljµj5Ó®#ƒR(†D0 Á >T̬„!¨ó¼w¯]) ¿guÛ»õNØP¢—qÆÑø˜Œa®~æêÕ0áINr1“ˆ):vq}Ÿ×÷uö_s$4Ú5ê·@;Я|§ž”msܪ*yöc³…×ݱ¬`vaP‘ÇG† ˆfuŠŠ”#ÊÈHEHËl™oIJçÐÓÇÍð1|” …å)øL½Q{øÖïZÇï°­_‘ü†§8 V¤ì&8ŠŒ¬ª›ûmYéÜ' õðÙÉÐMŽ‘bÎ  ‰Ã§¤QI5 ûè8ÓB»·Ž HŽø•(Š˜§À’æ(±—Yû°V§À‚®‹â“` …øž¹t“ïáÚëq Øiáˆr..£r„ Z„ÅW@&U¿±Ô16NŽì9Älˆ˜‚QDäÛB›,Oò½*î¦Æ(‰8’±„EpÈ£§ „'†Íjˆ2OÊÇ-tÀ¦ÒÑ^¶^^ßÜ\Ý_¿ÿtõåýÕ‡ûK´šœýxóùîóûOý›ŽèIŒb|z,€YŒË`ò”Þ/u‘de=®7·0×Þ}ÕY±É³UÖ^Ì,ôæy¸O9!ÈËxQÌ4|¯Ñ›¶DI*^¸òÁ?rçÓö‡»[“›>ex߃{g§›¿íñÂþ¹»žVàÔMÏJë‹C°Ïý‡¯^hpáó²È¿qëçF'Ña“? =¡ ‰‰;µgñÆD¬£$f74wnƒ?äÔpÄË=©óºeÔîYmÛéÝ)î'Ïó`ßÓubOþ™ÞV O"lp(³MWšŽ/Ò1†l¬@3…„t­â0g"ø‡*s«>¤ô¯×ÛïÞ€‰_ÆËXH·éÂõ¶æt-¶;þ~ ¶²·XŽ°SûÏ >„RæF8+%Å1(tø×–ûü±ÐþÕc,x_;¨þ|[¥EfÎõƒŸ9XùžlóÆQŸæ\@XlÓöÛ*}ëM°Ac©$£þ#±ç¦C$xw;˜OE®@ÝüÏS ‚«8æ» ²(š¼‡ALvLØ©dbÌÄpaF©6 t,[÷žån¾û(+Ë´*tíã/ôÆ&öŤ]¨‚à様e5¥tDLì ’XÒ‹:½âž^«J#oksØX­ì}ëAÍLøþ] Ö¬ endstream endobj 505 0 obj << /Length 2438 /Filter /FlateDecode >> stream xÚ­YÝoÜ6Ï_±¸'í!bù%‰Ä¡½¶ R-îê>5…!¯´¶­ä®´q|ýÍp¨¯5å¬ÓÂKR$ç{æ7´ØpøË7™RÌj³Ù^q·z¼ÝÐà¿o_ ¿/†ñl翯^}ó&I6‚3Ë­Ø\íçW]›ß#™nc‘ÚÌFß¿o·±4Qûv+¥¢t”Ó¬öïiz[6å1ïÛ#M÷4ÐQ·Ë›¦jniùžÎÔweqÌ·\ýôêÇ«‘ÛDÊ ÅÂOäJõB.“Mj4J“l¸È(ìUó½B²´ÂiW Lò¨ûvŠàYÔщ¥Ö¤a £áÄ·ÁKKÄxéÏx™~£Ÿ÷ïC—ªŒñl¼4oŠÐµR0)Ô°ÉñhˆGT埣Ž¤”L[í R‹Zúý¾)àãOÎt¶yp;Åd†Ö›__ýÇ«rIR¦,Qb©K¯¥a•0“™¿…°²Ì ½$ÜUÿÛÆZGeÐ.8M&»Ä23'çûÀÞõy_Êf nØÇUW’›ÖßìiS~,iд½÷ಇ“âµ7ÆÂÉ RK¸ÆÓ½À˺þè‚¡*Ê ‡©”YeÖ%9užÑ¶©‰ÓSSõ´—ã½ë|kË«¾†í»³B3-í:³E{¦Ô]{¸?õ^‚®:Ü×~¼kÁ6Yô T~¦µ;œœêúy$„ŽÌ ^"  ­ÁÞ?uh¦€HN•f<1Å¡…†q"á*ÅŒTÄÁ©9ú´¬X¬7àÕÉy¾ÑëùæçÛº†\¾n›0iäW¸UÙÝýÊ°LÈ3¿šqÝÝ˼<½è3‰QþyÊ몯ž‹% ?eÁgÂ9SúØù3UOuö9Á$3ük‚»íƒÎ'–Éì‰0~«ýã0èh~<@c²ÚŠèq˜ìJ”‚…CÚ05úÒ‹ÌsCµ©Ý} Ú'›Ð rÕ!ÿè²ÑZ‡ ’EÞ$7^änûèÅ~¸ƒ=ËjÊ]Ùuùñq]h(x&5_a:ôþŠäÎo(‘ dEYÉHï—>Ÿb­ªP9¤s—=‹Éœ›8¢DÀÂ¥·ßÕÝÀTº¬óLs1–˜üSy]´‡¼j‚•1S ÂXlÚû¾‚šk ±ÑÑ/•D-eUrªiÕaRÀâqع§_k8 Л9Ћóºº9‚ŶFElgB DF¤´Òoê*b"ñâå>?Õ=zDšP´Ã/ ¿¸Í B¡§5ï-0ªüJåOüðûû°òDHWŒÚ#Åk”ÖSº¬ "‚jÀß2w>|¢“‚€ãé]wý5*òºë}°Ò€+›ÑLU]*,£t£rœU )ÿ\” …ôÛaà†ßOÛ$òúTv4§¾þˆ„‹h—÷6) ÁZQAw`»óSw•W€¿¤ò;ÀûÒÕœº˜øBExéEâ^/”iئÜ*¹ÙJ`ÁO/0-ä´Ì>1-B^A4m6m¨@«¥mQ'áü¡Ó)év‘ê¨8ÈÔ¥æôÁRÉ`)œ;ÏŽdØ*Vr® ¡@KÌ ‹š›º2V ÓÁzÞÐòÌp°ê §)ÁÔ› F‹¾€–œéaï`)¿ Ä‹’¾¬¤J'ÚËÔ  MI!K¢wä8±†Â›ò³X¨ºsØŸ#Óóœ\AvÙÓp-spÔÓËM˜0c’!E®2t‹wnk0 æ  X‡Ã½c…à"–@ “t=ˆËÌ6NR}µUAÈݾk cVÃÐI2–-"öljL¢îpáºÂ•k„ZXéÞ¼{ÿ£ÿ¼¯êò5ÝÑ_\bïüWJóoýkÑâjy]·;$çvý@ì·µM_~‹‘*܉ß ½8v*&NâÅ1Ïϧ¶*hý±,G>æÜºÏ á ÝWüÙËŠÓáþÚ-œir®Å9‘u펔Ï=.íª¹÷‹ï‚^ åOŽN<£¸Š —zÖ‚Ÿvý ;~k’èX Ç®ZD”:Zw Êš4ªH ·ÖÒÒôFÆèûÞïõ‡ðùbPå}1hñ{%6Ði&Ï;A@*«™±£TyÝbìIk¡èöw82œ¸0$lp»pBà`ù¥.×ɦ’Ykç¹ Â=l"Ë„Ušˆ³d*E˜Æ‘ñÊJ/„°KÈ8qýA¨‚çÁ‡å„@_*fƲtþ(r®Ø¯ ‘Ÿ[.ˆe—LÈŸ:_ýžä8ËÒtVRÎLÐ+2hoÇ›!5¤S}D™Ze¤`\QN\7êu „³³ã[ÔDºœ?‹—âD‚CÄ"®"%r]:¡-Ó2 ‰7°òD:@£j^8.Šr”jWƒƒbMHè–òÒæý^€‚è^Bä]¡–á`áO(ö¯ÑÉC‚Q•Z“?AŒø¦á†É¤/+â¹²"™V—êPÜôüYä=Æ…åóƒS—<”kI Q_âÖè'ZÔš­.?xòUƒoy9µËŽŸÎÿz¼BÝvi¶ÞsÏeÚ4tmÔ ãòþÔìüÍ0C|ÐM]«[{rSQv»cu?œ¢f?ŒGn+zn%ÅfzR¬'RQ‰mi–‡PÚÀw„ò§èÓ¢|*ú*6ˆ‚×&”劾¥¹Ç78|S¹‡£­Å‡øÝð2@´4tÞ‹‰–âÓƒ 7¢D—‹ñò_NýŠ³¡\PO¥ÿÝÛIGZXÌÈZ˜¥nqÁ=tÀwzè€{d “#>óXú×ÓÕ“ ÆÓ¿-£P$cwSý ðˆøE6¬²5 Œ˜Üs±úŠ’ÀÐLu.„•¥ÿÏ-’ée€î#‰y‡²"ÿz—@­Šô­ÖÓ&è }S<9ugê Çòg¤X\=5 bÞήé5uÃA¯ú°þçßb˜wþe´õÿ2ü ”^¼tÿ`Ñþ‘8 l endstream endobj 508 0 obj << /Length 798 /Filter /FlateDecode >> stream xÚµWMÚ0½ó+rLVÄïöƶݪB•ºËžº ` jSÛtUýïµã„ØV’ŒgÆ3ožÇ4ñƒFì¡ë‚Ø‹ŒiÞsJ)]êåþ®+=[(Úšæ`Ô{óÑ÷ è€Ø‰¡1šë®F3ã›y»LVSËv]×tßZ¶çùæ#K‹…ñ%V/·CbÙ(2Éú¦šÐ!C…Ö÷ÑçÞ‡Ñ6¡3£–š‡azØF 2‚ÈÐõTäŒÓõ”[ÂÚ7§YÂø˜ñ¼úþ-ƒ1ö‘aC@_MIÁ*vû1Y‰” ã˜7dõ®tãT`÷¾7~áÊÊÞÙ½²ýS®í×DÀ ¤b B(Å‘„Ýó‰ K€ÎiŠ™¤…zòZ#KeFò-¡•¨ •„Ì+eéd³* ˆ«vñpƒPäª`jòj‰7@À‰½Z7å gó¾Ø(ˆÍÉzogFò:΄.$Ñâ–†°LYç{À àNÝæ$ˈ4zÞ2“ñ„ãܲaQEXÝ5S²×õÌ~r Wà™’OJ]µ¤ø ~ƒ6€KtÈJÈqþu°ú¡¤dÎ[9w›²ø’ä2¡’gF$8ZHQßtºu¸ \øyÜŸß9Ø»ÜT¬À­w×AǼ'Œ¥‹"ÇE×á¼íHO— ÝhøéáL ð˪±•ûÚô5Èîç®áÛ,I”۳Ȗ¬¯Ð \àùð‚$èR«‘½µ/KuÔ~’‘éLá3º¦zLÈlÓÙ;»!×rÐÐ.¥è_$’÷¨·5ÃôôÅòTʳõžä‰ìê³Rt¼<”½¯aUue±Z|ùÅU݉ë ã)_óTÐñüZœ žVŽíʶÃì  òï»é®ên¯õD’úѨüŸæÁœÐÿØÚ÷( nâvœÑñR1Í%œÐkÛÞpp­åã 5X™ß8-øXN¡*N:Ã×Rô².ÑYN“BvšÊ¾ü”+²ÂÈ(¼ºáà(e5­ÇA¿¯6¶/¦‘Ø7„a\Ï؈#ñȹ…bcÞûÚû оSÈ endstream endobj 516 0 obj << /Length 2918 /Filter /FlateDecode >> stream xÚµZmoܸþž_±µA–)R”Ð^$¸^¯pï€Øù” y—^«·+íIÚä|Eÿ{g8”Di)Û)Pðòuø6œç™¡ø*†?¾Êã•N–Ëlµ=¾Šmi³_Qâï¸k·†¯å»›Wú›R+³<ÎùêæÞu³[}ŠD¶Þð4×yôþª^oDÕ?¬7I’Dü‘QA¹ƒ«ñÏn#&+¢þÿy¡Tow^Wæë­W ;Ûibe5ìû\'AIŽ­˜ÎÜ07Ƶœœ2L3K˜“;ßaÇRSΩû¶éÎMe`¢‰N¢»µÐÑch„4fIÂÇPƒhœmcŠÎ„Fâ±f<•}§²ÅAðæ„VÉ$›® ©ëà ”å}[Û˜ªèÇŽ¤oááruEYµ´¨‚*N‡bk6t¬‰ÈY:9‡ú°3p_…vÅဠ‰úF%_Ö*Š¦,*Ž¦í[ëx¢[n '©¬èwôöú†:ÕÎõ¡TCÙ:Aõýz£3,än8ÓvfG]ÛöþhhÉدÅvlÐPTZÝÛЮs1Ýñ¢mË}ò‚ûž+&ÕpœÔ÷XÅ´(LÐîÎ.»/¿ J™Š²w8ÏDZKhJR³Ø×4{C?5ÔëÃ߯CSËÀÊå}Ÿ®¦¶…?¥þÀ°l¬sÊÀ0Mã*<&íÎ<5$ËI…“KÞz¨§Ë¼;ÔÛ_ƒw6e:Q}ã}SŸO¸ñRØ5J€!«.X€ê‚¿PÏ#_;\‡’r5õ«+ãšMuÔÁ•’š£±i µk’ŠÆôB´z±T‰éî9HD•y•÷ô»pü<é°ÐÅý@ÈËM¬Od½­ø–~[Ó½Ã`ÊÌVäš).W2e™‚:«D nÂí´ÄÇݾÿÆàóaìd¯Ívœ­`’e”ütퟕ½sìb‹Ûþëg\È£S±7XÏ#.ç+“ypŸNV¶ÌúÖϬCÅ’I1[­ÙàÀ¡$hžÌ·î(4¯o˜ õ ¦ûˆ„ ÔibZŸÞÛMÓQ½ÿÙêE‹û†5´oØ\¨ H3¦d:™ÿò¾õ­Ÿ™ò\èÔN8/12I§†âÜšfà³PWŒjà7Wä¹Å™ÔŠÀ-'sàULn;Õ´'»©f[þsiáJ{{neX\ƒN·•²„_rSýP¸AîÈ34®œ¸* -T&z±¸€m#oo1ïï-æÅà»ã:%Kf˜‡¥}Á†ÑA:¿qDª1Çzl¶£v÷M}¤jwP²šç{™ORà£Ñ'˜pu±{ hQ²D^’T[hJS§KïéÞ qY+g€qŸB3ìLÄ ÿ®Þ=ow Éáv»¡R wDõ®.dÉ´Ñ\÷àSæ,ナ9épå_×N[ò%¸Ù°ž«wÁ8’±#›ã¥uüýÂTqßÞ~ ʃóVž­­ˆ!´±N)‘ åmùGø6)&¸IFƒF´xŒá}ÎÄ"PüÄé‹€BÅ|“ÊÉ<â”Ø»œ|4‹eêcŠ^„œy<è9H˜Ä÷z›‚Ò{¤Kò˜ 1£°'0öE8¡Òl‚‰Ã {kÚ¡%%,ùѪ·½^ Ye5Á,wÖ»¬¹µ1á@‚œA‚×i .H87ÙÎü«|î¡`‘]üöæß•Â`;Cik½‚Ô%a™Ð/³On’òU§…7Dá¦Óƒ •†¹¤³Q¿ŸFÅÀ¥™iqœøB®'—Û" šiiÈj[¬Ó[sçOÑƽWŒÇ-&ÇùmlfYìhÿodIÕìä(ðŠ¢ Ój [$GÄ# Á¶blÔŠÇN©É9Qiü]:Ø\ûtŸ*ìE2½1êÛ0D}±`Bx†H/Õõn8¦ gbÉT6 ÅÁ9ÿë\yq“0fU£yN=÷ 3=gàtð%åPv¥i‘–J}?"f’\6ìÃÁPGÇ/§ÇBz’ŒqãdéùÐSfj5îßuBA’Ø÷X8œJ5Uçž^Â;Ú¨¶÷¦ÞÜKŸ¬æ]?,tž™ÐÑ{îQë…PÀ7cÔ¥]Ùs[òÁÉêƒGÑÚk#òþ=ɦ‹p´?ƒ-ξáÜ$ËôÔÍ Ø„x¤xè![úËw¤? /à׌~é›àµÇçRìwψÕ~¼cÀ”Ù&09> ’ÿú´dô$'ǽ3îÕ §·Ýýeÿú`üƒ3ˆsáÇ(Ë-VÁqÛá\b_¿ÜX˜¦v(c¯º«¯/jûò½}Elz0ðåôS ¦±HCêÇÑî±*ŽÀ #²+n'¨ÞZl¨ k!OYPlžè¸6|XÏ’WDK g†ÛóòeÀõ±vͦï¼!„¿IËO×ú43`,á^ëvm`5è7*ð³'E¦>½µ²,“þßæw)lñ™núP¿(-›H»_tÕøÚº`H&ód"m‘ ^|D ÁûûÛb_7Uÿº‰þ¡v^¸&â …ô~ª"üj†ËÊ8`ÅràE³8“)Ñ®Å""9eæ,(šØ­–Êêi ×’aÇæ žeœ²tä¹õ)èÃKÀ]/Ë¥9ìÜ,ïGñ³™º(LLU@½ ÙË­érÛžµ›ï’y|ö±JïÄj–&óp-cx2aÚ×EdIçÆ„Ù¬8Çoš¼o"Ÿá`Ï|Ôô¥.ݧ=hs_ß7ÆÚ[2ÀO|º4|êƒEÿº½z endstream endobj 521 0 obj << /Length 1441 /Filter /FlateDecode >> stream xÚXKoÛF¾ûWèHÒv|Ö§ÆhÓF ¤Ê©) ZZÙ$RXRJŒ¢ÿ½3;KŠ¤Ö’äÀõjvß¼#&þ‰IÆ'‰R, ÓÉr{Ãí­yžÐáÓûáèæ@8ïQ¾[Üüô[MgÏÄd±î³Z¬&÷/ù®Ñf:WJêçé< £às]”ÏtÕ¼h:Ü?TÓ¹Lƒê=ýýP<™Ü¼Â™d6ýgñÇͯ‹N™HÊ+µFÊSµã¾ÚB¤,ÄiÈ„ IóÿîPâØ>Pç"f‰Jˆp&倥^QX¢µÑÚÇØɤ£úÂE¨7+@)“Aµ¦oóRÔxAݘý²ÙM?Ô/Õ¾%ÞxE9…OãVôÍéõz_.›¢*[®¹#CÕêöÒ±Þ×è3<­¦"€Kauƒs©Wh¢ÊB‰P(°“Ô¯›¼Ñ[M:0KÆV.~ñ!%KEÚb°Üäuó¨¿íŒ¯Ø;Ú¼¤hy²æ»P¢Ë0(VN•ÂâjfîgyÚlgDènžŠÒFžQ¾®k ’TfðØèÕÞ‚É|ÍCˆ5™ ÃD—ûíP‹z>6¯;M—ÿZ¸¤&-¨b Èc™oõ¬Ãõ|Ÿ£5«OrÊ ½DbZ74êgÆø1çØÂKÆ]@Owß©È¡*Vô#ûñÈ÷ ø9-o5PˆkÓþÃ(ºjK†ÆÍš¢¥Þ?5HúºsaêK°/æñ0 Ðß>u¢ª†liý1x0ž¤Ãü;5ߊxËI—=‹'¯–UY·o^òaú LŸW…×­—5¿-õ×Çã%úÙ/Þý*®›–ßYñÍ÷ÄÍÂv<.‚%†è–/©Ar[à©3r>ªèŽ–k:~Ÿlm'(*lQa<Ì÷}¹ÒfcxTŒB¨–êºmâŠÊŠÎËú[Üe”±l³Á¶·EtݨÂÀ£ãK^®fíV±Ü›º8L¡‘éÛDh=óù?ÉW—röÕ …á°Y¼k·ö¶lpP«¨ÁI×W¥mp 5¸äy"8bèXúÔžuð?¼þÔ#Ð endstream endobj 525 0 obj << /Length 1698 /Filter /FlateDecode >> stream xÚ¥koÛ6ð{~…}¨\ÄŠÞ”ºa@[d]Š®²¬_ÚÂ-:⦇KII¼aÿ}wtb»^B¼‡½%`ÌÚÊSçVd¼AH ®^kºUEÙ²»JKº|$2Z `€œ«å/Í©­5—¦MK0Âg õºè2e•BÑ\êr ÒWŸˆç‘L¬}-45¦%ÅJbÍ}ˆGt\ë5!³pÄiÕÔhO ´ÕW ’(¸–$Jn(À5©&_é2L¥šž|¦¤d;Úë¸Ü¡é‰  Ÿ:²½ŽXC3hS]è”ñ/ŽTJTBQM6‚0°ˆ ]×o‰§O Dô¨¯% FÍÊM˜íÙ¨¢‚lR84¡½ì·./ß-?_ý~qùqùÛë÷—WÓ"ˆŠ$Äß!áâãs$|‡ WçŸ.p3ÙÖ# ÃþÛ¡£'¡ë\ ïϺCG¦ª‹@´zÕzdƒÜY©ð&®¼j:i`¹ÞPF©X€SÎÓ § -#Gc@ö= öߤ]ÑÂí<Œ¬´èp(Þ§ˆ©ËlxnêMKÁ†m]¢‡Âˆ™~¯¾ÒúŒÓ-ÖƒÀÔ §5›üª?0Ì0H¦À·™×ÍgÛ|­±ÿˆööûÁѯNÌìR¬”g&¿«UMóظbŸ½¤. 5³×úèlÊ/?Ð¥ž\èðSÓf¢¶óŸ'Bp_õ›3õ_SáO[ÿ,÷D endstream endobj 528 0 obj << /Length 1253 /Filter /FlateDecode >> stream xÚÍWmSã6þίȤ_®v,¿Ä ×ÞLK[z ’~¢LÆØJbƶ2¶Òƒáøï]iW~á ä¦_: HZï>ûìJ»läÂ-ÜQäûÎ"˜’âÈÕÒj3ÂÉŸgGŒôlP´;š?.¦¿„ሹÎÂ]°ÑrÝ…Z¦£këtï$¯&¶ïû–2±ƒ ´þª³rƒ"¹å89=Û›[â ×çÙmW óØ‚Y>›Ü,;úyÙ =ï@ÖJóKÚ³.mÆæÎ|4›ódž•r¦¡UÄYù·ºðËPò¨¸€„ÁÈf¾ÃBŠ6bs%cÉQñ¸Vó÷ZÝ%MÖQýXîöäå8Só—U/w2eMÊ¢»ê¡M-«}BÐI×rU˸ª„h=y3Çw=´š£Æ—Ro‘Zô|ÅeŠ“ŠÇi£²«Ä¦Š \dåZTE¬ò8¤Øäé{C]iùªˆó\$&ïƒyéëAЗˆ})k÷¡‡£å+*b@Äßö’ÒCÔ™dýLžñ’Wq›Ì&» X#Öe ýŠ”'€ÕÞ 0Å=N€*än]‰¹+Úzò íΖ ÊNs£ˆEc«<ÓÔ}+ žÁk¹­+®6ÀU0/ûïîž±èx:ð¬k‹‡ÇX¾¾ë—ûª¤ˆPÃ(ê'õåyŸƒV Ãf¡ÎIoiZY"Š]–ëP‚ÀRT>er‹ŸS¾Ž÷¹ÄEVçÓ³ßÿÀÅ?/²xU“!|-!‚<ç)ÆNà…>D 8û.v9wŒN®skWˆžÞùù€€¨ýÝh|«MÝ *Ì ³öÒä‘9%YòZ:À /Iå#ÐùˆÎG!**@ƒ+¨2?ãàL{ÁF¬ï¸Ø Öóºõ|'p<0œyÖU—%Æ…–N¡š@‡­‡ò¦ŽhäÌÌ%ô+W¼‚`–xwÆ¥YçvÎáÄÀ¦çø 4™uùR˜Y*s9YKã®!7_cãÀ¹<-3®W’üQ "¿AÛ`sãè^ošŸªzG™X“ÿ-ªÀºMSîõf¦—p‹àDnUðjfHøl¡I(ÙÊX*¢¶ê[ª„¤±ãàˆ€#ìÁZ Rn«‹B+%:¥Vp8Æ1Ž1æöa  OŠH¬ÙLæ¾å`–Û ²]ãÁ4çˆÊ…pêÌg)OMé·¥0p„ÙÜ…F‚í÷•J |'ò"£˜fO$Æèj” üLÍ=‰¥<&²Û½êgΛ-BÇŸ{ý’27 QSÝÃ4”á›í›¬Lò}Juø®Á©þël?l ês£¡‹¹óô‚äßæ¼x[ó,oW»ž:µý—Çð…¶+ÂmÌV%Œ×7P„p-ëÇñÅøiø^k!2©ÊMtÂ(l²1]Ëã»·± ô$ÀAñ5h`ÇÒmÐ$k§Þsä/eµ‚F"ù½*ÃYKp|}ANìæ­‡.p oîÓøÍÀS*Ôóœ½éé:£înzN]:> stream xÚµ—ÝoÚ0Àßù+¢>AÅGì-šö@YWmbkéS‡"/ 4RGŽ‘Úÿ~vì8‰atLUÕ‹?~w绳¯À²Ù°f¶uã8ÃÙøÖò“Ž]Œ’%„ÕCÈu¶p ­¼s;£¯“‰ìáÌžËÝê(7°^ºì Àtv3ë.–¸7€·]üÐ8ŽÓð?ã._±œÌÄç.LC‚(&âs+„q7÷QšFéN gbOüþõ6î÷ν«¬@ø—nñ•M¿¦º_À±‡p2¶¦·ã!pƹ(½<¤=˜t¯™äù8¥áíWC@“á'n#Ó9ÎL*H‚2¹ŠIj“v±ec¼û‚¥réÞ ˜õÏ#¬µ( Iq°ÂX5PÙ¯†ZÝ(8Ïi„ÓšaBunVý-Íöå F\>b%E4,­á²ÑŽÇŒ2Cr¹‹¯VpNÉÞ—úýåÔËiRÚC0®ÌÓ¡cË]£k±ânÅY… ˆ{JõEîøZŒX:È(•ï¬ Á¨Í\Ÿ¾‰éÏJ«ÇÆ<ÇØÿeOlö Ú­²³Aàs$D·%8a@8‰aûÊ£rk¯èà#X™¨Ç¬†çB#——YƒËOqµº0¯ÚC×Í.òÖóÎ%(ÍcU ô5L¤„Å_vÙò{¶™v²2/?¬ÿQ‹cmÙãój“§-|“âþi)g „L€³ à žE3'‰ìb5[QY˜9•g—±Rª0Ÿ =O$Ì©ÒBq”Ë°ámK”IÃ×#ñ¯í©Y½ç×~yÄê*J{Ì”„Ì¡ÜxÈm„ "ÇHµý«5¸ê—›þ>ý|^./‡%jxhÀé<éSæ´Î^,¼§ùjþ£o÷Õ¡ë^ìÍ9Æ›ñßÜû•,r»QÑ>ý7à@Ø\äŒÖ‹¹«œÐŠá¢nhJ@C ¸¼ØP7ÍJ6·ªŽ‹þHBe‡,gPUÁ©ºÅ}ÈéùÚ=¸ñ3f =ÀWëÛ›¨jÕjå_ŒWußúà¯Ãª§«3ùÍçØõ§Àôͬw|5’œÑ8×HâM_ F4‡>{Ä™Mânænsž©íHqLV¿°%Àj3W­²ßÌkK—Uè¿ûq™ ÜSfgÙW† &ïGÛJÍÅ- ‹tæƯéòd˧}/ž8*NPì©Ç‚ÿûö¤XEä endstream endobj 535 0 obj << /Length 1343 /Filter /FlateDecode >> stream xÚWmoÛ6þž_a`_ä"’­¿5[LK3nÔî‡aE¢ca²¨RTwØß²i[N‚!Hx<ïõ¹#ãvúðãv&ýÎÈ÷I0î$›‹¾âŠÇŸo/\-gƒ mHþ¼¼è} :nß™ô'ng¹2U-ÓÎV¸ŽKÉD×ö}ßòßwí X_ª¬x$–\3"ÂïÚÞØâ·´Ÿe"[àyîĵ|¿û×ò·‹›åΙç½Ñk”_‹JÆyÎRôp§|))Nx§ÄPyfïµ³y0|ÕIxL’.dp`Ù¿„³ùü6šÞ-#å2Ùs¼)sfƒsN#—'9çÈÒ ~"ûZž´ík¦˜Qùÿ#*]§wâͼñ>œ1¼ñå™­°ßרw)ݨç“%XEœUŒÈ˜–EÈï‰Z ¾!*4`±ëZŒè9Æ/ /µNV †Z]«èBœRõÍ% ¥Ó˜#¦GRÄE­Æ"ÐÄ *üʧÜ`DËŠÅi Z״ÙÄØŒ[Ü@´Eœo¿³#M‡…ɉ©ã1b!>¡‰²Ì·DòRf›ì;vAKTl+.6Z‹Ys¹ŽuiÛì™’u†Í„äe,}¸û¦¥×ÙãÚÎÙòX®öÞa«ÅÙ¥rÈ‚=Ä}( `_ëL øð“J8¬z¬‘ñÉÑ1<üæY’— Èê4% 4àÆÆSŒTu©«(¤ƒ˜ lZ>ûH`B5ÌR¨Ä=e)ÓC8+ö—^˘r'˜ #0¬,6J[¦Hà;#oئ·DrìAԎí½ZÓ¬’"{¨N›#¶çÎ`èÎÌÞ;šã%OšYM Ö;gÐZjÒ"y#®aÈ÷GÕ¬T»w½6ÄüI^§Zý•LóìÁYh©Ò‘(‡;~eÛõ&¯þy«8Ür=õ×8à ¿ï&ìK¥Ï¨Š¨àÕHE*ož9fn^<1!i£óFÃ)šŸ-™ž—M?œÏ%d#ª@&ÒR‚Å)1Pm”àuòq:»Ñ®gEYËKíÕ:&;*â £Kyÿ(s-¯"Li„#‚Ucyšuõ7‘¾j˱¡ˆ$ÚØÝÀá*´ýûíÈ ¡Çþs2Éème¨œ/fÑýç›pº˜Îï¢O÷­zÂÙõ]í•Ö¥z2šj1_—m ¼j›7»Bš©œ°gø‰DýõÙÛz1Ì]ZvïÚ7LÖ¢8.ÆÙGð®LÞ«­0ã8—Îö¯%„øj+bÿhÈ´·ÂÏR=¢DVHÊ­ä'=@è$·ó =â˜XÀ­Ë´Ò év¡èœÊÑxðB§(ñ)ÂÀìÍVDIQ'r‡• "–›æ”b\µ•Nyz„D0)þ‹­¥[¹µ;QÃi{*g1¸k$Å>és€7-Á™- º¦ŽÊ*¬—™>‹ÊmK$ÔÎ'Šw«¸.s®?«6T¯¦5ä\ÙQ&GÀ±ûøÿò5Y  endstream endobj 539 0 obj << /Length 887 /Filter /FlateDecode >> stream xÚµV{OÛ0ÿ¿Ÿ"BšÖ"’ÆMú‚ÔA)L…"š&¨*“8m¤ÔŽœ” }÷Ù9çÑ5-›¶©ªr>ßãwŸ4SüÖ7µ®e}»§¹Ëš™rù\âvTCJN‚zIò£Skž·Û2¾ÙGšã—M9žöP·ì†Ž:ýn¿~:f ½Õ«³QC·,«®Ë]Ç° ÕfË9¡„ã„qXú@ØõØÅ”tìt—ñ8nLOµ¡“£m·Z¿–”ÜŒ«SŽ Y¦ÑjÛZ§gȲ!87Äq2‹"ÐäÑl›l•D«ä ! ¶aSѦú²( …,:’p…{½Õ1,e›ÏÀ¬Ï ‘FÓÕš² ÔVÊ¢~»2wÒÉ1|®ïÇã# ›MøzŒ¾O€”ÖJŠH-”]”1)?9ªªHʸ@+NpBrtk°réSd\àô²Ý8ðHêLGÈ°E5Ö\þ¨Ê¨¨ h/q@%ˆœùÜÍJµÀ|?ç>?L%HXOV¹cq8“)›EEúŽ*òw~9î—â[/|KÁôAB"” 8àÓ* ½¾²…ÜIIn'|pè§MëCY<¹JÅÞ*Æsr‹wY‚î£è{ºwPÊ“9ÝZò-H„YHüAÑüªUcCxÛÊRê!%/â è$ŒÉ¶4mZóYD¨öü€¦YÞø^E¤ÛJ\6[:®S79Y’B7N”,"”ðÿmcq‚=8!>gË™›^n!´½…Š–ÍW1ËÕåÖÖAš–û›³3Ú¹PÄÝéä¨ËkøÔÆÕàÖòóà ÃÛa•‡àK·^ehùhÜŒ/†iLòômµÊI²âªðæ[åûõâ7©Ñrq½õAΑsÙ¶»u—-£ ÄrâKF'íá¯A²€møx&°â°9ºº¹Bfw5¡wi›HV¼Š(»Ã¹RnH)+W]9õ†Äyµ»¢kB&®ÿŠèÁ—|¤÷‰|-¤N»¹SÉ ƒ'.¼bþ¢žÔ¥ÓSõ"b£dˆùƒêl¹Ìe]¶ ùaª”®½63:wÕ,ÓÏNÇ“ÉhvyíÌÒlIfÄ\#ÛÓ TÙ,˜f4ËÙ,W}£¨êÉ2Pˆ”ªg”-Ëûb3šDÞû†›½Ç~7R±œ endstream endobj 544 0 obj << /Length 2446 /Filter /FlateDecode >> stream xÚ­]Û6ò=¿bß*1-J”d¥O› Ùîa»1vA[àd[¶‰È¢N”²Ýüú›J–\í5=,rf8_œ)¯|øÉ«Ô¿JÂP¤jyµ=½ò Z®xðpóJ:º9Δoׯ¢èJú"õSyµÞY­wW¿zïŽYÕäõl†¡§ÞÌæJEÞmi›¬(ty`ø»;3›KÏÜÀ'J}å…Ñì÷õ¿^½_÷²£ øN%‘òOZ& e")§e¼TB†ŠµT³yc½’ˆõ Ô ´a&J„* øBù"IÇCHær7›KOoóÒΤ—óʱ“`¥L… œ>èÚ6 È÷=³Ç¯ô@‹×8J<í0O3tP[ì˜`žJ€;M¾".¯ŸyöÄêÒÑ5†—×ùžvAÇœa{S—>±Å€«²Š;Z]2iV"Pµ›elÑЬÑ06eÇ;k:¶-´žÌ …Œ$›»¯Í ã `M” ½Öæ AûG„BçÖìRÿ²ÚQ™š—éÆò Ð›:‡,Cü¨âÔ³y~Raˆd™\ÅR RX‰pÂOáO_cÈ0кõ󃉔¸CNøõmf}õ;*—øàöƒs€’—Z"y¬åËÁßQÿ…NJ%¹áX§ßüÈÏXÞ4ùìÜœö¾oâfÎÈ—òžòJn‡M¯jŠ§¯z—cü¥)Å)Äæ‘I8úÓè¦ÈÝ26¿‹D;–'½6ÄP2†Ô0­ˆ{ÒÍ‘é·¦¢­õá8ƒpi\š±[Ø©€Aͪt z¢Ã‚„êhN]"ÇC7Ɖi«iÕ±iª7‹ÅÓÓ“æF˜ú0•þŠH¤T·L°_e‹˜Á@(ßmÉšü.UÑ4a`©”ç á¼Hú¼øML!c©j0Í6+yPç;m›ZoÚÆ-§* ÁG L&„Ø;½)¯-wT€žw`PãOÖ¢ Õ(>h[ã®ô@¼¹ÿă»ÜZbØ›¼Ìë¬`Ä Š VDÜQ5uK3Ë@¬BÚ)мé ŒØ×NÒ¬ì&Xôx. —„³ ˜™òÇ©ˆÈ!ÔPÏ(T]¹µ«^F^@¥0h'~ÉN8Í!£eDe ¡”h Ý9Œ©PÀ;†}ÝE1EÖL¨   û*q¡‚È.T&Ì )½óþïPN ‚5‡ÁÑTœºœFJp®>é¢`ôfH Õ|ßbºFQì †þr»þéã§5O®ï?3‹_fþ¯ð,¹¾_{ŸµÆ<7È'†Z™Žƒ¢D3ÒúT­‰ÙeAÍîkœ‘ w)~~ÿ€Ðw?LÜýë··w·ëÏŽ¨æï‡ÛõýûÇG7Aú<¹žrîŠ=Ì Ö·ï>ÝÁÚˆÕ§‡ÕÇÇ÷‚g‹‰ „p2À OöÉ€ZpºË¤ëó&{ãVœLí@;ªkàÐ&ÃÝ*,ŽÅT»°`PÁe‹õkQ°,»(U1‡HÇæTL–µ.ïõëÞ4üArµ5íáØÏ1¢hõ¿” +œ@ö…Ñ£îæÙ!Ó¥uk3¦¾YÝñ¼/“8±í7íèH-Éï8XQêÏwzÀMFô_(¹ÊÝëë°(ùävg·Ð×ÀÊ.©Ž0ÐeàrËéJk]Ë(„î“ñUVéÕY)ÍpÆð¡pyo*"7™ÅàG¸q|ÐÎÉ(XâR° OzþäC¦Ó\t0–jXBAEf".à) jº&¿ï=êr›3Æ•þØ 9{;¹ºä&úfrî^ó: îSÝÇqœl3wì-ô:áÐ ð ûÍ—!Y±uV EŸW®–/'â…[@°AÚ]¾P=ËÿÓê:?A¬À%¢±ßqÅzzÜb—<é‹l*,²;s„0S:$ꎨsK`À5ÝX«7…£½zK÷ŽàÌ«µäu\M[‡0j¥Ã3•˜˜Ú˜5ß?”‹´ ußr[´ÜGÒŒI›nñ¨Eƒy¢AH¢ Úã.µ[v‘óˆÉ.ó|g àÎ醘 Ô×’4TxÁ€Ä…ºOnùX2’åCFn#vÌ°ÄÔ9Ñ5‡ŒeŠ›ŸWΠ[8ní"p/Œ¨ U°f÷‘Ê^¢ãZÅþÅ ë Xº™Ùž1N'Á³õ€®î—Âe“Ï"@t.•¾s)ä+_³˜9‰EžQ>£¨2gÉ”cs§öÁ=/ôªõi½ nn.Mᆞ¨>O»ëújʳ/áôÄîŒû°¬ Nì…´MDܽP Ö%¡‡e-œåÐA4´·9iÃØE$obÈï8í0ÒlÆ%bbúgzö?BySôž€`ç}bm& W+–ÉX&F."ßpLM|39¾øÍ8øŽnÜåû¬-¸aDX¬ø»¡‹ú¤íÎP»¦ªBbœªY^S€4´Â!a;1¡Î " “º-]aN!ªªó­v=½)†A@]öò\Ü ôÒQæá Ï<œìø]¥,LF% aûºkË°F̬ùþ¦Lo++Ú9T¹Ìnb_/V¼W‹Éf,ME.»;&Ø?!(ð…/'®¯ºÖ6C›:-"öÜžÎ×Øy,¡EÆ#Ÿ_ ’T$q2 ¸KǤÒ&©Œ<ìrËjèŽc)!—IwØà’ãOÚE"ö{#›Ì‹ù·?¾îù¤wFÎ)ºC$âðmÒâ$‹ƒŽ×l¦‚ó?MÆ{•÷faä¼>wcô´B[(šQøЀku÷ŽåžaÜÍ…žÄÐ+Ï=îøe¦o>a|ñ˜çX¢îIÌ”£§µ`˜î?Ø©tª]•rmÒ¦mcêç7ì›X }>P‘kþƒî=I&S["ƒc»¸YlM¹×‡¶Î§øÎ5r’¿Åù”}ù–òO,£—Y^SŸŠ]¤åØ©Ýódófò}¯#uhqWu'ÄÍ)¢4¦®0 Ü-꺀‹?^*¸(Ý»æ¸y…ÞƒNPÐj—;JSÜó#FåWqãšKê}ñNÐ77à7Û‘¼ƒv<ëœßŒÕ/FäVš¦ã»á÷m¢šÜ€D€A¡¹®¨bû­+Sâ ›ÿgÃÿ‡ø­Ûo'áæ.YÛ˜C^ {üÇYÒ _”ÿ Õ<š endstream endobj 549 0 obj << /Length 2501 /Filter /FlateDecode >> stream xÚå]ÛÆñý~… „L¹ËO~8»ÍÕÁ%¾:ÊC›E®$Æ©”uç_ß™YŠäQqj¸@â´;;ÜùþÚó.üy‹Ä]DR:‰/²ý•«¡ÍvA‹··WãÙ€h0_®®®¿ ‚…ç:‰›x‹ÕfxÕ*_ülÉpi{a%Ö«»zi‹Øªo—¶”Ò²ñÇ·RÚ•|x íVUªI»º¡í†¾ÕfiUÕ–Àú¦|Ü©¼I—ïVß]ýmÕsñ'ÅBÌ'r…þH®ƒEûŽ'}’í׋(è âz A+.aíÓŠ°Æ7ÚŒf{GâÉ•Áå+oªœ¶¤–µYu÷|ŽŸÐÞGì苪íÒ²œ#gGž$!ðÃ/‹»Úá‡kÝ/IëwÅ~båj“ËŽNùÚ´+ꊎ‹vVKaìÄqhøº>¶ÍuYgé,CAäÐã:KÛO$0T´D3/•·<Á}Š>ÒYU3ck­#ÕsYäŠÐ—¨»cƒ„¶ð=ÇsÁ!<éxGËbݤúzt»´Û! ¾o­–±´j2ØÎ_zÖíº«ùÐÔëRíŸÑŽÁ¾ul;w»«%´UÝœ®¨jì(êáP7 X ëî¯ïï^¿|{óöŸïïoVñ— àùY·× ȬÁ$Q(6ÄÒ£¶öÑàNËÿ´,“r¶Î3:^§íŽ€uóç‰UõqV~=i„LÒàŽ¥Á¥–F±‘—]ÖjC{ÒºÉsÂÓÄEYT¼êê¹»ÔE“Ѧ6@¼Òqלvi§>âŠ!„l?¢sªªPz×™/=¿Tð½§}Ö;«æœB}I»NG ®2„îÒjË'”FU³O+¦¢… ÏÔ nCXm])¦qGw=­´ý@‹{Lœ4]Æ0éFVT†)æΪw²Z•l Ò¡(9Î(\¨|G÷Ð.å‡i ÷ÁÖ%:p¸§þ.„”ž?‰é)‰†k&g„~.x>7ÑHwiþúƒ‘nX÷?;ÙÉÿßaÑ÷É“ ÞC"BÇC¢//‰Â <ù%C"VÂJˆ&Ù¦{^íU·#?ɉ6uJ®ÅÍ#.S:é[„éF”fDéC\&“ŠJƒ+ûp( ÅOÙo)oãjù €é«ÓꋾîX”Ì‹s…Éû:¤.µÚg‡A?/ù†nŽ²bóHM«à+q­“gq0Âö×K±èF}^±mtgBñz“ùûÕ›÷ÌÛÓ¹XŒû¹‡©×ÄZÏÅxÖÀpD#³º#tÍmø&äé8:A“ªfs[â„¢OnŸaF=DùBz‚L{ÿ8;öÂ>‘ás²ËO´É‹œúÉ ÃI÷¤)XPV…Å(‘RnÕÈéûU_)DìÐ 0Ek÷ ‡ñ¹ó³AÈG#ý8¥ì‰Ñà"½QàÙè½—pã6\k̆‡Ô8·|=Ó[cåÜ›À´òûã^O.dT/‰é' áCÊõü§Õ|o.˜ÉOS2sÕç|úÆ_Zä[ì½Tªg“wü²6È°ÑT&P–CåÊt9ÃìÏH0½tœaiZòAÆPГ[bnÁCa†&I#Ó«;Ì£hW¦—i[d´| ¦ yntJÀü…7U†ºè»óŠÛr€IdñðX†m0CÑ5ð™BÈMŠÅf`1ÿú#ÇóúpïRn{íO7Üø–u½µÁi *Ùk±ö7Q䢳ý4'”p¡ŸÁ9/²aüêW¦ëD07²i!ñÇß´hÔbsõ ÿñבl=î¢ÑˆØbàW·ï>Ä}¦-> stream xÚÅYMoÛ8½ëWð¸{¡IgHA&Azébƒ¦À~tspS¡0êZ…íÝ¿o¤´-oeKES¤%=r¾Þ ‡r”lœ‰RŒ÷Ťde0 )šÈw¸&C Xr†Š^Ù0é5 Œk4"¾Š K11{“ƒÇól2'ÜGSBÀ5ï"&d<:’‡To<9ÏDÂ*Q¦*àÆGhbÂ@³ñ„ÐÅ3„ÆŒu’ƒ„ ™Äà¡/°*0wNE⦕]`˜O¾Êj˜ i˜ P ˆ¨ü¬h¡y«c€WÜJÂ+Vý±8px ¯„äJRë>¨U°z‚`v˜žE…ãUdï®Ußfõq0ÃÉBÙÁË!è Â`¼Š>U¡x ² c º`Ab"£þ N:XÚ^%Ä—UVÆbì1+Ã+ìçðÊÃ]Åî âñ$›Hö·˜ˆAÄô LÁª¬±Lí‚Eƒïð˜ OxL@X`A’J£ gµæª#`UŽutõˆYº("NÐÕ‘ q{ž1Án&xD‰Ã`¨P1A†ÛÔ,pAN° õHbàV jYt*AhA,ħËGoăJX4jã†øD ¨Z‚JTÅ@‰¬ƒlDc,!ø‡I­bÀdÁ6)œª³³jöúßOµ™=_­šm5»¹»mï_.VªÙy³~W¯Í‡¬t·ÕìU}·5oÀë5¡¼³¤¼-ˆQÄTî¹9;3³3{ѼnÌìÒüòb½pñWóìY…¿qbKKD”½”lQBY¸é Ä›»ùv[¯«÷Å^š7ÙãÌ+3ûó¯¿ M Òê~¹¼ˆfëÁ£Aœ+¶€;¸«fµmM¸B s‡¿óÒÃPó:"ªÝ¤ Þ€ôþAÂJÊ—)(òpƒÜ-ÝZ8»^7w75|jf×—Wföºþ¼5·»¡¹ž¿¯«ÙôªWÛ «]Jƒ±iî×wõ¦-´í£ßêw‹ùy󹋘€f©åz¾Æ\¤k7õ±Køûî=èŽoVµ!»¾ y´ åilàž ™Ž³!§×fÝRu T]´éõv|vbWµ õ)+Z-ÛÂY&>˜,–…&׃$VyéƒX’hr²Ø+Ž“wÙª<œä#0ØM¬nnC8ll6•8ˆÃ^l]ÆyTGÝoO*,Ó Y|Ÿe4!;µsšJHqؕЛ…VøŽ‘ÔŽ2ä²ù8_¬þqѽª?­ë œoÍj2IÑZÚ²vŒ6„ܲ5S­„F¾¸aVîaÐZm N©QßÙPnžmA_¹5šOýWN+ppDúîaD‰ãÓ ]pec´t¨ìáÐõÛŒ†u‡†Ç&ú´@NKî‡EF‡%–]Œ <Úø!\ÀFD¡üd÷è!lÏ=zrYK™Zý”$YNlÑ=c¯Á1Ìû„ç‡+àÅ|¹D»¬ÕçâeÓ¼Ø+:zl ÚŒæGÚìñÛÖn)úV¯F’û[~ôÌ<쎽rÁ(1 â"Éìq>cû9ª\öãΓÜwïqe„½ë¹7=E ξwbO²á[®óÃÆ©ß>º+=\óÔ ¢ŸKГÇö»GA)Z˜°!ÉáS3úú#TÕ*p¾lî>LîС[4&H¶ú-ib½±lš÷¿Ò–g3Mpì’0V¯N¿cu_‰ð¬ü¿ä¯ÖO7:j·ÅÈR±Œ}2r¶â‰¢•ãþIŽÊ|Ÿãelž÷46ôKy Ñ6QÊ÷01c2ˆ ­MàaÈ”mmWøÑ.í—ï0º|‡t„Kw1„t¦ŸÝÝQ?Âèl §Éêg™ $=ŽÈ†= —lI䧇®ôÍN£ÍÎOº{6Äp’ Žè§6$Áê âQX#NÂhYÅäð¸óùf÷uç—ÚßcÑŒ~‰/̃8ýÁ"¤Aœ(¥üˆÊhôIÓhtºh/6µÃ”Òýƒ³¹àЃk¿|R r$Âu³ü÷åâí´Ë£µ%8¥û¦F†ÐSfý)m–':(¸k+çKíl¯êùö~]oz„ÌGm%ÁöG,ú€ŠYÈ endstream endobj 554 0 obj << /Length 2898 /Filter /FlateDecode >> stream xÚµZÛnÜÈ}÷WèÍ@C³o$ÛÀ>¬¬ãÀ‹5bmò°»8Έ1‡ð"YùúTu5¯jJ³‚žf³/UÕU§N5Å®øÇ®tp ák_¥§Wé­WÔøLJWÌŽÛÂÀídä»›Wo~Rꊾ4»º9L—ºÙ_ý潿MÎmVo¶BO¾Ýl¥TÞDzi“¢ÈË#õ¿ÿTm¶<öªð£t =mþ¸ùû«¿Þ {+Î/G>’2”3)cx©®ÂXúLH’ô÷€™MA£p:–q?å¿9fí¿›nwªö]‘5~sK“ælí¬- }ÖÛâÒ’®­ŽYùÿX:­ÊC~ìêì;¯|J¾¾hIµ¾äåž¼#iðWz5:IäUí[—<¡„#‰c&çäj®í¶ó•A6í3e½à/ÙÙ¸bVî{òXxUI¿÷·yº néq—ÀSì}ÝÐpì”Þ>U€I‰sZêi+ú회Æ'4Ïê̺ÍìÛ¾« I“6Û_CS Ü)v:%¸•Un˜óà¿=ê ¢m$ü P”‘¢( èœ4Ö¾Mu²F«Îm^• =Ð@‰RQøœ 4^d:š´ÎÏíµ]%Ë–¡+8÷• ¯Tù\D&|}ïü@ÃŒ›8ž÷LºŸ¿,à€žå6FÍ/YŠºXüñ% ùÛ/çŒ/’‚z~ڀᲤ¥š?¬*çäh5tÀØ÷êô$ÙÑÏh°\”‚–ÎP1DPD‘¤ì»<®µw®«cœ@Ú ðvy™ÔyÖÐ+ò0hT»ÍV…ÞÀ"Ô§Xà0œ”&%õîÈÿé¡ÎNzÖ:[f:ÔÕ‰Zä0»©º:µsRòÕ½}Üç5ìXÕV8rÔu¿4ïÏ|Ž(TÙã(O‹ ÄwĸR>'ø˜~ïfƒA½A¿ò’¢1-¶P•úH?fLÕ‡UÓ¿LÚq˜ "CåóPô»/°÷‘ âýPŠ(Z<­Á-;{êø=PA/ôf$Ù&оBkØ~÷Ó9/¬½l,£‹[ Ç°Þ.½CeóuB?ûÔO=’aç×¼ÇçêÐãÂéÜA®ù˜… :KëP ñB–©ÇºÏ›võP£ØDI0‹!•†|ïªÀZÈÈj )×Àç¦:1 « ¤IÚdohã¹ç»:1 3n4Ã݆¢{lÈd¥]²KÓ¬i]QØ)Öø{zªÊ…L‡ª(ŒïÝ[·w‡Fóд٩yëJ´DhfÊ_–f?¿m¾+÷DÔ¤÷)/QœîÛ5½ºÏ­ç¸\]LÓï1M]ó‚7ÃÁؤ¾vó†0ö%/!Nþ•›­ðèîík ¤÷G0:ºìBU¹ªª†àú®ºrÁý8Œ^¢ë—sR§6X)¥÷+:l['Ã;é}i“Ñ/>Núœ‰éèÓІJ_HIÒ1öCG¾æÖ¡M>V!÷~Ax3¤#Ù1%G R2°›’]ÛÄܸs¡ bÀ^Q|)K1ls›(‰ŠF8F”l!ÏmCo 9‚Þc—5¶+­êÚ¤X|¸3ÀZt™}IÐ }ðBÜä nÕÙ—ßÛýHA3†-AÀc|ê´|';“ÇelÝ@Æœ(&¤5z($öií»ÚÐ\ì¥4Ž‰2ÖÜûØKÙ™ím…Ëbsªš´Ô÷ùŠ†;Ï$˜ãÚÏûÌMŽ3TŸøÈ îýsc¸qN–Ó! XSk¤®ZY8‡^ G&µç{ƒÁÐciˆiCƒrô‡×vá9×…r+Ç!êýNDÓHÞ9nw§Hû_³wAMB¿–=-ñßt©Eq “É;ô°3‚Úùç:§ÔÜï0h‡»`r noº¦~STiâ¬9ûhë,d¡iõ§*Y(d£¬ïs„­‰Bô0œ‹$ÖBÏ]tä yàk@c…yé7–¾9î¨ý›]î$oq0eä×®%#(#ÇŠE¾s®~6¸!F‹+ 0?Ž•cͼL‹nŸ¹\˜rt„®û,fŒÁèlα †L ””¶0²Xžæ‡‡¾£ß¹»Q—¡Á¿ÑL ®ýjPi8mÏ¡ Âð2× ¡ÂƒYG„¼c~‡yÈ 2ôc¡.ËŸrRœþ¦¡ ’ H$˜^©ðFrµÝ‚Mù·>ÿxó7§çÃÙ+1+WPÌŒš^Äà!2 )maˆoò¦ Æ^'æzh¼’L÷á#LBÆ^=ôó ûê†0:°šÂyÃÂTfRׂ•ã8o‘í©TB48^1’‡á&†u‹£ùq¸ a ˜m(SÅ«4YsŸ«ÉAâ[TÊåšÌGžÌ|Ã,ÖpùdäËEŸãt‘§NiÖµ„Z©Ð˜G*i–´î«Oðº1”ÊÊéHPŽÊÁ‘@ñë>"?jsk_(´e îÔ`ÙˆÏ" Y ¨^qÊÃxÀ ÑH—LP¤‰p8ªÓÍ>Æ× ì“«‹HŽ–N7CLYô°ts[u…Ud¸bÂ$£®JzKê¢è‚FlÛÊ”&MfmÈyè‹@ΰ—Ž6ýÑBUÑo‰½öž{çç =ÃTÒÉô®ä‹fá~n˜ù#_ßšE¬âÑÀ¶ xåÇþGÃÁ†jî+h” ‚G6£ÀóÄ]°ÛøäD+ººš êÓŒ[¨Šƒè20š^Æ6—éL±®À;!Ù߈ÙÉBf¬ÝÒ…W½sX« z?ç'O§0„â2|žpç)eß²ô¹DÃT ÌÍ1ª.ÀÛ©` ·Oƒóˆî,& ë8|iSXì ¼‰¼»?›OÅç|G㇈òvRS}a‰ tÏ` »×`ŠÇµüB˜s˜Zjuȃ$†Î€0ýu Gó/BÇ\—K/©¾Ž–A€ƒLà»® ÷É ÀÑ6pìJjä˜ïôÒÏ 0ÜçqÛÏž‚ßšÇG~ÄÕÊ>y}ù¡æ¼^‹`ÅëCØ‹¼`]¨žYh±z­1g«ÄülçÚ9ë˜=bP³®°  š_Ì|Çšm¨ëm*‚–­¢eö1óË|>‚Ú Ë€ƒñæsÉF1»½3Ÿ‡ê,õl>§J'\ÜE϶’‘ó{$'/l~CMù=²ŸñÝß¡Mù}«X0¾'â”qyes¹ÙtfÍÙÒƒ>Ãm ¾Lìâ‰ÄP^±•øy>·b‹‘ÖºaK KÑ‹‹!åÖ'ä ãÑ÷jì4oàwþYDb­A“@ËÖv•ôÊ]ÞÚ׳òÅ ²ë5Ùìv>Ì`&^y–ÃîÓb3*·ÈL"d$¼8TQºvt)æ¤Å‘¯ÃøeX¤ Öÿx˜ñCbãÕºeÙ·¼i© ‚§¹!pìä{^™¡Rf¡ö[àšàÖÚPšpÆ¢¤8P“–gºÇhA9ߛ•û{ ÷™ÐšäñÜP˜Õ^q_òeØ ?~É•ùâ:ì3`Q-Sšg°IÏ"¼²¦™¹4g–ÁS«oGõßæìÇaĨѰ0­INvä=ºšýC ( b¸nŽi —EŽ'çåj¬nûa:>LWsMÈEœøÝõOÿ£¯rÆïÀÂ;™Ï}E›Ÿ‹þËp ¨Ú 9±¼ßÿ-ÄÿPᢹ endstream endobj 557 0 obj << /Length 1195 /Filter /FlateDecode >> stream xÚ•WKÛ6¾ï¯ð‘"F|J:ôÐí¶EŠ©sjzeÚ"K†(oâße[Žu±Àîp4œç73\±HáG,Št‘)Å /ªÃS¸ýnAÄÇç'åLn$ß­žÞþbÌB¤¼H ±XmoU­6‹¿™Ê—‰°EV°ŸÞwËDæ¬{^&J)–àÍJ:5ñã‘Ž;׺¾ºžŽ["4óUÙ¶u»#ö‘î4ç½ÛôåòŸÕïO?¯.Þ) %¿‹ËêI\9|4 ›k.”¦Ø>§"C£÷9’[à¤$õî ÎjË6n[žšáM¼aoo˜ ´ÚñFÕµÛzwêÝœrc¸w£è׺iHý˜À/t¤Œ1ì{þãC”¬×}ÙG¯>§&m]弿°†Ž.¬Ou³™(±ì°E}l‚w‹D@´Úä@(. yuì]Uûºk—‰N5{YÊŒ¹`N³ŽýP¶›²ßàÉP«Ê„=_&Öäì·-}l—‚‚îæš½OR’ƒ(sò®'Å€by‚ ¸´=Ó§(­CN0Š4º/¢ÿå°G„ålñb^TÁvõ "o¦|Ü-Ô£å“ê‚ Ê«BÜcÀ³Ð<¿B#I¾ÖÃ>ÙŽ $y[ûáë_çAXp›ãEHò[€ÄŒe¹Øo€ê Hà:Ó¹o®ú/ ÁíÕqN"Ó¦JDª¹,P¹…(þw[¥Åµ­%be‘ýç1ɵUa¦ëý÷p@Üw¾!<"ߎqœôrrV{úÒv®-×Û*µÊØ'Os$Ñê\f ¤LÞ§¬ÎE—ŒÒ“DG\$ÊZÖmçŒ@yÒ<{F«)ö@/´ 6UO§Ð6HxdÆ,Rë(›Á­r˜sCHÅuv)wÛÍVÐÀ¨¸Ì.HV-3a€EÔKÝ|mÕ- ‡2NŸ±d³¦UzÛSþìw˜3¯4WÀt„”>@\§€¾»FÎÉL°rΦ„¬ËlTµ>µtsƦ†öÍõ4dÔŠãY;¯]P¨í8‡çâ\ËâF7©ôûé5>:@¡xŒÔ–XH4å0¸èSUzÜ”×ï4WïÕ—ïâÐ)šMÑ;¼ªPt@ŒË¥ÐÓ™O¬“eÒ ¥º®¿kK%Aá¦î_ˆ ™Q×”X©C"Ð"ÆLžA›Nè8_Q•…â&3wmJPVã¦Tf¼6¥Ì¸¡«5›¢:eÌÑÁ_ºF¡ðW6æ$\{eÞH .Ù™yóЮ0öfWÌ©‡l˜¥žôÉ‘G–´ø_0Æ›§×Üü|3)·6{l¾ hs·q Tú^[b¹„y©€Èx^XÕÜ,c%ûÔNÊ6c_ E˜ÓáæŠÊÅþ@êRSWú:Œ2`öîÐáS‚žB¨dw/ãŒùn; ðWüUöQ «|¿ÁKˆVœ·}w jVj èëL¢ùó1‰Fjéçž@}ti ÚÔ[úKOEÜ %úpŽû^æ£c1 –swL÷‚þ¸†D a]Ïüó,žMÁåu·Ê/Qñi,Ó\…²œ§ÅøOÁ¿|G{ endstream endobj 561 0 obj << /Length 1284 /Filter /FlateDecode >> stream xÚWÝoÛF Ï_áG ˆÎº}õ­k–®E ƒQlhû Hg[¨¤$9i^ö·<žlɱÓaÜ‘ïGùã…¯Bøá«,\%R²L¥«¢¹ ­´ß­hñçûîì0 f–¿lnÖ÷Q´â!ËÂŒ¯6Û¹«M¹úâ½Ûçݨ{?RzÑ?P*òÄ+ü€{Ÿ{ÆUë‹Ôó±2-¨ã$I<™ùß6o~Ý!DBüG¬hùl`&x¤Ø8UŒKE`#?ˆbaáIá‡F·>,&@r-¤C¤,ÌÜ÷›=¢à‹wŸ(Bóžöe5Œ}õp Ø”ä^× «â·á¤ô#æÁŠú¼&a‰îR‡h–%ô=˜C_èùlæÝWý0Þ‚&Š½q‚C&´.Y©1 €KÆ#NTã ë-^÷ªÿ /hÿƒ.—Õ›a¨jÍ𦥷Á0ö¢œNOñtûIašÉ›;í08UN{¸ ÐþxÞé6ëïîÀ^ ¾È” tñ5ŒÂÁ4zÜWíŽDCÕTuÞ“›ÑðiŸ´ú˜ã¡~yù©VQã’ Ú­éÝo}ι÷~ ï-œÈ)lI¸Àœmc½?Ó¦j‡1¯ëÁ.‚¢˜lZ»:Œçu(8ã©{k¸ÇîÍzýôôÄÀyñµõúŸB†\—æèÿ¼šEƒ›É }˜Ù‰$ôòÃhHl€ŸIžtŸÚ8{]`mï[¸÷Ê69Ö1j¦¢; „H˜ŒÅòêÎk\†±÷0e Ö£]wx—2Á!†0Ž§ šü»&î)Mq)f•€¹œÌá:/ù”`sÌî”@ë•­1)…i·ë;o«Z_:…GK“lraë,t *ÃÈñEjùÂ*LÔŽjÊ•‚…É2UeÕëb4ý3µv¾µL«WÀä·¶àq¤€ú5äjwè'n(úªÉjVasΕÀqøÅ…%à¥dÎÄÓ÷ÁÌÁ…Ñq~Ìr~ VE0¿| ¦è¾YªK¼.ß¹xdt_%@Ñ¡XÀ¿>6&럀=wzläaÅm+'ÐÊ®Òeê¼Îú™Š(N½§Ê¬Ní„»k¬:Çú´Á{«œâ·ÍïŸniù)ßø©ôô_´ÍÛ’MÞRsãfú+äBíËD±D¤§â/Önš\(ó`²¾V¥Ø2ÆÎ劋âÇN KfÓÇ q^Ÿd6›µ"†õSåéU»5$8¦7xšH9†6$(Áæ¯ú(ïÝGy=˜ésËÑ0·qü¡&5×U­ü)—©—‰èdtÌ\NRÀ÷7†i®œbÉbuFœEŽ/˜?‡ª.q)a “¨r*]ÌžtwÈ礀IÖä#)°œ&ÆEÝëŒ+€˜RqÄ>ÂUˆò±¢»,jcv eiÈ:ñrâà‰ÆAüãîþž˜à%Ï1cÆÀïrþ¿ …ç Ä]¹ý߈E¦,bü‹íG« 2®çÅýhá_aJY$óFÕø‚`?65µÐO°*5ÇzKÙRPY² ¢Ãpíj¦N7­ †®†šºpZ”±$=ò„éÜ3^†ô|€wÖì­@ï;Tâѵ¹ÜGT­]vAc³ r×ä 9f×Zϲ‹º×ë5³ 8O®£éØ>¤–}õj–#øw"ó‚`Óú.¼_Û endstream endobj 565 0 obj << /Length 49 /Filter /FlateDecode >> stream xÚ3T0BCKscc=K …ä\.°hQº„äÎeUgbl¤±*OS endstream endobj 569 0 obj << /Length 1523 /Filter /FlateDecode >> stream xÚµWKs7 ¾çWèjÆ»&¹oßYNÕ&×R'ÓIr V´Ådê>â:=ô¯ ¸²dí!餓/ ‚ˆ€ˆ ‡b’ñI~¦“¼|Á­´¹ŸÐâöõ áô'£Ñœôyæî~à"!Õã— éÇ á¤õþ•jy >ÂãÍ|üF „]Ýg¸ËØÍ4 ˜O׸֪ï£Eƒgy6{)$i/ª©L@äá£À}O¾ˆ=£R©+U€n±Y]¹`á>fu5ÈË),Ê ­¶kúoÂKC!Ø›_gKR•±”N¸S÷˜x%$rï¦iÈTÓ*ôìálÌ/µkLAI%9ü1ì<‡ˆ'b@>û~ôÖÑŸÈ¢Šp@vqš±9˜Šs£+ŒnG9!²Ñtñ^Wº±¤ã»º¡À¹.á §íN5ª(Z YX}ÅhÀ’nÃ¥jC‹z7ŠUgJóÕþx˜?Ë›«ÙKÀ­,e‹ùŒÍ݆¼ÖÍÀa–°åc¹³/¨[Ó—¤jÎnð†uTtBÁÑ•ÀͺïôæÈ1W ;ú’ïŒpB&/àNüæS¿.>©J¹½Kî®^ÛÅPC¾ îïçjˆ`‡’Àƒ°“DÀž€…ÃׇÀÂ%ã¾ÝÖ)Ø`ÕÅãVo\8|;ØpûEKºsÕ|ÊV[åLý¡îÇ€^mMõÙº‰¨W.‘(³ÕKPXê¹[âŒâ#"Ã޾ǣä²ÉÑøÖt:ïúÆé[äÉ0ß½pÑAÈV¶¶Q)ªÌŸ½nO3!Øœôç^U^¡[ïÆTƒfk+5t’­œdDø?d„˜<¥Œ€ïýãbn…Kâ‹Î Xó!'øÀ(¶Šöo̺QÍ#m¨Àá•­æ(šÿERÕ½&‰q–ž%Ó8ÃÌIÄ)Ýꢵ©>ƒ!W®~ÞjGù¦sÁ¾AÄUcZoÙoHô{e¾LmÌÛ¡×€1§o{W£ ›œ`9ŠÐ ñ£‘r3“ØjcN„À¦ t,Ü7U:^Ö¥¦•¶õóꩆ£¼­‹#ÙÒ¶«Ýwëî)¼W¹MKìЛ¾  2hÚë}1/1$qŒ%ÞÙ_Ø,.ƘmcÖÙ˜RWíÀX.±¸kÄ18èØ•öJÀœºo@¶ß×wtù­QÒÔ÷*KW•!ɤøÀ#Ãq¤Ùß¡äg#©v¥ó1Š,“?Ù×±U9{ëÓdz]Ø„ìò©‹2t]T® ÒøºY©ÞÑvGïoigÙˆ‹ÍA#³6K]ÖÀÙÓ8¨†ˆ4ÔE$YGì'µ60Ž $@»­nÍpl3Råñ?ÓˆC2u¤^¦ ƒ¿=:“À›ä¾ï3éôí†Ö‹ |¶g_z@PL:L‚ÑÈ{ð»{ª·­êÏNŠi” ö0_'6Û®Û]œŸ?<<øÏ‹sˆ|$1ð ¯ÏÇs„Ç~,ÿS’üÖÎ1IDÊ®}ú‚¬ÀiÂñË`&’ÙÒ$[:[¨º0ªwj³¥‚‘´¨¿Ú•SgŠÍ@iKÃìh@›iðÕÏæB”Uº¥”‚õ>Û‘´ºkj»d˜1W”]Õ·h<ÖÎeÄx{tmóÞJŽx/¡0ÉyYÞ‡q†ƒ;9ÀF2 ò…ÿðé¢*üªnp$ `$úÅ'‚a‹aœaÆ£bh®xNt)BVS]†ÝqD Ò­]ÿ&$[gueÕö¡U‚òA«‹E’FŽE‹ÛÅòòŒšÞ­®ªýÄsÒ*¡pÒ8‹ÿ÷ýl÷ý. endstream endobj 573 0 obj << /Length 49 /Filter /FlateDecode >> stream xÚ3T0BCKscc=K …ä\.°hQº„äÎeUgbl¤±*OS endstream endobj 587 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 589 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 591 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 593 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ŠŒ•âÈ»—ÑøÕË÷> 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 597 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 599 0 obj << /Length1 2829 /Length2 24419 /Length3 0 /Length 25994 /Filter /FlateDecode >> stream xÚŒöT” Û ƒtKJ3tHwwwwÃÐ Ý%Ò-Ý) ÒÝHw—tI RgÜ{¿[÷÷ÿk³Xk˜ëÎë®çJRe5sS ¤È•…‘™ ¦ Ê `ffcdffE¤¤T·vµþ#F¤Ô:»X;€xÿ0sš¸‚eâ&®`;@ÖÍÀÂ`áäeáâef°23óüÏÐÁ™ nânmP`È:€€.ˆ”bŽ^ÎÖ–V®à4ÿû  1£°ððpÑÿå±:[›™€ &®V@{pF3;€šƒ™5ÐÕë?!hø­\]y™˜<<<Mì]œ-iéÖ®VU  ÐÙhøU0@ÑÄøweŒˆ”u+k—¿åj®&Î@X`gm¹€=Ü@æ@g89@MF äým,ÿ·=àŸÞXYþ ÷÷¯@Ö ¿œMÌÌìM@^Ö K€…µ $)ÏèêéJ0™ÿ24±sqû›¸›XÛ™˜‚ þbnQ˜€ ü§<3gkGWFk»_%2ý î²È\ÌÁÞruAüÅOÜÚhn»Óß“µ9x€|þÖ s‹_E˜»92i€¬Ü€2âÿ˜€Eˆ¿e–@W333èzšY1ý ¯îåüKÉòK ®ÀÏÇÑÁ`.ègmÿCôq1q\Ý€~>*þ‹YXæÖf®S ¥5ñwt°hñ7ßÙÚ Ç Þ=󯿿€×ËÜdçõÛü¯ù2)Èɪ«+¾ý»âu¢¢žvf+3€å×’q¿øý7Ì¿ ø_ñI•M¬ÿ!÷GD…€çïÀÍû_îÿ¬Í?'C øoEð.4¿W_Ÿ™ƒÙ üÁòÿùþrùÿ·÷¿¢ü¿­þÿ%$éfg÷—šæ/ýÿÚÄÞÚÎëð*»¹‚ÏBÁ| ÿkªüû”€æÖnöÿW+ãj>¥Ý¿m´v‘´öš+[»šYý½Cÿ›8¼5¨ìàbýëa`ìÿèÀgf ~ ¸€gõ— ¾§ÿ¦”™9˜ÿ:æG¿”gÝ@Ùê؇…=•ýjN9¤Ç²†h(ýÀOs”y¦Yó¸d°® Dðtžhs?nf1r&_Hdãß"úD³ùèn²ÆÜÏ{¯W¨³ºtãQàéâAýÀ›¦ò=L–}³èSR´öeɳ…¿ˆ$…>eá5ã!kFµµj$¨©ï³ûØr'Ënn ˜šà ænâçÒ&,#g2%ìê6£HL×Ïl¶@¢ÃN ÑõöÍ ›Âž™ºÀŠŽÕñ»æŸŸõNëÃ#_n?¤´Þ 7ìôøi}"´ô`¡“°Ò‹X[åÍ J)sÕ­”ÁzM¿âžÄýcÂïóþRôŸe»™Y—¦rŒðŒ#×÷2Ư²áB±ss}ÑÎà è%ˆSñÅ´+åâ¢ÏŠMÂ8óM^†DOxÞ×Xj¾Z`Ã\PÓÅf%£x©‰|Â6ÇÒå E»ŒTßÞbÕp„þ{/›{žÆ3ÍJ¶8ŽÒÝ“H†ñÆÀ!Ñ ~žóÃí›òrQCì#Íû‹J0Ñá˜-u®à¼ðNÕw9Ý.JiR"‘¯ŠowæûLÉOÕEÝIí›bÑ´ÔvÆ»‹=èËdÄ)©‹–äŽøC}— –Ä‹úðjÞ ã„ÿhzÇZÛ¡tGœùz=†2sŠÜ¨c¸Ióò_”@Mý.ŸÜ{¢oqf|‡ttz‡ÂÇ®Rÿ{3€#* Ê.žŠtqç]úÕ†MTijEDóW ‘úÂÏs_€'CcТäplÌX‚'Ò€ÂRê̯òEo±^³m¶½³„Hb›ª\ôk¿býà)ÐïÖ¤Ø Óø†0µÿÈ™”3ã)•§,'HÀÛµ®¦\ø˜Mº8(Ï ñæ³^v:úõNQ-i”Eˆö{x³CôHxˆþyj¬¡ÚØäKULe6‰<Ò`ÞÏèÔè›ÏS"¨²hÕŒ0Ëýµb²²®eT}>\°qœŸÉ5§ú¦ºç¤ç ¯"™JGP%-=È$9>Æz\ª…QøV¿:¨ðOL¤ !Mû7òg³0—ú§½ð·ÙŸ×7Ý/e~¶ºøš¼Qyô¾¡¡¦&ChÏXèŠ+ùÉh,F/©óŠÛS™ŸežèJÀuòNb …3­¥ÙÏYÎåˆígº†Œu:N½´keíô¬ß.ñ³¿1¥þ†Óù;ýÖÖ}v%vwR½ £[™ÖüšóºêGì/ûf‘øÌDåßdïrt˜+ÆbÝ}87p?.èßõ^9ç8 §“±á ÜB}ÌRŸÑ‘c\“Ãý6LÛCÿFjDÎÇ$LLWT*»‘˜Èk•5BŽúC«ó¬fJ§Œ2…ÝÏ£‡Šf†Ä7›zݸÇsÀñáÈ»A|x<¹±E*VJ˦ÕÞ¡·²cxiônþ ¬ý¸Þ_ÝÒrCç8éÒÛèŠQzQʧ_xº&J6„ú ä>â˜ÑâŽNÞné_Xæ¸VR •îÄLö_ÿÁª{t$î·Säš+ê‹5gN¬(Ý,L i±z’r;‘Ê›ÏTí8ûï²h2E ‰ ¾~8%eNèÑÉsð¾§8½Ÿº|GÙ_Ù5=Œí±õu‹ÕÀ¡¬oPeô$$c5Šæv˜'j& û†·~)Ù¾tÈ‹óö}÷ÊW‘$JI0®<ˆCí»U)ÃñlMu¶”÷] Ï7\!ê„]š±§v™G+ŇúŸ]% j* ”¼»Ù¼=6ŒuCq7Õ™ÂÉ7û~á&­ù•¸…•ök¦”ÌË©0tÆéÇpýy‰‰L?ú²ì:(•%Xóx‰5EhÕDå™öùËpÎ80ËIJE 6n³ìøª|F»‘hÈ[—´a@’° dð‘©ÁÜ>ªK è=ýêohv´.^™Š<Èù:( a.̦h¡o<Æw xí*¾p¾+ÏýlØqkâšM/¬ÄrœÇ”!yIò±‘Í‹˜Ef@îí›òÉÑý{Jчø´›¥FgQžp lP³ŽX¥ËC¿k™¹0ùm 7Ä”­bè\¤\ dî,_A÷·¹D»@ÉX¤¥(Å«ˆbH¾Í­"óçŠÞŸ§ •¯7èÚ#ø¿ç%í `c–A¹tóð7HÅ¢ˆI‡hå[mv ÷Sb«$NH9(wôoO£P”ÅuM³±µß*ó,òœèF»ð„BRïT£œ8¯hÝó*~,:r™ý1ø±‰DÖ"9ÓHk=„Š•Ý£ÔÎiŸbŽUë³Öc=äˉéKÁ™RqæȸV$†Á:S±±WY”Êg„°áú*I½’tekÖê8—ч†Š€s£ã Âj”êuŠ­r\±ÕðoUÓNôœ‹2‡t~ `žê8ýÚ?/"EÞ.é„*?\#NHBjHäŸ\=G]ÌÊuÏ£IGQ×6BêªO É,oºRì¾$gvë•ÐrõSu>æZM€²?ãéPÏ­šô6ª÷]Rk;Ìm¤1Œ@IP²òy8Hð4Ɉµ¹£S鈕 ŠD>r’ «†¶¦_{AßüqNå« àWM 5ò [|Ã0Ü·Ïå7ÖZ÷óÙ¯YR)0íE^Î\’°z¿\}én@Ñ¥µ ”ÞŽ¸ü¸pÈÀ2ö‰÷Z@‚'#‰ôycϨ ÛxrN¼Ïü„´iêb颜jNÁ0­S=1—A%ÏïØÑŒf‡‰ìÛâŸQÏ}øÀ8ÜŸÜøÖbbÐÛ«Ä=ˆd˨VÔ»j$4çÃ5«û\;<ì«oWí?Cû´!M H¹ñæ í“WCq-=–Iááï¸ö$t„½Ô ü/Cr^¥UÞÛ9ˆ.U$"$g¹“2ß6EH~|¼¾ñpV*±a¢öÞâNÙ“ýtH.¶ï78­Çz¾U)â¬×:˜dl¢×ËWûw[Òúd³åz°w,Éi§fŠwbàð+5Öq$¶rÙd…•‘à$;šËÙ xâVà°Ê“½£"‡¤Ö0—¶oué«I„trå¦nËl5»[´†_×@ÿAßu ,–`št4Y'éäÄ=é¤ üœÎ^Élžå¡Y‘Duó ñÏ Ñå1‚wj°,·ò«ÙVt+Ô1=•òVe: {ïýÕœŸ½L8 Ê:R¥óS|Ä<ÐÑ„Ð¥Óot p"C„9Þ%¬oLÓà#ÞeÆ "eõ5 ‹KÛ„æ¿ÞqÁvÆ~ï¹–Œ¸ÏØ+¸2µP]7i›Rµb×ÏG•\Mΰ’^óGk1½+éaÜ4Ø$”¿#c!¬&M•ÌÿÓžp tApcfI¾'ÔßÑü\Æ6peR)BêåÕ¾Ã{9û+ÛŒ´Àó&ù½é¤ÂóBø“…ÛFrÆñhñà™Ti2zåµ…‚Ë4܉¶–Æ“ßãMCS³NC´!Ò»¹EJ›ñARéÎóH%éøáñ£ûÆH¾ÃÐÚ‰ïñÛ²Íîy¨µkäˆËpeh«ÔbVBiüÁj¸ODm§£5=—‰•¸Yé&õï°ÒDÌ">Ù9hAÖ+Ð|…u†húD¾j¼8Òñ±Y5fóµ{åNTeÜJ-c—û°ù™t¯þ1ïǬrïȉÏÇ|X‰êÔs G“CC¤À%«c%[(㬦³ŒÇ»äJn7¯5 çïÉëWInˆ~fN}o9z¼üIŸÖ æ³îºOP5è+!;]si÷­y¥¿çv*…ô¯ÒT•ˆ$5;Ÿ¦`q+Ü7û¤xö.û½ƒ²C2¤uõ)c5NÝ—º!ˆQ¦¼w q7GE£½(ß)ªo77² àVio µÛcÉ&Üá0̲ßYï,J ¯ÅZL=Ù6«2güxr§~7hψA=®¶Ó+Þ6¶lçõH‚Ë•ˆ“¬ócA¬®rÀþ¨Á°±ZÊÃH*î®a™¥ø'š+SÔÒófôØöâ&{øg–JP˜ÑOqA?GØ·ûe–?™ÁÐq~}D$þã†76zÅœNµj(⊎|ÌPGE»ÝjRV8Üjµ=É£7÷Éí^í—G./½_]®ÔD›b×Ãr8±Q)Hoû•g$Ó`P´ MòK»ÍkùOe2Ýf ~¾VÄÝñÞâÛ˜“½qm:Ño;ž*ty'Îú' 2Yº¾7Ø,» !Ýî„_áûBWœ`/¬…Ö§1\á$8cÊöšþilr‘‡Q<„¡W=ñÚx¦sL"» ×¿æÄ„˜9Ï{ßú»¼Ið ?›‘šƒaáŸ{~žhûçZ0pi{ P—˜Tfªjµn©÷UdÒF¤`ó÷)‰#ƒü4ÕPÁO¨s9cA€q} e¯qrþÙz×°K™P«ûhÛCýÇpºì…'•‘­ES‹·«í_ƒ³È¢—?i ´{O_Y~³7Ù‰s«—ÌNãïÃÔ~ðZo.«˜zõ@×þjÈòæ…]H›Õ 7Ž½D:}$2tˆdûô*µ ᣲLÙl»ÜÍ,ùD¼znªäíƒþþÓ­á\">_B·ï7U€¸~ÿ{i·9Ε§©Tê,¶!S>Oòæ¶+µ1Þ2SôÓUÊfWÙx8&Á‘<¥—³L"gͯ½xž5-°í‚´Ûç9= ïì²î¡8:_ëäMIò½¦W¤*¡Æ´.Ðÿ¬¨Ò#ó]znüzŠ¤[H÷TxIòüÍâ œšvÏ:ógþ Ú6«M­ØÀv‹Iñ&«ØUÆ¥:õW´†j0Ó Ä! ¿'z¤0]Åf ì)1Èëê[$¤hU`ƒwïÜÍ[ûŒ>bã’ëéó³Î‡qìI£ Ïžè (lßHj턆ÁÐ`)a4…ל2Hú$iÁk7‚¼ÃšF?_ ÎóÐÉ0ûáÌ6è“ù,aß³i¬x¹vÛ•Ì´€[. ù¡¼Q2B+ÆöþQ£(óÁƒ¶êÂ3bÛiŽwÓ܆¼¨¥z ;Ì Îi©(³ÝÅ…¡E8QJŠ+v‡¬ÒWe*ôÕ~ÙÃ@÷»·‹oÈ{¿‚~ùùz5̈"ÞweóöíŸzEØÎc.ÔXûðâôêÌ›–e3õ×êpˆ+ ¿ã˜¬à¾{¼Gó…uí´a™þ’!ràü]Õ=]õŒ7&ëÞK/Gâ ‰ð½>d2Iók\\&bêc†Jp½ÞÚW~m^Bè÷+«Bfoo(7?#œ*¶­‰ªqð|¸ ꩃŒ.Ë&ë[èϬ³”•áñÎÑØIM@Á ùÊ y±£Çt0„õƒõ7xçÄq ÷¨§šÁ•€²ÑÎ)N`xƒ: ]EÝQ¥HQUïSÄ­’Cá“–g£ù—­J|a҃ŔCCüª7rHUkbM|”®kc !mL0ûjo›µzPôš1ó(ÇȶҢ䦳̈$þR÷H|1eÄCiЊ)3’íØÝ×»æw÷VâK^bMÒl* í=ıw»ôc¨Vz8bT(9Ö9¾ÏÏWÀ£z× prv†Hòª°-âê°í²Ñh£³LÙ¶Ä@±C¢ä( Bi›óü‹³†ù±é´Ù•>Ød‚Hõa›æBc;•(en­."X‘A÷¨¦ÔWºutc Ŭ)5g˜U_Ät€<ÐÓß²tÛž¯)–µ¨<ÐiÞ7 GÅ·¯B Ê6ýðê–ËqÐweåR­yÏäÆZsPnoî£KÇw×EE/\¢[ yÈ‘ÃQ’Ô'³ºÆ’°õÝRѱ¦M¶Xû Ô4ø^5Aú z'Oz’o@ûÍ›•½ÔìöfPžâ’uUò3lù±ÿ’ñvÉ&-jE¹Qß22s.–ÌÔÕù’nP›EKjõ:Gçù¦þá©ë™¿¦ÊH;ÕAlÁ3Öv-›fÆ ö‚ΫÈw‰}³#.ÏŸà_¶ç^ ¯7ëý²û›€Qý•T k ‹‡`[§+2þÜ)ÅaÇÇ«±›^|H‘›Ó«Q<.óÑŒÉéb‡Û+O½¦çÓÂû Ç{ÚW걶òQ|Ìày*E‡/äô…íÒk¢Å‚\Ž®z ¡iŸ«ðGýciƒ,Öe>{~Yh¾+©šü±‰E>CÄÁ^è†GÄô™0k¸Çnñt’‚©%Q OÃA‘a8cºášÊvpg–1¯ ñÕן¯e‘±ùøc-ZóA]KïM0´°F³le'jUó¡d:Â` Ä]fsó“кÂÆ¡9Ó…fÞLxºk’C/xî^f¥bYnl( èÄé=%??uѦ@ç”}ŠmD]*xH¤l|.›. qN–%êb”QÚ%á]ßHd“L7EãÝó6[Éû ´jw2ðƲepŠ ão¹\iàãÙ#Ëï˜Ôü¹õ­™â¿ëG!›÷ºÖÈýšË\|eDö+êFp惓kïWj¥?mƒ¾âˆñYÈNý¬ë9Å.¾è¿{Fœ_h¤…¨ÕŠ(Û^&Mz?jˆs°Sý’*HR½ð3U‡>Ní§ML“¿-lX¾-|xã’ñ†ßšƒ ýІüäû#Ñâ+Ñwpt&êV¯mD¥¾«L¿®¹upYÆ&8}QÛË~s™¥fPMÑ[×_€ï\=MŸtßx¥’‚jË={៧ì€{ýÖZ}¬§Ý=}¥èÁmÝN6o…Þ­ †ì ŸƒÎ¸“‘ffE—CÃ'–*ÏgiÐ!"²*ëÅðkÿÛÖ5sTÍ%"§+ŠÇ'CJYYÕŸRÔÒ–È(3‘ÎòÖ3d“V¡ŠÆO{Ée{ tekI—j!b"à:Þê½õNlû‰ÿ~½ïƉáÍ¡qO6]3j¥BðòdëÔ[,ÉfMË^-³ñÑDÄÒ¼¾s»+¶åP¶É;™Á"‚ÉþV´î…‹¶ÓÚþ[æ:3GŒ{0óªSø,ÁVëµÓu!XáJÖÆawó8/$äodî¡&½Ê/ïçža®[»{i‰à–±9(´'çc.*VÅúw(äv¯¾Í' f[›bkž¼‡Ø‰È(°4äQñ]Ò4õ ¤2²ïRúùúvPD<.Û¥¼ÜÙÊ(¬¢Psž=zé\â%Õ#‹ìp¯6'?Hψ»Ðök*yRæ‡4äî 6'jTF 6èX‚ÜoïTpÛ?IßUØYI‡âvB(IËÏIöÂú@Ê5×ìkõÊt°1Üý|„ôÆk†fÊ­¥0Ñ4¶Þ{ÅW5¿›±pÝð\ïÔ ÑU$-œ†~ªÌžZ`Ä0ê†Zì*¡Sœ" Jš šµ»Þ Å{]{AhG6´ÁŒº%¡åÊ,vüµ&ÝÝÜb8n®(ài8Ø!w}Îém' ã¨x‘êGcpÍm]â~Æ–ÿÉ.- dñÅÁK´¶>Ú»Æïàlryï^–Q§¥†ªÔÂêj09´}wžŸáq%9Ó…Íbêý"ÕrTÊÔ?Ã×Ö¾‚…}"¡žn(õ‘à¶ÁS]Ãx¯dªc½­ ÝÍ{r&ÅÉ&»?x˜’k×æK\eíôßQÈbpþ`E}†Ñhë`µ|Ñ[Ï~’^ž’j«ÿOe‘`Ÿ3 óÒÀ„ÖºýD‰¾(CD‘®mŠ÷7ðjÙ›(„K"DÒØC2ÖâdÐvÛ׃­$Xm2‹jØ­ºßY/ûëÍg©ÂÌËÀœî‹S *Ы}et«<óbð‹·oR•‰^˜šÁ÷ ^„Õ†ÊÔz t“mx¨@{XÁHƒ­i0 t²¯ºìB2fkh]Ü¿~Rº1½­Œa;Kèûѧ{Œ$f•'pØtüž[Âö³—OôîØ1Œ¬e‘–—ÙFû›£ÅµÍW $òzçºÚ©R2Ûã”sz^‡Ñ{Æ;vÝ4×3kìt¥"5<Û”YºuXXJy¿¦½¬C|÷E%Ni¡¥0š@>D°Qÿa(cµïÅYzjfD€^DQüÕe·A÷Cfòã'È îF×ȧφ¤ns1'ÛܧÃ}У4ŸÒ{´ù}’ -ç*„Ü“5þíÞ(^ŠŠ²V;Ž‹ÝáEGd8ù!¶~B„ÁFõ_Šl¤FFÁÌÂrzé:#q8ŠÓsð½pkÇHÂçõÆ¡$j7ÆžOr6+ê–©ìa!i¾ôh†ÜMÚú{ä}·4¥Ì§µM=Œâ— )oÙºÍÊðßçÛÑñ8ÃílE>ÅfÜB×AíEc‹¹Ñ·­5r ÷rY1Èåì3Û™b/cÖ¸}õAÚéãk_³® ŸxF™‹]…¹8åiÜ“/°‚ºœ+¬OÝ)ŸS ¾¿{M«÷f2jµVFU”˜°û‹~0|¼ä^%»4öee‹‡ãÃù†53öQVÂÛ¢ÝùV€žt¹ƒk‹`ðN·˜¥¯inŸ&…—Ï$Y!¹ µïyW` 6ÕŒÅÛ –z‘t@€C Íúžiæg›{GÇÖ:óDmIsþ±ý ÝtRÂÈùÒò`ÉùašæÀ{2¸­ c@+Ì&Ž ÝJ ¥ ß"Q@“µÊ€06ùjO‰k〄b …òa'<¯¦¶wkãÓÀÍç5yÓ8#…ì€ÖyÔ[FI4xž'Œ‘xWô©zÜŒueeQháÂé½ÕÛ{=ƒÜ‘Ëd‹¤g–s´èc³í¤Ã÷¶÷€¡ç*>º;­`¿7ªÆ)B<Ÿ}éÑ%:i©3°£¶ »»½¾µ•÷ÃEp®íéÒ (roxtrd©¸M®î ,ù×Ñ ­7aF"ã s‘¥/UÁ¼ò¹A-°Æjœ¸ÉGUeá µM üX´ Ë\¹–@Ó2m®xü @ é7Íól_²Âi)ðÅö›5pËãé/¼´nòÛsίH_dtºz:­ÊtïÀš÷:ŽÇÓC+Ævãüøåj)c’Wš †–€ä'ôm§nŸPG ïÇö‡y8>óžoï;Ä%ŠX9+*^3»9cXž‹ën:ôûû8égÖÎeœÕšUî–Hö"ÎL… ¶ÃM¢=_¯\Ê~W~6+–‘ùÔa)±½­H½wús¢‡jÜ™®²x5”Õ]|D†o²ÒÁ‘¯( @ŠPè“fâ«9id(ÌNì,Æ>‘pªie¹pÇŽÑõ4„O² ¯´iÔƒà7Ó>vFפ­üŒß˜¿¤ÌK¾ƒ‡ì‡¸ªkØ#öè¦icî‡p㶋Å#u‘oÑ*þ ë®9Ô°#㿹/æåsŠaÃÝuè'=+‘D„p¬W[¥m*v¿^ ^c¹»,I¯;LèèXë]‰Š¬fÙµ²0ÚŒÄÜøðSaÈ™ú°-ÉWþÊsŶŠ?ܽ Õ˜zòaü™Éþ «ßf¢ÿ~¨W^a?4µ&!ÒýøOò~éÆ¡3k¬™¬WË :¯ŒºŒÕO[šR_”„ubâCïh‚‡Ì=ëwî©è¿r´ª½ŠêÕ¢˜§nž¼Ç¯Ý~|<þÆÂË Ïi?jÚ³ñ´hÕÏ‘“6’—«’uH+eçÂzÐûØÆbó}ëæþ½Ã›XL&¸‰£CÄȼRÚ‘ØêK¥±k©pmryww}»Ëæå„nõ÷7 Ä/³¡Y#Z×O¼•W‡ÕôNUAÏm•—4ʹ5åRöä^ÊÎ75«eF¶Oé—M}êl'1˜IH8B†ãðé®Ó,MÖ6ùKKü2×ÀÜR±üù£÷<ÂØQMBÚeÇ÷öNDPÚ«í _’Ɖ«Ý¨¬nUo:¨ö(œö{ý(×.¨4ûYWo¥§KÐöÝ*^á¸ÀR é (‚Âã·‹>Q1VÊ`°Õuá`C´ß Bvà)®5¬¼"Ïyý6ù–a$Þ=ŠžåÔ¯ŸÆAÅ»°~ÆÔÌÑÅ>‡¸;wº8O hL˜ .çôuC±êùJ…Ñã§^ÌH…‘33ÇrÅ©†Öoò0ú6Ö$ò\dýª æ†R8ñ]÷+eÈ‹µ>)ndrÏ_®­«ð„ ~´Ú_4>œvA½b%h\|8!2pïÀ‘' ~sYŸ8íûžGADsñÜXOÂ50iÌ„•æv,¬3GÞ hþŒÒi÷9k/Ç6g+x‡Xàet–Kwr¾Û$+u‡­„탖òŠ®dG6É;¨ªæÌÁQ╘j®ÚUd:¼8°\rÇ×22Ž Ý ãÓë6fö·'"í%&–aY²u2@ƒä ^RÓ¼Âû™Éd-Ù—ÑÕ–jI¤ä›±>j¸h2p¢Wž¾cA§mdÜ`,ôwc®9`=Si3g‹ÉPÌŸf<(ãx–Ó\”M{&×RùÜ|´bºè0Mø2Žy‡˜Ypªu‘ü¹ìÄ|Ë%ýk~Ó‡ç´LÛ Ÿ[¡A.Ü>B ތžºû22µ8µ’1Ìøص5‚‰u£â9¬Ýx¶&¾<ϯgëÔJÅ^ï¼èÌßm7”±@ž²°…À‰äõ´éF*wœÖ9O¾aôzÔ|O#¯·ò¢k¯>Nëùá›JB]ï_‘š->¡¢[ö0ê^yÙ+†-r=A;/iãïÀ3ù7aê2âþø^Šâí¥ëaÞ¬gOÄû DË;Ï:Åiö‰¹<É+ç&­ÍáßnYmHb ]¨ #¡Å5³œ+Kàõù!ÐO°‘»r}¥*HØÃé1G¸nÌÇocà“öžšIÓ©•TK8Ÿ=I–49ÎÌÖïõEU¬=šHà[òú@²?‹@¬™£²–©Ý Ô8`ݤ ¼«6oW†?–M¼½¹H'œ»Žc.°3 |v¨hvV7(¶UŒøDTŠßÆ2÷©lüp¶êGE.Ï‚‘=^ct²ÞÒ¢LÝ 5êi[ÅI?ym>Q¿¾œ,×ü$9²u­bdc1Üâ7$$%¢ vMŠÓýçÔëµC£!Š²óÌ®j·d/kGFhÒ¯X=œ&qôÕÄlX‡G’ VÒEêYÅo©GP³³}~±W€¥RêNçƒ+¨Ðèw쾺íÞno8Z\QÝÎ8HÔb™Ôt¹m|i®¼Føê¹øɼ»ÒϾ„qÒry­ÕÆÂMªëC±Áw}"YÓ_kÿ-ºÝþû~BϽ0/¼´¨ä#’,yÿ.ïKˆ÷:{Öûy§òÛŽéŠÃ{!CçàSc}õ1ÂZÏX#E´Þ‚×ðVÛ^F–P!Øuüµ9‚{œB^ôd{?•ñ¦ÁâÃ]è¿ZDôT7îò0¤¦ûÙ‹fŠÕ„þ~ø"asϨ¸iísƒ­©/f”lºÃî“p¹ÌD?d¤±mß³!Ò§EÇà ›Ú’¼ö9k?;T7•Œ/Z’‚'¦¹zæâܳ“yŸ²dt=êÊchâxMÓƒƒ”¥‡?Ùá ®{Bv}KŽ-qw&¬²×d H«:Ú³ ;áN{¶XåˆQ½G6Ê;íÛbäk1ÅâÈg$=#J|{ã•q'º¡#v9Sy¼ÑûîÄš_S³'ˆ}/)5ðí•d²Þ$»·ÇØÓñ`t“I)ú»à†Ó”âýj§My <iûYø¤Á’›&lxÌÍç`œê1]`ga.w;ÁF¨þ¶tMcý­SÆ¥¯¢s_Wß]½‚›{ˆúlçD]—}>u[³à‡²ê'ÈVnå–!eØÈ#ì"V“3”£—W’E¶’¤Y~KI„ã“5ñÏXGþùçÐ*ߌ¨ á M›Ì2" |™ô M>¬—p$tó(eÓ‰ëNmý Æ¨œŒ‹S‚•Òƒ8xz$€ò»É†66£ýò6Ê á½ãxójYè6;„jÛ6*:™s*†×õÖ{\•‚üõ ×Ü;V×›GÊurlB}8Öˆ’ÿz—'Óaÿó£[#qFŽu0õýÓ ‡‘$½`ÅÔýè½NäÛ[Þƒh3†{Mç…l›ºú’dZ)*6^ |¾2 =F ÇžgÇN’‹ŒÆ8þ)3È\ßÞx? TÒ’NeÑŒAQ¹ý±G<ë°(Þ(U]Æ®i ¬Ï4c±)“ǧÊt9¸ZbŒ¹¥@­5²\Þñ6gÍõpºßŸ¼„÷âFjO¡º¶GÍÌ{àì(RõÐ]ôX%¦¥C{üp/[BøÄ»°ß2ÛÃåªÑû)j—|áD˜'ç» —²ö²¾[·¤jqi\``kÕ¡ß~n˜ÿÎ¥¯½ô47OÕbÀK…g=kñ=&±o~Ó]v ÖÑÊèbH¥ªVüå‹•õ»ô%C–·Ä‚FQEiµm˵u®¡þ’â/‰Þ¶7¹Ím³3“Çõo™§‰1÷£.¨|Z= ¦v žì²‹Y—±­PŠ±Ð†i~S^eLf/të["@VvœíŽù»Ó>6óóûçÜò»9–ôiŒ\oHü ÉÐ&ƒ"N—3êBìô×y)^O2TRZ)JkþԜɄêÀ[Ü žæ:óƒ@¤d“Ÿã(FÊß}êψ"N§6®º)túÛ¾böDšæ¡êBÓ˜ÑùS›hx½j’×;¸Èéqf“} ‘R…ò‘8lf3‘•¥Ò.’Fa»S¿9BEÈ2xï q•—]³˜k·€?Àœü ³À©:>{½ä|þÍò˜ú{0g¼œâÖi£ÕÝR¸ ¢zŸœ’.¯‚MÑÁ»/.Ÿ=í¯O“:RÈ¢G}Ó‚|+PÜ…jûFš YĘ®×M_m©Î¸‚Øüêž1Ä°ië_Z9ü¥Ñ%ûvü[˜¤~v*9°ßFÂ.fƬ /­‰VßwÂzÙ ´–üÒfú¤$6]pc°«¨õ0êÊ’¬ –Qá(2Úfï¬gwxëÉÎÛ+­­‡í­¹º]u4ØÔ‘99Ûíôü4Ü¢»±œ|62Æ·?4­ÃNÏLÁNø´Ê1©žY oàvoe¨A~»õÓ{±)$!wF˜Bøì!ÓNKz #‹(³åá‘eòõÒàF!Y]Š, µ;^?J–;´GÌÅÃ)*©yö|œÿŒŠj#£d²\…JXûãSŠ«ØjFB5_‚ÑvâÚÞïµ.æ8Ú8A »”|Žh­{Ÿh>}ºC{gýç4;LÆ^q†Þ[&R’K¸­Tù»º‰yUAØo{飪j7†açÜPÃ’ù×ü÷óÌ ¢ù»š ÔÇ…˜ÚÍ! J$ÔH1™z8oc9J#C³‹!¼y¦’¯–‹p[0ó'Ý—?Øý®7xÈ$hÏ22È™µžñ3Éè‡ÝË5”Ž}´vØFuPBÈ¡3ÉÓ{•îÜ&“.$ÖM±Äw•ŽªìÔsµ@o;b #Yéd]Œ +vshرe:>Ë’8Ša´¾´w‰m°r¸'S¡ª\¦ŽÎò(©Ðv(ŸŽÒbˆ2?{¯x7¼?ð=÷Û€¼r*4­ÖóØ<û€Ä/ôhbQ×(® §gƒ_~u&¹½3˳X­Ìuç'ÁÇ‚*z*#äY¼4Oäv“;µ¸¯Œ[@D?ñý8ÃÕ$öMH ´+Qò·‹M¾…¯teçtžG°?‡bÕpÛ˹ÙC4\_„îãà¼ÄÄ) …àæ?H:çé±!º#ô´25ÚîôrçÆ–:Bø^å3Ô‰çC¡ ƒ.\'Dß—Â/‡Ã«Y*é3MæÌ_á5ýhvï±Ò©ß­Â´'+C˜«È«RTÔ*Ìøt=9mv%uFdߢnò´¦¨Ì²œ¿ç’„ißeÌ šB?š~jT«îJµ‚N©aê@¬3g/ä¯=G¹ŽÂë‚}bÎñsÚ“ýtOPçaÆDˆJ£Ük½]]x1Yî9"þ¸o@0õÇ™µÖ¹\ï¾ã c›¨#ŒõÙ3¿€ Ì—òÖ׸Á>>=/@›èø̹EÖZ¡êG|î§VY¥{ÿøRŽ3· ˜ùé×q€Çtj(~¢¡ñgÁ¦ëì/ªÏÒëÑÜnW1š:<‹ _G+<`’ð”¹í/Îâ¢ä§2éQTt¯5á¤PÈ Þ6xì•Ñ,¥:–ÄÎîoNÜ;—9Ä ÅF…¤Ff#ˆ•Ñœ¦Ý¼êSk-¾e/³ýLæÊnO´¥n×Ù0ð°h̾ûdﶯàmø ñø›5ÂåÛÎÁý …+w¡£v,‰6UÎ+mÇçäÂ÷¨iG‰]ÐbF%Žï›ØšîB}ªLâ9G-jñÍLø`ÄÃxK§Ì îÄaÙ™«ïƒ2‰Ãib¡v»å3ÜÃ4?—Õ¼º%j 9 -¡_M¶m/D8Ó ´¹š’¾¿æΡyl(áq-ìV‰‰ó©çÿB72Šb`0Ⴜ€-00SBÐÂð½Mf7]Ÿ˜ ¡_ 7^°©3¼Ežupœ‰Oƒr<·qÇAC¥ÈNÆ>ÉÅøãñ"æþ§µïûŒ9´t?¯û~ÔNv ;ÎÖ‚^EK dŠá{`0Þ Æl¿BA@ )x¢ „ˆ¯? ^=WT\Åñ«(ª%:#t—-˜)2 ŽcŒöK¾âðÔHŹ9È!º)/­!÷ŸúÜÛ·Ä-KþA˜ù°epRC¼ “2¾M§€ë&IR#±J`µC8e2jÙjØá@]Ñ%Æ£‡.Ýb· ÁC„›v‰Ö1}ýéáí­¸~ª…ÃB´©†übtÏÜû^îgïæ„&ûÑOçYóƒ¹3Ý­Ýå¤X}YÑœ÷™#døqžêQ²ƒ^1Q\SÔÒœ¹¯`ù)§ä\lBdó; O| q”“:|Ó¹˜•¾Ã&áhK‹Vâ]œ`f4'&5åË…Æ!(M'„Ãç{¤ómÕ½Ùv’ËCz¡6¯Ž²Lêj“ÿøšL7šX­"-âÈÜZB£G˜PƒˆÔuãÊlF>ç*ÅFÌÓä.ebÒ:X4›Íà~É]¶í5ªÂµñ!YÌvXÖX𲦯ñõú‚œ–˜²uô½±d]“EÖââ·Â@|ÝT÷\Œ:‡–0%›['Û1„ëæ—ä>˜@5©^ªËüHpÎqUÛ4: µZú ù1zÚElA£Ïÿ—#hÜ}Š&KRUOïòO $¤ÌÖà¶K“ ¢0òTÜýò­t#‚·ßÇmÀ¤¸ô%7)ôÑßéqh~_¤‰Lƒ”<7aÑ4‡ž2t<éò he²µÐ(!Îf†ü„äQª€h‘û¼œ’{eïµ;5­™Øs2##ŠÿnŒ ±Þù~±ÞTàËb*Iqv…&.¬¤/Ø• ‘ÁôŸ€ÿ~V·šj¶û§ì豧C"?ì·º^NT9ƒU¼Uy#C»¦µ–V¡Õ‹¦s”JYAØIu¢“ qTVéØ)½ü=ðÈËCà®Пñ„Ÿ) MÍýO‘|û?nr£¤jJœ™œÍÞ·<2vΟ±&˜`ÇŠIüôAêžDë ­q†ÇÙBþåD@V'{Ëýh!à7í]*@ÏíõÁôG d!ÝŠ~_£²¨·»yöä5§ ˆ3 'üâËÅÁ¿jxôaMrB@KÐ¥Ýk Õ})f¯T<‰Éaµ€v…2á¨qÖò¿,3Èy–/ ã7ìB‡ ˆ·î®GU$Å΢åì”Û—"O`TÜ—Îh{êÓ°vœì†VEß‹ð"4± qkãgœ€×Ð~ÚV* 3•£™ßÓÆ, húT;‘"5gÎ0ÈÄì ’ƒ:ìuo Ø g\÷äbîÜ‘_®Â{°hÛ®mŒÊú}Z5—L!Ü!2$’¢f‹Æ `#á%TF0±ä²ä™äh+NÖ>uv~†]bž¿¸£Z&:#Éò¢çj°ûO{Á°´¼ ×òaKHBˆn”y碵ȪTæ¡3•Þ¦­FçWFÙ{"VȦ%oª-‹¶¥&3jn’¥/‚&‚Xxî4îCû4#½«KV˜¨‘«Õ†²uX»·"" #n/”ëx$ý¬ôK]HÝûªR¬¢Ö²oßj(Ãu#û¥½Âì.PË¿£?™^¨ÅIãÁ‹5†d•³•»šwu¬9£Ìíª¾ ÷+lM´„ðIÞ,‘³/gw)å‰B«°‹Zöš½‰<Ø*Ð>Æ£’­ˆ™ÕS_*–×UXˆã¥ï÷î'Ó·ì–ÂÇç·Ë&]âqöu$¢Qò.”.Ù€ ÓGþgòÃ?ÞÚPeóëp@_܃ÓûÇ› :Œò_z­eÊÞ‡Û»ÉYëß6ð†¾oåì{˜)ãÄu;cX½›b5D—=€?ɆÁWw¸×ÛÕã…AåíëÖ)mržÿsþ-NƤã\†UzêÔøƒà¶L‹@~ ¢ŽxEcÛŤîÙQŒ¥9`ARƒ÷/GéÎ×  P)6aVíi- Üj°•3f¯;kTÌŒ¼†bà' Qãyí +ƒfÍÅÃMYÖš%ÿ&ñ_Û£#Ô7çGŸ †'õ]IGÁÔƒÞÙIÛbÞLÝêj˜@‹cö0 YŠýÄ¥Ú‰.4x®Î·Fî8:ã)’ÊÎãߨÖXºNÊv6#/[yZÁKìÆæý¹Ð¥·Å¤ª=œI©Ï˜¨é%îÌeup‰ÜU•iª³(rÓ:÷¬¯Ÿš1^Aòd »‡W÷Ù.vh<°?n]<ï0½MHägí"¨€Û±Lˆ ”i¯Å,+ÜÓ`y®÷Gy‘§7N\¨ª_¡q+Ó:e’ìŸ*P¤³t¹ƒ†øÞBZN[Æ›» ÿôý9aÅ]Å’°kp%”è?¤‡·#˜qÛNµ¡sÓ#»3@ùóÙ^] òa4¯j©æÁ€€æ^7&ÙÊÖ/j+nƒØO«f–¬ŒŒ*ÛŽÜÛ1T'R¯³H1ºW`TT(¡e—1ö_ÓkßÍ ?£ßFˆC~6ÿb:ÒïâʉÖi_p‚W„òJZ[½úžRƒÜAÆ#Áa'!T¸’JEF¼^í4)d!MEiÝÌã £tј˜ê{eé=h%‚¯(«C:Cx¶d½BT´H†§ÌùÄÖ%êÃÔ$u ìy¥gzÅ1¾¨ù=ÖB8اUP7ÞŒ…ñ0‡óØX=È/ÃÚ«¦ªcžõâäú»R•ÔÚMCÔ ¡‹xÓùr6âŽacü¸Å°•³/q‡¸Ì‘ …çeâtç_òu=ÎÍÀÚÄÞø=•Š†ß!‹üšÞɇ6Î$PÜiCnÚs:ÄÊFõØa°ö¬[ÅÛ¶5l•Í2Ô˜‰m/¸|ê×¼pS}îqï8÷ó‹H—µoÓí´Lä¬#¹Ô_¸ '…wNýõ€p®˜ÚÅ¥Î>2S?Z¤/ =¼N¦êãR ã=±Ù›¤sºÞ(eÐì3‹–pCù$½1Ês$½9ÇC£"£»È†¬|AµËÔ¨F2`±¦í£&—lDÞ®lÞU +_÷Pˆ01þ1!Œ,†âø]±àc÷…!;¿8Âålñ{ÿÑ WqãNR†¿_™²4’)kN4F¢ äzd/”) åˆÛÄÕϺ ò{Aq+îߤ”f/µºæa°’Qëöa’ä]ñTà1Ø–“‚wà„&{pªÛ¥y ֛ķ,[k—7¢qŠû,â¹ú{ã­o>ûäD5ÁÕD < …4û¡¦1$õEDI1:´ªÓ2ðånófV’”æš`šçav(þTÓ%QKÔ¿NDС¬6¢¶* Ôša/~³¨KkçÃ`tÂg‚‘/‹ >4[_öb}ƒñ¤Hœ0KY ÌWxf=QÎñ}´û*Óªû!e¿"s}¤U`vEXbgpÓá–É('ØM8/XJ-ËË>¾bQo£AëHŠL€ÒÏ,4Âáw ™›¹ÿ™/œ{ì>víG+(.S‰ŠhÝïŸoŸ5ÇQèúRv‹Å©¬Ò ²H»M¼®¹²oC¸9†ÍOÕ\ˆk¡¬û: ‚sÛ]hϯÛ*GääÅB×@ˆ•–Û×QìÂ=½‡öý:ûÊZ È÷¯d @”…Â#ìÎ_ i™‹0Çù?.zêÓ'PÒ”á|¯ùEùò’ñX>‹áG|þT«¡”.£¡Œ(Zn‡7zpõUßÓ’®›Ÿ©pçxEÔ]sTÎcnAŠLG+UïîƒA¯š¢Kv ™‰/O KÝ+·Š=­‘½8­ ¾Í Õm—².23u‡gTÙv˳Wz~È]>Fö˜³B 4ÇõÀwqß´ '%AËêý¹0®ÛúfªÛæ½21öMè×wHåò<^ýð!hz:ŠI»]ÏÐűŒ€ŸG…¹¥FR|)eG?ðUEX©zë :¥¼Kb2ðìƒÎ™F+”ö¬W‡¬¨ìÒ>¤ëOz!ªÕôf¿èªåQÎzttŒX¹á<âc3³Ïh^d*€)ÕlÍQ´t§Sþätµ»„.ï0¥Ì·Ñó¼zá[±Q)\óŸþQ@蹿1þ¬–^×6 ¥ä|ûèiâ ¤¦š[Àß iWŽnãúq¾E¾GóºÃÏ€ªúq†Ï‹K3’ä+\*XŒ]ÿØæË_Æ\_´Iß%‡Bþ땪åø'¿Ý}bu•‡’:rqŒMT·—Llªçe±þñZ¢+£ØüÙÁ]²Á~™O "ÈKMq. R±ãÀ1rÛ’¯®rEìj¤Í{C®Ž~j+Ó6ö‚8{‡Ÿœ¯âõ?5cO™£ÎV£õ™Pcú~Ù}¦›{§O-ûQ–6ôÈ]lNné„„lˆœJ‹kæìlmq· uâõë3ñ쯮B»ŒÛ@÷ʼ€Ü6@ëd^ßÈþ-ÃOø0b½ÎÎ̧­vt43÷i÷¬€=×ðfªG J$ó<Œ)Án{š²£Ey6#ÖUˆÜ³…äþÛ«Ô: ~²D&¢ŸºÌª¼¸ìeàRzòêÀyì׆ó[5á0äøGcçÿDS, _›ü§Eº—TÓçÿŽå2ÀÇd01UæË– Æâ€Eœ±¦/˦{ˆ°w“YæÝg‹ƒüèס/.¡©¿œ§Š˜Àúh\’óLê‘_óÄò3£ˆN0Ò‹}F.«ØÐÇ‘»…ucŽ˜´¼ÔO×…#½^«¼ ¦-màRqûr^ÆuêDŸ°:e€!!Í·y×¼s¨VÆØóÌÏñImÓõöíÇG䆀Á…´I¨¦yY6çHP)´ížÞ Qœ êñ¼Ï/<Ù(@.JuÚ«wîÆø6– ­3þò­Ër(ºcCD‚_Ôëã9ÁP™ØµI8óµúÌØ.çúq22€½Óé%^ñTy2<1ûÐ(xzu¡öåQ›ÌÏÙÜh'¢T'ê-7±?­ÏîaKì¡ŠžT R´ £%ìÒj²kœ•æ -Īýmá³82æ$±qäI;½¼$ ¥•&áˆÑ$ø A¡ \âüÙLÔK›…¾+;€Ÿ!¶—VÏm$вèÓæ q´ˆW[ä’ùO9¦ˆÁ T«¼´¹CžüÓ½Ê|˜&^ÝÏLõŽ'þ/žØ÷ÊGÜÝ ·üYi¤ÔÉ_º~ć‹+ ŽÛ\7¸N®ö23c•Kô¾eš¨4†ë²¹’Ò’òž¦‰-ëÓAaOÝibAÆoàu ý⤄S`§°]UtõàêÜÞ¤;{F/ÙÚ ?ßrÏõfRû¸*l,tPÞx‰àkDã»f’Š™.íM<ò¥ÆEƒ2ò5~#Ðfõ’È÷Øz]ô,ðêÖ¦Ny®F<·’ÁJýóÏ6çŽexN–¼¹™t­×ÆúL@û7¤Ïø'‡·wU!%†u>.$HFŠ}¶’á2[º:s± ζ§æZD®÷xõg0.bè †­Mþr%ÍzŽ!2ha‹,"~Üj6³NóÀ"øwãÿó-%"òPyëÏ./ì÷Wþ}ôù§Øž"°p¸UÒÔß#¨ƒ\WfÀ=̎曦ã+«Ã(¦]ÑȈˆHÍóÖ©•TÔãÖgøœ9EYÄ0>géâÔ°ù¡vNbÎwÑ'~@6•|Ë+i• ±Ó½ËAIøZàá8æ!0v³æÕŸÞ›@^1Lo…Æþ-ï=ÕæÕ¢’1…iªÜç^!S¤´¡ò¢]:R¯oÙI¨;R69­²‘MXëYt+±/½ßìépãæê7:åd׫´Tˆi=¬=æGÈ\”èŠHaŒþFwÝq¬ Mì‡t‡²ÑàRÔ™ü¸Ôž ­#L~'gÈæP]¦|¼ ,زk眊0ùæG…U/«ÇQp ûÑ áêëþ€nw“˜4šEÅß÷×cLVá…îe#ÖxFÒèò—ÞànHßdy²s9E–¤ï„õgy9¬£¤¯å`À»0÷#PÔ²¸è÷¦lS†ÔaÏ”œ-Ù›åþoŽzÒÁ‰ËÁΚ£¹ÃñÀõ¥ÄèåÊÍj7?ð´þ¶ƒS©ÓŠ¯øô8-#KÒ}¸Óß+¨ÅÄ骟MÎÙü¡!ýÌÃÅЮÍÐn°ÝFÍ¡˜…õÁÖeÏíe  ‡`Š÷a¬Ê©6Eñ=›0*NF Q̘¥û¾­a’ñèíT÷k¦n6r H ɬ˜Ûü{rVRóc¸p¯½§>ⓨv³ãÌ(ðŸÍ ÍÇÏëhyýA’‚úÚ¤€IZ¸Â†t%>0“ ¯³Cɦ¤YÁW¯×DZ|€*ï0 ]ʦ°•]1ñWW=kï [­|Lç«x‡åsu…ÐfŽïÖÙ¸9¬8.²ëŽ (pRݦñÅØDPcS ì Ê} S3‡´kïk(ÈO ^$E†Ÿ×±Y¿–Úñq{'rÉåÓ«¼ÿN­ïÀ×Άô§›#œ‘¨RB…pÿ Ǥ Dà²ß3Æï¨1òÉ¥t÷êµ€‘ÔwıšæPÝùïKóÆ)›j!„Ke‘uQÞ܃˜×Õí±ò ²¾•»ž¾Ú/0å–½l²I ÿœNñ$–îôÁe òª {BÁ©!ϲ$ˆÉ|EÞé‹hVÁÙ˜H¹7¬¾ûpÀ_ÓjT¥T”òGª ÎÛúÍ‹xF†sRäq6¢°P„±›6§O% ÈYF †èA [g©Dv2à Y¯dhÎ@ ýw¶?IOýµèózÏ‚/,°NÁ†-Ò;TpbÅz“«ÀpǪÈÛ½MæVÐпíe¦MU¾Zá0j/gtŒ$:ánŽ§^®Þ†MÂoà×ç÷£œ»ãç] ¤žû \—ÙV´s Š36^PTH8"]¨÷î× OÕȎ܆¹ëx0öó •c”è #V2²™Â–@t柰 D'â†W BÐ÷Ÿ²[!¦ÄŽËe´[ ¿d"#Ø*erE¼ù袣üw4d|ÿE|‰‡VÊ›òÛd®ñ4B¦ôA¸4SÅ.f4”SPèý¾ Ïp¬N`2¡¦GéH¦–†ñ—ªöñOîIºZ˜’bOê ±àM˦=ökítÃÂ83üðÊD*v›áwé±Þ±òcÇ$D›']k­G:'W‘r.ýÂbÝçh0x—p)LFï ’!~/8¼Ähâá´·T-i*‹a‹ç– ÝE:Û:¤Qƒ3´h#•ƒâ§}Dâìä_4xZ³†ûq©C½8u@iP÷Êãj© ÊÂ"Šæõ–Qôèb âc‘aTöDÿg  á Àw r:¾ZÎC¿^-o14¬“¨óÖ$‰;ñ;$õ²Î8ê­påÔ?Py†¯.ŒO#”O܇QIl²ÄºÍÉQ¥Ð„¿Ì|°Drrʇm>Á‚òd ÚÓ ×¼Œëi!) ,ó̸Ÿ9ÕTK5VbÕX®ÏJPì½Ë°za¸ÅHÂÖ"›Š§'#‹ ×FØ‚¹¸ Ĩò¹rïD/4`cº/‘.Ó— úÒèv öÿ¿£tà῾¦ÐsVH—Õ’sÜÏm^•1ïóæ¢ùq:Eˆìà/'0^¨¢àäp½-w/<ñ;)͸†oÒúS?õJ „¤ˆ4ûæhŸÖa"Íl¬ìõµlò- fÝÓõÞÚƒÍ;[‘„›±šå ÚÝ0ï CyÚè:ƒ'ƒ €yó Þ ö’3)„ÝŒÞ5“Wrè@Üâ¼ÑÆ6,}v«§ç:Z°w+4€‚F! 3¬˜»AÿÅ ï¿Å¶(´eàÔŸËÖ+‰›ŠˆëÃRx4Më.”y“b³S§óæ¥eò­ p†G´Ÿøðu7ë¹%ÿ²}€x{V>$u¬5”ZpüÝ˾I{ÚZjD§h¹ŸFaÊ2õü4ð醼£Ëø5Ý©xá‹öÍ_Y‚ˆ=”MƒÅäÓŸÕ‡‰"¼T¤¸ pÛç¦Ñ×#”®¢ê¡Q™,2“8!j¤²ß¨`¢X57o²>ÿ™›Ç:ÿQ»½—Ÿº @uëŽ A´=7 â™Þ0f¦¶Ov§÷Yp­0¯k;\[ ²íf4¯à²ÂIÅ<]„ýS tûœ­Át\èyJ§³ŠA9Ck;»¬âÀËqF)Ó&@žNÖî/^'*þl©`^—3 ²ihOÙ¿ËØ–°fnBbzFB-õñà¼Ëiné_•OÇ‘„+nB ‚ãm³ ÈvÅûº*UZ¿ dcÙ®¬É¢Ij^Uì ;6;ѰSÃ^IPIÁ#ET±åœÑܦ }òîîÁvÉ>ãÙú>à ñ“ÉØ!¥Ÿk rÌMt‡H¼»¯"¯Ò:3ÁBa7t©žíz_# Îÿœ.à)¹þ\I3Dqÿgë’”©@¤Íäkš3¯åØ4Ç-¬LέC® +4ßȈ+–o àE_öÕ”z[—•qT4èí圊›-ÖÖñƒù²Ðí/²Pi ’zßö4!9N4…»áçµç(Þx B¿ Ù‚­+XB‚ºû²>I9J3AÏÎô‘u±úÓ‰ ÅÀÀälœXÁÅÙÇñŽ!o£%ã)°)5+[p¬Wƒ7õ¨‘£öA^ß”‹ ׸?ozƒóuy››XÌaM¬ÆíÖ”º%ãܨcÐÎg‘)v…ùhzÜ—+táÂéFj²ûë»O€š>)][Ϭ‹E¨6È?– pU†+l <†Ë½z¸®ªÜÎÆF‰Íݤ÷«@ÁUšA¨MH…ñâbèLÊÿàî2¾Í)Þ,ùBØûµZ{þ´å¥ð3=øjpHQTçã›íF·D@ÊËT¹‡v:ñs¶ë1•‰í9ê¼SjEgS­­HygéÀw&;¿—³ŸŠî·–B¨P$Å¡ý«ÿÙ?² Ô/?µCœgP¢bÿÝâ|ª;,áC€†c×Ùª¸¾Á(JáÑþ¡méÀ·6Ô„îÆÊ"Þ£»¹Çk ÚØF=!£ÔÉN“vÊ¿øSàú¦›?Z›P¨ægÔ·^øÍoÜ@ãö$ÊÚÝ ÔBš>~ µpçm¼‹¹nÕ`ćó¢WbyvLÚå†kYûX¯as ’˜va±Ë›$ÕS´%­LŠøÝ5Ì• ò®u,ËP"ÍàL–²×{ÓˆTK{/54‘a0N)Ê„"=âßOtÚ—Á Rþ.cû‚'8ÅÁ ë~¥`£’Ìòmf¸¬ Þ&×bdÝìg>,üóD=§ímиð%ÞµÛyÒfÂÓ\ˆlÑv8‰¹’“¾–çF¡x…Ѧê¦#Ê–È·f>A]ý$v3¢-ŽeÿLÈùåq%ûi7ÖäS?K;j¤¢°óé1´&yYJOÎê€\–gG=gÍP–çÃþß@¨¾ä-âÀß‚Æÿ£Ç$n½]VÞïE ì挘!FúÓærŸm5Ϲ·ØE L~ÀþèàÞáQ¡Éèc0HµŠ+¡¤\gÞÆÚ‰·dɬoßÎ,DÑ^[fµ™Ó¥sFr•.Q¶"˜:(R?uá•+‘¿Uum«é& )RŸú– }•=Gª=ÙKÌÖÞ„Áú½ÿ"1µÙždÒ;ÁÙUäCÎDñlxVµ|Ì2?Ð7ßH¨Ý—"ô.ëe7.óoÁ‚L>¶ÁG=ö×-‹C‘O X6B°,ZÂEFÄéþ1BëÀ3fªCfÂà u9W·ø“qN.¨Ë¤$X@Â]˜’¹è+öDìåþ¼,%, È0ä0OH³Z1¶4èÄU®.[ÊÌÇsìæó2Â{9ƒT•†C´~‹‹å¿Ž‡¸é•£ÌÛm×™'è¸àÕ–H*Oóqo9€s–Þû‚V+œ™©÷½ÏUs9±ç‘ߊž b&SZ°˜‚Þ­@0$‚©Íi)G©Ab¯4ô–pH3þÈç×]ȉÕûTWŒ 9¡hïjØæ0K‰q}ç§rm&§/†[LxÎëÉQ-8º1ÜRì©!hj×°’èÙ<üeÉ-³ƒ(]œ·Þq6ÀÙýõu,Æꌦêé¦! ³{š  ñ –±;Ž¶³WOGÙ§èØÐÌ0ƒcd¬/D;Ã|Gúù ‹FE¬–cõË©0(üÁÖî›Ölæ÷Ê¢"®(ªåE[Å—6§4¿jsK;éúåå²{ŽE»?HEÿaÚ[Ù•rU4ÈX¹0¿¨ cnh»_\,öu+V¾{ÝúÚ®XFº©`ñùÁßsüWòIA F¢øG¨ ~>ÍKv˜®MKñN·À9ïèÊÏ ™& ô…9ç3õíE][–öÀç” UÆ—RÇ•£<ìnMXb¤"ñµËóz”¥Öà¢f™ÚÒ\Í8ífWè7ø“„` È1sGCJ—?/˜!Ídz†µÚà¹Ôé+©p‚2)@æÌMFÒ’þ)é^LõÄ›uÆk_+-™óᘧc_®ýﲩHgåcój:Pµ}²†~¬0ñ‘þÀuãøH’áö—GFÚë+¸‹%9U9«ºËX;!ÎGrÈ"ºÛÍw³Îm9¶.tÑ÷•ØµšíÎs¾\êÃ×ý³ð>"›s›qaé8.%ÿˆŠ¸Rg‡4,œIš´~0:Û~>u.Øžî1¿©¿ _GAÒÕåO…?¹cCàW¢Aæ­l³±üº` ;oƒ…ä•éWãl¯`­£×æÎÀƒ½'=UÖ¥ÙçkýjĆøšGªðhí¼VÏq´tˆCøì¦éyS˜óε *cîçh%üìÑ»¿äŸ#æ_ìzǤiÑ áýÛ—ºTRñ8ºHo%ºQ\·UNöõÁ1Õk ï ‘ñ¬ÿ-†¶4Zál÷P[úØ.><áûˆŒÄÝk}Hh^‹þ»°:q$ž«/Ϧ{øøx„µf*n)H‹ÀŽ„ù[ò‚Cóô;/Ê ’Ê ¼ø6ïϦ7PüO¦Û,Í¿ (DAXà¥I‡â¤ j±ï7dQ^Ô@ð8Þù!§¨¤“Z÷‹\&I“=»Ô”óS<ÔÐ^ÏC± qðãá:`Àý·‚íþ‹àçŠÁ . !)ùúxͳ*™·G DÏŸ˜ñßJóur:0㺚£׿ ĈzqÎìÜDûg7¦dT¬~»ÊÄÚ­„±N Ò‚J“BÞä2Iý; Óé’€áe·Òãùæö{¾‡¯Þ# ÷ÛŸ>ØYÄ/±ð*Jù Þt¥é ëu‡¨dGO®Êâ;é]Yât»RºÆõ&gf4/õI ¡¡TÚ¢#†IÁ endstream endobj 601 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 603 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 605 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 607 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 609 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}> stream xÚí[io9Òþ®_Ñwñ"â}ƒrL2™8oìÜo>(vÇÑŽ,y$y6Ù_¿OÙêVë°åX,°€E±IÖõT±H¶hcM%+gCeñåL¥tÄ·ª4:”2• ¾2Ô­4Úue}{HôÛÊWŒ÷A œsUPàãeñ‰URÄÇUJš€T = ­2a¨E%:T<É&b >¢bå@áAY–*”Â'Cå´p6¡E£’ Ÿ•b¥ûÑA•B­Ã(ÃÀÑàè ”È“>¬¥±¨¨Ë¡’¨ÅWÚY(B¥ƒà®C„¡!U:%tÁc•¸yÑ+´@'k©b¨#4 ŽÌ–’¨ÈZXÀËk‡1IVÞAM2É' éÐ h©b‚…d„ƒ' ¸c ¨è*Z(業¢‡.ÜcÒÔB®$þIäCÐAº©€ÔÒ¬Rä&ÀJZØë©ÅK„¤Âs:UpŠŒŽð%ºNä]¥ Äxòª†Š¼j’‚Åì~ãŠâÅ(C$*VkØùTCD)•¨A à QhE5C±¡©Fšiƒš'eµudµ!¢žbM{D°'´''xâàãr„ÁG‘t±ÐE'êÆÊH… ¥È62aÉ5ŠŒ5 0Pf`4E%=M~1š(™â5 QÒÊx`a$Qê•Da—‘DáwMÀ](¬ÔvðÓOñ¨úà œ¬^Vâí»÷B7Œpñôz2ù8øÛßxÜãÙtYýôS%CÍ2þ1M*Wêdµ-uภbq<ŸÔËêC%Ž=®ÄiýuY­øž~»ªÑ1º¨â!dÔÓåÓ–9 ÄËz1»žŸÕ Î Üô¼>̾V$È)!é3šƒ–}ÈãîO§3°úÀY†té‰äþ8¹þ´äç£ñô÷x0›Ÿ×óÌ[~$Π¹ÑzÈ32Ú!¸9e†Aç’Z•0ì>CsR‰'³ÓYPÿòÛÕr<›Ž&ÿ/­|\–×ózñW£(A¸;³†;¦Ý:æ[Æ -)üþ“¾ ›¾qù¦kž¿ëc®@ý?‰€W›¤Û!àõFtÆïÎ8TXÄ\ CRI{(1‘¸‡ÖÇ­áùtºXŽ&“ñô¢”^Þì‘›ÆluÇ ö®7îì·áorA׻ߜž‚7©–6U wV-ÞÂŽÁ":Ä’ëüëÄmF"Ý9,é·Ši¨Ñ·Š¨ Xo1Ô¦4´úvCaUÂrw›¡ÊrR¿ÅPìú†JºÃ‚|-ýDÞ´|OijVAÝ5¬‚><â?8¿ý¯üo-?>캻l¿íÐ6_!©a(%ÎCSJoâ0m)£tà½Yb#†±ùŠ˜Cª)1Aè㽇ŒýeŒ,ãæv!ëiÛÞ+Éb©ð䃅&+£æ:Ÿ2Èäd<™huãÌä5Lî–8b¬òe3•$©A L–Z,[L¥ÐùÁVZÐX¤:=Q»ñŠ8KäV .=º±‚½c»œ6ä5#‰½IDl{gfdqª»õ'SäÒ°—×I)]ÊÜ÷²¿‚æöìn÷šÇDO½8¡‘öŠÆä:)&Š0~¢8ó«Zp \æ•8êà)[¤â\˜² y+ÂGvR®õ ²¬NfjyT©³âÙ\‚[» 8Ýr‰,;iGç–Kà ›$Ûq†‰ëä"—ù“lÇÚO™ùtËìŽî˜Ü,c')Œ‚*"¶#¹šVyœ‰YG§{ššÜS‡Sv;Ó š\……‚"KÈ#¹Ä!$wZhë`VH0vTº6å‹%}Ú§ÜÛ¶ui¨U³¢âéÀzuqa~šÒ™•¤ÎÓ4Â4ÔÞ[žñ„˜%<à=ËáhOÆÀ³5Ø‹`¼ 4ßé¥ ¼çÉmšÞVQdà\È/XxÒP¯×L ©—Z"mÚ™ÞxòŒw”!””²_tãü ߟ#aÅ¡­Q‚IeZFÊ€ŠrXD$ ÕpžƒOwĆ¡œe‘Ž<Ñ1>ÚDÈD‰–$%xDEÛdi'"9S‰͇h iDF6ñŒ%D½Ù¢9^l»8vËËé†6‘˜å:'Hæ¨%#ͳ?’¦6„âGcIg‹ÈÈãè­eüøåñˆœÃ%Ùl­'¿Âô¶/RÔyŽ¬À¾ä‘4GE†äƒ4-=7 :=ûK6¹qê-hEÄÄþßç¿æC‹å'§5^bgÅï,e½Mâ²ôÑ“n×szNRs)^:qÙ敲ú­jÝQÝ9؆`éû’îÙ¶!DÉ«PÙŽ9ë”u-ÏFŒ+s´c'òp•òæÄ5šgÚÂÝ´{‡Âµ9Ö+ñ´‡É‘•¡ýZ‚͈͋ß÷oD ïÎËF$;dûF¤Ù¸¬bb-‰àƒ#l^Ñriå7cicJ+ªÛYRöw™öÒ´ÅçÖÐô#Ü(¥+eMioxSv§Ÿ.²Ä<:×ÛQy•µ«Ú~ oSŽÍØ^ërɇ¶5¤ÄֆϴJbó*yï„(¤Ñ¼ê¨ÄFDâ-8^½|à3 ˆðKâ­—+õˆ…U±;B¤cEô–Ç%ÆÐëRÍ¥­¯øG µÝ"gù|£³Ÿø;ïÉ:þ¥Ö5¯'*sKö Ó­Ææ~ëH ŠX¼Ôöe„r½”oíÛ zyò¨^œÍÇWËÙ<¿Ly1ºDÏû7OŸ¾úùÿ> $Ú'£‹Eeó€üŽã¸§yz*E“^p.ÎèMÎñptõK=¾ø‚Ç肤Pß=EO—£ÉøìþôbRW`²¬/_ÓMñ¶a¾€Ç—ÑœÞüEŒÄ'q&ÎE->‹ ñE|ùvõ¥žŠ±ø]LÄ¥˜Š™˜Mkq%æb!–bùe^×bùÏ™¸Š¯â_õ|ö׬ýã1dººïbnãøÙÑ£—OŒ·JoGÃBCñï`?´ûâx(‰ŸÅcñDü"žŠ#ñ\ü&ŽÅßÅKq"NÅ+ñZ¼j£³ëeÍØÍ&³)ÊËËãÈŒæç1þþ®³ëùvh§c Ûà{E/³&õçe®Í™ËU=ÏÎÅâëzA?¸ 2[Ö¹“<²¨ÿËÅøë†oþ ï|ÿÚâ¡tˆ‡Þ¿z|ôúùí®xÕJôû uH´5l\de×C²ãìGwødžŽ{ŒêºçÓ|tV×_ó7aõi|qÑyZ¶õËñyû°¼ZC ©Cxþë»·¯€Àó§»0«kã 1jöÅè=e‚މ‘x0•àkÂî3"l,þÑ™·WMøp LF‹/$õr„ÁÔ]ÇÄ‚É“ãû/NßfLvÌ[£L´ÿA˜x·“léºEî‹^¿zÿæýS¶(l7¨±Gõƒì‰j§=”jà®uƒJ­ÏŸýzzú½ÜµV6’é{,ZÍ\ŸvÚ³™XÏ8¹¾Ø’^ߊwâý*ÉŽ.áÝÅhz.F˜à<«¯—œ*K=çÃ~*>×óz1^¬rr==§IPÿq=šˆúëÙdtIyšþÆmºžlÉØÿ8ƒe'ïv®c©ºÇË]” Áµ¶ÁлÍpZÿv­e×íx~6©ÏfWßæKq1¯GðÐËñôz±nñA9úô—/ßѺuº{Ýr+oÚ•£ãN‹bæ­Ö-Šê½ÛέË×5"ýÛ:(¥ùû§/ŸÜ?&PNw¦E`BwÈL ¾‰RkÐã ­õIŠmJì'Ä-épq6/Ç“s4.(o,~/)Y1#öi4o·A¹–ÓËí³èl2“UåØü¼¶µ-a»™0'õbÑfÍéõå'h>¾˜Þ˜@ Ô›é]“åõôZœÍæõž¼éåA‹íÉËã׿žä°Ò»·t3Í'÷ýaµ{/´¹3Üâ 5÷Ðdû£œð°š¬±cé\Þ¡Fhð`´¨ùÒ@ÿŒ»_ÎäŸõç‹%©£ö@ʃҠy3>_~Yð…P{:{5…wÏëJ®Nÿ”ÙÓ'ɾ>4ª£nõ‰þèÓ?SõõÑ}}´ïèã;ê¸ôþy¦/Ýn w¢qãûG‡¾xßïºâéa%].½·Íï ߈LZ÷ZÛ•ï@ïýúž|]:ý¨ÜG^­!:¶»‡ë»½¾6QhS×Ý( w˜“½ýX_úFÊŽp­:H˜Ã…÷·F}áþ†Õ/ûŽ¸CTöw%}}6ÂR¥5}:am_Ÿ;àÓ_Îzú¨@¥·hiÒ™¤ÁÝBº ¶ Ë`×´ ®.vÑÝt&~6>_Tòe3•¯v•k¥*‡ieòÄÊä·[ïÂßäw ôSzþV™§Õ²|Ûòï,Kuæa o[ž­+ßEv¾Ô}7®èY0²åþ§ EV(²Âݱ²±ðL›ÔáÛÞY†“…W¹fèŠ\ñƒÓ¥ßÈCdè5¦ð2+gMù.Ïå~z¹¤½O†Ý)£\'nîá60Ë-Å}^Fwym׫Å׬㻢.¼¶ákZ|ÝN]doCÔ´ˆš½ˆê¸Æ«»OX)V¢É®EÓ=Ý©[7ènÈBÌ6àu ¼Ö{ÂI¯ïüšÂ5Yá怊®/²õêù§Ù"dŒÔ6ÿ¨Ö?Êî¥^SXoó–j½¥äv^™z«&²^®¯×ãL®{·Q,ƒ¥×½kúBZÿH½Wˆì*,·M ¹^§¸‡—nâ¯ð²›¼t -/Ûã廼’ÞFmZj¹:vÝ ÓÊ ÿÄ3V‘ endstream endobj 642 0 obj << /Producer (pdfTeX-1.40.14) /Creator (TeX) /CreationDate (D:20150727140607+02'00') /ModDate (D:20150727140607+02'00') /Trapped /False /PTEX.Fullbanner (This is pdfTeX, Version 3.1415926-2.5-1.40.14 (TeX Live 2013/Debian) kpathsea version 6.1.1) >> endobj 615 0 obj << /Type /ObjStm /N 69 /First 605 /Length 2253 /Filter /FlateDecode >> stream xÚµYMsÜ6½ëWðh\B㓬J¥*±l'µvìµìÍa“ÃX¢ÖŽf&3Åίß×dƒ$Hˆñ!¹hðÑxÝï5Ð )]–…*ti‹àñ£ rºÐÜVº0ä íË„€_[XSáWÎÙB;_x‚-ÖøP^h[¡2…¶¶(=ì¬**Â:ã RT¢¡ "ÂŒ. ÒÚ¢QC÷q° Yž";RZÁØ•Œ½×]p †±’JÂpã²ÂpÙò°å< &ï@…*‚¿ .ÈspÆž£Öìîءc~,Œ}à `@ÑA*vÊZ”F™b·5•~Ë&X:‡åF,½Š5Õžr·5·5…UíƒK°rÚÇ;Š±Ì*%X9í㕬xßæ±|˜b…Le xY2–[Å2 å°ìˆEkX®šbI”3,5`ÅKvŽ%«MfµÕvfµZRRe’‹g³¿ôìâ sŸcVlµæÓ$ìsõšì˜;ËJ\ÝcÙ{;æÁR~uïÛæ”·£ò&¬òHò•í$°^»èè§2cºÌéêHø³Õ£ðºZ»iJ~x€#Ivz»™K=æGÏòCI~t.?z̦üêž®ÎåGù¡§+b¥ÑIFôùisWŸŠÿ>zB‹þ žèÇx¡¶}‡Ç4Ú•´1Äž`߈_᮹kÚˆÈS¿Î]‘¹–¥íïÐŽ^=ÚNÚáqÑ—S´K´ÃÜ#òÔÒUõ¯¬¡_‹(½Àk0±}¹G‡©”Òf*BQµ¯Ç‰/@òÔ—¶¬šÄ¬w$hí¹£§¢ Ðqg€ìúǵ©CÆå¹…C„g*ñg»†¸#. 9#r¬!’´;» ÈZbjéŽ)‘hf˜EÔÀÉ¢)¹#:›Š;#ÜYZº죌; F΋‚–Qì0£¸Q°Ú >BŠöÈ/v #bfá {QŽ·‹"ßý¢¬êÎ7ž}Þܶ5Â0âùûÍI™ r÷o7ðcSã€eƒENáRfÑ`˜Ï–õain8‚w§v³ÝnÚf¿¨5³ù—͇ãæø…›ïÛfÛü-cÎ:ËhÉÛÓ—ûý ¶¿Ú´þ½nç›ö|¬a¥›Y‰žZv‰zi¼à7X¼>p|³3O¯ÏíáÜ>æ^³™ëýÇöT?΃¨ü”Eù°­yúéþSZ™qªÙ}êf}ÅUÛýþÓÕþnÓ@"í„–a&K–´ÆÉË7ûíðg\·ðvÙœ¶7Jq:$ ôkv¥[¬ñ}Ó ñÛú÷ssìJŠÃðWßË-r_O`ÄÍf‡}y7œFÚíÄÇ­ ¸îiÁHÂ|p͂״ȓöƒGÌךhÖĽŽís_æÖ8=œ@¹¯÷çcŸð~Ïý¾ÖG¦!r ušç¿ßîoþÇÇ2Ì&ŸüÑœêä9j³»í¶Òt›Ÿþ²6ø¹vS)þfw ÙQBÓG/'{ãýöý±¦XžÿÓï>¢ÔÏͶÂ3µ ûùØ´’­w¿Õ‹²ÏO6åœî<„¿Hü«¹€—gg/ï^Ê— }ÿ’Ùý?0÷g€ò éåLùþ·ûgaÿ+uþ1üá;9âK€Z”§=/çÒË7æ+¯½h“H¸ýKÁßš2yþöF”4’ºåîèRôÕðWõ «üìÓÊ—C]\>Å{Àvÿ‰?0|ÂÖ÷ñƒ; 5¶y7¿8tgÃÛáSð§úž‹ŠË÷§:Z3öÿ¬Jø endstream endobj 643 0 obj << /Type /XRef /Index [0 644] /Size 644 /W [1 3 1] /Root 641 0 R /Info 642 0 R /ID [<65C000F4C2CAAC90BDC28FD738995183> <65C000F4C2CAAC90BDC28FD738995183>] /Length 1538 /Filter /FlateDecode >> stream xÚ%—KLg†çÌÿ#7T¹ßADEä" ‚" I§Ý4uÑÌÂE“6iM7MZM7&íª.LNâª]´ »ÐÄM›Æ̪mbbÛ4.Ú¤1mzùŸ—Í“ï¼ßÌü3ß9ïù¾?‚à? ‚ÒÀ‚ðóòfƒ0 äÂü{¹0ŒŽq n+œb6B ç¤M‚Shy`È b°”€] ìe T€=`/¨U ì5 ìuਠà 8ƒFÐ"p4ƒÐ Ž‚NÐÚAÖ‚Ò·´.m|å 0š }3 ,Ù @h`'Á8æÁ%p-‡4»A Ð'tƒÐ ú@?ƒ` ƒp ¼Zá 0ÆÁI ôL€I 4vXPsYßvš@è“`,€U°ÉçgA(JÔ–d+ÆZɳà_IÄZâi 5à¶Xk?. DSRfÁÚ!4ekðI„¦4^‹hGÑ”ß%°ŒÖ‰¦Ä_+hƒhªˆË€/JŽ£©TÖÀ´Q4ÕÐU°ŽFâc×5°v M)»n M ©7ÁÚ4êÔs¶\cÅݘ8ËUì!È Í QÞžyhШ{Ç[ž¶€†!—y!ÚE4œâøÍ‹ÑÑ°ã´„´C;F:MÁiKéÚ!íÁ'Ð(Öˆw…«3œG['¤oø4j-ÂŽÙ³§khW1»cöô ÞrÌî˜=½Š¶JˆÙ³§ëhøÒ1»«çÐP¢BÌî”r¤O;f÷eBê*Z&Ôå]¢‡®î‹„z!½õéñú}¹–Dk%O+3ë´ éDZx4öƒjP jÍ–¾ËY|ônÀmôöDžÎ9y ,˜zœ»xúM],ÿ] Ø‚'š`sHÊA©ß÷HÃ3Ñ8 ”² ~x[³²é€9“J žÝ×¾LØg’j ~ùMÚ>î=Îh?À~É€é•ÔZðâ]Œq’F þ|¬Ï$lI³ÿ<Ðâè] Ý¬¸B×Q÷I·Yùß UÅgQüÉè3«¾£Ù@Å&Ãfué¡aÂ~”Œ›5ý¨ë´»œ6ë¬S8 ¦Ízo*\sfC/õ]|,›=Ô%k@ý^ ^ûùªÙäÇšU‰ªi¦´ëTÉÛ2›i Ì~zOä-Í7Û˜RX8¤Ef›Zö”6œ’Õ´”˜½¢µOKù í°Õ€¤Ufo|¥Yýx#¨3»U&M]ªÉìf…jPê>­fôKSCé2ûhA!«›˜Ýݾƒ-0’/YçT„ì§ê¹ÿô¶®;ÔKNܲߟՄúÉK'ÌŒK›ç̾ìU(;_0ûú5…d&eŸNçÍŽ(ºƒSPºdöHÕ”²m§ä(ÕÉhÅìɇš¸Øv"eaÃìéÍÀ²“Ãz{O´„f?oH‹@.)ü®p'Ðb›½|!-5bŸ‰v›ý;!M¶:*rÚ7Òª{@Toa^¡4¶‰ˆ= ¢éG  p8‰hú]>j­€J¤d{î)ïë)ö|«Q§…·:4ê²ðŽkÔmá£z,|öºF½– ŸkÔg™WÕ¨ß2ïÎk4`™Ï¶ìƒ–yú…FC–íؾwÌ‚90,»¤;b x¿X[‘ö º@7Àµ1›MÌî÷ƒ SÕà7bcÌŸ†XG+¥tx¢_Å〦ëð¤ÓÒ¤eïæºþ<ø¡n±5 endstream endobj startxref 286183 %%EOF cloog-0.18.4/isl/0000755000175000017500000000000012555417256010513 500000000000000cloog-0.18.4/isl/isl_sort.c0000644000175000017500000001147212413256472012434 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.4/isl/interface/0000755000175000017500000000000012555417256012453 500000000000000cloog-0.18.4/isl/interface/isl.py.top0000644000175000017500000000115012413256472014324 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.4/isl/interface/all.h0000644000175000017500000000014012413256472013301 00000000000000#include #include #include #include cloog-0.18.4/isl/isl_config.h.in0000644000175000017500000001100412554427674013325 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 CompilerInstance::createPreprocessor takes TranslationUnitKind */ #undef CREATEPREPROCESSOR_TAKES_TUKIND /* Define if TargetInfo::CreateTargetInfo takes pointer */ #undef CREATETARGETINFO_TAKES_POINTER /* Define if TargetInfo::CreateTargetInfo takes shared_ptr */ #undef CREATETARGETINFO_TAKES_SHARED_PTR /* Define if Driver constructor takes default image name */ #undef DRIVER_CTOR_TAKES_DEFAULTIMAGENAME /* 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 /* Define if llvm/ADT/OwningPtr.h exists */ #undef HAVE_ADT_OWNINGPTR_H /* 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 `ffs', and to 0 if you don't. */ #undef HAVE_DECL_FFS /* 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 declaration of `__builtin_ffs', and to 0 if you don't. */ #undef HAVE_DECL___BUILTIN_FFS /* 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 if SourceManager has a setMainFileID method */ #undef HAVE_SETMAINFILEID /* 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 /* Define to the sub-directory in which 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 /* use gmp to implement isl_int */ #undef USE_GMP_FOR_MP /* use imath to implement isl_int */ #undef USE_IMATH_FOR_MP /* Version number of package */ #undef VERSION /* Define to getParamType for newer versions of clang */ #undef getArgType /* Define to getHostTriple for older versions of clang */ #undef getDefaultTargetTriple /* Define to getInstantiationLineNumber for older versions of clang */ #undef getExpansionLineNumber /* Define to getNumParams for newer versions of clang */ #undef getNumArgs /* Define to getResultType for older versions of clang */ #undef getReturnType #include cloog-0.18.4/isl/compile0000755000175000017500000001624512413256716012014 00000000000000#! /bin/sh # Wrapper for compilers which do not understand '-c -o'. scriptversion=2012-10-14.11; # UTC # Copyright (C) 1999-2013 Free Software Foundation, Inc. # Written by Tom Tromey . # # 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. # This file is maintained in Automake, please report # bugs to or send patches to # . nl=' ' # We need space, tab and new line, in precisely that order. Quoting is # there to prevent tools from complaining about whitespace usage. IFS=" "" $nl" file_conv= # func_file_conv build_file lazy # Convert a $build file to $host form and store it in $file # Currently only supports Windows hosts. If the determined conversion # type is listed in (the comma separated) LAZY, no conversion will # take place. func_file_conv () { file=$1 case $file in / | /[!/]*) # absolute file, and not a UNC file if test -z "$file_conv"; then # lazily determine how to convert abs files case `uname -s` in MINGW*) file_conv=mingw ;; CYGWIN*) file_conv=cygwin ;; *) file_conv=wine ;; esac fi case $file_conv/,$2, in *,$file_conv,*) ;; mingw/*) file=`cmd //C echo "$file " | sed -e 's/"\(.*\) " *$/\1/'` ;; cygwin/*) file=`cygpath -m "$file" || echo "$file"` ;; wine/*) file=`winepath -w "$file" || echo "$file"` ;; esac ;; esac } # func_cl_dashL linkdir # Make cl look for libraries in LINKDIR func_cl_dashL () { func_file_conv "$1" if test -z "$lib_path"; then lib_path=$file else lib_path="$lib_path;$file" fi linker_opts="$linker_opts -LIBPATH:$file" } # func_cl_dashl library # Do a library search-path lookup for cl func_cl_dashl () { lib=$1 found=no save_IFS=$IFS IFS=';' for dir in $lib_path $LIB do IFS=$save_IFS if $shared && test -f "$dir/$lib.dll.lib"; then found=yes lib=$dir/$lib.dll.lib break fi if test -f "$dir/$lib.lib"; then found=yes lib=$dir/$lib.lib break fi if test -f "$dir/lib$lib.a"; then found=yes lib=$dir/lib$lib.a break fi done IFS=$save_IFS if test "$found" != yes; then lib=$lib.lib fi } # func_cl_wrapper cl arg... # Adjust compile command to suit cl func_cl_wrapper () { # Assume a capable shell lib_path= shared=: linker_opts= for arg do if test -n "$eat"; then eat= else case $1 in -o) # configure might choose to run compile as 'compile cc -o foo foo.c'. eat=1 case $2 in *.o | *.[oO][bB][jJ]) func_file_conv "$2" set x "$@" -Fo"$file" shift ;; *) func_file_conv "$2" set x "$@" -Fe"$file" shift ;; esac ;; -I) eat=1 func_file_conv "$2" mingw set x "$@" -I"$file" shift ;; -I*) func_file_conv "${1#-I}" mingw set x "$@" -I"$file" shift ;; -l) eat=1 func_cl_dashl "$2" set x "$@" "$lib" shift ;; -l*) func_cl_dashl "${1#-l}" set x "$@" "$lib" shift ;; -L) eat=1 func_cl_dashL "$2" ;; -L*) func_cl_dashL "${1#-L}" ;; -static) shared=false ;; -Wl,*) arg=${1#-Wl,} save_ifs="$IFS"; IFS=',' for flag in $arg; do IFS="$save_ifs" linker_opts="$linker_opts $flag" done IFS="$save_ifs" ;; -Xlinker) eat=1 linker_opts="$linker_opts $2" ;; -*) set x "$@" "$1" shift ;; *.cc | *.CC | *.cxx | *.CXX | *.[cC]++) func_file_conv "$1" set x "$@" -Tp"$file" shift ;; *.c | *.cpp | *.CPP | *.lib | *.LIB | *.Lib | *.OBJ | *.obj | *.[oO]) func_file_conv "$1" mingw set x "$@" "$file" shift ;; *) set x "$@" "$1" shift ;; esac fi shift done if test -n "$linker_opts"; then linker_opts="-link$linker_opts" fi exec "$@" $linker_opts exit 1 } eat= case $1 in '') echo "$0: No command. Try '$0 --help' for more information." 1>&2 exit 1; ;; -h | --h*) cat <<\EOF Usage: compile [--help] [--version] PROGRAM [ARGS] Wrapper for compilers which do not understand '-c -o'. Remove '-o dest.o' from ARGS, run PROGRAM with the remaining arguments, and rename the output as expected. If you are trying to build a whole package this is not the right script to run: please start by reading the file 'INSTALL'. Report bugs to . EOF exit $? ;; -v | --v*) echo "compile $scriptversion" exit $? ;; cl | *[/\\]cl | cl.exe | *[/\\]cl.exe ) func_cl_wrapper "$@" # Doesn't return... ;; esac ofile= cfile= for arg do if test -n "$eat"; then eat= else case $1 in -o) # configure might choose to run compile as 'compile cc -o foo foo.c'. # So we strip '-o arg' only if arg is an object. eat=1 case $2 in *.o | *.obj) ofile=$2 ;; *) set x "$@" -o "$2" shift ;; esac ;; *.c) cfile=$1 set x "$@" "$1" shift ;; *) set x "$@" "$1" shift ;; esac fi shift done if test -z "$ofile" || test -z "$cfile"; then # If no '-o' option was seen then we might have been invoked from a # pattern rule where we don't need one. That is ok -- this is a # normal compilation that the losing compiler can handle. If no # '.c' file was seen then we are probably linking. That is also # ok. exec "$@" fi # Name of file we expect compiler to create. cofile=`echo "$cfile" | sed 's|^.*[\\/]||; s|^[a-zA-Z]:||; s/\.c$/.o/'` # Create the lock directory. # Note: use '[/\\:.-]' here to ensure that we don't use the same name # that we are using for the .o file. Also, base the name on the expected # object file name, since that is what matters with a parallel build. lockdir=`echo "$cofile" | sed -e 's|[/\\:.-]|_|g'`.d while true; do if mkdir "$lockdir" >/dev/null 2>&1; then break fi sleep 1 done # FIXME: race condition here if user kills between mkdir and trap. trap "rmdir '$lockdir'; exit 1" 1 2 15 # Run the compile. "$@" ret=$? if test -f "$cofile"; then test "$cofile" = "$ofile" || mv "$cofile" "$ofile" elif test -f "${cofile}bj"; then test "${cofile}bj" = "$ofile" || mv "${cofile}bj" "$ofile" fi rmdir "$lockdir" exit $ret # 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.4/isl/polytope_scan.c0000644000175000017500000000454512554427055013463 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 #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 isl_stat 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 isl_stat_ok; error: isl_vec_free(sample); return isl_stat_error; } 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.4/isl/cat.c0000644000175000017500000000324712554427055011351 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 isl_arg_choice cat_yaml_style[] = { { "block", ISL_YAML_STYLE_BLOCK }, { "flow", ISL_YAML_STYLE_FLOW }, { 0 } }; struct cat_options { struct isl_options *isl; unsigned format; unsigned yaml_style; }; 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_ARG_CHOICE(struct cat_options, yaml_style, 0, "yaml-style", \ cat_yaml_style, ISL_YAML_STYLE_BLOCK, "output YAML style") ISL_ARGS_END ISL_ARG_DEF(cat_options, struct cat_options, cat_options_args) int main(int argc, char **argv) { struct isl_ctx *ctx; 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 = isl_printer_set_yaml_style(p, options->yaml_style); 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.4/isl/isl_morph.h0000644000175000017500000000544512413271702012573 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_ctx *isl_morph_get_ctx(__isl_keep isl_morph *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_dom_space(__isl_keep isl_morph *morph); __isl_give isl_space *isl_morph_get_ran_space(__isl_keep isl_morph *morph); __isl_give isl_multi_aff *isl_morph_get_var_multi_aff( __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.4/isl/isl_stream_private.h0000644000175000017500000000320612554427055014476 00000000000000#include #include #include 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; }; struct isl_token *isl_token_new(isl_ctx *ctx, int line, int col, unsigned on_new_line); /* An input stream that may be either a file or a string. * * line and col are the line and column number of the next character (1-based). * start_line and start_col are set by isl_stream_getc to point * to the position of the returned character. * last_line is the line number of the previous token. * * yaml_state and yaml_indent keep track of the currently active YAML * elements. yaml_size is the size of these arrays, while yaml_depth * is the number of elements currently in use. * yaml_state and yaml_indent may be NULL if no YAML parsing is being * performed. * yaml_state keeps track of what is expected next at each level. * yaml_indent keeps track of the indentation at each level, with * ISL_YAML_INDENT_FLOW meaning that the element is in flow format * (such that the indentation is not relevant). */ struct isl_stream { struct isl_ctx *ctx; FILE *file; const char *str; int line; int col; int start_line; int start_col; int last_line; 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; int yaml_depth; int yaml_size; enum isl_yaml_state *yaml_state; int *yaml_indent; }; cloog-0.18.4/isl/isl_id_private.h0000644000175000017500000000150312413270107013561 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); int isl_id_cmp(__isl_keep isl_id *id1, __isl_keep isl_id *id2); extern isl_id isl_id_none; #endif cloog-0.18.4/isl/polyhedron_sample.c0000644000175000017500000000162112413270107014304 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 (isl_vec_size(sample) > 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.4/isl/isl_constraint_private.h0000644000175000017500000000140612413270107015353 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); void isl_constraint_get_coefficient(__isl_keep isl_constraint *constraint, enum isl_dim_type type, int pos, isl_int *v); __isl_give isl_constraint *isl_constraint_set_constant( __isl_take isl_constraint *constraint, isl_int v); __isl_give isl_constraint *isl_constraint_set_coefficient( __isl_take isl_constraint *constraint, enum isl_dim_type type, int pos, isl_int v); #endif cloog-0.18.4/isl/isl_coalesce.c0000644000175000017500000023763512554427055013241 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * Copyright 2010 INRIA Saclay * Copyright 2012-2013 Ecole Normale Superieure * Copyright 2014 INRIA Rocquencourt * * 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 * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt, * B.P. 105 - 78153 Le Chesnay, France */ #include "isl_map_private.h" #include #include #include "isl_tab.h" #include #include #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; if (!eq) return NULL; 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); if (!ineq) return NULL; 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; } /* Internal information associated to a basic map in a map * that is to be coalesced by isl_map_coalesce. * * "bmap" is the basic map itself (or NULL if "removed" is set) * "tab" is the corresponding tableau (or NULL if "removed" is set) * "hull_hash" identifies the affine space in which "bmap" lives. * "removed" is set if this basic map has been removed from the map * "simplify" is set if this basic map may have some unknown integer * divisions that were not present in the input basic maps. The basic * map should then be simplified such that we may be able to find * a definition among the constraints. * * "eq" and "ineq" are only set if we are currently trying to coalesce * this basic map with another basic map, in which case they represent * the position of the inequalities of this basic map with respect to * the other basic map. The number of elements in the "eq" array * is twice the number of equalities in the "bmap", corresponding * to the two inequalities that make up each equality. */ struct isl_coalesce_info { isl_basic_map *bmap; struct isl_tab *tab; uint32_t hull_hash; int removed; int simplify; int *eq; int *ineq; }; /* Compute the hash of the (apparent) affine hull of info->bmap (with * the existentially quantified variables removed) and store it * in info->hash. */ static int coalesce_info_set_hull_hash(struct isl_coalesce_info *info) { isl_basic_map *hull; unsigned n_div; hull = isl_basic_map_copy(info->bmap); hull = isl_basic_map_plain_affine_hull(hull); n_div = isl_basic_map_dim(hull, isl_dim_div); hull = isl_basic_map_drop_constraints_involving_dims(hull, isl_dim_div, 0, n_div); info->hull_hash = isl_basic_map_get_hash(hull); isl_basic_map_free(hull); return hull ? 0 : -1; } /* Free all the allocated memory in an array * of "n" isl_coalesce_info elements. */ static void clear_coalesce_info(int n, struct isl_coalesce_info *info) { int i; if (!info) return; for (i = 0; i < n; ++i) { isl_basic_map_free(info[i].bmap); isl_tab_free(info[i].tab); } free(info); } /* Drop the basic map represented by "info". * That is, clear the memory associated to the entry and * mark it as having been removed. */ static void drop(struct isl_coalesce_info *info) { info->bmap = isl_basic_map_free(info->bmap); isl_tab_free(info->tab); info->tab = NULL; info->removed = 1; } /* Exchange the information in "info1" with that in "info2". */ static void exchange(struct isl_coalesce_info *info1, struct isl_coalesce_info *info2) { struct isl_coalesce_info info; info = *info1; *info1 = *info2; *info2 = info; } /* This type represents the kind of change that has been performed * while trying to coalesce two basic maps. * * isl_change_none: nothing was changed * isl_change_drop_first: the first basic map was removed * isl_change_drop_second: the second basic map was removed * isl_change_fuse: the two basic maps were replaced by a new basic map. */ enum isl_change { isl_change_error = -1, isl_change_none = 0, isl_change_drop_first, isl_change_drop_second, isl_change_fuse, }; /* Update "change" based on an interchange of the first and the second * basic map. That is, interchange isl_change_drop_first and * isl_change_drop_second. */ static enum isl_change invert_change(enum isl_change change) { switch (change) { case isl_change_error: return isl_change_error; case isl_change_none: return isl_change_none; case isl_change_drop_first: return isl_change_drop_second; case isl_change_drop_second: return isl_change_drop_first; case isl_change_fuse: return isl_change_fuse; } return isl_change_error; } /* Add the valid constraints of the basic map represented by "info" * to "bmap". "len" is the size of the constraints. * If only one of the pair of inequalities that make up an equality * is valid, then add that inequality. */ static __isl_give isl_basic_map *add_valid_constraints( __isl_take isl_basic_map *bmap, struct isl_coalesce_info *info, unsigned len) { int k, l; if (!bmap) return NULL; for (k = 0; k < info->bmap->n_eq; ++k) { if (info->eq[2 * k] == STATUS_VALID && info->eq[2 * k + 1] == STATUS_VALID) { l = isl_basic_map_alloc_equality(bmap); if (l < 0) return isl_basic_map_free(bmap); isl_seq_cpy(bmap->eq[l], info->bmap->eq[k], len); } else if (info->eq[2 * k] == STATUS_VALID) { l = isl_basic_map_alloc_inequality(bmap); if (l < 0) return isl_basic_map_free(bmap); isl_seq_neg(bmap->ineq[l], info->bmap->eq[k], len); } else if (info->eq[2 * k + 1] == STATUS_VALID) { l = isl_basic_map_alloc_inequality(bmap); if (l < 0) return isl_basic_map_free(bmap); isl_seq_cpy(bmap->ineq[l], info->bmap->eq[k], len); } } for (k = 0; k < info->bmap->n_ineq; ++k) { if (info->ineq[k] != STATUS_VALID) continue; l = isl_basic_map_alloc_inequality(bmap); if (l < 0) return isl_basic_map_free(bmap); isl_seq_cpy(bmap->ineq[l], info->bmap->ineq[k], len); } return bmap; } /* Is "bmap" defined by a number of (non-redundant) constraints that * is greater than the number of constraints of basic maps i and j combined? * Equalities are counted as two inequalities. */ static int number_of_constraints_increases(int i, int j, struct isl_coalesce_info *info, __isl_keep isl_basic_map *bmap, struct isl_tab *tab) { int k, n_old, n_new; n_old = 2 * info[i].bmap->n_eq + info[i].bmap->n_ineq; n_old += 2 * info[j].bmap->n_eq + info[j].bmap->n_ineq; n_new = 2 * bmap->n_eq; for (k = 0; k < bmap->n_ineq; ++k) if (!isl_tab_is_redundant(tab, bmap->n_eq + k)) ++n_new; return n_new > n_old; } /* Replace the pair of basic maps i and j by the basic map bounded * by the valid constraints in both basic maps and the constraints * in extra (if not NULL). * Place the fused basic map in the position that is the smallest of i and j. * * If "detect_equalities" is set, then look for equalities encoded * as pairs of inequalities. * If "check_number" is set, then the original basic maps are only * replaced if the total number of constraints does not increase. * While the number of integer divisions in the two basic maps * is assumed to be the same, the actual definitions may be different. * We only copy the definition from one of the basic map if it is * the same as that of the other basic map. Otherwise, we mark * the integer division as unknown and schedule for the basic map * to be simplified in an attempt to recover the integer division definition. */ static enum isl_change fuse(int i, int j, struct isl_coalesce_info *info, __isl_keep isl_mat *extra, int detect_equalities, int check_number) { int k, l; struct isl_basic_map *fused = NULL; struct isl_tab *fused_tab = NULL; unsigned total = isl_basic_map_total_dim(info[i].bmap); unsigned extra_rows = extra ? extra->n_row : 0; unsigned n_eq, n_ineq; if (j < i) return fuse(j, i, info, extra, detect_equalities, check_number); n_eq = info[i].bmap->n_eq + info[j].bmap->n_eq; n_ineq = info[i].bmap->n_ineq + info[j].bmap->n_ineq; fused = isl_basic_map_alloc_space(isl_space_copy(info[i].bmap->dim), info[i].bmap->n_div, n_eq, n_eq + n_ineq + extra_rows); fused = add_valid_constraints(fused, &info[i], 1 + total); fused = add_valid_constraints(fused, &info[j], 1 + total); if (!fused) goto error; for (k = 0; k < info[i].bmap->n_div; ++k) { int l = isl_basic_map_alloc_div(fused); if (l < 0) goto error; if (isl_seq_eq(info[i].bmap->div[k], info[j].bmap->div[k], 1 + 1 + total)) { isl_seq_cpy(fused->div[l], info[i].bmap->div[k], 1 + 1 + total); } else { isl_int_set_si(fused->div[l][0], 0); info[i].simplify = 1; } } 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); } if (detect_equalities) fused = isl_basic_map_detect_inequality_pairs(fused, NULL); fused = isl_basic_map_gauss(fused, NULL); ISL_F_SET(fused, ISL_BASIC_MAP_FINAL); if (ISL_F_ISSET(info[i].bmap, ISL_BASIC_MAP_RATIONAL) && ISL_F_ISSET(info[j].bmap, 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; if (check_number && number_of_constraints_increases(i, j, info, fused, fused_tab)) { isl_tab_free(fused_tab); isl_basic_map_free(fused); return isl_change_none; } info[i].simplify |= info[j].simplify; isl_basic_map_free(info[i].bmap); info[i].bmap = fused; isl_tab_free(info[i].tab); info[i].tab = fused_tab; drop(&info[j]); return isl_change_fuse; error: isl_tab_free(fused_tab); isl_basic_map_free(fused); return isl_change_error; } /* 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. * Checking whether the facet lies entirely within basic map j * is performed by checking whether the constraints of basic map j * are valid for the facet. These tests are performed on a rational * tableau to avoid the theoretical possibility that a constraint * that was considered to be a cut constraint for the entire basic map i * happens to be considered to be a valid constraint for the facet, * even though it cuts off the same rational points. * * 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 ). * A line connecting x with an element of A \cup B meets a facet F * of either A or B. Assume it is a facet of B and let c_1 be * the corresponding facet constraint. We have c_1(x) < 0 and * so c_1 is a cut constraint. This implies that there is some * (possibly rational) point x' satisfying the constraints of A * and the opposite of c_1 as otherwise c_1 would have been marked * valid for A. The line connecting x and x' meets a facet of A * in a (possibly rational) point that also violates c_1, but this * is impossible since all cut constraints of B are valid for all * cut facets of A. * In case F is a facet of A rather than B, then we can apply the * above reasoning to find a facet of B separating x from A \cup B first. */ static enum isl_change check_facets(int i, int j, struct isl_coalesce_info *info) { int k, l; struct isl_tab_undo *snap, *snap2; unsigned n_eq = info[i].bmap->n_eq; snap = isl_tab_snap(info[i].tab); if (isl_tab_mark_rational(info[i].tab) < 0) return isl_change_error; snap2 = isl_tab_snap(info[i].tab); for (k = 0; k < info[i].bmap->n_ineq; ++k) { if (info[i].ineq[k] != STATUS_CUT) continue; if (isl_tab_select_facet(info[i].tab, n_eq + k) < 0) return isl_change_error; for (l = 0; l < info[j].bmap->n_ineq; ++l) { int stat; if (info[j].ineq[l] != STATUS_CUT) continue; stat = status_in(info[j].bmap->ineq[l], info[i].tab); if (stat < 0) return isl_change_error; if (stat != STATUS_VALID) break; } if (isl_tab_rollback(info[i].tab, snap2) < 0) return isl_change_error; if (l < info[j].bmap->n_ineq) break; } if (k < info[i].bmap->n_ineq) { if (isl_tab_rollback(info[i].tab, snap) < 0) return isl_change_error; return isl_change_none; } return fuse(i, j, info, NULL, 0, 0); } /* Check if info->bmap contains the basic map represented * by the tableau "tab". * For each equality, we check both the constraint itself * (as an inequality) and its negation. Make sure the * equality is returned to its original state before returning. */ static int contains(struct isl_coalesce_info *info, struct isl_tab *tab) { int k; unsigned dim; isl_basic_map *bmap = info->bmap; dim = isl_basic_map_total_dim(bmap); for (k = 0; k < bmap->n_eq; ++k) { int stat; isl_seq_neg(bmap->eq[k], bmap->eq[k], 1 + dim); stat = status_in(bmap->eq[k], tab); isl_seq_neg(bmap->eq[k], bmap->eq[k], 1 + dim); if (stat < 0) return -1; if (stat != STATUS_VALID) return 0; stat = status_in(bmap->eq[k], tab); if (stat < 0) return -1; if (stat != STATUS_VALID) return 0; } for (k = 0; k < bmap->n_ineq; ++k) { int stat; if (info->ineq[k] == STATUS_REDUNDANT) continue; stat = status_in(bmap->ineq[k], tab); if (stat < 0) return -1; 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 enum isl_change is_adj_ineq_extension(int i, int j, struct isl_coalesce_info *info) { int k; struct isl_tab_undo *snap; unsigned n_eq = info[i].bmap->n_eq; unsigned total = isl_basic_map_total_dim(info[i].bmap); int r; int super; if (isl_tab_extend_cons(info[i].tab, 1 + info[j].bmap->n_ineq) < 0) return isl_change_error; for (k = 0; k < info[i].bmap->n_ineq; ++k) if (info[i].ineq[k] == STATUS_ADJ_INEQ) break; if (k >= info[i].bmap->n_ineq) isl_die(isl_basic_map_get_ctx(info[i].bmap), isl_error_internal, "info[i].ineq should have exactly one STATUS_ADJ_INEQ", return isl_change_error); snap = isl_tab_snap(info[i].tab); if (isl_tab_unrestrict(info[i].tab, n_eq + k) < 0) return isl_change_error; isl_seq_neg(info[i].bmap->ineq[k], info[i].bmap->ineq[k], 1 + total); isl_int_sub_ui(info[i].bmap->ineq[k][0], info[i].bmap->ineq[k][0], 1); r = isl_tab_add_ineq(info[i].tab, info[i].bmap->ineq[k]); isl_seq_neg(info[i].bmap->ineq[k], info[i].bmap->ineq[k], 1 + total); isl_int_sub_ui(info[i].bmap->ineq[k][0], info[i].bmap->ineq[k][0], 1); if (r < 0) return isl_change_error; for (k = 0; k < info[j].bmap->n_ineq; ++k) { if (info[j].ineq[k] != STATUS_VALID) continue; if (isl_tab_add_ineq(info[i].tab, info[j].bmap->ineq[k]) < 0) return isl_change_error; } super = contains(&info[j], info[i].tab); if (super < 0) return isl_change_error; if (super) return fuse(i, j, info, NULL, 0, 0); if (isl_tab_rollback(info[i].tab, snap) < 0) return isl_change_error; return isl_change_none; } /* 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 enum isl_change check_adj_ineq(int i, int j, struct isl_coalesce_info *info) { int count_i, count_j; int cut_i, cut_j; count_i = count(info[i].ineq, info[i].bmap->n_ineq, STATUS_ADJ_INEQ); count_j = count(info[j].ineq, info[j].bmap->n_ineq, STATUS_ADJ_INEQ); if (count_i != 1 && count_j != 1) return isl_change_none; cut_i = any(info[i].eq, 2 * info[i].bmap->n_eq, STATUS_CUT) || any(info[i].ineq, info[i].bmap->n_ineq, STATUS_CUT); cut_j = any(info[j].eq, 2 * info[j].bmap->n_eq, STATUS_CUT) || any(info[j].ineq, info[j].bmap->n_ineq, STATUS_CUT); if (!cut_i && !cut_j && count_i == 1 && count_j == 1) return fuse(i, j, info, NULL, 0, 0); if (count_i == 1 && !cut_i) return is_adj_ineq_extension(i, j, info); if (count_j == 1 && !cut_j) return is_adj_ineq_extension(j, i, info); return isl_change_none; } /* 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. * Each integer division that does not have exactly the same * definition in "i" and "j" is marked unknown and the basic map * is scheduled to be simplified in an attempt to recover * the integer division definition. * Place this extension in the position that is the smallest of i and j. * ____ _____ * / || / | * / || / | * \ || => \ | * \ || \ | * \___|| \____| */ static enum isl_change is_adj_eq_extension(int i, int j, int k, struct isl_coalesce_info *info) { int change = isl_change_none; int super; struct isl_tab_undo *snap, *snap2; unsigned n_eq = info[i].bmap->n_eq; if (isl_tab_is_equality(info[i].tab, n_eq + k)) return isl_change_none; snap = isl_tab_snap(info[i].tab); if (isl_tab_relax(info[i].tab, n_eq + k) < 0) return isl_change_error; snap2 = isl_tab_snap(info[i].tab); if (isl_tab_select_facet(info[i].tab, n_eq + k) < 0) return isl_change_error; super = contains(&info[j], info[i].tab); if (super < 0) return isl_change_error; if (super) { int l; unsigned total; if (isl_tab_rollback(info[i].tab, snap2) < 0) return isl_change_error; info[i].bmap = isl_basic_map_cow(info[i].bmap); if (!info[i].bmap) return isl_change_error; total = isl_basic_map_total_dim(info[i].bmap); for (l = 0; l < info[i].bmap->n_div; ++l) if (!isl_seq_eq(info[i].bmap->div[l], info[j].bmap->div[l], 1 + 1 + total)) { isl_int_set_si(info[i].bmap->div[l][0], 0); info[i].simplify = 1; } isl_int_add_ui(info[i].bmap->ineq[k][0], info[i].bmap->ineq[k][0], 1); ISL_F_SET(info[i].bmap, ISL_BASIC_MAP_FINAL); drop(&info[j]); if (j < i) exchange(&info[i], &info[j]); change = isl_change_fuse; } else if (isl_tab_rollback(info[i].tab, snap) < 0) return isl_change_error; return change; } /* 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 info->bmap that can be removed * if we end up applying wrapping. */ static void wraps_update_max(struct isl_wraps *wraps, struct isl_coalesce_info *info) { int k; isl_int max_k; unsigned total = isl_basic_map_total_dim(info->bmap); isl_int_init(max_k); for (k = 0; k < info->bmap->n_eq; ++k) { if (info->eq[2 * k] == STATUS_VALID && info->eq[2 * k + 1] == STATUS_VALID) continue; isl_seq_abs_max(info->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 < info->bmap->n_ineq; ++k) { if (info->ineq[k] == STATUS_VALID || info->ineq[k] == STATUS_REDUNDANT) continue; isl_seq_abs_max(info->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, struct isl_coalesce_info *info, int i, int 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, &info[i]); wraps_update_max(wraps, &info[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; } /* Wrap "ineq" (or its opposite if "negate" is set) around "bound" * to include "set" and add the result in position "w" of "wraps". * "len" is the total number of coefficients in "bound" and "ineq". * Return 1 on success, 0 on failure and -1 on error. * Wrapping can fail if the result of wrapping is equal to "bound" * or if we want to bound the sizes of the coefficients and * the wrapped constraint does not satisfy this bound. */ static int add_wrap(struct isl_wraps *wraps, int w, isl_int *bound, isl_int *ineq, unsigned len, __isl_keep isl_set *set, int negate) { isl_seq_cpy(wraps->mat->row[w], bound, len); if (negate) { isl_seq_neg(wraps->mat->row[w + 1], ineq, len); ineq = wraps->mat->row[w + 1]; } if (!isl_set_wrap_facet(set, wraps->mat->row[w], ineq)) return -1; if (isl_seq_eq(wraps->mat->row[w], bound, len)) return 0; if (!allow_wrap(wraps, w)) return 0; return 1; } /* For each constraint in info->bmap that is not redundant (as determined * by info->tab) and that is not a valid constraint for the other basic map, * wrap the constraint around "bound" such that it includes the whole * set "set" and append the resulting constraint to "wraps". * Note that the constraints that are valid for the other basic map * will be added to the combined basic map by default, so there is * no need to wrap them. * The caller wrap_in_facets even relies on this function not wrapping * any constraints that are already valid. * "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, struct isl_coalesce_info *info, isl_int *bound, __isl_keep isl_set *set) { int l, m; int w; int added; isl_basic_map *bmap = info->bmap; unsigned len = 1 + isl_basic_map_total_dim(bmap); w = wraps->mat->n_row; for (l = 0; l < bmap->n_ineq; ++l) { if (info->ineq[l] == STATUS_VALID || info->ineq[l] == STATUS_REDUNDANT) continue; if (isl_seq_is_neg(bound, bmap->ineq[l], len)) continue; if (isl_seq_eq(bound, bmap->ineq[l], len)) continue; if (isl_tab_is_redundant(info->tab, bmap->n_eq + l)) continue; added = add_wrap(wraps, w, bound, bmap->ineq[l], len, set, 0); if (added < 0) return -1; if (!added) goto unbounded; ++w; } for (l = 0; l < bmap->n_eq; ++l) { if (isl_seq_is_neg(bound, bmap->eq[l], len)) continue; if (isl_seq_eq(bound, bmap->eq[l], len)) continue; for (m = 0; m < 2; ++m) { if (info->eq[2 * l + m] == STATUS_VALID) continue; added = add_wrap(wraps, w, bound, bmap->eq[l], len, set, !m); if (added < 0) return -1; if (!added) 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-redundant 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. * * Update the underlying set to ensure that the dimension doesn't change. * Otherwise the integer divisions could get dropped if the tab * turns out to be empty. */ static __isl_give isl_set *set_from_updated_bmap(__isl_keep isl_basic_map *bmap, struct isl_tab *tab) { isl_basic_set *bset; bmap = isl_basic_map_copy(bmap); bset = isl_basic_map_underlying_set(bmap); bset = isl_basic_set_cow(bset); bset = isl_basic_set_update_from_tab(bset, tab); return isl_set_from_basic_set(bset); } /* Wrap the constraints of info->bmap that bound the facet defined * by inequality "k" around (the opposite of) this inequality to * include "set". "bound" may be used to store the negated inequality. * Since the wrapped constraints are not guaranteed to contain the whole * of info->bmap, we check them in check_wraps. * If any of the wrapped constraints turn out to be invalid, then * check_wraps will reset wrap->n_row to zero. */ static int add_wraps_around_facet(struct isl_wraps *wraps, struct isl_coalesce_info *info, int k, isl_int *bound, __isl_keep isl_set *set) { struct isl_tab_undo *snap; int n; unsigned total = isl_basic_map_total_dim(info->bmap); snap = isl_tab_snap(info->tab); if (isl_tab_select_facet(info->tab, info->bmap->n_eq + k) < 0) return -1; if (isl_tab_detect_redundant(info->tab) < 0) return -1; isl_seq_neg(bound, info->bmap->ineq[k], 1 + total); n = wraps->mat->n_row; if (add_wraps(wraps, info, bound, set) < 0) return -1; if (isl_tab_rollback(info->tab, snap) < 0) return -1; if (check_wraps(wraps->mat, n, info->tab) < 0) return -1; return 0; } /* Given a basic set i with a constraint k that is adjacent to * basic set j, check if we can wrap * both the facet corresponding to k (if "wrap_facet" is set) and basic map j * (always) 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 or * cut constraints for j. * Wrapping the cut constraints to include basic map j may result * in constraints that are no longer valid of basic map i * we have to check that the resulting wrapping constraints are valid for i. * If "wrap_facet" is not set, then all constraints of i (except k) * are assumed to be valid for j. * ____ _____ * / | / \ * / || / | * \ || => \ | * \ || \ | * \___|| \____| * */ static enum isl_change can_wrap_in_facet(int i, int j, int k, struct isl_coalesce_info *info, int wrap_facet) { enum isl_change change = isl_change_none; struct isl_wraps wraps; isl_ctx *ctx; 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(info[i].bmap); set_i = set_from_updated_bmap(info[i].bmap, info[i].tab); set_j = set_from_updated_bmap(info[j].bmap, info[j].tab); ctx = isl_basic_map_get_ctx(info[i].bmap); mat = isl_mat_alloc(ctx, 2 * (info[i].bmap->n_eq + info[j].bmap->n_eq) + info[i].bmap->n_ineq + info[j].bmap->n_ineq, 1 + total); wraps_init(&wraps, mat, info, i, j); bound = isl_vec_alloc(ctx, 1 + total); if (!set_i || !set_j || !wraps.mat || !bound) goto error; isl_seq_cpy(bound->el, info[i].bmap->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, &info[j], bound->el, set_i) < 0) goto error; if (!wraps.mat->n_row) goto unbounded; if (wrap_facet) { if (add_wraps_around_facet(&wraps, &info[i], k, bound->el, set_j) < 0) goto error; if (!wraps.mat->n_row) goto unbounded; } change = fuse(i, j, info, wraps.mat, 0, 0); unbounded: wraps_free(&wraps); isl_set_free(set_i); isl_set_free(set_j); isl_vec_free(bound); return change; error: wraps_free(&wraps); isl_vec_free(bound); isl_set_free(set_i); isl_set_free(set_j); return isl_change_error; } /* 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. * * For each cut constraint t(x) >= 0 of i, we add the relaxed version * t(x) + 1 >= 0, along with wrapping constraints for all constraints * of basic map j that bound the part of basic map j that sticks out * of the cut constraint. * In particular, we first intersect basic map j with t(x) + 1 = 0. * If the result is empty, then t(x) >= 0 was actually a valid constraint * (with respect to the integer points), so we add t(x) >= 0 instead. * Otherwise, we wrap the constraints of basic map j that are not * redundant in this intersection and that are not already valid * for basic map i over basic map i. * Note that it is sufficient to wrap the constraints to include * basic map i, because we will only wrap the constraints that do * not include basic map i already. The wrapped constraint will * therefore be more relaxed compared to the original constraint. * Since the original constraint is valid for basic map j, so is * the wrapped constraint. * * 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 enum isl_change wrap_in_facets(int i, int j, int *cuts, int n, struct isl_coalesce_info *info) { enum isl_change change = isl_change_none; struct isl_wraps wraps; isl_ctx *ctx; isl_mat *mat; isl_set *set_i = NULL; unsigned total = isl_basic_map_total_dim(info[i].bmap); int max_wrap; int k, w; struct isl_tab_undo *snap; if (isl_tab_extend_cons(info[j].tab, 1) < 0) goto error; max_wrap = 1 + 2 * info[j].bmap->n_eq + info[j].bmap->n_ineq; max_wrap *= n; set_i = set_from_updated_bmap(info[i].bmap, info[i].tab); ctx = isl_basic_map_get_ctx(info[i].bmap); mat = isl_mat_alloc(ctx, max_wrap, 1 + total); wraps_init(&wraps, mat, info, i, j); if (!set_i || !wraps.mat) goto error; snap = isl_tab_snap(info[j].tab); wraps.mat->n_row = 0; for (k = 0; k < n; ++k) { w = wraps.mat->n_row++; isl_seq_cpy(wraps.mat->row[w], info[i].bmap->ineq[cuts[k]], 1 + total); isl_int_add_ui(wraps.mat->row[w][0], wraps.mat->row[w][0], 1); if (isl_tab_add_eq(info[j].tab, wraps.mat->row[w]) < 0) goto error; if (isl_tab_detect_redundant(info[j].tab) < 0) goto error; if (info[j].tab->empty) isl_int_sub_ui(wraps.mat->row[w][0], wraps.mat->row[w][0], 1); else if (add_wraps(&wraps, &info[j], wraps.mat->row[w], set_i) < 0) goto error; if (isl_tab_rollback(info[j].tab, snap) < 0) goto error; if (!wraps.mat->n_row) break; } if (k == n) change = fuse(i, j, info, wraps.mat, 0, 1); wraps_free(&wraps); isl_set_free(set_i); return change; error: wraps_free(&wraps); isl_set_free(set_i); return isl_change_error; } /* 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 enum isl_change can_wrap_in_set(int i, int j, struct isl_coalesce_info *info) { enum isl_change change = isl_change_none; int k, m; int n; int *cuts = NULL; isl_ctx *ctx; if (ISL_F_ISSET(info[i].bmap, ISL_BASIC_MAP_RATIONAL) || ISL_F_ISSET(info[j].bmap, ISL_BASIC_MAP_RATIONAL)) return isl_change_none; n = count(info[i].ineq, info[i].bmap->n_ineq, STATUS_CUT); if (n == 0) return isl_change_none; ctx = isl_basic_map_get_ctx(info[i].bmap); cuts = isl_alloc_array(ctx, int, n); if (!cuts) return isl_change_error; for (k = 0, m = 0; m < n; ++k) { enum isl_ineq_type type; if (info[i].ineq[k] != STATUS_CUT) continue; isl_int_add_ui(info[i].bmap->ineq[k][0], info[i].bmap->ineq[k][0], 1); type = isl_tab_ineq_type(info[j].tab, info[i].bmap->ineq[k]); isl_int_sub_ui(info[i].bmap->ineq[k][0], info[i].bmap->ineq[k][0], 1); if (type == isl_ineq_error) goto error; if (type != isl_ineq_redundant) break; cuts[m] = k; ++m; } if (m == n) change = wrap_in_facets(i, j, cuts, n, info); free(cuts); return change; error: free(cuts); return isl_change_error; } /* Check if either i or j has only cut inequalities that can * be used to wrap in (a facet of) the other basic set. * if so, replace the pair by their union. */ static enum isl_change check_wrap(int i, int j, struct isl_coalesce_info *info) { enum isl_change change = isl_change_none; if (!any(info[i].eq, 2 * info[i].bmap->n_eq, STATUS_CUT)) change = can_wrap_in_set(i, j, info); if (change != isl_change_none) return change; if (!any(info[j].eq, 2 * info[j].bmap->n_eq, STATUS_CUT)) change = can_wrap_in_set(j, i, info); return change; } /* 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. However, it may still be possible to wrap in the other * basic map. */ static enum isl_change check_adj_eq(int i, int j, struct isl_coalesce_info *info) { enum isl_change change = isl_change_none; int k; int any_cut; if (any(info[i].eq, 2 * info[i].bmap->n_eq, STATUS_ADJ_INEQ) && any(info[j].eq, 2 * info[j].bmap->n_eq, STATUS_ADJ_INEQ)) /* ADJ EQ TOO MANY */ return isl_change_none; if (any(info[i].eq, 2 * info[i].bmap->n_eq, STATUS_ADJ_INEQ)) return check_adj_eq(j, i, info); /* j has an equality adjacent to an inequality in i */ if (any(info[i].eq, 2 * info[i].bmap->n_eq, STATUS_CUT)) return isl_change_none; any_cut = any(info[i].ineq, info[i].bmap->n_ineq, STATUS_CUT); if (count(info[i].ineq, info[i].bmap->n_ineq, STATUS_ADJ_EQ) != 1 || any(info[j].ineq, info[j].bmap->n_ineq, STATUS_ADJ_EQ) || any(info[i].ineq, info[i].bmap->n_ineq, STATUS_ADJ_INEQ) || any(info[j].ineq, info[j].bmap->n_ineq, STATUS_ADJ_INEQ)) /* ADJ EQ TOO MANY */ return isl_change_none; for (k = 0; k < info[i].bmap->n_ineq; ++k) if (info[i].ineq[k] == STATUS_ADJ_EQ) break; if (!any_cut) { change = is_adj_eq_extension(i, j, k, info); if (change != isl_change_none) return change; } change = can_wrap_in_facet(i, j, k, info, any_cut); return change; } /* 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. * _ * \\ \\ * \\ => \\ * \ \| * * If there is more than one equality of "i" adjacent to an equality of "j", * then the result will satisfy one or more equalities that are a linear * combination of these equalities. These will be encoded as pairs * of inequalities in the wrapping constraints and need to be made * explicit. */ static enum isl_change check_eq_adj_eq(int i, int j, struct isl_coalesce_info *info) { int k; enum isl_change change = isl_change_none; int detect_equalities = 0; struct isl_wraps wraps; isl_ctx *ctx; 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(info[i].bmap); if (count(info[i].eq, 2 * info[i].bmap->n_eq, STATUS_ADJ_EQ) != 1) detect_equalities = 1; for (k = 0; k < 2 * info[i].bmap->n_eq ; ++k) if (info[i].eq[k] == STATUS_ADJ_EQ) break; set_i = set_from_updated_bmap(info[i].bmap, info[i].tab); set_j = set_from_updated_bmap(info[j].bmap, info[j].tab); ctx = isl_basic_map_get_ctx(info[i].bmap); mat = isl_mat_alloc(ctx, 2 * (info[i].bmap->n_eq + info[j].bmap->n_eq) + info[i].bmap->n_ineq + info[j].bmap->n_ineq, 1 + total); wraps_init(&wraps, mat, info, i, j); bound = isl_vec_alloc(ctx, 1 + total); if (!set_i || !set_j || !wraps.mat || !bound) goto error; if (k % 2 == 0) isl_seq_neg(bound->el, info[i].bmap->eq[k / 2], 1 + total); else isl_seq_cpy(bound->el, info[i].bmap->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, &info[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, &info[i], bound->el, set_j) < 0) goto error; if (!wraps.mat->n_row) goto unbounded; change = fuse(i, j, info, wraps.mat, detect_equalities, 0); if (0) { error: change = isl_change_error; } unbounded: wraps_free(&wraps); isl_set_free(set_i); isl_set_free(set_j); isl_vec_free(bound); return change; } /* 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 * isl_change_drop_first, isl_change_drop_second or isl_change_fuse. * Otherwise, return isl_change_none. * 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 enum isl_change coalesce_local_pair(int i, int j, struct isl_coalesce_info *info) { enum isl_change change = isl_change_none; info[i].eq = info[i].ineq = NULL; info[j].eq = info[j].ineq = NULL; info[i].eq = eq_status_in(info[i].bmap, info[j].tab); if (info[i].bmap->n_eq && !info[i].eq) goto error; if (any(info[i].eq, 2 * info[i].bmap->n_eq, STATUS_ERROR)) goto error; if (any(info[i].eq, 2 * info[i].bmap->n_eq, STATUS_SEPARATE)) goto done; info[j].eq = eq_status_in(info[j].bmap, info[i].tab); if (info[j].bmap->n_eq && !info[j].eq) goto error; if (any(info[j].eq, 2 * info[j].bmap->n_eq, STATUS_ERROR)) goto error; if (any(info[j].eq, 2 * info[j].bmap->n_eq, STATUS_SEPARATE)) goto done; info[i].ineq = ineq_status_in(info[i].bmap, info[i].tab, info[j].tab); if (info[i].bmap->n_ineq && !info[i].ineq) goto error; if (any(info[i].ineq, info[i].bmap->n_ineq, STATUS_ERROR)) goto error; if (any(info[i].ineq, info[i].bmap->n_ineq, STATUS_SEPARATE)) goto done; info[j].ineq = ineq_status_in(info[j].bmap, info[j].tab, info[i].tab); if (info[j].bmap->n_ineq && !info[j].ineq) goto error; if (any(info[j].ineq, info[j].bmap->n_ineq, STATUS_ERROR)) goto error; if (any(info[j].ineq, info[j].bmap->n_ineq, STATUS_SEPARATE)) goto done; if (all(info[i].eq, 2 * info[i].bmap->n_eq, STATUS_VALID) && all(info[i].ineq, info[i].bmap->n_ineq, STATUS_VALID)) { drop(&info[j]); change = isl_change_drop_second; } else if (all(info[j].eq, 2 * info[j].bmap->n_eq, STATUS_VALID) && all(info[j].ineq, info[j].bmap->n_ineq, STATUS_VALID)) { drop(&info[i]); change = isl_change_drop_first; } else if (any(info[i].eq, 2 * info[i].bmap->n_eq, STATUS_ADJ_EQ)) { change = check_eq_adj_eq(i, j, info); } else if (any(info[j].eq, 2 * info[j].bmap->n_eq, STATUS_ADJ_EQ)) { change = check_eq_adj_eq(j, i, info); } else if (any(info[i].eq, 2 * info[i].bmap->n_eq, STATUS_ADJ_INEQ) || any(info[j].eq, 2 * info[j].bmap->n_eq, STATUS_ADJ_INEQ)) { change = check_adj_eq(i, j, info); } else if (any(info[i].ineq, info[i].bmap->n_ineq, STATUS_ADJ_EQ) || any(info[j].ineq, info[j].bmap->n_ineq, STATUS_ADJ_EQ)) { /* Can't happen */ /* BAD ADJ INEQ */ } else if (any(info[i].ineq, info[i].bmap->n_ineq, STATUS_ADJ_INEQ) || any(info[j].ineq, info[j].bmap->n_ineq, STATUS_ADJ_INEQ)) { change = check_adj_ineq(i, j, info); } else { if (!any(info[i].eq, 2 * info[i].bmap->n_eq, STATUS_CUT) && !any(info[j].eq, 2 * info[j].bmap->n_eq, STATUS_CUT)) change = check_facets(i, j, info); if (change == isl_change_none) change = check_wrap(i, j, info); } done: free(info[i].eq); free(info[j].eq); free(info[i].ineq); free(info[j].ineq); return change; error: free(info[i].eq); free(info[j].eq); free(info[i].ineq); free(info[j].ineq); return isl_change_error; } /* Shift the integer division at position "div" of the basic map * represented by "info" by "shift". * * That is, if the integer division has the form * * floor(f(x)/d) * * then replace it by * * floor((f(x) + shift * d)/d) - shift */ static int shift_div(struct isl_coalesce_info *info, int div, isl_int shift) { unsigned total; info->bmap = isl_basic_map_shift_div(info->bmap, div, shift); if (!info->bmap) return -1; total = isl_basic_map_dim(info->bmap, isl_dim_all); total -= isl_basic_map_dim(info->bmap, isl_dim_div); if (isl_tab_shift_var(info->tab, total + div, shift) < 0) return -1; return 0; } /* Check if some of the divs in the basic map represented by "info1" * are shifts of the corresponding divs in the basic map represented * by "info2". If so, align them with those of "info2". * Only do this if "info1" and "info2" have the same number * of integer divisions. * * An integer division is considered to be a shift of another integer * division if one is equal to the other plus a constant. * * In particular, for each pair of integer divisions, if both are known, * have identical coefficients (apart from the constant term) and * if the difference between the constant terms (taking into account * the denominator) is an integer, then move the difference outside. * That is, if one integer division is of the form * * floor((f(x) + c_1)/d) * * while the other is of the form * * floor((f(x) + c_2)/d) * * and n = (c_2 - c_1)/d is an integer, then replace the first * integer division by * * floor((f(x) + c_1 + n * d)/d) - n = floor((f(x) + c_2)/d) - n */ static int harmonize_divs(struct isl_coalesce_info *info1, struct isl_coalesce_info *info2) { int i; int total; if (!info1->bmap || !info2->bmap) return -1; if (info1->bmap->n_div != info2->bmap->n_div) return 0; if (info1->bmap->n_div == 0) return 0; total = isl_basic_map_total_dim(info1->bmap); for (i = 0; i < info1->bmap->n_div; ++i) { isl_int d; int r = 0; if (isl_int_is_zero(info1->bmap->div[i][0]) || isl_int_is_zero(info2->bmap->div[i][0])) continue; if (isl_int_ne(info1->bmap->div[i][0], info2->bmap->div[i][0])) continue; if (isl_int_eq(info1->bmap->div[i][1], info2->bmap->div[i][1])) continue; if (!isl_seq_eq(info1->bmap->div[i] + 2, info2->bmap->div[i] + 2, total)) continue; isl_int_init(d); isl_int_sub(d, info2->bmap->div[i][1], info1->bmap->div[i][1]); if (isl_int_is_divisible_by(d, info1->bmap->div[i][0])) { isl_int_divexact(d, d, info1->bmap->div[i][0]); r = shift_div(info1, i, d); } isl_int_clear(d); if (r < 0) return -1; } return 0; } /* 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; } /* Does "bmap" contain the basic map represented by the tableau "tab" * after expanding the divs of "bmap" to match those of "tab"? * The expansion is performed using the divs "div" and expansion "exp" * computed by the caller. * Then we check if all constraints of the expanded "bmap" are valid for "tab". */ static int contains_with_expanded_divs(__isl_keep isl_basic_map *bmap, struct isl_tab *tab, __isl_keep isl_mat *div, int *exp) { int superset = 0; int *eq_i = NULL; int *ineq_i = NULL; bmap = isl_basic_map_copy(bmap); bmap = isl_basic_set_expand_divs(bmap, isl_mat_copy(div), exp); if (!bmap) goto error; eq_i = eq_status_in(bmap, tab); 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, tab); 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 * bmap->n_eq, STATUS_VALID) && all(ineq_i, bmap->n_ineq, STATUS_VALID)) superset = 1; done: isl_basic_map_free(bmap); free(eq_i); free(ineq_i); return superset; error: isl_basic_map_free(bmap); free(eq_i); free(ineq_i); return -1; } /* Does "bmap_i" contain the basic map represented by "info_j" * after aligning the divs of "bmap_i" to those of "info_j". * Note that this can only succeed if the number of divs of "bmap_i" * is smaller than (or equal to) the number of divs of "info_j". * * We first check if the divs of "bmap_i" are all known and form a subset * of those of "bmap_j". If so, we pass control over to * contains_with_expanded_divs. */ static int contains_after_aligning_divs(__isl_keep isl_basic_map *bmap_i, struct isl_coalesce_info *info_j) { int known; isl_mat *div_i, *div_j, *div; int *exp1 = NULL; int *exp2 = NULL; isl_ctx *ctx; int subset; known = isl_basic_map_divs_known(bmap_i); if (known < 0 || !known) return known; ctx = isl_basic_map_get_ctx(bmap_i); div_i = isl_basic_map_get_divs(bmap_i); div_j = isl_basic_map_get_divs(info_j->bmap); 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 = contains_with_expanded_divs(bmap_i, info_j->tab, 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 basic map "j" is a subset of basic map "i", * if "i" has fewer divs that "j". * If so, remove basic map "j". * * 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. */ static int coalesced_subset(int i, int j, struct isl_coalesce_info *info) { int superset; if (info[i].bmap->n_div >= info[j].bmap->n_div) return 0; superset = contains_after_aligning_divs(info[i].bmap, &info[j]); if (superset < 0) return -1; if (superset) drop(&info[j]); return superset; } /* Check if basic map "j" is a subset of basic map "i" after * exploiting the extra equalities of "j" to simplify the divs of "i". * If so, remove basic map "j". * * If "j" does not have any equalities or if they are the same * as those of "i", then we cannot exploit them to simplify the divs. * Similarly, if there are no divs in "i", then they cannot be simplified. * If, on the other hand, the affine hulls of "i" and "j" do not intersect, * then "j" cannot be a subset of "i". * * Otherwise, we intersect "i" with the affine hull of "j" and then * check if "j" is a subset of the result after aligning the divs. * If so, then "j" is definitely a subset of "i" and can be removed. * Note that if after intersection with the affine hull of "j". * "i" still has more divs than "j", then there is no way we can * align the divs of "i" to those of "j". */ static int coalesced_subset_with_equalities(int i, int j, struct isl_coalesce_info *info) { isl_basic_map *hull_i, *hull_j, *bmap_i; int equal, empty, subset; if (info[j].bmap->n_eq == 0) return 0; if (info[i].bmap->n_div == 0) return 0; hull_i = isl_basic_map_copy(info[i].bmap); hull_i = isl_basic_map_plain_affine_hull(hull_i); hull_j = isl_basic_map_copy(info[j].bmap); hull_j = isl_basic_map_plain_affine_hull(hull_j); hull_j = isl_basic_map_intersect(hull_j, isl_basic_map_copy(hull_i)); equal = isl_basic_map_plain_is_equal(hull_i, hull_j); empty = isl_basic_map_plain_is_empty(hull_j); isl_basic_map_free(hull_i); if (equal < 0 || equal || empty < 0 || empty) { isl_basic_map_free(hull_j); return equal < 0 || empty < 0 ? -1 : 0; } bmap_i = isl_basic_map_copy(info[i].bmap); bmap_i = isl_basic_map_intersect(bmap_i, hull_j); if (!bmap_i) return -1; if (bmap_i->n_div > info[j].bmap->n_div) { isl_basic_map_free(bmap_i); return 0; } subset = contains_after_aligning_divs(bmap_i, &info[j]); isl_basic_map_free(bmap_i); if (subset < 0) return -1; if (subset) drop(&info[j]); return subset; } /* Check if one of the basic maps is a subset of the other and, if so, * drop the subset. * Note that we only perform any test if the number of divs is different * in the two basic maps. In case the number of divs is the same, * we have already established that the divs are different * in the two basic maps. * In particular, if the number of divs of basic map i is smaller than * the number of divs of basic map j, then we check if j is a subset of i * and vice versa. */ static enum isl_change check_coalesce_subset(int i, int j, struct isl_coalesce_info *info) { int changed; changed = coalesced_subset(i, j, info); if (changed < 0 || changed) return changed < 0 ? isl_change_error : isl_change_drop_second; changed = coalesced_subset(j, i, info); if (changed < 0 || changed) return changed < 0 ? isl_change_error : isl_change_drop_first; changed = coalesced_subset_with_equalities(i, j, info); if (changed < 0 || changed) return changed < 0 ? isl_change_error : isl_change_drop_second; changed = coalesced_subset_with_equalities(j, i, info); if (changed < 0 || changed) return changed < 0 ? isl_change_error : isl_change_drop_first; return isl_change_none; } /* Does "bmap" involve any divs that themselves refer to divs? */ static int has_nested_div(__isl_keep isl_basic_map *bmap) { int i; unsigned total; unsigned n_div; total = isl_basic_map_dim(bmap, isl_dim_all); n_div = isl_basic_map_dim(bmap, isl_dim_div); total -= n_div; for (i = 0; i < n_div; ++i) if (isl_seq_first_non_zero(bmap->div[i] + 2 + total, n_div) != -1) return 1; return 0; } /* Return a list of affine expressions, one for each integer division * in "bmap_i". For each integer division that also appears in "bmap_j", * the affine expression is set to NaN. The number of NaNs in the list * is equal to the number of integer divisions in "bmap_j". * For the other integer divisions of "bmap_i", the corresponding * element in the list is a purely affine expression equal to the integer * division in "hull". * If no such list can be constructed, then the number of elements * in the returned list is smaller than the number of integer divisions * in "bmap_i". */ static __isl_give isl_aff_list *set_up_substitutions( __isl_keep isl_basic_map *bmap_i, __isl_keep isl_basic_map *bmap_j, __isl_take isl_basic_map *hull) { unsigned n_div_i, n_div_j, total; isl_ctx *ctx; isl_local_space *ls; isl_basic_set *wrap_hull; isl_aff *aff_nan; isl_aff_list *list; int i, j; if (!hull) return NULL; ctx = isl_basic_map_get_ctx(hull); n_div_i = isl_basic_map_dim(bmap_i, isl_dim_div); n_div_j = isl_basic_map_dim(bmap_j, isl_dim_div); total = isl_basic_map_total_dim(bmap_i) - n_div_i; ls = isl_basic_map_get_local_space(bmap_i); ls = isl_local_space_wrap(ls); wrap_hull = isl_basic_map_wrap(hull); aff_nan = isl_aff_nan_on_domain(isl_local_space_copy(ls)); list = isl_aff_list_alloc(ctx, n_div_i); j = 0; for (i = 0; i < n_div_i; ++i) { isl_aff *aff; if (j < n_div_j && isl_seq_eq(bmap_i->div[i], bmap_j->div[j], 2 + total)) { ++j; list = isl_aff_list_add(list, isl_aff_copy(aff_nan)); continue; } if (n_div_i - i <= n_div_j - j) break; aff = isl_local_space_get_div(ls, i); aff = isl_aff_substitute_equalities(aff, isl_basic_set_copy(wrap_hull)); aff = isl_aff_floor(aff); if (!aff) goto error; if (isl_aff_dim(aff, isl_dim_div) != 0) { isl_aff_free(aff); break; } list = isl_aff_list_add(list, aff); } isl_aff_free(aff_nan); isl_local_space_free(ls); isl_basic_set_free(wrap_hull); return list; error: isl_aff_free(aff_nan); isl_local_space_free(ls); isl_basic_set_free(wrap_hull); isl_aff_list_free(list); return NULL; } /* Add variables to "tab" corresponding to the elements in "list" * that are not set to NaN. * "dim" is the offset in the variables of "tab" where we should * start considering the elements in "list". * When this function returns, the total number of variables in "tab" * is equal to "dim" plus the number of elements in "list". */ static int add_sub_vars(struct isl_tab *tab, __isl_keep isl_aff_list *list, int dim) { int i, n; n = isl_aff_list_n_aff(list); for (i = 0; i < n; ++i) { int is_nan; isl_aff *aff; aff = isl_aff_list_get_aff(list, i); is_nan = isl_aff_is_nan(aff); isl_aff_free(aff); if (is_nan < 0) return -1; if (!is_nan && isl_tab_insert_var(tab, dim + i) < 0) return -1; } return 0; } /* For each element in "list" that is not set to NaN, fix the corresponding * variable in "tab" to the purely affine expression defined by the element. * "dim" is the offset in the variables of "tab" where we should * start considering the elements in "list". */ static int add_sub_equalities(struct isl_tab *tab, __isl_keep isl_aff_list *list, int dim) { int i, n; isl_ctx *ctx; isl_vec *sub; isl_aff *aff; n = isl_aff_list_n_aff(list); ctx = isl_tab_get_ctx(tab); sub = isl_vec_alloc(ctx, 1 + dim + n); if (!sub) return -1; isl_seq_clr(sub->el + 1 + dim, n); for (i = 0; i < n; ++i) { aff = isl_aff_list_get_aff(list, i); if (!aff) goto error; if (isl_aff_is_nan(aff)) { isl_aff_free(aff); continue; } isl_seq_cpy(sub->el, aff->v->el + 1, 1 + dim); isl_int_neg(sub->el[1 + dim + i], aff->v->el[0]); if (isl_tab_add_eq(tab, sub->el) < 0) goto error; isl_int_set_si(sub->el[1 + dim + i], 0); isl_aff_free(aff); } isl_vec_free(sub); return 0; error: isl_aff_free(aff); isl_vec_free(sub); return -1; } /* Add variables to info->tab corresponding to the elements in "list" * that are not set to NaN. The value of the added variable * is fixed to the purely affine expression defined by the element. * "dim" is the offset in the variables of info->tab where we should * start considering the elements in "list". * When this function returns, the total number of variables in info->tab * is equal to "dim" plus the number of elements in "list". * Additionally, add the div constraints that have been added info->bmap * after the tableau was constructed to info->tab. These constraints * start at position "n_ineq" in info->bmap. * The constraints need to be added to the tableau before * the equalities assigning the purely affine expression * because the position needs to match that in info->bmap. * They are frozen because the corresponding added equality is a consequence * of the two div constraints and the other equalities, meaning that * the div constraints would otherwise get marked as redundant, * while they are only redundant with respect to the extra equalities * added to the tableau, which do not appear explicitly in the basic map. */ static int add_subs(struct isl_coalesce_info *info, __isl_keep isl_aff_list *list, int dim, int n_ineq) { int i, extra_var, extra_con; int n; unsigned n_eq = info->bmap->n_eq; if (!list) return -1; n = isl_aff_list_n_aff(list); extra_var = n - (info->tab->n_var - dim); extra_con = info->bmap->n_ineq - n_ineq; if (isl_tab_extend_vars(info->tab, extra_var) < 0) return -1; if (isl_tab_extend_cons(info->tab, extra_con + 2 * extra_var) < 0) return -1; if (add_sub_vars(info->tab, list, dim) < 0) return -1; for (i = n_ineq; i < info->bmap->n_ineq; ++i) { if (isl_tab_add_ineq(info->tab, info->bmap->ineq[i]) < 0) return -1; if (isl_tab_freeze_constraint(info->tab, n_eq + i) < 0) return -1; } return add_sub_equalities(info->tab, list, dim); } /* Coalesce basic map "j" into basic map "i" after adding the extra integer * divisions in "i" but not in "j" to basic map "j", with values * specified by "list". The total number of elements in "list" * is equal to the number of integer divisions in "i", while the number * of NaN elements in the list is equal to the number of integer divisions * in "j". * Adding extra integer divisions to "j" through isl_basic_map_align_divs * also adds the corresponding div constraints. These need to be added * to the corresponding tableau as well in add_subs to maintain consistency. * * If no coalescing can be performed, then we need to revert basic map "j" * to its original state. We do the same if basic map "i" gets dropped * during the coalescing, even though this should not happen in practice * since we have already checked for "j" being a subset of "i" * before we reach this stage. */ static enum isl_change coalesce_with_subs(int i, int j, struct isl_coalesce_info *info, __isl_keep isl_aff_list *list) { isl_basic_map *bmap_j; struct isl_tab_undo *snap; unsigned dim; enum isl_change change; int n_ineq; bmap_j = isl_basic_map_copy(info[j].bmap); n_ineq = info[j].bmap->n_ineq; info[j].bmap = isl_basic_map_align_divs(info[j].bmap, info[i].bmap); if (!info[j].bmap) goto error; snap = isl_tab_snap(info[j].tab); dim = isl_basic_map_dim(bmap_j, isl_dim_all); dim -= isl_basic_map_dim(bmap_j, isl_dim_div); if (add_subs(&info[j], list, dim, n_ineq) < 0) goto error; change = coalesce_local_pair(i, j, info); if (change != isl_change_none && change != isl_change_drop_first) { isl_basic_map_free(bmap_j); } else { isl_basic_map_free(info[j].bmap); info[j].bmap = bmap_j; if (isl_tab_rollback(info[j].tab, snap) < 0) return isl_change_error; } return change; error: isl_basic_map_free(bmap_j); return isl_change_error; } /* Check if we can coalesce basic map "j" into basic map "i" after copying * those extra integer divisions in "i" that can be simplified away * using the extra equalities in "j". * All divs are assumed to be known and not contain any nested divs. * * We first check if there are any extra equalities in "j" that we * can exploit. Then we check if every integer division in "i" * either already appears in "j" or can be simplified using the * extra equalities to a purely affine expression. * If these tests succeed, then we try to coalesce the two basic maps * by introducing extra dimensions in "j" corresponding to * the extra integer divsisions "i" fixed to the corresponding * purely affine expression. */ static enum isl_change check_coalesce_into_eq(int i, int j, struct isl_coalesce_info *info) { unsigned n_div_i, n_div_j; isl_basic_map *hull_i, *hull_j; int equal, empty; isl_aff_list *list; enum isl_change change; n_div_i = isl_basic_map_dim(info[i].bmap, isl_dim_div); n_div_j = isl_basic_map_dim(info[j].bmap, isl_dim_div); if (n_div_i <= n_div_j) return isl_change_none; if (info[j].bmap->n_eq == 0) return isl_change_none; hull_i = isl_basic_map_copy(info[i].bmap); hull_i = isl_basic_map_plain_affine_hull(hull_i); hull_j = isl_basic_map_copy(info[j].bmap); hull_j = isl_basic_map_plain_affine_hull(hull_j); hull_j = isl_basic_map_intersect(hull_j, isl_basic_map_copy(hull_i)); equal = isl_basic_map_plain_is_equal(hull_i, hull_j); empty = isl_basic_map_plain_is_empty(hull_j); isl_basic_map_free(hull_i); if (equal < 0 || empty < 0) goto error; if (equal || empty) { isl_basic_map_free(hull_j); return isl_change_none; } list = set_up_substitutions(info[i].bmap, info[j].bmap, hull_j); if (!list) return isl_change_error; if (isl_aff_list_n_aff(list) < n_div_i) change = isl_change_none; else change = coalesce_with_subs(i, j, info, list); isl_aff_list_free(list); return change; error: isl_basic_map_free(hull_j); return isl_change_error; } /* Check if we can coalesce basic maps "i" and "j" after copying * those extra integer divisions in one of the basic maps that can * be simplified away using the extra equalities in the other basic map. * We require all divs to be known in both basic maps. * Furthermore, to simplify the comparison of div expressions, * we do not allow any nested integer divisions. */ static enum isl_change check_coalesce_eq(int i, int j, struct isl_coalesce_info *info) { int known, nested; enum isl_change change; known = isl_basic_map_divs_known(info[i].bmap); if (known < 0 || !known) return known < 0 ? isl_change_error : isl_change_none; known = isl_basic_map_divs_known(info[j].bmap); if (known < 0 || !known) return known < 0 ? isl_change_error : isl_change_none; nested = has_nested_div(info[i].bmap); if (nested < 0 || nested) return nested < 0 ? isl_change_error : isl_change_none; nested = has_nested_div(info[j].bmap); if (nested < 0 || nested) return nested < 0 ? isl_change_error : isl_change_none; change = check_coalesce_into_eq(i, j, info); if (change != isl_change_none) return change; change = check_coalesce_into_eq(j, i, info); if (change != isl_change_none) return invert_change(change); return isl_change_none; } /* 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 * isl_change_drop_first, isl_change_drop_second or isl_change_fuse. * Otherwise, return isl_change_none. * * We first check if the two basic maps live in the same local space, * after aligning the divs that differ by only an integer constant. * If so, we do the complete check. Otherwise, we check if they have * the same number of integer divisions and can be coalesced, if one is * an obvious subset of the other or if the extra integer divisions * of one basic map can be simplified away using the extra equalities * of the other basic map. */ static enum isl_change coalesce_pair(int i, int j, struct isl_coalesce_info *info) { int same; enum isl_change change; if (harmonize_divs(&info[i], &info[j]) < 0) return isl_change_error; same = same_divs(info[i].bmap, info[j].bmap); if (same < 0) return isl_change_error; if (same) return coalesce_local_pair(i, j, info); if (info[i].bmap->n_div == info[j].bmap->n_div) { change = coalesce_local_pair(i, j, info); if (change != isl_change_none) return change; } change = check_coalesce_subset(i, j, info); if (change != isl_change_none) return change; return check_coalesce_eq(i, j, info); } /* Return the maximum of "a" and "b". */ static inline int max(int a, int b) { return a > b ? a : b; } /* Pairwise coalesce the basic maps in the range [start1, end1[ of "info" * with those in the range [start2, end2[, skipping basic maps * that have been removed (either before or within this function). * * For each basic map i in the first range, we check if it can be coalesced * with respect to any previously considered basic map j in the second range. * If i gets dropped (because it was a subset of some j), then * we can move on to the next basic map. * If j gets dropped, we need to continue checking against the other * previously considered basic maps. * If the two basic maps got fused, then we recheck the fused basic map * against the previously considered basic maps, starting at i + 1 * (even if start2 is greater than i + 1). */ static int coalesce_range(isl_ctx *ctx, struct isl_coalesce_info *info, int start1, int end1, int start2, int end2) { int i, j; for (i = end1 - 1; i >= start1; --i) { if (info[i].removed) continue; for (j = max(i + 1, start2); j < end2; ++j) { enum isl_change changed; if (info[j].removed) continue; if (info[i].removed) isl_die(ctx, isl_error_internal, "basic map unexpectedly removed", return -1); changed = coalesce_pair(i, j, info); switch (changed) { case isl_change_error: return -1; case isl_change_none: case isl_change_drop_second: continue; case isl_change_drop_first: j = end2; break; case isl_change_fuse: j = i; break; } } } return 0; } /* Pairwise coalesce the basic maps described by the "n" elements of "info". * * We consider groups of basic maps that live in the same apparent * affine hull and we first coalesce within such a group before we * coalesce the elements in the group with elements of previously * considered groups. If a fuse happens during the second phase, * then we also reconsider the elements within the group. */ static int coalesce(isl_ctx *ctx, int n, struct isl_coalesce_info *info) { int start, end; for (end = n; end > 0; end = start) { start = end - 1; while (start >= 1 && info[start - 1].hull_hash == info[start].hull_hash) start--; if (coalesce_range(ctx, info, start, end, start, end) < 0) return -1; if (coalesce_range(ctx, info, start, end, end, n) < 0) return -1; } return 0; } /* Update the basic maps in "map" based on the information in "info". * In particular, remove the basic maps that have been marked removed and * update the others based on the information in the corresponding tableau. * Since we detected implicit equalities without calling * isl_basic_map_gauss, we need to do it now. * Also call isl_basic_map_simplify if we may have lost the definition * of one or more integer divisions. */ static __isl_give isl_map *update_basic_maps(__isl_take isl_map *map, int n, struct isl_coalesce_info *info) { int i; if (!map) return NULL; for (i = n - 1; i >= 0; --i) { if (info[i].removed) { isl_basic_map_free(map->p[i]); if (i != map->n - 1) map->p[i] = map->p[map->n - 1]; map->n--; continue; } info[i].bmap = isl_basic_map_update_from_tab(info[i].bmap, info[i].tab); info[i].bmap = isl_basic_map_gauss(info[i].bmap, NULL); if (info[i].simplify) info[i].bmap = isl_basic_map_simplify(info[i].bmap); info[i].bmap = isl_basic_map_finalize(info[i].bmap); if (!info[i].bmap) return isl_map_free(map); ISL_F_SET(info[i].bmap, ISL_BASIC_MAP_NO_IMPLICIT); ISL_F_SET(info[i].bmap, ISL_BASIC_MAP_NO_REDUNDANT); isl_basic_map_free(map->p[i]); map->p[i] = info[i].bmap; info[i].bmap = NULL; } return map; } /* 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. * * We factor out any (hidden) common factor from the constraint * coefficients to improve the detection of adjacent constraints. * * 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 (in update_basic_maps) to ensure that * the basic maps are not left in an unexpected state. * For each basic map, we also compute the hash of the apparent affine hull * for use in coalesce. */ struct isl_map *isl_map_coalesce(struct isl_map *map) { int i; unsigned n; isl_ctx *ctx; struct isl_coalesce_info *info = NULL; map = isl_map_remove_empty_parts(map); if (!map) return NULL; if (map->n <= 1) return map; ctx = isl_map_get_ctx(map); map = isl_map_sort_divs(map); map = isl_map_cow(map); if (!map) return NULL; n = map->n; info = isl_calloc_array(map->ctx, struct isl_coalesce_info, n); if (!info) goto error; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_reduce_coefficients(map->p[i]); if (!map->p[i]) goto error; info[i].bmap = isl_basic_map_copy(map->p[i]); info[i].tab = isl_tab_from_basic_map(info[i].bmap, 0); if (!info[i].tab) goto error; if (!ISL_F_ISSET(info[i].bmap, ISL_BASIC_MAP_NO_IMPLICIT)) if (isl_tab_detect_implicit_equalities(info[i].tab) < 0) goto error; info[i].bmap = isl_tab_make_equalities_explicit(info[i].tab, info[i].bmap); if (!info[i].bmap) goto error; if (!ISL_F_ISSET(info[i].bmap, ISL_BASIC_MAP_NO_REDUNDANT)) if (isl_tab_detect_redundant(info[i].tab) < 0) goto error; if (coalesce_info_set_hull_hash(&info[i]) < 0) goto error; } for (i = map->n - 1; i >= 0; --i) if (info[i].tab->empty) drop(&info[i]); if (coalesce(ctx, n, info) < 0) goto error; map = update_basic_maps(map, n, info); clear_coalesce_info(n, info); return map; error: clear_coalesce_info(n, info); 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.4/isl/isl_obj.c0000644000175000017500000002016612554427055012222 00000000000000/* * Copyright 2010 INRIA Saclay * Copyright 2014 Ecole Normale Superieure * Copyright 2014 INRIA Rocquencourt * * 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 * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt, * B.P. 105 - 78153 Le Chesnay, France */ #include #include #include #include #include #include #include #include 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_pw_multi_aff_copy(void *v) { return isl_pw_multi_aff_copy((isl_pw_multi_aff *) v); } static void isl_obj_pw_multi_aff_free(void *v) { isl_pw_multi_aff_free((isl_pw_multi_aff *) v); } static __isl_give isl_printer *isl_obj_pw_multi_aff_print( __isl_take isl_printer *p, void *v) { return isl_printer_print_pw_multi_aff(p, (isl_pw_multi_aff *) v); } static void *isl_obj_pw_multi_aff_add(void *v1, void *v2) { return isl_pw_multi_aff_add((isl_pw_multi_aff *) v1, (isl_pw_multi_aff *) v2); } struct isl_obj_vtable isl_obj_pw_multi_aff_vtable = { isl_obj_pw_multi_aff_copy, isl_obj_pw_multi_aff_add, isl_obj_pw_multi_aff_print, isl_obj_pw_multi_aff_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 }; static void *isl_obj_schedule_copy(void *v) { return isl_schedule_copy((isl_schedule *) v); } static void isl_obj_schedule_free(void *v) { isl_schedule_free((isl_schedule *) v); } static __isl_give isl_printer *isl_obj_schedule_print( __isl_take isl_printer *p, void *v) { return isl_printer_print_schedule(p, (isl_schedule *) v); } struct isl_obj_vtable isl_obj_schedule_vtable = { isl_obj_schedule_copy, NULL, isl_obj_schedule_print, isl_obj_schedule_free }; cloog-0.18.4/isl/isl_set_list.c0000644000175000017500000000065212554427055013274 00000000000000#include #include #undef EL #define EL isl_basic_set #include #undef EL #define EL isl_set #include #undef EL #define EL isl_union_set #include #undef BASE #define BASE basic_set #include #undef BASE #define BASE set #include #undef BASE #define BASE union_set #include cloog-0.18.4/isl/isl_range.h0000644000175000017500000000042412413256472012541 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.4/isl/isl_constraint.c0000644000175000017500000011202512554427055013630 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 #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_constraint_alloc_equality( __isl_take isl_local_space *ls) { return isl_constraint_alloc(1, ls); } __isl_give isl_constraint *isl_constraint_alloc_inequality( __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; } __isl_null isl_constraint *isl_constraint_free(__isl_take 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 "bmap", i.e., the * number of times isl_basic_map_foreach_constraint will * call the callback. */ int isl_basic_map_n_constraint(__isl_keep isl_basic_map *bmap) { if (!bmap) return -1; return bmap->n_eq + bmap->n_ineq; } /* 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) { return isl_basic_map_n_constraint(bset); } isl_stat isl_basic_map_foreach_constraint(__isl_keep isl_basic_map *bmap, isl_stat (*fn)(__isl_take isl_constraint *c, void *user), void *user) { int i; struct isl_constraint *c; if (!bmap) return isl_stat_error; isl_assert(bmap->ctx, ISL_F_ISSET(bmap, ISL_BASIC_MAP_FINAL), return isl_stat_error); for (i = 0; i < bmap->n_eq; ++i) { c = isl_basic_map_constraint(isl_basic_map_copy(bmap), &bmap->eq[i]); if (!c) return isl_stat_error; if (fn(c, user) < 0) return isl_stat_error; } for (i = 0; i < bmap->n_ineq; ++i) { c = isl_basic_map_constraint(isl_basic_map_copy(bmap), &bmap->ineq[i]); if (!c) return isl_stat_error; if (fn(c, user) < 0) return isl_stat_error; } return isl_stat_ok; } isl_stat isl_basic_set_foreach_constraint(__isl_keep isl_basic_set *bset, isl_stat (*fn)(__isl_take isl_constraint *c, void *user), void *user) { return isl_basic_map_foreach_constraint((isl_basic_map *)bset, fn, user); } /* Add the constraint to the list that "user" points to, if it is not * a div constraint. */ static isl_stat 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 isl_stat_ok; } /* Return a list of constraints that, when combined, are equivalent * to "bmap". The input is required to have only known divs. * * There is no need to include the div constraints as they are * implied by the div expressions. */ __isl_give isl_constraint_list *isl_basic_map_get_constraint_list( __isl_keep isl_basic_map *bmap) { int n; int known; isl_ctx *ctx; isl_constraint_list *list; known = isl_basic_map_divs_known(bmap); if (known < 0) return NULL; ctx = isl_basic_map_get_ctx(bmap); if (!known) isl_die(ctx, isl_error_invalid, "input involves unknown divs", return NULL); n = isl_basic_map_n_constraint(bmap); list = isl_constraint_list_alloc(ctx, n); if (isl_basic_map_foreach_constraint(bmap, &collect_constraint, &list) < 0) list = isl_constraint_list_free(list); return list; } /* Return a list of constraints that, when combined, are equivalent * to "bset". The input is required to have only known divs. */ __isl_give isl_constraint_list *isl_basic_set_get_constraint_list( __isl_keep isl_basic_set *bset) { return isl_basic_map_get_constraint_list(bset); } 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); } isl_bool 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; isl_bool involves = isl_bool_false; if (!constraint) return isl_bool_error; if (n == 0) return isl_bool_false; 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 isl_bool_error); 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 = isl_bool_true; break; } free(active); return involves; error: free(active); return isl_bool_error; } /* Does the given constraint represent a lower bound on the given * dimension? */ isl_bool isl_constraint_is_lower_bound(__isl_keep isl_constraint *constraint, enum isl_dim_type type, unsigned pos) { if (!constraint) return isl_bool_error; if (pos >= isl_local_space_dim(constraint->ls, type)) isl_die(isl_constraint_get_ctx(constraint), isl_error_invalid, "position out of bounds", return isl_bool_error); 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? */ isl_bool isl_constraint_is_upper_bound(__isl_keep isl_constraint *constraint, enum isl_dim_type type, unsigned pos) { if (!constraint) return isl_bool_error; if (pos >= isl_local_space_dim(constraint->ls, type)) isl_die(isl_constraint_get_ctx(constraint), isl_error_invalid, "position out of bounds", return isl_bool_error); 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_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); 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. * * We manually set ISL_BASIC_SET_FINAL instead of calling * isl_basic_set_finalize because this function is called by CLooG, * which does not expect any variables to disappear. */ __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; int equality; 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; } bset = isl_basic_set_cow(bset); if (!bset) goto error; equality = isl_constraint_is_equality(constraint); if (equality) { 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)) continue; if (equality && isl_basic_set_drop_equality(bset, i) < 0) goto error; if (!equality && isl_basic_set_drop_inequality(bset, i) < 0) goto error; break; } isl_constraint_free(constraint); ISL_F_SET(bset, ISL_BASIC_SET_FINAL); 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; } isl_bool isl_constraint_is_equality(struct isl_constraint *constraint) { if (!constraint) return isl_bool_error; 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", goto error); return (isl_basic_set *)isl_basic_map_from_constraint(constraint); error: isl_constraint_free(constraint); return NULL; } /* Is the variable of "type" at position "pos" of "bmap" defined * in terms of earlier dimensions through an equality? * * If so, and if c is not NULL, then return a copy of this equality in *c. */ 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) continue; if (c) *c = isl_basic_map_constraint(isl_basic_map_copy(bmap), &bmap->eq[i]); return 1; } return 0; } /* Is the variable of "type" at position "pos" of "bset" defined * in terms of earlier dimensions through an equality? * * If so, and if c is not NULL, then return a copy of this equality in *c. */ 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 isl_stat 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, isl_stat (*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 isl_stat_error; return isl_stat_ok; error: isl_constraint_free(upper); isl_basic_set_free(context_i); isl_basic_set_free(context); return isl_stat_error; } static isl_stat 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, isl_stat (*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 isl_stat_error; return isl_stat_ok; error: isl_constraint_free(lower); isl_basic_set_free(context_i); isl_basic_set_free(context); return isl_stat_error; } static isl_stat 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, isl_stat (*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 isl_stat_error; return isl_stat_ok; 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 isl_stat_error; } /* 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. */ isl_stat isl_basic_set_foreach_bound_pair(__isl_keep isl_basic_set *bset, enum isl_dim_type type, unsigned pos, isl_stat (*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 isl_stat_error; isl_assert(bset->ctx, pos < isl_basic_set_dim(bset, type), return isl_stat_error); isl_assert(bset->ctx, type == isl_dim_param || type == isl_dim_set, return isl_stat_error); 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); } /* Compare two isl_constraints. * * Return -1 if "c1" is "smaller" than "c2", 1 if "c1" is "greater" * than "c2" and 0 if they are equal. * * The order is fairly arbitrary. We do consider constraints that only involve * earlier dimensions as "smaller". */ int isl_constraint_plain_cmp(__isl_keep isl_constraint *c1, __isl_keep isl_constraint *c2) { int cmp; int last1, last2; if (c1 == c2) return 0; if (!c1) return -1; if (!c2) return 1; cmp = isl_local_space_cmp(c1->ls, c2->ls); if (cmp != 0) return cmp; last1 = isl_seq_last_non_zero(c1->v->el + 1, c1->v->size - 1); last2 = isl_seq_last_non_zero(c2->v->el + 1, c1->v->size - 1); if (last1 != last2) return last1 - last2; return isl_seq_cmp(c1->v->el, c2->v->el, c1->v->size); } /* Compare two constraints based on their final (non-zero) coefficients. * In particular, the constraint that involves later variables or * that has a larger coefficient for a shared latest variable * is considered "greater" than the other constraint. * * Return -1 if "c1" is "smaller" than "c2", 1 if "c1" is "greater" * than "c2" and 0 if they are equal. * * If the constraints live in different local spaces, then we cannot * really compare the constraints so we compare the local spaces instead. */ int isl_constraint_cmp_last_non_zero(__isl_keep isl_constraint *c1, __isl_keep isl_constraint *c2) { int cmp; int last1, last2; if (c1 == c2) return 0; if (!c1) return -1; if (!c2) return 1; cmp = isl_local_space_cmp(c1->ls, c2->ls); if (cmp != 0) return cmp; last1 = isl_seq_last_non_zero(c1->v->el + 1, c1->v->size - 1); last2 = isl_seq_last_non_zero(c2->v->el + 1, c1->v->size - 1); if (last1 != last2) return last1 - last2; if (last1 == -1) return 0; return isl_int_abs_cmp(c1->v->el[1 + last1], c2->v->el[1 + last2]); } cloog-0.18.4/isl/isl_tab.c0000644000175000017500000027416112554427055012224 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * Copyright 2013 Ecole Normale Superieure * Copyright 2014 INRIA Rocquencourt * * 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 * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt, * B.P. 105 - 78153 Le Chesnay, France */ #include #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 = tab->n_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; } 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; } int 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 0; error: isl_vec_free(sample); return -1; } 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; } } /* Mark "tab" as a rational tableau. * If it wasn't marked as a rational tableau already and if we may * need to undo changes, then arrange for the marking to be undone * during the undo. */ int isl_tab_mark_rational(struct isl_tab *tab) { if (!tab) return -1; if (!tab->rational && tab->need_undo) if (isl_tab_push(tab, isl_tab_undo_rational) < 0) return -1; tab->rational = 1; return 0; } 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; isl_ctx *ctx; struct isl_mat *mat = tab->mat; struct isl_tab_var *var; unsigned off = 2 + tab->M; ctx = isl_tab_get_ctx(tab); if (isl_ctx_next_operation(ctx) < 0) 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. * * If the variable "var" is supposed to be non-negative (is_nonneg is set), * then 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 (var->is_nonneg && 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; } /* Move the entries in tab->var up one position, starting at "first", * creating room for an extra entry at position "first". * Since some of the entries of tab->row_var and tab->col_var contain * indices into this array, they have to be updated accordingly. */ static int var_insert_entry(struct isl_tab *tab, int first) { int i; if (tab->n_var >= tab->max_var) isl_die(isl_tab_get_ctx(tab), isl_error_internal, "not enough room for new variable", return -1); if (first > tab->n_var) isl_die(isl_tab_get_ctx(tab), isl_error_internal, "invalid initial position", return -1); for (i = tab->n_var - 1; i >= first; --i) { tab->var[i + 1] = tab->var[i]; if (tab->var[i + 1].is_row) tab->row_var[tab->var[i + 1].index]++; else tab->col_var[tab->var[i + 1].index]++; } tab->n_var++; return 0; } /* Drop the entry at position "first" in tab->var, moving all * subsequent entries down. * Since some of the entries of tab->row_var and tab->col_var contain * indices into this array, they have to be updated accordingly. */ static int var_drop_entry(struct isl_tab *tab, int first) { int i; if (first >= tab->n_var) isl_die(isl_tab_get_ctx(tab), isl_error_internal, "invalid initial position", return -1); tab->n_var--; for (i = first; i < tab->n_var; ++i) { tab->var[i] = tab->var[i + 1]; if (tab->var[i + 1].is_row) tab->row_var[tab->var[i].index]--; else tab->col_var[tab->var[i].index]--; } return 0; } /* Add a variable to the tableau at position "r" and allocate a column for it. * Return the index into the variable array "var", i.e., "r", * or -1 on error. */ int isl_tab_insert_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); if (var_insert_entry(tab, r) < 0) return -1; 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_col++; if (isl_tab_push_var(tab, isl_tab_undo_allocate, &tab->var[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) { if (!tab) return -1; return isl_tab_insert_var(tab, tab->n_var); } /* 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; } /* Drop the variable in column "col" along with the column. * The column is removed first because it may need to be moved * into the last position and this process requires * the contents of the col_var array in a state * before the removal of the variable. */ static int drop_col(struct isl_tab *tab, int col) { int var; var = tab->col_var[col]; if (col != tab->n_col - 1) swap_cols(tab, col, tab->n_col - 1); tab->n_col--; if (var_drop_entry(tab, var) < 0) return -1; 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) return isl_tab_rollback(tab, snap); return drop_row(tab, row); } 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. */ int isl_tab_relax(struct isl_tab *tab, int con) { struct isl_tab_var *var; if (!tab) return -1; 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", return -1); if (!var->is_row && (var->index < 0 || var->index < tab->n_dead)) isl_die(tab->mat->ctx, isl_error_invalid, "cannot relax dead constraint", return -1); if (!var->is_row && !max_is_manifestly_unbounded(tab, var)) if (to_row(tab, var, 1) < 0) return -1; if (!var->is_row && !min_is_manifestly_unbounded(tab, var)) if (to_row(tab, var, -1) < 0) return -1; 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) return -1; } else { int i; unsigned off = 2 + tab->M; 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) return -1; return 0; } /* Replace the variable v at position "pos" in the tableau "tab" * by v' = v + shift. * * If the variable is in a column, then we first check if we can * simply plug in v = v' - shift. The effect on a row with * coefficient f/d for variable v is that the constant term c/d * is replaced by (c - f * shift)/d. If shift is positive and * f is negative for each row that needs to remain non-negative, * then this is clearly safe. In other words, if the minimum of v * is manifestly unbounded, then we can keep v in a column position. * Otherwise, we can pivot it down to a row. * Similarly, if shift is negative, we need to check if the maximum * of is manifestly unbounded. * * If the variable is in a row (from the start or after pivoting), * then the constant term c/d is replaced by (c + d * shift)/d. */ int isl_tab_shift_var(struct isl_tab *tab, int pos, isl_int shift) { struct isl_tab_var *var; if (!tab) return -1; if (isl_int_is_zero(shift)) return 0; var = &tab->var[pos]; if (!var->is_row) { if (isl_int_is_neg(shift)) { 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; } } if (var->is_row) { isl_int_addmul(tab->mat->row[var->index][1], shift, tab->mat->row[var->index][0]); } else { int i; unsigned off = 2 + tab->M; for (i = 0; i < tab->n_row; ++i) { if (isl_int_is_zero(tab->mat->row[i][off + var->index])) continue; isl_int_submul(tab->mat->row[i][1], shift, tab->mat->row[i][off + var->index]); } } return 0; } /* 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; } /* Is the constraint at position "con" marked as being redundant? * If it is marked as representing an equality, then it is not * considered to be redundant. * Note that isl_tab_mark_redundant marks both the isl_tab_var as * redundant and moves the corresponding row into the first * tab->n_redundant positions (or removes the row, assigning it index -1), * so the final test is actually redundant itself. */ int isl_tab_is_redundant(struct isl_tab *tab, int con) { if (!tab) return -1; if (con < 0 || con >= tab->n_con) isl_die(isl_tab_get_ctx(tab), isl_error_invalid, "position out of bounds", 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); return drop_col(tab, var->index); } 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; } return drop_row(tab, var->index); 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_rational: tab->rational = 0; break; 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.4/isl/isl_union_map_private.h0000644000175000017500000000053012554427055015165 00000000000000#define isl_union_set_list isl_union_map_list #define isl_union_set isl_union_map #include #include struct isl_union_map { int ref; isl_space *dim; struct isl_hash_table table; }; __isl_give isl_union_map *isl_union_map_reset_range_space( __isl_take isl_union_map *umap, __isl_take isl_space *space); cloog-0.18.4/isl/isl_vertices.c0000644000175000017500000011110612554427055013267 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 #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; 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); 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; if (!bset) return NULL; 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; if (!bset) return NULL; 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_copy(isl_tab_peek_bset(tab)); 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_copy(isl_tab_peek_bset(tab)); 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_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); } /* Return the activity domain of the vertex "vertex". */ __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); v->dom = isl_basic_set_set_integral(v->dom); } return isl_basic_set_copy(v->dom); } /* Return a multiple quasi-affine expression describing the vertex "vertex" * in terms of the parameters, */ __isl_give isl_multi_aff *isl_vertex_get_expr(__isl_keep isl_vertex *vertex) { struct isl_vertex *v; isl_basic_set *bset; if (!vertex) return NULL; v = &vertex->vertices->v[vertex->id]; bset = isl_basic_set_copy(v->vertex); return isl_multi_aff_from_basic_set_equalities(bset); } 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_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; } isl_stat isl_vertices_foreach_cell(__isl_keep isl_vertices *vertices, isl_stat (*fn)(__isl_take isl_cell *cell, void *user), void *user) { int i; isl_cell *cell; if (!vertices) return isl_stat_error; if (vertices->n_chambers == 0) return isl_stat_ok; for (i = 0; i < vertices->n_chambers; ++i) { isl_stat 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 isl_stat_error; r = fn(cell, user); if (r < 0) return isl_stat_error; } return isl_stat_ok; } isl_stat isl_vertices_foreach_vertex(__isl_keep isl_vertices *vertices, isl_stat (*fn)(__isl_take isl_vertex *vertex, void *user), void *user) { int i; isl_vertex *vertex; if (!vertices) return isl_stat_error; if (vertices->n_vertices == 0) return isl_stat_ok; for (i = 0; i < vertices->n_vertices; ++i) { isl_stat r; vertex = isl_vertex_alloc(isl_vertices_copy(vertices), i); if (!vertex) return isl_stat_error; r = fn(vertex, user); if (r < 0) return isl_stat_error; } return isl_stat_ok; } isl_stat isl_cell_foreach_vertex(__isl_keep isl_cell *cell, isl_stat (*fn)(__isl_take isl_vertex *vertex, void *user), void *user) { int i; isl_vertex *vertex; if (!cell) return isl_stat_error; if (cell->n_vertices == 0) return isl_stat_ok; for (i = 0; i < cell->n_vertices; ++i) { isl_stat r; vertex = isl_vertex_alloc(isl_vertices_copy(cell->vertices), cell->ids[i]); if (!vertex) return isl_stat_error; r = fn(vertex, user); if (r < 0) return isl_stat_error; } return isl_stat_ok; } 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.4/isl/isl_val_private.h0000644000175000017500000000450512554427055013770 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); int isl_val_involves_dims(__isl_keep isl_val *v, enum isl_dim_type type, unsigned first, unsigned n); __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_space *isl_val_get_space(__isl_keep isl_val *v); __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_align_params(__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); __isl_give isl_val *isl_val_scale_down_val(__isl_take isl_val *v1, __isl_take isl_val *v2); __isl_give isl_val *isl_val_mod_val(__isl_take isl_val *v1, __isl_take isl_val *v2); int isl_val_plain_is_equal(__isl_keep isl_val *val1, __isl_keep isl_val *val2); int isl_val_matching_params(__isl_keep isl_val *v, __isl_keep isl_space *space); 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.4/isl/isl_id.c0000644000175000017500000001127212554427055012042 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; } uint32_t isl_id_get_hash(__isl_keep isl_id *id) { return id ? id->hash : 0; } 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; if (!id->name || !nu->name) return 0; 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 }; if (!ctx) return NULL; 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; } /* Compare two isl_ids. * * The order is fairly arbitrary. We do keep the comparison of * the user pointers as a last resort since these pointer values * may not be stable across different systems or even different runs. */ int isl_id_cmp(__isl_keep isl_id *id1, __isl_keep isl_id *id2) { if (id1 == id2) return 0; if (!id1) return -1; if (!id2) return 1; if (!id1->name != !id2->name) return !id1->name - !id2->name; if (id1->name) { int cmp = strcmp(id1->name, id2->name); if (cmp != 0) return cmp; } if (id1->user < id2->user) return -1; else return 1; } 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. */ __isl_null isl_id *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.4/isl/isl_int_imath.h0000644000175000017500000000567012413271702013422 00000000000000#ifndef ISL_INT_IMATH_H #define ISL_INT_IMATH_H #include "isl_hide_deprecated.h" #include /* isl_int is the basic integer type, implemented with imath's mp_int. */ typedef mp_int isl_int; #define isl_int_init(i) i = mp_int_alloc() #define isl_int_clear(i) mp_int_free(i) #define isl_int_set(r,i) impz_set(r,i) #define isl_int_set_si(r,i) impz_set_si(r,i) #define isl_int_set_ui(r,i) impz_set_ui(r,i) #define isl_int_fits_slong(r) isl_imath_fits_slong_p(r) #define isl_int_get_si(r) impz_get_si(r) #define isl_int_fits_ulong(r) isl_imath_fits_ulong_p(r) #define isl_int_get_ui(r) impz_get_ui(r) #define isl_int_get_d(r) impz_get_si(r) #define isl_int_get_str(r) impz_get_str(0, 10, r) #define isl_int_abs(r,i) impz_abs(r,i) #define isl_int_neg(r,i) impz_neg(r,i) #define isl_int_swap(i,j) impz_swap(i,j) #define isl_int_swap_or_set(i,j) impz_swap(i,j) #define isl_int_add_ui(r,i,j) impz_add_ui(r,i,j) #define isl_int_sub_ui(r,i,j) impz_sub_ui(r,i,j) #define isl_int_add(r,i,j) impz_add(r,i,j) #define isl_int_sub(r,i,j) impz_sub(r,i,j) #define isl_int_mul(r,i,j) impz_mul(r,i,j) #define isl_int_mul_2exp(r,i,j) impz_mul_2exp(r,i,j) #define isl_int_mul_si(r,i,j) mp_int_mul_value(i,j,r) #define isl_int_mul_ui(r,i,j) impz_mul_ui(r,i,j) #define isl_int_pow_ui(r,i,j) impz_pow_ui(r,i,j) #define isl_int_addmul(r,i,j) impz_addmul(r,i,j) #define isl_int_addmul_ui(r,i,j) isl_imath_addmul_ui(r,i,j) #define isl_int_submul(r,i,j) impz_submul(r,i,j) #define isl_int_submul_ui(r,i,j) isl_imath_submul_ui(r,i,j) #define isl_int_gcd(r,i,j) impz_gcd(r,i,j) #define isl_int_lcm(r,i,j) impz_lcm(r,i,j) #define isl_int_divexact(r,i,j) impz_divexact(r,i,j) #define isl_int_divexact_ui(r,i,j) impz_divexact_ui(r,i,j) #define isl_int_tdiv_q(r,i,j) impz_tdiv_q(r,i,j) #define isl_int_cdiv_q(r,i,j) impz_cdiv_q(r,i,j) #define isl_int_fdiv_q(r,i,j) impz_fdiv_q(r,i,j) #define isl_int_fdiv_r(r,i,j) impz_fdiv_r(r,i,j) #define isl_int_fdiv_q_ui(r,i,j) impz_fdiv_q_ui(r,i,j) #define isl_int_read(r,s) impz_set_str(r,s,10) #define isl_int_sgn(i) impz_sgn(i) #define isl_int_cmp(i,j) impz_cmp(i,j) #define isl_int_cmp_si(i,si) impz_cmp_si(i,si) #define isl_int_eq(i,j) (impz_cmp(i,j) == 0) #define isl_int_ne(i,j) (impz_cmp(i,j) != 0) #define isl_int_lt(i,j) (impz_cmp(i,j) < 0) #define isl_int_le(i,j) (impz_cmp(i,j) <= 0) #define isl_int_gt(i,j) (impz_cmp(i,j) > 0) #define isl_int_ge(i,j) (impz_cmp(i,j) >= 0) #define isl_int_abs_cmp(i,j) impz_cmpabs(i,j) #define isl_int_abs_eq(i,j) (impz_cmpabs(i,j) == 0) #define isl_int_abs_ne(i,j) (impz_cmpabs(i,j) != 0) #define isl_int_abs_lt(i,j) (impz_cmpabs(i,j) < 0) #define isl_int_abs_gt(i,j) (impz_cmpabs(i,j) > 0) #define isl_int_abs_ge(i,j) (impz_cmpabs(i,j) >= 0) #define isl_int_is_divisible_by(i,j) impz_divisible_p(i,j) uint32_t isl_imath_hash(mp_int v, uint32_t hash); #define isl_int_hash(v,h) isl_imath_hash(v,h) typedef void (*isl_int_print_mp_free_t)(void *, size_t); #define isl_int_free_str(s) free(s) #endif /* ISL_INT_IMATH_H */ cloog-0.18.4/isl/imath_wrap/0000755000175000017500000000000012555417256012646 500000000000000cloog-0.18.4/isl/imath_wrap/imath.h0000644000175000017500000000005612413271702014025 00000000000000#include "wrap.h" #include "../imath/imath.h" cloog-0.18.4/isl/imath_wrap/gmp_compat.h0000644000175000017500000000006312413271702015047 00000000000000#include "wrap.h" #include "../imath/gmp_compat.h" cloog-0.18.4/isl/imath_wrap/imath.c0000644000175000017500000000005612413271702014020 00000000000000#include "wrap.h" #include "../imath/imath.c" cloog-0.18.4/isl/imath_wrap/imrat.c0000644000175000017500000000005612413271702014032 00000000000000#include "wrap.h" #include "../imath/imrat.c" cloog-0.18.4/isl/imath_wrap/gmp_compat.c0000644000175000017500000000006312413271702015042 00000000000000#include "wrap.h" #include "../imath/gmp_compat.c" cloog-0.18.4/isl/imath_wrap/wrap.h0000644000175000017500000001506412413271702013701 00000000000000#ifndef ISL_IMATH_WRAP #define ISL_IMATH_WRAP #define MP_BADARG ISL_MP_BADARG #define MP_FALSE ISL_MP_FALSE #define MP_MEMORY ISL_MP_MEMORY #define MP_MINERR ISL_MP_MINERR #define MP_NEG ISL_MP_NEG #define MP_OK ISL_MP_OK #define MP_RANGE ISL_MP_RANGE #define MP_TRUE ISL_MP_TRUE #define MP_TRUNC ISL_MP_TRUNC #define MP_UNDEF ISL_MP_UNDEF #define MP_ZPOS ISL_MP_ZPOS #define impq_canonicalize isl_impq_canonicalize #define impq_clear isl_impq_clear #define impq_cmp isl_impq_cmp #define impq_denref isl_impq_denref #define impq_get_str isl_impq_get_str #define impq_init isl_impq_init #define impq_mul isl_impq_mul #define impq_numref isl_impq_numref #define impq_set isl_impq_set #define impq_set_str isl_impq_set_str #define impq_set_ui isl_impq_set_ui #define impq_sgn isl_impq_sgn #define impz_abs isl_impz_abs #define impz_add isl_impz_add #define impz_addmul isl_impz_addmul #define impz_add_ui isl_impz_add_ui #define impz_cdiv_q isl_impz_cdiv_q #define impz_clear isl_impz_clear #define impz_cmp isl_impz_cmp #define impz_cmpabs isl_impz_cmpabs #define impz_cmp_si isl_impz_cmp_si #define impz_divexact isl_impz_divexact #define impz_divexact_ui isl_impz_divexact_ui #define impz_divisible_p isl_impz_divisible_p #define impz_export isl_impz_export #define impz_fdiv_q isl_impz_fdiv_q #define impz_fdiv_q_ui isl_impz_fdiv_q_ui #define impz_fdiv_r isl_impz_fdiv_r #define impz_gcd isl_impz_gcd #define impz_get_si isl_impz_get_si #define impz_get_str isl_impz_get_str #define impz_get_ui isl_impz_get_ui #define impz_import isl_impz_import #define impz_init isl_impz_init #define impz_lcm isl_impz_lcm #define impz_mul isl_impz_mul #define impz_mul_2exp isl_impz_mul_2exp #define impz_mul_ui isl_impz_mul_ui #define impz_neg isl_impz_neg #define impz_pow_ui isl_impz_pow_ui #define impz_set isl_impz_set #define impz_set_si isl_impz_set_si #define impz_set_str isl_impz_set_str #define impz_set_ui isl_impz_set_ui #define impz_sgn isl_impz_sgn #define impz_sizeinbase isl_impz_sizeinbase #define impz_sub isl_impz_sub #define impz_submul isl_impz_submul #define impz_sub_ui isl_impz_sub_ui #define impz_swap isl_impz_swap #define impz_tdiv_q isl_impz_tdiv_q #define mp_error_string isl_mp_error_string #define mp_int_abs isl_mp_int_abs #define mp_int_add isl_mp_int_add #define mp_int_add_value isl_mp_int_add_value #define mp_int_alloc isl_mp_int_alloc #define mp_int_binary_len isl_mp_int_binary_len #define mp_int_clear isl_mp_int_clear #define mp_int_compare isl_mp_int_compare #define mp_int_compare_unsigned isl_mp_int_compare_unsigned #define mp_int_compare_uvalue isl_mp_int_compare_uvalue #define mp_int_compare_value isl_mp_int_compare_value #define mp_int_compare_zero isl_mp_int_compare_zero #define mp_int_copy isl_mp_int_copy #define mp_int_count_bits isl_mp_int_count_bits #define mp_int_div isl_mp_int_div #define mp_int_divisible_value isl_mp_int_divisible_value #define mp_int_div_pow2 isl_mp_int_div_pow2 #define mp_int_div_value isl_mp_int_div_value #define mp_int_egcd isl_mp_int_egcd #define mp_int_expt isl_mp_int_expt #define mp_int_expt_full isl_mp_int_expt_full #define mp_int_exptmod isl_mp_int_exptmod #define mp_int_exptmod_bvalue isl_mp_int_exptmod_bvalue #define mp_int_exptmod_evalue isl_mp_int_exptmod_evalue #define mp_int_exptmod_known isl_mp_int_exptmod_known #define mp_int_expt_value isl_mp_int_expt_value #define mp_int_free isl_mp_int_free #define mp_int_gcd isl_mp_int_gcd #define mp_int_init isl_mp_int_init #define mp_int_init_copy isl_mp_int_init_copy #define mp_int_init_size isl_mp_int_init_size #define mp_int_init_uvalue isl_mp_int_init_uvalue #define mp_int_init_value isl_mp_int_init_value #define mp_int_invmod isl_mp_int_invmod #define mp_int_is_pow2 isl_mp_int_is_pow2 #define mp_int_lcm isl_mp_int_lcm #define mp_int_mod isl_mp_int_mod #define mp_int_mul isl_mp_int_mul #define mp_int_mul_pow2 isl_mp_int_mul_pow2 #define mp_int_mul_value isl_mp_int_mul_value #define mp_int_neg isl_mp_int_neg #define mp_int_read_binary isl_mp_int_read_binary #define mp_int_read_cstring isl_mp_int_read_cstring #define mp_int_read_string isl_mp_int_read_string #define mp_int_read_unsigned isl_mp_int_read_unsigned #define mp_int_redux_const isl_mp_int_redux_const #define mp_int_root isl_mp_int_root #define mp_int_set_uvalue isl_mp_int_set_uvalue #define mp_int_set_value isl_mp_int_set_value #define mp_int_sqr isl_mp_int_sqr #define mp_int_string_len isl_mp_int_string_len #define mp_int_sub isl_mp_int_sub #define mp_int_sub_value isl_mp_int_sub_value #define mp_int_swap isl_mp_int_swap #define mp_int_to_binary isl_mp_int_to_binary #define mp_int_to_int isl_mp_int_to_int #define mp_int_to_string isl_mp_int_to_string #define mp_int_to_uint isl_mp_int_to_uint #define mp_int_to_unsigned isl_mp_int_to_unsigned #define mp_int_unsigned_len isl_mp_int_unsigned_len #define mp_int_zero isl_mp_int_zero #define mp_rat_abs isl_mp_rat_abs #define mp_rat_add isl_mp_rat_add #define mp_rat_add_int isl_mp_rat_add_int #define mp_rat_alloc isl_mp_rat_alloc #define mp_rat_clear isl_mp_rat_clear #define mp_rat_compare isl_mp_rat_compare #define mp_rat_compare_unsigned isl_mp_rat_compare_unsigned #define mp_rat_compare_value isl_mp_rat_compare_value #define mp_rat_compare_zero isl_mp_rat_compare_zero #define mp_rat_copy isl_mp_rat_copy #define mp_rat_decimal_len isl_mp_rat_decimal_len #define mp_rat_denom isl_mp_rat_denom #define mp_rat_denom_ref isl_mp_rat_denom_ref #define mp_rat_div isl_mp_rat_div #define mp_rat_div_int isl_mp_rat_div_int #define mp_rat_expt isl_mp_rat_expt #define mp_rat_free isl_mp_rat_free #define mp_rat_init isl_mp_rat_init #define mp_rat_init_copy isl_mp_rat_init_copy #define mp_rat_init_size isl_mp_rat_init_size #define mp_rat_is_integer isl_mp_rat_is_integer #define mp_rat_mul isl_mp_rat_mul #define mp_rat_mul_int isl_mp_rat_mul_int #define mp_rat_neg isl_mp_rat_neg #define mp_rat_numer isl_mp_rat_numer #define mp_rat_numer_ref isl_mp_rat_numer_ref #define mp_rat_read_cdecimal isl_mp_rat_read_cdecimal #define mp_rat_read_cstring isl_mp_rat_read_cstring #define mp_rat_read_decimal isl_mp_rat_read_decimal #define mp_rat_read_string isl_mp_rat_read_string #define mp_rat_read_ustring isl_mp_rat_read_ustring #define mp_rat_recip isl_mp_rat_recip #define mp_rat_reduce isl_mp_rat_reduce #define mp_rat_set_uvalue isl_mp_rat_set_uvalue #define mp_rat_set_value isl_mp_rat_set_value #define mp_rat_sign isl_mp_rat_sign #define mp_rat_string_len isl_mp_rat_string_len #define mp_rat_sub isl_mp_rat_sub #define mp_rat_sub_int isl_mp_rat_sub_int #define mp_rat_to_decimal isl_mp_rat_to_decimal #define mp_rat_to_ints isl_mp_rat_to_ints #define mp_rat_to_string isl_mp_rat_to_string #define mp_rat_zero isl_mp_rat_zero #endif cloog-0.18.4/isl/imath_wrap/imrat.h0000644000175000017500000000005612413271702014037 00000000000000#include "wrap.h" #include "../imath/imrat.h" cloog-0.18.4/isl/isl_map_subtract.c0000644000175000017500000005441512554427055014140 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 #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 isl_stat 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; isl_bool 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 ? isl_stat_error : isl_stat_ok; } 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 isl_stat_ok; 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 isl_stat_error; } /* 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(isl_basic_map_get_space(bmap)); if (basic_map_collect_diff(bmap, map, &sdc.dc) < 0) { isl_map_free(sdc.diff); sdc.diff = NULL; } return sdc.diff; } /* Return an empty map living in the same space as "map1" and "map2". */ static __isl_give isl_map *replace_pair_by_empty( __isl_take isl_map *map1, __isl_take isl_map *map2) { isl_space *space; space = isl_map_get_space(map1); isl_map_free(map1); isl_map_free(map2); return isl_map_empty(space); } /* 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)) * * If "map1" and "map2" are obviously equal to each other, * then return an empty map in the same space. * * If "map1" and "map2" are disjoint, then simply return "map1". */ static __isl_give isl_map *map_subtract( __isl_take isl_map *map1, __isl_take isl_map *map2) { int i; int equal, disjoint; struct isl_map *diff; if (!map1 || !map2) goto error; isl_assert(map1->ctx, isl_space_is_equal(map1->dim, map2->dim), goto error); equal = isl_map_plain_is_equal(map1, map2); if (equal < 0) goto error; if (equal) return replace_pair_by_empty(map1, map2); disjoint = isl_map_is_disjoint(map1, map2); if (disjoint < 0) goto error; if (disjoint) { 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(isl_map_get_space(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; isl_bool 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 isl_bool basic_map_diff_is_empty(__isl_keep isl_basic_map *bmap, __isl_keep isl_map *map) { isl_bool empty; isl_stat r; struct isl_is_empty_diff_collector edc; empty = isl_basic_map_plain_is_empty(bmap); if (empty) return empty; edc.dc.add = &basic_map_is_empty_add; edc.empty = isl_bool_true; r = basic_map_collect_diff(isl_basic_map_copy(bmap), isl_map_copy(map), &edc.dc); if (!edc.empty) return isl_bool_false; return r < 0 ? isl_bool_error : isl_bool_true; } /* Check if map1 \ map2 is empty by checking if the set difference is empty * for each of the basic maps in map1. */ static isl_bool map_diff_is_empty(__isl_keep isl_map *map1, __isl_keep isl_map *map2) { int i; isl_bool is_empty = isl_bool_true; if (!map1 || !map2) return isl_bool_error; 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 isl_bool_true if 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 isl_bool map_is_singleton_subset(__isl_keep isl_map *map1, __isl_keep isl_map *map2) { int i; isl_bool is_subset = isl_bool_false; struct isl_point *point; if (!map1 || !map2) return isl_bool_error; if (map1->n != 1) isl_die(isl_map_get_ctx(map1), isl_error_invalid, "expecting single-disjunct input", return isl_bool_error); point = singleton_extract_point(map1->p[0]); if (!point) return isl_bool_error; 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 isl_bool map_is_subset(__isl_keep isl_map *map1, __isl_keep isl_map *map2) { isl_bool is_subset = isl_bool_false; isl_bool empty; int rat1, rat2; if (!map1 || !map2) return isl_bool_error; if (!isl_map_has_equal_space(map1, map2)) return isl_bool_false; empty = isl_map_is_empty(map1); if (empty < 0) return isl_bool_error; if (empty) return isl_bool_true; empty = isl_map_is_empty(map2); if (empty < 0) return isl_bool_error; if (empty) return isl_bool_false; rat1 = isl_map_has_rational(map1); rat2 = isl_map_has_rational(map2); if (rat1 < 0 || rat2 < 0) return isl_bool_error; if (rat1 && !rat2) return isl_bool_false; if (isl_map_plain_is_universe(map2)) return isl_bool_true; 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; } isl_bool 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); } isl_bool isl_set_is_subset(__isl_keep isl_set *set1, __isl_keep 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.4/isl/pip.c0000644000175000017500000002255312554427055011373 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 #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 isl_stat 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 ? isl_stat_ok : isl_stat_error; } 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.4/isl/isl_tarjan.h0000644000175000017500000000215212554427055012727 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, isl_bool (*follows)(int i, int j, void *user), void *user); void isl_tarjan_graph_free(struct isl_tarjan_graph *g); #endif cloog-0.18.4/isl/isl_vertices_private.h0000644000175000017500000000255412413256472015031 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.4/isl/isl_imath.h0000644000175000017500000000046612413271702012546 00000000000000#include #include uint32_t isl_imath_hash(mp_int v, uint32_t hash); int isl_imath_fits_ulong_p(mp_int op); int isl_imath_fits_slong_p(mp_int op); void isl_imath_addmul_ui(mp_int rop, mp_int op1, unsigned long op2); void isl_imath_submul_ui(mp_int rop, mp_int op1, unsigned long op2); cloog-0.18.4/isl/isl_ast_codegen.c0000644000175000017500000053207212554427055013727 00000000000000/* * Copyright 2012-2014 Ecole Normale Superieure * Copyright 2014 INRIA Rocquencourt * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, * Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt, * B.P. 105 - 78153 Le Chesnay, France */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include /* 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 isl_stat 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 isl_stat_ok; } /* 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" and add it to data->list. * * 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 * some of the constraints of data->build->domain. In particular, * we intersect with a single-disjunct approximation of this set. * We perform this approximation to avoid further splitting up * the executed relation, possibly introducing a disjunctive guard * on the statement. * * 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". * * At this stage, any pending constraints in the build can no longer * be simplified with respect to any enforced constraints since * the call node does not have any enforced constraints. * We therefore turn all pending constraints into guards * (after simplifying them with respect to the already generated * constraints) and add them to both the generated constraints * and the guard of the constructed graft. This guard will ensure * that the constraints are effectively generated. * * If the user has set an at_each_domain callback, it is called * on the constructed call expression node. */ static isl_stat generate_domain(__isl_take isl_map *executed, void *user) { struct isl_generate_domain_data *data = user; isl_ast_build *build; isl_ast_graft *graft; isl_ast_graft_list *list; isl_set *guard, *domain; isl_map *map = NULL; int empty, sv; domain = isl_ast_build_get_domain(data->build); domain = isl_set_from_basic_set(isl_set_simple_hull(domain)); executed = isl_map_intersect_domain(executed, domain); empty = isl_map_is_empty(executed); if (empty < 0) goto error; if (empty) { isl_map_free(executed); return isl_stat_ok; } 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_compute_divs(guard); guard = isl_set_intersect(guard, isl_ast_build_get_pending(data->build)); guard = isl_set_coalesce(guard); guard = isl_ast_build_specialize(data->build, guard); guard = isl_set_gist(guard, isl_ast_build_get_generated(data->build)); build = isl_ast_build_copy(data->build); build = isl_ast_build_replace_pending_by_guard(build, isl_set_copy(guard)); graft = isl_ast_graft_alloc_domain(map, build); graft = at_each_domain(graft, executed, build); isl_ast_build_free(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 isl_stat_ok; error: isl_map_free(map); isl_map_free(executed); return isl_stat_error; } /* 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. * * Since the node itself cannot enforce any constraints, we turn * all pending constraints into guards and add them to the resulting * graft to ensure that they will be generated. * * 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_set *guard; isl_ast_node *node; isl_ast_graft *graft; isl_ast_build *user_build; guard = isl_ast_build_get_pending(build); user_build = isl_ast_build_copy(build); user_build = isl_ast_build_replace_pending_by_guard(user_build, isl_set_copy(guard)); 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); graft = isl_ast_graft_add_guard(graft, guard, build); isl_ast_build_free(build); return isl_ast_graft_list_from_ast_graft(graft); } static __isl_give isl_ast_graft_list *build_ast_from_child( __isl_take isl_ast_build *build, __isl_take isl_schedule_node *node, __isl_take isl_union_map *executed); /* Generate an AST after having handled the complete schedule * of this call to the code generator or the complete band * if we are generating an AST from a schedule tree. * * If we are inside a band node, then move on to the child of the band. * * 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 (isl_ast_build_has_schedule_node(build)) { isl_schedule_node *node; node = isl_ast_build_get_schedule_node(build); build = isl_ast_build_reset_schedule_node(build); return build_ast_from_child(build, node, executed); } 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_take 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; } /* Callback for sorting the isl_pw_aff_list passed to reduce_list and * remove_redundant_lower_bounds. */ static int reduce_list_cmp(__isl_keep isl_pw_aff *a, __isl_keep isl_pw_aff *b, void *user) { return isl_pw_aff_plain_cmp(a, b); } /* Given a list of lower bounds "list", remove those that are redundant * with respect to the other bounds in "list" and the domain of "build". * * We first sort the bounds in the same way as they would be sorted * by set_for_node_expressions so that we can try and remove the last * bounds first. * * For a lower bound to be effective, there needs to be at least * one domain element for which it is larger than all other lower bounds. * For each lower bound we therefore intersect the domain with * the conditions that it is larger than all other bounds and * check whether the result is empty. If so, the bound can be removed. */ static __isl_give isl_pw_aff_list *remove_redundant_lower_bounds( __isl_take isl_pw_aff_list *list, __isl_keep isl_ast_build *build) { int i, j, n; isl_set *domain; list = isl_pw_aff_list_sort(list, &reduce_list_cmp, NULL); if (!list) return NULL; n = isl_pw_aff_list_n_pw_aff(list); if (n <= 1) return list; domain = isl_ast_build_get_domain(build); for (i = n - 1; i >= 0; --i) { isl_pw_aff *pa_i; isl_set *domain_i; int empty; domain_i = isl_set_copy(domain); pa_i = isl_pw_aff_list_get_pw_aff(list, i); for (j = 0; j < n; ++j) { isl_pw_aff *pa_j; isl_set *better; if (j == i) continue; pa_j = isl_pw_aff_list_get_pw_aff(list, j); better = isl_pw_aff_gt_set(isl_pw_aff_copy(pa_i), pa_j); domain_i = isl_set_intersect(domain_i, better); } empty = isl_set_is_empty(domain_i); isl_set_free(domain_i); isl_pw_aff_free(pa_i); if (empty < 0) goto error; if (!empty) continue; list = isl_pw_aff_list_drop(list, i, 1); n--; } isl_set_free(domain); return list; error: isl_set_free(domain); return isl_pw_aff_list_free(list); } /* 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. * * If the current dimension is strided, then the lower bound * is adjusted by lower_bound to match the stride information. * This modification may make one or more lower bounds redundant * with respect to the other lower bounds. We therefore check * for this condition and remove the redundant lower bounds. */ 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)); } if (isl_ast_build_has_stride(build, pos)) list = remove_redundant_lower_bounds(list, build); 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. * If the list contains more than one element, then we sort it * using a fairly abitrary but hopefully reasonably stable order. */ 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; list = isl_pw_aff_list_copy(list); list = isl_pw_aff_list_sort(list, &reduce_list_cmp, NULL); if (!list) return isl_ast_expr_free(expr); 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) goto error; expr->u.op.args[i] = expr_i; } isl_pw_aff_list_free(list); return expr; error: isl_pw_aff_list_free(list); isl_ast_expr_free(expr); return NULL; } /* Add guards implied by the "generated constraints", * but not (necessarily) enforced by the generated AST to "guard". * In particular, if there is any stride constraints, * then add the guard implied by those constraints. * If we have generated a degenerate loop, then add the guard * implied by "bounds" on the outer dimensions, i.e., the guard * that ensures that the single value actually exists. * Since there may also be guards implied by a combination * of these constraints, we first combine them before * deriving the implied constraints. */ static __isl_give isl_set *add_implied_guards(__isl_take isl_set *guard, int degenerate, __isl_keep isl_basic_set *bounds, __isl_keep isl_ast_build *build) { int depth, has_stride; isl_space *space; isl_set *dom, *set; depth = isl_ast_build_get_depth(build); has_stride = isl_ast_build_has_stride(build, depth); if (!has_stride && !degenerate) return guard; space = isl_basic_set_get_space(bounds); dom = isl_set_universe(space); if (degenerate) { bounds = isl_basic_set_copy(bounds); bounds = isl_basic_set_drop_constraints_not_involving_dims( bounds, isl_dim_set, depth, 1); set = isl_set_from_basic_set(bounds); dom = isl_set_intersect(dom, set); } if (has_stride) { set = isl_ast_build_get_stride_constraint(build); dom = isl_set_intersect(dom, set); } dom = isl_set_eliminate(dom, isl_dim_set, depth, 1); dom = isl_ast_build_compute_gist(build, dom); guard = isl_set_intersect(guard, dom); return guard; } /* Update "graft" based on "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 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. */ static __isl_give isl_ast_graft *refine_degenerate( __isl_take isl_ast_graft *graft, __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); 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 isl_stat 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 ? isl_stat_ok : isl_stat_error; } /* Does "pa" have a negative constant term over its entire domain? */ static isl_stat pw_aff_constant_is_negative(__isl_take isl_pw_aff *pa, void *user) { isl_stat r; int *neg = user; r = isl_pw_aff_foreach_piece(pa, &aff_constant_is_negative, user); isl_pw_aff_free(pa); return (*neg && r >= 0) ? isl_stat_ok : isl_stat_error; } /* 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_internal(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 * - 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); 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 isl_stat 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 isl_stat_ok; } /* 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. Only the constraints that involve the iterator * are relevant here. The other constraints are taken care of by * the caller and are included in the generated constraints of "build". * "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. */ 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) { 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_drop(list, 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); return refine_generic_bounds(graft, lower, upper, domain, build); } /* 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); list = isl_basic_set_get_constraint_list(bounds); graft = refine_generic_split(graft, list, domain, 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; } /* If the ast_build_exploit_nested_bounds option is set, then return * the constraints enforced by all elements in "list". * Otherwise, return the universe. */ static __isl_give isl_basic_set *extract_shared_enforced( __isl_keep isl_ast_graft_list *list, __isl_keep isl_ast_build *build) { isl_ctx *ctx; isl_space *space; if (!list) return NULL; ctx = isl_ast_graft_list_get_ctx(list); if (isl_options_get_ast_build_exploit_nested_bounds(ctx)) return isl_ast_graft_list_extract_shared_enforced(list, build); space = isl_ast_build_get_space(build, 1); return isl_basic_set_universe(space); } /* Return the pending constraints of "build" that are not already taken * care of (by a combination of "enforced" and the generated constraints * of "build"). */ static __isl_give isl_set *extract_pending(__isl_keep isl_ast_build *build, __isl_keep isl_basic_set *enforced) { isl_set *guard, *context; guard = isl_ast_build_get_pending(build); context = isl_set_from_basic_set(isl_basic_set_copy(enforced)); context = isl_set_intersect(context, isl_ast_build_get_generated(build)); return isl_set_gist(guard, context); } /* 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 adds the stride information and * 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 levels 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). * Before creating a graft for the current level, we first extract * hoistable constraints from the child guards and combine them * with the pending constraints in the build. These constraints * are used to simplify the child guards and then added to the guard * of the current graft to ensure that they will be generated. * If the hoisted guard is a disjunction, then we use it directly * to gist the guards on the children before intersect it with the * pending constraints. We do so because this disjunction is typically * identical to the guards on the children such that these guards * can be effectively removed completely. After the intersection, * the gist operation would have a harder time figuring this out. * * Finally, we set the bounds of the for loop in either * refine_degenerate or refine_generic. * We do so in a context where the pending constraints of the build * have been replaced by the guard of the current graft. */ 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_basic_set *enforced; isl_set *guard, *hoisted; 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_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)); enforced = extract_shared_enforced(children, build); guard = extract_pending(sub_build, enforced); hoisted = isl_ast_graft_list_extract_hoistable_guard(children, build); if (isl_set_n_basic_set(hoisted) > 1) children = isl_ast_graft_list_gist_guards(children, isl_set_copy(hoisted)); guard = isl_set_intersect(guard, hoisted); if (!eliminated) guard = add_implied_guards(guard, degenerate, bounds, build); graft = isl_ast_graft_alloc_from_children(children, isl_set_copy(guard), enforced, build, sub_build); if (!degenerate) bounds = isl_ast_build_compute_gist_basic_set(build, bounds); if (!eliminated) { isl_ast_build *for_build; graft = isl_ast_graft_insert_for(graft, node); for_build = isl_ast_build_copy(build); for_build = isl_ast_build_replace_pending_by_guard(for_build, isl_set_copy(guard)); if (degenerate) graft = refine_degenerate(graft, for_build, sub_build); else graft = refine_generic(graft, bounds, domain, for_build); isl_ast_build_free(for_build); } isl_set_free(guard); 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 isl_stat 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 isl_stat_ok; } 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 ? isl_stat_error : isl_stat_ok; } /* 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 isl_stat basic_map_check_scaled(__isl_take isl_basic_map *bmap, void *user) { isl_stat 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 isl_stat map_check_scaled(__isl_take isl_map *map, void *user) { isl_stat 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 (obviously) * 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 isl_stat 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 isl_stat_ok; } /* 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 here and check if the bounds do not * conflict with the current build domain * 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, disjoint; 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_specialize(build, domain); domain = isl_set_compute_divs(domain); domain = isl_ast_build_eliminate_inner(build, domain); disjoint = isl_set_is_disjoint(domain, build->domain); if (disjoint < 0) goto error; if (disjoint) goto done; 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 isl_bool 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; isl_bool 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 ? isl_bool_error : !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; if (!list) bset = isl_basic_set_free(bset); 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". * * While the elements in "scc" should be disjoint, we double-check * this property to avoid running into an infinite recursion in case * they intersect due to some internal error. */ static isl_stat 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, *first; 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 ? isl_stat_ok : isl_stat_error; } 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); first = isl_basic_set_copy(bset); list = isl_basic_set_list_from_basic_set(bset); for (i = 1; i < n; ++i) { int disjoint; bset = isl_basic_set_list_get_basic_set(scc, i); disjoint = isl_basic_set_is_disjoint(bset, first); if (disjoint < 0) list = isl_basic_set_list_free(list); else if (!disjoint) isl_die(isl_basic_set_list_get_ctx(scc), isl_error_internal, "basic sets in scc are assumed to be disjoint", list = isl_basic_set_list_free(list)); list = add_split_on(list, bset, gt); } isl_basic_set_free(first); 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 ? isl_stat_ok : isl_stat_error; } /* 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 isl_bool shared_outer(__isl_keep isl_basic_set *i, __isl_keep isl_basic_set *j, void *user) { int depth = *(int *) user; isl_basic_map *test; isl_bool 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 ? isl_bool_error : !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 isl_stat 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 isl_stat_error; return isl_stat_ok; } /* 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 isl_stat 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 isl_stat_ok; } /* 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. * * "build" is the build in which the unrolling will be performed * "domain" is the original set for which to find a lower bound * "depth" is the dimension for which to find a lower boudn * "expansion" is the expansion that needs to be applied to "domain" * in the unrolling that will be performed * * "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. * "n_div" is the maximal number of integer divisions in the first * unrolled iteration (after expansion). It is set to -1 if it hasn't * been computed yet. */ struct isl_find_unroll_data { isl_ast_build *build; isl_set *domain; int depth; isl_basic_map *expansion; isl_aff *lower; int *n; int n_div; }; /* 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); } /* Update *user to the number of integer divsions in the first element * of "ma", if it is larger than the current value. */ static isl_stat update_n_div(__isl_take isl_set *set, __isl_take isl_multi_aff *ma, void *user) { isl_aff *aff; int *n = user; int n_div; aff = isl_multi_aff_get_aff(ma, 0); n_div = isl_aff_dim(aff, isl_dim_div); isl_aff_free(aff); isl_multi_aff_free(ma); isl_set_free(set); if (n_div > *n) *n = n_div; return aff ? isl_stat_ok : isl_stat_error; } /* Get the number of integer divisions in the expression for the iterator * value at the first slice in the unrolling based on lower bound "lower", * taking into account the expansion that needs to be performed on this slice. */ static int get_expanded_n_div(struct isl_find_unroll_data *data, __isl_keep isl_aff *lower) { isl_constraint *c; isl_set *set; isl_map *it_map, *expansion; isl_pw_multi_aff *pma; int n; c = at_offset(data->depth, lower, 0); set = isl_set_copy(data->domain); set = isl_set_add_constraint(set, c); expansion = isl_map_from_basic_map(isl_basic_map_copy(data->expansion)); set = isl_set_apply(set, expansion); it_map = isl_ast_build_map_to_iterator(data->build, set); pma = isl_pw_multi_aff_from_map(it_map); n = 0; if (isl_pw_multi_aff_foreach_piece(pma, &update_n_div, &n) < 0) n = -1; isl_pw_multi_aff_free(pma); return n; } /* Is the lower bound "lower" with corresponding iteration count "n" * better than the one stored in "data"? * If there is no upper bound on the iteration count ("n" is infinity) or * if the count is too large, then we cannot use this lower bound. * Otherwise, if there was no previous lower bound or * if the iteration count of the new lower bound is smaller than * the iteration count of the previous lower bound, then we consider * the new lower bound to be better. * If the iteration count is the same, then compare the number * of integer divisions that would be needed to express * the iterator value at the first slice in the unrolling * according to the lower bound. If we end up computing this * number, then store the lowest value in data->n_div. */ static int is_better_lower_bound(struct isl_find_unroll_data *data, __isl_keep isl_aff *lower, __isl_keep isl_val *n) { int cmp; int n_div; if (!n) return -1; if (isl_val_is_infty(n)) return 0; if (isl_val_cmp_si(n, INT_MAX) > 0) return 0; if (!data->lower) return 1; cmp = isl_val_cmp_si(n, *data->n); if (cmp < 0) return 1; if (cmp > 0) return 0; if (data->n_div < 0) data->n_div = get_expanded_n_div(data, data->lower); if (data->n_div < 0) return -1; if (data->n_div == 0) return 0; n_div = get_expanded_n_div(data, lower); if (n_div < 0) return -1; if (n_div >= data->n_div) return 0; data->n_div = n_div; return 1; } /* 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 or fewer integer divisions) * than the previously found lower bounds. */ static isl_stat update_unrolling_lower_bound(struct isl_find_unroll_data *data, __isl_keep isl_constraint *c) { isl_aff *aff, *lower; isl_val *max; int better; if (!isl_constraint_is_lower_bound(c, isl_dim_set, data->depth)) return isl_stat_ok; 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); better = is_better_lower_bound(data, lower, max); if (better < 0 || !better) { isl_val_free(max); isl_aff_free(lower); return better < 0 ? isl_stat_error : isl_stat_ok; } isl_aff_free(data->lower); data->lower = lower; *data->n = isl_val_get_num_si(max); isl_val_free(max); return isl_stat_ok; } /* Check if we can use "c" as a lower bound and if it is better than * any previously found lower bound. */ static isl_stat constraint_find_unroll(__isl_take isl_constraint *c, void *user) { struct isl_find_unroll_data *data; isl_stat 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. * "build" is the build in which the unrolling will be performed. * "expansion" is the expansion that needs to be applied to "domain" * in the unrolling that will be performed. * * 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_ast_build *build, __isl_keep isl_set *domain, int depth, __isl_keep isl_basic_map *expansion, int *n) { struct isl_find_unroll_data data = { build, domain, depth, expansion, NULL, n, -1 }; 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); } /* Call "fn" on each iteration of the current dimension of "domain". * If "init" is not NULL, then it is called with the number of * iterations before any call to "fn". * Return -1 on failure. * * 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 call "fn". */ static int foreach_iteration(__isl_take isl_set *domain, __isl_keep isl_ast_build *build, int (*init)(int n, void *user), int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user) { int i, n; int depth; isl_multi_aff *expansion; isl_basic_map *bmap; isl_aff *lower; isl_ast_build *stride_build; depth = isl_ast_build_get_depth(build); domain = isl_ast_build_eliminate_inner(build, domain); domain = isl_set_intersect(domain, isl_ast_build_get_domain(build)); stride_build = isl_ast_build_copy(build); stride_build = isl_ast_build_detect_strides(stride_build, isl_set_copy(domain)); expansion = isl_ast_build_get_stride_expansion(stride_build); domain = isl_set_preimage_multi_aff(domain, isl_multi_aff_copy(expansion)); domain = isl_ast_build_eliminate_divs(stride_build, domain); isl_ast_build_free(stride_build); bmap = isl_basic_map_from_multi_aff(expansion); lower = find_unroll_lower_bound(build, domain, depth, bmap, &n); if (!lower) n = -1; else if (init && init(n, user) < 0) n = -1; for (i = 0; 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)); if (fn(bset, user) < 0) break; } isl_aff_free(lower); isl_set_free(domain); isl_basic_map_free(bmap); return n < 0 || i < n ? -1 : 0; } /* 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. */ struct isl_codegen_domains { isl_basic_set_list *list; isl_union_map *executed; isl_ast_build *build; isl_set *schedule_domain; isl_set *option[4]; isl_map *sep_class; isl_set *done; }; /* Internal data structure for do_unroll. * * "domains" stores the results of compute_domains. * "class_domain" is the original class domain passed to do_unroll. * "unroll_domain" collects the unrolled iterations. */ struct isl_ast_unroll_data { struct isl_codegen_domains *domains; isl_set *class_domain; isl_set *unroll_domain; }; /* Given an iteration of an unrolled domain represented by "bset", * add it to data->domains->list. * Since we may have dropped some constraints, we intersect with * the class domain again to ensure that each element in the list * is disjoint from the other class domains. */ static int do_unroll_iteration(__isl_take isl_basic_set *bset, void *user) { struct isl_ast_unroll_data *data = user; isl_set *set; isl_basic_set_list *list; set = isl_set_from_basic_set(bset); data->unroll_domain = isl_set_union(data->unroll_domain, isl_set_copy(set)); set = isl_set_intersect(set, isl_set_copy(data->class_domain)); set = isl_set_make_disjoint(set); list = isl_basic_set_list_from_set(set); data->domains->list = isl_basic_set_list_concat(data->domains->list, list); return 0; } /* Extend domains->list with a list of basic sets, one for each value * of the current dimension in "domain" and remove the corresponding * sets from the class domain. Return the updated class domain. * The divs that involve the current dimension have not been projected out * from this domain. * * We call foreach_iteration to iterate over the individual values and * in do_unroll_iteration we collect the individual basic sets in * domains->list and their union in data->unroll_domain, which is then * used to update the class domain. */ static __isl_give isl_set *do_unroll(struct isl_codegen_domains *domains, __isl_take isl_set *domain, __isl_take isl_set *class_domain) { struct isl_ast_unroll_data data; if (!domain) return isl_set_free(class_domain); if (!class_domain) return isl_set_free(domain); data.domains = domains; data.class_domain = class_domain; data.unroll_domain = isl_set_empty(isl_set_get_space(domain)); if (foreach_iteration(domain, domains->build, NULL, &do_unroll_iteration, &data) < 0) data.unroll_domain = isl_set_free(data.unroll_domain); class_domain = isl_set_subtract(class_domain, data.unroll_domain); return class_domain; } /* 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. * Remove the corresponding sets from the class domain and * return the updated class 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 __isl_give isl_set *compute_unroll_domains( struct isl_codegen_domains *domains, __isl_take isl_set *class_domain) { isl_set *unroll_domain; isl_basic_set_list *unroll_list; int i, n; int empty; empty = isl_set_is_empty(domains->option[isl_ast_loop_unroll]); if (empty < 0) return isl_set_free(class_domain); if (empty) return class_domain; unroll_domain = isl_set_copy(domains->option[isl_ast_loop_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; 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(class_domain)); unroll_domain = isl_set_intersect(unroll_domain, isl_set_copy(domains->schedule_domain)); empty = isl_set_is_empty(unroll_domain); if (empty >= 0 && empty) { isl_set_free(unroll_domain); continue; } class_domain = do_unroll(domains, unroll_domain, class_domain); } isl_basic_set_list_free(unroll_list); return class_domain; } /* 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 remove them * from class_domain. Return the updated class domain. * * 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 __isl_give isl_set *compute_atomic_domain( struct isl_codegen_domains *domains, __isl_take isl_set *class_domain) { isl_basic_set *bset; isl_basic_set_list *list; isl_set *domain, *atomic_domain; int empty; domain = isl_set_copy(domains->option[isl_ast_loop_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) class_domain = isl_set_free(class_domain); if (empty) { isl_set_free(domain); return class_domain; } 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); atomic_domain = isl_set_copy(domain); domain = isl_set_intersect(domain, isl_set_copy(class_domain)); class_domain = isl_set_subtract(class_domain, atomic_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 class_domain; } /* 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[isl_ast_loop_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 removed from class_domain by * compute_atomic_domain. It is computed first so that the extended domain * would not overlap with any domains computed before. * Similary, the unrolled domains may have some constraints removed and * may therefore also be larger than specified by the user. * * 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 isl_stat 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)); class_domain = compute_atomic_domain(domains, class_domain); class_domain = compute_unroll_domains(domains, class_domain); domain = isl_set_copy(class_domain); if (compute_separate_domain(domains, domain) < 0) goto error; domain = isl_set_subtract(domain, isl_set_copy(domains->option[isl_ast_loop_separate])); domain = isl_set_intersect(domain, isl_set_copy(domains->schedule_domain)); 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 isl_stat_ok; error: isl_set_free(domain); isl_set_free(class_domain); return isl_stat_error; } /* 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 isl_stat 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 isl_stat_error; if (disjoint) { isl_set_free(domain); return isl_stat_ok; } 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[4], __isl_keep isl_ast_build *build) { enum isl_ast_loop_type type, type2; isl_set *unroll; for (type = isl_ast_loop_atomic; type <= isl_ast_loop_separate; ++type) { option[type] = isl_ast_build_get_option_domain(build, type); for (type2 = isl_ast_loop_atomic; type2 < type; ++type2) option[type] = isl_set_subtract(option[type], isl_set_copy(option[type2])); } unroll = option[isl_ast_loop_unroll]; unroll = isl_set_coalesce(unroll); unroll = isl_set_make_disjoint(unroll); option[isl_ast_loop_unroll] = 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_loop_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 = isl_ast_loop_atomic; type <= isl_ast_loop_separate; ++type) isl_set_free(domains.option[type]); return domains.list; } /* Generate code for a single component, after shifting (if any) * has been applied, in case the schedule was specified as a union map. * * 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_flat( __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; } /* Generate code for a single component, after shifting (if any) * has been applied, in case the schedule was specified as a schedule tree * and the separate option was specified. * * We perform separation on the domain of "executed" and then generate * an AST for each of the resulting disjoint basic sets. */ static __isl_give isl_ast_graft_list *generate_shifted_component_tree_separate( __isl_take isl_union_map *executed, __isl_take isl_ast_build *build) { isl_space *space; isl_set *domain; isl_basic_set_list *domain_list; isl_ast_graft_list *list; space = isl_ast_build_get_space(build, 1); domain = separate_schedule_domains(space, isl_union_map_copy(executed), build); domain_list = isl_basic_set_list_from_set(domain); 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; } /* Internal data structure for generate_shifted_component_tree_unroll. * * "executed" and "build" are inputs to generate_shifted_component_tree_unroll. * "list" collects the constructs grafts. */ struct isl_ast_unroll_tree_data { isl_union_map *executed; isl_ast_build *build; isl_ast_graft_list *list; }; /* Initialize data->list to a list of "n" elements. */ static int init_unroll_tree(int n, void *user) { struct isl_ast_unroll_tree_data *data = user; isl_ctx *ctx; ctx = isl_ast_build_get_ctx(data->build); data->list = isl_ast_graft_list_alloc(ctx, n); return 0; } /* Given an iteration of an unrolled domain represented by "bset", * generate the corresponding AST and add the result to data->list. */ static int do_unroll_tree_iteration(__isl_take isl_basic_set *bset, void *user) { struct isl_ast_unroll_tree_data *data = user; data->list = add_node(data->list, isl_union_map_copy(data->executed), bset, isl_ast_build_copy(data->build)); return 0; } /* Generate code for a single component, after shifting (if any) * has been applied, in case the schedule was specified as a schedule tree * and the unroll option was specified. * * We call foreach_iteration to iterate over the individual values and * construct and collect the corresponding grafts in do_unroll_tree_iteration. */ static __isl_give isl_ast_graft_list *generate_shifted_component_tree_unroll( __isl_take isl_union_map *executed, __isl_take isl_set *domain, __isl_take isl_ast_build *build) { struct isl_ast_unroll_tree_data data = { executed, build, NULL }; if (foreach_iteration(domain, build, &init_unroll_tree, &do_unroll_tree_iteration, &data) < 0) data.list = isl_ast_graft_list_free(data.list); isl_union_map_free(executed); isl_ast_build_free(build); return data.list; } /* Generate code for a single component, after shifting (if any) * has been applied, in case the schedule was specified as a schedule tree. * In particular, handle the base case where there is either no isolated * set or we are within the isolated set (in which case "isolated" is set) * or the iterations that precede or follow the isolated set. * * The schedule domain is broken up or combined into basic sets * according to the AST generation option specified in the current * schedule node, which may be either atomic, separate, unroll or * unspecified. If the option is unspecified, then we currently simply * split the schedule domain into disjoint basic sets. * * In case the separate option is specified, the AST generation is * handled by generate_shifted_component_tree_separate. * In the other cases, we need the global schedule domain. * In the unroll case, the AST generation is then handled by * generate_shifted_component_tree_unroll which needs the actual * schedule domain (with divs that may refer to the current dimension) * so that stride detection can be performed. * In the atomic or unspecified case, inner dimensions and divs involving * the current dimensions should be eliminated. * The result is then either combined into a single basic set or * split up into disjoint basic sets. * Finally an AST is generated for each basic set and the results are * concatenated. */ static __isl_give isl_ast_graft_list *generate_shifted_component_tree_base( __isl_take isl_union_map *executed, __isl_take isl_ast_build *build, int isolated) { isl_union_set *schedule_domain; isl_set *domain; isl_basic_set_list *domain_list; isl_ast_graft_list *list; enum isl_ast_loop_type type; type = isl_ast_build_get_loop_type(build, isolated); if (type < 0) goto error; if (type == isl_ast_loop_separate) return generate_shifted_component_tree_separate(executed, build); schedule_domain = isl_union_map_domain(isl_union_map_copy(executed)); domain = isl_set_from_union_set(schedule_domain); if (type == isl_ast_loop_unroll) return generate_shifted_component_tree_unroll(executed, domain, build); domain = isl_ast_build_eliminate(build, domain); domain = isl_set_coalesce(domain); if (type == isl_ast_loop_atomic) { isl_basic_set *hull; hull = isl_set_unshifted_simple_hull(domain); domain_list = isl_basic_set_list_from_basic_set(hull); } else { domain = isl_set_make_disjoint(domain); domain_list = isl_basic_set_list_from_set(domain); } 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; error: isl_union_map_free(executed); isl_ast_build_free(build); return NULL; } /* Generate code for a single component, after shifting (if any) * has been applied, in case the schedule was specified as a schedule tree. * In particular, do so for the specified subset of the schedule domain. */ static __isl_give isl_ast_graft_list *generate_shifted_component_tree_part( __isl_keep isl_union_map *executed, __isl_take isl_set *domain, __isl_keep isl_ast_build *build, int isolated) { isl_union_set *uset; int empty; uset = isl_union_set_from_set(domain); executed = isl_union_map_copy(executed); executed = isl_union_map_intersect_domain(executed, uset); empty = isl_union_map_is_empty(executed); if (empty < 0) goto error; if (empty) { isl_ctx *ctx; isl_union_map_free(executed); ctx = isl_ast_build_get_ctx(build); return isl_ast_graft_list_alloc(ctx, 0); } build = isl_ast_build_copy(build); return generate_shifted_component_tree_base(executed, build, isolated); error: isl_union_map_free(executed); return NULL; } /* Generate code for a single component, after shifting (if any) * has been applied, in case the schedule was specified as a schedule tree. * * We first check if the user has specified an isolated schedule domain * and that we are not already outside of this isolated schedule domain. * If so, we break up the schedule domain into iterations that * precede the isolated domain, the isolated domain itself, * the iterations that follow the isolated domain and * the remaining iterations (those that are incomparable * to the isolated domain). * We generate an AST for each piece and concatenate the results. * If no isolated set has been specified, then we generate an * AST for the entire inverse schedule. */ static __isl_give isl_ast_graft_list *generate_shifted_component_tree( __isl_take isl_union_map *executed, __isl_take isl_ast_build *build) { int i, depth; int empty, has_isolate; isl_space *space; isl_union_set *schedule_domain; isl_set *domain; isl_basic_set *hull; isl_set *isolated, *before, *after, *test; isl_map *gt, *lt; isl_ast_graft_list *list, *res; build = isl_ast_build_extract_isolated(build); has_isolate = isl_ast_build_has_isolated(build); if (has_isolate < 0) executed = isl_union_map_free(executed); else if (!has_isolate) return generate_shifted_component_tree_base(executed, build, 0); schedule_domain = isl_union_map_domain(isl_union_map_copy(executed)); domain = isl_set_from_union_set(schedule_domain); isolated = isl_ast_build_get_isolated(build); isolated = isl_set_intersect(isolated, isl_set_copy(domain)); test = isl_ast_build_specialize(build, isl_set_copy(isolated)); empty = isl_set_is_empty(test); isl_set_free(test); if (empty < 0) goto error; if (empty) { isl_set_free(isolated); isl_set_free(domain); return generate_shifted_component_tree_base(executed, build, 0); } isolated = isl_ast_build_eliminate(build, isolated); hull = isl_set_unshifted_simple_hull(isolated); isolated = isl_set_from_basic_set(hull); depth = isl_ast_build_get_depth(build); space = isl_space_map_from_set(isl_set_get_space(isolated)); gt = isl_map_universe(space); for (i = 0; i < depth; ++i) gt = isl_map_equate(gt, isl_dim_in, i, isl_dim_out, i); gt = isl_map_order_gt(gt, isl_dim_in, depth, isl_dim_out, depth); lt = isl_map_reverse(isl_map_copy(gt)); before = isl_set_apply(isl_set_copy(isolated), gt); after = isl_set_apply(isl_set_copy(isolated), lt); domain = isl_set_subtract(domain, isl_set_copy(isolated)); domain = isl_set_subtract(domain, isl_set_copy(before)); domain = isl_set_subtract(domain, isl_set_copy(after)); after = isl_set_subtract(after, isl_set_copy(isolated)); after = isl_set_subtract(after, isl_set_copy(before)); before = isl_set_subtract(before, isl_set_copy(isolated)); res = generate_shifted_component_tree_part(executed, before, build, 0); list = generate_shifted_component_tree_part(executed, isolated, build, 1); res = isl_ast_graft_list_concat(res, list); list = generate_shifted_component_tree_part(executed, after, build, 0); res = isl_ast_graft_list_concat(res, list); list = generate_shifted_component_tree_part(executed, domain, build, 0); res = isl_ast_graft_list_concat(res, list); isl_union_map_free(executed); isl_ast_build_free(build); return res; error: isl_set_free(domain); isl_set_free(isolated); isl_union_map_free(executed); isl_ast_build_free(build); return NULL; } /* Generate code for a single component, after shifting (if any) * has been applied. * * Call generate_shifted_component_tree or generate_shifted_component_flat * depending on whether the schedule was specified as a schedule tree. */ static __isl_give isl_ast_graft_list *generate_shifted_component( __isl_take isl_union_map *executed, __isl_take isl_ast_build *build) { if (isl_ast_build_has_schedule_node(build)) return generate_shifted_component_tree(executed, build); else return generate_shifted_component_flat(executed, build); } 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_constraint_alloc_equality(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_val *val; isl_multi_val *mv; isl_space *space; isl_multi_aff *ma, *zero; isl_union_map *executed; depth = isl_ast_build_get_depth(build); first = first_offset(domain, order, n, build); if (first < 0) goto error; 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; error: isl_ast_build_free(build); return NULL; } /* Does any node in the schedule tree rooted at the current schedule node * of "build" depend on outer schedule nodes? */ static int has_anchored_subtree(__isl_keep isl_ast_build *build) { isl_schedule_node *node; int dependent = 0; node = isl_ast_build_get_schedule_node(build); dependent = isl_schedule_node_is_subtree_anchored(node); isl_schedule_node_free(node); return dependent; } /* 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, in case of a schedule map input, * 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. * In the case of a schedule tree input, we bail out if any of * the descendants of the current schedule node refer to outer * schedule nodes in any way. * * * 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) { if (isl_ast_build_has_schedule_node(build)) skip = has_anchored_subtree(build); else skip = isl_ast_build_options_involve_depth(build); } if (skip < 0) goto error; if (skip) return generate_shifted_component_from_list(domain, order, n, build); base = eliminate_non_fixed(domain, order, n, depth, build); if (base < 0) goto error; 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; error: isl_ast_build_free(build); return NULL; } /* Store both "map" itself and its domain in the * structure pointed to by *next and advance to the next array element. */ static isl_stat 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 isl_stat_ok; } static int after_in_tree(__isl_keep isl_union_map *umap, __isl_keep isl_schedule_node *node); /* Is any domain element of "umap" scheduled after any of * the corresponding image elements by the tree rooted at * the child of "node"? */ static int after_in_child(__isl_keep isl_union_map *umap, __isl_keep isl_schedule_node *node) { isl_schedule_node *child; int after; child = isl_schedule_node_get_child(node, 0); after = after_in_tree(umap, child); isl_schedule_node_free(child); return after; } /* Is any domain element of "umap" scheduled after any of * the corresponding image elements by the tree rooted at * the band node "node"? * * We first check if any domain element is scheduled after any * of the corresponding image elements by the band node itself. * If not, we restrict "map" to those pairs of element that * are scheduled together by the band node and continue with * the child of the band node. * If there are no such pairs then the map passed to after_in_child * will be empty causing it to return 0. */ static int after_in_band(__isl_keep isl_union_map *umap, __isl_keep isl_schedule_node *node) { isl_multi_union_pw_aff *mupa; isl_union_map *partial, *test, *gt, *universe, *umap1, *umap2; isl_union_set *domain, *range; isl_space *space; int empty; int after; if (isl_schedule_node_band_n_member(node) == 0) return after_in_child(umap, node); mupa = isl_schedule_node_band_get_partial_schedule(node); space = isl_multi_union_pw_aff_get_space(mupa); partial = isl_union_map_from_multi_union_pw_aff(mupa); test = isl_union_map_copy(umap); test = isl_union_map_apply_domain(test, isl_union_map_copy(partial)); test = isl_union_map_apply_range(test, isl_union_map_copy(partial)); gt = isl_union_map_from_map(isl_map_lex_gt(space)); test = isl_union_map_intersect(test, gt); empty = isl_union_map_is_empty(test); isl_union_map_free(test); if (empty < 0 || !empty) { isl_union_map_free(partial); return empty < 0 ? -1 : 1; } universe = isl_union_map_universe(isl_union_map_copy(umap)); domain = isl_union_map_domain(isl_union_map_copy(universe)); range = isl_union_map_range(universe); umap1 = isl_union_map_copy(partial); umap1 = isl_union_map_intersect_domain(umap1, domain); umap2 = isl_union_map_intersect_domain(partial, range); test = isl_union_map_apply_range(umap1, isl_union_map_reverse(umap2)); test = isl_union_map_intersect(test, isl_union_map_copy(umap)); after = after_in_child(test, node); isl_union_map_free(test); return after; } /* Is any domain element of "umap" scheduled after any of * the corresponding image elements by the tree rooted at * the context node "node"? * * The context constraints apply to the schedule domain, * so we cannot apply them directly to "umap", which contains * pairs of statement instances. Instead, we add them * to the range of the prefix schedule for both domain and * range of "umap". */ static int after_in_context(__isl_keep isl_union_map *umap, __isl_keep isl_schedule_node *node) { isl_union_map *prefix, *universe, *umap1, *umap2; isl_union_set *domain, *range; isl_set *context; int after; umap = isl_union_map_copy(umap); context = isl_schedule_node_context_get_context(node); prefix = isl_schedule_node_get_prefix_schedule_union_map(node); universe = isl_union_map_universe(isl_union_map_copy(umap)); domain = isl_union_map_domain(isl_union_map_copy(universe)); range = isl_union_map_range(universe); umap1 = isl_union_map_copy(prefix); umap1 = isl_union_map_intersect_domain(umap1, domain); umap2 = isl_union_map_intersect_domain(prefix, range); umap1 = isl_union_map_intersect_range(umap1, isl_union_set_from_set(context)); umap1 = isl_union_map_apply_range(umap1, isl_union_map_reverse(umap2)); umap = isl_union_map_intersect(umap, umap1); after = after_in_child(umap, node); isl_union_map_free(umap); return after; } /* Is any domain element of "umap" scheduled after any of * the corresponding image elements by the tree rooted at * the expansion node "node"? * * We apply the expansion to domain and range of "umap" and * continue with its child. */ static int after_in_expansion(__isl_keep isl_union_map *umap, __isl_keep isl_schedule_node *node) { isl_union_map *expansion; int after; expansion = isl_schedule_node_expansion_get_expansion(node); umap = isl_union_map_copy(umap); umap = isl_union_map_apply_domain(umap, isl_union_map_copy(expansion)); umap = isl_union_map_apply_range(umap, expansion); after = after_in_child(umap, node); isl_union_map_free(umap); return after; } /* Is any domain element of "umap" scheduled after any of * the corresponding image elements by the tree rooted at * the extension node "node"? * * Since the extension node may add statement instances before or * after the pairs of statement instances in "umap", we return 1 * to ensure that these pairs are not broken up. */ static int after_in_extension(__isl_keep isl_union_map *umap, __isl_keep isl_schedule_node *node) { return 1; } /* Is any domain element of "umap" scheduled after any of * the corresponding image elements by the tree rooted at * the filter node "node"? * * We intersect domain and range of "umap" with the filter and * continue with its child. */ static int after_in_filter(__isl_keep isl_union_map *umap, __isl_keep isl_schedule_node *node) { isl_union_set *filter; int after; umap = isl_union_map_copy(umap); filter = isl_schedule_node_filter_get_filter(node); umap = isl_union_map_intersect_domain(umap, isl_union_set_copy(filter)); umap = isl_union_map_intersect_range(umap, filter); after = after_in_child(umap, node); isl_union_map_free(umap); return after; } /* Is any domain element of "umap" scheduled after any of * the corresponding image elements by the tree rooted at * the set node "node"? * * This is only the case if this condition holds in any * of the (filter) children of the set node. * In particular, if the domain and the range of "umap" * are contained in different children, then the condition * does not hold. */ static int after_in_set(__isl_keep isl_union_map *umap, __isl_keep isl_schedule_node *node) { int i, n; n = isl_schedule_node_n_children(node); for (i = 0; i < n; ++i) { isl_schedule_node *child; int after; child = isl_schedule_node_get_child(node, i); after = after_in_tree(umap, child); isl_schedule_node_free(child); if (after < 0 || after) return after; } return 0; } /* Return the filter of child "i" of "node". */ static __isl_give isl_union_set *child_filter( __isl_keep isl_schedule_node *node, int i) { isl_schedule_node *child; isl_union_set *filter; child = isl_schedule_node_get_child(node, i); filter = isl_schedule_node_filter_get_filter(child); isl_schedule_node_free(child); return filter; } /* Is any domain element of "umap" scheduled after any of * the corresponding image elements by the tree rooted at * the sequence node "node"? * * This happens in particular if any domain element is * contained in a later child than one containing a range element or * if the condition holds within a given child in the sequence. * The later part of the condition is checked by after_in_set. */ static int after_in_sequence(__isl_keep isl_union_map *umap, __isl_keep isl_schedule_node *node) { int i, j, n; isl_union_map *umap_i; int empty, after = 0; n = isl_schedule_node_n_children(node); for (i = 1; i < n; ++i) { isl_union_set *filter_i; umap_i = isl_union_map_copy(umap); filter_i = child_filter(node, i); umap_i = isl_union_map_intersect_domain(umap_i, filter_i); empty = isl_union_map_is_empty(umap_i); if (empty < 0) goto error; if (empty) { isl_union_map_free(umap_i); continue; } for (j = 0; j < i; ++j) { isl_union_set *filter_j; isl_union_map *umap_ij; umap_ij = isl_union_map_copy(umap_i); filter_j = child_filter(node, j); umap_ij = isl_union_map_intersect_range(umap_ij, filter_j); empty = isl_union_map_is_empty(umap_ij); isl_union_map_free(umap_ij); if (empty < 0) goto error; if (!empty) after = 1; if (after) break; } isl_union_map_free(umap_i); if (after) break; } if (after < 0 || after) return after; return after_in_set(umap, node); error: isl_union_map_free(umap_i); return -1; } /* Is any domain element of "umap" scheduled after any of * the corresponding image elements by the tree rooted at "node"? * * If "umap" is empty, then clearly there is no such element. * Otherwise, consider the different types of nodes separately. */ static int after_in_tree(__isl_keep isl_union_map *umap, __isl_keep isl_schedule_node *node) { int empty; enum isl_schedule_node_type type; empty = isl_union_map_is_empty(umap); if (empty < 0) return -1; if (empty) return 0; if (!node) return -1; type = isl_schedule_node_get_type(node); switch (type) { case isl_schedule_node_error: return -1; case isl_schedule_node_leaf: return 0; case isl_schedule_node_band: return after_in_band(umap, node); case isl_schedule_node_domain: isl_die(isl_schedule_node_get_ctx(node), isl_error_internal, "unexpected internal domain node", return -1); case isl_schedule_node_context: return after_in_context(umap, node); case isl_schedule_node_expansion: return after_in_expansion(umap, node); case isl_schedule_node_extension: return after_in_extension(umap, node); case isl_schedule_node_filter: return after_in_filter(umap, node); case isl_schedule_node_guard: case isl_schedule_node_mark: return after_in_child(umap, node); case isl_schedule_node_set: return after_in_set(umap, node); case isl_schedule_node_sequence: return after_in_sequence(umap, node); } return 1; } /* Is any domain element of "map1" scheduled after any domain * element of "map2" by the subtree underneath the current band node, * while at the same time being scheduled together by the current * band node, i.e., by "map1" and "map2? * * If the child of the current band node is a leaf, then * no element can be scheduled after any other element. * * Otherwise, we construct a relation between domain elements * of "map1" and domain elements of "map2" that are scheduled * together and then check if the subtree underneath the current * band node determines their relative order. */ static int after_in_subtree(__isl_keep isl_ast_build *build, __isl_keep isl_map *map1, __isl_keep isl_map *map2) { isl_schedule_node *node; isl_map *map; isl_union_map *umap; int after; node = isl_ast_build_get_schedule_node(build); if (!node) return -1; node = isl_schedule_node_child(node, 0); if (isl_schedule_node_get_type(node) == isl_schedule_node_leaf) { isl_schedule_node_free(node); return 0; } map = isl_map_copy(map2); map = isl_map_apply_domain(map, isl_map_copy(map1)); umap = isl_union_map_from_map(map); after = after_in_tree(umap, node); isl_union_map_free(umap); isl_schedule_node_free(node); return after; } /* Internal data for any_scheduled_after. * * "build" is the build in which the AST is constructed. * "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 { isl_ast_build *build; 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 we are inside a band of a schedule tree and there is a pair * of elements in the two domains that is schedule together by * the current band, then we check if any element of "i" may be schedule * after element of "j" by the descendants of the band node. * * 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 isl_bool 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 isl_bool_error; if (follows > 0) return isl_bool_true; if (follows < 0) return isl_bool_false; } if (isl_ast_build_has_schedule_node(data->build)) { int after; after = after_in_subtree(data->build, data->domain[i].map, data->domain[j].map); if (after < 0 || after) return after; } 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.build = build; 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); if (!g) goto error; 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_ast_build_dim(build, 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_node_from_schedule_map. * 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 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. * "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_node_from_schedule_map * 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. * * If the build space is parametric, then we add some of the parameter * constraints to the executed relation. Adding these constraints * allows for an earlier detection of conflicts in some cases. * However, we do not want to divide the executed relation into * more disjuncts than necessary. We therefore approximate * the constraints on the parameters by a single disjunct set. * * 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 isl_stat 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); if (!embed) { isl_set *domain; domain = isl_ast_build_get_domain(data->build); domain = isl_set_from_basic_set(isl_set_simple_hull(domain)); executed = isl_union_map_intersect_params(executed, domain); } 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 isl_stat_ok; } /* 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 isl_stat 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 isl_stat_error; } /* 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_node_from_schedule_map( __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); schedule = isl_union_map_coalesce(schedule); schedule = isl_union_map_remove_redundancies(schedule); 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; } /* The old name for isl_ast_build_node_from_schedule_map. * It is being kept for backward compatibility, but * it will be removed in the future. */ __isl_give isl_ast_node *isl_ast_build_ast_from_schedule( __isl_keep isl_ast_build *build, __isl_take isl_union_map *schedule) { return isl_ast_build_node_from_schedule_map(build, schedule); } /* Generate an AST that visits the elements in the domain of "executed" * in the relative order specified by the band node "node" and its descendants. * * The relation "executed" maps the outer generated loop iterators * to the domain elements executed by those iterations. * * If the band is empty, we continue with its descendants. * Otherwise, we extend the build and the inverse schedule with * the additional space/partial schedule and continue generating * an AST in generate_next_level. * As soon as we have extended the inverse schedule with the additional * partial schedule, we look for equalities that may exists between * the old and the new part. */ static __isl_give isl_ast_graft_list *build_ast_from_band( __isl_take isl_ast_build *build, __isl_take isl_schedule_node *node, __isl_take isl_union_map *executed) { isl_space *space; isl_multi_union_pw_aff *extra; isl_union_map *extra_umap; isl_ast_graft_list *list; unsigned n1, n2; if (!build || !node || !executed) goto error; if (isl_schedule_node_band_n_member(node) == 0) return build_ast_from_child(build, node, executed); extra = isl_schedule_node_band_get_partial_schedule(node); extra = isl_multi_union_pw_aff_align_params(extra, isl_ast_build_get_space(build, 1)); space = isl_multi_union_pw_aff_get_space(extra); extra_umap = isl_union_map_from_multi_union_pw_aff(extra); extra_umap = isl_union_map_reverse(extra_umap); executed = isl_union_map_domain_product(executed, extra_umap); executed = isl_union_map_detect_equalities(executed); n1 = isl_ast_build_dim(build, isl_dim_param); build = isl_ast_build_product(build, space); n2 = isl_ast_build_dim(build, isl_dim_param); if (n2 > n1) isl_die(isl_ast_build_get_ctx(build), isl_error_invalid, "band node is not allowed to introduce new parameters", build = isl_ast_build_free(build)); build = isl_ast_build_set_schedule_node(build, node); list = generate_next_level(executed, build); list = isl_ast_graft_list_unembed(list, 1); return list; error: isl_schedule_node_free(node); isl_union_map_free(executed); isl_ast_build_free(build); return NULL; } /* Hoist a list of grafts (in practice containing a single graft) * from "sub_build" (which includes extra context information) * to "build". * * In particular, project out all additional parameters introduced * by the context node from the enforced constraints and the guard * of the single graft. */ static __isl_give isl_ast_graft_list *hoist_out_of_context( __isl_take isl_ast_graft_list *list, __isl_keep isl_ast_build *build, __isl_keep isl_ast_build *sub_build) { isl_ast_graft *graft; isl_basic_set *enforced; isl_set *guard; unsigned n_param, extra_param; if (!build || !sub_build) return isl_ast_graft_list_free(list); n_param = isl_ast_build_dim(build, isl_dim_param); extra_param = isl_ast_build_dim(sub_build, isl_dim_param); if (extra_param == n_param) return list; extra_param -= n_param; enforced = isl_ast_graft_list_extract_shared_enforced(list, sub_build); enforced = isl_basic_set_project_out(enforced, isl_dim_param, n_param, extra_param); enforced = isl_basic_set_remove_unknown_divs(enforced); guard = isl_ast_graft_list_extract_hoistable_guard(list, sub_build); guard = isl_set_remove_divs_involving_dims(guard, isl_dim_param, n_param, extra_param); guard = isl_set_project_out(guard, isl_dim_param, n_param, extra_param); guard = isl_set_compute_divs(guard); graft = isl_ast_graft_alloc_from_children(list, guard, enforced, build, sub_build); list = isl_ast_graft_list_from_ast_graft(graft); return list; } /* Generate an AST that visits the elements in the domain of "executed" * in the relative order specified by the context node "node" * and its descendants. * * The relation "executed" maps the outer generated loop iterators * to the domain elements executed by those iterations. * * The context node may introduce additional parameters as well as * constraints on the outer schedule dimenions or original parameters. * * We add the extra parameters to a new build and the context * constraints to both the build and (as a single disjunct) * to the domain of "executed". Since the context constraints * are specified in terms of the input schedule, we first need * to map them to the internal schedule domain. * * After constructing the AST from the descendants of "node", * we combine the list of grafts into a single graft within * the new build, in order to be able to exploit the additional * context constraints during this combination. * * Additionally, if the current node is the outermost node in * the schedule tree (apart from the root domain node), we generate * all pending guards, again to be able to exploit the additional * context constraints. We currently do not do this for internal * context nodes since we may still want to hoist conditions * to outer AST nodes. * * If the context node introduced any new parameters, then they * are removed from the set of enforced constraints and guard * in hoist_out_of_context. */ static __isl_give isl_ast_graft_list *build_ast_from_context( __isl_take isl_ast_build *build, __isl_take isl_schedule_node *node, __isl_take isl_union_map *executed) { isl_set *context; isl_space *space; isl_multi_aff *internal2input; isl_ast_build *sub_build; isl_ast_graft_list *list; int n, depth; depth = isl_schedule_node_get_tree_depth(node); space = isl_ast_build_get_space(build, 1); context = isl_schedule_node_context_get_context(node); context = isl_set_align_params(context, space); sub_build = isl_ast_build_copy(build); space = isl_set_get_space(context); sub_build = isl_ast_build_align_params(sub_build, space); internal2input = isl_ast_build_get_internal2input(sub_build); context = isl_set_preimage_multi_aff(context, internal2input); sub_build = isl_ast_build_restrict_generated(sub_build, isl_set_copy(context)); context = isl_set_from_basic_set(isl_set_simple_hull(context)); executed = isl_union_map_intersect_domain(executed, isl_union_set_from_set(context)); list = build_ast_from_child(isl_ast_build_copy(sub_build), node, executed); n = isl_ast_graft_list_n_ast_graft(list); if (n < 0) list = isl_ast_graft_list_free(list); list = isl_ast_graft_list_fuse(list, sub_build); if (depth == 1) list = isl_ast_graft_list_insert_pending_guard_nodes(list, sub_build); if (n >= 1) list = hoist_out_of_context(list, build, sub_build); isl_ast_build_free(build); isl_ast_build_free(sub_build); return list; } /* Generate an AST that visits the elements in the domain of "executed" * in the relative order specified by the expansion node "node" and * its descendants. * * The relation "executed" maps the outer generated loop iterators * to the domain elements executed by those iterations. * * We expand the domain elements by the expansion and * continue with the descendants of the node. */ static __isl_give isl_ast_graft_list *build_ast_from_expansion( __isl_take isl_ast_build *build, __isl_take isl_schedule_node *node, __isl_take isl_union_map *executed) { isl_union_map *expansion; unsigned n1, n2; expansion = isl_schedule_node_expansion_get_expansion(node); expansion = isl_union_map_align_params(expansion, isl_union_map_get_space(executed)); n1 = isl_union_map_dim(executed, isl_dim_param); executed = isl_union_map_apply_range(executed, expansion); n2 = isl_union_map_dim(executed, isl_dim_param); if (n2 > n1) isl_die(isl_ast_build_get_ctx(build), isl_error_invalid, "expansion node is not allowed to introduce " "new parameters", goto error); return build_ast_from_child(build, node, executed); error: isl_ast_build_free(build); isl_schedule_node_free(node); isl_union_map_free(executed); return NULL; } /* Generate an AST that visits the elements in the domain of "executed" * in the relative order specified by the extension node "node" and * its descendants. * * The relation "executed" maps the outer generated loop iterators * to the domain elements executed by those iterations. * * Extend the inverse schedule with the extension applied to current * set of generated constraints. Since the extension if formulated * in terms of the input schedule, it first needs to be transformed * to refer to the internal schedule. */ static __isl_give isl_ast_graft_list *build_ast_from_extension( __isl_take isl_ast_build *build, __isl_take isl_schedule_node *node, __isl_take isl_union_map *executed) { isl_union_set *schedule_domain; isl_union_map *extension; isl_set *set; set = isl_ast_build_get_generated(build); schedule_domain = isl_union_set_from_set(set); extension = isl_schedule_node_extension_get_extension(node); extension = isl_union_map_preimage_domain_multi_aff(extension, isl_multi_aff_copy(build->internal2input)); extension = isl_union_map_intersect_domain(extension, schedule_domain); extension = isl_ast_build_substitute_values_union_map_domain(build, extension); executed = isl_union_map_union(executed, extension); return build_ast_from_child(build, node, executed); } /* Generate an AST that visits the elements in the domain of "executed" * in the relative order specified by the filter node "node" and * its descendants. * * The relation "executed" maps the outer generated loop iterators * to the domain elements executed by those iterations. * * We simply intersect the iteration domain (i.e., the range of "executed") * with the filter and continue with the descendants of the node, * unless the resulting inverse schedule is empty, in which * case we return an empty list. */ static __isl_give isl_ast_graft_list *build_ast_from_filter( __isl_take isl_ast_build *build, __isl_take isl_schedule_node *node, __isl_take isl_union_map *executed) { isl_ctx *ctx; isl_union_set *filter; isl_ast_graft_list *list; int empty; unsigned n1, n2; if (!build || !node || !executed) goto error; filter = isl_schedule_node_filter_get_filter(node); filter = isl_union_set_align_params(filter, isl_union_map_get_space(executed)); n1 = isl_union_map_dim(executed, isl_dim_param); executed = isl_union_map_intersect_range(executed, filter); n2 = isl_union_map_dim(executed, isl_dim_param); if (n2 > n1) isl_die(isl_ast_build_get_ctx(build), isl_error_invalid, "filter node is not allowed to introduce " "new parameters", goto error); empty = isl_union_map_is_empty(executed); if (empty < 0) goto error; if (!empty) return build_ast_from_child(build, node, executed); ctx = isl_ast_build_get_ctx(build); list = isl_ast_graft_list_alloc(ctx, 0); isl_ast_build_free(build); isl_schedule_node_free(node); isl_union_map_free(executed); return list; error: isl_ast_build_free(build); isl_schedule_node_free(node); isl_union_map_free(executed); return NULL; } /* Generate an AST that visits the elements in the domain of "executed" * in the relative order specified by the guard node "node" and * its descendants. * * The relation "executed" maps the outer generated loop iterators * to the domain elements executed by those iterations. * * Ensure that the associated guard is enforced by the outer AST * constructs by adding it to the guard of the graft. * Since we know that we will enforce the guard, we can also include it * in the generated constraints used to construct an AST for * the descendant nodes. */ static __isl_give isl_ast_graft_list *build_ast_from_guard( __isl_take isl_ast_build *build, __isl_take isl_schedule_node *node, __isl_take isl_union_map *executed) { isl_space *space; isl_set *guard, *hoisted; isl_basic_set *enforced; isl_ast_build *sub_build; isl_ast_graft *graft; isl_ast_graft_list *list; unsigned n1, n2; space = isl_ast_build_get_space(build, 1); guard = isl_schedule_node_guard_get_guard(node); n1 = isl_space_dim(space, isl_dim_param); guard = isl_set_align_params(guard, space); n2 = isl_set_dim(guard, isl_dim_param); if (n2 > n1) isl_die(isl_ast_build_get_ctx(build), isl_error_invalid, "guard node is not allowed to introduce " "new parameters", guard = isl_set_free(guard)); guard = isl_set_preimage_multi_aff(guard, isl_multi_aff_copy(build->internal2input)); guard = isl_ast_build_specialize(build, guard); guard = isl_set_gist(guard, isl_set_copy(build->generated)); sub_build = isl_ast_build_copy(build); sub_build = isl_ast_build_restrict_generated(sub_build, isl_set_copy(guard)); list = build_ast_from_child(isl_ast_build_copy(sub_build), node, executed); hoisted = isl_ast_graft_list_extract_hoistable_guard(list, sub_build); if (isl_set_n_basic_set(hoisted) > 1) list = isl_ast_graft_list_gist_guards(list, isl_set_copy(hoisted)); guard = isl_set_intersect(guard, hoisted); enforced = extract_shared_enforced(list, build); graft = isl_ast_graft_alloc_from_children(list, guard, enforced, build, sub_build); isl_ast_build_free(sub_build); isl_ast_build_free(build); return isl_ast_graft_list_from_ast_graft(graft); } /* Call the before_each_mark callback, if requested by the user. * * Return 0 on success and -1 on error. * * The caller is responsible for recording the current inverse schedule * in "build". */ static isl_stat before_each_mark(__isl_keep isl_id *mark, __isl_keep isl_ast_build *build) { if (!build) return isl_stat_error; if (!build->before_each_mark) return isl_stat_ok; return build->before_each_mark(mark, build, build->before_each_mark_user); } /* Call the after_each_mark callback, if requested by the user. * * The caller is responsible for recording the current inverse schedule * in "build". */ static __isl_give isl_ast_graft *after_each_mark( __isl_take isl_ast_graft *graft, __isl_keep isl_ast_build *build) { if (!graft || !build) return isl_ast_graft_free(graft); if (!build->after_each_mark) return graft; graft->node = build->after_each_mark(graft->node, build, build->after_each_mark_user); if (!graft->node) return isl_ast_graft_free(graft); return graft; } /* Generate an AST that visits the elements in the domain of "executed" * in the relative order specified by the mark node "node" and * its descendants. * * The relation "executed" maps the outer generated loop iterators * to the domain elements executed by those iterations. * Since we may be calling before_each_mark and after_each_mark * callbacks, we record the current inverse schedule in the build. * * We generate an AST for the child of the mark node, combine * the graft list into a single graft and then insert the mark * in the AST of that single graft. */ static __isl_give isl_ast_graft_list *build_ast_from_mark( __isl_take isl_ast_build *build, __isl_take isl_schedule_node *node, __isl_take isl_union_map *executed) { isl_id *mark; isl_ast_graft *graft; isl_ast_graft_list *list; int n; build = isl_ast_build_set_executed(build, isl_union_map_copy(executed)); mark = isl_schedule_node_mark_get_id(node); if (before_each_mark(mark, build) < 0) node = isl_schedule_node_free(node); list = build_ast_from_child(isl_ast_build_copy(build), node, executed); list = isl_ast_graft_list_fuse(list, build); n = isl_ast_graft_list_n_ast_graft(list); if (n < 0) list = isl_ast_graft_list_free(list); if (n == 0) { isl_id_free(mark); } else { graft = isl_ast_graft_list_get_ast_graft(list, 0); graft = isl_ast_graft_insert_mark(graft, mark); graft = after_each_mark(graft, build); list = isl_ast_graft_list_set_ast_graft(list, 0, graft); } isl_ast_build_free(build); return list; } static __isl_give isl_ast_graft_list *build_ast_from_schedule_node( __isl_take isl_ast_build *build, __isl_take isl_schedule_node *node, __isl_take isl_union_map *executed); /* Generate an AST that visits the elements in the domain of "executed" * in the relative order specified by the sequence (or set) node "node" and * its descendants. * * The relation "executed" maps the outer generated loop iterators * to the domain elements executed by those iterations. * * We simply generate an AST for each of the children and concatenate * the results. */ static __isl_give isl_ast_graft_list *build_ast_from_sequence( __isl_take isl_ast_build *build, __isl_take isl_schedule_node *node, __isl_take isl_union_map *executed) { int i, n; isl_ctx *ctx; isl_ast_graft_list *list; ctx = isl_ast_build_get_ctx(build); list = isl_ast_graft_list_alloc(ctx, 0); n = isl_schedule_node_n_children(node); for (i = 0; i < n; ++i) { isl_schedule_node *child; isl_ast_graft_list *list_i; child = isl_schedule_node_get_child(node, i); list_i = build_ast_from_schedule_node(isl_ast_build_copy(build), child, isl_union_map_copy(executed)); list = isl_ast_graft_list_concat(list, list_i); } isl_ast_build_free(build); isl_schedule_node_free(node); isl_union_map_free(executed); return list; } /* Generate an AST that visits the elements in the domain of "executed" * in the relative order specified by the node "node" and its descendants. * * The relation "executed" maps the outer generated loop iterators * to the domain elements executed by those iterations. * * If the node is a leaf, then we pass control to generate_inner_level. * Note that the current build does not refer to any band node, so * that generate_inner_level will not try to visit the child of * the leaf node. * * The other node types are handled in separate functions. * Set nodes are currently treated in the same way as sequence nodes. * The children of a set node may be executed in any order, * including the order of the children. */ static __isl_give isl_ast_graft_list *build_ast_from_schedule_node( __isl_take isl_ast_build *build, __isl_take isl_schedule_node *node, __isl_take isl_union_map *executed) { enum isl_schedule_node_type type; type = isl_schedule_node_get_type(node); switch (type) { case isl_schedule_node_error: goto error; case isl_schedule_node_leaf: isl_schedule_node_free(node); return generate_inner_level(executed, build); case isl_schedule_node_band: return build_ast_from_band(build, node, executed); case isl_schedule_node_context: return build_ast_from_context(build, node, executed); case isl_schedule_node_domain: isl_die(isl_schedule_node_get_ctx(node), isl_error_unsupported, "unexpected internal domain node", goto error); case isl_schedule_node_expansion: return build_ast_from_expansion(build, node, executed); case isl_schedule_node_extension: return build_ast_from_extension(build, node, executed); case isl_schedule_node_filter: return build_ast_from_filter(build, node, executed); case isl_schedule_node_guard: return build_ast_from_guard(build, node, executed); case isl_schedule_node_mark: return build_ast_from_mark(build, node, executed); case isl_schedule_node_sequence: case isl_schedule_node_set: return build_ast_from_sequence(build, node, executed); } isl_die(isl_ast_build_get_ctx(build), isl_error_internal, "unhandled type", goto error); error: isl_union_map_free(executed); isl_schedule_node_free(node); isl_ast_build_free(build); return NULL; } /* Generate an AST that visits the elements in the domain of "executed" * in the relative order specified by the (single) child of "node" and * its descendants. * * The relation "executed" maps the outer generated loop iterators * to the domain elements executed by those iterations. * * This function is never called on a leaf, set or sequence node, * so the node always has exactly one child. */ static __isl_give isl_ast_graft_list *build_ast_from_child( __isl_take isl_ast_build *build, __isl_take isl_schedule_node *node, __isl_take isl_union_map *executed) { node = isl_schedule_node_child(node, 0); return build_ast_from_schedule_node(build, node, executed); } /* Generate an AST that visits the elements in the domain of the domain * node "node" in the relative order specified by its descendants. * * An initial inverse schedule is created that maps a zero-dimensional * schedule space to the node domain. * The input "build" is assumed to have a parametric domain and * is replaced by the same zero-dimensional schedule space. * * We also add some of the parameter constraints in the build domain * to the executed relation. Adding these constraints * allows for an earlier detection of conflicts in some cases. * However, we do not want to divide the executed relation into * more disjuncts than necessary. We therefore approximate * the constraints on the parameters by a single disjunct set. */ static __isl_give isl_ast_node *build_ast_from_domain( __isl_take isl_ast_build *build, __isl_take isl_schedule_node *node) { isl_ctx *ctx; isl_union_set *domain, *schedule_domain; isl_union_map *executed; isl_space *space; isl_set *set; isl_ast_graft_list *list; isl_ast_node *ast; int is_params; if (!build) goto error; ctx = isl_ast_build_get_ctx(build); space = isl_ast_build_get_space(build, 1); is_params = isl_space_is_params(space); isl_space_free(space); if (is_params < 0) goto error; if (!is_params) isl_die(ctx, isl_error_unsupported, "expecting parametric initial context", goto error); domain = isl_schedule_node_domain_get_domain(node); domain = isl_union_set_coalesce(domain); space = isl_union_set_get_space(domain); space = isl_space_set_from_params(space); build = isl_ast_build_product(build, space); set = isl_ast_build_get_domain(build); set = isl_set_from_basic_set(isl_set_simple_hull(set)); schedule_domain = isl_union_set_from_set(set); executed = isl_union_map_from_domain_and_range(schedule_domain, domain); list = build_ast_from_child(isl_ast_build_copy(build), node, executed); ast = isl_ast_node_from_graft_list(list, build); isl_ast_build_free(build); return ast; error: isl_schedule_node_free(node); 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 schedule tree. * * "build" is an isl_ast_build that has been created using * isl_ast_build_alloc or isl_ast_build_from_context based * on a parametric set. * * The construction starts at the root node of the schedule, * which is assumed to be a domain node. */ __isl_give isl_ast_node *isl_ast_build_node_from_schedule( __isl_keep isl_ast_build *build, __isl_take isl_schedule *schedule) { isl_ctx *ctx; isl_schedule_node *node; if (!build || !schedule) goto error; ctx = isl_ast_build_get_ctx(build); node = isl_schedule_get_root(schedule); isl_schedule_free(schedule); build = isl_ast_build_copy(build); build = isl_ast_build_set_single_valued(build, 0); if (isl_schedule_node_get_type(node) != isl_schedule_node_domain) isl_die(ctx, isl_error_unsupported, "expecting root domain node", build = isl_ast_build_free(build)); return build_ast_from_domain(build, node); error: isl_schedule_free(schedule); return NULL; } cloog-0.18.4/isl/isl_ast_graft_private.h0000644000175000017500000000747012554427055015164 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 * have 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_from_children( __isl_take isl_ast_graft_list *list, __isl_take isl_set *guard, __isl_take isl_basic_set *enforced, __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 *isl_ast_graft_insert_mark( __isl_take isl_ast_graft *graft, __isl_take isl_id *mark); __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_graft_list *isl_ast_graft_list_insert_pending_guard_nodes( __isl_take isl_ast_graft_list *list, __isl_keep isl_ast_build *build); __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_basic_set *isl_ast_graft_list_extract_shared_enforced( __isl_keep isl_ast_graft_list *list, __isl_keep isl_ast_build *build); __isl_give isl_set *isl_ast_graft_list_extract_hoistable_guard( __isl_keep isl_ast_graft_list *list, __isl_keep isl_ast_build *build); __isl_give isl_ast_graft_list *isl_ast_graft_list_gist_guards( __isl_take isl_ast_graft_list *list, __isl_take isl_set *context); __isl_give isl_printer *isl_printer_print_ast_graft(__isl_take isl_printer *p, __isl_keep isl_ast_graft *graft); #endif cloog-0.18.4/isl/isl_stream.c0000644000175000017500000006667112554427055012756 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(__isl_keep 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 with a string representation, return a copy of this string. */ __isl_give char *isl_token_get_str(isl_ctx *ctx, struct isl_token *tok) { if (!tok) return NULL; if (!tok->u.s) isl_die(ctx, isl_error_invalid, "token does not have a string representation", 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(__isl_keep 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 __isl_give isl_stream* isl_stream_new(struct isl_ctx *ctx) { int i; isl_stream *s = isl_calloc_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 = 1; s->eof = 0; s->last_line = 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; } __isl_give isl_stream* isl_stream_new_file(struct isl_ctx *ctx, FILE *file) { isl_stream *s = isl_stream_new(ctx); if (!s) return NULL; s->file = file; return s; } __isl_give isl_stream* isl_stream_new_str(struct isl_ctx *ctx, const char *str) { isl_stream *s; if (!str) return NULL; s = isl_stream_new(ctx); if (!s) return NULL; s->str = str; return s; } /* Read a character from the stream and advance s->line and s->col * to point to the next character. */ static int stream_getc(__isl_keep 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; else if (c == '\n') { s->line++; s->col = 1; } else s->col++; s->c = c; return c; } static void isl_stream_ungetc(__isl_keep isl_stream *s, int c) { isl_assert(s->ctx, s->n_un < 5, return); s->un[s->n_un++] = c; s->c = -1; } /* Read a character from the stream, skipping pairs of '\\' and '\n'. * Set s->start_line and s->start_col to the line and column * of the returned character. */ static int isl_stream_getc(__isl_keep isl_stream *s) { int c; do { s->start_line = s->line; s->start_col = s->col; 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(__isl_keep 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(__isl_keep 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(__isl_keep 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(__isl_keep 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(__isl_keep isl_stream *s, int same_line) { int c; struct isl_token *tok = NULL; int line, col; int old_line = s->last_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->start_line; col = s->start_col; if (c == -1 || (same_line && c == '\n')) return NULL; s->last_line = line; 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(__isl_keep isl_stream *s) { return next_token(s, 0); } struct isl_token *isl_stream_next_token_on_same_line(__isl_keep isl_stream *s) { return next_token(s, 1); } int isl_stream_eat_if_available(__isl_keep 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(__isl_keep 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(__isl_keep 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(__isl_keep 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(__isl_keep 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 isl_stat free_keyword(void **p, void *user) { struct isl_keyword *keyword = *p; free(keyword->name); free(keyword); return isl_stat_ok; } void isl_stream_flush_tokens(__isl_keep 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; } isl_ctx *isl_stream_get_ctx(__isl_keep isl_stream *s) { return s ? s->ctx : NULL; } void isl_stream_free(__isl_take 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); } free(s->yaml_state); free(s->yaml_indent); isl_ctx_deref(s->ctx); free(s); } /* Push "state" onto the stack of currently active YAML elements. * The caller is responsible for setting the corresponding indentation. * Return 0 on success and -1 on failure. */ static int push_state(__isl_keep isl_stream *s, enum isl_yaml_state state) { if (s->yaml_size < s->yaml_depth + 1) { int *indent; enum isl_yaml_state *state; state = isl_realloc_array(s->ctx, s->yaml_state, enum isl_yaml_state, s->yaml_depth + 1); if (!state) return -1; s->yaml_state = state; indent = isl_realloc_array(s->ctx, s->yaml_indent, int, s->yaml_depth + 1); if (!indent) return -1; s->yaml_indent = indent; s->yaml_size = s->yaml_depth + 1; } s->yaml_state[s->yaml_depth] = state; s->yaml_depth++; return 0; } /* Remove the innermost active YAML element from the stack. * Return 0 on success and -1 on failure. */ static int pop_state(__isl_keep isl_stream *s) { if (!s) return -1; if (s->yaml_depth < 1) isl_die(isl_stream_get_ctx(s), isl_error_invalid, "not in YAML construct", return -1); s->yaml_depth--; return 0; } /* Set the state of the innermost active YAML element to "state". * Return 0 on success and -1 on failure. */ static int update_state(__isl_keep isl_stream *s, enum isl_yaml_state state) { if (!s) return -1; if (s->yaml_depth < 1) isl_die(isl_stream_get_ctx(s), isl_error_invalid, "not in YAML construct", return -1); s->yaml_state[s->yaml_depth - 1] = state; return 0; } /* Return the state of the innermost active YAML element. * Return isl_yaml_none if we are not inside any YAML element. */ static enum isl_yaml_state current_state(__isl_keep isl_stream *s) { if (!s) return isl_yaml_none; if (s->yaml_depth < 1) return isl_yaml_none; return s->yaml_state[s->yaml_depth - 1]; } /* Set the indentation of the innermost active YAML element to "indent". * If "indent" is equal to ISL_YAML_INDENT_FLOW, then this means * that the current elemient is in flow format. */ static int set_yaml_indent(__isl_keep isl_stream *s, int indent) { if (s->yaml_depth < 1) isl_die(s->ctx, isl_error_internal, "not in YAML element", return -1); s->yaml_indent[s->yaml_depth - 1] = indent; return 0; } /* Return the indentation of the innermost active YAML element * of -1 on error. */ static int get_yaml_indent(__isl_keep isl_stream *s) { if (s->yaml_depth < 1) isl_die(s->ctx, isl_error_internal, "not in YAML element", return -1); return s->yaml_indent[s->yaml_depth - 1]; } /* Move to the next state at the innermost level. * Return 1 if successful. * Return 0 if we are at the end of the innermost level. * Return -1 on error. * * If we are in state isl_yaml_mapping_key_start, then we have just * started a mapping and we are expecting a key. If the mapping started * with a '{', then we check if the next token is a '}'. If so, * then the mapping is empty and there is no next state at this level. * Otherwise, we assume that there is at least one key (the one from * which we derived the indentation in isl_stream_yaml_read_start_mapping. * * If we are in state isl_yaml_mapping_key, then the we expect a colon * followed by a value, so there is always a next state unless * some error occurs. * * If we are in state isl_yaml_mapping_val, then there may or may * not be a subsequent key in the same mapping. * In flow format, the next key is preceded by a comma. * In block format, the next key has the same indentation as the first key. * If the first token has a smaller indentation, then we have reached * the end of the current mapping. * * If we are in state isl_yaml_sequence_start, then we have just * started a sequence. If the sequence started with a '[', * then we check if the next token is a ']'. If so, then the sequence * is empty and there is no next state at this level. * Otherwise, we assume that there is at least one element in the sequence * (the one from which we derived the indentation in * isl_stream_yaml_read_start_sequence. * * If we are in state isl_yaml_sequence, then there may or may * not be a subsequent element in the same sequence. * In flow format, the next element is preceded by a comma. * In block format, the next element is introduced by a dash with * the same indentation as that of the first element. * If the first token is not a dash or if it has a smaller indentation, * then we have reached the end of the current sequence. */ int isl_stream_yaml_next(__isl_keep isl_stream *s) { struct isl_token *tok; enum isl_yaml_state state; int indent; state = current_state(s); if (state == isl_yaml_none) isl_die(s->ctx, isl_error_invalid, "not in YAML element", return -1); switch (state) { case isl_yaml_mapping_key_start: if (get_yaml_indent(s) == ISL_YAML_INDENT_FLOW && isl_stream_next_token_is(s, '}')) return 0; if (update_state(s, isl_yaml_mapping_key) < 0) return -1; return 1; case isl_yaml_mapping_key: tok = isl_stream_next_token(s); if (!tok) { if (s->eof) isl_stream_error(s, NULL, "unexpected EOF"); return -1; } if (tok->type == ':') { isl_token_free(tok); if (update_state(s, isl_yaml_mapping_val) < 0) return -1; return 1; } isl_stream_error(s, tok, "expecting ':'"); isl_stream_push_token(s, tok); return -1; case isl_yaml_mapping_val: if (get_yaml_indent(s) == ISL_YAML_INDENT_FLOW) { if (!isl_stream_eat_if_available(s, ',')) return 0; if (update_state(s, isl_yaml_mapping_key) < 0) return -1; return 1; } tok = isl_stream_next_token(s); if (!tok) return 0; indent = tok->col - 1; isl_stream_push_token(s, tok); if (indent < get_yaml_indent(s)) return 0; if (update_state(s, isl_yaml_mapping_key) < 0) return -1; return 1; case isl_yaml_sequence_start: if (get_yaml_indent(s) == ISL_YAML_INDENT_FLOW) { if (isl_stream_next_token_is(s, ']')) return 0; if (update_state(s, isl_yaml_sequence) < 0) return -1; return 1; } tok = isl_stream_next_token(s); if (!tok) { if (s->eof) isl_stream_error(s, NULL, "unexpected EOF"); return -1; } if (tok->type == '-') { isl_token_free(tok); if (update_state(s, isl_yaml_sequence) < 0) return -1; return 1; } isl_stream_error(s, tok, "expecting '-'"); isl_stream_push_token(s, tok); return 0; case isl_yaml_sequence: if (get_yaml_indent(s) == ISL_YAML_INDENT_FLOW) return isl_stream_eat_if_available(s, ','); tok = isl_stream_next_token(s); if (!tok) return 0; indent = tok->col - 1; if (indent < get_yaml_indent(s) || tok->type != '-') { isl_stream_push_token(s, tok); return 0; } isl_token_free(tok); return 1; default: isl_die(s->ctx, isl_error_internal, "unexpected state", return 0); } } /* Start reading a YAML mapping. * Return 0 on success and -1 on error. * * If the first token on the stream is a '{' then we remove this token * from the stream and keep track of the fact that the mapping * is given in flow format. * Otherwise, we assume the first token is the first key of the mapping and * keep track of its indentation, but keep the token on the stream. * In both cases, the next token we expect is the first key of the mapping. */ int isl_stream_yaml_read_start_mapping(__isl_keep isl_stream *s) { struct isl_token *tok; int indent; if (push_state(s, isl_yaml_mapping_key_start) < 0) return -1; tok = isl_stream_next_token(s); if (!tok) { if (s->eof) isl_stream_error(s, NULL, "unexpected EOF"); return -1; } if (isl_token_get_type(tok) == '{') { isl_token_free(tok); return set_yaml_indent(s, ISL_YAML_INDENT_FLOW); } indent = tok->col - 1; isl_stream_push_token(s, tok); return set_yaml_indent(s, indent); } /* Finish reading a YAML mapping. * Return 0 on success and -1 on error. * * If the mapping started with a '{', then we expect a '}' to close * the mapping. * Otherwise, we double-check that the next token (if any) * has a smaller indentation than that of the current mapping. */ int isl_stream_yaml_read_end_mapping(__isl_keep isl_stream *s) { struct isl_token *tok; int indent; if (get_yaml_indent(s) == ISL_YAML_INDENT_FLOW) { if (isl_stream_eat(s, '}') < 0) return -1; return pop_state(s); } tok = isl_stream_next_token(s); if (!tok) return pop_state(s); indent = tok->col - 1; isl_stream_push_token(s, tok); if (indent >= get_yaml_indent(s)) isl_die(isl_stream_get_ctx(s), isl_error_invalid, "mapping not finished", return -1); return pop_state(s); } /* Start reading a YAML sequence. * Return 0 on success and -1 on error. * * If the first token on the stream is a '[' then we remove this token * from the stream and keep track of the fact that the sequence * is given in flow format. * Otherwise, we assume the first token is the dash that introduces * the first element of the sequence and keep track of its indentation, * but keep the token on the stream. * In both cases, the next token we expect is the first element * of the sequence. */ int isl_stream_yaml_read_start_sequence(__isl_keep isl_stream *s) { struct isl_token *tok; int indent; if (push_state(s, isl_yaml_sequence_start) < 0) return -1; tok = isl_stream_next_token(s); if (!tok) { if (s->eof) isl_stream_error(s, NULL, "unexpected EOF"); return -1; } if (isl_token_get_type(tok) == '[') { isl_token_free(tok); return set_yaml_indent(s, ISL_YAML_INDENT_FLOW); } indent = tok->col - 1; isl_stream_push_token(s, tok); return set_yaml_indent(s, indent); } /* Finish reading a YAML sequence. * Return 0 on success and -1 on error. * * If the sequence started with a '[', then we expect a ']' to close * the sequence. * Otherwise, we double-check that the next token (if any) * is not a dash or that it has a smaller indentation than * that of the current sequence. */ int isl_stream_yaml_read_end_sequence(__isl_keep isl_stream *s) { struct isl_token *tok; int indent; int dash; if (get_yaml_indent(s) == ISL_YAML_INDENT_FLOW) { if (isl_stream_eat(s, ']') < 0) return -1; return pop_state(s); } tok = isl_stream_next_token(s); if (!tok) return pop_state(s); indent = tok->col - 1; dash = tok->type == '-'; isl_stream_push_token(s, tok); if (indent >= get_yaml_indent(s) && dash) isl_die(isl_stream_get_ctx(s), isl_error_invalid, "sequence not finished", return -1); return pop_state(s); } cloog-0.18.4/isl/isl_yaml.h0000644000175000017500000000052212554427055012411 00000000000000#ifndef ISL_YAML_H #define ISL_YAML_H #define ISL_YAML_INDENT_FLOW -1 enum isl_yaml_state { isl_yaml_none, isl_yaml_mapping_first_key_start, isl_yaml_mapping_key_start, isl_yaml_mapping_key, isl_yaml_mapping_val_start, isl_yaml_mapping_val, isl_yaml_sequence_first_start, isl_yaml_sequence_start, isl_yaml_sequence }; #endif cloog-0.18.4/isl/isl_vec_private.h0000644000175000017500000000072112413270107013743 00000000000000#ifndef ISL_VEC_PRIVATE_H #define ISL_VEC_PRIVATE_H #include #include struct isl_vec { int ref; struct isl_ctx *ctx; unsigned size; isl_int *el; struct isl_blk block; }; __isl_give isl_vec *isl_vec_cow(__isl_take isl_vec *vec); void isl_vec_lcm(struct isl_vec *vec, isl_int *lcm); int isl_vec_get_element(__isl_keep isl_vec *vec, int pos, isl_int *v); __isl_give isl_vec *isl_vec_set(__isl_take isl_vec *vec, isl_int v); #endif cloog-0.18.4/isl/isl_val_gmp.c0000644000175000017500000000600612413256472013067 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.4/isl/isl_multi_floor.c0000644000175000017500000000111212554427055013771 00000000000000/* * Copyright 2014 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 /* Given f, return floor(f). */ __isl_give MULTI(BASE) *FN(MULTI(BASE),floor)(__isl_take MULTI(BASE) *multi) { int i; multi = FN(MULTI(BASE),cow)(multi); if (!multi) return NULL; for (i = 0; i < multi->n; ++i) { multi->p[i] = FN(EL,floor)(multi->p[i]); if (!multi->p[i]) return FN(MULTI(BASE),free)(multi); } return multi; } cloog-0.18.4/isl/isl_deprecated.c0000644000175000017500000000127612554427055013551 00000000000000#include #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); } /* This function was replaced by isl_constraint_alloc_equality. */ __isl_give isl_constraint *isl_equality_alloc(__isl_take isl_local_space *ls) { return isl_constraint_alloc_equality(ls); } /* This function was replaced by isl_constraint_alloc_inequality. */ __isl_give isl_constraint *isl_inequality_alloc(__isl_take isl_local_space *ls) { return isl_constraint_alloc_inequality(ls); } cloog-0.18.4/isl/isl_reordering.c0000644000175000017500000001036612413271702013577 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; isl_space_dump(exp->dim); for (i = 0; i < exp->len; ++i) fprintf(stderr, "%d -> %d; ", i, exp->pos[i]); fprintf(stderr, "\n"); } cloog-0.18.4/isl/ChangeLog0000644000175000017500000001021112554427055012175 00000000000000version: 0.15 date: Thu Jun 11 12:45:33 CEST 2015 changes: - improve coalescing - add isl_union_access_info_compute_flow - add mark nodes in AST - add isl_union_pw_aff and isl_multi_union_pw_aff - add schedule trees - deprecate band forests - deprecate separation_class AST generation option - introduce isl_bool and isl_stat types --- version: 0.14.1 date: Thu Apr 9 12:57:23 CEST 2015 changes: - fix bug in affine expression normalization - fix handling of conditional validity constraints --- version: 0.14 date: Sat Oct 25 16:08:47 CEST 2014 changes: - support IMath as an optional replacement for GMP - minor AST generator improvements --- version: 0.13 date: Mon Apr 14 11:08:45 CEST 2014 changes: - deprecate isl_int - improved support for multi piecewise quasi-affine expressions - allow the user to impose a bound on the number of low-level operations - add isl_id_to_ast_expr and isl_id_to_pw_aff - add isl_schedule_constraints - hide internal structure of isl_vec - remove support for piplib --- version: 0.12.2 date: Sun Jan 12 12:09:46 CET 2014 changes: - MinGW-w64 build fix - fix simplification bug --- version: 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.4/isl/isl_seq.c0000644000175000017500000001430312554427055012234 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; if (dst == src1 && isl_int_is_one(m1)) { if (isl_int_is_zero(m2)) return; for (i = 0; i < len; ++i) isl_int_addmul(src1[i], m2, src2[i]); return; } 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.4/isl/isl_ctx_private.h0000644000175000017500000000104712413271702013770 00000000000000#include #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; unsigned long operations; unsigned long max_operations; }; int isl_ctx_next_operation(isl_ctx *ctx); cloog-0.18.4/isl/isl_ctx.c0000644000175000017500000001573612413271702012243 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)) /* Check that the result of an allocation ("p") is not NULL and * complain if it is. * The only exception is when allocation size ("size") is equal to zero. */ static void *check_non_null(isl_ctx *ctx, void *p, size_t size) { if (p || size == 0) return p; isl_die(ctx, isl_error_alloc, "allocation failure", return NULL); } /* Prepare for performing the next "operation" in the context. * Return 0 if we are allowed to perform this operation and * return -1 if we should abort the computation. * * In particular, we should stop if the user has explicitly aborted * the computation or if the maximal number of operations has been exceeded. */ int isl_ctx_next_operation(isl_ctx *ctx) { if (!ctx) return -1; if (ctx->abort) { isl_ctx_set_error(ctx, isl_error_abort); return -1; } if (ctx->max_operations && ctx->operations >= ctx->max_operations) isl_die(ctx, isl_error_quota, "maximal number of operations exceeded", return -1); ctx->operations++; return 0; } /* Call malloc and complain if it fails. * If ctx is NULL, then return NULL. */ void *isl_malloc_or_die(isl_ctx *ctx, size_t size) { if (isl_ctx_next_operation(ctx) < 0) return NULL; return ctx ? check_non_null(ctx, malloc(size), size) : NULL; } /* Call calloc and complain if it fails. * If ctx is NULL, then return NULL. */ void *isl_calloc_or_die(isl_ctx *ctx, size_t nmemb, size_t size) { if (isl_ctx_next_operation(ctx) < 0) return NULL; return ctx ? check_non_null(ctx, calloc(nmemb, size), nmemb) : NULL; } /* Call realloc and complain if it fails. * If ctx is NULL, then return NULL. */ void *isl_realloc_or_die(isl_ctx *ctx, void *ptr, size_t size) { if (isl_ctx_next_operation(ctx) < 0) return NULL; return ctx ? check_non_null(ctx, realloc(ptr, size), size) : NULL; } 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) { struct isl_arg *arg = &args->args[i]; void *child; if (arg->type != isl_arg_child) continue; if (arg->offset == (size_t) -1) child = opt; else child = *(void **)(((char *)opt) + arg->offset); options = find_nested_options(arg->u.child.child, child, 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; ctx->operations = 0; isl_ctx_set_max_operations(ctx, ctx->opt->max_operations); 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--; } /* Print statistics on usage. */ static void print_stats(isl_ctx *ctx) { fprintf(stderr, "operations: %lu\n", ctx->operations); } 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); if (ctx->opt->print_stats) print_stats(ctx); 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); } /* Set the maximal number of iterations of "ctx" to "max_operations". */ void isl_ctx_set_max_operations(isl_ctx *ctx, unsigned long max_operations) { if (!ctx) return; ctx->max_operations = max_operations; } /* Return the maximal number of iterations of "ctx". */ unsigned long isl_ctx_get_max_operations(isl_ctx *ctx) { return ctx ? ctx->max_operations : 0; } /* Reset the number of operations performed by "ctx". */ void isl_ctx_reset_operations(isl_ctx *ctx) { if (!ctx) return; ctx->operations = 0; } cloog-0.18.4/isl/isl_bernstein.h0000644000175000017500000000024312413256472013435 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.4/isl/isl_space_private.h0000644000175000017500000000346512554427055014305 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); isl_bool isl_space_is_domain_internal(__isl_keep isl_space *space1, __isl_keep isl_space *space2); isl_bool 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); int isl_space_cmp(__isl_keep isl_space *space1, __isl_keep isl_space *space2); #endif cloog-0.18.4/isl/basis_reduction_tab.c0000644000175000017500000001673412554427055014612 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" #include #include 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; }; #ifdef USE_GMP_FOR_MP #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_numref(a) mpq_numref(a) #define GBR_denref(a) mpq_denref(a) #define GBR_floor(a,b) mpz_fdiv_q(a,GBR_numref(b),GBR_denref(b)) #define GBR_ceil(a,b) mpz_cdiv_q(a,GBR_numref(b),GBR_denref(b)) #endif /* USE_GMP_FOR_MP */ #ifdef USE_IMATH_FOR_MP #include #define GBR_type mp_rat #define GBR_init(v) v = mp_rat_alloc() #define GBR_clear(v) mp_rat_free(v) #define GBR_set(a,b) mp_rat_copy(b,a) #define GBR_set_ui(a,b) mp_rat_set_uvalue(a,b,1) #define GBR_mul(a,b,c) mp_rat_mul(b,c,a) #define GBR_lt(a,b) (mp_rat_compare(a,b) < 0) #define GBR_is_zero(a) (mp_rat_compare_zero(a) == 0) #define GBR_numref(a) mp_rat_numer_ref(a) #define GBR_denref(a) mp_rat_denom_ref(a) #define GBR_floor(a,b) impz_fdiv_q(a,GBR_numref(b),GBR_denref(b)) #define GBR_ceil(a,b) impz_cdiv_q(a,GBR_numref(b),GBR_denref(b)) #endif /* USE_IMATH_FOR_MP */ 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, GBR_type *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, GBR_type *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_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 < 0) return -1; if (res != isl_lp_ok) isl_die(lp->ctx, isl_error_internal, "unexpected missing (bounded) solution", 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, GBR_type *F) { isl_int_neg(GBR_numref(*F), lp->opt); isl_int_set(GBR_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, GBR_type *alpha) { row += lp->con_offset; isl_int_neg(GBR_numref(*alpha), lp->tab->dual->el[1 + row]); isl_int_set(GBR_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.4/isl/isl_ast_build_expr.h0000644000175000017500000000154112554427055014455 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_internal( __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.4/isl/isl_space.c0000644000175000017500000016003112554427055012537 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * Copyright 2010 INRIA Saclay * Copyright 2013-2014 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_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? */ isl_bool isl_space_is_set(__isl_keep isl_space *space) { if (!space) return isl_bool_error; if (space->n_in != 0 || space->nested[0]) return isl_bool_false; if (space->tuple_id[0] != &isl_id_none) return isl_bool_false; return isl_bool_true; } /* Is the given space that of a map? */ isl_bool isl_space_is_map(__isl_keep isl_space *space) { if (!space) return isl_bool_error; 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? */ isl_bool isl_space_is_params(__isl_keep isl_space *space) { if (!space) return isl_bool_error; if (space->n_in != 0 || space->nested[0] || space->n_out != 0 || space->nested[1]) return isl_bool_false; if (space->tuple_id[0] != &isl_id_none) return isl_bool_false; if (space->tuple_id[1] != &isl_id_none) return isl_bool_false; return isl_bool_true; } /* 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; } __isl_null isl_space *isl_space_free(__isl_take isl_space *space) { int i; if (!space) return NULL; if (--space->ref > 0) return NULL; isl_id_free(space->tuple_id[0]); isl_id_free(space->tuple_id[1]); isl_space_free(space->nested[0]); isl_space_free(space->nested[1]); for (i = 0; i < space->n_id; ++i) isl_id_free(space->ids[i]); free(space->ids); isl_ctx_deref(space->ctx); free(space); 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? */ isl_bool isl_space_has_tuple_id(__isl_keep isl_space *dim, enum isl_dim_type type) { if (!space_can_have_id(dim, type)) return isl_bool_error; 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; } isl_bool isl_space_has_dim_id(__isl_keep isl_space *dim, enum isl_dim_type type, unsigned pos) { if (!dim) return isl_bool_error; 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? */ isl_bool 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 isl_bool_error; 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? */ isl_bool isl_space_has_dim_name(__isl_keep isl_space *space, enum isl_dim_type type, unsigned pos) { isl_id *id; if (!space) return isl_bool_error; 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; } /* Reset the user pointer on all identifiers of parameters and tuples * of "space". */ __isl_give isl_space *isl_space_reset_user(__isl_take isl_space *space) { int i; isl_ctx *ctx; isl_id *id; const char *name; if (!space) return NULL; ctx = isl_space_get_ctx(space); for (i = 0; i < space->nparam && i < space->n_id; ++i) { if (!isl_id_get_user(space->ids[i])) continue; space = isl_space_cow(space); if (!space) return NULL; name = isl_id_get_name(space->ids[i]); id = isl_id_alloc(ctx, name, NULL); isl_id_free(space->ids[i]); space->ids[i] = id; if (!id) return isl_space_free(space); } for (i = 0; i < 2; ++i) { if (!space->tuple_id[i]) continue; if (!isl_id_get_user(space->tuple_id[i])) continue; space = isl_space_cow(space); if (!space) return NULL; name = isl_id_get_name(space->tuple_id[i]); id = isl_id_alloc(ctx, name, NULL); isl_id_free(space->tuple_id[i]); space->tuple_id[i] = id; if (!id) return isl_space_free(space); } for (i = 0; i < 2; ++i) { if (!space->nested[i]) continue; space = isl_space_cow(space); if (!space) return NULL; space->nested[i] = isl_space_reset_user(space->nested[i]); if (!space->nested[i]) return isl_space_free(space); } return space; } 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; } /* Are the two spaces the same, apart from positions and names of parameters? */ static int isl_space_has_equal_tuples(__isl_keep isl_space *space1, __isl_keep isl_space *space2) { if (!space1 || !space2) return -1; if (space1 == space2) return 1; return isl_space_tuple_is_equal(space1, isl_dim_in, space2, isl_dim_in) && isl_space_tuple_is_equal(space1, isl_dim_out, space2, isl_dim_out); } /* Check if the tuple of type "type1" of "space1" is the same as * the tuple of type "type2" of "space2". * * That is, check if the tuples have the same identifier, the same dimension * and the same internal structure. * The identifiers of the dimensions inside the tuples do not affect the result. * * Note that this function only checks the tuples themselves. * If nested tuples are involved, then we need to be careful not * to have result affected by possibly differing parameters * in those nested tuples. */ isl_bool isl_space_tuple_is_equal(__isl_keep isl_space *space1, enum isl_dim_type type1, __isl_keep isl_space *space2, enum isl_dim_type type2) { isl_id *id1, *id2; isl_space *nested1, *nested2; if (!space1 || !space2) return isl_bool_error; if (space1 == space2 && type1 == type2) return isl_bool_true; if (n(space1, type1) != n(space2, type2)) return isl_bool_false; id1 = tuple_id(space1, type1); id2 = tuple_id(space2, type2); if (!id1 ^ !id2) return isl_bool_false; if (id1 && id1 != id2) return isl_bool_false; nested1 = nested(space1, type1); nested2 = nested(space2, type2); if (!nested1 ^ !nested2) return isl_bool_false; if (nested1 && !isl_space_has_equal_tuples(nested1, nested2)) return isl_bool_false; return isl_bool_true; } /* This is the old, undocumented, name for isl_space_tuple_is_equal. * It will be removed at some point. */ int isl_space_tuple_match(__isl_keep isl_space *space1, enum isl_dim_type type1, __isl_keep isl_space *space2, enum isl_dim_type type2) { return isl_space_tuple_is_equal(space1, type1, space2, type2); } 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_is_equal(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 *space, unsigned nparam, unsigned n_in, unsigned n_out) { isl_id **ids = NULL; if (!space) return NULL; if (space->nparam == nparam && space->n_in == n_in && space->n_out == n_out) return space; isl_assert(space->ctx, space->nparam <= nparam, goto error); isl_assert(space->ctx, space->n_in <= n_in, goto error); isl_assert(space->ctx, space->n_out <= n_out, goto error); space = isl_space_cow(space); if (!space) goto error; if (space->ids) { unsigned n; n = nparam + n_in + n_out; if (n < nparam || n < n_in || n < n_out) isl_die(isl_space_get_ctx(space), isl_error_invalid, "overflow in total number of dimensions", goto error); ids = isl_calloc_array(space->ctx, isl_id *, n); if (!ids) goto error; get_ids(space, isl_dim_param, 0, space->nparam, ids); get_ids(space, isl_dim_in, 0, space->n_in, ids + nparam); get_ids(space, isl_dim_out, 0, space->n_out, ids + nparam + n_in); free(space->ids); space->ids = ids; space->n_id = nparam + n_in + n_out; } space->nparam = nparam; space->n_in = n_in; space->n_out = n_out; return space; error: free(ids); isl_space_free(space); return NULL; } __isl_give isl_space *isl_space_add_dims(__isl_take isl_space *dim, enum isl_dim_type type, unsigned n) { dim = isl_space_reset(dim, type); if (!dim) return NULL; 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) { dim = isl_space_reset(dim, src_type); return isl_space_reset(dim, dst_type); } 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_is_equal(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; } /* Given two map spaces { A -> C } and { B -> D }, construct the space * { [A -> B] -> [C -> D] }. * Given two set spaces { A } and { B }, construct the space { [A -> B] }. */ __isl_give isl_space *isl_space_product(__isl_take isl_space *left, __isl_take isl_space *right) { isl_space *dom1, *dom2, *nest1, *nest2; int is_set; if (!left || !right) goto error; is_set = isl_space_is_set(left); if (is_set != isl_space_is_set(right)) isl_die(isl_space_get_ctx(left), isl_error_invalid, "expecting either two set spaces or two map spaces", goto error); if (is_set) return isl_space_range_product(left, right); 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_is_equal(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_is_equal(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; } /* Given a space of the form [A -> B] -> [C -> D], return the space A -> C. */ __isl_give isl_space *isl_space_factor_domain(__isl_take isl_space *space) { space = isl_space_domain_factor_domain(space); space = isl_space_range_factor_domain(space); return space; } /* Given a space of the form [A -> B] -> [C -> D], return the space B -> D. */ __isl_give isl_space *isl_space_factor_range(__isl_take isl_space *space) { space = isl_space_domain_factor_range(space); space = isl_space_range_factor_range(space); return space; } /* Given a space of the form [A -> B] -> C, return the space A -> C. */ __isl_give isl_space *isl_space_domain_factor_domain( __isl_take isl_space *space) { isl_space *nested; isl_space *domain; if (!space) return NULL; if (!isl_space_domain_is_wrapping(space)) isl_die(isl_space_get_ctx(space), isl_error_invalid, "domain not a product", return isl_space_free(space)); nested = space->nested[0]; domain = isl_space_copy(space); domain = isl_space_drop_dims(domain, isl_dim_in, nested->n_in, nested->n_out); if (!domain) return isl_space_free(space); if (nested->tuple_id[0]) { domain->tuple_id[0] = isl_id_copy(nested->tuple_id[0]); if (!domain->tuple_id[0]) goto error; } if (nested->nested[0]) { domain->nested[0] = isl_space_copy(nested->nested[0]); if (!domain->nested[0]) goto error; } isl_space_free(space); return domain; error: isl_space_free(space); isl_space_free(domain); return NULL; } /* Given a space of the form [A -> B] -> C, return the space B -> C. */ __isl_give isl_space *isl_space_domain_factor_range( __isl_take isl_space *space) { isl_space *nested; isl_space *range; if (!space) return NULL; if (!isl_space_domain_is_wrapping(space)) isl_die(isl_space_get_ctx(space), isl_error_invalid, "domain not a product", return isl_space_free(space)); nested = space->nested[0]; range = isl_space_copy(space); range = isl_space_drop_dims(range, isl_dim_in, 0, nested->n_in); if (!range) return isl_space_free(space); if (nested->tuple_id[1]) { range->tuple_id[0] = isl_id_copy(nested->tuple_id[1]); if (!range->tuple_id[0]) goto error; } if (nested->nested[1]) { range->nested[0] = isl_space_copy(nested->nested[1]); if (!range->nested[0]) goto error; } isl_space_free(space); return range; error: isl_space_free(space); isl_space_free(range); return NULL; } /* Given a space of the form A -> [B -> C], return the space A -> B. */ __isl_give isl_space *isl_space_range_factor_domain( __isl_take isl_space *space) { isl_space *nested; isl_space *domain; if (!space) return NULL; if (!isl_space_range_is_wrapping(space)) isl_die(isl_space_get_ctx(space), isl_error_invalid, "range not a product", return isl_space_free(space)); nested = space->nested[1]; domain = isl_space_copy(space); domain = isl_space_drop_dims(domain, isl_dim_out, nested->n_in, nested->n_out); if (!domain) return isl_space_free(space); if (nested->tuple_id[0]) { domain->tuple_id[1] = isl_id_copy(nested->tuple_id[0]); if (!domain->tuple_id[1]) goto error; } if (nested->nested[0]) { domain->nested[1] = isl_space_copy(nested->nested[0]); if (!domain->nested[1]) goto error; } isl_space_free(space); return domain; error: isl_space_free(space); isl_space_free(domain); return NULL; } /* Given a space of the form A -> [B -> C], return the space A -> C. */ __isl_give isl_space *isl_space_range_factor_range( __isl_take isl_space *space) { isl_space *nested; isl_space *range; if (!space) return NULL; if (!isl_space_range_is_wrapping(space)) isl_die(isl_space_get_ctx(space), isl_error_invalid, "range not a product", return isl_space_free(space)); nested = space->nested[1]; range = isl_space_copy(space); range = isl_space_drop_dims(range, isl_dim_out, 0, nested->n_in); if (!range) return isl_space_free(space); if (nested->tuple_id[1]) { range->tuple_id[1] = isl_id_copy(nested->tuple_id[1]); if (!range->tuple_id[1]) goto error; } if (nested->nested[1]) { range->nested[1] = isl_space_copy(nested->nested[1]); if (!range->nested[1]) goto error; } isl_space_free(space); return range; error: isl_space_free(space); isl_space_free(range); 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); if (first + num > n(dim, type) || first + num < first) isl_die(isl_space_get_ctx(dim), isl_error_invalid, "index out of bounds", return isl_space_free(dim)); 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; } /* Given a map space A -> B, return the map space [A -> B] -> A. */ __isl_give isl_space *isl_space_domain_map(__isl_take isl_space *space) { isl_space *domain; domain = isl_space_from_range(isl_space_domain(isl_space_copy(space))); space = isl_space_from_domain(isl_space_wrap(space)); space = isl_space_join(space, domain); return space; } /* Given a map space A -> B, return the map space [A -> B] -> B. */ __isl_give isl_space *isl_space_range_map(__isl_take isl_space *space) { isl_space *range; range = isl_space_from_range(isl_space_range(isl_space_copy(space))); space = isl_space_from_domain(isl_space_wrap(space)); space = isl_space_join(space, range); return space; } __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? */ isl_bool isl_space_is_equal(__isl_keep isl_space *dim1, __isl_keep isl_space *dim2) { if (!dim1 || !dim2) return isl_bool_error; if (dim1 == dim2) return isl_bool_true; return match(dim1, isl_dim_param, dim2, isl_dim_param) && isl_space_tuple_is_equal(dim1, isl_dim_in, dim2, isl_dim_in) && isl_space_tuple_is_equal(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. */ isl_bool isl_space_is_domain_internal(__isl_keep isl_space *space1, __isl_keep isl_space *space2) { if (!space1 || !space2) return isl_bool_error; if (!isl_space_is_set(space1)) return isl_bool_false; return match(space1, isl_dim_param, space2, isl_dim_param) && isl_space_tuple_is_equal(space1, isl_dim_set, space2, isl_dim_in); } /* Is space1 equal to the domain of space2? */ isl_bool isl_space_is_domain(__isl_keep isl_space *space1, __isl_keep isl_space *space2) { if (!space2) return isl_bool_error; if (!isl_space_is_map(space2)) return isl_bool_false; 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. */ isl_bool isl_space_is_range_internal(__isl_keep isl_space *space1, __isl_keep isl_space *space2) { if (!space1 || !space2) return isl_bool_error; if (!isl_space_is_set(space1)) return isl_bool_false; return match(space1, isl_dim_param, space2, isl_dim_param) && isl_space_tuple_is_equal(space1, isl_dim_set, space2, isl_dim_out); } /* Is space1 equal to the range of space2? */ isl_bool isl_space_is_range(__isl_keep isl_space *space1, __isl_keep isl_space *space2) { if (!space2) return isl_bool_error; if (!isl_space_is_map(space2)) return isl_bool_false; 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; } isl_bool isl_space_is_wrapping(__isl_keep isl_space *dim) { if (!dim) return isl_bool_error; if (!isl_space_is_set(dim)) return isl_bool_false; return dim->nested[1] != NULL; } /* Is "space" the space of a map where the domain is a wrapped map space? */ isl_bool isl_space_domain_is_wrapping(__isl_keep isl_space *space) { if (!space) return isl_bool_error; if (isl_space_is_set(space)) return isl_bool_false; return space->nested[0] != NULL; } /* Is "space" the space of a map where the range is a wrapped map space? */ isl_bool isl_space_range_is_wrapping(__isl_keep isl_space *space) { if (!space) return isl_bool_error; if (isl_space_is_set(space)) return isl_bool_false; return space->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; } isl_bool isl_space_can_zip(__isl_keep isl_space *dim) { if (!dim) return isl_bool_error; 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? */ isl_bool isl_space_can_curry(__isl_keep isl_space *space) { if (!space) return isl_bool_error; 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? */ isl_bool isl_space_can_uncurry(__isl_keep isl_space *space) { if (!space) return isl_bool_error; 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; } /* Compare the "type" dimensions of two isl_spaces. * * The order is fairly arbitrary. */ static int isl_space_cmp_type(__isl_keep isl_space *space1, __isl_keep isl_space *space2, enum isl_dim_type type) { int cmp; isl_space *nested1, *nested2; if (isl_space_dim(space1, type) != isl_space_dim(space2, type)) return isl_space_dim(space1, type) - isl_space_dim(space2, type); cmp = isl_id_cmp(tuple_id(space1, type), tuple_id(space2, type)); if (cmp != 0) return cmp; nested1 = nested(space1, type); nested2 = nested(space2, type); if (!nested1 != !nested2) return !nested1 - !nested2; if (nested1) return isl_space_cmp(nested1, nested2); return 0; } /* Compare two isl_spaces. * * The order is fairly arbitrary. */ int isl_space_cmp(__isl_keep isl_space *space1, __isl_keep isl_space *space2) { int i; int cmp; if (space1 == space2) return 0; if (!space1) return -1; if (!space2) return 1; cmp = isl_space_cmp_type(space1, space2, isl_dim_param); if (cmp != 0) return cmp; cmp = isl_space_cmp_type(space1, space2, isl_dim_in); if (cmp != 0) return cmp; cmp = isl_space_cmp_type(space1, space2, isl_dim_out); if (cmp != 0) return cmp; if (!space1->ids && !space2->ids) return 0; for (i = 0; i < n(space1, isl_dim_param); ++i) { cmp = isl_id_cmp(get_id(space1, isl_dim_param, i), get_id(space2, isl_dim_param, i)); if (cmp != 0) return cmp; } return 0; } cloog-0.18.4/isl/isl_fold.c0000644000175000017500000011716612554427055012403 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 #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; } /* Determine the sign of the constant quasipolynomial "qp". * * Return * -1 if qp <= 0 * 1 if qp >= 0 * 0 if unknown * * For qp == 0, we can return either -1 or 1. In practice, we return 1. * For qp == NaN, the sign is undefined, so we return 0. */ static int isl_qpolynomial_cst_sign(__isl_keep isl_qpolynomial *qp) { struct isl_upoly_cst *cst; if (isl_qpolynomial_is_nan(qp)) return 0; 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; } /* Combine "fold1" and "fold2" into a single reduction, eliminating * those elements of one reduction that are already covered by the other * reduction on "set". * * If "fold1" or "fold2" is an empty reduction, then return * the other reduction. * If "fold1" or "fold2" is a NaN, then return this NaN. */ __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_is_nan(fold2)) { isl_qpolynomial_fold_free(fold1); return fold2; } if (isl_qpolynomial_fold_is_empty(fold2) || isl_qpolynomial_fold_is_nan(fold1)) { 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, equal; equal = isl_qpolynomial_plain_is_equal(res->qp[j], fold2->qp[i]); if (equal < 0) goto error; if (equal) break; 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_SUB #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 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; } /* Does "fold" represent max(NaN) or min(NaN)? */ isl_bool isl_qpolynomial_fold_is_nan(__isl_keep isl_qpolynomial_fold *fold) { if (!fold) return isl_bool_error; if (fold->n != 1) return isl_bool_false; return isl_qpolynomial_is_nan(fold->qp[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->space->ctx, isl_space_match(part->dim, isl_dim_param, u->space, isl_dim_param), goto error); hash = isl_space_get_hash(part->dim); entry = isl_hash_table_find(u->space->ctx, &u->table, hash, &isl_union_pw_qpolynomial_fold_has_same_domain_space, 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 isl_stat 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 isl_stat_ok; } __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_val *isl_qpolynomial_fold_eval( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_point *pnt) { isl_ctx *ctx; isl_val *v; if (!fold || !pnt) goto error; ctx = isl_point_get_ctx(pnt); 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) v = isl_val_zero(ctx); else { int i; v = isl_qpolynomial_eval(isl_qpolynomial_copy(fold->qp[0]), isl_point_copy(pnt)); for (i = 1; i < fold->n; ++i) { isl_val *v_i; v_i = isl_qpolynomial_eval( isl_qpolynomial_copy(fold->qp[i]), isl_point_copy(pnt)); if (fold->type == isl_fold_max) v = isl_val_max(v, v_i); else v = isl_val_min(v, v_i); } } isl_qpolynomial_fold_free(fold); isl_point_free(pnt); return v; 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_val *isl_qpolynomial_fold_opt_on_domain( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_set *set, int max) { int i; isl_val *opt; if (!set || !fold) goto error; if (fold->n == 0) { opt = isl_val_zero(isl_set_get_ctx(set)); isl_set_free(set); isl_qpolynomial_fold_free(fold); return opt; } 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_val *opt_i; opt_i = isl_qpolynomial_opt_on_domain( isl_qpolynomial_copy(fold->qp[i]), isl_set_copy(set), max); if (max) opt = isl_val_max(opt, opt_i); else opt = isl_val_min(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; } isl_stat isl_qpolynomial_fold_foreach_qpolynomial( __isl_keep isl_qpolynomial_fold *fold, isl_stat (*fn)(__isl_take isl_qpolynomial *qp, void *user), void *user) { int i; if (!fold) return isl_stat_error; for (i = 0; i < fold->n; ++i) if (fn(isl_qpolynomial_copy(fold->qp[i]), user) < 0) return isl_stat_error; return isl_stat_ok; } __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 isl_stat 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, &isl_union_pw_qpolynomial_fold_has_same_domain_space, 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 isl_stat_error; 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 isl_stat_ok; error: isl_pw_qpolynomial_free(pwqp); return isl_stat_error; } __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_is_equal(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 isl_stat 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 isl_stat_ok; } static isl_stat map_apply(__isl_take isl_map *map, void *user) { struct isl_apply_fold_data *data = user; isl_stat 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; } /* Divide "fold" by "v". */ __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_scale_down_val( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_val *v) { if (!fold || !v) goto error; if (isl_val_is_one(v)) { isl_val_free(v); return fold; } if (!isl_val_is_rat(v)) isl_die(isl_qpolynomial_fold_get_ctx(fold), isl_error_invalid, "expecting rational factor", goto error); if (isl_val_is_zero(v)) isl_die(isl_val_get_ctx(v), isl_error_invalid, "cannot scale down by zero", goto error); return isl_qpolynomial_fold_scale_val(fold, isl_val_inv(v)); error: isl_val_free(v); isl_qpolynomial_fold_free(fold); return NULL; } cloog-0.18.4/isl/isl_map_to_basic_set.c0000644000175000017500000000036212413270107014723 00000000000000#include #include #include #define KEY_BASE map #define KEY_EQUAL isl_map_plain_is_equal #define VAL_BASE basic_set #define VAL_EQUAL isl_basic_set_plain_is_equal #include cloog-0.18.4/isl/polyhedron_minimize.c0000644000175000017500000000460412413270107014650 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 /* 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.4/isl/isl_schedule_band.c0000644000175000017500000007440112554427055014231 00000000000000/* * Copyright 2013-2014 Ecole Normale Superieure * Copyright 2014 INRIA Rocquencourt * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, * Ecole Normale Superieure, 45 rue d'Ulm, 75230 Paris, France * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt, * B.P. 105 - 78153 Le Chesnay, France */ #include #include #include #include #include isl_ctx *isl_schedule_band_get_ctx(__isl_keep isl_schedule_band *band) { return band ? isl_multi_union_pw_aff_get_ctx(band->mupa) : NULL; } /* Return a new uninitialized isl_schedule_band. */ static __isl_give isl_schedule_band *isl_schedule_band_alloc(isl_ctx *ctx) { isl_schedule_band *band; band = isl_calloc_type(ctx, isl_schedule_band); if (!band) return NULL; band->ref = 1; return band; } /* Return a new isl_schedule_band with partial schedule "mupa". * First replace "mupa" by its greatest integer part to ensure * that the schedule is always integral. * The band is not marked permutable, the dimensions are not * marked coincident and the AST build options are empty. * Since there are no build options, the node is not anchored. */ __isl_give isl_schedule_band *isl_schedule_band_from_multi_union_pw_aff( __isl_take isl_multi_union_pw_aff *mupa) { isl_ctx *ctx; isl_schedule_band *band; isl_space *space; mupa = isl_multi_union_pw_aff_floor(mupa); if (!mupa) return NULL; ctx = isl_multi_union_pw_aff_get_ctx(mupa); band = isl_schedule_band_alloc(ctx); if (!band) goto error; band->n = isl_multi_union_pw_aff_dim(mupa, isl_dim_set); band->coincident = isl_calloc_array(ctx, int, band->n); band->mupa = mupa; space = isl_space_params_alloc(ctx, 0); band->ast_build_options = isl_union_set_empty(space); band->anchored = 0; if ((band->n && !band->coincident) || !band->ast_build_options) return isl_schedule_band_free(band); return band; error: isl_multi_union_pw_aff_free(mupa); return NULL; } /* Create a duplicate of the given isl_schedule_band. */ __isl_give isl_schedule_band *isl_schedule_band_dup( __isl_keep isl_schedule_band *band) { int i; isl_ctx *ctx; isl_schedule_band *dup; if (!band) return NULL; ctx = isl_schedule_band_get_ctx(band); dup = isl_schedule_band_alloc(ctx); if (!dup) return NULL; dup->n = band->n; dup->coincident = isl_alloc_array(ctx, int, band->n); if (band->n && !dup->coincident) return isl_schedule_band_free(dup); for (i = 0; i < band->n; ++i) dup->coincident[i] = band->coincident[i]; dup->permutable = band->permutable; dup->mupa = isl_multi_union_pw_aff_copy(band->mupa); dup->ast_build_options = isl_union_set_copy(band->ast_build_options); if (!dup->mupa || !dup->ast_build_options) return isl_schedule_band_free(dup); if (band->loop_type) { dup->loop_type = isl_alloc_array(ctx, enum isl_ast_loop_type, band->n); if (band->n && !dup->loop_type) return isl_schedule_band_free(dup); for (i = 0; i < band->n; ++i) dup->loop_type[i] = band->loop_type[i]; } if (band->isolate_loop_type) { dup->isolate_loop_type = isl_alloc_array(ctx, enum isl_ast_loop_type, band->n); if (band->n && !dup->isolate_loop_type) return isl_schedule_band_free(dup); for (i = 0; i < band->n; ++i) dup->isolate_loop_type[i] = band->isolate_loop_type[i]; } return dup; } /* Return an isl_schedule_band that is equal to "band" and that has only * a single reference. */ __isl_give isl_schedule_band *isl_schedule_band_cow( __isl_take isl_schedule_band *band) { if (!band) return NULL; if (band->ref == 1) return band; band->ref--; return isl_schedule_band_dup(band); } /* Return a new reference to "band". */ __isl_give isl_schedule_band *isl_schedule_band_copy( __isl_keep isl_schedule_band *band) { if (!band) return NULL; band->ref++; return band; } /* Free a reference to "band" and return NULL. */ __isl_null isl_schedule_band *isl_schedule_band_free( __isl_take isl_schedule_band *band) { if (!band) return NULL; if (--band->ref > 0) return NULL; isl_multi_union_pw_aff_free(band->mupa); isl_union_set_free(band->ast_build_options); free(band->loop_type); free(band->isolate_loop_type); free(band->coincident); free(band); return NULL; } /* Are "band1" and "band2" obviously equal? */ isl_bool isl_schedule_band_plain_is_equal(__isl_keep isl_schedule_band *band1, __isl_keep isl_schedule_band *band2) { int i; isl_bool equal; if (!band1 || !band2) return isl_bool_error; if (band1 == band2) return isl_bool_true; if (band1->n != band2->n) return isl_bool_false; for (i = 0; i < band1->n; ++i) if (band1->coincident[i] != band2->coincident[i]) return isl_bool_false; if (band1->permutable != band2->permutable) return isl_bool_false; equal = isl_multi_union_pw_aff_plain_is_equal(band1->mupa, band2->mupa); if (equal < 0 || !equal) return equal; if (!band1->loop_type != !band2->loop_type) return isl_bool_false; if (band1->loop_type) for (i = 0; i < band1->n; ++i) if (band1->loop_type[i] != band2->loop_type[i]) return isl_bool_false; if (!band1->isolate_loop_type != !band2->isolate_loop_type) return isl_bool_false; if (band1->isolate_loop_type) for (i = 0; i < band1->n; ++i) if (band1->isolate_loop_type[i] != band2->isolate_loop_type[i]) return isl_bool_false; return isl_union_set_is_equal(band1->ast_build_options, band2->ast_build_options); } /* Return the number of scheduling dimensions in the band. */ int isl_schedule_band_n_member(__isl_keep isl_schedule_band *band) { return band ? band->n : 0; } /* Is the given scheduling dimension coincident within the band and * with respect to the coincidence constraints? */ isl_bool isl_schedule_band_member_get_coincident( __isl_keep isl_schedule_band *band, int pos) { if (!band) return isl_bool_error; if (pos < 0 || pos >= band->n) isl_die(isl_schedule_band_get_ctx(band), isl_error_invalid, "invalid member position", return isl_bool_error); return band->coincident[pos]; } /* Mark the given scheduling dimension as being coincident or not * according to "coincident". */ __isl_give isl_schedule_band *isl_schedule_band_member_set_coincident( __isl_take isl_schedule_band *band, int pos, int coincident) { if (!band) return NULL; if (isl_schedule_band_member_get_coincident(band, pos) == coincident) return band; band = isl_schedule_band_cow(band); if (!band) return NULL; if (pos < 0 || pos >= band->n) isl_die(isl_schedule_band_get_ctx(band), isl_error_invalid, "invalid member position", isl_schedule_band_free(band)); band->coincident[pos] = coincident; return band; } /* Is the schedule band mark permutable? */ isl_bool isl_schedule_band_get_permutable(__isl_keep isl_schedule_band *band) { if (!band) return isl_bool_error; return band->permutable; } /* Mark the schedule band permutable or not according to "permutable"? */ __isl_give isl_schedule_band *isl_schedule_band_set_permutable( __isl_take isl_schedule_band *band, int permutable) { if (!band) return NULL; if (band->permutable == permutable) return band; band = isl_schedule_band_cow(band); if (!band) return NULL; band->permutable = permutable; return band; } /* Is the band node "node" anchored? That is, does it reference * the outer band nodes? */ int isl_schedule_band_is_anchored(__isl_keep isl_schedule_band *band) { return band ? band->anchored : -1; } /* Return the schedule space of the band. */ __isl_give isl_space *isl_schedule_band_get_space( __isl_keep isl_schedule_band *band) { if (!band) return NULL; return isl_multi_union_pw_aff_get_space(band->mupa); } /* Intersect the domain of the band schedule of "band" with "domain". */ __isl_give isl_schedule_band *isl_schedule_band_intersect_domain( __isl_take isl_schedule_band *band, __isl_take isl_union_set *domain) { band = isl_schedule_band_cow(band); if (!band || !domain) goto error; band->mupa = isl_multi_union_pw_aff_intersect_domain(band->mupa, domain); if (!band->mupa) return isl_schedule_band_free(band); return band; error: isl_schedule_band_free(band); isl_union_set_free(domain); return NULL; } /* Return the schedule of the band in isolation. */ __isl_give isl_multi_union_pw_aff *isl_schedule_band_get_partial_schedule( __isl_keep isl_schedule_band *band) { return band ? isl_multi_union_pw_aff_copy(band->mupa) : NULL; } /* Replace the schedule of "band" by "schedule". */ __isl_give isl_schedule_band *isl_schedule_band_set_partial_schedule( __isl_take isl_schedule_band *band, __isl_take isl_multi_union_pw_aff *schedule) { band = isl_schedule_band_cow(band); if (!band || !schedule) goto error; isl_multi_union_pw_aff_free(band->mupa); band->mupa = schedule; return band; error: isl_schedule_band_free(band); isl_multi_union_pw_aff_free(schedule); return NULL; } /* Return the loop AST generation type for the band member of "band" * at position "pos". */ enum isl_ast_loop_type isl_schedule_band_member_get_ast_loop_type( __isl_keep isl_schedule_band *band, int pos) { if (!band) return isl_ast_loop_error; if (pos < 0 || pos >= band->n) isl_die(isl_schedule_band_get_ctx(band), isl_error_invalid, "invalid member position", return -1); if (!band->loop_type) return isl_ast_loop_default; return band->loop_type[pos]; } /* Set the loop AST generation type for the band member of "band" * at position "pos" to "type". */ __isl_give isl_schedule_band *isl_schedule_band_member_set_ast_loop_type( __isl_take isl_schedule_band *band, int pos, enum isl_ast_loop_type type) { if (!band) return NULL; if (isl_schedule_band_member_get_ast_loop_type(band, pos) == type) return band; if (pos < 0 || pos >= band->n) isl_die(isl_schedule_band_get_ctx(band), isl_error_invalid, "invalid member position", isl_schedule_band_free(band)); band = isl_schedule_band_cow(band); if (!band) return isl_schedule_band_free(band); if (!band->loop_type) { isl_ctx *ctx; ctx = isl_schedule_band_get_ctx(band); band->loop_type = isl_calloc_array(ctx, enum isl_ast_loop_type, band->n); if (band->n && !band->loop_type) return isl_schedule_band_free(band); } band->loop_type[pos] = type; return band; } /* Return the loop AST generation type for the band member of "band" * at position "pos" for the part that has been isolated by the isolate option. */ enum isl_ast_loop_type isl_schedule_band_member_get_isolate_ast_loop_type( __isl_keep isl_schedule_band *band, int pos) { if (!band) return isl_ast_loop_error; if (pos < 0 || pos >= band->n) isl_die(isl_schedule_band_get_ctx(band), isl_error_invalid, "invalid member position", return -1); if (!band->isolate_loop_type) return isl_ast_loop_default; return band->isolate_loop_type[pos]; } /* Set the loop AST generation type for the band member of "band" * at position "pos" to "type" for the part that has been isolated * by the isolate option. */ __isl_give isl_schedule_band * isl_schedule_band_member_set_isolate_ast_loop_type( __isl_take isl_schedule_band *band, int pos, enum isl_ast_loop_type type) { if (!band) return NULL; if (isl_schedule_band_member_get_isolate_ast_loop_type(band, pos) == type) return band; if (pos < 0 || pos >= band->n) isl_die(isl_schedule_band_get_ctx(band), isl_error_invalid, "invalid member position", isl_schedule_band_free(band)); band = isl_schedule_band_cow(band); if (!band) return isl_schedule_band_free(band); if (!band->isolate_loop_type) { isl_ctx *ctx; ctx = isl_schedule_band_get_ctx(band); band->isolate_loop_type = isl_calloc_array(ctx, enum isl_ast_loop_type, band->n); if (band->n && !band->isolate_loop_type) return isl_schedule_band_free(band); } band->isolate_loop_type[pos] = type; return band; } static const char *option_str[] = { [isl_ast_loop_atomic] = "atomic", [isl_ast_loop_unroll] = "unroll", [isl_ast_loop_separate] = "separate" }; /* Given a parameter space "space", extend it to a set space * * { type[x] } * * or * * { [isolate[] -> type[x]] } * * depending on whether "isolate" is set. * These can be used to encode loop AST generation options of the given type. */ static __isl_give isl_space *loop_type_space(__isl_take isl_space *space, enum isl_ast_loop_type type, int isolate) { const char *name; name = option_str[type]; space = isl_space_set_from_params(space); space = isl_space_add_dims(space, isl_dim_set, 1); space = isl_space_set_tuple_name(space, isl_dim_set, name); if (!isolate) return space; space = isl_space_from_range(space); space = isl_space_set_tuple_name(space, isl_dim_in, "isolate"); space = isl_space_wrap(space); return space; } /* Add encodings of the "n" loop AST generation options "type" to "options". * If "isolate" is set, then these options refer to the isolated part. * * In particular, for each sequence of consecutive identical types "t", * different from the default, add an option * * { t[x] : first <= x <= last } * * or * * { [isolate[] -> t[x]] : first <= x <= last } */ static __isl_give isl_union_set *add_loop_types( __isl_take isl_union_set *options, int n, enum isl_ast_loop_type *type, int isolate) { int i; isl_ctx *ctx; if (!type) return options; if (!options) return NULL; ctx = isl_union_set_get_ctx(options); for (i = 0; i < n; ++i) { int first; isl_space *space; isl_set *option; if (type[i] == isl_ast_loop_default) continue; first = i; while (i + 1 < n && type[i + 1] == type[i]) ++i; space = isl_union_set_get_space(options); space = loop_type_space(space, type[i], isolate); option = isl_set_universe(space); option = isl_set_lower_bound_si(option, isl_dim_set, 0, first); option = isl_set_upper_bound_si(option, isl_dim_set, 0, i); options = isl_union_set_add_set(options, option); } return options; } /* Return the AST build options associated to "band". */ __isl_give isl_union_set *isl_schedule_band_get_ast_build_options( __isl_keep isl_schedule_band *band) { isl_union_set *options; if (!band) return NULL; options = isl_union_set_copy(band->ast_build_options); options = add_loop_types(options, band->n, band->loop_type, 0); options = add_loop_types(options, band->n, band->isolate_loop_type, 1); return options; } /* Does "uset" contain any set that satisfies "is"? * "is" is assumed to set its integer argument to 1 if it is satisfied. */ static int has_any(__isl_keep isl_union_set *uset, isl_stat (*is)(__isl_take isl_set *set, void *user)) { int found = 0; if (isl_union_set_foreach_set(uset, is, &found) < 0 && !found) return -1; return found; } /* Does "set" live in a space of the form * * isolate[[...] -> [...]] * * ? * * If so, set *found and abort the search. */ static isl_stat is_isolate(__isl_take isl_set *set, void *user) { int *found = user; if (isl_set_has_tuple_name(set)) { const char *name; name = isl_set_get_tuple_name(set); if (isl_set_is_wrapping(set) && !strcmp(name, "isolate")) *found = 1; } isl_set_free(set); return *found ? isl_stat_error : isl_stat_ok; } /* Does "options" include an option of the ofrm * * isolate[[...] -> [...]] * * ? */ static int has_isolate_option(__isl_keep isl_union_set *options) { return has_any(options, &is_isolate); } /* Does "set" encode a loop AST generation option? */ static isl_stat is_loop_type_option(__isl_take isl_set *set, void *user) { int *found = user; if (isl_set_dim(set, isl_dim_set) == 1 && isl_set_has_tuple_name(set)) { const char *name; enum isl_ast_loop_type type; name = isl_set_get_tuple_name(set); for (type = isl_ast_loop_atomic; type <= isl_ast_loop_separate; ++type) { if (strcmp(name, option_str[type])) continue; *found = 1; break; } } isl_set_free(set); return *found ? isl_stat_error : isl_stat_ok; } /* Does "set" encode a loop AST generation option for the isolated part? * That is, is of the form * * { [isolate[] -> t[x]] } * * with t equal to "atomic", "unroll" or "separate"? */ static isl_stat is_isolate_loop_type_option(__isl_take isl_set *set, void *user) { int *found = user; const char *name; enum isl_ast_loop_type type; isl_map *map; if (!isl_set_is_wrapping(set)) { isl_set_free(set); return isl_stat_ok; } map = isl_set_unwrap(set); if (!isl_map_has_tuple_name(map, isl_dim_in) || !isl_map_has_tuple_name(map, isl_dim_out)) { isl_map_free(map); return isl_stat_ok; } name = isl_map_get_tuple_name(map, isl_dim_in); if (!strcmp(name, "isolate")) { name = isl_map_get_tuple_name(map, isl_dim_out); for (type = isl_ast_loop_atomic; type <= isl_ast_loop_separate; ++type) { if (strcmp(name, option_str[type])) continue; *found = 1; break; } } isl_map_free(map); return *found ? isl_stat_error : isl_stat_ok; } /* Does "options" encode any loop AST generation options * for the isolated part? */ static int has_isolate_loop_type_options(__isl_keep isl_union_set *options) { return has_any(options, &is_isolate_loop_type_option); } /* Does "options" encode any loop AST generation options? */ static int has_loop_type_options(__isl_keep isl_union_set *options) { return has_any(options, &is_loop_type_option); } /* Extract the loop AST generation type for the band member * at position "pos" from "options". * If "isolate" is set, then extract the loop types for the isolated part. */ static enum isl_ast_loop_type extract_loop_type( __isl_keep isl_union_set *options, int pos, int isolate) { isl_ctx *ctx; enum isl_ast_loop_type type, res = isl_ast_loop_default; ctx = isl_union_set_get_ctx(options); for (type = isl_ast_loop_atomic; type <= isl_ast_loop_separate; ++type) { isl_space *space; isl_set *option; int empty; space = isl_union_set_get_space(options); space = loop_type_space(space, type, isolate); option = isl_union_set_extract_set(options, space); option = isl_set_fix_si(option, isl_dim_set, 0, pos); empty = isl_set_is_empty(option); isl_set_free(option); if (empty < 0) return isl_ast_loop_error; if (empty) continue; if (res != isl_ast_loop_default) isl_die(ctx, isl_error_invalid, "conflicting loop type options", return isl_ast_loop_error); res = type; } return res; } /* Extract the loop AST generation types for the members of "band" * from "options" and store them in band->loop_type. * Return -1 on error. */ static int extract_loop_types(__isl_keep isl_schedule_band *band, __isl_keep isl_union_set *options) { int i; if (!band->loop_type) { isl_ctx *ctx = isl_schedule_band_get_ctx(band); band->loop_type = isl_alloc_array(ctx, enum isl_ast_loop_type, band->n); if (band->n && !band->loop_type) return -1; } for (i = 0; i < band->n; ++i) { band->loop_type[i] = extract_loop_type(options, i, 0); if (band->loop_type[i] == isl_ast_loop_error) return -1; } return 0; } /* Extract the loop AST generation types for the members of "band" * from "options" for the isolated part and * store them in band->isolate_loop_type. * Return -1 on error. */ static int extract_isolate_loop_types(__isl_keep isl_schedule_band *band, __isl_keep isl_union_set *options) { int i; if (!band->isolate_loop_type) { isl_ctx *ctx = isl_schedule_band_get_ctx(band); band->isolate_loop_type = isl_alloc_array(ctx, enum isl_ast_loop_type, band->n); if (band->n && !band->isolate_loop_type) return -1; } for (i = 0; i < band->n; ++i) { band->isolate_loop_type[i] = extract_loop_type(options, i, 1); if (band->isolate_loop_type[i] == isl_ast_loop_error) return -1; } return 0; } /* Construct universe sets of the spaces that encode loop AST generation * types (for the isolated part if "isolate" is set). That is, construct * * { atomic[x]; separate[x]; unroll[x] } * * or * * { [isolate[] -> atomic[x]]; [isolate[] -> separate[x]]; * [isolate[] -> unroll[x]] } */ static __isl_give isl_union_set *loop_types(__isl_take isl_space *space, int isolate) { enum isl_ast_loop_type type; isl_union_set *types; types = isl_union_set_empty(space); for (type = isl_ast_loop_atomic; type <= isl_ast_loop_separate; ++type) { isl_set *set; space = isl_union_set_get_space(types); space = loop_type_space(space, type, isolate); set = isl_set_universe(space); types = isl_union_set_add_set(types, set); } return types; } /* Remove all elements from spaces that encode loop AST generation types * from "options". */ static __isl_give isl_union_set *clear_loop_types( __isl_take isl_union_set *options) { isl_union_set *types; types = loop_types(isl_union_set_get_space(options), 0); options = isl_union_set_subtract(options, types); return options; } /* Remove all elements from spaces that encode loop AST generation types * for the isolated part from "options". */ static __isl_give isl_union_set *clear_isolate_loop_types( __isl_take isl_union_set *options) { isl_union_set *types; types = loop_types(isl_union_set_get_space(options), 1); options = isl_union_set_subtract(options, types); return options; } /* Replace the AST build options associated to "band" by "options". * If there are any loop AST generation type options, then they * are extracted and stored in band->loop_type. Otherwise, * band->loop_type is removed to indicate that the default applies * to all members. Similarly for the loop AST generation type options * for the isolated part, which are stored in band->isolate_loop_type. * The remaining options are stored in band->ast_build_options. * * Set anchored if the options include an isolate option since the * domain of the wrapped map references the outer band node schedules. */ __isl_give isl_schedule_band *isl_schedule_band_set_ast_build_options( __isl_take isl_schedule_band *band, __isl_take isl_union_set *options) { int has_isolate, has_loop_type, has_isolate_loop_type; band = isl_schedule_band_cow(band); if (!band || !options) goto error; has_isolate = has_isolate_option(options); if (has_isolate < 0) goto error; has_loop_type = has_loop_type_options(options); if (has_loop_type < 0) goto error; has_isolate_loop_type = has_isolate_loop_type_options(options); if (has_isolate_loop_type < 0) goto error; if (!has_loop_type) { free(band->loop_type); band->loop_type = NULL; } else { if (extract_loop_types(band, options) < 0) goto error; options = clear_loop_types(options); if (!options) goto error; } if (!has_isolate_loop_type) { free(band->isolate_loop_type); band->isolate_loop_type = NULL; } else { if (extract_isolate_loop_types(band, options) < 0) goto error; options = clear_isolate_loop_types(options); if (!options) goto error; } isl_union_set_free(band->ast_build_options); band->ast_build_options = options; band->anchored = has_isolate; return band; error: isl_schedule_band_free(band); isl_union_set_free(options); return NULL; } /* Multiply the partial schedule of "band" with the factors in "mv". * Replace the result by its greatest integer part to ensure * that the schedule is always integral. */ __isl_give isl_schedule_band *isl_schedule_band_scale( __isl_take isl_schedule_band *band, __isl_take isl_multi_val *mv) { band = isl_schedule_band_cow(band); if (!band || !mv) goto error; band->mupa = isl_multi_union_pw_aff_scale_multi_val(band->mupa, mv); band->mupa = isl_multi_union_pw_aff_floor(band->mupa); if (!band->mupa) return isl_schedule_band_free(band); return band; error: isl_schedule_band_free(band); isl_multi_val_free(mv); return NULL; } /* Divide the partial schedule of "band" by the factors in "mv". * Replace the result by its greatest integer part to ensure * that the schedule is always integral. */ __isl_give isl_schedule_band *isl_schedule_band_scale_down( __isl_take isl_schedule_band *band, __isl_take isl_multi_val *mv) { band = isl_schedule_band_cow(band); if (!band || !mv) goto error; band->mupa = isl_multi_union_pw_aff_scale_down_multi_val(band->mupa, mv); band->mupa = isl_multi_union_pw_aff_floor(band->mupa); if (!band->mupa) return isl_schedule_band_free(band); return band; error: isl_schedule_band_free(band); isl_multi_val_free(mv); return NULL; } /* Given the schedule of a band, construct the corresponding * schedule for the tile loops based on the given tile sizes * and return the result. * * If the scale tile loops options is set, then the tile loops * are scaled by the tile sizes. * * That is replace each schedule dimension "i" by either * "floor(i/s)" or "s * floor(i/s)". */ static isl_multi_union_pw_aff *isl_multi_union_pw_aff_tile( __isl_take isl_multi_union_pw_aff *sched, __isl_take isl_multi_val *sizes) { isl_ctx *ctx; int i, n; isl_val *v; int scale; ctx = isl_multi_val_get_ctx(sizes); scale = isl_options_get_tile_scale_tile_loops(ctx); n = isl_multi_union_pw_aff_dim(sched, isl_dim_set); for (i = 0; i < n; ++i) { isl_union_pw_aff *upa; upa = isl_multi_union_pw_aff_get_union_pw_aff(sched, i); v = isl_multi_val_get_val(sizes, i); upa = isl_union_pw_aff_scale_down_val(upa, isl_val_copy(v)); upa = isl_union_pw_aff_floor(upa); if (scale) upa = isl_union_pw_aff_scale_val(upa, isl_val_copy(v)); isl_val_free(v); sched = isl_multi_union_pw_aff_set_union_pw_aff(sched, i, upa); } isl_multi_val_free(sizes); return sched; } /* Replace "band" by a band corresponding to the tile loops of a tiling * with the given tile sizes. */ __isl_give isl_schedule_band *isl_schedule_band_tile( __isl_take isl_schedule_band *band, __isl_take isl_multi_val *sizes) { band = isl_schedule_band_cow(band); if (!band || !sizes) goto error; band->mupa = isl_multi_union_pw_aff_tile(band->mupa, sizes); if (!band->mupa) return isl_schedule_band_free(band); return band; error: isl_schedule_band_free(band); isl_multi_val_free(sizes); return NULL; } /* Replace "band" by a band corresponding to the point loops of a tiling * with the given tile sizes. * "tile" is the corresponding tile loop band. * * If the shift point loops option is set, then the point loops * are shifted to start at zero. That is, each schedule dimension "i" * is replaced by "i - s * floor(i/s)". * The expression "floor(i/s)" (or "s * floor(i/s)") is extracted from * the tile band. * * Otherwise, the band is left untouched. */ __isl_give isl_schedule_band *isl_schedule_band_point( __isl_take isl_schedule_band *band, __isl_keep isl_schedule_band *tile, __isl_take isl_multi_val *sizes) { isl_ctx *ctx; isl_multi_union_pw_aff *scaled; if (!band || !sizes) goto error; ctx = isl_schedule_band_get_ctx(band); if (!isl_options_get_tile_shift_point_loops(ctx)) { isl_multi_val_free(sizes); return band; } band = isl_schedule_band_cow(band); if (!band) goto error; scaled = isl_schedule_band_get_partial_schedule(tile); if (!isl_options_get_tile_scale_tile_loops(ctx)) scaled = isl_multi_union_pw_aff_scale_multi_val(scaled, sizes); else isl_multi_val_free(sizes); band->mupa = isl_multi_union_pw_aff_sub(band->mupa, scaled); if (!band->mupa) return isl_schedule_band_free(band); return band; error: isl_schedule_band_free(band); isl_multi_val_free(sizes); return NULL; } /* Drop the "n" dimensions starting at "pos" from "band". * * We apply the transformation even if "n" is zero to ensure consistent * behavior with respect to changes in the schedule space. * * The loop AST generation types for the isolated part become * meaningless after dropping dimensions, so we remove them. */ __isl_give isl_schedule_band *isl_schedule_band_drop( __isl_take isl_schedule_band *band, int pos, int n) { int i; if (pos < 0 || n < 0 || pos + n > band->n) isl_die(isl_schedule_band_get_ctx(band), isl_error_internal, "range out of bounds", return isl_schedule_band_free(band)); band = isl_schedule_band_cow(band); if (!band) return NULL; band->mupa = isl_multi_union_pw_aff_drop_dims(band->mupa, isl_dim_set, pos, n); if (!band->mupa) return isl_schedule_band_free(band); for (i = pos + n; i < band->n; ++i) band->coincident[i - n] = band->coincident[i]; if (band->loop_type) for (i = pos + n; i < band->n; ++i) band->loop_type[i - n] = band->loop_type[i]; free(band->isolate_loop_type); band->isolate_loop_type = NULL; band->n -= n; return band; } /* Reset the user pointer on all identifiers of parameters and tuples * in "band". */ __isl_give isl_schedule_band *isl_schedule_band_reset_user( __isl_take isl_schedule_band *band) { band = isl_schedule_band_cow(band); if (!band) return NULL; band->mupa = isl_multi_union_pw_aff_reset_user(band->mupa); band->ast_build_options = isl_union_set_reset_user(band->ast_build_options); if (!band->mupa || !band->ast_build_options) return isl_schedule_band_free(band); return band; } /* Align the parameters of "band" to those of "space". */ __isl_give isl_schedule_band *isl_schedule_band_align_params( __isl_take isl_schedule_band *band, __isl_take isl_space *space) { band = isl_schedule_band_cow(band); if (!band || !space) goto error; band->mupa = isl_multi_union_pw_aff_align_params(band->mupa, isl_space_copy(space)); band->ast_build_options = isl_union_set_align_params(band->ast_build_options, space); if (!band->mupa || !band->ast_build_options) return isl_schedule_band_free(band); return band; error: isl_space_free(space); isl_schedule_band_free(band); return NULL; } /* Compute the pullback of "band" by the function represented by "upma". * In other words, plug in "upma" in the iteration domains of "band". */ __isl_give isl_schedule_band *isl_schedule_band_pullback_union_pw_multi_aff( __isl_take isl_schedule_band *band, __isl_take isl_union_pw_multi_aff *upma) { band = isl_schedule_band_cow(band); if (!band || !upma) goto error; band->mupa = isl_multi_union_pw_aff_pullback_union_pw_multi_aff(band->mupa, upma); if (!band->mupa) return isl_schedule_band_free(band); return band; error: isl_union_pw_multi_aff_free(upma); isl_schedule_band_free(band); return NULL; } /* Compute the gist of "band" with respect to "context". * In particular, compute the gist of the associated partial schedule. */ __isl_give isl_schedule_band *isl_schedule_band_gist( __isl_take isl_schedule_band *band, __isl_take isl_union_set *context) { if (!band || !context) goto error; if (band->n == 0) { isl_union_set_free(context); return band; } band = isl_schedule_band_cow(band); if (!band) goto error; band->mupa = isl_multi_union_pw_aff_gist(band->mupa, context); if (!band->mupa) return isl_schedule_band_free(band); return band; error: isl_union_set_free(context); isl_schedule_band_free(band); return NULL; } cloog-0.18.4/isl/isl_blk.c0000644000175000017500000000552212413270107012203 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.4/isl/isl_equalities.c0000644000175000017500000005116412554427055013617 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 "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 = isl_basic_set_get_ctx(bset); total = isl_basic_set_total_dim(bset); nparam = isl_basic_set_n_param(bset); H = isl_mat_sub_alloc6(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(ctx, 1 + bset->n_eq, 1); if (!C) goto error; isl_int_set_si(C->row[0][0], 1); isl_mat_sub_neg(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) return -1; 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. */ isl_stat 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 isl_stat_error; *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 isl_stat_ok; error: isl_val_free(*modulo); isl_val_free(*residue); return isl_stat_error; } cloog-0.18.4/isl/isl_flow.c0000644000175000017500000021113512554427055012415 00000000000000/* * Copyright 2005-2007 Universiteit Leiden * Copyright 2008-2009 Katholieke Universiteit Leuven * Copyright 2010 INRIA Saclay * Copyright 2012 Universiteit Leiden * Copyright 2014 Ecole Normale Superieure * * 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 * and Ecole Normale Superieure, 45 rue d'Ulm, 75230 Paris, France */ #include #include #include #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; } __isl_null isl_restriction *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. */ __isl_null isl_access_info *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. */ isl_stat isl_flow_foreach(__isl_keep isl_flow *deps, isl_stat (*fn)(__isl_take isl_map *dep, int must, void *dep_user, void *user), void *user) { int i; if (!deps) return isl_stat_error; 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 isl_stat_error; } return isl_stat_ok; } /* 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_take 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(isl_set_get_space(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) { isl_space *space; space = isl_map_get_space(res->dep[2 * j].map); must_rel[j] = isl_map_empty(space); 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; } /* This structure represents the input for a dependence analysis computation. * * "sink" represents the sink accesses. * "must_source" represents the definite source accesses. * "may_source" represents the possible source accesses. * * "schedule" or "schedule_map" represents the execution order. * Exactly one of these fields should be NULL. The other field * determines the execution order. * * The domains of these four maps refer to the same iteration spaces(s). * The ranges of the first three maps also refer to the same data space(s). * * After a call to isl_union_access_info_introduce_schedule, * the "schedule_map" field no longer contains useful information. */ struct isl_union_access_info { isl_union_map *sink; isl_union_map *must_source; isl_union_map *may_source; isl_schedule *schedule; isl_union_map *schedule_map; }; /* Free "access" and return NULL. */ __isl_null isl_union_access_info *isl_union_access_info_free( __isl_take isl_union_access_info *access) { if (!access) return NULL; isl_union_map_free(access->sink); isl_union_map_free(access->must_source); isl_union_map_free(access->may_source); isl_schedule_free(access->schedule); isl_union_map_free(access->schedule_map); free(access); return NULL; } /* Return the isl_ctx to which "access" belongs. */ isl_ctx *isl_union_access_info_get_ctx(__isl_keep isl_union_access_info *access) { return access ? isl_union_map_get_ctx(access->sink) : NULL; } /* Create a new isl_union_access_info with the given sink accesses and * and no source accesses or schedule information. * * By default, we use the schedule field of the isl_union_access_info, * but this may be overridden by a call * to isl_union_access_info_set_schedule_map. */ __isl_give isl_union_access_info *isl_union_access_info_from_sink( __isl_take isl_union_map *sink) { isl_ctx *ctx; isl_space *space; isl_union_map *empty; isl_union_access_info *access; if (!sink) return NULL; ctx = isl_union_map_get_ctx(sink); access = isl_alloc_type(ctx, isl_union_access_info); if (!access) goto error; space = isl_union_map_get_space(sink); empty = isl_union_map_empty(isl_space_copy(space)); access->sink = sink; access->must_source = isl_union_map_copy(empty); access->may_source = empty; access->schedule = isl_schedule_empty(space); access->schedule_map = NULL; if (!access->sink || !access->must_source || !access->may_source || !access->schedule) return isl_union_access_info_free(access); return access; error: isl_union_map_free(sink); return NULL; } /* Replace the definite source accesses of "access" by "must_source". */ __isl_give isl_union_access_info *isl_union_access_info_set_must_source( __isl_take isl_union_access_info *access, __isl_take isl_union_map *must_source) { if (!access || !must_source) goto error; isl_union_map_free(access->must_source); access->must_source = must_source; return access; error: isl_union_access_info_free(access); isl_union_map_free(must_source); return NULL; } /* Replace the possible source accesses of "access" by "may_source". */ __isl_give isl_union_access_info *isl_union_access_info_set_may_source( __isl_take isl_union_access_info *access, __isl_take isl_union_map *may_source) { if (!access || !may_source) goto error; isl_union_map_free(access->may_source); access->may_source = may_source; return access; error: isl_union_access_info_free(access); isl_union_map_free(may_source); return NULL; } /* Replace the schedule of "access" by "schedule". * Also free the schedule_map in case it was set last. */ __isl_give isl_union_access_info *isl_union_access_info_set_schedule( __isl_take isl_union_access_info *access, __isl_take isl_schedule *schedule) { if (!access || !schedule) goto error; access->schedule_map = isl_union_map_free(access->schedule_map); isl_schedule_free(access->schedule); access->schedule = schedule; return access; error: isl_union_access_info_free(access); isl_schedule_free(schedule); return NULL; } /* Replace the schedule map of "access" by "schedule_map". * Also free the schedule in case it was set last. */ __isl_give isl_union_access_info *isl_union_access_info_set_schedule_map( __isl_take isl_union_access_info *access, __isl_take isl_union_map *schedule_map) { if (!access || !schedule_map) goto error; isl_union_map_free(access->schedule_map); access->schedule = isl_schedule_free(access->schedule); access->schedule_map = schedule_map; return access; error: isl_union_access_info_free(access); isl_union_map_free(schedule_map); return NULL; } __isl_give isl_union_access_info *isl_union_access_info_copy( __isl_keep isl_union_access_info *access) { isl_union_access_info *copy; if (!access) return NULL; copy = isl_union_access_info_from_sink( isl_union_map_copy(access->sink)); copy = isl_union_access_info_set_must_source(copy, isl_union_map_copy(access->must_source)); copy = isl_union_access_info_set_may_source(copy, isl_union_map_copy(access->may_source)); if (access->schedule) copy = isl_union_access_info_set_schedule(copy, isl_schedule_copy(access->schedule)); else copy = isl_union_access_info_set_schedule_map(copy, isl_union_map_copy(access->schedule_map)); return copy; } /* Update the fields of "access" such that they all have the same parameters, * keeping in mind that the schedule_map field may be NULL and ignoring * the schedule field. */ static __isl_give isl_union_access_info *isl_union_access_info_align_params( __isl_take isl_union_access_info *access) { isl_space *space; if (!access) return NULL; space = isl_union_map_get_space(access->sink); space = isl_space_align_params(space, isl_union_map_get_space(access->must_source)); space = isl_space_align_params(space, isl_union_map_get_space(access->may_source)); if (access->schedule_map) space = isl_space_align_params(space, isl_union_map_get_space(access->schedule_map)); access->sink = isl_union_map_align_params(access->sink, isl_space_copy(space)); access->must_source = isl_union_map_align_params(access->must_source, isl_space_copy(space)); access->may_source = isl_union_map_align_params(access->may_source, isl_space_copy(space)); if (!access->schedule_map) { isl_space_free(space); } else { access->schedule_map = isl_union_map_align_params(access->schedule_map, space); if (!access->schedule_map) return isl_union_access_info_free(access); } if (!access->sink || !access->must_source || !access->may_source) return isl_union_access_info_free(access); return access; } /* Prepend the schedule dimensions to the iteration domains. * * That is, if the schedule is of the form * * D -> S * * while the access relations are of the form * * D -> A * * then the updated access relations are of the form * * [S -> D] -> A * * The schedule map is also replaced by the map * * [S -> D] -> D * * that is used during the internal computation. * Neither the original schedule map nor this updated schedule map * are used after the call to this function. */ static __isl_give isl_union_access_info * isl_union_access_info_introduce_schedule( __isl_take isl_union_access_info *access) { isl_union_map *sm; if (!access) return NULL; sm = isl_union_map_reverse(access->schedule_map); sm = isl_union_map_range_map(sm); access->sink = isl_union_map_apply_range(isl_union_map_copy(sm), access->sink); access->may_source = isl_union_map_apply_range(isl_union_map_copy(sm), access->may_source); access->must_source = isl_union_map_apply_range(isl_union_map_copy(sm), access->must_source); access->schedule_map = sm; if (!access->sink || !access->must_source || !access->may_source || !access->schedule_map) return isl_union_access_info_free(access); return access; } /* This structure epresents the result of a dependence analysis computation. * * "must_dep" represents the definite dependences. * "may_dep" represents the non-definite dependences. * "must_no_source" represents the subset of the sink accesses for which * definitely no source was found. * "may_no_source" represents the subset of the sink accesses for which * possibly, but not definitely, no source was found. */ struct isl_union_flow { isl_union_map *must_dep; isl_union_map *may_dep; isl_union_map *must_no_source; isl_union_map *may_no_source; }; /* Return the isl_ctx to which "flow" belongs. */ isl_ctx *isl_union_flow_get_ctx(__isl_keep isl_union_flow *flow) { return flow ? isl_union_map_get_ctx(flow->must_dep) : NULL; } /* Free "flow" and return NULL. */ __isl_null isl_union_flow *isl_union_flow_free(__isl_take isl_union_flow *flow) { if (!flow) return NULL; isl_union_map_free(flow->must_dep); isl_union_map_free(flow->may_dep); isl_union_map_free(flow->must_no_source); isl_union_map_free(flow->may_no_source); free(flow); return NULL; } void isl_union_flow_dump(__isl_keep isl_union_flow *flow) { if (!flow) return; fprintf(stderr, "must dependences: "); isl_union_map_dump(flow->must_dep); fprintf(stderr, "may dependences: "); isl_union_map_dump(flow->may_dep); fprintf(stderr, "must no source: "); isl_union_map_dump(flow->must_no_source); fprintf(stderr, "may no source: "); isl_union_map_dump(flow->may_no_source); } /* Return the definite dependences in "flow". */ __isl_give isl_union_map *isl_union_flow_get_must_dependence( __isl_keep isl_union_flow *flow) { if (!flow) return NULL; return isl_union_map_copy(flow->must_dep); } /* Return the possible dependences in "flow", including the definite * dependences. */ __isl_give isl_union_map *isl_union_flow_get_may_dependence( __isl_keep isl_union_flow *flow) { if (!flow) return NULL; return isl_union_map_union(isl_union_map_copy(flow->must_dep), isl_union_map_copy(flow->may_dep)); } /* Return the non-definite dependences in "flow". */ static __isl_give isl_union_map *isl_union_flow_get_non_must_dependence( __isl_keep isl_union_flow *flow) { if (!flow) return NULL; return isl_union_map_copy(flow->may_dep); } /* Return the subset of the sink accesses for which definitely * no source was found. */ __isl_give isl_union_map *isl_union_flow_get_must_no_source( __isl_keep isl_union_flow *flow) { if (!flow) return NULL; return isl_union_map_copy(flow->must_no_source); } /* Return the subset of the sink accesses for which possibly * no source was found, including those for which definitely * no source was found. */ __isl_give isl_union_map *isl_union_flow_get_may_no_source( __isl_keep isl_union_flow *flow) { if (!flow) return NULL; return isl_union_map_union(isl_union_map_copy(flow->must_no_source), isl_union_map_copy(flow->may_no_source)); } /* Return the subset of the sink accesses for which possibly, but not * definitely, no source was found. */ static __isl_give isl_union_map *isl_union_flow_get_non_must_no_source( __isl_keep isl_union_flow *flow) { if (!flow) return NULL; return isl_union_map_copy(flow->may_no_source); } /* Create a new isl_union_flow object, initialized with empty * dependence relations and sink subsets. */ static __isl_give isl_union_flow *isl_union_flow_alloc( __isl_take isl_space *space) { isl_ctx *ctx; isl_union_map *empty; isl_union_flow *flow; if (!space) return NULL; ctx = isl_space_get_ctx(space); flow = isl_alloc_type(ctx, isl_union_flow); if (!flow) goto error; empty = isl_union_map_empty(space); flow->must_dep = isl_union_map_copy(empty); flow->may_dep = isl_union_map_copy(empty); flow->must_no_source = isl_union_map_copy(empty); flow->may_no_source = empty; if (!flow->must_dep || !flow->may_dep || !flow->must_no_source || !flow->may_no_source) return isl_union_flow_free(flow); return flow; error: isl_space_free(space); return NULL; } /* Drop the schedule dimensions from the iteration domains in "flow". * In particular, the schedule dimensions have been prepended * to the iteration domains prior to the dependence analysis by * replacing the iteration domain D, by the wrapped map [S -> D]. * Replace these wrapped maps by the original D. */ static __isl_give isl_union_flow *isl_union_flow_drop_schedule( __isl_take isl_union_flow *flow) { if (!flow) return NULL; flow->must_dep = isl_union_map_factor_range(flow->must_dep); flow->may_dep = isl_union_map_factor_range(flow->may_dep); flow->must_no_source = isl_union_map_domain_factor_range(flow->must_no_source); flow->may_no_source = isl_union_map_domain_factor_range(flow->may_no_source); if (!flow->must_dep || !flow->may_dep || !flow->must_no_source || !flow->may_no_source) return isl_union_flow_free(flow); return flow; } struct isl_compute_flow_data { isl_union_map *must_source; isl_union_map *may_source; isl_union_flow *flow; int count; int must; isl_space *dim; struct isl_sched_info *sink_info; struct isl_sched_info **source_info; isl_access_info *accesses; }; static isl_stat 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 isl_stat_error; if (eq) data->count++; return isl_stat_ok; } static isl_stat 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 isl_stat_ok; } 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 isl_stat_ok; error: isl_map_free(map); return isl_stat_error; } /* 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 isl_stat compute_flow(__isl_take isl_map *map, void *user) { int i; isl_ctx *ctx; struct isl_compute_flow_data *data; isl_flow *flow; isl_union_flow *df; data = (struct isl_compute_flow_data *)user; df = data->flow; 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; df->must_no_source = isl_union_map_union(df->must_no_source, isl_union_map_from_map(isl_flow_get_no_source(flow, 1))); df->may_no_source = isl_union_map_union(df->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) df->must_dep = isl_union_map_union(df->must_dep, dep); else df->may_dep = isl_union_map_union(df->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 isl_stat_ok; 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 isl_stat_error; } /* Remove the must accesses from the may accesses. * * A must access always trumps a may access, so there is no need * for a must access to also be considered as a may access. Doing so * would only cost extra computations only to find out that * the duplicated may access does not make any difference. */ static __isl_give isl_union_access_info *isl_union_access_info_normalize( __isl_take isl_union_access_info *access) { if (!access) return NULL; access->may_source = isl_union_map_subtract(access->may_source, isl_union_map_copy(access->must_source)); if (!access->may_source) return isl_union_access_info_free(access); return access; } /* Given a description of the "sink" accesses, the "source" accesses and * a schedule, compute for each instance of a sink access * and for each element accessed by that instance, * the possible or definite source accesses that last accessed the * element accessed by the sink access before this sink access * in the sense that there is no intermediate definite source access. * * The must_no_source and may_no_source elements of the result * are subsets of access->sink. The elements must_dep and may_dep * map domain elements of access->{may,must)_source to * domain elements of access->sink. * * This function is used when only the schedule map representation * is available. * * 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. */ static __isl_give isl_union_flow *compute_flow_union_map( __isl_take isl_union_access_info *access) { struct isl_compute_flow_data data; access = isl_union_access_info_align_params(access); access = isl_union_access_info_introduce_schedule(access); if (!access) return NULL; data.must_source = access->must_source; data.may_source = access->may_source; data.flow = isl_union_flow_alloc(isl_union_map_get_space(access->sink)); if (isl_union_map_foreach_map(access->sink, &compute_flow, &data) < 0) goto error; data.flow = isl_union_flow_drop_schedule(data.flow); isl_union_access_info_free(access); return data.flow; error: isl_union_access_info_free(access); isl_union_flow_free(data.flow); return NULL; } /* A schedule access relation. * * The access relation "access" is of the form [S -> D] -> A, * where S corresponds to the prefix schedule at "node". * "must" is only relevant for source accesses and indicates * whether the access is a must source or a may source. */ struct isl_scheduled_access { isl_map *access; int must; isl_schedule_node *node; }; /* Data structure for keeping track of individual scheduled sink and source * accesses when computing dependence analysis based on a schedule tree. * * "n_sink" is the number of used entries in "sink" * "n_source" is the number of used entries in "source" * * "set_sink", "must" and "node" are only used inside collect_sink_source, * to keep track of the current node and * of what extract_sink_source needs to do. */ struct isl_compute_flow_schedule_data { isl_union_access_info *access; int n_sink; int n_source; struct isl_scheduled_access *sink; struct isl_scheduled_access *source; int set_sink; int must; isl_schedule_node *node; }; /* Align the parameters of all sinks with all sources. * * If there are no sinks or no sources, then no alignment is needed. */ static void isl_compute_flow_schedule_data_align_params( struct isl_compute_flow_schedule_data *data) { int i; isl_space *space; if (data->n_sink == 0 || data->n_source == 0) return; space = isl_map_get_space(data->sink[0].access); for (i = 1; i < data->n_sink; ++i) space = isl_space_align_params(space, isl_map_get_space(data->sink[i].access)); for (i = 0; i < data->n_source; ++i) space = isl_space_align_params(space, isl_map_get_space(data->source[i].access)); for (i = 0; i < data->n_sink; ++i) data->sink[i].access = isl_map_align_params(data->sink[i].access, isl_space_copy(space)); for (i = 0; i < data->n_source; ++i) data->source[i].access = isl_map_align_params(data->source[i].access, isl_space_copy(space)); isl_space_free(space); } /* Free all the memory referenced from "data". * Do not free "data" itself as it may be allocated on the stack. */ static void isl_compute_flow_schedule_data_clear( struct isl_compute_flow_schedule_data *data) { int i; if (!data->sink) return; for (i = 0; i < data->n_sink; ++i) { isl_map_free(data->sink[i].access); isl_schedule_node_free(data->sink[i].node); } for (i = 0; i < data->n_source; ++i) { isl_map_free(data->source[i].access); isl_schedule_node_free(data->source[i].node); } free(data->sink); } /* isl_schedule_foreach_schedule_node_top_down callback for counting * (an upper bound on) the number of sinks and sources. * * Sinks and sources are only extracted at leaves of the tree, * so we skip the node if it is not a leaf. * Otherwise we increment data->n_sink and data->n_source with * the number of spaces in the sink and source access domains * that reach this node. */ static isl_bool count_sink_source(__isl_keep isl_schedule_node *node, void *user) { struct isl_compute_flow_schedule_data *data = user; isl_union_set *domain; isl_union_map *umap; isl_bool r = isl_bool_false; if (isl_schedule_node_get_type(node) != isl_schedule_node_leaf) return isl_bool_true; domain = isl_schedule_node_get_universe_domain(node); umap = isl_union_map_copy(data->access->sink); umap = isl_union_map_intersect_domain(umap, isl_union_set_copy(domain)); data->n_sink += isl_union_map_n_map(umap); isl_union_map_free(umap); if (!umap) r = isl_bool_error; umap = isl_union_map_copy(data->access->must_source); umap = isl_union_map_intersect_domain(umap, isl_union_set_copy(domain)); data->n_source += isl_union_map_n_map(umap); isl_union_map_free(umap); if (!umap) r = isl_bool_error; umap = isl_union_map_copy(data->access->may_source); umap = isl_union_map_intersect_domain(umap, isl_union_set_copy(domain)); data->n_source += isl_union_map_n_map(umap); isl_union_map_free(umap); if (!umap) r = isl_bool_error; isl_union_set_free(domain); return r; } /* Add a single scheduled sink or source (depending on data->set_sink) * with scheduled access relation "map", must property data->must and * schedule node data->node to the list of sinks or sources. */ static isl_stat extract_sink_source(__isl_take isl_map *map, void *user) { struct isl_compute_flow_schedule_data *data = user; struct isl_scheduled_access *access; if (data->set_sink) access = data->sink + data->n_sink++; else access = data->source + data->n_source++; access->access = map; access->must = data->must; access->node = isl_schedule_node_copy(data->node); return isl_stat_ok; } /* isl_schedule_foreach_schedule_node_top_down callback for collecting * individual scheduled source and sink accesses. * * We only collect accesses at the leaves of the schedule tree. * We prepend the schedule dimensions at the leaf to the iteration * domains of the source and sink accesses and then extract * the individual accesses (per space). * * In particular, if the prefix schedule at the node is of the form * * D -> S * * while the access relations are of the form * * D -> A * * then the updated access relations are of the form * * [S -> D] -> A * * Note that S consists of a single space such that introducing S * in the access relations does not increase the number of spaces. */ static isl_bool collect_sink_source(__isl_keep isl_schedule_node *node, void *user) { struct isl_compute_flow_schedule_data *data = user; isl_union_map *prefix; isl_union_map *umap; isl_bool r = isl_bool_false; if (isl_schedule_node_get_type(node) != isl_schedule_node_leaf) return isl_bool_true; data->node = node; prefix = isl_schedule_node_get_prefix_schedule_union_map(node); prefix = isl_union_map_reverse(prefix); prefix = isl_union_map_range_map(prefix); data->set_sink = 1; umap = isl_union_map_copy(data->access->sink); umap = isl_union_map_apply_range(isl_union_map_copy(prefix), umap); if (isl_union_map_foreach_map(umap, &extract_sink_source, data) < 0) r = isl_bool_error; isl_union_map_free(umap); data->set_sink = 0; data->must = 1; umap = isl_union_map_copy(data->access->must_source); umap = isl_union_map_apply_range(isl_union_map_copy(prefix), umap); if (isl_union_map_foreach_map(umap, &extract_sink_source, data) < 0) r = isl_bool_error; isl_union_map_free(umap); data->set_sink = 0; data->must = 0; umap = isl_union_map_copy(data->access->may_source); umap = isl_union_map_apply_range(isl_union_map_copy(prefix), umap); if (isl_union_map_foreach_map(umap, &extract_sink_source, data) < 0) r = isl_bool_error; isl_union_map_free(umap); isl_union_map_free(prefix); return r; } /* isl_access_info_compute_flow callback for determining whether * the shared nesting level and the ordering within that level * for two scheduled accesses for use in compute_single_flow. * * The tokens passed to this function refer to the leaves * in the schedule tree where the accesses take place. * * If n is the shared number of loops, then we need to return * "2 * n + 1" if "first" precedes "second" inside the innermost * shared loop and "2 * n" otherwise. * * The innermost shared ancestor may be the leaves themselves * if the accesses take place in the same leaf. Otherwise, * it is either a set node or a sequence node. Only in the case * of a sequence node do we consider one access to precede the other. */ static int before_node(void *first, void *second) { isl_schedule_node *node1 = first; isl_schedule_node *node2 = second; isl_schedule_node *shared; int depth; int before = 0; shared = isl_schedule_node_get_shared_ancestor(node1, node2); if (!shared) return -1; depth = isl_schedule_node_get_schedule_depth(shared); if (isl_schedule_node_get_type(shared) == isl_schedule_node_sequence) { int pos1, pos2; pos1 = isl_schedule_node_get_ancestor_child_position(node1, shared); pos2 = isl_schedule_node_get_ancestor_child_position(node2, shared); before = pos1 < pos2; } isl_schedule_node_free(shared); return 2 * depth + before; } /* Add the scheduled sources from "data" that access * the same data space as "sink" to "access". */ static __isl_give isl_access_info *add_matching_sources( __isl_take isl_access_info *access, struct isl_scheduled_access *sink, struct isl_compute_flow_schedule_data *data) { int i; isl_space *space; space = isl_space_range(isl_map_get_space(sink->access)); for (i = 0; i < data->n_source; ++i) { struct isl_scheduled_access *source; isl_space *source_space; int eq; source = &data->source[i]; source_space = isl_map_get_space(source->access); source_space = isl_space_range(source_space); eq = isl_space_is_equal(space, source_space); isl_space_free(source_space); if (!eq) continue; if (eq < 0) goto error; access = isl_access_info_add_source(access, isl_map_copy(source->access), source->must, source->node); } isl_space_free(space); return access; error: isl_space_free(space); isl_access_info_free(access); return NULL; } /* Given a scheduled sink access relation "sink", compute the corresponding * dependences on the sources in "data" and add the computed dependences * to "uf". */ static __isl_give isl_union_flow *compute_single_flow( __isl_take isl_union_flow *uf, struct isl_scheduled_access *sink, struct isl_compute_flow_schedule_data *data) { int i; isl_access_info *access; isl_flow *flow; isl_map *map; if (!uf) return NULL; access = isl_access_info_alloc(isl_map_copy(sink->access), sink->node, &before_node, data->n_source); access = add_matching_sources(access, sink, data); flow = isl_access_info_compute_flow(access); if (!flow) return isl_union_flow_free(uf); map = isl_map_domain_factor_range(isl_flow_get_no_source(flow, 1)); uf->must_no_source = isl_union_map_union(uf->must_no_source, isl_union_map_from_map(map)); map = isl_map_domain_factor_range(isl_flow_get_no_source(flow, 0)); uf->may_no_source = isl_union_map_union(uf->may_no_source, isl_union_map_from_map(map)); for (i = 0; i < flow->n_source; ++i) { isl_union_map *dep; map = isl_map_factor_range(isl_map_copy(flow->dep[i].map)); dep = isl_union_map_from_map(map); if (flow->dep[i].must) uf->must_dep = isl_union_map_union(uf->must_dep, dep); else uf->may_dep = isl_union_map_union(uf->may_dep, dep); } isl_flow_free(flow); return uf; } /* Given a description of the "sink" accesses, the "source" accesses and * a schedule, compute for each instance of a sink access * and for each element accessed by that instance, * the possible or definite source accesses that last accessed the * element accessed by the sink access before this sink access * in the sense that there is no intermediate definite source access. * * The must_no_source and may_no_source elements of the result * are subsets of access->sink. The elements must_dep and may_dep * map domain elements of access->{may,must)_source to * domain elements of access->sink. * * This function is used when a schedule tree representation * is available. * * We extract the individual scheduled source and sink access relations and * then compute dependences for each scheduled sink individually. */ static __isl_give isl_union_flow *compute_flow_schedule( __isl_take isl_union_access_info *access) { struct isl_compute_flow_schedule_data data = { access }; int i, n; isl_ctx *ctx; isl_union_flow *flow; ctx = isl_union_access_info_get_ctx(access); data.n_sink = 0; data.n_source = 0; if (isl_schedule_foreach_schedule_node_top_down(access->schedule, &count_sink_source, &data) < 0) goto error; n = data.n_sink + data.n_source; data.sink = isl_calloc_array(ctx, struct isl_scheduled_access, n); if (n && !data.sink) goto error; data.source = data.sink + data.n_sink; data.n_sink = 0; data.n_source = 0; if (isl_schedule_foreach_schedule_node_top_down(access->schedule, &collect_sink_source, &data) < 0) goto error; flow = isl_union_flow_alloc(isl_union_map_get_space(access->sink)); isl_compute_flow_schedule_data_align_params(&data); for (i = 0; i < data.n_sink; ++i) flow = compute_single_flow(flow, &data.sink[i], &data); isl_compute_flow_schedule_data_clear(&data); isl_union_access_info_free(access); return flow; error: isl_union_access_info_free(access); isl_compute_flow_schedule_data_clear(&data); return NULL; } /* Given a description of the "sink" accesses, the "source" accesses and * a schedule, compute for each instance of a sink access * and for each element accessed by that instance, * the possible or definite source accesses that last accessed the * element accessed by the sink access before this sink access * in the sense that there is no intermediate definite source access. * * The must_no_source and may_no_source elements of the result * are subsets of access->sink. The elements must_dep and may_dep * map domain elements of access->{may,must)_source to * domain elements of access->sink. * * We check whether the schedule is available as a schedule tree * or a schedule map and call the correpsonding function to perform * the analysis. */ __isl_give isl_union_flow *isl_union_access_info_compute_flow( __isl_take isl_union_access_info *access) { access = isl_union_access_info_normalize(access); if (!access) return NULL; if (access->schedule) return compute_flow_schedule(access); else return compute_flow_union_map(access); } /* 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 collect the inputs in an isl_union_access_info object, * call isl_union_access_info_compute_flow and extract * the outputs from the result. */ 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_union_access_info *access; isl_union_flow *flow; access = isl_union_access_info_from_sink(sink); access = isl_union_access_info_set_must_source(access, must_source); access = isl_union_access_info_set_may_source(access, may_source); access = isl_union_access_info_set_schedule_map(access, schedule); flow = isl_union_access_info_compute_flow(access); if (must_dep) *must_dep = isl_union_flow_get_must_dependence(flow); if (may_dep) *may_dep = isl_union_flow_get_non_must_dependence(flow); if (must_no_source) *must_no_source = isl_union_flow_get_must_no_source(flow); if (may_no_source) *may_no_source = isl_union_flow_get_non_must_no_source(flow); isl_union_flow_free(flow); if ((must_dep && !*must_dep) || (may_dep && !*may_dep) || (must_no_source && !*must_no_source) || (may_no_source && !*may_no_source)) goto error; return 0; error: if (must_dep) *must_dep = isl_union_map_free(*must_dep); if (may_dep) *may_dep = isl_union_map_free(*may_dep); if (must_no_source) *must_no_source = isl_union_map_free(*must_no_source); if (may_no_source) *may_no_source = isl_union_map_free(*may_no_source); return -1; } cloog-0.18.4/isl/isl_printer.c0000644000175000017500000004277612554427055013146 00000000000000#include #include #include static __isl_give isl_printer *file_start_line(__isl_take isl_printer *p) { fprintf(p->file, "%s%*s%s", p->indent_prefix ? p->indent_prefix : "", 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) { if (p->indent_prefix) p = str_print(p, p->indent_prefix, strlen(p->indent_prefix)); 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; p->buf[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_calloc_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->indent_prefix = NULL; p->prefix = NULL; p->suffix = NULL; p->width = 0; p->yaml_style = ISL_YAML_STYLE_FLOW; return p; } __isl_give isl_printer *isl_printer_to_str(isl_ctx *ctx) { struct isl_printer *p = isl_calloc_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->indent_prefix = NULL; p->prefix = NULL; p->suffix = NULL; p->width = 0; p->yaml_style = ISL_YAML_STYLE_FLOW; return p; error: isl_printer_free(p); return NULL; } __isl_null isl_printer *isl_printer_free(__isl_take isl_printer *p) { if (!p) return NULL; free(p->buf); free(p->indent_prefix); free(p->prefix); free(p->suffix); free(p->yaml_state); 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; } /* Replace the indent prefix of "p" by "prefix". */ __isl_give isl_printer *isl_printer_set_indent_prefix(__isl_take isl_printer *p, const char *prefix) { if (!p) return NULL; free(p->indent_prefix); p->indent_prefix = prefix ? strdup(prefix) : NULL; return p; } __isl_give isl_printer *isl_printer_set_prefix(__isl_take isl_printer *p, const char *prefix) { if (!p) return NULL; free(p->prefix); p->prefix = prefix ? strdup(prefix) : NULL; return p; } __isl_give isl_printer *isl_printer_set_suffix(__isl_take isl_printer *p, const char *suffix) { if (!p) return NULL; free(p->suffix); p->suffix = suffix ? strdup(suffix) : NULL; 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; } /* Set the YAML style of "p" to "yaml_style" and return the updated printer. */ __isl_give isl_printer *isl_printer_set_yaml_style(__isl_take isl_printer *p, int yaml_style) { if (!p) return NULL; p->yaml_style = yaml_style; return p; } /* Return the YAML style of "p" or -1 on error. */ int isl_printer_get_yaml_style(__isl_keep isl_printer *p) { if (!p) return -1; return p->yaml_style; } /* Push "state" onto the stack of currently active YAML elements and * return the updated printer. */ static __isl_give isl_printer *push_state(__isl_take isl_printer *p, enum isl_yaml_state state) { if (!p) return NULL; if (p->yaml_size < p->yaml_depth + 1) { enum isl_yaml_state *state; state = isl_realloc_array(p->ctx, p->yaml_state, enum isl_yaml_state, p->yaml_depth + 1); if (!state) return isl_printer_free(p); p->yaml_state = state; p->yaml_size = p->yaml_depth + 1; } p->yaml_state[p->yaml_depth] = state; p->yaml_depth++; return p; } /* Remove the innermost active YAML element from the stack and * return the updated printer. */ static __isl_give isl_printer *pop_state(__isl_take isl_printer *p) { if (!p) return NULL; p->yaml_depth--; return p; } /* Set the state of the innermost active YAML element to "state" and * return the updated printer. */ static __isl_give isl_printer *update_state(__isl_take isl_printer *p, enum isl_yaml_state state) { if (!p) return NULL; if (p->yaml_depth < 1) isl_die(isl_printer_get_ctx(p), isl_error_invalid, "not in YAML construct", return isl_printer_free(p)); p->yaml_state[p->yaml_depth - 1] = state; return p; } /* Return the state of the innermost active YAML element. * Return isl_yaml_none if we are not inside any YAML element. */ static enum isl_yaml_state current_state(__isl_keep isl_printer *p) { if (!p) return isl_yaml_none; if (p->yaml_depth < 1) return isl_yaml_none; return p->yaml_state[p->yaml_depth - 1]; } /* If we are printing a YAML document and we are at the start of an element, * print whatever is needed before we can print the actual element and * keep track of the fact that we are now printing the element. * If "eol" is set, then whatever we print is going to be the last * thing that gets printed on this line. * * If we are about the print the first key of a mapping, then nothing * extra needs to be printed. For any other key, however, we need * to either move to the next line (in block format) or print a comma * (in flow format). * Before printing a value in a mapping, we need to print a colon. * * For sequences, in flow format, we only need to print a comma * for each element except the first. * In block format, before the first element in the sequence, * we move to a new line, print a dash and increase the indentation. * Before any other element, we print a dash on a new line, * temporarily moving the indentation back. */ static __isl_give isl_printer *enter_state(__isl_take isl_printer *p, int eol) { enum isl_yaml_state state; if (!p) return NULL; state = current_state(p); if (state == isl_yaml_mapping_val_start) { if (eol) p = p->ops->print_str(p, ":"); else p = p->ops->print_str(p, ": "); p = update_state(p, isl_yaml_mapping_val); } else if (state == isl_yaml_mapping_first_key_start) { p = update_state(p, isl_yaml_mapping_key); } else if (state == isl_yaml_mapping_key_start) { if (p->yaml_style == ISL_YAML_STYLE_FLOW) p = p->ops->print_str(p, ", "); else { p = p->ops->end_line(p); p = p->ops->start_line(p); } p = update_state(p, isl_yaml_mapping_key); } else if (state == isl_yaml_sequence_first_start) { if (p->yaml_style != ISL_YAML_STYLE_FLOW) { p = p->ops->end_line(p); p = p->ops->start_line(p); p = p->ops->print_str(p, "- "); p = isl_printer_indent(p, 2); } p = update_state(p, isl_yaml_sequence); } else if (state == isl_yaml_sequence_start) { if (p->yaml_style == ISL_YAML_STYLE_FLOW) p = p->ops->print_str(p, ", "); else { p = p->ops->end_line(p); p = isl_printer_indent(p, -2); p = p->ops->start_line(p); p = p->ops->print_str(p, "- "); p = isl_printer_indent(p, 2); } p = update_state(p, isl_yaml_sequence); } return p; } __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); p = enter_state(p, 0); if (!p) return NULL; return p->ops->print_str(p, s); } __isl_give isl_printer *isl_printer_print_double(__isl_take isl_printer *p, double d) { p = enter_state(p, 0); 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) { p = enter_state(p, 0); 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) { p = enter_state(p, 0); 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); } /* Start a YAML mapping and push a new state to reflect that we * are about to print the first key in a mapping. * * In flow style, print the opening brace. * In block style, move to the next line with an increased indentation, * except if this is the outer mapping or if we are inside a sequence * (in which case we have already increased the indentation and we want * to print the first key on the same line as the dash). */ __isl_give isl_printer *isl_printer_yaml_start_mapping( __isl_take isl_printer *p) { enum isl_yaml_state state; p = enter_state(p, p->yaml_style == ISL_YAML_STYLE_BLOCK); if (!p) return NULL; state = current_state(p); if (p->yaml_style == ISL_YAML_STYLE_FLOW) p = p->ops->print_str(p, "{ "); else if (state != isl_yaml_none && state != isl_yaml_sequence) { p = p->ops->end_line(p); p = isl_printer_indent(p, 2); p = p->ops->start_line(p); } p = push_state(p, isl_yaml_mapping_first_key_start); return p; } /* Finish a YAML mapping and pop it from the state stack. * * In flow style, print the closing brace. * * In block style, first check if we are still in the * isl_yaml_mapping_first_key_start state. If so, we have not printed * anything yet, so print "{}" to indicate an empty mapping. * If we increased the indentation in isl_printer_yaml_start_mapping, * then decrease it again. * If this is the outer mapping then print a newline. */ __isl_give isl_printer *isl_printer_yaml_end_mapping( __isl_take isl_printer *p) { enum isl_yaml_state state; state = current_state(p); p = pop_state(p); if (!p) return NULL; if (p->yaml_style == ISL_YAML_STYLE_FLOW) return p->ops->print_str(p, " }"); if (state == isl_yaml_mapping_first_key_start) p = p->ops->print_str(p, "{}"); if (!p) return NULL; state = current_state(p); if (state != isl_yaml_none && state != isl_yaml_sequence) p = isl_printer_indent(p, -2); if (state == isl_yaml_none) p = p->ops->end_line(p); return p; } /* Start a YAML sequence and push a new state to reflect that we * are about to print the first element in a sequence. * * In flow style, print the opening bracket. */ __isl_give isl_printer *isl_printer_yaml_start_sequence( __isl_take isl_printer *p) { p = enter_state(p, p->yaml_style == ISL_YAML_STYLE_BLOCK); p = push_state(p, isl_yaml_sequence_first_start); if (!p) return NULL; if (p->yaml_style == ISL_YAML_STYLE_FLOW) p = p->ops->print_str(p, "[ "); return p; } /* Finish a YAML sequence and pop it from the state stack. * * In flow style, print the closing bracket. * * In block style, check if we are still in the * isl_yaml_sequence_first_start state. If so, we have not printed * anything yet, so print "[]" or " []" to indicate an empty sequence. * We print the extra space when we instructed enter_state not * to print a space at the end of the line. * Otherwise, undo the increase in indentation performed by * enter_state when moving away from the isl_yaml_sequence_first_start * state. * If this is the outer sequence then print a newline. */ __isl_give isl_printer *isl_printer_yaml_end_sequence( __isl_take isl_printer *p) { enum isl_yaml_state state, up; state = current_state(p); p = pop_state(p); if (!p) return NULL; if (p->yaml_style == ISL_YAML_STYLE_FLOW) return p->ops->print_str(p, " ]"); up = current_state(p); if (state == isl_yaml_sequence_first_start) { if (up == isl_yaml_mapping_val) p = p->ops->print_str(p, " []"); else p = p->ops->print_str(p, "[]"); } else { p = isl_printer_indent(p, -2); } if (!p) return NULL; state = current_state(p); if (state == isl_yaml_none) p = p->ops->end_line(p); return p; } /* Mark the fact that the current element is finished and that * the next output belongs to the next element. * In particular, if we are printing a key, then prepare for * printing the subsequent value. If we are printing a value, * prepare for printing the next key. If we are printing an * element in a sequence, prepare for printing the next element. */ __isl_give isl_printer *isl_printer_yaml_next(__isl_take isl_printer *p) { enum isl_yaml_state state; if (!p) return NULL; if (p->yaml_depth < 1) isl_die(isl_printer_get_ctx(p), isl_error_invalid, "not in YAML construct", return isl_printer_free(p)); state = current_state(p); if (state == isl_yaml_mapping_key) state = isl_yaml_mapping_val_start; else if (state == isl_yaml_mapping_val) state = isl_yaml_mapping_key_start; else if (state == isl_yaml_sequence) state = isl_yaml_sequence_start; p = update_state(p, state); return p; } cloog-0.18.4/isl/ltmain.sh0000644000175000017500000105204412413256713012251 00000000000000 # libtool (GNU libtool) 2.4.2 # Written by Gordon Matzigkeit , 1996 # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, 2006, # 2007, 2008, 2009, 2010, 2011 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 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. # Usage: $progname [OPTION]... [MODE-ARG]... # # Provide generalized library-building support services. # # --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 # --preserve-dup-deps don't remove duplicate dependency libraries # --quiet, --silent don't print informational messages # --no-quiet, --no-silent # print informational messages (default) # --no-warn don't display warning messages # --tag=TAG use configuration variables from tag TAG # -v, --verbose print more informational messages than default # --no-verbose don't print the extra informational messages # --version print version information # -h, --help, --help-all print short, long, or detailed 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) # $progname: (GNU libtool) 2.4.2 Debian-2.4.2-1.7ubuntu1 # automake: $automake_version # autoconf: $autoconf_version # # Report bugs to . # GNU libtool home page: . # General help using GNU software: . PROGRAM=libtool PACKAGE=libtool VERSION="2.4.2 Debian-2.4.2-1.7ubuntu1" TIMESTAMP="" package_revision=1.3337 # 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 # A function that is used when there is no print builtin or printf. func_fallback_echo () { eval 'cat <<_LTECHO_EOF $1 _LTECHO_EOF' } # NLS nuisances: We save the old values to restore during execute mode. lt_user_locale= lt_safe_locale= for lt_var in LANG LANGUAGE LC_ALL LC_CTYPE LC_COLLATE LC_MESSAGES do eval "if test \"\${$lt_var+set}\" = set; then save_$lt_var=\$$lt_var $lt_var=C export $lt_var lt_user_locale=\"$lt_var=\\\$save_\$lt_var; \$lt_user_locale\" lt_safe_locale=\"$lt_var=C; \$lt_safe_locale\" fi" done LC_ALL=C LANGUAGE=C export LANGUAGE LC_ALL $lt_unset CDPATH # 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" : ${CP="cp -f"} test "${ECHO+set}" = set || ECHO=${as_echo-'printf %s\n'} : ${MAKE="make"} : ${MKDIR="mkdir"} : ${MV="mv -f"} : ${RM="rm -f"} : ${SHELL="${CONFIG_SHELL-/bin/sh}"} : ${Xsed="$SED -e 1s/^X//"} # Global variables: 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. exit_status=$EXIT_SUCCESS # Make sure IFS has a sensible default lt_nl=' ' IFS=" $lt_nl" dirname="s,/[^/]*$,," basename="s,^.*/,," # func_dirname file append nondir_replacement # Compute the dirname of FILE. If nonempty, add APPEND to the result, # otherwise set result to NONDIR_REPLACEMENT. func_dirname () { func_dirname_result=`$ECHO "${1}" | $SED "$dirname"` if test "X$func_dirname_result" = "X${1}"; then func_dirname_result="${3}" else func_dirname_result="$func_dirname_result${2}" fi } # func_dirname may be replaced by extended shell implementation # func_basename file func_basename () { func_basename_result=`$ECHO "${1}" | $SED "$basename"` } # func_basename may be replaced by extended shell implementation # 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" # Implementation must be kept synchronized with func_dirname # and func_basename. For efficiency, we do not delegate to # those functions but instead duplicate the functionality here. func_dirname_and_basename () { # Extract subdirectory from the argument. func_dirname_result=`$ECHO "${1}" | $SED -e "$dirname"` if test "X$func_dirname_result" = "X${1}"; then func_dirname_result="${3}" else func_dirname_result="$func_dirname_result${2}" fi func_basename_result=`$ECHO "${1}" | $SED -e "$basename"` } # func_dirname_and_basename may be replaced by extended shell implementation # func_stripname 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). # func_strip_suffix prefix name func_stripname () { 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 may be replaced by extended shell implementation # These SED scripts presuppose an absolute path with a trailing slash. pathcar='s,^/\([^/]*\).*$,\1,' pathcdr='s,^/[^/]*,,' removedotparts=':dotsl s@/\./@/@g t dotsl s,/\.$,/,' collapseslashes='s@/\{1,\}@/@g' finalslash='s,/*$,/,' # 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. # value returned in "$func_normal_abspath_result" func_normal_abspath () { # 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 "$removedotparts" -e "$collapseslashes" -e "$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 "$pathcar"` func_normal_abspath_tpath=`$ECHO "$func_normal_abspath_tpath" | $SED \ -e "$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_normal_abspath_result=$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_relative_path SRCDIR DSTDIR # generates a relative path from SRCDIR to DSTDIR, with a trailing # slash if non-empty, suitable for immediately appending a filename # without needing to append a separator. # value returned in "$func_relative_path_result" func_relative_path () { 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 "x$func_relative_path_tlibdir" = x ; 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 "x$func_stripname_result" != x ; then func_relative_path_result=${func_relative_path_result}/${func_stripname_result} fi # Normalisation. If bindir is libdir, return empty string, # else relative path ending with a slash; either way, target # file name can be directly appended. if test ! -z "$func_relative_path_result"; then func_stripname './' '' "$func_relative_path_result/" func_relative_path_result=$func_stripname_result fi } # The name of this program: func_dirname_and_basename "$progpath" progname=$func_basename_result # Make sure we have an absolute path for reexecution: case $progpath in [\\/]*|[A-Za-z]:\\*) ;; *[\\/]*) progdir=$func_dirname_result progdir=`cd "$progdir" && pwd` progpath="$progdir/$progname" ;; *) save_IFS="$IFS" IFS=${PATH_SEPARATOR-:} for progdir in $PATH; do IFS="$save_IFS" test -x "$progdir/$progname" && break done IFS="$save_IFS" test -n "$progdir" || progdir=`pwd` progpath="$progdir/$progname" ;; esac # Sed substitution that helps us do robust quoting. It backslashifies # metacharacters that are still active within double-quoted strings. Xsed="${SED}"' -e 1s/^X//' sed_quote_subst='s/\([`"$\\]\)/\\\1/g' # Same as above, but do not quote variable references. 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 # which contains forward slashes, into one that contains # (escaped) backslashes. A very naive implementation. lt_sed_naive_backslashify='s|\\\\*|\\|g;s|/|\\|g;s|\\|\\\\|g' # Re-`\' parameter expansions in output of double_quote_subst that were # `\'-ed in input to the same. If an odd number of `\' preceded a '$' # in input to 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 '$'. bs='\\' bs2='\\\\' bs4='\\\\\\\\' dollar='\$' sed_double_backslash="\ s/$bs4/&\\ /g s/^$bs2$dollar/$bs&/ s/\\([^$bs]\\)$bs2$dollar/\\1$bs2$bs$dollar/g s/\n//g" # Standard options: opt_dry_run=false opt_help=false opt_quiet=false opt_verbose=false opt_warning=: # func_echo arg... # Echo program name prefixed message, along with the current mode # name if it has been set yet. func_echo () { $ECHO "$progname: ${opt_mode+$opt_mode: }$*" } # func_verbose arg... # Echo program name prefixed message in verbose mode only. func_verbose () { $opt_verbose && 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_echo_all arg... # Invoke $ECHO with all args, space-separated. func_echo_all () { $ECHO "$*" } # func_error arg... # Echo program name prefixed message to standard error. func_error () { $ECHO "$progname: ${opt_mode+$opt_mode: }"${1+"$@"} 1>&2 } # func_warning arg... # Echo program name prefixed warning message to standard error. func_warning () { $opt_warning && $ECHO "$progname: ${opt_mode+$opt_mode: }warning: "${1+"$@"} 1>&2 # bash bug again: : } # func_fatal_error arg... # Echo program name prefixed message to standard error, and exit. func_fatal_error () { func_error ${1+"$@"} exit $EXIT_FAILURE } # func_fatal_help arg... # Echo program name prefixed message to standard error, followed by # a help hint, and exit. func_fatal_help () { func_error ${1+"$@"} func_fatal_error "$help" } help="Try \`$progname --help' for more information." ## default # func_grep expression filename # Check whether EXPRESSION matches any line of FILENAME, without output. func_grep () { $GREP "$1" "$2" >/dev/null 2>&1 } # func_mkdir_p directory-path # Make sure the entire path to DIRECTORY-PATH is available. func_mkdir_p () { my_directory_path="$1" my_dir_list= if test -n "$my_directory_path" && test "$opt_dry_run" != ":"; then # Protect directory names starting with `-' case $my_directory_path in -*) my_directory_path="./$my_directory_path" ;; esac # While some portion of DIR does not yet exist... while test ! -d "$my_directory_path"; do # ...make a list in topmost first order. Use a colon delimited # list incase some portion of path contains whitespace. my_dir_list="$my_directory_path:$my_dir_list" # If the last portion added has no slash in it, the list is done case $my_directory_path in */*) ;; *) break ;; esac # ...otherwise throw away the child directory and loop my_directory_path=`$ECHO "$my_directory_path" | $SED -e "$dirname"` done my_dir_list=`$ECHO "$my_dir_list" | $SED 's,:*$,,'` save_mkdir_p_IFS="$IFS"; IFS=':' for my_dir in $my_dir_list; do IFS="$save_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 "$my_dir" 2>/dev/null || : done IFS="$save_mkdir_p_IFS" # Bail out if we (or some other process) failed to create a directory. test -d "$my_directory_path" || \ func_fatal_error "Failed to create \`$1'" fi } # func_mktempdir [string] # Make a temporary directory that won't clash with other running # libtool processes, and avoids race conditions if possible. If # given, STRING is the basename for that directory. func_mktempdir () { my_template="${TMPDIR-/tmp}/${1-$progname}" if test "$opt_dry_run" = ":"; then # Return a directory name, but don't create it in dry-run mode my_tmpdir="${my_template}-$$" else # If mktemp works, use that first and foremost my_tmpdir=`mktemp -d "${my_template}-XXXXXXXX" 2>/dev/null` if test ! -d "$my_tmpdir"; then # Failing that, at least try and use $RANDOM to avoid a race my_tmpdir="${my_template}-${RANDOM-0}$$" save_mktempdir_umask=`umask` umask 0077 $MKDIR "$my_tmpdir" umask $save_mktempdir_umask fi # If we're not in dry-run mode, bomb out on failure test -d "$my_tmpdir" || \ func_fatal_error "cannot create temporary directory \`$my_tmpdir'" fi $ECHO "$my_tmpdir" } # func_quote_for_eval arg # Aesthetically quote ARG to be evaled later. # This function returns two values: FUNC_QUOTE_FOR_EVAL_RESULT # is double-quoted, suitable for a subsequent eval, whereas # FUNC_QUOTE_FOR_EVAL_UNQUOTED_RESULT has merely all characters # which are still active within double quotes backslashified. func_quote_for_eval () { case $1 in *[\\\`\"\$]*) func_quote_for_eval_unquoted_result=`$ECHO "$1" | $SED "$sed_quote_subst"` ;; *) func_quote_for_eval_unquoted_result="$1" ;; esac case $func_quote_for_eval_unquoted_result in # Double-quote args containing shell metacharacters to delay # word splitting, command substitution and and variable # expansion for a subsequent eval. # Many Bourne shells cannot handle close brackets correctly # in scan sets, so we specify it separately. *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") func_quote_for_eval_result="\"$func_quote_for_eval_unquoted_result\"" ;; *) func_quote_for_eval_result="$func_quote_for_eval_unquoted_result" esac } # 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 () { case $1 in *[\\\`\"]*) my_arg=`$ECHO "$1" | $SED \ -e "$double_quote_subst" -e "$sed_double_backslash"` ;; *) my_arg="$1" ;; esac case $my_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. *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") my_arg="\"$my_arg\"" ;; esac func_quote_for_expand_result="$my_arg" } # func_show_eval cmd [fail_exp] # Unless opt_silent 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 () { my_cmd="$1" my_fail_exp="${2-:}" ${opt_silent-false} || { func_quote_for_expand "$my_cmd" eval "func_echo $func_quote_for_expand_result" } if ${opt_dry_run-false}; then :; else eval "$my_cmd" my_status=$? if test "$my_status" -eq 0; then :; else eval "(exit $my_status); $my_fail_exp" fi fi } # func_show_eval_locale cmd [fail_exp] # Unless opt_silent 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 () { my_cmd="$1" my_fail_exp="${2-:}" ${opt_silent-false} || { func_quote_for_expand "$my_cmd" eval "func_echo $func_quote_for_expand_result" } if ${opt_dry_run-false}; then :; else eval "$lt_user_locale $my_cmd" my_status=$? eval "$lt_safe_locale" if test "$my_status" -eq 0; then :; else eval "(exit $my_status); $my_fail_exp" fi 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 () { case $1 in [0-9]* | *[!a-zA-Z0-9_]*) func_tr_sh_result=`$ECHO "$1" | $SED 's/^\([0-9]\)/_\1/; s/[^a-zA-Z0-9_]/_/g'` ;; * ) func_tr_sh_result=$1 ;; esac } # func_version # Echo version message to standard output and exit. func_version () { $opt_debug $SED -n '/(C)/!b go :more /\./!{ N s/\n# / / b more } :go /^# '$PROGRAM' (GNU /,/# warranty; / { s/^# // s/^# *$// s/\((C)\)[ 0-9,-]*\( [1-9][0-9]*\)/\1\2/ p }' < "$progpath" exit $? } # func_usage # Echo short help message to standard output and exit. func_usage () { $opt_debug $SED -n '/^# Usage:/,/^# *.*--help/ { s/^# // s/^# *$// s/\$progname/'$progname'/ p }' < "$progpath" echo $ECHO "run \`$progname --help | more' for full usage" exit $? } # func_help [NOEXIT] # Echo long help message to standard output and exit, # unless 'noexit' is passed as argument. func_help () { $opt_debug $SED -n '/^# Usage:/,/# Report bugs to/ { :print s/^# // s/^# *$// s*\$progname*'$progname'* s*\$host*'"$host"'* s*\$SHELL*'"$SHELL"'* s*\$LTCC*'"$LTCC"'* s*\$LTCFLAGS*'"$LTCFLAGS"'* s*\$LD*'"$LD"'* s/\$with_gnu_ld/'"$with_gnu_ld"'/ s/\$automake_version/'"`(${AUTOMAKE-automake} --version) 2>/dev/null |$SED 1q`"'/ s/\$autoconf_version/'"`(${AUTOCONF-autoconf} --version) 2>/dev/null |$SED 1q`"'/ p d } /^# .* home page:/b print /^# General help using/b print ' < "$progpath" ret=$? if test -z "$1"; then exit $ret fi } # func_missing_arg argname # Echo program name prefixed message to standard error and set global # exit_cmd. func_missing_arg () { $opt_debug func_error "missing argument for $1." exit_cmd=exit } # 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. func_split_short_opt () { my_sed_short_opt='1s/^\(..\).*$/\1/;q' my_sed_short_rest='1s/^..\(.*\)$/\1/;q' func_split_short_opt_name=`$ECHO "$1" | $SED "$my_sed_short_opt"` func_split_short_opt_arg=`$ECHO "$1" | $SED "$my_sed_short_rest"` } # func_split_short_opt may be replaced by extended shell implementation # func_split_long_opt longopt # Set func_split_long_opt_name and func_split_long_opt_arg shell # variables after splitting LONGOPT at the `=' sign. func_split_long_opt () { my_sed_long_opt='1s/^\(--[^=]*\)=.*/\1/;q' my_sed_long_arg='1s/^--[^=]*=//' func_split_long_opt_name=`$ECHO "$1" | $SED "$my_sed_long_opt"` func_split_long_opt_arg=`$ECHO "$1" | $SED "$my_sed_long_arg"` } # func_split_long_opt may be replaced by extended shell implementation exit_cmd=: magic="%%%MAGIC variable%%%" magic_exe="%%%MAGIC EXE variable%%%" # Global variables. nonopt= preserve_args= lo2o="s/\\.lo\$/.${objext}/" o2lo="s/\\.${objext}\$/.lo/" 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= # func_append var value # Append VALUE to the end of shell variable VAR. func_append () { eval "${1}=\$${1}\${2}" } # func_append may be replaced by extended shell implementation # func_append_quoted var value # Quote VALUE and append to the end of shell variable VAR, separated # by a space. func_append_quoted () { func_quote_for_eval "${2}" eval "${1}=\$${1}\\ \$func_quote_for_eval_result" } # func_append_quoted may be replaced by extended shell implementation # func_arith arithmetic-term... func_arith () { func_arith_result=`expr "${@}"` } # func_arith may be replaced by extended shell implementation # func_len string # STRING may not start with a hyphen. func_len () { func_len_result=`expr "${1}" : ".*" 2>/dev/null || echo $max_cmd_len` } # func_len may be replaced by extended shell implementation # func_lo2o object func_lo2o () { func_lo2o_result=`$ECHO "${1}" | $SED "$lo2o"` } # func_lo2o may be replaced by extended shell implementation # func_xform libobj-or-source func_xform () { func_xform_result=`$ECHO "${1}" | $SED 's/\.[^.]*$/.lo/'` } # func_xform may be replaced by extended shell implementation # func_fatal_configuration arg... # Echo program name prefixed message to standard error, followed by # a configuration failure hint, and exit. func_fatal_configuration () { func_error ${1+"$@"} func_error "See the $PACKAGE documentation for more information." func_fatal_error "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 "$build_libtool_libs" = yes; then echo "enable shared libraries" else echo "disable shared libraries" fi if test "$build_old_libs" = yes; 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 } # 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 # Option defaults: opt_debug=: opt_dry_run=false opt_config=false opt_preserve_dup_deps=false opt_features=false opt_finish=false opt_help=false opt_help_all=false opt_silent=: opt_warning=: opt_verbose=: opt_silent=false opt_verbose=false # Parse options once, thoroughly. This comes as soon as possible in the # script to make things like `--version' happen as quickly as we can. { # this just eases exit handling while test $# -gt 0; do opt="$1" shift case $opt in --debug|-x) opt_debug='set -x' func_echo "enabling shell trace mode" $opt_debug ;; --dry-run|--dryrun|-n) opt_dry_run=: ;; --config) opt_config=: func_config ;; --dlopen|-dlopen) optarg="$1" opt_dlopen="${opt_dlopen+$opt_dlopen }$optarg" shift ;; --preserve-dup-deps) opt_preserve_dup_deps=: ;; --features) opt_features=: func_features ;; --finish) opt_finish=: set dummy --mode finish ${1+"$@"}; shift ;; --help) opt_help=: ;; --help-all) opt_help_all=: opt_help=': help-all' ;; --mode) test $# = 0 && func_missing_arg $opt && break optarg="$1" opt_mode="$optarg" case $optarg in # Valid mode arguments: clean|compile|execute|finish|install|link|relink|uninstall) ;; # Catch anything else as an error *) func_error "invalid argument for $opt" exit_cmd=exit break ;; esac shift ;; --no-silent|--no-quiet) opt_silent=false func_append preserve_args " $opt" ;; --no-warning|--no-warn) opt_warning=false func_append preserve_args " $opt" ;; --no-verbose) opt_verbose=false func_append preserve_args " $opt" ;; --silent|--quiet) opt_silent=: func_append preserve_args " $opt" opt_verbose=false ;; --verbose|-v) opt_verbose=: func_append preserve_args " $opt" opt_silent=false ;; --tag) test $# = 0 && func_missing_arg $opt && break optarg="$1" opt_tag="$optarg" func_append preserve_args " $opt $optarg" func_enable_tag "$optarg" shift ;; -\?|-h) func_usage ;; --help) func_help ;; --version) func_version ;; # Separate optargs to long options: --*=*) func_split_long_opt "$opt" set dummy "$func_split_long_opt_name" "$func_split_long_opt_arg" ${1+"$@"} shift ;; # Separate non-argument short options: -\?*|-h*|-n*|-v*) func_split_short_opt "$opt" set dummy "$func_split_short_opt_name" "-$func_split_short_opt_arg" ${1+"$@"} shift ;; --) break ;; -*) func_fatal_help "unrecognized option \`$opt'" ;; *) set dummy "$opt" ${1+"$@"}; shift; break ;; esac done # Validate options: # save first non-option argument if test "$#" -gt 0; then nonopt="$opt" shift fi # preserve --debug test "$opt_debug" = : || 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 if test "$build_libtool_libs" != yes && test "$build_old_libs" != yes; then func_fatal_configuration "not configured to build any kind of library" fi # Darwin sucks eval std_shrext=\"$shrext_cmds\" # Only execute mode is allowed to have -dlopen flags. if test -n "$opt_dlopen" && test "$opt_mode" != execute; 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." } # Bail if the options were screwed $exit_cmd $EXIT_FAILURE } ## ----------- ## ## Main. ## ## ----------- ## # 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 "$lalib_p" = yes } # 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 () { $opt_debug save_ifs=$IFS; IFS='~' for cmd in $1; do IFS=$save_ifs eval cmd=\"$cmd\" 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 () { $opt_debug 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 () { $opt_debug 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 "$build_libtool_libs" = yes; then write_lobj=\'${2}\' else write_lobj=none fi if test "$build_old_libs" = yes; 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 "$lt_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 () { $opt_debug # 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 () { $opt_debug 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 () { $opt_debug # awkward: cmd appends spaces to result func_convert_core_msys_to_w32_result=`( cmd //c echo "$1" ) 2>/dev/null | $SED -e 's/[ ]*$//' -e "$lt_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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug $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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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 () { $opt_debug 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_mode_compile arg... func_mode_compile () { $opt_debug # 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 "$build_libtool_libs" != yes && \ func_fatal_configuration "can not 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 "$build_old_libs" = yes; 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 "$pic_mode" = no && test "$deplibs_check_method" != pass_all; 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 "$compiler_c_o" = no; 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 "$need_locks" = yes; 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 "$need_locks" = warn; 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 "$build_libtool_libs" = yes; then # Without this assignment, base_compile gets emptied. fbsd_hideous_sh_bug=$base_compile if test "$pic_mode" != no; 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 "$need_locks" = warn && 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 "$suppress_opt" = yes; then suppress_output=' >/dev/null 2>&1' fi fi # Only build a position-dependent object if we build old libraries. if test "$build_old_libs" = yes; then if test "$pic_mode" != yes; then # Don't build PIC code command="$base_compile $qsrcfile$pie_flag" else command="$base_compile $qsrcfile $pic_flag" fi if test "$compiler_c_o" = yes; 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 "$need_locks" = warn && 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 "$need_locks" != no; then removelist=$lockfile $RM "$lockfile" fi } exit $EXIT_SUCCESS } $opt_help || { test "$opt_mode" = compile && 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 () { $opt_debug # 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 test "X$opt_dry_run" = Xfalse; then 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" else # 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 fi } test "$opt_mode" = execute && func_mode_execute ${1+"$@"} # func_mode_finish arg... func_mode_finish () { $opt_debug 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_silent && 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 "$opt_mode" = finish && func_mode_finish ${1+"$@"} # func_mode_install arg... func_mode_install () { $opt_debug # There may be an optional sh(1) argument at the beginning of # install_prog (especially on Windows NT). if test "$nonopt" = "$SHELL" || test "$nonopt" = /bin/sh || # 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=no 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=yes ;; -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$prev" = x-m && 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=yes if test "$isdir" = yes; 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 "$build_old_libs" = yes; 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=yes 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'` ### testsuite: skip nested quoting test if test -n "$libdir" && test ! -f "$libfile"; then func_warning "\`$lib' has not been installed in \`$libdir'" finalize=no fi done relink_command= func_source "$wrapper" outputname= if test "$fast_install" = no && test -n "$relink_command"; then $opt_dry_run || { if test "$finalize" = yes; 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_silent || { 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 "$opt_mode" = install && 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 () { $opt_debug my_outputname="$1" my_originator="$2" my_pic_p="${3-no}" my_prefix=`$ECHO "$my_originator" | sed 's%[^a-zA-Z0-9]%_%g'` my_dlsyms= if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; 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$TIMESTAMP) $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 con'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 /* External symbol declarations for the compiler. */\ " if test "$dlself" = yes; 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 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[]; LT_DLSYM_CONST lt_dlsymlist lt_${my_prefix}_LTX_preloaded_symbols[] = {\ { \"$my_originator\", (void *) 0 }," 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" ;; *) if test "X$my_pic_p" != Xno; then pic_flag_for_symtable=" $pic_flag" fi ;; 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"' # 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_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 () { $opt_debug 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 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 } }'` 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 () { $opt_debug 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 () { $opt_debug 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 which possess that section. Heuristic: eliminate # all those which 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_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 () { $opt_debug 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 () { $opt_debug 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_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 () { $opt_debug 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 () { $opt_debug f_ex_an_ar_dir="$1"; shift f_ex_an_ar_oldlib="$1" if test "$lock_old_archive_extraction" = yes; 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 "$lock_old_archive_extraction" = yes; 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 () { $opt_debug 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` darwin_base_archive=`basename "$darwin_archive"` 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 in which 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$TIMESTAMP) $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/ which is used only on # windows platforms, and (c) all begin with the string "--lt-" # (application programs are unlikely to have options which 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$TIMESTAMP) $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 "$fast_install" = yes; 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 "$shlibpath_overrides_runpath" = yes && 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 /* 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 platforms) ... */ #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 # ifndef _INTPTR_T_DEFINED # define _INTPTR_T_DEFINED # define intptr_t int # endif #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 ((void *) 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]; int 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 = 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 (strcmp (str, pat) == 0) *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 int 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) { int orig_value_len = strlen (orig_value); int 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 #' */ int len = strlen (new_value); while (((len = strlen (new_value)) > 0) && IS_PATH_SEPARATOR (new_value[len-1])) { new_value[len-1] = '\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 () { $opt_debug case `eval $file_magic_cmd \"\$1\" 2>/dev/null | $SED -e 10q` in *import*) : ;; *) false ;; esac } # func_mode_link arg... func_mode_link () { $opt_debug 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 # which 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 which 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=no 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 "$build_libtool_libs" != yes && \ func_fatal_configuration "can not build a shared library" build_old_libs=no break ;; -all-static | -static | -static-libtool-libs) case $arg in -all-static) if test "$build_libtool_libs" = yes && 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) if test "$preload" = no; then # Add the symbol object into the linking commands. func_append compile_command " @SYMFILE@" func_append finalize_command " @SYMFILE@" preload=yes fi case $arg in *.la | *.lo) ;; # We handle these cases below. force) if test "$dlself" = no; then dlself=needless export_dynamic=yes fi prev= continue ;; self) if test "$prev" = dlprefiles; then dlself=yes elif test "$prev" = dlfiles && test "$dlopen_self" != yes; then dlself=yes else dlself=needless export_dynamic=yes fi prev= continue ;; *) if test "$prev" = dlfiles; 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 ;; 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 "$pic_object" = none && test "$non_pic_object" = none; 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 "$pic_object" != none; then # Prepend the subdirectory the object is found in. pic_object="$xdir$pic_object" if test "$prev" = dlfiles; then if test "$build_libtool_libs" = yes && test "$dlopen_support" = yes; 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 "$prev" = dlprefiles; 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 "$non_pic_object" != none; 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 "$pic_object" = none ; 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 "$prev" = rpath; 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$arg" = "X-export-symbols"; 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$arg" = "X-lc" || test "X$arg" = "X-lm"; 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$arg" = "X-lc" && continue ;; *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*) # Do not include libc due to us having libc/libc_r. test "X$arg" = "X-lc" && 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$arg" = "X-lc" && continue ;; *-*-sysv4.2uw2* | *-*-sysv5* | *-*-unixware* | *-*-OpenUNIX*) # Compiler inserts libc in the correct place for threads to work test "X$arg" = "X-lc" && continue ;; esac elif test "X$arg" = "X-lc_r"; then case $host in *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*) # Do not include libc_r directly, use -pthread flag. continue ;; esac fi func_append deplibs " $arg" 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*, -flto*, -fwhopr*, -fuse-linker-plugin GCC link-time optimization -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*|-flto*|-fwhopr*|-fuse-linker-plugin) 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 "$pic_object" = none && test "$non_pic_object" = none; 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 "$pic_object" != none; then # Prepend the subdirectory the object is found in. pic_object="$xdir$pic_object" if test "$prev" = dlfiles; then if test "$build_libtool_libs" = yes && test "$dlopen_support" = yes; 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 "$prev" = dlprefiles; 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 "$non_pic_object" != none; 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 "$pic_object" = none ; 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 "$prev" = dlfiles; then # This library was specified with -dlopen. func_append dlfiles " $func_resolve_sysroot_result" prev= elif test "$prev" = dlprefiles; 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 "$export_dynamic" = yes && 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 "$linkmode" = lib; 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=no 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 "$linkmode,$pass" = "lib,link"; 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 "$linkmode,$pass" = "lib,link" || test "$linkmode,$pass" = "prog,scan"; then libs="$deplibs" deplibs= fi if test "$linkmode" = prog; then case $pass in dlopen) libs="$dlfiles" ;; dlpreopen) libs="$dlprefiles" ;; link) libs="$deplibs %DEPLIBS%" test "X$link_all_deplibs" != Xno && libs="$libs $dependency_libs" ;; esac fi if test "$linkmode,$pass" = "lib,dlpreopen"; 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 "$pass" = dlopen; then # Collect dlpreopened libraries save_deplibs="$deplibs" deplibs= fi for deplib in $libs; do lib= found=no case $deplib in -mt|-mthreads|-kthread|-Kthread|-pthread|-pthreads|--thread-safe \ |-threads|-fopenmp|-openmp|-mp|-xopenmp|-omp|-qsmp=*) if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else func_append compiler_flags " $deplib" if test "$linkmode" = lib ; then case "$new_inherited_linker_flags " in *" $deplib "*) ;; * ) func_append new_inherited_linker_flags " $deplib" ;; esac fi fi continue ;; -l*) if test "$linkmode" != lib && test "$linkmode" != prog; then func_warning "\`-l' is ignored for archives/objects" continue fi func_stripname '-l' '' "$deplib" name=$func_stripname_result if test "$linkmode" = lib; 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 "$search_ext" = ".la"; then found=yes else found=no fi break 2 fi done done if test "$found" != yes; then # deplib doesn't seem to be a libtool library if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" test "$linkmode" = lib && newdependency_libs="$deplib $newdependency_libs" fi continue else # 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 "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; 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=no func_dirname "$lib" "" "." ladir="$func_dirname_result" lib=$ladir/$old_library if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" test "$linkmode" = lib && newdependency_libs="$deplib $newdependency_libs" fi continue fi fi ;; *) ;; esac fi fi ;; # -l *.ltframework) if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" if test "$linkmode" = lib ; 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 "$pass" = conv && 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 "$pass" = conv; then deplibs="$deplib $deplibs" continue fi if test "$pass" = scan; 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 "$pass" = link; 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 "$pass" = conv; 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=no 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=yes fi ;; pass_all) valid_a_lib=yes ;; esac if test "$valid_a_lib" != yes; then 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." else echo $ECHO "*** Warning: Linking the shared library $output against the" $ECHO "*** static library $deplib is not portable!" deplibs="$deplib $deplibs" fi ;; esac continue ;; prog) if test "$pass" != link; then deplibs="$deplib $deplibs" else compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" fi continue ;; esac # linkmode ;; # *.$libext *.lo | *.$objext) if test "$pass" = conv; then deplibs="$deplib $deplibs" elif test "$linkmode" = prog; then if test "$pass" = dlpreopen || test "$dlopen_support" != yes || test "$build_libtool_libs" = no; 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=yes continue ;; esac # case $deplib if test "$found" = yes || test -f "$lib"; then : else func_fatal_error "cannot find the library \`$lib' or unhandled argument \`$deplib'" fi # 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 "$linkmode,$pass" = "lib,link" || test "$linkmode,$pass" = "prog,scan" || { test "$linkmode" != prog && test "$linkmode" != lib; }; then test -n "$dlopen" && func_append dlfiles " $dlopen" test -n "$dlpreopen" && func_append dlprefiles " $dlpreopen" fi if test "$pass" = conv; 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" 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 elif test "$linkmode" != prog && test "$linkmode" != lib; then func_fatal_error "\`$lib' is not a convenience library" fi continue fi # $pass = conv # Get the name of the library we link against. linklib= if test -n "$old_library" && { test "$prefer_static_libs" = yes || test "$prefer_static_libs,$installed" = "built,no"; }; 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 "$pass" = dlopen; then if test -z "$libdir"; then func_fatal_error "cannot -dlopen a convenience library: \`$lib'" fi if test -z "$dlname" || test "$dlopen_support" != yes || test "$build_libtool_libs" = no; 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 "X$installed" = Xyes; 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 "X$hardcode_automatic" = Xyes && 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 "$pass" = dlpreopen; then if test -z "$libdir" && test "$linkmode" = prog; 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 "$linkmode" = lib; then deplibs="$dir/$old_library $deplibs" elif test "$linkmode,$pass" = "prog,link"; 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 "$linkmode" = prog && test "$pass" != link; then func_append newlib_search_path " $ladir" deplibs="$lib $deplibs" linkalldeplibs=no if test "$link_all_deplibs" != no || test -z "$library_names" || test "$build_libtool_libs" = no; then linkalldeplibs=yes 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 test "$linkalldeplibs" = yes; 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 "$linkmode,$pass" = "prog,link"; then if test -n "$library_names" && { { test "$prefer_static_libs" = no || test "$prefer_static_libs,$installed" = "built,yes"; } || 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 test "$alldeplibs" = yes && { test "$deplibs_check_method" = pass_all || { test "$build_libtool_libs" = yes && 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 "$use_static_libs" = built && test "$installed" = yes; then use_static_libs=no fi if test -n "$library_names" && { test "$use_static_libs" = no || 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 "$installed" = no; 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 "$shouldnotlink" = yes && test "$pass" = link; then echo if test "$linkmode" = prog; 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 "$linkmode" = lib && test "$hardcode_into_libs" = yes; 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 "$linkmode" = prog || test "$opt_mode" != relink; then add_shlibpath= add_dir= add= lib_linked=yes case $hardcode_action in immediate | unsupported) if test "$hardcode_direct" = no; 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 can not # 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 "$hardcode_minus_L" = no; then case $host in *-*-sunos*) add_shlibpath="$dir" ;; esac add_dir="-L$dir" add="-l$name" elif test "$hardcode_shlibpath_var" = no; then add_shlibpath="$dir" add="-l$name" else lib_linked=no fi ;; relink) if test "$hardcode_direct" = yes && test "$hardcode_direct_absolute" = no; then add="$dir/$linklib" elif test "$hardcode_minus_L" = yes; 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 "$hardcode_shlibpath_var" = yes; then add_shlibpath="$dir" add="-l$name" else lib_linked=no fi ;; *) lib_linked=no ;; esac if test "$lib_linked" != yes; 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 "$linkmode" = prog; 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 "$hardcode_direct" != yes && test "$hardcode_minus_L" != yes && test "$hardcode_shlibpath_var" = yes; then case :$finalize_shlibpath: in *":$libdir:"*) ;; *) func_append finalize_shlibpath "$libdir:" ;; esac fi fi fi if test "$linkmode" = prog || test "$opt_mode" = relink; then add_shlibpath= add_dir= add= # Finalize command for both is simple: just hardcode it. if test "$hardcode_direct" = yes && test "$hardcode_direct_absolute" = no; then add="$libdir/$linklib" elif test "$hardcode_minus_L" = yes; then add_dir="-L$libdir" add="-l$name" elif test "$hardcode_shlibpath_var" = yes; then case :$finalize_shlibpath: in *":$libdir:"*) ;; *) func_append finalize_shlibpath "$libdir:" ;; esac add="-l$name" elif test "$hardcode_automatic" = yes; 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 "$linkmode" = prog; 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 "$linkmode" = prog; 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 "$hardcode_direct" != unsupported; 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 "$build_libtool_libs" = yes; then # Not a shared library if test "$deplibs_check_method" != pass_all; 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 can not 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 "$module" = yes; 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 "$build_old_libs" = no; 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 "$linkmode" = lib; then if test -n "$dependency_libs" && { test "$hardcode_into_libs" != yes || test "$build_old_libs" = yes || test "$link_static" = yes; }; 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 "$link_static" = no && 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 "$link_all_deplibs" != no; 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 "$pass" = link; then if test "$linkmode" = "prog"; 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 "$pass" = dlpreopen; then # Link the dlpreopened libraries before other libraries for deplib in $save_deplibs; do deplibs="$deplib $deplibs" done fi if test "$pass" != dlopen; then if test "$pass" != conv; then # 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= fi if test "$linkmode,$pass" != "prog,link"; then vars="deplibs" else vars="compile_deplibs finalize_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 "$linkmode" = prog; then dlfiles="$newdlfiles" fi if test "$linkmode" = prog || test "$linkmode" = lib; then dlprefiles="$newdlprefiles" fi case $linkmode in oldlib) if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; 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 "$module" = no && \ func_fatal_help "libtool library \`$output' must begin with \`lib'" if test "$need_lib_prefix" != no; 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 "$deplibs_check_method" != pass_all; 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 "$dlself" != no && \ func_warning "\`-dlopen self' is ignored for libtool libraries" set dummy $rpath shift test "$#" -gt 1 && \ func_warning "ignoring multiple \`-rpath's for a libtool library" install_libdir="$1" oldlibs= if test -z "$rpath"; then if test "$build_libtool_libs" = yes; 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 # which 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 ;; *) func_fatal_configuration "$modename: unknown library version type \`$version_type'" ;; 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" ;; freebsd-aout) major=".$current" versuffix=".$current.$revision"; ;; freebsd-elf) major=".$current" versuffix=".$current" ;; irix | nonstopux) if test "X$lt_irix_increment" = "Xno"; 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 "$loop" -ne 0; 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 "$loop" -ne 0; 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 filesystems. 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 "$need_version" = no; then versuffix= else versuffix=".0.0" fi fi # Remove version info from name if versioning should be avoided if test "$avoid_version" = yes && test "$need_version" = no; then major= versuffix= verstring="" fi # Check to see if the archive will have undefined symbols. if test "$allow_undefined" = yes; then if test "$allow_undefined_flag" = unsupported; then func_warning "undefined symbols not allowed in $host shared libraries" build_libtool_libs=no build_old_libs=yes fi else # Don't allow undefined symbols. allow_undefined_flag="$no_undefined_flag" fi fi func_generate_dlsyms "$libname" "$libname" "yes" func_append libobjs " $symfileobj" test "X$libobjs" = "X " && libobjs= if test "$opt_mode" != relink; 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 "X$precious_files_regex" != "X"; 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 "$build_old_libs" = yes && test "$build_libtool_libs" != convenience ; 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 "$hardcode_into_libs" != yes || test "$build_old_libs" = yes; 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 "$build_libtool_libs" = yes; 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 "$build_libtool_need_lc" = "yes"; 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 "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; 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 "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; 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 "X$deplibs_check_method" = "Xnone"; 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 "$droppeddeps" = yes; then if test "$module" = yes; 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 "$build_old_libs" = no; 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 "$allow_undefined" = no; 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 "$build_old_libs" = no; 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 "$build_libtool_libs" = yes; then # Remove ${wl} instances when linking with ld. # FIXME: should test the right _cmds variable. case $archive_cmds in *\$LD\ *) wl= ;; esac if test "$hardcode_into_libs" = yes; then # Hardcode the library paths hardcode_libdirs= dep_rpath= rpath="$finalize_rpath" test "$opt_mode" != relink && 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 "$opt_mode" != relink && 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 if test "x`$SED 1q $export_symbols`" != xEXPORTS; then # 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 fi ;; esac # Prepare the list of exported symbols if test -z "$export_symbols"; then if test "$always_export_symbols" = yes || 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 "$try_normal_branch" = yes \ && { 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 "X$skipped_export" != "X:"; 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 "X$skipped_export" != "X:" && 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 "$compiler_needs_object" = yes && 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 "$thread_safe" = yes && 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 "$opt_mode" = relink; 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 "$module" = yes && 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 "X$skipped_export" != "X:" && 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 "X$skipped_export" != "X:" && test "$with_gnu_ld" = yes; 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 "X$skipped_export" != "X:" && test "X$file_list_spec" != X; then output=${output_objdir}/${output_la}.lnk func_verbose "creating linker input file list: $output" : > $output set x $save_libobjs shift firstobj= if test "$compiler_needs_object" = yes; 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 "X$objlist" = X || 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 "$k" -eq 1 ; 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 if ${skipped_export-false}; then 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 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_silent || { 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 "$opt_mode" = relink; 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 if ${skipped_export-false}; then 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 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 "$module" = yes && 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="$save_ifs" eval cmd=\"$cmd\" $opt_silent || { 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 "$opt_mode" = relink; 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 "$opt_mode" = relink; 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 "$module" = yes || test "$export_dynamic" = yes; then # On all known operating systems, these are identical. dlname="$soname" fi fi ;; obj) if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; 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 "$build_libtool_libs" != yes && 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" ### testsuite: skip nested quoting test 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 if test "$build_libtool_libs" != yes; then 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 fi if test -n "$pic_flag" || test "$pic_mode" != default; 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" test "$preload" = yes \ && test "$dlopen_support" = unknown \ && test "$dlopen_self" = unknown \ && test "$dlopen_self_static" = unknown && \ 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 "$tagname" = CXX ; 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 "$build_old_libs" = yes; 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@" "no" # template prelinking step if test -n "$prelink_cmds"; then func_execute_cmds "$prelink_cmds" 'exit $?' fi wrappers_required=yes case $host in *cegcc* | *mingw32ce*) # Disable wrappers for cegcc and mingw32ce hosts, we are cross compiling anyway. wrappers_required=no ;; *cygwin* | *mingw* ) if test "$build_libtool_libs" != yes; then wrappers_required=no fi ;; *) if test "$need_relink" = no || test "$build_libtool_libs" != yes; then wrappers_required=no fi ;; esac if test "$wrappers_required" = no; then # 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 fi 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 "$no_install" = yes; 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 if test "$hardcode_action" = relink; then # 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" else if test "$fast_install" != no; then link_command="$finalize_var$compile_command$finalize_rpath" if test "$fast_install" = yes; then relink_command=`$ECHO "$compile_var$compile_command$compile_rpath" | $SED 's%@OUTPUT@%\$progdir/\$file%g'` else # fast_install is set to needless relink_command= fi else link_command="$compile_var$compile_command$compile_rpath" relink_command="$finalize_var$finalize_command$finalize_rpath" fi fi # 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 if test "$build_libtool_libs" = convenience; then oldobjs="$libobjs_save $symfileobj" addlibs="$convenience" build_libtool_libs=no else if test "$build_libtool_libs" = module; then oldobjs="$libobjs_save" build_libtool_libs=no else oldobjs="$old_deplibs $non_pic_objects" if test "$preload" = yes && test -f "$symfileobj"; then func_append oldobjs " $symfileobj" fi fi addlibs="$old_convenience" fi 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 "$build_libtool_libs" = yes; 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 "X$oldobjs" = "X" ; 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 "$build_old_libs" = yes && 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 "$hardcode_automatic" = yes ; then relink_command= fi # Only create the output if not a dry run. $opt_dry_run || { for installed in no yes; do if test "$installed" = yes; 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 "x$bindir" != x ; 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$TIMESTAMP) $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 can not 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 "$installed" = no && test "$need_relink" = yes; 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 } { test "$opt_mode" = link || test "$opt_mode" = relink; } && func_mode_link ${1+"$@"} # func_mode_uninstall arg... func_mode_uninstall () { $opt_debug RM="$nonopt" files= rmforce= 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=yes ;; -*) 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 "X$dir" = X.; then odir="$objdir" else odir="$dir/$objdir" fi func_basename "$file" name="$func_basename_result" test "$opt_mode" = uninstall && odir="$dir" # Remember odir for removal later, being careful to avoid duplicates if test "$opt_mode" = clean; 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 test "$rmforce" = yes; 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" 'test "$rmforce" = yes || exit_status=1' fi if test -n "$old_library"; then # Do each command in the old_postuninstall commands. func_execute_cmds "$old_postuninstall_cmds" 'test "$rmforce" = yes || 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 "$pic_object" != none; 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 "$non_pic_object" != none; then func_append rmfiles " $dir/$non_pic_object" fi fi ;; *) if test "$opt_mode" = clean ; 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 "$fast_install" = yes && 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 } { test "$opt_mode" = uninstall || test "$opt_mode" = clean; } && func_mode_uninstall ${1+"$@"} 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 # in which 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: # vi:sw=2 cloog-0.18.4/isl/isl_blk.h0000644000175000017500000000150712413270107012207 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.4/isl/isl_ast_build_expr.c0000644000175000017500000015354412554427055014463 00000000000000/* * Copyright 2012-2014 Ecole Normale Superieure * Copyright 2014 INRIA Rocquencourt * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, * Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt, * B.P. 105 - 78153 Le Chesnay, France */ #include #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; } /* Internal data structure used inside isl_ast_expr_add_term. * The domain of "build" is used to simplify the expressions. * "build" needs to be set by the caller of isl_ast_expr_add_term. * "cst" is the constant term of the expression in which the added term * appears. It may be modified by isl_ast_expr_add_term. * * "v" is the coefficient of the term that is being constructed and * is set internally by isl_ast_expr_add_term. */ struct isl_ast_add_term_data { isl_ast_build *build; isl_val *cst; isl_val *v; }; /* Given the numerator "aff" of the argument of an integer division * with denominator "d", check if it can be made non-negative over * data->build->domain by stealing part of the constant term of * the expression in which the integer division appears. * * In particular, the outer expression is of the form * * v * floor(aff/d) + cst * * We already know that "aff" itself may attain negative values. * Here we check if aff + d*floor(cst/v) is non-negative, such * that we could rewrite the expression to * * v * floor((aff + d*floor(cst/v))/d) + cst - v*floor(cst/v) * * Note that aff + d*floor(cst/v) can only possibly be non-negative * if data->cst and data->v have the same sign. * Similarly, if floor(cst/v) is zero, then there is no point in * checking again. */ static int is_non_neg_after_stealing(__isl_keep isl_aff *aff, __isl_keep isl_val *d, struct isl_ast_add_term_data *data) { isl_aff *shifted; isl_val *shift; int is_zero; int non_neg; if (isl_val_sgn(data->cst) != isl_val_sgn(data->v)) return 0; shift = isl_val_div(isl_val_copy(data->cst), isl_val_copy(data->v)); shift = isl_val_floor(shift); is_zero = isl_val_is_zero(shift); if (is_zero < 0 || is_zero) { isl_val_free(shift); return is_zero < 0 ? -1 : 0; } shift = isl_val_mul(shift, isl_val_copy(d)); shifted = isl_aff_copy(aff); shifted = isl_aff_add_constant_val(shifted, shift); non_neg = isl_ast_build_aff_is_nonneg(data->build, shifted); isl_aff_free(shifted); return non_neg; } /* Given the numerator "aff' of the argument of an integer division * with denominator "d", steal part of the constant term of * the expression in which the integer division appears to make it * non-negative over data->build->domain. * * In particular, the outer expression is of the form * * v * floor(aff/d) + cst * * We know that "aff" itself may attain negative values, * but that aff + d*floor(cst/v) is non-negative. * Find the minimal positive value that we need to add to "aff" * to make it positive and adjust data->cst accordingly. * That is, compute the minimal value "m" of "aff" over * data->build->domain and take * * s = ceil(m/d) * * such that * * aff + d * s >= 0 * * and rewrite the expression to * * v * floor((aff + s*d)/d) + (cst - v*s) */ static __isl_give isl_aff *steal_from_cst(__isl_take isl_aff *aff, __isl_keep isl_val *d, struct isl_ast_add_term_data *data) { isl_set *domain; isl_val *shift, *t; domain = isl_ast_build_get_domain(data->build); shift = isl_set_min_val(domain, aff); isl_set_free(domain); shift = isl_val_neg(shift); shift = isl_val_div(shift, isl_val_copy(d)); shift = isl_val_ceil(shift); t = isl_val_copy(shift); t = isl_val_mul(t, isl_val_copy(data->v)); data->cst = isl_val_sub(data->cst, t); shift = isl_val_mul(shift, isl_val_copy(d)); return isl_aff_add_constant_val(aff, shift); } /* Create an isl_ast_expr evaluating the div at position "pos" in "ls". * The result is simplified in terms of data->build->domain. * This function may change (the sign of) data->v. * * "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, while changing the sign of data->v. * * Otherwise, we check if * * e + d*floor(cst/v) * * is non-negative and if so, replace floor(e/d) by * * floor((e + s*d)/d) - s * * with s the minimal shift that makes the argument non-negative. */ static __isl_give isl_ast_expr *var_div(struct isl_ast_add_term_data *data, __isl_keep isl_local_space *ls, int pos) { 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(data->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(data->build, opp); if (non_neg >= 0 && non_neg) { data->v = isl_val_neg(data->v); isl_aff_free(aff); aff = opp; } else isl_aff_free(opp); } if (non_neg >= 0 && !non_neg) { non_neg = is_non_neg_after_stealing(aff, d, data); if (non_neg >= 0 && non_neg) aff = steal_from_cst(aff, d, data); } 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, data->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 data->build->domain. * This function may change (the sign of) data->v. * * 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 data->build * - parameters are constructed from the isl_ids in "ls" */ static __isl_give isl_ast_expr *var(struct isl_ast_add_term_data *data, __isl_keep isl_local_space *ls, enum isl_dim_type type, int pos) { isl_ctx *ctx = isl_local_space_get_ctx(ls); isl_id *id; if (type == isl_dim_div) return var_div(data, ls, pos); if (type == isl_dim_set) { id = isl_ast_build_get_iterator_id(data->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_ast_expr *expr; isl_ast_expr *c; if (!aff) return NULL; 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. * If the dimension is an integer division, then this function * may modify data->cst in order to make the numerator non-negative. * The result is simplified in terms of data->build->domain. * * 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, struct isl_ast_add_term_data *data) { isl_ast_expr *term; if (!expr) return NULL; data->v = v; term = var(data, ls, type, pos); v = data->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_ast_expr *expr_int; if (!expr || !v) goto error; if (isl_val_is_zero(v)) { isl_val_free(v); return 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; } /* Internal data structure used inside extract_modulos. * * If any modulo expressions are detected in "aff", then the * expression is removed from "aff" and added to either "pos" or "neg" * depending on the sign of the coefficient of the modulo expression * inside "aff". * * "add" is an expression that needs to be added to "aff" at the end of * the computation. It is NULL as long as no modulos have been extracted. * * "i" is the position in "aff" of the div under investigation * "v" is the coefficient in "aff" of the div * "div" is the argument of the div, with the denominator removed * "d" is the original denominator of the argument of the div * * "nonneg" is an affine expression that is non-negative over "build" * and that can be used to extract a modulo expression from "div". * In particular, if "sign" is 1, then the coefficients of "nonneg" * are equal to those of "div" modulo "d". If "sign" is -1, then * the coefficients of "nonneg" are opposite to those of "div" modulo "d". * If "sign" is 0, then no such affine expression has been found (yet). */ struct isl_extract_mod_data { isl_ast_build *build; isl_aff *aff; isl_ast_expr *pos; isl_ast_expr *neg; isl_aff *add; int i; isl_val *v; isl_val *d; isl_aff *div; isl_aff *nonneg; int sign; }; /* Given that data->v * div_i in data->aff is equal to * * f * (term - (arg mod d)) * * with data->d * f = data->v, add * * f * term * * to data->add and * * abs(f) * (arg mod d) * * to data->neg or data->pos depending on the sign of -f. */ static int extract_term_and_mod(struct isl_extract_mod_data *data, __isl_take isl_aff *term, __isl_take isl_aff *arg) { isl_ast_expr *expr; int s; data->v = isl_val_div(data->v, isl_val_copy(data->d)); s = isl_val_sgn(data->v); data->v = isl_val_abs(data->v); expr = isl_ast_expr_mod(data->v, arg, data->d, data->build); isl_aff_free(arg); if (s > 0) data->neg = ast_expr_add(data->neg, expr); else data->pos = ast_expr_add(data->pos, expr); data->aff = isl_aff_set_coefficient_si(data->aff, isl_dim_div, data->i, 0); if (s < 0) data->v = isl_val_neg(data->v); term = isl_aff_scale_val(data->div, isl_val_copy(data->v)); if (!data->add) data->add = term; else data->add = isl_aff_add(data->add, term); if (!data->add) return -1; return 0; } /* Given that data->v * div_i in data->aff is of the form * * f * d * floor(div/d) * * with div nonnegative on data->build, rewrite it as * * f * (div - (div mod d)) = f * div - f * (div mod d) * * and add * * f * div * * to data->add and * * abs(f) * (div mod d) * * to data->neg or data->pos depending on the sign of -f. */ static int extract_mod(struct isl_extract_mod_data *data) { return extract_term_and_mod(data, isl_aff_copy(data->div), isl_aff_copy(data->div)); } /* Given that data->v * div_i in data->aff is of the form * * f * d * floor(div/d) (1) * * check if div is non-negative on data->build and, if so, * extract the corresponding modulo from data->aff. * If not, then check if * * -div + d - 1 * * is non-negative on data->build. If so, replace (1) by * * -f * d * floor((-div + d - 1)/d) * * and extract the corresponding modulo from data->aff. * * This function may modify data->div. */ static int extract_nonneg_mod(struct isl_extract_mod_data *data) { int mod; mod = isl_ast_build_aff_is_nonneg(data->build, data->div); if (mod < 0) goto error; if (mod) return extract_mod(data); data->div = oppose_div_arg(data->div, isl_val_copy(data->d)); mod = isl_ast_build_aff_is_nonneg(data->build, data->div); if (mod < 0) goto error; if (mod) { data->v = isl_val_neg(data->v); return extract_mod(data); } return 0; error: data->aff = isl_aff_free(data->aff); return -1; } /* Is the affine expression of constraint "c" "simpler" than data->nonneg * for use in extracting a modulo expression? * * We currently only consider the constant term of the affine expression. * In particular, we prefer the affine expression with the smallest constant * term. * This means that if there are two constraints, say x >= 0 and -x + 10 >= 0, * then we would pick x >= 0 * * More detailed heuristics could be used if it turns out that there is a need. */ static int mod_constraint_is_simpler(struct isl_extract_mod_data *data, __isl_keep isl_constraint *c) { isl_val *v1, *v2; int simpler; if (!data->nonneg) return 1; v1 = isl_val_abs(isl_constraint_get_constant_val(c)); v2 = isl_val_abs(isl_aff_get_constant_val(data->nonneg)); simpler = isl_val_lt(v1, v2); isl_val_free(v1); isl_val_free(v2); return simpler; } /* Check if the coefficients of "c" are either equal or opposite to those * of data->div modulo data->d. If so, and if "c" is "simpler" than * data->nonneg, then replace data->nonneg by the affine expression of "c" * and set data->sign accordingly. * * Both "c" and data->div are assumed not to involve any integer divisions. * * Before we start the actual comparison, we first quickly check if * "c" and data->div have the same non-zero coefficients. * If not, then we assume that "c" is not of the desired form. * Note that while the coefficients of data->div can be reasonably expected * not to involve any coefficients that are multiples of d, "c" may * very well involve such coefficients. This means that we may actually * miss some cases. */ static isl_stat check_parallel_or_opposite(__isl_take isl_constraint *c, void *user) { struct isl_extract_mod_data *data = user; enum isl_dim_type c_type[2] = { isl_dim_param, isl_dim_set }; enum isl_dim_type a_type[2] = { isl_dim_param, isl_dim_in }; int i, t; int n[2]; int parallel = 1, opposite = 1; for (t = 0; t < 2; ++t) { n[t] = isl_constraint_dim(c, c_type[t]); for (i = 0; i < n[t]; ++i) { int a, b; a = isl_constraint_involves_dims(c, c_type[t], i, 1); b = isl_aff_involves_dims(data->div, a_type[t], i, 1); if (a != b) parallel = opposite = 0; } } for (t = 0; t < 2; ++t) { for (i = 0; i < n[t]; ++i) { isl_val *v1, *v2; if (!parallel && !opposite) break; v1 = isl_constraint_get_coefficient_val(c, c_type[t], i); v2 = isl_aff_get_coefficient_val(data->div, a_type[t], i); if (parallel) { v1 = isl_val_sub(v1, isl_val_copy(v2)); parallel = isl_val_is_divisible_by(v1, data->d); v1 = isl_val_add(v1, isl_val_copy(v2)); } if (opposite) { v1 = isl_val_add(v1, isl_val_copy(v2)); opposite = isl_val_is_divisible_by(v1, data->d); } isl_val_free(v1); isl_val_free(v2); } } if ((parallel || opposite) && mod_constraint_is_simpler(data, c)) { isl_aff_free(data->nonneg); data->nonneg = isl_constraint_get_aff(c); data->sign = parallel ? 1 : -1; } isl_constraint_free(c); if (data->sign != 0 && data->nonneg == NULL) return isl_stat_error; return isl_stat_ok; } /* Given that data->v * div_i in data->aff is of the form * * f * d * floor(div/d) (1) * * see if we can find an expression div' that is non-negative over data->build * and that is related to div through * * div' = div + d * e * * or * * div' = -div + d - 1 + d * e * * with e some affine expression. * If so, we write (1) as * * f * div + f * (div' mod d) * * or * * -f * (-div + d - 1) - f * (div' mod d) * * exploiting (in the second case) the fact that * * f * d * floor(div/d) = -f * d * floor((-div + d - 1)/d) * * * We first try to find an appropriate expression for div' * from the constraints of data->build->domain (which is therefore * guaranteed to be non-negative on data->build), where we remove * any integer divisions from the constraints and skip this step * if "div" itself involves any integer divisions. * If we cannot find an appropriate expression this way, then * we pass control to extract_nonneg_mod where check * if div or "-div + d -1" themselves happen to be * non-negative on data->build. * * While looking for an appropriate constraint in data->build->domain, * we ignore the constant term, so after finding such a constraint, * we still need to fix up the constant term. * In particular, if a is the constant term of "div" * (or d - 1 - the constant term of "div" if data->sign < 0) * and b is the constant term of the constraint, then we need to find * a non-negative constant c such that * * b + c \equiv a mod d * * We therefore take * * c = (a - b) mod d * * and add it to b to obtain the constant term of div'. * If this constant term is "too negative", then we add an appropriate * multiple of d to make it positive. * * * Note that the above is a only a very simple heuristic for finding an * appropriate expression. We could try a bit harder by also considering * sums of constraints that involve disjoint sets of variables or * we could consider arbitrary linear combinations of constraints, * although that could potentially be much more expensive as it involves * the solution of an LP problem. * * In particular, if v_i is a column vector representing constraint i, * w represents div and e_i is the i-th unit vector, then we are looking * for a solution of the constraints * * \sum_i lambda_i v_i = w + \sum_i alpha_i d e_i * * with \lambda_i >= 0 and alpha_i of unrestricted sign. * If we are not just interested in a non-negative expression, but * also in one with a minimal range, then we don't just want * c = \sum_i lambda_i v_i to be non-negative over the domain, * but also beta - c = \sum_i mu_i v_i, where beta is a scalar * that we want to minimize and we now also have to take into account * the constant terms of the constraints. * Alternatively, we could first compute the dual of the domain * and plug in the constraints on the coefficients. */ static int try_extract_mod(struct isl_extract_mod_data *data) { isl_basic_set *hull; isl_val *v1, *v2; int r, n; if (!data->build) goto error; n = isl_aff_dim(data->div, isl_dim_div); if (isl_aff_involves_dims(data->div, isl_dim_div, 0, n)) return extract_nonneg_mod(data); hull = isl_set_simple_hull(isl_set_copy(data->build->domain)); hull = isl_basic_set_remove_divs(hull); data->sign = 0; data->nonneg = NULL; r = isl_basic_set_foreach_constraint(hull, &check_parallel_or_opposite, data); isl_basic_set_free(hull); if (!data->sign || r < 0) { isl_aff_free(data->nonneg); if (r < 0) goto error; return extract_nonneg_mod(data); } v1 = isl_aff_get_constant_val(data->div); v2 = isl_aff_get_constant_val(data->nonneg); if (data->sign < 0) { v1 = isl_val_neg(v1); v1 = isl_val_add(v1, isl_val_copy(data->d)); v1 = isl_val_sub_ui(v1, 1); } v1 = isl_val_sub(v1, isl_val_copy(v2)); v1 = isl_val_mod(v1, isl_val_copy(data->d)); v1 = isl_val_add(v1, v2); v2 = isl_val_div(isl_val_copy(v1), isl_val_copy(data->d)); v2 = isl_val_ceil(v2); if (isl_val_is_neg(v2)) { v2 = isl_val_mul(v2, isl_val_copy(data->d)); v1 = isl_val_sub(v1, isl_val_copy(v2)); } data->nonneg = isl_aff_set_constant_val(data->nonneg, v1); isl_val_free(v2); if (data->sign < 0) { data->div = oppose_div_arg(data->div, isl_val_copy(data->d)); data->v = isl_val_neg(data->v); } return extract_term_and_mod(data, isl_aff_copy(data->div), data->nonneg); error: data->aff = isl_aff_free(data->aff); return -1; } /* Check if "data->aff" involves any (implicit) modulo computations based * on div "data->i". * If so, remove them from aff and add expressions corresponding * to those modulo computations to data->pos and/or data->neg. * * "aff" is assumed to be an integer affine expression. * * In particular, check if (v * div_j) is of the form * * f * m * floor(a / m) * * and, if so, rewrite it 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. * * 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. */ static int extract_modulo(struct isl_extract_mod_data *data) { data->div = isl_aff_get_div(data->aff, data->i); data->d = isl_aff_get_denominator_val(data->div); if (isl_val_is_divisible_by(data->v, data->d)) { data->div = isl_aff_scale_val(data->div, isl_val_copy(data->d)); if (try_extract_mod(data) < 0) data->aff = isl_aff_free(data->aff); } isl_aff_free(data->div); isl_val_free(data->d); return 0; } /* 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) { struct isl_extract_mod_data data = { build, aff, *pos, *neg }; isl_ctx *ctx; int 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(data.aff, isl_dim_div); for (data.i = 0; data.i < n; ++data.i) { data.v = isl_aff_get_coefficient_val(data.aff, isl_dim_div, data.i); if (!data.v) return isl_aff_free(aff); if (isl_val_is_zero(data.v) || isl_val_is_one(data.v) || isl_val_is_negone(data.v)) { isl_val_free(data.v); continue; } if (extract_modulo(&data) < 0) data.aff = isl_aff_free(data.aff); isl_val_free(data.v); if (!data.aff) break; } if (data.add) data.aff = isl_aff_add(data.aff, data.add); *pos = data.pos; *neg = data.neg; return data.aff; } /* Check if aff involves any non-integer coefficients. * If so, split aff into * * aff = aff1 + (aff2 / d) * * with both aff1 and aff2 having only integer coefficients. * Return aff1 and add (aff2 / d) to *expr. */ static __isl_give isl_aff *extract_rational(__isl_take isl_aff *aff, __isl_keep isl_ast_expr **expr, __isl_keep isl_ast_build *build) { int i, j, n; isl_aff *rat = NULL; isl_local_space *ls = NULL; isl_ast_expr *rat_expr; isl_val *v, *d; 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 }; if (!aff) return NULL; d = isl_aff_get_denominator_val(aff); if (!d) goto error; if (isl_val_is_one(d)) { isl_val_free(d); return aff; } aff = isl_aff_scale_val(aff, isl_val_copy(d)); ls = isl_aff_get_domain_local_space(aff); rat = isl_aff_zero_on_domain(isl_local_space_copy(ls)); for (i = 0; i < 3; ++i) { n = isl_aff_dim(aff, t[i]); for (j = 0; j < n; ++j) { isl_aff *rat_j; v = isl_aff_get_coefficient_val(aff, t[i], j); if (!v) goto error; if (isl_val_is_divisible_by(v, d)) { isl_val_free(v); continue; } rat_j = isl_aff_var_on_domain(isl_local_space_copy(ls), l[i], j); rat_j = isl_aff_scale_val(rat_j, v); rat = isl_aff_add(rat, rat_j); } } v = isl_aff_get_constant_val(aff); if (isl_val_is_divisible_by(v, d)) { isl_val_free(v); } else { isl_aff *rat_0; rat_0 = isl_aff_val_on_domain(isl_local_space_copy(ls), v); rat = isl_aff_add(rat, rat_0); } isl_local_space_free(ls); aff = isl_aff_sub(aff, isl_aff_copy(rat)); aff = isl_aff_scale_down_val(aff, isl_val_copy(d)); rat_expr = isl_ast_expr_from_aff(rat, build); rat_expr = isl_ast_expr_div(rat_expr, isl_ast_expr_from_val(d)); *expr = ast_expr_add(*expr, rat_expr); return aff; error: isl_aff_free(rat); isl_local_space_free(ls); isl_aff_free(aff); isl_val_free(d); return NULL; } /* 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; 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; struct isl_ast_add_term_data data; if (!aff) return NULL; expr = isl_ast_expr_alloc_int_si(ctx, 0); expr_neg = isl_ast_expr_alloc_int_si(ctx, 0); aff = extract_rational(aff, &expr, build); aff = extract_modulos(aff, &expr, &expr_neg, build); expr = ast_expr_sub(expr, expr_neg); ls = isl_aff_get_domain_local_space(aff); data.build = build; data.cst = isl_aff_get_constant_val(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, &data); } } expr = isl_ast_expr_add_int(expr, data.cst); 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 data->build->domain. */ static __isl_give isl_ast_expr *add_signed_terms(__isl_take isl_ast_expr *expr, __isl_keep isl_aff *aff, int sign, struct isl_ast_add_term_data *data) { 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, data); } } 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); } /* Check if the equality * * aff = 0 * * represents a stride constraint on the integer division "pos". * * In particular, if the integer division "pos" is equal to * * floor(e/d) * * then check if aff is equal to * * e - d floor(e/d) * * or its opposite. * * If so, the equality is exactly * * e mod d = 0 * * Note that in principle we could also accept * * e - d floor(e'/d) * * where e and e' differ by a constant. */ static int is_stride_constraint(__isl_keep isl_aff *aff, int pos) { isl_aff *div; isl_val *c, *d; int eq; div = isl_aff_get_div(aff, pos); c = isl_aff_get_coefficient_val(aff, isl_dim_div, pos); d = isl_aff_get_denominator_val(div); eq = isl_val_abs_eq(c, d); if (eq >= 0 && eq) { aff = isl_aff_copy(aff); aff = isl_aff_set_coefficient_si(aff, isl_dim_div, pos, 0); div = isl_aff_scale_val(div, d); if (isl_val_is_pos(c)) div = isl_aff_neg(div); eq = isl_aff_plain_is_equal(div, aff); isl_aff_free(aff); } else isl_val_free(d); isl_val_free(c); isl_aff_free(div); return eq; } /* Are all coefficients of "aff" (zero or) negative? */ static int all_negative_coefficients(__isl_keep isl_aff *aff) { int i, n; if (!aff) return 0; n = isl_aff_dim(aff, isl_dim_param); for (i = 0; i < n; ++i) if (isl_aff_coefficient_sgn(aff, isl_dim_param, i) > 0) return 0; n = isl_aff_dim(aff, isl_dim_in); for (i = 0; i < n; ++i) if (isl_aff_coefficient_sgn(aff, isl_dim_in, i) > 0) return 0; return 1; } /* Give an equality of the form * * aff = e - d floor(e/d) = 0 * * or * * aff = -e + d floor(e/d) = 0 * * with the integer division "pos" equal to floor(e/d), * construct the AST expression * * (isl_ast_op_eq, (isl_ast_op_zdiv_r, expr(e), expr(d)), expr(0)) * * If e only has negative coefficients, then construct * * (isl_ast_op_eq, (isl_ast_op_zdiv_r, expr(-e), expr(d)), expr(0)) * * instead. */ static __isl_give isl_ast_expr *extract_stride_constraint( __isl_take isl_aff *aff, int pos, __isl_keep isl_ast_build *build) { isl_ctx *ctx; isl_val *c; isl_ast_expr *expr, *cst; if (!aff) return NULL; ctx = isl_aff_get_ctx(aff); c = isl_aff_get_coefficient_val(aff, isl_dim_div, pos); aff = isl_aff_set_coefficient_si(aff, isl_dim_div, pos, 0); if (all_negative_coefficients(aff)) aff = isl_aff_neg(aff); cst = isl_ast_expr_from_val(isl_val_abs(c)); expr = isl_ast_expr_from_aff(aff, build); expr = isl_ast_expr_alloc_binary(isl_ast_op_zdiv_r, expr, cst); cst = isl_ast_expr_alloc_int_si(ctx, 0); expr = isl_ast_expr_alloc_binary(isl_ast_op_eq, expr, cst); return expr; } /* Construct an isl_ast_expr that evaluates the condition "constraint", * The result is simplified in terms of build->domain. * * We first check if the constraint is an equality of the form * * e - d floor(e/d) = 0 * * i.e., * * e mod d = 0 * * If so, we convert it to * * (isl_ast_op_eq, (isl_ast_op_zdiv_r, expr(e), expr(d)), expr(0)) * * Otherwise, 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) { int i, n; isl_ctx *ctx; isl_ast_expr *expr_pos; isl_ast_expr *expr_neg; isl_ast_expr *expr; isl_aff *aff; int eq; enum isl_ast_op_type type; struct isl_ast_add_term_data data; if (!constraint) return NULL; aff = isl_constraint_get_aff(constraint); eq = isl_constraint_is_equality(constraint); isl_constraint_free(constraint); n = isl_aff_dim(aff, isl_dim_div); if (eq && n > 0) for (i = 0; i < n; ++i) { int is_stride; is_stride = is_stride_constraint(aff, i); if (is_stride < 0) goto error; if (is_stride) return extract_stride_constraint(aff, i, build); } ctx = isl_aff_get_ctx(aff); 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); data.build = build; data.cst = isl_aff_get_constant_val(aff); expr_pos = add_signed_terms(expr_pos, aff, 1, &data); data.cst = isl_val_neg(data.cst); expr_neg = add_signed_terms(expr_neg, aff, -1, &data); data.cst = isl_val_neg(data.cst); if (constant_is_considered_positive(data.cst, expr_pos, expr_neg)) { expr_pos = isl_ast_expr_add_int(expr_pos, data.cst); } else { data.cst = isl_val_neg(data.cst); expr_neg = isl_ast_expr_add_int(expr_neg, data.cst); } 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_aff_free(aff); return expr; error: isl_aff_free(aff); return NULL; } /* Wrapper around isl_constraint_cmp_last_non_zero for use * as a callback to isl_constraint_list_sort. * If isl_constraint_cmp_last_non_zero cannot tell the constraints * apart, then use isl_constraint_plain_cmp instead. */ static int cmp_constraint(__isl_keep isl_constraint *a, __isl_keep isl_constraint *b, void *user) { int cmp; cmp = isl_constraint_cmp_last_non_zero(a, b); if (cmp != 0) return cmp; return isl_constraint_plain_cmp(a, b); } /* Construct an isl_ast_expr that evaluates the conditions defining "bset". * The result is simplified in terms of build->domain. * * If "bset" is not bounded by any constraint, then we contruct * the expression "1", i.e., "true". * * Otherwise, we sort the constraints, putting constraints that involve * integer divisions after those that do not, and construct an "and" * of the ast expressions of the individual constraints. * * Each constraint is added to the generated constraints of the build * after it has been converted to an AST expression so that it can be used * to simplify the following constraints. This may change the truth value * of subsequent constraints that do not satisfy the earlier constraints, * but this does not affect the outcome of the conjunction as it is * only true if all the conjuncts are true (no matter in what order * they are evaluated). In particular, the constraints that do not * involve integer divisions may serve to simplify some constraints * that do involve integer divisions. */ __isl_give isl_ast_expr *isl_ast_build_expr_from_basic_set( __isl_keep isl_ast_build *build, __isl_take isl_basic_set *bset) { int i, n; isl_constraint *c; isl_constraint_list *list; isl_ast_expr *res; isl_set *set; list = isl_basic_set_get_constraint_list(bset); isl_basic_set_free(bset); list = isl_constraint_list_sort(list, &cmp_constraint, NULL); if (!list) return NULL; n = isl_constraint_list_n_constraint(list); if (n == 0) { isl_ctx *ctx = isl_basic_set_get_ctx(bset); isl_constraint_list_free(list); return isl_ast_expr_alloc_int_si(ctx, 1); } build = isl_ast_build_copy(build); c = isl_constraint_list_get_constraint(list, 0); bset = isl_basic_set_from_constraint(isl_constraint_copy(c)); set = isl_set_from_basic_set(bset); res = isl_ast_expr_from_constraint(c, build); build = isl_ast_build_restrict_generated(build, set); for (i = 1; i < n; ++i) { isl_ast_expr *expr; c = isl_constraint_list_get_constraint(list, i); bset = isl_basic_set_from_constraint(isl_constraint_copy(c)); set = isl_set_from_basic_set(bset); expr = isl_ast_expr_from_constraint(c, build); build = isl_ast_build_restrict_generated(build, set); res = isl_ast_expr_and(res, expr); } isl_constraint_list_free(list); isl_ast_build_free(build); return 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 isl_stat 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 isl_stat_error; return isl_stat_ok; } /* Construct an isl_ast_expr that evaluates the conditions defining "set". * The result is simplified in terms of build->domain. * * If "set" is an (obviously) empty set, then return the expression "0". * * "set" lives in the internal schedule space. */ __isl_give isl_ast_expr *isl_ast_build_expr_from_set_internal( __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); else if (data.first) { isl_ctx *ctx = isl_ast_build_get_ctx(build); data.res = isl_ast_expr_from_val(isl_val_zero(ctx)); } isl_set_free(set); return data.res; } /* Construct an isl_ast_expr that evaluates the conditions defining "set". * The result is simplified in terms of build->domain. * * If "set" is an (obviously) empty set, then return the expression "0". * * "set" lives in the external schedule space. * * The internal AST expression generation assumes that there are * no unknown divs, so make sure an explicit representation is available. * Since the set comes from the outside, it may have constraints that * are redundant with respect to the build domain. Remove them first. */ __isl_give isl_ast_expr *isl_ast_build_expr_from_set( __isl_keep isl_ast_build *build, __isl_take isl_set *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); } set = isl_set_compute_divs(set); set = isl_ast_build_compute_gist(build, set); return isl_ast_build_expr_from_set_internal(build, set); } 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 corresponding to "aff" on "set" and to an expression * that will be filled in by later calls otherwise. * * In both cases, the constraints of "set" are added to the generated * constraints of the build such that they can be exploited to simplify * the AST expression constructed from "aff". */ static isl_stat 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; isl_ast_build *build; ctx = isl_set_get_ctx(set); data->n--; if (data->n == 0) { build = isl_ast_build_copy(data->build); build = isl_ast_build_restrict_generated(build, set); *data->next = isl_ast_expr_from_aff(aff, build); isl_ast_build_free(build); if (!*data->next) return isl_stat_error; } else { isl_ast_expr *ternary, *arg; isl_set *gist; ternary = isl_ast_expr_alloc_op(ctx, isl_ast_op_select, 3); gist = isl_set_gist(isl_set_copy(set), isl_set_copy(data->dom)); arg = isl_ast_build_expr_from_set_internal(data->build, gist); ternary = isl_ast_expr_set_op_arg(ternary, 0, arg); build = isl_ast_build_copy(data->build); build = isl_ast_build_restrict_generated(build, set); arg = isl_ast_expr_from_aff(aff, build); isl_ast_build_free(build); ternary = isl_ast_expr_set_op_arg(ternary, 1, arg); if (!ternary) return isl_stat_error; *data->next = ternary; data->next = &ternary->u.op.args[2]; } return isl_stat_ok; } /* 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; pa = isl_ast_build_compute_gist_pw_aff(build, pa); pa = isl_pw_aff_coalesce(pa); 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 "mpa" to the iterator ids * of "build". * * The domain of "mpa" is assumed to live in the internal schedule domain. */ static __isl_give isl_multi_pw_aff *set_iterator_names( __isl_keep isl_ast_build *build, __isl_take isl_multi_pw_aff *mpa) { int i, n; n = isl_multi_pw_aff_dim(mpa, isl_dim_in); for (i = 0; i < n; ++i) { isl_id *id; id = isl_ast_build_get_iterator_id(build, i); mpa = isl_multi_pw_aff_set_dim_id(mpa, isl_dim_in, i, id); } return mpa; } /* Construct an isl_ast_expr of type "type" with as first argument "arg0" and * the remaining arguments derived from "mpa". * That is, construct a call or access expression that calls/accesses "arg0" * with arguments/indices specified by "mpa". */ static __isl_give isl_ast_expr *isl_ast_build_with_arguments( __isl_keep isl_ast_build *build, enum isl_ast_op_type type, __isl_take isl_ast_expr *arg0, __isl_take isl_multi_pw_aff *mpa) { int i, n; isl_ctx *ctx; isl_ast_expr *expr; ctx = isl_ast_build_get_ctx(build); n = isl_multi_pw_aff_dim(mpa, isl_dim_out); expr = isl_ast_expr_alloc_op(ctx, type, 1 + n); expr = isl_ast_expr_set_op_arg(expr, 0, arg0); for (i = 0; i < n; ++i) { isl_pw_aff *pa; isl_ast_expr *arg; pa = isl_multi_pw_aff_get_pw_aff(mpa, i); arg = isl_ast_build_expr_from_pw_aff_internal(build, pa); expr = isl_ast_expr_set_op_arg(expr, 1 + i, arg); } isl_multi_pw_aff_free(mpa); return expr; } static __isl_give isl_ast_expr *isl_ast_build_from_multi_pw_aff_internal( __isl_keep isl_ast_build *build, enum isl_ast_op_type type, __isl_take isl_multi_pw_aff *mpa); /* Construct an isl_ast_expr that accesses the member specified by "mpa". * The range of "mpa" is assumed to be wrapped relation. * The domain of this wrapped relation specifies the structure being * accessed, while the range of this wrapped relation spacifies the * member of the structure being accessed. * * The domain of "mpa" is assumed to live in the internal schedule domain. */ static __isl_give isl_ast_expr *isl_ast_build_from_multi_pw_aff_member( __isl_keep isl_ast_build *build, __isl_take isl_multi_pw_aff *mpa) { isl_id *id; isl_multi_pw_aff *domain; isl_ast_expr *domain_expr, *expr; enum isl_ast_op_type type = isl_ast_op_access; domain = isl_multi_pw_aff_copy(mpa); domain = isl_multi_pw_aff_range_factor_domain(domain); domain_expr = isl_ast_build_from_multi_pw_aff_internal(build, type, domain); mpa = isl_multi_pw_aff_range_factor_range(mpa); if (!isl_multi_pw_aff_has_tuple_id(mpa, isl_dim_out)) isl_die(isl_ast_build_get_ctx(build), isl_error_invalid, "missing field name", goto error); id = isl_multi_pw_aff_get_tuple_id(mpa, isl_dim_out); expr = isl_ast_expr_from_id(id); expr = isl_ast_expr_alloc_binary(isl_ast_op_member, domain_expr, expr); return isl_ast_build_with_arguments(build, type, expr, mpa); error: isl_multi_pw_aff_free(mpa); return NULL; } /* Construct an isl_ast_expr of type "type" that calls or accesses * the element specified by "mpa". * The first argument is obtained from the output tuple name. * The remaining arguments are given by the piecewise affine expressions. * * If the range of "mpa" is a mapped relation, then we assume it * represents an access to a member of a structure. * * The domain of "mpa" is assumed to live in the internal schedule domain. */ static __isl_give isl_ast_expr *isl_ast_build_from_multi_pw_aff_internal( __isl_keep isl_ast_build *build, enum isl_ast_op_type type, __isl_take isl_multi_pw_aff *mpa) { isl_ctx *ctx; isl_id *id; isl_ast_expr *expr; if (!mpa) goto error; if (type == isl_ast_op_access && isl_multi_pw_aff_range_is_wrapping(mpa)) return isl_ast_build_from_multi_pw_aff_member(build, mpa); mpa = set_iterator_names(build, mpa); if (!build || !mpa) goto error; ctx = isl_ast_build_get_ctx(build); if (isl_multi_pw_aff_has_tuple_id(mpa, isl_dim_out)) id = isl_multi_pw_aff_get_tuple_id(mpa, isl_dim_out); else id = isl_id_alloc(ctx, "", NULL); expr = isl_ast_expr_from_id(id); return isl_ast_build_with_arguments(build, type, expr, mpa); error: isl_multi_pw_aff_free(mpa); return NULL; } /* Construct an isl_ast_expr of type "type" that calls or accesses * the element specified by "pma". * The first argument is obtained from the output tuple name. * The remaining 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_from_pw_multi_aff_internal( __isl_keep isl_ast_build *build, enum isl_ast_op_type type, __isl_take isl_pw_multi_aff *pma) { isl_multi_pw_aff *mpa; mpa = isl_multi_pw_aff_from_pw_multi_aff(pma); return isl_ast_build_from_multi_pw_aff_internal(build, type, mpa); } /* Construct an isl_ast_expr of type "type" that calls or accesses * the element specified by "mpa". * The first argument is obtained from the output tuple name. * The remaining arguments are given by the piecewise affine expressions. * * The domain of "mpa" is assumed to live in the external schedule domain. */ static __isl_give isl_ast_expr *isl_ast_build_from_multi_pw_aff( __isl_keep isl_ast_build *build, enum isl_ast_op_type type, __isl_take isl_multi_pw_aff *mpa) { int is_domain; isl_ast_expr *expr; isl_space *space_build, *space_mpa; space_build = isl_ast_build_get_space(build, 0); space_mpa = isl_multi_pw_aff_get_space(mpa); is_domain = isl_space_tuple_is_equal(space_build, isl_dim_set, space_mpa, isl_dim_in); isl_space_free(space_build); isl_space_free(space_mpa); if (is_domain < 0) goto error; if (!is_domain) isl_die(isl_ast_build_get_ctx(build), isl_error_invalid, "spaces don't match", goto error); if (isl_ast_build_need_schedule_map(build)) { isl_multi_aff *ma; ma = isl_ast_build_get_schedule_map_multi_aff(build); mpa = isl_multi_pw_aff_pullback_multi_aff(mpa, ma); } expr = isl_ast_build_from_multi_pw_aff_internal(build, type, mpa); return expr; error: isl_multi_pw_aff_free(mpa); return NULL; } /* Construct an isl_ast_expr that calls the domain element specified by "mpa". * The name of the function is obtained from the output tuple name. * The arguments are given by the piecewise affine expressions. * * The domain of "mpa" is assumed to live in the external schedule domain. */ __isl_give isl_ast_expr *isl_ast_build_call_from_multi_pw_aff( __isl_keep isl_ast_build *build, __isl_take isl_multi_pw_aff *mpa) { return isl_ast_build_from_multi_pw_aff(build, isl_ast_op_call, mpa); } /* Construct an isl_ast_expr that accesses the array element specified by "mpa". * The name of the array is obtained from the output tuple name. * The index expressions are given by the piecewise affine expressions. * * The domain of "mpa" is assumed to live in the external schedule domain. */ __isl_give isl_ast_expr *isl_ast_build_access_from_multi_pw_aff( __isl_keep isl_ast_build *build, __isl_take isl_multi_pw_aff *mpa) { return isl_ast_build_from_multi_pw_aff(build, isl_ast_op_access, mpa); } /* Construct an isl_ast_expr of type "type" that calls or accesses * the element specified by "pma". * The first argument is obtained from the output tuple name. * The remaining arguments are given by the piecewise affine expressions. * * The domain of "pma" is assumed to live in the external schedule domain. */ static __isl_give isl_ast_expr *isl_ast_build_from_pw_multi_aff( __isl_keep isl_ast_build *build, enum isl_ast_op_type type, __isl_take isl_pw_multi_aff *pma) { isl_multi_pw_aff *mpa; mpa = isl_multi_pw_aff_from_pw_multi_aff(pma); return isl_ast_build_from_multi_pw_aff(build, type, mpa); } /* 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) { return isl_ast_build_from_pw_multi_aff(build, isl_ast_op_call, pma); } /* Construct an isl_ast_expr that accesses the array element specified by "pma". * The name of the array is obtained from the output tuple name. * The index expressions 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_access_from_pw_multi_aff( __isl_keep isl_ast_build *build, __isl_take isl_pw_multi_aff *pma) { return isl_ast_build_from_pw_multi_aff(build, isl_ast_op_access, pma); } /* 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_from_pw_multi_aff_internal(build, isl_ast_op_call, iteration); return isl_ast_node_alloc_user(expr); } cloog-0.18.4/isl/isl_schedule_tree.h0000644000175000017500000002664212554427055014275 00000000000000#ifndef ISL_SCHEDLUE_TREE_H #define ISL_SCHEDLUE_TREE_H #include #include #include #include struct isl_schedule_tree; typedef struct isl_schedule_tree isl_schedule_tree; ISL_DECLARE_LIST(schedule_tree) /* A schedule (sub)tree. * * The leaves of a tree are not explicitly represented inside * the isl_schedule_tree. If a tree consists of only a leaf, * then it is equal to the static object isl_schedule_tree_empty. * * ctx may be NULL if type is isl_schedule_node_leaf. * In this case, ref has a negative value. * * The "band" field is valid when type is isl_schedule_node_band. * The "context" field is valid when type is isl_schedule_node_context * and represents constraints on the flat product of the outer band nodes, * possibly introducing additional parameters. * The "domain" field is valid when type is isl_schedule_node_domain * and introduces the statement instances scheduled by the tree. * * The "contraction" and "expansion" fields are valid when type * is isl_schedule_node_expansion. * "expansion" expands the reaching domain elements to one or more * domain elements for the subtree. * "contraction" maps these elements back to the corresponding * reaching domain element. It does not involve any domain constraints. * * The "extension" field is valid when the is isl_schedule_node_extension * maps outer schedule dimenions (the flat product of the outer band nodes) * to additional iteration domains. * * The "filter" field is valid when type is isl_schedule_node_filter * and represents the statement instances selected by the node. * * The "guard" field is valid when type is isl_schedule_node_guard * and represents constraints on the flat product of the outer band nodes * that need to be enforced by the outer nodes in the generated AST. * * The "mark" field is valid when type is isl_schedule_node_mark and * identifies the mark. * * The "children" field is valid for all types except * isl_schedule_node_leaf. This field is NULL if there are * no children (except for the implicit leaves). * * anchored is set if the node or any of its descendants depends * on its position in the schedule tree. */ struct isl_schedule_tree { int ref; isl_ctx *ctx; int anchored; enum isl_schedule_node_type type; union { isl_schedule_band *band; isl_set *context; isl_union_set *domain; struct { isl_union_pw_multi_aff *contraction; isl_union_map *expansion; }; isl_union_map *extension; isl_union_set *filter; isl_set *guard; isl_id *mark; }; isl_schedule_tree_list *children; }; isl_ctx *isl_schedule_tree_get_ctx(__isl_keep isl_schedule_tree *tree); enum isl_schedule_node_type isl_schedule_tree_get_type( __isl_keep isl_schedule_tree *tree); __isl_give isl_schedule_tree *isl_schedule_tree_leaf(isl_ctx *ctx); int isl_schedule_tree_is_leaf(__isl_keep isl_schedule_tree *tree); isl_bool isl_schedule_tree_plain_is_equal(__isl_keep isl_schedule_tree *tree1, __isl_keep isl_schedule_tree *tree2); __isl_give isl_schedule_tree *isl_schedule_tree_copy( __isl_keep isl_schedule_tree *tree); __isl_null isl_schedule_tree *isl_schedule_tree_free( __isl_take isl_schedule_tree *tree); __isl_give isl_schedule_tree *isl_schedule_tree_from_band( __isl_take isl_schedule_band *band); __isl_give isl_schedule_tree *isl_schedule_tree_from_context( __isl_take isl_set *context); __isl_give isl_schedule_tree *isl_schedule_tree_from_domain( __isl_take isl_union_set *domain); __isl_give isl_schedule_tree *isl_schedule_tree_from_expansion( __isl_take isl_union_pw_multi_aff *contraction, __isl_take isl_union_map *expansion); __isl_give isl_schedule_tree *isl_schedule_tree_from_extension( __isl_take isl_union_map *extension); __isl_give isl_schedule_tree *isl_schedule_tree_from_filter( __isl_take isl_union_set *filter); __isl_give isl_schedule_tree *isl_schedule_tree_from_guard( __isl_take isl_set *guard); __isl_give isl_schedule_tree *isl_schedule_tree_from_children( enum isl_schedule_node_type type, __isl_take isl_schedule_tree_list *list); __isl_give isl_schedule_tree *isl_schedule_tree_from_pair( enum isl_schedule_node_type type, __isl_take isl_schedule_tree *tree1, __isl_take isl_schedule_tree *tree2); __isl_give isl_schedule_tree *isl_schedule_tree_sequence_pair( __isl_take isl_schedule_tree *tree1, __isl_take isl_schedule_tree *tree2); isl_bool isl_schedule_tree_is_subtree_anchored( __isl_keep isl_schedule_tree *tree); __isl_give isl_space *isl_schedule_tree_band_get_space( __isl_keep isl_schedule_tree *tree); __isl_give isl_schedule_tree *isl_schedule_tree_band_intersect_domain( __isl_take isl_schedule_tree *tree, __isl_take isl_union_set *domain); __isl_give isl_multi_union_pw_aff *isl_schedule_tree_band_get_partial_schedule( __isl_keep isl_schedule_tree *tree); __isl_give isl_schedule_tree *isl_schedule_tree_band_set_partial_schedule( __isl_take isl_schedule_tree *tree, __isl_take isl_multi_union_pw_aff *schedule); enum isl_ast_loop_type isl_schedule_tree_band_member_get_ast_loop_type( __isl_keep isl_schedule_tree *tree, int pos); __isl_give isl_schedule_tree *isl_schedule_tree_band_member_set_ast_loop_type( __isl_take isl_schedule_tree *tree, int pos, enum isl_ast_loop_type type); enum isl_ast_loop_type isl_schedule_tree_band_member_get_isolate_ast_loop_type( __isl_keep isl_schedule_tree *tree, int pos); __isl_give isl_schedule_tree * isl_schedule_tree_band_member_set_isolate_ast_loop_type( __isl_take isl_schedule_tree *tree, int pos, enum isl_ast_loop_type type); __isl_give isl_union_set *isl_schedule_tree_band_get_ast_build_options( __isl_keep isl_schedule_tree *tree); __isl_give isl_schedule_tree *isl_schedule_tree_band_set_ast_build_options( __isl_take isl_schedule_tree *tree, __isl_take isl_union_set *options); __isl_give isl_set *isl_schedule_tree_context_get_context( __isl_keep isl_schedule_tree *tree); __isl_give isl_union_set *isl_schedule_tree_domain_get_domain( __isl_keep isl_schedule_tree *tree); __isl_give isl_schedule_tree *isl_schedule_tree_domain_set_domain( __isl_take isl_schedule_tree *tree, __isl_take isl_union_set *domain); __isl_give isl_union_pw_multi_aff *isl_schedule_tree_expansion_get_contraction( __isl_keep isl_schedule_tree *tree); __isl_give isl_union_map *isl_schedule_tree_expansion_get_expansion( __isl_keep isl_schedule_tree *tree); __isl_give isl_schedule_tree * isl_schedule_tree_expansion_set_contraction_and_expansion( __isl_take isl_schedule_tree *tree, __isl_take isl_union_pw_multi_aff *contraction, __isl_take isl_union_map *expansion); __isl_give isl_union_map *isl_schedule_tree_extension_get_extension( __isl_keep isl_schedule_tree *tree); __isl_give isl_schedule_tree *isl_schedule_tree_extension_set_extension( __isl_take isl_schedule_tree *tree, __isl_take isl_union_map *extension); __isl_give isl_union_set *isl_schedule_tree_filter_get_filter( __isl_keep isl_schedule_tree *tree); __isl_give isl_schedule_tree *isl_schedule_tree_filter_set_filter( __isl_take isl_schedule_tree *tree, __isl_take isl_union_set *filter); __isl_give isl_set *isl_schedule_tree_guard_get_guard( __isl_keep isl_schedule_tree *tree); __isl_give isl_id *isl_schedule_tree_mark_get_id( __isl_keep isl_schedule_tree *tree); __isl_give isl_schedule_tree *isl_schedule_tree_first_schedule_descendant( __isl_take isl_schedule_tree *tree, __isl_keep isl_schedule_tree *leaf); __isl_give isl_union_map *isl_schedule_tree_get_subtree_schedule_union_map( __isl_keep isl_schedule_tree *tree); unsigned isl_schedule_tree_band_n_member(__isl_keep isl_schedule_tree *tree); isl_bool isl_schedule_tree_band_member_get_coincident( __isl_keep isl_schedule_tree *tree, int pos); __isl_give isl_schedule_tree *isl_schedule_tree_band_member_set_coincident( __isl_take isl_schedule_tree *tree, int pos, int coincident); isl_bool isl_schedule_tree_band_get_permutable( __isl_keep isl_schedule_tree *tree); __isl_give isl_schedule_tree *isl_schedule_tree_band_set_permutable( __isl_take isl_schedule_tree *tree, int permutable); int isl_schedule_tree_has_children(__isl_keep isl_schedule_tree *tree); int isl_schedule_tree_n_children(__isl_keep isl_schedule_tree *tree); __isl_give isl_schedule_tree *isl_schedule_tree_get_child( __isl_keep isl_schedule_tree *tree, int pos); __isl_give isl_schedule_tree *isl_schedule_tree_insert_band( __isl_take isl_schedule_tree *tree, __isl_take isl_schedule_band *band); __isl_give isl_schedule_tree *isl_schedule_tree_insert_context( __isl_take isl_schedule_tree *tree, __isl_take isl_set *context); __isl_give isl_schedule_tree *isl_schedule_tree_insert_domain( __isl_take isl_schedule_tree *tree, __isl_take isl_union_set *domain); __isl_give isl_schedule_tree *isl_schedule_tree_insert_expansion( __isl_take isl_schedule_tree *tree, __isl_take isl_union_pw_multi_aff *contraction, __isl_take isl_union_map *expansion); __isl_give isl_schedule_tree *isl_schedule_tree_insert_extension( __isl_take isl_schedule_tree *tree, __isl_take isl_union_map *extension); __isl_give isl_schedule_tree *isl_schedule_tree_insert_filter( __isl_take isl_schedule_tree *tree, __isl_take isl_union_set *filter); __isl_give isl_schedule_tree *isl_schedule_tree_children_insert_filter( __isl_take isl_schedule_tree *tree, __isl_take isl_union_set *filter); __isl_give isl_schedule_tree *isl_schedule_tree_insert_guard( __isl_take isl_schedule_tree *tree, __isl_take isl_set *guard); __isl_give isl_schedule_tree *isl_schedule_tree_insert_mark( __isl_take isl_schedule_tree *tree, __isl_take isl_id *mark); __isl_give isl_schedule_tree *isl_schedule_tree_append_to_leaves( __isl_take isl_schedule_tree *tree1, __isl_take isl_schedule_tree *tree2); __isl_give isl_schedule_tree *isl_schedule_tree_band_scale( __isl_take isl_schedule_tree *tree, __isl_take isl_multi_val *mv); __isl_give isl_schedule_tree *isl_schedule_tree_band_scale_down( __isl_take isl_schedule_tree *tree, __isl_take isl_multi_val *mv); __isl_give isl_schedule_tree *isl_schedule_tree_band_tile( __isl_take isl_schedule_tree *tree, __isl_take isl_multi_val *sizes); __isl_give isl_schedule_tree *isl_schedule_tree_band_split( __isl_take isl_schedule_tree *tree, int pos); __isl_give isl_schedule_tree *isl_schedule_tree_band_gist( __isl_take isl_schedule_tree *tree, __isl_take isl_union_set *context); __isl_give isl_schedule_tree *isl_schedule_tree_child( __isl_take isl_schedule_tree *tree, int pos); __isl_give isl_schedule_tree *isl_schedule_tree_reset_children( __isl_take isl_schedule_tree *tree); __isl_give isl_schedule_tree *isl_schedule_tree_drop_child( __isl_take isl_schedule_tree *tree, int pos); __isl_give isl_schedule_tree *isl_schedule_tree_replace_child( __isl_take isl_schedule_tree *tree, int pos, __isl_take isl_schedule_tree *new_child); __isl_give isl_schedule_tree *isl_schedule_tree_sequence_splice( __isl_take isl_schedule_tree *tree, int pos, __isl_take isl_schedule_tree *child); __isl_give isl_schedule_tree *isl_schedule_tree_reset_user( __isl_take isl_schedule_tree *tree); __isl_give isl_schedule_tree *isl_schedule_tree_align_params( __isl_take isl_schedule_tree *tree, __isl_take isl_space *space); __isl_give isl_schedule_tree *isl_schedule_tree_pullback_union_pw_multi_aff( __isl_take isl_schedule_tree *tree, __isl_take isl_union_pw_multi_aff *upma); __isl_give isl_printer *isl_printer_print_schedule_tree( __isl_take isl_printer *p, __isl_keep isl_schedule_tree *tree); __isl_give isl_printer *isl_printer_print_schedule_tree_mark( __isl_take isl_printer *p, __isl_keep isl_schedule_tree *tree, int n_ancestor, int *child_pos); #endif cloog-0.18.4/isl/isl_seq.h0000644000175000017500000000446612413270107012236 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 *dst, 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.4/isl/isl_schedule_band.h0000644000175000017500000001157412554427055014240 00000000000000#ifndef ISL_SCHEDULE_BAND_H #define ISL_SCHEDULE_BAND_H #include #include #include /* Information about a band within a schedule. * * n is the number of scheduling dimensions within the band. * coincident is an array of length n, indicating whether a scheduling dimension * satisfies the coincidence constraints in the sense that * the corresponding dependence distances are zero. * permutable is set if the band is permutable. * mupa is the partial schedule corresponding to this band. The dimension * of mupa is equal to n. * loop_type contains the loop AST generation types for the members * in the band. It may be NULL, if all members are * of type isl_ast_loop_default. * isolate_loop_type contains the loop AST generation types for the members * in the band for the isolated part. It may be NULL, if all members are * of type isl_ast_loop_default. * ast_build_options are the remaining AST build options associated * to the band. * anchored is set if the node depends on its position in the schedule tree. * In particular, it is set if the AST build options include * an isolate option. */ struct isl_schedule_band { int ref; int n; int *coincident; int permutable; isl_multi_union_pw_aff *mupa; int anchored; isl_union_set *ast_build_options; enum isl_ast_loop_type *loop_type; enum isl_ast_loop_type *isolate_loop_type; }; typedef struct isl_schedule_band isl_schedule_band; __isl_give isl_schedule_band *isl_schedule_band_from_multi_union_pw_aff( __isl_take isl_multi_union_pw_aff *mupa); __isl_give isl_schedule_band *isl_schedule_band_copy( __isl_keep isl_schedule_band *band); __isl_null isl_schedule_band *isl_schedule_band_free( __isl_take isl_schedule_band *band); isl_ctx *isl_schedule_band_get_ctx(__isl_keep isl_schedule_band *band); isl_bool isl_schedule_band_plain_is_equal(__isl_keep isl_schedule_band *band1, __isl_keep isl_schedule_band *band2); int isl_schedule_band_is_anchored(__isl_keep isl_schedule_band *band); __isl_give isl_space *isl_schedule_band_get_space( __isl_keep isl_schedule_band *band); __isl_give isl_schedule_band *isl_schedule_band_intersect_domain( __isl_take isl_schedule_band *band, __isl_take isl_union_set *domain); __isl_give isl_multi_union_pw_aff *isl_schedule_band_get_partial_schedule( __isl_keep isl_schedule_band *band); __isl_give isl_schedule_band *isl_schedule_band_set_partial_schedule( __isl_take isl_schedule_band *band, __isl_take isl_multi_union_pw_aff *schedule); enum isl_ast_loop_type isl_schedule_band_member_get_ast_loop_type( __isl_keep isl_schedule_band *band, int pos); __isl_give isl_schedule_band *isl_schedule_band_member_set_ast_loop_type( __isl_take isl_schedule_band *band, int pos, enum isl_ast_loop_type type); enum isl_ast_loop_type isl_schedule_band_member_get_isolate_ast_loop_type( __isl_keep isl_schedule_band *band, int pos); __isl_give isl_schedule_band * isl_schedule_band_member_set_isolate_ast_loop_type( __isl_take isl_schedule_band *band, int pos, enum isl_ast_loop_type type); __isl_give isl_union_set *isl_schedule_band_get_ast_build_options( __isl_keep isl_schedule_band *band); __isl_give isl_schedule_band *isl_schedule_band_set_ast_build_options( __isl_take isl_schedule_band *band, __isl_take isl_union_set *options); int isl_schedule_band_n_member(__isl_keep isl_schedule_band *band); isl_bool isl_schedule_band_member_get_coincident( __isl_keep isl_schedule_band *band, int pos); __isl_give isl_schedule_band *isl_schedule_band_member_set_coincident( __isl_take isl_schedule_band *band, int pos, int coincident); isl_bool isl_schedule_band_get_permutable(__isl_keep isl_schedule_band *band); __isl_give isl_schedule_band *isl_schedule_band_set_permutable( __isl_take isl_schedule_band *band, int permutable); __isl_give isl_schedule_band *isl_schedule_band_scale( __isl_take isl_schedule_band *band, __isl_take isl_multi_val *mv); __isl_give isl_schedule_band *isl_schedule_band_scale_down( __isl_take isl_schedule_band *band, __isl_take isl_multi_val *mv); __isl_give isl_schedule_band *isl_schedule_band_tile( __isl_take isl_schedule_band *band, __isl_take isl_multi_val *sizes); __isl_give isl_schedule_band *isl_schedule_band_point( __isl_take isl_schedule_band *band, __isl_keep isl_schedule_band *tile, __isl_take isl_multi_val *sizes); __isl_give isl_schedule_band *isl_schedule_band_drop( __isl_take isl_schedule_band *band, int pos, int n); __isl_give isl_schedule_band *isl_schedule_band_gist( __isl_take isl_schedule_band *band, __isl_take isl_union_set *context); __isl_give isl_schedule_band *isl_schedule_band_reset_user( __isl_take isl_schedule_band *band); __isl_give isl_schedule_band *isl_schedule_band_align_params( __isl_take isl_schedule_band *band, __isl_take isl_space *space); __isl_give isl_schedule_band *isl_schedule_band_pullback_union_pw_multi_aff( __isl_take isl_schedule_band *band, __isl_take isl_union_pw_multi_aff *upma); #endif cloog-0.18.4/isl/isl_affine_hull.c0000644000175000017500000011356512554427055013732 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 #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 && isl_tab_add_sample(tab, isl_vec_copy(sample)) < 0) hull = isl_basic_set_free(hull); 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); } bmap = isl_basic_map_add_known_div_constraints(bmap); 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) { isl_space *space = isl_basic_map_get_space(bmap); isl_basic_map_free(bmap); return isl_basic_map_universe(space); } 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); } bmap = isl_basic_map_add_known_div_constraints(bmap); 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) { isl_space *space; space = isl_basic_set_get_space(bset); isl_basic_set_free(cone); isl_basic_set_free(bset); return isl_basic_set_universe(space); } 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); } /* Return the superset of "bmap" described by the equalities * satisfied by "bmap" that are already known. */ __isl_give isl_basic_map *isl_basic_map_plain_affine_hull( __isl_take isl_basic_map *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; } /* 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_plain_affine_hull(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); } /* Return an empty basic map living in the same space as "map". */ static __isl_give isl_basic_map *replace_map_by_empty_basic_map( __isl_take isl_map *map) { isl_space *space; space = isl_map_get_space(map); isl_map_free(map); return isl_basic_map_empty(space); } /* 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) return replace_map_by_empty_basic_map(map); 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.4/isl/isl_union_map.c0000644000175000017500000027605112554427055013443 00000000000000/* * Copyright 2010-2011 INRIA Saclay * Copyright 2013-2014 Ecole Normale Superieure * Copyright 2014 INRIA Rocquencourt * * 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 Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt, * B.P. 105 - 78153 Le Chesnay, France */ #define ISL_DIM_H #include #include #include #include #include #include #include #include #include #include /* Return the number of parameters of "umap", where "type" * is required to be set to isl_dim_param. */ unsigned isl_union_map_dim(__isl_keep isl_union_map *umap, enum isl_dim_type type) { if (!umap) return 0; if (type != isl_dim_param) isl_die(isl_union_map_get_ctx(umap), isl_error_invalid, "can only reference parameters", return 0); return isl_space_dim(umap->dim, type); } /* Return the number of parameters of "uset", where "type" * is required to be set to isl_dim_param. */ unsigned isl_union_set_dim(__isl_keep isl_union_set *uset, enum isl_dim_type type) { return isl_union_map_dim(uset, type); } /* Return the id of the specified dimension. */ __isl_give isl_id *isl_union_map_get_dim_id(__isl_keep isl_union_map *umap, enum isl_dim_type type, unsigned pos) { if (!umap) return NULL; if (type != isl_dim_param) isl_die(isl_union_map_get_ctx(umap), isl_error_invalid, "can only reference parameters", return NULL); return isl_space_get_dim_id(umap->dim, type, pos); } /* Is this union set a parameter domain? */ isl_bool isl_union_set_is_params(__isl_keep isl_union_set *uset) { isl_set *set; isl_bool params; if (!uset) return isl_bool_error; if (uset->table.n != 1) return isl_bool_false; 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 *space, int size) { isl_union_map *umap; space = isl_space_params(space); if (!space) return NULL; umap = isl_calloc_type(space->ctx, isl_union_map); if (!umap) { isl_space_free(space); return NULL; } umap->ref = 1; umap->dim = space; if (isl_hash_table_init(space->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); } /* Return the position of the parameter with the given name * in "umap". * Return -1 if no such dimension can be found. */ int isl_union_map_find_dim_by_name(__isl_keep isl_union_map *umap, enum isl_dim_type type, const char *name) { if (!umap) return -1; return isl_space_find_dim_by_name(umap->dim, type, name); } __isl_give isl_space *isl_union_set_get_space(__isl_keep isl_union_set *uset) { return isl_union_map_get_space(uset); } static isl_stat free_umap_entry(void **entry, void *user) { isl_map *map = *entry; isl_map_free(map); return isl_stat_ok; } static isl_stat 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 isl_stat_ok; } __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 isl_stat 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 isl_stat_ok; } /* 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); } __isl_null isl_union_map *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; } __isl_null isl_union_set *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 { isl_stat (*fn)(__isl_take isl_map *map, void *user); void *user; }; static isl_stat 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; } isl_stat isl_union_map_foreach_map(__isl_keep isl_union_map *umap, isl_stat (*fn)(__isl_take isl_map *map, void *user), void *user) { struct isl_union_map_foreach_data data = { fn, user }; if (!umap) return isl_stat_error; return isl_hash_table_foreach(umap->dim->ctx, &umap->table, &call_on_copy, &data); } static isl_stat copy_map(void **entry, void *user) { isl_map *map = *entry; isl_map **map_p = user; *map_p = isl_map_copy(map); return isl_stat_error; } __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", goto error); isl_hash_table_foreach(ctx, &umap->table, ©_map, &map); isl_union_map_free(umap); return map; error: isl_union_map_free(umap); return NULL; } __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); } isl_stat isl_union_set_foreach_set(__isl_keep isl_union_set *uset, isl_stat (*fn)(__isl_take isl_set *set, void *user), void *user) { return isl_union_map_foreach_map(uset, (isl_stat(*)(__isl_take isl_map *, void*))fn, user); } struct isl_union_set_foreach_point_data { isl_stat (*fn)(__isl_take isl_point *pnt, void *user); void *user; }; static isl_stat foreach_point(__isl_take isl_set *set, void *user) { struct isl_union_set_foreach_point_data *data = user; isl_stat r; r = isl_set_foreach_point(set, data->fn, data->user); isl_set_free(set); return r; } isl_stat isl_union_set_foreach_point(__isl_keep isl_union_set *uset, isl_stat (*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 isl_stat 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 isl_stat_error; } if (empty) { isl_map_free(map); return isl_stat_ok; } } data->res = isl_union_map_add_map(data->res, map); return isl_stat_ok; } static __isl_give isl_union_map *gen_bin_op(__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2, isl_stat (*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 isl_stat 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 isl_stat_error; } data->res = isl_union_map_add_map(data->res, map); return isl_stat_ok; } static __isl_give isl_union_map *gen_bin_set_op(__isl_take isl_union_map *umap, __isl_take isl_set *set, isl_stat (*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; } /* Intersect "umap" with the parameter domain "set". * * If "set" does not have any constraints, then we can return immediately. */ __isl_give isl_union_map *isl_union_map_intersect_params( __isl_take isl_union_map *umap, __isl_take isl_set *set) { int is_universe; is_universe = isl_set_plain_is_universe(set); if (is_universe < 0) goto error; if (is_universe) { isl_set_free(set); return umap; } return gen_bin_set_op(umap, set, &intersect_params_entry); error: isl_union_map_free(umap); isl_set_free(set); return NULL; } __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 isl_stat 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 isl_stat_ok; 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 isl_stat_error; } if (empty) { isl_map_free(map); return isl_stat_ok; } data->res = isl_union_map_add_map(data->res, map); return isl_stat_ok; } 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 isl_stat 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 isl_stat_error; } data->res = isl_union_map_add_map(data->res, map); return isl_stat_ok; } __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 isl_stat 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; isl_bool 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 isl_stat_ok; 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 isl_stat_error; } if (empty) { isl_map_free(map); return isl_stat_ok; } data->res = isl_union_map_add_map(data->res, map); return isl_stat_ok; } /* 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 isl_stat 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; isl_bool 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 isl_stat_ok; } 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 isl_stat_error; } if (empty) { isl_map_free(map); return isl_stat_ok; } data->res = isl_union_map_add_map(data->res, map); return isl_stat_ok; } /* 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 isl_stat 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; isl_bool 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 isl_stat_ok; } 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 isl_stat_error; } if (empty) { isl_map_free(map); return isl_stat_ok; } data->res = isl_union_map_add_map(data->res, map); return isl_stat_ok; } /* 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 isl_stat 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; isl_bool 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 isl_stat_ok; 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 isl_stat_error; } data->res = isl_union_map_add_map(data->res, map); return isl_stat_ok; } /* 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 isl_stat 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; isl_bool 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 isl_stat_ok; 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 isl_stat_error; } data->res = isl_union_map_add_map(data->res, map); return isl_stat_ok; } /* 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 isl_stat 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; isl_bool 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 isl_stat_ok; 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 isl_stat_error; } if (empty) { isl_map_free(map); return isl_stat_ok; } data->res = isl_union_map_add_map(data->res, map); return isl_stat_ok; } __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; isl_stat (*fn)(void **entry, void *user); }; static isl_stat apply_range_entry(void **entry, void *user) { struct isl_union_map_bin_data *data = user; isl_map *map2 = *entry; isl_bool empty; if (!isl_space_tuple_is_equal(data->map->dim, isl_dim_out, map2->dim, isl_dim_in)) return isl_stat_ok; 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 isl_stat_error; } if (empty) { isl_map_free(map2); return isl_stat_ok; } data->res = isl_union_map_add_map(data->res, map2); return isl_stat_ok; } static isl_stat 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 isl_stat_error; return isl_stat_ok; } static __isl_give isl_union_map *bin_op(__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2, isl_stat (*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 isl_stat map_lex_lt_entry(void **entry, void *user) { struct isl_union_map_bin_data *data = user; isl_map *map2 = *entry; if (!isl_space_tuple_is_equal(data->map->dim, isl_dim_out, map2->dim, isl_dim_out)) return isl_stat_ok; 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 isl_stat_ok; } __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 isl_stat map_lex_le_entry(void **entry, void *user) { struct isl_union_map_bin_data *data = user; isl_map *map2 = *entry; if (!isl_space_tuple_is_equal(data->map->dim, isl_dim_out, map2->dim, isl_dim_out)) return isl_stat_ok; 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 isl_stat_ok; } __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 isl_stat 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 isl_stat_ok; } __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 isl_stat 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 isl_stat_ok; } __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 isl_stat domain_product_entry(void **entry, void *user) { struct isl_union_map_bin_data *data = user; isl_map *map2 = *entry; if (!isl_space_tuple_is_equal(data->map->dim, isl_dim_out, map2->dim, isl_dim_out)) return isl_stat_ok; 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 isl_stat_ok; } /* 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 isl_stat range_product_entry(void **entry, void *user) { struct isl_union_map_bin_data *data = user; isl_map *map2 = *entry; if (!isl_space_tuple_is_equal(data->map->dim, isl_dim_in, map2->dim, isl_dim_in)) return isl_stat_ok; 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 isl_stat_ok; } __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); } /* If data->map A -> B and "map2" C -> D have the same range space, * then add (A, C) -> (B * D) to data->res. */ static isl_stat flat_domain_product_entry(void **entry, void *user) { struct isl_union_map_bin_data *data = user; isl_map *map2 = *entry; if (!isl_space_tuple_is_equal(data->map->dim, isl_dim_out, map2->dim, isl_dim_out)) return isl_stat_ok; map2 = isl_map_flat_domain_product(isl_map_copy(data->map), isl_map_copy(map2)); data->res = isl_union_map_add_map(data->res, map2); return isl_stat_ok; } /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D). */ __isl_give isl_union_map *isl_union_map_flat_domain_product( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2) { return bin_op(umap1, umap2, &flat_domain_product_entry); } static isl_stat flat_range_product_entry(void **entry, void *user) { struct isl_union_map_bin_data *data = user; isl_map *map2 = *entry; if (!isl_space_tuple_is_equal(data->map->dim, isl_dim_in, map2->dim, isl_dim_in)) return isl_stat_ok; 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 isl_stat_ok; } __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, isl_stat (*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 isl_stat 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 isl_stat_ok; } __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, isl_stat (*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 isl_stat 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 ? isl_stat_ok : isl_stat_error; } __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 isl_stat 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 ? isl_stat_ok : isl_stat_error; } __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 isl_stat 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 ? isl_stat_ok : isl_stat_error; } __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 isl_stat 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 isl_stat_error; isl_map_free(*map); *map = copy; return isl_stat_ok; } 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; } /* Remove redundant constraints in each of the basic maps of "umap". * Since removing redundant constraints does not change the meaning * or the space, the operation can be performed in-place. */ __isl_give isl_union_map *isl_union_map_remove_redundancies( __isl_take isl_union_map *umap) { return inplace(umap, &isl_map_remove_redundancies); } /* Remove redundant constraints in each of the basic sets of "uset". */ __isl_give isl_union_set *isl_union_set_remove_redundancies( __isl_take isl_union_set *uset) { return isl_union_map_remove_redundancies(uset); } __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 isl_stat lexmin_entry(void **entry, void *user) { isl_map **map = (isl_map **)entry; *map = isl_map_lexmin(*map); return *map ? isl_stat_ok : isl_stat_error; } __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 isl_stat lexmax_entry(void **entry, void *user) { isl_map **map = (isl_map **)entry; *map = isl_map_lexmax(*map); return *map ? isl_stat_ok : isl_stat_error; } __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 isl_stat 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 isl_stat_ok; } __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 isl_stat 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 isl_stat_ok; } __isl_give isl_union_map *isl_union_map_reverse(__isl_take isl_union_map *umap) { return cond_un_op(umap, &reverse_entry); } static isl_stat 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 isl_stat_ok; } /* 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) goto error; if (empty) { isl_space *space; space = isl_union_map_get_space(umap); isl_union_map_free(umap); return isl_set_empty(space); } return isl_set_from_union_set(cond_un_op(umap, ¶ms_entry)); error: isl_union_map_free(umap); return NULL; } /* 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 isl_stat 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 isl_stat_ok; } __isl_give isl_union_set *isl_union_map_domain(__isl_take isl_union_map *umap) { return cond_un_op(umap, &domain_entry); } static isl_stat 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 isl_stat_ok; } __isl_give isl_union_set *isl_union_map_range(__isl_take isl_union_map *umap) { return cond_un_op(umap, &range_entry); } static isl_stat 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 isl_stat_ok; } __isl_give isl_union_map *isl_union_map_domain_map( __isl_take isl_union_map *umap) { return cond_un_op(umap, &domain_map_entry); } /* Construct an isl_pw_multi_aff that maps "map" to its domain and * add the result to "res". */ static isl_stat domain_map_upma(__isl_take isl_map *map, void *user) { isl_union_pw_multi_aff **res = user; isl_multi_aff *ma; isl_pw_multi_aff *pma; ma = isl_multi_aff_domain_map(isl_map_get_space(map)); pma = isl_pw_multi_aff_alloc(isl_map_wrap(map), ma); *res = isl_union_pw_multi_aff_add_pw_multi_aff(*res, pma); return *res ? isl_stat_ok : isl_stat_error; } /* Return an isl_union_pw_multi_aff that maps a wrapped copy of "umap" * to its domain. */ __isl_give isl_union_pw_multi_aff *isl_union_map_domain_map_union_pw_multi_aff( __isl_take isl_union_map *umap) { isl_union_pw_multi_aff *res; res = isl_union_pw_multi_aff_empty(isl_union_map_get_space(umap)); if (isl_union_map_foreach_map(umap, &domain_map_upma, &res) < 0) res = isl_union_pw_multi_aff_free(res); isl_union_map_free(umap); return res; } static isl_stat 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 isl_stat_ok; } __isl_give isl_union_map *isl_union_map_range_map( __isl_take isl_union_map *umap) { return cond_un_op(umap, &range_map_entry); } /* Check if "set" is of the form A[B -> C]. * If so, add A[B -> C] -> B to "res". */ static isl_stat wrapped_domain_map_entry(void **entry, void *user) { isl_set *set = *entry; isl_union_set **res = user; int wrapping; wrapping = isl_set_is_wrapping(set); if (wrapping < 0) return isl_stat_error; if (!wrapping) return isl_stat_ok; *res = isl_union_map_add_map(*res, isl_set_wrapped_domain_map(isl_set_copy(set))); return isl_stat_ok; } /* Given a collection of wrapped maps of the form A[B -> C], * return the collection of maps A[B -> C] -> B. */ __isl_give isl_union_map *isl_union_set_wrapped_domain_map( __isl_take isl_union_set *uset) { return cond_un_op(uset, &wrapped_domain_map_entry); } static isl_stat deltas_entry(void **entry, void *user) { isl_map *map = *entry; isl_union_set **res = user; if (!isl_space_tuple_is_equal(map->dim, isl_dim_in, map->dim, isl_dim_out)) return isl_stat_ok; *res = isl_union_set_add_set(*res, isl_map_deltas(isl_map_copy(map))); return isl_stat_ok; } __isl_give isl_union_set *isl_union_map_deltas(__isl_take isl_union_map *umap) { return cond_un_op(umap, &deltas_entry); } static isl_stat deltas_map_entry(void **entry, void *user) { isl_map *map = *entry; isl_union_map **res = user; if (!isl_space_tuple_is_equal(map->dim, isl_dim_in, map->dim, isl_dim_out)) return isl_stat_ok; *res = isl_union_map_add_map(*res, isl_map_deltas_map(isl_map_copy(map))); return isl_stat_ok; } __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 isl_stat 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 isl_stat_ok; } __isl_give isl_union_map *isl_union_set_identity(__isl_take isl_union_set *uset) { return cond_un_op(uset, &identity_entry); } /* Construct an identity isl_pw_multi_aff on "set" and add it to *res. */ static isl_stat identity_upma(__isl_take isl_set *set, void *user) { isl_union_pw_multi_aff **res = user; isl_space *space; isl_pw_multi_aff *pma; space = isl_space_map_from_set(isl_set_get_space(set)); pma = isl_pw_multi_aff_identity(space); pma = isl_pw_multi_aff_intersect_domain(pma, set); *res = isl_union_pw_multi_aff_add_pw_multi_aff(*res, pma); return *res ? isl_stat_ok : isl_stat_error; } /* Return an identity function on "uset" in the form * of an isl_union_pw_multi_aff. */ __isl_give isl_union_pw_multi_aff *isl_union_set_identity_union_pw_multi_aff( __isl_take isl_union_set *uset) { isl_union_pw_multi_aff *res; res = isl_union_pw_multi_aff_empty(isl_union_set_get_space(uset)); if (isl_union_set_foreach_set(uset, &identity_upma, &res) < 0) res = isl_union_pw_multi_aff_free(res); isl_union_set_free(uset); return res; } /* If "map" is of the form [A -> B] -> C, then add A -> C to "res". */ static isl_stat domain_factor_domain_entry(void **entry, void *user) { isl_map *map = *entry; isl_union_map **res = user; if (!isl_map_domain_is_wrapping(map)) return isl_stat_ok; *res = isl_union_map_add_map(*res, isl_map_domain_factor_domain(isl_map_copy(map))); return *res ? isl_stat_ok : isl_stat_error; } /* For each map in "umap" of the form [A -> B] -> C, * construct the map A -> C and collect the results. */ __isl_give isl_union_map *isl_union_map_domain_factor_domain( __isl_take isl_union_map *umap) { return cond_un_op(umap, &domain_factor_domain_entry); } /* If "map" is of the form [A -> B] -> C, then add B -> C to "res". */ static isl_stat domain_factor_range_entry(void **entry, void *user) { isl_map *map = *entry; isl_union_map **res = user; if (!isl_map_domain_is_wrapping(map)) return isl_stat_ok; *res = isl_union_map_add_map(*res, isl_map_domain_factor_range(isl_map_copy(map))); return *res ? isl_stat_ok : isl_stat_error; } /* For each map in "umap" of the form [A -> B] -> C, * construct the map B -> C and collect the results. */ __isl_give isl_union_map *isl_union_map_domain_factor_range( __isl_take isl_union_map *umap) { return cond_un_op(umap, &domain_factor_range_entry); } /* If "map" is of the form A -> [B -> C], then add A -> C to "res". */ static isl_stat range_factor_range_entry(void **entry, void *user) { isl_map *map = *entry; isl_union_map **res = user; if (!isl_map_range_is_wrapping(map)) return isl_stat_ok; *res = isl_union_map_add_map(*res, isl_map_range_factor_range(isl_map_copy(map))); return *res ? isl_stat_ok : isl_stat_error; } /* For each map in "umap" of the form A -> [B -> C], * construct the map A -> C and collect the results. */ __isl_give isl_union_map *isl_union_map_range_factor_range( __isl_take isl_union_map *umap) { return cond_un_op(umap, &range_factor_range_entry); } /* If "map" is of the form [A -> B] -> [C -> D], then add A -> C to "res". */ static isl_stat factor_domain_entry(void **entry, void *user) { isl_map *map = *entry; isl_union_map **res = user; if (!isl_map_domain_is_wrapping(map) || !isl_map_range_is_wrapping(map)) return isl_stat_ok; *res = isl_union_map_add_map(*res, isl_map_factor_domain(isl_map_copy(map))); return *res ? isl_stat_ok : isl_stat_error; } /* For each map in "umap" of the form [A -> B] -> [C -> D], * construct the map A -> C and collect the results. */ __isl_give isl_union_map *isl_union_map_factor_domain( __isl_take isl_union_map *umap) { return cond_un_op(umap, &factor_domain_entry); } /* If "map" is of the form [A -> B] -> [C -> D], then add B -> D to "res". */ static isl_stat factor_range_entry(void **entry, void *user) { isl_map *map = *entry; isl_union_map **res = user; if (!isl_map_domain_is_wrapping(map) || !isl_map_range_is_wrapping(map)) return isl_stat_ok; *res = isl_union_map_add_map(*res, isl_map_factor_range(isl_map_copy(map))); return *res ? isl_stat_ok : isl_stat_error; } /* For each map in "umap" of the form [A -> B] -> [C -> D], * construct the map B -> D and collect the results. */ __isl_give isl_union_map *isl_union_map_factor_range( __isl_take isl_union_map *umap) { return cond_un_op(umap, &factor_range_entry); } static isl_stat unwrap_entry(void **entry, void *user) { isl_set *set = *entry; isl_union_set **res = user; if (!isl_set_is_wrapping(set)) return isl_stat_ok; *res = isl_union_map_add_map(*res, isl_set_unwrap(isl_set_copy(set))); return isl_stat_ok; } __isl_give isl_union_map *isl_union_set_unwrap(__isl_take isl_union_set *uset) { return cond_un_op(uset, &unwrap_entry); } static isl_stat 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 isl_stat_ok; } __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; isl_bool is_subset; }; static isl_stat 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 isl_stat_error; if (empty) return isl_stat_ok; data->is_subset = 0; return isl_stat_error; } data->is_subset = isl_map_is_subset(map, entry2->data); if (data->is_subset < 0 || !data->is_subset) return isl_stat_error; return isl_stat_ok; } isl_bool 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, isl_bool_true }; 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 isl_bool_error; } isl_bool 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); } isl_bool isl_union_map_is_equal(__isl_keep isl_union_map *umap1, __isl_keep isl_union_map *umap2) { isl_bool is_subset; if (!umap1 || !umap2) return isl_bool_error; is_subset = isl_union_map_is_subset(umap1, umap2); if (is_subset != isl_bool_true) return is_subset; is_subset = isl_union_map_is_subset(umap2, umap1); return is_subset; } isl_bool 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); } isl_bool isl_union_map_is_strict_subset(__isl_keep isl_union_map *umap1, __isl_keep isl_union_map *umap2) { isl_bool is_subset; if (!umap1 || !umap2) return isl_bool_error; is_subset = isl_union_map_is_subset(umap1, umap2); if (is_subset != isl_bool_true) return is_subset; is_subset = isl_union_map_is_subset(umap2, umap1); if (is_subset == isl_bool_error) return is_subset; return !is_subset; } isl_bool 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); } /* Internal data structure for isl_union_map_is_disjoint. * umap2 is the union map with which we are comparing. * is_disjoint is initialized to 1 and is set to 0 as soon * as the union maps turn out not to be disjoint. */ struct isl_union_map_is_disjoint_data { isl_union_map *umap2; isl_bool is_disjoint; }; /* Check if "map" is disjoint from data->umap2 and abort * the search if it is not. */ static isl_stat is_disjoint_entry(void **entry, void *user) { struct isl_union_map_is_disjoint_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) return isl_stat_ok; data->is_disjoint = isl_map_is_disjoint(map, entry2->data); if (data->is_disjoint < 0 || !data->is_disjoint) return isl_stat_error; return isl_stat_ok; } /* Are "umap1" and "umap2" disjoint? */ isl_bool isl_union_map_is_disjoint(__isl_keep isl_union_map *umap1, __isl_keep isl_union_map *umap2) { struct isl_union_map_is_disjoint_data data = { NULL, isl_bool_true }; 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_disjoint_entry, &data) < 0 && data.is_disjoint) goto error; isl_union_map_free(umap1); isl_union_map_free(umap2); return data.is_disjoint; error: isl_union_map_free(umap1); isl_union_map_free(umap2); return isl_bool_error; } /* Are "uset1" and "uset2" disjoint? */ isl_bool isl_union_set_is_disjoint(__isl_keep isl_union_set *uset1, __isl_keep isl_union_set *uset2) { return isl_union_map_is_disjoint(uset1, uset2); } static isl_stat 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 isl_stat_error; if (!isl_basic_map_plain_is_empty(*sample)) return isl_stat_error; return isl_stat_ok; } __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 { isl_bool res; isl_bool (*fn)(__isl_keep isl_map *map); }; static isl_stat 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 isl_stat_error; if (!data->res) return isl_stat_error; return isl_stat_ok; } static isl_bool union_map_forall(__isl_keep isl_union_map *umap, isl_bool (*fn)(__isl_keep isl_map *map)) { struct isl_forall_data data = { isl_bool_true, fn }; if (!umap) return isl_bool_error; if (isl_hash_table_foreach(umap->dim->ctx, &umap->table, &forall_entry, &data) < 0 && data.res) return isl_bool_error; return data.res; } struct isl_forall_user_data { isl_bool res; isl_bool (*fn)(__isl_keep isl_map *map, void *user); void *user; }; static isl_stat 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 isl_stat_error; if (!data->res) return isl_stat_error; return isl_stat_ok; } /* Check if fn(map, user) returns true for all maps "map" in umap. */ static isl_bool union_map_forall_user(__isl_keep isl_union_map *umap, isl_bool (*fn)(__isl_keep isl_map *map, void *user), void *user) { struct isl_forall_user_data data = { isl_bool_true, fn, user }; if (!umap) return isl_bool_error; if (isl_hash_table_foreach(umap->dim->ctx, &umap->table, &forall_user_entry, &data) < 0 && data.res) return isl_bool_error; return data.res; } isl_bool isl_union_map_is_empty(__isl_keep isl_union_map *umap) { return union_map_forall(umap, &isl_map_is_empty); } isl_bool isl_union_set_is_empty(__isl_keep isl_union_set *uset) { return isl_union_map_is_empty(uset); } static isl_bool is_subset_of_identity(__isl_keep isl_map *map) { isl_bool is_subset; isl_space *dim; isl_map *id; if (!map) return isl_bool_error; if (!isl_space_tuple_is_equal(map->dim, isl_dim_in, map->dim, isl_dim_out)) return isl_bool_false; 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; } /* Given an isl_union_map that consists of a single map, check * if it is single-valued. */ static isl_bool single_map_is_single_valued(__isl_keep isl_union_map *umap) { isl_map *map; isl_bool sv; 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; } /* Internal data structure for single_valued_on_domain. * * "umap" is the union map to be tested. * "sv" is set to 1 as long as "umap" may still be single-valued. */ struct isl_union_map_is_sv_data { isl_union_map *umap; isl_bool sv; }; /* Check if the data->umap is single-valued on "set". * * If data->umap consists of a single map on "set", then test it * as an isl_map. * * Otherwise, compute * * M \circ M^-1 * * check if the result is a subset of the identity mapping and * store the result in data->sv. * * Terminate as soon as data->umap has been determined not to * be single-valued. */ static isl_stat single_valued_on_domain(__isl_take isl_set *set, void *user) { struct isl_union_map_is_sv_data *data = user; isl_union_map *umap, *test; umap = isl_union_map_copy(data->umap); umap = isl_union_map_intersect_domain(umap, isl_union_set_from_set(set)); if (isl_union_map_n_map(umap) == 1) { data->sv = single_map_is_single_valued(umap); isl_union_map_free(umap); } else { test = isl_union_map_reverse(isl_union_map_copy(umap)); test = isl_union_map_apply_range(test, umap); data->sv = union_map_forall(test, &is_subset_of_identity); isl_union_map_free(test); } if (data->sv < 0 || !data->sv) return isl_stat_error; return isl_stat_ok; } /* Check if the given map is single-valued. * * If the union map consists of a single map, then test it as an isl_map. * Otherwise, check if the union map is single-valued on each of its * domain spaces. */ isl_bool isl_union_map_is_single_valued(__isl_keep isl_union_map *umap) { isl_union_map *universe; isl_union_set *domain; struct isl_union_map_is_sv_data data; if (isl_union_map_n_map(umap) == 1) return single_map_is_single_valued(umap); universe = isl_union_map_universe(isl_union_map_copy(umap)); domain = isl_union_map_domain(universe); data.sv = isl_bool_true; data.umap = umap; if (isl_union_set_foreach_set(domain, &single_valued_on_domain, &data) < 0 && data.sv) data.sv = isl_bool_error; isl_union_set_free(domain); return data.sv; } isl_bool isl_union_map_is_injective(__isl_keep isl_union_map *umap) { isl_bool 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 isl_bool 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 isl_bool 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 isl_bool 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 isl_bool_true; } if (first >= n_range) { isl_union_map_free(umap); return isl_bool_false; } data.v = alloc_isl_fixed_map_array(ctx, n); if (!data.v) goto error; for (data.pos = first; data.pos < n_range; ++data.pos) { isl_bool 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 isl_bool_false; error: free_isl_fixed_map_array(data.v, n); isl_union_map_free(umap); return isl_bool_error; } /* Check whether the maps in umap that map to subsets of "ran" * have obviously distinct ranges. */ static isl_bool 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. */ isl_bool isl_union_map_plain_is_injective(__isl_keep isl_union_map *umap) { isl_bool in; isl_union_map *univ; isl_union_set *ran; in = union_map_forall(umap, &isl_map_plain_is_injective); if (in < 0) return isl_bool_error; if (!in) return isl_bool_false; 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; } isl_bool isl_union_map_is_bijective(__isl_keep isl_union_map *umap) { isl_bool sv; sv = isl_union_map_is_single_valued(umap); if (sv < 0 || !sv) return sv; return isl_union_map_is_injective(umap); } static isl_stat zip_entry(void **entry, void *user) { isl_map *map = *entry; isl_union_map **res = user; if (!isl_map_can_zip(map)) return isl_stat_ok; *res = isl_union_map_add_map(*res, isl_map_zip(isl_map_copy(map))); return isl_stat_ok; } __isl_give isl_union_map *isl_union_map_zip(__isl_take isl_union_map *umap) { return cond_un_op(umap, &zip_entry); } static isl_stat uncurry_entry(void **entry, void *user) { isl_map *map = *entry; isl_union_map **res = user; if (!isl_map_can_uncurry(map)) return isl_stat_ok; *res = isl_union_map_add_map(*res, isl_map_uncurry(isl_map_copy(map))); return isl_stat_ok; } /* 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 isl_stat curry_entry(void **entry, void *user) { isl_map *map = *entry; isl_union_map **res = user; if (!isl_map_can_curry(map)) return isl_stat_ok; *res = isl_union_map_add_map(*res, isl_map_curry(isl_map_copy(map))); return isl_stat_ok; } /* 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 isl_stat 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 isl_stat_ok; } __isl_give isl_union_set *isl_union_set_lift(__isl_take isl_union_set *uset) { return cond_un_op(uset, &lift_entry); } static isl_stat 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 isl_stat_ok; } __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 isl_stat 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 isl_stat_error; return isl_stat_ok; } __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; } /* Is the domain space of "map" equal to "space"? */ static int domain_match(__isl_keep isl_map *map, __isl_keep isl_space *space) { return isl_space_tuple_is_equal(map->dim, isl_dim_in, space, isl_dim_out); } /* Is the range space of "map" equal to "space"? */ static int range_match(__isl_keep isl_map *map, __isl_keep isl_space *space) { return isl_space_tuple_is_equal(map->dim, isl_dim_out, space, isl_dim_out); } /* Is the set space of "map" equal to "space"? */ static int set_match(__isl_keep isl_map *map, __isl_keep isl_space *space) { return isl_space_tuple_is_equal(map->dim, isl_dim_set, space, isl_dim_out); } /* Internal data structure for preimage_pw_multi_aff. * * "pma" is the function under which the preimage should be taken. * "space" is the space of "pma". * "res" collects the results. * "fn" computes the preimage for a given map. * "match" returns true if "fn" can be called. */ struct isl_union_map_preimage_data { isl_space *space; isl_pw_multi_aff *pma; isl_union_map *res; int (*match)(__isl_keep isl_map *map, __isl_keep isl_space *space); __isl_give isl_map *(*fn)(__isl_take isl_map *map, __isl_take isl_pw_multi_aff *pma); }; /* Call data->fn to compute the preimage of the domain or range of *entry * under the function represented by data->pma, provided the domain/range * space of *entry matches the target space of data->pma * (as given by data->match), and add the result to data->res. */ static isl_stat preimage_entry(void **entry, void *user) { int m; isl_map *map = *entry; struct isl_union_map_preimage_data *data = user; isl_bool empty; m = data->match(map, data->space); if (m < 0) return isl_stat_error; if (!m) return isl_stat_ok; map = isl_map_copy(map); map = data->fn(map, isl_pw_multi_aff_copy(data->pma)); empty = isl_map_is_empty(map); if (empty < 0 || empty) { isl_map_free(map); return empty < 0 ? isl_stat_error : isl_stat_ok; } data->res = isl_union_map_add_map(data->res, map); return isl_stat_ok; } /* Compute the preimage of the domain or range of "umap" under the function * represented by "pma". * In other words, plug in "pma" in the domain or range of "umap". * The function "fn" performs the actual preimage computation on a map, * while "match" determines to which maps the function should be applied. */ static __isl_give isl_union_map *preimage_pw_multi_aff( __isl_take isl_union_map *umap, __isl_take isl_pw_multi_aff *pma, int (*match)(__isl_keep isl_map *map, __isl_keep isl_space *space), __isl_give isl_map *(*fn)(__isl_take isl_map *map, __isl_take isl_pw_multi_aff *pma)) { isl_ctx *ctx; isl_space *space; struct isl_union_map_preimage_data data; umap = isl_union_map_align_params(umap, isl_pw_multi_aff_get_space(pma)); pma = isl_pw_multi_aff_align_params(pma, isl_union_map_get_space(umap)); if (!umap || !pma) goto error; ctx = isl_union_map_get_ctx(umap); space = isl_union_map_get_space(umap); data.space = isl_pw_multi_aff_get_space(pma); data.pma = pma; data.res = isl_union_map_alloc(space, umap->table.n); data.match = match; data.fn = fn; if (isl_hash_table_foreach(ctx, &umap->table, &preimage_entry, &data) < 0) data.res = isl_union_map_free(data.res); isl_space_free(data.space); isl_union_map_free(umap); isl_pw_multi_aff_free(pma); return data.res; error: isl_union_map_free(umap); isl_pw_multi_aff_free(pma); return NULL; } /* Compute the preimage of the domain of "umap" under the function * represented by "pma". * In other words, plug in "pma" 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 "pma", * except that the domain has been replaced by the domain space of "pma". */ __isl_give isl_union_map *isl_union_map_preimage_domain_pw_multi_aff( __isl_take isl_union_map *umap, __isl_take isl_pw_multi_aff *pma) { return preimage_pw_multi_aff(umap, pma, &domain_match, &isl_map_preimage_domain_pw_multi_aff); } /* Compute the preimage of the range of "umap" under the function * represented by "pma". * In other words, plug in "pma" in the range of "umap". * The result contains maps that live in the same spaces as the maps of "umap" * with range space equal to the target space of "pma", * except that the range has been replaced by the domain space of "pma". */ __isl_give isl_union_map *isl_union_map_preimage_range_pw_multi_aff( __isl_take isl_union_map *umap, __isl_take isl_pw_multi_aff *pma) { return preimage_pw_multi_aff(umap, pma, &range_match, &isl_map_preimage_range_pw_multi_aff); } /* Compute the preimage of "uset" under the function represented by "pma". * In other words, plug in "pma" in "uset". * The result contains sets that live in the same spaces as the sets of "uset" * with space equal to the target space of "pma", * except that the space has been replaced by the domain space of "pma". */ __isl_give isl_union_set *isl_union_set_preimage_pw_multi_aff( __isl_take isl_union_set *uset, __isl_take isl_pw_multi_aff *pma) { return preimage_pw_multi_aff(uset, pma, &set_match, &isl_set_preimage_pw_multi_aff); } /* 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) { return isl_union_map_preimage_domain_pw_multi_aff(umap, isl_pw_multi_aff_from_multi_aff(ma)); } /* Compute the preimage of the range of "umap" under the function * represented by "ma". * In other words, plug in "ma" in the range of "umap". * The result contains maps that live in the same spaces as the maps of "umap" * with range space equal to the target space of "ma", * except that the range has been replaced by the domain space of "ma". */ __isl_give isl_union_map *isl_union_map_preimage_range_multi_aff( __isl_take isl_union_map *umap, __isl_take isl_multi_aff *ma) { return isl_union_map_preimage_range_pw_multi_aff(umap, isl_pw_multi_aff_from_multi_aff(ma)); } /* Compute the preimage of "uset" under the function represented by "ma". * In other words, plug in "ma" in "uset". * The result contains sets that live in the same spaces as the sets of "uset" * with space equal to the target space of "ma", * except that the space has been replaced by the domain space of "ma". */ __isl_give isl_union_map *isl_union_set_preimage_multi_aff( __isl_take isl_union_set *uset, __isl_take isl_multi_aff *ma) { return isl_union_set_preimage_pw_multi_aff(uset, isl_pw_multi_aff_from_multi_aff(ma)); } /* Internal data structure for preimage_multi_pw_aff. * * "mpa" is the function under which the preimage should be taken. * "space" is the space of "mpa". * "res" collects the results. * "fn" computes the preimage for a given map. * "match" returns true if "fn" can be called. */ struct isl_union_map_preimage_mpa_data { isl_space *space; isl_multi_pw_aff *mpa; isl_union_map *res; int (*match)(__isl_keep isl_map *map, __isl_keep isl_space *space); __isl_give isl_map *(*fn)(__isl_take isl_map *map, __isl_take isl_multi_pw_aff *mpa); }; /* Call data->fn to compute the preimage of the domain or range of *entry * under the function represented by data->mpa, provided the domain/range * space of *entry matches the target space of data->mpa * (as given by data->match), and add the result to data->res. */ static isl_stat preimage_mpa_entry(void **entry, void *user) { int m; isl_map *map = *entry; struct isl_union_map_preimage_mpa_data *data = user; isl_bool empty; m = data->match(map, data->space); if (m < 0) return isl_stat_error; if (!m) return isl_stat_ok; map = isl_map_copy(map); map = data->fn(map, isl_multi_pw_aff_copy(data->mpa)); empty = isl_map_is_empty(map); if (empty < 0 || empty) { isl_map_free(map); return empty < 0 ? isl_stat_error : isl_stat_ok; } data->res = isl_union_map_add_map(data->res, map); return isl_stat_ok; } /* Compute the preimage of the domain or range of "umap" under the function * represented by "mpa". * In other words, plug in "mpa" in the domain or range of "umap". * The function "fn" performs the actual preimage computation on a map, * while "match" determines to which maps the function should be applied. */ static __isl_give isl_union_map *preimage_multi_pw_aff( __isl_take isl_union_map *umap, __isl_take isl_multi_pw_aff *mpa, int (*match)(__isl_keep isl_map *map, __isl_keep isl_space *space), __isl_give isl_map *(*fn)(__isl_take isl_map *map, __isl_take isl_multi_pw_aff *mpa)) { isl_ctx *ctx; isl_space *space; struct isl_union_map_preimage_mpa_data data; umap = isl_union_map_align_params(umap, isl_multi_pw_aff_get_space(mpa)); mpa = isl_multi_pw_aff_align_params(mpa, isl_union_map_get_space(umap)); if (!umap || !mpa) goto error; ctx = isl_union_map_get_ctx(umap); space = isl_union_map_get_space(umap); data.space = isl_multi_pw_aff_get_space(mpa); data.mpa = mpa; data.res = isl_union_map_alloc(space, umap->table.n); data.match = match; data.fn = fn; if (isl_hash_table_foreach(ctx, &umap->table, &preimage_mpa_entry, &data) < 0) data.res = isl_union_map_free(data.res); isl_space_free(data.space); isl_union_map_free(umap); isl_multi_pw_aff_free(mpa); return data.res; error: isl_union_map_free(umap); isl_multi_pw_aff_free(mpa); return NULL; } /* Compute the preimage of the domain of "umap" under the function * represented by "mpa". * In other words, plug in "mpa" 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 "mpa", * except that the domain has been replaced by the domain space of "mpa". */ __isl_give isl_union_map *isl_union_map_preimage_domain_multi_pw_aff( __isl_take isl_union_map *umap, __isl_take isl_multi_pw_aff *mpa) { return preimage_multi_pw_aff(umap, mpa, &domain_match, &isl_map_preimage_domain_multi_pw_aff); } /* Internal data structure for preimage_upma. * * "umap" is the map of which the preimage should be computed. * "res" collects the results. * "fn" computes the preimage for a given piecewise multi-affine function. */ struct isl_union_map_preimage_upma_data { isl_union_map *umap; isl_union_map *res; __isl_give isl_union_map *(*fn)(__isl_take isl_union_map *umap, __isl_take isl_pw_multi_aff *pma); }; /* Call data->fn to compute the preimage of the domain or range of data->umap * under the function represented by pma and add the result to data->res. */ static isl_stat preimage_upma(__isl_take isl_pw_multi_aff *pma, void *user) { struct isl_union_map_preimage_upma_data *data = user; isl_union_map *umap; umap = isl_union_map_copy(data->umap); umap = data->fn(umap, pma); data->res = isl_union_map_union(data->res, umap); return data->res ? isl_stat_ok : isl_stat_error; } /* Compute the preimage of the domain or range of "umap" under the function * represented by "upma". * In other words, plug in "upma" in the domain or range of "umap". * The function "fn" performs the actual preimage computation * on a piecewise multi-affine function. */ static __isl_give isl_union_map *preimage_union_pw_multi_aff( __isl_take isl_union_map *umap, __isl_take isl_union_pw_multi_aff *upma, __isl_give isl_union_map *(*fn)(__isl_take isl_union_map *umap, __isl_take isl_pw_multi_aff *pma)) { struct isl_union_map_preimage_upma_data data; data.umap = umap; data.res = isl_union_map_empty(isl_union_map_get_space(umap)); data.fn = fn; if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma, &preimage_upma, &data) < 0) data.res = isl_union_map_free(data.res); isl_union_map_free(umap); isl_union_pw_multi_aff_free(upma); return data.res; } /* Compute the preimage of the domain of "umap" under the function * represented by "upma". * In other words, plug in "upma" 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 one of the target spaces of "upma", * except that the domain has been replaced by one of the the domain spaces that * corresponds to that target space of "upma". */ __isl_give isl_union_map *isl_union_map_preimage_domain_union_pw_multi_aff( __isl_take isl_union_map *umap, __isl_take isl_union_pw_multi_aff *upma) { return preimage_union_pw_multi_aff(umap, upma, &isl_union_map_preimage_domain_pw_multi_aff); } /* Compute the preimage of the range of "umap" under the function * represented by "upma". * In other words, plug in "upma" in the range of "umap". * The result contains maps that live in the same spaces as the maps of "umap" * with range space equal to one of the target spaces of "upma", * except that the range has been replaced by one of the the domain spaces that * corresponds to that target space of "upma". */ __isl_give isl_union_map *isl_union_map_preimage_range_union_pw_multi_aff( __isl_take isl_union_map *umap, __isl_take isl_union_pw_multi_aff *upma) { return preimage_union_pw_multi_aff(umap, upma, &isl_union_map_preimage_range_pw_multi_aff); } /* Compute the preimage of "uset" under the function represented by "upma". * In other words, plug in "upma" in the range of "uset". * The result contains sets that live in the same spaces as the sets of "uset" * with space equal to one of the target spaces of "upma", * except that the space has been replaced by one of the the domain spaces that * corresponds to that target space of "upma". */ __isl_give isl_union_set *isl_union_set_preimage_union_pw_multi_aff( __isl_take isl_union_set *uset, __isl_take isl_union_pw_multi_aff *upma) { return preimage_union_pw_multi_aff(uset, upma, &isl_union_set_preimage_pw_multi_aff); } /* Reset the user pointer on all identifiers of parameters and tuples * of the space of *entry. */ static isl_stat reset_user(void **entry, void *user) { isl_map **map = (isl_map **)entry; *map = isl_map_reset_user(*map); return *map ? isl_stat_ok : isl_stat_error; } /* Reset the user pointer on all identifiers of parameters and tuples * of the spaces of "umap". */ __isl_give isl_union_map *isl_union_map_reset_user( __isl_take isl_union_map *umap) { umap = isl_union_map_cow(umap); if (!umap) return NULL; umap->dim = isl_space_reset_user(umap->dim); if (!umap->dim) return isl_union_map_free(umap); umap = un_op(umap, &reset_user); return umap; } /* Reset the user pointer on all identifiers of parameters and tuples * of the spaces of "uset". */ __isl_give isl_union_set *isl_union_set_reset_user( __isl_take isl_union_set *uset) { return isl_union_map_reset_user(uset); } /* Internal data structure for isl_union_map_project_out. * "type", "first" and "n" are the arguments for the isl_map_project_out * call. * "res" collects the results. */ struct isl_union_map_project_out_data { enum isl_dim_type type; unsigned first; unsigned n; isl_union_map *res; }; /* Turn the data->n dimensions of type data->type, starting at data->first * into existentially quantified variables and add the result to data->res. */ static isl_stat project_out(__isl_take isl_map *map, void *user) { struct isl_union_map_project_out_data *data = user; map = isl_map_project_out(map, data->type, data->first, data->n); data->res = isl_union_map_add_map(data->res, map); return isl_stat_ok; } /* Turn the "n" dimensions of type "type", starting at "first" * into existentially quantified variables. * Since the space of an isl_union_map only contains parameters, * type is required to be equal to isl_dim_param. */ __isl_give isl_union_map *isl_union_map_project_out( __isl_take isl_union_map *umap, enum isl_dim_type type, unsigned first, unsigned n) { isl_space *space; struct isl_union_map_project_out_data data = { type, first, n }; if (!umap) return NULL; if (type != isl_dim_param) isl_die(isl_union_map_get_ctx(umap), isl_error_invalid, "can only project out parameters", return isl_union_map_free(umap)); space = isl_union_map_get_space(umap); space = isl_space_drop_dims(space, type, first, n); data.res = isl_union_map_empty(space); if (isl_union_map_foreach_map(umap, &project_out, &data) < 0) data.res = isl_union_map_free(data.res); isl_union_map_free(umap); return data.res; } /* Turn the "n" dimensions of type "type", starting at "first" * into existentially quantified variables. * Since the space of an isl_union_set only contains parameters, * "type" is required to be equal to isl_dim_param. */ __isl_give isl_union_set *isl_union_set_project_out( __isl_take isl_union_set *uset, enum isl_dim_type type, unsigned first, unsigned n) { return isl_union_map_project_out(uset, type, first, n); } /* Internal data structure for isl_union_map_involves_dims. * "first" and "n" are the arguments for the isl_map_involves_dims calls. */ struct isl_union_map_involves_dims_data { unsigned first; unsigned n; }; /* Does "map" _not_ involve the data->n parameters starting at data->first? */ static isl_bool map_excludes(__isl_keep isl_map *map, void *user) { struct isl_union_map_involves_dims_data *data = user; isl_bool involves; involves = isl_map_involves_dims(map, isl_dim_param, data->first, data->n); if (involves < 0) return isl_bool_error; return !involves; } /* Does "umap" involve any of the n parameters starting at first? * "type" is required to be set to isl_dim_param. * * "umap" involves any of those parameters if any of its maps * involve the parameters. In other words, "umap" does not * involve any of the parameters if all its maps to not * involve the parameters. */ isl_bool isl_union_map_involves_dims(__isl_keep isl_union_map *umap, enum isl_dim_type type, unsigned first, unsigned n) { struct isl_union_map_involves_dims_data data = { first, n }; isl_bool excludes; if (type != isl_dim_param) isl_die(isl_union_map_get_ctx(umap), isl_error_invalid, "can only reference parameters", return isl_bool_error); excludes = union_map_forall_user(umap, &map_excludes, &data); if (excludes < 0) return isl_bool_error; return !excludes; } /* Internal data structure for isl_union_map_reset_range_space. * "range" is the space from which to set the range space. * "res" collects the results. */ struct isl_union_map_reset_range_space_data { isl_space *range; isl_union_map *res; }; /* Replace the range space of "map" by the range space of data->range and * add the result to data->res. */ static isl_stat reset_range_space(__isl_take isl_map *map, void *user) { struct isl_union_map_reset_range_space_data *data = user; isl_space *space; space = isl_map_get_space(map); space = isl_space_domain(space); space = isl_space_extend_domain_with_range(space, isl_space_copy(data->range)); map = isl_map_reset_space(map, space); data->res = isl_union_map_add_map(data->res, map); return data->res ? isl_stat_ok : isl_stat_error; } /* Replace the range space of all the maps in "umap" by * the range space of "space". * * This assumes that all maps have the same output dimension. * This function should therefore not be made publicly available. * * Since the spaces of the maps change, so do their hash value. * We therefore need to create a new isl_union_map. */ __isl_give isl_union_map *isl_union_map_reset_range_space( __isl_take isl_union_map *umap, __isl_take isl_space *space) { struct isl_union_map_reset_range_space_data data = { space }; data.res = isl_union_map_empty(isl_union_map_get_space(umap)); if (isl_union_map_foreach_map(umap, &reset_range_space, &data) < 0) data.res = isl_union_map_free(data.res); isl_space_free(space); isl_union_map_free(umap); return data.res; } /* Internal data structure for isl_union_map_order_at_multi_union_pw_aff. * "mupa" is the function from which the isl_multi_pw_affs are extracted. * "order" is applied to the extracted isl_multi_pw_affs that correspond * to the domain and the range of each map. * "res" collects the results. */ struct isl_union_order_at_data { isl_multi_union_pw_aff *mupa; __isl_give isl_map *(*order)(__isl_take isl_multi_pw_aff *mpa1, __isl_take isl_multi_pw_aff *mpa2); isl_union_map *res; }; /* Intersect "map" with the result of applying data->order to * the functions in data->mupa that apply to the domain and the range * of "map" and add the result to data->res. */ static isl_stat order_at(__isl_take isl_map *map, void *user) { struct isl_union_order_at_data *data = user; isl_space *space; isl_multi_pw_aff *mpa1, *mpa2; isl_map *order; space = isl_space_domain(isl_map_get_space(map)); mpa1 = isl_multi_union_pw_aff_extract_multi_pw_aff(data->mupa, space); space = isl_space_range(isl_map_get_space(map)); mpa2 = isl_multi_union_pw_aff_extract_multi_pw_aff(data->mupa, space); order = data->order(mpa1, mpa2); map = isl_map_intersect(map, order); data->res = isl_union_map_add_map(data->res, map); return data->res ? isl_stat_ok : isl_stat_error; } /* Intersect each map in "umap" with the result of calling "order" * on the functions is "mupa" that apply to the domain and the range * of the map. */ static __isl_give isl_union_map *isl_union_map_order_at_multi_union_pw_aff( __isl_take isl_union_map *umap, __isl_take isl_multi_union_pw_aff *mupa, __isl_give isl_map *(*order)(__isl_take isl_multi_pw_aff *mpa1, __isl_take isl_multi_pw_aff *mpa2)) { struct isl_union_order_at_data data; umap = isl_union_map_align_params(umap, isl_multi_union_pw_aff_get_space(mupa)); mupa = isl_multi_union_pw_aff_align_params(mupa, isl_union_map_get_space(umap)); data.mupa = mupa; data.order = order; data.res = isl_union_map_empty(isl_union_map_get_space(umap)); if (isl_union_map_foreach_map(umap, &order_at, &data) < 0) data.res = isl_union_map_free(data.res); isl_multi_union_pw_aff_free(mupa); isl_union_map_free(umap); return data.res; } /* Return the subset of "umap" where the domain and the range * have equal "mupa" values. */ __isl_give isl_union_map *isl_union_map_eq_at_multi_union_pw_aff( __isl_take isl_union_map *umap, __isl_take isl_multi_union_pw_aff *mupa) { return isl_union_map_order_at_multi_union_pw_aff(umap, mupa, &isl_multi_pw_aff_eq_map); } /* Return the subset of "umap" where the domain has a lexicographically * smaller "mupa" value than the range. */ __isl_give isl_union_map *isl_union_map_lex_lt_at_multi_union_pw_aff( __isl_take isl_union_map *umap, __isl_take isl_multi_union_pw_aff *mupa) { return isl_union_map_order_at_multi_union_pw_aff(umap, mupa, &isl_multi_pw_aff_lex_lt_map); } /* Return the subset of "umap" where the domain has a lexicographically * greater "mupa" value than the range. */ __isl_give isl_union_map *isl_union_map_lex_gt_at_multi_union_pw_aff( __isl_take isl_union_map *umap, __isl_take isl_multi_union_pw_aff *mupa) { return isl_union_map_order_at_multi_union_pw_aff(umap, mupa, &isl_multi_pw_aff_lex_gt_map); } /* Return the union of the elements in the list "list". */ __isl_give isl_union_set *isl_union_set_list_union( __isl_take isl_union_set_list *list) { int i, n; isl_ctx *ctx; isl_space *space; isl_union_set *res; if (!list) return NULL; ctx = isl_union_set_list_get_ctx(list); space = isl_space_params_alloc(ctx, 0); res = isl_union_set_empty(space); n = isl_union_set_list_n_union_set(list); for (i = 0; i < n; ++i) { isl_union_set *uset_i; uset_i = isl_union_set_list_get_union_set(list, i); res = isl_union_set_union(res, uset_i); } isl_union_set_list_free(list); return res; } cloog-0.18.4/isl/isl_input.c0000644000175000017500000026541612554427055012620 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 #include #include #include #include #include "isl_polynomial_private.h" #include #include #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(__isl_keep 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(__isl_keep 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; 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(__isl_keep 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(__isl_keep 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(__isl_keep isl_stream *s, __isl_take isl_space *space, struct vars *v); static __isl_give isl_pw_aff_list *accept_affine_list(__isl_keep isl_stream *s, __isl_take isl_space *dim, struct vars *v); static __isl_give isl_pw_aff *accept_minmax(__isl_keep 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(__isl_keep 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(__isl_keep 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)); } /* Return a piecewise affine expression defined on the specified domain * that represents NaN. */ static __isl_give isl_pw_aff *nan_on_domain(__isl_keep isl_space *space) { isl_local_space *ls; ls = isl_local_space_from_space(isl_space_copy(space)); return isl_pw_aff_nan_on_domain(ls); } static __isl_give isl_pw_aff *accept_affine(__isl_keep isl_stream *s, __isl_take isl_space *space, 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(space)); 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(space), 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(space), 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 if (tok->type == ISL_TOKEN_NAN) { res = isl_pw_aff_add(res, nan_on_domain(space)); } else { isl_stream_error(s, tok, "unexpected isl_token"); isl_stream_push_token(s, tok); isl_pw_aff_free(res); isl_space_free(space); 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(space); return res; error: isl_space_free(space); 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(__isl_keep isl_stream *s, struct vars *v, __isl_take isl_map *map, int rational); static __isl_give isl_pw_aff *accept_extended_affine(__isl_keep 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(__isl_keep 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; } /* Set *line and *col to those of the next token, if any. */ static void set_current_line_col(__isl_keep isl_stream *s, int *line, int *col) { struct isl_token *tok; tok = isl_stream_next_token(s); if (!tok) return; *line = tok->line; *col = tok->col; isl_stream_push_token(s, tok); } /* Push a token encapsulating "pa" onto "s", with the given * line and column. */ static int push_aff(__isl_keep isl_stream *s, int line, int col, __isl_take isl_pw_aff *pa) { struct isl_token *tok; tok = isl_token_new(s->ctx, line, col, 0); if (!tok) goto error; tok->type = ISL_TOKEN_AFF; tok->u.pwaff = pa; isl_stream_push_token(s, tok); return 0; error: isl_pw_aff_free(pa); return -1; } /* 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 expression is part of the first * argument of a ternary operator and try to parse that. */ static __isl_give isl_pw_aff *accept_extended_affine(__isl_keep 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; set_current_line_col(s, &line, &col); 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; space = isl_pw_aff_get_domain_space(pwaff); cond = isl_map_universe(isl_space_unwrap(space)); if (push_aff(s, line, col, pwaff) < 0) cond = isl_map_free(cond); if (!cond) return NULL; cond = read_formula(s, v, cond, rational); return accept_ternary(s, cond, v, rational); } static __isl_give isl_map *read_var_def(__isl_keep 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(__isl_keep 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(__isl_keep 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(__isl_keep 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; } /* 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; } /* Set the name of dimension "pos" in "space" 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_space *space_set_dim_name(__isl_take isl_space *space, int pos, char *name) { char *prime; if (!name) return space; prime = strchr(name, '\''); if (prime) *prime = '\0'; space = isl_space_set_dim_name(space, isl_dim_out, pos, name); if (prime) *prime = '\''; return space; } /* Accept a piecewise affine expression. * * At the outer level, the piecewise affine expression may be of the form * * aff1 : condition1; aff2 : conditions2; ... * * or simply * * aff * * each of the affine expressions may in turn include ternary operators. * * There may be parentheses around some subexpression of "aff1" * around "aff1" itself, around "aff1 : condition1" and/or * around the entire piecewise affine expression. * We therefore remove the opening parenthesis (if any) from the stream * in case the closing parenthesis follows the colon, but if the closing * parenthesis is the first thing in the stream after the parsed affine * expression, we push the parsed expression onto the stream and parse * again in case the parentheses enclose some subexpression of "aff1". */ static __isl_give isl_pw_aff *accept_piecewise_affine(__isl_keep isl_stream *s, __isl_take isl_space *space, struct vars *v, int rational) { isl_pw_aff *res; isl_space *res_space; res_space = isl_space_from_domain(isl_space_copy(space)); res_space = isl_space_add_dims(res_space, isl_dim_out, 1); res = isl_pw_aff_empty(res_space); do { isl_pw_aff *pa; int seen_paren; int line = -1, col = -1; set_current_line_col(s, &line, &col); seen_paren = isl_stream_eat_if_available(s, '('); if (seen_paren) pa = accept_piecewise_affine(s, isl_space_copy(space), v, rational); else pa = accept_extended_affine(s, isl_space_copy(space), v, rational); if (seen_paren && isl_stream_eat_if_available(s, ')')) { seen_paren = 0; if (push_aff(s, line, col, pa) < 0) goto error; pa = accept_extended_affine(s, isl_space_copy(space), v, rational); } if (isl_stream_eat_if_available(s, ':')) { isl_space *dom_space; isl_set *dom; dom_space = isl_pw_aff_get_domain_space(pa); dom = isl_set_universe(dom_space); dom = read_formula(s, v, dom, rational); pa = isl_pw_aff_intersect_domain(pa, dom); } res = isl_pw_aff_union_add(res, pa); if (seen_paren && isl_stream_eat(s, ')')) goto error; } while (isl_stream_eat_if_available(s, ';')); isl_space_free(space); return res; error: isl_space_free(space); return isl_pw_aff_free(res); } /* Read an affine expression from "s" for use in read_tuple. * * accept_extended_affine requires a wrapped space as input. * read_tuple on the other hand expects each isl_pw_aff * to have an anonymous space. We therefore adjust the space * of the isl_pw_aff before returning it. */ static __isl_give isl_pw_aff *read_tuple_var_def(__isl_keep isl_stream *s, 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_piecewise_affine(s, space, v, rational); space = isl_space_set_alloc(s->ctx, 0, v->n); def = isl_pw_aff_reset_domain_space(def, space); return def; } /* Read a list of tuple elements by calling "read_el" on each of them and * return a space with the same number of set dimensions derived from * the parameter space "space" and possibly updated by "read_el". * The elements in the list are separated by either "," or "][". * If "comma" is set then only "," is allowed. */ static __isl_give isl_space *read_tuple_list(__isl_keep isl_stream *s, struct vars *v, __isl_take isl_space *space, int rational, int comma, __isl_give isl_space *(*read_el)(__isl_keep isl_stream *s, struct vars *v, __isl_take isl_space *space, int rational, void *user), void *user) { if (!space) return NULL; space = isl_space_set_from_params(space); if (isl_stream_next_token_is(s, ']')) return space; for (;;) { struct isl_token *tok; space = isl_space_add_dims(space, isl_dim_set, 1); space = read_el(s, v, space, rational, user); if (!space) return NULL; 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 != ',') { if (tok) isl_stream_push_token(s, tok); break; } isl_token_free(tok); } return space; } /* Read a tuple space from "s" derived from the parameter space "space". * Call "read_el" on each element in the tuples. */ static __isl_give isl_space *read_tuple_space(__isl_keep isl_stream *s, struct vars *v, __isl_take isl_space *space, int rational, int comma, __isl_give isl_space *(*read_el)(__isl_keep isl_stream *s, struct vars *v, __isl_take isl_space *space, int rational, void *user), void *user) { struct isl_token *tok; char *name = NULL; isl_space *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_space *out; res = read_tuple_space(s, v, isl_space_copy(space), rational, comma, read_el, user); if (isl_stream_eat(s, ISL_TOKEN_TO)) goto error; out = read_tuple_space(s, v, isl_space_copy(space), rational, comma, read_el, user); res = isl_space_range_product(res, out); } else res = read_tuple_list(s, v, isl_space_copy(space), rational, comma, read_el, user); if (isl_stream_eat(s, ']')) goto error; if (name) { res = isl_space_set_tuple_name(res, isl_dim_set, name); free(name); } isl_space_free(space); return res; error: free(name); isl_space_free(res); isl_space_free(space); return NULL; } /* Construct an isl_pw_aff defined on a space with v->n variables * that is equal to the last of those variables. */ static __isl_give isl_pw_aff *identity_tuple_el(struct vars *v) { isl_space *space; isl_aff *aff; space = isl_space_set_alloc(v->ctx, 0, v->n); 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, 1); return isl_pw_aff_from_aff(aff); } /* This function is called for each element in a tuple inside read_tuple. * Add a new variable to "v" and construct a corresponding isl_pw_aff defined * over a space containing all variables in "v" defined so far. * The isl_pw_aff expresses the new variable in terms of earlier variables * if a definition is provided. Otherwise, it is represented as being * equal to itself. * Add the isl_pw_aff to *list. * If the new variable was named, then adjust "space" accordingly and * return the updated space. */ static __isl_give isl_space *read_tuple_pw_aff_el(__isl_keep isl_stream *s, struct vars *v, __isl_take isl_space *space, int rational, void *user) { isl_pw_aff_list **list = (isl_pw_aff_list **) user; isl_pw_aff *pa; struct isl_token *tok; int new_name = 0; tok = next_token(s); if (!tok) { isl_stream_error(s, NULL, "unexpected EOF"); return isl_space_free(space); } 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); pa = identity_tuple_el(v); } else if (new_name) { int pos = isl_space_dim(space, isl_dim_out) - 1; space = space_set_dim_name(space, pos, v->v->name); isl_token_free(tok); if (isl_stream_eat_if_available(s, '=')) pa = read_tuple_var_def(s, v, rational); else pa = identity_tuple_el(v); } else { isl_stream_push_token(s, tok); tok = NULL; if (vars_add_anon(v) < 0) goto error; pa = read_tuple_var_def(s, v, rational); } *list = isl_pw_aff_list_add(*list, pa); if (!*list) return isl_space_free(space); return space; error: isl_token_free(tok); return isl_space_free(space); } /* Read a tuple and represent it as an isl_multi_pw_aff. * The range space of the isl_multi_pw_aff 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", * including the variables in the range. * 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. * * The elements in the tuple are collected in a list by read_tuple_pw_aff_el. * Each element in this list is defined over a space representing * the variables defined so far. We need to adjust the earlier * elements to have as many variables in the domain as the final * element in the list. */ static __isl_give isl_multi_pw_aff *read_tuple(__isl_keep isl_stream *s, struct vars *v, int rational, int comma) { int i, n; isl_space *space; isl_pw_aff_list *list; space = isl_space_params_alloc(v->ctx, 0); list = isl_pw_aff_list_alloc(s->ctx, 0); space = read_tuple_space(s, v, space, rational, comma, &read_tuple_pw_aff_el, &list); n = isl_space_dim(space, isl_dim_set); for (i = 0; i + 1 < n; ++i) { isl_pw_aff *pa; pa = isl_pw_aff_list_get_pw_aff(list, i); pa = isl_pw_aff_add_dims(pa, isl_dim_in, n - (i + 1)); list = isl_pw_aff_list_set_pw_aff(list, i, pa); } space = isl_space_from_range(space); space = isl_space_add_dims(space, isl_dim_in, v->n); return isl_multi_pw_aff_from_pw_aff_list(space, list); } /* Add the tuple represented by the isl_multi_pw_aff "tuple" to "map". * 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 *map_from_tuple(__isl_take isl_multi_pw_aff *tuple, __isl_take isl_map *map, enum isl_dim_type type, struct vars *v, int rational) { int i, n; isl_ctx *ctx; isl_space *space = NULL; if (!map || !tuple) goto error; ctx = isl_multi_pw_aff_get_ctx(tuple); 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(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(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; } /* Read a tuple from "s" and add it to "map". * The tuple is initially represented as an isl_multi_pw_aff and * then added to "map". */ static __isl_give isl_map *read_map_tuple(__isl_keep isl_stream *s, __isl_take isl_map *map, enum isl_dim_type type, struct vars *v, int rational, int comma) { isl_multi_pw_aff *tuple; tuple = read_tuple(s, v, rational, comma); if (!tuple) return isl_map_free(map); return map_from_tuple(tuple, map, type, v, rational); } 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(__isl_keep 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(__isl_keep 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(__isl_keep 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(__isl_keep 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(__isl_keep 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(__isl_keep 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(__isl_keep 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( __isl_keep isl_stream *s, __isl_take isl_basic_map *bmap) { int j; struct isl_token *tok; int type; int k; isl_int *c; if (!bmap) return NULL; 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( __isl_keep 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(__isl_keep 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(__isl_keep 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(__isl_keep isl_stream *s, __isl_keep isl_map *map, struct vars *v); static __isl_give isl_pw_qpolynomial *read_factor(__isl_keep 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(__isl_keep 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(__isl_keep 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(__isl_keep 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(__isl_keep 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(__isl_keep 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(__isl_keep 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(__isl_keep isl_stream *s, struct isl_obj obj1, struct isl_obj obj2) { if (obj1.type == isl_obj_set && obj2.type == isl_obj_union_set) obj1 = to_union(s->ctx, obj1); if (obj1.type == isl_obj_union_set && obj2.type == isl_obj_set) obj2 = to_union(s->ctx, obj2); if (obj1.type == isl_obj_map && obj2.type == isl_obj_union_map) obj1 = to_union(s->ctx, obj1); if (obj1.type == isl_obj_union_map && obj2.type == isl_obj_map) obj2 = to_union(s->ctx, obj2); if (obj1.type == isl_obj_pw_qpolynomial && obj2.type == isl_obj_union_pw_qpolynomial) obj1 = to_union(s->ctx, obj1); if (obj1.type == isl_obj_union_pw_qpolynomial && obj2.type == isl_obj_pw_qpolynomial) obj2 = to_union(s->ctx, obj2); if (obj1.type == isl_obj_pw_qpolynomial_fold && obj2.type == isl_obj_union_pw_qpolynomial_fold) obj1 = to_union(s->ctx, obj1); if (obj1.type == isl_obj_union_pw_qpolynomial_fold && obj2.type == isl_obj_pw_qpolynomial_fold) obj2 = to_union(s->ctx, obj2); if (obj1.type != obj2.type) { isl_stream_error(s, NULL, "attempt to combine incompatible objects"); goto error; } if (!obj1.type->add) isl_die(s->ctx, isl_error_internal, "combination not supported on object type", goto error); if (obj1.type == isl_obj_map && !isl_map_has_equal_space(obj1.v, obj2.v)) { obj1 = to_union(s->ctx, obj1); obj2 = to_union(s->ctx, obj2); } if (obj1.type == isl_obj_set && !isl_set_has_equal_space(obj1.v, obj2.v)) { obj1 = to_union(s->ctx, obj1); obj2 = to_union(s->ctx, obj2); } if (obj1.type == isl_obj_pw_qpolynomial && !isl_pw_qpolynomial_has_equal_space(obj1.v, obj2.v)) { obj1 = to_union(s->ctx, obj1); obj2 = to_union(s->ctx, obj2); } if (obj1.type == isl_obj_pw_qpolynomial_fold && !isl_pw_qpolynomial_fold_has_equal_space(obj1.v, obj2.v)) { obj1 = to_union(s->ctx, obj1); obj2 = to_union(s->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; } /* Are the first two tokens on "s", "domain" (either as a string * or as an identifier) followed by ":"? */ static int next_is_domain_colon(__isl_keep isl_stream *s) { struct isl_token *tok; char *name; int res; tok = isl_stream_next_token(s); if (!tok) return 0; if (tok->type != ISL_TOKEN_IDENT && tok->type != ISL_TOKEN_STRING) { isl_stream_push_token(s, tok); return 0; } name = isl_token_get_str(s->ctx, tok); res = !strcmp(name, "domain") && isl_stream_next_token_is(s, ':'); free(name); isl_stream_push_token(s, tok); return res; } /* Do the first tokens on "s" look like a schedule? * * The root of a schedule is always a domain node, so the first thing * we expect in the stream is a domain key, i.e., "domain" followed * by ":". If the schedule was printed in YAML flow style, then * we additionally expect a "{" to open the outer mapping. */ static int next_is_schedule(__isl_keep isl_stream *s) { struct isl_token *tok; int is_schedule; tok = isl_stream_next_token(s); if (!tok) return 0; if (tok->type != '{') { isl_stream_push_token(s, tok); return next_is_domain_colon(s); } is_schedule = next_is_domain_colon(s); isl_stream_push_token(s, tok); return is_schedule; } /* Read an isl_schedule from "s" and store it in an isl_obj. */ static struct isl_obj schedule_read(__isl_keep isl_stream *s) { struct isl_obj obj; obj.type = isl_obj_schedule; obj.v = isl_stream_read_schedule(s); return obj; } static struct isl_obj obj_read(__isl_keep isl_stream *s) { isl_map *map = NULL; struct isl_token *tok; struct vars *v = NULL; struct isl_obj obj = { isl_obj_set, NULL }; if (next_is_schedule(s)) return schedule_read(s); 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_val; obj.v = isl_val_int_from_isl_int(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, 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(__isl_keep isl_stream *s) { return obj_read(s); } __isl_give isl_map *isl_stream_read_map(__isl_keep 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(__isl_keep 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(__isl_keep 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(__isl_keep 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(__isl_keep isl_stream *s) { struct isl_obj obj; struct isl_map *map; struct isl_basic_map *bmap; obj = obj_read(s); if (obj.v && (obj.type != isl_obj_map && obj.type != isl_obj_set)) isl_die(s->ctx, isl_error_invalid, "not a (basic) set or map", goto error); map = obj.v; if (!map) return NULL; if (map->n > 1) isl_die(s->ctx, isl_error_invalid, "set or map description involves " "more than one disjunct", goto error); if (map->n == 0) bmap = isl_basic_map_empty(isl_map_get_space(map)); else bmap = isl_basic_map_copy(map->p[0]); isl_map_free(map); return bmap; error: obj.type->free(obj.v); return NULL; } static __isl_give isl_basic_set *basic_set_read(__isl_keep 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; 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; 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; 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; 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; 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; 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; 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; 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; 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; 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; 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; 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(__isl_keep 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(__isl_keep 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; 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( __isl_keep 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; 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; 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(__isl_keep 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(__isl_keep 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(__isl_keep 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(__isl_keep 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(__isl_keep 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; 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; 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( __isl_keep 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; 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( __isl_keep 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; 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; } /* This function is called for each element in a tuple inside * isl_stream_read_multi_val. * Read an isl_val from "s" and add it to *list. */ static __isl_give isl_space *read_val_el(__isl_keep isl_stream *s, struct vars *v, __isl_take isl_space *space, int rational, void *user) { isl_val_list **list = (isl_val_list **) user; isl_val *val; val = isl_stream_read_val(s); *list = isl_val_list_add(*list, val); if (!*list) return isl_space_free(space); return space; } /* Read an isl_multi_val from "s". * * We first read a tuple space, collecting the element values in a list. * Then we create an isl_multi_val from the space and the isl_val_list. */ __isl_give isl_multi_val *isl_stream_read_multi_val(__isl_keep isl_stream *s) { struct vars *v; isl_set *dom = NULL; isl_space *space; isl_multi_val *mv = NULL; isl_val_list *list; 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; space = isl_set_get_space(dom); list = isl_val_list_alloc(s->ctx, 0); space = read_tuple_space(s, v, space, 1, 0, &read_val_el, &list); mv = isl_multi_val_from_val_list(space, list); if (isl_stream_eat(s, '}')) goto error; vars_free(v); isl_set_free(dom); return mv; error: vars_free(v); isl_set_free(dom); isl_multi_val_free(mv); return NULL; } /* Read an isl_multi_val from "str". */ __isl_give isl_multi_val *isl_multi_val_read_from_str(isl_ctx *ctx, const char *str) { isl_multi_val *mv; isl_stream *s = isl_stream_new_str(ctx, str); if (!s) return NULL; mv = isl_stream_read_multi_val(s); isl_stream_free(s); return mv; } /* Read a multi-affine expression from "s". * If the multi-affine expression has a domain, then the 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(__isl_keep 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; 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; } /* Read an isl_multi_pw_aff from "s". * * The input format is similar to that of map, except that any conditions * on the domains should be specified inside the tuple since each * piecewise affine expression may have a different domain. * * Since we do not know in advance if the isl_multi_pw_aff lives * in a set or a map space, we first read the first tuple and check * if it is followed by a "->". If so, we convert the tuple into * the domain of the isl_multi_pw_aff and read in the next tuple. * This tuple (or the first tuple if it was not followed by a "->") * is then converted into the isl_multi_pw_aff. * * Note that the function read_tuple accepts tuples where some output or * set dimensions are defined in terms of other output or set dimensions * since this function is also used to read maps. As a special case, * read_tuple also accept dimensions that are defined in terms of themselves * (i.e., that are not defined). * These cases are not allowed when reading am isl_multi_pw_aff so we check * that the definition of the output/set dimensions does not involve any * output/set dimensions. * We then drop the output dimensions from the domain of the result * of read_tuple (which is of the form [input, output] -> [output], * with anonymous domain) and reset the space. */ __isl_give isl_multi_pw_aff *isl_stream_read_multi_pw_aff( __isl_keep 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_pw_aff *mpa = 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_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_map *map = map_from_tuple(tuple, dom, isl_dim_in, v, 0); dom = isl_map_domain(map); 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); mpa = isl_multi_pw_aff_alloc(space); for (i = 0; i < n; ++i) { isl_pw_aff *pa; pa = isl_multi_pw_aff_get_pw_aff(tuple, i); if (!pa) goto error; if (isl_pw_aff_involves_dims(pa, isl_dim_in, dim, i + 1)) { isl_pw_aff_free(pa); isl_die(s->ctx, isl_error_invalid, "not an affine expression", goto error); } pa = isl_pw_aff_drop_dims(pa, isl_dim_in, dim, n); space = isl_multi_pw_aff_get_domain_space(mpa); pa = isl_pw_aff_reset_domain_space(pa, space); mpa = isl_multi_pw_aff_set_pw_aff(mpa, i, pa); } isl_multi_pw_aff_free(tuple); vars_free(v); mpa = isl_multi_pw_aff_intersect_domain(mpa, dom); return mpa; error: isl_multi_pw_aff_free(tuple); vars_free(v); isl_set_free(dom); isl_multi_pw_aff_free(mpa); return NULL; } /* Read an isl_multi_pw_aff from "str". */ __isl_give isl_multi_pw_aff *isl_multi_pw_aff_read_from_str(isl_ctx *ctx, const char *str) { isl_multi_pw_aff *mpa; isl_stream *s = isl_stream_new_str(ctx, str); if (!s) return NULL; mpa = isl_stream_read_multi_pw_aff(s); isl_stream_free(s); return mpa; } /* Read the body of an isl_union_pw_aff from "s" with parameter domain "dom". */ static __isl_give isl_union_pw_aff *read_union_pw_aff_with_dom( __isl_keep isl_stream *s, __isl_take isl_set *dom, struct vars *v) { isl_pw_aff *pa; isl_union_pw_aff *upa = NULL; isl_set *aff_dom; int n; 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); upa = isl_union_pw_aff_from_pw_aff(pa); while (isl_stream_eat_if_available(s, ';')) { isl_pw_aff *pa_i; isl_union_pw_aff *upa_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); upa_i = isl_union_pw_aff_from_pw_aff(pa_i); upa = isl_union_pw_aff_union_add(upa, upa_i); } isl_set_free(dom); return upa; } /* This function is called for each element in a tuple inside * isl_stream_read_multi_union_pw_aff. * * Read a '{', the union piecewise affine expression body and a '}' and * add the isl_union_pw_aff to *list. */ static __isl_give isl_space *read_union_pw_aff_el(__isl_keep isl_stream *s, struct vars *v, __isl_take isl_space *space, int rational, void *user) { isl_set *dom; isl_union_pw_aff *upa; isl_union_pw_aff_list **list = (isl_union_pw_aff_list **) user; dom = isl_set_universe(isl_space_params(isl_space_copy(space))); if (isl_stream_eat(s, '{')) goto error; upa = read_union_pw_aff_with_dom(s, dom, v); *list = isl_union_pw_aff_list_add(*list, upa); if (isl_stream_eat(s, '}')) return isl_space_free(space); if (!*list) return isl_space_free(space); return space; error: isl_set_free(dom); return isl_space_free(space); } /* Do the next tokens in "s" correspond to an empty tuple? * In particular, does the stream start with a '[', followed by a ']', * not followed by a "->"? */ static int next_is_empty_tuple(__isl_keep isl_stream *s) { struct isl_token *tok, *tok2, *tok3; int is_empty_tuple = 0; tok = isl_stream_next_token(s); if (!tok) return 0; if (tok->type != '[') { isl_stream_push_token(s, tok); return 0; } tok2 = isl_stream_next_token(s); if (tok2 && tok2->type == ']') { tok3 = isl_stream_next_token(s); is_empty_tuple = !tok || tok->type != ISL_TOKEN_TO; if (tok3) isl_stream_push_token(s, tok3); } if (tok2) isl_stream_push_token(s, tok2); isl_stream_push_token(s, tok); return is_empty_tuple; } /* Do the next tokens in "s" correspond to a tuple of parameters? * In particular, does the stream start with a '[' that is not * followed by a '{' or a nested tuple? */ static int next_is_param_tuple(__isl_keep isl_stream *s) { struct isl_token *tok, *tok2; int is_tuple; tok = isl_stream_next_token(s); if (!tok) return 0; if (tok->type != '[' || next_is_tuple(s)) { isl_stream_push_token(s, tok); return 0; } tok2 = isl_stream_next_token(s); is_tuple = tok2 && tok2->type != '{'; if (tok2) isl_stream_push_token(s, tok2); isl_stream_push_token(s, tok); return is_tuple; } /* Read an isl_multi_union_pw_aff from "s". * * The input has the form * * [{ [..] : ... ; [..] : ... }, { [..] : ... ; [..] : ... }] * * or * * [..] -> [{ [..] : ... ; [..] : ... }, { [..] : ... ; [..] : ... }] * * We first check for the special case of an empty tuple "[]". * Then we check if there are any parameters. * Finally, we read the tuple, collecting the individual isl_union_pw_aff * elements in a list and construct the result from the tuple space and * the list. */ __isl_give isl_multi_union_pw_aff *isl_stream_read_multi_union_pw_aff( __isl_keep isl_stream *s) { struct vars *v; isl_set *dom = NULL; isl_space *space; isl_multi_union_pw_aff *mupa = NULL; isl_union_pw_aff_list *list; if (next_is_empty_tuple(s)) { if (isl_stream_eat(s, '[')) return NULL; if (isl_stream_eat(s, ']')) return NULL; space = isl_space_set_alloc(s->ctx, 0, 0); return isl_multi_union_pw_aff_zero(space); } v = vars_new(s->ctx); if (!v) return NULL; dom = isl_set_universe(isl_space_params_alloc(s->ctx, 0)); if (next_is_param_tuple(s)) { dom = read_map_tuple(s, dom, isl_dim_param, v, 1, 0); if (isl_stream_eat(s, ISL_TOKEN_TO)) goto error; } space = isl_set_get_space(dom); isl_set_free(dom); list = isl_union_pw_aff_list_alloc(s->ctx, 0); space = read_tuple_space(s, v, space, 1, 0, &read_union_pw_aff_el, &list); mupa = isl_multi_union_pw_aff_from_union_pw_aff_list(space, list); vars_free(v); return mupa; error: vars_free(v); isl_set_free(dom); isl_multi_union_pw_aff_free(mupa); return NULL; } /* Read an isl_multi_union_pw_aff from "str". */ __isl_give isl_multi_union_pw_aff *isl_multi_union_pw_aff_read_from_str( isl_ctx *ctx, const char *str) { isl_multi_union_pw_aff *mupa; isl_stream *s = isl_stream_new_str(ctx, str); if (!s) return NULL; mupa = isl_stream_read_multi_union_pw_aff(s); isl_stream_free(s); return mupa; } __isl_give isl_union_pw_qpolynomial *isl_stream_read_union_pw_qpolynomial( __isl_keep 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; 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.4/isl/isl.py0000644000175000017500000000754312413256472011577 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.4/isl/isl_local_space_private.h0000644000175000017500000000513312413270107015435 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_div_is_known(__isl_keep isl_local_space *ls, int 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); __isl_give isl_local_space *isl_local_space_move_dims( __isl_take isl_local_space *ls, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, unsigned n); int isl_local_space_cmp(__isl_keep isl_local_space *ls1, __isl_keep isl_local_space *ls2); #endif cloog-0.18.4/isl/configure.ac0000644000175000017500000001767412554427055012735 00000000000000AC_INIT([isl], [0.15], [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=15:0:0 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) AC_ARG_WITH([int], [AS_HELP_STRING([--with-int=gmp|imath], [Which package to use to represent multi-precision integers [default=gmp]])], [], [with_int=gmp]) case "$with_int" in gmp|imath) ;; *) AC_MSG_ERROR([bad value ${withval} for --with-int (use gmp or imath)]) esac AC_SUBST(MP_CPPFLAGS) AC_SUBST(MP_LDFLAGS) AC_SUBST(MP_LIBS) case "$with_int" in gmp) AX_DETECT_GMP ;; imath) AX_DETECT_IMATH ;; esac AM_CONDITIONAL(IMATH_FOR_MP, test x$with_int = ximath) AM_CONDITIONAL(GMP_FOR_MP, test x$with_int = xgmp) AC_CHECK_DECLS(ffs,[],[],[#include ]) AC_CHECK_DECLS(__builtin_ffs,[],[],[]) 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` systemlibs=`$llvm_config --system-libs 2> /dev/null | tail -1` if test $? -eq 0; then CLANG_LIBS="$CLANG_LIBS $systemlibs" fi 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_TRY_COMPILE([#include ], [ using namespace clang; DiagnosticsEngine *Diags; new driver::Driver("", "", "", *Diags); ], [AC_DEFINE([DRIVER_CTOR_TAKES_DEFAULTIMAGENAME], [], [Define if Driver constructor takes default image name])]) 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; std::shared_ptr TO; DiagnosticsEngine *Diags; TargetInfo::CreateTargetInfo(*Diags, TO); ], [AC_DEFINE([CREATETARGETINFO_TAKES_SHARED_PTR], [], [Define if TargetInfo::CreateTargetInfo takes shared_ptr])]) 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_EGREP_HEADER([getNumParams], [clang/AST/CanonicalType.h], [AC_DEFINE([getNumArgs], [getNumParams], [Define to getNumParams for newer versions of clang]) AC_DEFINE([getArgType], [getParamType], [Define to getParamType for newer versions of clang])]) AC_EGREP_HEADER([getReturnType], [clang/AST/CanonicalType.h], [], [AC_DEFINE([getReturnType], [getResultType], [Define to getResultType for older versions of clang])]) AC_TRY_COMPILE([#include ], [ using namespace clang; CompilerInstance *Clang; Clang->createPreprocessor(TU_Complete); ], [AC_DEFINE([CREATEPREPROCESSOR_TAKES_TUKIND], [], [Define if CompilerInstance::createPreprocessor takes TranslationUnitKind])]) AC_EGREP_HEADER([setMainFileID], [clang/Basic/SourceManager.h], [AC_DEFINE([HAVE_SETMAINFILEID], [], [Define if SourceManager has a setMainFileID method])]) AC_CHECK_HEADER([llvm/ADT/OwningPtr.h], [AC_DEFINE([HAVE_ADT_OWNINGPTR_H], [], [Define if llvm/ADT/OwningPtr.h exists])]) 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="$MP_CPPFLAGS" PACKAGE_LDFLAGS="$MP_LDFLAGS" PACKAGE_LIBS="-lisl $MP_LIBS" 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_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.4/isl/isl_point_private.h0000644000175000017500000000035112413256472014327 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.4/isl/isl_band_private.h0000644000175000017500000000250212413270107014071 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. * coincident is an array of length n, indicating whether a scheduling dimension * satisfies the coincidence constraints in the sense that * the corresponding dependence distances are zero. * 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 *coincident; 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.4/isl/isl_tab_pip.c0000644000175000017500000046541612554427055013101 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 #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 || !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); if (isl_tab_add_sample(tab, sample) < 0) goto error; } 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; unsigned n_var; unsigned o_var; 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; } o_var = 1 + tab->n_param; n_var = tab->n_var - tab->n_param - tab->n_div; for (i = 0; i < bmap->n_eq; ++i) { if (max) isl_seq_neg(bmap->eq[i] + o_var, bmap->eq[i] + o_var, n_var); tab = add_lexmin_valid_eq(tab, bmap->eq[i]); if (max) isl_seq_neg(bmap->eq[i] + o_var, bmap->eq[i] + o_var, n_var); 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] + o_var, bmap->ineq[i] + o_var, n_var); tab = add_lexmin_ineq(tab, bmap->ineq[i]); if (max) isl_seq_neg(bmap->ineq[i] + o_var, bmap->ineq[i] + o_var, n_var); 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. * * best is the best row so far (-1 when we have not found any row yet). * best_r is the number of other rows made redundant by row best. * When best is still -1, bset_r is meaningless, but it is initialized * to some arbitrary value (0) anyway. Without this redundant initialization * valgrind may warn about uninitialized memory accesses when isl * is compiled with some versions of gcc. */ 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 = 0; 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 (!sample || 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; } if (isl_tab_add_sample(cgbr->tab, sample) < 0) goto error; 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. * * Return 0 on success and -1 on failure. */ static int 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 0; error: isl_vec_free(eq); isl_tab_free(cgbr->tab); cgbr->tab = NULL; return -1; } static int context_gbr_detect_equalities(struct isl_context *context, struct isl_tab *tab) { struct isl_context_gbr *cgbr = (struct isl_context_gbr *)context; unsigned n_ineq; 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) < 0) return -1; 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) goto error; 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; 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; 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_set *set = NULL; if (!dim || !var) goto error; 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_dims(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) return; 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 || !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_pw_aff *paff = NULL; isl_space *pw_space; isl_local_space *ls = NULL; if (!space || !var) goto error; 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.4/isl/AUTHORS0000644000175000017500000000177412554427055011511 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-2014 Ecole Normale Superieure 45 rue d'Ulm, 75230 Paris France 2014 INRIA Rocquencourt Domaine de Voluceau - Rocquencourt, B.P. 105 78153 Le Chesnay France Contributions by Mythri Alle Riyadh Baghdadi Serge Belyshev Ray Donnelly Johannes Doerfert Tobias Grosser Alexandre Isoard Andreas Kloeckner Michael Kruse Sebastian Pop Louis-Noel Pouchet Uday Kumar Reddy Andreas Simbuerger Sven van Haastregt The merge sort implementation was written by Jeffrey Stedfast. cloog-0.18.4/isl/isl_int_gmp.h0000644000175000017500000000635012413271702013077 00000000000000#ifndef ISL_INT_GMP_H #define ISL_INT_GMP_H #include /* isl_int is the basic integer type, implemented with GMP's mpz_t. 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_si(r,i) mpz_set_si(r,i) #define isl_int_set_ui(r,i) mpz_set_ui(r,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) #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) #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_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_cmp(i,j) mpz_cmpabs(i,j) #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_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) #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 typedef void (*isl_int_print_mp_free_t)(void *, size_t); #define isl_int_free_str(s) \ do { \ isl_int_print_mp_free_t mp_free; \ mp_get_memory_functions(NULL, NULL, &mp_free); \ (*mp_free)(s, strlen(s) + 1); \ } while (0) #endif /* ISL_INT_GMP_H */ cloog-0.18.4/isl/isl_list_templ.h0000644000175000017500000000044312413256472013622 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.4/isl/isl_scheduler.c0000644000175000017500000037402112554427055013430 00000000000000/* * Copyright 2011 INRIA Saclay * Copyright 2012-2014 Ecole Normale Superieure * Copyright 2015 Sven Verdoolaege * * 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 #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". */ enum isl_edge_type { isl_edge_validity = 0, isl_edge_first = isl_edge_validity, isl_edge_coincidence, isl_edge_condition, isl_edge_conditional_validity, isl_edge_proximity, isl_edge_last = isl_edge_proximity }; /* The constraints that need to be satisfied by a schedule on "domain". * * "context" specifies extra constraints on the parameters. * * "validity" constraints map domain elements i to domain elements * that should be scheduled after i. (Hard constraint) * "proximity" constraints map domain elements i to domains elements * that should be scheduled as early as possible after i (or before i). * (Soft constraint) * * "condition" and "conditional_validity" constraints map possibly "tagged" * domain elements i -> s to "tagged" domain elements j -> t. * The elements of the "conditional_validity" constraints, but without the * tags (i.e., the elements i -> j) are treated as validity constraints, * except that during the construction of a tilable band, * the elements of the "conditional_validity" constraints may be violated * provided that all adjacent elements of the "condition" constraints * are local within the band. * A dependence is local within a band if domain and range are mapped * to the same schedule point by the band. */ struct isl_schedule_constraints { isl_union_set *domain; isl_set *context; isl_union_map *constraint[isl_edge_last + 1]; }; __isl_give isl_schedule_constraints *isl_schedule_constraints_copy( __isl_keep isl_schedule_constraints *sc) { isl_ctx *ctx; isl_schedule_constraints *sc_copy; enum isl_edge_type i; ctx = isl_union_set_get_ctx(sc->domain); sc_copy = isl_calloc_type(ctx, struct isl_schedule_constraints); if (!sc_copy) return NULL; sc_copy->domain = isl_union_set_copy(sc->domain); sc_copy->context = isl_set_copy(sc->context); if (!sc_copy->domain || !sc_copy->context) return isl_schedule_constraints_free(sc_copy); for (i = isl_edge_first; i <= isl_edge_last; ++i) { sc_copy->constraint[i] = isl_union_map_copy(sc->constraint[i]); if (!sc_copy->constraint[i]) return isl_schedule_constraints_free(sc_copy); } return sc_copy; } /* Construct an isl_schedule_constraints object for computing a schedule * on "domain". The initial object does not impose any constraints. */ __isl_give isl_schedule_constraints *isl_schedule_constraints_on_domain( __isl_take isl_union_set *domain) { isl_ctx *ctx; isl_space *space; isl_schedule_constraints *sc; isl_union_map *empty; enum isl_edge_type i; if (!domain) return NULL; ctx = isl_union_set_get_ctx(domain); sc = isl_calloc_type(ctx, struct isl_schedule_constraints); if (!sc) goto error; space = isl_union_set_get_space(domain); sc->domain = domain; sc->context = isl_set_universe(isl_space_copy(space)); empty = isl_union_map_empty(space); for (i = isl_edge_first; i <= isl_edge_last; ++i) { sc->constraint[i] = isl_union_map_copy(empty); if (!sc->constraint[i]) sc->domain = isl_union_set_free(sc->domain); } isl_union_map_free(empty); if (!sc->domain || !sc->context) return isl_schedule_constraints_free(sc); return sc; error: isl_union_set_free(domain); return NULL; } /* Replace the context of "sc" by "context". */ __isl_give isl_schedule_constraints *isl_schedule_constraints_set_context( __isl_take isl_schedule_constraints *sc, __isl_take isl_set *context) { if (!sc || !context) goto error; isl_set_free(sc->context); sc->context = context; return sc; error: isl_schedule_constraints_free(sc); isl_set_free(context); return NULL; } /* Replace the validity constraints of "sc" by "validity". */ __isl_give isl_schedule_constraints *isl_schedule_constraints_set_validity( __isl_take isl_schedule_constraints *sc, __isl_take isl_union_map *validity) { if (!sc || !validity) goto error; isl_union_map_free(sc->constraint[isl_edge_validity]); sc->constraint[isl_edge_validity] = validity; return sc; error: isl_schedule_constraints_free(sc); isl_union_map_free(validity); return NULL; } /* Replace the coincidence constraints of "sc" by "coincidence". */ __isl_give isl_schedule_constraints *isl_schedule_constraints_set_coincidence( __isl_take isl_schedule_constraints *sc, __isl_take isl_union_map *coincidence) { if (!sc || !coincidence) goto error; isl_union_map_free(sc->constraint[isl_edge_coincidence]); sc->constraint[isl_edge_coincidence] = coincidence; return sc; error: isl_schedule_constraints_free(sc); isl_union_map_free(coincidence); return NULL; } /* Replace the proximity constraints of "sc" by "proximity". */ __isl_give isl_schedule_constraints *isl_schedule_constraints_set_proximity( __isl_take isl_schedule_constraints *sc, __isl_take isl_union_map *proximity) { if (!sc || !proximity) goto error; isl_union_map_free(sc->constraint[isl_edge_proximity]); sc->constraint[isl_edge_proximity] = proximity; return sc; error: isl_schedule_constraints_free(sc); isl_union_map_free(proximity); return NULL; } /* Replace the conditional validity constraints of "sc" by "condition" * and "validity". */ __isl_give isl_schedule_constraints * isl_schedule_constraints_set_conditional_validity( __isl_take isl_schedule_constraints *sc, __isl_take isl_union_map *condition, __isl_take isl_union_map *validity) { if (!sc || !condition || !validity) goto error; isl_union_map_free(sc->constraint[isl_edge_condition]); sc->constraint[isl_edge_condition] = condition; isl_union_map_free(sc->constraint[isl_edge_conditional_validity]); sc->constraint[isl_edge_conditional_validity] = validity; return sc; error: isl_schedule_constraints_free(sc); isl_union_map_free(condition); isl_union_map_free(validity); return NULL; } __isl_null isl_schedule_constraints *isl_schedule_constraints_free( __isl_take isl_schedule_constraints *sc) { enum isl_edge_type i; if (!sc) return NULL; isl_union_set_free(sc->domain); isl_set_free(sc->context); for (i = isl_edge_first; i <= isl_edge_last; ++i) isl_union_map_free(sc->constraint[i]); free(sc); return NULL; } isl_ctx *isl_schedule_constraints_get_ctx( __isl_keep isl_schedule_constraints *sc) { return sc ? isl_union_set_get_ctx(sc->domain) : NULL; } /* Return the validity constraints of "sc". */ __isl_give isl_union_map *isl_schedule_constraints_get_validity( __isl_keep isl_schedule_constraints *sc) { if (!sc) return NULL; return isl_union_map_copy(sc->constraint[isl_edge_validity]); } /* Return the coincidence constraints of "sc". */ __isl_give isl_union_map *isl_schedule_constraints_get_coincidence( __isl_keep isl_schedule_constraints *sc) { if (!sc) return NULL; return isl_union_map_copy(sc->constraint[isl_edge_coincidence]); } /* Return the conditional validity constraints of "sc". */ __isl_give isl_union_map *isl_schedule_constraints_get_conditional_validity( __isl_keep isl_schedule_constraints *sc) { if (!sc) return NULL; return isl_union_map_copy(sc->constraint[isl_edge_conditional_validity]); } /* Return the conditions for the conditional validity constraints of "sc". */ __isl_give isl_union_map * isl_schedule_constraints_get_conditional_validity_condition( __isl_keep isl_schedule_constraints *sc) { if (!sc) return NULL; return isl_union_map_copy(sc->constraint[isl_edge_condition]); } void isl_schedule_constraints_dump(__isl_keep isl_schedule_constraints *sc) { if (!sc) return; fprintf(stderr, "domain: "); isl_union_set_dump(sc->domain); fprintf(stderr, "context: "); isl_set_dump(sc->context); fprintf(stderr, "validity: "); isl_union_map_dump(sc->constraint[isl_edge_validity]); fprintf(stderr, "proximity: "); isl_union_map_dump(sc->constraint[isl_edge_proximity]); fprintf(stderr, "coincidence: "); isl_union_map_dump(sc->constraint[isl_edge_coincidence]); fprintf(stderr, "condition: "); isl_union_map_dump(sc->constraint[isl_edge_condition]); fprintf(stderr, "conditional_validity: "); isl_union_map_dump(sc->constraint[isl_edge_conditional_validity]); } /* Align the parameters of the fields of "sc". */ static __isl_give isl_schedule_constraints * isl_schedule_constraints_align_params(__isl_take isl_schedule_constraints *sc) { isl_space *space; enum isl_edge_type i; if (!sc) return NULL; space = isl_union_set_get_space(sc->domain); space = isl_space_align_params(space, isl_set_get_space(sc->context)); for (i = isl_edge_first; i <= isl_edge_last; ++i) space = isl_space_align_params(space, isl_union_map_get_space(sc->constraint[i])); for (i = isl_edge_first; i <= isl_edge_last; ++i) { sc->constraint[i] = isl_union_map_align_params( sc->constraint[i], isl_space_copy(space)); if (!sc->constraint[i]) space = isl_space_free(space); } sc->context = isl_set_align_params(sc->context, isl_space_copy(space)); sc->domain = isl_union_set_align_params(sc->domain, space); if (!sc->context || !sc->domain) return isl_schedule_constraints_free(sc); return sc; } /* Return the total number of isl_maps in the constraints of "sc". */ static __isl_give int isl_schedule_constraints_n_map( __isl_keep isl_schedule_constraints *sc) { enum isl_edge_type i; int n = 0; for (i = isl_edge_first; i <= isl_edge_last; ++i) n += isl_union_map_n_map(sc->constraint[i]); return n; } /* Internal information about a node that is used during the construction * of a schedule. * space represents the space in which the domain lives * sched is a matrix representation of the schedule being constructed * for this node; if compressed is set, then this schedule is * defined over the compressed domain space * sched_map is an isl_map representation of the same (partial) schedule * sched_map may be NULL; if compressed is set, then this map * is defined over the uncompressed domain space * 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 * cinv is the inverse of cmap. * 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 * * If compressed is set, then hull represents the constraints * that were used to derive the compression, while compress and * decompress map the original space to the compressed space and * vice versa. * * scc is the index of SCC (or WCC) this node belongs to * * coincident contains a boolean for each of the rows of the schedule, * indicating whether the corresponding scheduling dimension satisfies * the coincidence constraints in the sense that the corresponding * dependence distances are zero. */ struct isl_sched_node { isl_space *space; int compressed; isl_set *hull; isl_multi_aff *compress; isl_multi_aff *decompress; isl_mat *sched; isl_map *sched_map; int rank; isl_mat *cmap; isl_mat *cinv; int start; int nvar; int nparam; int scc; int *coincident; }; static int node_has_space(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->space, dim); } 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; } /* 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, with i -> j in the map if j depends on i * tagged_condition and tagged_validity contain the union of all tagged * condition or conditional validity dependence relations that * specialize the dependence relation "map"; that is, * if (i -> a) -> (j -> b) is an element of "tagged_condition" * or "tagged_validity", then i -> j is an element of "map". * If these fields are NULL, then they represent the empty relation. * src is the source node * dst is the sink node * validity is set if the edge is used to ensure correctness * coincidence is used to enforce zero dependence distances * proximity is set if the edge is used to minimize dependence distances * condition is set if the edge represents a condition * for a conditional validity schedule constraint * local can only be set for condition edges and indicates that * the dependence distance over the edge should be zero * conditional_validity is set if the edge is used to conditionally * ensure correctness * * 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; isl_union_map *tagged_condition; isl_union_map *tagged_validity; struct isl_sched_node *src; struct isl_sched_node *dst; unsigned validity : 1; unsigned coincidence : 1; unsigned proximity : 1; unsigned local : 1; unsigned condition : 1; unsigned conditional_validity : 1; int start; int end; }; /* 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 * if compression is involved then the key for these maps * it the original, uncompressed dependence relation, while * the value is the dual of the compressed dependence relation. * * 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 * 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 one 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 * weak is set if the components are weakly connected */ struct isl_sched_graph { isl_map_to_basic_set *intra_hmap; isl_map_to_basic_set *inter_hmap; struct isl_sched_node *node; int n; int maxvar; int max_row; int n_row; int *sorted; 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; int weak; }; /* 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].space); entry = isl_hash_table_find(ctx, graph->node_table, hash, &node_has_space, graph->node[i].space, 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_space, 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 isl_stat 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 isl_stat_error; entry->data = edge; return isl_stat_ok; } /* 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->space); 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 isl_bool 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; isl_bool 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 isl_bool_error; return !empty; } /* Look for any edge with the same src, dst and map fields as "model". * * Return the matching edge if one can be found. * Return "model" if no matching edge is found. * Return NULL on error. */ static struct isl_sched_edge *graph_find_matching_edge( struct isl_sched_graph *graph, struct isl_sched_edge *model) { enum isl_edge_type i; struct isl_sched_edge *edge; for (i = isl_edge_first; i <= isl_edge_last; ++i) { int is_equal; edge = graph_find_edge(graph, i, model->src, model->dst); if (!edge) continue; is_equal = isl_map_plain_is_equal(model->map, edge->map); if (is_equal < 0) return NULL; if (is_equal) return edge; } return model; } /* 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 isl_bool graph_has_any_edge(struct isl_sched_graph *graph, struct isl_sched_node *src, struct isl_sched_node *dst) { enum isl_edge_type i; isl_bool 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. * * Conditional validity edges are essentially validity edges that * can be ignored if the corresponding condition edges are iteration private. * Here, we are only checking for the presence of validity * edges, so we need to consider the conditional validity edges too. * In particular, this function is used during the detection * of strongly connected components and we cannot ignore * conditional validity edges during this detection. */ static isl_bool graph_has_validity_edge(struct isl_sched_graph *graph, struct isl_sched_node *src, struct isl_sched_node *dst) { isl_bool r; r = graph_has_edge(graph, isl_edge_validity, src, dst); if (r < 0 || r) return r; return graph_has_edge(graph, isl_edge_conditional_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_map_to_basic_set_alloc(ctx, 2 * n_edge); graph->inter_hmap = isl_map_to_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_map_to_basic_set_free(graph->intra_hmap); isl_map_to_basic_set_free(graph->inter_hmap); if (graph->node) for (i = 0; i < graph->n; ++i) { isl_space_free(graph->node[i].space); isl_set_free(graph->node[i].hull); isl_multi_aff_free(graph->node[i].compress); isl_multi_aff_free(graph->node[i].decompress); isl_mat_free(graph->node[i].sched); isl_map_free(graph->node[i].sched_map); isl_mat_free(graph->node[i].cmap); isl_mat_free(graph->node[i].cinv); if (graph->root) free(graph->node[i].coincident); } free(graph->node); free(graph->sorted); if (graph->edge) for (i = 0; i < graph->n_edge; ++i) { isl_map_free(graph->edge[i].map); isl_union_map_free(graph->edge[i].tagged_condition); isl_union_map_free(graph->edge[i].tagged_validity); } 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 isl_stat 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 isl_stat_ok; } /* Add the number of basic maps in "map" to *n. */ static isl_stat add_n_basic_map(__isl_take isl_map *map, void *user) { int *n = user; *n += isl_map_n_basic_map(map); isl_map_free(map); return isl_stat_ok; } /* Compute the number of rows that should be allocated for the schedule. * In particular, we need one row for each variable or one row * for each basic map in the dependences. * Note that it is practically impossible to exhaust both * the number of dependences and the number of variables. */ static int compute_max_row(struct isl_sched_graph *graph, __isl_keep isl_schedule_constraints *sc) { enum isl_edge_type i; int n_edge; graph->n = 0; graph->maxvar = 0; if (isl_union_set_foreach_set(sc->domain, &init_n_maxvar, graph) < 0) return -1; n_edge = 0; for (i = isl_edge_first; i <= isl_edge_last; ++i) if (isl_union_map_foreach_map(sc->constraint[i], &add_n_basic_map, &n_edge) < 0) return -1; graph->max_row = n_edge + graph->maxvar; return 0; } /* Does "bset" have any defining equalities for its set variables? */ static int has_any_defining_equality(__isl_keep isl_basic_set *bset) { int i, n; if (!bset) return -1; n = isl_basic_set_dim(bset, isl_dim_set); for (i = 0; i < n; ++i) { int has; has = isl_basic_set_has_defining_equality(bset, isl_dim_set, i, NULL); if (has < 0 || has) return has; } return 0; } /* Add a new node to the graph representing the given space. * "nvar" is the (possibly compressed) number of variables and * may be smaller than then number of set variables in "space" * if "compressed" is set. * If "compressed" is set, then "hull" represents the constraints * that were used to derive the compression, while "compress" and * "decompress" map the original space to the compressed space and * vice versa. * If "compressed" is not set, then "hull", "compress" and "decompress" * should be NULL. */ static isl_stat add_node(struct isl_sched_graph *graph, __isl_take isl_space *space, int nvar, int compressed, __isl_take isl_set *hull, __isl_take isl_multi_aff *compress, __isl_take isl_multi_aff *decompress) { int nparam; isl_ctx *ctx; isl_mat *sched; int *coincident; if (!space) return isl_stat_error; ctx = isl_space_get_ctx(space); nparam = isl_space_dim(space, isl_dim_param); if (!ctx->opt->schedule_parametric) nparam = 0; sched = isl_mat_alloc(ctx, 0, 1 + nparam + nvar); graph->node[graph->n].space = space; 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; coincident = isl_calloc_array(ctx, int, graph->max_row); graph->node[graph->n].coincident = coincident; graph->node[graph->n].compressed = compressed; graph->node[graph->n].hull = hull; graph->node[graph->n].compress = compress; graph->node[graph->n].decompress = decompress; graph->n++; if (!space || !sched || (graph->max_row && !coincident)) return isl_stat_error; if (compressed && (!hull || !compress || !decompress)) return isl_stat_error; return isl_stat_ok; } /* Add a new node to the graph representing the given set. * * If any of the set variables is defined by an equality, then * we perform variable compression such that we can perform * the scheduling on the compressed domain. */ static isl_stat extract_node(__isl_take isl_set *set, void *user) { int nvar; int has_equality; isl_space *space; isl_basic_set *hull; isl_set *hull_set; isl_morph *morph; isl_multi_aff *compress, *decompress; struct isl_sched_graph *graph = user; space = isl_set_get_space(set); hull = isl_set_affine_hull(set); hull = isl_basic_set_remove_divs(hull); nvar = isl_space_dim(space, isl_dim_set); has_equality = has_any_defining_equality(hull); if (has_equality < 0) goto error; if (!has_equality) { isl_basic_set_free(hull); return add_node(graph, space, nvar, 0, NULL, NULL, NULL); } morph = isl_basic_set_variable_compression(hull, isl_dim_set); nvar = isl_morph_ran_dim(morph, isl_dim_set); compress = isl_morph_get_var_multi_aff(morph); morph = isl_morph_inverse(morph); decompress = isl_morph_get_var_multi_aff(morph); isl_morph_free(morph); hull_set = isl_set_from_basic_set(hull); return add_node(graph, space, nvar, 1, hull_set, compress, decompress); error: isl_basic_set_free(hull); isl_space_free(space); return isl_stat_error; } struct isl_extract_edge_data { enum isl_edge_type type; struct isl_sched_graph *graph; }; /* Merge edge2 into edge1, freeing the contents of edge2. * "type" is the type of the schedule constraint from which edge2 was * extracted. * Return 0 on success and -1 on failure. * * edge1 and edge2 are assumed to have the same value for the map field. */ static int merge_edge(enum isl_edge_type type, struct isl_sched_edge *edge1, struct isl_sched_edge *edge2) { edge1->validity |= edge2->validity; edge1->coincidence |= edge2->coincidence; edge1->proximity |= edge2->proximity; edge1->condition |= edge2->condition; edge1->conditional_validity |= edge2->conditional_validity; isl_map_free(edge2->map); if (type == isl_edge_condition) { if (!edge1->tagged_condition) edge1->tagged_condition = edge2->tagged_condition; else edge1->tagged_condition = isl_union_map_union(edge1->tagged_condition, edge2->tagged_condition); } if (type == isl_edge_conditional_validity) { if (!edge1->tagged_validity) edge1->tagged_validity = edge2->tagged_validity; else edge1->tagged_validity = isl_union_map_union(edge1->tagged_validity, edge2->tagged_validity); } if (type == isl_edge_condition && !edge1->tagged_condition) return -1; if (type == isl_edge_conditional_validity && !edge1->tagged_validity) return -1; return 0; } /* Insert dummy tags in domain and range of "map". * * In particular, if "map" is of the form * * A -> B * * then return * * [A -> dummy_tag] -> [B -> dummy_tag] * * where the dummy_tags are identical and equal to any dummy tags * introduced by any other call to this function. */ static __isl_give isl_map *insert_dummy_tags(__isl_take isl_map *map) { static char dummy; isl_ctx *ctx; isl_id *id; isl_space *space; isl_set *domain, *range; ctx = isl_map_get_ctx(map); id = isl_id_alloc(ctx, NULL, &dummy); space = isl_space_params(isl_map_get_space(map)); space = isl_space_set_from_params(space); space = isl_space_set_tuple_id(space, isl_dim_set, id); space = isl_space_map_from_set(space); domain = isl_map_wrap(map); range = isl_map_wrap(isl_map_universe(space)); map = isl_map_from_domain_and_range(domain, range); map = isl_map_zip(map); return map; } /* Given that at least one of "src" or "dst" is compressed, return * a map between the spaces of these nodes restricted to the affine * hull that was used in the compression. */ static __isl_give isl_map *extract_hull(struct isl_sched_node *src, struct isl_sched_node *dst) { isl_set *dom, *ran; if (src->compressed) dom = isl_set_copy(src->hull); else dom = isl_set_universe(isl_space_copy(src->space)); if (dst->compressed) ran = isl_set_copy(dst->hull); else ran = isl_set_universe(isl_space_copy(dst->space)); return isl_map_from_domain_and_range(dom, ran); } /* Intersect the domains of the nested relations in domain and range * of "tagged" with "map". */ static __isl_give isl_map *map_intersect_domains(__isl_take isl_map *tagged, __isl_keep isl_map *map) { isl_set *set; tagged = isl_map_zip(tagged); set = isl_map_wrap(isl_map_copy(map)); tagged = isl_map_intersect_domain(tagged, set); tagged = isl_map_zip(tagged); return tagged; } /* 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. * * Edges of type isl_edge_condition or isl_edge_conditional_validity * may be specified as "tagged" dependence relations. That is, "map" * may contain elements (i -> a) -> (j -> b), where i -> j denotes * the dependence on iterations and a and b are tags. * edge->map is set to the relation containing the elements i -> j, * while edge->tagged_condition and edge->tagged_validity contain * the union of all the "map" relations * for which extract_edge is called that result in the same edge->map. * * If the source or the destination node is compressed, then * intersect both "map" and "tagged" with the constraints that * were used to construct the compression. * This ensures that there are no schedule constraints defined * outside of these domains, while the scheduler no longer has * any control over those outside parts. */ static isl_stat 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; isl_map *tagged = NULL; if (data->type == isl_edge_condition || data->type == isl_edge_conditional_validity) { if (isl_map_can_zip(map)) { tagged = isl_map_copy(map); map = isl_set_unwrap(isl_map_domain(isl_map_zip(map))); } else { tagged = insert_dummy_tags(isl_map_copy(map)); } } 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); isl_map_free(tagged); return isl_stat_ok; } if (src->compressed || dst->compressed) { isl_map *hull; hull = extract_hull(src, dst); if (tagged) tagged = map_intersect_domains(tagged, hull); map = isl_map_intersect(map, hull); } graph->edge[graph->n_edge].src = src; graph->edge[graph->n_edge].dst = dst; graph->edge[graph->n_edge].map = map; graph->edge[graph->n_edge].validity = 0; graph->edge[graph->n_edge].coincidence = 0; graph->edge[graph->n_edge].proximity = 0; graph->edge[graph->n_edge].condition = 0; graph->edge[graph->n_edge].local = 0; graph->edge[graph->n_edge].conditional_validity = 0; graph->edge[graph->n_edge].tagged_condition = NULL; graph->edge[graph->n_edge].tagged_validity = NULL; if (data->type == isl_edge_validity) graph->edge[graph->n_edge].validity = 1; if (data->type == isl_edge_coincidence) graph->edge[graph->n_edge].coincidence = 1; if (data->type == isl_edge_proximity) graph->edge[graph->n_edge].proximity = 1; if (data->type == isl_edge_condition) { graph->edge[graph->n_edge].condition = 1; graph->edge[graph->n_edge].tagged_condition = isl_union_map_from_map(tagged); } if (data->type == isl_edge_conditional_validity) { graph->edge[graph->n_edge].conditional_validity = 1; graph->edge[graph->n_edge].tagged_validity = isl_union_map_from_map(tagged); } edge = graph_find_matching_edge(graph, &graph->edge[graph->n_edge]); if (!edge) { graph->n_edge++; return isl_stat_error; } if (edge == &graph->edge[graph->n_edge]) return graph_edge_table_add(ctx, graph, data->type, &graph->edge[graph->n_edge++]); if (merge_edge(data->type, edge, &graph->edge[graph->n_edge]) < 0) return -1; 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 isl_bool node_follows_weak(int i, int j, void *user) { isl_bool 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 (conditional) validity dependence from node[j] * to node[i], forcing node[i] to follow node[j]. */ static isl_bool 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->weak = weak; 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 "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). * * If "node" has been compressed, then the dependence relation * is also compressed before the set of coefficients is computed. */ static __isl_give isl_basic_set *intra_coefficients( struct isl_sched_graph *graph, struct isl_sched_node *node, __isl_take isl_map *map) { isl_set *delta; isl_map *key; isl_basic_set *coef; if (isl_map_to_basic_set_has(graph->intra_hmap, map)) return isl_map_to_basic_set_get(graph->intra_hmap, map); key = isl_map_copy(map); if (node->compressed) { map = isl_map_preimage_domain_multi_aff(map, isl_multi_aff_copy(node->decompress)); map = isl_map_preimage_range_multi_aff(map, isl_multi_aff_copy(node->decompress)); } delta = isl_set_remove_divs(isl_map_deltas(map)); coef = isl_set_coefficients(delta); graph->intra_hmap = isl_map_to_basic_set_set(graph->intra_hmap, key, 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 * * If the source or destination nodes of "edge" have been compressed, * then the dependence relation is also compressed before * the set of coefficients is computed. */ static __isl_give isl_basic_set *inter_coefficients( struct isl_sched_graph *graph, struct isl_sched_edge *edge, __isl_take isl_map *map) { isl_set *set; isl_map *key; isl_basic_set *coef; if (isl_map_to_basic_set_has(graph->inter_hmap, map)) return isl_map_to_basic_set_get(graph->inter_hmap, map); key = isl_map_copy(map); if (edge->src->compressed) map = isl_map_preimage_domain_multi_aff(map, isl_multi_aff_copy(edge->src->decompress)); if (edge->dst->compressed) map = isl_map_preimage_range_multi_aff(map, isl_multi_aff_copy(edge->dst->decompress)); set = isl_map_wrap(isl_map_remove_divs(map)); coef = isl_set_coefficients(set); graph->inter_hmap = isl_map_to_basic_set_set(graph->inter_hmap, key, 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, node, 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, edge, 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. * * * If "local" is set, then we add constraints * * c_i_x (y - x) <= 0 * * or * * -c_i_x (y - x) <= 0 * * instead, forcing the dependence distance to be (less than or) equal to 0. * That is, we plug in (0, 0, -s * c_i_x), * Note that dependences marked local are treated as validity constraints * by add_all_validity_constraints and therefore also have * their distances bounded by 0 from below. */ static int add_intra_proximity_constraints(struct isl_sched_graph *graph, struct isl_sched_edge *edge, int s, int local) { 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, node, 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->space, isl_dim_param); total = isl_basic_set_total_dim(graph->lp); dim_map = isl_dim_map_alloc(ctx, total); if (!local) { 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. * * * If "local" is set, then we add constraints * * (c_j_0 + c_j_n n + c_j_x y) - (c_i_0 + c_i_n n + c_i_x x) <= 0 * * or * * -((c_j_0 + c_j_n n + c_j_x y) - (c_i_0 + c_i_n n + c_i_x x)) <= 0 * * instead, forcing the dependence distance to be (less than or) equal to 0. * That is, we plug in * (-s*c_j_0 + s*c_i_0, -s*c_j_n + s*c_i_n, -s*c_j_x+s*c_i_x). * Note that dependences marked local are treated as validity constraints * by add_all_validity_constraints and therefore also have * their distances bounded by 0 from below. */ static int add_inter_proximity_constraints(struct isl_sched_graph *graph, struct isl_sched_edge *edge, int s, int local) { 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, edge, 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->space, isl_dim_param); total = isl_basic_set_total_dim(graph->lp); dim_map = isl_dim_map_alloc(ctx, total); if (!local) { 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; } /* Add all validity constraints to graph->lp. * * An edge that is forced to be local needs to have its dependence * distances equal to zero. We take care of bounding them by 0 from below * here. add_all_proximity_constraints takes care of bounding them by 0 * from above. * * If "use_coincidence" is set, then we treat coincidence edges as local edges. * Otherwise, we ignore them. */ static int add_all_validity_constraints(struct isl_sched_graph *graph, int use_coincidence) { int i; for (i = 0; i < graph->n_edge; ++i) { struct isl_sched_edge *edge= &graph->edge[i]; int local; local = edge->local || (edge->coincidence && use_coincidence); if (!edge->validity && !local) 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]; int local; local = edge->local || (edge->coincidence && use_coincidence); if (!edge->validity && !local) 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. (This includes the case of "local" dependences * which are treated as validity dependence by add_all_validity_constraints.) * Otherwise, we need to bound the distance both from above and from below. * * If "use_coincidence" is set, then we treat coincidence edges as local edges. * Otherwise, we ignore them. */ static int add_all_proximity_constraints(struct isl_sched_graph *graph, int use_coincidence) { int i; for (i = 0; i < graph->n_edge; ++i) { struct isl_sched_edge *edge= &graph->edge[i]; int local; local = edge->local || (edge->coincidence && use_coincidence); if (!edge->proximity && !local) continue; if (edge->src == edge->dst && add_intra_proximity_constraints(graph, edge, 1, local) < 0) return -1; if (edge->src != edge->dst && add_inter_proximity_constraints(graph, edge, 1, local) < 0) return -1; if (edge->validity || local) continue; if (edge->src == edge->dst && add_intra_proximity_constraints(graph, edge, -1, 0) < 0) return -1; if (edge->src != edge->dst && add_inter_proximity_constraints(graph, edge, -1, 0) < 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 * S U = H * * with H the Hermite normal form of S. That is, all but the * first rank columns of H 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. * Similarly, the matrix U is transposed such that we can * compute the coefficients c = U s from a schedule row s. */ static int node_update_cmap(struct isl_sched_node *node) { isl_mat *H, *U, *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, &U, &Q); isl_mat_free(node->cmap); isl_mat_free(node->cinv); node->cmap = isl_mat_transpose(Q); node->cinv = isl_mat_transpose(U); node->rank = isl_mat_initial_non_zero_cols(H); isl_mat_free(H); if (!node->cmap || !node->cinv || node->rank < 0) return -1; return 0; } /* How many times should we count the constraints in "edge"? * * If carry is set, then we are counting the number of * (validity or conditional 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) * local(+any) -> 2 (>= 0 and <= 0) * * If an edge is only marked conditional_validity then it counts * as zero since it is only checked afterwards. * * If "use_coincidence" is set, then we treat coincidence edges as local edges. * Otherwise, we ignore them. */ static int edge_multiplicity(struct isl_sched_edge *edge, int carry, int use_coincidence) { if (carry && !edge->validity && !edge->conditional_validity) return 0; if (carry) return 1; if (edge->proximity || edge->local) return 2; if (use_coincidence && edge->coincidence) return 2; if (edge->validity) return 1; return 0; } /* Count the number of equality and inequality constraints * that will be added for the given map. * * "use_coincidence" is set if we should take into account coincidence edges. */ 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, int use_coincidence) { isl_basic_set *coef; int f = edge_multiplicity(edge, carry, use_coincidence); if (f == 0) { isl_map_free(map); return 0; } if (edge->src == edge->dst) coef = intra_coefficients(graph, edge->src, map); else coef = inter_coefficients(graph, edge, 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) * local(+any) -> 2 (>= 0 and <= 0) * * If "use_coincidence" is set, then we treat coincidence edges as local edges. * Otherwise, we ignore them. */ static int count_constraints(struct isl_sched_graph *graph, int *n_eq, int *n_ineq, int use_coincidence) { 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, use_coincidence) < 0) return -1; } return 0; } /* Count the number of constraints that will be added by * add_bound_coefficient_constraints and increment *n_eq and *n_ineq * accordingly. * * In practice, add_bound_coefficient_constraints only adds inequalities. */ static int count_bound_coefficient_constraints(isl_ctx *ctx, struct isl_sched_graph *graph, int *n_eq, int *n_ineq) { int i; if (ctx->opt->schedule_max_coefficient == -1) return 0; for (i = 0; i < graph->n; ++i) *n_ineq += 2 * graph->node[i].nparam + 2 * graph->node[i].nvar; 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 "use_coincidence" is set, then we treat coincidence edges as local edges. * Otherwise, we ignore them. */ static int setup_lp(isl_ctx *ctx, struct isl_sched_graph *graph, int use_coincidence) { 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; max_constant_term = ctx->opt->schedule_max_constant_term; parametric = ctx->opt->schedule_parametric; nparam = isl_space_dim(graph->node[0].space, 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, use_coincidence) < 0) return -1; if (count_bound_coefficient_constraints(ctx, 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; if (max_constant_term != -1) n_ineq += graph->n; 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); 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 (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, use_coincidence) < 0) return -1; if (add_all_proximity_constraints(graph, use_coincidence) < 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 coincident is set, then the caller guarantees that the new * row satisfies the coincidence constraints. */ static int update_schedule(struct isl_sched_graph *graph, __isl_take isl_vec *sol, int use_cmap, int coincident) { int i, j; 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); 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->coincident[graph->n_total_row] = coincident; } 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 row "row" of node->sched into an isl_aff living in "ls" * and return this isl_aff. */ static __isl_give isl_aff *extract_schedule_row(__isl_take isl_local_space *ls, struct isl_sched_node *node, int row) { int j; isl_int v; isl_aff *aff; isl_int_init(v); aff = isl_aff_zero_on_domain(ls); isl_mat_get_element(node->sched, row, 0, &v); aff = isl_aff_set_constant(aff, v); for (j = 0; j < node->nparam; ++j) { isl_mat_get_element(node->sched, row, 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, row, 1 + node->nparam + j, &v); aff = isl_aff_set_coefficient(aff, isl_dim_in, j, v); } isl_int_clear(v); return aff; } /* Convert the "n" rows starting at "first" of node->sched into a multi_aff * and return this multi_aff. * * The result is defined over the uncompressed node domain. */ static __isl_give isl_multi_aff *node_extract_partial_schedule_multi_aff( struct isl_sched_node *node, int first, int n) { int i; isl_space *space; isl_local_space *ls; isl_aff *aff; isl_multi_aff *ma; int nrow; nrow = isl_mat_rows(node->sched); if (node->compressed) space = isl_multi_aff_get_domain_space(node->decompress); else space = isl_space_copy(node->space); ls = isl_local_space_from_space(isl_space_copy(space)); space = isl_space_from_domain(space); space = isl_space_add_dims(space, isl_dim_out, n); ma = isl_multi_aff_zero(space); for (i = first; i < first + n; ++i) { aff = extract_schedule_row(isl_local_space_copy(ls), node, i); ma = isl_multi_aff_set_aff(ma, i - first, aff); } isl_local_space_free(ls); if (node->compressed) ma = isl_multi_aff_pullback_multi_aff(ma, isl_multi_aff_copy(node->compress)); return ma; } /* Convert node->sched into a multi_aff and return this multi_aff. * * The result is defined over the uncompressed node domain. */ static __isl_give isl_multi_aff *node_extract_schedule_multi_aff( struct isl_sched_node *node) { int nrow; nrow = isl_mat_rows(node->sched); return node_extract_partial_schedule_multi_aff(node, 0, nrow); } /* 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. * It is defined over the uncompressed node domain. */ 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); } /* Construct a map that can be used to update a dependence relation * based on the current schedule. * That is, construct a map expressing that source and sink * are executed within the same iteration of the current schedule. * This map can then be intersected with the dependence relation. * This is not the most efficient way, but this shouldn't be a critical * operation. */ static __isl_give isl_map *specializer(struct isl_sched_node *src, struct isl_sched_node *dst) { isl_map *src_sched, *dst_sched; src_sched = node_extract_schedule(src); dst_sched = node_extract_schedule(dst); return isl_map_apply_range(src_sched, isl_map_reverse(dst_sched)); } /* Intersect the domains of the nested relations in domain and range * of "umap" with "map". */ static __isl_give isl_union_map *intersect_domains( __isl_take isl_union_map *umap, __isl_keep isl_map *map) { isl_union_set *uset; umap = isl_union_map_zip(umap); uset = isl_union_set_from_set(isl_map_wrap(isl_map_copy(map))); umap = isl_union_map_intersect_domain(umap, uset); umap = isl_union_map_zip(umap); return umap; } /* Update the dependence relation of the given edge based * on the current schedule. * If the 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_edge(struct isl_sched_graph *graph, struct isl_sched_edge *edge) { int empty; isl_map *id; id = specializer(edge->src, edge->dst); edge->map = isl_map_intersect(edge->map, isl_map_copy(id)); if (!edge->map) goto error; if (edge->tagged_condition) { edge->tagged_condition = intersect_domains(edge->tagged_condition, id); if (!edge->tagged_condition) goto error; } if (edge->tagged_validity) { edge->tagged_validity = intersect_domains(edge->tagged_validity, id); if (!edge->tagged_validity) goto error; } empty = isl_map_plain_is_empty(edge->map); if (empty < 0) goto error; if (empty) graph_remove_edge(graph, edge); isl_map_free(id); return 0; error: isl_map_free(id); return -1; } /* Does the domain of "umap" intersect "uset"? */ static int domain_intersects(__isl_keep isl_union_map *umap, __isl_keep isl_union_set *uset) { int empty; umap = isl_union_map_copy(umap); umap = isl_union_map_intersect_domain(umap, isl_union_set_copy(uset)); empty = isl_union_map_is_empty(umap); isl_union_map_free(umap); return empty < 0 ? -1 : !empty; } /* Does the range of "umap" intersect "uset"? */ static int range_intersects(__isl_keep isl_union_map *umap, __isl_keep isl_union_set *uset) { int empty; umap = isl_union_map_copy(umap); umap = isl_union_map_intersect_range(umap, isl_union_set_copy(uset)); empty = isl_union_map_is_empty(umap); isl_union_map_free(umap); return empty < 0 ? -1 : !empty; } /* Are the condition dependences of "edge" local with respect to * the current schedule? * * That is, are domain and range of the condition dependences mapped * to the same point? * * In other words, is the condition false? */ static int is_condition_false(struct isl_sched_edge *edge) { isl_union_map *umap; isl_map *map, *sched, *test; int empty, local; empty = isl_union_map_is_empty(edge->tagged_condition); if (empty < 0 || empty) return empty; umap = isl_union_map_copy(edge->tagged_condition); umap = isl_union_map_zip(umap); umap = isl_union_set_unwrap(isl_union_map_domain(umap)); map = isl_map_from_union_map(umap); sched = node_extract_schedule(edge->src); map = isl_map_apply_domain(map, sched); sched = node_extract_schedule(edge->dst); map = isl_map_apply_range(map, sched); test = isl_map_identity(isl_map_get_space(map)); local = isl_map_is_subset(map, test); isl_map_free(map); isl_map_free(test); return local; } /* For each conditional validity constraint that is adjacent * to a condition with domain in condition_source or range in condition_sink, * turn it into an unconditional validity constraint. */ static int unconditionalize_adjacent_validity(struct isl_sched_graph *graph, __isl_take isl_union_set *condition_source, __isl_take isl_union_set *condition_sink) { int i; condition_source = isl_union_set_coalesce(condition_source); condition_sink = isl_union_set_coalesce(condition_sink); for (i = 0; i < graph->n_edge; ++i) { int adjacent; isl_union_map *validity; if (!graph->edge[i].conditional_validity) continue; if (graph->edge[i].validity) continue; validity = graph->edge[i].tagged_validity; adjacent = domain_intersects(validity, condition_sink); if (adjacent >= 0 && !adjacent) adjacent = range_intersects(validity, condition_source); if (adjacent < 0) goto error; if (!adjacent) continue; graph->edge[i].validity = 1; } isl_union_set_free(condition_source); isl_union_set_free(condition_sink); return 0; error: isl_union_set_free(condition_source); isl_union_set_free(condition_sink); return -1; } /* Update the dependence relations of all edges based on the current schedule * and enforce conditional validity constraints that are adjacent * to satisfied condition constraints. * * First check if any of the condition constraints are satisfied * (i.e., not local to the outer schedule) and keep track of * their domain and range. * Then update all dependence relations (which removes the non-local * constraints). * Finally, if any condition constraints turned out to be satisfied, * then turn all adjacent conditional validity constraints into * unconditional validity constraints. */ static int update_edges(isl_ctx *ctx, struct isl_sched_graph *graph) { int i; int any = 0; isl_union_set *source, *sink; source = isl_union_set_empty(isl_space_params_alloc(ctx, 0)); sink = isl_union_set_empty(isl_space_params_alloc(ctx, 0)); for (i = 0; i < graph->n_edge; ++i) { int local; isl_union_set *uset; isl_union_map *umap; if (!graph->edge[i].condition) continue; if (graph->edge[i].local) continue; local = is_condition_false(&graph->edge[i]); if (local < 0) goto error; if (local) continue; any = 1; umap = isl_union_map_copy(graph->edge[i].tagged_condition); uset = isl_union_map_domain(umap); source = isl_union_set_union(source, uset); umap = isl_union_map_copy(graph->edge[i].tagged_condition); uset = isl_union_map_range(umap); sink = isl_union_set_union(sink, uset); } for (i = graph->n_edge - 1; i >= 0; --i) { if (update_edge(graph, &graph->edge[i]) < 0) goto error; } if (any) return unconditionalize_adjacent_validity(graph, source, sink); isl_union_set_free(source); isl_union_set_free(sink); return 0; error: isl_union_set_free(source); isl_union_set_free(sink); return -1; } static void next_band(struct isl_sched_graph *graph) { graph->band_start = graph->n_total_row; } /* Return the union of the universe domains of the nodes in "graph" * that satisfy "pred". */ static __isl_give isl_union_set *isl_sched_graph_domain(isl_ctx *ctx, struct isl_sched_graph *graph, int (*pred)(struct isl_sched_node *node, int data), int data) { int i; isl_set *set; isl_union_set *dom; for (i = 0; i < graph->n; ++i) if (pred(&graph->node[i], data)) break; if (i >= graph->n) isl_die(ctx, isl_error_internal, "empty component", return NULL); set = isl_set_universe(isl_space_copy(graph->node[i].space)); dom = isl_union_set_from_set(set); for (i = i + 1; i < graph->n; ++i) { if (!pred(&graph->node[i], data)) continue; set = isl_set_universe(isl_space_copy(graph->node[i].space)); dom = isl_union_set_union(dom, isl_union_set_from_set(set)); } return dom; } /* Return a list of unions of universe domains, where each element * in the list corresponds to an SCC (or WCC) indexed by node->scc. */ static __isl_give isl_union_set_list *extract_sccs(isl_ctx *ctx, struct isl_sched_graph *graph) { int i; isl_union_set_list *filters; filters = isl_union_set_list_alloc(ctx, graph->scc); for (i = 0; i < graph->scc; ++i) { isl_union_set *dom; dom = isl_sched_graph_domain(ctx, graph, &node_scc_exactly, i); filters = isl_union_set_list_add(filters, dom); } return filters; } /* Return a list of two unions of universe domains, one for the SCCs up * to and including graph->src_scc and another for the other SCCS. */ static __isl_give isl_union_set_list *extract_split(isl_ctx *ctx, struct isl_sched_graph *graph) { isl_union_set *dom; isl_union_set_list *filters; filters = isl_union_set_list_alloc(ctx, 2); dom = isl_sched_graph_domain(ctx, graph, &node_scc_at_most, graph->src_scc); filters = isl_union_set_list_add(filters, dom); dom = isl_sched_graph_domain(ctx, graph, &node_scc_at_least, graph->src_scc + 1); filters = isl_union_set_list_add(filters, dom); return filters; } /* 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) { int j; if (!node_pred(&src->node[i], data)) continue; j = dst->n; dst->node[j].space = isl_space_copy(src->node[i].space); dst->node[j].compressed = src->node[i].compressed; dst->node[j].hull = isl_set_copy(src->node[i].hull); dst->node[j].compress = isl_multi_aff_copy(src->node[i].compress); dst->node[j].decompress = isl_multi_aff_copy(src->node[i].decompress); dst->node[j].nvar = src->node[i].nvar; dst->node[j].nparam = src->node[i].nparam; dst->node[j].sched = isl_mat_copy(src->node[i].sched); dst->node[j].sched_map = isl_map_copy(src->node[i].sched_map); dst->node[j].coincident = src->node[i].coincident; dst->n++; if (!dst->node[j].space || !dst->node[j].sched) return -1; if (dst->node[j].compressed && (!dst->node[j].hull || !dst->node[j].compress || !dst->node[j].decompress)) return -1; } 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; isl_union_map *tagged_condition; isl_union_map *tagged_validity; 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->space); dst_dst = graph_find_node(ctx, dst, edge->dst->space); if (!dst_src || !dst_dst) { if (edge->validity || edge->conditional_validity) isl_die(ctx, isl_error_internal, "backward (conditional) validity edge", return -1); continue; } map = isl_map_copy(edge->map); tagged_condition = isl_union_map_copy(edge->tagged_condition); tagged_validity = isl_union_map_copy(edge->tagged_validity); 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].tagged_condition = tagged_condition; dst->edge[dst->n_edge].tagged_validity = tagged_validity; dst->edge[dst->n_edge].validity = edge->validity; dst->edge[dst->n_edge].proximity = edge->proximity; dst->edge[dst->n_edge].coincidence = edge->coincidence; dst->edge[dst->n_edge].condition = edge->condition; dst->edge[dst->n_edge].conditional_validity = edge->conditional_validity; dst->n_edge++; if (edge->tagged_condition && !tagged_condition) return -1; if (edge->tagged_validity && !tagged_validity) return -1; 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; } /* 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 __isl_give isl_schedule_node *compute_schedule(isl_schedule_node *node, struct isl_sched_graph *graph); static __isl_give isl_schedule_node *compute_schedule_wcc( isl_schedule_node *node, 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. * * The schedule is inserted at "node" and the updated schedule node * is returned. */ static __isl_give isl_schedule_node *compute_sub_schedule( __isl_take isl_schedule_node *node, 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.band_start = graph->band_start; if (wcc) node = compute_schedule_wcc(node, &split); else node = compute_schedule(node, &split); graph_free(ctx, &split); return node; error: graph_free(ctx, &split); return isl_schedule_node_free(node); } 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; } /* Reset the current band by dropping all its schedule rows. */ static int reset_band(struct isl_sched_graph *graph) { int i; int drop; drop = graph->n_total_row - graph->band_start; graph->n_total_row -= drop; graph->n_row -= drop; 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_drop_rows(node->sched, graph->band_start, drop); if (!node->sched) return -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 by a sequence node inserted at position "node" * in the schedule tree. Return the updated schedule node. * * The current band is reset. It would be possible to reuse * the previously computed rows 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. */ static __isl_give isl_schedule_node *compute_split_schedule( __isl_take isl_schedule_node *node, struct isl_sched_graph *graph) { int i, n, e1, e2; isl_ctx *ctx; isl_union_set_list *filters; if (!node) return NULL; if (reset_band(graph) < 0) return isl_schedule_node_free(node); n = 0; for (i = 0; i < graph->n; ++i) { struct isl_sched_node *node = &graph->node[i]; int before = node->scc <= graph->src_scc; if (before) n++; } 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++; } next_band(graph); ctx = isl_schedule_node_get_ctx(node); filters = extract_split(ctx, graph); node = isl_schedule_node_insert_sequence(node, filters); node = isl_schedule_node_child(node, 0); node = isl_schedule_node_child(node, 0); node = compute_sub_schedule(node, ctx, graph, n, e1, &node_scc_at_most, &edge_dst_scc_at_most, graph->src_scc, 0); node = isl_schedule_node_parent(node); node = isl_schedule_node_next_sibling(node); node = isl_schedule_node_child(node, 0); node = compute_sub_schedule(node, ctx, graph, graph->n - n, e2, &node_scc_at_least, &edge_src_scc_at_least, graph->src_scc + 1, 0); node = isl_schedule_node_parent(node); node = isl_schedule_node_parent(node); return node; } /* Insert a band node at position "node" in the schedule tree corresponding * to the current band in "graph". Mark the band node permutable * if "permutable" is set. * The partial schedules and the coincidence property are extracted * from the graph nodes. * Return the updated schedule node. */ static __isl_give isl_schedule_node *insert_current_band( __isl_take isl_schedule_node *node, struct isl_sched_graph *graph, int permutable) { int i; int start, end, n; isl_multi_aff *ma; isl_multi_pw_aff *mpa; isl_multi_union_pw_aff *mupa; if (!node) return NULL; if (graph->n < 1) isl_die(isl_schedule_node_get_ctx(node), isl_error_internal, "graph should have at least one node", return isl_schedule_node_free(node)); start = graph->band_start; end = graph->n_total_row; n = end - start; ma = node_extract_partial_schedule_multi_aff(&graph->node[0], start, n); mpa = isl_multi_pw_aff_from_multi_aff(ma); mupa = isl_multi_union_pw_aff_from_multi_pw_aff(mpa); for (i = 1; i < graph->n; ++i) { isl_multi_union_pw_aff *mupa_i; ma = node_extract_partial_schedule_multi_aff(&graph->node[i], start, n); mpa = isl_multi_pw_aff_from_multi_aff(ma); mupa_i = isl_multi_union_pw_aff_from_multi_pw_aff(mpa); mupa = isl_multi_union_pw_aff_union_add(mupa, mupa_i); } node = isl_schedule_node_insert_partial_schedule(node, mupa); for (i = 0; i < n; ++i) node = isl_schedule_node_band_member_set_coincident(node, i, graph->node[0].coincident[start + i]); node = isl_schedule_node_band_set_permutable(node, permutable); return node; } /* Update the dependence relations based on the current schedule, * add the current band to "node" and then continue with the computation * of the next band. * Return the updated schedule node. */ static __isl_give isl_schedule_node *compute_next_band( __isl_take isl_schedule_node *node, struct isl_sched_graph *graph, int permutable) { isl_ctx *ctx; if (!node) return NULL; ctx = isl_schedule_node_get_ctx(node); if (update_edges(ctx, graph) < 0) return isl_schedule_node_free(node); node = insert_current_band(node, graph, permutable); next_band(graph); node = isl_schedule_node_child(node, 0); node = compute_schedule(node, graph); node = isl_schedule_node_parent(node); return node; } /* 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, node, 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, edge, 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 (conditional) 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 && !edge->conditional_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) < 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. Dependences 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 of 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; } static __isl_give isl_schedule_node *compute_component_schedule( __isl_take isl_schedule_node *node, struct isl_sched_graph *graph, int wcc); /* Comparison function for sorting the statements based on * the corresponding value in "r". */ static int smaller_value(const void *a, const void *b, void *data) { isl_vec *r = data; const int *i1 = a; const int *i2 = b; return isl_int_cmp(r->el[*i1], r->el[*i2]); } /* If the schedule_split_scaled option is set and if the linear * parts of the scheduling rows for all nodes in the graphs have * a non-trivial common divisor, then split off the remainder of the * constant term modulo this common divisor from the linear part. * Otherwise, insert a band node directly and continue with * the construction of the schedule. * * If a non-trivial common divisor is found, then * the linear part is reduced and the remainder is enforced * by a sequence node with the children placed in the order * of this remainder. * In particular, we assign an scc index based on the remainder and * then rely on compute_component_schedule to insert the sequence and * to continue the schedule construction on each part. */ static __isl_give isl_schedule_node *split_scaled( __isl_take isl_schedule_node *node, struct isl_sched_graph *graph) { int i; int row; int scc; isl_ctx *ctx; isl_int gcd, gcd_i; isl_vec *r; int *order; if (!node) return NULL; ctx = isl_schedule_node_get_ctx(node); if (!ctx->opt->schedule_split_scaled) return compute_next_band(node, graph, 0); if (graph->n <= 1) return compute_next_band(node, graph, 0); 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 compute_next_band(node, graph, 0); } r = isl_vec_alloc(ctx, graph->n); order = isl_calloc_array(ctx, int, graph->n); if (!r || !order) goto error; for (i = 0; i < graph->n; ++i) { struct isl_sched_node *node = &graph->node[i]; order[i] = i; isl_int_fdiv_r(r->el[i], 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; } if (isl_sort(order, graph->n, sizeof(order[0]), &smaller_value, r) < 0) goto error; scc = 0; for (i = 0; i < graph->n; ++i) { if (i > 0 && isl_int_ne(r->el[order[i - 1]], r->el[order[i]])) ++scc; graph->node[order[i]].scc = scc; } graph->scc = ++scc; graph->weak = 0; isl_int_clear(gcd); isl_vec_free(r); free(order); if (update_edges(ctx, graph) < 0) return isl_schedule_node_free(node); node = insert_current_band(node, graph, 0); next_band(graph); node = isl_schedule_node_child(node, 0); node = compute_component_schedule(node, graph, 0); node = isl_schedule_node_parent(node); return node; error: isl_vec_free(r); free(order); isl_int_clear(gcd); return isl_schedule_node_free(node); } /* Is the schedule row "sol" trivial on node "node"? * That is, is the solution zero on the dimensions orthogonal to * the previously found solutions? * Return 1 if the solution is trivial, 0 if it is not and -1 on error. * * Each coefficient is represented as the difference between * two non-negative values in "sol". "sol" has been computed * in terms of the original iterators (i.e., without use of cmap). * We construct the schedule row s and write it as a linear * combination of (linear combinations of) previously computed schedule rows. * s = Q c or c = U s. * If the final entries of c are all zero, then the solution is trivial. */ static int is_trivial(struct isl_sched_node *node, __isl_keep isl_vec *sol) { int i; int pos; int trivial; isl_ctx *ctx; isl_vec *node_sol; if (!sol) return -1; if (node->nvar == node->rank) return 0; ctx = isl_vec_get_ctx(sol); node_sol = isl_vec_alloc(ctx, node->nvar); if (!node_sol) return -1; pos = 1 + node->start + 1 + 2 * node->nparam; for (i = 0; i < node->nvar; ++i) isl_int_sub(node_sol->el[i], sol->el[pos + 2 * i + 1], sol->el[pos + 2 * i]); node_sol = isl_mat_vec_product(isl_mat_copy(node->cinv), node_sol); if (!node_sol) return -1; trivial = isl_seq_first_non_zero(node_sol->el + node->rank, node->nvar - node->rank) == -1; isl_vec_free(node_sol); return trivial; } /* Is the schedule row "sol" trivial on any node where it should * not be trivial? * "sol" has been computed in terms of the original iterators * (i.e., without use of cmap). * Return 1 if any solution is trivial, 0 if they are not and -1 on error. */ 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]; int trivial; if (!needs_row(graph, node)) continue; trivial = is_trivial(node, sol); if (trivial < 0 || trivial) return trivial; } 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. * * If there is only one component, then we accept the schedule row anyway, * but we do not consider it as a complete row and therefore do not * increment graph->n_row. Note that the ranks of the nodes that * do get a non-trivial schedule part will get updated regardless and * graph->maxvar is computed based on these ranks. The test for * whether more schedule rows are required in compute_schedule_wcc * is therefore not affected. * * Insert a band corresponding to the schedule row at position "node" * of the schedule tree and continue with the construction of the schedule. * This insertion and the continued construction is performed by split_scaled * after optionally checking for non-trivial common divisors. */ static __isl_give isl_schedule_node *carry_dependences( __isl_take isl_schedule_node *node, struct isl_sched_graph *graph) { int i; int n_edge; int trivial; isl_ctx *ctx; isl_vec *sol; isl_basic_set *lp; if (!node) return NULL; n_edge = 0; for (i = 0; i < graph->n_edge; ++i) n_edge += graph->edge[i].map->n; ctx = isl_schedule_node_get_ctx(node); if (setup_carry_lp(ctx, graph) < 0) return isl_schedule_node_free(node); lp = isl_basic_set_copy(graph->lp); sol = isl_tab_basic_set_non_neg_lexmin(lp); if (!sol) return isl_schedule_node_free(node); if (sol->size == 0) { isl_vec_free(sol); isl_die(ctx, isl_error_internal, "error in schedule construction", return isl_schedule_node_free(node)); } 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 isl_schedule_node_free(node)); } trivial = is_any_trivial(graph, sol); if (trivial < 0) { sol = isl_vec_free(sol); } else if (trivial && graph->scc > 1) { isl_vec_free(sol); return compute_component_schedule(node, graph, 1); } if (update_schedule(graph, sol, 0, 0) < 0) return isl_schedule_node_free(node); if (trivial) graph->n_row--; return split_scaled(node, graph); } /* Topologically sort statements mapped to the same schedule iteration * and add insert a sequence node in front of "node" * corresponding to this order. * * If it turns out to be impossible to sort the statements apart, * because different dependences impose different orderings * on the statements, then we extend the schedule such that * it carries at least one more dependence. */ static __isl_give isl_schedule_node *sort_statements( __isl_take isl_schedule_node *node, struct isl_sched_graph *graph) { isl_ctx *ctx; isl_union_set_list *filters; if (!node) return NULL; ctx = isl_schedule_node_get_ctx(node); if (graph->n < 1) isl_die(ctx, isl_error_internal, "graph should have at least one node", return isl_schedule_node_free(node)); if (graph->n == 1) return node; if (update_edges(ctx, graph) < 0) return isl_schedule_node_free(node); if (graph->n_edge == 0) return node; if (detect_sccs(ctx, graph) < 0) return isl_schedule_node_free(node); next_band(graph); if (graph->scc < graph->n) return carry_dependences(node, graph); filters = extract_sccs(ctx, graph); node = isl_schedule_node_insert_sequence(node, filters); return node; } /* Are there any (non-empty) (conditional) 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 || graph->edge[i].conditional_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 and return the updated schedule node. * * 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 __isl_give isl_schedule_node *compute_schedule_wcc_feautrier( isl_schedule_node *node, struct isl_sched_graph *graph) { return carry_dependences(node, graph); } /* Turn off the "local" bit on all (condition) edges. */ static void clear_local_edges(struct isl_sched_graph *graph) { int i; for (i = 0; i < graph->n_edge; ++i) if (graph->edge[i].condition) graph->edge[i].local = 0; } /* Does "graph" have both condition and conditional validity edges? */ static int need_condition_check(struct isl_sched_graph *graph) { int i; int any_condition = 0; int any_conditional_validity = 0; for (i = 0; i < graph->n_edge; ++i) { if (graph->edge[i].condition) any_condition = 1; if (graph->edge[i].conditional_validity) any_conditional_validity = 1; } return any_condition && any_conditional_validity; } /* Does "graph" contain any coincidence edge? */ static int has_any_coincidence(struct isl_sched_graph *graph) { int i; for (i = 0; i < graph->n_edge; ++i) if (graph->edge[i].coincidence) return 1; return 0; } /* Extract the final schedule row as a map with the iteration domain * of "node" as domain. */ static __isl_give isl_map *final_row(struct isl_sched_node *node) { isl_local_space *ls; isl_aff *aff; int row; row = isl_mat_rows(node->sched) - 1; ls = isl_local_space_from_space(isl_space_copy(node->space)); aff = extract_schedule_row(ls, node, row); return isl_map_from_aff(aff); } /* Is the conditional validity dependence in the edge with index "edge_index" * violated by the latest (i.e., final) row of the schedule? * That is, is i scheduled after j * for any conditional validity dependence i -> j? */ static int is_violated(struct isl_sched_graph *graph, int edge_index) { isl_map *src_sched, *dst_sched, *map; struct isl_sched_edge *edge = &graph->edge[edge_index]; int empty; src_sched = final_row(edge->src); dst_sched = final_row(edge->dst); map = isl_map_copy(edge->map); map = isl_map_apply_domain(map, src_sched); map = isl_map_apply_range(map, dst_sched); map = isl_map_order_gt(map, isl_dim_in, 0, isl_dim_out, 0); empty = isl_map_is_empty(map); isl_map_free(map); if (empty < 0) return -1; return !empty; } /* Does "graph" have any satisfied condition edges that * are adjacent to the conditional validity constraint with * domain "conditional_source" and range "conditional_sink"? * * A satisfied condition is one that is not local. * If a condition was forced to be local already (i.e., marked as local) * then there is no need to check if it is in fact local. * * Additionally, mark all adjacent condition edges found as local. */ static int has_adjacent_true_conditions(struct isl_sched_graph *graph, __isl_keep isl_union_set *conditional_source, __isl_keep isl_union_set *conditional_sink) { int i; int any = 0; for (i = 0; i < graph->n_edge; ++i) { int adjacent, local; isl_union_map *condition; if (!graph->edge[i].condition) continue; if (graph->edge[i].local) continue; condition = graph->edge[i].tagged_condition; adjacent = domain_intersects(condition, conditional_sink); if (adjacent >= 0 && !adjacent) adjacent = range_intersects(condition, conditional_source); if (adjacent < 0) return -1; if (!adjacent) continue; graph->edge[i].local = 1; local = is_condition_false(&graph->edge[i]); if (local < 0) return -1; if (!local) any = 1; } return any; } /* Are there any violated conditional validity dependences with * adjacent condition dependences that are not local with respect * to the current schedule? * That is, is the conditional validity constraint violated? * * Additionally, mark all those adjacent condition dependences as local. * We also mark those adjacent condition dependences that were not marked * as local before, but just happened to be local already. This ensures * that they remain local if the schedule is recomputed. * * We first collect domain and range of all violated conditional validity * dependences and then check if there are any adjacent non-local * condition dependences. */ static int has_violated_conditional_constraint(isl_ctx *ctx, struct isl_sched_graph *graph) { int i; int any = 0; isl_union_set *source, *sink; source = isl_union_set_empty(isl_space_params_alloc(ctx, 0)); sink = isl_union_set_empty(isl_space_params_alloc(ctx, 0)); for (i = 0; i < graph->n_edge; ++i) { isl_union_set *uset; isl_union_map *umap; int violated; if (!graph->edge[i].conditional_validity) continue; violated = is_violated(graph, i); if (violated < 0) goto error; if (!violated) continue; any = 1; umap = isl_union_map_copy(graph->edge[i].tagged_validity); uset = isl_union_map_domain(umap); source = isl_union_set_union(source, uset); source = isl_union_set_coalesce(source); umap = isl_union_map_copy(graph->edge[i].tagged_validity); uset = isl_union_map_range(umap); sink = isl_union_set_union(sink, uset); sink = isl_union_set_coalesce(sink); } if (any) any = has_adjacent_true_conditions(graph, source, sink); isl_union_set_free(source); isl_union_set_free(sink); return any; error: isl_union_set_free(source); isl_union_set_free(sink); return -1; } /* Compute a schedule for a connected dependence graph and return * the updated schedule node. * * 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), with as * many of the initial rows as possible satisfying the coincidence constraints. * 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 * In each case, we first insert a band node in the schedule tree * if any rows have been computed. * * 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 insert a band node * (if any schedule rows were computed) and we finish off by topologically * sorting the statements based on the remaining dependences. * * If ctx->opt->schedule_outer_coincidence is set, then we force the * outermost dimension to satisfy the coincidence constraints. If this * turns out to be impossible, we fall back on the general scheme above * and try to carry as many dependences as possible. * * If "graph" contains both condition and conditional validity dependences, * then we need to check that that the conditional schedule constraint * is satisfied, i.e., there are no violated conditional validity dependences * that are adjacent to any non-local condition dependences. * If there are, then we mark all those adjacent condition dependences * as local and recompute the current band. Those dependences that * are marked local will then be forced to be local. * The initial computation is performed with no dependences marked as local. * If we are lucky, then there will be no violated conditional validity * dependences adjacent to any non-local condition dependences. * Otherwise, we mark some additional condition dependences as local and * recompute. We continue this process until there are no violations left or * until we are no longer able to compute a schedule. * Since there are only a finite number of dependences, * there will only be a finite number of iterations. */ static __isl_give isl_schedule_node *compute_schedule_wcc( __isl_take isl_schedule_node *node, struct isl_sched_graph *graph) { int has_coincidence; int use_coincidence; int force_coincidence = 0; int check_conditional; int insert; isl_ctx *ctx; if (!node) return NULL; ctx = isl_schedule_node_get_ctx(node); if (detect_sccs(ctx, graph) < 0) return isl_schedule_node_free(node); if (sort_sccs(graph) < 0) return isl_schedule_node_free(node); if (compute_maxvar(graph) < 0) return isl_schedule_node_free(node); if (need_feautrier_step(ctx, graph)) return compute_schedule_wcc_feautrier(node, graph); clear_local_edges(graph); check_conditional = need_condition_check(graph); has_coincidence = has_any_coincidence(graph); if (ctx->opt->schedule_outer_coincidence) force_coincidence = 1; use_coincidence = has_coincidence; while (graph->n_row < graph->maxvar) { isl_vec *sol; int violated; int coincident; graph->src_scc = -1; graph->dst_scc = -1; if (setup_lp(ctx, graph, use_coincidence) < 0) return isl_schedule_node_free(node); sol = solve_lp(graph); if (!sol) return isl_schedule_node_free(node); if (sol->size == 0) { int empty = graph->n_total_row == graph->band_start; isl_vec_free(sol); if (use_coincidence && (!force_coincidence || !empty)) { use_coincidence = 0; continue; } if (!ctx->opt->schedule_maximize_band_depth && !empty) return compute_next_band(node, graph, 1); if (graph->src_scc >= 0) return compute_split_schedule(node, graph); if (!empty) return compute_next_band(node, graph, 1); return carry_dependences(node, graph); } coincident = !has_coincidence || use_coincidence; if (update_schedule(graph, sol, 1, coincident) < 0) return isl_schedule_node_free(node); if (!check_conditional) continue; violated = has_violated_conditional_constraint(ctx, graph); if (violated < 0) return isl_schedule_node_free(node); if (!violated) continue; if (reset_band(graph) < 0) return isl_schedule_node_free(node); use_coincidence = has_coincidence; } insert = graph->n_total_row > graph->band_start; if (insert) { node = insert_current_band(node, graph, 1); node = isl_schedule_node_child(node, 0); } node = sort_statements(node, graph); if (insert) node = isl_schedule_node_parent(node); return node; } /* Compute a schedule for each group of nodes identified by node->scc * separately and then combine them in a sequence node (or as set node * if graph->weak is set) inserted at position "node" of the schedule tree. * Return the updated schedule node. * * If "wcc" is set then each of the groups belongs to a single * weakly connected component in the dependence graph so that * there is no need for compute_sub_schedule to look for weakly * connected components. */ static __isl_give isl_schedule_node *compute_component_schedule( __isl_take isl_schedule_node *node, struct isl_sched_graph *graph, int wcc) { int component, i; int n, n_edge; isl_ctx *ctx; isl_union_set_list *filters; if (!node) return NULL; ctx = isl_schedule_node_get_ctx(node); filters = extract_sccs(ctx, graph); if (graph->weak) node = isl_schedule_node_insert_set(node, filters); else node = isl_schedule_node_insert_sequence(node, filters); for (component = 0; component < graph->scc; ++component) { n = 0; for (i = 0; i < graph->n; ++i) if (graph->node[i].scc == component) n++; n_edge = 0; for (i = 0; i < graph->n_edge; ++i) if (graph->edge[i].src->scc == component && graph->edge[i].dst->scc == component) n_edge++; node = isl_schedule_node_child(node, component); node = isl_schedule_node_child(node, 0); node = compute_sub_schedule(node, ctx, graph, n, n_edge, &node_scc_exactly, &edge_scc_exactly, component, wcc); node = isl_schedule_node_parent(node); node = isl_schedule_node_parent(node); } return node; } /* Compute a schedule for the given dependence graph and insert it at "node". * Return the updated schedule node. * * We first check if the graph is connected (through validity and conditional * validity dependences) and, if not, compute a schedule * for each component separately. * If the schedule_serialize_sccs option is set, then we check for strongly * connected components instead and compute a separate schedule for * each such strongly connected component. */ static __isl_give isl_schedule_node *compute_schedule(isl_schedule_node *node, struct isl_sched_graph *graph) { isl_ctx *ctx; if (!node) return NULL; ctx = isl_schedule_node_get_ctx(node); if (isl_options_get_schedule_serialize_sccs(ctx)) { if (detect_sccs(ctx, graph) < 0) return isl_schedule_node_free(node); } else { if (detect_wccs(ctx, graph) < 0) return isl_schedule_node_free(node); } if (graph->scc > 1) return compute_component_schedule(node, graph, 1); return compute_schedule_wcc(node, graph); } /* Compute a schedule on sc->domain that respects the given schedule * constraints. * * In particular, the schedule 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. * * If there are any condition and conditional validity dependences, * then the conditional validity dependences may be violated inside * a tilable band, provided they have no adjacent non-local * condition dependences. * * The context is included in the domain before the nodes of * the graphs are extracted in order to be able to exploit * any possible additional equalities. * However, the returned schedule contains the original domain * (before this intersection). */ __isl_give isl_schedule *isl_schedule_constraints_compute_schedule( __isl_take isl_schedule_constraints *sc) { isl_ctx *ctx = isl_schedule_constraints_get_ctx(sc); struct isl_sched_graph graph = { 0 }; isl_schedule *sched; isl_schedule_node *node; isl_union_set *domain; struct isl_extract_edge_data data; enum isl_edge_type i; int r; sc = isl_schedule_constraints_align_params(sc); if (!sc) return NULL; graph.n = isl_union_set_n_set(sc->domain); if (graph.n == 0) { isl_union_set *domain = isl_union_set_copy(sc->domain); sched = isl_schedule_from_domain(domain); goto done; } if (graph_alloc(ctx, &graph, graph.n, isl_schedule_constraints_n_map(sc)) < 0) goto error; if (compute_max_row(&graph, sc) < 0) goto error; graph.root = 1; graph.n = 0; domain = isl_union_set_copy(sc->domain); domain = isl_union_set_intersect_params(domain, isl_set_copy(sc->context)); r = isl_union_set_foreach_set(domain, &extract_node, &graph); isl_union_set_free(domain); if (r < 0) goto error; if (graph_init_table(ctx, &graph) < 0) goto error; for (i = isl_edge_first; i <= isl_edge_last; ++i) graph.max_edge[i] = isl_union_map_n_map(sc->constraint[i]); if (graph_init_edge_tables(ctx, &graph) < 0) goto error; graph.n_edge = 0; data.graph = &graph; for (i = isl_edge_first; i <= isl_edge_last; ++i) { data.type = i; if (isl_union_map_foreach_map(sc->constraint[i], &extract_edge, &data) < 0) goto error; } node = isl_schedule_node_from_domain(isl_union_set_copy(sc->domain)); node = isl_schedule_node_child(node, 0); if (graph.n > 0) node = compute_schedule(node, &graph); sched = isl_schedule_node_get_schedule(node); isl_schedule_node_free(node); done: graph_free(ctx, &graph); isl_schedule_constraints_free(sc); return sched; error: graph_free(ctx, &graph); isl_schedule_constraints_free(sc); return NULL; } /* Compute a schedule for the given union of domains that respects * all the validity dependences and minimizes * the dependence distances over the proximity dependences. * * This function is kept for backward compatibility. */ __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_schedule_constraints *sc; sc = isl_schedule_constraints_on_domain(domain); sc = isl_schedule_constraints_set_validity(sc, validity); sc = isl_schedule_constraints_set_proximity(sc, proximity); return isl_schedule_constraints_compute_schedule(sc); } cloog-0.18.4/isl/isl_multi_intersect.c0000644000175000017500000000145512554427055014662 00000000000000/* * Copyright 2011 Sven Verdoolaege * Copyright 2012-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 /* Intersect the domain of "multi" with "domain". */ __isl_give MULTI(BASE) *FN(MULTI(BASE),intersect_domain)( __isl_take MULTI(BASE) *multi, __isl_take DOM *domain) { return FN(FN(MULTI(BASE),apply),DOMBASE)(multi, domain, &FN(EL,intersect_domain)); } /* Intersect the parameter domain of "multi" with "domain". */ __isl_give MULTI(BASE) *FN(MULTI(BASE),intersect_params)( __isl_take MULTI(BASE) *multi, __isl_take isl_set *domain) { return FN(MULTI(BASE),apply_set)(multi, domain, &FN(EL,intersect_params)); } cloog-0.18.4/isl/isl_convex_hull.c0000644000175000017500000023004612554427055013776 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * Copyright 2014 INRIA Rocquencourt * * 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 Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt, * B.P. 105 - 78153 Le Chesnay, France */ #include #include #include #include #include #include #include #include #include #include "isl_equalities.h" #include "isl_tab.h" #include 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 && facet->n_eq != 0) isl_die(ctx, isl_error_internal, "unexpected equality", return isl_basic_set_free(facet)); 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 = isl_basic_set_get_ctx(bset1); dir = valid_direction(isl_basic_set_copy(bset1), isl_basic_set_copy(bset2)); if (!dir) goto error; T = isl_mat_alloc(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) return 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; } /* Return an empty basic map living in the same space as "map". */ static __isl_give isl_basic_map *replace_map_by_empty_basic_map( __isl_take isl_map *map) { isl_space *space; space = isl_map_get_space(map); isl_map_free(map); return isl_basic_map_empty(space); } /* 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; map = isl_map_detect_equalities(map); map = isl_map_align_divs(map); if (!map) goto error; if (map->n == 0) return replace_map_by_empty_basic_map(map); 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); if (k < 0) goto error; isl_seq_cpy(hull->ineq[k], ineq, 1 + v.len); 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) return replace_map_by_empty_basic_map(map); 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); hull = isl_basic_map_finalize(hull); 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); } /* Check if "ineq" is a bound on "set" and, if so, add it to "hull". * * For each basic set in "set", we first check if the basic set * contains a translate of "ineq". If this translate is more relaxed, * then we assume that "ineq" is not a bound on this basic set. * Otherwise, we know that it is a bound. * If the basic set does not contain a translate of "ineq", then * we call is_bound to perform the test. */ static __isl_give isl_basic_set *add_bound_from_constraint( __isl_take isl_basic_set *hull, struct sh_data *data, __isl_keep isl_set *set, isl_int *ineq) { int i, k; isl_ctx *ctx; uint32_t c_hash; struct ineq_cmp_data v; if (!hull || !set) return isl_basic_set_free(hull); v.len = isl_basic_set_total_dim(hull); v.p = ineq; c_hash = isl_seq_get_hash(ineq + 1, v.len); ctx = isl_basic_set_get_ctx(hull); for (i = 0; i < set->n; ++i) { int bound; struct isl_hash_table_entry *entry; entry = isl_hash_table_find(ctx, data->p[i].table, c_hash, &has_ineq, &v, 0); if (entry) { isl_int *ineq_i = entry->data; int neg, more_relaxed; neg = isl_seq_is_neg(ineq_i + 1, ineq + 1, v.len); if (neg) isl_int_neg(ineq_i[0], ineq_i[0]); more_relaxed = isl_int_gt(ineq_i[0], ineq[0]); if (neg) isl_int_neg(ineq_i[0], ineq_i[0]); if (more_relaxed) break; else continue; } bound = is_bound(data, set, i, ineq, 0); if (bound < 0) return isl_basic_set_free(hull); if (!bound) break; } if (i < set->n) return hull; k = isl_basic_set_alloc_inequality(hull); if (k < 0) return isl_basic_set_free(hull); isl_seq_cpy(hull->ineq[k], ineq, 1 + v.len); return hull; } /* Compute a superset of the convex hull of "set" that is described * by only some of the "n_ineq" constraints in the list "ineq", where "set" * has no parameters or integer divisions. * * The inequalities in "ineq" are assumed to have been sorted such * that constraints with the same linear part appear together and * that among constraints with the same linear part, those with * smaller constant term appear first. * * We reuse the same data structure that is used by uset_simple_hull, * but we do not need the hull table since we will not consider the * same constraint more than once. We therefore allocate it with zero size. * * We run through the constraints and try to add them one by one, * skipping identical constraints. If we have added a constraint and * the next constraint is a more relaxed translate, then we skip this * next constraint as well. */ static __isl_give isl_basic_set *uset_unshifted_simple_hull_from_constraints( __isl_take isl_set *set, int n_ineq, isl_int **ineq) { int i; int last_added = 0; struct sh_data *data = NULL; isl_basic_set *hull = NULL; unsigned dim; hull = isl_basic_set_alloc_space(isl_set_get_space(set), 0, 0, n_ineq); if (!hull) goto error; data = sh_data_alloc(set, 0); if (!data) goto error; dim = isl_set_dim(set, isl_dim_set); for (i = 0; i < n_ineq; ++i) { int hull_n_ineq = hull->n_ineq; int parallel; parallel = i > 0 && isl_seq_eq(ineq[i - 1] + 1, ineq[i] + 1, dim); if (parallel && (last_added || isl_int_eq(ineq[i - 1][0], ineq[i][0]))) continue; hull = add_bound_from_constraint(hull, data, set, ineq[i]); if (!hull) goto error; last_added = hull->n_ineq > hull_n_ineq; } sh_data_free(data); isl_set_free(set); return hull; error: sh_data_free(data); isl_set_free(set); isl_basic_set_free(hull); return NULL; } /* Collect pointers to all the inequalities in the elements of "list" * in "ineq". For equalities, store both a pointer to the equality and * a pointer to its opposite, which is first copied to "mat". * "ineq" and "mat" are assumed to have been preallocated to the right size * (the number of inequalities + 2 times the number of equalites and * the number of equalities, respectively). */ static __isl_give isl_mat *collect_inequalities(__isl_take isl_mat *mat, __isl_keep isl_basic_set_list *list, isl_int **ineq) { int i, j, n, n_eq, n_ineq; if (!mat) return NULL; n_eq = 0; n_ineq = 0; n = isl_basic_set_list_n_basic_set(list); for (i = 0; i < n; ++i) { isl_basic_set *bset; bset = isl_basic_set_list_get_basic_set(list, i); if (!bset) return isl_mat_free(mat); for (j = 0; j < bset->n_eq; ++j) { ineq[n_ineq++] = mat->row[n_eq]; ineq[n_ineq++] = bset->eq[j]; isl_seq_neg(mat->row[n_eq++], bset->eq[j], mat->n_col); } for (j = 0; j < bset->n_ineq; ++j) ineq[n_ineq++] = bset->ineq[j]; isl_basic_set_free(bset); } return mat; } /* Comparison routine for use as an isl_sort callback. * * Constraints with the same linear part are sorted together and * among constraints with the same linear part, those with smaller * constant term are sorted first. */ static int cmp_ineq(const void *a, const void *b, void *arg) { unsigned dim = *(unsigned *) arg; isl_int * const *ineq1 = a; isl_int * const *ineq2 = b; int cmp; cmp = isl_seq_cmp((*ineq1) + 1, (*ineq2) + 1, dim); if (cmp != 0) return cmp; return isl_int_cmp((*ineq1)[0], (*ineq2)[0]); } /* Compute a superset of the convex hull of "set" that is described * by only constraints in the elements of "list", where "set" has * no parameters or integer divisions. * * We collect all the constraints in those elements and then * sort the constraints such that constraints with the same linear part * are sorted together and that those with smaller constant term are * sorted first. */ static __isl_give isl_basic_set *uset_unshifted_simple_hull_from_basic_set_list( __isl_take isl_set *set, __isl_take isl_basic_set_list *list) { int i, n, n_eq, n_ineq; unsigned dim; isl_ctx *ctx; isl_mat *mat = NULL; isl_int **ineq = NULL; isl_basic_set *hull; if (!set) goto error; ctx = isl_set_get_ctx(set); n_eq = 0; n_ineq = 0; n = isl_basic_set_list_n_basic_set(list); for (i = 0; i < n; ++i) { isl_basic_set *bset; bset = isl_basic_set_list_get_basic_set(list, i); if (!bset) goto error; n_eq += bset->n_eq; n_ineq += 2 * bset->n_eq + bset->n_ineq; isl_basic_set_free(bset); } ineq = isl_alloc_array(ctx, isl_int *, n_ineq); if (n_ineq > 0 && !ineq) goto error; dim = isl_set_dim(set, isl_dim_set); mat = isl_mat_alloc(ctx, n_eq, 1 + dim); mat = collect_inequalities(mat, list, ineq); if (!mat) goto error; if (isl_sort(ineq, n_ineq, sizeof(ineq[0]), &cmp_ineq, &dim) < 0) goto error; hull = uset_unshifted_simple_hull_from_constraints(set, n_ineq, ineq); isl_mat_free(mat); free(ineq); isl_basic_set_list_free(list); return hull; error: isl_mat_free(mat); free(ineq); isl_set_free(set); isl_basic_set_list_free(list); return NULL; } /* Compute a superset of the convex hull of "map" that is described * by only constraints in the elements of "list". * * If the list is empty, then we can only describe the universe set. * If the input map is empty, then all constraints are valid, so * we return the intersection of the elements in "list". * * Otherwise, we align all divs and temporarily treat them * as regular variables, computing the unshifted simple hull in * uset_unshifted_simple_hull_from_basic_set_list. */ static __isl_give isl_basic_map *map_unshifted_simple_hull_from_basic_map_list( __isl_take isl_map *map, __isl_take isl_basic_map_list *list) { isl_basic_map *model; isl_basic_map *hull; isl_set *set; isl_basic_set_list *bset_list; if (!map || !list) goto error; if (isl_basic_map_list_n_basic_map(list) == 0) { isl_space *space; space = isl_map_get_space(map); isl_map_free(map); isl_basic_map_list_free(list); return isl_basic_map_universe(space); } if (isl_map_plain_is_empty(map)) { isl_map_free(map); return isl_basic_map_list_intersect(list); } map = isl_map_align_divs_to_basic_map_list(map, list); if (!map) goto error; list = isl_basic_map_list_align_divs_to_basic_map(list, map->p[0]); model = isl_basic_map_list_get_basic_map(list, 0); set = isl_map_underlying_set(map); bset_list = isl_basic_map_list_underlying_set(list); hull = uset_unshifted_simple_hull_from_basic_set_list(set, bset_list); hull = isl_basic_map_overlying_set(hull, model); return hull; error: isl_map_free(map); isl_basic_map_list_free(list); return NULL; } /* Return a sequence of the basic maps that make up the maps in "list". */ static __isl_give isl_basic_set_list *collect_basic_maps( __isl_take isl_map_list *list) { int i, n; isl_ctx *ctx; isl_basic_map_list *bmap_list; if (!list) return NULL; n = isl_map_list_n_map(list); ctx = isl_map_list_get_ctx(list); bmap_list = isl_basic_map_list_alloc(ctx, 0); for (i = 0; i < n; ++i) { isl_map *map; isl_basic_map_list *list_i; map = isl_map_list_get_map(list, i); map = isl_map_compute_divs(map); list_i = isl_map_get_basic_map_list(map); isl_map_free(map); bmap_list = isl_basic_map_list_concat(bmap_list, list_i); } isl_map_list_free(list); return bmap_list; } /* Compute a superset of the convex hull of "map" that is described * by only constraints in the elements of "list". * * If "map" is the universe, then the convex hull (and therefore * any superset of the convexhull) is the universe as well. * * Otherwise, we collect all the basic maps in the map list and * continue with map_unshifted_simple_hull_from_basic_map_list. */ __isl_give isl_basic_map *isl_map_unshifted_simple_hull_from_map_list( __isl_take isl_map *map, __isl_take isl_map_list *list) { isl_basic_map_list *bmap_list; int is_universe; is_universe = isl_map_plain_is_universe(map); if (is_universe < 0) map = isl_map_free(map); if (is_universe < 0 || is_universe) { isl_map_list_free(list); return isl_map_unshifted_simple_hull(map); } bmap_list = collect_basic_maps(list); return map_unshifted_simple_hull_from_basic_map_list(map, bmap_list); } /* Compute a superset of the convex hull of "set" that is described * by only constraints in the elements of "list". */ __isl_give isl_basic_set *isl_set_unshifted_simple_hull_from_set_list( __isl_take isl_set *set, __isl_take isl_set_list *list) { return isl_map_unshifted_simple_hull_from_map_list(set, list); } /* 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.4/isl/closure.c0000644000175000017500000000161412554427055012252 00000000000000#include #include #include int main(int argc, char **argv) { struct isl_ctx *ctx; struct isl_map *map; struct isl_options *options; isl_printer *p; 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); p = isl_printer_to_file(ctx, stdout); map = isl_map_read_from_file(ctx, stdin); map = isl_map_transitive_closure(map, &exact); if (!exact) p = isl_printer_print_str(p, "# NOT exact\n"); p = isl_printer_print_map(p, map); p = isl_printer_end_line(p); map = isl_map_compute_divs(map); map = isl_map_coalesce(map); p = isl_printer_print_str(p, "# coalesced\n"); p = isl_printer_print_map(p, map); p = isl_printer_end_line(p); isl_map_free(map); isl_printer_free(p); isl_ctx_free(ctx); return 0; } cloog-0.18.4/isl/isl_multi_templ.h0000644000175000017500000000031612554427055014003 00000000000000#include #include 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.4/isl/Makefile.am0000644000175000017500000001711512554427055012471 00000000000000if HAVE_CLANG MAYBE_INTERFACE = interface endif SUBDIRS = . $(MAYBE_INTERFACE) doc DIST_SUBDIRS = $(MAYBE_INTERFACE) doc ACLOCAL_AMFLAGS = -I m4 AUTOMAKE_OPTIONS = nostdinc subdir-objects 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 IMATH_FOR_MP MP_SRC = \ isl_hide_deprecated.h \ isl_imath.c \ isl_imath.h \ isl_int_imath.h \ isl_val_imath.c \ imath_wrap/gmp_compat.h \ imath_wrap/imath.h \ imath_wrap/imrat.h \ imath_wrap/wrap.h \ imath_wrap/gmp_compat.c \ imath_wrap/imath.c \ imath_wrap/imrat.c DEPRECATED_SRC = MP_INCLUDE_H = endif if GMP_FOR_MP if NEED_GET_MEMORY_FUNCTIONS GET_MEMORY_FUNCTIONS=mp_get_memory_functions.c endif MP_SRC = \ $(GET_MEMORY_FUNCTIONS) \ isl_int_gmp.h \ isl_gmp.c \ isl_val_gmp.c DEPRECATED_SRC = isl_ast_int.c MP_INCLUDE_H = include/isl/val_gmp.h endif AM_CPPFLAGS = -I. -I$(srcdir) -I$(srcdir)/include -Iinclude/ @MP_CPPFLAGS@ AM_CFLAGS = @WARNING_FLAGS@ libisl_la_SOURCES = \ $(MP_SRC) \ $(DEPRECATED_SRC) \ 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_blk.h \ 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_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_hash.c \ isl_id_to_ast_expr.c \ isl_id_to_pw_aff.c \ isl_ilp.c \ isl_ilp_private.h \ isl_input.c \ isl_int.h \ isl_local_space_private.h \ isl_local_space.c \ isl_lp.c \ isl_lp_private.h \ isl_map.c \ isl_map_list.c \ isl_map_simplify.c \ isl_map_subtract.c \ isl_map_private.h \ isl_map_to_basic_set.c \ 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_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_band.c \ isl_schedule_band.h \ isl_schedule_node.c \ isl_schedule_node_private.h \ isl_schedule_read.c \ isl_schedule_tree.c \ isl_schedule_tree.h \ isl_schedule_private.h \ isl_scheduler.c \ 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_seq.h \ 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_private.h \ isl_vec_private.h \ isl_vec.c \ isl_version.c \ isl_vertices_private.h \ isl_vertices.c \ isl_yaml.h libisl_la_LIBADD = @MP_LIBS@ libisl_la_LDFLAGS = -version-info @versioninfo@ \ @MP_LDFLAGS@ isl_test_LDFLAGS = @MP_LDFLAGS@ isl_test_LDADD = libisl.la @MP_LIBS@ isl_polyhedron_sample_LDADD = libisl.la isl_polyhedron_sample_SOURCES = \ polyhedron_sample.c isl_pip_LDFLAGS = @MP_LDFLAGS@ isl_pip_LDADD = libisl.la @MP_LIBS@ isl_pip_SOURCES = \ pip.c isl_codegen_LDFLAGS = @MP_LDFLAGS@ isl_codegen_LDADD = libisl.la @MP_LIBS@ isl_codegen_SOURCES = \ codegen.c isl_bound_LDFLAGS = @MP_LDFLAGS@ isl_bound_LDADD = libisl.la @MP_LIBS@ isl_bound_SOURCES = \ bound.c isl_polyhedron_minimize_LDFLAGS = @MP_LDFLAGS@ isl_polyhedron_minimize_LDADD = libisl.la @MP_LIBS@ isl_polyhedron_minimize_SOURCES = \ polyhedron_minimize.c isl_polytope_scan_LDADD = libisl.la isl_polytope_scan_SOURCES = \ polytope_scan.c isl_polyhedron_detect_equalities_LDADD = libisl.la isl_polyhedron_detect_equalities_SOURCES = \ polyhedron_detect_equalities.c isl_cat_LDADD = libisl.la isl_cat_SOURCES = \ cat.c isl_closure_LDADD = libisl.la isl_closure_SOURCES = \ closure.c nodist_pkginclude_HEADERS = \ include/isl/stdint.h pkginclude_HEADERS = \ $(MP_INCLUDE_H) \ include/isl/aff.h \ include/isl/aff_type.h \ include/isl/arg.h \ include/isl/ast.h \ include/isl/ast_type.h \ include/isl/ast_build.h \ include/isl/band.h \ include/isl/constraint.h \ include/isl/ctx.h \ include/isl/flow.h \ include/isl/id.h \ include/isl/id_to_ast_expr.h \ include/isl/id_to_pw_aff.h \ include/isl/ilp.h \ include/isl/hash.h \ include/isl/hmap.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_to_basic_set.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/schedule_node.h \ include/isl/schedule_type.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/vec.h \ include/isl/version.h \ include/isl/vertices.h deprecateddir = $(pkgincludedir)/deprecated deprecated_HEADERS = \ include/isl/deprecated/int.h \ include/isl/deprecated/aff_int.h \ include/isl/deprecated/ast_int.h \ include/isl/deprecated/constraint_int.h \ include/isl/deprecated/ilp_int.h \ include/isl/deprecated/map_int.h \ include/isl/deprecated/mat_int.h \ include/isl/deprecated/point_int.h \ include/isl/deprecated/polynomial_int.h \ include/isl/deprecated/set_int.h \ include/isl/deprecated/union_map_int.h \ include/isl/deprecated/val_int.h \ include/isl/deprecated/vec_int.h EXTRA_DIST = \ LICENSE \ isl_config_post.h \ basis_reduction_templ.c \ isl_hmap_templ.c \ isl_list_templ.c \ isl_list_templ.h \ isl_map_lexopt_templ.c \ isl_multi_macro.h \ isl_multi_templ.c \ isl_multi_templ.h \ isl_multi_apply_templ.c \ isl_multi_apply_set.c \ isl_multi_apply_union_set.c \ isl_multi_floor.c \ isl_multi_gist.c \ isl_multi_intersect.c \ print_templ.c \ isl_power_templ.c \ isl_pw_templ.c \ isl_union_templ.c \ isl.py \ doc/CodingStyle \ doc/SubmittingPatches \ doc/chicago.bst \ doc/chicago.sty \ doc/implementation.tex \ doc/isl.bib \ doc/mypod2latex \ doc/manual.tex \ doc/user.pod \ imath/gmp_compat.c \ imath/gmp_compat.h \ imath/imath.c \ imath/imath.h \ imath/imrat.c \ imath/imrat.h \ 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.4/isl/isl_vec.c0000644000175000017500000002714712554427055012233 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 #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; } __isl_null isl_vec *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]); } isl_bool isl_vec_is_equal(__isl_keep isl_vec *vec1, __isl_keep isl_vec *vec2) { if (!vec1 || !vec2) return isl_bool_error; if (vec1->size != vec2->size) return isl_bool_false; 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; } /* Move the "n" elements starting as "src_pos" of "vec" * to "dst_pos". The elements originally at "dst_pos" are moved * up or down depending on whether "dst_pos" is smaller or greater * than "src_pos". */ __isl_give isl_vec *isl_vec_move_els(__isl_take isl_vec *vec, unsigned dst_pos, unsigned src_pos, unsigned n) { isl_vec *res; if (!vec) return NULL; if (src_pos + n > vec->size) isl_die(vec->ctx, isl_error_invalid, "source range out of bounds", return isl_vec_free(vec)); if (dst_pos + n > vec->size) isl_die(vec->ctx, isl_error_invalid, "destination range out of bounds", return isl_vec_free(vec)); if (n == 0 || dst_pos == src_pos) return vec; res = isl_vec_alloc(vec->ctx, vec->size); if (!res) return isl_vec_free(vec); if (dst_pos < src_pos) { isl_seq_cpy(res->el, vec->el, dst_pos); isl_seq_cpy(res->el + dst_pos, vec->el + src_pos, n); isl_seq_cpy(res->el + dst_pos + n, vec->el + dst_pos, src_pos - dst_pos); isl_seq_cpy(res->el + src_pos + n, vec->el + src_pos + n, res->size - src_pos - n); } else { isl_seq_cpy(res->el, vec->el, src_pos); isl_seq_cpy(res->el + src_pos, vec->el + src_pos + n, dst_pos - src_pos); isl_seq_cpy(res->el + dst_pos, vec->el + src_pos, n); isl_seq_cpy(res->el + dst_pos + n, vec->el + dst_pos + n, res->size - dst_pos - n); } isl_vec_free(vec); return res; } cloog-0.18.4/isl/isl_multi_templ.c0000644000175000017500000010513012554427055013776 00000000000000/* * Copyright 2011 Sven Verdoolaege * Copyright 2012-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 #include #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; } /* Return the position of the dimension of the given type and name * in "multi". * Return -1 if no such dimension can be found. */ int FN(MULTI(BASE),find_dim_by_name)(__isl_keep MULTI(BASE) *multi, enum isl_dim_type type, const char *name) { if (!multi) return -1; return isl_space_find_dim_by_name(multi->space, type, name); } __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; } __isl_null MULTI(BASE) *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; } #ifndef NO_DIMS /* Check whether "multi" has non-zero coefficients 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. */ isl_bool FN(MULTI(BASE),involves_dims)(__isl_keep MULTI(BASE) *multi, enum isl_dim_type type, unsigned first, unsigned n) { int i; if (!multi) return isl_bool_error; if (multi->n == 0 || n == 0) return isl_bool_false; for (i = 0; i < multi->n; ++i) { isl_bool involves; involves = FN(EL,involves_dims)(multi->p[i], type, first, n); if (involves < 0 || involves) return involves; } return isl_bool_false; } __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); } #endif unsigned FN(MULTI(BASE),dim)(__isl_keep MULTI(BASE) *multi, enum isl_dim_type type) { return multi ? isl_space_dim(multi->space, type) : 0; } /* Return the position of the first dimension of "type" with id "id". * Return -1 if there is no such dimension. */ int FN(MULTI(BASE),find_dim_by_id)(__isl_keep MULTI(BASE) *multi, enum isl_dim_type type, __isl_keep isl_id *id) { if (!multi) return -1; return isl_space_find_dim_by_id(multi->space, type, id); } /* Return the id of the given dimension. */ __isl_give isl_id *FN(MULTI(BASE),get_dim_id)(__isl_keep MULTI(BASE) *multi, enum isl_dim_type type, unsigned pos) { return multi ? isl_space_get_dim_id(multi->space, type, pos) : NULL; } __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; } /* Does the specified tuple have an id? */ isl_bool FN(MULTI(BASE),has_tuple_id)(__isl_keep MULTI(BASE) *multi, enum isl_dim_type type) { if (!multi) return isl_bool_error; return isl_space_has_tuple_id(multi->space, type); } /* Return the id of the specified tuple. */ __isl_give isl_id *FN(MULTI(BASE),get_tuple_id)(__isl_keep MULTI(BASE) *multi, enum isl_dim_type type) { return multi ? isl_space_get_tuple_id(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; int match; multi = FN(MULTI(BASE),cow)(multi); if (!multi || !el) goto error; multi_space = FN(MULTI(BASE),get_space)(multi); match = FN(EL,matching_params)(el, multi_space); if (match < 0) goto error; if (!match) { multi = FN(MULTI(BASE),align_params)(multi, FN(EL,get_space)(el)); isl_space_free(multi_space); multi_space = FN(MULTI(BASE),get_space)(multi); el = FN(EL,align_params)(el, isl_space_copy(multi_space)); } 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); } /* Set the id of the given dimension of "multi" to "id". */ __isl_give MULTI(BASE) *FN(MULTI(BASE),set_dim_id)( __isl_take MULTI(BASE) *multi, enum isl_dim_type type, unsigned pos, __isl_take isl_id *id) { isl_space *space; multi = FN(MULTI(BASE),cow)(multi); if (!multi || !id) goto error; space = FN(MULTI(BASE),get_space)(multi); space = isl_space_set_dim_id(space, type, pos, id); return FN(MULTI(BASE),reset_space)(multi, space); error: isl_id_free(id); FN(MULTI(BASE),free)(multi); return NULL; } __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_take MULTI(BASE) *multi, enum isl_dim_type type, __isl_take isl_id *id) { isl_space *space; multi = FN(MULTI(BASE),cow)(multi); if (!multi) goto error; space = FN(MULTI(BASE),get_space)(multi); space = isl_space_set_tuple_id(space, type, id); return FN(MULTI(BASE),reset_space)(multi, space); error: isl_id_free(id); return NULL; } /* Drop the id on the specified tuple. */ __isl_give MULTI(BASE) *FN(MULTI(BASE),reset_tuple_id)( __isl_take MULTI(BASE) *multi, enum isl_dim_type type) { isl_space *space; if (!multi) return NULL; if (!FN(MULTI(BASE),has_tuple_id)(multi, type)) return multi; multi = FN(MULTI(BASE),cow)(multi); if (!multi) return NULL; space = FN(MULTI(BASE),get_space)(multi); space = isl_space_reset_tuple_id(space, type); return FN(MULTI(BASE),reset_space)(multi, space); } /* Reset the user pointer on all identifiers of parameters and tuples * of the space of "multi". */ __isl_give MULTI(BASE) *FN(MULTI(BASE),reset_user)( __isl_take MULTI(BASE) *multi) { isl_space *space; space = FN(MULTI(BASE),get_space)(multi); space = isl_space_reset_user(space); 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; isl_reordering *exp; if (!multi || !model) goto error; if (isl_space_match(multi->space, isl_dim_param, model, isl_dim_param)) { isl_space_free(model); return multi; } 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); 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; } __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 #ifndef NO_ZERO /* 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; } #endif #ifndef NO_FROM_BASE /* Create a multiple expression with a single output/set dimension * equal to "el". * For most multiple expression types, the base type has a single * output/set dimension and the space of the result is therefore * the same as the space of the input. * In the case of isl_multi_union_pw_aff, however, the base type * lives in a parameter space and we therefore need to add * a single set dimension. */ __isl_give MULTI(BASE) *FN(FN(MULTI(BASE),from),BASE)(__isl_take EL *el) { isl_space *space; MULTI(BASE) *multi; space = FN(EL,get_space(el)); if (isl_space_is_params(space)) { space = isl_space_set_from_params(space); space = isl_space_add_dims(space, isl_dim_set, 1); } multi = FN(MULTI(BASE),alloc)(space); 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; } /* Align the parameters of "multi1" and "multi2" (if needed) and call "fn". */ static __isl_give MULTI(BASE) *FN(MULTI(BASE),align_params_multi_multi_and)( __isl_take MULTI(BASE) *multi1, __isl_take MULTI(BASE) *multi2, __isl_give MULTI(BASE) *(*fn)(__isl_take MULTI(BASE) *multi1, __isl_take MULTI(BASE) *multi2)) { isl_ctx *ctx; if (!multi1 || !multi2) goto error; if (isl_space_match(multi1->space, isl_dim_param, multi2->space, isl_dim_param)) return fn(multi1, multi2); ctx = FN(MULTI(BASE),get_ctx)(multi1); if (!isl_space_has_named_params(multi1->space) || !isl_space_has_named_params(multi2->space)) isl_die(ctx, isl_error_invalid, "unaligned unnamed parameters", goto error); multi1 = FN(MULTI(BASE),align_params)(multi1, FN(MULTI(BASE),get_space)(multi2)); multi2 = FN(MULTI(BASE),align_params)(multi2, FN(MULTI(BASE),get_space)(multi1)); return fn(multi1, multi2); error: FN(MULTI(BASE),free)(multi1); FN(MULTI(BASE),free)(multi2); return NULL; } /* Given two MULTI(BASE)s A -> B and C -> D, * construct a MULTI(BASE) (A * C) -> [B -> D]. * * The parameters are assumed to have been aligned. */ static __isl_give MULTI(BASE) *FN(MULTI(BASE),range_product_aligned)( __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; } /* 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) { return FN(MULTI(BASE),align_params_multi_multi_and)(multi1, multi2, &FN(MULTI(BASE),range_product_aligned)); } /* Is the range of "multi" a wrapped relation? */ isl_bool FN(MULTI(BASE),range_is_wrapping)(__isl_keep MULTI(BASE) *multi) { if (!multi) return isl_bool_error; return isl_space_range_is_wrapping(multi->space); } /* Given a function A -> [B -> C], extract the function A -> B. */ __isl_give MULTI(BASE) *FN(MULTI(BASE),range_factor_domain)( __isl_take MULTI(BASE) *multi) { isl_space *space; int total, keep; if (!multi) return NULL; if (!isl_space_range_is_wrapping(multi->space)) isl_die(FN(MULTI(BASE),get_ctx)(multi), isl_error_invalid, "range is not a product", return FN(MULTI(BASE),free)(multi)); space = FN(MULTI(BASE),get_space)(multi); total = isl_space_dim(space, isl_dim_out); space = isl_space_range_factor_domain(space); keep = isl_space_dim(space, isl_dim_out); multi = FN(MULTI(BASE),drop_dims)(multi, isl_dim_out, keep, total - keep); multi = FN(MULTI(BASE),reset_space)(multi, space); return multi; } /* Given a function A -> [B -> C], extract the function A -> C. */ __isl_give MULTI(BASE) *FN(MULTI(BASE),range_factor_range)( __isl_take MULTI(BASE) *multi) { isl_space *space; int total, keep; if (!multi) return NULL; if (!isl_space_range_is_wrapping(multi->space)) isl_die(FN(MULTI(BASE),get_ctx)(multi), isl_error_invalid, "range is not a product", return FN(MULTI(BASE),free)(multi)); space = FN(MULTI(BASE),get_space)(multi); total = isl_space_dim(space, isl_dim_out); space = isl_space_range_factor_range(space); keep = isl_space_dim(space, isl_dim_out); multi = FN(MULTI(BASE),drop_dims)(multi, isl_dim_out, 0, total - keep); multi = FN(MULTI(BASE),reset_space)(multi, space); return multi; } #ifndef NO_PRODUCT /* Given two MULTI(BASE)s A -> B and C -> D, * construct a MULTI(BASE) [A -> C] -> [B -> D]. * * The parameters are assumed to have been aligned. */ __isl_give MULTI(BASE) *FN(MULTI(BASE),product_aligned)( __isl_take MULTI(BASE) *multi1, __isl_take MULTI(BASE) *multi2) { int i; EL *el; isl_space *space; MULTI(BASE) *res; int in1, in2, out1, out2; in1 = FN(MULTI(BASE),dim)(multi1, isl_dim_in); in2 = FN(MULTI(BASE),dim)(multi2, isl_dim_in); out1 = FN(MULTI(BASE),dim)(multi1, isl_dim_out); out2 = FN(MULTI(BASE),dim)(multi2, isl_dim_out); space = isl_space_product(FN(MULTI(BASE),get_space)(multi1), FN(MULTI(BASE),get_space)(multi2)); res = FN(MULTI(BASE),alloc)(isl_space_copy(space)); space = isl_space_domain(space); for (i = 0; i < out1; ++i) { el = FN(FN(MULTI(BASE),get),BASE)(multi1, i); el = FN(EL,insert_dims)(el, isl_dim_in, in1, in2); el = FN(EL,reset_domain_space)(el, isl_space_copy(space)); res = FN(FN(MULTI(BASE),set),BASE)(res, i, el); } for (i = 0; i < out2; ++i) { el = FN(FN(MULTI(BASE),get),BASE)(multi2, i); el = FN(EL,insert_dims)(el, isl_dim_in, 0, in1); el = FN(EL,reset_domain_space)(el, isl_space_copy(space)); res = FN(FN(MULTI(BASE),set),BASE)(res, out1 + i, el); } isl_space_free(space); FN(MULTI(BASE),free)(multi1); FN(MULTI(BASE),free)(multi2); return res; } /* 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),product)( __isl_take MULTI(BASE) *multi1, __isl_take MULTI(BASE) *multi2) { return FN(MULTI(BASE),align_params_multi_multi_and)(multi1, multi2, &FN(MULTI(BASE),product_aligned)); } #endif __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; } #ifndef NO_SPLICE /* 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; } #endif /* 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; } /* Subtract "multi2" from "multi1" and return the result. * * The parameters of "multi1" and "multi2" are assumed to have been aligned. */ static __isl_give MULTI(BASE) *FN(MULTI(BASE),sub_aligned)( __isl_take MULTI(BASE) *multi1, __isl_take MULTI(BASE) *multi2) { return FN(MULTI(BASE),bin_op)(multi1, multi2, &FN(EL,sub)); } /* Subtract "multi2" from "multi1" and return the result. */ __isl_give MULTI(BASE) *FN(MULTI(BASE),sub)(__isl_take MULTI(BASE) *multi1, __isl_take MULTI(BASE) *multi2) { return FN(MULTI(BASE),align_params_multi_multi_and)(multi1, multi2, &FN(MULTI(BASE),sub_aligned)); } /* 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); } /* Divide the elements of "multi" by "v" and return the result. */ __isl_give MULTI(BASE) *FN(MULTI(BASE),scale_down_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); if (isl_val_is_zero(v)) isl_die(isl_val_get_ctx(v), isl_error_invalid, "cannot scale down by zero", 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_down_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_is_equal(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); } /* Divide the elements of "multi" by the corresponding element of "mv" * and return the result. */ __isl_give MULTI(BASE) *FN(MULTI(BASE),scale_down_multi_val)( __isl_take MULTI(BASE) *multi, __isl_take isl_multi_val *mv) { int i; if (!multi || !mv) goto error; if (!isl_space_tuple_is_equal(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_down_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); } /* Compute the residues of the elements of "multi" modulo * the corresponding element of "mv" and return the result. */ __isl_give MULTI(BASE) *FN(MULTI(BASE),mod_multi_val)( __isl_take MULTI(BASE) *multi, __isl_take isl_multi_val *mv) { int i; if (!multi || !mv) goto error; if (!isl_space_tuple_is_equal(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,mod_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); } #ifndef NO_MOVE_DIMS /* Move the "n" dimensions of "src_type" starting at "src_pos" of "multi" * to dimensions of "dst_type" at "dst_pos". * * We only support moving input dimensions to parameters and vice versa. */ __isl_give MULTI(BASE) *FN(MULTI(BASE),move_dims)(__isl_take MULTI(BASE) *multi, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, unsigned n) { int i; if (!multi) return NULL; if (n == 0 && !isl_space_is_named_or_nested(multi->space, src_type) && !isl_space_is_named_or_nested(multi->space, dst_type)) return multi; if (dst_type == isl_dim_out || src_type == isl_dim_out) isl_die(FN(MULTI(BASE),get_ctx)(multi), isl_error_invalid, "cannot move output/set dimension", return FN(MULTI(BASE),free)(multi)); if (dst_type == isl_dim_div || src_type == isl_dim_div) isl_die(FN(MULTI(BASE),get_ctx)(multi), isl_error_invalid, "cannot move divs", return FN(MULTI(BASE),free)(multi)); if (src_pos + n > isl_space_dim(multi->space, src_type)) isl_die(FN(MULTI(BASE),get_ctx)(multi), isl_error_invalid, "range out of bounds", return FN(MULTI(BASE),free)(multi)); if (dst_type == src_type) isl_die(FN(MULTI(BASE),get_ctx)(multi), isl_error_unsupported, "moving dims within the same type not supported", return FN(MULTI(BASE),free)(multi)); multi = FN(MULTI(BASE),cow)(multi); if (!multi) return NULL; multi->space = isl_space_move_dims(multi->space, dst_type, dst_pos, src_type, src_pos, n); if (!multi->space) return FN(MULTI(BASE),free)(multi); for (i = 0; i < multi->n; ++i) { multi->p[i] = FN(EL,move_dims)(multi->p[i], dst_type, dst_pos, src_type, src_pos, n); if (!multi->p[i]) return FN(MULTI(BASE),free)(multi); } return multi; } #endif /* Convert a multiple expression defined over a parameter domain * into one that is defined over a zero-dimensional set. */ __isl_give MULTI(BASE) *FN(MULTI(BASE),from_range)( __isl_take MULTI(BASE) *multi) { isl_space *space; if (!multi) return NULL; if (!isl_space_is_set(multi->space)) isl_die(FN(MULTI(BASE),get_ctx)(multi), isl_error_invalid, "not living in a set space", return FN(MULTI(BASE),free)(multi)); space = FN(MULTI(BASE),get_space)(multi); space = isl_space_from_range(space); multi = FN(MULTI(BASE),reset_space)(multi, space); return multi; } /* Are "multi1" and "multi2" obviously equal? */ isl_bool FN(MULTI(BASE),plain_is_equal)(__isl_keep MULTI(BASE) *multi1, __isl_keep MULTI(BASE) *multi2) { int i; isl_bool equal; if (!multi1 || !multi2) return isl_bool_error; if (multi1->n != multi2->n) return isl_bool_false; equal = isl_space_is_equal(multi1->space, multi2->space); if (equal < 0 || !equal) return equal; for (i = 0; i < multi1->n; ++i) { equal = FN(EL,plain_is_equal)(multi1->p[i], multi2->p[i]); if (equal < 0 || !equal) return equal; } return isl_bool_true; } #ifndef NO_DOMAIN /* Return the shared domain of the elements of "multi". */ __isl_give isl_set *FN(MULTI(BASE),domain)(__isl_take MULTI(BASE) *multi) { int i; isl_set *dom; if (!multi) return NULL; dom = isl_set_universe(FN(MULTI(BASE),get_domain_space)(multi)); for (i = 0; i < multi->n; ++i) { isl_set *dom_i; dom_i = FN(EL,domain)(FN(FN(MULTI(BASE),get),BASE)(multi, i)); dom = isl_set_intersect(dom, dom_i); } FN(MULTI(BASE),free)(multi); return dom; } #endif #ifndef NO_NEG /* Return the opposite of "multi". */ __isl_give MULTI(BASE) *FN(MULTI(BASE),neg)(__isl_take MULTI(BASE) *multi) { int i; multi = FN(MULTI(BASE),cow)(multi); if (!multi) return NULL; for (i = 0; i < multi->n; ++i) { multi->p[i] = FN(EL,neg)(multi->p[i]); if (!multi->p[i]) return FN(MULTI(BASE),free)(multi); } return multi; } #endif cloog-0.18.4/isl/isl_bound.h0000644000175000017500000000047612413256472012563 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.4/isl/isl_config_post.h0000644000175000017500000000037712413271702013757 00000000000000#ifndef HAVE___ATTRIBUTE__ #define __attribute__(x) #endif #if (HAVE_DECL_FFS==0) && (HAVE_DECL___BUILTIN_FFS==1) #define ffs __builtin_ffs #endif #ifdef GCC_WARN_UNUSED_RESULT #define WARN_UNUSED GCC_WARN_UNUSED_RESULT #else #define WARN_UNUSED #endif cloog-0.18.4/isl/isl_multi_macro.h0000644000175000017500000000043012554427055013760 00000000000000#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) #undef DOM #define DOM CAT(isl_,DOMBASE) cloog-0.18.4/isl/print.c0000644000175000017500000000421412554427055011731 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 multi_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 union_pw_aff #include #undef BASE #define BASE multi_union_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.4/isl/test-driver0000755000175000017500000001027712413256717012634 00000000000000#! /bin/sh # test-driver - basic testsuite driver script. scriptversion=2013-07-13.22; # UTC # Copyright (C) 2011-2013 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. # This file is maintained in Automake, please report # bugs to or send patches to # . # Make unconditional expansion of undefined variables an error. This # helps a lot in preventing typo-related bugs. set -u usage_error () { echo "$0: $*" >&2 print_usage >&2 exit 2 } print_usage () { cat <$log_file 2>&1 estatus=$? if test $enable_hard_errors = no && test $estatus -eq 99; then estatus=1 fi case $estatus:$expect_failure in 0:yes) col=$red res=XPASS recheck=yes gcopy=yes;; 0:*) col=$grn res=PASS recheck=no gcopy=no;; 77:*) col=$blu res=SKIP recheck=no gcopy=yes;; 99:*) col=$mgn res=ERROR recheck=yes gcopy=yes;; *:yes) col=$lgn res=XFAIL recheck=no gcopy=yes;; *:*) col=$red res=FAIL recheck=yes gcopy=yes;; esac # Report outcome to console. echo "${col}${res}${std}: $test_name" # Register the test result, and other relevant metadata. echo ":test-result: $res" > $trs_file echo ":global-test-result: $res" >> $trs_file echo ":recheck: $recheck" >> $trs_file echo ":copy-in-global-log: $gcopy" >> $trs_file # 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.4/isl/isl_map_lexopt_templ.c0000644000175000017500000000777312413256472015027 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.4/isl/isl_mat_private.h0000644000175000017500000000275212413271702013757 00000000000000#include #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); __isl_give isl_mat *isl_mat_scale_down_row(__isl_take isl_mat *mat, int row, isl_int m); __isl_give isl_vec *isl_mat_get_row(__isl_keep isl_mat *mat, unsigned row); int isl_mat_is_scaled_identity(__isl_keep isl_mat *mat); 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); int isl_mat_get_element(__isl_keep isl_mat *mat, int row, int col, isl_int *v); __isl_give isl_mat *isl_mat_set_element(__isl_take isl_mat *mat, int row, int col, isl_int v); cloog-0.18.4/isl/pip_test.sh.in0000755000175000017500000000114712413256472013223 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.4/isl/LICENSE0000644000175000017500000000202212413256472011426 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.4/isl/isl_map_simplify.c0000644000175000017500000027273612554427055014155 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * Copyright 2012-2013 Ecole Normale Superieure * Copyright 2014 INRIA Rocquencourt * * 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 * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt, * B.P. 105 - 78153 Le Chesnay, France */ #include #include #include #include "isl_equalities.h" #include #include #include "isl_tab.h" #include #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 __isl_give isl_basic_map *eliminate_div(__isl_take 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); bmap = isl_basic_map_drop_div(bmap, div); return bmap; } /* 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; bmap = eliminate_div(bmap, bmap->eq[i], d, 1); if (isl_basic_map_drop_equality(bmap, i) < 0) return isl_basic_map_free(bmap); 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; size = round_up(4 * bmap->n_div / 3 - 1); if (size == 0) return bmap; elim_for = isl_calloc_array(ctx, int, bmap->n_div); bits = ffs(size) - 1; index = isl_calloc_array(ctx, int, size); if (!elim_for || !index) goto out; 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); bmap = eliminate_div(bmap, eq.data, l, 1); if (!bmap) break; 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; } __isl_give isl_basic_map *isl_basic_map_remove_duplicate_constraints( __isl_take 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); if (size == 0) return bmap; 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; } /* Detect all pairs of inequalities that form an equality. * * isl_basic_map_remove_duplicate_constraints detects at most one such pair. * Call it repeatedly while it is making progress. */ __isl_give isl_basic_map *isl_basic_map_detect_inequality_pairs( __isl_take isl_basic_map *bmap, int *progress) { int duplicate; do { duplicate = 0; bmap = isl_basic_map_remove_duplicate_constraints(bmap, &duplicate, 0); if (progress && duplicate) *progress = 1; } while (duplicate); 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) * * * Note that one of the div constraints may have been eliminated * due to being redundant with respect to the constraint that is * being modified by this function. The modified constraint may * no longer imply this div constraint, so we add it back to make * sure we do not lose any information. * * 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); } bmap = isl_basic_map_extend_constraints(bmap, 0, 1); if (isl_basic_map_add_div_constraint(bmap, i, s) < 0) return isl_basic_map_free(bmap); } } 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 = isl_basic_map_remove_duplicate_constraints(bmap, &progress, 1); if (bmap && progress) ISL_F_CLR(bmap, ISL_BASIC_MAP_REDUCED_COEFFICIENTS); } 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 constraints from a basic map or * when the divs of a basic map have been temporarily aligned * with the divs of another basic map. */ 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 = isl_basic_map_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 || !context) return bset; size = round_up(4 * (context->n_ineq+1) / 3 - 1); if (size == 0) return bset; 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; } /* Remove constraints from "bmap" that are identical to constraints * in "context" or that are more relaxed (greater constant term). * * We perform the test for shifted copies on the pure constraints * in remove_shifted_constraints. */ static __isl_give isl_basic_map *isl_basic_map_remove_shifted_constraints( __isl_take isl_basic_map *bmap, __isl_take isl_basic_map *context) { isl_basic_set *bset, *bset_context; if (!bmap || !context) goto error; if (bmap->n_ineq == 0 || context->n_ineq == 0) { isl_basic_map_free(context); return bmap; } context = isl_basic_map_align_divs(context, bmap); bmap = isl_basic_map_align_divs(bmap, context); bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap)); bset_context = isl_basic_map_underlying_set(context); bset = remove_shifted_constraints(bset, bset_context); isl_basic_set_free(bset_context); bmap = isl_basic_map_overlying_set(bset, bmap); return bmap; error: isl_basic_map_free(bmap); isl_basic_map_free(context); return NULL; } /* 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; if (isl_tab_extend_cons(tab, bset->n_ineq) < 0) goto error; 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); aff = isl_basic_set_copy(bset); aff = isl_basic_set_intersect(aff, isl_basic_set_copy(context)); aff = isl_basic_set_affine_hull(aff); if (!aff) goto error; if (isl_basic_set_plain_is_empty(aff)) { isl_basic_set_free(bset); isl_basic_set_free(context); return aff; } bset = isl_basic_set_sort_constraints(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; bmap = isl_basic_map_cow(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; } /* Return a basic map that has the same intersection with "context" as "bmap" * and that is as "simple" as possible. * * The core computation is performed on the pure constraints. * When we add back the meaning of the integer divisions, we need * to (re)introduce the div constraints. If we happen to have * discovered that some of these integer divisions are equal to * some affine combination of other variables, then these div * constraints may end up getting simplified in terms of the equalities, * resulting in extra inequalities on the other variables that * may have been removed already or that may not even have been * part of the input. We try and remove those constraints of * this form that are most obviously redundant with respect to * the context. We also remove those div constraints that are * redundant with respect to the other constraints in the result. */ struct isl_basic_map *isl_basic_map_gist(struct isl_basic_map *bmap, struct isl_basic_map *context) { isl_basic_set *bset, *eq; isl_basic_map *eq_bmap; unsigned n_div, n_eq, n_ineq; 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_space *space = isl_basic_map_get_space(bmap); isl_basic_map_free(bmap); isl_basic_map_free(context); return isl_basic_map_universe(space); } 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); n_div = isl_basic_map_dim(bmap, isl_dim_div); bset = uset_gist(isl_basic_map_underlying_set(isl_basic_map_copy(bmap)), isl_basic_map_underlying_set(isl_basic_map_copy(context))); if (!bset || bset->n_eq == 0 || n_div == 0 || isl_basic_set_plain_is_empty(bset)) { isl_basic_map_free(context); return isl_basic_map_overlying_set(bset, bmap); } n_eq = bset->n_eq; n_ineq = bset->n_ineq; eq = isl_basic_set_copy(bset); eq = isl_basic_set_cow(eq); if (isl_basic_set_free_inequality(eq, n_ineq) < 0) eq = isl_basic_set_free(eq); if (isl_basic_set_free_equality(bset, n_eq) < 0) bset = isl_basic_set_free(bset); eq_bmap = isl_basic_map_overlying_set(eq, isl_basic_map_copy(bmap)); eq_bmap = isl_basic_map_remove_shifted_constraints(eq_bmap, context); bmap = isl_basic_map_overlying_set(bset, bmap); bmap = isl_basic_map_intersect(bmap, eq_bmap); bmap = isl_basic_map_remove_redundancies(bmap); return 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_space *space = isl_map_get_space(map); isl_map_free(map); isl_basic_map_free(context); return isl_map_universe(space); } 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 is 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. * During this computation, we make use of a single disjunct context, * so if the original context consists of more than one disjunct * then we need to approximate the context by a single disjunct set. * Simply taking the simple hull may drop constraints that are * only implicitly available in each disjunct. We therefore also * look for constraints among those defining "map" that are valid * for the context. These can then be used to simplify away * the corresponding constraints in "map". */ static __isl_give isl_map *map_gist(__isl_take isl_map *map, __isl_take isl_map *context) { int equal; int is_universe; isl_basic_map *hull; 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); if (!context) goto error; if (isl_map_n_basic_map(context) == 1) { hull = isl_map_simple_hull(context); } else { isl_ctx *ctx; isl_map_list *list; ctx = isl_map_get_ctx(map); list = isl_map_list_alloc(ctx, 2); list = isl_map_list_add(list, isl_map_copy(context)); list = isl_map_list_add(list, isl_map_copy(map)); hull = isl_map_unshifted_simple_hull_from_map_list(context, list); } return isl_map_gist_basic_map(map, hull); 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); } /* Compute the gist of "bmap" with respect to the constraints "context" * on the domain. */ __isl_give isl_basic_map *isl_basic_map_gist_domain( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *context) { isl_space *space = isl_basic_map_get_space(bmap); isl_basic_map *bmap_context = isl_basic_map_universe(space); bmap_context = isl_basic_map_intersect_domain(bmap_context, context); return isl_basic_map_gist(bmap, bmap_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. */ isl_bool 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 isl_bool_error; isl_assert(bmap1->ctx, isl_space_is_equal(bmap1->dim, bmap2->dim), return isl_bool_error); if (bmap1->n_div || bmap2->n_div) return isl_bool_false; if (!bmap1->n_eq && !bmap2->n_eq) return isl_bool_false; total = isl_space_dim(bmap1->dim, isl_dim_all); if (total == 0) return isl_bool_false; 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 isl_bool_false; disjoint: isl_vec_free(v); free(elim); return isl_bool_true; error: isl_vec_free(v); free(elim); return isl_bool_error; } 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". */ isl_bool isl_map_plain_is_disjoint(__isl_keep isl_map *map1, __isl_keep isl_map *map2) { int i, j; isl_bool disjoint; isl_bool intersect; isl_bool match; if (!map1 || !map2) return isl_bool_error; 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_is_equal(map1->dim, isl_dim_in, map2->dim, isl_dim_in); if (match < 0 || !match) return match < 0 ? isl_bool_error : isl_bool_true; match = isl_space_tuple_is_equal(map1->dim, isl_dim_out, map2->dim, isl_dim_out); if (match < 0 || !match) return match < 0 ? isl_bool_error : isl_bool_true; match = isl_space_match(map1->dim, isl_dim_param, map2->dim, isl_dim_param); if (match < 0 || !match) return match < 0 ? isl_bool_error : isl_bool_false; intersect = isl_map_plain_is_equal(map1, map2); if (intersect < 0 || intersect) return intersect < 0 ? isl_bool_error : isl_bool_false; for (i = 0; i < map1->n; ++i) { for (j = 0; j < map2->n; ++j) { isl_bool d = isl_basic_map_plain_is_disjoint(map1->p[i], map2->p[j]); if (d != isl_bool_true) return d; } } return isl_bool_true; } /* 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. */ isl_bool isl_map_is_disjoint(__isl_keep isl_map *map1, __isl_keep isl_map *map2) { isl_bool disjoint; isl_bool 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 ? isl_bool_error : isl_bool_false; intersect = isl_map_plain_is_universe(map2); if (intersect < 0 || intersect) return intersect < 0 ? isl_bool_error : isl_bool_false; test = isl_map_intersect(isl_map_copy(map1), isl_map_copy(map2)); disjoint = isl_map_is_empty(test); isl_map_free(test); return disjoint; } /* Are "bmap1" and "bmap2" 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. */ isl_bool isl_basic_map_is_disjoint(__isl_keep isl_basic_map *bmap1, __isl_keep isl_basic_map *bmap2) { isl_bool disjoint; isl_bool intersect; isl_basic_map *test; disjoint = isl_basic_map_plain_is_disjoint(bmap1, bmap2); if (disjoint < 0 || disjoint) return disjoint; disjoint = isl_basic_map_is_empty(bmap1); if (disjoint < 0 || disjoint) return disjoint; disjoint = isl_basic_map_is_empty(bmap2); if (disjoint < 0 || disjoint) return disjoint; intersect = isl_basic_map_is_universe(bmap1); if (intersect < 0 || intersect) return intersect < 0 ? isl_bool_error : isl_bool_false; intersect = isl_basic_map_is_universe(bmap2); if (intersect < 0 || intersect) return intersect < 0 ? isl_bool_error : isl_bool_false; test = isl_basic_map_intersect(isl_basic_map_copy(bmap1), isl_basic_map_copy(bmap2)); disjoint = isl_basic_map_is_empty(test); isl_basic_map_free(test); return disjoint; } /* Are "bset1" and "bset2" disjoint? */ isl_bool isl_basic_set_is_disjoint(__isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2) { return isl_basic_map_is_disjoint(bset1, bset2); } isl_bool 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? */ isl_bool isl_set_is_disjoint(__isl_keep isl_set *set1, __isl_keep isl_set *set2) { return isl_map_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); } /* Does "bmap" satisfy any equality that involves more than 2 variables * and/or has coefficients different from -1 and 1? */ static int has_multiple_var_equality(__isl_keep isl_basic_map *bmap) { int i; unsigned total; total = isl_basic_map_dim(bmap, isl_dim_all); for (i = 0; i < bmap->n_eq; ++i) { int j, k; j = isl_seq_first_non_zero(bmap->eq[i] + 1, total); if (j < 0) continue; if (!isl_int_is_one(bmap->eq[i][1 + j]) && !isl_int_is_negone(bmap->eq[i][1 + j])) return 1; j += 1; k = isl_seq_first_non_zero(bmap->eq[i] + 1 + j, total - j); if (k < 0) continue; j += k; if (!isl_int_is_one(bmap->eq[i][1 + j]) && !isl_int_is_negone(bmap->eq[i][1 + j])) return 1; j += 1; k = isl_seq_first_non_zero(bmap->eq[i] + 1 + j, total - j); if (k >= 0) return 1; } return 0; } /* Remove any common factor g from the constraint coefficients in "v". * The constant term is stored in the first position and is replaced * by floor(c/g). If any common factor is removed and if this results * in a tightening of the constraint, then set *tightened. */ static __isl_give isl_vec *normalize_constraint(__isl_take isl_vec *v, int *tightened) { isl_ctx *ctx; if (!v) return NULL; ctx = isl_vec_get_ctx(v); isl_seq_gcd(v->el + 1, v->size - 1, &ctx->normalize_gcd); if (isl_int_is_zero(ctx->normalize_gcd)) return v; if (isl_int_is_one(ctx->normalize_gcd)) return v; v = isl_vec_cow(v); if (!v) return NULL; if (tightened && !isl_int_is_divisible_by(v->el[0], ctx->normalize_gcd)) *tightened = 1; isl_int_fdiv_q(v->el[0], v->el[0], ctx->normalize_gcd); isl_seq_scale_down(v->el + 1, v->el + 1, ctx->normalize_gcd, v->size - 1); return v; } /* If "bmap" is an integer set that satisfies any equality involving * more than 2 variables and/or has coefficients different from -1 and 1, * then use variable compression to reduce the coefficients by removing * any (hidden) common factor. * In particular, apply the variable compression to each constraint, * factor out any common factor in the non-constant coefficients and * then apply the inverse of the compression. * At the end, we mark the basic map as having reduced constants. * If this flag is still set on the next invocation of this function, * then we skip the computation. * * Removing a common factor may result in a tightening of some of * the constraints. If this happens, then we may end up with two * opposite inequalities that can be replaced by an equality. * We therefore call isl_basic_map_detect_inequality_pairs, * which checks for such pairs of inequalities as well as eliminate_divs_eq * and isl_basic_map_gauss if such a pair was found. */ __isl_give isl_basic_map *isl_basic_map_reduce_coefficients( __isl_take isl_basic_map *bmap) { unsigned total; isl_ctx *ctx; isl_vec *v; isl_mat *eq, *T, *T2; int i; int tightened; if (!bmap) return NULL; if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_REDUCED_COEFFICIENTS)) return bmap; if (isl_basic_map_is_rational(bmap)) return bmap; if (bmap->n_eq == 0) return bmap; if (!has_multiple_var_equality(bmap)) return bmap; total = isl_basic_map_dim(bmap, isl_dim_all); ctx = isl_basic_map_get_ctx(bmap); v = isl_vec_alloc(ctx, 1 + total); if (!v) return isl_basic_map_free(bmap); eq = isl_mat_sub_alloc6(ctx, bmap->eq, 0, bmap->n_eq, 0, 1 + total); T = isl_mat_variable_compression(eq, &T2); if (!T || !T2) goto error; if (T->n_col == 0) { isl_mat_free(T); isl_mat_free(T2); isl_vec_free(v); return isl_basic_map_set_to_empty(bmap); } tightened = 0; for (i = 0; i < bmap->n_ineq; ++i) { isl_seq_cpy(v->el, bmap->ineq[i], 1 + total); v = isl_vec_mat_product(v, isl_mat_copy(T)); v = normalize_constraint(v, &tightened); v = isl_vec_mat_product(v, isl_mat_copy(T2)); if (!v) goto error; isl_seq_cpy(bmap->ineq[i], v->el, 1 + total); } isl_mat_free(T); isl_mat_free(T2); isl_vec_free(v); ISL_F_SET(bmap, ISL_BASIC_MAP_REDUCED_COEFFICIENTS); if (tightened) { int progress = 0; bmap = isl_basic_map_detect_inequality_pairs(bmap, &progress); if (progress) { bmap = eliminate_divs_eq(bmap, &progress); bmap = isl_basic_map_gauss(bmap, NULL); } } return bmap; error: isl_mat_free(T); isl_mat_free(T2); isl_vec_free(v); return isl_basic_map_free(bmap); } /* Shift the integer division at position "div" of "bmap" by "shift". * * That is, if the integer division has the form * * floor(f(x)/d) * * then replace it by * * floor((f(x) + shift * d)/d) - shift */ __isl_give isl_basic_map *isl_basic_map_shift_div( __isl_take isl_basic_map *bmap, int div, isl_int shift) { int i; unsigned total; if (!bmap) return NULL; total = isl_basic_map_dim(bmap, isl_dim_all); total -= isl_basic_map_dim(bmap, isl_dim_div); isl_int_addmul(bmap->div[div][1], shift, bmap->div[div][0]); for (i = 0; i < bmap->n_eq; ++i) { if (isl_int_is_zero(bmap->eq[i][1 + total + div])) continue; isl_int_submul(bmap->eq[i][0], shift, bmap->eq[i][1 + total + div]); } for (i = 0; i < bmap->n_ineq; ++i) { if (isl_int_is_zero(bmap->ineq[i][1 + total + div])) continue; isl_int_submul(bmap->ineq[i][0], shift, bmap->ineq[i][1 + total + div]); } 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 + total + div])) continue; isl_int_submul(bmap->div[i][1], shift, bmap->div[i][1 + 1 + total + div]); } return bmap; } cloog-0.18.4/isl/m4/0000755000175000017500000000000012555417256011033 500000000000000cloog-0.18.4/isl/m4/ax_cc_maxopt.m40000644000175000017500000001644312413256472013664 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.4/isl/m4/ax_gcc_archflag.m40000644000175000017500000002141412413256472014264 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.4/isl/m4/ax_c___attribute__.m40000644000175000017500000000476712413256472015016 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.4/isl/m4/lt~obsolete.m40000644000175000017500000001375612413256714013574 00000000000000# lt~obsolete.m4 -- aclocal satisfying obsolete definitions. -*-Autoconf-*- # # Copyright (C) 2004, 2005, 2007, 2009 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.4/isl/m4/ax_create_pkgconfig_info.m40000644000175000017500000003415512413256472016214 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.4/isl/m4/ax_check_compiler_flags.m40000644000175000017500000000632312413256472016026 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.4/isl/m4/ax_detect_imath.m40000644000175000017500000000071512413271702014325 00000000000000AC_DEFUN([AX_DETECT_IMATH], [ AC_DEFINE([USE_IMATH_FOR_MP], [], [use imath to implement isl_int]) MP_CPPFLAGS="-I$srcdir/imath_wrap" MP_LDFLAGS="" MP_LIBS="" SAVE_CPPFLAGS="$CPPFLAGS" CPPFLAGS="$MP_CPPFLAGS $CPPFLAGS" AC_CHECK_HEADER([imath.h], [], [AC_ERROR([imath.h header not found])]) AC_CHECK_HEADER([gmp_compat.h], [], [AC_ERROR([gmp_compat.h header not found])]) CPPFLAGS="$SAVE_CPPFLAGS" AM_CONDITIONAL(NEED_GET_MEMORY_FUNCTIONS, test x = xfalse) ]) cloog-0.18.4/isl/m4/ltsugar.m40000644000175000017500000001042412413256713012667 00000000000000# ltsugar.m4 -- libtool m4 base layer. -*-Autoconf-*- # # Copyright (C) 2004, 2005, 2007, 2008 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.4/isl/m4/ltversion.m40000644000175000017500000000126212413256714013234 00000000000000# ltversion.m4 -- version numbers -*- Autoconf -*- # # Copyright (C) 2004 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 3337 ltversion.m4 # This file is part of GNU Libtool m4_define([LT_PACKAGE_VERSION], [2.4.2]) m4_define([LT_PACKAGE_REVISION], [1.3337]) AC_DEFUN([LTVERSION_VERSION], [macro_version='2.4.2' macro_revision='1.3337' _LT_DECL(, macro_version, 0, [Which release of libtool.m4 was used?]) _LT_DECL(, macro_revision, 0) ]) cloog-0.18.4/isl/m4/libtool.m40000644000175000017500000106011112413256713012651 00000000000000# libtool.m4 - Configure libtool for the host system. -*-Autoconf-*- # # 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 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 57 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 which 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 "X${COLLECT_NAMES+set}" != Xset; 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\\"\\\`\\\\\\"" ;; *) 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\\"\\\`\\\\\\"" ;; *) 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 $lt_write_fail = 0 && 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 "$silent" = yes && 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 which 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$TIMESTAMP) $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 "X${COLLECT_NAMES+set}" != Xset; 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) _LT_PROG_REPLACE_SHELLFNS 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' TIMESTAMP='$TIMESTAMP' 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 $_lt_result -eq 0; 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 $_lt_result -eq 0 && $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 "$lt_cv_apple_cc_single_mod" = "yes"; then _lt_dar_single_mod='$single_module' fi if test "$lt_cv_ld_exported_symbols_list" = "yes"; 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 "$lt_cv_ld_force_load" = "no"; 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 "$lt_cv_ld_force_load" = "yes"; 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*) _lt_dar_can_shared=yes ;; *) _lt_dar_can_shared=$GCC ;; esac if test "$_lt_dar_can_shared" = "yes"; 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 "$lt_cv_apple_cc_single_mod" != "yes"; 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 "${lt_cv_aix_libpath+set}" = 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 which will find a shell with a builtin # printf (which 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], [ --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 "$GCC" = yes; 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 in which 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 "x$enable_libtool_lock" != xno && 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 which ABI we are using. 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 which ABI we are using. echo '[#]line '$LINENO' "configure"' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then if test "$lt_cv_prog_gnu_ld" = yes; 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* ;; x86_64-*kfreebsd*-gnu|x86_64-*linux*|powerpc*-*linux*| \ s390*-*linux*|s390*-*tpf*|sparc*-*linux*) # Find out which ABI we are using. 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-*) LD="${LD-ld} -m elf32lppclinux" ;; powerpc64-*) 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-*) LD="${LD-ld} -m elf64lppc" ;; powerpc-*) 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 x"$lt_cv_cc_needs_belf" != x"yes"; then # this is probably gcc 2.8.0, egcs 1.0 or newer; no need for -belf CFLAGS="$SAVE_CFLAGS" fi ;; *-*solaris*) # Find out which ABI we are using. 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*) 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 "$ac_status" -eq 0; then # Ensure the archiver fails upon bogus file names. rm -f conftest.$ac_objext libconftest.a AC_TRY_EVAL([lt_ar_try]) if test "$ac_status" -ne 0; then lt_cv_ar_at_file=@ fi fi rm -f conftest.* libconftest.a ]) ]) if test "x$lt_cv_ar_at_file" = xno; 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 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" # 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 x"[$]$2" = xyes; 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 x"[$]$2" = xyes; 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; ;; netbsd* | freebsd* | openbsd* | darwin* | dragonfly*) # 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 $i != 17 # 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 "$cross_compiling" = yes; 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 "x$enable_dlopen" != xyes; 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 ]) ;; *) 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 "x$lt_cv_dlopen" != xno; then enable_dlopen=yes else enable_dlopen=no fi case $lt_cv_dlopen in dlopen) save_CPPFLAGS="$CPPFLAGS" test "x$ac_cv_header_dlfcn_h" = xyes && 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 "x$lt_cv_dlopen_self" = xyes; 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 "$_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)" = no && test "$need_locks" != no; 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 "$hard_links" = no; 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 in which 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 "X$_LT_TAGVAR(hardcode_automatic, $1)" = "Xyes" ; then # We can hardcode non-existent directories. if test "$_LT_TAGVAR(hardcode_direct, $1)" != no && # 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 "$_LT_TAGVAR(hardcode_shlibpath_var, $1)" != no && test "$_LT_TAGVAR(hardcode_minus_L, $1)" != no; 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 "$_LT_TAGVAR(hardcode_action, $1)" = relink || test "$_LT_TAGVAR(inherit_rpath, $1)" = yes; then # Fast installation is not supported enable_fast_install=no elif test "$shlibpath_overrides_runpath" = yes || test "$enable_shared" = no; 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 "$GCC" = yes; 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` 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" else 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 "$host_cpu" = ia64; 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 can not hardcode correct # soname into executable. Probably we can add versioning support to # collect2, so additional links can be useful in future. if test "$aix_use_runtimelinking" = yes; 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%'\''`; test $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=yes 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 "X$HPUX_IA64_MODE" = X32; 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 "$lt_cv_prog_gnu_ld" = yes; 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 ;; # 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' ;; netbsdelf*-gnu) version_type=linux 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='NetBSD ld.elf_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*) version_type=sunos sys_lib_dlsearch_path_spec="/usr/lib" need_lib_prefix=no # Some older versions of OpenBSD (3.3 at least) *do* need versioned libs. case $host_os in openbsd3.3 | openbsd3.3.*) need_version=yes ;; *) need_version=no ;; esac 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 if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then case $host_os in openbsd2.[[89]] | openbsd2.[[89]].*) shlibpath_overrides_runpath=no ;; *) shlibpath_overrides_runpath=yes ;; esac else shlibpath_overrides_runpath=yes fi ;; 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 "$with_gnu_ld" = yes; 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 "$with_gnu_ld" = yes; 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 "$dynamic_linker" = no && can_build_shared=no variables_saved_for_relink="PATH $shlibpath_var $runpath_var" if test "$GCC" = yes; then variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH" fi if test "${lt_cv_sys_lib_search_path_spec+set}" = set; then sys_lib_search_path_spec="$lt_cv_sys_lib_search_path_spec" fi if test "${lt_cv_sys_lib_dlsearch_path_spec+set}" = 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 which 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 which 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 "$withval" = no || with_gnu_ld=yes], [with_gnu_ld=no])dnl ac_prog=ld if test "$GCC" = yes; 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 "$with_gnu_ld" = yes; 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* | netbsdelf*-gnu) 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*) if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; 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 ;; *) case `"$tmp_nm" -p /dev/null 2>&1 | sed '1q'` in */dev/null*) lt_cv_path_NM="$tmp_nm -p" break ;; *) 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 "$lt_cv_path_NM" != "no"; 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 /dev/null 2>&1 | sed '1q'` in *COFF*) DUMPBIN="$DUMPBIN -symbols" ;; *) 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 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 "x$lt_cv_path_mainfest_tool" != xyes; then MANIFEST_TOOL=: fi _LT_DECL([], [MANIFEST_TOOL], [1], [Manifest tool])dnl ])# _LT_PATH_MANIFEST_TOOL # 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 "$GCC" = yes; 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 "$host_cpu" = ia64; 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 # 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 -e 's/^T .* \(.*\)$/extern int \1();/p' -e 's/^$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 -e 's/^: \([[^ ]]*\)[[ ]]*$/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([[^ ]]*\) \([[^ ]]*\)$/ {\"\2\", (void *) \&\2},/p'" lt_cv_sys_global_symbol_to_c_name_address_lib_prefix="sed -n -e 's/^: \([[^ ]]*\)[[ ]]*$/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([[^ ]]*\) \(lib[[^ ]]*\)$/ {\"\2\", (void *) \&\2},/p' -e 's/^$symcode* \([[^ ]]*\) \([[^ ]]*\)$/ {\"lib\2\", (void *) \&\2},/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 # and D for any global 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};"\ " \$ 0!~/External *\|/{next};"\ " / 0+ UNDEF /{next}; / UNDEF \([^|]\)*()/{next};"\ " {if(hide[section]) next};"\ " {f=0}; \$ 0~/\(\).*\|/{f=1}; {printf f ? \"T \" : \"D \"};"\ " {split(\$ 0, a, /\||\r/); split(a[2], s)};"\ " s[1]~/^[@?]/{print s[1], s[1]; next};"\ " s[1]~prfx {split(s[1],t,\"@\"); print 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 con'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* \(.*\) \(.*\)$/ {\"\2\", (void *) \&\2},/" < "$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 "$pipe_works" = yes; 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_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_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 "$GXX" = yes; 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 "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' fi ;; 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 "$host_cpu" = ia64; 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 "$host_cpu" != ia64; 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* | netbsdelf*-gnu) ;; *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 "$GCC" = yes; 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 "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' fi ;; 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 "$host_cpu" = ia64; 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 ;; 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' ;; 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 which 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 ;; linux* | k*bsd*-gnu | gnu*) _LT_TAGVAR(link_all_deplibs, $1)=no ;; *) _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 "$GCC" != yes; then with_gnu_ld=no fi ;; interix*) # we just hope/assume this is gcc and not c89 (= MSVC++) with_gnu_ld=yes ;; openbsd*) with_gnu_ld=no ;; linux* | k*bsd*-gnu | gnu*) _LT_TAGVAR(link_all_deplibs, $1)=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 "$with_gnu_ld" = yes; 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 "$lt_use_gnu_ld_interface" = yes; 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 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 "$host_cpu" != ia64; 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 (1st line # is EXPORTS), use it as is; otherwise, prepend... _LT_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; 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 "$host_os" = linux-dietlibc; 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 "$tmp_diet" = no 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' ;; 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 "x$supports_anon_versioning" = xyes; 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 "x$supports_anon_versioning" = xyes; 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* | netbsdelf*-gnu) 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 can not *** 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 "$_LT_TAGVAR(ld_shlibs, $1)" = no; 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 "$GCC" = yes && 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 "$host_cpu" = ia64; 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 $ld_flag = "-brtl" || test $ld_flag = "-Wl,-brtl"); 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 "$GCC" = yes; 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 "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi _LT_TAGVAR(link_all_deplibs, $1)=no else # not using gcc if test "$host_cpu" = ia64; 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 "$aix_use_runtimelinking" = yes; 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 "$aix_use_runtimelinking" = yes; 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 "x${allow_undefined_flag}" != "x"; then func_echo_all "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; 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 "$with_gnu_ld" = yes; 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~linknames=' _LT_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then sed -n -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' -e '1\\\!p' < $export_symbols > $output_objdir/$soname.exp; else sed -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' < $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 "$GCC" = yes; 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 $output_objdir/$soname = $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 $output_objdir/$soname = $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 "$GCC" = yes && test "$with_gnu_ld" = no; 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 "$with_gnu_ld" = no; 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 "$GCC" = yes && test "$with_gnu_ld" = no; 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 "$with_gnu_ld" = no; 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 "$GCC" = yes; 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 "$lt_cv_irix_exported_symbol" = yes; 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* | netbsdelf*-gnu) 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*) 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__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; 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 case $host_os in openbsd[[01]].* | openbsd2.[[0-7]] | openbsd2.[[0-7]].*) _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' ;; *) _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' ;; esac 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 "$GCC" = yes; 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 "$GCC" = yes; 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 "$GCC" = yes; 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 "$GCC" = yes; 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 "x$host_vendor" = xsequent; 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 "$GCC" = yes; 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 can NOT 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 "$GCC" = yes; 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 x$host_vendor = xsni; 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 "$_LT_TAGVAR(ld_shlibs, $1)" = no && 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 "$enable_shared" = yes && test "$GCC" = yes; 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 which 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 "$can_build_shared" = "no" && 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 "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[[4-9]]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && 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 "$enable_shared" = yes || 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 "X$CXX" != "Xno" && ( (test "X$CXX" = "Xg++" && `g++ -v >/dev/null 2>&1` ) || (test "X$CXX" != "Xg++"))) ; 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 "$_lt_caught_CXX_error" != yes; 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 "$GXX" = yes; 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 "$GXX" = yes; 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 "$with_gnu_ld" = yes; 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 "$host_cpu" = ia64; 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 "$GXX" = yes; 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 "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi else # not using gcc if test "$host_cpu" = ia64; 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 "$aix_use_runtimelinking" = yes; 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 "$aix_use_runtimelinking" = yes; 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 "x${allow_undefined_flag}" != "x"; then func_echo_all "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; 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 "$with_gnu_ld" = yes; 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~linknames=' _LT_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then $SED -n -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' -e '1\\\!p' < $export_symbols > $output_objdir/$soname.exp; else $SED -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' < $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 (1st line # is EXPORTS), use it as is; otherwise, prepend... _LT_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; 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 $output_objdir/$soname = $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 "$GXX" = yes; 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 $output_objdir/$soname = $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 $with_gnu_ld = no; 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 "$GXX" = yes; then if test $with_gnu_ld = no; 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 "$GXX" = yes; then if test "$with_gnu_ld" = no; 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 "x$supports_anon_versioning" = xyes; 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 ;; openbsd2*) # C++ shared libraries are fairly broken _LT_TAGVAR(ld_shlibs, $1)=no ;; openbsd*) 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__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; 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 "$GXX" = yes && test "$with_gnu_ld" = no; 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 "$GXX" = yes && test "$with_gnu_ld" = no; 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 $LDFLAGS $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 -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 $LDFLAGS $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 -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 can NOT 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 "$_LT_TAGVAR(ld_shlibs, $1)" = no && 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 "$_lt_caught_CXX_error" != yes 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 ${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 ])# _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 $p = "-L" || test $p = "-R"; 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 "$pre_test_object_deps_done" = no; 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 "$pre_test_object_deps_done" = no; 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 "$solaris_use_stlport4" != yes; 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 "$solaris_use_stlport4" != yes; 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 "X$F77" = "Xno"; 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 "$_lt_disable_F77" != yes; 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 "$can_build_shared" = "no" && 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 "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[[4-9]]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && 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 "$enable_shared" = yes || 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 "$_lt_disable_F77" != yes 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 "X$FC" = "Xno"; 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 "$_lt_disable_FC" != yes; 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 "$can_build_shared" = "no" && 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 "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[[4-9]]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && 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 "$enable_shared" = yes || 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 "$_lt_disable_FC" != yes 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 "x${GCJFLAGS+set}" = xset || 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 $lt_ac_count -gt 10 && 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], [AC_MSG_CHECKING([whether the shell understands some XSI constructs]) # Try some XSI features xsi_shell=no ( _lt_dummy="a/b/c" test "${_lt_dummy##*/},${_lt_dummy%/*},${_lt_dummy#??}"${_lt_dummy%"$_lt_dummy"}, \ = c,a/b,b/c, \ && eval 'test $(( 1 + 1 )) -eq 2 \ && test "${#_lt_dummy}" -eq 5' ) >/dev/null 2>&1 \ && xsi_shell=yes AC_MSG_RESULT([$xsi_shell]) _LT_CONFIG_LIBTOOL_INIT([xsi_shell='$xsi_shell']) AC_MSG_CHECKING([whether the shell understands "+="]) lt_shell_append=no ( foo=bar; set foo baz; eval "$[1]+=\$[2]" && test "$foo" = barbaz ) \ >/dev/null 2>&1 \ && lt_shell_append=yes AC_MSG_RESULT([$lt_shell_append]) _LT_CONFIG_LIBTOOL_INIT([lt_shell_append='$lt_shell_append']) 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_PROG_FUNCTION_REPLACE (FUNCNAME, REPLACEMENT-BODY) # ------------------------------------------------------ # In `$cfgfile', look for function FUNCNAME delimited by `^FUNCNAME ()$' and # '^} FUNCNAME ', and replace its body with REPLACEMENT-BODY. m4_defun([_LT_PROG_FUNCTION_REPLACE], [dnl { sed -e '/^$1 ()$/,/^} # $1 /c\ $1 ()\ {\ m4_bpatsubsts([$2], [$], [\\], [^\([ ]\)], [\\\1]) } # Extended-shell $1 implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: ]) # _LT_PROG_REPLACE_SHELLFNS # ------------------------- # Replace existing portable implementations of several shell functions with # equivalent extended shell implementations where those features are available.. m4_defun([_LT_PROG_REPLACE_SHELLFNS], [if test x"$xsi_shell" = xyes; then _LT_PROG_FUNCTION_REPLACE([func_dirname], [dnl case ${1} in */*) func_dirname_result="${1%/*}${2}" ;; * ) func_dirname_result="${3}" ;; esac]) _LT_PROG_FUNCTION_REPLACE([func_basename], [dnl func_basename_result="${1##*/}"]) _LT_PROG_FUNCTION_REPLACE([func_dirname_and_basename], [dnl case ${1} in */*) func_dirname_result="${1%/*}${2}" ;; * ) func_dirname_result="${3}" ;; esac func_basename_result="${1##*/}"]) _LT_PROG_FUNCTION_REPLACE([func_stripname], [dnl # pdksh 5.2.14 does not do ${X%$Y} correctly if both X and Y are # positional parameters, so assign one to ordinary parameter first. func_stripname_result=${3} func_stripname_result=${func_stripname_result#"${1}"} func_stripname_result=${func_stripname_result%"${2}"}]) _LT_PROG_FUNCTION_REPLACE([func_split_long_opt], [dnl func_split_long_opt_name=${1%%=*} func_split_long_opt_arg=${1#*=}]) _LT_PROG_FUNCTION_REPLACE([func_split_short_opt], [dnl func_split_short_opt_arg=${1#??} func_split_short_opt_name=${1%"$func_split_short_opt_arg"}]) _LT_PROG_FUNCTION_REPLACE([func_lo2o], [dnl case ${1} in *.lo) func_lo2o_result=${1%.lo}.${objext} ;; *) func_lo2o_result=${1} ;; esac]) _LT_PROG_FUNCTION_REPLACE([func_xform], [ func_xform_result=${1%.*}.lo]) _LT_PROG_FUNCTION_REPLACE([func_arith], [ func_arith_result=$(( $[*] ))]) _LT_PROG_FUNCTION_REPLACE([func_len], [ func_len_result=${#1}]) fi if test x"$lt_shell_append" = xyes; then _LT_PROG_FUNCTION_REPLACE([func_append], [ eval "${1}+=\\${2}"]) _LT_PROG_FUNCTION_REPLACE([func_append_quoted], [dnl func_quote_for_eval "${2}" dnl m4 expansion turns \\\\ into \\, and then the shell eval turns that into \ eval "${1}+=\\\\ \\$func_quote_for_eval_result"]) # Save a `func_append' function call where possible by direct use of '+=' sed -e 's%func_append \([[a-zA-Z_]]\{1,\}\) "%\1+="%g' $cfgfile > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: else # Save a `func_append' function call even when '+=' is not available sed -e 's%func_append \([[a-zA-Z_]]\{1,\}\) "%\1="$\1%g' $cfgfile > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: fi if test x"$_lt_function_replace_fail" = x":"; then AC_MSG_WARN([Unable to substitute extended shell functions in $ofile]) fi ]) # _LT_PATH_CONVERSION_FUNCTIONS # ----------------------------- # Determine which 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.4/isl/m4/ax_set_warning_flags.m40000644000175000017500000000127212413256472015375 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.4/isl/m4/ax_submodule.m40000644000175000017500000000365612413256472013710 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.4/isl/m4/ax_gcc_warn_unused_result.m40000644000175000017500000000472312413256472016451 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.4/isl/m4/ax_compiler_vendor.m40000644000175000017500000000604612413256472015074 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.4/isl/m4/ax_gcc_x86_cpuid.m40000644000175000017500000000634312413256472014332 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.4/isl/m4/ax_create_stdint_h.m40000644000175000017500000006202012413256472015036 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.4/isl/m4/ax_detect_git_head.m40000644000175000017500000000175112413270107014766 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; then gitdir=`GIT_DIR=$srcdir/.git git rev-parse --git-dir` GIT_HEAD="$gitdir/index" GIT_REPO="$gitdir" GIT_HEAD_ID=`GIT_DIR=$GIT_REPO git describe --always` elif test -f $srcdir/.git/HEAD; then GIT_HEAD="$srcdir/.git/index" GIT_REPO="$srcdir/.git" GIT_HEAD_ID=`GIT_DIR=$GIT_REPO git describe --always` 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 --always\`" fi ]) cloog-0.18.4/isl/m4/ax_detect_gmp.m40000644000175000017500000000267312413271702014013 00000000000000AC_DEFUN([AX_DETECT_GMP], [ AC_DEFINE([USE_GMP_FOR_MP], [], [use gmp to implement isl_int]) AX_SUBMODULE(gmp,system|build,system) case "$with_gmp" in system) if test "x$with_gmp_prefix" != "x"; then isl_configure_args="$isl_configure_args --with-gmp=$with_gmp_prefix" MP_CPPFLAGS="-I$with_gmp_prefix/include" MP_LDFLAGS="-L$with_gmp_prefix/lib" fi MP_LIBS=-lgmp SAVE_CPPFLAGS="$CPPFLAGS" SAVE_LDFLAGS="$LDFLAGS" SAVE_LIBS="$LIBS" CPPFLAGS="$MP_CPPFLAGS $CPPFLAGS" LDFLAGS="$MP_LDFLAGS $LDFLAGS" LIBS="$MP_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) MP_CPPFLAGS="-I$gmp_srcdir -I$with_gmp_builddir" MP_LIBS="$with_gmp_builddir/libgmp.la" ;; esac SAVE_CPPFLAGS="$CPPFLAGS" SAVE_LDFLAGS="$LDFLAGS" SAVE_LIBS="$LIBS" CPPFLAGS="$MP_CPPFLAGS $CPPFLAGS" LDFLAGS="$MP_LDFLAGS $LDFLAGS" LIBS="$MP_LIBS $LIBS" need_get_memory_functions=false AC_CHECK_DECLS(mp_get_memory_functions,[],[ need_get_memory_functions=true ],[#include ]) CPPFLAGS="$SAVE_CPPFLAGS" LDFLAGS="$SAVE_LDFLAGS" LIBS="$SAVE_LIBS" AM_CONDITIONAL(NEED_GET_MEMORY_FUNCTIONS, test x$need_get_memory_functions = xtrue) ]) cloog-0.18.4/isl/m4/ltoptions.m40000644000175000017500000003007312413256713013243 00000000000000# Helper functions for option handling. -*- Autoconf -*- # # Copyright (C) 2004, 2005, 2007, 2008, 2009 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 7 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=default]) test -z "$pic_mode" && 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.4/isl/isl_aff_private.h0000644000175000017500000001143712554427055013744 00000000000000#ifndef ISL_AFF_PRIVATE_H #define ISL_AFF_PRIVATE_H #include #include #include #include #include #include /* ls represents the domain space. * * If the first two elements of "v" (the denominator and the constant term) * are zero, then the isl_aff represents NaN. */ 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_vec(__isl_take isl_local_space *ls, __isl_take isl_vec *v); __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); int isl_aff_get_constant(__isl_keep isl_aff *aff, isl_int *v); __isl_give isl_aff *isl_aff_set_constant(__isl_take isl_aff *aff, isl_int 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_add_constant(__isl_take isl_aff *aff, isl_int v); __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); __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_down(__isl_take isl_pw_aff *pwaff, isl_int f); int isl_aff_matching_params(__isl_keep isl_aff *aff, __isl_keep isl_space *space); 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_multi_aff *isl_multi_aff_from_basic_set_equalities( __isl_take isl_basic_set *bset); __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_aff *isl_aff_substitute_equalities(__isl_take isl_aff *aff, __isl_take isl_basic_set *eq); __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_matching_params(__isl_keep isl_pw_aff *pa, __isl_keep isl_space *space); 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 #undef EL #define EL isl_union_pw_aff #include #undef BASE #define BASE union_pw_aff #include #undef EL #define EL isl_union_pw_multi_aff #include #endif cloog-0.18.4/isl/isl_gmp.c0000644000175000017500000000114012413271702012210 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 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; } cloog-0.18.4/isl/isl_sample.h0000644000175000017500000000162212413270107012716 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_H #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.4/isl/isl_printer_private.h0000644000175000017500000000155312554427055014671 00000000000000#include #include struct isl_printer_ops; /* A printer to a file or a string. * * yaml_style is the YAML style in which the next elements should * be printed and may be either ISL_YAML_STYLE_BLOCK or ISL_YAML_STYLE_FLOW, * with ISL_YAML_STYLE_FLOW being the default. * yaml_state keeps track of the currently active YAML elements. * yaml_size is the size of this arrays, while yaml_depth * is the number of elements currently in use. * yaml_state may be NULL if no YAML printing is being performed. */ 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; char *indent_prefix; char *prefix; char *suffix; int width; int yaml_style; int yaml_depth; int yaml_size; enum isl_yaml_state *yaml_state; }; cloog-0.18.4/isl/isl_hide_deprecated.h0000644000175000017500000000541412554427055014545 00000000000000#define isl_aff_get_constant isl_gmp_aff_get_constant #define isl_aff_get_coefficient isl_gmp_aff_get_coefficient #define isl_aff_get_denominator isl_gmp_aff_get_denominator #define isl_aff_set_constant isl_gmp_aff_set_constant #define isl_aff_set_coefficient isl_gmp_aff_set_coefficient #define isl_aff_set_denominator isl_gmp_aff_set_denominator #define isl_aff_add_constant isl_gmp_aff_add_constant #define isl_aff_add_constant_num isl_gmp_aff_add_constant_num #define isl_aff_add_coefficient isl_gmp_aff_add_coefficient #define isl_aff_mod isl_gmp_aff_mod #define isl_aff_scale isl_gmp_aff_scale #define isl_aff_scale_down isl_gmp_aff_scale_down #define isl_pw_aff_mod isl_gmp_pw_aff_mod #define isl_pw_aff_scale isl_gmp_pw_aff_scale #define isl_pw_aff_scale_down isl_gmp_pw_aff_scale_down #define isl_multi_aff_scale isl_gmp_multi_aff_scale #define isl_ast_expr_get_int isl_gmp_ast_expr_get_int #define isl_constraint_get_constant isl_gmp_constraint_get_constant #define isl_constraint_get_coefficient isl_gmp_constraint_get_coefficient #define isl_constraint_set_constant isl_gmp_constraint_set_constant #define isl_constraint_set_coefficient isl_gmp_constraint_set_coefficient #define isl_basic_set_max isl_gmp_basic_set_max #define isl_set_min isl_gmp_set_min #define isl_set_max isl_gmp_set_max #define isl_gmp_hash isl_gmp_gmp_hash #define isl_basic_map_plain_is_fixed isl_gmp_basic_map_plain_is_fixed #define isl_map_fix isl_gmp_map_fix #define isl_map_plain_is_fixed isl_gmp_map_plain_is_fixed #define isl_map_fixed_power isl_gmp_map_fixed_power #define isl_mat_get_element isl_gmp_mat_get_element #define isl_mat_set_element isl_gmp_mat_set_element #define isl_point_get_coordinate isl_gmp_point_get_coordinate #define isl_point_set_coordinate isl_gmp_point_set_coordinate #define isl_qpolynomial_rat_cst_on_domain isl_gmp_qpolynomial_rat_cst_on_domain #define isl_qpolynomial_is_cst isl_gmp_qpolynomial_is_cst #define isl_qpolynomial_scale isl_gmp_qpolynomial_scale #define isl_term_get_num isl_gmp_term_get_num #define isl_term_get_den isl_gmp_term_get_den #define isl_qpolynomial_fold_scale isl_gmp_qpolynomial_fold_scale #define isl_pw_qpolynomial_fold_fix_dim isl_gmp_pw_qpolynomial_fold_fix_dim #define isl_basic_set_fix isl_gmp_basic_set_fix #define isl_set_lower_bound isl_gmp_set_lower_bound #define isl_set_upper_bound isl_gmp_set_upper_bound #define isl_set_fix isl_gmp_set_fix #define isl_set_plain_is_fixed isl_gmp_set_plain_is_fixed #define isl_union_map_fixed_power isl_gmp_union_map_fixed_power #define isl_val_int_from_isl_int isl_gmp_val_int_from_isl_int #define isl_val_get_num_isl_int isl_gmp_val_get_num_isl_int #define isl_vec_get_element isl_gmp_vec_get_element #define isl_vec_set_element isl_gmp_vec_set_element #define isl_vec_set isl_gmp_vec_set #define isl_vec_fdiv_r isl_gmp_vec_fdiv_r cloog-0.18.4/isl/codegen_test.sh.in0000644000175000017500000000123212554427055014032 00000000000000#!/bin/sh EXEEXT=@EXEEXT@ srcdir=@srcdir@ failed=0 for i in $srcdir/test_inputs/codegen/*.st \ $srcdir/test_inputs/codegen/cloog/*.st; do echo $i; base=`basename $i .st` 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 for i in $srcdir/test_inputs/codegen/*.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.4/isl/isl_factorization.h0000644000175000017500000000131512413256472014321 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.4/isl/include/0000755000175000017500000000000012555417256012136 500000000000000cloog-0.18.4/isl/include/isl/0000755000175000017500000000000012555417256012725 500000000000000cloog-0.18.4/isl/include/isl/id.h0000644000175000017500000000164012554427055013410 00000000000000#ifndef ISL_ID_H #define ISL_ID_H #include #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); uint32_t isl_id_get_hash(__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); __isl_null isl_id *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.4/isl/include/isl/list.h0000644000175000017500000000544512554427055013776 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); \ __isl_null isl_##EL##_list *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); \ isl_stat isl_##EL##_list_foreach(__isl_keep isl_##EL##_list *list, \ isl_stat (*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); \ isl_stat isl_##EL##_list_foreach_scc(__isl_keep isl_##EL##_list *list, \ isl_bool (*follows)(__isl_keep struct isl_##EL *a, \ __isl_keep struct isl_##EL *b, void *user), \ void *follows_user, \ isl_stat (*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.4/isl/include/isl/point.h0000644000175000017500000000244112554427055014145 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); __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_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); isl_bool 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 #endif cloog-0.18.4/isl/include/isl/map.h0000644000175000017500000007331112554427055013575 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 #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); isl_bool 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); isl_bool 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_basic_map *isl_basic_map_set_tuple_id( __isl_take isl_basic_map *bmap, enum isl_dim_type type, __isl_take isl_id *id); __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); isl_bool isl_basic_map_has_dim_id(__isl_keep isl_basic_map *bmap, enum isl_dim_type type, unsigned pos); isl_bool 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); isl_bool 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); __isl_give isl_map *isl_map_reset_user(__isl_take isl_map *map); int isl_basic_map_find_dim_by_name(__isl_keep isl_basic_map *bmap, enum isl_dim_type type, const char *name); 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); __isl_give isl_basic_map *isl_basic_map_identity(__isl_take isl_space *dim); __isl_null isl_basic_map *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); __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); __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_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_give isl_basic_map *isl_map_unshifted_simple_hull_from_map_list( __isl_take isl_map *map, __isl_take isl_map_list *list); __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_give isl_basic_map *isl_basic_map_list_intersect( __isl_take isl_basic_map_list *list); __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_give isl_basic_map *isl_basic_map_preimage_domain_multi_aff( __isl_take isl_basic_map *bmap, __isl_take isl_multi_aff *ma); __isl_give isl_basic_map *isl_basic_map_preimage_range_multi_aff( __isl_take isl_basic_map *bmap, __isl_take isl_multi_aff *ma); __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); __isl_export __isl_give isl_basic_map *isl_basic_map_sample(__isl_take 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_map_dump(__isl_keep isl_map *map); __isl_give isl_printer *isl_printer_print_basic_map( __isl_take isl_printer *printer, __isl_keep isl_basic_map *bmap); __isl_give char *isl_map_to_str(__isl_keep isl_map *map); __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_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2); struct isl_map *isl_map_neg(struct isl_map *map); __isl_give isl_map *isl_map_floordiv_val(__isl_take isl_map *map, __isl_take isl_val *d); __isl_export isl_bool isl_basic_map_is_equal(__isl_keep isl_basic_map *bmap1, __isl_keep isl_basic_map *bmap2); isl_bool isl_basic_map_is_disjoint(__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); __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); isl_bool isl_basic_map_is_universe(__isl_keep isl_basic_map *bmap); isl_bool isl_basic_map_plain_is_empty(__isl_keep isl_basic_map *bmap); __isl_export isl_bool isl_basic_map_is_empty(__isl_keep isl_basic_map *bmap); __isl_export isl_bool isl_basic_map_is_subset(__isl_keep isl_basic_map *bmap1, __isl_keep isl_basic_map *bmap2); isl_bool isl_basic_map_is_strict_subset(__isl_keep isl_basic_map *bmap1, __isl_keep isl_basic_map *bmap2); __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); __isl_give isl_map *isl_map_identity(__isl_take isl_space *dim); __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); __isl_null isl_map *isl_map_free(__isl_take isl_map *map); __isl_give isl_map *isl_map_copy(__isl_keep isl_map *map); __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_map *isl_map_preimage_range_multi_aff(__isl_take isl_map *map, __isl_take isl_multi_aff *ma); __isl_give isl_map *isl_map_preimage_domain_pw_multi_aff( __isl_take isl_map *map, __isl_take isl_pw_multi_aff *pma); __isl_give isl_map *isl_map_preimage_range_pw_multi_aff( __isl_take isl_map *map, __isl_take isl_pw_multi_aff *pma); __isl_give isl_map *isl_map_preimage_domain_multi_pw_aff( __isl_take isl_map *map, __isl_take isl_multi_pw_aff *mpa); __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_bool isl_map_domain_is_wrapping(__isl_keep isl_map *map); isl_bool isl_map_range_is_wrapping(__isl_keep isl_map *map); __isl_give isl_map *isl_map_factor_domain(__isl_take isl_map *map); __isl_give isl_map *isl_map_factor_range(__isl_take isl_map *map); __isl_give isl_map *isl_map_domain_factor_domain(__isl_take isl_map *map); __isl_give isl_map *isl_map_domain_factor_range(__isl_take isl_map *map); __isl_give isl_map *isl_map_range_factor_domain(__isl_take isl_map *map); __isl_give isl_map *isl_map_range_factor_range(__isl_take isl_map *map); __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_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_dims(__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_order_ge(__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_le(__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_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 isl_bool isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset); __isl_export isl_bool 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_give isl_map *isl_set_wrapped_domain_map(__isl_take isl_set *set); __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); __isl_give isl_map *isl_map_from_range(__isl_take 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); __isl_export __isl_give isl_basic_map *isl_map_sample(__isl_take isl_map *map); isl_bool isl_map_plain_is_empty(__isl_keep isl_map *map); isl_bool isl_map_plain_is_universe(__isl_keep isl_map *map); __isl_export isl_bool isl_map_is_empty(__isl_keep isl_map *map); __isl_export isl_bool isl_map_is_subset(__isl_keep isl_map *map1, __isl_keep isl_map *map2); __isl_export isl_bool isl_map_is_strict_subset(__isl_keep isl_map *map1, __isl_keep isl_map *map2); __isl_export isl_bool isl_map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2); __isl_export isl_bool isl_map_is_disjoint(__isl_keep isl_map *map1, __isl_keep isl_map *map2); isl_bool isl_basic_map_is_single_valued(__isl_keep isl_basic_map *bmap); isl_bool isl_map_plain_is_single_valued(__isl_keep isl_map *map); __isl_export isl_bool isl_map_is_single_valued(__isl_keep isl_map *map); isl_bool isl_map_plain_is_injective(__isl_keep isl_map *map); __isl_export isl_bool isl_map_is_injective(__isl_keep isl_map *map); __isl_export isl_bool 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); isl_bool isl_basic_map_can_zip(__isl_keep isl_basic_map *bmap); isl_bool 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); isl_bool isl_basic_map_can_curry(__isl_keep isl_basic_map *bmap); isl_bool 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); isl_bool isl_basic_map_can_uncurry(__isl_keep isl_basic_map *bmap); isl_bool 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); isl_bool isl_basic_map_involves_dims(__isl_keep isl_basic_map *bmap, enum isl_dim_type type, unsigned first, unsigned n); isl_bool 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); __isl_give isl_val *isl_map_plain_get_val_if_fixed(__isl_keep isl_map *map, enum isl_dim_type type, unsigned pos); __isl_give isl_basic_map *isl_basic_map_gist_domain( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *context); __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); isl_bool isl_map_plain_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2); uint32_t isl_map_get_hash(__isl_keep isl_map *map); int isl_map_n_basic_map(__isl_keep isl_map *map); __isl_export isl_stat isl_map_foreach_basic_map(__isl_keep isl_map *map, isl_stat (*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_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); ISL_DECLARE_LIST_FN(basic_map) ISL_DECLARE_LIST_FN(map) #if defined(__cplusplus) } #endif #endif cloog-0.18.4/isl/include/isl/multi.h0000644000175000017500000001417712554427055014157 00000000000000#ifndef ISL_MULTI_H #define ISL_MULTI_H #include #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); \ int isl_multi_##BASE##_find_dim_by_name( \ __isl_keep isl_multi_##BASE *multi, \ enum isl_dim_type type, const char *name); \ __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); \ __isl_null isl_multi_##BASE *isl_multi_##BASE##_free( \ __isl_take isl_multi_##BASE *multi); \ isl_bool isl_multi_##BASE##_plain_is_equal( \ __isl_keep isl_multi_##BASE *multi1, \ __isl_keep isl_multi_##BASE *multi2); \ int isl_multi_##BASE##_find_dim_by_id( \ __isl_keep isl_multi_##BASE *multi, enum isl_dim_type type, \ __isl_keep isl_id *id); \ __isl_give isl_id *isl_multi_##BASE##_get_dim_id( \ __isl_take isl_multi_##BASE *multi, \ enum isl_dim_type type, unsigned pos); \ __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); \ __isl_give isl_multi_##BASE *isl_multi_##BASE##_set_dim_id( \ __isl_take isl_multi_##BASE *multi, \ enum isl_dim_type type, unsigned pos, __isl_take isl_id *id); \ const char *isl_multi_##BASE##_get_tuple_name( \ __isl_keep isl_multi_##BASE *multi, enum isl_dim_type type); \ isl_bool isl_multi_##BASE##_has_tuple_id( \ __isl_keep isl_multi_##BASE *multi, enum isl_dim_type type); \ __isl_give isl_id *isl_multi_##BASE##_get_tuple_id( \ __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##_reset_tuple_id( \ __isl_take isl_multi_##BASE *multi, enum isl_dim_type type); \ __isl_give isl_multi_##BASE *isl_multi_##BASE##_reset_user( \ __isl_take isl_multi_##BASE *multi); \ __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##_flatten_range( \ __isl_take isl_multi_##BASE *multi); \ __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_bool isl_multi_##BASE##_range_is_wrapping( \ __isl_keep isl_multi_##BASE *multi); \ __isl_give isl_multi_##BASE *isl_multi_##BASE##_range_factor_domain( \ __isl_take isl_multi_##BASE *multi); \ __isl_give isl_multi_##BASE *isl_multi_##BASE##_range_factor_range( \ __isl_take isl_multi_##BASE *multi); \ __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_down_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##_scale_down_multi_val( \ __isl_take isl_multi_##BASE *multi, \ __isl_take isl_multi_val *mv); \ __isl_give isl_multi_##BASE *isl_multi_##BASE##_mod_multi_val( \ __isl_take isl_multi_##BASE *multi, \ __isl_take isl_multi_val *mv); \ __isl_give isl_multi_##BASE *isl_multi_##BASE##_sub( \ __isl_take isl_multi_##BASE *multi1, \ __isl_take isl_multi_##BASE *multi2); \ __isl_give isl_multi_##BASE *isl_multi_##BASE##_align_params( \ __isl_take isl_multi_##BASE *multi, \ __isl_take isl_space *model); \ __isl_give isl_multi_##BASE *isl_multi_##BASE##_from_range( \ __isl_take isl_multi_##BASE *multi); #define ISL_DECLARE_MULTI_NEG(BASE) \ __isl_give isl_multi_##BASE *isl_multi_##BASE##_neg( \ __isl_take isl_multi_##BASE *multi); #define ISL_DECLARE_MULTI_DIMS(BASE) \ isl_bool isl_multi_##BASE##_involves_dims( \ __isl_keep isl_multi_##BASE *multi, enum isl_dim_type type, \ unsigned first, unsigned n); \ __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); #define ISL_DECLARE_MULTI_WITH_DOMAIN(BASE) \ __isl_give isl_multi_##BASE *isl_multi_##BASE##_product( \ __isl_take isl_multi_##BASE *multi1, \ __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); #if defined(__cplusplus) } #endif #endif cloog-0.18.4/isl/include/isl/polynomial.h0000644000175000017500000007403012554427055015202 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); isl_bool 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_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); __isl_null isl_qpolynomial *isl_qpolynomial_free( __isl_take isl_qpolynomial *qp); isl_bool isl_qpolynomial_plain_is_equal(__isl_keep isl_qpolynomial *qp1, __isl_keep isl_qpolynomial *qp2); isl_bool isl_qpolynomial_is_zero(__isl_keep isl_qpolynomial *qp); isl_bool isl_qpolynomial_is_nan(__isl_keep isl_qpolynomial *qp); isl_bool isl_qpolynomial_is_infty(__isl_keep isl_qpolynomial *qp); isl_bool isl_qpolynomial_is_neginfty(__isl_keep isl_qpolynomial *qp); int isl_qpolynomial_sgn(__isl_keep isl_qpolynomial *qp); __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_scale_val( __isl_take isl_qpolynomial *qp, __isl_take isl_val *v); __isl_give isl_qpolynomial *isl_qpolynomial_scale_down_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); __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); isl_stat isl_qpolynomial_foreach_term(__isl_keep isl_qpolynomial *qp, isl_stat (*fn)(__isl_take isl_term *term, void *user), void *user); __isl_give isl_val *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); isl_bool 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); __isl_null isl_pw_qpolynomial *isl_pw_qpolynomial_free( __isl_take isl_pw_qpolynomial *pwqp); isl_bool 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); isl_bool 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); int isl_pw_qpolynomial_find_dim_by_name(__isl_keep isl_pw_qpolynomial *pwqp, enum isl_dim_type type, const char *name); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_reset_user( __isl_take isl_pw_qpolynomial *pwqp); __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_subtract_domain( __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_scale_val( __isl_take isl_pw_qpolynomial *pwqp, __isl_take isl_val *v); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_scale_down_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_val( __isl_take isl_pw_qpolynomial *pwqp, enum isl_dim_type type, unsigned n, __isl_take isl_val *v); __isl_give isl_val *isl_pw_qpolynomial_eval( __isl_take isl_pw_qpolynomial *pwqp, __isl_take isl_point *pnt); __isl_give isl_val *isl_pw_qpolynomial_max(__isl_take isl_pw_qpolynomial *pwqp); __isl_give isl_val *isl_pw_qpolynomial_min(__isl_take isl_pw_qpolynomial *pwqp); isl_stat isl_pw_qpolynomial_foreach_piece(__isl_keep isl_pw_qpolynomial *pwqp, isl_stat (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp, void *user), void *user); isl_stat isl_pw_qpolynomial_foreach_lifted_piece( __isl_keep isl_pw_qpolynomial *pwqp, isl_stat (*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); isl_bool isl_qpolynomial_fold_is_nan(__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_scale_val( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_val *v); __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_scale_down_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_val *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); isl_stat isl_qpolynomial_fold_foreach_qpolynomial( __isl_keep isl_qpolynomial_fold *fold, isl_stat (*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); isl_bool 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); __isl_null isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_free( __isl_take isl_pw_qpolynomial_fold *pwf); isl_bool 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); int isl_pw_qpolynomial_fold_find_dim_by_name( __isl_keep isl_pw_qpolynomial_fold *pwf, enum isl_dim_type type, const char *name); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_reset_user( __isl_take isl_pw_qpolynomial_fold *pwf); __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_subtract_domain( __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_scale_val( __isl_take isl_pw_qpolynomial_fold *pwf, __isl_take isl_val *v); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_scale_down_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_val *isl_pw_qpolynomial_fold_eval( __isl_take isl_pw_qpolynomial_fold *pwf, __isl_take isl_point *pnt); isl_stat isl_pw_qpolynomial_fold_foreach_piece( __isl_keep isl_pw_qpolynomial_fold *pwf, isl_stat (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial_fold *fold, void *user), void *user); isl_stat isl_pw_qpolynomial_fold_foreach_lifted_piece( __isl_keep isl_pw_qpolynomial_fold *pwf, isl_stat (*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_val *isl_pw_qpolynomial_fold_max( __isl_take isl_pw_qpolynomial_fold *pwf); __isl_give isl_val *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); unsigned isl_union_pw_qpolynomial_dim( __isl_keep isl_union_pw_qpolynomial *upwqp, enum isl_dim_type type); isl_bool 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); __isl_null isl_union_pw_qpolynomial *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_neg( __isl_take isl_union_pw_qpolynomial *upwqp); __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_scale_val( __isl_take isl_union_pw_qpolynomial *upwqp, __isl_take isl_val *v); __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_scale_down_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_union_pw_qpolynomial *isl_union_pw_qpolynomial_subtract_domain( __isl_take isl_union_pw_qpolynomial *upwpq, __isl_take isl_union_set *uset); __isl_give isl_space *isl_union_pw_qpolynomial_get_space( __isl_keep isl_union_pw_qpolynomial *upwqp); __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_set_dim_name( __isl_take isl_union_pw_qpolynomial *upwqp, enum isl_dim_type type, unsigned pos, const char *s); int isl_union_pw_qpolynomial_find_dim_by_name( __isl_keep isl_union_pw_qpolynomial *upwqp, enum isl_dim_type type, const char *name); __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_drop_dims( __isl_take isl_union_pw_qpolynomial *upwqp, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_reset_user( __isl_take isl_union_pw_qpolynomial *upwqp); __isl_give isl_val *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_n_pw_qpolynomial( __isl_keep isl_union_pw_qpolynomial *upwqp); isl_stat isl_union_pw_qpolynomial_foreach_pw_qpolynomial( __isl_keep isl_union_pw_qpolynomial *upwqp, isl_stat (*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); unsigned isl_union_pw_qpolynomial_fold_dim( __isl_keep isl_union_pw_qpolynomial_fold *upwf, enum isl_dim_type type); isl_bool 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); __isl_null isl_union_pw_qpolynomial_fold *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_scale_val( __isl_take isl_union_pw_qpolynomial_fold *upwf, __isl_take isl_val *v); __isl_give isl_union_pw_qpolynomial_fold * isl_union_pw_qpolynomial_fold_scale_down_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); __isl_give isl_union_pw_qpolynomial_fold * isl_union_pw_qpolynomial_fold_subtract_domain( __isl_take isl_union_pw_qpolynomial_fold *upwf, __isl_take isl_union_set *uset); 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_union_pw_qpolynomial_fold * isl_union_pw_qpolynomial_fold_set_dim_name( __isl_take isl_union_pw_qpolynomial_fold *upwf, enum isl_dim_type type, unsigned pos, const char *s); int isl_union_pw_qpolynomial_fold_find_dim_by_name( __isl_keep isl_union_pw_qpolynomial_fold *upwf, enum isl_dim_type type, const char *name); __isl_give isl_union_pw_qpolynomial_fold * isl_union_pw_qpolynomial_fold_drop_dims( __isl_take isl_union_pw_qpolynomial_fold *upwf, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_union_pw_qpolynomial_fold * isl_union_pw_qpolynomial_fold_reset_user( __isl_take isl_union_pw_qpolynomial_fold *upwf); __isl_give isl_val *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_n_pw_qpolynomial_fold( __isl_keep isl_union_pw_qpolynomial_fold *upwf); isl_stat isl_union_pw_qpolynomial_fold_foreach_pw_qpolynomial_fold( __isl_keep isl_union_pw_qpolynomial_fold *upwf, isl_stat (*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 #endif cloog-0.18.4/isl/include/isl/hmap.h0000644000175000017500000000340012554427055013735 00000000000000#include #include #if defined(__cplusplus) extern "C" { #endif #define ISL_xCAT(A,B) A ## B #define ISL_CAT(A,B) ISL_xCAT(A,B) #define ISL_KEY ISL_CAT(isl_,ISL_KEY_BASE) #define ISL_VAL ISL_CAT(isl_,ISL_VAL_BASE) #define ISL_xFN(TYPE,NAME) TYPE ## _ ## NAME #define ISL_FN(TYPE,NAME) ISL_xFN(TYPE,NAME) #define ISL_xHMAP(KEY,VAL_BASE) KEY ## _to_ ## VAL_BASE #define ISL_yHMAP(KEY,VAL_BASE) ISL_xHMAP(KEY,VAL_BASE) #define ISL_HMAP ISL_yHMAP(ISL_KEY,ISL_VAL_BASE) #define ISL_HMAP_BASE ISL_yHMAP(ISL_KEY_BASE,ISL_VAL_BASE) struct ISL_HMAP; typedef struct ISL_HMAP ISL_HMAP; __isl_give ISL_HMAP *ISL_FN(ISL_HMAP,alloc)(isl_ctx *ctx, int min_size); __isl_give ISL_HMAP *ISL_FN(ISL_HMAP,copy)(__isl_keep ISL_HMAP *hmap); __isl_null ISL_HMAP *ISL_FN(ISL_HMAP,free)(__isl_take ISL_HMAP *hmap); isl_ctx *ISL_FN(ISL_HMAP,get_ctx)(__isl_keep ISL_HMAP *hmap); isl_bool ISL_FN(ISL_HMAP,has)(__isl_keep ISL_HMAP *hmap, __isl_keep ISL_KEY *key); __isl_give ISL_VAL *ISL_FN(ISL_HMAP,get)(__isl_keep ISL_HMAP *hmap, __isl_take ISL_KEY *key); __isl_give ISL_HMAP *ISL_FN(ISL_HMAP,set)(__isl_take ISL_HMAP *hmap, __isl_take ISL_KEY *key, __isl_take ISL_VAL *val); __isl_give ISL_HMAP *ISL_FN(ISL_HMAP,drop)(__isl_take ISL_HMAP *hmap, __isl_take ISL_KEY *key); isl_stat ISL_FN(ISL_HMAP,foreach)(__isl_keep ISL_HMAP *hmap, isl_stat (*fn)(__isl_take ISL_KEY *key, __isl_take ISL_VAL *val, void *user), void *user); __isl_give isl_printer *ISL_FN(isl_printer_print,ISL_HMAP_BASE)( __isl_take isl_printer *p, __isl_keep ISL_HMAP *hmap); void ISL_FN(ISL_HMAP,dump)(__isl_keep ISL_HMAP *hmap); #undef ISL_xCAT #undef ISL_CAT #undef ISL_KEY #undef ISL_VAL #undef ISL_xFN #undef ISL_FN #undef ISL_xHMAP #undef ISL_yHMAP #undef ISL_HMAP #if defined(__cplusplus) } #endif cloog-0.18.4/isl/include/isl/printer.h0000644000175000017500000000520112554427055014474 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); __isl_null isl_printer *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); #define ISL_YAML_STYLE_BLOCK 0 #define ISL_YAML_STYLE_FLOW 1 __isl_give isl_printer *isl_printer_set_yaml_style(__isl_take isl_printer *p, int yaml_style); int isl_printer_get_yaml_style(__isl_keep isl_printer *p); __isl_give isl_printer *isl_printer_set_indent_prefix(__isl_take isl_printer *p, const char *prefix); __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_str(__isl_take isl_printer *p, const char *s); __isl_give isl_printer *isl_printer_yaml_start_mapping( __isl_take isl_printer *p); __isl_give isl_printer *isl_printer_yaml_end_mapping( __isl_take isl_printer *p); __isl_give isl_printer *isl_printer_yaml_start_sequence( __isl_take isl_printer *p); __isl_give isl_printer *isl_printer_yaml_end_sequence( __isl_take isl_printer *p); __isl_give isl_printer *isl_printer_yaml_next(__isl_take isl_printer *p); __isl_give isl_printer *isl_printer_flush(__isl_take isl_printer *p); #if defined(__cplusplus) } #endif #endif cloog-0.18.4/isl/include/isl/space.h0000644000175000017500000001640612554427055014115 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); __isl_null isl_space *isl_space_free(__isl_take isl_space *space); isl_bool isl_space_is_params(__isl_keep isl_space *space); isl_bool isl_space_is_set(__isl_keep isl_space *space); isl_bool 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); isl_bool 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); isl_bool 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_reset_user(__isl_take isl_space *space); __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); isl_bool 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); isl_bool 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_factor_domain(__isl_take isl_space *space); __isl_give isl_space *isl_space_factor_range(__isl_take isl_space *space); __isl_give isl_space *isl_space_domain_factor_domain( __isl_take isl_space *space); __isl_give isl_space *isl_space_domain_factor_range( __isl_take isl_space *space); __isl_give isl_space *isl_space_range_factor_domain( __isl_take isl_space *space); __isl_give isl_space *isl_space_range_factor_range( __isl_take isl_space *space); __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_domain_map(__isl_take isl_space *space); __isl_give isl_space *isl_space_range_map(__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_align_params(__isl_take isl_space *dim1, __isl_take isl_space *dim2); isl_bool isl_space_is_wrapping(__isl_keep isl_space *dim); isl_bool isl_space_domain_is_wrapping(__isl_keep isl_space *space); isl_bool isl_space_range_is_wrapping(__isl_keep isl_space *space); __isl_give isl_space *isl_space_wrap(__isl_take isl_space *dim); __isl_give isl_space *isl_space_unwrap(__isl_take isl_space *dim); isl_bool isl_space_can_zip(__isl_keep isl_space *dim); __isl_give isl_space *isl_space_zip(__isl_take isl_space *dim); isl_bool isl_space_can_curry(__isl_keep isl_space *space); __isl_give isl_space *isl_space_curry(__isl_take isl_space *space); isl_bool isl_space_can_uncurry(__isl_keep isl_space *space); __isl_give isl_space *isl_space_uncurry(__isl_take isl_space *space); isl_bool isl_space_is_domain(__isl_keep isl_space *space1, __isl_keep isl_space *space2); isl_bool isl_space_is_range(__isl_keep isl_space *space1, __isl_keep isl_space *space2); isl_bool isl_space_is_equal(__isl_keep isl_space *space1, __isl_keep isl_space *space2); isl_bool isl_space_tuple_is_equal(__isl_keep isl_space *space1, enum isl_dim_type type1, __isl_keep isl_space *space2, enum isl_dim_type type2); 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); ISL_DEPRECATED int isl_space_tuple_match(__isl_keep isl_space *space1, enum isl_dim_type type1, __isl_keep isl_space *space2, enum isl_dim_type type2); 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 char *isl_space_to_str(__isl_keep isl_space *space); __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.4/isl/include/isl/deprecated/0000755000175000017500000000000012555417256015025 500000000000000cloog-0.18.4/isl/include/isl/deprecated/set_int.h0000644000175000017500000000144712413270107016552 00000000000000#ifndef ISL_DEPRECATED_SET_INT_H #define ISL_DEPRECATED_SET_INT_H #include #include #if defined(__cplusplus) extern "C" { #endif __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_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_upper_bound(__isl_take isl_set *set, enum isl_dim_type type, unsigned pos, isl_int value); __isl_give isl_set *isl_set_fix(__isl_take isl_set *set, enum isl_dim_type type, unsigned pos, isl_int value); int isl_set_plain_is_fixed(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos, isl_int *val); #if defined(__cplusplus) } #endif #endif cloog-0.18.4/isl/include/isl/deprecated/aff_int.h0000644000175000017500000000303212413270107016503 00000000000000#ifndef ISL_DEPRECATED_AFF_INT_H #define ISL_DEPRECATED_AFF_INT_H #include #include #if defined(__cplusplus) extern "C" { #endif int isl_aff_get_constant(__isl_keep isl_aff *aff, isl_int *v); int isl_aff_get_coefficient(__isl_keep isl_aff *aff, enum isl_dim_type type, int pos, isl_int *v); int isl_aff_get_denominator(__isl_keep isl_aff *aff, isl_int *v); __isl_give isl_aff *isl_aff_set_constant(__isl_take isl_aff *aff, isl_int 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_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_num(__isl_take isl_aff *aff, isl_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_mod(__isl_take isl_aff *aff, isl_int mod); __isl_give isl_aff *isl_aff_scale(__isl_take isl_aff *aff, isl_int f); __isl_give isl_aff *isl_aff_scale_down(__isl_take isl_aff *aff, isl_int f); __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_scale(__isl_take isl_pw_aff *pwaff, isl_int f); __isl_give isl_pw_aff *isl_pw_aff_scale_down(__isl_take isl_pw_aff *pwaff, isl_int f); __isl_give isl_multi_aff *isl_multi_aff_scale(__isl_take isl_multi_aff *maff, isl_int f); #if defined(__cplusplus) } #endif #endif cloog-0.18.4/isl/include/isl/deprecated/int.h0000644000175000017500000001041712413270107015674 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_DEPRECATED_INT_H #define ISL_DEPRECATED_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.4/isl/include/isl/deprecated/vec_int.h0000644000175000017500000000077612413270107016540 00000000000000#ifndef ISL_DEPRECATED_VEC_INT_H #define ISL_DEPRECATED_VEC_INT_H #include #include #if defined(__cplusplus) extern "C" { #endif int isl_vec_get_element(__isl_keep isl_vec *vec, int pos, isl_int *v); __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(__isl_take isl_vec *vec, isl_int v); __isl_give isl_vec *isl_vec_fdiv_r(__isl_take isl_vec *vec, isl_int m); #if defined(__cplusplus) } #endif #endif cloog-0.18.4/isl/include/isl/deprecated/map_int.h0000644000175000017500000000117112554427055016542 00000000000000#ifndef ISL_DEPRECATED_MAP_INT_H #define ISL_DEPRECATED_MAP_INT_H #include #include #if defined(__cplusplus) extern "C" { #endif 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_map *isl_map_fix(__isl_take isl_map *map, enum isl_dim_type type, unsigned pos, isl_int value); int isl_map_plain_is_fixed(__isl_keep isl_map *map, enum isl_dim_type type, unsigned pos, isl_int *val); __isl_give isl_map *isl_map_fixed_power(__isl_take isl_map *map, isl_int exp); #if defined(__cplusplus) } #endif #endif cloog-0.18.4/isl/include/isl/deprecated/constraint_int.h0000644000175000017500000000126412413270107020140 00000000000000#ifndef ISL_DEPRECATED_CONSTRAINT_INT_H #define ISL_DEPRECATED_CONSTRAINT_INT_H #include #include #if defined(__cplusplus) extern "C" { #endif void isl_constraint_get_constant(__isl_keep isl_constraint *constraint, isl_int *v); void isl_constraint_get_coefficient(__isl_keep isl_constraint *constraint, enum isl_dim_type type, int pos, isl_int *v); __isl_give isl_constraint *isl_constraint_set_constant( __isl_take isl_constraint *constraint, isl_int v); __isl_give isl_constraint *isl_constraint_set_coefficient( __isl_take isl_constraint *constraint, enum isl_dim_type type, int pos, isl_int v); #if defined(__cplusplus) } #endif #endif cloog-0.18.4/isl/include/isl/deprecated/val_int.h0000644000175000017500000000053112413270107016532 00000000000000#ifndef ISL_DEPRECATED_VAL_INT_H #define ISL_DEPRECATED_VAL_INT_H #include #include #if defined(__cplusplus) extern "C" { #endif __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); #if defined(__cplusplus) } #endif #endif cloog-0.18.4/isl/include/isl/deprecated/union_map_int.h0000644000175000017500000000051512413270107017737 00000000000000#ifndef ISL_DEPRECATED_UNION_MAP_INT_H #define ISL_DEPRECATED_UNION_MAP_INT_H #include #include #if defined(__cplusplus) extern "C" { #endif __isl_give isl_union_map *isl_union_map_fixed_power( __isl_take isl_union_map *umap, isl_int exp); #if defined(__cplusplus) } #endif #endif cloog-0.18.4/isl/include/isl/deprecated/ilp_int.h0000644000175000017500000000102612413270107016534 00000000000000#ifndef ISL_DEPRECATED_ILP_INT_H #define ISL_DEPRECATED_ILP_INT_H #include #include #include #if defined(__cplusplus) extern "C" { #endif enum isl_lp_result isl_basic_set_max(__isl_keep isl_basic_set *bset, __isl_keep isl_aff *obj, isl_int *opt); 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); #if defined(__cplusplus) } #endif #endif cloog-0.18.4/isl/include/isl/deprecated/point_int.h0000644000175000017500000000066712413270107017113 00000000000000#ifndef ISL_DEPRECATED_POINT_INT_H #define ISL_DEPRECATED_POINT_INT_H #include #include #if defined(__cplusplus) extern "C" { #endif int isl_point_get_coordinate(__isl_keep isl_point *pnt, enum isl_dim_type type, int pos, isl_int *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 defined(__cplusplus) } #endif #endif cloog-0.18.4/isl/include/isl/deprecated/mat_int.h0000644000175000017500000000060212413270107016530 00000000000000#ifndef ISL_DEPRECATED_MAT_INT_H #define ISL_DEPRECATED_MAT_INT_H #include #include #if defined(__cplusplus) extern "C" { #endif int isl_mat_get_element(__isl_keep isl_mat *mat, int row, int col, isl_int *v); __isl_give isl_mat *isl_mat_set_element(__isl_take isl_mat *mat, int row, int col, isl_int v); #if defined(__cplusplus) } #endif #endif cloog-0.18.4/isl/include/isl/deprecated/ast_int.h0000644000175000017500000000042712413270107016543 00000000000000#ifndef ISL_DEPRECATED_AST_INT_H #define ISL_DEPRECATED_AST_INT_H #include #include #if defined(__cplusplus) extern "C" { #endif int isl_ast_expr_get_int(__isl_keep isl_ast_expr *expr, isl_int *v); #if defined(__cplusplus) } #endif #endif cloog-0.18.4/isl/include/isl/deprecated/polynomial_int.h0000644000175000017500000000165412413270107020142 00000000000000#ifndef ISL_DEPRECATED_POLYNOMIAL_INT_H #define ISL_DEPRECATED_POLYNOMIAL_INT_H #include #include #if defined(__cplusplus) extern "C" { #endif __isl_give isl_qpolynomial *isl_qpolynomial_rat_cst_on_domain( __isl_take isl_space *space, const isl_int n, const isl_int d); int isl_qpolynomial_is_cst(__isl_keep isl_qpolynomial *qp, isl_int *n, isl_int *d); __isl_give isl_qpolynomial *isl_qpolynomial_scale( __isl_take isl_qpolynomial *qp, isl_int v); 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_qpolynomial_fold *isl_qpolynomial_fold_scale( __isl_take isl_qpolynomial_fold *fold, isl_int v); __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); #if defined(__cplusplus) } #endif #endif cloog-0.18.4/isl/include/isl/id_to_pw_aff.h0000644000175000017500000000034012413270107015414 00000000000000#ifndef ISL_ID_TO_PW_AFF_H #define ISL_ID_TO_PW_AFF_H #include #include #define ISL_KEY_BASE id #define ISL_VAL_BASE pw_aff #include #undef ISL_KEY_BASE #undef ISL_VAL_BASE #endif cloog-0.18.4/isl/include/isl/union_set_type.h0000644000175000017500000000014312413256472016052 00000000000000#ifndef ISL_UNION_SET_TYPE_H #define ISL_UNION_SET_TYPE_H #include #endif cloog-0.18.4/isl/include/isl/polynomial_type.h0000644000175000017500000000137612413256472016243 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.4/isl/include/isl/val_gmp.h0000644000175000017500000000066312413270107014431 00000000000000#ifndef ISL_VAL_GMP_H #define ISL_VAL_GMP_H #include #include #if defined(__cplusplus) extern "C" { #endif __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); #if defined(__cplusplus) } #endif #endif cloog-0.18.4/isl/include/isl/stream.h0000644000175000017500000000664112554427055014315 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 #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; __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; typedef struct isl_stream isl_stream; __isl_give isl_stream *isl_stream_new_file(isl_ctx *ctx, FILE *file); __isl_give isl_stream *isl_stream_new_str(isl_ctx *ctx, const char *str); void isl_stream_free(__isl_take isl_stream *s); isl_ctx *isl_stream_get_ctx(__isl_keep isl_stream *s); void isl_stream_error(__isl_keep isl_stream *s, struct isl_token *tok, char *msg); struct isl_token *isl_stream_next_token(__isl_keep isl_stream *s); struct isl_token *isl_stream_next_token_on_same_line(__isl_keep isl_stream *s); int isl_stream_next_token_is(__isl_keep isl_stream *s, int type); void isl_stream_push_token(__isl_keep isl_stream *s, struct isl_token *tok); void isl_stream_flush_tokens(__isl_keep isl_stream *s); int isl_stream_eat_if_available(__isl_keep isl_stream *s, int type); char *isl_stream_read_ident_if_available(__isl_keep isl_stream *s); int isl_stream_eat(__isl_keep isl_stream *s, int type); int isl_stream_is_empty(__isl_keep isl_stream *s); int isl_stream_skip_line(__isl_keep isl_stream *s); enum isl_token_type isl_stream_register_keyword(__isl_keep isl_stream *s, const char *name); struct isl_obj isl_stream_read_obj(__isl_keep isl_stream *s); __isl_give isl_val *isl_stream_read_val(__isl_keep isl_stream *s); __isl_give isl_multi_aff *isl_stream_read_multi_aff(__isl_keep isl_stream *s); __isl_give isl_map *isl_stream_read_map(__isl_keep isl_stream *s); __isl_give isl_set *isl_stream_read_set(__isl_keep isl_stream *s); __isl_give isl_pw_qpolynomial *isl_stream_read_pw_qpolynomial( __isl_keep isl_stream *s); __isl_give isl_union_map *isl_stream_read_union_map(__isl_keep isl_stream *s); __isl_give isl_schedule *isl_stream_read_schedule(isl_stream *s); int isl_stream_yaml_read_start_mapping(__isl_keep isl_stream *s); int isl_stream_yaml_read_end_mapping(__isl_keep isl_stream *s); int isl_stream_yaml_read_start_sequence(__isl_keep isl_stream *s); int isl_stream_yaml_read_end_sequence(__isl_keep isl_stream *s); int isl_stream_yaml_next(__isl_keep isl_stream *s); #if defined(__cplusplus) } #endif #endif cloog-0.18.4/isl/include/isl/version.h0000644000175000017500000000024512413256472014476 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.4/isl/include/isl/vertices.h0000644000175000017500000000306212554427055014640 00000000000000#ifndef ISL_VERTICES_H #define ISL_VERTICES_H #include #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_multi_aff *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); isl_stat isl_vertices_foreach_vertex(__isl_keep isl_vertices *vertices, isl_stat (*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); isl_stat isl_cell_foreach_vertex(__isl_keep isl_cell *cell, isl_stat (*fn)(__isl_take isl_vertex *vertex, void *user), void *user); void isl_cell_free(__isl_take isl_cell *cell); isl_stat isl_vertices_foreach_cell(__isl_keep isl_vertices *vertices, isl_stat (*fn)(__isl_take isl_cell *cell, void *user), void *user); #if defined(__cplusplus) } #endif #endif cloog-0.18.4/isl/include/isl/lp.h0000644000175000017500000000135112413270107013412 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 enum isl_lp_result { isl_lp_error = -1, isl_lp_ok = 0, isl_lp_unbounded, isl_lp_empty }; #if defined(__cplusplus) extern "C" { #endif __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.4/isl/include/isl/set.h0000644000175000017500000005315712554427055013621 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 #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); isl_bool 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); isl_bool 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_basic_set *isl_basic_set_set_tuple_id( __isl_take isl_basic_set *bset, __isl_take isl_id *id); __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); isl_bool 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); isl_bool 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_set *isl_set_reset_user(__isl_take 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); __isl_null isl_basic_set *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); __isl_give isl_basic_set *isl_basic_set_empty(__isl_take isl_space *dim); __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); __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); __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_intersect( __isl_take struct isl_basic_set_list *list); __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); __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_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_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); __isl_export isl_bool isl_basic_set_is_equal(__isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2); isl_bool isl_basic_set_is_disjoint(__isl_keep isl_basic_set *bset1, __isl_keep 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); isl_bool isl_basic_set_is_universe(__isl_keep isl_basic_set *bset); isl_bool isl_basic_set_plain_is_empty(__isl_keep isl_basic_set *bset); __isl_export isl_bool 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 isl_bool isl_basic_set_is_subset(__isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2); isl_bool isl_basic_set_plain_is_equal(__isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2); __isl_give isl_set *isl_set_empty(__isl_take isl_space *dim); __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_copy(__isl_keep isl_set *set); __isl_null isl_set *isl_set_free(__isl_take 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); __isl_give isl_basic_set *isl_set_unshifted_simple_hull_from_set_list( __isl_take isl_set *set, __isl_take isl_set_list *list); 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_preimage_multi_pw_aff(__isl_take isl_set *set, __isl_take isl_multi_pw_aff *mpa); __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); __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); ISL_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); isl_bool isl_basic_set_involves_dims(__isl_keep isl_basic_set *bset, enum isl_dim_type type, unsigned first, unsigned n); isl_bool 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); isl_bool isl_set_plain_is_empty(__isl_keep isl_set *set); isl_bool isl_set_plain_is_universe(__isl_keep isl_set *set); isl_bool isl_set_is_params(__isl_keep isl_set *set); __isl_export isl_bool isl_set_is_empty(__isl_keep isl_set *set); int isl_set_is_bounded(__isl_keep isl_set *set); __isl_export isl_bool isl_set_is_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2); __isl_export isl_bool isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2); __isl_export isl_bool isl_set_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2); __isl_export isl_bool isl_set_is_disjoint(__isl_keep isl_set *set1, __isl_keep isl_set *set2); isl_bool 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); __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_dim_is_bounded(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos); isl_bool isl_set_dim_has_lower_bound(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos); isl_bool isl_set_dim_has_upper_bound(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos); isl_bool isl_set_dim_has_any_lower_bound(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos); isl_bool 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); isl_stat 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); isl_bool isl_set_plain_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2); isl_bool isl_set_plain_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 isl_stat isl_set_foreach_basic_set(__isl_keep isl_set *set, isl_stat (*fn)(__isl_take isl_basic_set *bset, void *user), void *user); isl_stat isl_set_foreach_point(__isl_keep isl_set *set, isl_stat (*fn)(__isl_take isl_point *pnt, void *user), void *user); __isl_give isl_val *isl_set_count_val(__isl_keep isl_set *set); __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 #endif cloog-0.18.4/isl/include/isl/set_type.h0000644000175000017500000000012112413256472014636 00000000000000#ifndef ISL_SET_TYPE_H #define ISL_SET_TYPE_H #include #endif cloog-0.18.4/isl/include/isl/constraint.h0000644000175000017500000001374112554427055015205 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_constraint_alloc_equality( __isl_take isl_local_space *ls); __isl_give isl_constraint *isl_constraint_alloc_inequality( __isl_take isl_local_space *ls); __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); __isl_null isl_constraint *isl_constraint_free(__isl_take isl_constraint *c); int isl_basic_map_n_constraint(__isl_keep isl_basic_map *bmap); int isl_basic_set_n_constraint(__isl_keep isl_basic_set *bset); isl_stat isl_basic_map_foreach_constraint(__isl_keep isl_basic_map *bmap, isl_stat (*fn)(__isl_take isl_constraint *c, void *user), void *user); isl_stat isl_basic_set_foreach_constraint(__isl_keep isl_basic_set *bset, isl_stat (*fn)(__isl_take isl_constraint *c, void *user), void *user); __isl_give isl_constraint_list *isl_basic_map_get_constraint_list( __isl_keep isl_basic_map *bmap); __isl_give isl_constraint_list *isl_basic_set_get_constraint_list( __isl_keep isl_basic_set *bset); int isl_constraint_is_equal(struct isl_constraint *constraint1, struct isl_constraint *constraint2); isl_stat isl_basic_set_foreach_bound_pair(__isl_keep isl_basic_set *bset, enum isl_dim_type type, unsigned pos, isl_stat (*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); isl_bool 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); __isl_give isl_val *isl_constraint_get_constant_val( __isl_keep isl_constraint *constraint); __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_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_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_take 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); isl_bool isl_constraint_is_equality(__isl_keep isl_constraint *constraint); int isl_constraint_is_div_constraint(__isl_keep isl_constraint *constraint); isl_bool isl_constraint_is_lower_bound(__isl_keep isl_constraint *constraint, enum isl_dim_type type, unsigned pos); isl_bool 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); int isl_constraint_plain_cmp(__isl_keep isl_constraint *c1, __isl_keep isl_constraint *c2); int isl_constraint_cmp_last_non_zero(__isl_keep isl_constraint *c1, __isl_keep isl_constraint *c2); __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 #endif cloog-0.18.4/isl/include/isl/aff.h0000644000175000017500000012016112554427055013550 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_val_on_domain(__isl_take isl_local_space *ls, __isl_take isl_val *val); __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_nan_on_domain(__isl_take isl_local_space *ls); __isl_give isl_aff *isl_aff_copy(__isl_keep isl_aff *aff); __isl_null isl_aff *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); isl_bool 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); __isl_give isl_val *isl_aff_get_constant_val(__isl_keep isl_aff *aff); __isl_give isl_val *isl_aff_get_coefficient_val(__isl_keep isl_aff *aff, enum isl_dim_type type, int pos); int isl_aff_coefficient_sgn(__isl_keep isl_aff *aff, enum isl_dim_type type, int pos); __isl_give isl_val *isl_aff_get_denominator_val(__isl_keep isl_aff *aff); __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_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_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_si(__isl_take isl_aff *aff, 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_bool isl_aff_is_cst(__isl_keep isl_aff *aff); __isl_give isl_aff *isl_aff_set_tuple_id(__isl_take isl_aff *aff, 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); int isl_aff_find_dim_by_name(__isl_keep isl_aff *aff, enum isl_dim_type type, const char *name); isl_bool isl_aff_plain_is_equal(__isl_keep isl_aff *aff1, __isl_keep isl_aff *aff2); isl_bool isl_aff_plain_is_zero(__isl_keep isl_aff *aff); isl_bool isl_aff_is_nan(__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_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_val(__isl_take isl_aff *aff, __isl_take isl_val *v); __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_move_dims(__isl_take isl_aff *aff, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, 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_aff(__isl_take isl_aff *aff1, __isl_take isl_aff *aff2); __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_pw_aff_nan_on_domain(__isl_take isl_local_space *ls); __isl_give isl_pw_aff *isl_pw_aff_val_on_domain(__isl_take isl_set *domain, __isl_take isl_val *v); __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); isl_bool 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_find_dim_by_name(__isl_keep isl_pw_aff *pa, enum isl_dim_type type, const char *name); isl_bool isl_pw_aff_is_empty(__isl_keep isl_pw_aff *pwaff); isl_bool isl_pw_aff_involves_nan(__isl_keep isl_pw_aff *pa); int isl_pw_aff_plain_cmp(__isl_keep isl_pw_aff *pa1, __isl_keep isl_pw_aff *pa2); isl_bool isl_pw_aff_plain_is_equal(__isl_keep isl_pw_aff *pwaff1, __isl_keep isl_pw_aff *pwaff2); int isl_pw_aff_is_equal(__isl_keep isl_pw_aff *pa1, __isl_keep isl_pw_aff *pa2); __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); __isl_null isl_pw_aff *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); isl_bool isl_pw_aff_involves_dims(__isl_keep isl_pw_aff *pwaff, enum isl_dim_type type, unsigned first, unsigned n); isl_bool 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_bool isl_pw_aff_has_tuple_id(__isl_keep isl_pw_aff *pa, enum isl_dim_type type); __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_pw_aff *isl_pw_aff_reset_tuple_id(__isl_take isl_pw_aff *pa, enum isl_dim_type type); __isl_give isl_pw_aff *isl_pw_aff_reset_user(__isl_take isl_pw_aff *pa); __isl_give isl_set *isl_pw_aff_params(__isl_take isl_pw_aff *pwa); __isl_give isl_set *isl_pw_aff_domain(__isl_take isl_pw_aff *pwaff); __isl_give isl_pw_aff *isl_pw_aff_from_range(__isl_take isl_pw_aff *pwa); __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_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_subtract_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_val(__isl_take isl_pw_aff *pa, __isl_take isl_val *v); __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_move_dims(__isl_take isl_pw_aff *pa, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, 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); __isl_give isl_pw_aff *isl_pw_aff_pullback_multi_pw_aff( __isl_take isl_pw_aff *pa, __isl_take isl_multi_pw_aff *mpa); int isl_pw_aff_n_piece(__isl_keep isl_pw_aff *pwaff); isl_stat isl_pw_aff_foreach_piece(__isl_keep isl_pw_aff *pwaff, isl_stat (*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_pos_set(__isl_take isl_pw_aff *pa); __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_map *isl_pw_aff_eq_map(__isl_take isl_pw_aff *pa1, __isl_take isl_pw_aff *pa2); __isl_give isl_map *isl_pw_aff_lt_map(__isl_take isl_pw_aff *pa1, __isl_take isl_pw_aff *pa2); __isl_give isl_map *isl_pw_aff_gt_map(__isl_take isl_pw_aff *pa1, __isl_take isl_pw_aff *pa2); __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_DECLARE_MULTI_NEG(aff) ISL_DECLARE_MULTI_DIMS(aff) ISL_DECLARE_MULTI_WITH_DOMAIN(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); __isl_give isl_multi_aff *isl_multi_aff_domain_map(__isl_take isl_space *space); __isl_give isl_multi_aff *isl_multi_aff_range_map(__isl_take isl_space *space); __isl_give isl_multi_aff *isl_multi_aff_project_out_map( __isl_take isl_space *space, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_multi_aff *isl_multi_aff_multi_val_on_space( __isl_take isl_space *space, __isl_take isl_multi_val *mv); __isl_give isl_multi_aff *isl_multi_aff_floor(__isl_take isl_multi_aff *ma); __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_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_multi_aff *isl_multi_aff_move_dims(__isl_take isl_multi_aff *ma, 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_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 char *isl_multi_aff_to_str(__isl_keep isl_multi_aff *aff); __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_DECLARE_MULTI_NEG(pw_aff) ISL_DECLARE_MULTI_DIMS(pw_aff) ISL_DECLARE_MULTI_WITH_DOMAIN(pw_aff) __isl_give isl_pw_multi_aff *isl_pw_multi_aff_zero(__isl_take isl_space *space); __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_range_map( __isl_take isl_space *space); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_project_out_map( __isl_take isl_space *space, enum isl_dim_type type, unsigned first, unsigned n); __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_from_pw_aff( __isl_take isl_pw_aff *pa); __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); __isl_null isl_pw_multi_aff *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); isl_bool 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); isl_bool 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_reset_tuple_id( __isl_take isl_pw_multi_aff *pma, enum isl_dim_type type); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_reset_user( __isl_take isl_pw_multi_aff *pma); int isl_pw_multi_aff_find_dim_by_name(__isl_keep isl_pw_multi_aff *pma, enum isl_dim_type type, const char *name); __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); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_multi_val_on_domain( __isl_take isl_set *domain, __isl_take isl_multi_val *mv); 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); isl_bool 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_fix_si( __isl_take isl_pw_multi_aff *pma, enum isl_dim_type type, unsigned pos, int value); __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_neg( __isl_take isl_pw_multi_aff *pma); __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_down_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_multi_aff *isl_multi_aff_flatten_domain( __isl_take isl_multi_aff *ma); __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_subtract_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); isl_stat isl_pw_multi_aff_foreach_piece(__isl_keep isl_pw_multi_aff *pma, isl_stat (*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_aff( __isl_take isl_aff *aff); __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_from_pw_multi_aff( __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); __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_multi_val_on_domain( __isl_take isl_union_set *domain, __isl_take isl_multi_val *mv); __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_copy( __isl_keep isl_union_pw_multi_aff *upma); __isl_null isl_union_pw_multi_aff *isl_union_pw_multi_aff_free( __isl_take isl_union_pw_multi_aff *upma); __isl_give isl_union_pw_multi_aff *isl_union_set_identity_union_pw_multi_aff( __isl_take isl_union_set *uset); __isl_give isl_union_pw_aff *isl_union_pw_multi_aff_get_union_pw_aff( __isl_keep isl_union_pw_multi_aff *upma, int pos); __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); unsigned isl_union_pw_multi_aff_dim(__isl_keep isl_union_pw_multi_aff *upma, enum isl_dim_type type); __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_set_dim_name( __isl_take isl_union_pw_multi_aff *upma, enum isl_dim_type type, unsigned pos, const char *s); int isl_union_pw_multi_aff_find_dim_by_name( __isl_keep isl_union_pw_multi_aff *upma, enum isl_dim_type type, const char *name); __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_drop_dims( __isl_take isl_union_pw_multi_aff *upma, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_reset_user( __isl_take isl_union_pw_multi_aff *upma); __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_coalesce( __isl_take isl_union_pw_multi_aff *upma); __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_gist_params( __isl_take isl_union_pw_multi_aff *upma, __isl_take isl_set *context); __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_gist( __isl_take isl_union_pw_multi_aff *upma, __isl_take isl_union_set *context); __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_pullback_union_pw_multi_aff( __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_align_params( __isl_take isl_union_pw_multi_aff *upma, __isl_take isl_space *model); int isl_union_pw_multi_aff_n_pw_multi_aff( __isl_keep isl_union_pw_multi_aff *upma); isl_stat isl_union_pw_multi_aff_foreach_pw_multi_aff( __isl_keep isl_union_pw_multi_aff *upma, isl_stat (*fn)(__isl_take isl_pw_multi_aff *pma, void *user), void *user); __isl_give isl_pw_multi_aff *isl_union_pw_multi_aff_extract_pw_multi_aff( __isl_keep isl_union_pw_multi_aff *upma, __isl_take isl_space *space); isl_bool isl_union_pw_multi_aff_plain_is_equal( __isl_keep isl_union_pw_multi_aff *upma1, __isl_keep isl_union_pw_multi_aff *upma2); __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_neg( __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_union_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_val( __isl_take isl_union_pw_multi_aff *upma, __isl_take isl_val *val); __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_scale_down_val( __isl_take isl_union_pw_multi_aff *upma, __isl_take isl_val *val); __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_params( __isl_take isl_union_pw_multi_aff *upma, __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_union_pw_multi_aff *isl_union_pw_multi_aff_subtract_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_multi_aff( __isl_take isl_multi_aff *ma); __isl_give isl_multi_pw_aff *isl_multi_pw_aff_from_pw_aff( __isl_take isl_pw_aff *pa); __isl_give isl_set *isl_multi_pw_aff_domain(__isl_take isl_multi_pw_aff *mpa); __isl_give isl_multi_pw_aff *isl_multi_pw_aff_intersect_params( __isl_take isl_multi_pw_aff *mpa, __isl_take isl_set *set); __isl_give isl_multi_pw_aff *isl_multi_pw_aff_intersect_domain( __isl_take isl_multi_pw_aff *mpa, __isl_take isl_set *domain); __isl_give isl_multi_pw_aff *isl_multi_pw_aff_coalesce( __isl_take isl_multi_pw_aff *mpa); __isl_give isl_multi_pw_aff *isl_multi_pw_aff_gist( __isl_take isl_multi_pw_aff *mpa, __isl_take isl_set *set); __isl_give isl_multi_pw_aff *isl_multi_pw_aff_gist_params( __isl_take isl_multi_pw_aff *mpa, __isl_take isl_set *set); isl_bool isl_multi_pw_aff_is_equal(__isl_keep isl_multi_pw_aff *mpa1, __isl_keep isl_multi_pw_aff *mpa2); __isl_give isl_multi_pw_aff *isl_multi_pw_aff_pullback_multi_aff( __isl_take isl_multi_pw_aff *mpa, __isl_take isl_multi_aff *ma); __isl_give isl_multi_pw_aff *isl_multi_pw_aff_pullback_pw_multi_aff( __isl_take isl_multi_pw_aff *mpa, __isl_take isl_pw_multi_aff *pma); __isl_give isl_multi_pw_aff *isl_multi_pw_aff_pullback_multi_pw_aff( __isl_take isl_multi_pw_aff *mpa1, __isl_take isl_multi_pw_aff *mpa2); __isl_give isl_multi_pw_aff *isl_multi_pw_aff_move_dims( __isl_take isl_multi_pw_aff *pma, 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_from_multi_pw_aff(__isl_take isl_multi_pw_aff *mpa); __isl_give isl_map *isl_map_from_multi_pw_aff(__isl_take isl_multi_pw_aff *mpa); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_multi_pw_aff( __isl_take isl_multi_pw_aff *mpa); __isl_give isl_multi_pw_aff *isl_multi_pw_aff_from_pw_multi_aff( __isl_take isl_pw_multi_aff *pma); __isl_give isl_map *isl_multi_pw_aff_eq_map(__isl_take isl_multi_pw_aff *mpa1, __isl_take isl_multi_pw_aff *mpa2); __isl_give isl_map *isl_multi_pw_aff_lex_lt_map( __isl_take isl_multi_pw_aff *mpa1, __isl_take isl_multi_pw_aff *mpa2); __isl_give isl_map *isl_multi_pw_aff_lex_gt_map( __isl_take isl_multi_pw_aff *mpa1, __isl_take isl_multi_pw_aff *mpa2); __isl_give isl_multi_pw_aff *isl_multi_pw_aff_read_from_str(isl_ctx *ctx, const char *str); __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); __isl_give isl_union_pw_aff *isl_union_pw_aff_copy( __isl_keep isl_union_pw_aff *upa); __isl_null isl_union_pw_aff *isl_union_pw_aff_free( __isl_take isl_union_pw_aff *upa); isl_ctx *isl_union_pw_aff_get_ctx(__isl_keep isl_union_pw_aff *upa); __isl_give isl_space *isl_union_pw_aff_get_space( __isl_keep isl_union_pw_aff *upa); unsigned isl_union_pw_aff_dim(__isl_keep isl_union_pw_aff *upa, enum isl_dim_type type); __isl_give isl_union_pw_aff *isl_union_pw_aff_set_dim_name( __isl_take isl_union_pw_aff *upa, enum isl_dim_type type, unsigned pos, const char *s); int isl_union_pw_aff_find_dim_by_name(__isl_keep isl_union_pw_aff *upa, enum isl_dim_type type, const char *name); __isl_give isl_union_pw_aff *isl_union_pw_aff_drop_dims( __isl_take isl_union_pw_aff *upa, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_union_pw_aff *isl_union_pw_aff_reset_user( __isl_take isl_union_pw_aff *upa); __isl_give isl_union_pw_aff *isl_union_pw_aff_empty( __isl_take isl_space *space); __isl_give isl_union_pw_aff *isl_union_pw_aff_from_pw_aff( __isl_take isl_pw_aff *pa); __isl_give isl_union_pw_aff *isl_union_pw_aff_val_on_domain( __isl_take isl_union_set *domain, __isl_take isl_val *v); __isl_give isl_union_pw_aff *isl_union_pw_aff_aff_on_domain( __isl_take isl_union_set *domain, __isl_take isl_aff *aff); __isl_give isl_union_pw_aff *isl_union_pw_aff_add_pw_aff( __isl_take isl_union_pw_aff *upa, __isl_take isl_pw_aff *pa); __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_from_union_pw_aff( __isl_take isl_union_pw_aff *upa); int isl_union_pw_aff_n_pw_aff(__isl_keep isl_union_pw_aff *upa); isl_stat isl_union_pw_aff_foreach_pw_aff(__isl_keep isl_union_pw_aff *upa, isl_stat (*fn)(__isl_take isl_pw_aff *ma, void *user), void *user); __isl_give isl_pw_aff *isl_union_pw_aff_extract_pw_aff( __isl_keep isl_union_pw_aff *upa, __isl_take isl_space *space); isl_bool isl_union_pw_aff_plain_is_equal(__isl_keep isl_union_pw_aff *upa1, __isl_keep isl_union_pw_aff *upa2); __isl_give isl_union_set *isl_union_pw_aff_domain( __isl_take isl_union_pw_aff *upa); __isl_give isl_union_pw_aff *isl_union_pw_aff_neg( __isl_take isl_union_pw_aff *upa); __isl_give isl_union_pw_aff *isl_union_pw_aff_add( __isl_take isl_union_pw_aff *upa1, __isl_take isl_union_pw_aff *upa2); __isl_give isl_union_pw_aff *isl_union_pw_aff_union_add( __isl_take isl_union_pw_aff *upa1, __isl_take isl_union_pw_aff *upa2); __isl_give isl_union_pw_aff *isl_union_pw_aff_sub( __isl_take isl_union_pw_aff *upa1, __isl_take isl_union_pw_aff *upa2); __isl_give isl_union_pw_aff *isl_union_pw_aff_coalesce( __isl_take isl_union_pw_aff *upa); __isl_give isl_union_pw_aff *isl_union_pw_aff_gist( __isl_take isl_union_pw_aff *upa, __isl_take isl_union_set *context); __isl_give isl_union_pw_aff *isl_union_pw_aff_gist_params( __isl_take isl_union_pw_aff *upa, __isl_take isl_set *context); __isl_give isl_union_pw_aff *isl_union_pw_aff_pullback_union_pw_multi_aff( __isl_take isl_union_pw_aff *upa, __isl_take isl_union_pw_multi_aff *upma); __isl_give isl_union_pw_aff *isl_union_pw_aff_floor( __isl_take isl_union_pw_aff *upa); __isl_give isl_union_pw_aff *isl_union_pw_aff_scale_val( __isl_take isl_union_pw_aff *upa, __isl_take isl_val *v); __isl_give isl_union_pw_aff *isl_union_pw_aff_scale_down_val( __isl_take isl_union_pw_aff *upa, __isl_take isl_val *v); __isl_give isl_union_pw_aff *isl_union_pw_aff_mod_val( __isl_take isl_union_pw_aff *upa, __isl_take isl_val *f); __isl_give isl_union_pw_aff *isl_union_pw_aff_align_params( __isl_take isl_union_pw_aff *upa, __isl_take isl_space *model); __isl_give isl_union_pw_aff *isl_union_pw_aff_intersect_params( __isl_take isl_union_pw_aff *upa, __isl_take isl_set *set); __isl_give isl_union_pw_aff *isl_union_pw_aff_intersect_domain( __isl_take isl_union_pw_aff *upa, __isl_take isl_union_set *uset); __isl_give isl_union_pw_aff *isl_union_pw_aff_subtract_domain( __isl_take isl_union_pw_aff *upa, __isl_take isl_union_set *uset); __isl_give isl_union_pw_aff *isl_union_pw_aff_set_dim_name( __isl_take isl_union_pw_aff *upa, enum isl_dim_type type, unsigned pos, const char *s); __isl_give isl_union_set *isl_union_pw_aff_zero_union_set( __isl_take isl_union_pw_aff *upa); __isl_give isl_union_map *isl_union_map_from_union_pw_aff( __isl_take isl_union_pw_aff *upa); __isl_give char *isl_union_pw_aff_to_str(__isl_keep isl_union_pw_aff *upa); __isl_give isl_printer *isl_printer_print_union_pw_aff( __isl_take isl_printer *p, __isl_keep isl_union_pw_aff *upa); ISL_DECLARE_MULTI(union_pw_aff) ISL_DECLARE_MULTI_NEG(union_pw_aff) __isl_give isl_multi_union_pw_aff *isl_multi_union_pw_aff_from_multi_aff( __isl_take isl_multi_aff *ma); __isl_give isl_multi_union_pw_aff *isl_multi_union_pw_aff_from_union_pw_aff( __isl_take isl_union_pw_aff *upa); __isl_give isl_multi_union_pw_aff *isl_multi_union_pw_aff_from_multi_pw_aff( __isl_take isl_multi_pw_aff *mpa); __isl_give isl_multi_union_pw_aff *isl_multi_union_pw_aff_multi_val_on_domain( __isl_take isl_union_set *domain, __isl_take isl_multi_val *mv); __isl_give isl_multi_union_pw_aff *isl_multi_union_pw_aff_multi_aff_on_domain( __isl_take isl_union_set *domain, __isl_take isl_multi_aff *ma); __isl_give isl_multi_union_pw_aff *isl_multi_union_pw_aff_floor( __isl_take isl_multi_union_pw_aff *mupa); __isl_give isl_multi_union_pw_aff *isl_multi_union_pw_aff_intersect_domain( __isl_take isl_multi_union_pw_aff *mupa, __isl_take isl_union_set *uset); __isl_give isl_multi_union_pw_aff *isl_multi_union_pw_aff_intersect_params( __isl_take isl_multi_union_pw_aff *mupa, __isl_take isl_set *params); __isl_give isl_multi_union_pw_aff *isl_multi_union_pw_aff_intersect_range( __isl_take isl_multi_union_pw_aff *mupa, __isl_take isl_set *set); __isl_give isl_union_set *isl_multi_union_pw_aff_domain( __isl_take isl_multi_union_pw_aff *mupa); __isl_give isl_multi_union_pw_aff *isl_multi_union_pw_aff_gist( __isl_take isl_multi_union_pw_aff *aff, __isl_take isl_union_set *context); __isl_give isl_multi_union_pw_aff *isl_multi_union_pw_aff_gist_params( __isl_take isl_multi_union_pw_aff *aff, __isl_take isl_set *context); __isl_give isl_union_pw_aff *isl_multi_union_pw_aff_apply_aff( __isl_take isl_multi_union_pw_aff *mupa, __isl_take isl_aff *aff); __isl_give isl_multi_union_pw_aff *isl_multi_union_pw_aff_apply_multi_aff( __isl_take isl_multi_union_pw_aff *mupa, __isl_take isl_multi_aff *ma); __isl_give isl_multi_union_pw_aff *isl_multi_union_pw_aff_apply_multi_aff( __isl_take isl_multi_union_pw_aff *mupa, __isl_take isl_multi_aff *ma); __isl_give isl_multi_union_pw_aff *isl_multi_union_pw_aff_apply_pw_multi_aff( __isl_take isl_multi_union_pw_aff *mupa, __isl_take isl_pw_multi_aff *pma); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_pullback_union_pw_multi_aff( __isl_take isl_multi_union_pw_aff *mupa, __isl_take isl_union_pw_multi_aff *upma); __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_from_multi_union_pw_aff( __isl_take isl_multi_union_pw_aff *mupa); __isl_give isl_multi_union_pw_aff *isl_multi_union_pw_aff_union_add( __isl_take isl_multi_union_pw_aff *mupa1, __isl_take isl_multi_union_pw_aff *mupa2); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_from_union_pw_multi_aff( __isl_take isl_union_pw_multi_aff *upma); __isl_give isl_multi_union_pw_aff *isl_multi_union_pw_aff_from_union_map( __isl_take isl_union_map *umap); __isl_give isl_union_map *isl_union_map_from_multi_union_pw_aff( __isl_take isl_multi_union_pw_aff *mupa); __isl_give isl_union_set *isl_multi_union_pw_aff_zero_union_set( __isl_take isl_multi_union_pw_aff *mupa); __isl_give isl_multi_pw_aff *isl_multi_union_pw_aff_extract_multi_pw_aff( __isl_keep isl_multi_union_pw_aff *mupa, __isl_take isl_space *space); __isl_give isl_multi_union_pw_aff *isl_multi_union_pw_aff_read_from_str( isl_ctx *ctx, const char *str); __isl_give char *isl_multi_union_pw_aff_to_str( __isl_keep isl_multi_union_pw_aff *mupa); __isl_give isl_printer *isl_printer_print_multi_union_pw_aff( __isl_take isl_printer *p, __isl_keep isl_multi_union_pw_aff *mupa); void isl_multi_union_pw_aff_dump(__isl_keep isl_multi_union_pw_aff *mupa); ISL_DECLARE_LIST_FN(union_pw_aff) ISL_DECLARE_LIST_FN(union_pw_multi_aff) #if defined(__cplusplus) } #endif #endif cloog-0.18.4/isl/include/isl/map_type.h0000644000175000017500000000135312554427055014633 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; ISL_DECLARE_LIST_TYPE(basic_map) struct __isl_subclass(isl_union_map) isl_map; typedef struct isl_map isl_map; ISL_DECLARE_LIST_TYPE(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.4/isl/include/isl/ilp.h0000644000175000017500000000135412413270107013566 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 #include #if defined(__cplusplus) extern "C" { #endif __isl_give isl_val *isl_basic_set_max_val(__isl_keep isl_basic_set *bset, __isl_keep isl_aff *obj); __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.4/isl/include/isl/mat.h0000644000175000017500000001022512413270107013560 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 #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); __isl_null isl_mat *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); __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_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_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); 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.4/isl/include/isl/val.h0000644000175000017500000001161312554427055013577 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_DECLARE_MULTI_NEG(val) ISL_DECLARE_MULTI_DIMS(val) ISL_DECLARE_MULTI_WITH_DOMAIN(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_negone(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); __isl_null isl_val *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_inv(__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); isl_bool isl_val_is_zero(__isl_keep isl_val *v); isl_bool isl_val_is_one(__isl_keep isl_val *v); isl_bool isl_val_is_negone(__isl_keep isl_val *v); isl_bool isl_val_is_nonneg(__isl_keep isl_val *v); isl_bool isl_val_is_nonpos(__isl_keep isl_val *v); isl_bool isl_val_is_pos(__isl_keep isl_val *v); isl_bool isl_val_is_neg(__isl_keep isl_val *v); isl_bool isl_val_is_int(__isl_keep isl_val *v); isl_bool isl_val_is_rat(__isl_keep isl_val *v); isl_bool isl_val_is_nan(__isl_keep isl_val *v); isl_bool isl_val_is_infty(__isl_keep isl_val *v); isl_bool isl_val_is_neginfty(__isl_keep isl_val *v); int isl_val_cmp_si(__isl_keep isl_val *v, long i); isl_bool isl_val_lt(__isl_keep isl_val *v1, __isl_keep isl_val *v2); isl_bool isl_val_le(__isl_keep isl_val *v1, __isl_keep isl_val *v2); isl_bool isl_val_gt(__isl_keep isl_val *v1, __isl_keep isl_val *v2); isl_bool isl_val_ge(__isl_keep isl_val *v1, __isl_keep isl_val *v2); isl_bool isl_val_eq(__isl_keep isl_val *v1, __isl_keep isl_val *v2); isl_bool isl_val_ne(__isl_keep isl_val *v1, __isl_keep isl_val *v2); isl_bool isl_val_abs_eq(__isl_keep isl_val *v1, __isl_keep isl_val *v2); isl_bool 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); __isl_give isl_multi_val *isl_multi_val_read_from_str(isl_ctx *ctx, const char *str); __isl_give isl_printer *isl_printer_print_multi_val(__isl_take isl_printer *p, __isl_keep isl_multi_val *mv); void isl_multi_val_dump(__isl_keep isl_multi_val *mv); __isl_give char *isl_multi_val_to_str(__isl_keep isl_multi_val *mv); #if defined(__cplusplus) } #endif #endif cloog-0.18.4/isl/include/isl/ctx.h0000644000175000017500000001705012554427055013614 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 #ifndef __isl_give #define __isl_give #endif #ifndef __isl_take #define __isl_take #endif #ifndef __isl_keep #define __isl_keep #endif #ifndef __isl_null #define __isl_null #endif #ifndef __isl_export #define __isl_export #endif #ifndef __isl_constructor #define __isl_constructor #endif #ifndef __isl_subclass #define __isl_subclass(super) #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_alloc, isl_error_unknown, isl_error_internal, isl_error_invalid, isl_error_quota, isl_error_unsupported }; typedef enum { isl_stat_error = -1, isl_stat_ok = 0, } isl_stat; typedef enum { isl_bool_error = -1, isl_bool_false = 0, isl_bool_true = 1 } isl_bool; struct isl_ctx; typedef struct isl_ctx isl_ctx; /* Some helper macros */ #if __GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 1) #define ISL_DEPRECATED __attribute__((__deprecated__)) #else #define ISL_DEPRECATED #endif #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) void *isl_malloc_or_die(isl_ctx *ctx, size_t size); void *isl_calloc_or_die(isl_ctx *ctx, size_t nmemb, size_t size); void *isl_realloc_or_die(isl_ctx *ctx, void *ptr, size_t size); #define isl_alloc(ctx,type,size) ((type *)isl_malloc_or_die(ctx, size)) #define isl_calloc(ctx,type,size) ((type *)isl_calloc_or_die(ctx,\ 1, size)) #define isl_realloc(ctx,ptr,type,size) ((type *)isl_realloc_or_die(ctx,\ 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_calloc_or_die(ctx,\ 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); void isl_ctx_set_max_operations(isl_ctx *ctx, unsigned long max_operations); unsigned long isl_ctx_get_max_operations(isl_ctx *ctx); void isl_ctx_reset_operations(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) \ isl_stat 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 isl_stat_error); \ options->field = val; \ return isl_stat_ok; \ } #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) \ isl_stat 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 isl_stat_error); \ if (!val) \ return isl_stat_error; \ free(options->field); \ options->field = strdup(val); \ if (!options->field) \ return isl_stat_error; \ return isl_stat_ok; \ } #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.4/isl/include/isl/local_space.h0000644000175000017500000000660012554427055015262 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); __isl_null isl_local_space *isl_local_space_free( __isl_take isl_local_space *ls); isl_bool isl_local_space_is_params(__isl_keep isl_local_space *ls); isl_bool isl_local_space_is_set(__isl_keep isl_local_space *ls); __isl_give isl_local_space *isl_local_space_set_tuple_id( __isl_take isl_local_space *ls, enum isl_dim_type type, __isl_take isl_id *id); int isl_local_space_dim(__isl_keep isl_local_space *ls, enum isl_dim_type type); isl_bool 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_bool 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); int isl_local_space_find_dim_by_name(__isl_keep isl_local_space *ls, enum isl_dim_type type, const char *name); __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); __isl_give isl_local_space *isl_local_space_wrap( __isl_take isl_local_space *ls); isl_bool 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_local_space *isl_local_space_flatten_domain( __isl_take isl_local_space *ls); __isl_give isl_local_space *isl_local_space_flatten_range( __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.4/isl/include/isl/schedule_type.h0000644000175000017500000000121012554427055015642 00000000000000#ifndef ISL_SCHEDULE_TYPE_H #define ISL_SCHEDULE_TYPE_H #if defined(__cplusplus) extern "C" { #endif enum isl_schedule_node_type { isl_schedule_node_error = -1, isl_schedule_node_band, isl_schedule_node_context, isl_schedule_node_domain, isl_schedule_node_expansion, isl_schedule_node_extension, isl_schedule_node_filter, isl_schedule_node_leaf, isl_schedule_node_guard, isl_schedule_node_mark, isl_schedule_node_sequence, isl_schedule_node_set }; struct isl_schedule_node; typedef struct isl_schedule_node isl_schedule_node; struct isl_schedule; typedef struct isl_schedule isl_schedule; #if defined(__cplusplus) } #endif #endif cloog-0.18.4/isl/include/isl/ast_build.h0000644000175000017500000001125412554427055014764 00000000000000#ifndef ISL_AST_CONTEXT_H #define ISL_AST_CONTEXT_H #include #include #include #include #if defined(__cplusplus) extern "C" { #endif struct isl_ast_build; typedef struct isl_ast_build isl_ast_build; isl_stat 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); isl_stat isl_options_set_ast_build_prefer_pdiv(isl_ctx *ctx, int val); int isl_options_get_ast_build_prefer_pdiv(isl_ctx *ctx); isl_stat 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); isl_stat 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 isl_stat isl_options_set_ast_build_separation_bounds(isl_ctx *ctx, int val); int isl_options_get_ast_build_separation_bounds(isl_ctx *ctx); isl_stat isl_options_set_ast_build_scale_strides(isl_ctx *ctx, int val); int isl_options_get_ast_build_scale_strides(isl_ctx *ctx); isl_stat isl_options_set_ast_build_allow_else(isl_ctx *ctx, int val); int isl_options_get_ast_build_allow_else(isl_ctx *ctx); isl_stat 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_alloc(isl_ctx *ctx); __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); __isl_null isl_ast_build *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_before_each_mark( __isl_take isl_ast_build *build, isl_stat (*fn)(__isl_keep isl_id *mark, __isl_keep isl_ast_build *build, void *user), void *user); __isl_give isl_ast_build *isl_ast_build_set_after_each_mark( __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_set( __isl_keep isl_ast_build *build, __isl_take isl_set *set); __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_access_from_pw_multi_aff( __isl_keep isl_ast_build *build, __isl_take isl_pw_multi_aff *pma); __isl_give isl_ast_expr *isl_ast_build_access_from_multi_pw_aff( __isl_keep isl_ast_build *build, __isl_take isl_multi_pw_aff *mpa); __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_expr *isl_ast_build_call_from_multi_pw_aff( __isl_keep isl_ast_build *build, __isl_take isl_multi_pw_aff *mpa); __isl_give isl_ast_node *isl_ast_build_node_from_schedule( __isl_keep isl_ast_build *build, __isl_take isl_schedule *schedule); __isl_give isl_ast_node *isl_ast_build_node_from_schedule_map( __isl_keep isl_ast_build *build, __isl_take isl_union_map *schedule); __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.4/isl/include/isl/union_set.h0000644000175000017500000001412312554427055015017 00000000000000#ifndef ISL_UNION_SET_H #define ISL_UNION_SET_H #include #include #if defined(__cplusplus) extern "C" { #endif unsigned isl_union_set_dim(__isl_keep isl_union_set *uset, enum isl_dim_type type); __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); __isl_null isl_union_set *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_reset_user( __isl_take 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_remove_redundancies( __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); __isl_give isl_union_set *isl_union_set_preimage_multi_aff( __isl_take isl_union_set *uset, __isl_take isl_multi_aff *ma); __isl_give isl_union_set *isl_union_set_preimage_pw_multi_aff( __isl_take isl_union_set *uset, __isl_take isl_pw_multi_aff *pma); __isl_give isl_union_set *isl_union_set_preimage_union_pw_multi_aff( __isl_take isl_union_set *uset, __isl_take isl_union_pw_multi_aff *upma); __isl_give isl_union_set *isl_union_set_project_out( __isl_take isl_union_set *uset, enum isl_dim_type type, unsigned first, unsigned n); isl_bool isl_union_set_is_params(__isl_keep isl_union_set *uset); __isl_export isl_bool isl_union_set_is_empty(__isl_keep isl_union_set *uset); __isl_export isl_bool isl_union_set_is_subset(__isl_keep isl_union_set *uset1, __isl_keep isl_union_set *uset2); __isl_export isl_bool isl_union_set_is_equal(__isl_keep isl_union_set *uset1, __isl_keep isl_union_set *uset2); isl_bool isl_union_set_is_disjoint(__isl_keep isl_union_set *uset1, __isl_keep isl_union_set *uset2); __isl_export isl_bool 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 isl_stat isl_union_set_foreach_set(__isl_keep isl_union_set *uset, isl_stat (*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); isl_stat isl_union_set_foreach_point(__isl_keep isl_union_set *uset, isl_stat (*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 char *isl_union_set_to_str(__isl_keep isl_union_set *uset); __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); ISL_DECLARE_LIST_FN(union_set) __isl_give isl_union_set *isl_union_set_list_union( __isl_take isl_union_set_list *list); #if defined(__cplusplus) } #endif #endif cloog-0.18.4/isl/include/isl/arg.h0000644000175000017500000002034012554427055013563 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_PHANTOM_USER_CHOICE_F(s,l,c,setter,d,h,fl) { \ .type = isl_arg_choice, \ .short_name = s, \ .long_name = l, \ .offset = -1, \ .help_msg = h, \ .flags = fl, \ .u = { .choice = { .choice = c, .default_value = d, \ .default_selected = d, .set = setter } } \ }, #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(l,c,h,fl) \ _ISL_ARG_CHILD(-1,l,c,h,fl) #define ISL_ARG_GROUP(l,c,h) \ ISL_ARG_GROUP_F(l,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.4/isl/include/isl/options.h0000644000175000017500000000245612554427055014515 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 isl_stat 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 isl_stat isl_options_set_on_error(isl_ctx *ctx, int val); int isl_options_get_on_error(isl_ctx *ctx); isl_stat 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 isl_stat isl_options_set_schedule_algorithm(isl_ctx *ctx, int val); int isl_options_get_schedule_algorithm(isl_ctx *ctx); isl_stat 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.4/isl/include/isl/band.h0000644000175000017500000000320212554427055013714 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); __isl_null isl_band *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); isl_stat isl_options_set_tile_scale_tile_loops(isl_ctx *ctx, int val); int isl_options_get_tile_scale_tile_loops(isl_ctx *ctx); isl_stat 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_coincident(__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.4/isl/include/isl/obj.h0000644000175000017500000000377712554427055013603 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_multi_aff_vtable; #define isl_obj_pw_multi_aff (&isl_obj_pw_multi_aff_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) extern struct isl_obj_vtable isl_obj_schedule_vtable; #define isl_obj_schedule (&isl_obj_schedule_vtable) struct isl_obj { isl_obj_type type; void *v; }; #if defined(__cplusplus) } #endif #endif cloog-0.18.4/isl/include/isl/flow.h0000644000175000017500000001066212554427055013767 00000000000000#ifndef ISL_FLOW_H #define ISL_FLOW_H #include #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; __isl_null isl_restriction *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); __isl_null isl_access_info *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); isl_stat isl_flow_foreach(__isl_keep isl_flow *deps, isl_stat (*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); struct isl_union_access_info; typedef struct isl_union_access_info isl_union_access_info; struct isl_union_flow; typedef struct isl_union_flow isl_union_flow; __isl_give isl_union_access_info *isl_union_access_info_from_sink( __isl_take isl_union_map *sink); __isl_give isl_union_access_info *isl_union_access_info_set_must_source( __isl_take isl_union_access_info *access, __isl_take isl_union_map *must_source); __isl_give isl_union_access_info *isl_union_access_info_set_may_source( __isl_take isl_union_access_info *access, __isl_take isl_union_map *may_source); __isl_give isl_union_access_info *isl_union_access_info_set_schedule( __isl_take isl_union_access_info *access, __isl_take isl_schedule *schedule); __isl_give isl_union_access_info *isl_union_access_info_set_schedule_map( __isl_take isl_union_access_info *access, __isl_take isl_union_map *schedule_map); __isl_give isl_union_access_info *isl_union_access_info_copy( __isl_keep isl_union_access_info *access); __isl_null isl_union_access_info *isl_union_access_info_free( __isl_take isl_union_access_info *access); isl_ctx *isl_union_access_info_get_ctx( __isl_keep isl_union_access_info *access); __isl_give isl_union_flow *isl_union_access_info_compute_flow( __isl_take isl_union_access_info *access); isl_ctx *isl_union_flow_get_ctx(__isl_keep isl_union_flow *flow); __isl_give isl_union_map *isl_union_flow_get_must_dependence( __isl_keep isl_union_flow *flow); __isl_give isl_union_map *isl_union_flow_get_may_dependence( __isl_keep isl_union_flow *flow); __isl_give isl_union_map *isl_union_flow_get_must_no_source( __isl_keep isl_union_flow *flow); __isl_give isl_union_map *isl_union_flow_get_may_no_source( __isl_keep isl_union_flow *flow); __isl_null isl_union_flow *isl_union_flow_free(__isl_take isl_union_flow *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); #if defined(__cplusplus) } #endif #endif cloog-0.18.4/isl/include/isl/schedule.h0000644000175000017500000001417712554427055014621 00000000000000#ifndef ISL_SCHEDULE_H #define ISL_SCHEDULE_H #include #include #include #include #include #include #include #include #if defined(__cplusplus) extern "C" { #endif struct isl_schedule_constraints; typedef struct isl_schedule_constraints isl_schedule_constraints; isl_stat isl_options_set_schedule_max_coefficient(isl_ctx *ctx, int val); int isl_options_get_schedule_max_coefficient(isl_ctx *ctx); isl_stat isl_options_set_schedule_max_constant_term(isl_ctx *ctx, int val); int isl_options_get_schedule_max_constant_term(isl_ctx *ctx); isl_stat isl_options_set_schedule_maximize_band_depth(isl_ctx *ctx, int val); int isl_options_get_schedule_maximize_band_depth(isl_ctx *ctx); isl_stat isl_options_set_schedule_outer_coincidence(isl_ctx *ctx, int val); int isl_options_get_schedule_outer_coincidence(isl_ctx *ctx); isl_stat isl_options_set_schedule_split_scaled(isl_ctx *ctx, int val); int isl_options_get_schedule_split_scaled(isl_ctx *ctx); isl_stat isl_options_set_schedule_separate_components(isl_ctx *ctx, int val); int isl_options_get_schedule_separate_components(isl_ctx *ctx); isl_stat isl_options_set_schedule_serialize_sccs(isl_ctx *ctx, int val); int isl_options_get_schedule_serialize_sccs(isl_ctx *ctx); __isl_give isl_schedule_constraints *isl_schedule_constraints_copy( __isl_keep isl_schedule_constraints *sc); __isl_give isl_schedule_constraints *isl_schedule_constraints_on_domain( __isl_take isl_union_set *domain); __isl_give isl_schedule_constraints *isl_schedule_constraints_set_context( __isl_take isl_schedule_constraints *sc, __isl_take isl_set *context); __isl_give isl_schedule_constraints *isl_schedule_constraints_set_validity( __isl_take isl_schedule_constraints *sc, __isl_take isl_union_map *validity); __isl_give isl_schedule_constraints *isl_schedule_constraints_set_coincidence( __isl_take isl_schedule_constraints *sc, __isl_take isl_union_map *coincidence); __isl_give isl_schedule_constraints *isl_schedule_constraints_set_proximity( __isl_take isl_schedule_constraints *sc, __isl_take isl_union_map *proximity); __isl_give isl_schedule_constraints * isl_schedule_constraints_set_conditional_validity( __isl_take isl_schedule_constraints *sc, __isl_take isl_union_map *condition, __isl_take isl_union_map *validity); __isl_null isl_schedule_constraints *isl_schedule_constraints_free( __isl_take isl_schedule_constraints *sc); isl_ctx *isl_schedule_constraints_get_ctx( __isl_keep isl_schedule_constraints *sc); __isl_give isl_union_map *isl_schedule_constraints_get_validity( __isl_keep isl_schedule_constraints *sc); __isl_give isl_union_map *isl_schedule_constraints_get_coincidence( __isl_keep isl_schedule_constraints *sc); __isl_give isl_union_map *isl_schedule_constraints_get_conditional_validity( __isl_keep isl_schedule_constraints *sc); __isl_give isl_union_map * isl_schedule_constraints_get_conditional_validity_condition( __isl_keep isl_schedule_constraints *sc); void isl_schedule_constraints_dump(__isl_keep isl_schedule_constraints *sc); __isl_give isl_schedule *isl_schedule_constraints_compute_schedule( __isl_take isl_schedule_constraints *sc); __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_give isl_schedule *isl_schedule_empty(__isl_take isl_space *space); __isl_give isl_schedule *isl_schedule_from_domain( __isl_take isl_union_set *domain); __isl_give isl_schedule *isl_schedule_copy(__isl_keep isl_schedule *sched); __isl_null isl_schedule *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_bool isl_schedule_plain_is_equal(__isl_keep isl_schedule *schedule1, __isl_keep isl_schedule *schedule2); __isl_give isl_schedule_node *isl_schedule_get_root( __isl_keep isl_schedule *schedule); __isl_give isl_union_set *isl_schedule_get_domain( __isl_keep isl_schedule *schedule); isl_stat isl_schedule_foreach_schedule_node_top_down( __isl_keep isl_schedule *sched, isl_bool (*fn)(__isl_keep isl_schedule_node *node, void *user), void *user); __isl_give isl_schedule *isl_schedule_map_schedule_node_bottom_up( __isl_take isl_schedule *schedule, __isl_give isl_schedule_node *(*fn)( __isl_take isl_schedule_node *node, void *user), void *user); __isl_give isl_schedule *isl_schedule_insert_context( __isl_take isl_schedule *schedule, __isl_take isl_set *context); __isl_give isl_schedule *isl_schedule_insert_partial_schedule( __isl_take isl_schedule *schedule, __isl_take isl_multi_union_pw_aff *partial); __isl_give isl_schedule *isl_schedule_insert_guard( __isl_take isl_schedule *schedule, __isl_take isl_set *guard); __isl_give isl_schedule *isl_schedule_sequence( __isl_take isl_schedule *schedule1, __isl_take isl_schedule *schedule2); __isl_give isl_schedule *isl_schedule_set( __isl_take isl_schedule *schedule1, __isl_take isl_schedule *schedule2); __isl_give isl_schedule *isl_schedule_intersect_domain( __isl_take isl_schedule *schedule, __isl_take isl_union_set *domain); __isl_give isl_schedule *isl_schedule_reset_user( __isl_take isl_schedule *schedule); __isl_give isl_schedule *isl_schedule_align_params( __isl_take isl_schedule *schedule, __isl_take isl_space *space); __isl_give isl_schedule *isl_schedule_pullback_union_pw_multi_aff( __isl_take isl_schedule *schedule, __isl_take isl_union_pw_multi_aff *upma); __isl_give isl_band_list *isl_schedule_get_band_forest( __isl_keep isl_schedule *schedule); __isl_give isl_schedule *isl_schedule_read_from_file(isl_ctx *ctx, FILE *input); __isl_give isl_schedule *isl_schedule_read_from_str(isl_ctx *ctx, const char *str); __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.4/isl/include/isl/ast.h0000644000175000017500000001673112554427055013612 00000000000000#ifndef ISL_AST_H #define ISL_AST_H #include #include #include #include #include #include #include #if defined(__cplusplus) extern "C" { #endif isl_stat isl_options_set_ast_iterator_type(isl_ctx *ctx, const char *val); const char *isl_options_get_ast_iterator_type(isl_ctx *ctx); isl_stat isl_options_set_ast_always_print_block(isl_ctx *ctx, int val); int isl_options_get_ast_always_print_block(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_pdiv_q(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2); __isl_give isl_ast_expr *isl_ast_expr_pdiv_r(__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_and_then(__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_or_else(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2); __isl_give isl_ast_expr *isl_ast_expr_le(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2); __isl_give isl_ast_expr *isl_ast_expr_lt(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2); __isl_give isl_ast_expr *isl_ast_expr_ge(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2); __isl_give isl_ast_expr *isl_ast_expr_gt(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2); __isl_give isl_ast_expr *isl_ast_expr_eq(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2); __isl_give isl_ast_expr *isl_ast_expr_access(__isl_take isl_ast_expr *array, __isl_take isl_ast_expr_list *indices); __isl_give isl_ast_expr *isl_ast_expr_call(__isl_take isl_ast_expr *function, __isl_take isl_ast_expr_list *arguments); __isl_give isl_ast_expr *isl_ast_expr_address_of(__isl_take isl_ast_expr *expr); __isl_give isl_ast_expr *isl_ast_expr_copy(__isl_keep isl_ast_expr *expr); __isl_null isl_ast_expr *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); __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_ast_expr *isl_ast_expr_set_op_arg(__isl_take isl_ast_expr *expr, int pos, __isl_take isl_ast_expr *arg); isl_bool isl_ast_expr_is_equal(__isl_keep isl_ast_expr *expr1, __isl_keep isl_ast_expr *expr2); __isl_give isl_ast_expr *isl_ast_expr_substitute_ids( __isl_take isl_ast_expr *expr, __isl_take isl_id_to_ast_expr *id2expr); __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); __isl_null isl_ast_node *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); isl_bool 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); isl_bool 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_id *isl_ast_node_mark_get_id(__isl_keep isl_ast_node *node); __isl_give isl_ast_node *isl_ast_node_mark_get_node( __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); __isl_null isl_ast_print_options *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); isl_stat isl_ast_node_foreach_ast_op_type(__isl_keep isl_ast_node *node, isl_stat (*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.4/isl/include/isl/map_to_basic_set.h0000644000175000017500000000036212413270107016273 00000000000000#ifndef ISL_MAP_TO_BASIC_SET_H #define ISL_MAP_TO_BASIC_SET_H #include #include #define ISL_KEY_BASE map #define ISL_VAL_BASE basic_set #include #undef ISL_KEY_BASE #undef ISL_VAL_BASE #endif cloog-0.18.4/isl/include/isl/ast_type.h0000644000175000017500000000273612554427055014653 00000000000000#ifndef ISL_AST_TYPE_H #define ISL_AST_TYPE_H #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_zdiv_r, /* Result only compared against zero */ 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, isl_ast_op_access, isl_ast_op_member, isl_ast_op_address_of }; 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_mark, isl_ast_node_user }; enum isl_ast_loop_type { isl_ast_loop_error = -1, isl_ast_loop_default = 0, isl_ast_loop_atomic, isl_ast_loop_unroll, isl_ast_loop_separate }; 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) #if defined(__cplusplus) } #endif #endif cloog-0.18.4/isl/include/isl/aff_type.h0000644000175000017500000000155512554427055014616 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_union_pw_aff; typedef struct isl_union_pw_aff isl_union_pw_aff; ISL_DECLARE_LIST_TYPE(union_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; ISL_DECLARE_LIST_TYPE(union_pw_multi_aff) struct isl_multi_pw_aff; typedef struct isl_multi_pw_aff isl_multi_pw_aff; struct isl_multi_union_pw_aff; typedef struct isl_multi_union_pw_aff isl_multi_union_pw_aff; #if defined(__cplusplus) } #endif #endif cloog-0.18.4/isl/include/isl/schedule_node.h0000644000175000017500000002340212554427055015615 00000000000000#ifndef ISL_SCHEDULE_NODE_H #define ISL_SCHEDULE_NODE_H #include #include #include #include #include #include #if defined(__cplusplus) extern "C" { #endif __isl_give isl_schedule_node *isl_schedule_node_from_domain( __isl_take isl_union_set *domain); __isl_give isl_schedule_node *isl_schedule_node_from_extension( __isl_take isl_union_map *extension); __isl_give isl_schedule_node *isl_schedule_node_copy( __isl_keep isl_schedule_node *node); __isl_null isl_schedule_node *isl_schedule_node_free( __isl_take isl_schedule_node *node); isl_bool isl_schedule_node_is_equal(__isl_keep isl_schedule_node *node1, __isl_keep isl_schedule_node *node2); isl_ctx *isl_schedule_node_get_ctx(__isl_keep isl_schedule_node *node); enum isl_schedule_node_type isl_schedule_node_get_type( __isl_keep isl_schedule_node *node); enum isl_schedule_node_type isl_schedule_node_get_parent_type( __isl_keep isl_schedule_node *node); __isl_give isl_schedule *isl_schedule_node_get_schedule( __isl_keep isl_schedule_node *node); isl_stat isl_schedule_node_foreach_descendant_top_down( __isl_keep isl_schedule_node *node, isl_bool (*fn)(__isl_keep isl_schedule_node *node, void *user), void *user); isl_stat isl_schedule_node_foreach_ancestor_top_down( __isl_keep isl_schedule_node *node, isl_stat (*fn)(__isl_keep isl_schedule_node *node, void *user), void *user); __isl_give isl_schedule_node *isl_schedule_node_map_descendant_bottom_up( __isl_take isl_schedule_node *node, __isl_give isl_schedule_node *(*fn)(__isl_take isl_schedule_node *node, void *user), void *user); int isl_schedule_node_get_tree_depth(__isl_keep isl_schedule_node *node); isl_bool isl_schedule_node_has_parent(__isl_keep isl_schedule_node *node); isl_bool isl_schedule_node_has_children(__isl_keep isl_schedule_node *node); isl_bool isl_schedule_node_has_previous_sibling( __isl_keep isl_schedule_node *node); isl_bool isl_schedule_node_has_next_sibling(__isl_keep isl_schedule_node *node); int isl_schedule_node_n_children(__isl_keep isl_schedule_node *node); int isl_schedule_node_get_child_position(__isl_keep isl_schedule_node *node); int isl_schedule_node_get_ancestor_child_position( __isl_keep isl_schedule_node *node, __isl_keep isl_schedule_node *ancestor); __isl_give isl_schedule_node *isl_schedule_node_get_child( __isl_keep isl_schedule_node *node, int pos); __isl_give isl_schedule_node *isl_schedule_node_get_shared_ancestor( __isl_keep isl_schedule_node *node1, __isl_keep isl_schedule_node *node2); __isl_give isl_schedule_node *isl_schedule_node_root( __isl_take isl_schedule_node *node); __isl_give isl_schedule_node *isl_schedule_node_parent( __isl_take isl_schedule_node *node); __isl_give isl_schedule_node *isl_schedule_node_ancestor( __isl_take isl_schedule_node *node, int generation); __isl_give isl_schedule_node *isl_schedule_node_child( __isl_take isl_schedule_node *node, int pos); __isl_give isl_schedule_node *isl_schedule_node_first_child( __isl_take isl_schedule_node *node); __isl_give isl_schedule_node *isl_schedule_node_previous_sibling( __isl_take isl_schedule_node *node); __isl_give isl_schedule_node *isl_schedule_node_next_sibling( __isl_take isl_schedule_node *node); isl_bool isl_schedule_node_is_subtree_anchored( __isl_keep isl_schedule_node *node); __isl_give isl_schedule_node *isl_schedule_node_group( __isl_take isl_schedule_node *node, __isl_take isl_id *group_id); __isl_give isl_space *isl_schedule_node_band_get_space( __isl_keep isl_schedule_node *node); __isl_give isl_multi_union_pw_aff *isl_schedule_node_band_get_partial_schedule( __isl_keep isl_schedule_node *node); __isl_give isl_union_map *isl_schedule_node_band_get_partial_schedule_union_map( __isl_keep isl_schedule_node *node); enum isl_ast_loop_type isl_schedule_node_band_member_get_ast_loop_type( __isl_keep isl_schedule_node *node, int pos); __isl_give isl_schedule_node *isl_schedule_node_band_member_set_ast_loop_type( __isl_take isl_schedule_node *node, int pos, enum isl_ast_loop_type type); enum isl_ast_loop_type isl_schedule_node_band_member_get_isolate_ast_loop_type( __isl_keep isl_schedule_node *node, int pos); __isl_give isl_schedule_node * isl_schedule_node_band_member_set_isolate_ast_loop_type( __isl_take isl_schedule_node *node, int pos, enum isl_ast_loop_type type); __isl_give isl_union_set *isl_schedule_node_band_get_ast_build_options( __isl_keep isl_schedule_node *node); __isl_give isl_schedule_node *isl_schedule_node_band_set_ast_build_options( __isl_take isl_schedule_node *node, __isl_take isl_union_set *options); unsigned isl_schedule_node_band_n_member(__isl_keep isl_schedule_node *node); isl_bool isl_schedule_node_band_member_get_coincident( __isl_keep isl_schedule_node *node, int pos); __isl_give isl_schedule_node *isl_schedule_node_band_member_set_coincident( __isl_take isl_schedule_node *node, int pos, int coincident); isl_bool isl_schedule_node_band_get_permutable( __isl_keep isl_schedule_node *node); __isl_give isl_schedule_node *isl_schedule_node_band_set_permutable( __isl_take isl_schedule_node *node, int permutable); isl_stat isl_options_set_tile_scale_tile_loops(isl_ctx *ctx, int val); int isl_options_get_tile_scale_tile_loops(isl_ctx *ctx); isl_stat isl_options_set_tile_shift_point_loops(isl_ctx *ctx, int val); int isl_options_get_tile_shift_point_loops(isl_ctx *ctx); __isl_give isl_schedule_node *isl_schedule_node_band_scale( __isl_take isl_schedule_node *node, __isl_take isl_multi_val *mv); __isl_give isl_schedule_node *isl_schedule_node_band_scale_down( __isl_take isl_schedule_node *node, __isl_take isl_multi_val *mv); __isl_give isl_schedule_node *isl_schedule_node_band_tile( __isl_take isl_schedule_node *node, __isl_take isl_multi_val *sizes); __isl_give isl_schedule_node *isl_schedule_node_band_sink( __isl_take isl_schedule_node *node); __isl_give isl_schedule_node *isl_schedule_node_band_split( __isl_take isl_schedule_node *node, int pos); __isl_give isl_set *isl_schedule_node_context_get_context( __isl_keep isl_schedule_node *node); __isl_give isl_union_set *isl_schedule_node_domain_get_domain( __isl_keep isl_schedule_node *node); __isl_give isl_union_map *isl_schedule_node_expansion_get_expansion( __isl_keep isl_schedule_node *node); __isl_give isl_union_pw_multi_aff *isl_schedule_node_expansion_get_contraction( __isl_keep isl_schedule_node *node); __isl_give isl_union_map *isl_schedule_node_extension_get_extension( __isl_keep isl_schedule_node *node); __isl_give isl_union_set *isl_schedule_node_filter_get_filter( __isl_keep isl_schedule_node *node); __isl_give isl_set *isl_schedule_node_guard_get_guard( __isl_keep isl_schedule_node *node); __isl_give isl_id *isl_schedule_node_mark_get_id( __isl_keep isl_schedule_node *node); int isl_schedule_node_get_schedule_depth(__isl_keep isl_schedule_node *node); __isl_give isl_union_set *isl_schedule_node_get_domain( __isl_keep isl_schedule_node *node); __isl_give isl_union_set *isl_schedule_node_get_universe_domain( __isl_keep isl_schedule_node *node); __isl_give isl_multi_union_pw_aff * isl_schedule_node_get_prefix_schedule_multi_union_pw_aff( __isl_keep isl_schedule_node *node); __isl_give isl_union_pw_multi_aff * isl_schedule_node_get_prefix_schedule_union_pw_multi_aff( __isl_keep isl_schedule_node *node); __isl_give isl_union_map *isl_schedule_node_get_prefix_schedule_union_map( __isl_keep isl_schedule_node *node); __isl_give isl_union_map *isl_schedule_node_get_prefix_schedule_relation( __isl_keep isl_schedule_node *node); __isl_give isl_union_map *isl_schedule_node_get_subtree_schedule_union_map( __isl_keep isl_schedule_node *node); __isl_give isl_union_map *isl_schedule_node_get_subtree_expansion( __isl_keep isl_schedule_node *node); __isl_give isl_union_pw_multi_aff *isl_schedule_node_get_subtree_contraction( __isl_keep isl_schedule_node *node); __isl_give isl_schedule_node *isl_schedule_node_insert_context( __isl_take isl_schedule_node *node, __isl_take isl_set *context); __isl_give isl_schedule_node *isl_schedule_node_insert_partial_schedule( __isl_take isl_schedule_node *node, __isl_take isl_multi_union_pw_aff *schedule); __isl_give isl_schedule_node *isl_schedule_node_insert_filter( __isl_take isl_schedule_node *node, __isl_take isl_union_set *filter); __isl_give isl_schedule_node *isl_schedule_node_insert_guard( __isl_take isl_schedule_node *node, __isl_take isl_set *context); __isl_give isl_schedule_node *isl_schedule_node_insert_mark( __isl_take isl_schedule_node *node, __isl_take isl_id *mark); __isl_give isl_schedule_node *isl_schedule_node_insert_sequence( __isl_take isl_schedule_node *node, __isl_take isl_union_set_list *filters); __isl_give isl_schedule_node *isl_schedule_node_insert_set( __isl_take isl_schedule_node *node, __isl_take isl_union_set_list *filters); __isl_give isl_schedule_node *isl_schedule_node_cut( __isl_take isl_schedule_node *node); __isl_give isl_schedule_node *isl_schedule_node_delete( __isl_take isl_schedule_node *node); __isl_give isl_schedule_node *isl_schedule_node_order_after( __isl_take isl_schedule_node *node, __isl_take isl_union_set *filter); __isl_give isl_schedule_node *isl_schedule_node_graft_before( __isl_take isl_schedule_node *node, __isl_take isl_schedule_node *graft); __isl_give isl_schedule_node *isl_schedule_node_graft_after( __isl_take isl_schedule_node *node, __isl_take isl_schedule_node *graft); __isl_give isl_schedule_node *isl_schedule_node_reset_user( __isl_take isl_schedule_node *node); __isl_give isl_schedule_node *isl_schedule_node_align_params( __isl_take isl_schedule_node *node, __isl_take isl_space *space); __isl_give isl_printer *isl_printer_print_schedule_node( __isl_take isl_printer *p, __isl_keep isl_schedule_node *node); void isl_schedule_node_dump(__isl_keep isl_schedule_node *node); #if defined(__cplusplus) } #endif #endif cloog-0.18.4/isl/include/isl/vec.h0000644000175000017500000000506312554427055013574 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 #if defined(__cplusplus) extern "C" { #endif struct isl_vec; 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); __isl_null isl_vec *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); __isl_give isl_val *isl_vec_get_element_val(__isl_keep isl_vec *vec, int pos); __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_bool 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); 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_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_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); __isl_give isl_vec *isl_vec_move_els(__isl_take isl_vec *vec, unsigned dst_col, unsigned src_col, unsigned n); #if defined(__cplusplus) } #endif #endif cloog-0.18.4/isl/include/isl/union_map_type.h0000644000175000017500000000067512554427055016051 00000000000000#ifndef ISL_UNION_MAP_TYPE_H #define ISL_UNION_MAP_TYPE_H #include #include #if defined(__cplusplus) extern "C" { #endif struct __isl_export isl_union_map; typedef struct isl_union_map isl_union_map; ISL_DECLARE_LIST_TYPE(union_map) #ifndef isl_union_set struct __isl_export isl_union_set; typedef struct isl_union_set isl_union_set; ISL_DECLARE_LIST_TYPE(union_set) #endif #if defined(__cplusplus) } #endif #endif cloog-0.18.4/isl/include/isl/hash.h0000644000175000017500000000415412554427055013742 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 #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_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); isl_stat isl_hash_table_foreach(isl_ctx *ctx, struct isl_hash_table *table, isl_stat (*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.4/isl/include/isl/union_map.h0000644000175000017500000002644512554427055015013 00000000000000#ifndef ISL_UNION_MAP_H #define ISL_UNION_MAP_H #include #include #include #include #include #include #if defined(__cplusplus) extern "C" { #endif unsigned isl_union_map_dim(__isl_keep isl_union_map *umap, enum isl_dim_type type); isl_bool isl_union_map_involves_dims(__isl_keep isl_union_map *umap, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_id *isl_union_map_get_dim_id(__isl_keep isl_union_map *umap, enum isl_dim_type type, unsigned pos); __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); __isl_null isl_union_map *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_reset_user( __isl_take isl_union_map *umap); int isl_union_map_find_dim_by_name(__isl_keep isl_union_map *umap, enum isl_dim_type type, const char *name); __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_pw_multi_aff *isl_union_map_domain_map_union_pw_multi_aff( __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_set_wrapped_domain_map( __isl_take isl_union_set *uset); __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_remove_redundancies( __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_flat_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_give isl_union_map *isl_union_map_domain_factor_domain( __isl_take isl_union_map *umap); __isl_give isl_union_map *isl_union_map_domain_factor_range( __isl_take isl_union_map *umap); __isl_give isl_union_map *isl_union_map_range_factor_range( __isl_take isl_union_map *umap); __isl_give isl_union_map *isl_union_map_factor_domain( __isl_take isl_union_map *umap); __isl_give isl_union_map *isl_union_map_factor_range( __isl_take isl_union_map *umap); __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_give isl_union_map *isl_union_map_preimage_range_multi_aff( __isl_take isl_union_map *umap, __isl_take isl_multi_aff *ma); __isl_give isl_union_map *isl_union_map_preimage_domain_pw_multi_aff( __isl_take isl_union_map *umap, __isl_take isl_pw_multi_aff *pma); __isl_give isl_union_map *isl_union_map_preimage_range_pw_multi_aff( __isl_take isl_union_map *umap, __isl_take isl_pw_multi_aff *pma); __isl_give isl_union_map *isl_union_map_preimage_domain_multi_pw_aff( __isl_take isl_union_map *umap, __isl_take isl_multi_pw_aff *mpa); __isl_give isl_union_map *isl_union_map_preimage_domain_union_pw_multi_aff( __isl_take isl_union_map *umap, __isl_take isl_union_pw_multi_aff *upma); __isl_give isl_union_map *isl_union_map_preimage_range_union_pw_multi_aff( __isl_take isl_union_map *umap, __isl_take isl_union_pw_multi_aff *upma); __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_give isl_union_map *isl_union_map_project_out( __isl_take isl_union_map *umap, enum isl_dim_type type, unsigned first, unsigned n); __isl_export isl_bool isl_union_map_is_empty(__isl_keep isl_union_map *umap); __isl_export isl_bool isl_union_map_is_single_valued(__isl_keep isl_union_map *umap); isl_bool isl_union_map_plain_is_injective(__isl_keep isl_union_map *umap); __isl_export isl_bool isl_union_map_is_injective(__isl_keep isl_union_map *umap); __isl_export isl_bool isl_union_map_is_bijective(__isl_keep isl_union_map *umap); __isl_export isl_bool isl_union_map_is_subset(__isl_keep isl_union_map *umap1, __isl_keep isl_union_map *umap2); __isl_export isl_bool isl_union_map_is_equal(__isl_keep isl_union_map *umap1, __isl_keep isl_union_map *umap2); isl_bool isl_union_map_is_disjoint(__isl_keep isl_union_map *umap1, __isl_keep isl_union_map *umap2); __isl_export isl_bool 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 isl_stat isl_union_map_foreach_map(__isl_keep isl_union_map *umap, isl_stat (*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_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_eq_at_multi_union_pw_aff( __isl_take isl_union_map *umap, __isl_take isl_multi_union_pw_aff *mupa); __isl_give isl_union_map *isl_union_map_lex_lt_at_multi_union_pw_aff( __isl_take isl_union_map *umap, __isl_take isl_multi_union_pw_aff *mupa); __isl_give isl_union_map *isl_union_map_lex_gt_at_multi_union_pw_aff( __isl_take isl_union_map *umap, __isl_take isl_multi_union_pw_aff *mupa); __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 char *isl_union_map_to_str(__isl_keep isl_union_map *umap); __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); ISL_DECLARE_LIST_FN(union_map) #if defined(__cplusplus) } #endif #endif cloog-0.18.4/isl/include/isl/id_to_ast_expr.h0000644000175000017500000000034612413270107016005 00000000000000#ifndef ISL_ID_TO_AST_EXPR_H #define ISL_ID_TO_AST_EXPR_H #include #include #define ISL_KEY_BASE id #define ISL_VAL_BASE ast_expr #include #undef ISL_KEY_BASE #undef ISL_VAL_BASE #endif cloog-0.18.4/isl/isl_factorization.c0000644000175000017500000001772712413256472014332 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.4/isl/isl_ilp_private.h0000644000175000017500000000041012413270107013745 00000000000000#ifndef ISL_ILP_PRIVATE_H #define ISL_ILP_PRIVATE_H #include #include #include enum isl_lp_result isl_basic_set_solve_ilp(__isl_keep isl_basic_set *bset, int max, isl_int *f, isl_int *opt, __isl_give isl_vec **sol_p); #endif cloog-0.18.4/isl/isl_id_to_ast_expr.c0000644000175000017500000000037012413270107014432 00000000000000#include #include #define isl_id_is_equal(id1,id2) id1 == id2 #define KEY_BASE id #define KEY_EQUAL isl_id_is_equal #define VAL_BASE ast_expr #define VAL_EQUAL isl_ast_expr_is_equal #include cloog-0.18.4/isl/isl_val_imath.c0000644000175000017500000000332112413271702013374 00000000000000#include /* 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; impz_import(v->n, n, -1, size, 0, 0, chunks); isl_int_set_si(v->d, 1); return v; } /* 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 impz_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); impz_export(chunks, NULL, -1, size, 0, 0, v->n); if (isl_val_is_zero(v)) memset(chunks, 0, size); return 0; } /* 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 (impz_sizeinbase(v->n, 2) + size - 1) / size; } cloog-0.18.4/isl/isl_polynomial_private.h0000644000175000017500000002136412554427055015373 00000000000000#include #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]; }; void isl_term_get_num(__isl_keep isl_term *term, isl_int *n); __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_rat_cst_on_domain( __isl_take isl_space *space, const isl_int n, const isl_int d); __isl_give isl_qpolynomial *isl_qpolynomial_var_pow_on_domain(__isl_take isl_space *dim, int pos, int power); isl_bool isl_qpolynomial_is_one(__isl_keep isl_qpolynomial *qp); int isl_qpolynomial_is_affine(__isl_keep isl_qpolynomial *qp); int isl_qpolynomial_is_cst(__isl_keep isl_qpolynomial *qp, isl_int *n, isl_int *d); __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_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_val *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_val *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_pw_qpolynomial *isl_pw_qpolynomial_reset_space( __isl_take isl_pw_qpolynomial *pwqp, __isl_take isl_space *space); __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); void isl_qpolynomial_get_den(__isl_keep isl_qpolynomial *qp, isl_int *d); __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_pw_qpolynomial *isl_pw_qpolynomial_mul_isl_int( __isl_take isl_pw_qpolynomial *pwqp, isl_int v); __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_mul_isl_int( __isl_take isl_qpolynomial_fold *fold, isl_int v); __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_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_fold * isl_union_pw_qpolynomial_fold_mul_isl_int( __isl_take isl_union_pw_qpolynomial_fold *upwf, isl_int v); cloog-0.18.4/isl/imath/0000755000175000017500000000000012555417256011615 500000000000000cloog-0.18.4/isl/imath/imath.h0000644000175000017500000002174612555415003013006 00000000000000/* Name: imath.h Purpose: Arbitrary precision integer arithmetic routines. Author: M. J. Fromberger Copyright (C) 2002-2007 Michael J. Fromberger, All Rights Reserved. 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. */ #ifndef IMATH_H_ #define IMATH_H_ #include #include #ifdef __cplusplus extern "C" { #endif typedef unsigned char mp_sign; typedef unsigned int mp_size; typedef int mp_result; typedef long mp_small; /* must be a signed type */ typedef unsigned long mp_usmall; /* must be an unsigned type */ /* Force building with uint64_t so that the library builds consistently * whether we build from the makefile or by embedding imath in another project. */ #undef USE_64BIT_WORDS #define USE_64BIT_WORDS #ifdef USE_64BIT_WORDS typedef uint32_t mp_digit; typedef uint64_t mp_word; #else typedef uint16_t mp_digit; typedef uint32_t mp_word; #endif typedef struct mpz { mp_digit single; mp_digit *digits; mp_size alloc; mp_size used; mp_sign sign; } mpz_t, *mp_int; #define MP_DIGITS(Z) ((Z)->digits) #define MP_ALLOC(Z) ((Z)->alloc) #define MP_USED(Z) ((Z)->used) #define MP_SIGN(Z) ((Z)->sign) extern const mp_result MP_OK; extern const mp_result MP_FALSE; extern const mp_result MP_TRUE; extern const mp_result MP_MEMORY; extern const mp_result MP_RANGE; extern const mp_result MP_UNDEF; extern const mp_result MP_TRUNC; extern const mp_result MP_BADARG; extern const mp_result MP_MINERR; #define MP_DIGIT_BIT (sizeof(mp_digit) * CHAR_BIT) #define MP_WORD_BIT (sizeof(mp_word) * CHAR_BIT) #define MP_SMALL_MIN LONG_MIN #define MP_SMALL_MAX LONG_MAX #define MP_USMALL_MIN ULONG_MIN #define MP_USMALL_MAX ULONG_MAX #ifdef USE_64BIT_WORDS # define MP_DIGIT_MAX (UINT32_MAX * UINT64_C(1)) # define MP_WORD_MAX (UINT64_MAX) #else # define MP_DIGIT_MAX (UINT16_MAX * 1UL) # define MP_WORD_MAX (UINT32_MAX * 1UL) #endif #define MP_MIN_RADIX 2 #define MP_MAX_RADIX 36 /* Values with fewer than this many significant digits use the standard multiplication algorithm; otherwise, a recursive algorithm is used. Choose a value to suit your platform. */ #define MP_MULT_THRESH 22 #define MP_DEFAULT_PREC 8 /* default memory allocation, in digits */ extern const mp_sign MP_NEG; extern const mp_sign MP_ZPOS; #define mp_int_is_odd(Z) ((Z)->digits[0] & 1) #define mp_int_is_even(Z) !((Z)->digits[0] & 1) mp_result mp_int_init(mp_int z); mp_int mp_int_alloc(void); mp_result mp_int_init_size(mp_int z, mp_size prec); mp_result mp_int_init_copy(mp_int z, mp_int old); mp_result mp_int_init_value(mp_int z, mp_small value); mp_result mp_int_init_uvalue(mp_int z, mp_usmall uvalue); mp_result mp_int_set_value(mp_int z, mp_small value); mp_result mp_int_set_uvalue(mp_int z, mp_usmall uvalue); void mp_int_clear(mp_int z); void mp_int_free(mp_int z); mp_result mp_int_copy(mp_int a, mp_int c); /* c = a */ void mp_int_swap(mp_int a, mp_int c); /* swap a, c */ void mp_int_zero(mp_int z); /* z = 0 */ mp_result mp_int_abs(mp_int a, mp_int c); /* c = |a| */ mp_result mp_int_neg(mp_int a, mp_int c); /* c = -a */ mp_result mp_int_add(mp_int a, mp_int b, mp_int c); /* c = a + b */ mp_result mp_int_add_value(mp_int a, mp_small value, mp_int c); mp_result mp_int_sub(mp_int a, mp_int b, mp_int c); /* c = a - b */ mp_result mp_int_sub_value(mp_int a, mp_small value, mp_int c); mp_result mp_int_mul(mp_int a, mp_int b, mp_int c); /* c = a * b */ mp_result mp_int_mul_value(mp_int a, mp_small value, mp_int c); mp_result mp_int_mul_pow2(mp_int a, mp_small p2, mp_int c); mp_result mp_int_sqr(mp_int a, mp_int c); /* c = a * a */ mp_result mp_int_div(mp_int a, mp_int b, /* q = a / b */ mp_int q, mp_int r); /* r = a % b */ mp_result mp_int_div_value(mp_int a, mp_small value, /* q = a / value */ mp_int q, mp_small *r); /* r = a % value */ mp_result mp_int_div_pow2(mp_int a, mp_small p2, /* q = a / 2^p2 */ mp_int q, mp_int r); /* r = q % 2^p2 */ mp_result mp_int_mod(mp_int a, mp_int m, mp_int c); /* c = a % m */ #define mp_int_mod_value(A, V, R) mp_int_div_value((A), (V), 0, (R)) mp_result mp_int_expt(mp_int a, mp_small b, mp_int c); /* c = a^b */ mp_result mp_int_expt_value(mp_small a, mp_small b, mp_int c); /* c = a^b */ mp_result mp_int_expt_full(mp_int a, mp_int b, mp_int c); /* c = a^b */ int mp_int_compare(mp_int a, mp_int b); /* a <=> b */ int mp_int_compare_unsigned(mp_int a, mp_int b); /* |a| <=> |b| */ int mp_int_compare_zero(mp_int z); /* a <=> 0 */ int mp_int_compare_value(mp_int z, mp_small v); /* a <=> v */ int mp_int_compare_uvalue(mp_int z, mp_usmall uv); /* a <=> uv */ /* Returns true if v|a, false otherwise (including errors) */ int mp_int_divisible_value(mp_int a, mp_small v); /* Returns k >= 0 such that z = 2^k, if one exists; otherwise < 0 */ int mp_int_is_pow2(mp_int z); mp_result mp_int_exptmod(mp_int a, mp_int b, mp_int m, mp_int c); /* c = a^b (mod m) */ mp_result mp_int_exptmod_evalue(mp_int a, mp_small value, mp_int m, mp_int c); /* c = a^v (mod m) */ mp_result mp_int_exptmod_bvalue(mp_small value, mp_int b, mp_int m, mp_int c); /* c = v^b (mod m) */ mp_result mp_int_exptmod_known(mp_int a, mp_int b, mp_int m, mp_int mu, mp_int c); /* c = a^b (mod m) */ mp_result mp_int_redux_const(mp_int m, mp_int c); mp_result mp_int_invmod(mp_int a, mp_int m, mp_int c); /* c = 1/a (mod m) */ mp_result mp_int_gcd(mp_int a, mp_int b, mp_int c); /* c = gcd(a, b) */ mp_result mp_int_egcd(mp_int a, mp_int b, mp_int c, /* c = gcd(a, b) */ mp_int x, mp_int y); /* c = ax + by */ mp_result mp_int_lcm(mp_int a, mp_int b, mp_int c); /* c = lcm(a, b) */ mp_result mp_int_root(mp_int a, mp_small b, mp_int c); /* c = floor(a^{1/b}) */ #define mp_int_sqrt(a, c) mp_int_root(a, 2, c) /* c = floor(sqrt(a)) */ /* Convert to a small int, if representable; else MP_RANGE */ mp_result mp_int_to_int(mp_int z, mp_small *out); mp_result mp_int_to_uint(mp_int z, mp_usmall *out); /* Convert to nul-terminated string with the specified radix, writing at most limit characters including the nul terminator */ mp_result mp_int_to_string(mp_int z, mp_size radix, char *str, int limit); /* Return the number of characters required to represent z in the given radix. May over-estimate. */ mp_result mp_int_string_len(mp_int z, mp_size radix); /* Read zero-terminated string into z */ mp_result mp_int_read_string(mp_int z, mp_size radix, const char *str); mp_result mp_int_read_cstring(mp_int z, mp_size radix, const char *str, char **end); /* Return the number of significant bits in z */ mp_result mp_int_count_bits(mp_int z); /* Convert z to two's complement binary, writing at most limit bytes */ mp_result mp_int_to_binary(mp_int z, unsigned char *buf, int limit); /* Read a two's complement binary value into z from the given buffer */ mp_result mp_int_read_binary(mp_int z, unsigned char *buf, int len); /* Return the number of bytes required to represent z in binary. */ mp_result mp_int_binary_len(mp_int z); /* Convert z to unsigned binary, writing at most limit bytes */ mp_result mp_int_to_unsigned(mp_int z, unsigned char *buf, int limit); /* Read an unsigned binary value into z from the given buffer */ mp_result mp_int_read_unsigned(mp_int z, unsigned char *buf, int len); /* Return the number of bytes required to represent z as unsigned output */ mp_result mp_int_unsigned_len(mp_int z); /* Return a statically allocated string describing error code res */ const char *mp_error_string(mp_result res); #if DEBUG void s_print(char *tag, mp_int z); void s_print_buf(char *tag, mp_digit *buf, mp_size num); #endif #ifdef __cplusplus } #endif #endif /* end IMATH_H_ */ cloog-0.18.4/isl/imath/gmp_compat.h0000644000175000017500000001557312555415003014033 00000000000000/* Name: gmp_compat.h Purpose: Provide GMP compatiable routines for imath library Author: David Peixotto Copyright (c) 2012 Qualcomm Innovation Center, Inc. All rights reserved. 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. */ #ifndef IMATH_GMP_COMPAT_H_ #define IMATH_GMP_COMPAT_H_ #include "imath.h" #include "imrat.h" #include #define GMPZAPI(fun) impz_ ## fun #define GMPQAPI(fun) impq_ ## fun #ifdef __cplusplus extern "C" { #endif /************************************************************************* * * Functions with direct translations * *************************************************************************/ /* gmp: mpq_clear */ void GMPQAPI(clear)(mp_rat x); /* gmp: mpq_cmp */ int GMPQAPI(cmp)(mp_rat op1, mp_rat op2); /* gmp: mpq_init */ void GMPQAPI(init)(mp_rat x); /* gmp: mpq_mul */ void GMPQAPI(mul)(mp_rat product, mp_rat multiplier, mp_rat multiplicand); /* gmp: mpq_set */ void GMPQAPI(set)(mp_rat rop, mp_rat op); /* gmp: mpz_abs */ void GMPZAPI(abs)(mp_int rop, mp_int op); /* gmp: mpz_add */ void GMPZAPI(add)(mp_int rop, mp_int op1, mp_int op2); /* gmp: mpz_clear */ void GMPZAPI(clear)(mp_int x); /* gmp: mpz_cmp_si */ int GMPZAPI(cmp_si)(mp_int op1, long op2); /* gmp: mpz_cmpabs */ int GMPZAPI(cmpabs)(mp_int op1, mp_int op2); /* gmp: mpz_cmp */ int GMPZAPI(cmp)(mp_int op1, mp_int op2); /* gmp: mpz_init */ void GMPZAPI(init)(mp_int x); /* gmp: mpz_mul */ void GMPZAPI(mul)(mp_int rop, mp_int op1, mp_int op2); /* gmp: mpz_neg */ void GMPZAPI(neg)(mp_int rop, mp_int op); /* gmp: mpz_set_si */ void GMPZAPI(set_si)(mp_int rop, long op); /* gmp: mpz_set */ void GMPZAPI(set)(mp_int rop, mp_int op); /* gmp: mpz_sub */ void GMPZAPI(sub)(mp_int rop, mp_int op1, mp_int op2); /* gmp: mpz_swap */ void GMPZAPI(swap)(mp_int rop1, mp_int rop2); /* gmp: mpq_sgn */ int GMPQAPI(sgn)(mp_rat op); /* gmp: mpz_sgn */ int GMPZAPI(sgn)(mp_int op); /* gmp: mpq_set_ui */ void GMPQAPI(set_ui)(mp_rat rop, unsigned long op1, unsigned long op2); /* gmp: mpz_set_ui */ void GMPZAPI(set_ui)(mp_int rop, unsigned long op); /* gmp: mpq_den_ref */ mp_int GMPQAPI(denref)(mp_rat op); /* gmp: mpq_num_ref */ mp_int GMPQAPI(numref)(mp_rat op); /* gmp: mpq_canonicalize */ void GMPQAPI(canonicalize)(mp_rat op); /************************************************************************* * * Functions that can be implemented as a combination of imath functions * *************************************************************************/ /* gmp: mpz_addmul */ void GMPZAPI(addmul)(mp_int rop, mp_int op1, mp_int op2); /* gmp: mpz_divexact */ void GMPZAPI(divexact)(mp_int q, mp_int n, mp_int d); /* gmp: mpz_divisible_p */ int GMPZAPI(divisible_p)(mp_int n, mp_int d); /* gmp: mpz_submul */ void GMPZAPI(submul)(mp_int rop, mp_int op1, mp_int op2); /* gmp: mpz_add_ui */ void GMPZAPI(add_ui)(mp_int rop, mp_int op1, unsigned long op2); /* gmp: mpz_divexact_ui */ void GMPZAPI(divexact_ui)(mp_int q, mp_int n, unsigned long d); /* gmp: mpz_mul_ui */ void GMPZAPI(mul_ui)(mp_int rop, mp_int op1, unsigned long op2); /* gmp: mpz_pow_ui */ void GMPZAPI(pow_ui)(mp_int rop, mp_int base, unsigned long exp); /* gmp: mpz_sub_ui */ void GMPZAPI(sub_ui)(mp_int rop, mp_int op1, unsigned long op2); /* gmp: mpz_fdiv_q_ui */ unsigned long GMPZAPI(fdiv_q_ui)(mp_int q, mp_int n, unsigned long d); /* gmp: mpz_sizeinbase */ size_t GMPZAPI(sizeinbase)(mp_int op, int base); /************************************************************************* * * Functions with different behavior in corner cases * *************************************************************************/ /* gmp: mpz_gcd */ /* gmp: When op1 = 0 and op2 = 0, return 0.*/ void GMPZAPI(gcd)(mp_int rop, mp_int op1, mp_int op2); /* gmp: mpz_get_str */ /* gmp: If str is NULL then allocate space using the default allocator. */ char* GMPZAPI(get_str)(char *str, int radix, mp_int op); /* gmp: mpq_get_str */ /* gmp: If str is NULL then allocate space using the default allocator. */ /* gmp: If value is a whole number do not print denomenator. */ /* TODO: Need to handle 0 values better. GMP prints 0/4 instead of 0.*/ char* GMPQAPI(get_str)(char *str, int radix, mp_rat op); /* gmp: mpz_set_str */ /* gmp: Allow and ignore spaces in string. */ int GMPZAPI(set_str)(mp_int rop, char *str, int base); /* gmp: mpq_set_str */ int GMPQAPI(set_str)(mp_rat rop, char *str, int base); /* gmp: mpz_get_ui */ /* gmp: Return least significant bits if value is too big for a long. */ unsigned long GMPZAPI(get_ui)(mp_int op); /* gmp: mpz_get_si */ /* gmp: Return least significant bits if value is too bit for a long. */ /* gmp: If value is too big for long, return the least significant (8*sizeof(long)-1) bits from the op and set the sign bit according to the sign of the op. */ long GMPZAPI(get_si)(mp_int op); /* gmp: mpz_lcm */ /* gmp: When op1 = 0 or op2 = 0, return 0.*/ /* gmp: The resutl of lcm(a,b) is always positive. */ void GMPZAPI(lcm)(mp_int rop, mp_int op1, mp_int op2); /* gmp: mpz_mul_2exp */ /* gmp: allow big values for op2 when op1 == 0 */ void GMPZAPI(mul_2exp)(mp_int rop, mp_int op1, unsigned long op2); /************************************************************************* * * Functions needing expanded functionality * *************************************************************************/ /* gmp: mpz_cdiv_q */ void GMPZAPI(cdiv_q)(mp_int q, mp_int n, mp_int d); /* gmp: mpz_fdiv_q */ void GMPZAPI(fdiv_q)(mp_int q, mp_int n, mp_int d); /* gmp: mpz_fdiv_r */ void GMPZAPI(fdiv_r)(mp_int r, mp_int n, mp_int d); /* gmp: mpz_tdiv_q */ void GMPZAPI(tdiv_q)(mp_int q, mp_int n, mp_int d); /* gmp: mpz_export */ void* GMPZAPI(export)(void *rop, size_t *countp, int order, size_t size, int endian, size_t nails, mp_int op); /* gmp: mpz_import */ void GMPZAPI(import)(mp_int rop, size_t count, int order, size_t size, int endian, size_t nails, const void* op); #ifdef __cplusplus } #endif #endif /* end IMATH_GMP_COMPAT_H_ */ cloog-0.18.4/isl/imath/imath.c0000644000175000017500000022424212555415003012775 00000000000000/* Name: imath.c Purpose: Arbitrary precision integer arithmetic routines. Author: M. J. Fromberger Copyright (C) 2002-2007 Michael J. Fromberger, All Rights Reserved. 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 "imath.h" #if DEBUG #include #endif #include #include #include #include #if DEBUG #define STATIC /* public */ #else #define STATIC static #endif const mp_result MP_OK = 0; /* no error, all is well */ const mp_result MP_FALSE = 0; /* boolean false */ const mp_result MP_TRUE = -1; /* boolean true */ const mp_result MP_MEMORY = -2; /* out of memory */ const mp_result MP_RANGE = -3; /* argument out of range */ const mp_result MP_UNDEF = -4; /* result undefined */ const mp_result MP_TRUNC = -5; /* output truncated */ const mp_result MP_BADARG = -6; /* invalid null argument */ const mp_result MP_MINERR = -6; const mp_sign MP_NEG = 1; /* value is strictly negative */ const mp_sign MP_ZPOS = 0; /* value is non-negative */ STATIC const char *s_unknown_err = "unknown result code"; STATIC const char *s_error_msg[] = { "error code 0", "boolean true", "out of memory", "argument out of range", "result undefined", "output truncated", "invalid argument", NULL }; /* Argument checking macros Use CHECK() where a return value is required; NRCHECK() elsewhere */ #define CHECK(TEST) assert(TEST) #define NRCHECK(TEST) assert(TEST) /* The ith entry of this table gives the value of log_i(2). An integer value n requires ceil(log_i(n)) digits to be represented in base i. Since it is easy to compute lg(n), by counting bits, we can compute log_i(n) = lg(n) * log_i(2). The use of this table eliminates a dependency upon linkage against the standard math libraries. If MP_MAX_RADIX is increased, this table should be expanded too. */ STATIC const double s_log2[] = { 0.000000000, 0.000000000, 1.000000000, 0.630929754, /* (D)(D) 2 3 */ 0.500000000, 0.430676558, 0.386852807, 0.356207187, /* 4 5 6 7 */ 0.333333333, 0.315464877, 0.301029996, 0.289064826, /* 8 9 10 11 */ 0.278942946, 0.270238154, 0.262649535, 0.255958025, /* 12 13 14 15 */ 0.250000000, 0.244650542, 0.239812467, 0.235408913, /* 16 17 18 19 */ 0.231378213, 0.227670249, 0.224243824, 0.221064729, /* 20 21 22 23 */ 0.218104292, 0.215338279, 0.212746054, 0.210309918, /* 24 25 26 27 */ 0.208014598, 0.205846832, 0.203795047, 0.201849087, /* 28 29 30 31 */ 0.200000000, 0.198239863, 0.196561632, 0.194959022, /* 32 33 34 35 */ 0.193426404, /* 36 */ }; /* Return the number of digits needed to represent a static value */ #define MP_VALUE_DIGITS(V) \ ((sizeof(V)+(sizeof(mp_digit)-1))/sizeof(mp_digit)) /* Round precision P to nearest word boundary */ #define ROUND_PREC(P) ((mp_size)(2*(((P)+1)/2))) /* Set array P of S digits to zero */ #define ZERO(P, S) \ do{ \ mp_size i__ = (S) * sizeof(mp_digit); \ mp_digit *p__ = (P); \ memset(p__, 0, i__); \ } while(0) /* Copy S digits from array P to array Q */ #define COPY(P, Q, S) \ do{ \ mp_size i__ = (S) * sizeof(mp_digit); \ mp_digit *p__ = (P), *q__ = (Q); \ memcpy(q__, p__, i__); \ } while(0) /* Reverse N elements of type T in array A */ #define REV(T, A, N) \ do{ \ T *u_ = (A), *v_ = u_ + (N) - 1; \ while (u_ < v_) { \ T xch = *u_; \ *u_++ = *v_; \ *v_-- = xch; \ } \ } while(0) #define CLAMP(Z) \ do{ \ mp_int z_ = (Z); \ mp_size uz_ = MP_USED(z_); \ mp_digit *dz_ = MP_DIGITS(z_) + uz_ -1; \ while (uz_ > 1 && (*dz_-- == 0)) \ --uz_; \ MP_USED(z_) = uz_; \ } while(0) /* Select min/max. Do not provide expressions for which multiple evaluation would be problematic, e.g. x++ */ #define MIN(A, B) ((B)<(A)?(B):(A)) #define MAX(A, B) ((B)>(A)?(B):(A)) /* Exchange lvalues A and B of type T, e.g. SWAP(int, x, y) where x and y are variables of type int. */ #define SWAP(T, A, B) \ do{ \ T t_ = (A); \ A = (B); \ B = t_; \ } while(0) /* Used to set up and access simple temp stacks within functions. */ #define DECLARE_TEMP(N) \ mpz_t temp[(N)]; \ int last__ = 0 #define CLEANUP_TEMP() \ CLEANUP: \ while (--last__ >= 0) \ mp_int_clear(TEMP(last__)) #define TEMP(K) (temp + (K)) #define LAST_TEMP() TEMP(last__) #define SETUP(E) \ do{ \ if ((res = (E)) != MP_OK) \ goto CLEANUP; \ ++(last__); \ } while(0) /* Compare value to zero. */ #define CMPZ(Z) \ (((Z)->used==1&&(Z)->digits[0]==0)?0:((Z)->sign==MP_NEG)?-1:1) /* Multiply X by Y into Z, ignoring signs. Requires that Z have enough storage preallocated to hold the result. */ #define UMUL(X, Y, Z) \ do{ \ mp_size ua_ = MP_USED(X), ub_ = MP_USED(Y); \ mp_size o_ = ua_ + ub_; \ ZERO(MP_DIGITS(Z), o_); \ (void) s_kmul(MP_DIGITS(X), MP_DIGITS(Y), MP_DIGITS(Z), ua_, ub_); \ MP_USED(Z) = o_; \ CLAMP(Z); \ } while(0) /* Square X into Z. Requires that Z have enough storage to hold the result. */ #define USQR(X, Z) \ do{ \ mp_size ua_ = MP_USED(X), o_ = ua_ + ua_; \ ZERO(MP_DIGITS(Z), o_); \ (void) s_ksqr(MP_DIGITS(X), MP_DIGITS(Z), ua_); \ MP_USED(Z) = o_; \ CLAMP(Z); \ } while(0) #define UPPER_HALF(W) ((mp_word)((W) >> MP_DIGIT_BIT)) #define LOWER_HALF(W) ((mp_digit)(W)) #define HIGH_BIT_SET(W) ((W) >> (MP_WORD_BIT - 1)) #define ADD_WILL_OVERFLOW(W, V) ((MP_WORD_MAX - (V)) < (W)) /* Default number of digits allocated to a new mp_int */ #if IMATH_TEST mp_size default_precision = MP_DEFAULT_PREC; #else STATIC const mp_size default_precision = MP_DEFAULT_PREC; #endif /* Minimum number of digits to invoke recursive multiply */ #if IMATH_TEST mp_size multiply_threshold = MP_MULT_THRESH; #else STATIC const mp_size multiply_threshold = MP_MULT_THRESH; #endif /* Allocate a buffer of (at least) num digits, or return NULL if that couldn't be done. */ STATIC mp_digit *s_alloc(mp_size num); /* Release a buffer of digits allocated by s_alloc(). */ STATIC void s_free(void *ptr); /* Insure that z has at least min digits allocated, resizing if necessary. Returns true if successful, false if out of memory. */ STATIC int s_pad(mp_int z, mp_size min); /* Fill in a "fake" mp_int on the stack with a given value */ STATIC void s_fake(mp_int z, mp_small value, mp_digit vbuf[]); STATIC void s_ufake(mp_int z, mp_usmall value, mp_digit vbuf[]); /* Compare two runs of digits of given length, returns <0, 0, >0 */ STATIC int s_cdig(mp_digit *da, mp_digit *db, mp_size len); /* Pack the unsigned digits of v into array t */ STATIC int s_uvpack(mp_usmall v, mp_digit t[]); /* Compare magnitudes of a and b, returns <0, 0, >0 */ STATIC int s_ucmp(mp_int a, mp_int b); /* Compare magnitudes of a and v, returns <0, 0, >0 */ STATIC int s_vcmp(mp_int a, mp_small v); STATIC int s_uvcmp(mp_int a, mp_usmall uv); /* Unsigned magnitude addition; assumes dc is big enough. Carry out is returned (no memory allocated). */ STATIC mp_digit s_uadd(mp_digit *da, mp_digit *db, mp_digit *dc, mp_size size_a, mp_size size_b); /* Unsigned magnitude subtraction. Assumes dc is big enough. */ STATIC void s_usub(mp_digit *da, mp_digit *db, mp_digit *dc, mp_size size_a, mp_size size_b); /* Unsigned recursive multiplication. Assumes dc is big enough. */ STATIC int s_kmul(mp_digit *da, mp_digit *db, mp_digit *dc, mp_size size_a, mp_size size_b); /* Unsigned magnitude multiplication. Assumes dc is big enough. */ STATIC void s_umul(mp_digit *da, mp_digit *db, mp_digit *dc, mp_size size_a, mp_size size_b); /* Unsigned recursive squaring. Assumes dc is big enough. */ STATIC int s_ksqr(mp_digit *da, mp_digit *dc, mp_size size_a); /* Unsigned magnitude squaring. Assumes dc is big enough. */ STATIC void s_usqr(mp_digit *da, mp_digit *dc, mp_size size_a); /* Single digit addition. Assumes a is big enough. */ STATIC void s_dadd(mp_int a, mp_digit b); /* Single digit multiplication. Assumes a is big enough. */ STATIC void s_dmul(mp_int a, mp_digit b); /* Single digit multiplication on buffers; assumes dc is big enough. */ STATIC void s_dbmul(mp_digit *da, mp_digit b, mp_digit *dc, mp_size size_a); /* Single digit division. Replaces a with the quotient, returns the remainder. */ STATIC mp_digit s_ddiv(mp_int a, mp_digit b); /* Quick division by a power of 2, replaces z (no allocation) */ STATIC void s_qdiv(mp_int z, mp_size p2); /* Quick remainder by a power of 2, replaces z (no allocation) */ STATIC void s_qmod(mp_int z, mp_size p2); /* Quick multiplication by a power of 2, replaces z. Allocates if necessary; returns false in case this fails. */ STATIC int s_qmul(mp_int z, mp_size p2); /* Quick subtraction from a power of 2, replaces z. Allocates if necessary; returns false in case this fails. */ STATIC int s_qsub(mp_int z, mp_size p2); /* Return maximum k such that 2^k divides z. */ STATIC int s_dp2k(mp_int z); /* Return k >= 0 such that z = 2^k, or -1 if there is no such k. */ STATIC int s_isp2(mp_int z); /* Set z to 2^k. May allocate; returns false in case this fails. */ STATIC int s_2expt(mp_int z, mp_small k); /* Normalize a and b for division, returns normalization constant */ STATIC int s_norm(mp_int a, mp_int b); /* Compute constant mu for Barrett reduction, given modulus m, result replaces z, m is untouched. */ STATIC mp_result s_brmu(mp_int z, mp_int m); /* Reduce a modulo m, using Barrett's algorithm. */ STATIC int s_reduce(mp_int x, mp_int m, mp_int mu, mp_int q1, mp_int q2); /* Modular exponentiation, using Barrett reduction */ STATIC mp_result s_embar(mp_int a, mp_int b, mp_int m, mp_int mu, mp_int c); /* Unsigned magnitude division. Assumes |a| > |b|. Allocates temporaries; overwrites a with quotient, b with remainder. */ STATIC mp_result s_udiv_knuth(mp_int a, mp_int b); /* Compute the number of digits in radix r required to represent the given value. Does not account for sign flags, terminators, etc. */ STATIC int s_outlen(mp_int z, mp_size r); /* Guess how many digits of precision will be needed to represent a radix r value of the specified number of digits. Returns a value guaranteed to be no smaller than the actual number required. */ STATIC mp_size s_inlen(int len, mp_size r); /* Convert a character to a digit value in radix r, or -1 if out of range */ STATIC int s_ch2val(char c, int r); /* Convert a digit value to a character */ STATIC char s_val2ch(int v, int caps); /* Take 2's complement of a buffer in place */ STATIC void s_2comp(unsigned char *buf, int len); /* Convert a value to binary, ignoring sign. On input, *limpos is the bound on how many bytes should be written to buf; on output, *limpos is set to the number of bytes actually written. */ STATIC mp_result s_tobin(mp_int z, unsigned char *buf, int *limpos, int pad); #if DEBUG /* Dump a representation of the mp_int to standard output */ void s_print(char *tag, mp_int z); void s_print_buf(char *tag, mp_digit *buf, mp_size num); #endif mp_result mp_int_init(mp_int z) { if (z == NULL) return MP_BADARG; z->single = 0; z->digits = &(z->single); z->alloc = 1; z->used = 1; z->sign = MP_ZPOS; return MP_OK; } mp_int mp_int_alloc(void) { mp_int out = malloc(sizeof(mpz_t)); if (out != NULL) mp_int_init(out); return out; } mp_result mp_int_init_size(mp_int z, mp_size prec) { CHECK(z != NULL); if (prec == 0) prec = default_precision; else if (prec == 1) return mp_int_init(z); else prec = (mp_size) ROUND_PREC(prec); if ((MP_DIGITS(z) = s_alloc(prec)) == NULL) return MP_MEMORY; z->digits[0] = 0; MP_USED(z) = 1; MP_ALLOC(z) = prec; MP_SIGN(z) = MP_ZPOS; return MP_OK; } mp_result mp_int_init_copy(mp_int z, mp_int old) { mp_result res; mp_size uold; CHECK(z != NULL && old != NULL); uold = MP_USED(old); if (uold == 1) { mp_int_init(z); } else { mp_size target = MAX(uold, default_precision); if ((res = mp_int_init_size(z, target)) != MP_OK) return res; } MP_USED(z) = uold; MP_SIGN(z) = MP_SIGN(old); COPY(MP_DIGITS(old), MP_DIGITS(z), uold); return MP_OK; } mp_result mp_int_init_value(mp_int z, mp_small value) { mpz_t vtmp; mp_digit vbuf[MP_VALUE_DIGITS(value)]; s_fake(&vtmp, value, vbuf); return mp_int_init_copy(z, &vtmp); } mp_result mp_int_init_uvalue(mp_int z, mp_usmall uvalue) { mpz_t vtmp; mp_digit vbuf[MP_VALUE_DIGITS(uvalue)]; s_ufake(&vtmp, uvalue, vbuf); return mp_int_init_copy(z, &vtmp); } mp_result mp_int_set_value(mp_int z, mp_small value) { mpz_t vtmp; mp_digit vbuf[MP_VALUE_DIGITS(value)]; s_fake(&vtmp, value, vbuf); return mp_int_copy(&vtmp, z); } mp_result mp_int_set_uvalue(mp_int z, mp_usmall uvalue) { mpz_t vtmp; mp_digit vbuf[MP_VALUE_DIGITS(uvalue)]; s_ufake(&vtmp, uvalue, vbuf); return mp_int_copy(&vtmp, z); } void mp_int_clear(mp_int z) { if (z == NULL) return; if (MP_DIGITS(z) != NULL) { if (MP_DIGITS(z) != &(z->single)) s_free(MP_DIGITS(z)); MP_DIGITS(z) = NULL; } } void mp_int_free(mp_int z) { NRCHECK(z != NULL); mp_int_clear(z); free(z); /* note: NOT s_free() */ } mp_result mp_int_copy(mp_int a, mp_int c) { CHECK(a != NULL && c != NULL); if (a != c) { mp_size ua = MP_USED(a); mp_digit *da, *dc; if (!s_pad(c, ua)) return MP_MEMORY; da = MP_DIGITS(a); dc = MP_DIGITS(c); COPY(da, dc, ua); MP_USED(c) = ua; MP_SIGN(c) = MP_SIGN(a); } return MP_OK; } void mp_int_swap(mp_int a, mp_int c) { if (a != c) { mpz_t tmp = *a; *a = *c; *c = tmp; if (MP_DIGITS(a) == &(c->single)) MP_DIGITS(a) = &(a->single); if (MP_DIGITS(c) == &(a->single)) MP_DIGITS(c) = &(c->single); } } void mp_int_zero(mp_int z) { NRCHECK(z != NULL); z->digits[0] = 0; MP_USED(z) = 1; MP_SIGN(z) = MP_ZPOS; } mp_result mp_int_abs(mp_int a, mp_int c) { mp_result res; CHECK(a != NULL && c != NULL); if ((res = mp_int_copy(a, c)) != MP_OK) return res; MP_SIGN(c) = MP_ZPOS; return MP_OK; } mp_result mp_int_neg(mp_int a, mp_int c) { mp_result res; CHECK(a != NULL && c != NULL); if ((res = mp_int_copy(a, c)) != MP_OK) return res; if (CMPZ(c) != 0) MP_SIGN(c) = 1 - MP_SIGN(a); return MP_OK; } mp_result mp_int_add(mp_int a, mp_int b, mp_int c) { mp_size ua, ub, uc, max; CHECK(a != NULL && b != NULL && c != NULL); ua = MP_USED(a); ub = MP_USED(b); uc = MP_USED(c); max = MAX(ua, ub); if (MP_SIGN(a) == MP_SIGN(b)) { /* Same sign -- add magnitudes, preserve sign of addends */ mp_digit carry; if (!s_pad(c, max)) return MP_MEMORY; carry = s_uadd(MP_DIGITS(a), MP_DIGITS(b), MP_DIGITS(c), ua, ub); uc = max; if (carry) { if (!s_pad(c, max + 1)) return MP_MEMORY; c->digits[max] = carry; ++uc; } MP_USED(c) = uc; MP_SIGN(c) = MP_SIGN(a); } else { /* Different signs -- subtract magnitudes, preserve sign of greater */ mp_int x, y; int cmp = s_ucmp(a, b); /* magnitude comparision, sign ignored */ /* Set x to max(a, b), y to min(a, b) to simplify later code. A special case yields zero for equal magnitudes. */ if (cmp == 0) { mp_int_zero(c); return MP_OK; } else if (cmp < 0) { x = b; y = a; } else { x = a; y = b; } if (!s_pad(c, MP_USED(x))) return MP_MEMORY; /* Subtract smaller from larger */ s_usub(MP_DIGITS(x), MP_DIGITS(y), MP_DIGITS(c), MP_USED(x), MP_USED(y)); MP_USED(c) = MP_USED(x); CLAMP(c); /* Give result the sign of the larger */ MP_SIGN(c) = MP_SIGN(x); } return MP_OK; } mp_result mp_int_add_value(mp_int a, mp_small value, mp_int c) { mpz_t vtmp; mp_digit vbuf[MP_VALUE_DIGITS(value)]; s_fake(&vtmp, value, vbuf); return mp_int_add(a, &vtmp, c); } mp_result mp_int_sub(mp_int a, mp_int b, mp_int c) { mp_size ua, ub, uc, max; CHECK(a != NULL && b != NULL && c != NULL); ua = MP_USED(a); ub = MP_USED(b); uc = MP_USED(c); max = MAX(ua, ub); if (MP_SIGN(a) != MP_SIGN(b)) { /* Different signs -- add magnitudes and keep sign of a */ mp_digit carry; if (!s_pad(c, max)) return MP_MEMORY; carry = s_uadd(MP_DIGITS(a), MP_DIGITS(b), MP_DIGITS(c), ua, ub); uc = max; if (carry) { if (!s_pad(c, max + 1)) return MP_MEMORY; c->digits[max] = carry; ++uc; } MP_USED(c) = uc; MP_SIGN(c) = MP_SIGN(a); } else { /* Same signs -- subtract magnitudes */ mp_int x, y; mp_sign osign; int cmp = s_ucmp(a, b); if (!s_pad(c, max)) return MP_MEMORY; if (cmp >= 0) { x = a; y = b; osign = MP_ZPOS; } else { x = b; y = a; osign = MP_NEG; } if (MP_SIGN(a) == MP_NEG && cmp != 0) osign = 1 - osign; s_usub(MP_DIGITS(x), MP_DIGITS(y), MP_DIGITS(c), MP_USED(x), MP_USED(y)); MP_USED(c) = MP_USED(x); CLAMP(c); MP_SIGN(c) = osign; } return MP_OK; } mp_result mp_int_sub_value(mp_int a, mp_small value, mp_int c) { mpz_t vtmp; mp_digit vbuf[MP_VALUE_DIGITS(value)]; s_fake(&vtmp, value, vbuf); return mp_int_sub(a, &vtmp, c); } mp_result mp_int_mul(mp_int a, mp_int b, mp_int c) { mp_digit *out; mp_size osize, ua, ub, p = 0; mp_sign osign; CHECK(a != NULL && b != NULL && c != NULL); /* If either input is zero, we can shortcut multiplication */ if (mp_int_compare_zero(a) == 0 || mp_int_compare_zero(b) == 0) { mp_int_zero(c); return MP_OK; } /* Output is positive if inputs have same sign, otherwise negative */ osign = (MP_SIGN(a) == MP_SIGN(b)) ? MP_ZPOS : MP_NEG; /* If the output is not identical to any of the inputs, we'll write the results directly; otherwise, allocate a temporary space. */ ua = MP_USED(a); ub = MP_USED(b); osize = MAX(ua, ub); osize = 4 * ((osize + 1) / 2); if (c == a || c == b) { p = ROUND_PREC(osize); p = MAX(p, default_precision); if ((out = s_alloc(p)) == NULL) return MP_MEMORY; } else { if (!s_pad(c, osize)) return MP_MEMORY; out = MP_DIGITS(c); } ZERO(out, osize); if (!s_kmul(MP_DIGITS(a), MP_DIGITS(b), out, ua, ub)) return MP_MEMORY; /* If we allocated a new buffer, get rid of whatever memory c was already using, and fix up its fields to reflect that. */ if (out != MP_DIGITS(c)) { if ((void *) MP_DIGITS(c) != (void *) c) s_free(MP_DIGITS(c)); MP_DIGITS(c) = out; MP_ALLOC(c) = p; } MP_USED(c) = osize; /* might not be true, but we'll fix it ... */ CLAMP(c); /* ... right here */ MP_SIGN(c) = osign; return MP_OK; } mp_result mp_int_mul_value(mp_int a, mp_small value, mp_int c) { mpz_t vtmp; mp_digit vbuf[MP_VALUE_DIGITS(value)]; s_fake(&vtmp, value, vbuf); return mp_int_mul(a, &vtmp, c); } mp_result mp_int_mul_pow2(mp_int a, mp_small p2, mp_int c) { mp_result res; CHECK(a != NULL && c != NULL && p2 >= 0); if ((res = mp_int_copy(a, c)) != MP_OK) return res; if (s_qmul(c, (mp_size) p2)) return MP_OK; else return MP_MEMORY; } mp_result mp_int_sqr(mp_int a, mp_int c) { mp_digit *out; mp_size osize, p = 0; CHECK(a != NULL && c != NULL); /* Get a temporary buffer big enough to hold the result */ osize = (mp_size) 4 * ((MP_USED(a) + 1) / 2); if (a == c) { p = ROUND_PREC(osize); p = MAX(p, default_precision); if ((out = s_alloc(p)) == NULL) return MP_MEMORY; } else { if (!s_pad(c, osize)) return MP_MEMORY; out = MP_DIGITS(c); } ZERO(out, osize); s_ksqr(MP_DIGITS(a), out, MP_USED(a)); /* Get rid of whatever memory c was already using, and fix up its fields to reflect the new digit array it's using */ if (out != MP_DIGITS(c)) { if ((void *) MP_DIGITS(c) != (void *) c) s_free(MP_DIGITS(c)); MP_DIGITS(c) = out; MP_ALLOC(c) = p; } MP_USED(c) = osize; /* might not be true, but we'll fix it ... */ CLAMP(c); /* ... right here */ MP_SIGN(c) = MP_ZPOS; return MP_OK; } mp_result mp_int_div(mp_int a, mp_int b, mp_int q, mp_int r) { int cmp, lg; mp_result res = MP_OK; mp_int qout, rout; mp_sign sa = MP_SIGN(a), sb = MP_SIGN(b); DECLARE_TEMP(2); CHECK(a != NULL && b != NULL && q != r); if (CMPZ(b) == 0) return MP_UNDEF; else if ((cmp = s_ucmp(a, b)) < 0) { /* If |a| < |b|, no division is required: q = 0, r = a */ if (r && (res = mp_int_copy(a, r)) != MP_OK) return res; if (q) mp_int_zero(q); return MP_OK; } else if (cmp == 0) { /* If |a| = |b|, no division is required: q = 1 or -1, r = 0 */ if (r) mp_int_zero(r); if (q) { mp_int_zero(q); q->digits[0] = 1; if (sa != sb) MP_SIGN(q) = MP_NEG; } return MP_OK; } /* When |a| > |b|, real division is required. We need someplace to store quotient and remainder, but q and r are allowed to be NULL or to overlap with the inputs. */ if ((lg = s_isp2(b)) < 0) { if (q && b != q) { if ((res = mp_int_copy(a, q)) != MP_OK) goto CLEANUP; else qout = q; } else { qout = LAST_TEMP(); SETUP(mp_int_init_copy(LAST_TEMP(), a)); } if (r && a != r) { if ((res = mp_int_copy(b, r)) != MP_OK) goto CLEANUP; else rout = r; } else { rout = LAST_TEMP(); SETUP(mp_int_init_copy(LAST_TEMP(), b)); } if ((res = s_udiv_knuth(qout, rout)) != MP_OK) goto CLEANUP; } else { if (q && (res = mp_int_copy(a, q)) != MP_OK) goto CLEANUP; if (r && (res = mp_int_copy(a, r)) != MP_OK) goto CLEANUP; if (q) s_qdiv(q, (mp_size) lg); qout = q; if (r) s_qmod(r, (mp_size) lg); rout = r; } /* Recompute signs for output */ if (rout) { MP_SIGN(rout) = sa; if (CMPZ(rout) == 0) MP_SIGN(rout) = MP_ZPOS; } if (qout) { MP_SIGN(qout) = (sa == sb) ? MP_ZPOS : MP_NEG; if (CMPZ(qout) == 0) MP_SIGN(qout) = MP_ZPOS; } if (q && (res = mp_int_copy(qout, q)) != MP_OK) goto CLEANUP; if (r && (res = mp_int_copy(rout, r)) != MP_OK) goto CLEANUP; CLEANUP_TEMP(); return res; } mp_result mp_int_mod(mp_int a, mp_int m, mp_int c) { mp_result res; mpz_t tmp; mp_int out; if (m == c) { mp_int_init(&tmp); out = &tmp; } else { out = c; } if ((res = mp_int_div(a, m, NULL, out)) != MP_OK) goto CLEANUP; if (CMPZ(out) < 0) res = mp_int_add(out, m, c); else res = mp_int_copy(out, c); CLEANUP: if (out != c) mp_int_clear(&tmp); return res; } mp_result mp_int_div_value(mp_int a, mp_small value, mp_int q, mp_small *r) { mpz_t vtmp, rtmp; mp_digit vbuf[MP_VALUE_DIGITS(value)]; mp_result res; mp_int_init(&rtmp); s_fake(&vtmp, value, vbuf); if ((res = mp_int_div(a, &vtmp, q, &rtmp)) != MP_OK) goto CLEANUP; if (r) (void) mp_int_to_int(&rtmp, r); /* can't fail */ CLEANUP: mp_int_clear(&rtmp); return res; } mp_result mp_int_div_pow2(mp_int a, mp_small p2, mp_int q, mp_int r) { mp_result res = MP_OK; CHECK(a != NULL && p2 >= 0 && q != r); if (q != NULL && (res = mp_int_copy(a, q)) == MP_OK) s_qdiv(q, (mp_size) p2); if (res == MP_OK && r != NULL && (res = mp_int_copy(a, r)) == MP_OK) s_qmod(r, (mp_size) p2); return res; } mp_result mp_int_expt(mp_int a, mp_small b, mp_int c) { mpz_t t; mp_result res; unsigned int v = abs(b); CHECK(c != NULL); if (b < 0) return MP_RANGE; if ((res = mp_int_init_copy(&t, a)) != MP_OK) return res; (void) mp_int_set_value(c, 1); while (v != 0) { if (v & 1) { if ((res = mp_int_mul(c, &t, c)) != MP_OK) goto CLEANUP; } v >>= 1; if (v == 0) break; if ((res = mp_int_sqr(&t, &t)) != MP_OK) goto CLEANUP; } CLEANUP: mp_int_clear(&t); return res; } mp_result mp_int_expt_value(mp_small a, mp_small b, mp_int c) { mpz_t t; mp_result res; unsigned int v = abs(b); CHECK(c != NULL); if (b < 0) return MP_RANGE; if ((res = mp_int_init_value(&t, a)) != MP_OK) return res; (void) mp_int_set_value(c, 1); while (v != 0) { if (v & 1) { if ((res = mp_int_mul(c, &t, c)) != MP_OK) goto CLEANUP; } v >>= 1; if (v == 0) break; if ((res = mp_int_sqr(&t, &t)) != MP_OK) goto CLEANUP; } CLEANUP: mp_int_clear(&t); return res; } mp_result mp_int_expt_full(mp_int a, mp_int b, mp_int c) { mpz_t t; mp_result res; unsigned ix, jx; CHECK(a != NULL && b != NULL && c != NULL); if (MP_SIGN(b) == MP_NEG) return MP_RANGE; if ((res = mp_int_init_copy(&t, a)) != MP_OK) return res; (void) mp_int_set_value(c, 1); for (ix = 0; ix < MP_USED(b); ++ix) { mp_digit d = b->digits[ix]; for (jx = 0; jx < MP_DIGIT_BIT; ++jx) { if (d & 1) { if ((res = mp_int_mul(c, &t, c)) != MP_OK) goto CLEANUP; } d >>= 1; if (d == 0 && ix + 1 == MP_USED(b)) break; if ((res = mp_int_sqr(&t, &t)) != MP_OK) goto CLEANUP; } } CLEANUP: mp_int_clear(&t); return res; } int mp_int_compare(mp_int a, mp_int b) { mp_sign sa; CHECK(a != NULL && b != NULL); sa = MP_SIGN(a); if (sa == MP_SIGN(b)) { int cmp = s_ucmp(a, b); /* If they're both zero or positive, the normal comparison applies; if both negative, the sense is reversed. */ if (sa == MP_ZPOS) return cmp; else return -cmp; } else { if (sa == MP_ZPOS) return 1; else return -1; } } int mp_int_compare_unsigned(mp_int a, mp_int b) { NRCHECK(a != NULL && b != NULL); return s_ucmp(a, b); } int mp_int_compare_zero(mp_int z) { NRCHECK(z != NULL); if (MP_USED(z) == 1 && z->digits[0] == 0) return 0; else if (MP_SIGN(z) == MP_ZPOS) return 1; else return -1; } int mp_int_compare_value(mp_int z, mp_small value) { mp_sign vsign = (value < 0) ? MP_NEG : MP_ZPOS; int cmp; CHECK(z != NULL); if (vsign == MP_SIGN(z)) { cmp = s_vcmp(z, value); return (vsign == MP_ZPOS) ? cmp : -cmp; } else { return (value < 0) ? 1 : -1; } } int mp_int_compare_uvalue(mp_int z, mp_usmall uv) { CHECK(z != NULL); if (MP_SIGN(z) == MP_NEG) return -1; else return s_uvcmp(z, uv); } mp_result mp_int_exptmod(mp_int a, mp_int b, mp_int m, mp_int c) { mp_result res; mp_size um; mp_int s; DECLARE_TEMP(3); CHECK(a != NULL && b != NULL && c != NULL && m != NULL); /* Zero moduli and negative exponents are not considered. */ if (CMPZ(m) == 0) return MP_UNDEF; if (CMPZ(b) < 0) return MP_RANGE; um = MP_USED(m); SETUP(mp_int_init_size(TEMP(0), 2 * um)); SETUP(mp_int_init_size(TEMP(1), 2 * um)); if (c == b || c == m) { SETUP(mp_int_init_size(TEMP(2), 2 * um)); s = TEMP(2); } else { s = c; } if ((res = mp_int_mod(a, m, TEMP(0))) != MP_OK) goto CLEANUP; if ((res = s_brmu(TEMP(1), m)) != MP_OK) goto CLEANUP; if ((res = s_embar(TEMP(0), b, m, TEMP(1), s)) != MP_OK) goto CLEANUP; res = mp_int_copy(s, c); CLEANUP_TEMP(); return res; } mp_result mp_int_exptmod_evalue(mp_int a, mp_small value, mp_int m, mp_int c) { mpz_t vtmp; mp_digit vbuf[MP_VALUE_DIGITS(value)]; s_fake(&vtmp, value, vbuf); return mp_int_exptmod(a, &vtmp, m, c); } mp_result mp_int_exptmod_bvalue(mp_small value, mp_int b, mp_int m, mp_int c) { mpz_t vtmp; mp_digit vbuf[MP_VALUE_DIGITS(value)]; s_fake(&vtmp, value, vbuf); return mp_int_exptmod(&vtmp, b, m, c); } mp_result mp_int_exptmod_known(mp_int a, mp_int b, mp_int m, mp_int mu, mp_int c) { mp_result res; mp_size um; mp_int s; DECLARE_TEMP(2); CHECK(a && b && m && c); /* Zero moduli and negative exponents are not considered. */ if (CMPZ(m) == 0) return MP_UNDEF; if (CMPZ(b) < 0) return MP_RANGE; um = MP_USED(m); SETUP(mp_int_init_size(TEMP(0), 2 * um)); if (c == b || c == m) { SETUP(mp_int_init_size(TEMP(1), 2 * um)); s = TEMP(1); } else { s = c; } if ((res = mp_int_mod(a, m, TEMP(0))) != MP_OK) goto CLEANUP; if ((res = s_embar(TEMP(0), b, m, mu, s)) != MP_OK) goto CLEANUP; res = mp_int_copy(s, c); CLEANUP_TEMP(); return res; } mp_result mp_int_redux_const(mp_int m, mp_int c) { CHECK(m != NULL && c != NULL && m != c); return s_brmu(c, m); } mp_result mp_int_invmod(mp_int a, mp_int m, mp_int c) { mp_result res; mp_sign sa; DECLARE_TEMP(2); CHECK(a != NULL && m != NULL && c != NULL); if (CMPZ(a) == 0 || CMPZ(m) <= 0) return MP_RANGE; sa = MP_SIGN(a); /* need this for the result later */ for (last__ = 0; last__ < 2; ++last__) mp_int_init(LAST_TEMP()); if ((res = mp_int_egcd(a, m, TEMP(0), TEMP(1), NULL)) != MP_OK) goto CLEANUP; if (mp_int_compare_value(TEMP(0), 1) != 0) { res = MP_UNDEF; goto CLEANUP; } /* It is first necessary to constrain the value to the proper range */ if ((res = mp_int_mod(TEMP(1), m, TEMP(1))) != MP_OK) goto CLEANUP; /* Now, if 'a' was originally negative, the value we have is actually the magnitude of the negative representative; to get the positive value we have to subtract from the modulus. Otherwise, the value is okay as it stands. */ if (sa == MP_NEG) res = mp_int_sub(m, TEMP(1), c); else res = mp_int_copy(TEMP(1), c); CLEANUP_TEMP(); return res; } /* Binary GCD algorithm due to Josef Stein, 1961 */ mp_result mp_int_gcd(mp_int a, mp_int b, mp_int c) { int ca, cb, k = 0; mpz_t u, v, t; mp_result res; CHECK(a != NULL && b != NULL && c != NULL); ca = CMPZ(a); cb = CMPZ(b); if (ca == 0 && cb == 0) return MP_UNDEF; else if (ca == 0) return mp_int_abs(b, c); else if (cb == 0) return mp_int_abs(a, c); mp_int_init(&t); if ((res = mp_int_init_copy(&u, a)) != MP_OK) goto U; if ((res = mp_int_init_copy(&v, b)) != MP_OK) goto V; MP_SIGN(&u) = MP_ZPOS; MP_SIGN(&v) = MP_ZPOS; { /* Divide out common factors of 2 from u and v */ int div2_u = s_dp2k(&u), div2_v = s_dp2k(&v); k = MIN(div2_u, div2_v); s_qdiv(&u, (mp_size) k); s_qdiv(&v, (mp_size) k); } if (mp_int_is_odd(&u)) { if ((res = mp_int_neg(&v, &t)) != MP_OK) goto CLEANUP; } else { if ((res = mp_int_copy(&u, &t)) != MP_OK) goto CLEANUP; } for (;;) { s_qdiv(&t, s_dp2k(&t)); if (CMPZ(&t) > 0) { if ((res = mp_int_copy(&t, &u)) != MP_OK) goto CLEANUP; } else { if ((res = mp_int_neg(&t, &v)) != MP_OK) goto CLEANUP; } if ((res = mp_int_sub(&u, &v, &t)) != MP_OK) goto CLEANUP; if (CMPZ(&t) == 0) break; } if ((res = mp_int_abs(&u, c)) != MP_OK) goto CLEANUP; if (!s_qmul(c, (mp_size) k)) res = MP_MEMORY; CLEANUP: mp_int_clear(&v); V: mp_int_clear(&u); U: mp_int_clear(&t); return res; } /* This is the binary GCD algorithm again, but this time we keep track of the elementary matrix operations as we go, so we can get values x and y satisfying c = ax + by. */ mp_result mp_int_egcd(mp_int a, mp_int b, mp_int c, mp_int x, mp_int y) { int k, ca, cb; mp_result res; DECLARE_TEMP(8); CHECK(a != NULL && b != NULL && c != NULL && (x != NULL || y != NULL)); ca = CMPZ(a); cb = CMPZ(b); if (ca == 0 && cb == 0) return MP_UNDEF; else if (ca == 0) { if ((res = mp_int_abs(b, c)) != MP_OK) return res; mp_int_zero(x); (void) mp_int_set_value(y, 1); return MP_OK; } else if (cb == 0) { if ((res = mp_int_abs(a, c)) != MP_OK) return res; (void) mp_int_set_value(x, 1); mp_int_zero(y); return MP_OK; } /* Initialize temporaries: A:0, B:1, C:2, D:3, u:4, v:5, ou:6, ov:7 */ for (last__ = 0; last__ < 4; ++last__) mp_int_init(LAST_TEMP()); TEMP(0)->digits[0] = 1; TEMP(3)->digits[0] = 1; SETUP(mp_int_init_copy(TEMP(4), a)); SETUP(mp_int_init_copy(TEMP(5), b)); /* We will work with absolute values here */ MP_SIGN(TEMP(4)) = MP_ZPOS; MP_SIGN(TEMP(5)) = MP_ZPOS; { /* Divide out common factors of 2 from u and v */ int div2_u = s_dp2k(TEMP(4)), div2_v = s_dp2k(TEMP(5)); k = MIN(div2_u, div2_v); s_qdiv(TEMP(4), k); s_qdiv(TEMP(5), k); } SETUP(mp_int_init_copy(TEMP(6), TEMP(4))); SETUP(mp_int_init_copy(TEMP(7), TEMP(5))); for (;;) { while (mp_int_is_even(TEMP(4))) { s_qdiv(TEMP(4), 1); if (mp_int_is_odd(TEMP(0)) || mp_int_is_odd(TEMP(1))) { if ((res = mp_int_add(TEMP(0), TEMP(7), TEMP(0))) != MP_OK) goto CLEANUP; if ((res = mp_int_sub(TEMP(1), TEMP(6), TEMP(1))) != MP_OK) goto CLEANUP; } s_qdiv(TEMP(0), 1); s_qdiv(TEMP(1), 1); } while (mp_int_is_even(TEMP(5))) { s_qdiv(TEMP(5), 1); if (mp_int_is_odd(TEMP(2)) || mp_int_is_odd(TEMP(3))) { if ((res = mp_int_add(TEMP(2), TEMP(7), TEMP(2))) != MP_OK) goto CLEANUP; if ((res = mp_int_sub(TEMP(3), TEMP(6), TEMP(3))) != MP_OK) goto CLEANUP; } s_qdiv(TEMP(2), 1); s_qdiv(TEMP(3), 1); } if (mp_int_compare(TEMP(4), TEMP(5)) >= 0) { if ((res = mp_int_sub(TEMP(4), TEMP(5), TEMP(4))) != MP_OK) goto CLEANUP; if ((res = mp_int_sub(TEMP(0), TEMP(2), TEMP(0))) != MP_OK) goto CLEANUP; if ((res = mp_int_sub(TEMP(1), TEMP(3), TEMP(1))) != MP_OK) goto CLEANUP; } else { if ((res = mp_int_sub(TEMP(5), TEMP(4), TEMP(5))) != MP_OK) goto CLEANUP; if ((res = mp_int_sub(TEMP(2), TEMP(0), TEMP(2))) != MP_OK) goto CLEANUP; if ((res = mp_int_sub(TEMP(3), TEMP(1), TEMP(3))) != MP_OK) goto CLEANUP; } if (CMPZ(TEMP(4)) == 0) { if (x && (res = mp_int_copy(TEMP(2), x)) != MP_OK) goto CLEANUP; if (y && (res = mp_int_copy(TEMP(3), y)) != MP_OK) goto CLEANUP; if (c) { if (!s_qmul(TEMP(5), k)) { res = MP_MEMORY; goto CLEANUP; } res = mp_int_copy(TEMP(5), c); } break; } } CLEANUP_TEMP(); return res; } mp_result mp_int_lcm(mp_int a, mp_int b, mp_int c) { mpz_t lcm; mp_result res; CHECK(a != NULL && b != NULL && c != NULL); /* Since a * b = gcd(a, b) * lcm(a, b), we can compute lcm(a, b) = (a / gcd(a, b)) * b. This formulation insures everything works even if the input variables share space. */ if ((res = mp_int_init(&lcm)) != MP_OK) return res; if ((res = mp_int_gcd(a, b, &lcm)) != MP_OK) goto CLEANUP; if ((res = mp_int_div(a, &lcm, &lcm, NULL)) != MP_OK) goto CLEANUP; if ((res = mp_int_mul(&lcm, b, &lcm)) != MP_OK) goto CLEANUP; res = mp_int_copy(&lcm, c); CLEANUP: mp_int_clear(&lcm); return res; } int mp_int_divisible_value(mp_int a, mp_small v) { mp_small rem = 0; if (mp_int_div_value(a, v, NULL, &rem) != MP_OK) return 0; return rem == 0; } int mp_int_is_pow2(mp_int z) { CHECK(z != NULL); return s_isp2(z); } /* Implementation of Newton's root finding method, based loosely on a patch contributed by Hal Finkel modified by M. J. Fromberger. */ mp_result mp_int_root(mp_int a, mp_small b, mp_int c) { mp_result res = MP_OK; int flips = 0; DECLARE_TEMP(5); CHECK(a != NULL && c != NULL && b > 0); if (b == 1) { return mp_int_copy(a, c); } if (MP_SIGN(a) == MP_NEG) { if (b % 2 == 0) return MP_UNDEF; /* root does not exist for negative a with even b */ else flips = 1; } SETUP(mp_int_init_copy(LAST_TEMP(), a)); SETUP(mp_int_init_copy(LAST_TEMP(), a)); SETUP(mp_int_init(LAST_TEMP())); SETUP(mp_int_init(LAST_TEMP())); SETUP(mp_int_init(LAST_TEMP())); (void) mp_int_abs(TEMP(0), TEMP(0)); (void) mp_int_abs(TEMP(1), TEMP(1)); for (;;) { if ((res = mp_int_expt(TEMP(1), b, TEMP(2))) != MP_OK) goto CLEANUP; if (mp_int_compare_unsigned(TEMP(2), TEMP(0)) <= 0) break; if ((res = mp_int_sub(TEMP(2), TEMP(0), TEMP(2))) != MP_OK) goto CLEANUP; if ((res = mp_int_expt(TEMP(1), b - 1, TEMP(3))) != MP_OK) goto CLEANUP; if ((res = mp_int_mul_value(TEMP(3), b, TEMP(3))) != MP_OK) goto CLEANUP; if ((res = mp_int_div(TEMP(2), TEMP(3), TEMP(4), NULL)) != MP_OK) goto CLEANUP; if ((res = mp_int_sub(TEMP(1), TEMP(4), TEMP(4))) != MP_OK) goto CLEANUP; if (mp_int_compare_unsigned(TEMP(1), TEMP(4)) == 0) { if ((res = mp_int_sub_value(TEMP(4), 1, TEMP(4))) != MP_OK) goto CLEANUP; } if ((res = mp_int_copy(TEMP(4), TEMP(1))) != MP_OK) goto CLEANUP; } if ((res = mp_int_copy(TEMP(1), c)) != MP_OK) goto CLEANUP; /* If the original value of a was negative, flip the output sign. */ if (flips) (void) mp_int_neg(c, c); /* cannot fail */ CLEANUP_TEMP(); return res; } mp_result mp_int_to_int(mp_int z, mp_small *out) { mp_usmall uv = 0; mp_size uz; mp_digit *dz; mp_sign sz; CHECK(z != NULL); /* Make sure the value is representable as a small integer */ sz = MP_SIGN(z); if ((sz == MP_ZPOS && mp_int_compare_value(z, MP_SMALL_MAX) > 0) || mp_int_compare_value(z, MP_SMALL_MIN) < 0) return MP_RANGE; uz = MP_USED(z); dz = MP_DIGITS(z) + uz - 1; while (uz > 0) { uv <<= MP_DIGIT_BIT/2; uv = (uv << (MP_DIGIT_BIT/2)) | *dz--; --uz; } if (out) *out = (sz == MP_NEG) ? -(mp_small)uv : (mp_small)uv; return MP_OK; } mp_result mp_int_to_uint(mp_int z, mp_usmall *out) { mp_usmall uv = 0; mp_size uz; mp_digit *dz; mp_sign sz; CHECK(z != NULL); /* Make sure the value is representable as an unsigned small integer */ sz = MP_SIGN(z); if (sz == MP_NEG || mp_int_compare_uvalue(z, MP_USMALL_MAX) > 0) return MP_RANGE; uz = MP_USED(z); dz = MP_DIGITS(z) + uz - 1; while (uz > 0) { uv <<= MP_DIGIT_BIT/2; uv = (uv << (MP_DIGIT_BIT/2)) | *dz--; --uz; } if (out) *out = uv; return MP_OK; } mp_result mp_int_to_string(mp_int z, mp_size radix, char *str, int limit) { mp_result res; int cmp = 0; CHECK(z != NULL && str != NULL && limit >= 2); if (radix < MP_MIN_RADIX || radix > MP_MAX_RADIX) return MP_RANGE; if (CMPZ(z) == 0) { *str++ = s_val2ch(0, 1); } else { mpz_t tmp; char *h, *t; if ((res = mp_int_init_copy(&tmp, z)) != MP_OK) return res; if (MP_SIGN(z) == MP_NEG) { *str++ = '-'; --limit; } h = str; /* Generate digits in reverse order until finished or limit reached */ for (/* */; limit > 0; --limit) { mp_digit d; if ((cmp = CMPZ(&tmp)) == 0) break; d = s_ddiv(&tmp, (mp_digit)radix); *str++ = s_val2ch(d, 1); } t = str - 1; /* Put digits back in correct output order */ while (h < t) { char tc = *h; *h++ = *t; *t-- = tc; } mp_int_clear(&tmp); } *str = '\0'; if (cmp == 0) return MP_OK; else return MP_TRUNC; } mp_result mp_int_string_len(mp_int z, mp_size radix) { int len; CHECK(z != NULL); if (radix < MP_MIN_RADIX || radix > MP_MAX_RADIX) return MP_RANGE; len = s_outlen(z, radix) + 1; /* for terminator */ /* Allow for sign marker on negatives */ if (MP_SIGN(z) == MP_NEG) len += 1; return len; } /* Read zero-terminated string into z */ mp_result mp_int_read_string(mp_int z, mp_size radix, const char *str) { return mp_int_read_cstring(z, radix, str, NULL); } mp_result mp_int_read_cstring(mp_int z, mp_size radix, const char *str, char **end) { int ch; CHECK(z != NULL && str != NULL); if (radix < MP_MIN_RADIX || radix > MP_MAX_RADIX) return MP_RANGE; /* Skip leading whitespace */ while (isspace((int)*str)) ++str; /* Handle leading sign tag (+/-, positive default) */ switch (*str) { case '-': MP_SIGN(z) = MP_NEG; ++str; break; case '+': ++str; /* fallthrough */ default: MP_SIGN(z) = MP_ZPOS; break; } /* Skip leading zeroes */ while ((ch = s_ch2val(*str, radix)) == 0) ++str; /* Make sure there is enough space for the value */ if (!s_pad(z, s_inlen(strlen(str), radix))) return MP_MEMORY; MP_USED(z) = 1; z->digits[0] = 0; while (*str != '\0' && ((ch = s_ch2val(*str, radix)) >= 0)) { s_dmul(z, (mp_digit)radix); s_dadd(z, (mp_digit)ch); ++str; } CLAMP(z); /* Override sign for zero, even if negative specified. */ if (CMPZ(z) == 0) MP_SIGN(z) = MP_ZPOS; if (end != NULL) *end = (char *)str; /* Return a truncation error if the string has unprocessed characters remaining, so the caller can tell if the whole string was done */ if (*str != '\0') return MP_TRUNC; else return MP_OK; } mp_result mp_int_count_bits(mp_int z) { mp_size nbits = 0, uz; mp_digit d; CHECK(z != NULL); uz = MP_USED(z); if (uz == 1 && z->digits[0] == 0) return 1; --uz; nbits = uz * MP_DIGIT_BIT; d = z->digits[uz]; while (d != 0) { d >>= 1; ++nbits; } return nbits; } mp_result mp_int_to_binary(mp_int z, unsigned char *buf, int limit) { static const int PAD_FOR_2C = 1; mp_result res; int limpos = limit; CHECK(z != NULL && buf != NULL); res = s_tobin(z, buf, &limpos, PAD_FOR_2C); if (MP_SIGN(z) == MP_NEG) s_2comp(buf, limpos); return res; } mp_result mp_int_read_binary(mp_int z, unsigned char *buf, int len) { mp_size need, i; unsigned char *tmp; mp_digit *dz; CHECK(z != NULL && buf != NULL && len > 0); /* Figure out how many digits are needed to represent this value */ need = ((len * CHAR_BIT) + (MP_DIGIT_BIT - 1)) / MP_DIGIT_BIT; if (!s_pad(z, need)) return MP_MEMORY; mp_int_zero(z); /* If the high-order bit is set, take the 2's complement before reading the value (it will be restored afterward) */ if (buf[0] >> (CHAR_BIT - 1)) { MP_SIGN(z) = MP_NEG; s_2comp(buf, len); } dz = MP_DIGITS(z); for (tmp = buf, i = len; i > 0; --i, ++tmp) { s_qmul(z, (mp_size) CHAR_BIT); *dz |= *tmp; } /* Restore 2's complement if we took it before */ if (MP_SIGN(z) == MP_NEG) s_2comp(buf, len); return MP_OK; } mp_result mp_int_binary_len(mp_int z) { mp_result res = mp_int_count_bits(z); int bytes = mp_int_unsigned_len(z); if (res <= 0) return res; bytes = (res + (CHAR_BIT - 1)) / CHAR_BIT; /* If the highest-order bit falls exactly on a byte boundary, we need to pad with an extra byte so that the sign will be read correctly when reading it back in. */ if (bytes * CHAR_BIT == res) ++bytes; return bytes; } mp_result mp_int_to_unsigned(mp_int z, unsigned char *buf, int limit) { static const int NO_PADDING = 0; CHECK(z != NULL && buf != NULL); return s_tobin(z, buf, &limit, NO_PADDING); } mp_result mp_int_read_unsigned(mp_int z, unsigned char *buf, int len) { mp_size need, i; unsigned char *tmp; CHECK(z != NULL && buf != NULL && len > 0); /* Figure out how many digits are needed to represent this value */ need = ((len * CHAR_BIT) + (MP_DIGIT_BIT - 1)) / MP_DIGIT_BIT; if (!s_pad(z, need)) return MP_MEMORY; mp_int_zero(z); for (tmp = buf, i = len; i > 0; --i, ++tmp) { (void) s_qmul(z, CHAR_BIT); *MP_DIGITS(z) |= *tmp; } return MP_OK; } mp_result mp_int_unsigned_len(mp_int z) { mp_result res = mp_int_count_bits(z); int bytes; if (res <= 0) return res; bytes = (res + (CHAR_BIT - 1)) / CHAR_BIT; return bytes; } const char *mp_error_string(mp_result res) { int ix; if (res > 0) return s_unknown_err; res = -res; for (ix = 0; ix < res && s_error_msg[ix] != NULL; ++ix) ; if (s_error_msg[ix] != NULL) return s_error_msg[ix]; else return s_unknown_err; } /*------------------------------------------------------------------------*/ /* Private functions for internal use. These make assumptions. */ STATIC mp_digit *s_alloc(mp_size num) { mp_digit *out = malloc(num * sizeof(mp_digit)); assert(out != NULL); /* for debugging */ #if DEBUG > 1 { mp_digit v = (mp_digit) 0xdeadbeef; int ix; for (ix = 0; ix < num; ++ix) out[ix] = v; } #endif return out; } STATIC mp_digit *s_realloc(mp_digit *old, mp_size osize, mp_size nsize) { #if DEBUG > 1 mp_digit *new = s_alloc(nsize); int ix; for (ix = 0; ix < nsize; ++ix) new[ix] = (mp_digit) 0xdeadbeef; memcpy(new, old, osize * sizeof(mp_digit)); #else mp_digit *new = realloc(old, nsize * sizeof(mp_digit)); assert(new != NULL); /* for debugging */ #endif return new; } STATIC void s_free(void *ptr) { free(ptr); } STATIC int s_pad(mp_int z, mp_size min) { if (MP_ALLOC(z) < min) { mp_size nsize = ROUND_PREC(min); mp_digit *tmp; if ((void *)z->digits == (void *)z) { if ((tmp = s_alloc(nsize)) == NULL) return 0; COPY(MP_DIGITS(z), tmp, MP_USED(z)); } else if ((tmp = s_realloc(MP_DIGITS(z), MP_ALLOC(z), nsize)) == NULL) return 0; MP_DIGITS(z) = tmp; MP_ALLOC(z) = nsize; } return 1; } /* Note: This will not work correctly when value == MP_SMALL_MIN */ STATIC void s_fake(mp_int z, mp_small value, mp_digit vbuf[]) { mp_usmall uv = (mp_usmall) (value < 0) ? -value : value; s_ufake(z, uv, vbuf); if (value < 0) z->sign = MP_NEG; } STATIC void s_ufake(mp_int z, mp_usmall value, mp_digit vbuf[]) { mp_size ndig = (mp_size) s_uvpack(value, vbuf); z->used = ndig; z->alloc = MP_VALUE_DIGITS(value); z->sign = MP_ZPOS; z->digits = vbuf; } STATIC int s_cdig(mp_digit *da, mp_digit *db, mp_size len) { mp_digit *dat = da + len - 1, *dbt = db + len - 1; for (/* */; len != 0; --len, --dat, --dbt) { if (*dat > *dbt) return 1; else if (*dat < *dbt) return -1; } return 0; } STATIC int s_uvpack(mp_usmall uv, mp_digit t[]) { int ndig = 0; if (uv == 0) t[ndig++] = 0; else { while (uv != 0) { t[ndig++] = (mp_digit) uv; uv >>= MP_DIGIT_BIT/2; uv >>= MP_DIGIT_BIT/2; } } return ndig; } STATIC int s_ucmp(mp_int a, mp_int b) { mp_size ua = MP_USED(a), ub = MP_USED(b); if (ua > ub) return 1; else if (ub > ua) return -1; else return s_cdig(MP_DIGITS(a), MP_DIGITS(b), ua); } STATIC int s_vcmp(mp_int a, mp_small v) { mp_usmall uv = (mp_usmall) (v < 0) ? -v : v; return s_uvcmp(a, uv); } STATIC int s_uvcmp(mp_int a, mp_usmall uv) { mpz_t vtmp; mp_digit vdig[MP_VALUE_DIGITS(uv)]; s_ufake(&vtmp, uv, vdig); return s_ucmp(a, &vtmp); } STATIC mp_digit s_uadd(mp_digit *da, mp_digit *db, mp_digit *dc, mp_size size_a, mp_size size_b) { mp_size pos; mp_word w = 0; /* Insure that da is the longer of the two to simplify later code */ if (size_b > size_a) { SWAP(mp_digit *, da, db); SWAP(mp_size, size_a, size_b); } /* Add corresponding digits until the shorter number runs out */ for (pos = 0; pos < size_b; ++pos, ++da, ++db, ++dc) { w = w + (mp_word) *da + (mp_word) *db; *dc = LOWER_HALF(w); w = UPPER_HALF(w); } /* Propagate carries as far as necessary */ for (/* */; pos < size_a; ++pos, ++da, ++dc) { w = w + *da; *dc = LOWER_HALF(w); w = UPPER_HALF(w); } /* Return carry out */ return (mp_digit)w; } STATIC void s_usub(mp_digit *da, mp_digit *db, mp_digit *dc, mp_size size_a, mp_size size_b) { mp_size pos; mp_word w = 0; /* We assume that |a| >= |b| so this should definitely hold */ assert(size_a >= size_b); /* Subtract corresponding digits and propagate borrow */ for (pos = 0; pos < size_b; ++pos, ++da, ++db, ++dc) { w = ((mp_word)MP_DIGIT_MAX + 1 + /* MP_RADIX */ (mp_word)*da) - w - (mp_word)*db; *dc = LOWER_HALF(w); w = (UPPER_HALF(w) == 0); } /* Finish the subtraction for remaining upper digits of da */ for (/* */; pos < size_a; ++pos, ++da, ++dc) { w = ((mp_word)MP_DIGIT_MAX + 1 + /* MP_RADIX */ (mp_word)*da) - w; *dc = LOWER_HALF(w); w = (UPPER_HALF(w) == 0); } /* If there is a borrow out at the end, it violates the precondition */ assert(w == 0); } STATIC int s_kmul(mp_digit *da, mp_digit *db, mp_digit *dc, mp_size size_a, mp_size size_b) { mp_size bot_size; /* Make sure b is the smaller of the two input values */ if (size_b > size_a) { SWAP(mp_digit *, da, db); SWAP(mp_size, size_a, size_b); } /* Insure that the bottom is the larger half in an odd-length split; the code below relies on this being true. */ bot_size = (size_a + 1) / 2; /* If the values are big enough to bother with recursion, use the Karatsuba algorithm to compute the product; otherwise use the normal multiplication algorithm */ if (multiply_threshold && size_a >= multiply_threshold && size_b > bot_size) { mp_digit *t1, *t2, *t3, carry; mp_digit *a_top = da + bot_size; mp_digit *b_top = db + bot_size; mp_size at_size = size_a - bot_size; mp_size bt_size = size_b - bot_size; mp_size buf_size = 2 * bot_size; /* Do a single allocation for all three temporary buffers needed; each buffer must be big enough to hold the product of two bottom halves, and one buffer needs space for the completed product; twice the space is plenty. */ if ((t1 = s_alloc(4 * buf_size)) == NULL) return 0; t2 = t1 + buf_size; t3 = t2 + buf_size; ZERO(t1, 4 * buf_size); /* t1 and t2 are initially used as temporaries to compute the inner product (a1 + a0)(b1 + b0) = a1b1 + a1b0 + a0b1 + a0b0 */ carry = s_uadd(da, a_top, t1, bot_size, at_size); /* t1 = a1 + a0 */ t1[bot_size] = carry; carry = s_uadd(db, b_top, t2, bot_size, bt_size); /* t2 = b1 + b0 */ t2[bot_size] = carry; (void) s_kmul(t1, t2, t3, bot_size + 1, bot_size + 1); /* t3 = t1 * t2 */ /* Now we'll get t1 = a0b0 and t2 = a1b1, and subtract them out so that we're left with only the pieces we want: t3 = a1b0 + a0b1 */ ZERO(t1, buf_size); ZERO(t2, buf_size); (void) s_kmul(da, db, t1, bot_size, bot_size); /* t1 = a0 * b0 */ (void) s_kmul(a_top, b_top, t2, at_size, bt_size); /* t2 = a1 * b1 */ /* Subtract out t1 and t2 to get the inner product */ s_usub(t3, t1, t3, buf_size + 2, buf_size); s_usub(t3, t2, t3, buf_size + 2, buf_size); /* Assemble the output value */ COPY(t1, dc, buf_size); carry = s_uadd(t3, dc + bot_size, dc + bot_size, buf_size + 1, buf_size); assert(carry == 0); carry = s_uadd(t2, dc + 2*bot_size, dc + 2*bot_size, buf_size, buf_size); assert(carry == 0); s_free(t1); /* note t2 and t3 are just internal pointers to t1 */ } else { s_umul(da, db, dc, size_a, size_b); } return 1; } STATIC void s_umul(mp_digit *da, mp_digit *db, mp_digit *dc, mp_size size_a, mp_size size_b) { mp_size a, b; mp_word w; for (a = 0; a < size_a; ++a, ++dc, ++da) { mp_digit *dct = dc; mp_digit *dbt = db; if (*da == 0) continue; w = 0; for (b = 0; b < size_b; ++b, ++dbt, ++dct) { w = (mp_word)*da * (mp_word)*dbt + w + (mp_word)*dct; *dct = LOWER_HALF(w); w = UPPER_HALF(w); } *dct = (mp_digit)w; } } STATIC int s_ksqr(mp_digit *da, mp_digit *dc, mp_size size_a) { if (multiply_threshold && size_a > multiply_threshold) { mp_size bot_size = (size_a + 1) / 2; mp_digit *a_top = da + bot_size; mp_digit *t1, *t2, *t3, carry; mp_size at_size = size_a - bot_size; mp_size buf_size = 2 * bot_size; if ((t1 = s_alloc(4 * buf_size)) == NULL) return 0; t2 = t1 + buf_size; t3 = t2 + buf_size; ZERO(t1, 4 * buf_size); (void) s_ksqr(da, t1, bot_size); /* t1 = a0 ^ 2 */ (void) s_ksqr(a_top, t2, at_size); /* t2 = a1 ^ 2 */ (void) s_kmul(da, a_top, t3, bot_size, at_size); /* t3 = a0 * a1 */ /* Quick multiply t3 by 2, shifting left (can't overflow) */ { int i, top = bot_size + at_size; mp_word w, save = 0; for (i = 0; i < top; ++i) { w = t3[i]; w = (w << 1) | save; t3[i] = LOWER_HALF(w); save = UPPER_HALF(w); } t3[i] = LOWER_HALF(save); } /* Assemble the output value */ COPY(t1, dc, 2 * bot_size); carry = s_uadd(t3, dc + bot_size, dc + bot_size, buf_size + 1, buf_size); assert(carry == 0); carry = s_uadd(t2, dc + 2*bot_size, dc + 2*bot_size, buf_size, buf_size); assert(carry == 0); s_free(t1); /* note that t2 and t2 are internal pointers only */ } else { s_usqr(da, dc, size_a); } return 1; } STATIC void s_usqr(mp_digit *da, mp_digit *dc, mp_size size_a) { mp_size i, j; mp_word w; for (i = 0; i < size_a; ++i, dc += 2, ++da) { mp_digit *dct = dc, *dat = da; if (*da == 0) continue; /* Take care of the first digit, no rollover */ w = (mp_word)*dat * (mp_word)*dat + (mp_word)*dct; *dct = LOWER_HALF(w); w = UPPER_HALF(w); ++dat; ++dct; for (j = i + 1; j < size_a; ++j, ++dat, ++dct) { mp_word t = (mp_word)*da * (mp_word)*dat; mp_word u = w + (mp_word)*dct, ov = 0; /* Check if doubling t will overflow a word */ if (HIGH_BIT_SET(t)) ov = 1; w = t + t; /* Check if adding u to w will overflow a word */ if (ADD_WILL_OVERFLOW(w, u)) ov = 1; w += u; *dct = LOWER_HALF(w); w = UPPER_HALF(w); if (ov) { w += MP_DIGIT_MAX; /* MP_RADIX */ ++w; } } w = w + *dct; *dct = (mp_digit)w; while ((w = UPPER_HALF(w)) != 0) { ++dct; w = w + *dct; *dct = LOWER_HALF(w); } assert(w == 0); } } STATIC void s_dadd(mp_int a, mp_digit b) { mp_word w = 0; mp_digit *da = MP_DIGITS(a); mp_size ua = MP_USED(a); w = (mp_word)*da + b; *da++ = LOWER_HALF(w); w = UPPER_HALF(w); for (ua -= 1; ua > 0; --ua, ++da) { w = (mp_word)*da + w; *da = LOWER_HALF(w); w = UPPER_HALF(w); } if (w) { *da = (mp_digit)w; MP_USED(a) += 1; } } STATIC void s_dmul(mp_int a, mp_digit b) { mp_word w = 0; mp_digit *da = MP_DIGITS(a); mp_size ua = MP_USED(a); while (ua > 0) { w = (mp_word)*da * b + w; *da++ = LOWER_HALF(w); w = UPPER_HALF(w); --ua; } if (w) { *da = (mp_digit)w; MP_USED(a) += 1; } } STATIC void s_dbmul(mp_digit *da, mp_digit b, mp_digit *dc, mp_size size_a) { mp_word w = 0; while (size_a > 0) { w = (mp_word)*da++ * (mp_word)b + w; *dc++ = LOWER_HALF(w); w = UPPER_HALF(w); --size_a; } if (w) *dc = LOWER_HALF(w); } STATIC mp_digit s_ddiv(mp_int a, mp_digit b) { mp_word w = 0, qdigit; mp_size ua = MP_USED(a); mp_digit *da = MP_DIGITS(a) + ua - 1; for (/* */; ua > 0; --ua, --da) { w = (w << MP_DIGIT_BIT) | *da; if (w >= b) { qdigit = w / b; w = w % b; } else { qdigit = 0; } *da = (mp_digit)qdigit; } CLAMP(a); return (mp_digit)w; } STATIC void s_qdiv(mp_int z, mp_size p2) { mp_size ndig = p2 / MP_DIGIT_BIT, nbits = p2 % MP_DIGIT_BIT; mp_size uz = MP_USED(z); if (ndig) { mp_size mark; mp_digit *to, *from; if (ndig >= uz) { mp_int_zero(z); return; } to = MP_DIGITS(z); from = to + ndig; for (mark = ndig; mark < uz; ++mark) *to++ = *from++; MP_USED(z) = uz - ndig; } if (nbits) { mp_digit d = 0, *dz, save; mp_size up = MP_DIGIT_BIT - nbits; uz = MP_USED(z); dz = MP_DIGITS(z) + uz - 1; for (/* */; uz > 0; --uz, --dz) { save = *dz; *dz = (*dz >> nbits) | (d << up); d = save; } CLAMP(z); } if (MP_USED(z) == 1 && z->digits[0] == 0) MP_SIGN(z) = MP_ZPOS; } STATIC void s_qmod(mp_int z, mp_size p2) { mp_size start = p2 / MP_DIGIT_BIT + 1, rest = p2 % MP_DIGIT_BIT; mp_size uz = MP_USED(z); mp_digit mask = (1 << rest) - 1; if (start <= uz) { MP_USED(z) = start; z->digits[start - 1] &= mask; CLAMP(z); } } STATIC int s_qmul(mp_int z, mp_size p2) { mp_size uz, need, rest, extra, i; mp_digit *from, *to, d; if (p2 == 0) return 1; uz = MP_USED(z); need = p2 / MP_DIGIT_BIT; rest = p2 % MP_DIGIT_BIT; /* Figure out if we need an extra digit at the top end; this occurs if the topmost `rest' bits of the high-order digit of z are not zero, meaning they will be shifted off the end if not preserved */ extra = 0; if (rest != 0) { mp_digit *dz = MP_DIGITS(z) + uz - 1; if ((*dz >> (MP_DIGIT_BIT - rest)) != 0) extra = 1; } if (!s_pad(z, uz + need + extra)) return 0; /* If we need to shift by whole digits, do that in one pass, then to back and shift by partial digits. */ if (need > 0) { from = MP_DIGITS(z) + uz - 1; to = from + need; for (i = 0; i < uz; ++i) *to-- = *from--; ZERO(MP_DIGITS(z), need); uz += need; } if (rest) { d = 0; for (i = need, from = MP_DIGITS(z) + need; i < uz; ++i, ++from) { mp_digit save = *from; *from = (*from << rest) | (d >> (MP_DIGIT_BIT - rest)); d = save; } d >>= (MP_DIGIT_BIT - rest); if (d != 0) { *from = d; uz += extra; } } MP_USED(z) = uz; CLAMP(z); return 1; } /* Compute z = 2^p2 - |z|; requires that 2^p2 >= |z| The sign of the result is always zero/positive. */ STATIC int s_qsub(mp_int z, mp_size p2) { mp_digit hi = (1 << (p2 % MP_DIGIT_BIT)), *zp; mp_size tdig = (p2 / MP_DIGIT_BIT), pos; mp_word w = 0; if (!s_pad(z, tdig + 1)) return 0; for (pos = 0, zp = MP_DIGITS(z); pos < tdig; ++pos, ++zp) { w = ((mp_word) MP_DIGIT_MAX + 1) - w - (mp_word)*zp; *zp = LOWER_HALF(w); w = UPPER_HALF(w) ? 0 : 1; } w = ((mp_word) MP_DIGIT_MAX + 1 + hi) - w - (mp_word)*zp; *zp = LOWER_HALF(w); assert(UPPER_HALF(w) != 0); /* no borrow out should be possible */ MP_SIGN(z) = MP_ZPOS; CLAMP(z); return 1; } STATIC int s_dp2k(mp_int z) { int k = 0; mp_digit *dp = MP_DIGITS(z), d; if (MP_USED(z) == 1 && *dp == 0) return 1; while (*dp == 0) { k += MP_DIGIT_BIT; ++dp; } d = *dp; while ((d & 1) == 0) { d >>= 1; ++k; } return k; } STATIC int s_isp2(mp_int z) { mp_size uz = MP_USED(z), k = 0; mp_digit *dz = MP_DIGITS(z), d; while (uz > 1) { if (*dz++ != 0) return -1; k += MP_DIGIT_BIT; --uz; } d = *dz; while (d > 1) { if (d & 1) return -1; ++k; d >>= 1; } return (int) k; } STATIC int s_2expt(mp_int z, mp_small k) { mp_size ndig, rest; mp_digit *dz; ndig = (k + MP_DIGIT_BIT) / MP_DIGIT_BIT; rest = k % MP_DIGIT_BIT; if (!s_pad(z, ndig)) return 0; dz = MP_DIGITS(z); ZERO(dz, ndig); *(dz + ndig - 1) = (1 << rest); MP_USED(z) = ndig; return 1; } STATIC int s_norm(mp_int a, mp_int b) { mp_digit d = b->digits[MP_USED(b) - 1]; int k = 0; while (d < (mp_digit) (1 << (MP_DIGIT_BIT - 1))) { /* d < (MP_RADIX / 2) */ d <<= 1; ++k; } /* These multiplications can't fail */ if (k != 0) { (void) s_qmul(a, (mp_size) k); (void) s_qmul(b, (mp_size) k); } return k; } STATIC mp_result s_brmu(mp_int z, mp_int m) { mp_size um = MP_USED(m) * 2; if (!s_pad(z, um)) return MP_MEMORY; s_2expt(z, MP_DIGIT_BIT * um); return mp_int_div(z, m, z, NULL); } STATIC int s_reduce(mp_int x, mp_int m, mp_int mu, mp_int q1, mp_int q2) { mp_size um = MP_USED(m), umb_p1, umb_m1; umb_p1 = (um + 1) * MP_DIGIT_BIT; umb_m1 = (um - 1) * MP_DIGIT_BIT; if (mp_int_copy(x, q1) != MP_OK) return 0; /* Compute q2 = floor((floor(x / b^(k-1)) * mu) / b^(k+1)) */ s_qdiv(q1, umb_m1); UMUL(q1, mu, q2); s_qdiv(q2, umb_p1); /* Set x = x mod b^(k+1) */ s_qmod(x, umb_p1); /* Now, q is a guess for the quotient a / m. Compute x - q * m mod b^(k+1), replacing x. This may be off by a factor of 2m, but no more than that. */ UMUL(q2, m, q1); s_qmod(q1, umb_p1); (void) mp_int_sub(x, q1, x); /* can't fail */ /* The result may be < 0; if it is, add b^(k+1) to pin it in the proper range. */ if ((CMPZ(x) < 0) && !s_qsub(x, umb_p1)) return 0; /* If x > m, we need to back it off until it is in range. This will be required at most twice. */ if (mp_int_compare(x, m) >= 0) { (void) mp_int_sub(x, m, x); if (mp_int_compare(x, m) >= 0) (void) mp_int_sub(x, m, x); } /* At this point, x has been properly reduced. */ return 1; } /* Perform modular exponentiation using Barrett's method, where mu is the reduction constant for m. Assumes a < m, b > 0. */ STATIC mp_result s_embar(mp_int a, mp_int b, mp_int m, mp_int mu, mp_int c) { mp_digit *db, *dbt, umu, d; mp_result res; DECLARE_TEMP(3); umu = MP_USED(mu); db = MP_DIGITS(b); dbt = db + MP_USED(b) - 1; while (last__ < 3) { SETUP(mp_int_init_size(LAST_TEMP(), 4 * umu)); ZERO(MP_DIGITS(TEMP(last__ - 1)), MP_ALLOC(TEMP(last__ - 1))); } (void) mp_int_set_value(c, 1); /* Take care of low-order digits */ while (db < dbt) { int i; for (d = *db, i = MP_DIGIT_BIT; i > 0; --i, d >>= 1) { if (d & 1) { /* The use of a second temporary avoids allocation */ UMUL(c, a, TEMP(0)); if (!s_reduce(TEMP(0), m, mu, TEMP(1), TEMP(2))) { res = MP_MEMORY; goto CLEANUP; } mp_int_copy(TEMP(0), c); } USQR(a, TEMP(0)); assert(MP_SIGN(TEMP(0)) == MP_ZPOS); if (!s_reduce(TEMP(0), m, mu, TEMP(1), TEMP(2))) { res = MP_MEMORY; goto CLEANUP; } assert(MP_SIGN(TEMP(0)) == MP_ZPOS); mp_int_copy(TEMP(0), a); } ++db; } /* Take care of highest-order digit */ d = *dbt; for (;;) { if (d & 1) { UMUL(c, a, TEMP(0)); if (!s_reduce(TEMP(0), m, mu, TEMP(1), TEMP(2))) { res = MP_MEMORY; goto CLEANUP; } mp_int_copy(TEMP(0), c); } d >>= 1; if (!d) break; USQR(a, TEMP(0)); if (!s_reduce(TEMP(0), m, mu, TEMP(1), TEMP(2))) { res = MP_MEMORY; goto CLEANUP; } (void) mp_int_copy(TEMP(0), a); } CLEANUP_TEMP(); return res; } #if 0 /* The s_udiv function produces incorrect results. For example, with test div:11141460315522012760862883825:48318382095:0,230584300062375935 commenting out the function for now and using s_udiv_knuth instead. STATIC mp_result s_udiv(mp_int a, mp_int b); */ /* Precondition: a >= b and b > 0 Postcondition: a' = a / b, b' = a % b */ STATIC mp_result s_udiv(mp_int a, mp_int b) { mpz_t q, r, t; mp_size ua, ub, qpos = 0; mp_digit *da, btop; mp_result res = MP_OK; int k, skip = 0; /* Force signs to positive */ MP_SIGN(a) = MP_ZPOS; MP_SIGN(b) = MP_ZPOS; /* Normalize, per Knuth */ k = s_norm(a, b); ua = MP_USED(a); ub = MP_USED(b); btop = b->digits[ub - 1]; if ((res = mp_int_init_size(&q, ua)) != MP_OK) return res; if ((res = mp_int_init_size(&t, ua + 1)) != MP_OK) goto CLEANUP; da = MP_DIGITS(a); r.digits = da + ua - 1; /* The contents of r are shared with a */ r.used = 1; r.sign = MP_ZPOS; r.alloc = MP_ALLOC(a); ZERO(t.digits, t.alloc); /* Solve for quotient digits, store in q.digits in reverse order */ while (r.digits >= da) { assert(qpos <= q.alloc); if (s_ucmp(b, &r) > 0) { r.digits -= 1; r.used += 1; if (++skip > 1 && qpos > 0) q.digits[qpos++] = 0; CLAMP(&r); } else { mp_word pfx = r.digits[r.used - 1]; mp_word qdigit; if (r.used > 1 && pfx < btop) { pfx <<= MP_DIGIT_BIT / 2; pfx <<= MP_DIGIT_BIT / 2; pfx |= r.digits[r.used - 2]; } qdigit = pfx / btop; if (qdigit > MP_DIGIT_MAX) { qdigit = MP_DIGIT_MAX; } s_dbmul(MP_DIGITS(b), (mp_digit) qdigit, t.digits, ub); t.used = ub + 1; CLAMP(&t); while (s_ucmp(&t, &r) > 0) { --qdigit; (void) mp_int_sub(&t, b, &t); /* cannot fail */ } s_usub(r.digits, t.digits, r.digits, r.used, t.used); CLAMP(&r); q.digits[qpos++] = (mp_digit) qdigit; ZERO(t.digits, t.used); skip = 0; } } /* Put quotient digits in the correct order, and discard extra zeroes */ q.used = qpos; REV(mp_digit, q.digits, qpos); CLAMP(&q); /* Denormalize the remainder */ CLAMP(a); if (k != 0) s_qdiv(a, k); mp_int_copy(a, b); /* ok: 0 <= r < b */ mp_int_copy(&q, a); /* ok: q <= a */ mp_int_clear(&t); CLEANUP: mp_int_clear(&q); return res; } #endif /* Division of nonnegative integers This function implements division algorithm for unsigned multi-precision integers. The algorithm is based on Algorithm D from Knuth's "The Art of Computer Programming", 3rd ed. 1998, pg 272-273. We diverge from Knuth's algorithm in that we do not perform the subtraction from the remainder until we have determined that we have the correct quotient digit. This makes our algorithm less efficient that Knuth because we might have to perform multiple multiplication and comparison steps before the subtraction. The advantage is that it is easy to implement and ensure correctness without worrying about underflow from the subtraction. inputs: u a n+m digit integer in base b (b is 2^MP_DIGIT_BIT) v a n digit integer in base b (b is 2^MP_DIGIT_BIT) n >= 1 m >= 0 outputs: u / v stored in u u % v stored in v */ STATIC mp_result s_udiv_knuth(mp_int u, mp_int v) { mpz_t q, r, t; mp_result res = MP_OK; int k,j; mp_size m,n; /* Force signs to positive */ MP_SIGN(u) = MP_ZPOS; MP_SIGN(v) = MP_ZPOS; /* Use simple division algorithm when v is only one digit long */ if (MP_USED(v) == 1) { mp_digit d, rem; d = v->digits[0]; rem = s_ddiv(u, d); mp_int_set_value(v, rem); return MP_OK; } /************************************************************/ /* Algorithm D */ /************************************************************/ /* The n and m variables are defined as used by Knuth. u is an n digit number with digits u_{n-1}..u_0. v is an n+m digit number with digits from v_{m+n-1}..v_0. We require that n > 1 and m >= 0 */ n = MP_USED(v); m = MP_USED(u) - n; assert(n > 1); assert(m >= 0); /************************************************************/ /* D1: Normalize. The normalization step provides the necessary condition for Theorem B, which states that the quotient estimate for q_j, call it qhat qhat = u_{j+n}u_{j+n-1} / v_{n-1} is bounded by qhat - 2 <= q_j <= qhat. That is, qhat is always greater than the actual quotient digit q, and it is never more than two larger than the actual quotient digit. */ k = s_norm(u, v); /* Extend size of u by one if needed. The algorithm begins with a value of u that has one more digit of input. The normalization step sets u_{m+n}..u_0 = 2^k * u_{m+n-1}..u_0. If the multiplication did not increase the number of digits of u, we need to add a leading zero here. */ if (k == 0 || MP_USED(u) != m + n + 1) { if (!s_pad(u, m+n+1)) return MP_MEMORY; u->digits[m+n] = 0; u->used = m+n+1; } /* Add a leading 0 to v. The multiplication in step D4 multiplies qhat * 0v_{n-1}..v_0. We need to add the leading zero to v here to ensure that the multiplication will produce the full n+1 digit result. */ if (!s_pad(v, n+1)) return MP_MEMORY; v->digits[n] = 0; /* Initialize temporary variables q and t. q allocates space for m+1 digits to store the quotient digits t allocates space for n+1 digits to hold the result of q_j*v */ if ((res = mp_int_init_size(&q, m + 1)) != MP_OK) return res; if ((res = mp_int_init_size(&t, n + 1)) != MP_OK) goto CLEANUP; /************************************************************/ /* D2: Initialize j */ j = m; r.digits = MP_DIGITS(u) + j; /* The contents of r are shared with u */ r.used = n + 1; r.sign = MP_ZPOS; r.alloc = MP_ALLOC(u); ZERO(t.digits, t.alloc); /* Calculate the m+1 digits of the quotient result */ for (; j >= 0; j--) { /************************************************************/ /* D3: Calculate q' */ /* r->digits is aligned to position j of the number u */ mp_word pfx, qhat; pfx = r.digits[n]; pfx <<= MP_DIGIT_BIT / 2; pfx <<= MP_DIGIT_BIT / 2; pfx |= r.digits[n-1]; /* pfx = u_{j+n}{j+n-1} */ qhat = pfx / v->digits[n-1]; /* Check to see if qhat > b, and decrease qhat if so. Theorem B guarantess that qhat is at most 2 larger than the actual value, so it is possible that qhat is greater than the maximum value that will fit in a digit */ if (qhat > MP_DIGIT_MAX) qhat = MP_DIGIT_MAX; /************************************************************/ /* D4,D5,D6: Multiply qhat * v and test for a correct value of q We proceed a bit different than the way described by Knuth. This way is simpler but less efficent. Instead of doing the multiply and subtract then checking for underflow, we first do the multiply of qhat * v and see if it is larger than the current remainder r. If it is larger, we decrease qhat by one and try again. We may need to decrease qhat one more time before we get a value that is smaller than r. This way is less efficent than Knuth becuase we do more multiplies, but we do not need to worry about underflow this way. */ /* t = qhat * v */ s_dbmul(MP_DIGITS(v), (mp_digit) qhat, t.digits, n+1); t.used = n + 1; CLAMP(&t); /* Clamp r for the comparison. Comparisons do not like leading zeros. */ CLAMP(&r); if (s_ucmp(&t, &r) > 0) { /* would the remainder be negative? */ qhat -= 1; /* try a smaller q */ s_dbmul(MP_DIGITS(v), (mp_digit) qhat, t.digits, n+1); t.used = n + 1; CLAMP(&t); if (s_ucmp(&t, &r) > 0) { /* would the remainder be negative? */ assert(qhat > 0); qhat -= 1; /* try a smaller q */ s_dbmul(MP_DIGITS(v), (mp_digit) qhat, t.digits, n+1); t.used = n + 1; CLAMP(&t); } assert(s_ucmp(&t, &r) <= 0 && "The mathematics failed us."); } /* Unclamp r. The D algorithm expects r = u_{j+n}..u_j to always be n+1 digits long. */ r.used = n + 1; /************************************************************/ /* D4: Multiply and subtract */ /* note: The multiply was completed above so we only need to subtract here. **/ s_usub(r.digits, t.digits, r.digits, r.used, t.used); /************************************************************/ /* D5: Test remainder */ /* note: Not needed because we always check that qhat is the correct value * before performing the subtract. * Value cast to mp_digit to prevent warning, qhat has been clamped to MP_DIGIT_MAX */ q.digits[j] = (mp_digit)qhat; /************************************************************/ /* D6: Add back */ /* note: Not needed because we always check that qhat is the correct value * before performing the subtract. */ /************************************************************/ /* D7: Loop on j */ r.digits--; ZERO(t.digits, t.alloc); } /* Get rid of leading zeros in q */ q.used = m + 1; CLAMP(&q); /* Denormalize the remainder */ CLAMP(u); /* use u here because the r.digits pointer is off-by-one */ if (k != 0) s_qdiv(u, k); mp_int_copy(u, v); /* ok: 0 <= r < v */ mp_int_copy(&q, u); /* ok: q <= u */ mp_int_clear(&t); CLEANUP: mp_int_clear(&q); return res; } STATIC int s_outlen(mp_int z, mp_size r) { mp_result bits; double raw; assert(r >= MP_MIN_RADIX && r <= MP_MAX_RADIX); bits = mp_int_count_bits(z); raw = (double)bits * s_log2[r]; return (int)(raw + 0.999999); } STATIC mp_size s_inlen(int len, mp_size r) { double raw = (double)len / s_log2[r]; mp_size bits = (mp_size)(raw + 0.5); return (mp_size)((bits + (MP_DIGIT_BIT - 1)) / MP_DIGIT_BIT) + 1; } STATIC int s_ch2val(char c, int r) { int out; if (isdigit((unsigned char) c)) out = c - '0'; else if (r > 10 && isalpha((unsigned char) c)) out = toupper(c) - 'A' + 10; else return -1; return (out >= r) ? -1 : out; } STATIC char s_val2ch(int v, int caps) { assert(v >= 0); if (v < 10) return v + '0'; else { char out = (v - 10) + 'a'; if (caps) return toupper(out); else return out; } } STATIC void s_2comp(unsigned char *buf, int len) { int i; unsigned short s = 1; for (i = len - 1; i >= 0; --i) { unsigned char c = ~buf[i]; s = c + s; c = s & UCHAR_MAX; s >>= CHAR_BIT; buf[i] = c; } /* last carry out is ignored */ } STATIC mp_result s_tobin(mp_int z, unsigned char *buf, int *limpos, int pad) { mp_size uz; mp_digit *dz; int pos = 0, limit = *limpos; uz = MP_USED(z); dz = MP_DIGITS(z); while (uz > 0 && pos < limit) { mp_digit d = *dz++; int i; for (i = sizeof(mp_digit); i > 0 && pos < limit; --i) { buf[pos++] = (unsigned char)d; d >>= CHAR_BIT; /* Don't write leading zeroes */ if (d == 0 && uz == 1) i = 0; /* exit loop without signaling truncation */ } /* Detect truncation (loop exited with pos >= limit) */ if (i > 0) break; --uz; } if (pad != 0 && (buf[pos - 1] >> (CHAR_BIT - 1))) { if (pos < limit) buf[pos++] = 0; else uz = 1; } /* Digits are in reverse order, fix that */ REV(unsigned char, buf, pos); /* Return the number of bytes actually written */ *limpos = pos; return (uz == 0) ? MP_OK : MP_TRUNC; } #if DEBUG void s_print(char *tag, mp_int z) { int i; fprintf(stderr, "%s: %c ", tag, (MP_SIGN(z) == MP_NEG) ? '-' : '+'); for (i = MP_USED(z) - 1; i >= 0; --i) fprintf(stderr, "%0*X", (int)(MP_DIGIT_BIT / 4), z->digits[i]); fputc('\n', stderr); } void s_print_buf(char *tag, mp_digit *buf, mp_size num) { int i; fprintf(stderr, "%s: ", tag); for (i = num - 1; i >= 0; --i) fprintf(stderr, "%0*X", (int)(MP_DIGIT_BIT / 4), buf[i]); fputc('\n', stderr); } #endif /* Here there be dragons */ cloog-0.18.4/isl/imath/imrat.c0000644000175000017500000005625112555415003013012 00000000000000/* Name: imrat.c Purpose: Arbitrary precision rational arithmetic routines. Author: M. J. Fromberger Copyright (C) 2002-2007 Michael J. Fromberger, All Rights Reserved. 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 "imrat.h" #include #include #include #include #define TEMP(K) (temp + (K)) #define SETUP(E, C) \ do{if((res = (E)) != MP_OK) goto CLEANUP; ++(C);}while(0) /* Argument checking: Use CHECK() where a return value is required; NRCHECK() elsewhere */ #define CHECK(TEST) assert(TEST) #define NRCHECK(TEST) assert(TEST) /* Reduce the given rational, in place, to lowest terms and canonical form. Zero is represented as 0/1, one as 1/1. Signs are adjusted so that the sign of the numerator is definitive. */ static mp_result s_rat_reduce(mp_rat r); /* Common code for addition and subtraction operations on rationals. */ static mp_result s_rat_combine(mp_rat a, mp_rat b, mp_rat c, mp_result (*comb_f)(mp_int, mp_int, mp_int)); mp_result mp_rat_init(mp_rat r) { mp_result res; if ((res = mp_int_init(MP_NUMER_P(r))) != MP_OK) return res; if ((res = mp_int_init(MP_DENOM_P(r))) != MP_OK) { mp_int_clear(MP_NUMER_P(r)); return res; } return mp_int_set_value(MP_DENOM_P(r), 1); } mp_rat mp_rat_alloc(void) { mp_rat out = malloc(sizeof(*out)); if (out != NULL) { if (mp_rat_init(out) != MP_OK) { free(out); return NULL; } } return out; } mp_result mp_rat_reduce(mp_rat r) { return s_rat_reduce(r); } mp_result mp_rat_init_size(mp_rat r, mp_size n_prec, mp_size d_prec) { mp_result res; if ((res = mp_int_init_size(MP_NUMER_P(r), n_prec)) != MP_OK) return res; if ((res = mp_int_init_size(MP_DENOM_P(r), d_prec)) != MP_OK) { mp_int_clear(MP_NUMER_P(r)); return res; } return mp_int_set_value(MP_DENOM_P(r), 1); } mp_result mp_rat_init_copy(mp_rat r, mp_rat old) { mp_result res; if ((res = mp_int_init_copy(MP_NUMER_P(r), MP_NUMER_P(old))) != MP_OK) return res; if ((res = mp_int_init_copy(MP_DENOM_P(r), MP_DENOM_P(old))) != MP_OK) mp_int_clear(MP_NUMER_P(r)); return res; } mp_result mp_rat_set_value(mp_rat r, mp_small numer, mp_small denom) { mp_result res; if (denom == 0) return MP_UNDEF; if ((res = mp_int_set_value(MP_NUMER_P(r), numer)) != MP_OK) return res; if ((res = mp_int_set_value(MP_DENOM_P(r), denom)) != MP_OK) return res; return s_rat_reduce(r); } mp_result mp_rat_set_uvalue(mp_rat r, mp_usmall numer, mp_usmall denom) { mp_result res; if (denom == 0) return MP_UNDEF; if ((res = mp_int_set_uvalue(MP_NUMER_P(r), numer)) != MP_OK) return res; if ((res = mp_int_set_uvalue(MP_DENOM_P(r), denom)) != MP_OK) return res; return s_rat_reduce(r); } void mp_rat_clear(mp_rat r) { mp_int_clear(MP_NUMER_P(r)); mp_int_clear(MP_DENOM_P(r)); } void mp_rat_free(mp_rat r) { NRCHECK(r != NULL); if (r->num.digits != NULL) mp_rat_clear(r); free(r); } mp_result mp_rat_numer(mp_rat r, mp_int z) { return mp_int_copy(MP_NUMER_P(r), z); } mp_int mp_rat_numer_ref(mp_rat r) { return MP_NUMER_P(r); } mp_result mp_rat_denom(mp_rat r, mp_int z) { return mp_int_copy(MP_DENOM_P(r), z); } mp_int mp_rat_denom_ref(mp_rat r) { return MP_DENOM_P(r); } mp_sign mp_rat_sign(mp_rat r) { return MP_SIGN(MP_NUMER_P(r)); } mp_result mp_rat_copy(mp_rat a, mp_rat c) { mp_result res; if ((res = mp_int_copy(MP_NUMER_P(a), MP_NUMER_P(c))) != MP_OK) return res; res = mp_int_copy(MP_DENOM_P(a), MP_DENOM_P(c)); return res; } void mp_rat_zero(mp_rat r) { mp_int_zero(MP_NUMER_P(r)); mp_int_set_value(MP_DENOM_P(r), 1); } mp_result mp_rat_abs(mp_rat a, mp_rat c) { mp_result res; if ((res = mp_int_abs(MP_NUMER_P(a), MP_NUMER_P(c))) != MP_OK) return res; res = mp_int_abs(MP_DENOM_P(a), MP_DENOM_P(c)); return res; } mp_result mp_rat_neg(mp_rat a, mp_rat c) { mp_result res; if ((res = mp_int_neg(MP_NUMER_P(a), MP_NUMER_P(c))) != MP_OK) return res; res = mp_int_copy(MP_DENOM_P(a), MP_DENOM_P(c)); return res; } mp_result mp_rat_recip(mp_rat a, mp_rat c) { mp_result res; if (mp_rat_compare_zero(a) == 0) return MP_UNDEF; if ((res = mp_rat_copy(a, c)) != MP_OK) return res; mp_int_swap(MP_NUMER_P(c), MP_DENOM_P(c)); /* Restore the signs of the swapped elements */ { mp_sign tmp = MP_SIGN(MP_NUMER_P(c)); MP_SIGN(MP_NUMER_P(c)) = MP_SIGN(MP_DENOM_P(c)); MP_SIGN(MP_DENOM_P(c)) = tmp; } return MP_OK; } mp_result mp_rat_add(mp_rat a, mp_rat b, mp_rat c) { return s_rat_combine(a, b, c, mp_int_add); } mp_result mp_rat_sub(mp_rat a, mp_rat b, mp_rat c) { return s_rat_combine(a, b, c, mp_int_sub); } mp_result mp_rat_mul(mp_rat a, mp_rat b, mp_rat c) { mp_result res; if ((res = mp_int_mul(MP_NUMER_P(a), MP_NUMER_P(b), MP_NUMER_P(c))) != MP_OK) return res; if (mp_int_compare_zero(MP_NUMER_P(c)) != 0) { if ((res = mp_int_mul(MP_DENOM_P(a), MP_DENOM_P(b), MP_DENOM_P(c))) != MP_OK) return res; } return s_rat_reduce(c); } mp_result mp_rat_div(mp_rat a, mp_rat b, mp_rat c) { mp_result res = MP_OK; if (mp_rat_compare_zero(b) == 0) return MP_UNDEF; if (c == a || c == b) { mpz_t tmp; if ((res = mp_int_init(&tmp)) != MP_OK) return res; if ((res = mp_int_mul(MP_NUMER_P(a), MP_DENOM_P(b), &tmp)) != MP_OK) goto CLEANUP; if ((res = mp_int_mul(MP_DENOM_P(a), MP_NUMER_P(b), MP_DENOM_P(c))) != MP_OK) goto CLEANUP; res = mp_int_copy(&tmp, MP_NUMER_P(c)); CLEANUP: mp_int_clear(&tmp); } else { if ((res = mp_int_mul(MP_NUMER_P(a), MP_DENOM_P(b), MP_NUMER_P(c))) != MP_OK) return res; if ((res = mp_int_mul(MP_DENOM_P(a), MP_NUMER_P(b), MP_DENOM_P(c))) != MP_OK) return res; } if (res != MP_OK) return res; else return s_rat_reduce(c); } mp_result mp_rat_add_int(mp_rat a, mp_int b, mp_rat c) { mpz_t tmp; mp_result res; if ((res = mp_int_init_copy(&tmp, b)) != MP_OK) return res; if ((res = mp_int_mul(&tmp, MP_DENOM_P(a), &tmp)) != MP_OK) goto CLEANUP; if ((res = mp_rat_copy(a, c)) != MP_OK) goto CLEANUP; if ((res = mp_int_add(MP_NUMER_P(c), &tmp, MP_NUMER_P(c))) != MP_OK) goto CLEANUP; res = s_rat_reduce(c); CLEANUP: mp_int_clear(&tmp); return res; } mp_result mp_rat_sub_int(mp_rat a, mp_int b, mp_rat c) { mpz_t tmp; mp_result res; if ((res = mp_int_init_copy(&tmp, b)) != MP_OK) return res; if ((res = mp_int_mul(&tmp, MP_DENOM_P(a), &tmp)) != MP_OK) goto CLEANUP; if ((res = mp_rat_copy(a, c)) != MP_OK) goto CLEANUP; if ((res = mp_int_sub(MP_NUMER_P(c), &tmp, MP_NUMER_P(c))) != MP_OK) goto CLEANUP; res = s_rat_reduce(c); CLEANUP: mp_int_clear(&tmp); return res; } mp_result mp_rat_mul_int(mp_rat a, mp_int b, mp_rat c) { mp_result res; if ((res = mp_rat_copy(a, c)) != MP_OK) return res; if ((res = mp_int_mul(MP_NUMER_P(c), b, MP_NUMER_P(c))) != MP_OK) return res; return s_rat_reduce(c); } mp_result mp_rat_div_int(mp_rat a, mp_int b, mp_rat c) { mp_result res; if (mp_int_compare_zero(b) == 0) return MP_UNDEF; if ((res = mp_rat_copy(a, c)) != MP_OK) return res; if ((res = mp_int_mul(MP_DENOM_P(c), b, MP_DENOM_P(c))) != MP_OK) return res; return s_rat_reduce(c); } mp_result mp_rat_expt(mp_rat a, mp_small b, mp_rat c) { mp_result res; /* Special cases for easy powers. */ if (b == 0) return mp_rat_set_value(c, 1, 1); else if(b == 1) return mp_rat_copy(a, c); /* Since rationals are always stored in lowest terms, it is not necessary to reduce again when raising to an integer power. */ if ((res = mp_int_expt(MP_NUMER_P(a), b, MP_NUMER_P(c))) != MP_OK) return res; return mp_int_expt(MP_DENOM_P(a), b, MP_DENOM_P(c)); } int mp_rat_compare(mp_rat a, mp_rat b) { /* Quick check for opposite signs. Works because the sign of the numerator is always definitive. */ if (MP_SIGN(MP_NUMER_P(a)) != MP_SIGN(MP_NUMER_P(b))) { if (MP_SIGN(MP_NUMER_P(a)) == MP_ZPOS) return 1; else return -1; } else { /* Compare absolute magnitudes; if both are positive, the answer stands, otherwise it needs to be reflected about zero. */ int cmp = mp_rat_compare_unsigned(a, b); if (MP_SIGN(MP_NUMER_P(a)) == MP_ZPOS) return cmp; else return -cmp; } } int mp_rat_compare_unsigned(mp_rat a, mp_rat b) { /* If the denominators are equal, we can quickly compare numerators without multiplying. Otherwise, we actually have to do some work. */ if (mp_int_compare_unsigned(MP_DENOM_P(a), MP_DENOM_P(b)) == 0) return mp_int_compare_unsigned(MP_NUMER_P(a), MP_NUMER_P(b)); else { mpz_t temp[2]; mp_result res; int cmp = INT_MAX, last = 0; /* t0 = num(a) * den(b), t1 = num(b) * den(a) */ SETUP(mp_int_init_copy(TEMP(last), MP_NUMER_P(a)), last); SETUP(mp_int_init_copy(TEMP(last), MP_NUMER_P(b)), last); if ((res = mp_int_mul(TEMP(0), MP_DENOM_P(b), TEMP(0))) != MP_OK || (res = mp_int_mul(TEMP(1), MP_DENOM_P(a), TEMP(1))) != MP_OK) goto CLEANUP; cmp = mp_int_compare_unsigned(TEMP(0), TEMP(1)); CLEANUP: while (--last >= 0) mp_int_clear(TEMP(last)); return cmp; } } int mp_rat_compare_zero(mp_rat r) { return mp_int_compare_zero(MP_NUMER_P(r)); } int mp_rat_compare_value(mp_rat r, mp_small n, mp_small d) { mpq_t tmp; mp_result res; int out = INT_MAX; if ((res = mp_rat_init(&tmp)) != MP_OK) return out; if ((res = mp_rat_set_value(&tmp, n, d)) != MP_OK) goto CLEANUP; out = mp_rat_compare(r, &tmp); CLEANUP: mp_rat_clear(&tmp); return out; } int mp_rat_is_integer(mp_rat r) { return (mp_int_compare_value(MP_DENOM_P(r), 1) == 0); } mp_result mp_rat_to_ints(mp_rat r, mp_small *num, mp_small *den) { mp_result res; if ((res = mp_int_to_int(MP_NUMER_P(r), num)) != MP_OK) return res; res = mp_int_to_int(MP_DENOM_P(r), den); return res; } mp_result mp_rat_to_string(mp_rat r, mp_size radix, char *str, int limit) { char *start; int len; mp_result res; /* Write the numerator. The sign of the rational number is written by the underlying integer implementation. */ if ((res = mp_int_to_string(MP_NUMER_P(r), radix, str, limit)) != MP_OK) return res; /* If the value is zero, don't bother writing any denominator */ if (mp_int_compare_zero(MP_NUMER_P(r)) == 0) return MP_OK; /* Locate the end of the numerator, and make sure we are not going to exceed the limit by writing a slash. */ len = strlen(str); start = str + len; limit -= len; if(limit == 0) return MP_TRUNC; *start++ = '/'; limit -= 1; res = mp_int_to_string(MP_DENOM_P(r), radix, start, limit); return res; } mp_result mp_rat_to_decimal(mp_rat r, mp_size radix, mp_size prec, mp_round_mode round, char *str, int limit) { mpz_t temp[3]; mp_result res; char *start = str; int len, lead_0, left = limit, last = 0; SETUP(mp_int_init_copy(TEMP(last), MP_NUMER_P(r)), last); SETUP(mp_int_init(TEMP(last)), last); SETUP(mp_int_init(TEMP(last)), last); /* Get the unsigned integer part by dividing denominator into the absolute value of the numerator. */ mp_int_abs(TEMP(0), TEMP(0)); if ((res = mp_int_div(TEMP(0), MP_DENOM_P(r), TEMP(0), TEMP(1))) != MP_OK) goto CLEANUP; /* Now: T0 = integer portion, unsigned; T1 = remainder, from which fractional part is computed. */ /* Count up leading zeroes after the radix point. */ for (lead_0 = 0; lead_0 < prec && mp_int_compare(TEMP(1), MP_DENOM_P(r)) < 0; ++lead_0) { if ((res = mp_int_mul_value(TEMP(1), radix, TEMP(1))) != MP_OK) goto CLEANUP; } /* Multiply remainder by a power of the radix sufficient to get the right number of significant figures. */ if (prec > lead_0) { if ((res = mp_int_expt_value(radix, prec - lead_0, TEMP(2))) != MP_OK) goto CLEANUP; if ((res = mp_int_mul(TEMP(1), TEMP(2), TEMP(1))) != MP_OK) goto CLEANUP; } if ((res = mp_int_div(TEMP(1), MP_DENOM_P(r), TEMP(1), TEMP(2))) != MP_OK) goto CLEANUP; /* Now: T1 = significant digits of fractional part; T2 = leftovers, to use for rounding. At this point, what we do depends on the rounding mode. The default is MP_ROUND_DOWN, for which everything is as it should be already. */ switch (round) { int cmp; case MP_ROUND_UP: if (mp_int_compare_zero(TEMP(2)) != 0) { if (prec == 0) res = mp_int_add_value(TEMP(0), 1, TEMP(0)); else res = mp_int_add_value(TEMP(1), 1, TEMP(1)); } break; case MP_ROUND_HALF_UP: case MP_ROUND_HALF_DOWN: if ((res = mp_int_mul_pow2(TEMP(2), 1, TEMP(2))) != MP_OK) goto CLEANUP; cmp = mp_int_compare(TEMP(2), MP_DENOM_P(r)); if (round == MP_ROUND_HALF_UP) cmp += 1; if (cmp > 0) { if (prec == 0) res = mp_int_add_value(TEMP(0), 1, TEMP(0)); else res = mp_int_add_value(TEMP(1), 1, TEMP(1)); } break; case MP_ROUND_DOWN: break; /* No action required */ default: return MP_BADARG; /* Invalid rounding specifier */ } /* The sign of the output should be the sign of the numerator, but if all the displayed digits will be zero due to the precision, a negative shouldn't be shown. */ if (MP_SIGN(MP_NUMER_P(r)) == MP_NEG && (mp_int_compare_zero(TEMP(0)) != 0 || mp_int_compare_zero(TEMP(1)) != 0)) { *start++ = '-'; left -= 1; } if ((res = mp_int_to_string(TEMP(0), radix, start, left)) != MP_OK) goto CLEANUP; len = strlen(start); start += len; left -= len; if (prec == 0) goto CLEANUP; *start++ = '.'; left -= 1; if (left < prec + 1) { res = MP_TRUNC; goto CLEANUP; } memset(start, '0', lead_0 - 1); left -= lead_0; start += lead_0 - 1; res = mp_int_to_string(TEMP(1), radix, start, left); CLEANUP: while (--last >= 0) mp_int_clear(TEMP(last)); return res; } mp_result mp_rat_string_len(mp_rat r, mp_size radix) { mp_result n_len, d_len = 0; n_len = mp_int_string_len(MP_NUMER_P(r), radix); if (mp_int_compare_zero(MP_NUMER_P(r)) != 0) d_len = mp_int_string_len(MP_DENOM_P(r), radix); /* Though simplistic, this formula is correct. Space for the sign flag is included in n_len, and the space for the NUL that is counted in n_len counts for the separator here. The space for the NUL counted in d_len counts for the final terminator here. */ return n_len + d_len; } mp_result mp_rat_decimal_len(mp_rat r, mp_size radix, mp_size prec) { int z_len, f_len; z_len = mp_int_string_len(MP_NUMER_P(r), radix); if (prec == 0) f_len = 1; /* terminator only */ else f_len = 1 + prec + 1; /* decimal point, digits, terminator */ return z_len + f_len; } mp_result mp_rat_read_string(mp_rat r, mp_size radix, const char *str) { return mp_rat_read_cstring(r, radix, str, NULL); } mp_result mp_rat_read_cstring(mp_rat r, mp_size radix, const char *str, char **end) { mp_result res; char *endp; if ((res = mp_int_read_cstring(MP_NUMER_P(r), radix, str, &endp)) != MP_OK && (res != MP_TRUNC)) return res; /* Skip whitespace between numerator and (possible) separator */ while (isspace((unsigned char) *endp)) ++endp; /* If there is no separator, we will stop reading at this point. */ if (*endp != '/') { mp_int_set_value(MP_DENOM_P(r), 1); if (end != NULL) *end = endp; return res; } ++endp; /* skip separator */ if ((res = mp_int_read_cstring(MP_DENOM_P(r), radix, endp, end)) != MP_OK) return res; /* Make sure the value is well-defined */ if (mp_int_compare_zero(MP_DENOM_P(r)) == 0) return MP_UNDEF; /* Reduce to lowest terms */ return s_rat_reduce(r); } /* Read a string and figure out what format it's in. The radix may be supplied as zero to use "default" behaviour. This function will accept either a/b notation or decimal notation. */ mp_result mp_rat_read_ustring(mp_rat r, mp_size radix, const char *str, char **end) { char *endp; mp_result res; if (radix == 0) radix = 10; /* default to decimal input */ if ((res = mp_rat_read_cstring(r, radix, str, &endp)) != MP_OK) { if (res == MP_TRUNC) { if (*endp == '.') res = mp_rat_read_cdecimal(r, radix, str, &endp); } else return res; } if (end != NULL) *end = endp; return res; } mp_result mp_rat_read_decimal(mp_rat r, mp_size radix, const char *str) { return mp_rat_read_cdecimal(r, radix, str, NULL); } mp_result mp_rat_read_cdecimal(mp_rat r, mp_size radix, const char *str, char **end) { mp_result res; mp_sign osign; char *endp; while (isspace((unsigned char) *str)) ++str; switch (*str) { case '-': osign = MP_NEG; break; default: osign = MP_ZPOS; } if ((res = mp_int_read_cstring(MP_NUMER_P(r), radix, str, &endp)) != MP_OK && (res != MP_TRUNC)) return res; /* This needs to be here. */ (void) mp_int_set_value(MP_DENOM_P(r), 1); if (*endp != '.') { if (end != NULL) *end = endp; return res; } /* If the character following the decimal point is whitespace or a sign flag, we will consider this a truncated value. This special case is because mp_int_read_string() will consider whitespace or sign flags to be valid starting characters for a value, and we do not want them following the decimal point. Once we have done this check, it is safe to read in the value of the fractional piece as a regular old integer. */ ++endp; if (*endp == '\0') { if (end != NULL) *end = endp; return MP_OK; } else if(isspace((unsigned char) *endp) || *endp == '-' || *endp == '+') { return MP_TRUNC; } else { mpz_t frac; mp_result save_res; char *save = endp; int num_lz = 0; /* Make a temporary to hold the part after the decimal point. */ if ((res = mp_int_init(&frac)) != MP_OK) return res; if ((res = mp_int_read_cstring(&frac, radix, endp, &endp)) != MP_OK && (res != MP_TRUNC)) goto CLEANUP; /* Save this response for later. */ save_res = res; if (mp_int_compare_zero(&frac) == 0) goto FINISHED; /* Discard trailing zeroes (somewhat inefficiently) */ while (mp_int_divisible_value(&frac, radix)) if ((res = mp_int_div_value(&frac, radix, &frac, NULL)) != MP_OK) goto CLEANUP; /* Count leading zeros after the decimal point */ while (save[num_lz] == '0') ++num_lz; /* Find the least power of the radix that is at least as large as the significant value of the fractional part, ignoring leading zeroes. */ (void) mp_int_set_value(MP_DENOM_P(r), radix); while (mp_int_compare(MP_DENOM_P(r), &frac) < 0) { if ((res = mp_int_mul_value(MP_DENOM_P(r), radix, MP_DENOM_P(r))) != MP_OK) goto CLEANUP; } /* Also shift by enough to account for leading zeroes */ while (num_lz > 0) { if ((res = mp_int_mul_value(MP_DENOM_P(r), radix, MP_DENOM_P(r))) != MP_OK) goto CLEANUP; --num_lz; } /* Having found this power, shift the numerator leftward that many, digits, and add the nonzero significant digits of the fractional part to get the result. */ if ((res = mp_int_mul(MP_NUMER_P(r), MP_DENOM_P(r), MP_NUMER_P(r))) != MP_OK) goto CLEANUP; { /* This addition needs to be unsigned. */ MP_SIGN(MP_NUMER_P(r)) = MP_ZPOS; if ((res = mp_int_add(MP_NUMER_P(r), &frac, MP_NUMER_P(r))) != MP_OK) goto CLEANUP; MP_SIGN(MP_NUMER_P(r)) = osign; } if ((res = s_rat_reduce(r)) != MP_OK) goto CLEANUP; /* At this point, what we return depends on whether reading the fractional part was truncated or not. That information is saved from when we called mp_int_read_string() above. */ FINISHED: res = save_res; if (end != NULL) *end = endp; CLEANUP: mp_int_clear(&frac); return res; } } /* Private functions for internal use. Make unchecked assumptions about format and validity of inputs. */ static mp_result s_rat_reduce(mp_rat r) { mpz_t gcd; mp_result res = MP_OK; if (mp_int_compare_zero(MP_NUMER_P(r)) == 0) { mp_int_set_value(MP_DENOM_P(r), 1); return MP_OK; } /* If the greatest common divisor of the numerator and denominator is greater than 1, divide it out. */ if ((res = mp_int_init(&gcd)) != MP_OK) return res; if ((res = mp_int_gcd(MP_NUMER_P(r), MP_DENOM_P(r), &gcd)) != MP_OK) goto CLEANUP; if (mp_int_compare_value(&gcd, 1) != 0) { if ((res = mp_int_div(MP_NUMER_P(r), &gcd, MP_NUMER_P(r), NULL)) != MP_OK) goto CLEANUP; if ((res = mp_int_div(MP_DENOM_P(r), &gcd, MP_DENOM_P(r), NULL)) != MP_OK) goto CLEANUP; } /* Fix up the signs of numerator and denominator */ if (MP_SIGN(MP_NUMER_P(r)) == MP_SIGN(MP_DENOM_P(r))) MP_SIGN(MP_NUMER_P(r)) = MP_SIGN(MP_DENOM_P(r)) = MP_ZPOS; else { MP_SIGN(MP_NUMER_P(r)) = MP_NEG; MP_SIGN(MP_DENOM_P(r)) = MP_ZPOS; } CLEANUP: mp_int_clear(&gcd); return res; } static mp_result s_rat_combine(mp_rat a, mp_rat b, mp_rat c, mp_result (*comb_f)(mp_int, mp_int, mp_int)) { mp_result res; /* Shortcut when denominators are already common */ if (mp_int_compare(MP_DENOM_P(a), MP_DENOM_P(b)) == 0) { if ((res = (comb_f)(MP_NUMER_P(a), MP_NUMER_P(b), MP_NUMER_P(c))) != MP_OK) return res; if ((res = mp_int_copy(MP_DENOM_P(a), MP_DENOM_P(c))) != MP_OK) return res; return s_rat_reduce(c); } else { mpz_t temp[2]; int last = 0; SETUP(mp_int_init_copy(TEMP(last), MP_NUMER_P(a)), last); SETUP(mp_int_init_copy(TEMP(last), MP_NUMER_P(b)), last); if ((res = mp_int_mul(TEMP(0), MP_DENOM_P(b), TEMP(0))) != MP_OK) goto CLEANUP; if ((res = mp_int_mul(TEMP(1), MP_DENOM_P(a), TEMP(1))) != MP_OK) goto CLEANUP; if ((res = (comb_f)(TEMP(0), TEMP(1), MP_NUMER_P(c))) != MP_OK) goto CLEANUP; res = mp_int_mul(MP_DENOM_P(a), MP_DENOM_P(b), MP_DENOM_P(c)); CLEANUP: while (--last >= 0) mp_int_clear(TEMP(last)); if (res == MP_OK) return s_rat_reduce(c); else return res; } } /* Here there be dragons */ cloog-0.18.4/isl/imath/gmp_compat.c0000644000175000017500000005506212555415003014023 00000000000000/* Name: gmp_compat.c Purpose: Provide GMP compatiable routines for imath library Author: David Peixotto Copyright (c) 2012 Qualcomm Innovation Center, Inc. All rights reserved. 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 "gmp_compat.h" #include #include #include #include #ifdef NDEBUG #define CHECK(res) (res) #else #define CHECK(res) assert(((res) == MP_OK) && "expected MP_OK") #endif /************************************************************************* * * Functions with direct translations * *************************************************************************/ /* gmp: mpq_clear */ void GMPQAPI(clear)(mp_rat x) { mp_rat_clear(x); } /* gmp: mpq_cmp */ int GMPQAPI(cmp)(mp_rat op1, mp_rat op2) { return mp_rat_compare(op1, op2); } /* gmp: mpq_init */ void GMPQAPI(init)(mp_rat x) { CHECK(mp_rat_init(x)); } /* gmp: mpq_mul */ void GMPQAPI(mul)(mp_rat product, mp_rat multiplier, mp_rat multiplicand) { CHECK(mp_rat_mul(multiplier, multiplicand, product)); } /* gmp: mpq_set*/ void GMPQAPI(set)(mp_rat rop, mp_rat op) { CHECK(mp_rat_copy(op, rop)); } /* gmp: mpz_abs */ void GMPZAPI(abs)(mp_int rop, mp_int op) { CHECK(mp_int_abs(op, rop)); } /* gmp: mpz_add */ void GMPZAPI(add)(mp_int rop, mp_int op1, mp_int op2) { CHECK(mp_int_add(op1, op2, rop)); } /* gmp: mpz_clear */ void GMPZAPI(clear)(mp_int x) { mp_int_clear(x); } /* gmp: mpz_cmp_si */ int GMPZAPI(cmp_si)(mp_int op1, long op2) { return mp_int_compare_value(op1, op2); } /* gmp: mpz_cmpabs */ int GMPZAPI(cmpabs)(mp_int op1, mp_int op2) { return mp_int_compare_unsigned(op1, op2); } /* gmp: mpz_cmp */ int GMPZAPI(cmp)(mp_int op1, mp_int op2) { return mp_int_compare(op1, op2); } /* gmp: mpz_init */ void GMPZAPI(init)(mp_int x) { CHECK(mp_int_init(x)); } /* gmp: mpz_mul */ void GMPZAPI(mul)(mp_int rop, mp_int op1, mp_int op2) { CHECK(mp_int_mul(op1, op2, rop)); } /* gmp: mpz_neg */ void GMPZAPI(neg)(mp_int rop, mp_int op) { CHECK(mp_int_neg(op, rop)); } /* gmp: mpz_set_si */ void GMPZAPI(set_si)(mp_int rop, long op) { CHECK(mp_int_set_value(rop, op)); } /* gmp: mpz_set */ void GMPZAPI(set)(mp_int rop, mp_int op) { CHECK(mp_int_copy(op, rop)); } /* gmp: mpz_sub */ void GMPZAPI(sub)(mp_int rop, mp_int op1, mp_int op2) { CHECK(mp_int_sub(op1, op2, rop)); } /* gmp: mpz_swap */ void GMPZAPI(swap)(mp_int rop1, mp_int rop2) { mp_int_swap(rop1, rop2); } /* gmp: mpq_sgn */ int GMPQAPI(sgn)(mp_rat op) { return mp_rat_compare_zero(op); } /* gmp: mpz_sgn */ int GMPZAPI(sgn)(mp_int op) { return mp_int_compare_zero(op); } /* gmp: mpq_set_ui */ void GMPQAPI(set_ui)(mp_rat rop, unsigned long op1, unsigned long op2) { CHECK(mp_rat_set_uvalue(rop, op1, op2)); } /* gmp: mpz_set_ui */ void GMPZAPI(set_ui)(mp_int rop, unsigned long op) { CHECK(mp_int_set_uvalue(rop, op)); } /* gmp: mpq_den_ref */ mp_int GMPQAPI(denref)(mp_rat op) { return mp_rat_denom_ref(op); } /* gmp: mpq_num_ref */ mp_int GMPQAPI(numref)(mp_rat op) { return mp_rat_numer_ref(op); } /* gmp: mpq_canonicalize */ void GMPQAPI(canonicalize)(mp_rat op) { CHECK(mp_rat_reduce(op)); } /************************************************************************* * * Functions that can be implemented as a combination of imath functions * *************************************************************************/ /* gmp: mpz_addmul */ /* gmp: rop = rop + (op1 * op2) */ void GMPZAPI(addmul)(mp_int rop, mp_int op1, mp_int op2) { mpz_t tempz; mp_int temp = &tempz; mp_int_init(temp); CHECK(mp_int_mul(op1, op2, temp)); CHECK(mp_int_add(rop, temp, rop)); mp_int_clear(temp); } /* gmp: mpz_divexact */ /* gmp: only produces correct results when d divides n */ void GMPZAPI(divexact)(mp_int q, mp_int n, mp_int d) { CHECK(mp_int_div(n, d, q, NULL)); } /* gmp: mpz_divisible_p */ /* gmp: return 1 if d divides n, 0 otherwise */ /* gmp: 0 is considered to divide 0*/ int GMPZAPI(divisible_p)(mp_int n, mp_int d) { /* variables to hold remainder */ mpz_t rz; mp_int r = &rz; int r_is_zero; /* check for n = 0, d = 0 */ int n_is_zero = mp_int_compare_zero(n) == 0; int d_is_zero = mp_int_compare_zero(d) == 0; if (n_is_zero && d_is_zero) return 1; /* return true if remainder is 0 */ CHECK(mp_int_init(r)); CHECK(mp_int_div(n, d, NULL, r)); r_is_zero = mp_int_compare_zero(r) == 0; mp_int_clear(r); return r_is_zero; } /* gmp: mpz_submul */ /* gmp: rop = rop - (op1 * op2) */ void GMPZAPI(submul)(mp_int rop, mp_int op1, mp_int op2) { mpz_t tempz; mp_int temp = &tempz; mp_int_init(temp); CHECK(mp_int_mul(op1, op2, temp)); CHECK(mp_int_sub(rop, temp, rop)); mp_int_clear(temp); } /* gmp: mpz_add_ui */ void GMPZAPI(add_ui)(mp_int rop, mp_int op1, unsigned long op2) { mpz_t tempz; mp_int temp = &tempz; CHECK(mp_int_init_uvalue(temp, op2)); CHECK(mp_int_add(op1, temp, rop)); mp_int_clear(temp); } /* gmp: mpz_divexact_ui */ /* gmp: only produces correct results when d divides n */ void GMPZAPI(divexact_ui)(mp_int q, mp_int n, unsigned long d) { mpz_t tempz; mp_int temp = &tempz; CHECK(mp_int_init_uvalue(temp, d)); CHECK(mp_int_div(n, temp, q, NULL)); mp_int_clear(temp); } /* gmp: mpz_mul_ui */ void GMPZAPI(mul_ui)(mp_int rop, mp_int op1, unsigned long op2) { mpz_t tempz; mp_int temp = &tempz; CHECK(mp_int_init_uvalue(temp, op2)); CHECK(mp_int_mul(op1, temp, rop)); mp_int_clear(temp); } /* gmp: mpz_pow_ui */ /* gmp: 0^0 = 1 */ void GMPZAPI(pow_ui)(mp_int rop, mp_int base, unsigned long exp) { mpz_t tempz; mp_int temp = &tempz; /* check for 0^0 */ if (exp == 0 && mp_int_compare_zero(base) == 0) { CHECK(mp_int_set_value(rop, 1)); return; } /* rop = base^exp */ CHECK(mp_int_init_uvalue(temp, exp)); CHECK(mp_int_expt_full(base, temp, rop)); mp_int_clear(temp); } /* gmp: mpz_sub_ui */ void GMPZAPI(sub_ui)(mp_int rop, mp_int op1, unsigned long op2) { mpz_t tempz; mp_int temp = &tempz; CHECK(mp_int_init_uvalue(temp, op2)); CHECK(mp_int_sub(op1, temp, rop)); mp_int_clear(temp); } /************************************************************************* * * Functions with different behavior in corner cases * *************************************************************************/ /* gmp: mpz_gcd */ void GMPZAPI(gcd)(mp_int rop, mp_int op1, mp_int op2) { int op1_is_zero = mp_int_compare_zero(op1) == 0; int op2_is_zero = mp_int_compare_zero(op2) == 0; if (op1_is_zero && op2_is_zero) { mp_int_zero(rop); return; } CHECK(mp_int_gcd(op1, op2, rop)); } /* gmp: mpz_get_str */ char* GMPZAPI(get_str)(char *str, int radix, mp_int op) { int i, r, len; /* Support negative radix like gmp */ r = radix; if (r < 0) r = -r; /* Compute the length of the string needed to hold the int */ len = mp_int_string_len(op, r); if (str == NULL) { str = malloc(len); } /* Convert to string using imath function */ CHECK(mp_int_to_string(op, r, str, len)); /* Change case to match gmp */ for (i = 0; i < len - 1; i++) if (radix < 0) str[i] = toupper(str[i]); else str[i] = tolower(str[i]); return str; } /* gmp: mpq_get_str */ char* GMPQAPI(get_str)(char *str, int radix, mp_rat op) { int i, r, len; /* Only print numerator if it is a whole number */ if (mp_int_compare_value(mp_rat_denom_ref(op), 1) == 0) return GMPZAPI(get_str)(str, radix, mp_rat_numer_ref(op)); /* Support negative radix like gmp */ r = radix; if (r < 0) r = -r; /* Compute the length of the string needed to hold the int */ len = mp_rat_string_len(op, r); if (str == NULL) { str = malloc(len); } /* Convert to string using imath function */ CHECK(mp_rat_to_string(op, r, str, len)); /* Change case to match gmp */ for (i = 0; i < len; i++) if (radix < 0) str[i] = toupper(str[i]); else str[i] = tolower(str[i]); return str; } /* gmp: mpz_set_str */ int GMPZAPI(set_str)(mp_int rop, char *str, int base) { mp_result res = mp_int_read_string(rop, base, str); return ((res == MP_OK) ? 0 : -1); } /* gmp: mpq_set_str */ int GMPQAPI(set_str)(mp_rat rop, char *s, int base) { char *slash; char *str; mp_result resN; mp_result resD; int res = 0; /* Copy string to temporary storage so we can modify it below */ str = malloc(strlen(s)+1); strcpy(str, s); /* Properly format the string as an int by terminating at the / */ slash = strchr(str, '/'); if (slash) *slash = '\0'; /* Parse numerator */ resN = mp_int_read_string(mp_rat_numer_ref(rop), base, str); /* Parse denomenator if given or set to 1 if not */ if (slash) resD = mp_int_read_string(mp_rat_denom_ref(rop), base, slash+1); else resD = mp_int_set_uvalue(mp_rat_denom_ref(rop), 1); /* Return failure if either parse failed */ if (resN != MP_OK || resD != MP_OK) res = -1; free(str); return res; } static unsigned long get_long_bits(mp_int op) { /* Deal with integer that does not fit into unsigned long. We want to grab * the least significant digits that will fit into the long. Read the digits * into the long starting at the most significant digit that fits into a * long. The long is shifted over by MP_DIGIT_BIT before each digit is added. * The shift is decomposed into two steps to follow the patten used in the * rest of the imath library. The two step shift is used to accomedate * architectures that don't deal well with 32-bit shifts. */ mp_size num_digits_in_long = sizeof(unsigned long) / sizeof(mp_digit); mp_digit *digits = MP_DIGITS(op); unsigned long out = 0; int i; for (i = num_digits_in_long - 1; i >= 0; i--) { out <<= (MP_DIGIT_BIT/2); out <<= (MP_DIGIT_BIT/2); out |= digits[i]; } return out; } /* gmp: mpz_get_ui */ unsigned long GMPZAPI(get_ui)(mp_int op) { unsigned long out; /* Try a standard conversion that fits into an unsigned long */ mp_result res = mp_int_to_uint(op, &out); if (res == MP_OK) return out; /* Abort the try if we don't have a range error in the conversion. * The range error indicates that the value cannot fit into a long. */ CHECK(res == MP_RANGE ? MP_OK : MP_RANGE); if (res != MP_RANGE) return 0; return get_long_bits(op); } /* gmp: mpz_get_si */ long GMPZAPI(get_si)(mp_int op) { long out; unsigned long uout; int long_msb; /* Try a standard conversion that fits into a long */ mp_result res = mp_int_to_int(op, &out); if (res == MP_OK) return out; /* Abort the try if we don't have a range error in the conversion. * The range error indicates that the value cannot fit into a long. */ CHECK(res == MP_RANGE ? MP_OK : MP_RANGE); if (res != MP_RANGE) return 0; /* get least significant bits into an unsigned long */ uout = get_long_bits(op); /* clear the top bit */ long_msb = (sizeof(unsigned long) * 8) - 1; uout &= (~(1UL << long_msb)); /* convert to negative if needed based on sign of op */ if (MP_SIGN(op) == MP_NEG) uout = 0 - uout; out = (long) uout; return out; } /* gmp: mpz_lcm */ void GMPZAPI(lcm)(mp_int rop, mp_int op1, mp_int op2) { int op1_is_zero = mp_int_compare_zero(op1) == 0; int op2_is_zero = mp_int_compare_zero(op2) == 0; if (op1_is_zero || op2_is_zero) { mp_int_zero(rop); return; } CHECK(mp_int_lcm(op1, op2, rop)); CHECK(mp_int_abs(rop, rop)); } /* gmp: mpz_mul_2exp */ /* gmp: allow big values for op2 when op1 == 0 */ void GMPZAPI(mul_2exp)(mp_int rop, mp_int op1, unsigned long op2) { if (mp_int_compare_zero(op1) == 0) mp_int_zero(rop); else CHECK(mp_int_mul_pow2(op1, op2, rop)); } /************************************************************************* * * Functions needing expanded functionality * *************************************************************************/ /* [Note]Overview of division implementation All division operations (N / D) compute q and r such that N = q * D + r, with 0 <= abs(r) < abs(d) The q and r values are not uniquely specified by N and D. To specify which q and r values should be used, GMP implements three different rounding modes for integer division: ceiling - round q twords +infinity, r has opposite sign as d floor - round q twords -infinity, r has same sign as d truncate - round q twords zero, r has same sign as n The imath library only supports truncate as a rounding mode. We need to implement the other rounding modes in terms of truncating division. We first perform the division in trucate mode and then adjust q accordingly. Once we know q, we can easily compute the correct r according the the formula above by computing: r = N - q * D The main task is to compute q. We can compute the correct q from a trucated version as follows. For ceiling rounding mode, if q is less than 0 then the truncated rounding mode is the same as the ceiling rounding mode. If q is greater than zero then we need to round q up by one because the truncated version was rounded down to zero. If q equals zero then check to see if the result of the divison is positive. A positive result needs to increment q to one. For floor rounding mode, if q is greater than 0 then the trucated rounding mode is the same as the floor rounding mode. If q is less than zero then we need to round q down by one because the trucated mode rounded q up by one twords zero. If q is zero then we need to check to see if the result of the division is negative. A negative result needs to decrement q to negative one. */ /* gmp: mpz_cdiv_q */ void GMPZAPI(cdiv_q)(mp_int q, mp_int n, mp_int d) { mpz_t rz; mp_int r = &rz; int qsign, rsign, nsign, dsign; CHECK(mp_int_init(r)); /* save signs before division because q can alias with n or d */ nsign = mp_int_compare_zero(n); dsign = mp_int_compare_zero(d); /* truncating division */ CHECK(mp_int_div(n, d, q, r)); /* see: [Note]Overview of division implementation */ qsign = mp_int_compare_zero(q); rsign = mp_int_compare_zero(r); if (qsign > 0) { /* q > 0 */ if (rsign != 0) { /* r != 0 */ CHECK(mp_int_add_value(q, 1, q)); } } else if (qsign == 0) { /* q == 0 */ if (rsign != 0) { /* r != 0 */ if ((nsign > 0 && dsign > 0) || (nsign < 0 && dsign < 0)) { CHECK(mp_int_set_value(q, 1)); } } } mp_int_clear(r); } /* gmp: mpz_fdiv_q */ void GMPZAPI(fdiv_q)(mp_int q, mp_int n, mp_int d) { mpz_t rz; mp_int r = &rz; int qsign, rsign, nsign, dsign; CHECK(mp_int_init(r)); /* save signs before division because q can alias with n or d */ nsign = mp_int_compare_zero(n); dsign = mp_int_compare_zero(d); /* truncating division */ CHECK(mp_int_div(n, d, q, r)); /* see: [Note]Overview of division implementation */ qsign = mp_int_compare_zero(q); rsign = mp_int_compare_zero(r); if (qsign < 0) { /* q < 0 */ if (rsign != 0) { /* r != 0 */ CHECK(mp_int_sub_value(q, 1, q)); } } else if (qsign == 0) { /* q == 0 */ if (rsign != 0) { /* r != 0 */ if ((nsign < 0 && dsign > 0) || (nsign > 0 && dsign < 0)) { CHECK(mp_int_set_value(q, -1)); } } } mp_int_clear(r); } /* gmp: mpz_fdiv_r */ void GMPZAPI(fdiv_r)(mp_int r, mp_int n, mp_int d) { mpz_t qz; mpz_t tempz; mpz_t orig_dz; mpz_t orig_nz; mp_int q = &qz; mp_int temp = &tempz; mp_int orig_d = &orig_dz; mp_int orig_n = &orig_nz; CHECK(mp_int_init(q)); CHECK(mp_int_init(temp)); /* Make a copy of n in case n and d in case they overlap with q */ CHECK(mp_int_init_copy(orig_d, d)); CHECK(mp_int_init_copy(orig_n, n)); /* floor division */ GMPZAPI(fdiv_q)(q, n, d); /* see: [Note]Overview of division implementation */ /* n = q * d + r ==> r = n - q * d */ mp_int_mul(q, orig_d, temp); mp_int_sub(orig_n, temp, r); mp_int_clear(q); mp_int_clear(temp); mp_int_clear(orig_d); mp_int_clear(orig_n); } /* gmp: mpz_tdiv_q */ void GMPZAPI(tdiv_q)(mp_int q, mp_int n, mp_int d) { /* truncating division*/ CHECK(mp_int_div(n, d, q, NULL)); } /* gmp: mpz_fdiv_q_ui */ unsigned long GMPZAPI(fdiv_q_ui)(mp_int q, mp_int n, unsigned long d) { mpz_t tempz; mp_int temp = &tempz; mpz_t rz; mp_int r = &rz; mpz_t orig_nz; mp_int orig_n = &orig_nz; unsigned long rl; CHECK(mp_int_init_uvalue(temp, d)); CHECK(mp_int_init(r)); /* Make a copy of n in case n and q overlap */ CHECK(mp_int_init_copy(orig_n, n)); /* use floor division mode to compute q and r */ GMPZAPI(fdiv_q)(q, n, temp); GMPZAPI(fdiv_r)(r, orig_n, temp); CHECK(mp_int_to_uint(r, &rl)); mp_int_clear(temp); mp_int_clear(r); mp_int_clear(orig_n); return rl; } /* gmp: mpz_export */ void* GMPZAPI(export)(void *rop, size_t *countp, int order, size_t size, int endian, size_t nails, mp_int op) { int i; int num_used_bytes; size_t num_words, num_missing_bytes; unsigned char* dst; unsigned char* src; /* We do not have a complete implementation. Assert to ensure our * restrictions are in place, We do not support big endian output, but do not * check that native endian is little endian. */ assert(nails == 0 && "Do not support non-full words"); assert((endian == 0 || endian == -1) && "Do not support big endian"); /* The gmp API requires that order must be -1 or 1. Not sure how gmp behaves when order is not 1 or -1, so force all non-one values to -1 for now. */ if (order != 1) order = -1; /* Test for zero */ if (mp_int_compare_zero(op) == 0) { if (countp) *countp = 0; return rop; } /* Calculate how many words we need */ num_used_bytes = mp_int_unsigned_len(op); num_words = (num_used_bytes + (size-1)) / size; /* ceil division */ assert(num_used_bytes > 0); /* Check to see if we will have missing bytes in the last word. Missing bytes can only occur when the size of words we output is greater than the size of words used internally by imath. The number of missing bytes is the number of bytes needed to fill out the last word. If this number is greater than the size of a single mp_digit, then we need to pad the word with extra zeros. Otherwise, the missing bytes can be filled directly from the zeros in the last digit in the number. */ num_missing_bytes = (size * num_words) - num_used_bytes; assert(num_missing_bytes < size); /* Allocate space for the result if needed */ if (rop == NULL) { rop = malloc(num_words * size); } /* Initialize dst and src pointers */ dst = (unsigned char *)rop; src = (unsigned char *)MP_DIGITS(op); /* Most significant word first */ if (order == 1) { size_t words_written = 0; src += (num_words-1) * size; /* Handle write of first word specially */ for (i = 0; i < size - num_missing_bytes; i++) dst[i] = src[i]; for (; i < size; i++) dst[i] = 0; dst += size; src -= size; words_written++; for (; words_written < num_words; words_written++) { for (i = 0; i < size; i++) dst[i] = src[i]; dst += size; src -= size; } } /* Least significant word first */ else { size_t words_written = 0; for (; words_written < num_words - 1; words_written++) { for (i = 0; i < size; i++) dst[i] = src[i]; dst += size; src += size; } /* Handle write of last word specially */ for (i = 0; i < size - num_missing_bytes; i++) dst[i] = src[i]; for (; i < size; i++) dst[i] = 0; } if (countp) *countp = num_words; return rop; } /* gmp: mpz_import */ void GMPZAPI(import)(mp_int rop, size_t count, int order, size_t size, int endian, size_t nails, const void* op) { mpz_t tmpz; mp_int tmp = &tmpz; size_t total_size; size_t num_digits; const char *src; char *dst; int i; if (count == 0 || op == NULL) return; /* We do not have a complete implementation. Assert to ensure our * restrictions are in place, We do not support big endian output, but do not * check that native endian is little endian. */ assert(nails == 0 && "Do not support non-full words"); assert((endian == 0 || endian == -1) && "Do not support big endian"); /* Compute number of needed digits by ceil division */ total_size = count * size; num_digits = (total_size + sizeof(mp_digit) - 1) / sizeof(mp_digit); /* Init temporary */ mp_int_init_size(tmp, num_digits); for (i = 0; i < num_digits; i++) tmp->digits[i] = 0; /* Copy bytes */ src = (const char *) op; dst = (char *)MP_DIGITS(tmp); /* Most significant word is first */ if (order == 1) { size_t word; dst += (count - 1) * size; for (word = 0; word < count; word++) { for (i = 0; i < size; i++) dst[i] = src[i]; dst -= size; src += size; } } /* Least significant word is first */ else { size_t word; for (word = 0; word < count; word++) { for (i = 0; i < size; i++) dst[i] = src[i]; dst += size; src += size; } } MP_USED(tmp) = num_digits; /* Remove leading zeros from number */ { mp_size uz_ = MP_USED(tmp); mp_digit *dz_ = MP_DIGITS(tmp) + uz_ -1; while (uz_ > 1 && (*dz_-- == 0)) --uz_; MP_USED(tmp) = uz_; } /* Copy to destination */ mp_int_copy(tmp, rop); mp_int_clear(tmp); } /* gmp: mpz_sizeinbase */ size_t GMPZAPI(sizeinbase)(mp_int op, int base) { mp_result res; size_t size; /* If op == 0, return 1 */ if (mp_int_compare_zero(op) == 0) return 1; /* Compute string length in base */ res = mp_int_string_len(op, base); CHECK((res > 0) == MP_OK); /* Now adjust the final size by getting rid of string artifacts */ size = res; /* subtract one for the null terminator */ size -= 1; /* subtract one for the negative sign */ if (mp_int_compare_zero(op) < 0) size -= 1; return size; } cloog-0.18.4/isl/imath/imrat.h0000644000175000017500000001254212555415003013012 00000000000000/* Name: imrat.h Purpose: Arbitrary precision rational arithmetic routines. Author: M. J. Fromberger Copyright (C) 2002-2007 Michael J. Fromberger, All Rights Reserved. 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. */ #ifndef IMRAT_H_ #define IMRAT_H_ #include "imath.h" #ifdef __cplusplus extern "C" { #endif typedef struct mpq { mpz_t num; /* Numerator */ mpz_t den; /* Denominator, <> 0 */ } mpq_t, *mp_rat; #define MP_NUMER_P(Q) (&((Q)->num)) /* Pointer to numerator */ #define MP_DENOM_P(Q) (&((Q)->den)) /* Pointer to denominator */ /* Rounding constants */ typedef enum { MP_ROUND_DOWN, MP_ROUND_HALF_UP, MP_ROUND_UP, MP_ROUND_HALF_DOWN } mp_round_mode; mp_result mp_rat_init(mp_rat r); mp_rat mp_rat_alloc(void); mp_result mp_rat_reduce(mp_rat r); mp_result mp_rat_init_size(mp_rat r, mp_size n_prec, mp_size d_prec); mp_result mp_rat_init_copy(mp_rat r, mp_rat old); mp_result mp_rat_set_value(mp_rat r, mp_small numer, mp_small denom); mp_result mp_rat_set_uvalue(mp_rat r, mp_usmall numer, mp_usmall denom); void mp_rat_clear(mp_rat r); void mp_rat_free(mp_rat r); mp_result mp_rat_numer(mp_rat r, mp_int z); /* z = num(r) */ mp_int mp_rat_numer_ref(mp_rat r); /* &num(r) */ mp_result mp_rat_denom(mp_rat r, mp_int z); /* z = den(r) */ mp_int mp_rat_denom_ref(mp_rat r); /* &den(r) */ mp_sign mp_rat_sign(mp_rat r); mp_result mp_rat_copy(mp_rat a, mp_rat c); /* c = a */ void mp_rat_zero(mp_rat r); /* r = 0 */ mp_result mp_rat_abs(mp_rat a, mp_rat c); /* c = |a| */ mp_result mp_rat_neg(mp_rat a, mp_rat c); /* c = -a */ mp_result mp_rat_recip(mp_rat a, mp_rat c); /* c = 1 / a */ mp_result mp_rat_add(mp_rat a, mp_rat b, mp_rat c); /* c = a + b */ mp_result mp_rat_sub(mp_rat a, mp_rat b, mp_rat c); /* c = a - b */ mp_result mp_rat_mul(mp_rat a, mp_rat b, mp_rat c); /* c = a * b */ mp_result mp_rat_div(mp_rat a, mp_rat b, mp_rat c); /* c = a / b */ mp_result mp_rat_add_int(mp_rat a, mp_int b, mp_rat c); /* c = a + b */ mp_result mp_rat_sub_int(mp_rat a, mp_int b, mp_rat c); /* c = a - b */ mp_result mp_rat_mul_int(mp_rat a, mp_int b, mp_rat c); /* c = a * b */ mp_result mp_rat_div_int(mp_rat a, mp_int b, mp_rat c); /* c = a / b */ mp_result mp_rat_expt(mp_rat a, mp_small b, mp_rat c); /* c = a ^ b */ int mp_rat_compare(mp_rat a, mp_rat b); /* a <=> b */ int mp_rat_compare_unsigned(mp_rat a, mp_rat b); /* |a| <=> |b| */ int mp_rat_compare_zero(mp_rat r); /* r <=> 0 */ int mp_rat_compare_value(mp_rat r, mp_small n, mp_small d); /* r <=> n/d */ int mp_rat_is_integer(mp_rat r); /* Convert to integers, if representable (returns MP_RANGE if not). */ mp_result mp_rat_to_ints(mp_rat r, mp_small *num, mp_small *den); /* Convert to nul-terminated string with the specified radix, writing at most limit characters including the nul terminator. */ mp_result mp_rat_to_string(mp_rat r, mp_size radix, char *str, int limit); /* Convert to decimal format in the specified radix and precision, writing at most limit characters including a nul terminator. */ mp_result mp_rat_to_decimal(mp_rat r, mp_size radix, mp_size prec, mp_round_mode round, char *str, int limit); /* Return the number of characters required to represent r in the given radix. May over-estimate. */ mp_result mp_rat_string_len(mp_rat r, mp_size radix); /* Return the number of characters required to represent r in decimal format with the given radix and precision. May over-estimate. */ mp_result mp_rat_decimal_len(mp_rat r, mp_size radix, mp_size prec); /* Read zero-terminated string into r */ mp_result mp_rat_read_string(mp_rat r, mp_size radix, const char *str); mp_result mp_rat_read_cstring(mp_rat r, mp_size radix, const char *str, char **end); mp_result mp_rat_read_ustring(mp_rat r, mp_size radix, const char *str, char **end); /* Read zero-terminated string in decimal format into r */ mp_result mp_rat_read_decimal(mp_rat r, mp_size radix, const char *str); mp_result mp_rat_read_cdecimal(mp_rat r, mp_size radix, const char *str, char **end); #ifdef __cplusplus } #endif #endif /* IMRAT_H_ */ cloog-0.18.4/isl/isl_equalities.h0000644000175000017500000000152112413256472013611 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.4/isl/bound.c0000644000175000017500000001520012554427055011701 00000000000000#include #include #include #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 isl_stat 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_val *bound = NULL; isl_val *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); if (vpb->exact && bounded) ok = isl_val_eq(opt, bound); else if (sign > 0) ok = isl_val_le(opt, bound); else ok = isl_val_le(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_val(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_val(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_val_free(bound); isl_val_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) ? isl_stat_ok : isl_stat_error; } 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; 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.4/isl/isl_imath.c0000644000175000017500000000206412554427055012547 00000000000000#include uint32_t isl_imath_hash(mp_int v, uint32_t hash) { unsigned const char *data = (unsigned char *)v->digits; unsigned const char *end = data + v->used * sizeof(v->digits[0]); if (v->sign == 1) isl_hash_byte(hash, 0xFF); for (; data < end; ++data) isl_hash_byte(hash, *data); return hash; } /* Try a standard conversion that fits into a long. */ int isl_imath_fits_slong_p(mp_int op) { long out; mp_result res = mp_int_to_int(op, &out); return res == MP_OK; } /* Try a standard conversion that fits into an unsigned long. */ int isl_imath_fits_ulong_p(mp_int op) { unsigned long out; mp_result res = mp_int_to_uint(op, &out); return res == MP_OK; } void isl_imath_addmul_ui(mp_int rop, mp_int op1, unsigned long op2) { isl_int temp; isl_int_init(temp); isl_int_set_ui(temp, op2); isl_int_addmul(rop, op1, temp); isl_int_clear(temp); } void isl_imath_submul_ui(mp_int rop, mp_int op1, unsigned long op2) { isl_int temp; isl_int_init(temp); isl_int_set_ui(temp, op2); isl_int_submul(rop, op1, temp); isl_int_clear(temp); } cloog-0.18.4/isl/isl_test.c0000644000175000017500000054331212554427055012432 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * Copyright 2010 INRIA Saclay * Copyright 2012-2013 Ecole Normale Superieure * Copyright 2014 INRIA Rocquencourt * * 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 * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt, * B.P. 105 - 78153 Le Chesnay, France */ #include #include #include #include #include #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); } /* Check that we can read an isl_multi_val from "str" without errors. */ static int test_parse_multi_val(isl_ctx *ctx, const char *str) { isl_multi_val *mv; mv = isl_multi_val_read_from_str(ctx, str); isl_multi_val_free(mv); return mv ? 0 : -1; } int test_parse(struct isl_ctx *ctx) { isl_map *map, *map2; const char *str, *str2; if (test_parse_multi_val(ctx, "{ A[B[2] -> C[5, 7]] }") < 0) return -1; if (test_parse_multi_val(ctx, "[n] -> { [2] }") < 0) return -1; if (test_parse_multi_val(ctx, "{ A[4, infty, NaN, -1/2, 2/3] }") < 0) return -1; 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; if (test_parse_map_equal(ctx, "{ [a] -> [a - 1 : a > 0] }", "{ [a] -> [a - 1] : a > 0 }") < 0) return -1; if (test_parse_map_equal(ctx, "{ [a] -> [a - 1 : a > 0; a : a <= 0] }", "{ [a] -> [a - 1] : a > 0; [a] -> [a] : a <= 0 }") < 0) return -1; if (test_parse_map_equal(ctx, "{ [a] -> [(a) * 2 : a >= 0; 0 : a < 0] }", "{ [a] -> [2a] : a >= 0; [a] -> [0] : a < 0 }") < 0) return -1; if (test_parse_map_equal(ctx, "{ [a] -> [(a * 2) : a >= 0; 0 : a < 0] }", "{ [a] -> [2a] : a >= 0; [a] -> [0] : a < 0 }") < 0) return -1; if (test_parse_map_equal(ctx, "{ [a] -> [(a * 2 : a >= 0); 0 : a < 0] }", "{ [a] -> [2a] : a >= 0; [a] -> [0] : a < 0 }") < 0) return -1; if (test_parse_map_equal(ctx, "{ [a] -> [(a * 2 : a >= 0; 0 : a < 0)] }", "{ [a] -> [2a] : a >= 0; [a] -> [0] : a < 0 }") < 0) return -1; return 0; } static int test_read(isl_ctx *ctx) { char *filename; FILE *input; isl_basic_set *bset1, *bset2; const char *str = "{[y]: Exists ( alpha : 2alpha = y)}"; int equal; 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); equal = isl_basic_set_is_equal(bset1, bset2); isl_basic_set_free(bset1); isl_basic_set_free(bset2); free(filename); fclose(input); if (equal < 0) return -1; if (!equal) isl_die(ctx, isl_error_unknown, "read sets not equal", return -1); return 0; } static int test_bounded(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); isl_set_free(set); if (bounded < 0) return -1; if (!bounded) isl_die(ctx, isl_error_unknown, "set not considered bounded", return -1); set = isl_set_read_from_str(ctx, "{[n, i] : 0 <= i <= n }"); bounded = isl_set_is_bounded(set); assert(!bounded); isl_set_free(set); if (bounded < 0) return -1; if (bounded) isl_die(ctx, isl_error_unknown, "set considered bounded", return -1); set = isl_set_read_from_str(ctx, "[n] -> {[i] : i <= n }"); bounded = isl_set_is_bounded(set); isl_set_free(set); if (bounded < 0) return -1; if (bounded) isl_die(ctx, isl_error_unknown, "set considered bounded", return -1); return 0; } /* Construct the basic set { [i] : 5 <= i <= N } */ static int test_construction(isl_ctx *ctx) { isl_int v; isl_space *dim; isl_local_space *ls; isl_basic_set *bset; 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_constraint_alloc_inequality(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_constraint_alloc_inequality(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); return 0; } static int test_dim(isl_ctx *ctx) { const char *str; isl_map *map1, *map2; int equal; 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 ) }"); equal = 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 }"); if (equal >= 0 && equal) 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, "unexpected result", return -1); 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); 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, "unexpected result", return -1); return 0; } 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" }, { &isl_val_inv, "1", "1" }, { &isl_val_inv, "2", "1/2" }, { &isl_val_inv, "1/2", "2" }, { &isl_val_inv, "-2", "-1/2" }, { &isl_val_inv, "-1/2", "-2" }, { &isl_val_inv, "0", "NaN" }, { &isl_val_inv, "NaN", "NaN" }, { &isl_val_inv, "infty", "0" }, { &isl_val_inv, "-infty", "0" }, }; /* 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_constraint_alloc_equality(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_constraint_alloc_equality(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_constraint_alloc_equality(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_constraint_alloc_equality(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_constraint_alloc_equality(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_constraint_alloc_equality(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_constraint_alloc_equality(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_constraint_alloc_equality(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_constraint_alloc_equality(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_constraint_alloc_equality(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_constraint_alloc_equality(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_constraint_alloc_equality(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_constraint_alloc_equality(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_constraint_alloc_equality(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_constraint_alloc_equality(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_constraint_alloc_equality(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_constraint_alloc_equality(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_constraint_alloc_equality(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); } static int test_application(isl_ctx *ctx) { test_application_case(ctx, "application"); test_application_case(ctx, "application2"); return 0; } 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); } struct { const char *set; const char *hull; } convex_hull_tests[] = { { "{ [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) }", "{ [i0, i1, i2] : i0 >= 0 and i2 >= i0 and i2 <= 1 and i1 >= 0 }" }, { "[n] -> { [i0, i1, i0] : i0 <= -4 + n; " "[i0, i0, i2] : n = 6 and i0 >= 0 and i2 <= 7 - i0 and " "i2 <= 5 and i2 >= 4; " "[3, i1, 3] : n = 5 and i1 <= 2 and i1 >= 0 }", "[n] -> { [i0, i1, i2] : i2 <= -1 + n and 2i2 <= -6 + 3n - i0 and " "i2 <= 5 + i0 and i2 >= i0 }" }, { "{ [x, y] : 3y <= 2x and y >= -2 + 2x and 2y >= 2 - x }", "{ [x, y] : 1 = 0 }" }, }; static int test_convex_hull_algo(isl_ctx *ctx, int convex) { int i; 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"); for (i = 0; i < ARRAY_SIZE(convex_hull_tests); ++i) { isl_set *set1, *set2; int equal; set1 = isl_set_read_from_str(ctx, convex_hull_tests[i].set); set2 = isl_set_read_from_str(ctx, convex_hull_tests[i].hull); set1 = isl_set_from_basic_set(isl_set_convex_hull(set1)); 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 convex hull", return -1); } ctx->opt->convex = orig_convex; return 0; } static int test_convex_hull(isl_ctx *ctx) { if (test_convex_hull_algo(ctx, ISL_CONVEX_HULL_FM) < 0) return -1; if (test_convex_hull_algo(ctx, ISL_CONVEX_HULL_WRAP) < 0) return -1; return 0; } 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); } struct { const char *set; const char *context; const char *gist; } gist_tests[] = { { "{ [a, b, c] : a <= 15 and a >= 1 }", "{ [a, b, c] : exists (e0 = floor((-1 + a)/16): a >= 1 and " "c <= 30 and 32e0 >= -62 + 2a + 2b - c and b >= 0) }", "{ [a, b, c] : a <= 15 }" }, { "{ : }", "{ : 1 = 0 }", "{ : }" }, { "{ : 1 = 0 }", "{ : 1 = 0 }", "{ : }" }, { "[M] -> { [x] : exists (e0 = floor((-2 + x)/3): 3e0 = -2 + x) }", "[M] -> { [3M] }" , "[M] -> { [x] : 1 = 0 }" }, { "{ [m, n, a, b] : a <= 2147 + n }", "{ [m, n, a, b] : (m >= 1 and n >= 1 and a <= 2148 - m and " "b <= 2148 - n and b >= 0 and b >= 2149 - n - a) or " "(n >= 1 and a >= 0 and b <= 2148 - n - a and " "b >= 0) }", "{ [m, n, ku, kl] }" }, }; static int test_gist(struct isl_ctx *ctx) { int i; const char *str; isl_basic_set *bset1, *bset2; isl_map *map1, *map2; int equal; for (i = 0; i < ARRAY_SIZE(gist_tests); ++i) { int equal_input; isl_set *set1, *set2, *copy; set1 = isl_set_read_from_str(ctx, gist_tests[i].set); set2 = isl_set_read_from_str(ctx, gist_tests[i].context); copy = isl_set_copy(set1); set1 = isl_set_gist(set1, set2); set2 = isl_set_read_from_str(ctx, gist_tests[i].gist); equal = isl_set_is_equal(set1, set2); isl_set_free(set1); isl_set_free(set2); set1 = isl_set_read_from_str(ctx, gist_tests[i].set); equal_input = isl_set_is_equal(set1, copy); isl_set_free(set1); isl_set_free(copy); if (equal < 0 || equal_input < 0) return -1; if (!equal) isl_die(ctx, isl_error_unknown, "incorrect gist result", return -1); if (!equal_input) isl_die(ctx, isl_error_unknown, "gist modified input", return -1); } 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; } /* Inputs for coalescing tests with unbounded wrapping. * "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_unbounded_tests[] = { { 1, "{ [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, "{ [x,y] : 0 <= x,y <= 10; [5,y]: 4 <= y <= 11 }" }, { 1, "{ [x,0,0] : -5 <= x <= 5; [0,y,1] : -5 <= y <= 5 }" }, { 1, "{ [x,y] : 0 <= x <= 10 and 0 >= y >= -1 and x+y >= 0; [0,1] }" }, { 1, "{ [x,y] : (0 <= x,y <= 4) or (2 <= x,y <= 5 and x + y <= 9) }" }, }; /* Test the functionality of isl_set_coalesce with the bounded wrapping * option turned off. */ int test_coalesce_unbounded_wrapping(isl_ctx *ctx) { int i; int r = 0; int bounded; bounded = isl_options_get_coalesce_bounded_wrapping(ctx); isl_options_set_coalesce_bounded_wrapping(ctx, 0); for (i = 0; i < ARRAY_SIZE(coalesce_unbounded_tests); ++i) { const char *str = coalesce_unbounded_tests[i].str; int check_one = coalesce_unbounded_tests[i].single_disjunct; if (test_coalesce_set(ctx, str, check_one) >= 0) continue; r = -1; break; } 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 }" }, { 1, "{ [0,0]; [1,1] }" }, { 1, "[n] -> { [k] : 16k <= -1 + n and k >= 1; [0] : n >= 2 }" }, { 1, "{ [k, ii, k - ii] : ii >= -6 + k and ii <= 6 and ii >= 1 and " "ii <= k;" "[k, 0, k] : k <= 6 and k >= 1 }" }, { 1, "{ [i,j] : i = 4 j and 0 <= i <= 100;" "[i,j] : 1 <= i <= 100 and i >= 4j + 1 and i <= 4j + 2 }" }, { 1, "{ [x,y] : x % 2 = 0 and y % 2 = 0; [x,x] : x % 2 = 0 }" }, { 1, "[n] -> { [1] : n >= 0;" "[x] : exists (e0 = floor((x)/2): x >= 2 and " "2e0 >= -1 + x and 2e0 <= x and 2e0 <= n) }" }, { 1, "[n] -> { [x, y] : exists (e0 = floor((x)/2), e1 = floor((y)/3): " "3e1 = y and x >= 2 and 2e0 >= -1 + x and " "2e0 <= x and 2e0 <= n);" "[1, y] : exists (e0 = floor((y)/3): 3e0 = y and " "n >= 0) }" }, { 1, "[t1] -> { [i0] : (exists (e0 = floor((63t1)/64): " "128e0 >= -134 + 127t1 and t1 >= 2 and " "64e0 <= 63t1 and 64e0 >= -63 + 63t1)) or " "t1 = 1 }" }, { 1, "{ [i, i] : exists (e0 = floor((1 + 2i)/3): 3e0 <= 2i and " "3e0 >= -1 + 2i and i <= 9 and i >= 1);" "[0, 0] }" }, { 1, "{ [t1] : exists (e0 = floor((-11 + t1)/2): 2e0 = -11 + t1 and " "t1 >= 13 and t1 <= 16);" "[t1] : t1 <= 15 and t1 >= 12 }" }, { 1, "{ [x,y] : x = 3y and 0 <= y <= 2; [-3,-1] }" }, { 1, "{ [x,y] : 2x = 3y and 0 <= y <= 4; [-3,-2] }" }, { 0, "{ [x,y] : 2x = 3y and 0 <= y <= 4; [-2,-2] }" }, { 0, "{ [x,y] : 2x = 3y and 0 <= y <= 4; [-3,-1] }" }, { 1, "{ [i] : exists j : i = 4 j and 0 <= i <= 100;" "[i] : exists j : 1 <= i <= 100 and i >= 4j + 1 and " "i <= 4j + 2 }" }, { 1, "{ [c0] : (exists (e0 : c0 - 1 <= 3e0 <= c0)) or " "(exists (e0 : 3e0 = -2 + c0)) }" }, { 0, "[n, b0, t0] -> " "{ [i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12] : " "(exists (e0 = floor((-32b0 + i4)/1048576), " "e1 = floor((i8)/32): 1048576e0 = -32b0 + i4 and 32e1 = i8 and " "n <= 2147483647 and b0 <= 32767 and b0 >= 0 and " "32b0 <= -2 + n and t0 <= 31 and t0 >= 0 and i0 >= 8 + n and " "3i4 <= -96 + 3t0 + i0 and 3i4 >= -95 - n + 3t0 + i0 and " "i8 >= -157 + i0 - 4i4 and i8 >= 0 and " "i8 <= -33 + i0 - 4i4 and 3i8 <= -91 + 4n - i0)) or " "(exists (e0 = floor((-32b0 + i4)/1048576), " "e1 = floor((i8)/32): 1048576e0 = -32b0 + i4 and 32e1 = i8 and " "n <= 2147483647 and b0 <= 32767 and b0 >= 0 and " "32b0 <= -2 + n and t0 <= 31 and t0 >= 0 and i0 <= 7 + n and " "4i4 <= -3 + i0 and 3i4 <= -96 + 3t0 + i0 and " "3i4 >= -95 - n + 3t0 + i0 and i8 >= -157 + i0 - 4i4 and " "i8 >= 0 and i8 <= -4 + i0 - 3i4 and i8 <= -41 + i0));" "[i0, i1, i2, i3, 0, i5, i6, i7, i8, i9, i10, i11, i12] : " "(exists (e0 = floor((i8)/32): b0 = 0 and 32e0 = i8 and " "n <= 2147483647 and t0 <= 31 and t0 >= 0 and i0 >= 11 and " "i0 >= 96 - 3t0 and i0 <= 95 + n - 3t0 and i0 <= 7 + n and " "i8 >= -40 + i0 and i8 <= -10 + i0)) }" }, { 0, "{ [i0, i1, i2] : " "(exists (e0, e1 = floor((i0)/32), e2 = floor((i1)/32): " "32e1 = i0 and 32e2 = i1 and i1 >= -31 + i0 and " "i1 <= 31 + i0 and i2 >= -30 + i0 and i2 >= -30 + i1 and " "32e0 >= -30 + i0 and 32e0 >= -30 + i1 and " "32e0 >= -31 + i2 and 32e0 <= 30 + i2 and 32e0 <= 31 + i1 and " "32e0 <= 31 + i0)) or " "i0 >= 0 }" }, }; /* A specialized coalescing test case that would result * in a segmentation fault or a failed assertion in earlier versions of isl. */ static int test_coalesce_special(struct isl_ctx *ctx) { const char *str; isl_map *map1, *map2; str = "[y] -> { [S_L220_OUT[] -> T7[]] -> " "[[S_L309_IN[] -> T11[]] -> ce_imag2[1, o1]] : " "(y = 201 and o1 <= 239 and o1 >= 212) or " "(exists (e0 = [(y)/3]: 3e0 = y and y <= 198 and y >= 3 and " "o1 <= 239 and o1 >= 212)) or " "(exists (e0 = [(y)/3]: 3e0 = y and y <= 201 and y >= 3 and " "o1 <= 241 and o1 >= 240));" "[S_L220_OUT[] -> T7[]] -> " "[[S_L309_IN[] -> T11[]] -> ce_imag2[0, o1]] : " "(y = 2 and o1 <= 241 and o1 >= 212) or " "(exists (e0 = [(-2 + y)/3]: 3e0 = -2 + y and y <= 200 and " "y >= 5 and o1 <= 241 and o1 >= 212)) }"; map1 = isl_map_read_from_str(ctx, str); map1 = isl_map_align_divs(map1); map1 = isl_map_coalesce(map1); str = "[y] -> { [S_L220_OUT[] -> T7[]] -> " "[[S_L309_IN[] -> T11[]] -> ce_imag2[o0, o1]] : " "exists (e0 = [(-1 - y + o0)/3]: 3e0 = -1 - y + o0 and " "y <= 201 and o0 <= 2 and o1 >= 212 and o1 <= 241 and " "o0 >= 3 - y and o0 <= -2 + y and o0 >= 0) }"; map2 = isl_map_read_from_str(ctx, str); map2 = isl_map_union(map2, map1); map2 = isl_map_align_divs(map2); map2 = isl_map_coalesce(map2); isl_map_free(map2); if (!map2) return -1; return 0; } /* 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; if (test_coalesce_special(ctx) < 0) return -1; return 0; } static int test_closure(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); return 0; } static int test_lex(struct isl_ctx *ctx) { isl_space *dim; isl_map *map; int empty; dim = isl_space_set_alloc(ctx, 0, 0); map = isl_map_lex_le(dim); empty = isl_map_is_empty(map); isl_map_free(map); if (empty < 0) return -1; if (empty) isl_die(ctx, isl_error_unknown, "expecting non-empty result", return -1); return 0; } 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; } /* Check that isl_set_min_val and isl_set_max_val compute the correct * result on non-convex inputs. */ static int test_min(struct isl_ctx *ctx) { isl_set *set; isl_aff *aff; isl_val *val; int min_ok, max_ok; set = isl_set_read_from_str(ctx, "{ [-1]; [1] }"); aff = isl_aff_read_from_str(ctx, "{ [x] -> [x] }"); val = isl_set_min_val(set, aff); min_ok = isl_val_is_negone(val); isl_val_free(val); val = isl_set_max_val(set, aff); max_ok = isl_val_is_one(val); isl_val_free(val); isl_aff_free(aff); isl_set_free(set); if (min_ok < 0 || max_ok < 0) return -1; if (!min_ok) isl_die(ctx, isl_error_unknown, "unexpected minimum", return -1); if (!max_ok) isl_die(ctx, isl_error_unknown, "unexpected maximum", return -1); return 0; } struct must_may { isl_map *must; isl_map *may; }; static isl_stat 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 isl_stat_ok; } 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; } static int 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); return 0; } /* Check that the dependence analysis proceeds without errors. * Earlier versions of isl would break down during the analysis * due to the use of the wrong spaces. */ static int test_flow(isl_ctx *ctx) { const char *str; isl_union_map *access, *schedule; isl_union_map *must_dep, *may_dep; int r; str = "{ S0[j] -> i[]; S1[j,i] -> i[]; S2[] -> i[]; S3[] -> i[] }"; access = isl_union_map_read_from_str(ctx, str); str = "{ S0[j] -> [0,j,0,0] : 0 <= j < 10; " "S1[j,i] -> [0,j,1,i] : 0 <= j < i < 10; " "S2[] -> [1,0,0,0]; " "S3[] -> [-1,0,0,0] }"; schedule = isl_union_map_read_from_str(ctx, str); r = isl_union_map_compute_flow(access, isl_union_map_copy(access), isl_union_map_copy(access), schedule, &must_dep, &may_dep, NULL, NULL); isl_union_map_free(may_dep); isl_union_map_free(must_dep); return r; } struct { const char *map; int sv; } sv_tests[] = { { "[N] -> { [i] -> [f] : 0 <= i <= N and 0 <= i - 10 f <= 9 }", 1 }, { "[N] -> { [i] -> [f] : 0 <= i <= N and 0 <= i - 10 f <= 10 }", 0 }, { "{ [i] -> [3*floor(i/2) + 5*floor(i/3)] }", 1 }, { "{ S1[i] -> [i] : 0 <= i <= 9; S2[i] -> [i] : 0 <= i <= 9 }", 1 }, { "{ [i] -> S1[i] : 0 <= i <= 9; [i] -> S2[i] : 0 <= i <= 9 }", 0 }, { "{ A[i] -> [i]; B[i] -> [i]; B[i] -> [i + 1] }", 0 }, { "{ A[i] -> [i]; B[i] -> [i] : i < 0; B[i] -> [i + 1] : i > 0 }", 1 }, { "{ A[i] -> [i]; B[i] -> A[i] : i < 0; B[i] -> [i + 1] : i > 0 }", 1 }, { "{ A[i] -> [i]; B[i] -> [j] : i - 1 <= j <= i }", 0 }, }; int test_sv(isl_ctx *ctx) { isl_union_map *umap; int i; int sv; for (i = 0; i < ARRAY_SIZE(sv_tests); ++i) { umap = isl_union_map_read_from_str(ctx, sv_tests[i].map); sv = isl_union_map_is_single_valued(umap); isl_union_map_free(umap); if (sv < 0) return -1; if (sv_tests[i].sv && !sv) isl_die(ctx, isl_error_internal, "map not detected as single valued", return -1); if (!sv_tests[i].sv && sv) isl_die(ctx, isl_error_internal, "map detected as single valued", return -1); } return 0; } struct { const char *str; int bijective; } bijective_tests[] = { { "[N,M]->{[i,j] -> [i]}", 0 }, { "[N,M]->{[i,j] -> [i] : j=i}", 1 }, { "[N,M]->{[i,j] -> [i] : j=0}", 1 }, { "[N,M]->{[i,j] -> [i] : j=N}", 1 }, { "[N,M]->{[i,j] -> [j,i]}", 1 }, { "[N,M]->{[i,j] -> [i+j]}", 0 }, { "[N,M]->{[i,j] -> []}", 0 }, { "[N,M]->{[i,j] -> [i,j,N]}", 1 }, { "[N,M]->{[i,j] -> [2i]}", 0 }, { "[N,M]->{[i,j] -> [i,i]}", 0 }, { "[N,M]->{[i,j] -> [2i,i]}", 0 }, { "[N,M]->{[i,j] -> [2i,j]}", 1 }, { "[N,M]->{[i,j] -> [x,y] : 2x=i & y =j}", 1 }, }; static int test_bijective(struct isl_ctx *ctx) { isl_map *map; int i; int bijective; for (i = 0; i < ARRAY_SIZE(bijective_tests); ++i) { map = isl_map_read_from_str(ctx, bijective_tests[i].str); bijective = isl_map_is_bijective(map); isl_map_free(map); if (bijective < 0) return -1; if (bijective_tests[i].bijective && !bijective) isl_die(ctx, isl_error_internal, "map not detected as bijective", return -1); if (!bijective_tests[i].bijective && bijective) isl_die(ctx, isl_error_internal, "map detected as bijective", return -1); } return 0; } /* Inputs for isl_pw_qpolynomial_gist tests. * "pwqp" is the input, "set" is the context and "gist" is the expected result. */ struct { const char *pwqp; const char *set; const char *gist; } pwqp_gist_tests[] = { { "{ [i] -> i }", "{ [k] : exists a : k = 2a }", "{ [i] -> i }" }, { "{ [i] -> i + [ (i + [i/3])/2 ] }", "{ [10] }", "{ [i] -> 16 }" }, { "{ [i] -> ([(i)/2]) }", "{ [k] : exists a : k = 2a+1 }", "{ [i] -> -1/2 + 1/2 * i }" }, { "{ [i] -> i^2 : i != 0 }", "{ [i] : i != 0 }", "{ [i] -> i^2 }" }, }; static int test_pwqp(struct isl_ctx *ctx) { int i; 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); for (i = 0; i < ARRAY_SIZE(pwqp_gist_tests); ++i) { str = pwqp_gist_tests[i].pwqp; pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str); str = pwqp_gist_tests[i].set; set = isl_set_read_from_str(ctx, str); pwqp1 = isl_pw_qpolynomial_gist(pwqp1, set); str = pwqp_gist_tests[i].gist; pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str); pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2); equal = isl_pw_qpolynomial_is_zero(pwqp1); isl_pw_qpolynomial_free(pwqp1); if (equal < 0) return -1; if (!equal) isl_die(ctx, isl_error_unknown, "unexpected result", return -1); } 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; } static int 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); isl_pw_qpolynomial_free(pwqp); if (!pwqp) return -1; return 0; } static int test_union(isl_ctx *ctx) { const char *str; isl_union_set *uset1, *uset2; isl_union_map *umap1, *umap2; int equal; 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); 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, "union maps not equal", return -1); 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); equal = isl_union_set_is_equal(uset1, uset2); isl_union_set_free(uset1); isl_union_set_free(uset2); if (equal < 0) return -1; if (!equal) isl_die(ctx, isl_error_unknown, "union sets not equal", return -1); return 0; } /* Check that computing a bound of a non-zero polynomial over an unbounded * domain does not produce a rational value. * Ideally, we want the value to be infinity, but we accept NaN for now. * We certainly do not want to obtain the value zero. */ static int test_bound_unbounded_domain(isl_ctx *ctx) { const char *str; isl_set *dom; isl_point *pnt; isl_pw_qpolynomial *pwqp; isl_pw_qpolynomial_fold *pwf; isl_val *v; int is_rat; str = "{ [m,n] -> -m * n }"; pwqp = isl_pw_qpolynomial_read_from_str(ctx, str); pwf = isl_pw_qpolynomial_bound(pwqp, isl_fold_max, NULL); dom = isl_pw_qpolynomial_fold_domain(isl_pw_qpolynomial_fold_copy(pwf)); pnt = isl_set_sample_point(dom); v = isl_pw_qpolynomial_fold_eval(pwf, pnt); is_rat = isl_val_is_rat(v); isl_val_free(v); if (is_rat < 0) return -1; if (is_rat) isl_die(ctx, isl_error_unknown, "unexpected rational value", return -1); return 0; } static int test_bound(isl_ctx *ctx) { const char *str; unsigned dim; isl_pw_qpolynomial *pwqp; isl_pw_qpolynomial_fold *pwf; if (test_bound_unbounded_domain(ctx) < 0) return -1; 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); dim = isl_pw_qpolynomial_fold_dim(pwf, isl_dim_in); isl_pw_qpolynomial_fold_free(pwf); if (dim != 4) isl_die(ctx, isl_error_unknown, "unexpected input dimension", return -1); 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); dim = isl_pw_qpolynomial_fold_dim(pwf, isl_dim_in); isl_pw_qpolynomial_fold_free(pwf); if (dim != 1) isl_die(ctx, isl_error_unknown, "unexpected input dimension", return -1); return 0; } static int 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); return 0; } 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 }, { "{ [t, i] : (exists (e0 = [(2 + t)/4]: 4e0 <= 2 + t and " "4e0 >= -1 + t and i >= 57 and i <= 62 and " "4e0 <= 62 + t - i and 4e0 >= -61 + t + i and " "t >= 0 and t <= 511 and 4e0 <= -57 + t + i and " "4e0 >= 58 + t - i and i >= 58 + t and i >= 62 - t)) }", "{ [i0, i1] : (exists (e0 = [(4 + i0)/4]: 4e0 <= 62 + i0 - i1 and " "4e0 >= 1 + i0 and i0 >= 0 and i0 <= 511 and " "4e0 <= -57 + i0 + i1)) or " "(exists (e0 = [(2 + i0)/4]: 4e0 <= i0 and " "4e0 >= 58 + i0 - i1 and i0 >= 2 and i0 <= 511 and " "4e0 >= -61 + i0 + i1)) or " "(i1 <= 66 - i0 and i0 >= 2 and i1 >= 59 + i0) }", 1 }, }; 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_pw_multi_aff *upma1, *upma2; 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); } for (i = 0; i < ARRAY_SIZE(subtract_domain_tests); ++i) { upma1 = isl_union_pw_multi_aff_read_from_str(ctx, subtract_domain_tests[i].minuend); uset = isl_union_set_read_from_str(ctx, subtract_domain_tests[i].subtrahend); upma2 = isl_union_pw_multi_aff_read_from_str(ctx, subtract_domain_tests[i].difference); upma1 = isl_union_pw_multi_aff_subtract_domain(upma1, uset); equal = isl_union_pw_multi_aff_plain_is_equal(upma1, upma2); isl_union_pw_multi_aff_free(upma1); isl_union_pw_multi_aff_free(upma2); 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 isl_stat 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 isl_stat_error; return isl_stat_ok; } 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, *coincidence; 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_constraints *sc; 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); coincidence = isl_union_map_copy(dep); proximity = isl_union_map_copy(dep); sc = isl_schedule_constraints_on_domain(isl_union_set_copy(D)); sc = isl_schedule_constraints_set_validity(sc, validity); sc = isl_schedule_constraints_set_coincidence(sc, coincidence); sc = isl_schedule_constraints_set_proximity(sc, proximity); sched = isl_schedule_constraints_compute_schedule(sc); 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; } /* Compute a schedule for the given instance set, validity constraints, * proximity constraints and context and return a corresponding union map * representation. */ static __isl_give isl_union_map *compute_schedule_with_context(isl_ctx *ctx, const char *domain, const char *validity, const char *proximity, const char *context) { isl_set *con; isl_union_set *dom; isl_union_map *dep; isl_union_map *prox; isl_schedule_constraints *sc; isl_schedule *schedule; isl_union_map *sched; con = isl_set_read_from_str(ctx, context); 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); sc = isl_schedule_constraints_on_domain(dom); sc = isl_schedule_constraints_set_context(sc, con); sc = isl_schedule_constraints_set_validity(sc, dep); sc = isl_schedule_constraints_set_proximity(sc, prox); schedule = isl_schedule_constraints_compute_schedule(sc); sched = isl_schedule_get_map(schedule); isl_schedule_free(schedule); return sched; } /* Compute a schedule for the given instance set, validity constraints and * proximity constraints and return a corresponding union map representation. */ static __isl_give isl_union_map *compute_schedule(isl_ctx *ctx, const char *domain, const char *validity, const char *proximity) { return compute_schedule_with_context(ctx, domain, validity, proximity, "{ : }"); } /* 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_constraints *sc; 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); sc = isl_schedule_constraints_on_domain(D); sc = isl_schedule_constraints_set_validity(sc, validity); sc = isl_schedule_constraints_set_proximity(sc, proximity); sched = isl_schedule_constraints_compute_schedule(sc); 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; } /* Check that conditional validity constraints are also taken into * account across bands. * In particular, try to make sure that live ranges D[1,0]->C[2,1] and * D[2,0]->C[3,0] are not local in the outer band of the generated schedule * and then check that the adjacent order constraint C[2,1]->D[2,0] * is enforced by the rest of the schedule. */ static int test_special_conditional_schedule_constraints(isl_ctx *ctx) { const char *str; isl_union_set *domain; isl_union_map *validity, *proximity, *condition; isl_union_map *sink, *source, *dep; isl_schedule_constraints *sc; isl_schedule *schedule; isl_union_access_info *access; isl_union_flow *flow; int empty; str = "[n] -> { C[k, i] : k <= -1 + n and i >= 0 and i <= -1 + k; " "A[k] : k >= 1 and k <= -1 + n; " "B[k, i] : k <= -1 + n and i >= 0 and i <= -1 + k; " "D[k, i] : k <= -1 + n and i >= 0 and i <= -1 + k }"; domain = isl_union_set_read_from_str(ctx, str); sc = isl_schedule_constraints_on_domain(domain); str = "[n] -> { D[k, i] -> C[1 + k, k - i] : " "k <= -2 + n and i >= 1 and i <= -1 + k; " "D[k, i] -> C[1 + k, i] : " "k <= -2 + n and i >= 1 and i <= -1 + k; " "D[k, 0] -> C[1 + k, k] : k >= 1 and k <= -2 + n; " "D[k, 0] -> C[1 + k, 0] : k >= 1 and k <= -2 + n }"; validity = isl_union_map_read_from_str(ctx, str); sc = isl_schedule_constraints_set_validity(sc, validity); str = "[n] -> { C[k, i] -> D[k, i] : " "0 <= i <= -1 + k and k <= -1 + n }"; proximity = isl_union_map_read_from_str(ctx, str); sc = isl_schedule_constraints_set_proximity(sc, proximity); str = "[n] -> { [D[k, i] -> a[]] -> [C[1 + k, k - i] -> b[]] : " "i <= -1 + k and i >= 1 and k <= -2 + n; " "[B[k, i] -> c[]] -> [B[k, 1 + i] -> c[]] : " "k <= -1 + n and i >= 0 and i <= -2 + k }"; condition = isl_union_map_read_from_str(ctx, str); str = "[n] -> { [B[k, i] -> e[]] -> [D[k, i] -> a[]] : " "i >= 0 and i <= -1 + k and k <= -1 + n; " "[C[k, i] -> b[]] -> [D[k', -1 + k - i] -> a[]] : " "i >= 0 and i <= -1 + k and k <= -1 + n and " "k' <= -1 + n and k' >= k - i and k' >= 1 + k; " "[C[k, i] -> b[]] -> [D[k, -1 + k - i] -> a[]] : " "i >= 0 and i <= -1 + k and k <= -1 + n; " "[B[k, i] -> c[]] -> [A[k'] -> d[]] : " "k <= -1 + n and i >= 0 and i <= -1 + k and " "k' >= 1 and k' <= -1 + n and k' >= 1 + k }"; validity = isl_union_map_read_from_str(ctx, str); sc = isl_schedule_constraints_set_conditional_validity(sc, condition, validity); schedule = isl_schedule_constraints_compute_schedule(sc); str = "{ D[2,0] -> [] }"; sink = isl_union_map_read_from_str(ctx, str); access = isl_union_access_info_from_sink(sink); str = "{ C[2,1] -> [] }"; source = isl_union_map_read_from_str(ctx, str); access = isl_union_access_info_set_must_source(access, source); access = isl_union_access_info_set_schedule(access, schedule); flow = isl_union_access_info_compute_flow(access); dep = isl_union_flow_get_must_dependence(flow); isl_union_flow_free(flow); empty = isl_union_map_is_empty(dep); isl_union_map_free(dep); if (empty < 0) return -1; if (empty) isl_die(ctx, isl_error_unknown, "conditional validity not respected", return -1); return 0; } /* Input for testing of schedule construction based on * conditional constraints. * * domain is the iteration domain * flow are the flow dependences, which determine the validity and * proximity constraints * condition are the conditions on the conditional validity constraints * conditional_validity are the conditional validity constraints * outer_band_n is the expected number of members in the outer band */ struct { const char *domain; const char *flow; const char *condition; const char *conditional_validity; int outer_band_n; } live_range_tests[] = { /* Contrived example that illustrates that we need to keep * track of tagged condition dependences and * tagged conditional validity dependences * in isl_sched_edge separately. * In particular, the conditional validity constraints on A * cannot be satisfied, * but they can be ignored because there are no corresponding * condition constraints. However, we do have an additional * conditional validity constraint that maps to the same * dependence relation * as the condition constraint on B. If we did not make a distinction * between tagged condition and tagged conditional validity * dependences, then we * could end up treating this shared dependence as an condition * constraint on A, forcing a localization of the conditions, * which is impossible. */ { "{ S[i] : 0 <= 1 < 100; T[i] : 0 <= 1 < 100 }", "{ S[i] -> S[i+1] : 0 <= i < 99 }", "{ [S[i] -> B[]] -> [S[i+1] -> B[]] : 0 <= i < 99 }", "{ [S[i] -> A[]] -> [T[i'] -> A[]] : 0 <= i', i < 100 and i != i';" "[T[i] -> A[]] -> [S[i'] -> A[]] : 0 <= i', i < 100 and i != i';" "[S[i] -> A[]] -> [S[i+1] -> A[]] : 0 <= i < 99 }", 1 }, /* TACO 2013 Fig. 7 */ { "[n] -> { S1[i,j] : 0 <= i,j < n; S2[i,j] : 0 <= i,j < n }", "[n] -> { S1[i,j] -> S2[i,j] : 0 <= i,j < n;" "S2[i,j] -> S2[i,j+1] : 0 <= i < n and 0 <= j < n - 1 }", "[n] -> { [S1[i,j] -> t[]] -> [S2[i,j] -> t[]] : 0 <= i,j < n;" "[S2[i,j] -> x1[]] -> [S2[i,j+1] -> x1[]] : " "0 <= i < n and 0 <= j < n - 1 }", "[n] -> { [S2[i,j] -> t[]] -> [S1[i,j'] -> t[]] : " "0 <= i < n and 0 <= j < j' < n;" "[S2[i,j] -> t[]] -> [S1[i',j'] -> t[]] : " "0 <= i < i' < n and 0 <= j,j' < n;" "[S2[i,j] -> x1[]] -> [S2[i,j'] -> x1[]] : " "0 <= i,j,j' < n and j < j' }", 2 }, /* TACO 2013 Fig. 7, without tags */ { "[n] -> { S1[i,j] : 0 <= i,j < n; S2[i,j] : 0 <= i,j < n }", "[n] -> { S1[i,j] -> S2[i,j] : 0 <= i,j < n;" "S2[i,j] -> S2[i,j+1] : 0 <= i < n and 0 <= j < n - 1 }", "[n] -> { S1[i,j] -> S2[i,j] : 0 <= i,j < n;" "S2[i,j] -> S2[i,j+1] : 0 <= i < n and 0 <= j < n - 1 }", "[n] -> { S2[i,j] -> S1[i,j'] : 0 <= i < n and 0 <= j < j' < n;" "S2[i,j] -> S1[i',j'] : 0 <= i < i' < n and 0 <= j,j' < n;" "S2[i,j] -> S2[i,j'] : 0 <= i,j,j' < n and j < j' }", 1 }, /* TACO 2013 Fig. 12 */ { "{ S1[i,0] : 0 <= i <= 1; S2[i,j] : 0 <= i <= 1 and 1 <= j <= 2;" "S3[i,3] : 0 <= i <= 1 }", "{ S1[i,0] -> S2[i,1] : 0 <= i <= 1;" "S2[i,1] -> S2[i,2] : 0 <= i <= 1;" "S2[i,2] -> S3[i,3] : 0 <= i <= 1 }", "{ [S1[i,0]->t[]] -> [S2[i,1]->t[]] : 0 <= i <= 1;" "[S2[i,1]->t[]] -> [S2[i,2]->t[]] : 0 <= i <= 1;" "[S2[i,2]->t[]] -> [S3[i,3]->t[]] : 0 <= i <= 1 }", "{ [S2[i,1]->t[]] -> [S2[i,2]->t[]] : 0 <= i <= 1;" "[S2[0,j]->t[]] -> [S2[1,j']->t[]] : 1 <= j,j' <= 2;" "[S2[0,j]->t[]] -> [S1[1,0]->t[]] : 1 <= j <= 2;" "[S3[0,3]->t[]] -> [S2[1,j]->t[]] : 1 <= j <= 2;" "[S3[0,3]->t[]] -> [S1[1,0]->t[]] }", 1 } }; /* Test schedule construction based on conditional constraints. * In particular, check the number of members in the outer band node * as an indication of whether tiling is possible or not. */ static int test_conditional_schedule_constraints(isl_ctx *ctx) { int i; isl_union_set *domain; isl_union_map *condition; isl_union_map *flow; isl_union_map *validity; isl_schedule_constraints *sc; isl_schedule *schedule; isl_schedule_node *node; int n_member; if (test_special_conditional_schedule_constraints(ctx) < 0) return -1; for (i = 0; i < ARRAY_SIZE(live_range_tests); ++i) { domain = isl_union_set_read_from_str(ctx, live_range_tests[i].domain); flow = isl_union_map_read_from_str(ctx, live_range_tests[i].flow); condition = isl_union_map_read_from_str(ctx, live_range_tests[i].condition); validity = isl_union_map_read_from_str(ctx, live_range_tests[i].conditional_validity); sc = isl_schedule_constraints_on_domain(domain); sc = isl_schedule_constraints_set_validity(sc, isl_union_map_copy(flow)); sc = isl_schedule_constraints_set_proximity(sc, flow); sc = isl_schedule_constraints_set_conditional_validity(sc, condition, validity); schedule = isl_schedule_constraints_compute_schedule(sc); node = isl_schedule_get_root(schedule); while (node && isl_schedule_node_get_type(node) != isl_schedule_node_band) node = isl_schedule_node_first_child(node); n_member = isl_schedule_node_band_n_member(node); isl_schedule_node_free(node); isl_schedule_free(schedule); if (!schedule) return -1; if (n_member != live_range_tests[i].outer_band_n) isl_die(ctx, isl_error_unknown, "unexpected number of members in outer band", return -1); } return 0; } /* Check that the schedule computed for the given instance set and * dependence relation strongly satisfies the dependences. * In particular, check that no instance is scheduled before * or together with an instance on which it depends. * Earlier versions of isl would produce a schedule that * only weakly satisfies the dependences. */ static int test_strongly_satisfying_schedule(isl_ctx *ctx) { const char *domain, *dep; isl_union_map *D, *schedule; isl_map *map, *ge; int empty; domain = "{ B[i0, i1] : 0 <= i0 <= 1 and 0 <= i1 <= 11; " "A[i0] : 0 <= i0 <= 1 }"; dep = "{ B[i0, i1] -> B[i0, 1 + i1] : 0 <= i0 <= 1 and 0 <= i1 <= 10; " "B[0, 11] -> A[1]; A[i0] -> B[i0, 0] : 0 <= i0 <= 1 }"; schedule = compute_schedule(ctx, domain, dep, dep); D = isl_union_map_read_from_str(ctx, dep); D = isl_union_map_apply_domain(D, isl_union_map_copy(schedule)); D = isl_union_map_apply_range(D, schedule); map = isl_map_from_union_map(D); ge = isl_map_lex_ge(isl_space_domain(isl_map_get_space(map))); map = isl_map_intersect(map, ge); empty = isl_map_is_empty(map); isl_map_free(map); if (empty < 0) return -1; if (!empty) isl_die(ctx, isl_error_unknown, "dependences not strongly satisfied", return -1); return 0; } /* Compute a schedule for input where the instance set constraints * conflict with the context constraints. * Earlier versions of isl did not properly handle this situation. */ static int test_conflicting_context_schedule(isl_ctx *ctx) { isl_union_map *schedule; const char *domain, *context; domain = "[n] -> { A[] : n >= 0 }"; context = "[n] -> { : n < 0 }"; schedule = compute_schedule_with_context(ctx, domain, "{}", "{}", context); isl_union_map_free(schedule); if (!schedule) return -1; return 0; } /* Check that the dependence carrying step is not confused by * a bound on the coefficient size. * In particular, force the scheduler to move to a dependence carrying * step by demanding outer coincidence and bound the size of * the coefficients. Earlier versions of isl would take this * bound into account while carrying dependences, breaking * fundamental assumptions. */ static int test_bounded_coefficients_schedule(isl_ctx *ctx) { const char *domain, *dep; isl_union_set *I; isl_union_map *D; isl_schedule_constraints *sc; isl_schedule *schedule; domain = "{ C[i0, i1] : 2 <= i0 <= 3999 and 0 <= i1 <= -1 + i0 }"; dep = "{ C[i0, i1] -> C[i0, 1 + i1] : i0 <= 3999 and i1 >= 0 and " "i1 <= -2 + i0; " "C[i0, -1 + i0] -> C[1 + i0, 0] : i0 <= 3998 and i0 >= 1 }"; I = isl_union_set_read_from_str(ctx, domain); D = isl_union_map_read_from_str(ctx, dep); sc = isl_schedule_constraints_on_domain(I); sc = isl_schedule_constraints_set_validity(sc, isl_union_map_copy(D)); sc = isl_schedule_constraints_set_coincidence(sc, D); isl_options_set_schedule_outer_coincidence(ctx, 1); isl_options_set_schedule_max_coefficient(ctx, 20); schedule = isl_schedule_constraints_compute_schedule(sc); isl_options_set_schedule_max_coefficient(ctx, -1); isl_options_set_schedule_outer_coincidence(ctx, 0); isl_schedule_free(schedule); if (!schedule) 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_coincidence = 1; if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0) return -1; ctx->opt->schedule_outer_coincidence = 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; /* Check that we allow schedule rows that are only non-trivial * on some full-dimensional domains. */ D = "{ S1[j] : 0 <= j <= 1; S0[]; S2[k] : 0 <= k <= 1 }"; V = "{ S0[] -> S1[j] : 0 <= j <= 1; S2[0] -> S0[];" "S1[j] -> S2[1] : 0 <= j <= 1 }"; 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; if (test_conditional_schedule_constraints(ctx) < 0) return -1; if (test_strongly_satisfying_schedule(ctx) < 0) return -1; if (test_conflicting_context_schedule(ctx) < 0) return -1; if (test_bounded_coefficients_schedule(ctx) < 0) return -1; 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; } struct { __isl_give isl_aff *(*fn)(__isl_take isl_aff *aff1, __isl_take isl_aff *aff2); } aff_bin_op[] = { ['+'] = { &isl_aff_add }, ['-'] = { &isl_aff_sub }, ['*'] = { &isl_aff_mul }, ['/'] = { &isl_aff_div }, }; struct { const char *arg1; unsigned char op; const char *arg2; const char *res; } aff_bin_tests[] = { { "{ [i] -> [i] }", '+', "{ [i] -> [i] }", "{ [i] -> [2i] }" }, { "{ [i] -> [i] }", '-', "{ [i] -> [i] }", "{ [i] -> [0] }" }, { "{ [i] -> [i] }", '*', "{ [i] -> [2] }", "{ [i] -> [2i] }" }, { "{ [i] -> [2] }", '*', "{ [i] -> [i] }", "{ [i] -> [2i] }" }, { "{ [i] -> [i] }", '/', "{ [i] -> [2] }", "{ [i] -> [i/2] }" }, { "{ [i] -> [2i] }", '/', "{ [i] -> [2] }", "{ [i] -> [i] }" }, { "{ [i] -> [i] }", '+', "{ [i] -> [NaN] }", "{ [i] -> [NaN] }" }, { "{ [i] -> [i] }", '-', "{ [i] -> [NaN] }", "{ [i] -> [NaN] }" }, { "{ [i] -> [i] }", '*', "{ [i] -> [NaN] }", "{ [i] -> [NaN] }" }, { "{ [i] -> [2] }", '*', "{ [i] -> [NaN] }", "{ [i] -> [NaN] }" }, { "{ [i] -> [i] }", '/', "{ [i] -> [NaN] }", "{ [i] -> [NaN] }" }, { "{ [i] -> [2] }", '/', "{ [i] -> [NaN] }", "{ [i] -> [NaN] }" }, { "{ [i] -> [NaN] }", '+', "{ [i] -> [i] }", "{ [i] -> [NaN] }" }, { "{ [i] -> [NaN] }", '-', "{ [i] -> [i] }", "{ [i] -> [NaN] }" }, { "{ [i] -> [NaN] }", '*', "{ [i] -> [2] }", "{ [i] -> [NaN] }" }, { "{ [i] -> [NaN] }", '*', "{ [i] -> [i] }", "{ [i] -> [NaN] }" }, { "{ [i] -> [NaN] }", '/', "{ [i] -> [2] }", "{ [i] -> [NaN] }" }, { "{ [i] -> [NaN] }", '/', "{ [i] -> [i] }", "{ [i] -> [NaN] }" }, }; /* Perform some basic tests of binary operations on isl_aff objects. */ static int test_bin_aff(isl_ctx *ctx) { int i; isl_aff *aff1, *aff2, *res; __isl_give isl_aff *(*fn)(__isl_take isl_aff *aff1, __isl_take isl_aff *aff2); int ok; for (i = 0; i < ARRAY_SIZE(aff_bin_tests); ++i) { aff1 = isl_aff_read_from_str(ctx, aff_bin_tests[i].arg1); aff2 = isl_aff_read_from_str(ctx, aff_bin_tests[i].arg2); res = isl_aff_read_from_str(ctx, aff_bin_tests[i].res); fn = aff_bin_op[aff_bin_tests[i].op].fn; aff1 = fn(aff1, aff2); if (isl_aff_is_nan(res)) ok = isl_aff_is_nan(aff1); else ok = isl_aff_plain_is_equal(aff1, res); isl_aff_free(aff1); isl_aff_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_union_pw_multi_aff *(*fn)( __isl_take isl_union_pw_multi_aff *upma1, __isl_take isl_union_pw_multi_aff *upma2); const char *arg1; const char *arg2; const char *res; } upma_bin_tests[] = { { &isl_union_pw_multi_aff_add, "{ A[] -> [0]; B[0] -> [1] }", "{ B[x] -> [2] : x >= 0 }", "{ B[0] -> [3] }" }, { &isl_union_pw_multi_aff_union_add, "{ A[] -> [0]; B[0] -> [1] }", "{ B[x] -> [2] : x >= 0 }", "{ A[] -> [0]; B[0] -> [3]; B[x] -> [2] : x >= 1 }" }, }; /* Perform some basic tests of binary operations on * isl_union_pw_multi_aff objects. */ static int test_bin_upma(isl_ctx *ctx) { int i; isl_union_pw_multi_aff *upma1, *upma2, *res; int ok; for (i = 0; i < ARRAY_SIZE(upma_bin_tests); ++i) { upma1 = isl_union_pw_multi_aff_read_from_str(ctx, upma_bin_tests[i].arg1); upma2 = isl_union_pw_multi_aff_read_from_str(ctx, upma_bin_tests[i].arg2); res = isl_union_pw_multi_aff_read_from_str(ctx, upma_bin_tests[i].res); upma1 = upma_bin_tests[i].fn(upma1, upma2); ok = isl_union_pw_multi_aff_plain_is_equal(upma1, res); isl_union_pw_multi_aff_free(upma1); isl_union_pw_multi_aff_free(res); if (ok < 0) return -1; if (!ok) isl_die(ctx, isl_error_unknown, "unexpected result", 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; if (test_bin_aff(ctx) < 0) return -1; if (test_bin_upma(ctx) < 0) return -1; 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); /* Check that empty solution lie in the right space. */ str = "[n] -> { [t,a] : 1 = 0 }"; set = isl_set_read_from_str(ctx, str); pwaff = isl_set_dim_max(set, 0); set1 = isl_set_from_pw_aff(pwaff); str = "[n] -> { [t] : 1 = 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); 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; } /* Check that two sets are not considered disjoint just because * they have a different set of (named) parameters. */ static int test_disjoint(isl_ctx *ctx) { const char *str; isl_set *set, *set2; int disjoint; str = "[n] -> { [[]->[]] }"; set = isl_set_read_from_str(ctx, str); str = "{ [[]->[]] }"; set2 = isl_set_read_from_str(ctx, str); disjoint = isl_set_is_disjoint(set, set2); isl_set_free(set); isl_set_free(set2); if (disjoint < 0) return -1; if (disjoint) isl_die(ctx, isl_error_unknown, "unexpected result", 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; } struct isl_vertices_test_data { const char *set; int n; const char *vertex[2]; } vertices_tests[] = { { "{ A[t, i] : t = 12 and i >= 4 and i <= 12 }", 2, { "{ A[12, 4] }", "{ A[12, 12] }" } }, { "{ A[t, i] : t = 14 and i = 1 }", 1, { "{ A[14, 1] }" } }, }; /* Check that "vertex" corresponds to one of the vertices in data->vertex. */ static isl_stat find_vertex(__isl_take isl_vertex *vertex, void *user) { struct isl_vertices_test_data *data = user; isl_ctx *ctx; isl_multi_aff *ma; isl_basic_set *bset; isl_pw_multi_aff *pma; int i; isl_bool equal; ctx = isl_vertex_get_ctx(vertex); bset = isl_vertex_get_domain(vertex); ma = isl_vertex_get_expr(vertex); pma = isl_pw_multi_aff_alloc(isl_set_from_basic_set(bset), ma); for (i = 0; i < data->n; ++i) { isl_pw_multi_aff *pma_i; pma_i = isl_pw_multi_aff_read_from_str(ctx, data->vertex[i]); equal = isl_pw_multi_aff_plain_is_equal(pma, pma_i); isl_pw_multi_aff_free(pma_i); if (equal < 0 || equal) break; } isl_pw_multi_aff_free(pma); isl_vertex_free(vertex); if (equal < 0) return isl_stat_error; return equal ? isl_stat_ok : isl_stat_error; } int test_vertices(isl_ctx *ctx) { int i; for (i = 0; i < ARRAY_SIZE(vertices_tests); ++i) { isl_basic_set *bset; isl_vertices *vertices; int ok = 1; int n; bset = isl_basic_set_read_from_str(ctx, vertices_tests[i].set); vertices = isl_basic_set_compute_vertices(bset); n = isl_vertices_get_n_vertices(vertices); if (vertices_tests[i].n != n) ok = 0; if (isl_vertices_foreach_vertex(vertices, &find_vertex, &vertices_tests[i]) < 0) ok = 0; isl_vertices_free(vertices); isl_basic_set_free(bset); if (!vertices) return -1; if (!ok) isl_die(ctx, isl_error_unknown, "unexpected 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, "4 * floord(x, 4) + 2 >= x ? 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 }", "[N] -> { [3*floor(N/2) + 5*floor(N/3)] }", }; /* 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]] }", }, { "{ [i, j] -> [floor((i)/4) + floor((2*i+j)/5)] }", "{ [i, j] -> [floor((i)/3), j] }", "{ [i, j] -> [(floor((i)/12) + floor((j + 2*floor((i)/3))/5))] }" }, }; 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 and that equal expressions * are correctly identified. */ static int test_ast(isl_ctx *ctx) { isl_ast_expr *expr, *expr1, *expr2, *expr3; char *str; int ok, equal; 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); expr2 = isl_ast_expr_copy(expr); expr = isl_ast_expr_neg(expr); expr2 = isl_ast_expr_neg(expr2); equal = isl_ast_expr_is_equal(expr, expr2); str = isl_ast_expr_to_str(expr); ok = str ? !strcmp(str, "-(A + B)") : -1; free(str); isl_ast_expr_free(expr); isl_ast_expr_free(expr2); if (ok < 0 || equal < 0) return -1; if (!equal) isl_die(ctx, isl_error_unknown, "equal expressions not considered equal", 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; } /* Check that isl_ast_build_expr_from_set returns a valid expression * for an empty set. Note that isl_ast_build_expr_from_set getting * called on an empty set probably indicates a bug in the caller. */ static int test_ast_build(isl_ctx *ctx) { isl_set *set; isl_ast_build *build; isl_ast_expr *expr; set = isl_set_universe(isl_space_params_alloc(ctx, 0)); build = isl_ast_build_from_context(set); set = isl_set_empty(isl_space_params_alloc(ctx, 0)); expr = isl_ast_build_expr_from_set(build, set); isl_ast_expr_free(expr); isl_ast_build_free(build); if (!expr) 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_node_from_schedule_map(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 rationally 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_node_from_schedule_map(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_node_from_schedule_map(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_node_from_schedule_map(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_node_from_schedule_map(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_node_from_schedule_map(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_node_from_schedule_map(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; } /* Check that we can properly parse multi piecewise affine expressions * where the piecewise affine expressions have different domains. */ static int test_multi_pw_aff(isl_ctx *ctx) { const char *str; isl_set *dom, *dom2; isl_multi_pw_aff *mpa1, *mpa2; isl_pw_aff *pa; int equal; int equal_domain; mpa1 = isl_multi_pw_aff_read_from_str(ctx, "{ [i] -> [i] }"); dom = isl_set_read_from_str(ctx, "{ [i] : i > 0 }"); mpa1 = isl_multi_pw_aff_intersect_domain(mpa1, dom); mpa2 = isl_multi_pw_aff_read_from_str(ctx, "{ [i] -> [2i] }"); mpa2 = isl_multi_pw_aff_flat_range_product(mpa1, mpa2); str = "{ [i] -> [(i : i > 0), 2i] }"; mpa1 = isl_multi_pw_aff_read_from_str(ctx, str); equal = isl_multi_pw_aff_plain_is_equal(mpa1, mpa2); pa = isl_multi_pw_aff_get_pw_aff(mpa1, 0); dom = isl_pw_aff_domain(pa); pa = isl_multi_pw_aff_get_pw_aff(mpa1, 1); dom2 = isl_pw_aff_domain(pa); equal_domain = isl_set_is_equal(dom, dom2); isl_set_free(dom); isl_set_free(dom2); isl_multi_pw_aff_free(mpa1); isl_multi_pw_aff_free(mpa2); if (equal < 0) return -1; if (!equal) isl_die(ctx, isl_error_unknown, "expressions not equal", return -1); if (equal_domain < 0) return -1; if (equal_domain) isl_die(ctx, isl_error_unknown, "domains unexpectedly 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; } /* Check that the reaching domain elements and the prefix schedule * at a leaf node are the same before and after grouping. */ static int test_schedule_tree_group_1(isl_ctx *ctx) { int equal; const char *str; isl_id *id; isl_union_set *uset; isl_multi_union_pw_aff *mupa; isl_union_pw_multi_aff *upma1, *upma2; isl_union_set *domain1, *domain2; isl_union_map *umap1, *umap2; isl_schedule_node *node; str = "{ S1[i,j] : 0 <= i,j < 10; S2[i,j] : 0 <= i,j < 10 }"; uset = isl_union_set_read_from_str(ctx, str); node = isl_schedule_node_from_domain(uset); node = isl_schedule_node_child(node, 0); str = "[{ S1[i,j] -> [i]; S2[i,j] -> [9 - i] }]"; mupa = isl_multi_union_pw_aff_read_from_str(ctx, str); node = isl_schedule_node_insert_partial_schedule(node, mupa); node = isl_schedule_node_child(node, 0); str = "[{ S1[i,j] -> [j]; S2[i,j] -> [j] }]"; mupa = isl_multi_union_pw_aff_read_from_str(ctx, str); node = isl_schedule_node_insert_partial_schedule(node, mupa); node = isl_schedule_node_child(node, 0); umap1 = isl_schedule_node_get_prefix_schedule_union_map(node); upma1 = isl_schedule_node_get_prefix_schedule_union_pw_multi_aff(node); domain1 = isl_schedule_node_get_domain(node); id = isl_id_alloc(ctx, "group", NULL); node = isl_schedule_node_parent(node); node = isl_schedule_node_group(node, id); node = isl_schedule_node_child(node, 0); umap2 = isl_schedule_node_get_prefix_schedule_union_map(node); upma2 = isl_schedule_node_get_prefix_schedule_union_pw_multi_aff(node); domain2 = isl_schedule_node_get_domain(node); equal = isl_union_pw_multi_aff_plain_is_equal(upma1, upma2); if (equal >= 0 && equal) equal = isl_union_set_is_equal(domain1, domain2); if (equal >= 0 && equal) equal = isl_union_map_is_equal(umap1, umap2); isl_union_map_free(umap1); isl_union_map_free(umap2); isl_union_set_free(domain1); isl_union_set_free(domain2); isl_union_pw_multi_aff_free(upma1); isl_union_pw_multi_aff_free(upma2); isl_schedule_node_free(node); if (equal < 0) return -1; if (!equal) isl_die(ctx, isl_error_unknown, "expressions not equal", return -1); return 0; } /* Check that we can have nested groupings and that the union map * schedule representation is the same before and after the grouping. * Note that after the grouping, the union map representation contains * the domain constraints from the ranges of the expansion nodes, * while they are missing from the union map representation of * the tree without expansion nodes. * * Also check that the global expansion is as expected. */ static int test_schedule_tree_group_2(isl_ctx *ctx) { int equal, equal_expansion; const char *str; isl_id *id; isl_union_set *uset; isl_union_map *umap1, *umap2; isl_union_map *expansion1, *expansion2; isl_union_set_list *filters; isl_multi_union_pw_aff *mupa; isl_schedule *schedule; isl_schedule_node *node; str = "{ S1[i,j] : 0 <= i,j < 10; S2[i,j] : 0 <= i,j < 10; " "S3[i,j] : 0 <= i,j < 10 }"; uset = isl_union_set_read_from_str(ctx, str); node = isl_schedule_node_from_domain(uset); node = isl_schedule_node_child(node, 0); str = "[{ S1[i,j] -> [i]; S2[i,j] -> [i]; S3[i,j] -> [i] }]"; mupa = isl_multi_union_pw_aff_read_from_str(ctx, str); node = isl_schedule_node_insert_partial_schedule(node, mupa); node = isl_schedule_node_child(node, 0); str = "{ S1[i,j] }"; uset = isl_union_set_read_from_str(ctx, str); filters = isl_union_set_list_from_union_set(uset); str = "{ S2[i,j]; S3[i,j] }"; uset = isl_union_set_read_from_str(ctx, str); filters = isl_union_set_list_add(filters, uset); node = isl_schedule_node_insert_sequence(node, filters); node = isl_schedule_node_child(node, 1); node = isl_schedule_node_child(node, 0); str = "{ S2[i,j] }"; uset = isl_union_set_read_from_str(ctx, str); filters = isl_union_set_list_from_union_set(uset); str = "{ S3[i,j] }"; uset = isl_union_set_read_from_str(ctx, str); filters = isl_union_set_list_add(filters, uset); node = isl_schedule_node_insert_sequence(node, filters); schedule = isl_schedule_node_get_schedule(node); umap1 = isl_schedule_get_map(schedule); uset = isl_schedule_get_domain(schedule); umap1 = isl_union_map_intersect_domain(umap1, uset); isl_schedule_free(schedule); node = isl_schedule_node_parent(node); node = isl_schedule_node_parent(node); id = isl_id_alloc(ctx, "group1", NULL); node = isl_schedule_node_group(node, id); node = isl_schedule_node_child(node, 1); node = isl_schedule_node_child(node, 0); id = isl_id_alloc(ctx, "group2", NULL); node = isl_schedule_node_group(node, id); schedule = isl_schedule_node_get_schedule(node); umap2 = isl_schedule_get_map(schedule); isl_schedule_free(schedule); node = isl_schedule_node_root(node); node = isl_schedule_node_child(node, 0); expansion1 = isl_schedule_node_get_subtree_expansion(node); isl_schedule_node_free(node); str = "{ group1[i] -> S1[i,j] : 0 <= i,j < 10; " "group1[i] -> S2[i,j] : 0 <= i,j < 10; " "group1[i] -> S3[i,j] : 0 <= i,j < 10 }"; expansion2 = isl_union_map_read_from_str(ctx, str); equal = isl_union_map_is_equal(umap1, umap2); equal_expansion = isl_union_map_is_equal(expansion1, expansion2); isl_union_map_free(umap1); isl_union_map_free(umap2); isl_union_map_free(expansion1); isl_union_map_free(expansion2); if (equal < 0 || equal_expansion < 0) return -1; if (!equal) isl_die(ctx, isl_error_unknown, "expressions not equal", return -1); if (!equal_expansion) isl_die(ctx, isl_error_unknown, "unexpected expansion", return -1); return 0; } /* Some tests for the isl_schedule_node_group function. */ static int test_schedule_tree_group(isl_ctx *ctx) { if (test_schedule_tree_group_1(ctx) < 0) return -1; if (test_schedule_tree_group_2(ctx) < 0) return -1; return 0; } struct { const char *set; const char *dual; } coef_tests[] = { { "{ rat: [i] : 0 <= i <= 10 }", "{ rat: coefficients[[cst] -> [a]] : cst >= 0 and 10a + cst >= 0 }" }, { "{ rat: [i] : FALSE }", "{ rat: coefficients[[cst] -> [a]] }" }, { "{ rat: [i] : }", "{ rat: coefficients[[cst] -> [0]] : cst >= 0 }" }, }; struct { const char *set; const char *dual; } sol_tests[] = { { "{ rat: coefficients[[cst] -> [a]] : cst >= 0 and 10a + cst >= 0 }", "{ rat: [i] : 0 <= i <= 10 }" }, { "{ rat: coefficients[[cst] -> [a]] : FALSE }", "{ rat: [i] }" }, { "{ rat: coefficients[[cst] -> [a]] }", "{ rat: [i] : FALSE }" }, }; /* Test the basic functionality of isl_basic_set_coefficients and * isl_basic_set_solutions. */ static int test_dual(isl_ctx *ctx) { int i; for (i = 0; i < ARRAY_SIZE(coef_tests); ++i) { int equal; isl_basic_set *bset1, *bset2; bset1 = isl_basic_set_read_from_str(ctx, coef_tests[i].set); bset2 = isl_basic_set_read_from_str(ctx, coef_tests[i].dual); bset1 = isl_basic_set_coefficients(bset1); 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, "incorrect dual", return -1); } for (i = 0; i < ARRAY_SIZE(sol_tests); ++i) { int equal; isl_basic_set *bset1, *bset2; bset1 = isl_basic_set_read_from_str(ctx, sol_tests[i].set); bset2 = isl_basic_set_read_from_str(ctx, sol_tests[i].dual); bset1 = isl_basic_set_solutions(bset1); 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, "incorrect dual", return -1); } return 0; } struct { int scale_tile; int shift_point; const char *domain; const char *schedule; const char *sizes; const char *tile; const char *point; } tile_tests[] = { { 0, 0, "[n] -> { S[i,j] : 0 <= i,j < n }", "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]", "{ [32,32] }", "[{ S[i,j] -> [floor(i/32)] }, { S[i,j] -> [floor(j/32)] }]", "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]", }, { 1, 0, "[n] -> { S[i,j] : 0 <= i,j < n }", "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]", "{ [32,32] }", "[{ S[i,j] -> [32*floor(i/32)] }, { S[i,j] -> [32*floor(j/32)] }]", "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]", }, { 0, 1, "[n] -> { S[i,j] : 0 <= i,j < n }", "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]", "{ [32,32] }", "[{ S[i,j] -> [floor(i/32)] }, { S[i,j] -> [floor(j/32)] }]", "[{ S[i,j] -> [i%32] }, { S[i,j] -> [j%32] }]", }, { 1, 1, "[n] -> { S[i,j] : 0 <= i,j < n }", "[{ S[i,j] -> [i] }, { S[i,j] -> [j] }]", "{ [32,32] }", "[{ S[i,j] -> [32*floor(i/32)] }, { S[i,j] -> [32*floor(j/32)] }]", "[{ S[i,j] -> [i%32] }, { S[i,j] -> [j%32] }]", }, }; /* Basic tiling tests. Create a schedule tree with a domain and a band node, * tile the band and then check if the tile and point bands have the * expected partial schedule. */ static int test_tile(isl_ctx *ctx) { int i; int scale; int shift; scale = isl_options_get_tile_scale_tile_loops(ctx); shift = isl_options_get_tile_shift_point_loops(ctx); for (i = 0; i < ARRAY_SIZE(tile_tests); ++i) { int opt; int equal; const char *str; isl_union_set *domain; isl_multi_union_pw_aff *mupa, *mupa2; isl_schedule_node *node; isl_multi_val *sizes; opt = tile_tests[i].scale_tile; isl_options_set_tile_scale_tile_loops(ctx, opt); opt = tile_tests[i].shift_point; isl_options_set_tile_shift_point_loops(ctx, opt); str = tile_tests[i].domain; domain = isl_union_set_read_from_str(ctx, str); node = isl_schedule_node_from_domain(domain); node = isl_schedule_node_child(node, 0); str = tile_tests[i].schedule; mupa = isl_multi_union_pw_aff_read_from_str(ctx, str); node = isl_schedule_node_insert_partial_schedule(node, mupa); str = tile_tests[i].sizes; sizes = isl_multi_val_read_from_str(ctx, str); node = isl_schedule_node_band_tile(node, sizes); str = tile_tests[i].tile; mupa = isl_multi_union_pw_aff_read_from_str(ctx, str); mupa2 = isl_schedule_node_band_get_partial_schedule(node); equal = isl_multi_union_pw_aff_plain_is_equal(mupa, mupa2); isl_multi_union_pw_aff_free(mupa); isl_multi_union_pw_aff_free(mupa2); node = isl_schedule_node_child(node, 0); str = tile_tests[i].point; mupa = isl_multi_union_pw_aff_read_from_str(ctx, str); mupa2 = isl_schedule_node_band_get_partial_schedule(node); if (equal >= 0 && equal) equal = isl_multi_union_pw_aff_plain_is_equal(mupa, mupa2); isl_multi_union_pw_aff_free(mupa); isl_multi_union_pw_aff_free(mupa2); isl_schedule_node_free(node); if (equal < 0) return -1; if (!equal) isl_die(ctx, isl_error_unknown, "unexpected result", return -1); } isl_options_set_tile_scale_tile_loops(ctx, scale); isl_options_set_tile_shift_point_loops(ctx, shift); return 0; } struct { const char *name; int (*fn)(isl_ctx *ctx); } tests [] = { { "dual", &test_dual }, { "dependence analysis", &test_flow }, { "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 }, { "multi piecewise affine expressions", &test_multi_pw_aff }, { "conversion", &test_conversion }, { "list", &test_list }, { "align parameters", &test_align_parameters }, { "preimage", &test_preimage }, { "pullback", &test_pullback }, { "AST", &test_ast }, { "AST build", &test_ast_build }, { "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 }, { "disjoint", &test_disjoint }, { "product", &test_product }, { "dim_max", &test_dim_max }, { "affine", &test_aff }, { "injective", &test_injective }, { "schedule", &test_schedule }, { "schedule tree grouping", &test_schedule_tree_group }, { "tile", &test_tile }, { "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 }, { "min", &test_min }, { "gist", &test_gist }, { "piecewise quasi-polynomials", &test_pwqp }, { "lift", &test_lift }, { "bound", &test_bound }, { "union", &test_union }, { "split periods", &test_split_periods }, { "lexicographic order", &test_lex }, { "bijectivity", &test_bijective }, { "dataflow analysis", &test_dep }, { "reading", &test_read }, { "bounded", &test_bounded }, { "construction", &test_construction }, { "dimension manipulation", &test_dim }, { "map application", &test_application }, { "convex hull", &test_convex_hull }, { "transitive closure", &test_closure }, }; int main(int argc, char **argv) { int i; struct isl_ctx *ctx; struct isl_options *options; srcdir = getenv("srcdir"); assert(srcdir); 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); for (i = 0; i < ARRAY_SIZE(tests); ++i) { printf("%s\n", tests[i].name); if (tests[i].fn(ctx) < 0) goto error; } isl_ctx_free(ctx); return 0; error: isl_ctx_free(ctx); return -1; } cloog-0.18.4/isl/isl_multi_gist.c0000644000175000017500000000150712554427055013626 00000000000000/* * Copyright 2011 Sven Verdoolaege * Copyright 2012-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 /* Compute the gist of "multi" with respect to the domain constraints * of "context". */ __isl_give MULTI(BASE) *FN(MULTI(BASE),gist)(__isl_take MULTI(BASE) *multi, __isl_take DOM *context) { return FN(FN(MULTI(BASE),apply),DOMBASE)(multi, context, &FN(EL,gist)); } /* Compute the gist of "multi" with respect to the parameter constraints * of "context". */ __isl_give MULTI(BASE) *FN(MULTI(BASE),gist_params)( __isl_take MULTI(BASE) *multi, __isl_take isl_set *context) { return FN(MULTI(BASE),apply_set)(multi, context, &FN(EL,gist_params)); } cloog-0.18.4/isl/isl_ast_private.h0000644000175000017500000000603712554427055013777 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, a user node or a mark node. * "else_node" is NULL if the if node does not have an else branch. * "cond" and "inc" are NULL for degenerate for nodes. * In case of a mark node, "mark" is the mark and "node" is the marked node. */ 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; struct { isl_id *mark; isl_ast_node *node; } m; } 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_alloc_mark(__isl_take isl_id *id, __isl_take isl_ast_node *node); __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.4/isl/aclocal.m40000644000175000017500000012317012554427644012300 00000000000000# generated automatically by aclocal 1.14.1 -*- Autoconf -*- # Copyright (C) 1996-2013 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_CONFIG_MACRO_DIRS], [m4_defun([_AM_CONFIG_MACRO_DIRS], [])m4_defun([AC_CONFIG_MACRO_DIRS], [_AM_CONFIG_MACRO_DIRS($@)])]) m4_ifndef([AC_AUTOCONF_VERSION], [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl m4_if(m4_defn([AC_AUTOCONF_VERSION]), [2.69],, [m4_warning([this file was generated for autoconf 2.69. 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-2013 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. # 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.14' 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.14.1], [], [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.14.1])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-2013 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. # 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-2013 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. # AM_CONDITIONAL(NAME, SHELL-CONDITION) # ------------------------------------- # Define a conditional. AC_DEFUN([AM_CONDITIONAL], [AC_PREREQ([2.52])dnl m4_if([$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-2013 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. # 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", "OBJC", "OBJCXX", "UPC", or "GJC". # 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 m4_if([$1], [CC], [depcc="$CC" am_compiler_list=], [$1], [CXX], [depcc="$CXX" am_compiler_list=], [$1], [OBJC], [depcc="$OBJC" am_compiler_list='gcc3 gcc'], [$1], [OBJCXX], [depcc="$OBJCXX" 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 10 /bin/sh. echo '/* dummy */' > 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], [dnl AS_HELP_STRING( [--enable-dependency-tracking], [do not reject slow dependency extractors]) AS_HELP_STRING( [--disable-dependency-tracking], [speeds up one-time build])]) 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-2013 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. # _AM_OUTPUT_DEPENDENCY_COMMANDS # ------------------------------ AC_DEFUN([_AM_OUTPUT_DEPENDENCY_COMMANDS], [{ # Older Autoconf 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"` # 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'`; 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-2013 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 macro actually does too much. Some checks are only needed if # your package does certain things. But this isn't really a big deal. dnl Redefine AC_PROG_CC to automatically invoke _AM_PROG_CC_C_O. m4_define([AC_PROG_CC], m4_defn([AC_PROG_CC]) [_AM_PROG_CC_C_O ]) # 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.65])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], [AC_DIAGNOSE([obsolete], [$0: two- and three-arguments forms are deprecated.]) 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], [ok]):m4_ifdef([AC_PACKAGE_VERSION], [ok]), [ok:ok],, [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([AC_PROG_MKDIR_P])dnl # For better backward compatibility. To be removed once Automake 1.9.x # dies out for good. For more background, see: # # AC_SUBST([mkdir_p], ['$(MKDIR_P)']) # 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])], [m4_define([AC_PROG_CC], m4_defn([AC_PROG_CC])[_AM_DEPENDENCIES([CC])])])dnl AC_PROVIDE_IFELSE([AC_PROG_CXX], [_AM_DEPENDENCIES([CXX])], [m4_define([AC_PROG_CXX], m4_defn([AC_PROG_CXX])[_AM_DEPENDENCIES([CXX])])])dnl AC_PROVIDE_IFELSE([AC_PROG_OBJC], [_AM_DEPENDENCIES([OBJC])], [m4_define([AC_PROG_OBJC], m4_defn([AC_PROG_OBJC])[_AM_DEPENDENCIES([OBJC])])])dnl AC_PROVIDE_IFELSE([AC_PROG_OBJCXX], [_AM_DEPENDENCIES([OBJCXX])], [m4_define([AC_PROG_OBJCXX], m4_defn([AC_PROG_OBJCXX])[_AM_DEPENDENCIES([OBJCXX])])])dnl ]) AC_REQUIRE([AM_SILENT_RULES])dnl dnl The testsuite driver may need to know about EXEEXT, so add the dnl 'am__EXEEXT' conditional if _AM_COMPILER_EXEEXT was seen. This dnl macro 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 # POSIX will say in a future version that running "rm -f" with no argument # is OK; and we want to be able to make that assumption in our Makefile # recipes. So use an aggressive probe to check that the usage we want is # actually supported "in the wild" to an acceptable degree. # See automake bug#10828. # To make any issue more visible, cause the running configure to be aborted # by default if the 'rm' program in use doesn't match our expectations; the # user can still override this though. if rm -f && rm -fr && rm -rf; then : OK; else cat >&2 <<'END' Oops! Your 'rm' program seems unable to run without file operands specified on the command line, even when the '-f' option is present. This is contrary to the behaviour of most rm programs out there, and not conforming with the upcoming POSIX standard: Please tell bug-automake@gnu.org about your system, including the value of your $PATH and any error possibly output before this message. This can help us improve future automake versions. END if test x"$ACCEPT_INFERIOR_RM_PROGRAM" = x"yes"; then echo 'Configuration will proceed anyway, since you have set the' >&2 echo 'ACCEPT_INFERIOR_RM_PROGRAM variable to "yes"' >&2 echo >&2 else cat >&2 <<'END' Aborting the configuration process, to ensure you take notice of the issue. You can download and install GNU coreutils to get an 'rm' implementation that behaves properly: . If you want to complete the configuration process using your problematic 'rm' anyway, export the environment variable ACCEPT_INFERIOR_RM_PROGRAM to "yes", and re-run configure. END AC_MSG_ERROR([Your 'rm' program is bad, sorry.]) fi fi]) 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-2013 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. # 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-2013 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. # 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-2013 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. # 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-2013 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. # 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 is modern enough. # If it is, 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 --is-lightweight"; then am_missing_run="$MISSING " else am_missing_run= AC_MSG_WARN(['missing' script is too old or missing]) fi ]) # Helper functions for option handling. -*- Autoconf -*- # Copyright (C) 2001-2013 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. # _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])]) # Copyright (C) 1999-2013 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. # _AM_PROG_CC_C_O # --------------- # Like AC_PROG_CC_C_O, but changed for automake. We rewrite AC_PROG_CC # to automatically call this. AC_DEFUN([_AM_PROG_CC_C_O], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl AC_REQUIRE_AUX_FILE([compile])dnl AC_LANG_PUSH([C])dnl AC_CACHE_CHECK( [whether $CC understands -c and -o together], [am_cv_prog_cc_c_o], [AC_LANG_CONFTEST([AC_LANG_PROGRAM([])]) # Make sure it works both with $CC and with simple cc. # Following AC_PROG_CC_C_O, we do the test twice because some # compilers refuse to overwrite an existing .o file with -o, # though they will create one. am_cv_prog_cc_c_o=yes for am_i in 1 2; do if AM_RUN_LOG([$CC -c conftest.$ac_ext -o conftest2.$ac_objext]) \ && test -f conftest2.$ac_objext; then : OK else am_cv_prog_cc_c_o=no break fi done rm -f core conftest* unset am_i]) if test "$am_cv_prog_cc_c_o" != yes; then # Losing compiler, so override with the script. # FIXME: It is wrong to rewrite CC. # But if we don't then we get into trouble of one sort or another. # A longer-term fix would be to have automake use am__CC in this case, # and then we could set am__CC="\$(top_srcdir)/compile \$(CC)" CC="$am_aux_dir/compile $CC" fi AC_LANG_POP([C])]) # For backward compatibility. AC_DEFUN_ONCE([AM_PROG_CC_C_O], [AC_REQUIRE([AC_PROG_CC])]) # Copyright (C) 2001-2013 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. # AM_RUN_LOG(COMMAND) # ------------------- # Run COMMAND, save the exit status in ac_status, and log it. # (This has been adapted from Autoconf's _AC_RUN_LOG macro.) AC_DEFUN([AM_RUN_LOG], [{ echo "$as_me:$LINENO: $1" >&AS_MESSAGE_LOG_FD ($1) >&AS_MESSAGE_LOG_FD 2>&AS_MESSAGE_LOG_FD ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&AS_MESSAGE_LOG_FD (exit $ac_status); }]) # Check to make sure that the build environment is sane. -*- Autoconf -*- # Copyright (C) 1996-2013 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. # AM_SANITY_CHECK # --------------- AC_DEFUN([AM_SANITY_CHECK], [AC_MSG_CHECKING([whether build environment is sane]) # 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 ( am_has_slept=no for am_try in 1 2; do echo "timestamp, slept: $am_has_slept" > conftest.file 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 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 if test "$[2]" = conftest.file || test $am_try -eq 2; then break fi # Just in case. sleep 1 am_has_slept=yes done 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]) # If we didn't sleep, we still need to ensure time stamps of config.status and # generated files are strictly newer. am_sleep_pid= if grep 'slept: no' conftest.file >/dev/null 2>&1; then ( sleep 1 ) & am_sleep_pid=$! fi AC_CONFIG_COMMANDS_PRE( [AC_MSG_CHECKING([that generated files are newer than configure]) if test -n "$am_sleep_pid"; then # Hide warnings about reused PIDs. wait $am_sleep_pid 2>/dev/null fi AC_MSG_RESULT([done])]) rm -f conftest.file ]) # Copyright (C) 2009-2013 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. # 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], [dnl AS_HELP_STRING( [--enable-silent-rules], [less verbose build output (undo: "make V=1")]) AS_HELP_STRING( [--disable-silent-rules], [verbose build output (undo: "make V=0")])dnl ]) 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-2013 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. # 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-2013 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. # _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-2013 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. # _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}']) # We'll loop over all known methods to create a tar archive until one works. _am_tools='gnutar m4_if([$1], [ustar], [plaintar]) pax cpio none' m4_if([$1], [v7], [am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -'], [m4_case([$1], [ustar], [# The POSIX 1988 'ustar' format is defined with fixed-size fields. # There is notably a 21 bits limit for the UID and the GID. In fact, # the 'pax' utility can hang on bigger UID/GID (see automake bug#8343 # and bug#13588). am_max_uid=2097151 # 2^21 - 1 am_max_gid=$am_max_uid # The $UID and $GID variables are not portable, so we need to resort # to the POSIX-mandated id(1) utility. Errors in the 'id' calls # below are definitely unexpected, so allow the users to see them # (that is, avoid stderr redirection). am_uid=`id -u || echo unknown` am_gid=`id -g || echo unknown` AC_MSG_CHECKING([whether UID '$am_uid' is supported by ustar format]) if test $am_uid -le $am_max_uid; then AC_MSG_RESULT([yes]) else AC_MSG_RESULT([no]) _am_tools=none fi AC_MSG_CHECKING([whether GID '$am_gid' is supported by ustar format]) if test $am_gid -le $am_max_gid; then AC_MSG_RESULT([yes]) else AC_MSG_RESULT([no]) _am_tools=none fi], [pax], [], [m4_fatal([Unknown tar format])]) AC_MSG_CHECKING([how to create a $1 tar archive]) # Go ahead even if we have the value already cached. We do so because we # need to set the values for the 'am__tar' and 'am__untar' variables. _am_tools=${am_cv_prog_tar_$1-$_am_tools} 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_detect_gmp.m4]) m4_include([m4/ax_detect_imath.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.4/isl/isl_map_private.h0000644000175000017500000004546412554427055013774 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 #include #include #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_MAP_REDUCED_COEFFICIENTS (1 << 8) #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) #define ISL_BASIC_SET_REDUCED_COEFFICIENTS (1 << 8) 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_basic_set *isl_basic_set_alloc(isl_ctx *ctx, unsigned nparam, unsigned dim, unsigned extra, unsigned n_eq, unsigned n_ineq); __isl_give isl_basic_set *isl_basic_set_extend(__isl_take isl_basic_set *base, unsigned nparam, unsigned dim, unsigned extra, unsigned n_eq, unsigned n_ineq); __isl_give isl_basic_set *isl_basic_set_extend_constraints( __isl_take isl_basic_set *base, unsigned n_eq, unsigned n_ineq); __isl_give isl_basic_set *isl_basic_set_finalize( __isl_take isl_basic_set *bset); __isl_give isl_basic_set *isl_basic_set_dup(__isl_keep isl_basic_set *bset); __isl_give isl_basic_set *isl_basic_set_simplify( __isl_take isl_basic_set *bset); __isl_give isl_basic_map *isl_basic_map_alloc(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_finalize( __isl_take isl_basic_map *bmap); __isl_give isl_basic_map *isl_basic_map_extend(__isl_take isl_basic_map *base, unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra, unsigned n_eq, unsigned n_ineq); __isl_give isl_basic_map *isl_basic_map_extend_constraints( __isl_take isl_basic_map *base, unsigned n_eq, unsigned n_ineq); __isl_give isl_basic_map *isl_basic_map_simplify( __isl_take isl_basic_map *bmap); __isl_give isl_set *isl_set_alloc(isl_ctx *ctx, unsigned nparam, unsigned dim, int n, unsigned flags); __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set, __isl_take isl_basic_set *bset); __isl_give isl_set *isl_set_finalize(__isl_take isl_set *set); __isl_give isl_set *isl_set_dup(__isl_keep isl_set *set); __isl_give isl_map *isl_map_alloc(isl_ctx *ctx, unsigned nparam, unsigned in, unsigned out, int n, unsigned flags); __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_dup(__isl_keep isl_map *map); __isl_give isl_map *isl_map_finalize(__isl_take isl_map *map); __isl_give isl_basic_set *isl_basic_set_from_underlying_set( __isl_take isl_basic_set *bset, __isl_take isl_basic_set *like); __isl_give isl_set *isl_set_from_underlying_set( __isl_take isl_set *set, __isl_take isl_basic_set *like); __isl_give isl_set *isl_set_to_underlying_set(__isl_take isl_set *set); __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); isl_bool isl_basic_set_contains(__isl_keep isl_basic_set *bset, __isl_keep isl_vec *vec); isl_bool isl_basic_map_contains(__isl_keep isl_basic_map *bmap, __isl_keep 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); uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map *bmap); 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_map *isl_map_align_divs_to_basic_map_list( __isl_take isl_map *map, __isl_keep isl_basic_map_list *list); __isl_give isl_basic_map_list *isl_basic_map_list_align_divs_to_basic_map( __isl_take isl_basic_map_list *list, __isl_keep isl_basic_map *bmap); __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); isl_bool 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); __isl_give isl_basic_set_list *isl_basic_map_list_underlying_set( __isl_take isl_basic_map_list *list); 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); __isl_give isl_basic_map *isl_basic_map_remove_duplicate_constraints( __isl_take isl_basic_map *bmap, int *progress, int detect_divs); __isl_give isl_basic_map *isl_basic_map_detect_inequality_pairs( __isl_take isl_basic_map *bmap, int *progress); struct isl_map *isl_map_remove_empty_parts(struct isl_map *map); struct isl_set *isl_set_remove_empty_parts(struct isl_set *set); __isl_give isl_map *isl_map_remove_obvious_duplicates(__isl_take isl_map *map); 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_constraint(__isl_keep isl_basic_map *bmap, unsigned div, int sign); int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div); __isl_give isl_basic_map *isl_basic_map_add_known_div_constraints( __isl_take isl_basic_map *bmap); 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); isl_bool isl_basic_map_contains_point(__isl_keep isl_basic_map *bmap, __isl_keep isl_point *point); isl_bool 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)); isl_bool isl_map_align_params_map_map_and_test(__isl_keep isl_map *map1, __isl_keep isl_map *map2, isl_bool (*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); isl_bool isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map *bmap); int isl_map_is_set(__isl_keep isl_map *map); int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set *bset, unsigned dim, isl_int *val); __isl_give isl_basic_map *isl_basic_map_plain_affine_hull( __isl_take isl_basic_map *bmap); 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); __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_set *isl_set_fix(__isl_take isl_set *set, enum isl_dim_type type, unsigned pos, isl_int value); int isl_map_plain_is_fixed(__isl_keep isl_map *map, enum isl_dim_type type, unsigned pos, isl_int *val); int isl_basic_map_output_defining_equality(__isl_keep isl_basic_map *bmap, int pos); __isl_give isl_basic_map *isl_basic_map_reduce_coefficients( __isl_take isl_basic_map *bmap); __isl_give isl_basic_map *isl_basic_map_shift_div( __isl_take isl_basic_map *bmap, int div, isl_int shift); __isl_give isl_basic_map_list *isl_map_get_basic_map_list( __isl_keep isl_map *map); __isl_give isl_map *isl_map_fixed_power(__isl_take isl_map *map, isl_int exp); 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); #endif cloog-0.18.4/isl/isl_power_templ.c0000644000175000017500000000342212413256472013776 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.4/isl/isl_band.c0000644000175000017500000004361212554427055012355 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->coincident = isl_alloc_array(ctx, int, band->n); if (band->n && !dup->coincident) goto error; for (i = 0; i < band->n; ++i) dup->coincident[i] = band->coincident[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. */ __isl_null isl_band *isl_band_free(__isl_take isl_band *band) { if (!band) return NULL; if (--band->ref > 0) { isl_schedule_free(band->schedule); return NULL; } isl_union_pw_multi_aff_free(band->pma); isl_band_list_free(band->children); free(band->coincident); 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 coincident within the band and * with respect to the coincidence constraints. */ int isl_band_member_is_coincident(__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->coincident[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_union_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 isl_stat 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 isl_stat_ok; } /* 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 isl_stat 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 isl_stat_ok; error: isl_pw_multi_aff_free(pma); isl_pw_multi_aff_free(data->tiled); return isl_stat_error; } /* 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 isl_stat 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 isl_stat_error; } /* 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 isl_stat 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 isl_stat_error; return isl_stat_ok; } /* 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->coincident[i - n] = band->coincident[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.4/isl/isl_options.c0000644000175000017500000003070612554427055013144 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_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} }; #define ISL_SCHEDULE_FUSE_MAX 0 #define ISL_SCHEDULE_FUSE_MIN 1 static struct isl_arg_choice fuse[] = { {"max", ISL_SCHEDULE_FUSE_MAX}, {"min", ISL_SCHEDULE_FUSE_MIN}, {0} }; /* Callback for setting the "schedule-fuse" option. * This (now hidden) option tries to mimic an option that was * replaced by the schedule-serialize-sccs option. * Setting the old option to ISL_SCHEDULE_FUSE_MIN is now * expressed by turning on the schedule-serialize-sccs option. */ static int set_fuse(void *opt, unsigned val) { struct isl_options *options = opt; options->schedule_serialize_sccs = (val == ISL_SCHEDULE_FUSE_MIN); return 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, 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_coincidence, 0, "schedule-outer-coincidence", 0, "try to construct schedules where the outer member of each band " "satisfies the coincidence constraints") 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_BOOL(struct isl_options, schedule_serialize_sccs, 0, "schedule-serialize-sccs", 0, "serialize strongly connected components in dependence graph") ISL_ARG_PHANTOM_USER_CHOICE_F(0, "schedule-fuse", fuse, &set_fuse, ISL_SCHEDULE_FUSE_MAX, "level of fusion during scheduling", ISL_ARG_HIDDEN) 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_always_print_block, 0, "ast-always-print-block", 0, "print for and if bodies as a block " "regardless of the number of statements in the body") 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_BOOL(struct isl_options, print_stats, 0, "print-stats", 0, "print statistics for every isl_ctx") ISL_ARG_ULONG(struct isl_options, max_operations, 0, "max-operations", 0, "default number of maximal operations per isl_ctx") 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_coincidence) ISL_CTX_GET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, schedule_outer_coincidence) 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_BOOL_DEF(isl_options, struct isl_options, isl_options_args, schedule_serialize_sccs) ISL_CTX_GET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, schedule_serialize_sccs) 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_BOOL_DEF(isl_options, struct isl_options, isl_options_args, ast_always_print_block) ISL_CTX_GET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, ast_always_print_block) 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.4/isl/isl_schedule_node_private.h0000644000175000017500000000413012554427055016001 00000000000000#ifndef ISL_SCHEDLUE_NODE_PRIVATE_H #define ISL_SCHEDLUE_NODE_PRIVATE_H #include #include /* An isl_schedule_node points to a particular location in a schedule tree. * * "schedule" is the schedule that the node is pointing to. * "ancestors" is a list of the n ancestors of the node * that is being pointed to. * The first ancestor is the root of "schedule", while the last ancestor * is the parent of the specified location. * "child_pos" is an array of child positions of the same length as "ancestors", * where ancestor i (i > 0) appears in child_pos[i - 1] of ancestor i - 1 and * "tree" appears in child_pos[n - 1] of ancestor n - 1. * "tree" is the subtree at the specified location. * * Note that the same isl_schedule_tree object may appear several times * in a schedule tree and therefore does not uniquely identify a position * in the schedule tree. */ struct isl_schedule_node { int ref; isl_schedule *schedule; isl_schedule_tree_list *ancestors; int *child_pos; isl_schedule_tree *tree; }; __isl_give isl_schedule_node *isl_schedule_node_alloc( __isl_take isl_schedule *schedule, __isl_take isl_schedule_tree *tree, __isl_take isl_schedule_tree_list *ancestors, int *child_pos); __isl_give isl_schedule_node *isl_schedule_node_graft_tree( __isl_take isl_schedule_node *pos, __isl_take isl_schedule_tree *tree); __isl_give isl_schedule_tree *isl_schedule_node_get_tree( __isl_keep isl_schedule_node *node); __isl_give isl_schedule_node *isl_schedule_node_pullback_union_pw_multi_aff( __isl_take isl_schedule_node *node, __isl_take isl_union_pw_multi_aff *upma); __isl_give isl_schedule_node *isl_schedule_node_domain_intersect_domain( __isl_take isl_schedule_node *node, __isl_take isl_union_set *domain); __isl_give isl_schedule_node *isl_schedule_node_insert_expansion( __isl_take isl_schedule_node *node, __isl_take isl_union_pw_multi_aff *contraction, __isl_take isl_union_map *expansion); __isl_give isl_schedule_node *isl_schedule_node_insert_extension( __isl_take isl_schedule_node *node, __isl_take isl_union_map *extension); #endif cloog-0.18.4/isl/isl_point.c0000644000175000017500000003220412554427055012575 00000000000000#include #include #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)); } isl_bool isl_point_is_void(__isl_keep isl_point *pnt) { if (!pnt) return isl_bool_error; 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; isl_stat (*fn)(__isl_take isl_point *pnt, void *user); void *user; isl_space *dim; }; static isl_stat 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); } isl_stat isl_set_foreach_point(__isl_keep isl_set *set, isl_stat (*fn)(__isl_take isl_point *pnt, void *user), void *user) { struct isl_foreach_point fp = { { &foreach_point }, fn, user }; int i; if (!set) return isl_stat_error; fp.dim = isl_set_get_space(set); if (!fp.dim) return isl_stat_error; 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 isl_stat_ok; error: isl_set_free(set); isl_space_free(fp.dim); return isl_stat_error; } /* 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. */ isl_bool isl_basic_map_contains_point(__isl_keep isl_basic_map *bmap, __isl_keep isl_point *point) { int i; struct isl_vec *vec; unsigned dim; isl_bool contains; if (!bmap || !point) return isl_bool_error; isl_assert(bmap->ctx, isl_space_is_equal(bmap->dim, point->dim), return isl_bool_error); 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 isl_bool_error; 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; } isl_bool 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; if (!pnt) return NULL; 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.4/isl/isl_int.h0000644000175000017500000000227612413271702012237 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 #define ISL_DEPRECATED_INT_H #include #include #include #include #ifdef USE_GMP_FOR_MP #include #endif #ifdef USE_IMATH_FOR_MP #include #endif #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_print(out,i,width) \ do { \ char *s; \ s = isl_int_get_str(i); \ fprintf(out, "%*s", width, s); \ isl_int_free_str(s); \ } while (0) __isl_give isl_printer *isl_printer_print_isl_int(__isl_take isl_printer *p, isl_int i); #endif /* ISL_INT_H */ cloog-0.18.4/isl/isl_tarjan.c0000644000175000017500000000630512554427055012726 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 isl_stat isl_tarjan_components(struct isl_tarjan_graph *g, int i, isl_bool (*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) { isl_bool 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 isl_stat_error; 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 isl_stat_ok; 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 isl_stat_ok; } /* 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, isl_bool (*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.4/isl/Makefile.in0000644000175000017500000022641212554427647012513 00000000000000# Makefile.in generated by automake 1.14.1 from Makefile.am. # @configure_input@ # Copyright (C) 1994-2013 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@ am__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)' am__make_running_with_option = \ case $${target_option-} in \ ?) ;; \ *) echo "am__make_running_with_option: internal error: invalid" \ "target option '$${target_option-}' specified" >&2; \ exit 1;; \ esac; \ has_opt=no; \ sane_makeflags=$$MAKEFLAGS; \ if $(am__is_gnu_make); then \ sane_makeflags=$$MFLAGS; \ else \ case $$MAKEFLAGS in \ *\\[\ \ ]*) \ bs=\\; \ sane_makeflags=`printf '%s\n' "$$MAKEFLAGS" \ | sed "s/$$bs$$bs[$$bs $$bs ]*//g"`;; \ esac; \ fi; \ skip_next=no; \ strip_trailopt () \ { \ flg=`printf '%s\n' "$$flg" | sed "s/$$1.*$$//"`; \ }; \ for flg in $$sane_makeflags; do \ test $$skip_next = yes && { skip_next=no; continue; }; \ case $$flg in \ *=*|--*) continue;; \ -*I) strip_trailopt 'I'; skip_next=yes;; \ -*I?*) strip_trailopt 'I';; \ -*O) strip_trailopt 'O'; skip_next=yes;; \ -*O?*) strip_trailopt 'O';; \ -*l) strip_trailopt 'l'; skip_next=yes;; \ -*l?*) strip_trailopt 'l';; \ -[dEDm]) skip_next=yes;; \ -[JT]) skip_next=yes;; \ esac; \ case $$flg in \ *$$target_option*) has_opt=yes; break;; \ esac; \ done; \ test $$has_opt = yes am__make_dryrun = (target_option=n; $(am__make_running_with_option)) am__make_keepgoing = (target_option=k; $(am__make_running_with_option)) 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 = $(srcdir)/Makefile.in $(srcdir)/Makefile.am \ $(top_srcdir)/configure $(am__configure_deps) \ $(srcdir)/isl_config.h.in $(srcdir)/bound_test.sh.in \ $(srcdir)/codegen_test.sh.in $(srcdir)/pip_test.sh.in depcomp \ $(deprecated_HEADERS) $(am__pkginclude_HEADERS_DIST) \ test-driver AUTHORS ChangeLog README compile config.guess \ config.sub install-sh missing ltmain.sh 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_detect_gmp.m4 \ $(top_srcdir)/m4/ax_detect_imath.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 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)$(deprecateddir)" "$(DESTDIR)$(pkgincludedir)" \ "$(DESTDIR)$(pkgincludedir)" LTLIBRARIES = $(lib_LTLIBRARIES) libisl_la_DEPENDENCIES = am__libisl_la_SOURCES_DIST = mp_get_memory_functions.c isl_int_gmp.h \ isl_gmp.c isl_val_gmp.c isl_hide_deprecated.h isl_imath.c \ isl_imath.h isl_int_imath.h isl_val_imath.c \ imath_wrap/gmp_compat.h imath_wrap/imath.h imath_wrap/imrat.h \ imath_wrap/wrap.h imath_wrap/gmp_compat.c imath_wrap/imath.c \ imath_wrap/imrat.c isl_ast_int.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_blk.h 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_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_hash.c isl_id_to_ast_expr.c \ isl_id_to_pw_aff.c isl_ilp.c isl_ilp_private.h isl_input.c \ isl_int.h isl_local_space_private.h isl_local_space.c isl_lp.c \ isl_lp_private.h isl_map.c isl_map_list.c isl_map_simplify.c \ isl_map_subtract.c isl_map_private.h isl_map_to_basic_set.c \ 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_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_band.c isl_schedule_band.h isl_schedule_node.c \ isl_schedule_node_private.h isl_schedule_read.c \ isl_schedule_tree.c isl_schedule_tree.h isl_schedule_private.h \ isl_scheduler.c 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_seq.h 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_private.h \ isl_vec_private.h isl_vec.c isl_version.c \ isl_vertices_private.h isl_vertices.c isl_yaml.h @GMP_FOR_MP_TRUE@@NEED_GET_MEMORY_FUNCTIONS_TRUE@am__objects_1 = mp_get_memory_functions.lo am__dirstamp = $(am__leading_dot)dirstamp @GMP_FOR_MP_FALSE@@IMATH_FOR_MP_TRUE@am__objects_2 = isl_imath.lo \ @GMP_FOR_MP_FALSE@@IMATH_FOR_MP_TRUE@ isl_val_imath.lo \ @GMP_FOR_MP_FALSE@@IMATH_FOR_MP_TRUE@ imath_wrap/gmp_compat.lo \ @GMP_FOR_MP_FALSE@@IMATH_FOR_MP_TRUE@ imath_wrap/imath.lo \ @GMP_FOR_MP_FALSE@@IMATH_FOR_MP_TRUE@ imath_wrap/imrat.lo @GMP_FOR_MP_TRUE@am__objects_2 = $(am__objects_1) isl_gmp.lo \ @GMP_FOR_MP_TRUE@ isl_val_gmp.lo @GMP_FOR_MP_TRUE@am__objects_3 = isl_ast_int.lo am_libisl_la_OBJECTS = $(am__objects_2) $(am__objects_3) isl_aff.lo \ isl_affine_hull.lo isl_arg.lo isl_ast.lo isl_ast_build.lo \ isl_ast_build_expr.lo isl_ast_codegen.lo isl_ast_graft.lo \ isl_band.lo basis_reduction_tab.lo isl_bernstein.lo isl_blk.lo \ isl_bound.lo isl_coalesce.lo isl_constraint.lo \ isl_convex_hull.lo isl_ctx.lo isl_deprecated.lo isl_dim_map.lo \ isl_equalities.lo isl_factorization.lo isl_farkas.lo \ isl_flow.lo isl_fold.lo isl_hash.lo isl_id_to_ast_expr.lo \ isl_id_to_pw_aff.lo isl_ilp.lo isl_input.lo isl_local_space.lo \ isl_lp.lo isl_map.lo isl_map_list.lo isl_map_simplify.lo \ isl_map_subtract.lo isl_map_to_basic_set.lo isl_mat.lo \ isl_morph.lo isl_id.lo isl_obj.lo isl_options.lo isl_output.lo \ isl_point.lo isl_polynomial.lo isl_printer.lo print.lo \ isl_range.lo isl_reordering.lo isl_sample.lo isl_scan.lo \ isl_schedule.lo isl_schedule_band.lo isl_schedule_node.lo \ isl_schedule_read.lo isl_schedule_tree.lo isl_scheduler.lo \ isl_set_list.lo isl_sort.lo isl_space.lo isl_stream.lo \ isl_seq.lo isl_tab.lo isl_tab_pip.lo isl_tarjan.lo \ isl_transitive_closure.lo isl_union_map.lo isl_val.lo \ isl_vec.lo isl_version.lo 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 am__v_lt_1 = 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 = 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 = cat.$(OBJEXT) isl_cat_OBJECTS = $(am_isl_cat_OBJECTS) isl_cat_DEPENDENCIES = libisl.la am_isl_closure_OBJECTS = closure.$(OBJEXT) isl_closure_OBJECTS = $(am_isl_closure_OBJECTS) isl_closure_DEPENDENCIES = libisl.la am_isl_codegen_OBJECTS = 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 = 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 = \ 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 = 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 = polyhedron_sample.$(OBJEXT) isl_polyhedron_sample_OBJECTS = $(am_isl_polyhedron_sample_OBJECTS) isl_polyhedron_sample_DEPENDENCIES = libisl.la am_isl_polytope_scan_OBJECTS = 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.$(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 $@ AM_V_P = $(am__v_P_@AM_V@) am__v_P_ = $(am__v_P_@AM_DEFAULT_V@) am__v_P_0 = false am__v_P_1 = : 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_GEN_1 = AM_V_at = $(am__v_at_@AM_V@) am__v_at_ = $(am__v_at_@AM_DEFAULT_V@) am__v_at_0 = @ am__v_at_1 = 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_CC_1 = 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_CCLD_1 = SOURCES = $(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) $(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 cscopelist-recursive \ ctags-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 \ tags-recursive uninstall-recursive am__can_run_installinfo = \ case $$AM_UPDATE_INFO_DIR in \ n|no|NO) false;; \ *) (install-info --version) >/dev/null 2>&1;; \ esac DATA = $(pkgconfig_DATA) am__pkginclude_HEADERS_DIST = include/isl/val_gmp.h include/isl/aff.h \ include/isl/aff_type.h include/isl/arg.h include/isl/ast.h \ include/isl/ast_type.h include/isl/ast_build.h \ include/isl/band.h include/isl/constraint.h include/isl/ctx.h \ include/isl/flow.h include/isl/id.h \ include/isl/id_to_ast_expr.h include/isl/id_to_pw_aff.h \ include/isl/ilp.h include/isl/hash.h include/isl/hmap.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_to_basic_set.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/schedule_node.h \ include/isl/schedule_type.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/vec.h include/isl/version.h include/isl/vertices.h HEADERS = $(deprecated_HEADERS) $(nodist_pkginclude_HEADERS) \ $(pkginclude_HEADERS) RECURSIVE_CLEAN_TARGETS = mostlyclean-recursive clean-recursive \ distclean-recursive maintainer-clean-recursive am__recursive_targets = \ $(RECURSIVE_TARGETS) \ $(RECURSIVE_CLEAN_TARGETS) \ $(am__extra_recursive_targets) AM_RECURSIVE_TARGETS = $(am__recursive_targets:-recursive=) TAGS CTAGS \ cscope check recheck distdir dist dist-all distcheck am__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) \ $(LISP)isl_config.h.in # Read a list of newline-separated strings from the standard input, # and print each of them once, without duplicates. Input order is # *not* preserved. am__uniquify_input = $(AWK) '\ BEGIN { nonempty = 0; } \ { items[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in items) print i; }; } \ ' # Make sure the list of sources is unique. This is necessary because, # e.g., the same source file might be shared among _SOURCES variables # for different programs/libraries. am__define_uniq_tagged_files = \ list='$(am__tagged_files)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | $(am__uniquify_input)` ETAGS = etags CTAGS = ctags CSCOPE = cscope am__tty_colors_dummy = \ mgn= red= grn= lgn= blu= brg= std=; \ am__color_tests=no am__tty_colors = { \ $(am__tty_colors_dummy); \ if test "X$(AM_COLOR_TESTS)" = Xno; then \ am__color_tests=no; \ elif test "X$(AM_COLOR_TESTS)" = Xalways; then \ am__color_tests=yes; \ elif test "X$$TERM" != Xdumb && { test -t 1; } 2>/dev/null; then \ am__color_tests=yes; \ fi; \ if test $$am__color_tests = yes; then \ red=''; \ grn=''; \ lgn=''; \ blu=''; \ mgn=''; \ brg=''; \ std=''; \ fi; \ } am__recheck_rx = ^[ ]*:recheck:[ ]* am__global_test_result_rx = ^[ ]*:global-test-result:[ ]* am__copy_in_global_log_rx = ^[ ]*:copy-in-global-log:[ ]* # A command that, given a newline-separated list of test names on the # standard input, print the name of the tests that are to be re-run # upon "make recheck". am__list_recheck_tests = $(AWK) '{ \ recheck = 1; \ while ((rc = (getline line < ($$0 ".trs"))) != 0) \ { \ if (rc < 0) \ { \ if ((getline line2 < ($$0 ".log")) < 0) \ recheck = 0; \ break; \ } \ else if (line ~ /$(am__recheck_rx)[nN][Oo]/) \ { \ recheck = 0; \ break; \ } \ else if (line ~ /$(am__recheck_rx)[yY][eE][sS]/) \ { \ break; \ } \ }; \ if (recheck) \ print $$0; \ close ($$0 ".trs"); \ close ($$0 ".log"); \ }' # A command that, given a newline-separated list of test names on the # standard input, create the global log from their .trs and .log files. am__create_global_log = $(AWK) ' \ function fatal(msg) \ { \ print "fatal: making $@: " msg | "cat >&2"; \ exit 1; \ } \ function rst_section(header) \ { \ print header; \ len = length(header); \ for (i = 1; i <= len; i = i + 1) \ printf "="; \ printf "\n\n"; \ } \ { \ copy_in_global_log = 1; \ global_test_result = "RUN"; \ while ((rc = (getline line < ($$0 ".trs"))) != 0) \ { \ if (rc < 0) \ fatal("failed to read from " $$0 ".trs"); \ if (line ~ /$(am__global_test_result_rx)/) \ { \ sub("$(am__global_test_result_rx)", "", line); \ sub("[ ]*$$", "", line); \ global_test_result = line; \ } \ else if (line ~ /$(am__copy_in_global_log_rx)[nN][oO]/) \ copy_in_global_log = 0; \ }; \ if (copy_in_global_log) \ { \ rst_section(global_test_result ": " $$0); \ while ((rc = (getline line < ($$0 ".log"))) != 0) \ { \ if (rc < 0) \ fatal("failed to read from " $$0 ".log"); \ print line; \ }; \ printf "\n"; \ }; \ close ($$0 ".trs"); \ close ($$0 ".log"); \ }' # Restructured Text title. am__rst_title = { sed 's/.*/ & /;h;s/./=/g;p;x;s/ *$$//;p;g' && echo; } # Solaris 10 'make', and several other traditional 'make' implementations, # pass "-e" to $(SHELL), and POSIX 2008 even requires this. Work around it # by disabling -e (using the XSI extension "set +e") if it's set. am__sh_e_setup = case $$- in *e*) set +e;; esac # Default flags passed to test drivers. am__common_driver_flags = \ --color-tests "$$am__color_tests" \ --enable-hard-errors "$$am__enable_hard_errors" \ --expect-failure "$$am__expect_failure" # To be inserted before the command running the test. Creates the # directory for the log if needed. Stores in $dir the directory # containing $f, in $tst the test, in $log the log. Executes the # developer- defined test setup AM_TESTS_ENVIRONMENT (if any), and # passes TESTS_ENVIRONMENT. Set up options for the wrapper that # will run the test scripts (or their associated LOG_COMPILER, if # thy have one). am__check_pre = \ $(am__sh_e_setup); \ $(am__vpath_adj_setup) $(am__vpath_adj) \ $(am__tty_colors); \ srcdir=$(srcdir); export srcdir; \ case "$@" in \ */*) am__odir=`echo "./$@" | sed 's|/[^/]*$$||'`;; \ *) am__odir=.;; \ esac; \ test "x$$am__odir" = x"." || test -d "$$am__odir" \ || $(MKDIR_P) "$$am__odir" || exit $$?; \ if test -f "./$$f"; then dir=./; \ elif test -f "$$f"; then dir=; \ else dir="$(srcdir)/"; fi; \ tst=$$dir$$f; log='$@'; \ if test -n '$(DISABLE_HARD_ERRORS)'; then \ am__enable_hard_errors=no; \ else \ am__enable_hard_errors=yes; \ fi; \ case " $(XFAIL_TESTS) " in \ *[\ \ ]$$f[\ \ ]* | *[\ \ ]$$dir$$f[\ \ ]*) \ am__expect_failure=yes;; \ *) \ am__expect_failure=no;; \ esac; \ $(AM_TESTS_ENVIRONMENT) $(TESTS_ENVIRONMENT) # A shell command to get the names of the tests scripts with any registered # extension removed (i.e., equivalently, the names of the test logs, with # the '.log' extension removed). The result is saved in the shell variable # '$bases'. This honors runtime overriding of TESTS and TEST_LOGS. Sadly, # we cannot use something simpler, involving e.g., "$(TEST_LOGS:.log=)", # since that might cause problem with VPATH rewrites for suffix-less tests. # See also 'test-harness-vpath-rewrite.sh' and 'test-trs-basic.sh'. am__set_TESTS_bases = \ bases='$(TEST_LOGS)'; \ bases=`for i in $$bases; do echo $$i; done | sed 's/\.log$$//'`; \ bases=`echo $$bases` RECHECK_LOGS = $(TEST_LOGS) TEST_SUITE_LOG = test-suite.log TEST_EXTENSIONS = @EXEEXT@ .test LOG_DRIVER = $(SHELL) $(top_srcdir)/test-driver LOG_COMPILE = $(LOG_COMPILER) $(AM_LOG_FLAGS) $(LOG_FLAGS) am__set_b = \ case '$@' in \ */*) \ case '$*' in \ */*) b='$*';; \ *) b=`echo '$@' | sed 's/\.log$$//'`; \ esac;; \ *) \ b='$*';; \ esac am__test_logs1 = $(TESTS:=.log) am__test_logs2 = $(am__test_logs1:@EXEEXT@.log=.log) TEST_LOGS = $(am__test_logs2:.test.log=.log) TEST_LOG_DRIVER = $(SHELL) $(top_srcdir)/test-driver TEST_LOG_COMPILE = $(TEST_LOG_COMPILER) $(AM_TEST_LOG_FLAGS) \ $(TEST_LOG_FLAGS) 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__post_remove_distdir = $(am__remove_distdir) 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 DIST_TARGETS = dist-gzip 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@ 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@ MP_CPPFLAGS = @MP_CPPFLAGS@ MP_LDFLAGS = @MP_LDFLAGS@ MP_LIBS = @MP_LIBS@ 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@ 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 subdir-objects lib_LTLIBRARIES = libisl.la @GMP_FOR_MP_TRUE@MP_SRC = \ @GMP_FOR_MP_TRUE@ $(GET_MEMORY_FUNCTIONS) \ @GMP_FOR_MP_TRUE@ isl_int_gmp.h \ @GMP_FOR_MP_TRUE@ isl_gmp.c \ @GMP_FOR_MP_TRUE@ isl_val_gmp.c @IMATH_FOR_MP_TRUE@MP_SRC = \ @IMATH_FOR_MP_TRUE@ isl_hide_deprecated.h \ @IMATH_FOR_MP_TRUE@ isl_imath.c \ @IMATH_FOR_MP_TRUE@ isl_imath.h \ @IMATH_FOR_MP_TRUE@ isl_int_imath.h \ @IMATH_FOR_MP_TRUE@ isl_val_imath.c \ @IMATH_FOR_MP_TRUE@ imath_wrap/gmp_compat.h \ @IMATH_FOR_MP_TRUE@ imath_wrap/imath.h \ @IMATH_FOR_MP_TRUE@ imath_wrap/imrat.h \ @IMATH_FOR_MP_TRUE@ imath_wrap/wrap.h \ @IMATH_FOR_MP_TRUE@ imath_wrap/gmp_compat.c \ @IMATH_FOR_MP_TRUE@ imath_wrap/imath.c \ @IMATH_FOR_MP_TRUE@ imath_wrap/imrat.c @GMP_FOR_MP_TRUE@DEPRECATED_SRC = isl_ast_int.c @IMATH_FOR_MP_TRUE@DEPRECATED_SRC = @GMP_FOR_MP_TRUE@MP_INCLUDE_H = include/isl/val_gmp.h @IMATH_FOR_MP_TRUE@MP_INCLUDE_H = @GMP_FOR_MP_TRUE@@NEED_GET_MEMORY_FUNCTIONS_TRUE@GET_MEMORY_FUNCTIONS = mp_get_memory_functions.c AM_CPPFLAGS = -I. -I$(srcdir) -I$(srcdir)/include -Iinclude/ @MP_CPPFLAGS@ AM_CFLAGS = @WARNING_FLAGS@ libisl_la_SOURCES = \ $(MP_SRC) \ $(DEPRECATED_SRC) \ 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_blk.h \ 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_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_hash.c \ isl_id_to_ast_expr.c \ isl_id_to_pw_aff.c \ isl_ilp.c \ isl_ilp_private.h \ isl_input.c \ isl_int.h \ isl_local_space_private.h \ isl_local_space.c \ isl_lp.c \ isl_lp_private.h \ isl_map.c \ isl_map_list.c \ isl_map_simplify.c \ isl_map_subtract.c \ isl_map_private.h \ isl_map_to_basic_set.c \ 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_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_band.c \ isl_schedule_band.h \ isl_schedule_node.c \ isl_schedule_node_private.h \ isl_schedule_read.c \ isl_schedule_tree.c \ isl_schedule_tree.h \ isl_schedule_private.h \ isl_scheduler.c \ 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_seq.h \ 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_private.h \ isl_vec_private.h \ isl_vec.c \ isl_version.c \ isl_vertices_private.h \ isl_vertices.c \ isl_yaml.h libisl_la_LIBADD = @MP_LIBS@ libisl_la_LDFLAGS = -version-info @versioninfo@ \ @MP_LDFLAGS@ isl_test_LDFLAGS = @MP_LDFLAGS@ isl_test_LDADD = libisl.la @MP_LIBS@ isl_polyhedron_sample_LDADD = libisl.la isl_polyhedron_sample_SOURCES = \ polyhedron_sample.c isl_pip_LDFLAGS = @MP_LDFLAGS@ isl_pip_LDADD = libisl.la @MP_LIBS@ isl_pip_SOURCES = \ pip.c isl_codegen_LDFLAGS = @MP_LDFLAGS@ isl_codegen_LDADD = libisl.la @MP_LIBS@ isl_codegen_SOURCES = \ codegen.c isl_bound_LDFLAGS = @MP_LDFLAGS@ isl_bound_LDADD = libisl.la @MP_LIBS@ isl_bound_SOURCES = \ bound.c isl_polyhedron_minimize_LDFLAGS = @MP_LDFLAGS@ isl_polyhedron_minimize_LDADD = libisl.la @MP_LIBS@ isl_polyhedron_minimize_SOURCES = \ polyhedron_minimize.c isl_polytope_scan_LDADD = libisl.la isl_polytope_scan_SOURCES = \ polytope_scan.c isl_polyhedron_detect_equalities_LDADD = libisl.la isl_polyhedron_detect_equalities_SOURCES = \ polyhedron_detect_equalities.c isl_cat_LDADD = libisl.la isl_cat_SOURCES = \ cat.c isl_closure_LDADD = libisl.la isl_closure_SOURCES = \ closure.c nodist_pkginclude_HEADERS = \ include/isl/stdint.h pkginclude_HEADERS = \ $(MP_INCLUDE_H) \ include/isl/aff.h \ include/isl/aff_type.h \ include/isl/arg.h \ include/isl/ast.h \ include/isl/ast_type.h \ include/isl/ast_build.h \ include/isl/band.h \ include/isl/constraint.h \ include/isl/ctx.h \ include/isl/flow.h \ include/isl/id.h \ include/isl/id_to_ast_expr.h \ include/isl/id_to_pw_aff.h \ include/isl/ilp.h \ include/isl/hash.h \ include/isl/hmap.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_to_basic_set.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/schedule_node.h \ include/isl/schedule_type.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/vec.h \ include/isl/version.h \ include/isl/vertices.h deprecateddir = $(pkgincludedir)/deprecated deprecated_HEADERS = \ include/isl/deprecated/int.h \ include/isl/deprecated/aff_int.h \ include/isl/deprecated/ast_int.h \ include/isl/deprecated/constraint_int.h \ include/isl/deprecated/ilp_int.h \ include/isl/deprecated/map_int.h \ include/isl/deprecated/mat_int.h \ include/isl/deprecated/point_int.h \ include/isl/deprecated/polynomial_int.h \ include/isl/deprecated/set_int.h \ include/isl/deprecated/union_map_int.h \ include/isl/deprecated/val_int.h \ include/isl/deprecated/vec_int.h EXTRA_DIST = \ LICENSE \ isl_config_post.h \ basis_reduction_templ.c \ isl_hmap_templ.c \ isl_list_templ.c \ isl_list_templ.h \ isl_map_lexopt_templ.c \ isl_multi_macro.h \ isl_multi_templ.c \ isl_multi_templ.h \ isl_multi_apply_templ.c \ isl_multi_apply_set.c \ isl_multi_apply_union_set.c \ isl_multi_floor.c \ isl_multi_gist.c \ isl_multi_intersect.c \ print_templ.c \ isl_power_templ.c \ isl_pw_templ.c \ isl_union_templ.c \ isl.py \ doc/CodingStyle \ doc/SubmittingPatches \ doc/chicago.bst \ doc/chicago.sty \ doc/implementation.tex \ doc/isl.bib \ doc/mypod2latex \ doc/manual.tex \ doc/user.pod \ imath/gmp_compat.c \ imath/gmp_compat.h \ imath/imath.c \ imath/imath.h \ imath/imrat.c \ imath/imrat.h \ 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 .log .o .obj .test .test$(EXEEXT) .trs 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 @test -f $@ || rm -f stamp-h1 @test -f $@ || $(MAKE) $(AM_MAKEFLAGS) stamp-h1 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 $@ distclean-hdr: -rm -f isl_config.h stamp-h1 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) @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 " $(MKDIR_P) '$(DESTDIR)$(libdir)'"; \ $(MKDIR_P) "$(DESTDIR)$(libdir)" || exit 1; \ 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)'; \ locs=`for p in $$list; do echo $$p; done | \ sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \ sort -u`; \ test -z "$$locs" || { \ echo rm -f $${locs}; \ rm -f $${locs}; \ } imath_wrap/$(am__dirstamp): @$(MKDIR_P) imath_wrap @: > imath_wrap/$(am__dirstamp) imath_wrap/$(DEPDIR)/$(am__dirstamp): @$(MKDIR_P) imath_wrap/$(DEPDIR) @: > imath_wrap/$(DEPDIR)/$(am__dirstamp) imath_wrap/gmp_compat.lo: imath_wrap/$(am__dirstamp) \ imath_wrap/$(DEPDIR)/$(am__dirstamp) imath_wrap/imath.lo: imath_wrap/$(am__dirstamp) \ imath_wrap/$(DEPDIR)/$(am__dirstamp) imath_wrap/imrat.lo: imath_wrap/$(am__dirstamp) \ imath_wrap/$(DEPDIR)/$(am__dirstamp) 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) -rm -f imath_wrap/*.$(OBJEXT) -rm -f imath_wrap/*.lo distclean-compile: -rm -f *.tab.c @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/basis_reduction_tab.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/bound.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cat.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/closure.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/codegen.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_aff.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_affine_hull.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_arg.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_ast.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_ast_build.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_ast_build_expr.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_ast_codegen.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_ast_graft.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_ast_int.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_band.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_bernstein.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_blk.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_bound.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_coalesce.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_constraint.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_convex_hull.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_ctx.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_deprecated.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_dim_map.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_equalities.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_factorization.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_farkas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_flow.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_fold.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_gmp.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_hash.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_id.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_id_to_ast_expr.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_id_to_pw_aff.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_ilp.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_imath.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_input.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_local_space.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_lp.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_map.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_map_list.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_map_simplify.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_map_subtract.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_map_to_basic_set.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_mat.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_morph.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_obj.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_options.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_output.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_point.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_polynomial.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_printer.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_range.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_reordering.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_sample.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_scan.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_schedule.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_schedule_band.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_schedule_node.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_schedule_read.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_schedule_tree.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_scheduler.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_seq.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_set_list.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_sort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_space.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_stream.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_tab.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_tab_pip.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_tarjan.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_test.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_transitive_closure.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_union_map.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_val.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_val_gmp.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_val_imath.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_vec.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_version.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_vertices.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/mp_get_memory_functions.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/pip.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/polyhedron_detect_equalities.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/polyhedron_minimize.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/polyhedron_sample.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/polytope_scan.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/print.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@imath_wrap/$(DEPDIR)/gmp_compat.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@imath_wrap/$(DEPDIR)/imath.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@imath_wrap/$(DEPDIR)/imrat.Plo@am__quote@ .c.o: @am__fastdepCC_TRUE@ $(AM_V_CC)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\.o$$||'`;\ @am__fastdepCC_TRUE@ $(COMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\ @am__fastdepCC_TRUE@ $(am__mv) $$depbase.Tpo $$depbase.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 -o $@ $< .c.obj: @am__fastdepCC_TRUE@ $(AM_V_CC)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\.obj$$||'`;\ @am__fastdepCC_TRUE@ $(COMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\ @am__fastdepCC_TRUE@ $(am__mv) $$depbase.Tpo $$depbase.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 -o $@ `$(CYGPATH_W) '$<'` .c.lo: @am__fastdepCC_TRUE@ $(AM_V_CC)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\.lo$$||'`;\ @am__fastdepCC_TRUE@ $(LTCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\ @am__fastdepCC_TRUE@ $(am__mv) $$depbase.Tpo $$depbase.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 -rm -rf imath_wrap/.libs imath_wrap/_libs distclean-libtool: -rm -f libtool config.lt install-pkgconfigDATA: $(pkgconfig_DATA) @$(NORMAL_INSTALL) @list='$(pkgconfig_DATA)'; test -n "$(pkgconfigdir)" || list=; \ if test -n "$$list"; then \ echo " $(MKDIR_P) '$(DESTDIR)$(pkgconfigdir)'"; \ $(MKDIR_P) "$(DESTDIR)$(pkgconfigdir)" || exit 1; \ fi; \ 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-deprecatedHEADERS: $(deprecated_HEADERS) @$(NORMAL_INSTALL) @list='$(deprecated_HEADERS)'; test -n "$(deprecateddir)" || list=; \ if test -n "$$list"; then \ echo " $(MKDIR_P) '$(DESTDIR)$(deprecateddir)'"; \ $(MKDIR_P) "$(DESTDIR)$(deprecateddir)" || exit 1; \ fi; \ 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)$(deprecateddir)'"; \ $(INSTALL_HEADER) $$files "$(DESTDIR)$(deprecateddir)" || exit $$?; \ done uninstall-deprecatedHEADERS: @$(NORMAL_UNINSTALL) @list='$(deprecated_HEADERS)'; test -n "$(deprecateddir)" || list=; \ files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \ dir='$(DESTDIR)$(deprecateddir)'; $(am__uninstall_files_from_dir) install-nodist_pkgincludeHEADERS: $(nodist_pkginclude_HEADERS) @$(NORMAL_INSTALL) @list='$(nodist_pkginclude_HEADERS)'; test -n "$(pkgincludedir)" || list=; \ if test -n "$$list"; then \ echo " $(MKDIR_P) '$(DESTDIR)$(pkgincludedir)'"; \ $(MKDIR_P) "$(DESTDIR)$(pkgincludedir)" || exit 1; \ fi; \ 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) @list='$(pkginclude_HEADERS)'; test -n "$(pkgincludedir)" || list=; \ if test -n "$$list"; then \ echo " $(MKDIR_P) '$(DESTDIR)$(pkgincludedir)'"; \ $(MKDIR_P) "$(DESTDIR)$(pkgincludedir)" || exit 1; \ fi; \ 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. $(am__recursive_targets): @fail=; \ if $(am__make_keepgoing); then \ failcom='fail=yes'; \ else \ failcom='exit 1'; \ fi; \ dot_seen=no; \ target=`echo $@ | sed s/-recursive//`; \ case "$@" in \ distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \ *) list='$(SUBDIRS)' ;; \ esac; \ 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" ID: $(am__tagged_files) $(am__define_uniq_tagged_files); mkid -fID $$unique tags: tags-recursive TAGS: tags tags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files) 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; \ $(am__define_uniq_tagged_files); \ 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-recursive CTAGS: ctags ctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files) $(am__define_uniq_tagged_files); \ 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" cscope: cscope.files test ! -s cscope.files \ || $(CSCOPE) -b -q $(AM_CSCOPEFLAGS) $(CSCOPEFLAGS) -i cscope.files $(CSCOPE_ARGS) clean-cscope: -rm -f cscope.files cscope.files: clean-cscope cscopelist cscopelist: cscopelist-recursive cscopelist-am: $(am__tagged_files) list='$(am__tagged_files)'; \ case "$(srcdir)" in \ [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \ *) sdir=$(subdir)/$(srcdir) ;; \ esac; \ for i in $$list; do \ if test -f "$$i"; then \ echo "$(subdir)/$$i"; \ else \ echo "$$sdir/$$i"; \ fi; \ done >> $(top_builddir)/cscope.files distclean-tags: -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags -rm -f cscope.out cscope.in.out cscope.po.out cscope.files # Recover from deleted '.trs' file; this should ensure that # "rm -f foo.log; make foo.trs" re-run 'foo.test', and re-create # both 'foo.log' and 'foo.trs'. Break the recipe in two subshells # to avoid problems with "make -n". .log.trs: rm -f $< $@ $(MAKE) $(AM_MAKEFLAGS) $< # Leading 'am--fnord' is there to ensure the list of targets does not # expand to empty, as could happen e.g. with make check TESTS=''. am--fnord $(TEST_LOGS) $(TEST_LOGS:.log=.trs): $(am__force_recheck) am--force-recheck: @: $(TEST_SUITE_LOG): $(TEST_LOGS) @$(am__set_TESTS_bases); \ am__f_ok () { test -f "$$1" && test -r "$$1"; }; \ redo_bases=`for i in $$bases; do \ am__f_ok $$i.trs && am__f_ok $$i.log || echo $$i; \ done`; \ if test -n "$$redo_bases"; then \ redo_logs=`for i in $$redo_bases; do echo $$i.log; done`; \ redo_results=`for i in $$redo_bases; do echo $$i.trs; done`; \ if $(am__make_dryrun); then :; else \ rm -f $$redo_logs && rm -f $$redo_results || exit 1; \ fi; \ fi; \ if test -n "$$am__remaking_logs"; then \ echo "fatal: making $(TEST_SUITE_LOG): possible infinite" \ "recursion detected" >&2; \ else \ am__remaking_logs=yes $(MAKE) $(AM_MAKEFLAGS) $$redo_logs; \ fi; \ if $(am__make_dryrun); then :; else \ st=0; \ errmsg="fatal: making $(TEST_SUITE_LOG): failed to create"; \ for i in $$redo_bases; do \ test -f $$i.trs && test -r $$i.trs \ || { echo "$$errmsg $$i.trs" >&2; st=1; }; \ test -f $$i.log && test -r $$i.log \ || { echo "$$errmsg $$i.log" >&2; st=1; }; \ done; \ test $$st -eq 0 || exit 1; \ fi @$(am__sh_e_setup); $(am__tty_colors); $(am__set_TESTS_bases); \ ws='[ ]'; \ results=`for b in $$bases; do echo $$b.trs; done`; \ test -n "$$results" || results=/dev/null; \ all=` grep "^$$ws*:test-result:" $$results | wc -l`; \ pass=` grep "^$$ws*:test-result:$$ws*PASS" $$results | wc -l`; \ fail=` grep "^$$ws*:test-result:$$ws*FAIL" $$results | wc -l`; \ skip=` grep "^$$ws*:test-result:$$ws*SKIP" $$results | wc -l`; \ xfail=`grep "^$$ws*:test-result:$$ws*XFAIL" $$results | wc -l`; \ xpass=`grep "^$$ws*:test-result:$$ws*XPASS" $$results | wc -l`; \ error=`grep "^$$ws*:test-result:$$ws*ERROR" $$results | wc -l`; \ if test `expr $$fail + $$xpass + $$error` -eq 0; then \ success=true; \ else \ success=false; \ fi; \ br='==================='; br=$$br$$br$$br$$br; \ result_count () \ { \ if test x"$$1" = x"--maybe-color"; then \ maybe_colorize=yes; \ elif test x"$$1" = x"--no-color"; then \ maybe_colorize=no; \ else \ echo "$@: invalid 'result_count' usage" >&2; exit 4; \ fi; \ shift; \ desc=$$1 count=$$2; \ if test $$maybe_colorize = yes && test $$count -gt 0; then \ color_start=$$3 color_end=$$std; \ else \ color_start= color_end=; \ fi; \ echo "$${color_start}# $$desc $$count$${color_end}"; \ }; \ create_testsuite_report () \ { \ result_count $$1 "TOTAL:" $$all "$$brg"; \ result_count $$1 "PASS: " $$pass "$$grn"; \ result_count $$1 "SKIP: " $$skip "$$blu"; \ result_count $$1 "XFAIL:" $$xfail "$$lgn"; \ result_count $$1 "FAIL: " $$fail "$$red"; \ result_count $$1 "XPASS:" $$xpass "$$red"; \ result_count $$1 "ERROR:" $$error "$$mgn"; \ }; \ { \ echo "$(PACKAGE_STRING): $(subdir)/$(TEST_SUITE_LOG)" | \ $(am__rst_title); \ create_testsuite_report --no-color; \ echo; \ echo ".. contents:: :depth: 2"; \ echo; \ for b in $$bases; do echo $$b; done \ | $(am__create_global_log); \ } >$(TEST_SUITE_LOG).tmp || exit 1; \ mv $(TEST_SUITE_LOG).tmp $(TEST_SUITE_LOG); \ if $$success; then \ col="$$grn"; \ else \ col="$$red"; \ test x"$$VERBOSE" = x || cat $(TEST_SUITE_LOG); \ fi; \ echo "$${col}$$br$${std}"; \ echo "$${col}Testsuite summary for $(PACKAGE_STRING)$${std}"; \ echo "$${col}$$br$${std}"; \ create_testsuite_report --maybe-color; \ echo "$$col$$br$$std"; \ if $$success; then :; else \ echo "$${col}See $(subdir)/$(TEST_SUITE_LOG)$${std}"; \ if test -n "$(PACKAGE_BUGREPORT)"; then \ echo "$${col}Please report to $(PACKAGE_BUGREPORT)$${std}"; \ fi; \ echo "$$col$$br$$std"; \ fi; \ $$success || exit 1 check-TESTS: @list='$(RECHECK_LOGS)'; test -z "$$list" || rm -f $$list @list='$(RECHECK_LOGS:.log=.trs)'; test -z "$$list" || rm -f $$list @test -z "$(TEST_SUITE_LOG)" || rm -f $(TEST_SUITE_LOG) @set +e; $(am__set_TESTS_bases); \ log_list=`for i in $$bases; do echo $$i.log; done`; \ trs_list=`for i in $$bases; do echo $$i.trs; done`; \ log_list=`echo $$log_list`; trs_list=`echo $$trs_list`; \ $(MAKE) $(AM_MAKEFLAGS) $(TEST_SUITE_LOG) TEST_LOGS="$$log_list"; \ exit $$?; recheck: all @test -z "$(TEST_SUITE_LOG)" || rm -f $(TEST_SUITE_LOG) @set +e; $(am__set_TESTS_bases); \ bases=`for i in $$bases; do echo $$i; done \ | $(am__list_recheck_tests)` || exit 1; \ log_list=`for i in $$bases; do echo $$i.log; done`; \ log_list=`echo $$log_list`; \ $(MAKE) $(AM_MAKEFLAGS) $(TEST_SUITE_LOG) \ am__force_recheck=am--force-recheck \ TEST_LOGS="$$log_list"; \ exit $$? isl_test.log: isl_test$(EXEEXT) @p='isl_test$(EXEEXT)'; \ b='isl_test'; \ $(am__check_pre) $(LOG_DRIVER) --test-name "$$f" \ --log-file $$b.log --trs-file $$b.trs \ $(am__common_driver_flags) $(AM_LOG_DRIVER_FLAGS) $(LOG_DRIVER_FLAGS) -- $(LOG_COMPILE) \ "$$tst" $(AM_TESTS_FD_REDIRECT) codegen_test.sh.log: codegen_test.sh @p='codegen_test.sh'; \ b='codegen_test.sh'; \ $(am__check_pre) $(LOG_DRIVER) --test-name "$$f" \ --log-file $$b.log --trs-file $$b.trs \ $(am__common_driver_flags) $(AM_LOG_DRIVER_FLAGS) $(LOG_DRIVER_FLAGS) -- $(LOG_COMPILE) \ "$$tst" $(AM_TESTS_FD_REDIRECT) pip_test.sh.log: pip_test.sh @p='pip_test.sh'; \ b='pip_test.sh'; \ $(am__check_pre) $(LOG_DRIVER) --test-name "$$f" \ --log-file $$b.log --trs-file $$b.trs \ $(am__common_driver_flags) $(AM_LOG_DRIVER_FLAGS) $(LOG_DRIVER_FLAGS) -- $(LOG_COMPILE) \ "$$tst" $(AM_TESTS_FD_REDIRECT) bound_test.sh.log: bound_test.sh @p='bound_test.sh'; \ b='bound_test.sh'; \ $(am__check_pre) $(LOG_DRIVER) --test-name "$$f" \ --log-file $$b.log --trs-file $$b.trs \ $(am__common_driver_flags) $(AM_LOG_DRIVER_FLAGS) $(LOG_DRIVER_FLAGS) -- $(LOG_COMPILE) \ "$$tst" $(AM_TESTS_FD_REDIRECT) .test.log: @p='$<'; \ $(am__set_b); \ $(am__check_pre) $(TEST_LOG_DRIVER) --test-name "$$f" \ --log-file $$b.log --trs-file $$b.trs \ $(am__common_driver_flags) $(AM_TEST_LOG_DRIVER_FLAGS) $(TEST_LOG_DRIVER_FLAGS) -- $(TEST_LOG_COMPILE) \ "$$tst" $(AM_TESTS_FD_REDIRECT) @am__EXEEXT_TRUE@.test$(EXEEXT).log: @am__EXEEXT_TRUE@ @p='$<'; \ @am__EXEEXT_TRUE@ $(am__set_b); \ @am__EXEEXT_TRUE@ $(am__check_pre) $(TEST_LOG_DRIVER) --test-name "$$f" \ @am__EXEEXT_TRUE@ --log-file $$b.log --trs-file $$b.trs \ @am__EXEEXT_TRUE@ $(am__common_driver_flags) $(AM_TEST_LOG_DRIVER_FLAGS) $(TEST_LOG_DRIVER_FLAGS) -- $(TEST_LOG_COMPILE) \ @am__EXEEXT_TRUE@ "$$tst" $(AM_TESTS_FD_REDIRECT) 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 \ $(am__make_dryrun) \ || test -d "$(distdir)/$$subdir" \ || $(MKDIR_P) "$(distdir)/$$subdir" \ || exit 1; \ 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__post_remove_distdir) dist-bzip2: distdir tardir=$(distdir) && $(am__tar) | BZIP2=$${BZIP2--9} bzip2 -c >$(distdir).tar.bz2 $(am__post_remove_distdir) dist-lzip: distdir tardir=$(distdir) && $(am__tar) | lzip -c $${LZIP_OPT--9} >$(distdir).tar.lz $(am__post_remove_distdir) dist-xz: distdir tardir=$(distdir) && $(am__tar) | XZ_OPT=$${XZ_OPT--e} xz -c >$(distdir).tar.xz $(am__post_remove_distdir) dist-tarZ: distdir @echo WARNING: "Support for shar distribution archives is" \ "deprecated." >&2 @echo WARNING: "It will be removed altogether in Automake 2.0" >&2 tardir=$(distdir) && $(am__tar) | compress -c >$(distdir).tar.Z $(am__post_remove_distdir) dist-shar: distdir @echo WARNING: "Support for distribution archives compressed with" \ "legacy program 'compress' is deprecated." >&2 @echo WARNING: "It will be removed altogether in Automake 2.0" >&2 shar $(distdir) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).shar.gz $(am__post_remove_distdir) dist-zip: distdir -rm -f $(distdir).zip zip -rq $(distdir).zip $(distdir) $(am__post_remove_distdir) dist dist-all: $(MAKE) $(AM_MAKEFLAGS) $(DIST_TARGETS) am__post_remove_distdir='@:' $(am__post_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.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 u+w $(distdir) mkdir $(distdir)/_build $(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 \ $(AM_DISTCHECK_CONFIGURE_FLAGS) \ $(DISTCHECK_CONFIGURE_FLAGS) \ --srcdir=.. --prefix="$$dc_install_base" \ && $(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__post_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)$(deprecateddir)" "$(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: -test -z "$(TEST_LOGS)" || rm -f $(TEST_LOGS) -test -z "$(TEST_LOGS:.log=.trs)" || rm -f $(TEST_LOGS:.log=.trs) -test -z "$(TEST_SUITE_LOG)" || rm -f $(TEST_SUITE_LOG) 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) -rm -f imath_wrap/$(DEPDIR)/$(am__dirstamp) -rm -f imath_wrap/$(am__dirstamp) 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) imath_wrap/$(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-deprecatedHEADERS \ 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) imath_wrap/$(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-deprecatedHEADERS uninstall-libLTLIBRARIES \ uninstall-nodist_pkgincludeHEADERS uninstall-pkgconfigDATA \ uninstall-pkgincludeHEADERS .MAKE: $(am__recursive_targets) all check-am install-am install-strip .PHONY: $(am__recursive_targets) CTAGS GTAGS TAGS all all-am \ am--refresh check check-TESTS check-am clean clean-cscope \ clean-generic clean-libLTLIBRARIES clean-libtool \ clean-noinstPROGRAMS cscope cscopelist-am ctags ctags-am dist \ dist-all dist-bzip2 dist-gzip dist-hook dist-lzip 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-deprecatedHEADERS 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 \ recheck tags tags-am uninstall uninstall-am \ uninstall-deprecatedHEADERS 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.4/isl/install-sh0000755000175000017500000003325512413256716012442 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.4/isl/isl_reordering.h0000644000175000017500000000207112413256472013605 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.4/isl/doc/0000755000175000017500000000000012555417256011260 500000000000000cloog-0.18.4/isl/doc/manual.tex0000644000175000017500000000365212413256472013177 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.4/isl/doc/chicago.bst0000644000175000017500000011474212413256472013312 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.4/isl/doc/manual.pdf0000644000175000017500000167115612555417256013171 00000000000000%PDF-1.5 %ÐÔÅØ 5 0 obj << /Type /ObjStm /N 100 /First 807 /Length 1172 /Filter /FlateDecode >> stream xÚVË’Ô8¼÷WÔ.`=-ED̃ˆ`–Y¦á´[ô(Ö¯í…áë7å¶ç°má۲¬ÌªÊJË’”‘!‘‘%)‰qÊ51A–Àb9FñŒ˜åÄF¸HâBn¸ÂÈVq£‰[˜œ„ÆO°9†$Óƒœ¤b$3’Æd¤2“*©6R‘@RYXÒ 8i” èJ“™Ê)g†0‘+…e”çX&Édv£ŽÕ† žk‹‹%<¶™¦!s”f&s²VD,Œ JÍ4îQ>ËØÆ(\TAí I‹+(Q=cÖ ŒC›ôAÈ‹q„e¢(Á2P -6,Ã0¢j&yŠV)%~2åÕ™ƒ‚Bqü%é•Lôx¬R^ ©l€Y 0§0zìÚ€ j³z"bfL Ì&Ý¡Ìè”HMJ\¦¶ Ì %ÌBp–¸¬1†¶ð :$ x–ÒH­ÎtÊÈíá ´ŸÉ”xŽfÏ$¹Ò çcv0 ×jÃÐ*Îó1_؈¥ lòÑ0.R'Ð2.St4Ëñ˜eJbÁuifÅP.èÛ0hÄUžê³Nò£{\Ã3£yµËÅ õ äùèk0ç"• æd)Ô놵…Ú¼zE/¯éåE³mèå9=+n]Ûûø‚=§×¯7Ï>u>Ò¥«W>ÿamç‹>4õ 6¯~W÷±Ù ãìO–73æÔÿ|uqGïꢩZׇ›ÒÓÙ­«÷¾;“ðïCáëÎ[)æìºÞ•¥[‘x¨èC_bSQëizŠ¾mºÐ7ñn‘kÊô¬©*°„Ç”é&;Z¬¼ØïÑ‘kßÓûpÝbt9Wré+äšzéö¾òu¿äsÌÐW†ïk„“³Ø}?Äš¶wíO»ø3U÷ٕÊÕê°täê}ô1—‘ú€|cé-°e¨÷‹¨|ÒaÑ—àãr 3¥ØºbEAvrrS¸’VbX6™*z_ïéOÿ•~Cö`ô6MƒéwX&¯\5¡îW,ŸLòÇP+Ü¿íÐÉ}z —“[®bÓú؇5ÒN6ùTãõ¢€­UarÊiøeäd˜­¿ ݺÊóÉ6']×!þõäbtw+ “S>c®YñðÉ—®a¥ùäŠÓf¨waw¼ ¾ð_Cçé¯Áu¡mÊ»º©°üù¿áÜÝ°ÒY|rÖ•‹®ò)Uú £øoô¦ª© ǶæÙ`ˆ~ëwѱѷaÚà×íÒjÞ¥¯ p øn£_”LÍ[ô¹o}í©ðtR»ò® ËPñ$àò>¨æ]úäzK¾^¡Ìô´mŠUvÖ³¡+ÿÆa®Dmêt×¹ª-ý"JÚE„8´ u¨Â÷å°ò’[ΘwáêE¸z/š>ô?AÍç³ùãœI_óƒÛÎ}ïByä$Áï¶f“¿MÑ®C Go‡²<¶ZüðFÍçìÂ{LVKvãO`+Ï”üᤵÅí|HÓ1áotéûÛf·Ÿ¿hÆ£ÒÙ6Ôÿ‡ÛÝÎ endstream endobj 273 0 obj << /Length 215 /Filter /FlateDecode >> stream xÚ…½nÃ0 „w?G ¨XR6e©c€¤HÐNº\D 6àüyûÄ‘Û¥C'Þ@~wG‚¼ôÏ\ÄâyUyà-Kñ,yô!@%0Ä=|ªuJšEÒ¨RÛtÊâ­ý›ñú¢MɤޛþÜtz7¬Çà܃ê]¨Á0a¡š™UíÐÏ÷í±3„,¿æû¾Ø aØ"³S•èK—ÛË+õ9Ìq? ]3žPp·­€±S·¹ÓæÜ]ó™­ŸfAÙúÏŸ–±¸ÎDN¿ endstream endobj 314 0 obj << /Length 995 /Filter /FlateDecode >> stream xÚåšMs›8Çïùá+¡WŽM&ÝÍN²M»î^ÚT¬:šåÅ#`»é§¯„±×øÔz‚‘Ãÿ§çU26~?þz¾:ûí5§AŠÆ V_ˆPÂ(c A8X­ƒáE]µ²j›èÓêÏ~B–d4¥öyÄö3ú'aC@ø¾‘:ŠSÂQu¢0÷4ƒ,Dî˜ï¼â$Ã8ˆ!L2Bü{’þMfþUÕêzÝå­ª«(&€†‰½€e] •qU‚qj¢ýÑ4M2øSÊ<ž‹ü߯¡Ðk‡þªÊër+Zõ¹näâNTÙDqÆÉKÑï £ƒ°Ô¯ÿµÊeÕ˜ïç,r駱ýQðØÐè*M+ŠB8WÉÈ/Kè°« ÑUöAYÇø¢ëÒݵwÞW6ªu7ZnëFµµ¾bÌÐË5ƒÞg¬¾‹º,eê‰V;¢]@µ‘>_$àÇ"Á¨ ?d™¯Ý ©åoéWèZ}ÖÂ.'tQv±ë1RâÑ®odÙ[©Ï»b#K“¶ Dæ'ö‰}ãѾ¯*Õ*Q¨oÞª9Ï¹Þ àl;ízqÞom^§Ïž´£0D=Š"a(ŠÎ@/:Ý ‡x8&F6ÎJDåËÂwÒe3Î)œŸx:)žzñ—Z×>WüaäªÚXás_þØÉlˆ”k“ÔGR©ÍzcLélÒ$øà[‘÷ ÐO*äž Ÿ’y ×uÞ·çä Íè20 <‰‚(f¶dÖÒE,‰¿d”’ðëXf ¡àg—I¦eB'Ót>[™?=®-{–pqH"†ÓS'ñ¶Vv«*ÆY¶üJ“ÉT‘ãòº«†žE¦< ü`Ûµ ÿM×öƒ”²¹ '<âÝD×[©[%—[°‚u4ÞWbhœß,cp§h®âù â™®«çÙ¼dÛ‚éÚTG½îUÄ@(õañ²ù‰Çét:ÈœøkÕ´}ùB~…]âãxv·˜|=øªiê\c°…àvÛÑo ­Å½­œ!4 ÀWŠnWÅÔŠµm‹6Œé¼™úòòF´ZõmRºp&Ó]EêKËóº«Ö†4 ÃîÇÚë­’¹ë¢”=½³Co;Ѩm]ÜWu©Dá'ôõ×ÔŒØ~K€`Â9Üiî]Cë²Ï5XšÎù£xOñ.y_ÇÞÚÈ$´(¥µJGÁ{®v§%ÿ»Á˪+}r3±ëç²9,•tøCüáÏ­1‚;¹ÖÃR_ÔåVížj=œ½œòý°ðý½™ñwHp‚Sè×|ø;Å«³ï¶ÛÀ= endstream endobj 352 0 obj << /Length 1332 /Filter /FlateDecode >> stream xÚåZÉr£H½ë+8ŠåÚ—£G^¦;¢§{lÍÉÑ•eÂ,@Óö|}'PÂZã+<’}•‹*òåËÌW‰±7÷°w9ÂîúÛttrÁµg‘TzÓ[(‚ê[)¢LxÓ™w3&H â„b<¾Žîìl™X? §>ãÂÚÒ$×cäæÁåûôs‡‚w £„ëÍqì„ #Ö` †3»°ÙÌf‘â4 “Ç2ÖGd²äƒ&³MÏÇÙÜ”ÀGäì—à`qà‡ÓëiëóK›Ù"¬â<óCôÑÚ®¶8PŠ áÛH°×T_,’8jì®éÎÌÑ2á—‘2rs|(Ùɦ\º–YAZx®™—I³ÔùtôϨÅñ(1Hé £Æ‹ÒÑÍwìÍàŸ=Œ˜ÑÞfjêÁÆÚÀ]â]þlóøÆn^MiÑ,ÅÝ›-òäB¸¾în­’z?[+¤Úܺ ÓÔŒ•zÃ$2جP9L§«­ð œ»õ®Ûé+Ý®R˜ïÅí°”€¥Z¿Ç‹ä)ÌôPÇ)‰!;y *Üëü¦R€í>üK n~!^÷°÷*^×÷Nã,NãÿúB–sÄôÿΛ†ª ˆS³ërþJ—KW¶—ÃRÂð'—WùÂöì,A|R±—¥FÊÖÆÎef}Y‚nü ³Ä ™@ÁXNw™ ^Énfû ~XJ2€Q>³sÛ率5q¿Ä]'Úž,ç$e Î#ºµ¼>ŠÕª¥Ej³ÊIñZšŸÙ*Œ§ÀsÅ`}Ý$nó-™K›ƒn-s¯mU¶‹…Ù¬½¹²I'{ yŸ5óù#0mÀ JýòX|yñI|ï¼*ÄñVÛ”az0èÐç»Á#PµÝ`—£¯ì­-|ÈuõÿäÔÄ×ÀnXŠo-µÉpi“–„ÚÁº¾òúçÓÑOo¼˜” endstream endobj 206 0 obj << /Type /ObjStm /N 100 /First 866 /Length 2394 /Filter /FlateDecode >> stream xÚ½Zmo·þ~¿‚“å‘3|ŒŽe§šÆ°\ ­àçÓF>ø´'Ü­Z¹¿¾Ïp);vdSðHàî9|83Î Éxe™¬8*²FE‡†•µ­S–äsT6È÷¤lÂw²å™ˆq@ëE^á9¡?¡?Å^ú°â$ïNqÆï˜Ê¡qRÎcvg•“qŽ”7èï¼òœä‚ò‚ÇeúÆïžUñ>ªˆòI%ƒ÷`U’åR)0Z¯²1 AeŒÍò=•#0G«¬ “Yk0côxpXb$‹’Å,ÀÀëdV›DŸz›¸t†R`=xÈШC-S,¬…ždŠ †Reþ045Ö®CU SG [éDi@š•c”‡¤rÆš˜³è4TÁ}q¢S˜|ñä‰Zž«å»×;µŽv÷(WÛá°~x];Wî½Þ¯ÆæHâÙvw¸ÝG zmç‘?ŽÓ~wy»n•×tíúæv2H[=½ ï"mµûE½z”W:ï†õ{!óünµžFHñèÈÊœ³a ;‘ºz¥6ã´S¬c¼Ú~PëÝ8bÄp©JŸ±A`þ£®öÓF> áéÝ .w׫MUkðøj8”%¥î¹»Þ¢2«­š¹¶jbtÕÔ§£úù[ìÏÛÍûAm®o¶3±‡i¬ß­n¦aÿ'íªÆ¾~öÈíñ›Îrzðnùb3½‘ÞOž,–¯?Ü jùru5,–e—€urFJÏÅòÕpØÝîA­œ/åÓOÃåfõýîN]|°*1Ó›H`Þ ýbéWÉÿzÚüó_8™HÃ4ªh¼†o·Û7_ïË¥oQ[ ¿î¬v»ÛŸß¬ÖƒâyÌËÕ^ŒŠæ×çwÓç`Ü fš‹å ¬O W^”3”Ï ·| ƒr>LêDÎ^¨åk±q=È"†Ëñ‹äÔø=,Z>ÇH]”£Z°ÈI]ÚdjkkKµåÚºÚúÚ†ÚÆÚVz©ÒË•^®ôr¥—+½\éåJ/Wz¹ÒË•^žéÉ¡<·¶¶T[®­«­¯m¨m¬íLOÎâù½Òµ3Ý/X_ø´Xžß¾Êû_7ãûÅòûÝþrØÛ7Ë¿,\>»8æe ieƒÞzë´ÇÒJ‡sÓŽ Ðí©úʆª¦² u´AFĵ:AÞÞZÌÃ(îí‚íŠ# _Ò¥¤ƒ8gt€êrFkÆñÉDÙÎ`*S\L<18ß¡ð­íOè0BÐÉJàµó^i+^2Ú¶@ñý¡@8Vúÿ §<@r®Lè[[\r†G’—[ÀÄþ`àmJ6…à4”¬@5 )õ‡¡d`w2‹×‚%÷Çb²æ `Z$7a­I_¬éþ¨.)ˆÈ–œ°51Æö7¾p¶µ›“ˆ0¾â37éo|¡¹Ú‹Î8]#ÙM2ŸšÐô·¾¬ö’à‹ˆlcš[ÓÆ›þæ—\Ö‘н™¡`€®7ý-0Á› \2·âÿÆç6Þô7ÁD@QrÄŽ§œ—ˆ ¸7ým0Y¸»’3NUÇN¢&4ýÍ°D%âyâEÔdMRlÓßã\D„ÂEPbmŒ‘жÉÓëo‡mÌ:K¹®[²À–ZÅDýí° Qg–ƒ[N*8Är¡ MCl=ëìR l] RŽ‚ÑiÒêiˆkê¾6¥êÛg`foÿp8•9â[I}£¨²uFçÜ:‘ëPZ›´‘º ¶’ƒwnËù?;ÎÔ…”ÛþˆŒe’ªT¨ùÛéKO¿I_zó¦/¥86§ïîÓz5G5MHõwªiBªiBªiBªiBªiBªiAªô¨ÒãJ+=®ô¸ÒãJ+=®ô¸ÒãJ+=Wé¹JÏUz®Òs•ž«ô\¥ç*=Wé¹Ü5m9o– Ññ%T“Äl­%ýâOiŽJèJñ44;ÀÌ™ZÀô·±?KùŽÈ:8Ä×ÔÄ™þ6- "ÂÑ#5zp$â=\gN`ÔàQj’› ’ã†:‹û˜MëïVúŒ¸Xì‚6rÂ@ Z’/ášëé$¾$Ü'ÅÉÛµ@鯷M*W& }ëÍJ€ß¦¿ÞzŸà6É% l&R°™r –þšwpÙ$ AdÆY°ÁÉå&Æøþ>“Ÿ£Žb^B¹Z‚ØÚÓ£õ¢$¼KÕ æ¼‘{H¥jõ5·öcù$u+ÈÈÍ…+lSáŠNR¸¯\!.“ühåêÓÍŒþYw¸öQ.qñ\£y¬hõù‘T^Är- ¦%»Ç WŸƒ¡“U¯ÈKìcKõª¡´(`N %D)Ê%´’íi­^}ºéÔÌ}ñª8÷xñê¡ËR'©`AwJ%@S –p‚ V„S+–{GccëÓÕ®ÓT°à½” ‚ç&9A Ù¹@a%¹°×VÀút­«éeˆÇ:¹L 4ùÑ Ö—ÚúÂð€Á’ÑõÅô>Z½úâÂþþ9Ò endstream endobj 359 0 obj << /Length 2061 /Filter /FlateDecode >> stream xÚµXK“Û¸¾Ï¯à‘ªŒ0xÜÛ®»œŠk“òä´»ˆÂH¬P¤†;óïÓ €ÒPC{ìµr 4û…¯¿nˆf»Œfïnhúýåþæî­Õ§Dk®²û‡Œ AŒ¶™²œ(¦³ûmö[þfïVk®hÎVÜÿ=~&‰±†ág4[Ë‚X&ãÿî'é®]}ú„I"¤æée@ˆŸ0ÂVkF)Íß7C·b6o·c9Tm?.xVBs¾åœpü«údAÚgB¬ Z1M2«µ(lîðÇäþón»î݃ oâv]m:×=ŵ‡¶‹«×TDZvCÕìâVï‡Ia³KG¶IëíC\®šÁ¯˜Êw>);¶°Ô£ÃÙ:ù¸fŒ*E³iÇfëQ)eù]¡ÜŽY`ÏT*§§L/dÁ.ŠI¦ñQk ^C?Èj-µÊï÷ikëû²«ŽS `:;Ã$’bG¯šäæóØaýàžâzÕ¬$Í?­8ÍÛú¦ÁÇÀ5'…)p5>ì5Rä:wð¹ß‹h7B&ÿ[õƒo†ÊÕõS\~¼ÿN)÷ILªÜu•ÛÔcTä?×uTW¶‡ã8L£¸ë|²ì;8õ¨A7éÜAˆf-M^¸rÀWvq°v‡=ø_•Q`ì7/aÌ„$ÊžNð݇.Áؒž` ˆ\ÐÈfg¤äñ¥"® ;×äD)Îý¥B5ZK§þ’_|’9× Äß.€BµB<«XЩHaì$NÕ=ŒM WWÃS„7†X«æÇ3ì]8‹]ˆ¼¯Uíº¸8´qñ,¶äg!ˆ¢ßâ§9ûŠô…b –’ ÉÙ©=ø[:¥‚H}‚á¼ ÑÅ\Ó_TAÊu!ç'TùþœT"ß`QŽÃÙãROW?%¼B¢% ˜i–hWïÚñ>’|¬xÀÁßCÛñ©t½ORXu5u(ZxßV égžéwâÈ€$>Õ”ÂÌÝÜfÄ3ÂKÀˆI‡ïMÞƒÇÉã(É–ûö>¬D_uuÒ±q}¨yÜš6(¨’Ú~¨ê:ù+åœÿU|ªµÎ?¢ðmìI-²(2‘¶‘‘t‘W‘á¡;LGÜE&KŸÆs@`ïÒg?iìDzô}ÿ0rŽ±ø†§(mc3º$Ç+ÿƒé𫕆>W?íý¶sȺʜ-ãfh­ø{)®ó¾tMã—èŽ3 ÔsÂÈ›´í»¥J²ÏÛ£›Ür}tzÌW°Á…&þúDZŠ™Æ²N… ÑöYµoJt¦•rïSü3Q+lôØhʸ¶ÔÅ ‰ø÷6qT|ìÚ´Iìn¼(ò·ˆ‹6Ž‹‚?¶Ý€uϹ̼ÆÎO[£ï<Á½#†ý±;Þ&˜R˜U1þSÕW©ÊÓ!bM÷åðmìºv<&’b`Œš,p\œ7Ì›êtJûa8þtw·ÃDâ§=Evm»«C‹%P’çÝ;èLë­_ ÏÊ×íñ€è_¡]Quî~§‰4D&Òµ`Æ1 £˜= ¦§ÑôÀøg×mcDï$8]˜1â ÊÍÎ÷'峉¦¶§:È… Øˉ?!J(G§)ýî­ž‘?P†‘3u€sñÉ,xx:·ÞÀ†Ð?a Ã8 T^L˜lqy"®>nîB)nA rîmý±ó¥ÂÐe&üÀ ®vå´¼yZ1`dòbƸùÛýÍã )4c™Ðåè¹6Drž•‡›ßþ Ù6~ðZö9ˆ2Pf±BêìãÍ¿âÅfÞ|%%V› ŠótçO3Ë €fˆ?¥æ6œ÷K˜†k 7'¨½oŽØe¹±S~lþë8àâK»º-›ôK0X3HŽâ¢àêO áCèÒ‚êçgŽ¯aš7Ç&¨=¾;hmO}èiÔ\À$ì—@£Ý¤¹ãè w%HX Ü;ŒýRŠ8 rÃØM Ž@;Uóvºa>XK ‰û•Åñ~6ƒ K1.†¢€‡O!UÀ©p‡Á>JQ#F.©Q{\é÷íxþ<þîªYÏžÙŠý¥Ó+#Kmõã2Æ Úóú×ggƒøúy:›—é+Qâ% ΀%ˆ€Ê\Ã-@MÀz…±Äÿ±Xq¾,`Gq"Ï#Á"›p," ¤N›èaœŠ¥ÐA¨MlòyÁ¦dD ~ ›R†g6qjjÚC军8Ü Õ5Œ Ó•sãX,/­BšW± ifŒÏ­ºív©¿›ç7é0ײP†XuøS±Ãk}xÚY|úJCÂ!¸BlRÚ0O¾ !© b¤¾ŠMè¹FÈï€âØ6¯b\q[¥¾B Ò,ÌUªFAš…ËV/; Ü9Ÿqc¶–ŒB]prü[.HZå·KW}ÐGöU6bp‰eSPÕÐÎ~„€WmQUÜðhslO^òXW1‹vnv‘ÀºÐW± ÖVÍm~ÀÌ\ø@Ó ã_à@0WW±Šfbnõ+¨~œ¿ÞF¥†ì‘I(Ik¿ ·²'°ý¨ÙBÍÍë¸U0Mj{Ü*$ó=¸UŠš^ǸC-¾ ·ªˆ£ß5¬BšËV_'ÞÓ`ˆ·rI(^Å4Ì‘4Qø|à„ þZ7Žq endstream endobj 368 0 obj << /Length 3236 /Filter /FlateDecode >> stream xÚ½[M“㶽ï¯Ð-—…Å÷ÇÑqeSv%•Jvs²}àH‹±$Ê"•Éþû¼HŽ¨ÁHZ‹öi@BÝׯ>ûyÆg}Ç»¿þôîýog+íìÓÓL(Åœõ3k“ÊÌ>­f?Ì¿]»ŸËæa! Ÿ7ÕnY¦fÕlœqýðÓ§ï‡1ß°òt@Í‚Ó³…ð ÃÆá~äÂýDû“Ÿ ¥^Ä¿Ùl’°uY¬ÊCjÿȹÜôZ’Ïÿû ̼›×cYîRëPîŠm¹JO‡zKrߣZͤս@,*Nî/ŸÞýúN —ÏÄL©À¤„Z”gΘÙrûøl…—ßÏ8SÁÏžã§Û™dÁ´6³ïþ™4<§´dR¸8”1†ÓâØ:Mo¤ ­™zQG[çVÀ™Ôòdï/Œg% <¬–¥/F>°PÒ0çýl!-3ò6'0¿§|ZC˜0áq·l«z×d´`,S&\4£T‚)©f&(ft¸ÇŒRÁ.BÄ¡ú}²?T»>úZ®P¤œD®ÓÌdÄf|– øõ2ÇÁ§B‹¦Zæ6 gCO!P¼ImÊ6ãÒÂ1ã—.v«ì.gÒ]öå5*L2wï˜þ6ïÐ’¶ø$:ÓÒÁÁÝ-î¡fܹI¤"XpkoñíóÂL"Õ[æ¹IÝûŒÐ<Ì@‚…swu°M \ëKÒUléÏ®|fþ¼©v%»q‹X@)zÈürŒSæ ÆhM^Á8‡1¬`ÖÞ‰qŽé`âPÚ%™O›ú9#ãBO"Šs5úsÙæ@Õ3‰ŸN!Ó*ýHä®ÎH 5L"1lԱȦ>U_û/,ê±½.ã›cÞ‰Ëø¢£Ì$FR8£ÇF:îà´©83™TÎx1’Úíø3”€7…H-«8¹¬·ûc[æ  f'ñ 6cŒÏn½st“P‹÷ªC7;ø/ᘠn‡H‰Ý¼]—©³X.˦IŒÎΟêCzÿ¼®–ëÔ—ÒõŽû–õq³JÍÇ2½~ª»®«Ú5-¨gz¨ŸÎ$VÅ‚–€•°8á]Üçuyè¨e»®›®y:Y>¯—ËãáÁ˜ùÉÊ]ƒdé¯C²Ô€dÚ¤þNH¦¼Œ†²J_ŒµÒÒ“ˆµ ^Åf·žD€„O"^×=Z­Ê][µŸs™’a"¸«0éô5˜4Ør~Š(뙶îµ÷tf!îé´þ2µù^%nß·Å/‚Ïã.`ärEÊG$–8ÚÎy&sac;ˆ˜¼ m<иÊà“óové]Ñ/—Åf“3¨Lˆ+Äž{Gà27øëïR.–é‘ÃÒPC^°(qNã&Š´U~œ í-ú#7<ê ‘Ñ:¨V>-‹N¯¼¡ÖCâ·‡ªm˽aR„±ÀÕBßTxx­á “ÜÌ4Xzw9¶ðÐhÐq('/‚VdS•ØɱÐSÝçßqlc=É2&©ÆH›'ãèœ7ɺ'.#nP¶B|õ“XI ­…±Ì¾jw&”ÊbàGSHÕÄeÝ™‚Ëv´±ÞØ\H|ÓÞd#`@±¼øˆý­|DZ?ð‘Û¾–!J$kÈ5<‹j5wÑ@2DÊiKjdk´%'j­Ñ–<º¯ŸSmå<èú¥>‰nQCÎoÃäšôªHöÅ¡Ø–múuSE§ošôÓ>`!³š·KÌv!ç´cøŒ´øëžÖv¤¶¤šõÿöõ®ì‹UGpOØûðÙpWÊ.š³¡Võ¶¨º¢wâÝ'/ñË㦭v?÷›‚Ö’­ýJ ìw_Túµ¿{éWyC ʶh©­i…¯=ß"9×æ ÇVç!fu â=N¨ûð= e•¿ZPp?‰`Ï™Í}-8-h7…XE±^Ù±Ø_÷õæó®ÞVÅæ*8þ‰òµ&O"´hûwÿ–¯!˜Nø½ë@²l£u|øÇ¿þþͧ\e6Àlz ¹à`0›Ëí{^Îñ° SH}l23£R§#˺ǂeÜ¥+‚#ÀÙ¿›2£k'1´¿¨kø & t‡òHlïj˜Ö‹8”ö_Ô5’häJb¹àœZ‡±Üo3šF¢$ÅÉÑZ‚ÏÇv€ÒBSBhŽË‘^€œh¨ù¾HŸÙ))?Ì÷«ÙWDÆOÙd0î>² —•L‰i_*š\!é•Â'*áÙ´Ä‘Ô¯2– L ;ä¥:³PáüÞÊ—{‚íç}¼w#»È‹FyÑz‰¼xxãÄ3¯®„^ða…oî_e¬zÃ<£Ugç•O‚—K#TñLëx®Úu·¢u·ô¢iêeU´eÏàá;êŒÀY2£CŸ ¨To¤¿i8Õ%ËJ†ô«WY™ê!ŒZ'¤O‰ôËW¤¯2¤?CÕ‡ ÏàS /TýuâÇ¡6z–Dr~žþŸþßí¶ÁG²#% B§.&´-ö Ek)èD¢IE¼m¯NkÔèO5àn„"^¢@ïK)½í¡ŒVŽ«ªsh1bË ®nH€±•Í -ºoJl“61 –ÓAM©j/‡ŠÎœ]Ri«Žxà51Þö¹»¹íã!Bìmzµ 3­œ:ËöõÛ®àìä5Éu>7ýà/#¯ÊÔWw=Ez\ÖÈÎöùû)Ç‚üFúù&ž—&oÙi”µýe›ÓI@éæOßù9=¤sߟGlªeEf}Kr¬î„¡Sèø ¥·-@iò¦LGÒ™¿\Dà¶KØm“u ç:”Ë8z:6$>ƒÐRFô½Haƒc _"LßÅë(Mñq(ÁÍåÃZéW~± &•n,6j¿É°8w“ÈEÂÒFr‹Í¦^æã‘CÜM•›Žwc«&gLÍns$àP†!°|ã-[KÐ@…q01=`dêΛøzDŠOC‰Ë¦ÆÆdÎËI¤‚5;'FR_,}~q”ª©7R@!4ÓBÜ{‰.k=ßT/œzTºÈƒ7/Ù:‹žÑx¦Œz}ev!îźÓÛô®»Mï\äÖôYÌ€úï‰U{Ê»¢\ônËb3G¯º«ýèLĽØî7e÷ª]Ý0)ÕuĪ·å®é/»µŸ-´eAwªÿë/ŒôœÝž endstream endobj 376 0 obj << /Length 3484 /Filter /FlateDecode >> stream xÚ½\Yo#Ç~ß_ÁG*°zû>ÀÄ‚^ ^c1"GrH󰬟¯º‡"{Ô<Öìäi†-²kªºŽ¯Ž=øè¯xýóç?i? ,XiGŸGÂxfYã˜Tfôy:úy¼|¼»—AŽ·Ï-݈ñt¹hf]ZÜÿ±éî~ùüãÇOAmç%3XàiŸÙfNßùðÃç¿~Xå#1’ dŒ5(N~þ…¦øã#ÎTð£—øÕÅH²àî棟>ü+=|FMZÎŒ<|óø˜,çÓ3gíþÁšu›˜è–wÒŒ_—“e·™MÛu;íÙ_¦ëC/…7±¼®ÚïB&œ?˼Vœ9|§óZ)°är槳E¨áŒ×‘¸6Šñ¡Äg]IàŠ©ƒÀgÝ=}gt¯¸cNÙѽ,˜~ƒÍ¶m s¥8Éø½d!X¯íy­œyFV¦]¸I«ðèߧ­¤?#W‰ÃäÞU¡‰ÃäÎf47í¶$WÃl{Y°»{cøø‡ß·ë& ðq×M¶3hrúøÜÜI>þíN˜q›VÚ¶KwÍtÚöb'UâØFCkÏý/zëçÀ2ž½§ê ÏV!êuû­.«ÈÀÁœƒZÒj&|¸lP‚¾äœŠ ó HC–äoŠdXq+ËÃ>sø­œŽjþ¨cB g¡€h7t#÷XKëv±$„›`î”<µsãO˜O_Ú>7ÛôÃÝ&zZ[¦•u»Ý­ûÍŠ~†œH¸_i㙯!$m0¥¿FHHq6Båîó Õ(yàîË>4@é/øP¥àøò<€ÈM>Ly·²FŸ-H¼Ëã¤ÿc¹m3é@Ó]¿´Ï€dªÁ(yâ8¥Þâ<Ïʃä›xVÞàÞ\Ås`ÇÖ8ätÏÕº7¤Û¬¢Ú²aÅàßÏd"P*·š7Š?ñc“.ðúót+x/"ª÷çýaaoà™ûp“Ê ð*Ä­lÈU~À‘ÿ× àR…ˉ>¥’Â@ΨQEªG¦tLt²lg“YÛ•ê0P-ߎâáõ[ŽQ_ âŸ/¸)„Sƒ9­àÞ `3×+úÐY"ó$L_¨¡Ú’¼â5ÖÙ* «¡°N‡o9Æ{…Œœ;çŽðOZ¯åȬ¸¾™¥…1Hì¨Õ­‘YR¢€­¶:SÓ2–”+•pñ„’2¢'ŠzˆRƪÓwŸv õ½æ~ܵítC·!FuZ¢dƒ®ÉÿQÌ«EYSõâ|8€|‚5¸V@ôÁ]!i-èLª¯†ü¤-W¥áêìqÔuÞŒ¿O²KΆîŠÎ&VG¸ ‘óÕ$äÁû*ÕlE°é´Ók‚d¢ªû9Írn!©¯bjДtvÊçDO€gäŒÎe鷖Θ™s~6@ÿžÒm©rýÉ|=ÔW²÷¯PFzxún¿F59âæG÷ЙN>n/Žº!„äöÝrÁ‹`Ó¥‚—†«§ž&bõ­/`ºÔÅV=Ê¡&U3ë KÂ^•ªCÛ#§‘Ú'¼cÆ¿éG,D„<ß,Ó]*¤\(¶µÎ%>9Ú…LŸÜ+ìµ—ZRS_/aí ¸­BÛùXîÊh—s0Œ#ÜÕ JN[\s¬ƒüÿ\yLYr¢~y,@Ÿí¢U³n…GUÔ“vetª¼M:I7}kwƒ¢UZÜCˆwðTÆ0x±Á Aó°› múî}$ºhV¥¨+˜¡`R(À™8ˈ®©‰TÄÅÜŠTÉ”¹É‰–qœÖœªÕ Ró9UX|Èe^*ûi¦Å k²™-fsè^,c¾uÔc5Ô÷å T-m¦±DfÝj·Ýßî ¥}¥u¹ž=ͺfž>ýïﳇ~÷åzÑl¿£þðƒu»ÙÍ·¥¹‚—4ÅàÝp +Ý2]£mµÛvMì¤ÿíqø‡ô9Ž&ÑMK»ü¾j'ïßÐÚ—ñ7 ôí:Ý/š×tóBýÝ&¥ëÝÿðQW횸KpiYÛm(Ç‹¦›­v©ô–Vö×7°‘dÀÒQBMŽá\wTÊgFöéÿ_ž›î©Ý¤ßnfݤß&~Os$眞 Î•<œC=Gão·™<·Óݼ-ç5†Ó 2KaoMl¨£H[qa÷M“ù¬„0´Gâª5‚Iés²¤lÐœy †ª8—ÕKf¹JZ@@â r=&ë}Ñn[94ÃfOË\[Ér¯ Ìkk˜À9_#s /”©B^>H= cm§Å’R©Cn¡Iòÿ‡É$e ~ÅåzCÃêa`ÇŸ‹Ãx—sçǤµP&¨1™Û­#žHSI±•P{5~)sdåpI5hRÃ,f4Ëy9‡–¨@”z]`## ¬\ÒX”1&k¤à´1:ÌR~÷Æ](n8æLŽÕ¸‹GGcžœíí4iŒÃ…âɽÇú¨w°ééÕ>^O IÁ·Pãòúº†âQ§FYƒv^|Ó|¨±ds\ü®º0ƒŒÎ¬ÀŠÔ&ÂÛŒ•¢AË„5HšÀ÷9É¢=#ÅÀήM¤ŸŠÜÑ1M2g*Ÿ4ßQ»×ŒúëäD!…*h´ÒÏ© ]Sú€4Mšg¨À³z‰5žý3Ò4ì묛Î&Ív¹þºÝ‘zâÓ\äТ鑡¹ þ¿F†Y%ª8—k!¥Ks¹‚)©b‘Ê›JQš)Ñ#­Éì{hœÙ*$i6ßÈH–[b–êí¾ Q¤ñÞºœ(áËB8‡Íš:œø7­s¢óåK».õÂ=óA× «€û½W9Ù‡å®Ñ}|­âÒȳ¼ðz uè`ª<¾7p>ú •¤ðí\;ˆáÆ~Y)5¤ wS…()ªp…RR•DÉ*–@U ”œènµ*)¥v„2]²NÅW®RJ@¸%/r¨“×8¾µím´¯óÙMÞ@Ê8Åoò¶šyíâVBœs«^DÀXƒ¦-ĹcšE¦äA Uƒ&%šËŒfQƒ`/ÁÃ4%•m3’MWzByü&T!©Isš§¹¥mW…ª™Í¨ÞìÇÃ…©%ŸºÂÓkªÞ‡+L@@PÅ´A‚ê®0òl­M§â$ãEÐHK…–UhÒì°ºlÔk×¢ÊqÏs86Œ"UÅMêJx?÷=¢É%få`à ˆwmª\ßü¤»Ko~©Óà–2úÖ?K[ s…K@br~ˆÂÔ©(“-ãpÒ!T j(å×9Ñ2‡Õ”äT ?ª…̉žpß2x&¬¬AVž #r²gý·¾Ù+r·U¤F½_gäJ ¤†‡Uˆz‚ÄW褆AÎTƒ¦†QÜ]¡“ÔÖ4¡Š!Є‚ñ&'z †ë'uj…ý)©®ÓÉ{‰0cµÏGksË(óÙÓóvþºoîõª+Ž¶‚ZòCqð ª4‘GÍúï´ëØ ˆýÁ¶éfÝÓ¦Øþ£&Ê7yäíEž¼1q\ä9[…È™ªFEVê„ ÷Uäý‡‘Ó4+Ô~V"è£2^\-÷\´Þ#5Q¥*ð¦¸/d¼ýÖ̯©6;Í÷ÿÌÄJ:XLkZ˜OÓÊñ¿)Àzêzã&ýK€ˆ„51ÛÎ_žLZ¸ÐÌæÍÃ|¯RÅv‡íµƒÔ>NÛպР˜ÿÄž üˬ:¼@ÄvÛC<³ÇO©çŸWc#/ýsåôÇÝv·nóöÞÖ ‰Q;w½¼MöõÙ endstream endobj 383 0 obj << /Length 3953 /Filter /FlateDecode >> stream xÚÍ\Ë’Û6Ýû+´lW¥¼ËIÆžI*3SSvVIl‰ÝÖDÛ”Çùú9 Õ¢äR•)’Â!€û8÷‚lö0c³¼b£ã7ï_}ýÖˆ™¯¼föþ~Æ•«¬3£m%¤ž½_Ì~ºù™qûú—÷ßþ÷õ[åŽþ„3)q#<üþCóú–{vs¿ßÌwËv³¥¿~ýÖÃhSI퇿,·«Ðü›÷¯>¾â¸Êf|&$¯¤áMÞd¾~õÓ/l¶ÀÍïg¬’ÞÍ>…G×3QyG­fï^ý7v*ARU’ó´SŸ2˜JWÒÄ8RÈíêó¦]/ëL%3•ò%°%ó•²#ìæ·:š:Á*/Ä0_e¦JUšÉÉ™’šWÜ™)©UÅÝHüöHQÖáÝ%/ë$†á¼|H¯*o]Hoqn¿@@”†ù"¢´¯˜s—KŸ’[) ªRÍn9¯¼Ö¢Â-Ш™¢‘ˆ^Ñn1€Z†¦„;=gÜ¡¯¤ü IFŽà&§KhVq)Jà -+.x‚}ß®PŒo™á^#|‚yJBDå¸$¤Þ,22ÂM%ì´Á—R–š()Mòâ§,ˆpv¾¢Ñ••î¬4Jk*ëmHë+ëôå©$4†ÁV V™ $RaŒ•ÐE@1ÆŠ«KDò–¼©•>5IêׂÝüöšëp(èÍ]ÓlâÙüC½yhñǮǮÙí»þz“kADÆLË5#"33o-ÔuŽ<†ùД}§òÀ]ð£Ã{m¶»¦î;×ÞOt–Fú3zêEÅ­/Ò!¯+n\Ú¡‘ :¥åÁØT#ZjR¿ÄàÖ d×Ä‹¹,HáËæGLÛi&+\xgÃñ¨¿Î*ƒk"ÅhJEÈ»ÞàŽ½Œ)ñø˜Ä;ˆg=a®›õ]ÓeP‹&¼ªO—Ûœb‰ŠiWM2á²Çˆ4]›Á„ÂkcŠ` _i˜¦#ÌÅr»«7ó&#÷J‘Ícƒ!ÛF¹ìí—R0Uë– [´n‹ê5¤ßݼÙn›Í-57»œ”-µˆ;(ÙêsŒ×vCතף®^-wýS˜ˆpìM©Ð7õrUß­š¡‘®Ý?|È™JÏ*uÎT’…‡ÐÂbue1®Rd*Ñ”RzJU¤#óàŠ Â4{ŒzJY”P•ó¶®¶rDŽqs*£¤«<°J`*Le‚9o—›ùrÑlv9Ó-à½dIÀFK …â½XšÞ«“ÿ>owƒTÕ»Tüºæã~Ù5ý¯m³Û-7ñÇþ1ï2o† pƒ]½Üì¶P+‡µŠöñ„u,Þìûvþ¡YìWMfd-½Ó&ã®ã9 ñdþ¨)…'r»ßå„Hcô™â%`5ØEßjÞj9o.|£KQ'Ìà­4¾rFŽ‰Ý¶ç4óyÛ- dÔR‚×5«z>0¼»þ~0z’€g>‰íi >Î8F°ò:;âàÙ˜ Ms˜’Å\eµ-«0¦V™öX®¤c‚…¹¾’;¦C¼áäBfa²0dx{ÇÜu„ ^ Ñ&5eX/¿¿5Ý®ù=ƒK±7EpÉS2â>4»'ƒ©÷²¨SÐw‘‚6¿?v§tBXhâ¢>k<\ÁÀ·ƒYW`Ymä87 g’V—è±í’F¦=^ïW»eÞp^d Ép6èúþ>k9q&;Z|>©LøèXÓAßtu¤t™ÑuÄÅ´î8D<­„;-¯“a‰Ó¡)£áÌv9ÏI1™}U$šH`·MŽ±`hçOÖíV{ç„2p¥âLXÉa° ôHzŽ&xÚ£SFH Y9ÉKà*CN¤°Y¤f*QSÑ*¸MAí´.§ÂÁÔ q‚.|ÉòÏp‰¨éÃ~Uw}A^Ã)dè«þ©¼¢F=jbпÌÿ«Øg’>((8…ž¢gÈ߆÷í»±]ŽK§µ[(¨šrÄœ’´Zï`Í_à…ÿs÷¿f¾¶"wŸ›œ"€)27mQ\¨3… GuUÖ ¡4‚ jJ¡©©Å_bö‚ó"°âí} ›Í/ íŠ`B°8L‚yÂ3I.+ïM XÉ žÐ)lÞ3å1sˆœæ¤$(›6W-¸£sN‘ÙŽ8JÒ§×|¼¯.×m—¯[bçÒÚ/H=)Z—¶Dꉚ"B{6÷T¿¼s-8…%…à!¥‘ ž˜jJvxC;Ø2HŸ–»£P+®/ÑYo·ãÕGDgÓÜœT¡ø2²Ž‹ñ5eø‹6ÈI÷ À‹ƒH`³ ¤V`K`Ò²\q‚yÊb1ÅKÀöI€µ—âñÒ.‚òE0Á±©NºXäT‡â™C ã(ôͧ§õª%xüf7,ÑÎÛõã~7¬z=-Øî×q1;ß?²†ífüø‡º¯Eó3cb³ ʯ/M( §óL1¤2ÄSNÛëJD<Æ”‡¦Œ>“àuá/ S.uŠšSÉU`< £dœM1OŸ’…™/+ÁfÈ$Ãf5F)r­Š€’Ùåò¢YUÖ#L-"LŠž+íkVQoI©Õj˜ãP‚™!”Àþ œ†@‚ÙAoû‹úRÛpÒnFwbÇã½ûxL•Š—²uŸª¤?tˇ˜ñaã5sX‹wí3áK¢Wt¥½Ïqwè¬=“ÚT”G  öZ]G7h 3SSMMswZáñE`-­ð¸6ÏÝiÅÁ$òÌuŠy’»ÓšŒ.+©(€hë1lÞJ‚#Š€JªVã#м+ĨV C”Ë’þlî÷Û UøEY¼p²ìoSH!¬BŠè =â#6Jw>KZžá›;¾œn~ßäöáËv ÄSe(ù,Å!é‰t×4Û?÷Í/.|¸ òAÍ(gÃa%®.|ð!¯ë!™Ó<Ù…b³°ôÖ!]×9“"gTÔ1ŒšNA’1Ÿ),ƒŽŽ€ïWí§Üú¾ ÌêTA‚>–dºþ9£‹SjJ°@cu°‰§ êeL‰ ž¨ªwfZ˜ª,%`áÉÃs[ÏçÍv›«‰÷µ¼®•1)ìrsßæVüU¨÷*jl¨÷JPOK6•»YWXb”¥±)ð)ÉNJâA¯ŒÑ7ÿn‰¾A1úZh[”eº´®?Ç+‹æ±Ùôt£kúÚn(hUH¯êHæàmû¥fÒ)%iËsµ°ºrO…Øy{«Y( •T!)¯-9¶V†–¨økRÈ^ YÕÁ§ ôNP‡i G|äzPÉ\ÅF˜Ù,†±ü²¤9Áó &IÑsL…ÀÀTþZ§˜G›Éíkò#e3J=D¶RèZHàÝ‹µfôÚã¤äÓ®U©ªXR€¨ÛáçAð+«\Ó q¦¦\DµåÂ^·aCêÊC…C™º5g ËQE` å¹d ›e Òa¬/êàVG˜'Í´"¸J Ø!–w |±™vâæÝr½ÊeÌØäv´–ÏB”œNÆ•™ÀqÛî»yí –P–÷É_ükrAÌ£×g aJˆ‹P~•| ›J†–hȤXzU1ü»*¢+æxŠš•JÅ%m©»Rñ¸g0<-”_”Ak—âžÉ[á©SŽÓQ}·[®VC*øYõl&Yáù¯1îúPz I¼[†R\0’>Õ|G-íw}öw7$] »fˆ+“òàþñÍ(3s¿‡Õý‚ Ø¼8´ÔìLhiÎì¢ÐÒ@î©0äºBV -Œ%&âL "K˜Ù †V°Ìm¶z‹¶aAê ‚¥•B.ºö1_WÏ-€I$C Ž1Ÿªps”q•O«ÆÒõІ®™×;ªpŸ’Rì/”+ˆ4W%r…Ô”äÃ’Ö6'5àz½.ª|eÑDz·_æwšJYÖBö´¸¤¯^WVñ" ÞUV¦˜÷]»>+,:ä Ôã*ãñFfÒLVvͦ^VfÊü8¦tZl•¡"!S¢ƒÊO×L¥ å1ªh(‰­å1¢¬å1<…Ý´‹ CÑÒUE4T+Jç/[mÀ«™+‚Š¸Ä{{ZlSdƒ [É"Ȧ ^äž{ž©ß ¢­AjÄÑ"+­¢ôYŸ)ïM,UÁY q8$§9‡Ë‘ÄádDâp%KâŒ?"q„Ô?€îú–‡å¤QbïÏ`v/õ˜¹ý˜Ï§íÍc s®’6ÄAš+w¯#î×xSjJõiÝùªÞns$ÉC ù·wïãˆ=4›¦Óã "}çÅÄ„sp†CÓ‹ ´´zò+†ULž©»”Æf$Íê+™ &ÙóДŠr›û¸o0»`¨dd'a FÈõjÕÎs3íœûP«8?¼+üg×—´`ÛÏÁáõ—›ÓCG5!†ÁV ­/º4ƒI²!®»XÚþÀSuž“Peø9ér,îAüu;Y5ÁCS´7™<§¶Æ—Á¶´kn„}÷ÌG$/¾ ÉN`m’g¾ü«‚*d‘8Ðs..Ÿ4ÚDåw°CMZØ ª‹È m’j$+©}˜ÜdÛS(¸ÏQ«Ž)”goŒ ì!½‹{¿± téWä<öçÁ­,çqüˆóؘ8ÊçØHÏ|há¿Éž¿ÖbV–ò@ìÏï¥Zm SÉýW^[¬MA5eM_qJ53g·æ ¼†,s6šÒøáúÑ·r_C¡åqÁfi̦–¶DÇW•]M:¾mº%ä&ÿ=îMh„@TBÏçÛS¤Ñ#¯‡~\j;Œ,Oµš’@ì ¢2§úˆØéºfÞÜܳ=òùù30çò‚é“B‡Ï q„°ìºŽìÛL‡Œ›&_&·YF;ß½û!Ǧ@-/ÑÚ†ÍFýx÷í?ßüýÇÞäÒ Á X-£Þã¾ýñ]Óê€V•jeü'¨ÿúîßùý©ÓÇ;ð†”È¡Þ=DXw´ èÙý}· r92òû#M¨T9/À’òï:|¾‰éë2aŠU̘‹¸µñœý‘Άa(íYø˜G ·?T»ÌEª;©k¤ âˆ1ÑÈT?«&y]ù?6Q4á endstream endobj 389 0 obj << /Length 2127 /Filter /FlateDecode >> stream xÚ¥XMsò8¾¿¿‚£© Šeùsªæ@'ñ. œywjf ð®±ÛL6ûë§[-&ÎdköR«Õê§[-›ƒíÀ<}3õÿ]üíöÑwÜfÂv­A¼p!˜çú×ñ˜%œAœ~18³†#nš¦1ÉÖ²¨åðŸñßnk°Àµ\ÜhF–Å,×¥-Y“í_0qŸqß^Í3YŽiT2—I-Sš‹TV4lv’/QLƒœÎg({0 ¢?qÎG«:—Õ>«ë¬,`ƒðè á;YÉÕ;ѶUR42½™m›JJ¢—ú_ï’jÈ}c+5KSÒBR ¹c¼“ă¬êö”rÕ$Y‘[ÍGëò0ä¦ñÞ•Þì@'¥>¸=°í®þu¹iÞpWR¡V€CS=¨ër%Ôó´\÷²h’†¬ ,ãWÓ´rYÓú¯¦c’qbYöòB6΃…´ÉB”)“œDeQN.w+ýM­¹Žø[ÖìÊcC¦W²nªlš)r·Î©v‘ßåγ}v2CúL“mwŽ Á7ŽµÔ"OþuC“öešmÎÓØËS(/uÖÞ>WyVï×âFš¡Ò«¡ l¤&ÖÈ¢@§ ‚?¿D¶p™X×оí¿Å<´ %BœÛF-óœF`M¦BÇahä\:ÿBb*iÓ¡ßÀÙâLÌv½®éjdÔÛ®Ü_eÛ²‹A ´™º9Vø«MÕVFªÿëòFŽ«ÉuÓå:Éß”y^-@ à¤uY¤ þAéÜ—1îçX¾*1ÇE²NPP€!®¢l n´¬|…D•|jt¸(Èrf‡˜ïŒ ’WšDð•i;Ór‰·Áû4­Ëê䘺ꓩ4¡¬”Ù4Sqÿ,ì£gtêÅÏ!¤1wåì1þ>äàñB“¢%ýÏCH‡Ù„þ=À"7hKÁxÙrã ‹‚Æ÷(~ž½Æ´ÒŠ]Œ§ñÏDš=Òÿxúóç–ÿ=š> *„i„ÿ˜/Âå'ܘ-ˆ½Ì'QH,܈¦÷“ׇhúD‹wh:j€“é -ˆ‰qÁ>ÐJŒ)>£å $¶ ú­ˆBet íŒ—pqÿ C¨vã»h¡Ü °”õÅS¥>ò>¢þ8Óß|p/†.hÝ¿NÆzyþº˜Ï–aŸã)ª aÓhú¸«Ã—Ž÷lƒÁŠ€;Zš‡?áº"-ŸÇ“ QÉd ‡Žîzž-–DPNŽûÙLáÜèwFôôŒQÝŸg“‡w '0îB"N¢ñÝ$$Ù D º¢ÜOÆÑË 0Bã—1þ=…ZL»ƒÂ÷.ˆ<‰z•¹rœOsuÖ}ÍôƒI&Oã…^DjYŠ j}tVœø=Z†7}·Üx-<dý#唲ÂO¹t¨€0Ž ¨3ÎA§i¨uÅ9&qPé:ƒIJŸ(èͯK=P†8?ãô!O@ã%Í”ûó¼½s û´øNËJ’°±I¹öSHIåF•¨cÞô4†¾Ã\—Ÿ{¾Þ¾0`Ü-O%;f•Ó+aÂaΙñéeÞ'  NÞŽo»l½#µñ@Ò¹íDªn;ÉBI´§é+Q&²®a•Šœg²šØŽ{žd!+UÓáfž«–Æmà Sud“§ù/F뱺p´—I¡‡äbܱ.SI´<+þ^Vw/^ÿÛ¡c@ÓY÷ùÜò ¬/|î1?à^Åæuùá@e·pæsÞµûB …&´®½ÑSù9œ¾ï$öz¦ƒ7?v­ÛcEÍ€éªÞ°Ç¨@0çüxm”ÍÙ>i7t,ôsáusÂG‘6ÃÁWnòÄ©¯{ËT»z+÷(uÿ4®Ã„åŽøDSËeܱ. ‹=\BâólU%Õ»~ñ˜.3Á‰š´i» ‰Ñ’¶ñß(ʶ}O%¸l/οþðº~3Be‚W£k‰öµ(ôk1Ÿ@‹DýG«Û'£wÑßaE®Ëcµ–T•¡#úèTÇg_ÄÍgŽk·<ë¤ Ù«V®z±)Ó*Á/ÊvXIj¢%4m’j¥Ú<¤•šgS©¦(ä) mUëíãÓçPÖYSVêinC§{WRÜ#Ïc¶wÕ‹SŸí”ðíñ;¶ÆI–'«\“ÕqÊDnzlæmmôf'píšæðÃí-¼gkrÒ°B6·‡ªÄN¼¾/õ=J¸àÌ1OÏPW€  89»Œ ¢€À5TCš¤ò ‹T÷½Væ›îUã[~vÔðÓä½<ê~÷…KÔ.°¦¶X³ ²Ü?añ>´ÑCC½ý>¼o(Tˆ\>‡ Ž;}¹v“Ålk˜%¥=º³aðËÈ%îó²ÐÇ´Yy<¤I#¯t¨:Ç’|ò¨•—éà˜êQ_µ¶Éö²×[݇ZëØ›+‡òúí¶>+ܧœ‚ð¥gu+)\p1Ãv˜º(?;v}ÅXY±õ— ?BsÔ'3ú`Ý¥‘—N®¿¶÷pÌó¶<^™£íçõ.)¶Ô‚ü_¦«ãþX#džv»»­^h͈l@ø»†±ì»p<¨¨"øòÂÛ§ ^¥û2=æô]gäû̶ü.[·û $Yžöõg.³LþueæöùFí½ì-“9â/Ü›ÐKSðAQ|©àûö1>}Øêi2|fÞÿà¾Às>ºüóN‡UÇB}¤â[lïª8~@à©2]ætC(éó@ÆãÖõeøÜì€ 탰T¡¶x aüí¸¯¡\ endstream endobj 395 0 obj << /Length 1538 /Filter /FlateDecode >> stream xÚÕXKÛ6¾çWø(Í·¨=$A¤@@})’d‰¶™È’*QMüï;)­åÕÚ[äPô²¦ø~óÍ7ÃÅ«Ã ¯Þ½ÀOü¾Þ¾Ø¼Mé*E©¤rµÝ¯H*Uj%E‚(«m±úŒ]Ç‚Š¨ëw§ºèKí?MŸ¶?Ã^1!(wæ÷M‘YíVlÞruqjÌ$’„­bŠ•a—íÑtë˜ }5eé[{mó£oÚ£öVÿÕ›Vþëï5‘n;SW¾£Þûç× ¥p öG™Sf vQ…$§Ó¬°cæàrœ›Ûº=ß8Ja”05íÑ• çdJÆ9È͘| ¤q–Æ a.ý$v5ëC,0ŽÞéJ·Æ3;F*MÇ3òºÚ›CßêÙ.Ón ±Ô˜"Jh°j“õ¶>è uKPÅ‚ …å|Í«½Õ-`#iÔèv_·'SÜ7 îƒlW;—y¿ù±Îê¦{éÚÂjMÕ‡‘¯Æý2·~°‚àÌà’‹ÁcX¡ôášoêÓi BJÀ}ÍÊ2³æ²̃ƒû<ˆS ÄàlÎg·¢[r4U:sÛæ­’+¿–°„91ML,1Dá\ ›,þ\YzÚ>Ÿ ˜÷ æ›åÒàÚË„cø óÒ mn™s(øXíñ ÓG—³ö}]–µ‹ ¯û g7Œ¨A(|O~ᣡÃoâtš+½gA i¦”Æ]ÑíSïg‹Â䬚I`àÈ.8«ÒçXkîÎUÈq÷ðZºú%ZCÇG]6w‘ `¿Ö¨P,S!-å}Øæ1 5ꜧº ­ü¢™œN.ÌÁCyƒ¡Ü ‰ã¦Õ{óíV¡BT¢`ƒÀ •ÊûGeìãû-ý"¤-ÀbWåÓ¦B±•"‚]è»à £ÅNkbSÙ?€ÜúSä,úT¤|ê=Ûnô Ýƒ,}º…@,¤ã?t ïÇ@_Ø °J»,wpÉŸaÔݵY{Ójÿ» ³AY ? X¹ XC*ø7¯—Êàô`™Wƒ}Ýr€¹¨žñÚ‰9$ñ_k«G2»˜OˆîuiþÑõÅÏ¥àuæPÇ0w[†ÑnÔ›6¨bˆ_DA ^|J&(ê{òÒ#²R $]æª+¬þ»0{ºŽz€û#8kó£±ÀiÐ4¯B7þT!¹„*&’;@x6QÅžDBÓùÿ Žç‚áÌMQÂä\eÙåÊ©1å³R¶àˆ¦WõSöEß­…E|Ñ’÷Ó{b¸œÀcfw7ü.ûÂÿœüö·Ã u"†çjª¿ƒš­øiûâŽôÌ endstream endobj 405 0 obj << /Length 2853 /Filter /FlateDecode >> stream xÚ­ZKs㸾ϯÐQNÄó8©ÊcS³©JS9lö@K´Í E*"5³Þ_ŸèEÊ”<²u"Ø»ñèÇ× ¦‹ÇEºø뇔ŸºûðÇ¿X½Èd’K-w‹,Ï£íB+“ˆ\-îÖ‹_–Y"on³4M—?5}ùXînn…J—_ÊžŸ«û]±{¾ùõîïÄ/KœR_º¸2Ê œ’Œyý\nZ|8ü\4Åc¹)›ž˜H»p‰ÓB3Ì&˜T`ñ¥jV%¾²bYÐã©z|º­Ë¡–ßn2µ,kOÏ–í¶Ü}Õ64,>«®fÂýËUßÑà}·/êú™‡4723‘.ÛšxvÔÓÄì fÔí﻾Ü2§¢Y39Ìë +{BKèŸü´Ð°—hU]¤Äià¥i{îŶïJÈXÇwzŒÂ€M¹®Šž)¾¯ûî#ÞL¶Ü´³zØ7+¿']äPôñƒ~¿kæ¦ë·Yèe–þÝ¿Þ;êø^Õ5Q‹ºk‰¶+ë²èJz)b?Í”ÃÖƒº-º.¬Ìíø¹»ÉìòqïU¢Knnó4_þô@}Þ>°èzžfs“¥80ŸÛy?=+ý—Ôh›ØØÑ:)ô„¸8z2+&=ôånH¸Çô¶Âòý18hDÑ=µûzMm¿|æU·Í#7çf¿j·~q^;¤¡ùɸ©rt&hCñŸÂ¼Â€¢93´ê»²~{l—wO°Îe5ì¯dõ$Ì úµ…U÷5³|hyì¦øZa3óïöaoaï¬v¡Å¤vW=VM0)ÿ'ˆöc6­=é Z]»!uÄ*™AYw+zVüYéÍõ·m]­ª¾fó°+Ëuf ÷ç¤ä©jšê]˜VúòÈ=)8l2¡ýÍϦ¨÷% §“*Ö}Öí*0)ùã±!9Q`³/†aAcñÄ®ú³'r;™rÔXÜŽ\Ð÷§jõÄÞèXe3…éúÈoýà×[¨@¹#Wˆ¼•ÞDî+v}µÚ×øŽôãi'èO¢­ë6œe´_¥qxwüïC†fºÈ½É´^HçåÄbµùð˯ébNÈOrgßÃÐÍB$Î:´êÅ—ÿœ°0˜c~9‹L³,®L¦8¦,ðÊÁ+¬Û‡¿€éÄC¸½ŽP&"sS¡Õ·ò̶)—ñÑÙ¾mÛ´H,¢üÅ, 0ÍñTb¤Í12?·kV$8¯«µ*ÉÐœ»v„GDžäBY´)‹ ¥2‹^ -2¥…LÐ>7cš± æCÞ·$zô¼Ù!R =ø€Àœ½i”ü‚t‰1zÎÐr5óoz¹mh ®0Ÿ\G ùÌbE„–`WÎ1”‚^ÏGTŠ¾»yyb¹µ‰ iD‚°ýEƒJ'iª/gñòÌs/êT`• {FÑ$öQùB%\w°µ±Ð¾øzBѼ+ÚØSà´³‰ÕGq€|°ZÞ—ý÷²lôˆò Ýôä#G+œ«¥sµjr®6žëhØœ #Ï3§¬Óàz¤wEæMþ$×°Cã.g1sÌZ£m«Ôœó'9Œ_\C¨Õ‰j*ôkYnçÙÌžr7ÝpoÈtì*Kò|zê,\Wä%6 ïT‚£ ã Àèå”H4vgÐÿM™ˆÇ†[ û˜„ôÄÅ2 Öm£äÕ“GË >î3³ÌaavP°G¹Ê(’âí îxiVtӹܗ£”#ÂXN‘^À¿ñ2Ê šyBû³ƒö¿Ž‡Sè—Ìß…‡/eqƒWŽôåu<| ¡…6ûº~ç.¾”ïÁó8‡s Z®~_C(ãá‰Ð¸k/-ZfâO²ü9s„U‹ƒªŸrôÞcH2Êï(úUKÈ œÉÞc ³8c žWj~ 3¼ŠP¶„‰Ðè¥_±ÔïÊ /fqÆÀJkñ#–p¡ÑÆBOÅ6(™ËŽ,!—–-!—Žbˆ'ÅtºKê†Cß‚KäÒÒ¨*¾s>Ø0Gæ¸4M”ûçƒÐJUŠ Sv¨VÂ@ýÞ?¥i‰à‹“1h>¤y%òLZŠŽÅCOòà‰Xóût‘è £!£ÃÚPÁœAq€}Úe”4çf”ÑæÆŒ]…Ýì}Ü·î™0°o‚yè~&f½Ž6gÊTþu fÊ&Ú(¨…Óoµ@ÖËYÌ[Œ ÉgÎL–¨Ü]E&p¥Bf;zº”bàÝØ`â*µ õDI%›ÅÒúP %Æ®+¹&Y5ñBhRÁ(Ó<=ÎŒ&2(~ÖŲw˜HÅ2ùÖRïyný® u[ªÐ:ƒíÈÔ‚%(A– 2ØéÎÃ]Oª˜Dö£üMSÓ•‘¼‡±7ë%È4OWFž´-wÈØ7D­z®—ˆ6ÜŽ%s6ö7ªÈŽo»¨’{+œæb‚öàpc͸Jå;¨Je‡tÒ®‰Û˜O‚Ñ`ëG) ‚Ÿ‚1Af’Zý¶Ô*CJ".g1—ZÉ$SX!¨Xs6µJ kº†P kš=Z™CÒò¢’`bíÞ;²[έ$ÒEà»InE·?€¦„w/Ú¼M]Ìâ šò¼Rm_GSWÊhj"4VxΣ)! ‘}šº˜Åi4åYéxAM]C(£©‰ÐSu1(™/ДД‰ÀIý!ÈìAo›ú™Z¡¦3ùæ€À@,7ÛvWì* ×!ü(ç–Ÿn¸IUÜjD§l&Nä§àíÑøOšŠ¦êžÊõGÕF0F˜P–õ v¤ÜK´ª'BdÇ)Œ@ =¯b§.®p.1Ó Žéµ€99œ1Ú’zØF[þÈ86bˆuRÇ“@(6ñËp{ÿLä‚Ï{6¬“Hcß3K_Ñ&'ý–©™:ÁYp‡ÌI"¨‹,Jz[=ÅÀ]x·q)‹[26ISXwö¢ÌIäÚú*Bk´c"ôt<ÒæÄýÅmîR@÷€¦<Ün|ý»¡ì#tÐ/% Ü=…/,„'Êp?Æý̸} 3ö˜Úߌ=oËÕ)Nh˜ö ÆÒS¡ð|ÉŒVã’¡GJ #¥x§>ÔÎðgœ‚ø·C=Ñã§áO‘ø?¸Ýów±¢hCÞÖ U66›»t6¢g´¨ÈïøJr”¾Å;X­ù›‰šÌgôûˆ»vC­¸F4+î$sîè«u¹«x’ÙGùûízÏG>+þÎqøeãø/3ÿ™ó,`òð«™~[«ú Kú4ìµ_Ì>|š;ÅUm÷õð'Há¿<ýùuÐßp tô— Z´·hìÊ駫՞¯H4ÔæûYç5xþÖOeÍŒ–æ©Fj7ø¶ù{K¸ò> stream xÚ­XÝoã6Ï_aà^”¢æòS${‡{‡ëáî¡Àáô¡[²¤ÄjeÉ«d÷þú9¤-9Šlò`ˆ’ÃùøÍp†tu¿¢«]ÑðýûÍÕ‡Ÿ¤YYbSž®nîVL¢S³J•&\¨ÕM±ú5ɺòz-„MºòóXueÿ†¿ÛìšÓäáš©$¬Û”eãF&ÉêºÍ³!ny¬†mÕ„íÛ°ºÏva”·ÍP:>_r½V:Mn¶e<ü E>v]Ù õWü۴׿ÝüôY3F¬ 2ßM>TmÓ_¯¹VI‘誳M]:²LîÚçw­;ö¡jîq"kÞn~/ó!,îÚ] 6¥;óÃO–OlÇ© Ʀ ‰— êk·èêŸ7WŸ¯P銭„ £X¥R©í*ß]ýú]0 *aÍêÑ/Ý­8±Æ¨^ýïê¿èªÙqB¥ÄJîYqƒgæÃlîTC$WQ.ç6o’¦t ŠHA³gõB­Õ{è!…ȉ—è¡HjY” "Œ„T½ÀZ0KR“Îq°+3‡!5.Ü(uÐó`bÕ#i * 7-’¯M²@lïØgwe\8Ž›sÀñkp ã©MeéʬÒ,8ºGÒä{p˜¢ÉØÔeßãØ¡J{V’©³Êj¢ŒŒ‚åÌRHø$G÷w슞ªg ê|8 *!vì{¨'(d~mÕ;9” ÀMú.‡ò”(ðñìPož«rC¨<¤³¬ æ»ëÊK–L9$6}!± Bé»(%…"ÖªXR*î“ïr¨‚,ªÅüPgš%CRbù$Ÿb•’ÂIýX××.¿†´ær&Ÿá×Í.wg‹qÊ5$ðóöçn%WÊÂZõ¶¤d(ÑRxV2½”Œ>$¥~ÛŽuÐÉ…ªS5€ IP5”8vix)÷ºñùÜ+]vKõ{è)! ŒJ_­g5ôe}‡ŠïP¨O¢óÓ#z0) Çø=•„_Ã-`™>hë¤Y+(¾¾ ÿn=t>QEáÇþ:»ÿ©mUসÇÉá¶Ì9ÂèÀãDÝ5dcí\ž,;9$ ¸]aÄ01;RµÛ·}‰Ä I›vl ¤´aU(\YÒŒ» òàX­n]‘ù¸†K™Ç­‘Sp C8;ø¢Ý#X›aÍúT(Ž´>@*”2pn9¤zrk ªíܘÀ@»ó–"Ùøâ…/G©f„Q~>HÁ  @«à‚³Ê¼)H¹$LjÏJ«Ë埔Ê,ÿ¼2ÑS Å)Zâ\_HÈp ‡Vf誉ÂN¼9üÝ KïÚ:x5Ü*`[šªÙ3-ˆ¦yš|tª9Èe,‚¾ÿ/»'cyjlô©±X|Îwz%„- ˆe·#"–ÄCÚýz©®,»€1XÄgÀ0M0ð†3ÎLh:ß½TD^Èê2¢‚¬.-”jàí·” ŒIFZ趤9[Ÿ@ºì]ÙøüL4ÍB‡gT‡ïqh u9DÙìT—(žMPF*&¢išüÜÁ™a<Þ[-àŽ¤˜f‰hâBx4q!ŸÉk¸ä(’_ÚÀuáåæ|³ ߀3\!m[Ýo—øåín?ž#®ß¹ÌÍUÀ›ÕŽ0¶­?Q&–LC¬>`»^¸í\…¦çÊ÷Õ}S}¢”C,øv èêò®õ­—ÐËB˜”¤œ¿@s”ÚMäŽÚw}4¡ï4ªW„ó<ÎζȮqtÏ1îñc ‡U«GsÑî¾ØUºIÿ$3×<]ÖœI G¦¯W==„¶'Õæ¾Î‡–Ðâ#Í´é â):5-ÇÀÏB‹×˜.6¡"%pKÏ.Ó_® Ô¾]éðìæñâ©IîÊl]uèþ Ñ&ø¤!Pí@ñ¬&‹Yº<Æ/ˆkÒC?¹Í¡÷m[àIý¸ß·Ý€d{ðÍ6dñús´MVÕ8jÇà f`xî‰bìðIŒê`}H(“øtcé`~×d b 5ÐoyÕ¦e×y7¼-ž}6lûÈ5pe96¨#¿.ÝrM;„G“Þ§"ž,Ðvc¾u¯GŒ&ÿ€+?øò“ªøÔR…•ñ}âÈ®©«?Ü›š³ÝVEQ¢EîÃöÇÊõOžp wùk+kó\… Òí.ûr{ÌÈ‹õò÷Þb‘åÔlcãÒ_ØÖ­ó½=ajöõk˜D)ï_&åÓÎ@=§·¿Š_Ìïl—lûoçG 5Wø›ÐR 'ËÐ…ð ¯È“™¼ÀÇÙçÈ@«SŒ$„<Ë&/ßaùà3à„`TP–ìÚ>F®$VžÜá‡sœ÷u_$:ËeŸwÕã:9$X/ Û°À/Ú|tIËçö]xñ,”3¤Çê7DE‹Ôv3dG®aÇTÙÿVM|Ú¬òíIæ?ªEÃÛlmÿíÁô—ªÉëÑéäðò7@χÈÔÛ%|ÒÓÂZkĽ½uÄ?Êr*, `ôlÛû”õn¬‡êô€g#xéä‡Àu÷p8þ‰©Ž!}Á:UñbãTÅ%ÛÄ€þ®*ΈF/ åÞ£êÛ~Ÿåå‹¥›ìùf OxÎuÿ6†¬öb5\¬«~øf"ƒ¨ Ÿªp’; ÌÐGA{ô`t¶š£?<º=G endstream endobj 413 0 obj << /Length 518 /Filter /FlateDecode >> stream xÚ­VMO¬0ÝϯhâF_2ÊB4.Lô%®Ù= !¥h#_Ês~¾-´ƒ fE[Î==÷Ür‹ÞþnŒ‘磿Ù={&ð ç˜ðc€nmè ûš{øøw}E3œT¹ÙÚ¦}}OËdÆ1üx¸yó_8Ñ!èÙÌߘì1ãØà0±újØFˆÅOBŠ#!2€8ÝéQ§UÂèéu¨… kíûñ¿íÜ2HÖ´'`ûÍPFñ¥“dƒ’aE8LÓ9ÿ>Ó.‰‘†³sm8†/p½gHZÌ×Re4ÏÖjé’Hîj\‹3©e}¥†T­®Å»ˆUC*U¼®cƒ6ó£Ô4 åw,Â’äX´L?lqv}Å™bv䊜fL;§=ÙQH}Ë;#Òò¬Qyÿ >7zÖ9vJ‡È>Z%, õ]ãØ)aÒ¶zÇì3ŽŤÔV§ŸPEÐ:ÛLg·HŽÓ%¨Î^ä8ãÎÂ$I¦v"†«ŽIœä_Ú•8’(f¢‘--F‡C2×+ /ŽóB–Íâ|å½ÑaRÿTõÊÂÛUøºR‘ ¼bx^ZâU Ñ.¸ Xœ‰"œõt¶£­ œgü¨„¼{—«uÉZuCwÏ–ÛùÑw÷¹.7Úƒ.Ö» Ô‹xò7ßï×’s endstream endobj 418 0 obj << /Length 1727 /Filter /FlateDecode >> stream xÚµXKoã6¾çWèÅ.Ö\¾%¶Eh‹ö°@»A/íÂPl&êH®$o6ýõýF”Ó‘dí=‰âcf8o†Ã“›„'¿\ðß//Þþìd☳Ò&—׉H ³B$Ö¤L*“\.“¿&_åbµYúéÌH3ù®hVo›Å­_nV~^VKÏn¿Ÿ~¸ü $gB0gúcØ7_´ŸÂ©¯é/:5¿ñ-­ÿÍ ïŽkÁ2­bó9ûÇûu ó„JO† $¾%JOî™Ì¶´%h‹ì൮òrùâÛÐæÝKŒÉJ{ú#4<""V¸¼içW›bõr ‡Ÿ­ëÂö4>ƒ¢A÷U·ðŸÖõI— =MWx”øy!ž÷Z{\ˆCûöçÌ&¿¤(œeŠYLÍdÆÌV‹‚i¦¦3Á9ŸüáÛM=fRNgÒðÉå4Õ“‡µoµ(¤I¿È 7 {t¶öK³ [»=›„fJˆI{?|R…ŸfíE¾ ?5IPö»:ÎòÉuU‡¹ëM¹h‹ªÜºÍÛ0òE{ëë§Dò𹪪•Ïû¹@Œïœ.Ê`´^àÈhë~V¬WP±’r²$±¥˜”U&n˜h-ÊLòk¶­óº-›U^O5Ÿ¼Á¤rÀ¨VòŠôÖëöâ§Ë‹/fy"$MµI´ÔÌ)™,î.þúÀ“%áûL¹,¹ï¶Þ%’¹Ìa´JÞ_ü>ÎÊr–*Ý‘JAªcJ ±(¶i¶’‘…Âínó&h ½­}?·®š¦¸Zù ZiãNĺý8…†òÕÆ7ߌèAA.kŽªAdœeR"\pËÔž¢èÈ£ˆTš¦±b®’¦Ô9˜Jž1%\Ì´­7~L÷òé­:)àÜÂqRtѤÊä~>Ìeëé÷†Â‚&e@À%—Ø´,y wíõ¯w5¢Iüã±Dʪ߄Ø!Ä™pb»åa‹'1(@d¾qÍ2+zƒVî©Ïa­B½Ä4âǪ³ø ¶@h¹çƒ×ùªS<‚̱Ììåò ‚•™Lmì2M} ¬ÿçëjë ™zÎ8®7„ã!©¡MúŒ; Ì`ɲ¡B£g€tŽ °»LhË©gðÒ2Möä` Ÿ‚—Æ1Íao°çˆk(À“#{ž+àɉ˜©¯ë­‚cdÌq³‡dï2xÃ>ù9ˬëÔ1®Óس‚ óHd$Ýž[iÔTw¾Kˆá÷Þ—ýÂ}]uYRºlr9ž-œ?“-ö K¨ "Û“¢O¥Ž©A*ÔôÑ×´¸ÈˆŠ¸©8Ò¥ºDØ)`[ãÐÏ~*tLi÷ªT(™Ñê™Tˆ=Îá)Kœ– 3(@Tjás2VÄ~*7žžƒ«DšàÎÆ\«ÆrPò1Ÿ ˆ§¤Ž&vOa´ƒxJÇnKËy8Ôl ß4×›Uø¯Ö¾Î©î)KuÞ Í. Ü“šÄV†< Z³† sZÙbà‰Z³(MzÌV"ÕÌP¨œ+Ìm(Tv¹„#î¡‘Êäa4¢ÅØHNû¨£±™‡úŠ£Ô¡Ãuh¡G.S…ÚƬ÷¾G"Ýײ ù¸¿Ã§‘KBÙà’ô¨²á Õ=]hpWÕ>ŒŠ“w?…‰ªñ&LªÓãå¯t fCFRLòÓ‚ÏY¦Ò@ŠƒÔ±¤TÎ@ú \•D6ËҘ둬fõP6Œ‡`l§ñ„œ´ÎœE|à¤ÍT,þxìià¤äê\uWNË* ±ü’¶G性=é è¾/ðçÔÉ›F8Ä€F]¸#Ýñì 1Kq‹K©“° ]Gá•–TH¯ù×CˆÕ~]ûHA)\YzÍã›îUÑX ˆŠÕU¦4Rµ2èÔn©Åª?[•>¬W×a¢1Óph…DLš7­ð€Î`±8»”s.Ë¢}˜ZÓuŒ8‚«JìžÀ?ïâ¨[x—¿caê=°3ÌAÔOÂ~ßïz”*ì]tM,\õGµÏÛ°›O6M@`%¶­Žý¾ÜuµZUDó>Tˆ„˜Ûm>‰†uaÿÁÐU»)>úÇ®yËc“ó¾nàq /tìú–ßgÑ…;| ²¥¿ùR”óò…díkÈ"'¶_H/ ½ÿ´lf¨¥#¯zOÑIÁ°Ø¦ñ]X0<Š úïbƒW}âbƒ~úØ ax¯wʼnÑɾ&^i­v~]Wwó¦Õ뛃ôUEë(?í÷ïY/^¤Ÿ)Á„êq\ÈèrÈÿü©Ž endstream endobj 423 0 obj << /Length 1905 /Filter /FlateDecode >> stream xÚÍYÙnã6}ÏWèKRŒ9Ü´(Ð}(P4èËt`ȶ«ãH®%gšùúR’m9ô’XúdŠ¾¼‡Ë]Î%irŸÐä—+Úþþt{õþƒã‰#NsÜÞ%Ì(¢K´2„ •ÜÎ’×ãq^-Æ÷ùcv3R\]û¯ÇtÑ||Û~ó¢߭ʇñ:ÿ‹*껧õ¿­Zïn>ÝþšHF¬Ɉ1âT«]Tù}‘ÍÙEYÜ7­5ô°ï°QlÜ ç5¯‹ÏÕ çVå_³qÝHïšßÝ>ßn»§eQµ½e>ë´w¨ÍJÞvg¿GÚ#y2âÀd¶Á¼cAƒïÖÅ´ÎË¢Ø;(%3§F`A^æêçÛ«®ziÂÎ,JåÑŠ%Ó‡«Ÿh2ÿ&”g“/Aò!áÄY¯k‘üqõ{Ä*8fÇt£J*Þ`ú~Ž) $Ì  ’)u‡Ušë ÊÃeÔ[OÕ2Âa.C Z oã}ÔÆp"6#Ñ\tG¬nµžÖUc3iÔZ ßÊ£Ö"¬%’b.Â1"™‰šËÞZ˜!N°nba£Ã*j¸ÀóeMèvåÝB厬ÏlÔÍòû¼Ží ç„IÓ‰5Î?pzßý³t:ÇŒ$ ûœWuÿ.ï"4’h½Á÷±!†.ˆØ®bòTgÕ;¯S\Wu¹òaÐëOëˆ~Í wjsô-„ay'FnF‚š6ª@ó"K}œòMw­)Ÿ¦EÛ6­iæU;•ªZ?`^a›ׯ±·Mu IE¯'Yó»YÚ^ýªªIÎ$qRöÿyÃ@ëvp9ù;k̘X_õ´\æê´hw«¬ë[WÍ¡YÏÛ1wåbQÞÀ¬¾lþëBkæµÉˆÝﾃjbëGéoòbºXÏÚÜó=œê=lœÌ ¥¯IUXÛ“ÏOôç,[Ƥ·i±CÑ»(Åz±8†â7k‹R§Ÿ³ã(û)«·f›²˜º~:phyQ-q¦ÿï3Ún§î³»ù0®òKN%®w–¯ÕÛÎwV®'‹,¢ù¥»Ü¦SZŒÓI6bK¡Nè?Pùö Žçþ³¾átÞ"pqÊM©L+B)R+F(H^R™F¢tA“`îcžJ7¦E Ö×-"Nêô Þª>$N;Fn9F Ê™"Bó½u®c”‰Õs£!@¨‚ìcc|fKßVY½^mn®»¬Ž O²Õ7Ù¥FÖWò47’DÉMae9ðæÜËYN;Q¤êŽä€7—ò\Ú±=RHäŒiWi´·…r±®ÛîGŸ/Zâ€?1Ù]iã÷$[¥P³ù?²ƒ¶›ècd) äœmÙT„–ÁO°kiïÀ(U”±ké%lP%`B‡c@1ƒmÔ3O­û ÅPì§Â «P`‹=Ðh4΋jPI)±œõA£Ñ%alLNA]óp4„m 6xIÕ–0Ð#µëÓxCüAvN¶ˆ×Ê"aÉÖ¾x±ôúË<µt‡Âx]á>B€?çé §ð3ÐÅvZ“,+šÖr•¥ Ó´¡Šž<µ£ç­ðˆsJ…ºÆ²@=Ãê­Ã¬ô§kjæè~­ã»ÚZÇ7ý”ƒT[¹øö¦rq|ýVú°ãûëytó˜Aõ¹­Îâq€x Upd’˼CPxGÐ$¡éH`ÆÜ ‚)±H|=ÐxК0jծỠQ™ÜÓ‡@‘.¿Ø­ò؆÷9Ö»LØwo¢¨8j’9â…˜¸äPÁÔv!…%ŽÊA@=µvâ »ÊÓA»N˜éc¢ªŠ`zÇTƒ8€´þRÒb#¡@äë‰W Ba­ðÚ™‹(¶[—:¨’Î+%àwB¨A@ Ø:—}Ш}0øfbPSå˯]ÐÙ)~÷:æàº]à…Óæ^E»Çˆ fƒ€‚ŸB ‡ñ$.1>þ€(QFSÓ‡Œ—zZ‚;ëA@}mÕÞ:£¥^¨£‡9ÐPGó>è±ZµJglþ†3Â4t¨ñ ÿ@Dq^ÏJ©“g¤ðnnq^aÊ ?#bˆöBzP‡¢\a’Ñ݉Aü@2A7g˜¤áãl?Þʨz‰In_š&¤/ä@Ãx?}•Åâ©÷›.—‹Í}÷P€ª;UÛÇÆóŒÂ_ÖJ8óë­âÙ|u_\òâàå&eÙ²‚®ñ×lU¾‰â²È.yÏ9¨·Èî_«úÔ”‹²€ö·R½,«7QýB½;FÛ7tD2*¸Ï8Äš¶èb¢7þø¯?ðÍ endstream endobj 427 0 obj << /Length 1017 /Filter /FlateDecode >> stream xÚÍXYoã6~÷¯ лX3â)- ´@S ŠõÛîÂmÚ&BKŽ»ù÷Š²9®xÝ扙áÌ7—"´@ú£5ão£Þݽ¦Hc-©D£9"±À’$EŒ)h4C_ú¶pãI–¹ÁPPQm7¶Å85‹¯‘ˆÆc¿öh̺s"|ü¸#ä§Á·ÑŸÀsHÖâ]›–7¡›'·¡›&éô0/ŸßEYž¶ÜÅÄïî¹z•!•Xi c¬ ²Ò †TDýr™”»Y³TØEfÙ<ŒÉC˜Ø"ŒU:3_£ˆ¦f†©j´£5ÏœË àÖ¦‹°4±i’?‡ù:ÏÖ&/­iè&ys¯%ßÒ´Nl^´²Õíø¥Ã£V­þLï÷Qï©G`5B1%áABÆ8Ž š®z_¾Eh›ð Ì´BÛúè Q¬•†™CŸ{ðB¦4f’ˆÍz‹¼5wÕd'WQë¬uïݸG}H)ߎ…«?Øtꪙ Vÿ^xñò—óëÎq.ò©&È Vœu©ž¸I_P>ì\?Šugþ¡ŽjjQ~D¡Þ«)yC¡ÌÓÔTú1•LŠ÷këRpÌi7„P­u^¥ÓÒB¤}VÇPi «”h8£“ ˆVW„UJ)–<®I1Æ;qu)Sðù]˜‚¢5]¦`¬L…”°ïÂTL#Úejž%†9oÈti¦E0Ûvi sçáÖÍj¹È‘á#ÉDõÕʤ»ý:Ѳ(n•GN}9mö&ÀjÂ#¬bÑ…u‘¹jW¶üRÒ1ø:ÀˇúÚ±¡`e{9%7EåÊ­òwðÍÛ†à,|¶px7<Ó²‹Ìéj=.ì€ü&.óʨ÷/êŽu0Õ‹ÇzM¼Š÷˜&øøh]nÔ62૦â8~™Ï:pÆw8Ñ•m‹Ï:\)ÞoзD¾ W4.Á´ »1‡Lûª”zÁA™<šËÚùó˜tþ\ÀD^Âdî²,¿ý[¦ÆºÛs)sˆ:·gcÓÍí™Pó÷ú.¯|¢ëGTàB ÔWX©&eÞ¹îþï> stream xÚÕWKoÛ8¾ûWØ‹í‘”(û8,°-P hõ­[²$ËÂêáêá8ýõŠ”bié8NÒìæ$’Î|ÎÌ7´­Ø²­·[ÿXN®ß8ÜH0¬åÆÂG&s=D¨k-Cëót¹f âÚÓM‘¦ÅŒ¸Ó›$ÕÒ:ÉýòV‹]TúuRä•šû¥Þçψ=ÝË~’úëT/ùìËòÝõAŽ†lâ¾ÖvR¥Rhòçròu‚aÕ¶°EÖ¢teM>±­~¾³lD·nZÑÌ"Hp£Ôú4ùKx`Ž2ÙØxï§ ÙÐ7.bwÀ*Ôâ²G.©_ô ×Z`<ª¶þ”äAÚ„à\ò+ñ,¢íïR#hY`Œ„«±¬Vð'{-.g_;™ëÙ*Kò¿m×VµÿQx¯Z FÜ¡&3'wÐŽiw/No?‹Ò?ü7(Ù%(ý0|¾”«&yÐ&¯’8B%š2©åè™ VÍú\7 ü¿;2kÒ×ÝMúxG²qd˜ì_È‘#îX0àU‡ hàC®h0Éëh†Ýi•jA1eÚDÕ•Z¸éx4 ɯ~šjÊÝjj…íZ¦¾‡¬ïúAäEâBühê"Ña÷€K¹»ÿÇd>-2_$…âà5P Œõz¥F÷š®.ˆùí%Iªz_êL7MÈÔ1´¬.EÔ%÷v¬s¡Rbü) +!Q)59Ö‘M ¶žÅ¤c#†ÅФ ƒ)…DçŒ2ª›²}€ Ui¢t—‘_GU­–ƒ"ËŠ\ý Y±öIU”êg¬>ÅÆôT`á¹r65íyœw"~õbÚ«!¦Ð p,ââa ùUWŸÓTWh½RßÌ0ÔÛøÊ`^ä8Ng~~0ŸB¸øì)¸çõjnϪ©š`Ûq†_4RŽ°ð.67(ñÈøŠà5ÒÑ‹ülÐÁ'—œì<r G¯ã7ƒ•Ž) Îï=xGrÅÈS¢Dß¾ÿ¨]í¢:$›š£uQ© ÆdQã2s»:TEãMÃWv‘w]Á‰÷vbL"ÇCž`£ê5v/Dï½·í¢|Eº‡Þ%©ìÛÚ|Hê­)Ð!BÞÒ)',…ènW”5RŒEC6#ÃütìR!FÝ,Èliªõ‘< gwM–š~®ëH/´EªÝ˧›²È '"nÛgÄØ]•Ùm*ÕžÁPÕG@ë¶èŽŒ‘CFG·u}@<¨«ëÙø\W·Š³Ý¸³»èeW±’Ž“Šd· ׃ú ¥`tº=ÈvßVµüö,=Ë#qàUãR®»óß°|tÃ:"y‹Ãí ĹNpìv“x2¼ endstream endobj 437 0 obj << /Length 3278 /Filter /FlateDecode >> stream xÚ­Ûrã¶õÝ_¡™¾È‹;À¶Ó™t&›4“vÚÄ}J2ZâÚL$R!©½äë{@‘2-i×|"ˆË¹ã\ðÅã‚/¾¹âñû»«7oµ_d,³Ò.îÞ-„öÌ ¹°Æ1©Ìân½øiy÷T\ßJk–Õ~[4yW7ô›Wkj¬‹ªÞ–UÑËú]œAXSÖU¾¡¿÷×F6ût•WÔxˆŵ0Ë]“¯ºbMðòöú—»ïÞ¼Íä€Vé Ð(“@å7ÿúM3ä™RiJ9€[Ü*5Ü.n…`™‰ÜîÛ²z´†/»À84ÞÕ›M‹?ôcïöÕ ¹jÂêEš¾G´jÁ¼V‹[ ˆ„'D*«Õf¿ ÿ­l7oÞç›ûÇíŽ=ý=ÈÇ”•UGsaê}˜Zt÷ \ò37üþ~+ŠÝhýüùý 5¶»?î#œ?`•øëŨ@Í3 zóÖÛá’(šÛ^6 Œ$Á43×·‚s¾ü±èZ’94~(6Á¤¦Ì9ñÌF@@Ø”U`Ó'³Ø·`·Zf˶ü šÿ´K}hËáûðk±BJpüZ:ö6Å®)Ú¢ê‚a\lrqv“Ƚ™2cc™Ñ6 ¾úúîê÷+½|!Z·‰1mÔbµ½úé¾XÃhŽ©Ì/>„™Û…d™Ï µYüxõ_ÚàcC”3&  ¤Ñ„ó!oËÕV Lñl´&cæЂ¤¦tc˜ÍDÇ”Än˜Œ”âÈd§' g%§9Ó€ÿ,£=!(™e'%'\Æ\fgAë%s^ÑnóÝK’“§$›Š«“–&akHØ3P.%êúH`_ªs¤\Ÿ¦Ü@èRÙ,”[ÁœôË\¼Ræ™gRˆ9(WvƘî}žç9R%ìYp*β(øszvÌø^èŸËKX&]vR`Ê ÆgÑ´òšq—]$1-8ór´Z(æÅ›˜aÊŸŽF0áfq‚Úh&ìeNP{° 1‹Ô^±Œ›KLìVËʃ˦æôiÙ³Ì#fÌNô«b °t¥ôéÐ+2L ô,h3ˆø&о`k‚e¿=ûÔr.åb^ƒ-JàÑç5ôÛ=åq.åôÐ9½òP!´«¦|(âÂ’üe† .@-¡âžNµ¼Ì¼ž…Þ\ ¹ÞÌ€6¹€ mö´ èOx®¡ŽVtÆ¥´ŒYoè« Ôa´¦ïf`ï4ýh½Z¶ù6µvùª˜ÊT…‡\U1t…ù¬_èL2ë^Y˜@Æy/‚ÒΟ.‡,X‰t³ µ`%Œў0t90tß´s+æÙE†> ÉÐ/‘\2ô9ÐFC¡}­¡² Åy2s¤ ÿ“™T.þŒC–Xõ ª'嫲=…Õ  Œü<ÏX˜ôŒ A†,~í<,x9ß —i.°PV‘=έèÓÖuIS„å€@ŠAæ¯&à¨ÓÇPp 5<§L*&Á]$ÊЋaÔ‡|Ê‚¢AïÆEì'²sêäXHÜ’ â©Wvt4Ù–kXŽµ³=£ w€úÀLj>¡Ø¡D –X9\18èOÔû”_KÞ»lÏOúÓYŸ ÀMPí·ECHB™°l‹ª¼s¯6*Ü$d‡þfJ+̉^}á‚é%Àäýáð3…XAøŠnò¸µtˆ·mKC;N)ƒÉG'p‚ƒEEð©€Wé»<ö#°i[¤ŽzÊ–&Ri= ô Çꪈõ{Æ8?:‚A‡¢õd!Yoãš2ØÄ}Æcù†‡‡ °êÈœ¡§ûp +jšO'zð~>øûˆ¢¬vûîù”–àÐÙ‚Ùw8ox7f‡·ˆq›ºÒâÏ/³l¼Ìúºi®…';‰} ø6xuôâ=–ËÎ\dßßµûÝ®n‚~21mOÚ0ͳ/Ø#1<ÿá‡Ü¾M‘¯â„Âw•·µò8g_ueÈ3›5ÒÐo™à5åã#úIØN©åqM°(ÑÖ©±"Nƒ‹¥F}´Å %P{d±‰®1 ãÇô—¶ÔÙîWOqxê"Q`6ræÒAq˜cC™ätöºSà@ (£Ç§&ÏOî¥ò³ …$FBÖ;BZV]Ñ´PãNYÀŠ„Ä·‚º6T ᆼ‹Bí÷'þ [‰ÞU[æ¬;‡xt;ühŸ‹ èYÕÛø‚°‘q…`F¡÷ŽB3ö‡pŒKº§¦ˆ}»ºm+¦ÕÔ-›hø ¶õtºŸF‹›êfêÆ$ð6NH¾“d+ÀÍc^|Tuû&„S|›€'ï|ôGâV[—«œÞ2à:ч-WoãœD‚Ä B«W«}CžÜÙtSñ~Sôü«Øà $«G™O…Ü]œR:I“*™µp#„Åm1QÏ ¦|Ÿ¢ýûß?•h¢>åá¦-€ ¬—X1Á…‘þuـѼš²P¥™:s\¥`7:p±ŠKØ•¯¼ÜÌ ÔRáRاdä¡®7Óµwã4û%.$vîÆ‘C 1x¼€Eꈉ¶Ë»³¼‰‡SE’W½ùD'9i>ä¨N¿ÐÁse”µÌðåuµ4Í‚“ >oÕXmGîLj&¹˜+dFHi«OÈÙƒw±c™rÆCU¼pü äX³›Fh;¦>ÉóŒÍZ3VLÙ¬ÑÊ (4Cï‚Aú«Š¬.ùTŒüuŠ™Uc?¾ý®‹a!¾¥¤ Êaߪ£RÇ\Êqe_ÂÉPÔmb®®ialœ´¤d%\ÞÂè¾EÏ>¡c'¡˜pgq(&òMï €ï}¹üêläPT@r¶NDI„-o&“¥d¬t¡Š®o° ]¡ð†Æ¶ØÖÍ'l‹TèBoJ_FSæÐ"$&\ücc?˜"†t”P]m> À¯§2Éð¶PlÊ šÛ<,B/wûÒÙù ³¡ÒÃþpÀŠ~XF„­`A8aõ”Wq˜xÎqJ‰C“g¡’0ãì-½R ô}‹4%/Ì!´nÖƒ2ºþIm°FÃûÝÏðK{!XÃïû’ÎÒ62m¿û¶è >n‡dxa‘2†+ꇶhúÚñ†‹¼º¾à½¯{ñ½/¤‹/¼õ-ªýöð´6J$ý²{43êÇS›ØßßBëùËÞtzQ—ë1¤ …K@¿´—æ³lÌäW ©§pˆWv»˜ÕrÚØDÍåPe8³¢ïpWaéuGqz°¾-·å&oÆÀRñ1vðªÐEµO¸ƒ¥çå«b—\È°³ƒrtÊá1(¾Ïú;|G‘­É›+-¡vÂ&6¥óZèP!¶‰yËÓóóôOëÁ‡>6ù–ú‚,à[nw›bŸíÀo×€ŠVöQ ßKAГÏîL N ”œ.U“3†–8¨{°qigáaTS¬º´ßB> stream xÚ­YÝoÛÈ÷_! /Ô!Úì'¹D{.ER¤ìÖñµ—ƒA‘´Í†&’²Ïÿ}gv–”(¯?ÒèE\î.ç7ß;³â‹ë_üý„û绋“·´]¤,e¼¸¸Z¥XÛEl&•Y\‹ß¢¢êÊ|¨–+™ÆQ¿i 7% Ê®k;Ömž UÛ°åJk½óe붪æšÞÚfÿ;Í£7Ë•âIT”ë¥äÑöúºìzÚ²îÊ쫧q;b-¿øȳ‚¥Æóì6)iFÞ”Ø<ßv]YÐBÖ4g Ílºv)LtWþÛŒ6ôC–¥™¡Ëòd3*ŽÎÃSÚ¶îýŽä'³íÐÞƒyV£î<Â*Ä-AÊÄŽX8tX=Æàéôè§:¿Íâ¨héÙ´~â~)8ÈéÞ`’fó¶Sl=`‰"ÿ?e¾uÚ$ «¡ô™Ÿ­<ï*4jYÝf4È꾥Ѧ+¯m~n” †Žxœ1s0B³Të9ÖY¤ô >=‹8\—7:Ó]5δWô¬úšÎð´—žý¦Ì«/œKäÞ-<Œ;ë½yû!•{#ŒJA Ž#¤ ›NÞ_œ|;0Ëb¡Ë½ˆyÊb¡ùíÉo¿óEk =¦R»¸w;o’¥iÕ‹Ï'ÿ¢ðœ¡)+X"SGJ ¯…vƒfëãjaYªÒck j—vÜ—CTY&ErP-˜äæ@Ú&€i$“ñQ4¬aÒ¨9&¹•3þ,[BL ¦­™{%ù›öΣPM”úpr —Õ…··.áp.?MÆ 8š0ô:úÙjž¶j›ÕS¬%ŠIùí ¦ˆþ½B@$VeÝRØèz{[6COœ\ÜOŒ^m›œ’ÖJJÅ´Š½¸±øjŒ>Œe]A'*“?zlI‘ÂkÆ–ð²¤äœ%IâH å@ÏNcJÆ‚TÇÀ„,e¥žc¾???;À‚w›DVkfb5‡ýÏ/ç§Çy2›™˜²úY+I3a’£°nS&tü²•˜Sò£¨KqÅÀ×_e%%á;-«`øÿ öog§O}°”Æ“ÅŒ†À\È 1“Iú¬±4d2©Ž¢8- ÏJõ²±4$ i¢5-QÄWÙJÅøq@MÌ8O稿¼;;¿EƒÜ¥Z—*•¶€¨õŠ*ÊoÚÊÕvJHJ¹8;LËãÙ€/t6àF6¸Ùp†Ào:¹Ì}Ö5ÿWýA6ñ¦r1à¡P“û‚‡& Á ê¼—u¸Ò©>$kÕ{™±„$ír¨ ôÁ¹»iû¾Z×å¼²ü¶-;_‚Rã×4Ã~IÅj[”Î~S‡4>³Œ‹U‘°ÿ§ªÉë-Öñ*ý¿ÀùüÖWfì毡Jv\B¹?Ðøæ÷_BÅpÙ6—Ž³/Üp\ˇ?hãO0zã¿iüÇwY ûÄŸƒ0Máú%„‰ÜÛ6^=éjžIvËÌ(;TA,£Ÿs},@µTEw}ÀÔÈže±ÿr¾{¥¹¶l{׫)팉3•Û}õ@oëv¸ñóMQ-¥kݶYMsEeMï*cGƒ †í¦.=öóÍ,¤C \è׌ˆ¾êÑ9­& Ö¸. Ÿ¤aǬ6Ùm9®4ÚhPÖŽÖ7-X¬ôÏ*Ú§ Ø4R…±Æùt€aONïÈÁ‹ÂŽÇ5‡8öÚƒ-ë`*jé1"Oýôé©T"w©Ä¾iÑ÷¥3ˆk,Ga Ô ‡‡î«‘Ê€0Õ“¤zÒ 2ìîš.ª+_” 3£ä¼(…“T4i_޺ÆÍ‚Î&G£¾qµär8¿öëX"|ÀÜ2}®n«:ë ± .ÓÑ;'Ñð+¾÷Jû%dG+¦óû * eÈéPÇò±AÁ( Â)›¤ñÜò¨/wwbw “i2Þš$^µ¸¾S LOŠ¡5Ò Ìû¾=µs ¥þ>aüÎ} ½ÿæBWªÃ”pè®òàê]¹éÊv»È®uÂ5<êÑ9`Ô®ÿ[:@ÃUôOôµ¬r^%|`ÂÌUp‰n|ˆdWÂù[ÒÖµ';”½g@»Ó9Àq‰ÒUž,q:r‰CÑí˜M§vìçŸVP”ªé0m7e— ãÈJÅñaä ˜Î86ºmì£S&XKl*ÿÂtå´P5xÝr:g² ãêà~Åeº²©È$ø2 »¢^µuMa?­aß8LõH'jU„úš.Òá ï)Ý`ýJÍ)‹óì.Þ¯Ä ”Á6…ãZýØUMÂâØ8RxUI EÓ€€Ðk3,rŽ¼¼•‰…¾WÔBm˜Î11"C7;ZÄô ŠãÕÕÂÚU1-vfß9ÎxÎDÐ!§S_T»ópªœàåþ¦ÜÛI5ij˜88Lë¬w©ˆÜÿe“»ÊRúJS®Vd¬fê\}õ×Ñi;”£`Ù ¼˜©çãNið¡DC2h `ìÒ€ÄQ”© S2Ǽ…J4“ž»ÐnÌA]Œ€dçZ]9l»Æ2#×Ükú)ý Äs÷íØ¥¹¨­Õ2*²!ó+K·ÖIXÍbWó¾å“€ßoëaêSiÐ6î¯SX^{úþRÛÆ›ªößN}cÞv@gÓ6EøïºÇW0ÿ gÜ€Ý ¸Œþ!k ®c÷Lô³ñ¤Ì£t-Æ®‹ž×Ñp(íULöt“Ì6\ÿi¿ endstream endobj 447 0 obj << /Length 2051 /Filter /FlateDecode >> stream xÚÍY[oë¸~ϯйˆyx'ÕZ`O¢h±Øû°g(2«Ç–¼–|²é¯ï IÙ¦¢8 ì^ž8âef87~¤hö˜Ñì/74¶¾»ùôÙêŒ1R(ų»eÆ„ FÛL+C¸PÙÝ"û)gD;›3Jiþö¬\7ûù>K›¤Ð\ãJšÍ™%°Ô/ùqå7ã*ÿ6c*w»Ù\¨"/±±yy }ëo²*ß¹uÙ×múÛ¸¦«7õºÜ…•íÃ?]Õ‡º }ÕΕ½[„Îå®Ý„î®Ú•}µò¼uÞ¯\d‡ú‡uƒÛðŠ{ÍŸVuµšÍ¹y݇v]wÒ…®Æ¹E$û6´.´ÝÖUõJ9ê„û®nY6Ár?±3@ Šxên“n¾»»ùå†A/ÍX&8Ì)DKˆÍªÍÍO?ÓlC ?…ÍžüÄMÆIa  ÖÙ7ß'„ÀÌ3ÒA`0ÉK QÕ"³¹¤Eþ]9X'ZÒª™I â4o׉þåvÑ<àO´öœsE„V©Ñ7íÂu¾-wåÆõn‡Þ«—Í" 't¦TyÛ¸0ècÆú§Ññc¿]»¸º]†>²@„ 4Þîûè vºg)ˆ:¸âÓ”Uˆ9ؤÝ÷ÈÆs^Ô×t¾XJ “ß­\ܱԄÛtÃÉ6µˆÛÔò„Mð†zášþW8ôð<¬ ªÂ@À¨óA%-¡àaM9±5—„•b„JæYé"È„­LÈÔ†@0_E¦ùÌ&2ûçíd(K¢äÁmÑØÂ×#0í¶íj,<à8­è‰ã4l D&ž;JH”áö/Ïš›¾Œ²Lò]^²ufhæ9™¡JOš›Ù‚S\EfÁ!qm*ÔÇñ”Á ÂcìÜÒÇ9/h(–ÐãsÎ_ ýŒiû20°„x6ž•%\]c¯<ÏÅ{ ,Œ!ŠÛ«µ”(fR¡X¹^šNZeŠsö _PæC@Cí—¢¡Ø™¡Š.}‰„.œôž~ªûU Ê8GÚÚÚÜ@úzkÄI–,®ôY‡óWÃBpu7•KFeÏ'“Äó Ž2–æ¢:"!XµðœŒ=ãj))Xq‘Py j™u3åhI˜Õ§…륹æàP‹nÕçJ‚2¥@.TaÊ/+ JÔÀ  °:Sƒ4¨ñ| ¡j°H„¶ûWRÄR›¤D x Û<BˆÃÎDzÃ÷19˜8&ãCr ëÁ‡ ßåÀ3f"Àk8yF è$e<†àùßÚª\#¾8IGò´s±Lê´L m‡Êðë„a¤Çô틘£À¸\wm ª¶é˺ ‰)xLs._­ÕP‡­x#ƒ€üUŠP}a2APsà·”³ØC*M›W© ÂaþHè·©@T€NØF{ÿ  giü½íñ”x–X¾E‘Eñx‰¶Y?*E†¸èáy`ãê] Œ&`È¢s=ÇÐ<ž\râH¸m< uþ§j×vÝÔiQOiCŒ:lú ebÂ2PNÍ!CÝvÚñ(‘éGƒ€À,Øwûr½~Œccð` hcÙÃȭݽX·ëü–eþ4±wƒ[1€ÖdÛûÙ`á"ÅóRFØ#Ø.#l—rÐǯŽÎSû¡h ¬E€¦¾{ß¹0ק"vÄ3~䛨"W4µ#|×±]Ô]Õîwå£[øà<< í8ô±R˜1,ž]¿©›j½_€N ‚èñŸ|½"«?Niu3îëoq~Åë$~þöð}Îm+t4vUý¯qP·žñ ÌéÉ·‡RõØà¶qnã÷}>FC÷uóÊS¿îO¤|x^îc[Q¯oåjzD¼šR“f„"|5e«v‹YNʯÎm§Wxú(•¦¡V7ûõú-yËsGy}ùÕ½GÞ¨ÀÍñµ¦(b®˜ ƒÏa†=°AÒy(0ðÏZþá¿ÊÐr8|.Ú?£‘Ž/R,Þ°}p'¬á5jt[ë/2gmÀ| ê ^âa— €ñ¡| +eøè%j$Ö Âµ½ŠX«áŠhR±!A_Êýàh®!Wq<ïU*×'ß;Þbú¢i‘Æóg<®ý¦XÞ‰IHm|.ÖØßë€^/q¸ íC:Ä ~¼+FÞx\‹»¶,Ó—=.Á-H2ÏJ3}6Vð Ì®!¢Îšb$5\ÇGñI)aŸ— •ñ»I…¾/N¢¿ŸVõ:úr9DF¯ÿ…"JŽ@çðê~Ð@ z z —ø¼ h z.¯—fà¶#ßnˆX5»ì‰ç3ÏJ«³á1ZW«! °8žŠýPŠC­!J`æÝÌú+%ç:¯V®úȧ•‹éehÆž›ƒaÔã=|w | _&ËÓQ|$?éß”ÛÀlèOd×}Ê>.:žT@Ã5SŽî»^·Û!tÜ!þr¹o*Š÷_‚¥x¶?´íˆîò¶0ÿ”?¸ñãüÏšhåøK0Ôƒ²ˆv¶K+DZh–-äˆÿ!xû˜ç§tºžçÝ/pÃ|·áØë°ù]ëùk€Y¿©hƒÿ{Mß6é®lÝÿ½¢þý.‰€Ëôû8 â$³l0k³¹€–Gg3›¬€ƒëß„è[ endstream endobj 454 0 obj << /Length 1354 /Filter /FlateDecode >> stream xÚµXKoã6¾ûWèÅ.b†oRØ¢‡Ý¢½õmwa(2m««‡£Ç¦ù÷Š´lÙ²½‰µ‡ÀÔü¾™á<Èà`àà ö¿¿-&C„(”T‹u@‰B\ð@ …(Áb|šš¼ÉfsAÅ4©Òå*É–õëÎ8‰‘‡Ù—Å_€8'…ÂïZ.íê¯Æì{«]û?·c:¸õ!ýŒùÐîœK§ÁœÂ~¢Ý~Øe''¿/&Ïè8 ‘aL LË Î&Ÿ¾à`“ b¡^Ú¥Y@Q¨C¥Á?“¿¼D¤BaØ"q¬§3íœ5ä ß(¤¡BŠê>kRSR .Ñj N JÉ>çªÈ¢$·¼¹>ZÍ8J\»,Þšøk5›3J¦/[SoMé>`dxúcZVµ“FåŒèé¦ÉLî%‰ßlž›(õ[ ·ÓC#]lQ$´ì‡R±žÍ)cne|Z™¸ÈWNx̉óébkiíÂx“ÒTn)´¿»¨¬“¸Ia«Çj·Þ3°ƒY§ÉãGî³2^ÞÐi6DV]&¤çr#ã{kìøă i=(”¥²ŸY´ó»,r'xcL÷G8˜GŒÃB+$û‹q…„…âáõDbŠ! kÆ Ui”mÝìÒZŽ’LŽA˱D’ò>íPs(ÂR³Q8)FRÑ>§K¨óü¥!Ð…'ùÛ¦# :fý¸<$µÜG$ 6É ªô·PÆýœumåÆP¹ñPàa(n@p-ð(ô$¨EB ¨¨ä®²&1@èJ@ópe-É8•B˜©QH5F˜Ê>é`%qIö¾xp—DœŠëYJ¢c¨mžÀŠÛ¾bŒ"®ô(¤L€ TŸ´hê!g…ˆA~z_åPpAÐÊîÒ a1Jp1-æâ;Æ1Ýù¤ Ä(ë“ÚÖ2à0YÞE—½I¹Ì´òJ&·u€B¡ü¤Å¶Û¦7×ЃìfzTQ­f.±€ÞÚö/&Õ 4C/è. vr}€îW'ÝF3hüN'éQ¸-É z_bp[—`ÎÖÊå-ž5ÙÓ[ˆãŽ+½E- Øž›É«¤ÈÝgÛŠíÀ5{–&ymÊÜÞTZy]6qÝ”~r¯†éÔh{p@8 9ï;õO{+¡»-H §SÛrjEMeÖMêÄöBdeqi¢Úø¥Oÿš¸®Ü„¿Ÿ€8=:N{­xc@ä/êVy ª"ó’•ýò°;Ü}Ša:#Û0™>'ˆâ¸ÈviRmÍÊIž^ÝŠÖš$ß8©;gçÆZð⤕öú·2ÆE»ìU] °»Ðü7 ´îÒ®¹pò å %âmxÌ'™µ0ªÀXŸK!RÐ’û×Õü4¾üAÀ°XŸÌe²Iºˆ;:Šî·ÿ=­iÎúo¦Ÿ’ ´†ºÿs¼ÓÞ#0Oñ|1=äûuüñʽÓë"]£a åYìpEw/ãvÏí^F9ñ]”’GW—Þí ÞiDkû ¤}’°·žXÿ“¨úH endstream endobj 356 0 obj << /Type /ObjStm /N 100 /First 873 /Length 1651 /Filter /FlateDecode >> stream xÚÕZËn7Ýë+¸l» Èûà0äQ§ZÀˆ³hkxá8B4[Ò¿ï¹#%Ðhä„žŒíH4Î!yx_¼sÇ,ä‚ca%â*Ž áªNÈ®Éib\³ËÁ®Å±kuµˆcŸH¨¤3Öâ"Gô$ôHH.ábOí¶*~\TÁ’˜6jQ4Й=šÑÈÖƒFÁRœª‹UxÆ£kÉŽstÌ2¡‘­‡EãšÉzÔSB#;c— X‡su¤ Â% ¡63v¬kaÛ”A‹É@1!ÈQ©˜§`Ñjâ)ÀÅ€áÿ£íĘp²@3ÕW mn®&ÅX16›8­ÿYÃ(Ú£j¤MÌ1LÙñl¹Ú@ÜIˆ6gȆÑËö#ÐUÈ΄-lÏÑašcŒ3"P±'ƒ£ÍÖDø($“M‹ñ“pBQ ej€<$f§1[CR1pu*6Ìóç<@‡&š™i&ã€é ºMZ`Yiµ]`‚°%!u)B¹Ø…KdKâ&™ñ 6š6{©.a33ÛPÒbq)UÃ`ž‚EGÁ˜bªd0o5âD†Ñ¡!.œÐA6ÚÍ, Œ­d12°Ñœ6s9‹-‚k÷D].&yL+lö]"¤"]![@Ž¥ vQ0bvt4›¿þçÃÂÍŸ.—«õl~zófÝÝÿònù÷lþluõvquàñ|þÓüçù󳈛p>›¿Z\®ÝYÌÁo|ÑG3heŸ±kò±TÀžº£#7?uó—«×+7á¾»¾ys±ïVKO^}üÞ=y2ÿéÈ0{2—©Tœ©24=ŠçõÁ¼ž ÜšÃÓs Õ[dƒ¯øPŒ[7i!#““…{ _)ûÐq+àÖ$ž ´cÞÁ!ùdq5·pIÓsÉìÅB,¯åˆààÖd½yB2°ÓlÇ:ÙñX¢$”°PÖƒl.ÿºø°^\ýà¥ìyáÎXmöWnþÛï¸nê„ø`…É-oÞ¿?ßbÝüùêýêêôÃÅåÂñfÈÉÅ“.mnü¸~yº¾X/ÜfÊÙüxµ\w\Ž)§ îØÎ8ÝÍMÁÁ??±A»,;?¹Z]ž.°g¬õâØÍ_/>®Ýy_Œ'.f ·\/–ëk ¯6Ü„u½º¹º\\w‰B×õëâí»‹g«®oÂÑ•+A^'W ‚Ü®pJ“p`¹Ã&¸‘6°T‚m7‚!38¥´Í¡‹6ÎábÝ„ÚïëxWû}»°˜³5ÇãˆyÏö.YÂ&ßd© #¥±†‘r»aô±Ÿ £Â0b#˜ØWd—M`ÁÑŠ@ÕFÚçmw÷¥ëµ})ì(~¬vsh7ËXífm×n»k®>ilSJ>·A#ÄŒöAsOw}þvu¨«Ä&uqIûê*Ô®®>v#VpF*SŠµÑð'ëðð+y´Xïpø•»~‡ÀxçööúئŠl™ZÁ…¼*šÀ1YŠ÷Ÿ:üÆÚBÕ-Tk UÚm¡ÝÚ\¬n«`XÁd¯o`¼È{âÜÆ[²/D`dãV2šÐpn·•~nÔ3°­^&K›$ ÌÈêBãÌÈjO­f´‡ýrH9 ¤M©¶Íñ3Ç{sü¾þzJÚÑóh%Õ¡’òh%•Ç}#Üy œâP”8È5¬F9R8‘B8·¹þh”¡ÚÞ}„Âו+®±ª•sËùDå •®¦Á+„sòÚÕòƒ߯ÕV¢—~¡§ÓQûËÙv{J ÊJß‚™“¯L÷¦ýÛ£HÏO&ˆô4ôŠw2’QÑ£úÉ•$¡<”‡Ž–Gú?Æ ŽCÔ±"àÐî–}ì6‘—èíKâÃB»éøŽŽ–äИXÇF`–i#°UŒ’}Ÿò¢ˆÀVšDAñÂÜ÷‹Êö±­]Õé@R_ØǥЃ`„e_kyŒrõ®‘ôÂq´ï¢\§ Î2 Î2:8K{Ádû©R]½L{æ=XDdè‰Òè‰R÷=Q”žHHz*VU>CVº(¸šÈýœybÝ÷D¹ƒ'Jj{㺷÷¢Û#ð¤2лÒX½ëFï²ýz6‘þ­f ¢$^íÏ (²¿“`ERÜ” Ç0Ý—F$q^ñý™ŽÀí-:ßï¤òã&†Í–ô/’ÎÔñ endstream endobj 458 0 obj << /Length 439 /Filter /FlateDecode >> stream xÚÍ—Mo‚0Çï~Š&»è*­R![vX2—ìÌm["àšñR£`ö퇂€""¶MÊiÈ•`Š ¶d¾s7t¬Ñ­BCßÔ<ظлD‰•nä1‹6¯MûýM%Èx>5ëß`Ø€ú [Ð4Í<>Þòfþõ~ endstream endobj 463 0 obj << /Length 1044 /Filter /FlateDecode >> stream xÚÅXßoÛ6~÷_A`/òP3äñ‡H¬ØCvX߆ù­- Ù–u²äYV‚þ÷;‰”-9²ì"Zò’©ãÝ}ïx—0rOùcÂüïóÉÝ' ÄR«A“ù†©T’hRŠÌ×äK°X$Eºø'ŽwÓ™T«]žd·üu—¾2Å›~›¾û$MËÞLJ 3à”pöæñt ƒ¬Ü.ã}%« ߸½u²³"ɳ­›ýÈ©Ý'Süù8å*ˆ3÷åðc·uUP좕ßÚF?œ°ôû8Z{.^ËÛø•¥*´ÈNéWÆE*CÑR£³ÙçÛNˆ-ïù¾:è –Ì8§VyZ£*~A¾ü¯•ÌƒÃC䥴´pŠIæ>EnÙøÁ²H²{·{xð{›–'¥“¡¦ŠË0^¥4ù8Ÿü;á¸Ë'P'$dÍÍj;ùò‘5~ûLÖ§ZsK€ZSœ’¿'õ¤ ¼ekS BçÓa}îUi*˜Å-Þ< ~Ç-&cÏõsEµå ïÜ ‰Ü_±vß|jJðyˆÂ2îaX1j¥$êX„ÊBÈ_˜@ S›bhª õÌ)0tŽâ­»NwÑ>êc“‰+è0|~]Ôr=LXȨ%öPPÍù-„<5ŠK ÔÛu‰@O6¢¢n½XŠåYê“m“ï°Ó¨®üê¡îãÓ0Êøp…3ŒD’ ’)ʤ¾O‰}C`Ã)¶Ñuš—‡>J å— uåÎ Õø’w^ô«,K¨óhˆfŽ¯5ÒŒõ.¸z bnñ¡Â§¨2ŹJÛ …Tc8Ž¥)d×i_¢Ù@ÑŠùÌEÖtº•£ÿÌ¥¶”ÛARºRv|3Ry©B„Ô„b§’a‘C×i”¦W›­Ãbgsß™õ7Uÿ9›Ò~I²UZ®c7ä½G^ïê.L~¯K€u[]‰CÛ}¯O#b­½@jª›í›!ýSϵìZ)6RƒÍ°SY1ŽŠ§ƒhsáZkµSIÇùóV2kì]—æ«ÈÇtâqâ­bh©al©y¤iñ¦0±žn¾ÁeT$«žBxTòø–(Ž€ð¨}¼'ˆ£;Å5NX׈—‰/3ì ‹ú/B;žxTò0˷ƹv7#t¹ƒ'®'*5 †â+&Ø•èNqÖKìgè?ž¸ž`'˜å[ã|ŒÒ›nËô,ðÄà6JÍE>¾)¾h³¹€¯Ó€Pm~öpPzÍr©É¼ÜQéX:½1êÿ)ÆÝÓµFóÿ­§×¥?cñ¢÷ ÑŸ3¼ÛFï:iyþ/-³¸ÁÜ´øg§q¦wNàpûÀþ4Ò endstream endobj 467 0 obj << /Length 1268 /Filter /FlateDecode >> stream xÚÅXKoã6¾ûWèÅ.b†o‰hÑCnÑ õm³0[¶ÕÕ+’œÀÿ¾Ã‡dÉ–7QvO¤)ò~ó Écoëaï÷ ví¯‹Éý'E=…”¤Ò[l¿ÉoœÀY £ÈÅÁ‚оÙâeÀ&•Hø£˜ÕõIî‹¥_œ«B"†G9[\(8¦'gK¿l¯Çˆ¹¢Ü«”’þU88ĺ8pB¦0âL¾‡‘1Î eþÕÀ!Š ¬Ø(fG8 }³CC±@„“1lR BUßf÷E>—DçÔo´3x܈ÂúQx=|ÿúm9¥ca„#NÈMºéØ#r«œƒêuÙ :ø{›dSòªl§{:ŠqÉ#~߸Ér΃…RÞ@ž%-»pFñôyFÄ4r—D"“'™t–aÕQY!3 Vp0{Æb§³‰§ñ:Êêøc óíP^Ú6”fhcÛº]–­ãäYÏñz¯SP*É2°rÅ<;YTáªJÃí<: Uô¬–Q¸¶ä†ö»óBº®×ÓÆ[˜°—BÆç·o辊³-X ˆ#"É5£÷ O7ûlU;:0„i[:z¬tíã¿Ñª®L“@Bb}d3ßâšÍáÐbTÍ6ÀæÜÑgȇ—®G¿Ý$§ed;i^Õ:Bt_E›½–#€8·cùcZ³²¡+û²ßétWL‹¼Š;,7Ù†@E»0§¡v’¡ÿÑ.†¹`XœþÖ ýÛPÔ“£ªÒ@a¢y”¬é5Œõ´Þ²,ʦg[í_Ÿ™` GÔ½B“—ºÊäwúx°-X´(—®[DeØøIÏÉÜ"ÛÐÉòÚÁD¶-J¸´qà&‡«2¯B½Ë«è V©g·J§d•KVmªU[’mãçèXK™ù®üj/ᨚ*+^ßPãÕá× €¦ÿ¦‚îÎvû)DíÝe^ýmÄMMi( ½²}u—yžœPXîªメröÕ!O½•ï+û¢Gæ-•íÿ‘ó&Žø»Ñ»°ú»á¿§›B²F>ÂþÉKùZ7NùÞ1ܹÚú/6ÔïAàÁË„h1J{+ WûB?c endstream endobj 471 0 obj << /Length 485 /Filter /FlateDecode >> stream xÚÍW]o‚0}÷W4Ù‹.R)H…lÙÃ’¹dϼm A`؈@,.Ù¿•ÂFq Êžz!ÜÓ{ν=Uø@Ï#™­æh¶4`@+˜-4ˆX[@EÕ€é‚×±eXÏ‹'’¦hc' iµ½+¢ÛìÛŽgù^b¹dk…öÖ{“5yòn¾€9‚ú\BÐÐÀ%ƒÌãiž.×3½p¿å9ÙfÉWÌÒ²hZ„û?ôÜâ)ŽhZºËK +Ê S9¶Ï `ï2äût³Y96+®šŠ+hùäÓã%V²*zUÞZ”©FÜfÍp<±7­àíU¶©˜f½âع¥Ôe+ÙÙ׫( YXk›¶ŠÑ2@CD ‹»ÏeùÁÓ?Òôÿȳ—)ÿ£7œ:ç¸ëœ·íe¢Ï2Å«ôZÌLløM³|!†xpçÏeØÙ$LÆ/Ö‰§v“‰ã0pþb˜{ ÕJOú ÷cÍ!W6%Nnü±aÀ«4Úy5ì©Ë­ÏÁrfyxœKƒ"ìû‚ϸÖ/öÆ€uZ¢–_±kµÙì8•Ý›†M;BLìM¿OÛYÖ4ôykŸ·¥!'®ôÐÙr®Wþté*Dº$Å€zºæ›)j-ãÉ}Q¢ø0 endstream endobj 475 0 obj << /Length 502 /Filter /FlateDecode >> stream xÚÍW[o‚0}÷W4Ù‹.R-B¶ìaɶdϼm ©€ØÈ-LöïW \ÔrÙPÃé%íéwÎwC8@o‘ÏúdñªÉ@ƒš"+@ßi "I@Ak(/Ð-ð15?Šg’ÑÔÜáï|vO"׈ìØpèÏ"žácÏþ‘8ûÒßÁJ‚êj I‚b0†‘^ÙÛv˜#0Ggóìªx|Ëö¯:Ÿ>ÿ„v¾“Îæù4ñ#âø¶•¯Â ¢¦H)`ɶPZG‰Ëì;â›nb1äGúØÂÃ!Ü=ñŒÊ©8ä`W¦ÑÓ5eè*S'5˜X|]”:XŒ÷\0:c»•àXz¦ ã=J¬‚€UªW«†šžÞ[ÝÝàˆ˜ëŽZY·DC ÂìØdä¯}iâÙ}â­&G_Éj^0V®d$œŽXlñÊõbq(±Ä'ß‹žÒL¯aÀɃ®¹ºV95¨ÆŽ;« JãË«fÇ v ‡ØxÚÞ»§mOii{‰ƒÞ©ëSìu¶@ÔÒO€½ÃE…š7÷õÿvÅîB\ê2¤wèrûfÓ/z&ʃ Oon¦_"—ðvû‡\¢§kÒÕü©Àèl|ŸÍt¬B¹7¼–TÀ^&É¥«I‹×•ZûS¥.¡¤ª@5¨Ò1{H^ÝxÑ'¿—uæ¡ endstream endobj 480 0 obj << /Length 444 /Filter /FlateDecode >> stream xÚÕ—]Oƒ0†ï÷+z¹™Á £Ä;gâ5wjÆšB4þ{«£ÅN6>t^qFv>Þ§p΂@p7‚üzãŽfKÇŽî`wLc¡[È-tsŽ€ëƒ‡1!4Ý’ÌÛ ™h\ü¢þÞ¾¢þ#DÆõäɽšeè¶5šaè’¼Cú&x'ïÄ[­¾"n4ȈO#R…eÌã!傤IäMKo(;,*—"Sö‘ð …5Ý›9KiÈ.1‰Se°–Xðq,Q¾Í¨¬D•¸þ×.Ø)£ärá¡&x9£1û!®#ºƒT¤òÿɳò>¨+…ç ÚARG$©qÁݸ4h,‚=Çñ¶Þ2ÈÚKEªÂåÞ«Vå¨ôÆãáJ:œR"V>]]/ÏŸg AÑÏ{Öý8Oiëø¤Jí·³àßh¿-tË»Ž8h˜gš*ÜÎâe6«Q½b´”ÖKÌÒŒ›kï•'K[eYõ.w¢ð}š0z³ƒÀh¿ÞÇ„ÿxÁëTÓ'€R®o­ž'EÒA6·Ã××liÙ§—=× ÛšéèöîZ&2‘äqëŽ>až endstream endobj 484 0 obj << /Length 771 /Filter /FlateDecode >> stream xÚÕWQo›0~ϯ°´—dj\ÛckÓ¤MZ'íaÒ´¼ub@T04@£þû˜4!5dÓž|`ßÝwßÝრ"èË„4ë§ÅäúF1¤°L Å1ê`ns$l3ËF‹ÝNýTçÅln3{꯽‘Þæ?‰MßÍî_ÑœS,¹…æ”be7Z®å±»ŠC£P=•:Jµ›mݤŒ‹Èõ–ËÆXm†´ ô+¸yX¸A”¸ÚKB€@jÕÓ ïþe–xW}(B]&{ýÊqñ”5+éʈ¥Î£•ó”¥yÛ˜›Iƒÿ9œ—™ì* cò$€¤Ì.Ád/3ý|Væ«øVGñ™0îÃ0ÛÃØãéªË€†ý…ÌžÆߤhõºµck¥eä¤ lßËCÃ;îâN•¾çOæn=ÛÁÊbÆÏ›Hûq4–߃³ë,ŸtšD^Œ×ú°õu÷Ã^뀺ƒ·Ãz·kþ!»àÇoôk2ß áÔ‡¯}ø âÄiâzgÛÿ™=w™ÆÁë(¬4†àiÙv9j_˜ËçûïüzìSi¨é‚(/\œâozN‰žÔŸÚC8e§^ÿ½×7\ ñs!±ÃYûjú–àÞ¢jZ¬½ÂhµFN°p¸ÞqZß{Ÿ“‡ …·QĈ g,D-Š9qŸLnï `0cKI´­&ˆa%H1ú1ùÞ÷£A$‚Õ¦@6NóÌó÷–9¥£¸µ$æm§0ƒô¸´9`i —ð+%ÙvZcOæÇD‰]6aQntn²æU‹„‰tnšL¦fÍÓ¤Ém½©«ö¯^á5'ŠM郵°¦)—˜Ñ®ÙÌ1É @ÂJ  ‡˼ô=m„TÇOfû×lN§ÍÑ2¯Š¸Úß®£8<2䧰•¥:ˆôª§ö£P±òÅg9г’Gü¢²!)±ŽeÕ¦˜mßqN$0¤öÐLh^Í  gÔž†x6çÄž~Œ ƒtª«f;hbaJš3…¥lÊ€‰Ö)ˆ÷7`e\ endstream endobj 488 0 obj << /Length 1145 /Filter /FlateDecode >> stream xÚÍWKÛ6¾ûWèE.Ö\‘) -rÐè©E}Ë-Q+¢z8’¼Æþû’-[~$p¶{âˆÎ|óÍpHyγã9Ÿgž?.gŸ‚ȉQÌs–™ƒ}…,r ñ©³L/n—ón¾ QäŠ9¡îËSW4¯j*t³m•t²®ŒÂ^µÞˆ†w¢µ_•Ñîvsì¹µ™lE×/7f¹WÆìt#¾meÓÛèm‡îºîr3Ç›9ŽÜçm)*°õuù'ĵÀÅÔbÏùœxò|áÌX¡å¥•6¼¹M‹æ 1w™ËÖ,ñ¢­T ^µ½ …DI23c]YSuväeŒPOåÜ xM§Pï=@œ!Væƒ,4† c.p 3W ‘¶v¹6«ã¸µ’v¦Å½ù~“ÝÅ«täÅìjÍ¢ò28™]ò.É@î_Ê1—Ú§Y ŸbrPkŒ ŸÅ`Eï–m¡tf,gßff=;€6#QÐMÊÙ—¯ž“Â"¸G~9;­Z:Å‘2V8ÿÌþ6•=òF0E¦Ú”ŸP€×ø PÄbÜãz˜@ v6ZbzØ4`»ä›„Mã+|Ç °à1¸£d|[©FqâÕW*¹‡WŸˆÄ·$9D¡G{2Tݾð¡N€ühÈôã„‚BÒ¯C;¥|߿ȹQ°rŸè£…ßÂy ŽÃ÷ðàô– Uœç'­{E ?j+ê¦ÁáqKƒ™TNd-á ™}ò°?…¢8 {ÑcqÔáûÉ£×räuõlf¹]U]ÐX|¼±°t§…X5o¸²2ó»\&¹ÞŠ½ mî¹maaìdQJ¨ÔØ…;PÏ‚q¾qLhQÝP£µãM' £L! ŽF3°>Ëýë@ù"¾5‚La¯|ò<¢ï,˜ÑW>Sé[XÏdfäfH%øk løT™è^72áEñ:Rð”Ç®Ô/ µX·²Œ$¼2´Žð[Z×6ÜzÝqY黾²¦.øÈꢨU¬;©+BMÙW¡gx`õãɉAQà;jãÈxÿEVI±MÁË¿C«xl7<(ÿ0uÙJU±JWZq•É*]k«õëJªúóV+µú¯›#]óù«–õM1@:ô!ªm¹ß¨,Cì^%=qÊ‹L­ ÿfXŸrr%UoJ´p’ÊÞضL'¹Ý‡u%E µ»º9©ê“ŒœuŠªc6¨¢}A`oMTx–¨^Ä&*¡]Ê(OTþw‘3²a”/SÙyûã0áÀµßQúáÁvSÓÝ­-Ot}—ÝD`ÿ[»; áb³»Ä;jtðú»% vcÕsÒ–-ß¼§ûjÍ[™œrþ€²ót0e¬‡P½Ÿ•á[:ЙÐ~~–îƒ_¿{¿#A:è`ÊBÙž$èõPžeö¼AÇ?c„"ÏÇ`)FQd3 G[àñ?ìdû endstream endobj 492 0 obj << /Length 443 /Filter /FlateDecode >> stream xÚÍ—]o‚0†ïýMv£‹V RK¶ìbÉ\²kî6Ó0Ù Jã¿HùreÑÉ”+’óžóô=ç(øxîiòùh÷Æ3K´°Ží45!F`s uö ^ûŒo#S7ûlÐ06Œ:¾O}Æ]ê²¾ï(sß4SÌí0AL 0BZ¦T 4 ýô<¡Ê^݆Îp¯ÕC=‡ePšn³^ö&= ³£*s¥ô¾:t·—©êSŠm{™VÎ)@ñuAcÎ"Þn¦¥‚ŽEWì=ÄäN襠ª%@r6^Å‘‹ˆ¯e!‹¥ó%•e~eýøèÌ)®8‚§ã©ìQ4âoÕº,ﱋztÒ i¶ Ÿ·D®dU‹ÍXUËýìBC6îÇ?yYU“Å¢K”-:úS³ ¾´±øôŸ¿36ªÂäðÿ].þÖåÏòô$!"YÂÆAìÊ÷IÖ±ˆ‚Bæpù *òpìWeD+ƒ_ÑËG»Øp5Ô(pÏ_ ÑÚïÐ&hÕd•j± :ᵚ»Ç¥Ëð/µƳ ©|ð"B’ë1 É¿÷tR‹x²{ß¹±0™ endstream endobj 496 0 obj << /Length 626 /Filter /FlateDecode >> stream xÚ½WM›0½çWXê…T‰c xA­z¨Ô­Ô3·¦BœÄZ­öß×`C `BÚSÌà™yïy<8¾/üýê.6¯¦ èL€»ºiÃb½@lXÀ ÁOÍ=Ò囦ÆBçl‹¦iVš -IÅ«Ø?ÑÚ´¦roJ…-;ûxoj'ÿ]w2lFón°”ú¡´,¹?6¯ŽÞÂÈí[˜3¨Ðm‘nˆ]&64‘Yï)2Dìü(!í“(J–ØÒþ”ïx°Æ„@ÖºKrßq³$Î`¹¥Q®þåÐp+©©CÛ4xnÂ2ÂQò¬Oö™eѦR¿TYQ7¡çñÞý–åSµ_<~lž=.›—çˆz,Ü" UÑ7!sÿm dµ^uÀáIãâtñ ÙÉËßÏÒ­\­Ä²/ kÀ%8ý“Pxž ã”>›sõ0Æré´K’è*‘wô³)Xß(=+Ÿ¥v>CÈÉ°ò—skˆ¦‰>Jä¢?rMÊõì‹bMº(o$¹\ý´;rLã¦Èì–˜tïgÜW[5‡ Pû*ã½éå-eû&ƒí;J_bšÐÄ[^-ZÖy ý6|”Í)UÕž>&ã)Hó òíüŒ^õW¡¯±)HG†¥»½ãËÕ0®§Î¹5&÷šU®¢ð¯†ó h•ÁLaOŸ¶<õõ¬ím"ýYj¯;yºyqÛ97á¡qwüRGÍ®©EÿØŒžwt\]>LÛ=þ¾n3³æïŽN¥ª¿3¦·>‚ºßØ‚ÈÐùç”mÛ °Óqùæ.þôM.œ endstream endobj 500 0 obj << /Length 470 /Filter /FlateDecode >> stream xÚÅWËn‚@Ýû“t£ ÏÒ¦‹&µI×ìÚf‚0E" 0éßy:yéŠ ñž{Î}ÍÈpà}ÆåÏW}¶ZkÐX è?@àV’%e…Dèøœ#ä„.Úa,Y秷GÙËcb}q2ÿ´øÖ?Jäâ ‰gUIŒÀ³¯d€Žoº±…3„çoå»}9a$~ ŸüX†çÑm爫è#tL”øäˆo'n(Š#ÇJ¨q)jÁ#…&„EÆîô&1—¯Üû±W¹YŽ‡¢ß :YËÌlŠáXo«L]•©ÿ Iñ¤ìÁ‚+¸TijÒµµjZ¥|s­ÞiÏì÷.m`Ù4B52m:òkÊkU•œ®MM*l_$µkÛû†‡‡6Cÿ7÷~˜oCskŠ½HÑØìEn2»«B²2ô]'ë±kWt¯Ò½¤ûU6ú…´; ?¤õØÝ5|~®¾7¨­÷†£áÖï —vHìFJ|Î3Q|xŒÖ ½ãn °¯ô¡çê8â»Ï[) ~àvëäiéÃkOâRÝ­7U3Âxõ;®G0ÚÆ/7Ñj-©gT‘åU0¢ÈªŠ˜…9ÂãMŸýiá] endstream endobj 505 0 obj << /Length 455 /Filter /FlateDecode >> stream xÚÍWAo‚0½û+šì¢Ë@ %[vX2—ìÌm[&)ÍþýªE°¬."$x¢6~ïûÞ{ôY ¼ ŒâùâÆsÇŽîئ Ü%€S¤ÛMuÓBÀõÁÇpGi6Ò‰†‹•·«{š†˜åaFñÖ q@2œåIHpä1òi cô徃 Ôg hê*à0Þ—® I’T€³íáÞKI”³ªÈ§ g? ;ûï ÷…%ÅãhÇQLŽgïŽF‹0÷ „':ö–K}õ¬j.æè–T#ðoŸÈÁ?á´‚úÈyk%_]¥ÀƒXªÀ©Õ/uªd94±Ï3É|˽v¬ëЬòÿØœìjÌÅF;Úh²»9Çù|*ÓO·[ Po0ﶜæ#Ù0Õ”ê‚.‡b–'5­ì›Ðê\DlHÇ!Ñî¢ýáoIH>þ×YyµI ^ånØ*Ú²¤[ ›EÙ9ÒR¼µ·¸«€ë)º.Àî$¼ºÑa_ôÇ¡"7ðÊK›X©º ö?U&Kl‚f¾ôÁæ¯Å[UwB5¢*ËÛüx>™þk1‘nXhŸ¢¸Ú[Pªxu¿ öÓH endstream endobj 509 0 obj << /Length 402 /Filter /FlateDecode >> stream xÚÍ—]Oƒ0†ïù½ÜÌ`|•A¼3q&^s§¦A)ŒŒÐøïå£ct†À†W çmŸóöÐ"ˆà‰éõÁäÖ[C†`h²LÈÒFP¡ 4¸dÓ/ ¤dÉC.¼ØG¶GPòáòI½ŠPº_¾™Ï€W%AWÀK’`@šŽPžæz_ø(âÙe|—ßDßÈräâ%iäãìm&)Ší‚{Œ££`©AE#kU$‹lÞHŽ<é= }fP’ú‰WLgŦ¯uN¿R:@«Pôqã5Ö“A[SLWÖ(kêJ”‚DóXÃ@²ævPmÖ¤T×;¥³úÄNàÖÌ„§­Ì> stream xÚ­WM£8½çW í…¬:n—?ÀÖ¬VÚ‘vVšÛjs›ELBºÑ`øèÖüû-Û$Bº; 'lS®WïU¹ Ô{ð¨÷Ï‚¶ÏëÅý'¡=>‡W…Íz…ÍLàç‘ æ·$Û¦Í$:þÛÕ½M4yüs¬6´Ø<$Oí3síÆN?Í7V¿Qì+•Ôú:â_:¬£WÚ1z€£ ½U”¼N*®o¡dR&„D¦Ð99ÃÑ TQq´îPÁÙ*gg8šJ“aínnËÍiO‡Öim ¹¡ãfžt9··%í´ç‚ãÄ7óäñ)Jo)É&­“Í“¹ÅÎ…y\›TžLJ§¸EûýÍÜpÏ7\›Îíìø¸©¼]ñ<Í-L‰«ç²xOPŽÙEhÝåW ^®çþP¼S¼±ìv—' 9t_¼+ÉîŒ_èÙ]žÞBzî›ëz¯å}ÄÝØYß0ý@Àšb’ìÃ,^£s¹a–´ á›nu> {ÿ.ŠÛß´ÓD©ö7‡óÞüÃúÆÄw endstream endobj 522 0 obj << /Length 1061 /Filter /FlateDecode >> stream xÚ­VKÛ6¾ï¯ЋÄ´(Q¢E´È)z«oMaÐ2íU#KZ=⤿¾CiIk9^Ç>q4šù8ßÌpHÏÙ9žóáÁ;³þ¶|X5^Õ²‘íªkdýÉ =íÄ(IX0µm+>_Ú¶:lBÜä¯J¤²™Íý$pSQ °–¸²iå†ÌæÌKÜæg%ê6K»\Ô3æ¹oAÉ©Û>—M¹™¶ôÝr‹: F¡¬qv2?kQìÌoÀÑ£ŒpÆÆIRØ,vk™‹R£¾"CÔš(ŒòA•õvÇÝåSÖ QU—‘­¬RäMi±ó0tz9¤×g!ñ¢ZAv¨g4tEUeÅn¢AB<[ãc&ÞmW¤*¸‰C¥á˜ù3ÅÝl%X;] î¦à×ÖV¡…(6ÖôôgÓ¥O(ÓÃ=·9ö·}ÁM_pغ³ˆ™ù¥j9q¾µÉ€…ÔVºGÃ7vñ ¯ Î "›™¯¹ƒ6H¨5 „¾U ôLGòx_µ«À|žß—„°¯Ú7B<Ì/ìÿ;Ùd8, ô¬Qn (8„/B Ï„˜Ä$¦ôRˆþ(Ę`1ø2>ŽÀþÀ3gF ªÈ»i-…n¥ÜÖå¥8Ö(6÷®ÑÙV¢N‚Bè»Xë7²Iëlm!³b‚¡Ï’Äü:Š2 (øzáx«ÒLÔ:‚]âëj‰\<&‘ƒ9ôõP…aš„‰:£$´CUÙóÙœzÐ’–©ºSUMMºO7S‡&!‘ñ~Ö~âæÆDhõ@‚&”,Z˜þù7TˆÓCÖªƒíÇî².Q§g¬û²6VR©¯œüÜs'àû“çùz"€æË .QgbˆLv_@4ï9Ûx°¥õjÊÎöúú_`æ‡ kë¶nárÐQÀ—é3%¶v;¸ÿòRŽÿŽ­§=y¬¾x©ÚÛwx1NØnb P¤sÏòèG¼d¯yL¿ÃáSH=Œ¾7 O¦Üñ¶ÕÓK߶J'ž8‡àÐbbÌ',2Ä6²y¿|øŽCiÍ endstream endobj 530 0 obj << /Length 935 /Filter /FlateDecode >> stream xÚÅW[OÛ0~ﯰ´—f¢Æ·8Ž6íaLš&¤¾ªÒÄ…ˆ\J’Âø÷;©“P·éQ¶§žÛç|þ|n%èô}@¶ü~NÏ}†|ìK&Ñx†¨çbI)’®‡wÑ8BWÃq&‹H;#—¹ÃÏq™œ&y$“r„ß}qnÆ?ÀàˆRì»Í¡ÉöMnãÇæXýµrÊ(?®i'³"OxM\²´+(V‚÷¯‚ûã«f[ ôSmâô\¨•;Ž¤Âž`hÄæÜ7ÇwÚ¡îðÙ1— à 3ÂT›ß8+ç:¬ttb¾Ó<Š¯ a"Ì籎Œd0+t«[”qvkÄê®1:Ë“$wïS·6[daçY‰kà¶öZLbåûæ"â oUÓ7Íó¤÷¥€êÉ<(‚´<àIïzï¤ì^úÌì…Rꪇ<*Ž¾ðݸ·º:8nß\0›í€ÅGvÒ,g•æùV¬ò-uÒéùß1™-’äuUJ¿¾>íD·«D5™}‘Wº- AeYÕ€û˜¹Ý&Ò²„œ Z‚(bDÀó1…éàꆠ¡(`î+ô´Üš"†}僔 ËÁ¯žNÁtŸƒ)÷oî½¼c[.À;Š[îa©íÖºéVrì)z·RbOú¶[H¬§Šc⪣8ULx¶SÈ䞀¡ SÅÚ·ïÚWž%Ïv#[”mGÊ›=æÍ–â’DzYž5:]™fîºØ¥žßcG‘á“CáÄN{-5ÌSh+v|eÏk›÷Þ¦¡Ar”zBO¶;ûO³×$üφHÅ_ˆÙ©„!²V:¨–<ÂG=@)‡9£0bÒgIt3 ¨ÍLRŸoóé2,â)X7 °1mwìÌÜGZs$ÁLtñø§çÆ`IÑvÅSù2=m3Oì3È,ƒ6Û”D03T ,¼:‚Œ¸be?qF”2üV8T Ôn,»ÐOF¸„lXò~ë$0Œm–ä:L–Ê*É;S÷.(×&ÁvV,š´)V•yÚ¤SY¢ ˆ^²v gÑâ´GË5žG3¢ìôº&Ô[;cÝ$Þõ³t^=ïqHª·yÊ`aÛljiPÆa=®´ëN7Ñ5 FÆCÿM>’ i0ßÀº]¸Ü÷Åe3µ‡£wÆb³³‡—w~¯E‘¹ÆN§û 6Sî踶e¹ åRÕÊÇJ5»Ö „þLJqþ endstream endobj 534 0 obj << /Length 861 /Filter /FlateDecode >> stream xÚÅWMsÚ0½ó+t„NQôlkzëLÓi¦—Né)É0ƈÄS#S[&É¿ïê‚JÍÉëÕj÷éiõ,tƒúÚ#áùyÜ;;%Hb±爊G±@‘ˆ1ãgè²> ¢_VƒëñÅÙ¹dÛá&4\..¯ Óû2îýéQðD•Ë„ºŒ#Ș-z—×Í`ðÌe‚î\è1”`ègï‡×®&9–q[£óR?­ÊÁ1;FQÆ8Ž‰lW­•ñltÈѤk6êÁqÖOõìâÃI,wÇâ‹(9ÊŠ…ø7æ8I0'Ñ1ÊrJ1“fZ¤ËýÔ}´Ü‰¾¹UžÄz™fÁ̯¥.¼ÕÔjf-Ú7å:\eù< Û$P i+£ Š¥p–i•.”QUë£qvm/e&ç0ž,L½"4îÌi­ÉO Kú¥óý•=JPÌ.FÛGµ·l›8£REj`gêVêÇ-†G'#€= ì¹B“ tÓä&_A íÛ4­ólb›Ö¹>´|h„•…tEqL­³:ž¢í´&ý½•6ìŠKélÈ@?y²[9Ä>h¶)ºÐÀ·š8-´6_û™:1œ6GûÙ9ñÆ9ùèp´ñ½ž©nZ8ÜæÕèÚ”m|oE÷˜¶sƒ®sü‡ ÇQ…ÃNçØ)Úˆ­Oþˆ‡“®Ç“ïüX¦j2£ÂøôÁ˜uŽy£³ÍøÒLK«.^b69Lšë0^Þ›k£lЪüÈÊJSZ ¤MC£¬s.ûw·yy9¡½-ë`¶`Z‡…écBÄL7®ŠÒÖ»ó¯^ÇC&Ö¾èRµG9lfK=ŸCV`ñAº)°$üµÂ©Ów–„ÝâùàE‡è»3öTDOé勨•íÖ;è&ñm¦´ÉÍé¯ /µUê¿ËWçéþí†óª½Û)äÛ:üëf1u2 v9÷Ï\/Ó¹Ö•Ù8gùBé:·‹î×*‰±5×Wb‡ö)8ÿk£Moh¥f!©» Ãs€š5âﺌE˜ö†Ûîw§Ü÷yVÞTéò6Ï ÕLU7*=¤ u?)ÌÛš„êxýé©#ziàï%°qœÃïeµfÀÏÞ_°zNV endstream endobj 539 0 obj << /Length 1615 /Filter /FlateDecode >> stream xÚÕYKÛ6¾ûWèè b†ïzj¦@nEö–†bË^#^i#ÉIúï;CR²ä•íZIÓ“ùÒ|CÎë#M“mB“¿f4þþq;{õÚñħ¹Nn7 §”(f­ áB%·ëäÝ|¹ÜUûåv÷%»Y(®æØ»OBçEì-÷Ù·å¶~O½ùpû&‘ŒX)’cÄ©ž :ýÔT=¤«Ø}Qeuèƒö›³8/g”BÙ/¦Ð¾^nveuæœôHµ°ý2tyµÛæÙ:ôòéÍ.)ª~E·õÿEÑì'™þÕki;1½°‚h«“§D:pnï@¢|þžRJa‡Í7Å¡ ÛC¾ªwE^….(tÃè<~“†ÕQ/¿¼(›)¯À`FE%¤ A5 %“ÄqÖ¬IóuWfõ¡Ì^™íÓ®NwiZÙ SóoeVUÁPÌZ"¹ê[*®×ZYhdûì>Ëë*ôvùÉôº¸O›Á´Œƒû€¶[Û2}¸Û­ÒýþŸfªŠ¢Ÿ¦W)‰¡¢Ù%Íþ¼}žáÞiÂÀ+ÑZ'Ò "MV÷³wh²†É7 %ÂÙä«_zŸp⬃Ö>y;û{ ›KΉ†í£(n\Eç| *,qRN ní„胂ÿ€*K8ç“€jFÀ{ú˜ƒn1 [7Ãy\F0Àpºï2Ñ ŒÏ½Ãoöùî±)ÎÙ*§Ô¹àDâYF×lŠ4x:÷¢—LÌ#†±I@¸qrÐÀÜP/i HÈ!Î<iá…àv¾-³´Î¢ÏO ”¹h<k¬•SlJHM¬#Œ'4(¦ù$ ZÃGXOXôÒI¬',z©íƒnÇÅg?þzF ƒ"¥c.€¸2Ù/ªgŒ-ˆª{ÉÖÌ@†²3Ú¥¯ÊP ¶Î—$@ÒyS3gˆRn LÏæáx{ Ã‘ÊÀ…™ê—…ft{6ROLMÖi¬¹TÆB C: =_’ýÂ,¬+Ó|›‘›…42˜Ý§žÕ@+²XØe5( a5Þu #òc¯ Ó‘®e:Ð LGÚfÊs=lÊ–²øö‘²À7‘‚ÀD—²øãTجn¨ÙÐÈ#Ú"“®…íá®wp|•×#D dSÉNø+"àC‰jézúƒƒgè® Õ’‹³Ù•aS—CNaXФîb®K¯Œ0¬x ¸Æ¥ôŠE{H ë±âu!‡³«ÑDcA›ÔDÆØ­0%hñ˜À´ “}L½ðEŽç´$s¡[>•£çtS9p:æú>z}& 7åSdr·1&“_Ùfò.èåL>h“Éû C|–J4&ˆð”¨‹yѯø#¿¢G–Àáb|Žêaür.b†èxWîKÀå[39Âk„ÐÄQ1 ¨ÂÈ÷½F(8ÊiÂC(GØIxl‡’\8·“@B9㧘ã&¸IÝ¥ç;aPöÒ’K:9u^âp;“fŠ¼’0UŒÈK×c¶y© z9/MÚä¥.èöR^š³ÉK]Ì'¹˜¢‘Ù†Vç9ž <èÅ3PÌÙÅó‚w§H‘$‡÷1c@C|ì°0ù=·ý2Šý„\ÿÊÜÑ ºO~o¿lô B†•5\0$ïŸÞÛ ¯hÜ°pâ†w/@8î]ÇÑeüÀc—Áat\vȽ_àP…óF8;=—¯7ì¿õ¯ý‰ÿ´c£¼HMãEú{:ö}©û¡5ÞÓGœãsNð(ðy8âèžshGO?ÿöÁ¥Æä ªÊš“PkJ¬þ˜Å Ý£ðA‘û›½_~•P˜ÛmÂH}„|8Ôa® ZõGŒ O¤`î˜ëýGÕ@HFgý”¥š:V„_ØE6Åíø.Ô-yá…"]Õ^}(òXý;ÎÏ(­w>Ùú§¾~˜´8´îùL½Žb]çìœbÿJÀ­ÂgÂf#i¦÷¶Fge endstream endobj 543 0 obj << /Length 886 /Filter /FlateDecode >> stream xÚ½XK›0¾ï¯@êVæP«Zu+õÒCsëVÈ!&ë.Ê#mþ}ÇÎû±Ù“í±=óÍ7f„¥-4KûzgÉñÓônüèZh†>òµi¢Ùn`Nl¤ùÞÄDŽ§MçÚOý©+c„> stream xÚÕVßo›0~ï_úD¦@ÁÖuÒ&­“ö²—¼urŒ“y#8§?4íŸíƒ d­–¥Ú“ïÎöwçûÎöyÖÒò¬g^5¾Ÿ]\ÇÈŠÝ8B‘5[XÈŸ¸8ÄVN\„Ö,µnì$áe–Hòœ…¶Öæ¤ä4Y‘5˜^Í•8ÝÎ>)`Ç÷Ý8<°™Š¼”Ṭv7†/^è_ûî}hK~·JÉj°Ž-!ištà=ƒ> ÞwÎ|®ÄyÎhøœM²+íoÏÖ¾y]ÚŽ@Xxl¦.®ñ´uUœhêN0²ä¹€}=òC[#'ð"›iå¬Ö+ òl)`†ŒH¦å‰MÀdâ6s"—Ê/Ï— Ë¯¬†SÝiL–ƒEEg|,YQ‚eÎä=ƒé‰í{`$y FUb4ùØ1îæç~ä{¶Ødj ={S2L ZXˆ,:˜{¤6Q‘2WCnß–zÜy`jÛI3´­ e5qZ¾ì£N¯Ì%ÝõY9¸xŸ×îÒ¨YÚwÓ/{¤w›øØÝŠåªUˆÚ ­ÒEu!Sù0†^5¢æÊì„4ßFrÕó%›\]£¢d¶ñFÅúQ[Œ¦¡÷á«ädåx+±É¢«¤FiàþŠOºÝÐÉHØ É¸|¬Ãoû®‘•OpЋNl±à”3­s“ÿq³8å«Ä¼>œùó‡ùŸÄÿþ+9oÐéQ¹âùiØR*ÙKã{§­ÿ¿c2Ô¬côò×.:MÖƒ'¹Yâ£2›]ÃwÛìPäNã¸Kûçb„={ ß)É$+r"yóåg£(´ÇOùcûàþpϬtÕ¼¤Õ!‹í¿6Ô¤ÿ¼á·óöÀKYý?z;éÌòŽgTMš¦5ý¶š×=Nßü›«v%ÿ:V÷NuI8°Í‰A„îL ¦·ÃØ.X¦è9X)©’•¢Ú̪)Sœ*Y 8ÀÐiyEdÁ)+AKYI >‡&Péº÷lتǀëͦzòt§cÛ>jM·M³üHUËD!¢ØN§€ÄEfg¿e0ÿ endstream endobj 552 0 obj << /Length 1295 /Filter /FlateDecode >> stream xÚíXK“Ú8¾ó+|„Ô èý¨=íV%©ÚÛV¸%)JbÆ Žmf²ÿ~[–`0Àó8ìɲ¬îþô©õ¹%œ<$8ù0À'žMoßšd$•Éd‘%$$‘B!ÊD2™'Ÿ†ÓiZ.§é“CÿvoËt6-]ºÞ4ú¦‹bMgëUY6]UÓÌVE:såg,ðèËä9KÆ„ #a*ûu/L™ÛY|}S·ïjs|ÞBF;÷í.´º‡¥+?°Å»[m²ƒyšM«óèbF^oB#œÎA¬éW^à—»äÚl|šß¶eÌl~´ŒÐ÷ÿ2þ’e¼Ä¯Ø­õÛ÷\ïmà±ÔHqšŒ)Ä#*Ä›<º0´¹×50‡1ļ› ¾ ôâ„ÀcX"0G˜$³lðé Næð 愘ÑÉs=2K(2Ú@k™|üÓ&,Z"ÁxbHƒÀÔ1aRÇ1)¦HÓBR,Ʀ²æð˜6ÊQdË…-FD6™[UåhÌ°¦«y:³• oÕcl¬‹¹+¶#Âóù1=ú¦‚ùEÚÉ>’#º õÖ‚Gµã ÀœÑzžO#H[¤ã°ó©”ˆÓLd{¿t`F ÚZÙðÈ]‘m*[¥ëègð‡aÝiÇaå$¬-7a˜Ã IÀ±FRipRµÝ­yÇ)+ÙKPªjîAgeÕ²ÐfjvÙp×BGÀÝtAFq¦{A.ô—ÐÒ H?t6(|@Wn ›µíTHoA»3eÖ¦©¹íú&0€‡éjŒn“7ÁæÀ„6¬iƒºêö€Š"Fù~@_Œµ$˜BBó²Á>nùHD•éÌ1J)âJÞœR aÏ2E¡¶P‚õóúØøt–©Å:Š$Ðz(‚­Â3#¢“DXydz˜c~îæ,‡ ´–bÝC@¡á§ÒHï9£·É3Ô¿ÐF!éa‰øù÷!ö‘iŠÀõ*v‰ìC]cz€ ƒVç³É+>éca¼ÞÑà *‘–d ¤[ê%‹ü Úé–z( 罈=ü, —È}A·‚¿t½iÝ„L“³’¯_*Ì’Ï t"}€§ïòÂ(W°ž}Ää^lõaЧ³„ÕÊOnYW³% ¥5uãX5“íOKØЉ냳¥ÃÚtoV`ïÏjáµ¾/ñðîB„Þ™ »,×a€¯±ëOõ)|3«Ü"ˆ0ÅZç®Z„etžÅeè%1~ ¬«¶ÐõÈö·¹›Ù^7ÓoîsÁù•û}ßx»¬¹½B;³í§€ë`®.Z îúÐðz%Ð}ãbÓ ÐÆÿý°¤¤aFà„‡4Å‚SŽ&Pùþà • endstream endobj 556 0 obj << /Length 1801 /Filter /FlateDecode >> stream xÚµXIsã6¾ûWðH¥Z®¨9eª’©žK*Ï)RAd1¡H5AÚéùõó¸šNÇÝÎEÄú–ï­üëŽûï?ïï¾ýAÉ@1•Ê4¸?"KX*D&“QÜŸ‚_ÂÒV‡¾.›úpշùm®~z{:\ûª+ú|þÀ¾ûõþßA,XGÁ^¦Oáp@þÝìö‰Lfç$hï›þvÕ@MüÑۿLï¡||F$ôdÜm¾¼·¡ q…ùMž“ð"\ûۤɷ?Äù é}š³,–Á^u‘õû‹¡£K£ä 캸3§æªËÝ}÷ñNÀD TÎò4 ’‹,ÌIX7 tU5;¨:O”èŒNøÆðhŽIh*!3c¶Ð•Ï BÅ ÈR`§SÚË„OIÆ.™%C’†%i;qæ›ö¢)å~Ž ™Õ o¥ƒ:”ÖïnåK™ –ñøó 3R‹Œ äLe°2YFxÊgÒ•d BaŇš– 5Y°œz·œóð}mo¦ð… èýl:¯¸®½²ÿñÊnÈ„íHÎROù¿¶£}Ú¥Iøn·â„@‰dBjid/M_pœ‘­qñ¢w’‡˜þý46~ @FúØôþøHV°$bX¨ºì‚à&ZfqÚša •Ûh§ ãY\æ2<¢@ÈOf“Ì2ƒ ¸}¢ }»UŸhHö‡úˆbþjs3­‡ÏÍ}‰«@N3R\Q87ƒë“]PSì·$î|Œ¥ , M‘0Ú@*^|á/!Üîbî,P¢œŠûzŸ+Š.ÅçMÌ\ìÁnIþâÀnõT:òåÉ™7‹Æl¸z$$“R½¢7(Jôo_´%gqª–83óÁ×`0sDл¿`8ãžEgÇð„”7·…ßöXy‚ }OþkOî}=r´Om ºN$”ƒÉ;H#—ɬ'q4[F„à8÷èÅIDLỈˆçMI* †Åª+YçWÅ Z86×[ߢ®kú”…VZƒí@®=N°æFÙ.f~ ºB8W:wsË{ óœË¡Ë‚& Yjûˆë¶ÔÇÊPÞßoÃw¥ìðn™¿,¶^Lßþ¡âg¯ôáT>ÚW?ƒ&r0zé—¾,Îôtó³¯g"£/~O.1×¾N´5éþO{Å‹wùº} 'Òýÿö’uA¯bFfÏcO ÆAmü%ŸÛ7C÷¡ãVaBwµ'™Í‘y€LN-O e>^¢0ddëkO’úV%ZX€QKÃ;¬IÞx‡ˆp«¬‹ª?ùN’§n«r¸½¥\Yi5c³,f>ˆ|Fp™ò;Ä1Jh;²Q:áí¨Ž‡–ìayÅ>ZjIgsnZ?½8Œá¤¦9øÍÇ~3i©ªw%0 Ÿ.¦¦ÎÁWÅh:aiÃÁŸGÃ9Â?ž¬ »®ñÁ½ßkªJ5–ž‡ïÏï¨Äžû)\Az·"&ÞV_=Âf¿ýï‘Œšž(,™a~¸‚Ôy^ IwY4+ÙÀiÖÚ ‘­cà2uS®G¢Óó>hCÚI¥¦= ¸•t£‹Ë (ŸJû[_ÝÊ š¦.iQZ‡ÄðnloÖ&¥6ÖÝ”€q.çQ+“:F[ ÛðLX7y¸„bRC÷·VE]•õßX“×ÔÄÏ “¾¶"þi6÷ÒïªÎ´5xåÔÏÞ-C§#73K$×éWVŒw ×eIz°âBk® Ò#†þboýqßsÑ7ö™ÝCñ¢Û¼£ùÓ¥tÁð©é£±N2´móGyþ‚|•Ûe/[ÚýŹr¾qí€P<š/3ûšòqîŠ3±—OŠˆ‰<‡'‡—0ÑŽÅâÂ÷÷wÿÐñ|7 endstream endobj 560 0 obj << /Length 725 /Filter /FlateDecode >> stream xÚÕV[“š0~÷WäQwV¦oévÚgÞº&hÔŒ‚Øý÷=¹°•UÛN_ÌÉ!9çó;·Øhlôudëõs0K }+²fíTZkðR¡µù'™°MŒsÇ™•PVYMÙ¶ùÇ­ë<ñ±aû¼½¾’êu§ ©÷Ò‚´–!Ž­hÉÁ¸”Í/슂ëv‘ó´u ò>´™-ìÿ íl×DËÐ&ª!ÿ‚+;õ­ ûï2𮵔ü±´gÐì–w€Ù{î™Ñ7ô¸&ËnBuÅ»@‡=ž„0õ<ƒ™Œ«f¦¶3_ÏIœeÍÕg€‚Τ÷ZCõÄjÙ³·±))ì\zÔ§`8¡n`…Qd>pdp*\µ¤H—2ð0ê ^l²K-}KȮNJ&xjš„Ÿ‡•¬B!íŠuA—­£R\ïuÖsîLyœâF¤_ÃJœKi×ÇM›|ûSãîÃÜôõË‹Üç¹òLŽ›Ô†Þœ6‰ßPË"7ª9>@};²ÂP°çg¾Ä£ßžÝïÊ endstream endobj 565 0 obj << /Length 1035 /Filter /FlateDecode >> stream xÚµWK“£6¾Ï¯ *¼e3$•T©Ê¦&gß²)J`a“ñˆ ³É¿¤`aü˜ÝÉÅ’¥VýøÔjBoï…Þoá…ñ—íÃãç<òò O¢ÄÛÖJI ä%$ ¢˜xÛ÷‡ßp¹Úˆø8=oZ^& óû%$aQègÆ^Ä`éS²èÇÕŸÛßø¡ '—^èka~¯(dàñ3ÎN¼ÚDIå¹(Êt»ÊB¿]m"úl…ˆÿìh%aALŒzÒv0D=i8Œ†}³Rf¼iEÌîˆWZY5u×¾8âÆüµ ¦>KÏ,7Ž)8‘Ù7olŠÌt7_ ²fQáØf#9Õy;ë¥TÂaIŸO ‚8˜ƒf>aã@.;5%ÚåÈà”eʹSä–S.…>À©9ù’,Hqt™|d•–(­&°ÈŽ3N–T4ÕHOqÆO±HÐ%&­#&’J‡~EÝvŒV‡ÂXz­LLŒ µ”=E+ûTsðI¯›Øj/¯ªk›ÝDìN+^_¦ç‚ô™“KÒ´ut¥ÌMìÉùš´—WÕL€îº†äIèWŠ÷%­žõ?ä×=¯¤º­ Æae–IJ_Íùš/ ¡8 DÄ¡í;@é˜ì;!,55Œ¢¯*&DÝa›r{fƒ`a¤FÖuæj©­¶ªúN«MŒ‘ÿÄ!T¥ÊÒY¬ÆK}¤RW¾¢‚­ÝËjÀˆSµá_»©NÛý\¯ðõ¬hÐò¤´ØGÉÕÖ‹¯ÍPiƨím`ÌG8È1vR|‹ÃdŒh¦~É`·’í`*Š˜ç‰Ëq€QˆZUúŠÁlLŽÌõÕ–[Á¶ž¬Ûã±Õ]Ë׆ïÁóˆ!&n›ÑäKFÁ=/ÆPÞײèäEU«bˆÒíÊìq>}V¾»ÛÐû{®4 Nÿ†zHbŸ÷/%\vl2©×ÆF@lŸ} Ï~<<ûX1‚ÛSVc[®6È—´áú¢š•F[4ð hlAñ½¶ ±… ´P,ÆÆÙZCTÁ*'#l«ü^nÙhýÐðêØïläR¡Tþ‡Ÿo~uÀÍûú•1‘g¦j¨v©pÜc|½¯MøæÏ èø–Tª¨¶[:4ŸµÓjº êÿÐu.Äs²É†õDŸ[‘u‹Uy'Š@¡9Ž#¿nþÎ endstream endobj 570 0 obj << /Length 1110 /Filter /FlateDecode >> stream xÚÍWÝ£6ß¿©/ä”°˜oÔªR+õªísúÔ«CLb-‹9 ÙÛÿ¾3Œ!!asé)Wõ%ÏÏóáùãZ;˵~pß]?<~L=+uÒÈ‹¬ua±8t"Ƭ(ŒÏ­õÖúË–U»X…^hK]f®ežiÑfU–«J· ‡ïŸÜÐ]ü½þà ˜“¾µbÌIC£Ÿe¨ø,D=CK6 û±GYÍÁ šnù¬-…jÏ÷÷¶hÙ#¸×ìÀs>ÚŽ"!·üY‘Fè|yiYDà%·fW§Eƒ°Ë÷C2³ûZ/óøÂë{ä`†¨øyD[î–Ç©EÓ(njðÇ, QÕ4}•xYP2Q™áµCûcß^÷‰rÁÖcþ/“GŽŽÏgR“8^Ć ¨¡EÕjÂ’D¹2D|îx)Û7ZU“¯¦jü…¶±õOml¥Û …*Kµ€Ûú*«¥,  ©ÅÓê¯ÝÊ‹@[áˆ,àzxpMu- ¯{a’;8­–ÎOÝë·à3“ýзŸ úT)è/ ÁmkIi Ò{>×Îâ[.:ûY®†‚?­Îž+•šåà‚l8ä_ð%kœ’ùíôñ„Q ]À¤‘—Z‘T+­å¦4kͪڴp†ÙKC)µQG[ jѨ—‰Nß?Hì›H¯ÝЈ¯ƒÂíEN’¦Æ›˜¼ùAVyÙm »þz<ÚâìžëPÝ<ÌrrFÞõ!~ïrì¬;x%éþÍþ^.à#ï~.¼óî¼åV9ö”ã{§ëû ª÷s'ó­ÝãÃ%ŽÌ‹‚@zþFCKX}#5(3˜#ñˆ-m< {ñFr¸âš–ö|á¹#Á£ZÏŠ#j]Ê\¶CƒrÒà¬?ÌÂÑ`$"hÈ=Ï㵦ž€ÇO‹&禜6b(ˆJÖ´³ao§‘d© ´ÓÖƒåkºv4©4q’8šÃ—™èƒ‰7l`Nà°Ô!½$éëjR+£3¹¦[±4î›Ñ'—Eó ËmÊ¥Ib`öxÈ\„JVºùõ@M:Õ4v7ÑúŠù Ù”h¾Æë¥z ìèªí|õDßDí³•DÕ½µ·ò%kßjÃ(-Iì*-wýýðû ÿ ®¹ØÕõuÃÿ½‹s¼yàåüã~$F`Ü58}ro¦of/t\ïMê$‰!¶ ˜¨ü¶~øßÿô endstream endobj 575 0 obj << /Length 1888 /Filter /FlateDecode >> stream xÚÝYK“Û6 ¾ï¯ÐÑÓ[gšÎôÐI§¾%lË»šØ–#É›¤¿¾ AË–,{½»:´=‰‚@AàE“‡„&¿ÝÑøüez÷î½ã‰#NsLW g†H%­ áB%Óeòq4›åÕzö%Ëvã‰âjäßŶªË4ßÖHûéHøDûyüyú{2‘ŒX)’ cÄ©–´‡ü);J{J×QL[öì!«á5[­òEžÁ;0‚x¤_~³©÷AmËȶûÍqö2ßÌê»h¬ÝÇy»¢j–üî½´'îœhKŒä ß!5ÊŸ>‚0æè(35ú¾[ÃÚj¤”Ù®Ì*XhZç`$‹>ëö¼¼ª1O×ëHþºOáý¥<["åi æ¥ežÎ×Y¶H·8˜Gaù¶Úe‹¦„c’8)ÛÙWùöa<‘Ô¢ ’šÑªX¯ /þ[ómµß.¼Ùd<1–þ(êì0)­qVœnAdV")¯Rlý:<%=HöËó ü“q– :'}›è O„´£|…Ï ;š‡×*«qP”øܤ»ÈXufÂÞì×î(6ÅǬŽÜBû\ N¸#ƒqWžçî×éÝ×;Tš°DXNp+c‰`"Ylî>~¦É>Âêˆp6ùX7 'Î:­“¿îþì9ÅÂ*¡‚(Æ$*õ뀒®V— î° ä•ø"ª›Ž-€(F\Šy "ý8_O<ªª"× 9R|§U¾À!GøŠ#°8Âà u“Öeþi«¢ÜÜû*¨°V·´¶Ã9ØЀ¸iwŸ¬¿oÿ6i}²a3XÛ,œý¼Î³j† yñF6²¢ü9 _ +,núU&Þ–«o+n‘+_Ø/94ßþ—]ªþm.…ãvkŒêçŽ.:†¯rèK§ð[|%^.WÞ"W ¸Ã…õµ]Ðÿë]¸©v!XèâTKœ“W»'fð(h´ qìm¨ØjàA”a 8Ýô!b]B)§šp@=-¥Á½MŒä;ÒrÌìèa¿É°ž+Æ.êÔwßB±X€Z”Kßt{Z(Þ@úö˜/‘´Ì{ð#Ó °7G)zìQÄ™efeæ‹—þ%ß.+”({ö ×ÎkÇ\¼­€d·ËÒÇcb7pæˆ*V’Þ{üZÄ™ ˆÉ·ÐÙT¡è ˜~DžÇb¿^âxžÀ!3Úeåf72 ­zb´s†¯ö‹€¥ƒô‹®Q—ƒôÐ/¡4ö‹-¥‹ªî‰ MŽk ù}Ã`çíõ3íNfí–û†“sƒ»8·Dj=ˆRÁÂejKé.-ÓMß¡ö0ÎaêºÃ ¤Tã±Ý2b´½ÅaÎÔ‚²ó Ž÷VÝø¥º‰¯t»ì+Ðoªëƒœngƒ}=“78L >È. ¥€…õÓ³Ò¤ ú˜&¹ˆ÷ž~ФI.é1Mb†^t®‡©J^À3ÅG+uzBoêdÔ„KÈ«¡­€GûœÀ!Úø›B[S¢!B°Y%®E¶ Ü : Œ¹m+}}æÔâzTCä+a‡0\:SÜÜà-mj™D©°Î-ºš8Ÿõ{æîl7jÛ-Ø®å “p  TR ¹‡·•îÒÚÑE¡º½-º¤ð!Á±[r¢»ÅY Ü:ˆJ€´ÆvNb±ï;‰ö Êð:½Tj¬¹þ‡iŸMd€@gބôÏ&Š #Ö]ÐËöD)(ã]•+ ?VšÀau‚^äÁ³PɉwðÁ³áÞ–'ŒR:ú0ætT„+Ês k[¢£ š ­…/@š²u"OöíGøŒ€¾BŸ0mš? oµ5þõÏ}.´aþ x–pwº_ÔQR¾Ù­³Fj…Lþj`^|÷’³pw­(£¬Ó’Úi¸ƒ ‚¡ ‚±h‚§x<¥ùIÉ‘º­Ü·WOù2üÐðnðo¡ Î_Ñ Ò¡—¿³²À»"G ¸œ¨Å/"È·aQ—Ì÷ùÁƒð\”YŠN¯uéð™wÂ!®lÜQ©ZLÑÿûl"A endstream endobj 579 0 obj << /Length 726 /Filter /FlateDecode >> stream xÚ½VMs›0½çWp´=¶‚ÀÈ0=¥3MgzêÁ·¶Ã`¶&Xbp’þúJHƒ!¡±“>Юvß{ÚŶ¶–m}¿³Ưë»ûÇÀ± YëÔ‚+ -ä­€ãzÖ:±~MÂð,Ü’ž.<Ç›¨UÎz9«×á_\°ß¶gk =Xð<ŠÍrVÍåAøeúgýãþqéŸÄ°pðƒ@Ž¬\¤cX來ãÙ“˜±"!4˜ë –ê1Òƒ ¬:Q=Ù[ByŽc“¹^slNF41&»ˆn±Y”œÐ­ ð ¸j­€Wà¢ì ²-a““:¢T·ZKü¥k- ×ââ 㼟‹œŠyel·í0-÷EBö¡xÍMhj67ŽrÆk~¬Åp$cTÁG¦ˆN·Ås£{ýôÝß0w¨a9SEƒÓ{BèÇ)J’°$#èÿ$lªYI9ÙRõ$ÔJsw%Y”›«§‹n—n·J!¬–N»JýT±ñ곜K +ô˜øfÕ¦uÅë¥æ I:¶¡Jt¨3 y³/˜ÄL%—ØeX0Ú)ìç$XÖ äˆ>Û5«Ó±‰8‰Ã*²š’z/T¡h .}xŸí nΛïÇàV÷aÃdž½üây åë2,—ïšc§Ð›¼ˆïU-¯Ùæ—Ð>J·Lìc~i?„£YÇйŠZFeã}f6cÄö)@g‚3¼ÇZ êÿI¹i?>:ñƒàÚžŒ¬r°a%M¤ÏïsàØÁñœÂ£¤„Qžv® ”¼M [îT–ªuáÂh[îkaVS±3gR–el*“~®¿¥%šGè¸`éùmô„¼žƒ1ïû‡©ˆ‘h‰ L™|„ñ®©}­£Q‹œÍeѾA9›¥^#›Æ°ç¦ÍJŽ ås>¦wÕ§Û?{¦}@_bíÀ—cåc‰ZßÖwÿËãÀ: endstream endobj 585 0 obj << /Length 2132 /Filter /FlateDecode >> stream xÚ­XKoãȾûWðHOF=ýnì3Éæ$ˆ€<ƒ–(±É%)?6ÈOUW“iZ+c|°»Õªê¾"î#ýõŠ‡öçõÕ§/©ŒR–Zi£õ.Î0+DdcR™h½nâ¢+o»>ë¯WFÿëPuuÛåýí®nólóý¶©‹ªÿÊ ¿þ¶þ{¤K´ŠVB°Ô)··¸óׯ¹™Åöý“Ç›zß”9ŠÿH y1¤Ìñó`–Ö˜$2­g~(¨* áÑyQÖÙs‘\cÚ³ï¢ÔHÆ¥™*}Î2I=){Å©dRê©âs‘\"0v ¦8Æ ë–âªûÇepç“É+ëë„Ç/õ]Ÿõ3j:ð‘2§~`2~ån² ¹á]Ö¤ia#òKßúæo˜Ï8ñ‹\ ©69â›÷ÅÃ+|{½ž!wÂýb‚<¥±£˜ úº#é\¦¨—X÷Ãv-:5è áf!ŽAvø#®é ;ÒÞmc&–i\Õøø2°RœÀhV!Û}¦xºÐþìB)ŠB^å\˜oóîPR<—Ó’Ôað.¬ý*¥z¸–Âb }=’)9 „žM[CD퟇ ˜o²ö»€ð>ïú|;À͹¸ÃKžÞ½GT]—3`ÀûÞbas¬¥¦UÚ¬–:ynHªt0éß{Ô™03è H‚º^  âK |ÝÂcÅç)£ßösÞ[ÿÆ }èù”ˆ6/3J! 4ˆkfÓy 0ÇØ8.ÉÊ®ªMS·ƒ:xP,]Šúúçf0Ê›äXÍu˜OaŸ}ÑuºðDÁN(ÿÍè ÔHŸj±èÙæmº³ôöÀÛzOÓ¡L’ÁÀò‡qDø–]ê#;¹ 0J,õián4d1Lãê!‚ªkËSc$Ø Â/pÖG¤³5 6m±/ú“Äí'än"…݋ג¤pÞ¶>Ü~xJœÄYÓ”Å&œ¡ Oãßó¶#-µ{È©´)\ŒAÀèúö°éëÖ¿tñ0í„…_9—­/Ba-@qÓwùÑ‚ÓCþ\:*%º‘ñøÞc˜:Q`øð¾ü ¾ >¾ åU;:6:îÄó Í{Ó1þ¶Ã>à¿°}æ»›úî+<=yò3 ½â0ðcÉzC;ð,>pëø·$ÉUÌ• “ÛAçW.ìb±'Õ˜Xª Î'‹§2@çÏìéý ãU6uù\Õûb5ð tnêK„”àñO¸Óž1Š©T^`«žšêf¦’G`n›#Œ+\ZLZZRã6ºá–f3jš¬Íöy?¬ëšl4Õaá|«¶zZàE •aíüc\‰¦B îè«9/ŽÎ>U?Í(Q++öu4Oe’æ¤G†°Ý•ù°+Ûn‹PsàÏîp×·Ù1;7Žž:±Æ»!!³wiúyðîW¶ @$οàdæèñ<û8óýס"dÆ%oÆõ¨oËDÞêY§§Tâ¦úFŒ`õjÿKÍÍÓlüF~Ø•u¬‹ãŸ¦áŠš?Qó„ùåS¶þo‰K.ñ}Ö,E# ëøièiñjìqÔ¥KŸR˜äã’7œaA[š2åܱìYY(ªB̺i$ÉJ$ñ‰Í|úø†!ôD{^nMâ"´gb`ÅÉ·ã)™á y¸,¨öAÚ‚S„Á 3ÿÑÀ”e.õØÑï¹Fï‘{>ˆþGÝçZ[ÈYBÌ¿#O@çz Ô©"íØvÔRÑQ¹0à?R@;’ü©É·QÀÄ·a`ÒÀ‚Ptøý"<{1׳+– åÃj‰LÐW áf×€éÄ@ù[Ž„ç=X„óú°=‰(4à« 4‰%ÄÁ ]•vç¯h\¿ˆ`lŒ[÷¶”Eß¿”fŠÏråÛCÓRsq`BG®.÷kbÀcx:1iöYÚ0®•Ú1îÙ¤ÝdËçõÕÿàõ endstream endobj 460 0 obj << /Type /ObjStm /N 100 /First 880 /Length 1488 /Filter /FlateDecode >> stream xÚÕZËn7¼ÏWð˜äÀ!Ù/ ø%À°|H"è Ë‹Àˆ±kH+ÀùûTdGg5HÙƒ4ÜQ³Y,›ÍÖ²XH¥…&xhÈÔk EüÉ„ñÌZÅSƒPƳ-Š§5tÇOM4°•P';¸ã‚÷rRoÀqÆPlrIpa C4j™3œYECá­ÂFª7$d5¸–-Pµ«#¬èÞÐ*<7tå–CÉ…R¶„†À¦VÈq6 ÅAscL0µ[ EU€©!ð(I°iÉŠFÃÔJœÐ¨2 JNŠÞp&¹âÜÉÎ~ 0‘H ‚Ù’ªd T zaÚÔÀd œ“c&…1¨ÏFèEX—ÂÁñ‹ÖAJò!ü&fn¢NüsuZ$¸J ¥ø/Ë"„Ž BøqüBð ƒxGÃâS4|H…wq†!ÌA$h€+a…|<†(h2†*œn¸ŠU„[PtÂ`^±,jX2Œ´ù8P‡%`A– @ –‹›´`Ea9]`Ó8é ¨ùôÊ4uc%4°Ä‚ÉšUoÀqK>¥ •2ù$Ñð‰‚žZœ.a‚+¤4`öu¢‚­.FªAzþ¡Âo _ÏÊBÁàM˪lŇÁ“ ÁhĆƒƒa|ù×»UŸŸþ±Ƨ›õvµÞ^`m+6â‹a|±ºØ\žŸ­.¦í8½úeõúÍé“ÍûpœðBáÏZ9àâ}ƒ^·{ôhrÿ,ó´«_„ñ×ß~÷mMU‰òúòíÛ“kÛ€ñßnÎÞž­]uy~ºÝ®Îס\}üþýö‡£íévòôb9„ñ°•); ãËÕûmø0î¿P ÔQ y.Z’üÅw{þ:>¬çCfó¡{χåž6—Kû¸EL: Œv£À¬£€÷‘‚šz êl Ú^RÀµÌ¥ Ò^RЗUgSp/Çå§áð& ÄÆV:>ZšËGËû(‰¦=<›¹Iü£‚Oșɇ¤>P¶Ý¥¤Òñ±RRw\ú%n~!ÜG ZOͦ î#¹»Wø¥|&¹<äY1—‚Ò^G¸ ããõzWÇSý±xùâêi×Ïzý¼Š· Mý‡ñèòÕvúüó›õŸÃødsþzu> OÆǟƧÇNG:q°g˜eɹ6¯‚ÄZÌ+S1U¯2Q¬9ÃîñÄÙQؼܬÒ7èùf³þ.úÖ9[YV>â`,ºz™æK8._]C‰9r̺šR$Nµ,N±šìJ$eÀ˱Šþ-²Ðk!\jl^ÈM^ðcj±Ý7+Y8*ε´+°y¬Xl,;¡±›h|Ǘݲ¡ÏØÒdˉc¹§k¶—¯s—C…™~0CzLùë)¥>ŠÔ¹Q¤\GbKF‹ÌXi$oD+nýÙ8V'…+„¦÷®ÇfØlÑ”÷xÞM¯Çv=¶^^T½=..Áîêëì$Hzû,'zØ{ß rfóѧwd³ù¨[#\@ÜçzœçòÁeßëÂÖó!³ùÐ}Lÿ¥Ï}%݉‚§/šÛRÕH’?&qœÉ‹/æp·Žº}> stream xڽˎÛ6ð¾_! ¹X+¤$ê )ÒC€ ¾%AË´Í®,:zìfûõáP¶äÈIœlzÒp8œçE1oë1ï¯æ¾Ï7Ï^Æ™—y&Þbãñ8 Rz‰Hƒ0Þbí½ó_›VÍæ¡ýv'[„8@¥f\øŸZUW²$L­µjTÕÊV›ª!z³¡Ílô\Î>,þ~ö2çCÑ9 2!@1+ô=ã QÌ@­¼§©F: Ôæ$QVëȃ)+3GŽÞ<äqÀ¢Ì›säÂY¹×²„£Qú²V¬õ„¢qä<èMè)‚<ÍzUƒ7‚Ù\„ÂsÑ" ’0ºÖ~Tó3ûÙ5vAëÊÐ…ÐêA·;‚ðOíHWµ,îfœùªu\þéš–œÆC¤";­ÔDžŽ"¥+Y?\«’îÿשÿ°Ó¥#\ˆs:b׆¾ '¸*bÂ_ì´ÛÛëí®%°ØÉjëI‡kÌÞaF£§Qa¸ã<ŽÇê¾Â(Ä Æ÷µÞëVÏàZîÑ…Šv7]U§Èꀱ Þ3VjMhƒèT=f*k¹Wmm²Pèƒ0Ť©KéÔv›pfs¶‡z¸ˆ2Æ©%¾nUnÈÏ䲤OU€ŒÛ‘´lTïßWýGØZŠçÇ–Ž8ÙËÍ{ìXE4½aG{ÄZÑZæìLÈN<1f¥æù1°ÀˆXäþ«ŠvWÆ4@…lF]Ä{_Â)Еv^¾g‚™šö-!"M׺!-Pq¢AE-ZWÛRÍ×z¯*L8YÞŽôv÷#+°¼ö¸7žÕ¤jRW5mÝmW«5’ðÌ_Ì2NtE­$Ö\„{g5tÒ%.l컲Շґµqthâ-ý„và.{‚ùwºZ7R™fä.‹p4½[ì&ºÅæ5,l™Aम&J29¼QŠÊZÊZ(r{á®°}š¨|ï x<«±É~ìhglçaŒ‹K>íìXZÓ³S#IEÇ:|¹^G 4Š¯ïWÌ1pŒMï(B(ýsm#&ÚçªÑke«°pÑŠ©J/ _›¢Ö+ÌW\ÊÕ c1âˆz€øB÷ YÄI~}÷9׉p…t”wCÐJšoÊΚ/Å[û­¡ïkù: èmWìú<¦ðÀãA²,iy>h‰5Ìß`“’ºì°Ñ ÅL‘#¶`v¨f2·é"/û3A’%ßc+©—Íã(ÈC1 …-m÷ÿU5Z“¹I‡S:%pÅùÕWŒÜί…ÙÊõ“ _‘ÎÁO%Þõ·Ì5h¤J§“sˆtÝ3‡ËÂq[Ùú~E®¿ŸÙˆíÔ¸öɾì©Bcg´Ç’ëÈ«ùÿµÙKí`›!¬œ4ªù뾪BÕ¨S­Ê‡.§ÆXß 0XD–ý¢«¢ìÖŠÎßuS>“›M°ûc*’—KØ_nõ½#ÇPÓâW·ZbŒ-Mµ$ °Ž[^½ô϶ònÀ°4¢K×z-ã²Áâý›‹î‹l¾¦×=°}Zµn/;i|øƒÍè’1ÉuÆÔÿ‡1ªêö§cÄK¨¡î B·ˆ¢·vÄÕÁ<Í…U²úYqtVIæYdKð(5Þ¸eÓt²¥s‘þxÕn.å¸9è>ÅÝû”ù›Z]öQÇéOÏzP÷ñîèN©Ã€¾)/ª®,¿¤:èêP™Vã[bäOœò3;¬Öö¥AéØžáÀÎ:ð•ôt$¤ ð+E_÷£^ضÊ#ͦ6{Ç£rÑ8ŠãÔŽ….ÔÀ*/7opf÷â0 x–z!θWìoÞ}`Þ6áÒƒ(ϼKº÷BW1nKïíÍú÷3n%àž&À (YHB ƒ/ÈÕvÊ}!Œ¤Ž.•‚ØÎ]4àfÊÒ`?|p{ññ]c£©g?hÚöã…®m¦ gCßœ…ìôz?|ðøš»ÉV…Q›ùT"`?/4 €˜‹}Ïwÿ·¾Ôõƒ'ìÏ'£¿;aO,–[Õ.m ^¼Cç[Î'Äô’#¿a¹ôüP`qX‹Ò îÉg£ÿ~~‹+ endstream endobj 597 0 obj << /Length 848 /Filter /FlateDecode >> stream xÚ½WM›0½ï¯@ê…T k;˜€ZõЪ­ÔsnÝ*"Ád­%&’6ýõ{L²!ÝlO|x<~oæÍ#!ÎÒ!Î×b¯§7w_‚ȉý8d¡3ÍÊ#?œp'䟹3MïîôAŒ¼qáñÅ* رÊà]]àõ(í]QÚÊ„˜…8êöGª!»„H£’åÁ22‚›^FAŒ¢‹Aº#Fp´aks£ å)¸€Zjuc³thd ¶Îí\PåI—2RÜàDé¹À‰ºt&èiéQ¿lê<ËÊbuZ湩“ÇÞ¹ÁÝ(lÇ;½¬ƒ® lÀÄGf”@OD ÆÔèš…k¯0e¢R¼©›C€8ÊG”ø"E I­9»K›5#±w“¥Wç±1v©Îuº§:7Ü›³æ{œÕZy¢ˆã‰?¡¬kƒö+ å‹ü´¿Ÿ¶üꊞ=¾Àì·IÞRì5.o¤˜€åÃò¹uíþ¥sp ’È2itU8Õm_y„Ú¬ñ©\ÍêÝÚâÒw·v±™ÏuQa·mˆ´ITK¥I ÄÚ—þú€‡·#ªXI•ÔEùz" ‡þHÙ£’Û—!y®d d‡ÓÎÁ­sÀuU¤òžÖý²½¦K\Ë&ŽË]µm¢’/û(=-ûötzâ0‘žÇØw‘koY…`wÏB¿ŽÝ½f›¸;ÿïtONÇùþ·Æ³cð_EðkÁ”(ÂœAÜÙñyzóÆ0- endstream endobj 601 0 obj << /Length 1440 /Filter /FlateDecode >> stream xÚÕXKâF¾ó+,å¬BO¿J”C¤L¤"m–Ûî yÀ€c3Ø0šüúT?ÛcXžÕäÔívw=¿®ª.-"ý>À'Æ_ǃûC#ƒŒ¤2Ï#Š1DGR(D™ˆÆ³èóp2IËl²HwÉÝHP1´_ñ|î?>„¯I<›M¦E^Vq^MÊô øîëøˆ¤9‹F„ #«øïNŠ0û1¬ç•Ÿì€ùÉÑ&x•ˆ»8ëEÆ®}@;ì{Áóíê¤}å;°o2Ÿ§Ó4éö(nžJ@ÿãþYºšT/ë@ÁÎÚª­‹òûhÛ êêÊÔí0Û¥0½àºFš!©e4¢)e<­?‹ ¨0b†Õ2®ü©FáI¥A·XÙ=ƒßƃ§U‘ˆ$§7 âéjðù+ŽfðdGÌèèÙm]Em`–EŸ»‚ÑH2  ÷<­a_ódbzáÉ2X7™–IÕÁTp`¦za Q™€3L÷q¡ƒ³1Èžì3ÃI"Zꦀ!€fö®óY<ˆBBò³ð`#‚{± a#/À“1-zaª(bŠ_€¦½¾·35IAÚø8„¨×Ì97Hé^˜sA!BЫ!ŒVH1Ù [Õ2 âu W÷ B&›;"†qUl:øqØMÉ~w—ºÐ•Ø‰>^ · Üf ŒI”æHPº'õÙÁOCétPÏ‚4…0û¼L³¤+\jĉ<GÚ^@M€º¾ š iÌ)Ì̹û`8ÜÚ S£֤ɴó>p€S}ð›LL“çépÉ…Fº¾’À¥ÒM¾6×v¤W†áâ‘V¥p2jbq%îA£ú¦ÛLŒ@G ë³I$§@¹¦î5µù­Î´;©2x§(Ñ SÆ\6j0=4© ³FöÂn˜Ô¢É¼*Pä0IêQsD¥aL6Â|¹0æV;Ã`»6Œy’qF?„Su¯M4—]1Ô!üP@-Ý…f¸¶Æ‚²‡Q}œ%D2åHÚ ^§ nÄ7«\«tº4 Šù‚óv ¨’¾àljЀiK %”V{çÛ|Z¥ ²u›tòúInGe_‰M¢‹dãaÜÄö˜Ç$xVA²¢Í7Êî’[œmí£€©aUØ1@Ó.À›¤L³ÿu ç¾Ž°µG,O¿Ú[%¯†-‚GŽ¢'pÈ%âXõâ>#që%#)¤.ËH=ðÝg¤:_û°¼4#ÕÁ#pä~l‚j°Ÿn\†W³¹zMˆ¡‹‡®Ôýƒ¬Ë>‚)³â€c‰:¸^µÎ4”ðG‚O?nã2]ÙK^¬Ò8+¯cÈp: øS± ‚•éj…ùSû¤[î•~ Û¦›$®’`‘m™æ‹–²ó"Ë kçÿƒA›ºõiáÆ·ì#\{‰Hói¶…×üÏPÜ%EË_N÷š}§ã©Z£¶:ù'Ù“"ŸÌŠUœæW·8Êu< Ÿ$®í¾|[Ê"O¾‹ò!Ó|^½¼[æÉâÿ"iœ¿¯ï<ûò¿ô÷\o²ûïâÍÛ«va t›—é"·q8ôAßÄ™óM±²mÛÛZ½Wµ[ÿJ¦qfË%‰}Ãf$TW°¬h§iîÇçe:]úm±_i¥2¿˜¥6)ílâNJ¿=-ý¯pl¯[L$±j¹ßÔá-Ä#ðQÞUÑPóå‹ÄÖa„Ÿz@9mÔ!i{8tXˆqt|¹Ä›; ¾€ZÂ0w€±t ÝÎl¿ÇŽÞ^0©Õ2ö3~,¬¼B+(´åÓi±Ù$åºÈg剚&Èìæ®Ëä~¦a»3¥«0¬)›i?"€"#5øÝ ­CŠ÷;l‚Òð_&#ì endstream endobj 606 0 obj << /Length 1317 /Filter /FlateDecode >> stream xÚµX[ÚF~çWXê DaÖsµ­V•Z)©Ô·4¼%2xÌNcÆ^_ØÝß3³Ù°ôçrΙï|çbÂ`„Á_“Ð?ÿ\Lî>²8HP"ˆy€yŒDÄÁ#D(Yðeú©KU•Å³.·*-šÙœðpºNµ¬¤Ÿ(+%37NµäµÜÏmf|š*ªk”Þ¸a{ï%äeQ”3§ûµ¼ÓëV•ºA³o‹¿÷–÷Ï» 92Ÿa3ÀI”„ÔYÿ‹Òë¢Ë@É¿©¦¸;ÜÝÿn䂬9Æ(áþÆË%l[nÔΟ2o‡SnòÝÉìxþòÐJìM9û]Êê%±Á¿Z)óËbtW?cñÄ+¬kÓïò•ÖpgS$b1Dq¿g‡nÚT·Þå²ÞºQ™{v¸ÇÃk¨&g˜OŸÚ:]·=»Ÿ®äȘ¿w‘ÜÈvÙ_Çl»­Ï_…ê,äÜÅ`™¶˜Ò³3?²ö¸Årº} Žcþ¾T^ §¹# ÓŽÞx™—µL×÷KcÐM {?ÂCŒžw¹6 ›áÕ%­H3tB9A4dCÉ»Re~#`T™ïÝûÈʨK1°’ rä'HŒÛFΟ—Ò®ÒM%q0–y‡¹¶‘'©õZ7wºQ-³!†ËLm½7Šñ˜ë¥î¶‡c qÙ>WÞYfôª ùR<[K] ËSÚ ða1y˜˜Ù0ÀQð%L $bÁz;ùò- 2XMˆ&qðh·n‚’8Q|ž|r=å@Á Ƭ¨(ò.³èk…Ä z­4F'C­@Ó¥œ£ÝD'tÏ!I†:!¸GÈ…Áº(ê]P˶«µñ>öí0 ßåT¥–&k˜%Ë&l ·yllyÐî ¾Ô–n‹)õ½P?4cŠ‡\9Ô—!ä ‡îã(*ƒhˆà)„;ÿ4ŒïkÉÉU /á«"v[ÿ{H7ö'Ìk ¯U …I·[NÝc›>©­Ék楬ÝÞ~M飵Ü=•OW©)sfÊ£â÷AÄ+·ö¤.žÇú‡#-6™šQy%$º¯­«ç‘Ã!3”Ø9pL{FÄ$à)ñr˜Æ1ÌE(æñ›È3Ä ÍQ‚'Néq»u¦œ2‚8½‰rÊ8°‰ •Ãç`6 QBöÀ!Gk‚#Ñ“N œ\[¯iÜ š®»ºžÓí«.Ýú¡²Ó­ŸÎT ½U¿y kë6)f¶\ý {L^'ø0#Ðpµ^̽eß³VºÙ´ªdZûp„hbì´I˜ÍqâÀwõZºïâÆO}'™Éú†þݤÃTóLÝ‹=ç¡úÙhÙ¢s F¿ÍßIdVTļ¿«Çs,‚ v ‚’q:Ôù"Á™‚Çü&ÊoûŸðcL¹b@˜È7a6ÏþÔuøç endstream endobj 611 0 obj << /Length 1759 /Filter /FlateDecode >> stream xÚµY[oÛ6~ϯ°¹ˆYÞ%bÀh‡ †¡~k C±éD«-9–œÌûõ;‡¤lI–Õ^Ìû¹ëð;4î#ýzC/´¿ÌnÞ~0<2Äh®£Ù*b‰"š±H«„p¡¢Ù2úÿ‹õ~i'SÅUüS^­ßnËõ¡(7y¶&?O¾Ì~zSƈQáÌ|Ûæ÷ùS8…£ÇÓ©ùª\/ýÊ›¡ãCÛç‹r{øLu$#©CL¿Z»}‘)vûÑ›Q{*óåe:óÕÎÚait[š:ûj¿Mš·dÚrÉT§$‘<šr ÍO{6Ii\N¦\Ñ8¯í.«­”¦â'ü±;?“­×¾ó¸ÏªüÄ¿ §‹°Í7;»Ü/ê¼,nýx_Y”é,tzqÃ5I 2¦'VuV_³a¹³Ù⡽0¦ƒo/…ÖI,d÷fU ñ±û‚ÏíÇ­§¬8Tv½~Šš7`»¾õã•àïT·ýÍ„"ΖšÀfOõýºÎ·ëàä÷ÿlw–ƶªÀSÕ@РÎ)ÑÁïàX’Æ›Y  ä‰ø¹Å±-êÊ3ßTöqo‹…;hârågÿµ»Ò÷Ê]`îô½»¬dSaX¥*%,/ítÈIŸ)å…s ªb”ÛúÁbGÆU¶±~jYn²<,WÛlaÉd*Ï.mðP‡IÕ² Žú¶Á#yu:2 qI€Ñp£0°ƒ g7h=7ј7›GhßM8|zu甉wYq4ª@w‘hØc yhm£¨DÅ¿͉ª«B]LjÚxz=ñüäC†âù$ƒî4.N`¡²uè WÔ…ÒÕE¹:Û²X掟jEdjÎ#Ò`öªÊ†k5dw¢ ë„ ‹ÿ¼ûÛ.|,Ó¶< *À1÷aX¶¡·,}[”fOa˜ÉŠÐVU¹È!û.qÌZÜ©Á£H]!²!UZÖÐ]ñ`ˆáÇ5Cñwvå?4ö™0?ãOv¨Âœo¼ItK(Iãù&_g»õa¢UŒ£Á"ú$¨‚ÂÙ@«+Ú¾@ÿ h°Í-¹ŸóÊ6÷ŠËN†µ²“„éŠ6ß:Ó),bš=E v"*XF ˜ât«yS¨ct¸;_ÂûŒóëD&3çlqã¥òÝ¥=æ+Þ‚Îd¥9IU£Ü+*³„¨T6{²¢# UIÎÍûÙÍã ƒY±H(C$©!Tëh±¹ùô…FKXaÒèÙmÝDœ˜¼Ž>Þü5€H-S ™¦$ÕI+NØ;.Fáj8áÌt¹>eƒ&¼jXcŽÛƒI¢¨¸j/ÉaÑQì%sò¼Æ^R¥DJ6 [͈ä=ƒe«Õ%ƒñkƒæ®äwX‹ßÍæ-JßÂ\ù£‡~ûØŸÜç‰3™o|>Á^+Ñ´Oº¢ìüÒû%•ìET—‚NRžÕ¥Âã ¤®]@ˆêT: WuJ›.ס H&œh>O÷þ«»<_ $:*(ad72iº)/¡»…¹Éèu9àᬘè븬…€Ê*!©Q߇k¶sæHi£¯ãp°HØ(lÁÃBw¹^Â5€ì5£p5ŒPØßa; l8a€îGà)¨"Lª.ÏW=¦‚¤£0åª"ÑeêRÎy4sA$ã§ç»¬ŽÑéÚ»¹x~zD1n1†0ÞËÉïÜÈÅKÌ}õÁh‚£ å@{B;0hÐŽh0žï¡ ÒB;îrÖìm>9èzÎAVó•öôô¯—î/…Uï‚uV_fl£1ÿŠ½b¿¹kþ†h¨ä…‰H°àˆ¡4m¹¡jJÛ*ôjHMŠw6A$ýËëÕ® endstream endobj 616 0 obj << /Length 1201 /Filter /FlateDecode >> stream xÚÅW_Û6 ϧ0°§8ë$˱¡À¬Ãö64omèåN«#{–s×~ûQ¢|g;¾k‚æº'QER”ø#EƒÛ€,è3ão«Åõ»2JRfq¬vËS’1diNbž«mð!üIéMuØÊe”Æiø‹2ÕµØíÈÝÛå§Õ_ (bŒ”©^¯a}}«î½¸íU§Ö°YoF¼µÚJÝ©îëGšR§1a¤HøœÚN|¨5ØøéGƒö³S=¯cεæaÖ;d¿†ƒ×ï’bö(+HžÄAƒFV Æ_—§e¸;èM§j³îNtH5²ÝÕíÞàLxf[ÿ#âýè—Z-Á™û%KCÙ‰ÜVVb°¥ÅÑHoh#üÊ—ß´Rtr‹f )“d‹ƒQúdKþJ$vuUÕÖøƒ_KOfÈ2Êy¾—^VT¦mOÂMݶÒ4µÞ>ªæ5DÄÃà\iŒt6|à“×úeæ2à@E ‚N€‘„°ŒX±£ô™äÏH‘±ñ¾rêlë½Pz½ÍüÛÌ~Dò<ç\+ô­|Þ·ôÿôÍ¿u}è.ãáÕÜ…J}Ø?íÙªýºûÚøm–oò—uÐFÝjH/'¶S­é®¯èÓÀ$“rÂE ©¤%¡´8ð¥Ä2.‹¬„Ëv»x#=Ãg»›ìÚzË6Ó{u7Âø=sŠ=(XA—Õ1‚B4#>C¼ˆ)á…U³rjhúÛ°2õYh‚ÝîàøtÆKP׺GÝbïÅ…éU[ž›¹~Œ+éÄÒîBæF6 šãmŽ+2ÍIÁ³à!9,ú}µøwÁ€KÄP­‹’ ¥„—e°Ù/>|¢ÁÁ)`ÁƒÝ1€[ T¼_ü=ÓÄ%ÀŸUÅ@•3êÂ6c¶ÈIÆÙEÌ–”d«P¬j}l•³œðüFy òi9¶Ú<̘äPØelò„$4Û´(ul4…”éEŒ¦œdu©|l@xÚ±š`í´KM¨Íÿ‹<¥¦äß¾Ô„ ©¸ˆI‹´y>{©p†Ç›§IŸÍw²õÑctX)HOjÒÍÁ‚NJÃjÐÂd)£À¡-€V'[œöèhô „7  ž¡Ñ>‚J&µE2Qy¾ì¶Nê–úJû»%ûâ-qvµRˆ»_ã“áœCúlÿFšñœ‡Ù·8û}µ´®½¸1õFù°·Oj¶c·tÊã§û˜ZÊGÛIzÖcå«a⽨ÎÆÄ{ Õä&­%ì]úôÂ÷³7é7{ë˜çGaz±á—æ´j‘}oµ¸dd?‚²‚­H}fáï=å£ ÐºüO Ic endstream endobj 620 0 obj << /Length 827 /Filter /FlateDecode >> stream xÚÅV]o›0}ï¯@Ú TÅÅ` Ö¦I›ÔNš´§åmKHb@’tû÷³}íYÃÖlO¾¾¶ïçñ±gî·«ÀŒï'W·÷,tb4¤Îdæ„8A$&F±3™:_Ü,M™mø·Âóã0vÕŒÏfY)š h®•øÄøµ÷uòÑñ F)‰cÄ⎕¹Øµ¬,·åFdÛJÔU¶zRF=m&è>ÍÖõ²«1ÁÚÈéPº 5+ž›éµ–o†b:yä{¨&·÷$mÕÙ§)JHèø!F¡¬·6þ®ñüÄ.‡!¯+îÎñ[T¢¨TLr…Ú º«²€ÙJ2éøI4ì+ÔÑ«uÑ42Dc•—M Ò£±¯ ¾)¦0Qeí„#½ùÐ]L#¤[Hô¼"ÏpàÞñ|Ëý8N€N˜q³0›äªÌäo@à04¢š[÷²Ê:”mm]äEY"þüvìÝ‹—vc^‰*/·SÓó7²é·²×hñö4D†p>ámlƒFNGczÒø\òQxü,–¢äëò§Gc÷¦Sðô ä¶mC­ÈIáÑ6c491@;e»¦3ZR”2v‘¾U]¤ÿrÛ@N…>—JÇÿru&:#ÖžY›Õìû–7Âç`ƒá–$Be2A}ø!ÀtÀQ*½ýžÊØìCZé4¤•ð¨7Ѥ• ­$>äNñ/·fú$6 0bvÏ[VAw•‰‡ÝæLë%·,i^/}ö¸sV—e œk×fÛ*ßœ{£.HŠçPá¤/3‰Eòhàýù3¿wnñº×#2¥ð²Ò°Mxrfɔ⣧R®AÇ1JX2ÛÊÜ]Kе4]Ë0t-•†®u(6zû/HRÄÒnLbQÔ}{µÀaèÂ^ï±WËõºµ›´Šʲ°á„Œ-‹2×/ËÈxu5Â#‚{Œ<òr6ãog4ævÒ˾û µýèÁ¦°¿j0ó·öß¾™{¦ôµÿ4úô›Ysê§WK3=^í|…ÕýÝ}Ì'SVÈg(MS3&=w“«_†ø/¨ endstream endobj 625 0 obj << /Length 567 /Filter /FlateDecode >> stream xÚÍVËnœ0ÝÏW uUð`ÀÔª‹JMÕ®ÙµbCPÌCLÚ¿¯­ÌÐ` FYùúu|î±}lKË4Kûº³åçp·¿ l-¶±¦ôÀjyÀvµú»¼Lhw$†‰l¤Ìº?ÇÜ}2~…ß !E¬?Êò³ÎkEGÛ«Ó Õ â9_ÄpLî̫r7vpÇ'¬Ñxdá¢[!õºDVlÅ\"û[׿²lûÀsmi"ž@ï¬caý72"DúïúDš†á‹¶¸å¥§Ç¢šå[íÌ9¢®š¼}_¥rž(z¾5%dl$–ÁaÀ¢=ÅIKŽb[  תÓ5y™¦,½å©ð ­(­8Á‡Ç¾´+ή£ûÏã6p[ï9oVŸzÕë‘‘–—‘šÆ ³¾ö_®¼_ùéoc³øâÏýG„¿Q_Ø!ÚGpyK_ÐfhW{78LÐFÀr f:Œ¢d†Ð`Æ—p÷W2³ endstream endobj 629 0 obj << /Length 2557 /Filter /FlateDecode >> stream xÚÅZ[ë¶~ß_a /Þ"æáý‚Ò")R Eƒì[,d[{V‰-ùXòÙn}g8”,Ù²×笀>‰’3¼|s#Égg|ö÷;ž¾}¸ûð}³À‚•vöð4“Â1môÌǤ2³‡õìçùãcQo›ì÷ü~a¤™ãßö°iŠÇìé‰HŒÿߤú²¡Â®ª¿¹ÿõá l! æ Ã#+(ýÂøSì¹Ð‚y­Æú,>Ÿ èPUù¸{é±Àx‡Ç:oÝ/blUF±=ì²7WÇ^f<Â8vËôá{í{»¸°ž9-g )˜ ÄõÛú~¡|˜gøñóUUÞk>ÿ|/Ì-5ó:ÿt@*5¯žˆºÌêDɱçvû¼®ah‰yóœ5TýœÝË–}[—{ª\WÛ¬hû%3Úo¡YÐz¸Ô‹{˜qëýB*=¯wŽ 0:_e‰¶LZ³ÏVM¾¦ª§}µ¥RFmŽÓC"N©q™‰t6?$ê¢üHMa:‰uµÙT8¾¬ÛÓ¡\5Àƒae§{í÷D[¤õvîE¹ÚÖ 8|°ç¿\V­1ÕøZ¥Èi%\Æc€ßßó|w³bÜh#Ҧǎ±ü% 𯪾"ð„R*åûD,júfôYÄ6ˆ[/™FþÂ…‘mXp®mì#Èå2o^rÀ/ñíoº•ÐG·}`¦)ß=Ü}ºCi|&fJX¦­ši+˜0n¶ÚÞýü+Ÿ­¡–Ž©àg/±évÌ|€ÒföÓÝ#6^‰6^+ËíIhÜ ±Ú2Éå$bu`–s –î\¬ƒUÔ“Huž†Rw/#"=tòn™÷Óe"äÏÁîÖ™nç³r=‚ØyéÂUth­˜ “ ^ãŽ{{Ó6i§Wv±Î2.ÍÛû¤½cÜO¢:pÆÝmŠ``¼œD 蟷 ü"¬ Ú±¾e¬–¿å«¦f÷ Çíüá9úW æˆË}ÝÐOQÓ7:s5pæ29sI»Zi»"‡fћթù‰'Ä0/ÏÅ&5hÚ!Ôùj1fË+ÀõBYCò6Ëvî‹Q>ԜʷGW3¶ÆÎH]vÙ¾)V‡M¶ÇH†¥‚¦íÛmR×lĈK«™“v´âvdé=„¿Î•‰ÝyÌ#.J \¤ƒ×b8ólÌÜCÎòšB €Y€ri@±å{à&`¾M8°âA]Uh°ÏÌ1‰Ø ™ÕC©cú,¹a6„)DJî™EÞ—yAŸ!„cZ¹IÄ*Ï4b/˜{ÏÔ1€Øf¯Bj;ßôâ[¢`PŒßÑ0ÄhfŽø¹†ø~ÒÇ7¡KíZ%Fz …¢ðš¾U¹IÌR_ˆp¡=Åé^1ÃOr¢£öÁöŸ¨ ÒTœÖ+çÌhU3¤áÌrpB1¥Þeˆ¥)`˜¬„ºnÿ¥ÞéN!Ö# 9{)ࢼœB¬Ü ¥ŽBR3Ó"¥cBø¡Ì šV Ó „'>fõL¸‰I'âô©Ú'ŒF±ÅP‰°®ÃZ2Ð<€3Ãd%ACªNFn5j’g1ý&%H,«†HùQèþu ÒÆ2áÊÕØžCl0ä‚}ׂÃ=î°Àê*´”eLÄbU`ƺ¡ØQl¡ò¢©œ@&(¯f(óRƒÊk§YaT^£†b/Æö!t™ RNâ)@hp³§“ ÄX•Ðj3^ÞNbß '0Á$]Õ;à ¥ud%¥»ºîN GœB,„hb/ [Jμ’Sˆ•R±S©£QŒÒÌC’6…H嘷~(ó£-Ÿÿm€«:û¡k´¨²=Ýøo¾¯ëb›—虳ͪ”`Z»ëi'GèM+Í5¤·ÁJÃиšVöËÛ`… ›s“ÀJ[Åœ}VÚ¬Ä$°Ò`Åo‚Õô<åÐô¬²ý¾Èã9¨÷GߢO¼ÍštjêçÙ²:4©X"_égWA ¸ŒŽVµç¿Xv‘órM?=çŽíÀf’£…ò²¥˜M '³É'¶—Ö0Èü'±—ÀJ ÷fúíåb[{Ù{)ÿM ó/Œ2/æ_É`N ¶5˜}±_`0ÿ x«N Sé4Íe<Ù@ƒ™or0–M:#ÆÊxV< / ØQæzÄ0z˜d£l´pò¦E×àƒœd¯58Æ nBµÆ ÏN"c>íßµŽgHÝùHêÎÁØ×Å:¿‚|Œ»z'kã!.#ZV̽­xßÎx²¬ÀJÙëÉŽt63…ØàɲöÅŽÐ@2-ëûe!ɲöe^:©Vž,ëbñz-k_ììk4þÃÜú9Ã#RIwΊw¹6’‘`öé ¨CçNÐÞñt\ªñÖõ™ôÌ)¼ÏÌò÷\ˆ>ÑÞ'ÍíõÛx¦m˜D*D$Úø¡ØÑÛÉhò¦éÀzr3”yɵpɤ1SˆÕ‘HÔë¾Ø þœ4,í|‹’.±I™tÿ–{ø¤`Ÿg \%ðL “s%Ô¼ŠGýxêƒV)½Tµ?H_&YÊlÕ –9OX§ïbŸö%@M-V­Ô–סF§¥Ž†³»|ñ6Xqï®ñ†‹çjSSÅËs|/A­Ûpþ²}êÙÆåÿç· ï{¶ƒ;Ž”îeÒ¿Þ9gÑ=µÙf—ž$ÙËs»ÈïÒÜÎ;ÐÜÎç<íˤÞ3 oûFÝC¼”…ÄÇ)öù7ÞÐÑí"è;ˆî…Ÿ·wbçJŠE Ý>D‹:vÑüYдxcb6y±Mzu\×z׫}±ŒÚ¿éÙñäƒJÕž¾[Òm(ÅÇM#²NeJ/ûAœôê$ˆ“í¥(êl›Jåa»¤jE/Ž€¶Ê7›šŠE9è©Ži2rIïÒU-VwèQ–ì®jGï`»[K°SZ‰ù·› ¥?©÷YÐW‘LÅ0l•AœÎ˜ÓP!͸‹;5Íúf1ßïw¡eËàé,ƒâú·ª(ÑÌ*®ÉÌ"½{ÆÓ+.AO¼ø)Ât¶“Ð:žó«v,ª>2êªâ¹'¢k,ÚÕð]ÿvíePóbþèÚôÒ·áX¤ÜÒëBD‚7’2úÔ;X5©|XÖyCÍÎX´ÛâzÅD 6(Oš~ÆË6‡üœÕ¨N–ظó%Zuh(uÀŸ†nVŒí^Ûš~GSáðÉ|Í…'°|BE‚_wy’¼Î÷½Û¢ujHo¡ôéÕÅbìñ€Ðø´Ç|áã¾o…„ŒR+|œ˜÷éVÌØA+ˆ­þ»+¥s endstream endobj 634 0 obj << /Length 1372 /Filter /FlateDecode >> stream xÚÝXKoã6¾ûWèÅÙÆ ß’úÐÝ=µhnIÈ«W$yoÑÿÞ¡†’õÚ¤Þº=ô`çùq82õ<êý¼ nüñjqñ^^HB͵wµõ˜Äק•O¸PÞÕ½w½4gL-_ŠÒTUœgÕÙŠ‡re÷8©óÊàôÞ”ñWËö€qûÛ2OíL-ŸvQy²Ïò4Ž’Šœ­¤äË_c³1öØsÜ šÕ8–~{õ x±bŒ„ÊYêtÉu­"Ëtñ>d=%šúp²9qC™F¦Að>ly2ƒ2§VI•nw¤llü†u#ÃÚíï²{sC)ÏZ†|WÛÈU?vl Û1l»½¸lÜ]©€RÞ˜¤‰¥ðÃI,}1c5§™ò»LÁö8SHEWa2pÖ«0®Ýþ'Sæsé9x¬¨ó&­Ç0m<Æ=ð¸™:ï¬4&I(åPäÈa'¦Æ ¢ñv;â,Ùã|WYìl½G6kb†÷àÀAµbªÄ:*?ÆYþa8RÁ;t%ñºŒJ§l›—¨£4&âNü Í¨Æc•Éê8{€ˆ"Xf»tmJ$6šIL ÌRã ©.‹¨ŒRS—ñÉ•©Ýi'% ‹ª—ï-ÜâÚ»,öà^äqÇg£¤¿ÅÇFñz;ŒÍù~Öý.:t¼—Aô÷³‘};tÎê+ë9 él iXÌVï Sá´Waí.õô.3 Oœ»¢q•ÌÆ|¢ÀÇckÇŒ I¨òGr?]-ž ¨ÔcžÐP<9”€Zo“.®o©w{pqˆï¹áL=NÂÀ>8‰÷ûâ7|˜ÊXÍ!R2´´uÏ3*ý0ë:N¼6Ñv;/EtÈÚXœÏD (¯K2xÜxx Ë%à)`ÁÛÑ’‚“À?I´¤P$Ðj¨3Ý%u<£Vs¢á=9…Z€˜¦ò4I‚ç €ï× ¦Ïf‹Aeá/&ÿĦ¡g Š2ùùl1- £ê$:µOh(†:Ÿ†×(|æ]`Ká\qiàôÌ9ÈáP[NàׂpŸ¿8Ûe(D§ÐéûÐá¼·QA‚{!?…n!"åP÷6Oîg’Å) 9oA\³Å ÷WCpÿàžàQ㬦o¥=Çõ£{Çó^ꦑãZ; ›ÒDuÓ$7½&¶tý·ŒOrÔÚîmwÙ¦¶:ùÒWÿ«8Û$;Ûf7¯0€ðêy¼œë×îî`ÿî!þèØíªx¾³¤Y¿;îLZÔ{Ûl5‚Ú¶m*­Ž>ô¤UE´qËwÍÜvbßbB2ô«5•tjWG>¹uãV`_òa¨-x¤œ€GŠ)x€Íf‰;_A‡²ÅÈ]nÖ€Kº,KèÀ‹\°ï¾$e\î[cîûé q7׳ÿk¸³ß¥vrtrÒðô,ìÔQ°›óeÅÆàny´ÙciÔÙ>ÉËÁ™7Rq(ÑÇe¤_ÛgB !è1cz„£Ã0ÕüT};y0¹<˜ÞNî··“ãç3 Ýí´óÂlbûmÑ\8àv¶ðbÂdíxíÅäí‡<Ðþ73?6Ç—\û7\SŸãô?º½“›z>Å·®uÏ­^>‡D ‚sF ¸£påN@·õ ’H endstream endobj 638 0 obj << /Length 713 /Filter /FlateDecode >> stream xÚíVÑn›0}ïW í%©ÁhÓ¤Mj'í9oë„\pˆ7°)ºìëwÁNÚ%j¦<ì ûÚçøØ>÷S‹5SûrcŽ|?¯næ÷¾¥ù†ïZ®¶Zkhé.Bšë, káh«Hû6yGY˜”™êŽåL>Ð"™g<Ù2žRœ›Ó﫯À§#døŽÂL bZ)TÝËžƒ§PÆoûN>˜ŽÙÛÈðìÅ»À?[ìŠZ³qM]T_ÐSK£÷5ÁüÞöZ‡£»ž±´-M·€y’tµ6Ë]NÖdOᙲX†BΦ¶9©¦È™F wsK ÊY!»¦iå…P œ`¡æaùyÄ… šêW–“¢¸šÄ"ÙÂ:õèÈ6|ÛîžDÍ똓ŒPÔHn€Poˆñ:&7‘ˈ—ŒÖh5´£ˆxŠ)3êÕ{Ž;²ÛînÛ:à6¼^Ÿf3tíà7ÉyÀY õì/ð$x³Èp¨‚·I±wŠ¦Óüº 築sO7˜„•éÑ4ÛLaêÖL6KVИ‘Hö2þ–;e˜]Å5¤e"h_â>Üæä›h+kÚG#ÂÛÓëä?˜c“ ÅÙµ(줃ºÁžê,ç?H(^Š·Ñ~f€º9¹¦ðb f+ÛW¯üÎï•Š{Ñ÷}<¯Î2ÅÿWúåW:n=Ò캟è ÜqþÓpø”³¡ŒV{·V(5ÎH©‘­Knùà~qO«“òéS¦ÕX >)¥ÉBh7áØÃjdIÓC}G׬X5pRpÙzT`™:‘Ä®sžvä4«é㉥DXöѲÆT_ü‡9ÜÒÚ{aerLl#ŒH r0"y+#9¨T·±!Ïžqéƒj*¤¯ª4½BÐMh ¹®á-aï–oxžº9ÇëLº[Ýü% endstream endobj 642 0 obj << /Length 756 /Filter /FlateDecode >> stream xÚ½VÉnÛ0½ç+ô"£…Ô‚=h ôT ¾5…ÀÈTB„IŽ›¿ïP”ak±-9F/69¾YÞp†Žñh8Æ÷çÈÿ—åÍÝ·Ø3b^`,3à \×Hˆ<ŸË•ñÛüÀóTlV̲‰GÌO¼w4ËÐÓgëÏòÙ®‹bÒ*' |Oùk«®vÅ6YoDÍ8¦¥·}q’•r­$°¾wˆÓ@cEØïés\P8ï~TwßptœD(Äža{€çFï_sAKñfÄ\X6ÆؤðçfÁYÊ,ÀÜòŠ)1_6´â…o¹\s*´^Js½xhµÒ’Ñš­´P¦Åg`í&fÛÅ(Ƹ4ÕÑÄîA4aCö…{Ç F"Ž€Äx§“ƒ18&³\bþ-JVU\æZ¶©xþ¨—õS«—I!¤ös÷-Ûäi ‡²5(§^-y1‚$w’=RIûdÎ+¨—CâÇ•¯Xh[ 1½Ö~v™’QiaSPjñÐj¥Šf¥×4oYÉv²™ôUÓø PÇg œÝ M@]ˆðmÏŒ“è0ìã ùFˆó©ôŽ{\T §<šß./ÍW¸XÓËr6¡¡Ëßé vÊÃAÉî]þomf¤¥\JƼؾÇøNò1ÉÑK9™çèäŒ&УV3»7œ¸F¾MÛìÝ9¿4”+0r,”)iiEŽ)a:ø€\³ž-z#Õ\zU?¬TÜø´â#¯‘\'‡ÏÄ‚â0Üé°’åµFL™Uk7ÓÖ¨ÞöÞJJÔ˜ %Œ`²ž—ýñ§D0þv,ÇCaHº©ž>'6ã£Q±ø å` Ù [uSÞsG^߆Jo>OšŒ^Ô«šMd^¿éÓÞÐ;Gú¢c=³®¬Üf¹òuY÷ÊT¬Õ½…•†$ò|þ¶íýxÓžz•|w¡KåÇBïG¾tYï†øŠ"ðɇtµuEâί˛j+ñR endstream endobj 646 0 obj << /Length 1708 /Filter /FlateDecode >> stream xÚíYMoã6½çWèE^¬¹ü¦ˆ¶@·@oEsÛ]Š,'ÂÊ’cIIóïû(ÊŽõa'M´@ö`˜ÉyÙáÌ#Eƒ›€¿]Ðîÿ—Ë‹Ÿ,,±šëàr0£ˆf,ÐÊ.Tp¹ >‡Y•_Uu\/–Š«öiûpµiò:»Š×ë«u¹Kãäöj›¥Iú…*ºøzù{ ‰¤–Œ«:AWWnò·4ÝN‹òoßm7ñûVíOïëáÞ­ ü1×ô²ëø[ú$»J»±ïÐò"5'F«)µúS‡:mÐœTê¾ÌVݘ¦JwN÷þy¢çG'á`þý?RI4‚%gDq/ø‡¬HòfÕéô”ú°-óÇ¢ÜdqNn~ÞBy½ÝWGÂöÞz¸Û~7w)N•Ï»k¬ÖP)ýZwK+ “敖γu®þƒW3\¿ØàùjÖøn%l¾þ7™üX5×ü>–W¯±üóñ®ÿwÀ)|ø$££j¼d¨Tj_˜õb?V‹%×4lª&Îß»6ëÛÔ¿\7ERgeá¥õj»¥DÀ ÔKY€L.Ú©nËÆ­ÒÉÝ¥u³›’ªQ Ý:!ÔˆdB³V^Õ$IZ¹•(ÆÅjB²†)£ÃÄ%{Vß½ìõ‚Ñ0Îòf—’ÅR^¶æÒ*ë€Ø±‚”0ÅöR¾P&& ±ÆìǤ»§áÒï!8‰Pµ{Ñ ™¥áuZ?¤é Óqqp"¬e¿^^Ü]8mhÀN1Æ‚ÁÊÌÉæâóW¬Ð‡h#ÂFÁC;rpË¢•^ü1Áì87^”€?ZÌíÃ$³D3 &ÇÎB³‡y\9Æà%RE³€G‚Hiúà]– N HïÀ‚ ¢å`Õm>œ+!‚Ûgz#0Ýzî\œˆHÄ÷,êG þC»M „"oê90%esõE*K$ŸÅ_gÉÔ EZK4ŸeÕŠr¶À¾~Žq•DY9 ®0DEâeº”T «!sùT£î ôŽ#–kbç"–ŒÑPâ•æoY3–$`'Jh~:b‘Ž±”Y ­ ÆÚ>äù̦`>1 8W’ØÁrOÆ+·œ°YÌŒ J¬ùT¸ ní ôF\!(¡ }÷žÎ§†òéC–ç>P¿PÊwUíL˜”›mS§¾§)²»¦kïÒmWÔ9W„òÁEÁ.­ÒdüªòÄf÷Ø IÃtÁTøWVÕ‰@È}ÿ]ãÙikµoî ñ.‹¯ó´“æÒÛ+¼¸–uíßU©oŽ1&Øç‘Ž¹ ³¢.}§—YïbßÑÒäѤ÷N)蹊·uVÜø-÷t¸ªÊ$‹ë·k®²þž*'I¹[AÖ Uºf¤]sùEXnÒ¸5µ•>Õ´/àD•”ŽÆè”[ÀatÉû0f [eÐrB&D"O§ÌÁÌûçäeíõ¾W¼wæM}W\¸‡Gÿ0íKþˆH+ϺÔÈ‘w$ÕáµÃkj? ³ZÛrðFoÒ¢êbåz0¦ëº6ñ£o\§þ’?sƒS£Ò/ ÐÑÆr½H¿…Z½&dKT 97W{nîò‹ý ÙF8 Ëd¿­ÁIÆÁ` êé¤3 `¯ú -¢™[þ™m²<Þ¹Làd»õNœ"¢Ôù£€Åß\¢ôDúm™\’oœ(™3Çв ŽVØ>äÙ‚)4*ˆa³€ã„:ÒÃnðœmcg…‘•Ž†¨§h¥`Ęh` ¦h´x÷t½t'´³ç—Ì1jD§X‚¥qŒâXN¶óŠ¥D{÷áDiˆ:Íê4Òjþ˜.æ¬ècž§uà øÍÎá Îd|:L¹ãbTʼná|ˆzŠMF˜)ø,À ¦–³>ði: ÊKÙ¸Ž™b@?¬NíÂÆŸò¹/ÍHŠbp›ü¹]ÈNJòC渚{åëûÔÑ•\÷N¢þVžA¹1®»‹7šTùY®»ÎØÿÝdÈ󊢃/«¬> ì¥ÆGºue¤ÅʹèTV4l¿}móîi´¼Kâ®qÝö˜´ìϽj*¿>Õ1D×@4祷ϾoaI&? S[w||:ñ,^¯O| ó׺7Ù}Ú»t~úÎ7úºy“Ö݈×ÜfO~ÚôŠîN;yÿ«qš‘¼¿ÞK»¦:ájò8ùžnÁ6‰pÖ{¹[Žõù“;u ·`K¢¨»™Ð´7yáo±ýÀ; endstream endobj 651 0 obj << /Length 1951 /Filter /FlateDecode >> stream xÚµYKÛ6¾ï¯Ћ\¬¾hQ ’"=(º=%¡µåµ[Ûr,9Ûí¯ï Iy%K~dW=™¢¨ùHÎë›1MšürCãïÏw7oÞ;ž8â4×ÉÝ/~»ÎnÃp¿)—›|ž¶EyëeÓ«Ä6f°-ö~ûæ½´[kKŒäɘƒú%Ló0»]æ0‘åqYæõún`Vƒ·êFÐ=[µ~‘b“„|ÄTúÏv——å²ØŒÆ,…Ð7Ô¥‹å*.ªê”ù´;<:FÊ1s’(ï­‹8Ú¿ªqP!µ?(ÎöÊY/ßz&Ö>ªA9~ØÈm¶«–Óý*Û$Mñ°Ú¥y6]„ëù3ûõÝ3ôí–3×ÜË•ûõW'Ä0³ÖÕîÚˆt¹Á_Á '°{¡ÏÆÙG;‘(ÈÉâÆ+|„sI´å^”‚ÄvÎ1¹?|X%‰ä¬ Û‚¸VD7&än©móDÌ›5‡˜½Îž‚¾ÙˆÓô+ª4šÌ‹ޜ® _ õ­9½Š‹u¶ÜÜâó£É¬VÙëh»Š¶Ç!;0ulϲ4+ËbºÌ*$Iø\øKýIàqš{y#Å}FÊ å*sXP –,$ÄØ×¥[*ˆæ‹Rö\†ghÎlLHÜÚ´!Or´æA@IêÚ¨'m¸x­#ÓDÅúh ,³uœ F…ùŒòôCõ\F‚ ‰ šŽw\€íÜ{ã“6ØŠ4)d ºmW…—5 +=8,­GŒ¦Åm\ƒ›ÜÇõê#yËÍCø¸×ô¸äüìyÓsœpËŠWE á0ðH/Jƒ¨³Ì…s"1.¿Vrˆ{—›°½Mhˆfƒ@ GwmÈ“¶„©VA0 Û¯.`V’Pn…¦^­aP¡`Ò 6b!ü¾â,L B¥ö¢´Ñ§¯‘g@L‡ÀÔ†PÔ~ó„¥0'|¹;¬Ó yÞ†=¡6(áÝ¡Ì𱎮Ža˜kã%$8IÊxxI!UTùYäÊóOœíÈeÁÇc½Ë¶Íd³ÝW¯ÄÀ¿…­ ‹Á¢Œ“íH0Îû½ÂoÈ…Ù¤¡2èQ¿£S!…fD³Êÿn¹™®ö³Ø3ø,ø Ü2YütºÅp±1Ò÷i§Y2ßëøøžIó㈼nô8’ñiAí#ôjA?¡¹4¡y¨Ú>6 äÝFбÀ`fÌ!8ò(öÏÍÁ*Þ+1›Ǫ̈ë*x"H°Q÷oÁ´¡FÚ 8ì\ÓØj…cxºÏ¼GtÖÆ׳ëHß«ÂÇ×Dë ú8%c¬~©ô"ƒô< §Ëm6­y¤„¸©åQ<·–…Ÿýó=ßBÓãb/LÑÃ÷UíÁå"Ûyþ c¨ã€ŸTxjÿ ÷â}4*ç¤l[VÜ3}VíQ@=mó2 [MÓû§^:Ë!¡¹#NÑmä`s«näìò>AÒg°³ÜDZP6£€²«W6¾àj´oF9Éb¸˜.*†×a@-Ÿ®ÚËÅ= 3ƒ`zvtÒër\WG’(*Î÷Ú s7ÄÎ¥P„C ¹FGدrz “N_V’4šP¦Á4η[˜'ø¢ P%†€U4´ä±±pP´jÕÉg§ÙªªÉ)‚­¢(JÙY#apËÆéA`-8(D´l/IŽluÌÈV[˜_¶ÅêiS¬—Y_ÜÕpÏ\^l Û í ¤ ‡qÈžà4ì*} úD]ªK#Ýeu ê¢vL¨.3gÕuõÁ ù0àÿ:9Ÿ«Y‘p ¨¼6ÙŒ¡„ñ£ŽìÛš»¬·ÕÓUŒfšÅÁ}]lìòØ@ÃËЯhØäªÍæúÝ|¿ñµQyU¼ÕBŽ¶ñÇl³÷ã鉿•ofçA‘~ü‚Úâ°k‹¤îçv¯_²ûŽšžã5cNjæÙEŽ¤¯¸‚¦‡]y O&ÿæ»b@^ó8TH+jO¢û—¾†*½‚ Ä;>ga)zöq*”M8ê 0Áý²¸èàŠø6º"ÎÚ ­*BbÈëÜóéô¸çE­7‹ëFYÝØw›qE¨`Ø”ó$Ø Ô¬õ DóÿùKQe endstream endobj 656 0 obj << /Length 818 /Filter /FlateDecode >> stream xÚÍVÝo›0Ï_ai/dj\lÀØÚ4i“ÖI{›–·¶Š\ *_ lÿýÎØ!’.IÛuÈöqw¿ûòm´@6ú6²Íúe:º¼ ,eh:G”øØõ\Ä<SÇCÓ][³Y\&³JÞGã‰G=KŠÍLÎçúü¾7¶G>Œo§ßÑÄ%˜»š‚…×Ó°ˆ× uç™Ò“ÖIw´5j쾂aÙ|•§jðv#v¼oþMK¿ŽñìïÆw)'{1€_¤»\´yÞ®;ÿ(h&\k~gAR‡FïGP|YäÉï,Oc™à姡|<“‡ø±)툴qéÐΉÌc+ŠÍCÑçòÊåŸ0Ž}—ö#3]‚JÇÖ> stream xÚÕUM›0½çWXêªÅÁ6 ­z¨Ô­Ô3=µò“ %Àò±éþûÚ‹I€@JBTi/Ág^Þ¼æ™`Lðmaªço±|p1p¡K1^0²¡E,@‰ ñŠ/?5ߊØ/Ù× ‚‰&¿e{Ÿ…aýýcÆ~™Ý뿽ïÀ°t¬0‚.é l¢—B•Di"qvU\F-´7³ 0œà³ è ó-}œD·ŒQU¶cwCLFÄèç‹ôƒ&½›çQ$,‘S#ˆ’u\ ÷“^fiüš¤»ˆÅpûyœÍˆ°ÏÇô©Ò¶Rq[¡ayéyO©TÙþ9»DáS‰pyù`9­A6¨m wþ!éè&¦ÆuD´?Y΋BÄŠ:¸fêö‘«@šE<¨Ï,Q‡0çM¬*¢dSË­Ê Ó8NuÁo¸ «d]Ê¿ƒãÐ)t\W1·GgCÌZ(è„¡8Žh?ì‹j_'¼AOœgg«‰û ©âø2†RúëßñË^³±èÙ5Oã¡-5Gê«w^+ÎòN÷åxké„ÖŽlÈ9ÝYϼÏ©çßýñÅ– ®*JäÝ®Sm¢¼ðFÝšWÝÍú6ZݯõtÇÔRá6Ò¢’笔þhcÎû"?x^_×Ö)¬P§S{™QR_²úQ)77ÝŸßÉ æÌ;øøĚŴf£î² kY]©¦»öÄ 5àÚMS“rسüæð¼Y&%#¦9gëmRK•Îh L ¹BB:Ž’…®:)_½Å_¨¼ô endstream endobj 664 0 obj << /Length 909 /Filter /FlateDecode >> stream xÚ½V]›8}Ÿ_ÔRM ¶c´U*uªV+µykWÈCœ„0 ÐÙù÷½Æ†‰:›Ù'`Ÿ{||¸×ž³w<çÃgÛw››Õ]è;! ™ÏœÍÎññJF×Ȩ³Ù:_Ý(JÊ4ú!e±XRŸºzTç‰Ê£â!»™}]âvñÏæ@/1F!µÛõò²•YöÍ£Þë] Ö]ƒ]‰ò„=@Í,(Áˆ“`ˆüK%Û6x)óÖŒ'¾üÕÀ,y€g#†y5q²¬N«D3‰†CM{–Ò“Zub™èQà±)ñføíÔQŠøð‚,¯v±cð›ùhÍè½ßÎÚm €AÌãÎÒÇãÀ ¿Jò8­·–Û ·*Tú˜«,):¼—=å’Ÿ§}ÑxâùwÐénáág1gzÑ,}š=»¼$Ù«yæÿ?° {~Zè\r9/ ¥L·ÑäìUälNšî®uÿ@zÚ/Gý%ÜÐÑ…¸Ž#Vw„÷êâQo=Ì"›÷\µX”»r©ûouqe&ªƒÔн¥ì¯)Ž²,A03—ØV˜Åûd¡Yé…Ò~) [€ÝQe½åÜm”‡£œ¹uÆF†å*M•Æ{Hò½õ9A!!Ã[ØÕy\N‰&Sèè‰Ðš¢‚̦SHñã<:pÐ>ù5WòÇï‹H]íðùö¼üV™òœÕ¿Ù×ô/ü…3çW¾¹ÿa¢¾÷Ρ¾³kÖ÷?c¢ô¬òœÊû´¢çua²lÏ%¨žªÿ{ü3iWwðb5Ûý&µXŸ£`m…ň LPÉ<Ïý˜5ä!Ÿz®È·¦ó¹®ôäyrÓÜ8œ;{Ôöpß-¥FáE™£LEÕ$h€ñ(àµÂOƒHô´¦¬‹B«Ò`'¦¸&iåv6ïh‡¸-DTl‹´šˆ•Ào¿+súj_&*H›~ˆÝ‡Cl$¾L²$V‚J™IUϼÄ!ÜE0z8|Îä^L <4ZJÀãîýÂ÷܆`È\‘–Êôz…ë4%„µ°_À†'÷áƒQF‡áM]…t€ReÒÌÄPµ  , {–€ H´Ýûï2®laákøÉGøê±å­±ô“X¤é£ª¼í‰|âL!Eäty³VÂÜ?;@6 ­UOn‡•Í¡ò}ø}Bŵ=#ƒ%ï77¿…^ë endstream endobj 668 0 obj << /Length 2178 /Filter /FlateDecode >> stream xÚ­ÙŽä¶ñ}¿¢ @OàÖ’â!)± $ÀnàÀÀæaÞvº›3CG-u$õ òï®b•Îáìaä‰d±X¬»Š›»Øüýàño×oÞ¾—RnŠ¤°©Ý\ßn¤RIfó5Y’*³¹>n>n}W]ýrý·ïs;GÍ™§@(àÜ^¥fÛ´§²'TÏPwŒ‹#®ïaéœh×4Ç{Ä¥0ùx/ݹKÓðq̶?ùªl Ø7ìï´æ6v±0I‘Ù'wWF.Om"°¾‚*Ýî¯R±½0õû’¹(i}ô|Û\ͺHL¡2Ÿ„T‘»¡QN׺šoèžë¾|¢K@|¾Æu‡Öï}}7ˆÔ»…J´,@÷ôÆ=—myr½kW¥Ä¶¬<©ª-ùÈ>N^˜Ý'!ÒÚ÷¾© úÜ©´"´vWÒlŸ|×Ç>øß—ÖxØñexSÙúr_1ñ²›nCîÅ’m_÷øC©‹ \ ñà»À BK^—í*QùLù6¢üÜô†Ú1’ìܺ/L®vÚèí{6í£<+Ρ$+·:×/YœIÓÅ<²H]Œ|ú8“ÃöÞõÎÕ: \ÖêOÄÂS©<ѹ\*}"•Mò,¡œŽÒ]÷ ­î 3Ù$ä΀AÿHƒdf!RâX9Šý}„¤M”)þ@¤b&Iiäô<Ý;9¢ÐYqY¹sWwïò4˜éRФäT÷±þ…¸ØýHãiøèþgMGóOˆ’¦? Øo¥X4|Ϭ½̳õ°]OÛ[25‰IW‰ìFБ%! ÌIšþ/ší xnš/•ðW-( ”*BÄ  uUɹVÁ 8¹/1©>`|¸ádˆõiËŠ¨}÷ë¥>ôF›U€„©­§ Sl÷Ït–²Lþu%9A=?â´icNž"‘éþÀjÄ{D¢íè= LVlß•àî!í* ÚUz©Ý[Lњ˕Þ:ìµ4ECmM)­<ä a£ëÛRnæõöÜ6¿ºÙ9t£˜€:M p5r¼—B* ™rV§ÐìsvÊ‘«‘]*:™J ȱ éÃ!ˆ¤™ åÈë{÷b‹£®å™aC>Y…÷¿Ò° ·°£@cŠ[ZÖ$¶˜Y6`,Û$¸ÒœóBC`†¨ÿlªçŸý>Ò+©"‘B]¯Ä¸ó^é'Ôœ0,­°4X„ ¾}À˜§Œ’–—l‚mŠÔxº¦M¦ƒYF¤mÇG+_3y0CFèΤ:è-*F¨/§}pY€¼`ï)Ú£‰ÆCFŒ¾0Æ/{ …Gßaõ ö§Y#A֨ϙ;SØÜÊ$OÇ:*¿T²<»^sF.«„]ÚèÄ ³”-Ä;zû<´ahÀ¸´‚ßfi –à­¢yPI¦ÖáY…ÂNMæ<Ö Ì«žüŸ¸–:)ô* ‘¦»°Kë7,Ùd/RÏècwˆ«PiprhªË©IXäÛG°¡ûfb¾‹yƒ¶s½¡“cHævr(e%5¡v•A@­mü˜˜ -ÏGcw³rÃâ\]–<Û¹Ççr:'qœ7½h`-6o›¡ÿ&sÍÜÑ”íL‹ñ’òÐ6q>ÓèìÊuRNLÕäŒès¢Øþ„×h»uäá:h_YÞ=:cº0™üR¾@¾>úd펖à\ê´Nϸ ž±K&ÌàûgÚ}¥¢)e ÍUŸks ´ôrQ˨Rk‘¨b# ç)Pþt;¬_¹ÝØDëâs)/Ÿß½®|áQÌhĤÂ0o!@ÏM}ä¼´óÌôWí!ص'NYÚ&™Ze,,%J«¡#J¹!Ó”³pä·a롧2\7f‡0ã¸È»Jê<É‹ozY¼£HÕ”‘£ñ–Å+ÖåùìÊ–|½’£*»žs^†=øê538¼T÷Þµnþ°à¤F>¶u:'+NTî^æ÷É DƒÜáÚ~Í#š¤-à½/¨…´‹$Õ”•GOz,²5[Våѵ¨­0"J°>~™ÀdÂ$Ò‰eÿôî ¤=ºc¬ã‚Æ-/Fõý:-|« õâWj§ŒdýÏùY|ž(¡¢ì,î€Ü"åú¯ é‡hƒ±£ã"ìˆÆ>„šËPsŒ>CÖq¥•šßŸµ•j¶©nÜ¡YÒùúÙqzìå·þ`uAz¨2ô)‡ CQ[ƒ >b@ü¡Ý[ E\Ї ¦ê‡P*ü¢˜…þ ·ï˜WÄTÐ ±ºˆñOÕ54›š.\Ý6—–1ŽGO#­¹Û‚»Î‡Ü¦¦ç”`¼ôçKOó£?¹™BSe²×¾Ä&=p…Ñ×DF¤+22˜FV 9ŸP³ƒ´ÆÂç—2öód(vvѼEBƒü½úÈ"ÕГSiÍ朡ñê±vèE¾Ù™¼˜~ç Ò}d/¨DÚ¸Ì,¼¡áEN¦™&Ø\=¸=‹UCˈ P§­æ\“±´ü€ÿýš 6W›h^[V½J!¢_ä5˜ŸY O¬«ØÒðø×6ŸKÊCÃœéel‹EÞü°Ço¦üâ+­u%׊۶9 UpRœ^º—Ϲu'Œ þb Rò¥Ÿ8‰L-ÿ þàëCu9:þÎò]õöx÷?ÆTysû7wþÑqõ€ÆÅÅŸxuƒ¢Ý T7GBÀÆ¡b4˜}ˆì,{’›fD<ÜcmGˆŽü ÷pósöuÎN—ª÷+þFØK._å)Â>1øE^g†Xö=* úl›9K`ÍâÄ»ë7¿xöùÌ endstream endobj 677 0 obj << /Length 418 /Filter /FlateDecode >> stream xÚÍ—_OÂ0ÅßùM|#¥-´lÑø`FããÞÔ4slÐddÔoasn¬ƒMÄô‰í®÷ä×Óà °Ü÷PÃçÕÍMLh2€å<¥a B2¦ÀZ€çþ…?]¸ƒ!%´#b» \Ý^­G)4Äš4_̹|Ηâ=_¾½{³cápÙ“•.+5¹ö‚{Ñ:àžðÝDÑNw‚¡1WÅ·Nò™ËÈ««ìrþð4ûÖ7i"EðõNe¨’9…1N¢_!:ë0ε•åÏ35%+kf­Rª=Tp4!ÿ{‡ˆrÇ:÷ªåT‚ IHcr{Ó9¹²§– YÓ*¹Çÿ-¹X«”m=dg÷ð—^ùMC±y·ù[ô”öXÔ4Iq[Æó¥øÔ3é6YŠžÚ~õ™,mÏ„ûLpã™Øž×á4äêÒåfoü õ±GYÔ4›ñ›=Ь ¥ÊÔrYË ÔÜ-—5ó8› §U_Kuƒn¿_v\fuGÅÍ'FùO¡±Y&4 #Sg¬Ò2³z_’!èÒ endstream endobj 682 0 obj << /Length 858 /Filter /FlateDecode >> stream xÚÕW]o›0}ϯ°´—dj\›ÁÚ´‡JÍ´©Ò6-om…˜Ä*˜LÓüûlH ЦY¶iO\üqî¹_'%@àóéçÕ|p9# ؆ æ!ÀS ÚÛšBcbyn‡,‹Ü8ssÎî®7®†nJ½À Ó$v3‘Þ! îç_‰¡cNÀcH¬=_<Æ–a ßKëB™~Â3¡Í•—ê}…†?p5Õê Æ•C:ÀŽrðŽq?ʪ>J—ë$Úò$f^WŸJf¨IÊu ZKö¤oou|»ëšUDß•¿’šË™éìUnl;pjͼÌFØ&ò¶9±‡™²<(#¥‘'$ÿLz5c(VTm0¾Î…2Ã$=m³ I@õ Z±·UÆBCQ&Q5…¿¤Þhº16!1Ífb¾ËlÞ°EG¤12e-Ês=ÃBe¤Å³ÛeB YÕ=™ølì@ìMl¨Î9vƒ²ä:%X¦Û†V±Vœÿ–‹"m‡°Eß8ÐÖU¹¢˜*ª/J´+Æ—jÅ—K¥±ÐGÖ)ã2Ïõ…Ãа‰ 6Ú± ®çƒÇ–«``TÆf!ÉD6ˆnïä¦ll8!Ø”Gc`@âiEàçàG‡Jdñ—P&&Ê©¢™ölR‘ã”™®SҌԗs##…“Ð4– m»%]C]S#´·âŠÄ YD‹í˜Ã¾‘}¹¹Öçôm5;i*OÛ'2ÒŠq@hç§SÈxEÇxSJ_T$'¼‡^Âú­/ð}Ý“±}>K*^Iõ@éúXJLjã|Õ°´güÏÖZèŠ×<«'UTaEÉHòØÔ{aÎýRYjf)"!-íÞµY;_UÓž1aÝ5”gJI©t®ÈߥòÊõ’Øzq${g«’ñGíöhäÚj]y# ŸXõû’„­x¹ƒâ$`wU 1½ÿT´Œ—²$×z¸a)ðÛìÔ–y›Öd'ÔñEYП.u½Úàç“É‚:ãågç\£¾EÚŽ%+—hÈžÏĹû±vq¾þE¦On‹ÿ3Åó,ÿ4óÚÅy™7…øœMÒ@ný%l‰¸#¿IŒ'&4‰n{Ú¸!¿‡™{8Œ endstream endobj 687 0 obj << /Length 1645 /Filter /FlateDecode >> stream xÚÅXYoÛF~÷¯ Ъ°6{mQÀ)ì ©§€ÆHƒ–h‹ˆ®ˆ¤ßY.E‰òŠv¢múÄkw¾ë›âè&ÂÑ«#\__^œqd$•Ñð:"\#Eh$…B”‰h8Ž>ÆÃIÚû<|óâÌÐí¥ 1-@NµfQ˲°ËŽN‡G_|À‰ˆÑ+U ä p4;úøGcøø&ˆÝUKgEF¸›FïþrgkRL–²}¶ëÅj–îx-MCT5Ç›%½>18¾JÝ5ÍŠIºò¨%82œ¯÷½~?x¬Ã ÅCèÄ°FB²¶Ngç¿=zp9F‚³ ¸œ!ÁH·Vv7$’°·6ȱÇdu[L¤rrM‘Öüyã„#-ƒxŠC¼k±ã©ó·§¯N<6£Až²Yw”qÉ‘ “9\*$w3g¯ÍŒA’˸S$ÙŽ¯Þ.¯_úRV"IX—ÕúR+õ AFˆó`>îv  akEu·õˆSVuÑ‚=ýàÁ¤¢ 󘃧àÍ6f‡Ã R¢‰â…NÁO\’Î@§Š#e‚˜Œ*…”ÏòÃpz)BÀ2BÁ¬;8ž~ðQƒ76Kæã^ŸÓëÁqRN‹Ü¾‘q±ð˜SB$â'xƒÄ‚§WÔ<Ëš\HˆAVXélGij‚ ÙQŸq‚(%mŠ8MF0«Àñ4›C À¸‰³¹»B#à>Õ=Œû˜»wËUú czߥc÷íêÁè–ã°Y&›Ó¹§bÔ·´ý‰ ü ¨£ZY‰‚{‡ ç½Îî}¹ Q¡·ÊxŸ)^Ÿ²Ò tõêe«œ÷‘Z»â]¡­—}ÂçiÑa.ôPÇwÜ”åÓ&‡À2 “ÛQk‹e`‚•¯uň ×@7ÊE ×ÚÇCåú2“) ÊZ˜ûÝ׊pßQçËd”æîÞ:u‹¦~éõ¹`1¶‹m81ó8Y`—?Y ÔowÌr$6¥ãJ{¨²IÚ-çl£‘Ú&EŸ>¦åaäÞÒ¼¼îH1¶¡£¾”4~mYFêŠe#€ôfË»Åôa]yDCçOU³®z@®ªIË:À¨šÊm´H=62 í7Ùh”A¼ä5ÒõF“êEj xŸå¬É’éôÁ}ÿZ&ðÜwlL퀣vÒÜIexFãÛq²Ê’«ihŒÄÉr™&+w•wi:wk‹É"OÝûê0Õ«ú…£›=çã§,“U2K rWHp}f¹‚ûT˜øºœŠl1÷q%ƒ¡É"/™QÌ2! OT˜Ö«AðU‰ ª›Í(çˆ`˜+„w÷S (,¶êâh•&¹õŒ5fᬪëíIeØê $d{E¾LGÙ:rì—d¶("x ŽDµÞ 3ï&™­üTQ÷ÀÞØö:¯ø¦áRd6jn+F°„†l}”µÓaéEPŸ¼ØG¶âašî‘º÷ÏK`hh:e k Š!fë{ÔûñŠmTÚÖèûÝ=K–ÁÝ 2ÿwîÚÝî^w Þ^Åä¥ØF¥mžr·Üëîr}î¥'ÇH‚Fæá÷L«4ˆõÎ2L.8±a3¢‘ùƒ³ œò["çGUÄY9-²0uñ¹™´F\瓧Xîþ`ˆØÑŽ¤uý?XêÖhRÿT~Ÿø endstream endobj 691 0 obj << /Length 404 /Filter /FlateDecode >> stream xÚÅW]Oƒ0}߯hâËf\¡eíJ4>˜8ŸySCˆÀlÆG7‡‹ÿ^+u[Bñ (÷ÞÓsÏ¡7Ø`lð4°5×o`Í\ \èRL4%"(™Bìà…àexų÷¤£Ñ˜`2¼ãŸ‰Ä1ü¸½yÏe¡1BÐ%2Ø÷Ë÷þœÉðß'±âÙ:ZU ×ÊJuõËj¯6±·å&²‰ÓVs,´5ÅMuSE.¢Hì#Ëê2ªÂA·[ ±é²Ý§E²æÝpPûIÕ¼&£Qf¦fˆ‰M÷¬ˆžU·KÛãÔ¿^*è.9 ŒY±gÝTÐ!… vEÆóÌ»?´SAera–!’38º´è¦m»ÐY÷´ÄÔ”[„NU¥¦ç¾¸@L;,Ež|gyʃ¤Ã™¹ÜWíÍ' ¦Ì] 3gôIvÔÈü9&(6F(ÖfûÛÀë^å{¦å»:š;òã< ûчص➎À6] táBg¨½(ÔfÔ®°f¦üC0"ÆÊVÈ°´uÞàh Äž endstream endobj 695 0 obj << /Length 2514 /Filter /FlateDecode >> stream xÚÍZmã¶þ¾¿Â@¿x‹[ß_ТÀµÈ ’m(Š\°ÐÙÚ³z²ì³äÛì¿ï IÙ¢-¯½1Sô‹ERŸ!9œyfh:ù4¡“¿ÞÐøüóýÍÛ÷ÒNqšëÉýã„IK ã­ áBMîç“Ÿ¦ïo™š®6·?ß÷ö½ãÃîšpfa,߯jkìsóÍýÍ—­tÂ&Ì2ßG”0âlyóÓÏt2‡—ßM(ÎNž|×å„g”êÉ7ÿÂ¥hVNM*ÜzS5]¹9朙˜sI$Õ#À#°Š¦tX% “*…ý²^ÕÏÍjYuØdÿ §²ß7#[¦¥òÅ3<Ç „PPfî˜0‚0òMØe&) F]TI±ÎÀ>`ÂÁqÊdÁdP~’Üq «cÌäŽ1#~S4ó±n‰Vìå®ÁfP˜µTDwÕ 7ŒhgüPÜž;àÔÂÆ™¸Â:}Œ;‚*`E¤Î‚*a¶pZÔ§1“ÂaUDH¥ˆ¶<¢¡œÇùÞŒÝI#¦Ý¢„·ÓÕ¶[o»P~\m–E,¯Ãs×q : ôT€²ëT雲œ··wÌÑi· Ïex¶e—¾(+xÌ :N ½´ßþøýÈJèGD¢¸¼Ni1: %xï¡ÿþÏÞÝÀCŒÌƒk)1¤¸q®‡$œÝù˜qâ@°—L€Óµœå]pJ|Ù’ åèyT {‡ÚÁþeÌi“½ö k/P.(Zõ¢A–x’9æ )xäÃ9œ´ÈRO²< °ÏhØð¬ùæÑ †Óƒ=Û6Õª9†UÞ dQEȃC=æ øcŠL4&Y§RÌ3ÄAXX~9q¸€7€E¢®tÞ ýP`£.á :nà ê÷oYP=o ê å°ÆŠ,¨ÑX:×1¶b9pÚ,ˆ8s âËdE©P,¶"©ûr²Â§«¦~9Üñ–/ú=É@6žEQ$ƒð‹¥ŠrÊï¡Áµ.˾IE‰E70€=Á ¨øÞJ¦&„!T0µv»^¯6]9)¨~ÛÜÞq)¦³¢-C é>ý¬šO¡V5cÆIP0£êeÊ„‡bìJÑìJî$ áH°%gøì9Pú <>CØsüãMX5O¡±°mÁ„úÒ²x…§[FÁèwX“žc«§ËɧM±,ÛÝÖøeD&–úº†^ŠNçÕ²lZ°cm¨ ”oÚŽŒm )ã8:q2‡*fw7»¢nQ\§@IVH±¾Vs/#´ÔÕ²õ •¨m¡1FÿÑN³ öï[ÆéôÝ߇ê|5Û‚ü]ûTOÿ³mã÷e³Ú~ZìÇŠJN”‘éJ„¥ƒ™{ÏÕq]¶ml‚@a ÔÚílW°—Á¯Ù.Ï×?̱`©ïà˜j$ø]ÕÌêíðWÓ?Â’¾~”,þä§é¢?<@Ÿ‡OÕ×ø ÖzÏë~?hyx.–õCÛ›îaY¬×0ƒTQ?n/Ìp=Âà]ñùäàkøžý!¬èé^%^ÙÌÿ… k×–_¶e3++ùôU‹÷[K÷ëW¯)é²IuÈ‘ÍJO ã½SÀÄîXbM¢›ó­~/Ñà`åãsxY„êÌE,¡}ÅçÉìÓà-;›Ò¥ŒÃœ«0}mJ—Ræ‡2LŸMérèç6à§RXÜÔL§¡‹Ë‚éœOm&¨~ßF×D*›VM>–ÂF›4¢z„/ç[îpÛ$;P÷ñ° ØUFµ>wMX¦€÷Hí‡2šÑæ(áJgv‚p©Ràqmá@% ¸¿ ¨œb”HQOh P'¢¨È‹©hIa£Q—høö 'mØô]ƒtè¹[xVq^Ü'4O&ä@ýÊþí&´±È"ñ‘ò)ñÄAÊ š7v¯¬WQDS'd†HCå3ÒÎÒKïûÏúîý ñƒ UJÞ&ƒ•u ²ð!°«Ü-¬Rnz¿(ê'ñ¸mf]ŒºR‡Š3÷¢¾·jôÊ[QG”s0’$V±³·¢˜„wp9ÇD©MqOœ1 39@•$@®SPtëcq¹$\»~–ïã2~!tÔ7Ýﻆ·àâ‹z«Õcx>Åz±‰…Ùv³í©ŸCuÏÆ}¯¨÷pÀ-=Ðû†rA…ÖÊG^BÅ^7þÕ/Ýqgh`^8|ñ»{áðÅ 6ÀæðÌ ûø8BÐq0¶?ø*b=P BîÆNF@gЃt|7 4VM|Þ wfú·² QôˆËÕ†Ž˜gôÍýmÇ Ä0jªºªØ}” ›Ã$ñ;HG+ #O8EðµÌª,NQXŸÉ¿Ð)fîâøŒS¼u燨çœbØÞ)a_ P–hËÎ]Y k^¦ÙŒƒkµ9äÇ4æB-^§ò+M¨Ð—h‰0Ü\Ý–%åEZâï¤\åD‚7e)ì+¨wzúM”'ät˜%B€®3¼HƒÔÆKæžCÄ;è‘ëèEqËiô[¡¥Ù œP»^5son}Ój$ùŒìÑgTS•\ú+S.®ÛRP$ˆ8p$8Ógn9Ø&.2ÀbÆ!ÔÂŽ«/f¼`90Á;˜² —bˆª#ùºQCÙ™ò´uC^ËëRÅêˆM}tÕ#¶íÂS>;ø0ŒOðï>úX¢(üઠWý&äË‹˜@ï6»dú”Šî³òÑoã¡aÉ¡¡„ñÝuÒ0{£×,ÎìŒo3ùU¼ë˜Õ%ðØùEyû; ‘riªñuéÐÇVó“ ™ÐÚßhtîrðfuöòžÔívBoß”kpp6Aðý¬ˆü—>W»¢j|šjójSÎB\ÆðÞ$ŒE£Â`!Õ´cÑilßFxZTýKQc(.ÁžÛÒôW7ýÆÖ»K›eÑe¼i×DK×1'’â³E1Ü~ÿéC·z€u¾`÷?—åz¿ûþã8˜/ïöÿh^ûŒýPEGæòµ¨ÝLàÃÁ<ÆÄýŠ×g¾ÿ×ýMÂë@–Ûº« ^µd»â Ë¯Çkvpx€1k‘K·æahC“/ÀUü“Ì__ endstream endobj 699 0 obj << /Length 737 /Filter /FlateDecode >> stream xÚµVM›0½ï¯@êªâ`ƒùP«*íVꩇôÔ­!&±–`fWûï;Ɔd²]’íÉÆž÷üf†Û³6–g}¿ñΌߖ7‹»„X JBZËÂÂE!ÆVH#D|j-×Öoû¯ò²[3Ç¥„Ú_x[.Z&Ñö«ógùˆ\ŒQBqšÂ~ºáÆ<ßfž}TL¥H[ÙÜ{Ôë ŒâÀŸby`¬ÖX5D04þ¬à'NYî@H0Â1>ëCWqQ¥ž„oòd„_êÏH`H»÷qk—Õ—¥€—ºPC³7û@þ‘š‹=á×¥fïU7Ç­ó©ÉŠâ²mו’§¿8A!…ÙèÏ^þì×O׈:ä]gï¤ëê2wgEÎIç{„ð”i¨ÃÃH.îâÐÒTDuy7öQK.‰‘zŒ„©ãbÏó쟃c[Ô¬‘œµ#Çþ¢Pÿo $û«ÊšgÇ%t 9ÖÉâ.|q×(‰‚<÷ŽŽ A|™ïÃFo|»«%¯XÛŽEQ”øzs¹…ÐãÄ· Q–Â<ñj£–»èª\BÄZý)Y+µíÓ–É-kÌòÀ°á þè`j³JïõM[í cÜ°2S”z5•ÌøÀŸU ú¬·x%™úÜÀ1­`Ð"Çõq¤} ”Ø÷„øu Œ0 Ô’r@SÖð ̵ÑZè±R›@ Ñìôê(B}äbWw²Ü~ÒÆ+‡xvg-ßÕå`»eùÔT^è„K­Ò;Ž“Zêã¤&*NjÜÇI}ñVYÙ°lm~ ‡J§ËØH¡Ç•9…AÖŸÚh²½gÆÆL‘‡#êf%D¹¯¢UÖò¼¿Êû(C¥ý1Óåž/Ç‘ÈTáêðJŸîg¯©y]ýÏ:ÞÙO¶9žqÂÑõzʽ½]ìÜ«ï·yÉVO•+C= )?|²ÌWs¬ã\G†ÛaB¡ÂǦGøävyó|–…ú endstream endobj 703 0 obj << /Length 481 /Filter /FlateDecode >> stream xÚÅVMo‚@½û+6éE›°² ¬lÚô`R›öZzª AÝÚmq1å#é¿ïò!U¨Ä‹2oÞ¼yà‚5PÁÃ@Í®Sk0žQ (¤`½¬c¨ˆ1X3€µ¯CÛæ¾k1¶)6†ñÝÂñùÒÞ8ÙO× yœ«º½YO@Ñ4u (Ajd0I˜ç¹ˆŒ±·®Ã…L`³Í6ø‘j‚pà‚AWåÔ-2¨§°CÁ=±—a¿8R_\‘Ë ò.Žg¤ÜB…j ¬CŠ3ô¹Š&‚t³$Oš&ÿH~|$ÓE#d Ù·ï¸<ø© óìÊÂTé¤N—Ô9> b]d…‘LÁZK“£ìü'­ÛŸ›ø4•¾G!Ö#…ÎT =ŽÈAcg‡çå´[K¦iåÖg.Ö.S¢Ø²Ž²•`¾ßÕ®W\,ÝpÅÒ ne=c©$ü¸k6ó™«ý„Rà‰ºwÊá>íŽ&S\ÏNjܘ]Åî)G;J$»Œç+~kÀ‡ô¼ö(t°w‹Öåo÷Æ ¬¬”ÿ5𠫥˰>ŠO¶ ÒõrÖ­RñO³Dì2Ÿ'Ò÷fãÂgPâ¨AÚ3êK›eÊëÍ $O‰)á)4M3˜àÊC÷Öàï3Õ endstream endobj 708 0 obj << /Length 1162 /Filter /FlateDecode >> stream xÚ½WIoã6¾çWèEÆ ­hÑC—)Úô@}k A‘h›™rEÉ™ù÷ó¸X‹-'Nšé‰ßö½…OØÛxØûå_XXÝܽO©—¢4¢‘·Z{c’Ä‹ÂQz«Òû˪ÊêºZ,CšÝ.ßgBeâ^´âÀïqˆ¯~ó‚’€yKBP:ö,Ó,9ßOØÍ-PÀM¾5ìË9þsõµüïFôbœ)ÝØ–¤»÷Ñ¡eÊPDRoIJ ±Òï1‰O˜‚dÄcðÁ\þ£V¢Í†q£+FÙØ“ 8ñòÅàõâ ßÍiç²Û l¥Øeíç½³]Sï,ÙI%6’—v·¯Õ¥¬ˆ®Aï¸øF΂('¨ÿÅËðZ/ß0¤“¢ü:^žÔÅ2bJ¢i1ýº^,Æ~»å–0èk¢nKš¦~ëÜT=}XÐ?ˆºSÕg{T ®ÜGw)·Ëvú`gˆI'ýqËnåö7b†´\ܲe{ŠË6u44jôr1ýd¸K{pÐòòªÓé=h’–jxÛ5òxš·'÷h'ØÿšG¡ø9Ó‡üzºa™æ³$°Òðýê϶%q·"CóQmÞNŠÉ¤NÕ(;žU®”ÎܯP–B¶}ºä|º¤nwuÙUõ¬°g8?×底øã–u©/Öz%6õAŸÊîëµ]Ýrš¤ú›DC¶šmÞ8þo§ 6rj÷Í.')Kýö»Åe‹ëĪÞé;I¨ÑæZĆ7ö`œÆ|Ð¥­ÏU­ë |ˆöœø¼çDã(êyÛBŸWvSKÛìbÛÚ"_ ¹©œ¬q»a”¸vc.[ÀϽ¢†þÐcŠgüHMâã…yh@‚ÃàšËñI€ §ña‘‹ÓøÀÁ8>,ž7"‰L°øåaaØe(‹Æ•¤·µ©G dÝZ†ÅÒ&*æ5'QŒÒ$™"ajõ¡Òô¤Ì˜ÃÛPc÷}Q]äÒŽk]wG¾ãËž5MÍpï<'3ØÄ(é“¡&ј^U‚„MB<#+B)ŽŸ³‡½&õ®ÿSOhHPGî ^ñ†þÄ÷\–\¼ï !Jûqµ€~ CË¿p/0˜èW_oÒc>&~ÉUш}ë22±ï¬¹]ÌK¸¤MIæZc×u'‹á´4v)«£¿*yÏ3ó îêÆ!g/ÐhLRäc‰u]A‚ÀýGÈ~wälqÓKkìÒûâ%zÑà bfÍüFÈ¢êJ÷Võ]ªÚŠµEÛï/þ)M~5–LÈC]¸ÒËzñ¬2róÂpðv£öZ4ªý"Ïlëðçñ |ZWãfõ¨7 Û¥¢!#S* (îi¤ÇlÂòóêæ Ùÿ~Ï endstream endobj 712 0 obj << /Length 604 /Filter /FlateDecode >> stream xÚÕVK›0¾çW õÕƨU•º•zmnm…H0‰µÆfcH”ß;<6¤JºiÅžfX¿–ß ðÔqPèigÂˬuKhÇœ(K¥=(µä’n8IÔ*¥;Y ~á?mÏùP'šº Üy?]]›¬M …E”ïÛYå—Á‚Ô‚i° eøg€š±œd‹{(´ç*ÿ;Ê׬LtÆPÄ,‹s´ý4Ôýóv¨ÁÇyS.B¾Lˆs"¨}ø#!À Ö!H-˜Ë!@É©àÑ-4h<^Iƒ&Žî\yFƒñv-NÓ«û{¯#lÔ­m€Dc9ùaÓMÓWA4ÞüÐ Û? +YA‰ÓÜ#½òê:ï2ân¨ê<~+G<ìÈEFcvõIn}^ÙºN$ݹçÿ|7ÎÝ óº›sä~¿kßiFY¼cGË÷Lˆ‡×,¶/|3Œ b(ßT¦…™–|]À¥/Õrs¥¬ˆ’¥¬ê¨´Bè-[²~Rñ[±wÊ+±¡U‚½åxÐe‚>:Z2ÃφViÉ-×wl›0«:JÒ|©%TÖ£Zh8u °Z–y~2­DÉ4È»¯å ñEÂsò%ûü?½V+lcÅü1¥FuI7óoàA{âåBþÕ#¼ «n÷xauÞ;@^€p€aà! ‚@%[¸=/ËÉoŸÔª endstream endobj 716 0 obj << /Length 835 /Filter /FlateDecode >> stream xÚÅWKÓ0¾ï¯ˆÄ%E[¯“æ ˆ‹Ä •8°(r[·6µ£<¶âß3öØiÓ†>–.ë‰=of>»ÔY9ÔùtCÍúazsw$NJÒÈœéÒñ„DqèDaLüIèLÎw÷‹løhìû¡Û¬Yc%^ëÍÈ]¶bÞäRÔxRñ¦­„ѪZcÉGðçiädÎò%šƒ§Ê(åÆÃe&[±@QŠN7ù†‹:—¢;ÿ1ý I=¤¡.EñÎãØ­åFÆ‘+—¸ƒž@˜±:Ÿ-ÞÔø»»Oýýâø>‰ý¢hï J$QêY2ORêNG u%™¯ùüE]‚³‚ʬk6ò©©î0T³õ€¥¬ÌQQç¥J1ö& ü~Al®!µ¹‚”‹\CJ¢àšLoÑY«YÖ„¥, ©º¿ÍÅÊlí1F¨ÎDÅè¸i×\c? A’à%ûU.æE»€€!Äy—×Å@&ë÷C¤€Ól&eÊê t3àS¶fuVÈ-¯2]éRí ðHLŒ—½d™²|ä¼ìùÁ× ÝÅæ¢ÝìôUÌægi`+éŘ½|_¥¬Š÷ÛÚsQJmYžN)ü¯)íu:êu:ÈKM§SŒö@½øÀ¨ÇI&Kɯ%›ósHbêáAw|ö:‚¸]s5Œðƒu×Ä´îí—¬bÞXí…Ü°\ßkeÿæŽÛæìS|¸Åyi ªšôlÿv,:{%Z`C\Å·AÐîC¸¬ëÉ3ºþ­be©FÍ~ã}Óx=”ïh(ý¡– îxع»µf—õì…ÕœQw•÷Ÿ;8SåÓãW•ÀxÐÜu=Ìa£â5¨Á‡ˆT1±âƒŒÜª¼ÕÓjàI‘çòmh¤ª„/ªJ[±gkúqýìÁ#{•ü»)Æ€wóß@9Sݽ¿„ä¨Ë;h/øVj ÛÁp:‹/eçÅd2ëM§+Þ¸—ÀãjѳuÚ°òâ:îKÜð ]ÍâÏ)7Œáùt{bÅåel‹&ÏÀâ%ò°¾l6OC¯Qïaÿ†ü~Cû)I“Qö,>No~Z«§J endstream endobj 588 0 obj << /Type /ObjStm /N 100 /First 886 /Length 1404 /Filter /FlateDecode >> stream xÚÕYMo7 ½Ï¯Ð±íaF%RŒù¨Ó-Ä>´5|pœE4Ø Ök ý÷}œµQïÊFƲcc|±4CIÔ{w”2;ïRñŽRq)4¢\$<ÏÅÅd}qâÍ.;) ÿ“S.㳬ÿƒ+¢]*Å‘'ƒäˆÔ£ÁŽBNh¨£0Þg4ÆA‹’:ÁJ$ÂhGš2æÇ«ìÍæ¨&,ÅlØ‚‘!$¬E x$T\—äB fœÑ,`£ðV‚ aÆx2—N0£±öŽ=v+LhØVƒ:¦ˆy˜‡l6É1g³ ŽÇµ6Iàð`IŠÅ1Öê$bž°(¦à‚HÄãZ1¹è²DÒÆèbÀÊ’¼‹,X"„hƉÁ€”8Ò‘;I.Ål0\Í1ø3Ü ˆEà|JÞ3@ „Ä ¡ Žö4.%Á%øÓ °JøèÁ\˜Æ¥@YIWL£†)%<Ár)«=1`K¢FPÄþÔxÉÒI6ˆ<ÞgÛˆGϦÀÑ0ˆà‹dsÛxË® OL9 ïd|m¼heÛsê9v朒ñ•jFh0±€D Ü¨×Y˜m²íCj“¢h`Ç ¹i†_ ]RéÔ:”)´›=¶­c&Á¤ØH«Bì™± ….s4cLšc}rÙD®Pj†ÏhD„Käîà sÃëÕçÕúèËÙùÂY ¾wû³Íf±^º°íþüuóöhs¶Y8tÃáj¹qn8 Œ-v‡ òÛ0dºî9ãwÛ)£l§zñ¢Þ­WçG‹;ÁÂoÝp¼øºq§^Á½áøß/ óèïEO—›Års¸‡wÃûÅÅêr}¾¸SÄøè÷ÅÇOg¯V_݉Ç e-áËœ­1Cyk÷r¹\aª“1Ù˜/{KŽï»áèòÃfìÿöiùO7¼Z­?.ÖãÔt:ü2ü:¼>1_ü©9sŽ]pÑÞøIê{1ÄÞrMÊÔ³ÂìåˆÜ‘Þ®ŽWnxã~¸ÀÀO«åO=¥ ’+?Þ¸Kˆ#hüù—#½Ž¤§¼//?¾öù,îwƒž}âþ'»™8­ˆC0݇¸›àÈó‚óp<Ä×B.¥;Ÿ»CISú†Œš‘’}¤,§µ…¼UòT¸VpéR}}äXŠ¥Çés{Ì_~¸ ûžúØÞ‹|«\¦y‹-¶æ„Bß-nÊà®dßJ6QMvsXŸŽä®íI”<=¡x’ÚAòá'¥P6Ô6ô¸aÃ8)QS¢jí=¶J‚“ÒúŠˆð:%lHöÆÒóæÀGð5eyeB%þòÌgÂÃ%R…GàV%´B <=¸vm·ÁEŠŸ(¬fùKOê“\¤I½’Z#)Rz¦&'Ÿ{äµiƹ·;…IÆ!H¯øýðˆ„‘‹×_ÚvI¼ûûÈnÕÆv©ð ®µúŒj“¸Ö²ÏµÊG®«¶ì[!È4]W æÒÛ•ÝS'Žfðjýäfýägø GpµâQß'ÉÄû¤[ð(~ŽñTê¯,…›!ˆó—DýÉ¥h3÷øäRnùäÂ’P˜L5ŽÒ}¿*æî›Ý‡ËP=ïî×wd߀]·· 7б«ô§ŽÄGÇ#×xH3:{<¨:ö•|+D3ÌÔZ_éèÄ+Û HÏ›©'ß—üö6Ht endstream endobj 720 0 obj << /Length 1032 /Filter /FlateDecode >> stream xÚÍXKÛ6¾ûWèÅ.b.ßÑ¢‡Ý¢=µˆÑK²Ì] ‘%UÝ6¿¾#’òJkÙûˆÒöä!EÎ7ä÷Í4nü¼Àg~Ü,®®5 4Ò’Ê`sPŒ‘ a …B”‰`³ Þ/¿Ió$kwfµT,¿Oëì*¾¹AûV7¿‚£5!H ?¾FÛ¢ÈÜà®uh³&`FTÅù­‰Ò:º¯â²LóÛX`ë„r6öEÝìOÆ”¾\×·‡\ï¬õ”“sá”÷³FäÜõA•g£’—£jó´ÈçŽmè´°„xuÍÃÖ!C2”Ášr¤™vÞ7{`Ÿ’p™æeÛt¦Z6…›=ÀˆR¢è×ÙYü´Yü¹ ЋP*Ñ$#%yï?â`AMˆé0¸·CE:Ô`eÁ»ÅïSr¥!"J[WBú¨Ë81°ÖCõ,°²d›Ö˜2DZÉY0 X#Ì^4rŽ0éy¨÷E›ímÛÕš,§°§Õí™í+n\WìšµiÞ€Eùò~Ÿf~x³›ãèS¬ lÐi"žîQÀ ì‹à! ±þ’ý! 8̺’ä²0G Ó9P)VHvZ îŠCœæ°L#©È,°œ")G¨“ò ©N§3 {¦F—ÔÀLöò‹óÝ„JˆDTé‹¥‚1*žeË“ÏÑ“)®gA”6!¡Úš>ª)âá,D1-WOkƒc‰œð3@r¬‘ üuÚð¥É•Ts$B1.Û®æìk}­ÓÖ*øÝOe²¸ÃÙåö·œ«k9*N`²®8A6bñõhÎ(d7ÅGüKÞ˜*3‡ù[UìÚ¤Í~ð2Þ'lS†¤Ò™›À6®Ó$:Äe”Äyô9-_|ì=øÓ~ æ˯Iã&¯G„!ÀãëÄhÕ¡ƒ{»7ɧ՚)§Šf+×°wFéwÔ²ÜuúÂjí®¤XÃe”5ûqÞ ]Þ¦+ˆînEÄÒøy½D\ 茭™ºË&Ån;f÷ÆQ"ƒ¼yŒºkl‹fï¬>B«É.B«J¡í«¼‘›üŽU[?_¶ü²}ÛVÕß>#_¤ÔðyJM:ÿÿ­V!|µžð~¬HCÚû’tüØÅcWÙaŽ÷²ªGEÌVÎÇÚ@/bmpqŠµ6ÿð6bæ`õü™Ä Róßàmî”~Wš$í¢?V„@]ÌZS¿6Å¿ð¡ß=ZṚÔÍ9&^ `=ÈåIÏþE|Ùùè…[ÞfÉòG§I×eºÆ_eeêúœ,(ìMœ7¯ÎàyHÉãük‘’ßÙ9Bœ–y¾ŒŒ9{øOâœüEˆhHƒ5#HÕTr4n¹ÿµgà† endstream endobj 725 0 obj << /Length 860 /Filter /FlateDecode >> stream xÚµVKs›0¾çW0Ó tŠŒxYL;=¤“t¦‡L¾5FvD¬ ‡G\÷×w…„y'ÁINˆÕî§ïÛ]-8Æ­áßÏœ#ÏóÅÙì2rE¡‹Äp˜a0G®‹ã—ù‹UZÝ0ËÜÀü‹t¶ÍÒ½È6œ¦hýÕú½øx6Æ( t 8ÅË,KUŒ|»ocâ$Kob^Ä‚Šk'pj#â{}”8–‘wŒmã¨r Xø³›]ú¤£Ê& IhØ.`;Xa[³Õe»cîÖ¬\³\½ÀJ-n¹ÀL&”‰É—¿ÛœÏ´zï¾¢©†ÈÔ3Ó\X¾H.˜R¨ƒ®è’„•fP—&9RÀÑ¢Ð$V# HÎAÐ|ÒS+Ïk”]ÈVãåþPê¹sOí-T#.DšÉÞqq+MÄL*±*!…òX5uˆºuˆÌrgaHŠÉ–تÔ9“id¢ÔŽê,bt£O-Xù V!ß”Úc£¡TUð"u?¼–²lÏ k ªºI#Âó&uëŽ4€KPà’ÆëAʧ9§¢ Ou™áÌœ•U®y”yÅ”•'Ú²Ö†V>XiÎ4L¯m¤FP‘TãÕ ªÕù Ž–ÊÈ ™*/¬Ý¯f暺Wû-EÏLdIhZ0åÃú£I‚%ê©t»Ì½†yg[2ÒÇ/å`ªÊÖ¡æ2R¹Oõ„úöØÊ›¬*/Z2¸Û~r4-‰—•?•±‰£±™0#ÃóÅŸª%-ø*†ˆvDÖÓ}òŒ<éI¹„%þ46¡_í&­a±xJÌ{ÊÞ[ÆT£¥0© ½°Óˆw)¿”ÙIªZz®MË÷™›²¡Û‰7"^Û\Ñ´,§6W?zz†ÆNjÏh öПh¡^ìiô^Ùûcì‰aoÑ\•€ï|> stream xÚÅV[Oƒ0}߯hâËf¤£å2ˆÆ£3ñ™7gH7@«å²0²øïíÆu\ ŒOè9=çû¥2x2xžÉ×k¶\›˜ÐÔ±,`Y†2€®­ V4`9àu~EƒKw!iX›ßј-“€†í“~Ü/Þ¬N'!M-ƒð9ö6 Y 9ݛƶ»OÛÈš|ƪªrI`Û'ЗëF-é£ë„ÑMÛò}јk@·'†Fm€”ËÂ*TTµ³Äózϵ#Fh0¼œ"3ÀGýÝ_ÀJÛ¥Ëß…û ;ÐÞòõnQ¦Ærц7§hDÊ’ ‰ŽB>šØA.&ëJ•+Wå!?-ø¡1›¦?U®<.ÍZ?ÒÓÈïæÿݤ»è4ªr囲ˆ§vüO“}OMÆBŸ?Ä`ÍÐ$NÙÁ&cž­D<œ4Sü££}¡O <¯p5û> stream xÚÍU]OÂ0}çW4ñŒ+ýX;&bâ«{³ð1µ:7â¶ÿoÙÆF¡|t€áiepNϹçr/§ªž~§?(8áÀÄ%r 8ó ¡ ø3ðÚ ™FÁwÎ{#¬»ø4§r¤aV¾ºž¨#¾é½ùÏŠÙÁ f‰&#ÄðmÁà¸\ªó¸$‰ æÑXÆê†`&Ó¯DÆ™bA‰‰Ã¤¥QaeAƒmÕÎwi_S}¨¸VÆ…uúËg#™0(-¯d<òYXRÜ)ÂþÏx?ïMÚôW&¬GeS³,ûDm»LGÛw™Áƒé²æšFã¡65ì)’Êc™Ä‹88¯±?/¾ÝHÍRÙÉ­þR&ôéªaÓ½5â¨î­Y–~¬º×„6T£?ä«Ür,ôšŒöÖ@î`¤N”ª/Š¿ä‹il¬øÚ²¨ËO¡À»AÕXiÁmÝV—²l4ÿ4®mõe¿rší,tË]ÈÏ&]›=-•Ÿsò´ó±?~Ùv´Þ2–KXàºS,Ûæ"Fb€C)xÕ0õ„yô;þ³=º endstream endobj 739 0 obj << /Length 1298 /Filter /FlateDecode >> stream xÚÍWߣ6~Ï_ÔR-^lc~¨Uzº­Ô—ªjÞnOo‚Ž@Šá¶Û¿¾c8auÙžNº'Æc{<þ<óÍz{/ô~[…öûëfuÿ1/#YÌboó䱈S/ a\x›Òûào·•ª·Ÿ¤<­Á„¯G»\UÅö˜[Õ;éÝúãæw°PJ2ñÆÝì1ô'c!ˆ(I#îÚ1ûÚ¶ž­À&°½UÃNÉv‡fóÒÞ%æÓß亳íUŸã/ùÜwUÑ—®¿ ÷ÐTmó• O6¬#Û.°´ûíOàÞã«â[^çþ!JÏ23H9‰ÓØ #"ËÐ껃,>­&Bÿù ûƒìp aÈ:Õã ïÖ4õ÷ÃQ6VS);3®!¢½@"ƒrûta^É¢mÊkëD_`¢™û‡øœc¹7#QHñ"!M.ö8·Ç-!.þ£+á¢#È‚ÄIŠï?¯©ðe÷%™_´ÇSÞUªmpü44E_£NöC×h’ÔºFjûµðó¾ZÛ Aœü¬y=Øaõ„_„kmÐÅZ¯W£WMàDˆ TUÁ­$€É“ÈWǼ®õkêAÈ›Q’vÞ·¢PhçµîÔªÊõZkϼÖCíµciòZ\¯Íz…ß+¯Å¥×÷÷Ì{ãu¶«ýWv-Jæðh<ýóšBXᎀàË«¦WÖB'ç™ós¦ý*?J\»{™§ÜtB‚µè*pbÁÔ9úœª8Ò‹D¡1øCÕõPJLÝŸ!ïgÿÉá—%'* ê˜üóêí©†Ï¶8žÞÌ?³K!Åíìs½÷î™Ø<øyZÁµÌ”|j»¢íPPm×WÍp ¦<&œŠ1ÅÁAó0ï7«¿W´¡G=W‚ ò8ã$‹ãêÃÇÐ+anLx–zÏféÑc$K3jï¯ÕŸ }§aqjL%Q6É„È5£p¢ E Ü U6È„Üo '±”'Ù”„…Mq°0!i_E†ìš\ÃÅÀL§N*HÁÜ ¤^˜C¶¡jNCoÜG7@;º |PéÿÇBi×èeJ\ZVöE¨Ó &„§Ñxc`h¾ É’d\jØ)€¿ZïÛÙu„@pÓd:œE¥¦åJ G-Fƒá +]aEbånÑX¡|ȭд= Ðë^–:øï´&ówkúC¿”IÇüÅ2ˆÙe뢋(hM’AŒþ@Á¢5¯à–jªÆ×yg„EYtq‚®˜°Ç®¹‰ÊÆÑ7£@ ¿m«~Û@G¤ Æ2Æß1r.΂˜s¨™¦lƒz'QœX¢Fç„ÖhBD[ý¸©úvªv‹:ÌUÖ0Bm ¡^Ü:7Œò”’,ðÎ9Œeãa éHGd@[Og²ÔdŒË¼«+Ùá겂VÁƤk¢wírmêÜPŽs‹ÃtS$—((£„:/> stream xÚµWKoã6¾ûWèÅ.j†oQhÑC‹¦è^ºEÝÓfa(««W%9ÙüûEJ–9‰ïÉCŠœùæùÑØ»ó°÷û»ß_6‹«k®¼’Jo³óˆPHú“ÂG” o{Ÿ–›}R¯ÖÔ–»C5I‘ÛU·{¨õîºEe…º¨š$¿[}Þ|¸ºèÐó‘R ´Ú“:5‡¿mÿ-ìbxŒP¤¸ßâà€#ÊŸ>c/†<ŒX ¼‡öhæQ¨¤Ôû{ñ—uidŽ“c—jÝXdï‘ H¬F«5 |p_[—Š*ÖλX—:ÿ]<šî`’7ºÊÃÖ/oM|ðEP „Pé²ÒµÎ›ÐÅ“²e±³¿VI^š&†9æ`˜åËŒé×K»3fqßqâRAS³¤Açñ &l&,¾êÎè @[•Q˜¦µƒ\L ÷•Ò†€(+ìCpƒëú™2Y3!ím#ôlWÓX™=+&ÄðŠ‰••÷¡ò¢±B´ó;ƒIòì(º¼]Q¼<¸ÏYøØÅc„ö8$ð4¢°3Qè&È[ ú¼¬ÕÝLÉQ>iŸg+µ †'Ý?Ѻ&z@’(ƒcöêwI¥‡‚ ¨XþÖ®ÂÝíž‹Wb1çàض|ØÂÉm™†I¾²Ò¤{»5_¾h]NÏÙõ÷eù1š9þgcõ¯¸MM†œ ÈZ1$•;׶óå¨Z'a‘c$g‡e)FÊçïV”qD8oUIPÕ-flr(¦±ÉUëâȦ êS£’#ˆê%lJ¨5Lü4¥2c5àÈEÌÀ0‡Ff¡6ç:(âé›4 s[)·®b€ób+™Ñg~ áÍÔLŒ?[?Ü0”¼ˆƒ­þËõÃ)\"©YÎàæ³õót,AøU*Õv¡e‰# ¦FMß³qlGìT7BÝTIÔ¤fE“ æ:n w„I–Ñ¡êH‹ õ™ŒÕö®6“÷«¡™nøÂ÷fv—rk0ä+n5G‘Úy=7 uX¥É‘(2†ú­†W’£•f_Ô½:˜3Ò~HÃæ©Rd µh;ï(‡¤˜aÍÍ©EEL¹‚Iáù'«G«ëÏRW-·Ö#¢¸º–£wh„ô® —«žßüÉ•Q¾AbýCï×"+S™L¼‚Ž: ðKÔî’{}$ó’³Óß­¶QoÇPÎ lÒ„_f•ÔS‰·>} & ËX½FžsTRæTvÖ Æ;+?¸ª³oWqij5ót¨Ë0ÒÓǃ|&¹æü0½f½­ô½x~vÚZùiP»ßcÊÛ÷=éÄç nÃ:‰&UÒï½Ù¯©ÖÛa½¼§xß è…Ê=äÓ/ÎC³i;êg¼éï |ê÷ÞìÙTëá¼Ö¸yVk~¬ŠuÿBý–Í(ÎmƸÈàÕvöp;Ý‹¯/ØÓÁüg»àlx/ž2¬Â¬þÃjú¯R!ª¨yF!¥\ÚÝ€'àÿ^ؤS endstream endobj 747 0 obj << /Length 669 /Filter /FlateDecode >> stream xÚÕWËŽ›0Ýç+,u“©Ç6±1jÕE¥N¥îª²›Ž&CË# Ðjþ¾7@xÅ$¡ÒtÇpνç>ì A[DÐçøýh-Vw&C&6ÈzDŒÌ©D‚˜éYº_¾ b7Ì=ÿFãŒ/ßi¸ × ítç¸>~úpó`}BRlò dÛðž½ ~W°Ã¿ªÜ|ÛÛµ½$r‚ø;á¤à\S,׺Š8s~ž%S ¡ï m˜f¬{'Þúóºw’•Æ_ƱIôÁ$¤~6"ø' \0-iõž½Û'?|7³“s>}P€®> ^|/µ¢1í¶T¢öju·–­q[“:RtSm=ãdù˜Çnd%°3§sÀ&D©@€Ù¢”>Y‹_ »QĘĦŌKäF‹û‚> stream xÚµWM›0½çWXê%©¯?°±Õª‡JÝJ{«šÛv…PB²´`Øí¿ï€I I¶„œ0`¿÷<ÌŒ­A?F¤¾~›îî5CkÉ$š-sæ’")\̸@³z¦ˆ'SÁÄ8Ì"oÆ^þ–öI9úd‡…É• ön®³¼óùMý½Œ(<%ˆ"Æ– X¡hŸZÀËD0× mª©1bX«,B¿F?»žS,9­ $@U¤Õ>;h…Â\ÑAh%ÅÜm³–q=æt],…„SˆÚiºNþóü˜˜S+¡† æŒ@~'EÞ‘5TaªèöãÏ}cÓ%1Ñ›mõÚÇE=¨Ú@ë W;!î@Дr…­s“Y²¡™GÅ¢N÷/xwþr‰Ÿ¿V%B.WÌnÔÜyµØºxP;=ûÕF=Uºñâ"ÊÃPkWbWl­©Ãm C@ûW[Ê<×iåYQ 9›~¡=´^ÏàF±²˜ïˆØiMŒ:NýAOÎë>ic{H /ðêO|Œ´¡öTq[º!}Œ´Í‡~ñî¬ëþͦU×ÿoQ¸fg-Š„Óƒž·(à+׃^a‹¯²(v$¯ ¤®O«*þ´à+åƒÐJ38[´§œ‘&ðIè ´šcí´YÓM‡?!ÖZAɉ 3Ü6g™AǤ bâÊAHüaIÑ&µÅØ‘ª\`¦v¦x¼á:Èl¢†ùv`ÒÒ•Ã<)¯|üìO¿N¨×iíç¶0áXÏnUSøÙÖ[™ÚªW•YàÇ/€¹Ä¼Ëcm‹µY[+M¢7“Ä¡:­3Íâe¿êBÃkÌÎÌÓ¿¤ýLÙ…È–-»É^:E¤›6ä-“hqÙl®¸ÕÖšrÒÍÞé5ò·Uqð¯ÇCS^–I¿Š·V@køÚ¼ƒ endstream endobj 755 0 obj << /Length 852 /Filter /FlateDecode >> stream xÚµWÉnÛ0¼û+ôb5-’ZÑ¢‡IÞŠú–‚lKŽPmÑ#ßÇÅÖêØRÜ‹ýHñÍ ‡¥¡=ÒÐÏ™¦þ¬g«{‡";&5Ñ:@TÓ°Ald¦Ì@ëz˜»nXDî>|õKƒsÞ*üR6>óVvp_²4zKÒ8ô"w—Æ^˜> stream xÚÍVÉnÛ0½ç+ôb­”„Ú")гoM!Ð2í•(CK‚ôëKr¨Í–(KÑ“Æ”æqæqÞ£ë`9Ö·+Ç<¿l®Ö7±gÅ(&±6{Ë <ä×"8Dž­ÍÎú±H^eIM±¥=¼P¿*VÃ÷2ZAÈD“÷_ìxžÔG“£¢Õòçæ»ÜØv]cÞˆŠÛÁg{^V-Üø¸u°ûA#Ø‹¢Àã@‘~?(rK+ž&9=šRGk Ëxέ™Dv4ðeÜqó§¸[N67òöŒŒ¹x =–nÿ_ŽÀú&ˆSkG>"±lÏGAàêuÛØÒöwQß™ -@Äî‚ÄDV¦so—LìIMÄí7)g¢®s_”£]œÅ/eÅ÷KWqï$LöSˆ6©,ò³ÚDU—”Kà•Zñ¼¾+šN9 Qá1y%Ë µË=™‚ƒ&ƒ~C¤ò;Ù¯oÈPó¶ }uÞ1 ý¨# <É1)†‰¯ºê&­»(<´I¨À´Ú¿9Ò’æ¬f¥©´ÈeÓÝl`9€F ŸÎ߬,쮚]Õ‘¦†o8g¡¦XËSÍ ,AŠ]*`ek’Ò¶p5aŽpˆÃÂ'Ù´¡[jªóÙYV(ȇîݾ’·³#êiÙs+M#?paÓw\¤Y³3"û(u·Ö¼ »OS5N¹‚á±óý[Y|¢.Ñ=W³ýaˆªãN¾gmö¦;»Ü«g´6ÝßT£µ§[#O]=òV†Ïpãqi/æ{x%Ÿs}¦zé™n> stream xÚÍVßo›0~Ï_ai/íÇ´©•ÖI{okeÑðcÖ°ƒJH·ÿ~n  vlÑ@«ö ûð}|ßÝqg €À÷r<¯ãÙâ&òA£À@œ!Hqº‚>¡ NÁ¯‹O\®Ë&Í.=êÓ‹¯¼."©àï«Ë»ø‡ò0†í3¦Þ³‚ïºãO;uºÝ|îv,Ø–nDÂå-¢h´Ä0\Ú6ùÓC«³m‡¦VÊÙ»{nÿ±yHd‘½™“HÙùFˆ8»KÊsÛ”[ΔO_гmPVà–e‹Ý‹µùNmIž›Ú‚!mÊçD›²MI™ ,’ET=ÔZÃ^dõ8†U+í„[ß<=r¼¨œ<sÛH¾‘:œ­ðíÓuX>/šjd1تµo~׎wPj²´ý‹v‡Iü[¸£ŠÆÚ+7AyŽôŽy‹ðÊpZ†='µ"D½ØþYò5—…µisïÐÁŒ°³)Úg4çû¤æëžjÍÆrþ—ÕüìPš ÷j9·¥1“8º¥\°í¿ªzZÍÛe#k^È,mwÕ¦îì\v_P3 ÉFÔÜ°z…üòéTùÎìêLŽ³q7":z\ôzìsç(ï¤ÛeI´EðGÈðø‹Ýy7æ¶Îõ›êÁfôW/Äê.} > stream xÚÝVKs›0¾ûW0Ó t‚ a˜vzèLÓiÏÜš #a4¡ð0É¿¯@$€ NmçÕœ´ZØow?íje([ÅP¾/Œnýê/–—T<à9ÐQüH6–c*Zh!Å•_jÐ" Jü›h:‚Hmvk\ÐMb.U×B¼Ð®ýŸX7Mà¡Î˜°*íÍBšåï€éBŠ+è–‘PîxVtzÊJ)ìpR‘+™ŸZ/ºm׶ƾd [º;èHDô6È×haçQ_<ý!˜3‰ˆ¾‹aw;c^î)hCÈ”·þÿ‡„§\½ö¡O§uÊAO$üNø¡…ïמˆ€g@ ÷²MR…Øg¶ÄQâ/ó¾ÇDò:H«¤¤00:T*æ(f' yŠ_ðyŒCk–Cž%w,K)Nö©D©¼é Çd>œ\©“ø¼¾yªegÕìòÒv£Fw-à¸Î¸`°’äÙˆƒ†ˆ$&R(H)"‚¦­æ$Á%͘Ôg¹\£Šmzm˜¥˜¶²­Ö´Œ÷Àb ©"Åœ'˜uª:&9ÙûmKµ¦f4 ¶¦¬ÁOëjŒ )H!\¼míC©C¶ª]£iêLÖäÞ|žjòã§^’Õ$ÖYÅÂÙÎuÞýì¯8”…÷ð½3È_ìÎ=ÿ°mËÿ.åSn×çÌyv€ÌÞ©‡hqŽyýK%¼Òëè¹*á̶ÿ»wõhÀ!@*ºewÕ=&ÜÕÈ⛿øùëâ‚ endstream endobj 772 0 obj << /Length 639 /Filter /FlateDecode >> stream xÚÝVKs›0¾ûWè@„@2Loi:íÙ·¦ÃȶL1PNóï»B²ÍËNìI&NOZ-ûÐ~úvFÂèÛ ëõËbv{Ø# -ñˆí21:·‰KÑb~"k6¦E 5’* ×É&¬Ÿ ¡4RºQb“UI”‰µÚy¥õIV+aËÓFÜcê|6-~ Ëslßs‘å8v@u®0”9¢d++¡|Ò»°) Q†Ë¼ÉÖ!D…˜¸ yÂIXØqX6¼èÀ»,Ur6*‡€ ½2*§˜p{çùZ¾k3Ÿ!‹P;À®Êü=«EY‰ Ì3êXHíMJM^ªµ)¯“¡:]Ø›@Ô·‰O  Û÷}•É÷{_³.é– endstream endobj 776 0 obj << /Length 1232 /Filter /FlateDecode >> stream xÚÝXKâF¾ó+ZÊ…‰–ž~?”(‡H™h£\¢å¶»B^0` ÁfÑäקúa°¡a23^e7'WÛÝõUW×WUm‚ˆ _$>î,C[ÅÏ#Kj’3.Ñx†Þ'“¢ZMÅçün$™ºÑ:Û†Á÷q4Ùìfùn²ª?IŠ:û3¹¤7wÇ¿!A±(ÅVF°¼Ü¯O‹fÅzR?n£'Ñ7ñkYa»©hPGž§‰%41°žþàµRÖ¥\ñ)«Šé™CŽï¢[Þ-W7ò×¹ÚOG·5ûTߪǮÏâÿ<÷´X52+£Ðˆ ,” oË:ßUùÖ3¥‡õ2Â._eu±)ÝH E½<›°ÌVóQµÍ¦q|Xæ»ül΢¸›>ßQ ; š`yYâ*L©¥š?ž&Bë\$CRE¹Ànþ1“Ü?¨vÈÝÙX,„º>ªÏÖtœ–0ù÷Ít_ufŸVuVŒaMãÙ}W”ÓÕ~OëG8Àûl>ÇËŸR}ÑU^·¢4LþÎw›ÓÇg3TD… ½8Ñ\šUæ‹ÿЪ®=Ûƒ7 ØpÝuݘ°<êÛf}™SnJ礗¸§kÑ¡GùhúºL?=a–úÂfíKÈP-ãR”=Ík{ò¸òÙþl늰ûÅÞMãÕÉøõ~U½náRcS.Û;¹Z–ZÉsìKˆ¡Ãù¾œú:äv’®˜YÑäjÀ÷™ú—ñ௅·QĘÅLÄ8Ç\H4]Þ$hÁ%˜[ƒ~ê1li…Þ þHõ¤œaUÄ©¢"ºÑíðT,¹êTR ì‚BI€* å½€j‚ a]PŸÙ°Vc)Y°Ü5ý‚va]_† 5Xx]~Î.¯÷;ßO@¼dáÌõ¢'‚¦›²ÎŠº†0®—›ÊGæ«|HFX 1Þ‰uhYjÐO-N+<}ã„Ùf5/c;äÄÍ<±”Jl¬l Ñs¾9µ<†uh«.U17#úMEÜA™»Fjq'‡Ðz+ ž€¯ãf_7ˆg-œ¹¾I¥ èÁ°’ü¼ p¼±î¨F×™%¤‰% ¦Þ`u5PØÛ5 R®¦ QxºØ{eÊÕ„zU,^} ¿Dåà$!i/¨ÜEoÔ· P©1]}€B^§ÚtPSY„k ‰U÷©¡Aâ݆LfnÝï.Ñ ¦åXÞÁtM]"uA-"¬—0P ¥ÿæD…p9¤—0‚+½çJõj» 4;µ ±Ôsâ¨.Ÿ›VBßJpwâß„V‚w›ûд¼ØÜ—ÃÜÛðKD4íBÞBf ³šé­Åðù˜¯Î¯Nd–Çð/$óÿ]œ°ZÁø—ý3òvfõãKŽ<ý?|=)"ʳ/"§ËO¸Æ„‹ÇµIÄ\‚ÇÆÄH2¶³‚øh[ÓÈ endstream endobj 780 0 obj << /Length 1359 /Filter /FlateDecode >> stream xÚÕXKoã6¾çWèÅ)j†ïZض›¢½Ímwa(6•%Ç’’í¿ïPCÙ–-;N# èI∜×÷ÍMšüzEã󧻫›[ÇGœæ:¹[&œR¢˜M´2„ •Ü-’O“Ù,«òÙCö쯧Š«I5EV³UºFÑ·;YåëY¶ðEÕ¦Š^¹û=‘ŒX)’)cÄ©žÚ:ýëH-¨ˆjx%ìûVËô´š!ïÖ/³U“×Ù,].£¾V í+v}@ǸÑÜÜJ»—ù©D[L9#Ò0TúsYTõ¦™ƒ®è$-ðÙùˆ£ÏÓ á¨{Ö_²k°ý|ÍÔÄÇo!Ö·à ŠÀ3¼ÚrãæVïc ¯"„l‰“½ûL™9XÓ —Pœ|Ûó—¿Ö›Ç"ŠHÅqî˜dådù¹οdUƪÉS“V~M1‰ŽíY´”0Ë;“àŸÈ´f»nNáQ›ùùºÞøªB'ÁXý˜Öø5«PâÁ~Ž¢ºDÃa·&Åa‹yëe±À4Îkê àë xäµµDr ¥Ñ3T¹šw°ßGDçŸÖ~ƒ¦ÊŠ‡È—ež—˜¸îÛ2¦¿ò¸^èøÍ9q&òû›¬˜çÍ"²û ÷ ”yüq¨¤†j*iW‡AÐV[±Èæi]nfƒo.²]y]T]{!š{D3µ%¿Îã¨#¼‘ŽuƒÎ·²Ô±d7¼Ü÷&µõÒ‚¢å¦\E‡ŠèÑ>~L9¢ù¶ K-êﮞ®Hi©,± tâ`Ñ|uõé Mð À$ÂÙ䥸J a68ž'^ý1°eH͈±¨Êp³#ï ‚ Âبåf(N¸Vg#`ö(î Xó10G ‡m/¨2&v¡°¹Ç`kÇ:Ǿ»žJ!&ëM@z†Ê„„Ó]iØÑœ0¡ÏFM‚!LjŠC‚ý¨†‘a@avŽa)>B‡É}ÚJ‹6Fs"F'ˆuò<÷˜!LŠ1b”Z¾à!b´‡1bpSìÃÜ2Bêóó9ô†4oü‚@Í9:ù ŒJ ý"¼•K|¦ñ¤JÒ¸çn°´ƒ˶8\¶ŠPéΦNJ(ƒx¥…ç» WA(4¤!–ÅÂmfCzÅ,‘}«'3DÙ-“†{2uÀ'Ù«¤SJŽB ü½ saw£&t){ØúeÀ&´d1N¤ºQè±=´Âî8`ÕAñ;ŠY' Õ¦o6œ^ïÇm ®XÑ?PA»êêúõÚoêÌW8.|èÛá­cÙc™GI‹×§óG|[”«´“Vëtîc_øp¾ú·â¯í}ë,!¯ÌBCrÞ×5!?,ìÙB«ÙyXs¼Å,œÏÃi£göDÝ(jˆ6z ³ŠQ¢µì›ªÅÃFŒb“KbBŸÞ·9Ìà©Ð`2ÜÛuÒÅ" çá4ÏÃ=9¸ç=5Ù&P–sÚ]N@ŽÇ~˜ºn¢,‹³Š²˜úÕºŽ*ð6¾GŠÂ”2G¦ÆeÑÙKQ€dt!-üÐ?–Áx·8¼éŠgaóáaŒ ÆÁÏ=‚s° ¾Ù¹Ý\ΰóv?ï#þ:9ŽfûóãöèT$'ÑѯE²Ã¨ $tpëïë¡/¸(4õÞÐŽþ"Á5œ¹~€oúô‹Ïë´zS£ÙûŸ6”Ë{¸ÜÏ÷ض“AD³EkïÍÙÙ*ˆJï÷³s9…û^õý¹¼\ÒAk®ñ¿ÍÂ¥éÁ­,r9à戅#J«ÜÑÞ Ø´ÿ>Ù  endstream endobj 785 0 obj << /Length 816 /Filter /FlateDecode >> stream xÚ¥WK›0¾ï¯@ê%[‚MLˆZõЪ[©×æ¶[!œÄ*¯‚Ùhÿ}ÇŒ!DK.a<ö|þæ q­åZ?\óü¶~˜?-kå¬|ê[ë­EXàøKfùléPYëØzž­÷¢¶ç{³mEJæY…ËR¨ºÌPæøxq™»á•Œ@ ¨ª„B!Ê3Åe&³®ÕÞÀÆòñÏú×üiEz\( P`Ú°xq‰‡§Œ™³Z.Û3¢Y$ ¹P! ;™òÐæ–MéÂ!leÙ„8+f|‰HE¦À”2wƳ…(/KQy7¤µ*ÎSðå¡U«mÜBEQ+GßÚ…¼}‚¯´çÅ‚8ÁÂnàŽë!¥0”Uîä+ 1ÊfzÕD6Lyª]‹DñJ‹: ·-pßWVüïà ‚Ï³Ë0C~Cfwr:‚M#SgP©'”:ÝMbþeb§ÀuŸßI}ÚçøoRK»Ž‚²Ó~?ÑÅŒoòGÂf¯úÇœ€ž©TYGÊœ@m×eŸ`½Ð¨MvuÂK<——x°¡jZÔ¥H¸¾7Õž+”ÀCA#ó&î0‡’…0} ˪Ҋ|‹—œ×?ŠÇ‹›¹9жN“ aZ [fþä÷[ÅÑÓI‚'eÝlXžØ ’€&fH|Ïy"ªH7të&¤f›¿eZ$rûÁ Ä (B~sZ½læ[Üã¸Þ:tÙ2l7™€ý~ªA½i¯(ßp‚N‡Eë¢<ÝÈL ²`<-¸,«6äølê ‹]»YãÞ¨6ôm´áòDŒãLžfd%ulºè ´Ñ\gzÿuÌ˱nn(u} «0ÂD ]²cmz´©ëÏ3òúòL¡=ÞÁô|Þb:>é¦0ÅÑô¾Èv6gsò4ʦ䶾ž{P5ô†‡#ñ§¾ ®{È&¾nyx9‡|»}GöŠC=ÇP1Ý«`qø7åÕ i(yN­SßEð¼Hù%–WÊQÎØWOg9ž|ògÌ˾úÞ€×÷±> stream xÚÅWK›0¾ï¯@ê…TÖ†@@­zXµ[©—JmnÝ 9à$V‰Í‚Ùtÿ}lžì&ŠÔ“‡ažŸÇ[_oÐÄz¿º¹{l#°ÏöŒÕÆ°²\ìž»´lÇ5V±ñË|Çx”1Í]Û5?²<¹KEòÂÅž‘ÄÚ}šý^}ƒxsŒ­ÀÕ>afá–=k¯ò)=„O­c¸I¬^¾‹0áF‚$4è#rQå·À–¿pÆÒKòçMéÓâáU¸ùt¼~;g‚¢ŽõãµýŒ¹\ÞЉŠôð”^©§·lÔ¤ßu»ë–RtwíîaáwÆxî;–ç{ÆÜv­9*ÉwÑì›b£V¹«KsOåNĹÒnD¦„Hì׌3¾U)aYÞ °4×$g‘RåTÖ/µ{F"¡…\ÙF„×ú¼H¤’4TõàNOر|ÛÛÊæao¤qNmPÛDŒò²*;p W"•D2ª„}í””lÕliÖóZ9=Š¦”hSÖj³:–aMæ¬Ú¢šEÛ¶·ÌO i( lÞ¿€ƒ‡Í˜nf™к-5ux5‚ÑZ:AA02¹Z“$b³v ±z#…Z·™Ò+³| dêZ×3™…$w,WžÕ”ªµFcdal÷¹"‚ ØVI]d®_ÔZp2YÍcù¨À΄.³y'Òrò¬2Ãé¿>ŽÕI±ÛËr»ëèæ!TÐœèp- Ó8MØæeÀñMáÞߪêJ¡I~£V¢– šJŸÕ>IǺþŠÄ}ªÒELùÈ:̓§Í1¬¶w þ {1ÃÀùMº ×…to—1ãÈO tÆßÊiÍ ƒgÖeGÿ‘HêÅsÔÔîºp«òáã–¯ƒvÏáËêæ&š(w endstream endobj 793 0 obj << /Length 614 /Filter /FlateDecode >> stream xÚÍVM›0½çW õÕâØ|Ôª‡Vݪ½6·¦BNp6V‰I1Ž¶ÿ¾cÌ&…di¶«½Äcã™y3óflÝYØú2ÁëÇùdz›xV‚’È‹¬ùÚò0F!‰­(œ!Ï­yfý°ßp±ÊUÆ7ôBû=—ùT ^ˆT² m>8?çßÀœKJÂF%MáVzÇ÷’ÞtÌÑÛ>½Ö½´dÛbÏ`ɔȨXq&8ĵb@Pø}^+úëŒW"!ï´•G±Ü»^ˆ|o0þ-݈|I%_¥ Ó`h=K”]KQƒº´ q¸hÜÑê)ª ¹'Éò+ÁA§|Q—|ÏU–®WÕ›€émtÚƒnâ£Âo¥aɬ£Ä'J ù>|¨/*„`{ïÐfúçÞcØÞ¨<ïM}g êà£À»Èëcoé3Ý·«BìÙ}ªÝNÙÑÚi£>Â}½¦Ëy ¦~w*àÆP¶8jgíëÚqý8°« 3;U±ŽT EiÖ’å´˜݆J#P¡KøÇlL9¹¬˜¨8Íóæø·¢°_`ì±ÌœìÀKKN—9“7ä/Ö(ÄOOç”Lª¼2d)Öf…«’5G;VÖ¥Ùóf]©²<ŒÞB¿0 E° 'zMZ—$hæ“àùw¾Ýåì nƒ3fÜÓÖm„¡§M7‡rÃ×ËRYÃ?CÉè·ÉãÖ½ˆ)|9L£³˜®Ëb[ΡC®ÃÓ÷B hÕîÕÆóµo\Ïë=}è eNÂü=¯Ó¯ Ó¹9Dà2)ïz ŠãØMü–Êçùä/ã=8ó endstream endobj 798 0 obj << /Length 1437 /Filter /FlateDecode >> stream xÚÅXKoã6¾ûWèÅ.b†o‘hQ šb{jßv†lË1QYöZRÒüûR,Eö:¶€žDÈù†£™œÁÑS„£?F8<›î44Ò’Êh¶Ž(ÆHI#ÊD4[EŸÇ¦ÈæÛd?¯òbcÖeºšf»ÏÒù¦Ê²ùú°ÛºÏ™)Ê/XàÉ×ÙŸ'HqM AZ=ó¹ÕT&ÿ¤“© ¢Öë_~„Ñ[Š/ZåàÂÒ€L~²ë›ÝÕÏhZCl”{µ?˜|™U« ôgÐz_åf—[ÝhóËiKžÌó‘%Íš`JKvì§~ÏÈÓ{ìj®`Ølòþ«£ß6U I%Û;œmÒô1¦Æë*_– ®°¯z¼Üm÷U¾%þQ˜ü)Ký÷ER˜e§¥ìþÛ!Í«ÊKËM¾/wy™˜¡Üí/›híq¦ÉÁ„É”bê1(fà j ¯š?å^¼O¥YVYr˜p<¾!¡É-®ÊF£)üs•˃Y¤+?eñêÅå!É €HôÝÚº¨ÝÌ´ÏèVš¼„eDãZ;8ο»åvüg‡°·0ÛnÎ>ëͱÉ;‹cÜα۹•-“"|SÝïog­d­ ¬­óÕ%Âï³Ñ·)ŽHÄ™BDÇ‘`1Šc-·£Ï_q´‚°MÄ´Š^ÜÔmD‘VFYô8ú»‡$8„0h³ªDBØþÄ÷ @#À†•qÉÚ  #½‡öËøÐB€Ð´Oí\ÎÁl\.I ×rIPŒ4%ux"rð$a;†wyöÚ ¹ÝÁ<™<ÉB°Al¶â<9„yU‘®î|†¼˜r³³éæ&ä"ƵÖ\uþ^ÅŠ#óóQ,4DºŠ€‘¢·ÅE”ÆN“Ï âXÁ™(‡ÀT ÌÛ˜çb˜jDlúÜŒ,EDvO†°äˆp>¬Œ! Y¶Žà¨RH :¨&HrÒµ·”÷ ’@²ñg%‘à2}A4Iø|–L Þ`w+ê¹ ðX¢ÜÛ¢‚$_õä!l…Æúlp1…KŒÿ)yÉ YϨS%e 9{ëyJ ÜMé˜T¬Û˜gòJ{à ‚lSKvOå!Õ!¨ÀÕÀ$Lµqû‘ÁQ×ÿ!P\G%—mÔþLd\€cÄ ¨N~Á/ˆ(ƒÆ ˜ŽwÃøD2vÏj'­ãÓÇ/Ô‚ÇiîOw §ƒŒU»’pÞRNw;H³t›:möÍÝu?) ®ünÖDŸ*;5` {õ¶ŠyLÃÊÇté+û§)²åI«»ÇNšÂÙÒG;† IÜYÓr–_|õk +r4NÝLm²Çã (¦a´<˜ß„·`|—³ˆbý 9] º[ÿÜ3M)ØÈæÉzmò+KÁ®æ ›Rð­¼ý^­ÚgàE¦©Äß´]g“¯rÛ65²›,ëj®Î(¿ç´vßÈn2°«yq\àô¯¶ ¼Õ´VWæê¿zª+rû_ýhWÄfnPú)ð•/FŽÑ©®9±¦Ë¤¦Æ¦l¿ëðgÒÃIÊ| +ñ^Rr#,Íš`Æ>=÷É2EgÙ–Ä1¢p]Ï·í²×Mº:$ÙÇ(³i¸9þ#Œ´opÿV:•S·ÚuQ^ÉkÙòVë>˜W'ÿ0FÞ@¡-J9?n‹Úצ-j_ÿ¨Û¢vÚzNìZ–<´,AðÖµoù®ô“ÛVåó„ÍdÏ®Sè”× û’Úñ¿pULû›Ž¥I2Û²¡L¿UI^š/SGL[Ýîm&Yd®Ù4e©kôÖMY/O½Ø7e¬nÂÔï)´zéQ«M¦ KÏœV©gN;qÝgï•<ºïãš+™0"NZÂÝîÈJ)o˜æ­IP üÍjug endstream endobj 802 0 obj << /Length 821 /Filter /FlateDecode >> stream xÚÍWK›0¾ï¯@êªâP«J­Ô­ÚC{É­[!œÄ*1l0IÓ_ß1v–GØd]uOŒíy|óyÆ6žµ´<ëó…7ø~œ^\^QlÅ(¦˜ZÓ…åšØ¢áaZÓÌúa_{þÄù9ýzkwyD#…Fù»\±ãâгӲÜ¿ù:•¼UÏCë)î†|Är1A±¯ý½âbž×s܇ö;^å—“hõ^ù®ï£84H“Ö“%ßu5š¥Ÿ'`£§^Ùõô’lS”É ËMÊ…¬.¶E¾åb™d|]]{¡×89 m<Ñ.™þ:`â›1LÔëÖ b%r_GJ5ªEÅ—‚eZmÁ78oäþŠÜþÛƃÛCþ¼Ü‰BÞ‹¿ð)üÑÊßyæ]o'øj£þ›B£%ê¨Ý[æpˆbßÙâë´¶8=W¦`s¯2½NùÁ ÄÔâ'¸;ÏÚsðÕFýÏD ®27"ˆFÔÔ'Ñ^§+VAdBˆ½¨Å\ßf0Ķ¢E/¤ÂñC{¯¢´žâBUkpáž½u°gkõ4ÜÚ *Ùœ_{VˆÕ À pŒÆÿVH¦/]¹JåA2SVÕ¹™ÌXÉDVéA!Ž4KPfB6W¶QZ ”¸(k‰twÈiö²È÷¢Xó4Àµ^î’›ÖÐÓñB"‹¤=¸NG£”»›Ò”l±Tu=¢ûj¥&(˜ ¶tB;¤èb©á  °Îק°“Ñð„ÍŽá‡GˆxäzxìC˜.z/²ÿ°M¡vcs*Â\/®ž2ð½‰s£Uk¦ÒÝÁˆ™â&%c„áÏ¢—ÒŒÉc¢¢ÁŸ¨PÈžMLÇaOéÓôâ/9È© endstream endobj 807 0 obj << /Length 1069 /Filter /FlateDecode >> stream xÚ½WYsÛ6~÷¯àL_¨Ž<@rÒéCwÚÉ8yPŸêŒ’  rx8N~}/…–ÉÉ‹¹Z`¿ý°ØÆÎÁÁÎ_WøèûÛêêú†úNŠRêSgµwH˜ 8ôÅÈ"gµsþsï0‰ïVÿôv×7a22)`Ao¾á¬‘‰æãÄf°MÇC‚’0p™×~r›µ;{׿Àe_‹¬D÷¿N‚BŸÎ´–ͶŠœ=ªµ¯Hµ÷œ—§{Årî†æŒÙ~oÍŠÍÿg”Íô0úBžuŒIsyYþô›øŸy /ÉÿdŸ0`¿9”™*9œØÚ‚/ò67?tGÀ± ')÷G&B ‰Ü¯Œ‚àh`àã‘0îÊjŽÎðLv[¤…×ØeÅëÚÖÜQ‰EaL;3ˆÂ 0‰Q  Û£ ÔŸŽ²:Œ¾v?‰xOâ^pFÕ)ÓÎPbž‚ºÈ ¢»Gµ3ÚvÒ€›˜Rôu›5'<¦!"ÃyÊçª~†îÊx Sõ\X“Îôößׯgð!—¢áº„4X[VÛ3èD ³+¼ª ¡Bì.m¨Ã𛔘‰:“ÈUm© Hp–µvMû‚¯õéû«ºÅÚ §Bê™A±Ê$•ž €h„B2WßaÝaìKa&ˆÍù½Ø÷žŒPVÅ&ãù\ Ømå¦håŽïºye…[vk'ÝÞ|ûÑךÕz<ß`ì~ßÑöVE…U,çM%¶Æuqù¸›kšå‡QßêúæNäª÷_ö¨\Z½´º²¨ÏJOócßü’ûüÔCó\~“—æ)~_óøì§J@R“Ö‡©¢´ªÂÔ·Ÿ*j‡jƒ ‡Q¥J³GrŒP´~Ù*NÏ¥žz/«šÍÕ羕[ûÂÅÄ´®ù‚Pš"à•ª?Œõ£ÙÔ.&ýcÄÞ¥‘j6„¸›xïv(þ’ÃÙd ØÞ Õ»æXÚç2¶- ÷ÇUòàÛ>”oT¤º™šb[*VÞÏUó²{0ssµ“^â‡EIÔu†Ç™ÛQšôˆ Gñéö#E´§?Z˜ãÍð=D‹&}Ùèm)lúsuõu> stream xÚÍXKoã6¾ï¯ðQ.Ö\‘% ½µhŠ(ÐCnÝ…¡Ø´CD/è‘Mö×w†CÉ’£$ëdö$rH¿yrFáê¸ W¿ý÷—럮"½JY‹xu}Xq¥Yœ¨U¬&¤Z]ïWÿ×·f½‘*UžWk¡‚¯¶‡*l2ä‘å0æ´º«ÌúËõŸŸ®R>'bÁ¢(ðØçÇ´k&„èé°ggMéo¼GèYÞ›­6" Y¬åjÃ9K•a‰D›í§ð”m×d¶ìZZ?T œd¸åhñÈýš«À”´æ„ÅmÃæqEŒ÷=UÃBv»[ØÑú‡ËQ–p.ÄmƒÁº[-+6ÑLóøb½z*hDòÁà\¡³<ƒQ”i@Îüq«à#amýáî뚇A5ó×8U…äs2¡NXBÏ„÷î(´jÓ€ š˜¶ÈÖ]ëV£V ?ªà„3B‹¨Ò00(ÁÃÎÔÝp&ëÎOOqø´xÎw«ò :&gMS±˜‹j1ì$²¶í ³Ç «ˆxcü"}À'ÌG |½µ¹_¤¸”^ ¤¸¸„ïÔõp^d´sä[¢niRWùã­Ù7U 6V*rIcê™±©o‚'-êÜ0u*GZìDµ›¬EDK‰×8®ð⬹Ëü^`Rd´”•{¢¹=UßXÈ@" 6UÝ·;ë/1¹-6KcKÅ4ˆ'ûÑÞš–¤ gèÛ¬<"º‡ï÷Š"Û+5E5Ñ ú®o (+ 5„÷׬éì®Ï³f…GA;ÑÎôç”á턃ޅÁÞ.¸#ç!KŸ¸£\pGÅÒ$ö˜Ár<Ø÷¿fgÈUI¦héN§ ·w¶¦‘·wÊ÷z&×æ> stream xÚµXKÛ6¾ûWèE.bF|ŠB‹Z4Er(ÐÖ@I`È2×"K®Ùì¿ÏCÉ’×v`g{ÒÍ ¿™ù8rlƒ(øc<]Î^¿Q,HH¢˜ –šÄ‚JÆ„q,7ÁûðCDãùÇå»á½×o„½çðƒS^ι ë´lò6Ÿ3~žSšù‚É(ÌŠªéj3±u´™Œ”hÁƒ£DÆM¯VyS¬¶ùg0'Á´]íÓ.~ô«Uë6+ïïC$#ës0J)I¤mÓOg‚ôÊï—­ß3_Ò¬›ô'gt1±ª.‡Ú•yUž<ì½DاºoG’É…æDi5…ý·jèZ›BNÃv× çrÌÙc§T= “Ij)DÄq_06Þç‘PITB{2_ðH„ËÞymš®hQÞ§O(¬}iéÛ¨0´:=êêK¾O[€ˆ`Þ¨ŒUzš¸·XªxNW ç >?••=öcéu+|®ý+Æú´0¿l•çp‚@:ý11gàœèxh¯>„Æ´ƒóç¦9ƒ–¦g¬Jhï#ºÓæž0@©ˆd¶ü4IÀËí”ð·I³]^n1àCÚîP*L¹mwÍÍtÜBµw¾²~WÞåÿÊW{*9í))õ)\yâªÝ¥-Jà±AÉÅK…Ù›Ò+äÃ+Π°ô»õ¶Ïv 0;I È먡D†Ä|È!y#/uN(œq‚gZ ¥„Ë|ƒb篳±+÷ºÛ5›­ñ ùÙŽa7cߌ›31Ä0Zãå…î€^l°Æ#°‘™ÿÍãlùGrÏ?°íIiD„šžÙ‘¤ãû´¤dŸWHi!báøÇê¹ ¬Ðó•móÛ爜n5õ5æNõ%þa:&âˆæEZôŠ“ºXàªwDĹº@D’¨ýoјç¥R0Cè(¬Ð~ÖwŠó±3Þ‰™ˆI¢Ñ}b!-Î1iL”΋ óòu.W”p=º¡ P[zPӺͳ®H빈B›8­ÂüÄÎy …ƒ{£äÁÊ•.(¤}þ¤«ŸÉ°1 SfÖKÆ`eï€ë€ÕMÕÕ™å.»pýh7óò“½j¨P$؇¨±ófûbu _‘ aEºð¢i]eU …y¨Ê%ʘ#1Ç=‹ÁÆCm¼Ôd;³é cÙ êϪ5v"‰“p‡üaŽ|×#iuœy†/¨"‚ª«5ÊÈ\‚ED±ïªž@ÀxfM 0u¹Fg2~ §‚Âe d>qz¹Hᶋ† i÷`²¶ñ·¡NHŸƒÏÃÔw{» >‹ GHXˆ"Væ>_1”þlkÜ©÷Fü0[Çû¶ÓÚÛéÊuÕAopßÖ-0R“¯‹'ÜÙtfˆàL¹ cðÅ{Ë×÷0ç:é©êPxÌÝåÒ¶XS¯c꺪QÜ;¦[s}Å‘§P~ÇúoíöίÏò2+º †òÝÒÌÝ/ä®|:ýÑ|êÖ«GìætlÊÉ—>Hå­átå ô ìc„Œ»º„oQe©·|Šò•cÞn´{âÏÍÍ œæ§ζN›<;ùÊÁ=°soêÞèÄ;þߘFõñ#r?ÄØÍc˜À¾ú€ø¬÷ÎÈÍý:‰éîh&ß²Ïá=Ïá3PÃìÏ¢µ§ÂDOÞ€Ëø+†…Y­ endstream endobj 821 0 obj << /Length 998 /Filter /FlateDecode >> stream xÚÍWÉŽã6½û+ä"1›»HÌ ‡é ¹%ñmf`°mµ-D–:Z¦1Ÿâ"ɲåŽÝö!'‰ÅªWËcqÁÑ6Âѯ3|æûÓröð¨i¤‘–TFËçˆbŒQ‘ ¢LDËMô)þ.+Öy»Iç AEü1«ó‡¶ÈÊbU§ Úý8ÿ²üà„ -‚ÉjZ«mö5Ù‘·Ù›/ú~ü½Væå3Øáq‚gS ùûh ¿B>X”“„£E‡KÒ˜ýG~ëÕù ¡Œr^ÝÝP²vï@|v\P·P I%Ç©-w€Æ1³â¥m쯈›Ò[ˆ)¬!Mg¾]ý~YÎþ™âˆD”a”$ TÐUÑz?ûôG˜„ú ¦UôêT÷EZY°<úköÇÔ2c %’8( nÓúÅ¬Ó ·Ò.Ir·’!1vê—ÝD9™@œtõ¨we›o|%ŸBE_Zâv²òÙM˜I›àÓøu—åA½Ù™¦×>%bA8v­7Z“„„ƒò»¥2$IÀsPRð· Á%˜ÞÃ-Å@…&c·g¡1è™#F@äa<0b+³ŒX‘ñÃ*ÍM=… ¡4Ž.‹9Çñ×9qZÕiþm.E œ1™ peÛ¸æ xœ% 1¡¯¡ @iuÊJj}e·»í);t{¾‹8Â<¶•ù‚v•¥RuDY™%ÊŠŒvD4éûÇÛþ±ª“\!×âÍŒŽ%÷(' ìN‘À9G`t§Ng®Ç^ϵ lyê îüY0BéW¬ô“ž{Zà×Ñ_fàĬrÔ ðËìÁ_á3&É‘Í(Bo|Ú›´ÈŠmìÂqv†?Ó}i[Õ÷+DÄdl ;øfpfMZ&÷SuSµë¦­‚¦K”6åÞd…—ÙÙ?¨L±Míñ:Ö÷eÁ6›ÓÎy°w§½U*«€Ño0·†ß,¢ÂÑ¥ˆo  iÀ n×»0=$då ÁÐ%J>@'€}ÊvŒRVXôÞ¼^aöA±|>šê· õTè&¯K¿ª 4yÑ:é’‹n]y¹6ùÊÅrŽëÀ*\“F–²ß5WÏ~¡­üj¸úfvê4¯û›Ùpͼ1vñvìÝ‚½cèï¿2_÷x2u¶>º,÷².Á«S;F}:| ±"Ï7ë–€¤û¼K®{‘ørŒ_\½ìÖ8:|›\Þ—Åø¾•~Mˆo,‡qp·‡5཯dçãy'•·t‡ÿ;öîT¦sסUÔ^µRTë‘Üÿˆí¤} endstream endobj 825 0 obj << /Length 1068 /Filter /FlateDecode >> stream xÚ½WKoã6¾ûWèE)Ö I½±EšE‹^Šú¶Y´,ÛDõZQŠÛß!‡’%YÉÆi°—˜¿ypæã„:G‡:ŸVô™ß_6«û‡„; IB:›ƒÃ)%‹0ˆ÷g³w>»?È2Í»}v·xàþ$U~ÿ$rrúùîËæwZ3F’À*o·°¿=Ê'«®¿Š.oåΠèljl{ÈEÛfå¶å1{¤5°>#±ï-a·âï°‹'€`5ÆU¼ÎºGåI¨÷lxâp¸9<8sȆðöU!dùÆø.à…⻄ó>¾páwq°>p–²?W}—Ú™X-귻ߕ²*o b|à]naÁƒ¢Eô­ŽàÏvD!êyG„/äCÔ£JSY;D;7_œ·h°b¹ðãs­c„q8míÍ `RÍÎL‡G(*ÿ!­,ƒwKÿ²N„±õ&ŒúˆµÌD¬e:b-ø©j‘f(9Ëö„ÂLÇùOÛÜØË"+uÐ ·Óªi2UWå^{‚&«™i„ r¹^*ÊVŠ<ÿt}ÏýÚ‰²•{i ‡DC1‰FŠ]ž)T’%n¡#€àÜÜßJ”Õ¢ieÚ墹ó©ûA ýË pšar©Mà…Î,ü<7¢®—ëÀt$îù”5ººB[Z†Ï ¥Bn‚ jäQ–ú-Ôb›|½!ÊýLÕÐ Ê. WÖXuQ^ðïbE×äè*†¬ƒx–uL²Néh6¼òµÖ]ñú×z'”LGœ2‘ms(ó› j¹óÔë_‘©Ooöf™.gn¼@ÞøˆLdosiÙÝJäŸFý¤û(dÈ0ÔÍ«ÔT"H²a–©õ>{ £z¹UXªÚðªjAqΡ¥åÞ¦¹OSAè`¡Mqè`£×DiõÁ€ëF·B …\bÇ0¤½ ÖÉÚ„ÕI(\dJ;°§2­, »Ê0ß ü %>Múž oáVà.¢¸×ÉÒÖ:¦,àäâIH¼8ºšzLËÿºY}]1@¢sXäÃ1ßa1#œ;i±úü…:{؃4/‰³Ñ,N’Xû˜;­þ\øÇ…EØò ålœú+«œú$‚Yçÿ[å4"!dsbU—ùµMîÖ{˜ä!¬“©IÝ” —Æ)Œ¬¿µHé°ÓÅÎÃèÓu§ðáO‡*Ï+Ý ça¯Ÿ©^Eåk?"^Ä¿É妷¦“oæôéÔ9B2¤~ßÌ[# ‹œ«ëazÞ*‰ &z¾5àŒÒɨÿ+CÖ endstream endobj 829 0 obj << /Length 781 /Filter /FlateDecode >> stream xÚÍVMo›@½ûW¬Ô ŽÂš]Ø5«V=´j¢TQÕªî)‰l¯ŠÁå#Qûë;Ë›X1u¥œ†™73o‡Z! ]N¬g®“Ù… H`Á)G‹%¢–…qgsLm†!º1ÞÈ$ˆË0ššŒ2ãÌ㙿\âõûéÝâ3™„`Áê`σçÞJ>ÔáênSÆ…ô G»Îz>/–ËâÖbV…æì:ödáÿ<¹óü¥ýÄiàÇ^¾õƒÚyvçÐy«fŽÛ¡ÄtmÌ]ŽLÊ°°lzuéÜ1Šu¤Sú,:˜r:©bã|•Ø˜¸ó&ÄϦÄ5Vå&J œ.pÁm Ì¡"&Ÿ“_^ D¹ƒ q sÎQ°™ÜÜY(„‡@ ¶…‹«Ð ¢X¸¬}Ÿ|Ú>ÇÆUPŸë¢ëe…]fŸ¤¬à°¤_Vó^Q[Qx’š6áÀšè×T[9pn–í!èÓJÒbx Ô(uì—××C€´ :o×*Q–mÈzšJ~žËU…½õƒÝ¤@sú«_­92˨w]™ÅÚ/´Ë(×VãQx•qïç²~–.wž)fd²ª3·[€ qu>®Ì.x—L[½Óp¥uo·™ïäôhÑ)5+WIeI3Ë×, Ë èe?¡ôN Q85AȳjV±s„žu•£½÷þÈíÑ2ÖEªìV…öFCf;MGˆ¦ÙøÛ#fQ'xÓ™§õšiñÌv¬§)*~à£Ñkil3O(Ý.Æ“[&2M¼ã(ns:ó´¾QSí"–Ýá^òýº”SÈ{˜f(¥±5|u±,ŠýеóQkíO¢¼P²£¼ML®o—i¦cÂtãË. k@?YE ku ©^ä`­<:ª°31(?Meëöž}¼—[áþ_­úXfÙo%¯MžÕØ jçM>ºŸ29uG¯C2LÅO#š£[Kù‰šÛWôqí kú¿ôq>úë²£Œá¹ È„ßxתû#é¥À/î_Æj¥‚ endstream endobj 833 0 obj << /Length 879 /Filter /FlateDecode >> stream xÚÅVÛŽÓ0}߯ˆÄKŠ¶®íÄn"Ò‚X$žûÆ¢ÈmÒÖ"—U.…ý{Ɨܺi¡ÛE<Ş̟93;;;_nð‰çÇÕÍâ>¤NˆBN¹³Ú:cÄHàp¶DÔcÎ*v¾¹od¾I›8™Íeî{Y¥‹&—Eeâí?̾¯¾Üœ2EàíäÁ©]cLoG¶hÓ”åÓfXÃù¾7…Y‹g0Xy§Qæ§a.¡Öäÿ€ÜâÞÂÏñ€;sÊPˆ=úEÎ î0#ÌMòÙœRì ó(“TÔ€nv?e½½Î“ªNâ)×mQšE\dBæ·jÃÝzŸNãf > j«Ùh&¨Óy~çµµÔq•9&+{“‚±Ø³ SßC Æ:–"ß)GºÅžÄhC—e¥\›Ú˜u L iÓ4F‘ÛলˆÒ†‰êLXËCŒX ›ž[î='oéêp/°˜`Щ)Áý®bÃ×E)w2©1·:À M®7o5%0Õ{YK§r´<Ðlîaî®&‹{4°¶Ç'Êë…ˆ@CN”—a÷1)¡£2³1©ÀR‡MÑËÊ ðµ´àî´¸çCZs?D؃9 `£–Ü&Ë£ EXyûTîr™ï,AQŠ,©FW10߸~Ú[I¨-=ƒ:ÄIi—ºò¼7@8 ‚wG Ï*©õ”ÑahaiµÞÍfßbŠzêÓjU^‚*˜–•ê`ÆÇÌàe&j ÄT“¦\ñ}Þ ÄÇ(lÕËŠ8I§†œ#Âhë¥:ËÃÐY²;îɜЖ½H»±×,ìBæuYÄM›sÇ ²äK„áÑP% ãW]Šãz*0•wiú¬ÒzŸ'zT_湶˜ƒ_<î¾±FÒ´_zýQ¦'oÃêQl’㛟¾n´ÿàªÑûH¨ÆtÕÅwÍR¯Éíé{ù¡T]R“òô7êðššR$©/ø3X‹Jn"ˆhÒÙ®Óåz­ÇñÊèÁ8õkq®Ö£¬®Î§‡{D^^âË~þLÆXí5JÜC¯aùú%>“Û8«¿Ë‡Ÿ¦ÔýN"//ñA¤”8kÒZFõÓ‹ÑÚ®+ñ1tvø¯ºˆíö]À{ ì®Ó¢‡ƒÕí¹ß"ÆÐ2$Mˆ‚ 0ˆÓQÈçÕÍo²]éÆ endstream endobj 838 0 obj << /Length 498 /Filter /FlateDecode >> stream xÚÅVMo£0½çWXê%YÇà€ºZ©•¶+õÒ {ÚVÈJHbˆ›@ªþûuMl>Ô†¸é {`žgÞƃÀ ðg€ªçM8ß0`„pˆK e0o õ@8ÿ†Q$6I”ó§xäxľí6’O«ít5‹“äá«ÑcxCߥÀÁž±[ #-’\D|>¯p [ıÈ"É×<Ý(p´Ãî†6ëCïö—;ô±·ääK-³Òð‰´Xw`¨|QësçÔ¦™n>M¶–dÊÏšc‘‰Ufm_©Sÿô´¼[-ä7å] -ˆvKÔ(%ÀÎÑ—>*Š¦ƒîÕ@j§*öÀûóÀ q!uÝôBdÓ¤˜U?æX®’×l• žÀå¯î@L>Ÿ^Z×Ь§±Õ„–6Iß2ýŠt LªžÔœ\_sR+JÕ‹ÝÇ3¾~9ÄCÃëµÈ—iœ/Å´4ÜËxÍs%ü¦U¨Úu½W¨p§jÛ£ä*«okˆµ·EY¼èYÏÄtk¡Õ_qDRæõö‡öI䀢VÖ'žþÔj‚[œU::jDù¢A£[íóEo!¼éæä4{¾ävƘÆÈ¢ØÙ·&QWý‹ô}¿<#j¸üÿiã˜{ endstream endobj 842 0 obj << /Length 531 /Filter /FlateDecode >> stream xÚ½VM›0½çWXê%©æC­z¨´[©gnÝB °ÖÛÛÀ²ý÷5L Û̦{Â{Þ¼7±PŽ,ô}außoÑbsÚ(Ä¡g{(ÊíÚØñò¨m‡¢h‡~.ã˜íy\&éjMmºlf•`RĪŽ“,k­+•ÜY”|^ÝG?ÐÚ%8p´&‡ÔÊÙóPQñ’ à0– 0í‹4ב­ƒÇ|Ü㸕* :Z˜‰´:¼^Ç©HÇlÜv=@7‹·)ãÓêaô@ÃÒ`d 0UŸaä]’˜ŒKùëÝ33®WÃä4ÆÝ€¹#ƒQºÊ™M\‹±Hïjýïßú=Û7Þrè¯uŽãcñ÷ÛK³mìS¿ ð‰-¯vü¿Ñ€øá딌Kª‡³}L èàß¡6C@g–¼\›<ãJòßB,á$þ©÷hXAÏÒ)ê“‚õ”i~æˆâ$¶ªA<·èqîýŸryÛŸÌiì (çõšP²¾JM|š*ÓJìY.Ò]»+}QR¤¢üå3«Æ”DÒñ®on½áÿø:t°GBóæßYÄ9¹ÁÀIG/6ß<¯tÀ„WI©ËäHb—tÔ¢­Ê¦Ö2“œËfwÍDÞ™*±müöí4mV{ÀÎ/1÷¶3&ŒE%™(±Á'Ä®ïkq!‚ eC,×Øu-þ4¹c endstream endobj 846 0 obj << /Length 937 /Filter /FlateDecode >> stream xÚÍWKÛ6¾ûWèÅ.Ö\>ô"ôP´IÚ[Qß’@`$Ù+T¢´¢äÅþûEÚ–l)Ùõ£Û‹9äp¾™CÎÈØÙ8Øù8Ã㯫ÙýNŽ¸O}gµv(ÆÈ#¡ã{¢ÌsV‰óyþS&ã¼MÒÅÒ£Þü}¦òûªÌŸeYd"G¿,¾®þ¼%!ˆ{Ö&Š`[´É¶ÖJ϶"7“Ÿõ¬zŠ0Q Ú/ØØKPè²1ÄFüÓCbXðê鱺›Žé¡Ìd³3” D@Þu¶Ëé^Áj]æÉw¨ù/¥Öíù­ßŒ^+³R^%ucHÖQû¦¥x~'ád/OçþEßðûÏyÉò w–”¢À ðL‚##7ìÄ(ºÍ¿eE*PX,©‡ç…YÕæ¢Ñ+» =äô BÖŒ­jEž?›‰,­V$ÛL‰oyj¦MiÆ$«Ó¸Ù펄Ü,–d¾Ûõ`‚LV­+k;¶ ¬é#1sU‰ØZ”kë×jÒfpà6{ˆGa†:µ4Í"b.‡(45£/Êñæ[ý“ÚÅ.H-HQXIÈäH9Lk©/FTMÝÆM[[¥Žu°»ãÆnȧrá)Õ¿&ŠzáâùØùÄ0>_·2ÖD”™~Kscg¦±»u3¶*]·¹‘ufô(’Ä2í™V¢–ÀEY—B©¶È kìQc9 .sw_Íg´Ø! \Øï:.ÓWÐuâböù+vPwÄxè> stream xÚÕW]OÂ0}çW4ñ ëÚBË&bâóÞ”4cØÈ¡ƒÄoLjsG™èÓúuÏzÎ=»7C`xì Ãó>è¸cŸúŒ0¼‚¤ØŒŽ Pðܽ’i4_‹¸çPB»·RÍ]gðí®7 ž4ƒ1ôéî0çzŸÏäfw<ŸMC%#®cŠ¥ëÊ…àB&êQ´Ebè û`³ðýìTûûî§ë¤ ÓïâÙÇr”úÅp*9KcQÌR}|³…sÌ7ª­R3YàH‘e6ø?µ¶EwÞÅêÞúªõîxè}û¡ŽtÅwˆ=Ï+1b•‡ ó ê÷Æ¢ endstream endobj 854 0 obj << /Length 425 /Filter /FlateDecode >> stream xÚÝW]Oƒ0}߯hâËfF…2ˆÆgâ3oº²ÂlF(lñß[ÖmÀ&Óñ¡èSém{zï¹=íEK ƒÇ¼kï­Ádf"`BSG:°<€4U]:žB¤b`ð> stream xÚÝšMo7 †ïó+xl{˜‘DJ¤#@>ê´@ qm \gQ vƒõHÿ}_ŽÀ¶âb£¸Ž'ïp4$%=¤¨ù°ÆJ4Eª™4E®8Jšp,ÄEqT’qd’\p¬T"ômÑÍ4Ë ,d}.T öÌœ(ÃqÌð,bÊ‚…Pa'‰¢d‰PÌ9ÁÇ #‰‹ÄA¥P´€~—Ì*™bõ‘æ@)¸c¦èŽ¥B¨ó€(qt¡P’È‚wƒ”k´DJÅà0›Ï~ tLÑR2¥ªè´$âá$8 ÌK%N·ðI†¡j$–àç€1Ã’3†©ðÅ¥¸s-p¨Bl~*@¨E’Àp¨AáÇ„$%´À»pt°çÏÐRI ®ƒð@ÒšHüG+ÌçHTx®¦ª”CA§À—#zÖZ)st«¡„ÁB¤ %²À” Îz.˜…¡5ûè|ÜÙ*C0BçB†€y[LT€‚P)B¶ÁÐMA¯hU¢!}@}¥@Å0 Ãl‹U×AvU߆@Ë<…"¨¹Š¾<ã8×ÁØÓ"»Ž§ânÎÝCpÄ05Ÿ¿Äx¦sžçïÊ>[„Ò¼¿ˆX™¸w qŸ…Ï_wó¿<+£5#2†d3E‡–aîC0¤(Àã Éfµº©WöÜŽ†ƒƒazõÏ»M/NÿZ ÓÓÍz·ZïÎ1µ€Åør˜^®Î7ï·g«óyIÎM¿®^¿9}²ù@Ç®ãè“.¶°§<ë=z4»FÇ:¯ì—4ýöûXÕiÔb®6"”ë÷oßž\êú»Ù½;=[_˜¼8ÝíVÛ5¥‹Ó?ìžíNw+ŠsÃ0bÈtp@Ó!² y~¡w(¾ŠÊ副›rq=M/¶›³£ÕŽŽáþÙ!M¯Vvôq·ñÈ Ä½<’ìÅãº<ëæTGEvÜ <$ûå ’Çêaå6ÍÒžiÆ©ÁzÿivÁ5lÝ<Ú4cîåÁ²|µå¡Ý<ìÁ”¡Û—U/)ᆔÄ^R’ö/P×u/ TL#nîëõšt•ñÿZ D[¬¹kùš Ø‹ ÇAíEÃ"´e9ïY–³6dñwC¥Ý¶³uóøÊw‡×êÇ]À‘NI½p /~/Öò(Ý‹Çôx½ÞÀÕñüÂÖÇr£Ëùú0½ÿs7Ÿÿòfý÷0=Ùl_¯¶³ëx2ý4ý<==ö¹‡ÌfUGS&19UJIÆRÕßfzg@G4=ß¼ÚBòÝ9,ßlÖcÓ÷Îäj°ô›ªþ"úFäüx_&ûûô{€s[ò^ÃÖÍC[û=‰[¨72Ù¿Üa&K¨còA¢£'0—1Îßl¬Yþ+‘S¹‘Èþã¡ÄêN96%Ù¿Æ|Nà®À‰éanæ¸"¸’¿ŒT›â1w“zPiôåpRláÔ^8),ýÂÚ/R¶ç©OñokóLµ…£ÝplñÉÂm æ=k0ßü|iœ–ÏÃZ¥›‡.ý1Á¤½Ù”ÐËCâòy”–‡tóȆÇ×Z8Ö §.ðm¦åæ¿ÿOM'‚ÌÁ¿d©± endstream endobj 858 0 obj << /Length 453 /Filter /FlateDecode >> stream xÚÝ—ßo‚0Çßý+šìE­-Z„lÙÃ’¹dϼmKC\3 U@ã?E'¸ÌùDä¾w|îZæçÚ=Îpª+@‡ºª¨Àp€‚$X*™@eD€a×.¥,p霭ìÞ€(¤›ÌÄššŽ“Îoój-}A-ƃ7DPïÝxc µñ 0†:)(†æg¢XÇãþÖMm/â¹Q쉆±“IFýty›{¶•Î¶ BéŽljﶎõ‘VÞGnȪ²åvÊê‚›EêÅ°ˆ<æ{ÕjØ_nÁB¢ óRë"‹¶œ¿Úw–[I€•UÙ{T)Ÿ#“ý&À4rIÒeÈ Z[­w^©¹3œ¿£h›,Â÷Wv3¹V“«Ø BZ‹ Ù~p²h°œÕ‹&›Qõ\de~~`›S.ë68ª×†º®µh¹ØZü[§]ê±b®pÞ_n]ÒEæüZ¡g½ô÷3Ï‚2‚:Æ©ù ófndí¢¸ ßÝx>g¦ ?d.¶‹ÜüÈ7RfrŽ–¬A$Ö ñ—F–„át¬íýÕ':Ž3¢CMÓRuŒ´‚É“ÑùU¢ÞÑ endstream endobj 864 0 obj << /Length 835 /Filter /FlateDecode >> stream xÚÍV]o›0}ϯ°´—djÛ`Ú´‡Jë´½LÓòÖVÈ!$AC14í¿ß Ýš4ÕöÄÅöý8Çç^ hƒú2"æy¹Í®<†<ì9ÌA‹5b„`N]äð9fG‹ºû~¤b݇“)g|\½•2J¥Ÿíü»,ešD"ö×i¼ÒGÞOnßM±k[hJ)ö¸ öGg•§™¿ŠuC8©c¾»®¥¿Ž¨¥Ìvë‹¡`¡,“. ¤õ‹ÇÌ®¬A§Rªh#C|媸ÐvGú¡Š0»²Ý=Ž§®…×ASÆ1³uÐÅÒ2NÆiæ¢<ʼKý¬1j3œP>~ÈòP©î\ dã?j+2ÊÊX&t&r‘„E˜+¬«‚40V—Ålì‘9<]lSO×E±é|2¥„ñe$En‚ïêIsbk¢ëïuEÌ€ÒJ¶:4ú¼Ý(¬D‘Ílq :eÎQŒ®o ZÁ&H[ž‹võÑ1ì¹X1ú9ú1Ðt6÷0ƒóU(2wtÒ x`–rìx´)LësjAŸ1Fû2­0rs]A™ç@t# «T[š¶Ê*ÌÊVLii«wqÖtÕVÕžÐ<Ë07ª[Wj^g=m0ÛÌÀ¼* †$Õ©Ù•³O•ÎížÀnH´ïÒ# ,Ëj8û*«Ê Ó¾SçÜ¿3Ø…-n¾‹d—+3)>‚>fqÀÐQ™B¼ýôüäêOÑ=/3«ž¬úQSn;‡†êÐT<Œ+ÚŸhÎqÞ¬h¤¡iËS7ÔhRaq=ËJ>øì‘Ó®uÔøµâÔÑ = ¿“^¼ô«3äÝ1Ôr&oÎù×èâH Qy‰ê fÁ<¡è~¹gÑZ¬ßBçÕ¦=#–×xy§ôÜÎ0D‘=DÀç@°¶w±«4‘<±ÍºðK0_Õe'7Ùß!æBnÂ7@Èÿ„ ¶gÿæرàçyØuÍÇœ¯çy¿µA· endstream endobj 868 0 obj << /Length 426 /Filter /FlateDecode >> stream xÚ½VQo‚0~÷W4Ù‹.£Ò²eKæ’=ó¶-MUt͉Àö÷WÁ¢(hå©Ç…ûî¾ûzmu°:xèÅúâÆS:à.614Äš@lXÀ]€!¥<öiÂ~¼‘fak˜}ÍXÌç4`Q =Œ¾Üw¬!«c4þÔ-ô¸EÐLmÓ8†³â¿'p$õyœP&Þ&ö所׷èÍà EnŠ ™yA¡r‰fY؆ññòHsy¤°Zw>övLÊ´*¹,ÖãaçV_ËEXŠ‰lX¸òz×D9ë”h?ÐRX5ÉåI³[+RØ€B9âç~º(ðžà8 ù:Ì:¿Ÿ›‹ûPÆìu£ôµ¸ëð©0{Ó¸%7%¤j²“nÑíÕ?#¾ØIÅ—G¡ô©¿‚OœÜZüóÜ.<}Ïsë¸nHñĹ|+õúe¨„ê(Ÿ­`‚ÙrYŸ]Òܚ芀½¾äŽëw¶±þnäÔO¸œýXêú¯ R‡‰ƒ‚w©áxjÚ{O~Ë‚¡¤†hÛv.…¼ºƒ£“ endstream endobj 872 0 obj << /Length 429 /Filter /FlateDecode >> stream xÚÕW]o‚0}÷W4Ù‹.³R>*Í–=,™KöÌÛ¶4¢k¥ ÌìßO‡ãCŠˆ0ÍžJ ÷ÞsÎí=€@O=m·>8½Ñ„è€@‚u œ9ÐMl¡nXÀ™—>¥<ôhÄ>ÜÁÐÒ­þvºQ²¹ž>ãâU³ÐíàÍyCAÛ4À!H¬BŠÿÌ¥kêÇ^Ä)›Ïw¹öoS."wºÓˆ¦e´Ÿ*ÕEŠ8E¤Ïn~rhõáÍÍÕ cÁ±Q䘿}$G\ RQ$–ÇsLÂ3¦qKªûz«p¨Ú·»DܤëMÁÕŠ$Ý©R¤Ð^‘JþÎHiJ,%[1?_kæ݇8âÿäݵVÖIoùùÑæÓ­·eÒÊŽ»Ò®|øÄÃÜgR¤0©QKfÅĽÐ;EÝÖôãôw͘é$% ¯¸˜zñl—în“o$ïK>g|¿¯Q2²eXs.ŠwòqZ..×ry~S‹6a41íÜoCl˜›ŽhÛv’!TytzßhB½d endstream endobj 876 0 obj << /Length 1120 /Filter /FlateDecode >> stream xÚ½X[â6~çWDêK¨/±«U*u*õ­*}ÚY!aˆ’ ‹öß÷øÀ¦À¤ûäƒ}|¾s÷ 8zpôûûõ×éèéYÑH!%¨ˆ¦«ˆbŒ8I#Á%¢ŒGÓeô9Λb¶+óªœÕûÙ[]ßÊj“ëb–—m¶m²E;[V—/˜ãñ—éQBPš°hBRÜK™ÍŒœVÿ“'œò«RÝé»z_¿}²Òð­‚š¬ín ÚŸ¬€Éu}^ó¯ÿ¡ÏlUK/¶OwïÝè"qŸ‹NU?­¾·›zvÍ7Ws¦Ö[½iîΙ^ð»’åhÿ;æ‹[Í¿%?ÞÏŒAqªÆ=)q“3î,™Gªå6wˆïÐKþ ÕDL•A›H¿žž“ôä!™¤ ‰TDÊ‘ÂÌI›®A 4[ªrihë혤ñën“•­;m+¿;Hý6½¨†#Q)Q ê1‘Ú—j±}þ‚£%‚öˆ©4Ú[ÖMD‘JPEô×èϾÇ.Åà¾ÄŠbD9‡{,b Rp;¶Õ®\´àÔÆ©ZfÙ²qötÚϽ­Úm[¹Y»ÍnÛÄp®'.µ<·DÐ÷M¾0Þ5ì<Ö¢ñD? «­ÛnGe\å÷ª}‚ßJ8ä™V¢çï„eùQÈyT$„Þ#•Å· U|MꢨÆûÌ6eq¾r«ÓˆNÇô"膻ñ'n ´…ßNÛÜéùöYQ€G$V>­`¯È›¶»Þ4Í ö—õw™jDBÈä£Hpö‘T#µ DQ ÷å0×âž Ç ’˜K±DB‘Ö¸ò”25&@«ÓFæ4IQ’ƒÊ J¤ Q}³§œ…0éªÙ—/Q‰-_¢x¼ÖcŠã¯¦Ø2w¢[wRdºiÝVUú³¬È\*mZ›½QnŽ»J7-›Ð0ûÌU ­&ŽrŠ`p©ª£"Ìòk¿Ñ@©xªÖ‹ Ê‚=펻†ÐSDAMDç‡Þ2`’!Ž! C2ÉD‰I“f ʬÎú]Ñæ—° fdØ øš‘!¬}{`™‘&eðöIÂÖûÌD"ÌØ ˜#Liˆ©W«P!àÕ#ƒ€ …X”^Ì 490'†‘·º|Íú&&¢)Ko›5æ‘1åGáE²%eˆ¼¬w­!Õ±|GÕqVçmÖzkªÖ0»¯<·ï›ÂA´nµÑµc>Êê$ÕÙbÒ;¾`L-ÇÎBdÛ}É?=‹S¿L€df.„•z/˜È³;Üßþ>>ûÏà<ô~5Ï$“½üC^.ŠÝÒŒ?CSy2ãËú—ëf8A'LóË>“fϱw¿‡û^æHró´Ûw›>ðÑÚô¸5ÁôMÚú_„÷hÐéàÞQHâ;"jSþ,¢°÷¡ˆeμ7¢á휕çHÂ$/+JSßj¡ÁhsÿC2ã endstream endobj 880 0 obj << /Length 446 /Filter /FlateDecode >> stream xÚÍUÉNÃ0½÷+,qiQãz‰X H‰+¹Q…&”ˆ6EMÂ÷ãì i” ÑSlÇïy–73ì3”~ïÙj-PpÂñBap¦AB0lð27M×ß›;÷ÛY(Œ°y´;X_Éæ:Ý™¡ç½ bhñj<C]¥@Á Vá ¬ÏF¹ÂË‹zˆ|ßDÐÜ³ì ”Ì @4a¼r½í>´S¾[I¸Š­7}'€wç¨Æ Ç”"‘Ÿ ŒG3”ËîaiBÑ)‚óð¡ží]´{1IÊ-'K¡ÔCïVÅœŸò±à {)» Ý ðÕš—ëVr,ª1Ú ¬Õ@ª^É¥òG|ù9J6ahn»Fö\î  MÍîJbš\ªðɧ5-»ãœoë4f´Ös0º> stream xÚ½V]Oƒ0}߯hâË4®£|t‰&jâ3oÎ4uƒYå£nÔÅo…9Z î©¥Ü{÷žÔ `€û±YoüÁøÎ3=lbà‡À´Mha°3¦å‡„°UD2úœŽÓ~‰„¥ YYqt6Oã©á ‹Ó'ÿŒl]Û#„ çh( ö±ƒS¾AÑÎÈJØ_ x}&iÌhÔMÞKÇ?¨Ôû˜£ÝØ|Íßû%ܶz¦Ñ¼ß=ó fÁ×áñeå~À5£ÕgWü’‡èÔ} NÇNiôû†ÔŒÄNÛì+Ë[ßaõY7ò,ˆ‘·‘$«@ŸhRq²]ÅIî,Kþȯ9ØŒf2x­êUÞ‘[ 4e\Ô(+NgAõËí•QþM^Ó=.E…Š‚0k?·Šã’-^jÙ׈t8ñ$îëÈٚ˭?øÓkÚ endstream endobj 889 0 obj << /Length 430 /Filter /FlateDecode >> stream xÚÅ–ÍOƒ0Àïû+šxÙŒëÚBƃ‰3ñÌM é>mdŒ¸¡ñ¿·Ë([ f'ÚWÞãýÞWA`xè!Íó.è&Œ™G<,ARìŽ!q(æà©!âY”΃!%´#¶ÑhÍøz;x ¥¡!ÆÑüå0”çáJ|ä¯ÿì¦|+fáv±ËD—Š,äI}=#Šöæ\ }ש³¹ão 6§ry¥w¨NYBü*Ë¥ô_ï õ>¨\*ÑOïNiÇ¢tßÎû4›¸ÂPÈ,³Rµ™šeÊ%VjÇUM®"˸ÂùfÍElœ¨ººÁ­ªŽüà;W ˦:7ŸJÖ:iJŸ`»öêÃ.5ÝR\%q ÃX;ù‹&5˜ÿÕÆVd'$×pfàV‡XÒfÀ†´{çá;VÚàË¥qö“ÏPªå~Ô©î«5vBQȃ'Wæ}`ì·Ò„ŸÂR-óÁ®4ÚÑgó‘ÑIÍ„ëBà5 BÆÈ΋âûÅLµ¹: ‡ÜD¤hæÑÄõÿüÙ³1ôWv6ƒ¾ïgÆ1¦ŠÊ}Ðûz’¿ endstream endobj 893 0 obj << /Length 1634 /Filter /FlateDecode >> stream xÚÍYKoã6¾çWèE.Ö ß´è¡@·@O-šÛfa(±ì•%E ¶¿¾Ã‡mI–½v£½ÄÉ™oÈyr‚£m„£_ïpøýùáîþ£¡‘AFR=l"Ê)b’DR(D™ˆÖѧxµÊš|Õ&¥‹¥ "¶_».o³UWde±ªÞVÉfã×¾ßuUòañùá7@X‚Œ¸À(=£#}µK± ?X÷¹î ·Ô I-£%ˆSîÙ>¼?jp\§ °²c—O>8›ˆ`b9:€·{î~y¸{½#0‹#Q†–&’~AðçÝݧÏ8ZÃ"œ1££7·uQd´Qýy÷ÇÔM2,T$‰AZHê;+`V³ÀJŠ”‘CX§¦ XmàbXC‘`|[½b2Ì0lL†%š1­!‚RŠô,×ËÀô´0#̪ʿN  Š$žÅ˜Ø®€ýSG9 ÑH v´rïëôcZ¤ëà "â/öOZû ­w#7/I Û¬/)H*ü8À®Ë]’ »hý ~y ¶ìòt—mã§ý²8.gEÕµÈéะkIc-Ôïiüo¾vYí$¶¥Ÿ} DÛ:MZ'¼ãŸS!çï´.‘?ŸE; †ärD L‡GÂHD8—…´dÀJ ÃÅåˆÀ9’„͢!ž‹Š#&È,°J!Ƈ¨SjíøÎibàçÌ3^¢ÀKø^óI½ :ÞvÖtKæ2@À½h.LAj’tŽÓ0¥ä*sáX Y@9ÖˆÀŽkŒ…3Ž 3³À2… U߶Î5°’³` ˆJLZËTjDå,1€+‚¨ #ÐéüÁF´ç€#c®³%AÁ7f9¬€jJQs?.™¢$ù0~ÛT@ “Šó'DQ¸î¥/VNç}ö#¬×-Ý6¥•2÷ŸÙ.Ë“Ú+Ç›²žP ÑAmv96KŒ¨m`j”½/6K†¨ÒŽf—ý‰H6¶ÍkàMAäö\tÛQRÎË¡|V Ãìdt†7¶UË ˜L“ˆ1§£³`ÞIfá‘VÏgM½“Ì€ ¶«‰¾âz!$k5J <$¤¸Ê€•P‹Š9`5P‹òI­Žc <=Ž±9±ð¨1â¾dP5+¥Bƒ °ÿ.+žónº?Bh¸¯ÊükQî2ˆ1/?ïUl³/Ã^Åë‘pµ)óuhYLq°MÚ®œùLÑ>b!¤ÍÙ·{%À-àÁè–Ë©«·ÍKxßeŧͶ/í¡-ÏKúÞ›Ú%ÕŒ7Üöͨ¤ú_ßÔ¡vã}yº£}åsóÝ8 º[Œí[ÇéNnRÜt“ò¿ºÉ£ýÍ}“G[ìn1ÆÙoòb+UôZ©LÈxÓÏ-ÐØOƒhY±õK‰ÿqDzkÏå®*›@×îl3[®ûSá7 ¿eíË`»:Ý.ã*KŸSWógM:uÐ×.i²ãå@­¨u\§ëÎIµ#T-p¢¤õ+YcßÆ Üµ¶‹¤•=]|*»bíg¬š]Û ¦}Û &›d—†©¯U%ÍT? 3DÈ¡ûJš|ë„]ƒóL—µðÜà‡ŽC7ÍB™~ÄÌÚ&Í7VïVN6nõi÷šòK½f|¹žžÞ÷òÜD›ÖMêî3ðÚŒ¶„‡ÓäšS¸$Eh'2áú ƒc{ êÐVdT:^v.,Ž­Á­èßNôïÉ’ÆO'þsoÖ~ÒƒÀ¦ðæË© Ÿú' £:öâé½Xº'³ìz‹p~°BÁEð+˜êû•Ýº÷+'þÇ^;8˜ioÑ›é„/ uÌ0õ:¶ƒ£Ží—~½n¢¯c;ãÎqÜB‚H–§õ‘õáü§tôßx°À}îW|÷å Òƒ!³äß8ŽÝ#&jD3pO¼ä÷:ÍvÉ6½¦¬Ü|ð3AèÙ¢îé†jò ÎþÜ˳çòÓaߪ "ÿcvsJƒ>Ý’ÜÇÿ¨ëýŸîÜ• áúw‘ÖÚ³&DHà©ñ1( endstream endobj 897 0 obj << /Length 401 /Filter /FlateDecode >> stream xÚÝ–]OÂ0†ïùM¼ãJ[è>¢ñÂDL¼Þ’¦À˜l,Àôï[hÙPFìÀÄ«­ËÞóö9§ç¤Ä—Òϧ°Õ0p‰ Â) AŠ}àR’ἵˋÅWÔq(¡íõj­ÔâV¯X¶ˆDÂãˆ%ùl%ŸNßEaø úúýp0†­]ñÏ£AåÛÝFŠêU…ŸÖ&\ãûÜ1[ŸÍ“}_É5«v-µKNÒƒVoD:žåöAÆí橘§ë=ÁGsŠ«™)4z#Ç*ÿ5qÀ÷Mó«Ÿs ìú>p/DÞX;XЫOV³À*‡þÛ(»©¨k!s%<Ûñ¥3©©Idñ_™ÈÉ<á"µHã¾÷H¾ž=Yi¢Ò[¯¤+c`Ñ¿ÃZðÔjð º^±L‡ôX­ýw5llʈ]±ªí?®)±Õ踹ÝAßß¹RS =ywqH}ßW1ö*’ç°õaÎeá endstream endobj 901 0 obj << /Length 651 /Filter /FlateDecode >> stream xÚÝWM›0½ï¯@êªÅÁ6£V=TjªöÔCnÝ ¾‚–/ØíÏï€ `²Ù충z‰ÇÆóÞÌcl&†+†òùÆèÇ››ÕÚ!ŠƒF˜²‰bDV˜e#B-e(ßU×MªÔ­½ûPÓ-b©í,kÒ:qËG׋"±ú6+½;ÃÂï´›¯ŠnbÄMªè#Ç’€âäa´õªÄw3¯ìQ:oCö“ö¹å>L2/ݽ—ïˆÂr£ó^¦–s˜SoÁ¼=Æ¿,À$û1ùAßÃ8ªA,äT ¾Ir?m‚ó=€®š<)ò6"´û°ˆ,ààsL@6 8ì ŠÌKò(8çn^IÁóËçdöÖÉì_Z>O'ÏþÝäûWøJoÊÜû—¯/;£þw Î*ñäi)Ø’âwþJy{á\A¬« ²Z›|òùÖ9EŒ3ù;³Ù…S›ªQ“û5àVíÔTý"+›ºVïzã „˜‘Ø;<Ž Âxа¥†¹XªÂZl*öb¡Ë¹5Du‰H¢‹®¼,|öÙ–ÜÈ·Û‰4.¿®¤¨þn'ýNdµXm6bÔl/ Ä9ŒsÉåÓææ0¼Ò endstream endobj 905 0 obj << /Length 503 /Filter /FlateDecode >> stream xÚ½WMSƒ0½÷WäŽÄ$@ ãÍuôÌÍ: mie¤À4àÇ¿7mh 4(MjOdÃîÛ¼ÍÛ@` x¡úyŒn||èSBA°Ä!ЦPw ‰í‚`^Œ0LX–Ñ{lZ.qU|†Ñb!ì«"º6_ƒgŽia }÷—¸U•–I#tM‹o·á–ƒ¡çØ2eòÑ—ü°UšN£ÙûÆÞ'âøh ß~jͤ»è~zTƒžH#v/F¯™twy…Êíu‹ÔÚë’Tax¬1¬¡O¢vƒ] Ùº®ç /WáeûS"•>úM×Áôé©*½øxÒ»}Ýñ%Öc*] -­:h*á´i®Ñ tX3(N{y°æÔ' u¨²$φ©¡éz¨Ã~W]’3T]MÐá]eTjÒèÅû³0’¡qÎòÈø ×̯0D¹…þÐQ#ý›ŒzϳªN˜0ÃÔtóàxt˳!õ(°ˆ },Àƒ·˜q\ÂcU6+9,Û˜ŽQ¬ãY¾*òÝëò­^L"kV ¯ØÄ®ñÅ}ã¡ÂaúÝŠp Æ‘²y; 4-a㩎ɹóZÆþÓÄÈÈ×svÍ]TƒòÅ”¯w ÂJ˜xiµ\ƵK’•yá@„m"ps”ý¿À¶ñ˜W·žç‰“aì·¼îƒÑ\¸ïx endstream endobj 909 0 obj << /Length 388 /Filter /FlateDecode >> stream xÚÝ–Oo‚0Åï~Š&»è2j[ÚB³e‡%sɲ#·iSddè\À¹¿‚€(ŠÌH8QÚ¾×þxô@੃¶žV§?à(8áÀšLMhP83 Ñ°&àµ;DØè¬ç®? fF$Kº.’Î/Ÿãe˜ëªDv(Š¡Iu  Ý\‹¯üù8XNÜžÆëÞùaÐw¦Sø~J c(˜š–mËvÛó¿U÷øíÍ ý±ºÑºê:®“và¦MCÄPâ÷7ƒ¢iä|dL¥²“%|³.%2"GÅ·‰TËË«Ãx…)I&±X%$î×I kµ²[¬*µ§D³“fî6™¦j6Á™høeh¢6eãµ*¯YÙ®PHÅÑÛÂlD¾ZK?¥ë©ä»oL”ñÌ9ž²¨­ŸYêÄñ\P‡¢3ªî~Õ;¤ e«þ¢ÛúÿÛc´Z'Ö4~Y´ÀmmjµÎ²Ýhû®öŒAC`¹z4MuIÇå$Vç:ˆº endstream endobj 914 0 obj << /Length 1423 /Filter /FlateDecode >> stream xÚÕXËŽÛ6Ýû+tã)j†ïZtQ )Ð]ÑÙ%Á€±9¶PYv,9Nþ¾—"¥mÉ3 hºâCä=º¼—‡‡ÄÙ:ÃÙ3ËßîgoÞšd$•ÙýcF9EL’L …(Ùý*{7xȫ⡶ÿ¸»… bî[ûÓƒ}||(òª?ú*}ùùîÃýŸÙ‚¤9Ë„ #KëüsÏRåZ gvÖΓ¸±8nð%¿F~jŒào?±kõ¸kò¿síÍ[®{Ù°Ð I-³È`ìÞoÀ cfþx,—u¾+ÃÄ$„@\(ø£f û1³ßïgŸfzqF2Ê0âF¤1É–ÛÙ»8[Á7ð1£³S3r›Qd´Z‘ý=ûk(gC›Æ”S &¸9€ÉaXžTPX•‚®Ý¦dHq1 ¦”H1žb~´U¾€5°(šOk$⊥°>µ/†„»°\}<”UHŠð· Æqc¡é[îÊÚæe^®C»Þ쪘b®p‹°åˆHK¦øÖ•5اLÎóÒ— &»ÐQmìÁ­Bgµ·Ëؽ{HWB8R°X¸Ë2àeˆ*Ù *WC– BÕO†è³†Nwp¦¨„\}Ñ?õ6Zpr}p¶v‡vEl}=îÓÑaY)Õs“.k½\#Ä™|Î3Œ íÜGw ©p$ ¨\! )à¸!× CQ$¤!òõ–„V Ï=`Iš˜ÐûÓ¤†L¨ 0"d(†Ké 0Ö°aTŠ9DP 6­¡b H #O!G‰‚=m'¦€,±¡ô•„ ÝÒT]Ѳƒ?¨ˆHÓØEz`þð+}É=øŽ–|çj·µa€áF!=»½¸?ìFÆ›¿¸Î ƘÄ}ÖÔ(G($}ååqMZ–D  0ÉæÀ$0¦‘9š®A’›8GÓ}š †šð–¯é ½®+¬ ãÂ{¢oJgP(T‘Æ’Ò1·Ç¢ÎPA/ãI@%FØ‹™>è0U(‰¨3·c*K¦RÌÂ}À4Àœ°o'À4 )Î1/!AÙ!IÙœ€d#4…¡'ؤæRÈøì´a'Äy°qA¸!Ù9}΢Xµœå« iZÙ‚u-¸•-Péd Ô[^jú£„9£dÀ€Te·û¶– {¦DBÞ:,<ó/ùr·>Øý&´J!« åé½di‹â«Ÿk õFg@£e‹¨3 ìØBŒI ÐO?<Ä$œ%}®-WÈŽ+ªˆ¼w[Çe‡f9ˆÊE|D8ÊyƵö‚ö–¤ó 1°¤à`—8š‚Ÿ 2O€ à pÁ`š)A› ‘B6WÌ%50FŸÝí~ߤÁq#ì®ÚïÊ•çeÁŽÐæEŠ‘SB®M!9”†ˆç$ãˆQ3&ˆ1—{ÚˆNtÇgXÏ](]n|Ì÷6?„>Ð:áÛ%A+/Ï"QŸîü਴¸¾¼‡ù`W¨Y |öÄtÁÁá¡£ÿ ðC^.‹ã*>Sü¡|~¢Í¯ã¯é3ËÖî/ŸYÜ'ßÿGÑÜÞ¾öi¥›ø-ÏEƒ~õ¸òäǺþNâq‘¢OŽõ³òyÇ)xcºõmDÓÛ /åkçß´Ä7‚WÓðVÿÄwàߺþ.ãwõA–v²¸"‘CÐ ÂÕ×y£[¡«Y_ùèê“sehtJê½Ó@ˆpFˆxqööpGô|}ìéé¹ÇqîŸIÐú|~ÚâèªÐ®@²U_C£›³Îý°Ï^˜º8ñà ëͼþ¨¡£Gͱƒ>öçŽÏ¥nN ÙP6'ã<=Ø:F;ô†˜· ×s" 8¨œær7fÊaBI2äÇ¿F}ŒR endstream endobj 918 0 obj << /Length 1229 /Filter /FlateDecode >> stream xÚÍXKoã6¾ûWèE.bF$EŠB‹Z4E{ꢾí. F¦m¡²ìÕc½ý÷r([r×IŒ"'SÙoÈyqÆQ°¢à·IäžOîR¤$•LóUÀbF¸¤ a\óeð1\,òºX4úo3 &BûÕ–ù®\lõIß·°¼›~žÿÀ3JI*.oÛ¢É=Äþ°Ð«•GÙ¶{ý)ô‡4‹)Q1Ã[ç_/fì¾Ea¾-Šf¡›‘³À"‡ð¼ú—ÚB¾w[¬ÿ?[¼9.îbÕ Ù™âD*̘ "òèó©˜Ñ$\µeÖbŸµ)LÖàºÙ8Öícm}†áîø}”¿{<׋£·æÖôêØ}"Ê^‘¼ã·Yî¶:/ß÷¥^ì¢J—ë÷æ¨g+K/fç¶Ð4êÕ'9v! i—4 ÕeȯóÉ— jЀqJ8ãç Q`Ùvòñs,a®Axª‚ƒcÝŒ¤Ê‚Á_“c6 §ÔAI£R¼æSµ’’HÒ›¨•1z;к?„3crI$eIîFŒCùæmÆ%±ˆoqxÎbÇü*›qA Moâ*.bBªÅüÑ«$¡’ÝD¯J ½ÞW \!;Wèr9â-* K.‡x,#ÂØMÜKNeW¹+VNî&jSàg™å*×SµÂ>ª·P*ƒ²“^묷yHãa僚7¥‘m>8åá^çUKÛfpÊÂÊÛKu¦ôÖß(åtäמ1/×…Gí êƬ™ Sy.“CÏTUgì¥õ p‡=Å‘ŠvvË®7zÜ5›¾RÝÏ$tepóMÔÞx†îšvÃõyVèx‹‘–ãÑ4c¬‘8ÓÙ*¯ñã”´Ÿ'1W]~Ü8Ž‘äXWÌÝÀÛöÔRèA÷mƒ4¼gLÈð÷ÕÙùº`qyÒ»ÚH÷pÓêŠPCgd`¦)g«ÔÛ6;Xký”{Ϥìd|ËVá¯ßäG' ­Û­GE{vµœÎ?~wl†±Æ°¬´ï›][ØcG)x i „Zo¡)(‰o·¥{瑺&R"»üÁƒ+b°DÁ ˜¼©0C’ ´YuC¨Ëï$:Sâ&j%Ì÷ ª½ø Èc­×E½Cë,3{tBj „¥ÙRƒaÆbСÎÂÌyUB»qKv)is_ œ²€x€±gƒŒ™vƒó)•iÚÊE 5ÒNYÞA"ÕÙNEÏ~“Ûr<fÍÁ–Ñ– Ÿ€nó ø’ɧ7ŸŽM>¦9Ÿ{.M Ö~§–Ú4¯o¥H°zAÝ;µÐOŒqšþãþ0E¿àþºÎ³Þÿ Ú['¦sðGX^o™1é× ƒ—¯8:?=;Ãc'E(å³26Ró/ÁOk endstream endobj 922 0 obj << /Length 387 /Filter /FlateDecode >> stream xÚÕ–]o‚0…ïýMv£Ë¨´¥Ù²‹%sÉ®¹Û–¦Šºf|ÿª""ÎV–¹+àMÎ Ï9mÁ `‚—ž™_Ÿ¼ÞpìbàB×Æ6ðæ[›Ž &x>xë3&’€¥ük60(¦ýÍÓ„'bÊB¾Ün'òÝ >¼Wél ]ª¨Æï&E÷[ÃBбÈ1Ÿ…XŸð©ÍØrûÙ4•¾æÖ¶ÝõÏØìv¶:Õ†ÇC."m¬ÒP‰§&Ó)© ²âÑbvJ…\A±÷× Sèšdçx#¢iù¹ßƒ4f‘ˆ#–ÌRøùØþõ M%‹b¦È¡k&oÏ昺»|dØÊùÔ×J1;k Û?–æ™Òú9¦ÖÙЧ/ÛÜÿðÛÓ_äk(,ï0 RÁ¤¦zîg—ìÞáZállhµ>U'ét{ÿ-.ýÎù|®Ü¹Ô4R‘³N:/½C®šMU«ßy]×\EWñåT~¼)…#ƒèŒòâ&5ɳ×û–ggb endstream endobj 926 0 obj << /Length 659 /Filter /FlateDecode >> stream xÚÕVK›0¾çWXêªÅƒ½ V=TêVê™[w…Ì+‹ÊK<6¿v²’nÕ^ÀŒý}3ßÌØFG;¤£ï]¾¿º›íƒCƒFrcD,‚Mf Fï11)rCôSñ¼¤N½†ÿŠTªt_Y›6‰ÇãX˜>fœ<êÔø¤>¹?fضL¤vè„e—¼œ°”ûQO O¡ó¥^Åó]ä•U¶A~õuÞëRì¯YÉ»%×—ãÏêg«ôŸhýOT¾Reà˜·Ë¹*—ÞXå¯e6×ÏÖâÿþ­ïª’þ •‚¦Í“"_³£Ç€K*ÎÞêØ…²v}㟡9ffû`Ù£“S³MÌl†4bbÇìî3КÔV¸_¨U^º‡4Åm4à¢î>%(²²mä\sÀUQ×b(“">Šx²ÐQv‰Jü¹˜«£¦¾ƒ¡M•*Jùà ÐÕR*†€°ª1Ë’Á3C ‹Œ'=–…ç¡°ö¥ªÅ¸Þ"XUE5$QÎòJí+^–Q(–d¼”ó~Ôì#ˆz!¦Á5q áš8dpÝ;×­wÝ’òØi°Lª¸ª­+…\é7À%©è‘óQ×MÞÀÈS2Ï]æt¢´u4ã‹4-ºdï“|·t–Œ K¨ñÔMÄCÜ-.ÞÃ{vû}ÔB’¶m[°pEŒ!ßÜÍo”qÜî endstream endobj 930 0 obj << /Length 442 /Filter /FlateDecode >> stream xÚµVÉnƒ0¼ç+,õ’TűML@­z¨ÔVê™[[Y„•M ¤¿_„˜-ÁÈ9y‘gÞ{ãñ‚À ð>CUûbÏ–o´ bÛ!H± º†D§ÀvÁçœ1°­Ø,4Jèü8 yRî«óž²d»™“~!ŠßöXah®t a -Ú Kùo/]ÞÃIÂH?¡u§h§D…ÒKÆ;?r‚Ì­øžrÂeùqt¤…?ÏÃI4¥¨1U*}¸ÆºR*7¹MV¬5ë gÈ¡ÏúåºQí;m7·,N-}ºu<0M˜©ÏrŒxŠNs*DjãÝQb¹çÕØñ‘Ar¾¶@Æ5Î94æÔ $É%îvÊáIþ:DCçG\:ºø ;Ü:‘ ?E„’&ç».‚¸T¡ÃDÚmü ƵkTÂ]€º‹µ'LÊi¦{¤¦ë âÐ ¦fò¶ Qñíîl$Þ¢b½pÍcæq'wÕ7EÚJ"gÑŸ°íó*¶RaZµÌË·•)üˆ)…k Mס¹®4Ç„6 ¯öìQ“VL endstream endobj 934 0 obj << /Length 886 /Filter /FlateDecode >> stream xÚÕWÉnÛ0½û+ôbð„û‚=h äVÔ·40To1*K©—¤Ÿß);’-;^Ø´=‰ÉyÙ7 )™J>·hùýØk]];N8Í5é §³D+\(Ò’Ûv¿?]¤ýÉôqÔé*®ÚÅlñ ÊéÛͼ?ÌgÉ4ë“Á2Ÿ—³oTÑÎ]ï†HV Òe œª‰^&?öˆöc”ÀÞyÝý2NWožd“Ñ?¤×çÛé¿®]lÓ]]K[aa× ÐV“.Wà¨{÷x–9Ú¯²Áršg‹p²Æ_¥A(‡äöG´ØÓúÔkýl1üK #\0\% ª­É`Öº½£dˆ‹7„‚p–<ù­3ÂÁÙBXJ¾¶¾4E‹ ó¢´,Ýn¹ «PÍ¢Àj TÕQ½GPã\T'ÀX[‡ |ØÅè9£m \Á-eê¸!<¨#p£ÖH²aI˜Æ=‡I"œE{g@YwE$G:‰(F“Ü ÉÍQ‘ édLX,Tëã8"­*U\Ç ¹çºÛÙE IŠ,QKX£Sí_Ë9*ÒÌro–OFÛy˜$ó³íÉj6Ê–‹2ÍóÙÖ‘ùh±JK9ù¸<>ƒ$MËÝy79Eâiq˜œÆA±] h–KØi9h¦¼$íØavRB«¨’q´¿¬£î#§pÀ°D@•ÈüSC}˜çÃz¼!‘h´ÌÆJ¨ày†ÄÁº$+e‰[¹Í n…w½_ Ÿàúb¡ÑõŒZЂ.^X•C'0<§.JçVcb’^’Q¥9fÉCÝ(kxLAщE ¬bîq¼5Y ÔÂáuÌnw 1—>$YpÝ÷Qp\%KŒ†a)„1*ÂßÓ„c…z«#Zç®h{µ˜f“0ô9£Œó4Í;Ø=mÖ6Ž§ß¦m_wÂ*´aÕ¦éÍ4¤«aÙu½GN]¡áþƒW”¾Ü Œxnqvasÿ,GûšS}†>絤G©s’y¢<þ´ZÐX'ùîè'Ï«Ú*ÂS§Y©~Öò… ]e˜ú§…îæLåz›}[öê> stream xÚÅUM›0½çWXê…TÁ1&& ­z¨Ô­Ô3·n…\0ÄZ0LVí¯¯Ád6醨'hæÍ{3à‡@ø¶BÝúÅ_m= <è9Ø~ 0BX.pÈb›?? ^¥AV§’Gš% bʼ ¢<£\îÜžk˜® ×¾sþAÁbbU‘ò°Ûǵ¥Â®ô‘–í=6¨>'L°’¦üm‚ô]ëUžðž²©Ôû¢Ì£:”#ð>¿XÉÎÉ}¬X˜‹¨ AŠËÚr¤Î˜ú&£¿õæÓ++%;%taT¬-bt¡E^ñ÷6G]rÇ5üqYɹª%U‘åÔ×,Tœq‘tSŽ½–b"‚“Ö4²ýOáYŸR¶7ö)çzžòbým,àÂÖFokÕñD4 iNj›y[½„‰ÿ»µOyáM-ë»àR-ëcâ¹—Ïy¯è%åNÈŠçêÑkôOô%¯ep§ÞÜͱ‡½ëýüƒ×ÛÛCÇÞÓ¶¡»ï¾d ï)_ýÕ_æßÜ endstream endobj 943 0 obj << /Length 936 /Filter /FlateDecode >> stream xÚ½VKoÛ8¾çWØ‹\DŠDY´…º@[t¯k`›B`$Ú&*QZ‘jÚ¿¤†zšNì¤èÅ&G3ß¼¾!8'p>ßæÿÏÝÍݧ9‰Ÿ`„ÝÞAkäG8tp¼ñQ;»Üù×MS&ŠT’otåÅ(võ®l ÉÒú1%û=Hß”5 oaÝrÁœæ°«+q»úºûKùôÂÐOâ«qÑ}‡o; oúÛudC:°ïO#-Å©¨ –QtØç¡/Lޒ伌§]5,UªZ™žT ÿ¾JµœU|ŽgËÇn6„èëêi  l/+ëõ ;ãl,ß0$wŸðtB¼$òq˜8Šý(0~îƒp³0Zo'FjEêC§ü7+U™îƒeDª(†ÀcU­tþ9R¾òN\R+e'Â[WVF[A%ì« -:HE0´Y»òHA~`¢×¬i^l.žBMTÑH[­DÃ$‰ñš( RR1.i#hfP”ä‘É#hõÄÍ*¥µ c÷‡Á ãuk¾A‰ 2S÷WÞ:Æ~÷¥g‹X“•i˜8té-)˜Ô1RŽ@ žÕb‘€–P-Int ö)(À ¦¡B±ï6GVPP EÑ[tx¶C€IF»Šl j…]ÒP54oyN¸„m__¬}Ö*pcXõ¾.;³™"–•Né»þ¡yWØÀýÂÁ0#ÂèU{û€šRºWV„ç°è»%nao*ôLU«)SÕ–%ÝWMIóakœÔ$£þl–¦£!<ŽR¤Æ]W¢Â߾噙œhm&GË!½šÄ3‚ Ö«w´œÚÅK;å×Ò[J²#PAUsΙŒ…˜Òrø†Ü¼*IÏÕ…!¦E-kF3ºRÁ<21g«b‡€©‰BìYÔ`ÂÖdRˆ Êß“¿b²o4ŸDwÞí.:=ÀðCˆ*cä¢/OÐUßµã‘;{ÉôwÏô˜þƒñ¬hss¼S·Áj˜|þî˜ß”D°,íš<<(Yª{~õÝ·„|PË‹ï²¥q׶òÜŸÏlžÓ4›ßQ{ˆöÒ|/6¾6Ø´& )ÅÕ°$¼&fŽ‰=CÆ’ÔW“QÙœQÉž #~ŽO#äƒZ^IÆÑøåý}>³N¾NÛ«üÓ6OmÚ.ë‹uТ½øeý ºaö¥ÓfI&ø=§Æ™<æL:û‚ßø8Z« Nüív NB´™|ÜÝü ud§ endstream endobj 947 0 obj << /Length 409 /Filter /FlateDecode >> stream xÚÍ–Oo‚0Æï~Š&»è2*-´ÒlÙaÉ\²3·m! #$sUÿ†étžh ïcÏÃ[ÔÁèài ç×{0ž2 dS`Ï614(”L 6°]ð2t?^: ÿðFÁd¸<Ê&×bt3z³Ÿ…¢†dDR{I^5[…‰÷•¼êÝîª5AË4Ú4þgë/ç3q?Nœ5žÓwjûÅN‹QXûs-¹°B™è•Ζ©›KÞ Íqú«p« ßï÷ï£nEQS1¤XÛÙr´!MÉT ;ûÒ,îòa2'âkÄí€ôD€e™uý@æâÍ;:ózk*™—’é¯^ Ý‹U3—‘I3W<:ó?ÅrW÷ÃÿÈ­Þ§¡ëw2+e&…ëÝ®|>o6*ÝïŒxºâ‰˜)½Â¥šõ{Ûαè¸Ï®ˆ7+1=H—‰ßØr±¦@S98w‡Ñ.”IW´ie JAÕ4£Í¹c’!]KqUùïOœˆÓOà Z–•)#Ìj%öàž±’% endstream endobj 951 0 obj << /Length 406 /Filter /FlateDecode >> stream xÚÍW]Oƒ0}çW4ñe3Òµ@Ægâ3oº4d“È×üø÷vÇ·0èSË çÜžsoo-@àA@Éz§ ³•…T•T ›@B¬•Ì¡$ ¯ÁÓ„1+°ÙÖzßLE"‘ÉþÉÿ`Nd‡3L3Ž^ÄÌ7Þ 'xFM—ú#P0ÔˆCJrü¡ñú;¿ïWÔ 6a‚â;ž_b}únòÑ¥§+ÎÍ‘ו ŸU¶ ~ǯlmå ¢kÀ²E®å¹e]Ùp7]ÄÑ õŠá©º•ç†›Ï!vmÌ6B[°‰ÅPåv5  Šù£n“uh'ÔF'þÈ‚þº>>FEoÖµDÐÜjÓX«ÈÏw£vD_Ftìg:ÐÔÇ®Ÿ55F’!Å8¦¾°Ü•­âÎ<ó=ûËõË°áËmýqòfîRTf”f¢g‘2ûεWÚÉ;ù.ü']Ìôìuà (¾ÞWQ³¹÷Û<8öýl¡h™¿ Bàœb~ (Ô4-fÆ2ÊAîuá$Ц endstream endobj 955 0 obj << /Length 496 /Filter /FlateDecode >> stream xÚÕ–ÍŽ›0…÷y KÝ$Uqlƒ V«J©S©›nØu*ä˜Xåo$·¯™gpÒ$jW›s}Ïw}‘x|¡ÍóÎMï9rFðc@‚{€Q›?ßÇA Ë$x”ËhbQBÇë·§"Ož³<•" â< Û•·}KJYVˆ¢Éÿ+p0ôXCNµ *ñëøëá»&:£Œªl–gUô{~ߨ-sºÑbÕM¥cS_hL…Xˆ´ìµwbõTèNÙ¿ãôZoZÌî¹êË 8€  »u±ŠÿS—9ïWgÁÌ,êLæYÿá4Áè“ü9Ô7ïÉ4e×ìX ky?¥=ŒºË‘é¦Qi’tØ­é\²iΆdƳ½*MïY÷ždq2ÌEè𠵄Ý=‘ãuDjdÛj¡ùøNfbñ<±EãO YÍÓ¨šËY;ñ­ˆ¢RK-Þ.®vi{aFtmÞ†#³YR‡“”ËéR$pþÑÌD/wZ'• –Z÷o炲þ9¸dûÓ%>¹B¯µäu^ž»3ÝTÇ5q<€ˆúºÃB½" SØEQ£Óh2rÆÏ­%¨{ØÎåd?bº5djJ¡Ë±* ‡žçµ‘±5Égô¡É' endstream endobj 959 0 obj << /Length 520 /Filter /FlateDecode >> stream xÚÕWßo›0~篸Çd®mŒ±Õ·I뤽Mã­­ I†`ÙŸ?ëÂÓ'kÕ'ÌÙ÷Ý}þ|:†-`øäà?ß¡su#)H$9ån€2Šü .#H0\Bô{8Ûôg'?v@N†(N†°i¬~N=¬ü¨×ä}€m|-Ù /fhžfÆŸÌnˆ›«x;ƒ¿ Ã*K÷ÙXµ®ÙJ;n•Ï`hö?‹¡IÉñ¦•ž“1ªY²> sÉjTiö6«ÑÌ&þeS¯Ì¦O¥æQTßf«rB™E¡çf“½©˜N54É„Ïé@ÿNgì{É÷e£Ë ½/þœB#N]³3®Êgk5ôÿ_ÝÙR»—ìÎü¼îlÃðívç³Ø¾Fw~¶B wiÊÈìpFâªj~!OÀtïCxˆ .õ$ÙÔ{ÎÇÐùá 0=¸0 D"æSX)çöC¢7uBÈ“ŽÍQI!õj_/†¹‡NÞk ¨þ6Aë ÇA%CzJºHPYYý˜ZŸ:æÕ Ý“A5Ôã™ò¯ÊbéR/ÊïëvQ¬Wû,i×ñaIÄb[©uV¶–Ía¯wÓCQ¢†åãP‚¢€éÛ—HÑF$íÑ7ò!ë#~ endstream endobj 964 0 obj << /Length 436 /Filter /FlateDecode >> stream xÚÕW]Oƒ0}߯hâËf¤£ee&ÎÄgÞÔ™U]¶Jü÷vÙ(£`Ë4ó…±ÛÓ{îW;L îz¶âó&è '>>ô]ì‚ ض!ApÉb‡€ ý3š½¤<~X“þ]¤C–§_Y>£Q ß®OÁ½à³‚>ÙbÂPü,œÒÏ-jõm¾GmŒçkÅñ£Mì5áAoäÔ±.£FÖ9CjŸÚÑXø€.× –Ú Y+òäµBWíc-7+td*)~YkÓÅ{N³¥vZO[t˜äi¬V¾Z=BªË»°"1U^¡1QÏ3šgêÄ×-5sÃ>\/ùmL&Qh` þ¬óÿ5À” ÿQ/›T³IfO»šõ'ÚêÑ1ù<Ò\½"(ÓÖ9Öˆ3 O›\+J?aÛëàB¸v ”׿(Iª÷>·±Ð@®-aØ:krLHŒ¬ïZ…TÁ6ÏŒ§Kz¨lgÊÎf‘–Æ|§.‘u–ÍtÖ°s”»„ït$TãÖ:Ž‘oåî|—ö]'#¯ô8jazž·Ù9Ž¹ zßÆuK° endstream endobj 968 0 obj << /Length 1095 /Filter /FlateDecode >> stream xÚÝXÏâ6¾óWXêªÁc;¶ã¨«*u«öV•ÛÎ YI¢% KØþ÷}¶ˆ!Ì0YVõólï×÷žmzFý1!í÷·ÅäñcÄP„#É$Z¬ã ’")BÌ ú4].³j³¬õ—t6LLͯ¦ÈÊb¹=,ófSgK½Z¹¹Ÿ›m®Ùô—ÙçÅ_hÎ)V<@sJq$<Àçlßt8GØ …!>Àð†ö‡NÐOì¾ëÚ}w®jÏ›­¦C6¼æjTäõ¨x 'A«"ÏŠ7{ê!n0¾Ý½Ë½c2ýŠOúÛ»ñéñ#W½â˜«K%Ñœ8¢Ôa.ÖÆh0]5E\ƒn£WU‚á(ˆÀšŽ¼fÍä÷Åäë„‚” Š qD$(`‡ŠóɧÏ%0 nà Rè`—æÀ”Û &Õp@°Š¨… Ê*Ýtr›»¨äÜzè©4a½Ô))_ï¢Tr̨ô•Z ¨ì“wQ–QžZ`íahˆ¥]Þã2ß6uZ9ºh÷ÙfiœÎ€{‡¬j‰ôµÑU6×-hJP©:À'Bå€VûH¶¢MgTL¿mwi5wÕÊB…)Q~T&xó€H0§^›Qh 5‚¤ÌuV8Q½Öµ“f•ûÖ¦ Ì”‹¿••«nuY¥GÑeuмŠdg±«ß¿Ž9Ií2]$CX!¬‰<(v Š÷¡¬yU¯Ûè@©SÂýè8· ¦ÆEÆø4Õ°ÁJât³y0ÃÈÅÂÈ^J$ÃTÒ7'’õé’eÌ0Y0sGÍ@Ç,or7kòàfmZÑ@ìdˆ c¯æ‚Q†…^p®äCÂJùz>(ÔQ3##1ýÓØM{ó¯Ù6F4d?tJ£×iXãÛeånÈjèâyH6 `[’>Š4élvbí>Ï™)ö½IbÚÎtÔ¡6­Ð¤Ò2‘*‰éÙ¨«ªŒ3][Œ p"h9Á:N0Ï.KáÖ8Á:þd…[—E½ÓUÝ"”'v]ÆŠ ‚Å©É nœ ÌC¸_ûžîË™Â\% /nа€ìÜC'\Š‹žÎÁÓ …Õ]T™C¥|•Ã‡ äzÕ9EºÛˆ%ŸÖ™íT„yÚ•ÕUÆ:æÀ Zë]7Ù®Íê¬[Ö m]ÚUÇ­z7£júÜäiQWØŒœ=BÎ=oï|ý;ÖOYoš¤½µ}Ž=îõ¯½~Éz\ÀžÞ­ó(3óùh8¡æû›o§Mû¯‚—ÝÉË÷èÎèìT±Þ¤ÿ§ü8‡’òP¼¯.êñä¦-Á« ð è¿øÌs¯GÓ![O`ôp!y‹› ãŽÔ±…å?1õˆtócàˆsñhŸ°›s×nJÑj„c—dòšÄ:ýàææ[|”}wsëýÃä‚ß;V½[‚ðÆ¢PÓVp¯°°4àÞ¸Êü *^Ê endstream endobj 972 0 obj << /Length 399 /Filter /FlateDecode >> stream xÚÕWÉnƒ0½ó>&UqlƒPo•šJ=sk+„Ê"T Hòû HÌRºœ°Gšç™y3~ ð¬ úûh)›I€ MF°|@t5†£[H4 ,¼®l;Ì"ûà|zk•º*w…U›»â Qü°~·^€ªchèP1†&íxaÑòN¶ãû5@c°³'òJì&:Cö#vãé ¦Î}µš?ò8ámüm³Dô¸L¦Ä@µ;[”êüj.f9‚®ÑÓø*µÅú-OÂ} ¡ÿø€nmÚæ±Ú ðÆAÏS‘Úø#µá×B‚ÕÞÂæ‚äžcJNyƒÃwZÎ鱉" ÞmË&wLì<üvN ÞiU_¦y’…Aâ¹ÕΟ;J‘Áá…¹ÔÏ»ð§¦0Ú=­¦ù©–Ö`aJn„xöKLN–%‰ÖfúûÚ,CÜèQ}æo6‘]î„MPiùüÿTÓ R-9ÈCz}y mvºÑzQ ·&*1¡aÕ X£—'Kù*ø endstream endobj 976 0 obj << /Length 380 /Filter /FlateDecode >> stream xÚÝV[Oƒ0}çW4ñe3£ÐB;ˆÆgâ3ojc+°L þ{AØ£Œq/O¥¤ßé9§_z*ƒ5Á½ çã­!H êS`8«*Jæ+6xœ˜¦»eæ»õºšŠ“I:‹,–M.£'™ «é³ñ°ÇÝ@TÔTˆX:ÊÐ.\oÉB;ǺNÀ¤ÀgžÿæZ ¾Ü¤HIµˆÔI‰ÁÚ 6‡ªœÉÑ_s»´Ø*eš0”¿`wtªØeuUìM0+£í¬98ÑB–éøÌΡx®ð–#º¸sú9«?”!µ1ÇyžíÕÅ=tsw âãIõ9‡Î©Lqÿ vFêúÐs}ïŒó/˜À+éá áˆÍÀUU×´ÁžÑÄ%¬ôáVlq!fÒm?öêõÓ>)@~w œVþóQ@ûDiˆ‚ÎâÿStîý¡@þF(tî‡oM†ý[YZ¨Zá!Nœ'/fëPÓ´ )´TrgŸoa‰ endstream endobj 980 0 obj << /Length 417 /Filter /FlateDecode >> stream xÚÕV]o‚0}÷W4Ù‹.³¶|I³eKæ’=ó¶-M#âÈZ`Q0û÷«‚|( (êöÔ”ôž{· 0¼ôP²>Y½Ñ„(€@b(°  ulCCEÕeƒ·>¥î‚Ó¹ÍC]Ñûë]è¹¾Gƒý|þãùÂeœ:>·ã#·ƒëUæb ‰žàÔÆÑÅ”ñµý•G#Æß‘Ž6†¦¦bBKöÕ‚P¬œ»2Ve`’@I"ø~—ª¶]ÁpËMQ!Á8†»q½)íìA¢$ü|¬Î]TV„|éæ¾QáÛÙ®µH»Ø"Â5ÙURm2)N«.öÀë3.]_Õ=Ø­yãû¿×ØãMϧµéeÌž-ä·NLŸa v‚4G["O‘zoäš(pÐÚ% Âà:b´¡¹©²Š€0Ž®¼ÊâÝL¾ë™\j»K¡ª¯ù£Íê®iMIÞãénz^ïêNj7Î;ܺѡ„ƒƒ [!%Ñô2ìTÉ‘>Á£‰fæ~Ùɪ&ßcMÓŒ‘±:.„<[½_S3“z endstream endobj 984 0 obj << /Length 1110 /Filter /FlateDecode >> stream xÚÍWKÛ6¾ûWèE*b.ߤè¡@S ·" ô†bi×BõZY¶»ýõŠòƒ6w³ñªMN¢ø˜oæãÇáG÷Ž~›áñûËíìæ¡‘AFRÝÞE”SÄ$‰¤Pˆ2Ýfчx±(Öå¢OÿÊ“¹ "¶›ºhêE»[T›²/éÝûqÓVé›äÓíï€0'ñŒ·x›–ãâjû òvX>çiÎBFî‹í…‘£!poÞb½LË|‘5»úèãaåÓ°!ß°çaËÿ%lØ—Fî¦N¼^µßdßB|‚yNÃé‚)É8Rm¦âD3$µŒæT ƒÙ!$;8ûõvö0##Åá0óˆ+‰Ѳš}ø„£ Á ÄŒŽvÃÔ*¢Èh­2z?û# ˆRà1SJFÏ//a)æHa:,Å IC|XËé%(e`kL*¡m|ÌATÁ"ÓÀ ¬©—1 àBM«%â\ú°VxzóŽkOHh¶ŽŒ¬“918îW¹käe^åu?v7wΊ¨R‚ì­TiîÐÚ8åóãȲéº|Ý6u6w‚rt˜³\Wß'pDN}²AŸ$GvqïÓ6äF\ÜFÞà³+ôÌêœ1„ÙÙAý¡¨—å&ÏúOpno@ÏhõóÓ©ÁÏtÇŒ2þÙdñÕiêhZäÅyÉ[F¯ÈÓ—ÞgÅ6ì½üþ¼÷ú±ãªðlµ»¯ ärí”Ñ\³#¾G鵡¤SÆÑC ‹‡WnÌŠ¼2”î;å,+k‘?WyÌÁîújËÇ!3lâ~—@wãFÇÔ×ûÑ ÑHÓCšýˆ‰  jxŽ˜ýœ:wÖò„ˆøïn†5Ô^ë7ÐKyœön´ÌÓõØlö+à*pN­ÆÏ»:ϳõ8aìúœŸ8$Bq‚¥Oæ û´îpGXü¾¨Š2íÊÇDŠØºÄx¼éÑqV$Àï¶È?Г#*H ‘¦¾Ì ÷©ÑgÔ8{«:ÄâïŽ÷þtèxC4Ù«4j@?Øs»”h³MK›ýZÚì7µrBÑåEL˜DLVµ \`LC9Â}UíÃGŒªÁÜa¶»$È›Ì'€¤zЃ ´Œs$%›“C-¨i3JtØf2¨¢ˆHó! W…8=”z˦j7}¾×ÏjÎæé (áÜŸ«à"Û†œ£}IÚD $±ºÔyÒ†~8k£RaÊ®èW®Õ5›ÚAû²…™C*H»AË°üŸ¼k‚‚5  Nž¬ê0ì¹$^Ç*ì‹aƒ)lä3ŠÕ m»ç`BÅnCô0ƒ’ånj¦åX" %¹Ö,‡#E /NÊ"ÐôP»`–%R]¨ÖÉRãÁsO–NÊâôírxŸty•uBâe‹ýõÿ…wEÛ”uSi9>/NìyÑÈŒï­F{„io Pþ/ÿ 3„ endstream endobj 989 0 obj << /Length 1176 /Filter /FlateDecode >> stream xÚåXÉŽã6½÷WÈE´ÙÅMHC€Ì A#¹8§$046m ÑÖ–ÔË|}Š¤$K½)=@€œH‘Åb-UÏÆÞÖÃÞ§;ÜŽ?,î>FÄ‹PÄ ÷`ŒX =Î"!ókïw¹Lªt¹MžÕlÎóõ×SY¤oy‘%qj?­.³&ý3<ûsñ³G$iè̓El¤µŽÿ:«õ© î <í4‚o†ùi+ƾ•/'ÜoLòЩ»|ù‡›|‚Š)¾6yRä§=vmOòûÌ=Ãý¡é…‡’°=°D,c GaîGõš¬Ší>.wÉj6' û¿–u’%_â.²z¨èÑ6JÄ¥=ÿ)™ÁÕϳ€ù*‡óQäÇvÐ1úWÉJd—*U[…£G'$¢2½Fa/3ºTß(H'£U{‡ª€"ðNì³[Á("C]­uq¾9ðEí‹ù:ÉT^A$t”CŒýu‘ÅIîº;äËþrsùÁz_ïAeøõNYÝ›"M Ï—$ßZ I…`p±iò•ÎN†ÊÈ_YÙÔJHc¼´¡6ßõ.®;±¼Ó«n]ÙåTéäQûY’'Y“Y¶]Œ_‹›ƒ&xUª tµ¾Žpß2* «/PD¯H|ˆ¤S¶mŒ{0©wE¥ìôY§!NÕÚoœ5"­@ïãLÕj_u&Îpª‚—SmÞ\VJŽ§·@idÿ§íRöÚTVÖo}1·Ž kRiè1?/\/’€ ¢7á—ßOEs e¦Ã“»BáiE?œ²4¤ˆ‘^¬31®ªd›«µþâÞzÑÀÛ^×vçïÖ;éód¥†yÕÛN\í›`çó4‰D˜½LûR„ÿiç‚|¥S\,vŒ]Uìh4 ó`ß.®ì$/ìØ=W%¸Ü.ÈÎ¥Y€¡¬«{]EWA„oZR+¾±c¿w¿)g ‹U³ÑSc¸!Ll ÍÔêƒÉ^UMZÛyÒÈ‹|n1e>m‡Iá|4F2¢—ÁEŒÀ¨Uª§F7cRáJoˆ(·=pè)i7©Jæ6ȧlßð7I¾J›uË ¾rð@»ïO3©1ù1¨ç:¦Wëµ%ä¬ÖD'U¯Ðnæ:½¢V¹FæÕôæø0„ðÌÙSþجNàƒ×„$~u‡„ÿBòø8(4Q0Óór_Ãc>ÕãSéÿïy|Ü°¸D‚ŽkÈ1}çØHŽé;, ï:ÌņF ÿ\C#䪆6ÔèvÄIÛ"ø1‹¶K¬I²2}³ó½ª›ýØuËa”bn¡P†Ht„M7좻^„N> û> 2¦ÃéÅžOÇé°Ùj"C Ën¦" .Ó ŠÙ5ÑÙÍÁ×üTMLœB`z’ò1hWq¥úŽlÆŽ10lC(†M¾Ð¿@MX]¾ý•ÓööRµ$¡*㕺ª‰v¯õæ:¡_œ+7ö‰wìbË×W±êR”®-§ïfÈ!0!ˆÑÁ¯ö ŒFg~\Üý y“q endstream endobj 993 0 obj << /Length 1179 /Filter /FlateDecode >> stream xÚÕXIoã6¾çWèÅD w‘hÑCÎ`ŠAOî©- Ž¬8Bµ¸–4“üû>’Z=r¼$¦'Räã÷ò}¶>Üà¶ýeus÷^Ó@#-© V÷%â‚RDˆ2¬6ÁŸ‹õ:­²umþI–¡ ba¿ª¤öï ÷äÇåß«ß‚¤8 BB“õÛôËh}S¤e1Ò2‘­³ä1O P‹ÖãJ§ •6o…Í<¾.¶»÷\¢J…"Nƒb¤)õJ?¤KX÷eIÄ")–!UtalÃËgS¥±ÕçGöIfjØÐ+Ÿ„XGˆDâï´æf7€($0ïæXýå~Fá,ݬÏóªœ d¤ªEhŠGoü÷¦ÌM:‡W2D¥êÀ´9¼IÝor 5YÔ‰W}_fYi÷5-¶­¨)bëŸÊgåi®§QŒË|×ÔVá%aƒ_°~0µïí•Ÿ‘˜øÁË’,É“¢öâò~Î £HÒ¶EHEº›S—ÝÖ‰W\MY ZÈŽÇ4.·{³{Hc?ŽRš7¹7•h…$'SS!º!eÌxt3Ý@v­ßŠÑΠª;ã¡göIÛ©ª2NMlÚ)åáÔÊäSe^<xªÂ\ŸÈÔi}F¦2¤™¾8U‘÷c° >8äç"ª‘êD’ï꧹mRCB§Ö[e=çŽéqÿþǧOÇpÓqöƒ>ˆÚ¬SÁ§Q¿ù»cGXƒâ›n ÝÈß> tWšßÑEFⲨá0W=/åˆgcNGlpáü‰¸Ó6²=nwÆ,ò­õ¨ëØh»NÝŽ˜Âž“'ÿ1 ²_ó¨¸D\©™¨Æêœ;S ~E&†BèÅÇÂÃ,Á©{ßýº$ð¦‚À3ÑÞ vÀUÛ¥î(;À˜¿ð0A,:¸Ú+8¤ûítöIÕdµïû»ÛÏš±`$©8c .66É1P™üÛ˜¬Ý»œÑÎâ<º¤¸CÜsž®=PIP¤Y[s‰_úCZÄY³iËøOPÇï `èágçE|šJ¸ÔëI„+ÒV¶Þ™}šìY2!“‰^Q«Ü¦ÑíqLs‹&>¼=מa•ëìê—\ÁýN»DþO\rn~<ãŒA¡ó‚ë>Ïâ¿+‹…_~w?KÜÉ,qgÔ•NFÉ!q·#}=˜ÜNÀ„¸ '9»Ògqvuyù±µ…鶶Ðo(µõ”ÚÙV¥ù.{òCû¤nö…—›‰àzŒDT"Ýy®éŽQÛ^ÏáÃUªHuôBå úó…IR}Ò\곞>䪷 s¼8Òô9â¦Mˆ;% ʧGÁwˆ;|¸Ú ­É2ß/©¦,FÛzþ6ÌÎÁ$qœÃJcS%ã TÇ0¬¨{UŽ~’ži®rW·8¡¾w%¿}hµœbg‰íT;'gïî’¸¼tËËëÔ+Ö§W¬žWŠ7Aõ/M®ñc@ä¥@^ZA¯þ‡4…ÓË^ökPÚ¼¶«ÿoÁ6:¸“ RÁKž™!…w3¼¯œrÂñdɯ«›ÿ™ endstream endobj 860 0 obj << /Type /ObjStm /N 100 /First 884 /Length 1132 /Filter /FlateDecode >> stream xÚÕ™ÍN%7…÷ýõ\—íú“Ð,’ YEB0‹$hˆ´¢HFpG"oŸãfF!ø&jY„¡W]×TW—?Wã.£D.A!¸(q r-”¥]…ŠT┩„“d¡Z Æ3U7\´´ßA–}rU2ËäÆäÑ®…¢ùYBŒ‚Ab–fq® ás  âšÌ™àâqš'÷Bl #ŽÛ=5Ÿ £"²Ã'·#DNïx^fŽ%œÛl¢R.¥Â`ˆê¡˜óä˜TÖ„40û¬’(â˜5·7AH€R¥’D`(^œ „$W ÃàD¥¦˜" Áü>â 0“ MÊ`øxmF€oE@Öq2Så‚©¹9çC¹-Bqä“ «±8Wª’FPÕ ¬«a¥£Õ€$°Lµ%EH&%ÃÀDÁʲêÔ2¬È° ¦JQáSÛÓk%¤•a(Š;Eñ<1ÀÌD¼ ÐHH32iFä€Æ5iæf(¤ZFÚDâ¤MU¡‰T°ÂmªfÄÕZªXu¤P BS@‚–ZªMƒŒÕ‹&BF¾ÖF!q‰¬‚q@(&-UüÙŒ Ú"c©¬É*  è' CO-UèÐs déMåPUi©6)W¬žs3ﲤʹí­e:>žvþü4Óîôò÷yÚ}{³Ÿoö÷pslƳiw6ßß~¾»šï—-¹ ý4ÿöÇåw·t‘0 Ð˜œâ÷"0/~ïÞ-áßÓ…/;ûŒv?ÿò+vu>2Å<’A½7Ÿ¯¯?~ñ%<ÿúöîüÓåÕLåñ–ÓËý~¾»¡üøó‡‡ýçûËýLËChÚ e:>¦Ý &ÕVoñ;²- ‚ïNïn¯Îç=] âûÚ}˜öôõ¹ÿ‚@k‡@ó(-«ð-‹¯¨ 6Ã:gNGXïW`»;ñV¾þŸòˆmœz/<žnRx–;–Foöê0ù–^dWxêyø0xuO<ƒƒÿ„ÊcŠãpúBí+ µës8^Þ œaÑó°a¾Åú¥C<Š òæëGXÏC†yè%‰{1ˆ Í¾©$žTÍ—ÐG$y§(GáÔMê#zëªf0w^¥jþÇ[õo8£<¸{«¶Ïƒ<¸lQì=F`oæ-òÿuEîN)íÃÐ œ¼ÅSJdíÔa²E%õ|AlA_(ËÊBYºwgÙd¡,ý»³Ø0‚-ž8¢v'ŽözAÍ[?„Fµž‡ óØä‰C¸G£$mA®2Œ n~WH_(ee¡ì¾ã…l²Pöm•XÙV9€@7ùºì{±²Çq½™O£<ú†G¬lxà±É†Gô XÙð8„`“G‰¾Ç+{‡lò(Ñw2be'#úÏp^6_úNF¬ìdâá«[ðÏ|¿tÕ«e®ÿ¼tÒ_@L}$Vö@žÀû ôTE¿ endstream endobj 998 0 obj << /Length 748 /Filter /FlateDecode >> stream xÚÝWËnÛ0¼ç+ô"‘LR‹hÑC¦@Ͼ5…ÀX´MT¢T=bçï»)[ŠÄF”Cz1Éår8»äRcd­-dý¸B¦ý¶¸šÝ±E=‘ÈZ¬,ÄÞ+ çñCk‘Z¿ìņ;®°½*²¬pHho…\+±W­\6¢µö¨xÓVRO5.ªÞ\·Y£ÍBj[s@­r=U¬´…éa)ø’ëíj㛌p™ó{ñsvKñ€¹±‡IquœïŽ´×(¾¢¢½äÊÃr}?ð|4·\€ ¡ š;8´w%0¯!¼Ç Èܾw²[%6«)ŠíB© G°ó¿­P¬Ô˸4þM¡Ýuà`XÀ—…Lu:é8´Oç~¶‹؈޳Z,—„È®y£;E¥ÛŠgLÁyjáþØû2H¹ °¾åäQB4ø'!—Y›á‚ù"êl›x›¯§˜$ Ì'kñ`ÜÕ¨Ü&Ý™%lµÒÖëSK•kHðIɪF°,Éø.r„q‡BÔôl 4ìÏ€ÀÕì~Ý›çÙ¿¼8-ò›s#?¬ºæyÙ<süY_¸÷è“Çvÿyò.»yùü{=Ý!ô¦§÷Ö“;Mïè 8ð}¥êsV¾gÕü„Õhý……î4‡ó:ÿ‹_­è²8>pá]–¼i^­—’}´Wkªú8$e²ÂÒ;ëä¢Ké=Ñpn5 æÉÂC“#E ÷5&F‹A'ÓzO,‹uÅÊRTÊ y›ëRU‘íÆR—Jx4Æ©¬7 SÇÅtnÃ…bJcu‚WÙ:Ê dÙ6µ62™j£™Û5„”Ï”ß!DdÚÇhpe[ÔÆ_˜>ÚÕP:qË· l¹Ñ”2{Ô=fÔ¦a£ú‡íÕHÔºÝsœR½zÛ—è©9i%07åuqEØ Ì>û±>½ž²Ÿþ“A^DcÈõâ8Öø8À£%ßWÿ¥·Û endstream endobj 1002 0 obj << /Length 1639 /Filter /FlateDecode >> stream xÚ½ZIÛ6¾Ï¯Ћ\Œî ZôP iQ(Šú–†bÓ3BlÉ•äØé¯ï#);–GöxarI4ù–ï­$'O N~}ÀÝóçñÛ·†&Ie2ž'D $ I¤Pˆ2‘ŒgÉ»t2)šÅä©ødG™ "u_«Íd¹^´Å$ŸÏÃè÷ÇÓuYTåda·Ë|ûxô~ü{ Ҝ%!Ȉƒ6ÿxžÁj™“GOߺž‚äGãÍ[-“@„:Í3Í„¡Œj$ˆ„ âˆèQF0Æéxdhjëi™×ŸG8ýseë¼=Gtìîyï^y ¼‹ïŠrºXÏ:ÉÑ߀Äèù§ÓŠ¾°Ä 8ô§U9»õ/Ä…kð>@zã$hëµí¯—W­Ÿç‹ÆŒë(3©‘â섉 „ÇÏ@‘ršÎ×åÔY%,ìÙ@0o_Vko¸_Æÿ>Å I(q>`A$Z'Óåû÷8™Á  bF'?u™Pd´·Eò÷Ã_EA<•'Å`¦gºÚ ðd )£ðd °U§÷%Sü"SÁ‘f´ÏÔyЀí(C ¦v&€šWõ² –ËÃí,œóE¨| Uu7 èú—Ú¶ëºôk Œ†Aëbt›y×Ëç ˆì{શMãü#£F§ísÞ†·ÂQ2&µÿ®=c÷c5àDF#£Ô^ƒÍ t âì€9’ŒÝ…®¤ˆkæIq åÙºøFW›=ºsèavi˶ _›g[ÛÅ4FTóÝâÓö;àPt$˪Ìþ³u¾‚…_¥7)}”†ñ% §¯àKFJ&ÜP$Õ]ÎKƒd¢=)®ºÌìÓÏö¼!fzøB%8À¾Ná«4ÜørÒÇH:lÑ`ér@hej—éj×EÓ6œp¯…YS8ÍAzÿ2ƒ Œiigá³r¡õÉýJèG#ºrAÃÙf´ŸW¶ye Õ®(Ÿ°¡N|CΦf¦ú`). î±9Ó¢RyJ´àSðÔ#ôD_Äz\‚ר³rsŠ6<‚ܼkÚ“»ò"ˆ!.ï"–aClH†zbwQ}5܃~*k?‘ *@à.ÀÊ Ê>åw% è0—ž£ât)'"‹(<¥·a}ž·ÂÆ¡áç +CrŠ¡¥¢/¹ß õ>0‡DŒ2ç°üu#Q®“4 Oð1&H<#±óFÒ:-Erm¦ì"#1×#ª(€1bÀ7ÈëFb £86b@BºDvÈÒo¸JgO…­v\}+×`ìÉbÎ1EšáíJÓÖy…ý¥ü‚úÀ»K~®læ¢$hãÁG®ý!oŠéK¶ö" n»þ„öÙ6¶½±Îì“èuÎí7¥‰Rç€S÷iðºÉ ¤ AMÁ¡{wíï¡à',N!Q©cp¥”"ØØô¸.óÕתÐB#Å¢ÀE%AŠêh‚¿Rµ`ËL ‰!8ÃÐýõÄ>U²¨‚°‰Â ‘é`ÿú1Á ëã”F¶†¼ƒý5´ŒBDÆ` =D¸ùFžÅ¡å“, Zœè7úhåM;´/r…* KhmúXÙíª:ò„‚‚;Úöä»#„£ ÄØùTâöÌ)Airß6¼ŒiO‰q7½«Àbð„Â!ÅÓ²š Ù@ôÒ½›¡QƹNs'452Ýø§HÛüãˆà´]„Ó÷Z͇Î9ÂÄœd`¬µŠ¡.s‡nJôÕ½$u*ä»gžáŒ4_®Öã¡v§?îÇénÖ‡‹im»ãT ½’¹û>ØÚÙc8¥šV«bÿ±¬f…;>r§Gî; Â˼¶»±uãNƒükëïÝÏÕbQ¹c¥Íþ·Ý‰~ƒ®¹hñ—§oZ¿+nZ`öÄ9ÅÁ]Ënh2¯«¥ûºúÆÅ™0г‹ý]G’õ–ËÛdÊÄéYÜôi»ÝÝ÷´ÛÇŽrÙ,O‰t#LàŸ/€è£µ«“Ýkd±Š²±õM¶;¬p]6Å“?4u_«ª¹øì¸QË|6‹£â…W‚_Q•Y]­†u‘÷ëÒ7Þ¼¨O˜5vp¸—SÈ 7ÜÇqQÎìöÃqâf€rš·1lG®Ñçxñ—8(!½*ª1TQ¨s z®ý §½%Pìÿ“Ç endstream endobj 1006 0 obj << /Length 1997 /Filter /FlateDecode >> stream xÚÅY[oã6~ϯЧˆ9¼_ТÀèìbÑ—Åæ­SŠL'Ú±%¯¤L&ÿ¾‡ɦC;i#LŸHQä9Gçú ÷.þy…ãøóíÕ‡†Ieq»)ˆHRH¡e¢¸]¿-V«ºß®îë/öz)¨X¸§Þ«mÝaåûã¥UßvÃ',ðõï·ÿ.8Aš³bI2"!8”ŸÏtÓO§gë&nq¾¯v{‰›¢Ÿ­Ý'D#½òæiμ» “/m½ŽK½í×@r™£™ÙýCf·<– yÜnߦàMgí >Kj¤8-–¨UÝoÝË«_n¯þEÀ¸ ‘aL !RZÕîê·ßq±†—`+ÄŒ.žüÖ]A‘ÑfÛâ¿WÿÉ9›TÈOIhx:Å¿ä©9¢ÊÌÂSƒcK2õjyÁ•bÐ l™+ã(%S®åvÛVŽí‡\oÖ>qØUu¶l½¤\-Ê&Œv·žÃ4˜ÔÍžêá!ÝV7õP—[÷ U¹/«z<¶i»À:ÕŽ!ˆ>òn2Ò)$Í$œÝÚm†eh-HcžºzÞ§FX€¦ø2#ﲯ`séII uÁ©¤A RÜLEŒò”iÞ©ˆa>\çàj$ )׺t3dìÆ8FŽ†+›uÎü`\<7k* áÏ AÌ ?„!bX½ÁTT;ág1…øúM¦bØ ‚ù\¡›S•ëuÆND#ƒv‚=KFÙiî‰.†6¬–aÅrÉ8û»„Ñ×Í}xUßà‰q=-G)AàEÙ‡±±vm×¹Ör§¹ì 4»3H+ñ.S1®&<)©ä%ÿà°ÃYj¦‚‚«±”é™ú 8"„ÎÂU)p5’rÝtí.ÃÕ@y˜…)ÃàŒØdõûÒ)‰¦/K’óš0Ä2³X†¯œ3nm˜G7FÑ'Aêz┿¥H»ò… &wñ8d·½­»ÁÏÝtxˆ[6-”Õk@8OÓ»ÍcS uÛ„25¡ßq|‘–T’ ¡ï ¬¶ëˆ¦~ÏÿŠB?]D¨ fkÜôN=ÍpÛ½@ã9œx“ÈõϢߗX<¼¾­YÛ¯ç`­˜ĪÊœ6~زzøúÈàw™cãÛ‚M“v/p$l·¯¡{ü—pý›°ê«jóäöÞµíöX1.:žú¿Þ3ÉoÒ3E1WîÔ¹/ûL¾iV‰ÕO²d¶‰ºu‰ pæ”…2uU¦’êr]¥Ü¡oa®;€ñ=ņB]C:R\êKuÕU.faÊ) ž2=SW%ÔUÁfá &‹$\cèåÅÐ9®EŒ“W¹v„éø*è ûŒ‹€KÁ÷M®3#ЦHŽ[ÀѼÛùO…_´›°2ŒÙ] ¥ù9Ó  <¨,oÄ$pÿÐ>n#. J8“è¡ìÅ#Kò*Õ6`Ûumw-Ä""gÍQúíÀyßrKaó·€Â9¬DéŽðj\ ã„nò°Hž¿àL ïoÎ ôvðýᣖE @½ â%,AÖ@bT Aà€øzI0Æ‹ô}[ÕåP_ìBl»¡®+ŸsnéD„‚‰Î;ŒâSœ—r<ïç»r&+øI{÷?ÈiñµOÈ2ä;\ÏT˜VáyxÞGš>½J¦owq¿³I éÚC ‰ø2§é‰#1ØsD.ùbÑðQÏáEÙÙ0Y[·½q.êÝõ¤Ÿôö ‡Î]eºÅ}Yw}˜:G=d*Šé"x¨oÿÜ«Ñ‘2>aâ"êâöÀ)UǼëˆcù•xJŠÄ gÆLÇW¬7Ñ9˜]‚FJ>‡àœ# h,ü®ìë*ÃúyPÙ\@1s¢®3w‰ºŽz À¸ˆžºåg`þR_¼£†=€)ˆÔÞuG ‚9ã)5u±ÙË@ èñ²'ý*ÈË­=P6‹ÜJ=¡©Üeþ׉ò?‰f`J±q`4ái¿î»êüEOpù€¹ ï“8› ¤«ËEÝQ5‹©ríý6æg@S:‡Ü ŒhÓIìýS†%åK3 KèD°Ð'·ÙäÓ€–Ƕ&ÿ—í¬« „.ž\Ã|°a¬ËÎ;²¶ 6”{÷/@¤©dx(ã•ç”ÇOa;Ö¯'TL8~o`ª 4HcòšG0k¼;móXâWî$C\ó÷JO™ôá—HŸO+P²•‹œw2®c' ß”SúôOɈ²CçVîö[;Þl»ú¤§Ì#»2Ì#÷pÙ¾¾‰Oí¾a|hkÝývgç¹Åä’ABÔQ1„³dXä†_´ endstream endobj 1010 0 obj << /Length 935 /Filter /FlateDecode >> stream xÚ½WMoÛ8½ûWØ‹]X ¿E¡E.ÐØÛb½´… H´#Ľ’œÄûëwHÊFdˉí({"EμrÞpF8X8ø>Â'Æßg£›o1 bK*ƒÙ< ‘@’@ŠQ&‚YüÿV”Ùr“ëI(¨*êåM‘'IÒºIôÓºBwŸ'¿ffHŠE«—$ š,Š‡VÓ~uýú‡ã$].Mö ì€9AŠ³.ºUÊš§fÓÖJÙøɪ(“ºøW ùè`Â>œ·x™™õöE'=ø½Öë×Àsj¿Nù*ŸÃ•›åòr_ç•ÖgøÚ¤÷úB_o¾qõŒC¡T(â4)€åÁgwÚ‹vé#‚cà“€Y™Ñ×ÙèŸU€(Ž€B2)d«Ñ_8Èaø†X¬‚G'¹ (Š•ÅZþì㶊y %TämZ‚ôœr$˜Ú9–V¢Æ‹ÍJ[n1ÉÆé9 ˆ3¾S‚ë;> Uೈ‡8U 1uSä=6cŽ8–ƒØŒ#]›þ.º6Vˆ 6„Må@§ŽM`dQ¡ˆ ÂÆ0Šlº 86 Q§lˆ2!¥uaCcÉ=C³´ôļÕ~ÜÔ:ßSÕõZgÅ|ë*ˆ3Õy]ÈÑB†ë ã'o,ˆ]qiâffîÇV˜C(j“iSL`õÁj¶’iU¥Û‰c`êž¿ñ²†C},ìgoÛÍEe¬ücÙÊn³J›°¯ðÜšŒù±Ô:×9râ„£˜ó®Î—^§,€uªq×l'·ífQÖûk‚ÏM]” ?õ÷“¹:Ï÷{óM™5…)kçÎQY>L:‰TwŸÓkK²}Óo9Y>’»´´ MO7‡ ­â½Þ^Q±_¯ ÝôŸL~²ÃzöɬxݤÍÉðÌM¥ÓìîýCÔõÄÚû0/­÷vúÚ)§¯\rWóÀ«‡tÙvrf Ï™ë7¦§ï®Gú¢î2~{"ËW&/~bL¯Ló˳<º2ËåÛ[ÚúTš\Ù%^•&g+sç»ý¼2ëw¼yáò"±£·Tµu?QÿÙÕð™þÏCÙ®øñ (g”…n8ºðë jÜYSÐEz$êâ }¾„¥*$v—-1¢dŒñøï chCLU÷Ã:¦Âk‚0!;áþðgPc üÓöˬ‹Ҳ؟ÉAzž€HŽ˜‚f :nAÚÓqÞ‚†û?{o endstream endobj 1015 0 obj << /Length 1021 /Filter /FlateDecode >> stream xÚÝWO¯Û6 ¿çSØ%)=I¶+z(аÃrëŠ@u”Ĩ-g¶’ôíÓ—²äÄÿ’—ô;ìd‰¤HJ$ý# Ú ‚~‘ ß÷‹ÑÓLj¡G Ðbèœã€Rð9fG‹ú4þ)Qqº_ÉÉŒ3>~›”éÓAÆxûnòyñ(šQŠ#î„—Kà/7ÉÁ‰›HÛÍ·[Š4Íã¿ '†ëoŽ «i¥Ô§8ô½¶æ½*“’++[&ÿJP@®ägCns%ÎwÏÆ+ýUÊÝ4¬ÎÖ¯¬öizÍκòlG‹¯ò%;Oý°› pEðÛ4´¶ÿÈ5èñë­ÐõÊ‘d*3©tiwùÚ~…ý(9ƒÇôÙnãB m×lÊÇ2Öy{3ᤶbrb;mÅ—D¢x®O‚R‘îe‰ÍÈxÎT¢>Ž|¿ýrg„²‹/Ò¶BmŒOf#”[$ªÜo5}_&jc—ÕÅÍbC~U×;ñÖ{ë$Wà¸Ó+…NÔéÔ|êDéVÄ–._9 i's6R/ÝK®1y±H^ôeêèõevyy©Œ‚{ʨl8Y&7øx¥|ì’©ýòî—½×ë‹Aï(:ýq³Q¸ÁíÞƒNÂ?ΧG=òëÞ°WÉq¶«óং¦Ó/@v½ƒÏ}Öùó”iõÓú°ý3¢OQDŽ ¡È›ØCg£OŸ ZR{QˆŽ•h†ŽÂV)úkôçês Àb41¬lŸû6C³yô›!tAØ6 º¾QF<ÌùüF 0÷yÛ¨ üâz £®;&ß a!õ¾0PEC¦†` ¸™öéÄO ‘F愉V6Y»£ÊÈ<ë­Å(àïXäjê2þUYnðJ!áx0o'^,J9íà`Ó2¯:€ê’­7™ƒBë[¾9 ¼…wå'‘ÄÁõ^­þƒ– »Ü…#$l»µ¸“/Àÿ¾¬1^çN$W1t)Jh'¢ ÷ªo[w-·üP?ukÏhü¸é÷úâ¯âÊYÖhÃÙ³¬êC@š±óÚwŠ¡:ÙdF dÍïBI,Ëp< á¸=u¼ÐƒÙ¾pZ`—ô2ÓÙþ×ÍØÀL’ }ÇL’ Ý*ì0“¨e‘Ýï½Ë‰óôú¬¾—×Æ•³tVeçíãJßεqeØÎã ¥õ¸B™W€ÔW€\+@vÛW€zW€—™þfvTbgT1š£ ´F?òÿ¯£Š‰&äeùº¬é©„„.‘ˆ×¦cçÂôÓxŽV1€xŠ`ÅœxîÏèóÖè/¾¶ £T endstream endobj 1019 0 obj << /Length 1669 /Filter /FlateDecode >> stream xÚ½XKoÛ8¾ûWèh5KR¢è­ÀvÑE±ØGöÔ†bÓŽ™Rôˆ›ýõ;CŽ^¶Ò&ÝìžL‡3ÃßP3æÞÁãÞÏ N¿ï®oÞ'ÒKXÊлÚ{RD,PªˆI_yW;ïÓr³Éê|s«u¹Z+©–8;¦›¼‚Ñk’’UÅé\´-òÏ\‰·«/W¿xë@°8ð½µ,Q/‡ì^Ïy¡Ù¦ÖÍFçú¨ Œ30Éݾ&½ÕF‡>ç\~'àsÑý‹Ÿà>ETø£>álOAÞ!ÀÉvø¸mˆ‡lÏÆ, ¤·–°[D]ãâ⧫ÅÝB€mî O„Šq.<)Ø!¼íqñé ÷v°ÄÞɪ=É’8Qîý¹ø}†ˆ"ŒX’XK |[ŸxòKŸqÀd”¼ˆÏHÆS§=ãTrŸ)½„SÉCp¦¦N‰èøÍû ©ûphΪ²îKŠdY馭 ŽãeêDF¯„ZVj™6Ù é‹sítîQæ­vºÙž¶Ôyhn2sp+' îªÂØjís¾ü`Üjsã®™%˜ £)}·i­ŽRqÐÔn0ö Óbï9Á$\t§|u?ƒƒ\U¯’ÕÎZkvú3çÒè#îÂO™ec ùr_äyñœÜyQÔšm“ÆͶ) ®iG[뺂£¤R˶¡å¦³ŒY]e‡›Óȉ2³ 8]BU“^±w¿©û†WÙW„,”ËŒiöšÐ XSpí5‡´Åëv{ãFöbh¤Ý ¬Š]»%©õ;^- Ṳ́¹›¥O ‘öë—уO™™sEµÓwÖd“âmó&+s=y’èH6ª1Y²Ð/kÜÌ)(8]"êÀ¬@b¢DZ×íÑ]w—¦è:ïî[›H0ªÖUjn-…úe÷{ÆÕîÙ¶cüœåÇ&3÷蓾dý›|– @Ãk9 Â$,GÑÀr˜9–ÃàšvËb9ªô,Gagùœå º]ÁÝèÊè|P)*76eÕeºÕÃ&÷<æ˜ҧ̀¡|f¨É‚Ñúät`í{ 0ÃñŽ—=ÇÿÖU1å÷ÿÀº[{ˆç’.=wiY×3Õ!|ŽýÕZpøL¼+àA†óŠR͸ßß2½Õ§ ŸœþÞ¦uVùƒ)ŽYš“²Eþ[ÚëiÉäo¨0qv h¼kày=—4ý“œƒŸçŒ úœ©ÆN7º:f†6Ø­¶,uåDý’!'–× iÚìVî¦X>¹ôîΕqYC„ÚÇ43ÏgOô8{ÊÓænˆg ìˆ³‘\î°g}v…;5BËÓ]ùz.¡´iÃÞ!Ææ¡Ôçµð«¦{­ÞÎâ4âôw«5@…§¤€f÷ýLs¦È{û_ už?“¶`”@—õd˜J‚®XCW3ödÀ¸ì•Òj5硵e0|ð¼Ž8ö+…ÁZ͸K&K³ŠUw K±0úW¼ÏùÒš "*à-°—^}Á$T­/áÕ‡w6˜:…×h®RÆŽÁïÐ(æ‚R|°˜¿`±ÿTÀ®^ °€Ç—€¥_çS,Lz4 Ü ’`ùa®OUÐwc6[æˆÀFttµŽïGŒ‡á4;MÑ̹ ™/Ugà׿>~œóÂY2Ü!¤²ïú3cËÅ¡½z,n`Xªq‹…&kùè KË~Ȇ ÄŒÑ<û›Š J4îÚX,>qF_JÔè¼ß÷15N|MûìðÌqÔ‡8Ü;¶ca Ëye©S¬}{RœbYˆ¿.,”i•ñ{_÷ -ÙÀ°snÜ<×iMÃÂN×Í» æ̸ûnwÂÎN…Ñézî w•£;|lG"?A– ‹YÏ6Ùر'qÔÝ~1æhå3™LH€‘§ÖÝ©JËJ$¬ÆâÛ4Ž®Ü¡ÛÝ7$8V’æ9]›éËi™Ah¢-îà”<îªo>à‰RWÁsB%•®¡u›´&57/ÛJç4¶WUçjòíØ2.|lyðÍ~v®ä$Cd(&8‡A‡3,Ð?¢Ç†Ý¦Î0;Ã9”Ã^hv4tHŒìZÏ À'Řþ\¡X'ÇêûòQŸÝ7=ƒUì¹Éj×›CÜú¼Kú¦5w©ÓÒ^Í€ù1ä|ÏgDäA8Ñ‚¯Í?òCÊ endstream endobj 1023 0 obj << /Length 1533 /Filter /FlateDecode >> stream xÚÕXKÛ6¾ï¯Ћ¬¹|‹DŠZ$zi‹.zIC–éµ[r$y³ûï;|H¶dÙñ>‚¢'R#jf8óq>Žptáè×+ÆŸo¯nÞ+‚´4º]F„1”HI‘ ÊDt»ˆ>ÄqDùdJ0Æñ‚ã´J7¦©òl2¥Çƒ Ǧj̃¼+vS¥M^“O·¿Ý¼ç*ÒHK*­M‰B`Åi¿]™É”ao´2¬âû N©üs Ø-Z˜:«ò¹Yø÷y7«¼ö’ÚdûÕ­p“æÅú1ÈŠÆ‹VASzéÜXÇ«.:Þ×]m×ÙÚ¯ª"][-ö9-‹y4+ã·®éÁÖ ˆSz¾yZÝçEùy$Hœ#Æx»pÏ«´zœH#»¸Ëa;ì@®¤‰„I‚ îÿÙz·€x *âóz}sÎ3S£ÕOcžÍ`Ñì.¿ßاö/ycEó´Î³YmšYVn¶»Æt‹>bbNâlLûgc¶{íª ~SPBÞŽÄh*J8íoÒ㉩x¹+²={á6 ¬ .˜u1}w{õ劀G$¢»5lHe›«Ÿp´€w$Ä´Š¾º•›ˆ"­4ÌÖÑ_WúCÕ3F)CœP§‰ó6ñ°Ë£#"ék AzFmPMJm¼‚Å„BÀTÏb@ñU8jH2ý f¡HÌv9VQÜ¿­©–eµ©=`œ$N³f—®½Ðo!:O)åKчq[_H\.ýè5AMì×4ÒÕ4~¬ÄŽÞ7Ù*ÝÌMå¥ c(ë|o¤û¢nÊÊ >®L½[7^˜cG:;DÊ’³p‰¨†•)¡ú%9#² ¨S%Ø·sÆ‘Lºœ•ó ¤£É”‡Ý–tª8lÖf20ƒdi˜@)‡QÄ_v¦Ê]ý¶ÂG?šBW£–âÎ?–6W!a^”{ƒD";ì£À¦€>ȱ•”• # ±ܤSÀÐSÄâ̬×Aä‰ÇR<ÕLÏÕ¬4«´ üf‘æ&PS'´Uèe.äóܤ…°¸®:r8¨ã– ê&mŽ‰g™6i¶róðdŠXûx=¾ÖÔ›eaùÈN½ò&ý<`G{ êT›‡ëcïd}™/ÂR¸ZTVïµyóv4’ÑT1¸KµLÏ/žÅÐxèä:ëQPl§×'“úô°D餇­ #ð ÅÅÞ~'=;ÃK! %ú§ï÷P)‹Ëm¸q×þ9˜ù Wba |ꊬýÒ½¦'(Ga¤µ8Ë9 èZk1iw®^tOà V§Jr} é`Éû¤ãwåK¡ D˜,Ëõº´Eñk{MŽ pPÜ=¿cGù.ÜÅó¯Ú'óÁ¡9¸~Y©Œ9ès††ˆ¤)­û€“Zµ,“Þ™›¶)«·¦¶Gëz2h›ª´ëcûnW{~mb4íãWh0†Q'(ÁêeWhèïµÓ$°ÚW3ðòج†ï’×°J1¬³w£m% §ú5ŒRۜȾQ‹”‘ÒíY‚i[µ+Óì*K[,Ñq ƒÂ±Càvm¼ðËË4 ôD†jˆjU}ÄDŽØSà™n×A©ÿaµ…V¬öM›Âí*WXìšð{Èv”€š :øõE¥ëæÜ—{Û°Ú©m7ÈU0˜„vú…k+àñ×U¾ý,((?O¾à‘#J DЗ5éÐè%N“8løÆÐʸ„E¯b•kh/ußì(ZL›„×0*RDöúš;‚Æ@;Âk/©]Ç•7mÁѳÁõ"Øð Ùr@m}@92‹ 'šó¾’_öíæÿ…`/¥@wµîûO¢ßVœ!˜SÊÑà š(8 €(³e„'½oâÿúGë endstream endobj 1027 0 obj << /Length 2313 /Filter /FlateDecode >> stream xÚ­YÍ’ã6¾÷Sè(WMkHê“eÎ7¦«¯¦Kh·xn±òöÒ‰Hu¸‡DòMüVƒ ËÑ’ §M™ÅýFêØÚaÙðR'Ëù  8áU„ÐñØ[Kt¼l+fûK=^z<62ööÜÛÁ¶£¿ràéöó%,ù eWš¬à™Pž|£òøïÌcVÞõ;ÛSwìœUÅÜž¸ºLÁcFê8Õ¥ŠwÝ©jZ¢Ù£=Á‡î§Ôàg–è *Q«Ä…Hþ‚çÜqAîö•¦F/db6$“ـљ (;‹^ƒ^2Ý=»|oëK?L¶®Uä1l´Cý‚¾—«ø\õcS_ŽU¿ÉDüNá6€³¼_ìníøB ƒñe#áë¤7ö½9hÔp»³£íO ¹sîº`nÒšeqÛí¸ÇŸ ôœ(hëc7؉cçÙ˜¿ïºñveo÷¶æ ¶Ýx ÞdÃ0ªÚÝírg‚!è9-: Z= M㟫ú€_Šæc`Ï9K^òÅæá À©Zç[ÀÒµvJÐà}×ä¯Ö¿žíÀ Éå`)þF3‹‡…paîÖª×Uí¯ÂPî挌r??=|~0+" H(‘—Q.‹¤”&ªO¿ÿ)¢L‚‘’Ôèèűž"•m wŒ~{ø/½7 š:ÀDQI¨3øÿ[Å&O2½Žb£“¬œ+v|£T¦“¯¡T)äÈfJù;z ©)<š`d~Jþ¹€ç`áYÊ’BÊ›WéæZ'*“«œÀHx¶ï¼.ðÓ¤Xå¶à5LŠÜÜq[i®YšU”2‘¼¯Ô~m;à³ôö²2e6¹0xJ•1/ÊÀg9^ùºo¶ô \fàŠé,Â#…O¯ÆØW$4Å~e‚fôª9Ž—Cƒ˜äH^ØõiAŽê|>6Q2-Q PÒÁ?.DÄ!fÄ $¡Ù‡E8ì9V¨j÷fuc/ƒ >BXøñ“cŽIT.ïÀ0T’çú;ïu®ÏƒÊJÁ«îDUT3ìÌT¿;k¨õÀ3S»EÇœßËÌŸ @ aàràü¢ ¡]ªJZëzÎ/Ô̵`´kNô wå™äòFºÚZVƒQ¶Õ’ë]ZP¤ñ¹±µ{;_šU*þ|©†æ±b윚ŔI©ôõ‹•ÅÂg Ø™ÏÓZR3‰ã\l ¶Òñ/{š)íÕs6š¥`uà5»fawR‰ÉòÉöÒ…íå‰)Ã+a{0£ xšÖfn¨¿Ñ2ÕñâNa*°  ²@ß# Fˆ\)G^ 9 Frôª4Ýe ©É£¸à 4ö¢“âס:ÁBi¼‹a,†ý‚‚1Gu †ë’p¼àl{ÃŽŠT|Q§²g~Þ„ÚðêfCî…ÆtíÁŒ„A–ïX¬?pÇNd8ï7öQ¦\ɸ$MçúœMá¡ÏJµ ΢,H\îÅÙUT3ÎÎT¿³k¨õ8;Sk¿œ«3|Øb¡´‡–¤Òû0yªÎ³Q¢8P>õBH^‘-x:±`΃ôþº>¬ój(¬p¢[»ô1`©cœSçÂ3Qiô4_ÎòŒ“ŒˆNÕ³¥ ÈmÙhO' âúº`°ïúÓà9x5¥èF‡µ×Xúv{Ó3‹pfq=³`±ÒÄ5 ÜŽhdG?77!œ‰0)B!Í×”HàU¿+Awµ€Tm0¬QO4î¨``&…3=—f ‹¡ÓõÍsÓºü¦Ò`ßw'b᠉͸dHJ&9»ÙPžÁš–§qþ‹Õ¨bØ:T£¾ŽW*K |ßWÂ$©.Ö+%uy7\­¡ÚÃÕTõ7àjµ®¦j÷Íq´ý†J¨KSn=ŒRÐÛuv ŽÖÕ+€ÔœÎ{)XµèJ¯4áÞ\øò]uOÅ[¬ _Fbì+ÊNœû*¹8GŽ&|íNpíN¨û€!÷ •çÞi³¸¾ôþÁÍãá²õEœk‰É-ìˆá¥D©¨yž”âZâáhga£*ÔsnTÀþ¿V2S™˜;5ÞØ@ïZ,(#-ì1ctH'ø´ÉñSŠÍ§Sàla r1ÿû‰f&ª3áUãŠa Õ l¸Ì@ÀûƒÞeð(Q1F0øæ ¾×™Á~¾Ø¶f,qï£r,D0¼.ªÀ -ÍWA”%B”ûMTYE5£ÊLõû¨²†Z*3µG[íSàjÝÚ™K„'e˜ý¥ÀÝž¨_Ã*XPÞy;M€ t³Aν‚¾Ç£Ì=%`…YÇ¡@Tywñb ÅÞ&Š¿áMÿ¿ÒàL¥§ªÿë~_*®… ™ÑZ×ãÿ 2…`¥%ÒÖRK¨„=—!C[#0°ï×þÕ´Ìê !Ð6-ƪüïj&ƒV€Ÿ.úZ6¼àÞëBœÌuRëx$ÊÊVÑÌ.9Õü¾K®¡Õûäì¼þuúŒÃ"Æõu3!»3üã;ô‹Èœi•!Ó*éÍ„ «4Âø4Ðð¿h}Toøß«¡¤ lòŒ³Z—¢I,„ž¥˜ b[†š&‹2€oA+"¸Ÿœ%œÄ>g-& d1-qã ‡iSfÓ0L|\Ú4ÇoFN‚+£®±LŒž;Í] ÏBéÆL~ýÂÄd'0)ª­zš!àn†±ü¨S‹Å%)§á0w–HÂ{™•%–î­ý/ùLϸÀ©ÿÏéQÕ endstream endobj 1031 0 obj << /Length 2576 /Filter /FlateDecode >> stream xÚ­ZK“Û¸¾Ï¯ÐQSeÑÄ‹£SµNm©Jyn›=p(̈‰DjI*³Î¯Ït$5ôxëÄÐ@ãÑøú¦›çMºùë]Êß¿<Ü}ü¬‹M™”™Ì6OaŠ$ËÍ&3y"•Ù<ì7¿mûÇŶµ½ßI¥¶m·gªë÷¶-·ãÁž¨¶ªk44í3ÇŽ¿îUšãžÈs74cÓµŸp´Úø®ž`íÕ8­Ñz;4§æXõTéµ ß*t‹šË}?82ÛÚ{a¶ÖöÌÃŽ‡Š©f¤a‰ã ýìpÍ´ïNUÓm»5Õ´'ÛŽ®£(¶Õùl«ž®Š¾'¾ûf›¶vcŠ2ê2÷9U_‰8T÷2ÝþÇMÇòp­+p³¿„÷Æl“ûJÓíÃÁΈ|¢ïÚüìm»6qÏŒÛTчvžoQ~çñÅp½}êz®®ŽCÇ §S…•4ÕÑßÆÍβ‚˜ ’‘š'˜Ÿºã±»—fûB´5~=[–V9]{üÊs»œÏ]?Ú=¿ÆyñéË϶µ}5v¼Qo"„BhÍ“5ï@£%ZÞ!ÜX™VïEˆ›ˆf„Xˆ~!n!6 ÄBlݵ£ýóÇQ‚•^ÑþæŽT‹P÷Í£W"¡]û0ö¸»t5aÃZúŽa„sÕW'î!ÌY»§®‘# hpÑoľq™”„i»x+åÈGŒ88R`ÈûØ:P¡’%¯¶Ž˜ÔÖ=$8¢†ËÉr¯ŽêÝq02Ûþ:RUÃbèbºš(Âß¡ù|ùVþ»ñËÕ%Á¾pË%cìcßí/5sTû½·çÕ‘ÊÓ^:pœÐ2œ«Ð)CÛü W¶Ô¯*Íy:Žò›ìk,€RÏ~‚¾P¼æ çòÑŸ´£ØØéBlmy˜ª›úâ N·xƒ§áz° DÛ­êÃ…½Éòåå9Ãd¼¶T;gUÜ,#ze€8¹½´-¶˜ú¯í»]TH ¨õÝýäÛ/³†+Ú+ð.î⹨Ç*Ñ} 2í¡qãšÔlM*ŸÙ+Ç=öÖN²p=ê»òÊV&úÚ ¹;ÝÀÖ30²z v©­0Rûñ Õ;p_k NsÜwcea‰ßÇý›ˆfÜ_ˆ~÷o!6àþB,0ŸtöýÈÏ'ôÉÝÏÌ°»FAUT}€À@ ¤¹¨' 1ZÇÐQ5ð,ØCðÿ¼ä£Ý­Aiðÿr3ǵ°^KsÂmWãµåpèÄUn*Ñ°Utˆ¾'Ú ;Š‘ì!¡:½ýÚò^’x ¢¯ÚgGÂË$GqÖvµ­®êT‰ð“@'ÜþÓ@U¯ú¼93›è4™M|ðþšÄ&ÖæËX]N¨C2Cõ’Q¥ºÖˆêeDõr†êÅöïÝȬÁŠ”Ó™‚žöÕñ0¦{û¶¾§/@më|XrÓÝŠ36è2 ~(jfz抽­°)11·xµç¨ ‘K¦ VA&IðŠ•¥Á¹J7Ý•9"Ö8Ù t'6U=6Ó¼©5*虂¡ôÔ±íz94õê*æd_[yVª£ªG™—O:Ž0ÄéøÊLkð‡¼@®`ã(’É'Áy\ÄâF¨õ¡ââó•%£™ŠD®ÎÒ]Ün\»äÁÆÔÝé|„§"“é®G&ј)^AñJè^¡{ Î\¯$Îè ež¾Ò¢<†U x½Á5tU£2=З¦ ¢ïº‘(ÃsŠñ™]êœl»SSÀ× ù1`i¸gÃ6í*\b¦îr!ì" î¾nwÝøm)Ì£Rh¯p*·¾“w,u8]ôñs)ç/—0 ’¿mܕΙ%2ìiöƒ¦n!NÁOðÜPžÅwl»*aËü&’á&dE¶”¼nÚµÀzSs ©Z¦‰(õRês_=+buæ£ì[ˆÕ •ZŠ}¤¼„×¥!KS)–Ê\[Q—4Ñ*S[DánÎ.Õ‰6âg–!Šü~$‰‘¾£,R¥I¡n!W*•âJð7Ü@cÅsüY©«•ùRê7tEb“Ó<¿‰XlršeK±jûU‘Y"Œ ç“%ËÂǃRÄèÌ¥ªÁƒžL§A´H‚³ÚS†A^!³Ï ì¬Ñj5Ò)Áº‹Ï™r–§²·±EˆA7ÉÑÑMr?‘9g0BE F ­H¿‚"®Õõðp»æ\LvÀ(^Z.;3\D¾°Ë2o¾¶Z‹Á^Ø™B»`nô‡-nÚ¹±4XßÚÝD4‡v Ño‡v·B»…ØçKÕïÿÏ„^^pwå"•‡–e*íäæ„,7ˆE* ¤ãÇ"&É‹w¤ò¤Žé©ÓÊsµ!9–†Osˆ‡¯×V´ØF©­Þ'ÔA÷ç‹x uJ—P‡`B/}CÔ;÷1×ÛdmÊ”¢ICÉgkž¨*¦ox‡gTTô3W¹cfæA˜I™3d1'×Õ…´P|¢Ûe§ÖVüÀW‰6i´O´qvŒ C‡ç÷IßèRë˜ZS³ÔšŽ©5SkzJ­©mȶ1éyjMQjmm—é6•Oé¶ÔpºÍWWô ú¬òøš/RkReá4¦'Ékâ~~Mªœ=¡Á#åz<m³—0•Õ·Jª­>ðüž×”æÀQ¿²×žœå[Ž–” ,@É îj®~ÊpO’ºôC¥ùwŸZ $EyÁ¹HŠüJð7P¹T~è[H-³DÁ®,¤ÎÞY®ÐXðË£Ó;©šS»ÖÒ!Ò;}xà mY¢Î? ÐÙÉT$n×òâгץ ÄTæ ½ˆy_¢»Ðvcxrìmµ=áÙà\4í•gÁ!¬‹Íc~ƒŸT8>ûͦøÉ–™Y W lÃpi€ëuuY”}KKߪ]‹+ N"o‡¡0¥i*1+(B&*tÞO)üP"[Ñ÷+ Ðpò‹0¹îñ_¶`K̉qOîç£F.]ꟳʒ,½rciÿà0êÐ >õVÂsï_Žr™<=WáÑÇ=Ž?S™žÑ`ÇPsdž˜¯eÈ9uÅua,¨Œ ©_?®'ŸVž£Ÿ.mÒQÞ ì­6”~`%¦ºÓyüúZѺ~‰½³T;ç^z²¸µpŽàR!öHŠ‚ÿ£º\pAsþa endstream endobj 1036 0 obj << /Length 1116 /Filter /FlateDecode >> stream xÚÅW[¯£6~ϯ@êKRm|ð…›ZUÚJÝJ}«š·Ý"àzgÁœœüûŽ±!SÒNŸðeüy<óÍÛÚ[¶õû¾ñýu³xú+@K\k³³°ç cËu£Sˆ2z"¢¸ƒkÇ€€j!Ö·1ækµ«D&¢ˆ²ònÝš2eXsi€{­àÓ'æ̾v}ä1b­ FѨ›àp`/wMK@ÓçFîrb>ë·'à^%³øm³ø¶À°j[Ø"Øf9¾ìÀ±âbñù«m%° nC4ð­c+ZX~£Üúkñç9±ó(@yÈÌã{^ßì ~ÌÍ®ƒûâæX”µ¬Àª²¾¾œ†l ð.§ÄC6¹º¼84râÕÔe9y5u!Éö¾`£Èƒ'6$¼Ž«lËÍ¢ÌðÇÞÀä‡Ì‰×)LÐw@NDu|Q à;ã@ˆ£rµ&Ž½ŒòZèÑ–ëoS+EÔHší¾&–zÚ½«F<Ç cãË&ÙŽ(¶-¼€õßa} Ö@¢ 8Ãø QÚ›Rlÿæ1ð²}ZÆƈÅ!ëÌ•f°«x·ÖÔY¹7ÖJÍ™Ès±‚Trì÷ºÄ Mv•Ý/Þ³¦.8›êƒƒ÷JíðÖ™Ý>s~¸ ØNg%÷²Éó¹Éóû+Î[z½•Ó;{o´;Ýkwzgwj ÀŽŸk½uL9¡Òò¸ÂöRL…‰ š½Y(s@[Ç%ß—ž˜Àh wV€úu€¸Ë¨âúb»ÂÎò%MŸ´¯‰ Û»¦Š:*ø,òwÔ×û©¯°b‚`á!‡:„ ù·&ÊgðêßùSüávÎ w7”:KÝ«è±Ø©¯«M®:è0×eˆ£vèE†çUHM·'ýíe+!¤¾¡IÚÖ‘VœkL展pËL™w“æ± ó²;qiÏåü®s îaÁGU±¿ä*_¡¿ÒS)kÀÔµÁsµ,·º|€rŸ)­«lŸJ=mÊ„W%djR#×ÑDá¨ÓJK½£ûl(ôx•Hš¼}“ #T«Ãô jp6‡šŠŒ$.(Ò.õY“€tmø%˜„ò¡GY­¿Q]7…G9£S­ˆml7Åx1lºž NEÕQ[Ù¦þŸ {A¬Ñ1÷œ{geÍ+¢JfÑyý!·M>7õŸ/š\f&ÜÇ0Úí ’Ñì®âýQ‘‘N‡Sý¬4A£åºˆ`㈠Áºˆ ƒˆ £ˆ`]DPlízËþ›±q.˜½=ß#i’÷j2 ÝZ¼ÊwgÙ9‘Ÿ5À#c]Ð ú4z!H0ð囟+­tÚ¶ çÁ endstream endobj 1041 0 obj << /Length 1167 /Filter /FlateDecode >> stream xÚÍËŽÛ6ðî¯Ћ\¬¹E½Ð¢@ 4z+ê[´ÄµÙÊ¢CQÙîߗÇ,Ùr²›8Åž8΋3Ù‘¢`DÁï‹È­¿®÷oI”¨Ìp¬‚˜(q¥9ÂI¬ëà]øf¹ÂY*q\5l‰ÓðÓ2NCÖXô®§²0[Q3‹|¥‘份²Û¾­™lU{'jÏ,G-”· Üš/¶»Š:ôÖ‘òVIQ÷«-^ïÅòÃú`T¢×•©³ÙjH£°«ö¬î·ë;Þî,8P<ˆ¦p­Çáì¡o+ÅE‹@Áà.¿Þ¿-ñÈg$FI‚Öêãªÿ·UÓƒ7R-øgÞ5÷Þ´ÿŘM Þl4ÑfÇ?9ØlÌcÔ†·“jc¼Þ62½)—‚ýçº`¿½»nØ?SŽÕëõ,™V™N&‚§žy3µ§ÊB•8lyË:‡\ÆQ(¦,îŒqA pšÇtÇOyê΄¬-9€võlÔ¯rË•¤òéz^Y)$ ï–«$/CŽrà#‡ôNÒäoLÒ$/)rí]#G{ÑäÖoëÅÇE¬±Q—(ÕñKÓ8 ªÃâ݇(¨õ¡ JÊ"x4¤‡£²(5Ô-þ´y¢ '¥ 6¢2L¬ÒÁé—šs}×ü6šóà©fS.µ–à“øZ“#’Ÿ]—}ìY[±™Ô$)J´‘êg↉Nâø³qKŠîÊßzR?á4~nÜHB.oâA’è’_<'l$Õ×½‰Ê,FyQœGMÍÕ’(ÂÓÇæݹºáßðÖU€JêvczÅËË~÷Šë¾Oê[ÕüxZô³ ÀPý²óº-/¹ úNwK¿ánÏimkŸZvªq}J<œ%Þ¤©ñöØ«ÙþÖ2Ÿ½JLS»æÝßB?hîvÆhGgùmP.¿íÎ<™¤°rÑw  Ыd’¼RëEû© ˜áz€£v99rÔÍñÕ–zšÓa‚$!í,F ¡,dÜ Oì@˜‚FXº~kÆ82¾Ò½£9Ÿ4MßV¦}¨+?Ñ^ãNŸ82I•#!á>9;ØA€+kÎó`{7,N1—ìbÔÙÓ%Ž¼<`=þ8Xj7¶5uQ~­3¨b²c•ÚØοÛìûÍ¡&–£it0ã¥6Âý ŠGïôc`ª³'Êsé7#-tÖ–À3Ѧ±ˆ#•ôÀ”§¦mí$õÇÆÉâ5kEÄ\}/’=0 -À•‡íÓY²ñ¢øÌ ÆCR¼ÞD3®ß€¯oÕ¾"G.k*žÔTØцïLáÏýG®F¡ïìÞÅ7ðƒï 'È1›ÔXlkõ—¿‚çÂ~¤ÕkŽ¹qåÆø®ûÿ?pÁ9žà¯È—2»È—2ç‹& þ¼³{å9]]Ñ ¦íi̱éw29¢O¨ÝžÇôŽ”äŽ~$œ+ßã¾Ð”;hzX&›™qÅø©E¸ãáfçSL%ZEG_ÞÚlWÀÀÿiÛYÓ})›&ig%…¶W°©sylÿ@ Túƒå?²}K endstream endobj 1045 0 obj << /Length 1534 /Filter /FlateDecode >> stream xÚÍËŽÛ6ðî¯Ð˺X+$ERZH¤HÑK=$!KôZ^Õ#›ýûÌ”mÙ²w7ë¢=i8Î çMïÎ#Þo3ræûëröêmļÈ$“ÞrãÑPø’ROŠÐgð–©÷á懬Lò>Õó…`âæç¬Í_µÉV§}®ýí/óOËßÛ‚R?îÄjD«»ì‹;ƒ«áˆÅü8uìlU÷y¾Ž“Ï«¾ÌªrU߯Š>ï²U¼Ù|$‚˜óœúŠS²»øóyÙÃòö¼îãó§*8N}]Ä  ý 9½zËÕ-Rù!gÞ‚wª,÷×¥¥[ûD*Pd°ÒÌÞ,gÿÌ(`‰GÁ1‘¡*ôe$½¤˜}øD¼6á~)ïÞó#”{ïgNùX1ŸˆÐ°âQh…šžŠeDùŠ„×ËÀÈ!°‰-âzÂr4ô…âƒ=]7ºÕew¨ã‚Fä¦ÚØo·ÕØ{WIìèÖQ­»8+ujW›¦*,O¹ƒQáS\ô—nîa.?Ttl˜Ý}&â*ˆOèQØ÷mVÞÍL8£ °©ò¼šCœÞïö6}™ }s¥ã‚p¬™K¯Ã¾N1° …Þ·y4Êü;ÝáÖ²ü³Öõå,Vr.ᔄk1ÑÑTËÜÅnê2©RÝÚ…µ5дq±;ŒÔhö/s*n¶jRÝì8Æããò ~q{ý`±`……1ÁJDÄùصa7Jƒ´* Î-¬s]@Ö´Ž¤rï2¤*Š!™Æ¹ÓÖq¢}ð»³ivš ™¡Ç#éþÌ|¹†Ã]…ÀI€ß©Ë]ÇMÜM æ!d"½†`9­ÆrÁNuU3?P›eÎÒUµŽ€FˆöÛêî @ ñÜž1#&¸í©›d›åi3¶ãWKUV© Ôl_ë»é­-*©J¬¥­]A±váTˆËÖ& œC=Û[„#gÃmë˜d¬2ÇtS5ÐhÁÛ©%ÏÜ~§›¢Ò­4ª|;MÌí3d†Ùu™aŠ 7•Zï]œ·ö€é'¬ÿFÇŽ¯í%eeÝw|f1nŸT™ôUýÕø¨pŽŠ1Þt…—\m²\_¬Éx.é¾:.ÝZðí»?Þ ¬ÑF»šì-ΗöïÑ°íšiåe!¤ÛÎÛ¸ú‡áö„îáZöë!4Æã âNâó ÜO…W ¢"×Ó VŸæÀúc¿;_\´þÔ`=f\_ÈoõVþs»=S‡Î€ÕPé”s ëÝV«X ½žW/±/DQiX…$|Ô³‚ûLÈ«HÆ\Œ%Ÿñì"ßò0ôŠmؙà NºòÞQ“ Þ:Ê”®ª¨6òÄr kªª{ÒŒàÚÒÔ´°ÿ¹ñ³çÿdô\Ùüžþ€FºÊ߀çŽ8ÒQXò± ‹ÈØ~lS¸Çî&0ÚÉŽ> stream xÚÍXKoã6¾ûWèÅ.Ö Ÿ"‰=èè­Xßv†bÓ±Yr,iÓüûrL[r’¶èÅ¢ø˜oÈùøyF8¹Kpòç<_Ln>jšh¤Sš&‹MB¤@)!I*$¢L$‹uòyúS^®ŠvmfsAÅô×¼.nêÕÖ¬ÛÂ,ËjmÐö·Ù×Å_`rNÒ",[.aæò.ÿÚ·hïþ¹oíÅÜåæPí–ëj—åå,°[Ä Rœõ¡6Ùý j[æU¹¬MfÈ/ÎÎ|ØÐÝO¯ºoþiLYƒ/ß¹ƒ]¶ §–ºM¤ IN“9[D±ƒ“?“‡ 7qB’ „1IDÊTi²ÚM>ÅÉa'ˆi•<º©»„"­4´ŠäÓäï>¾¤ií, %=f·ñK`J0âl`J‚ÍFÀ.(— Œ#Íô(  vKUŒj#Ûƒ*4â\Ž‚šR8µ4F=ÀBß|äêdÀHXƒnâê`²ÆÔ³9lšùGs0Æ·óf†Jÿ43"¦Gã®Ë“ÝMª=ÕˆÔˆ “þPU rãNœó˜ÕŸ:VÌ©ÀÎdí›+‹l·alUís³öí¬ ¸šm—w¾ÙlÚMUÕ nÆãqlÓ–«öP;Ÿ.´ïâ‘"G—çëÞ¥HÀΟ^! ÷Æ쯛¶ÍWÉ[ÙÅ[½´¡x³€½èå‡{ÕlaÃͨ:·ëêÂm_µg•í¿ KÚÚòǶš*LÙšÕ½ïÊ7aèqFð´ò/Gso±vá¾ÊËæÔ–rDô7£‡úu¶ 4ÝWuÞ¸{eßòòŒÅÏ;ìWq·‹Áܵ¡º­ª!N@`—æ¡ÍŠÑXJ>ôý¾Å}…ä …c¨öæÐäƒÊTÝ67˜£$ð{•Šƒö,qÿµô˜²Ý …®yÚÝÇåiÜxXÓÑÅçE?_•Z¯÷ÙÁ”לÿQÊٯi}ízÆwô âÉJéFTP/|%y¤ÃO0'ïJl(C„qx*8úböi«|d8 H§bäôQc„U3„%‰Q—  kߘŒPĸŽ1»+vFÊO£0M{ð§ÜÿE1ÊüR×UmBOÇ+{~ Ééôq›¦‡_sŠ)’T\Üìž"²X,$$úÎÿ}EŠ€sçpœ”öå*…h¸Y+ÄåòÏ,Ób TJí £öòŒ2Èã%”SDSƒzuîÁ•QNFÁ•öKE ;Äo(!8ç·KÁ­© ŽÖ'Iéöà€ï;fló¶8¿Ú†$0g¤>g9ÌK9à>´ùÁ%ðfH¶Pvå5TPPiѧ¤WÕ´J¯Ëµ‚9à Å íì}ò¥$"©S¶ ~Q®!SF)™1 ­Œ‘û¯°_"GA°_,bÔ~¹– ,óQ@eŠ˜bÇ|ÆiÎA`Ä%§9™@Qi‹š'OMD¬ãÄÎq0ªC¢D¶ögú„ÄçÈEUÞÕÃ<£¹¼È¼m×sñf_}âÍ}ñf;|ñf[Îxî*{a¾ÙŸ0§éìŸxÏUçáÉÒÌ?Öy¸R$â8vÚÎó &¬ï ÒRusL0iË»¹?g† âøL®”~þ“ŒÓ˜C|ì¡Lu«‚6Õmˆ¬¯®> stream xÚÕXKÛ6¾ûWèÅ.Ö\>DJDŠ tƒöVÔ·4d›k ÑŠŽDï6ÿ¾|ÚÖZÛvƒœøœùf¾!g(!°¼Ÿ Ðþ¶˜ÜÞ œp°¸8ec 8K!¡ ,ÖàÃ4Ï«®Î7Õ£œÍaS;êV¥\ïj™7j¦>™Ï·E+ýbhöqñ'H0Ì æCÁzÊuñéŒrÛ5Šð;§iþ²ªÿcg«Ô`eѬd§U;l)¿ÞÒ§õí«í·ld#ÛBWª9ãÑ^âÔä&_•U½6§àz?I¹ýŽô:KG;7aKäf«º—,‘³Ú–JÕ/qYÝÄæ}ÕvzdNÏà ܶò±R».ïªe]5›W'’_Gäà<Í«×{ñf 7ò_ýfì²o`—¿Äî•\Éìí]’UÜ9Ï`š0'F1μâ»fSÕúíýÍ`JŒ Ñt»eòûbòy‚Í,à ™-Ð$ƒLP°z˜|øˆÀÚ,ß!xr["¦Wƒ¿' ½2 S$œ**˜qò-©"©)Vçô\¦·2åã 3“ÑØ3äáTOSËÉ( Fa¢º‘zSÈLÖT0È(Ʊ?8'¸ I!Ã| Ü„"Èëã^\Ö\Úßÿ1ˆí3s/9LiÚÅüT5«z_A¿˜3|Û{Áòׯ~€ž¾ÌLˆr›-óµÜêò‚ïàQ^—g r/iþ­ž¼gŒŠñ}-ën†²à¥ Ž~d¼ÎÇç>,#ú{ñç<{/>ë‘Ï'¿Ž.eïcbSsJa–†{YÒ“1Iç?²ÑŽY endstream endobj 1057 0 obj << /Length 1140 /Filter /FlateDecode >> stream xÚÕ]£6ð}R_Èia1`ºªR+õªö9o·UDÀkYÙ&«ë¯¯Çc¤än·íU×'{><3Ì7‘wô"ï—»È?íî>±W„EgÞ®ñb² Sšz݆qB½]í}ô÷{®ºýc§M@cꤪ–ÕCÇö½¨¢ßÁ•Üo~ßýf¤„„ýâLj’÷ åáCšÏl ²<ܦ±ÄF2ÉQò]· ùðT™kZø¼GT‰Ç¨‰Z2†x!›aHF@ÅúºìµrÍ$ÈÐÕ‰Uü1ŠâjR‰crÄûªjÞ‘¨[f=4,Òtéx Ÿ¹ bÃZ•=^ Ï3W\³îˆ5;é6õRiD$ „¬™DpPV{ì´ÛK#ºNlŒo_.´fè+ÍE¯B0ð’ ãy•) ó4Y:ý;üVµïM4F'‡ík `®K½þFHVVí2öZœöµxéÁ³VàhÇkÓÊe”ïo™t¢CFÐó®u®oIØû›ö¯ã ˜á÷¯PÞ¯Fà ò$ÌòìÕ°Ö½= Öéc(¦BøçqX÷ÖhXö Çâºý…4§ËHìl¡E‰)â®;”Õ@é¥ÆÆžªãÇVwŸ§æ¨¥ 3-$É„lƒ¬øLj$+¶Ð°Ø^x˜d½FÏ(\v j(»k‰ï,âÎBÝ–r'ªî"zc0v2;ò«œêk^•Úö^J}5TS€èõ¢z¶!Ô?n¨_jÍè °mé/™:Ýa[¦~³!¦óònl&í¶$:“d"›äÄ?lbÓ5ê);%o2y¥F^Zf|u[8/šKÕò®6~Fæ‚|œÙâx01á¦Z1t5Þç:|h *¶þ¯îÍ©”šWCWÊMùæ#â<óùµ²KW¬—L²÷G8¶"⟄ѵt–!žQv_È°ø­"`™>Ð¥_¢íîÝäcC[—".)è…u0)V3Z²˜b3÷Ã8–9: L;мÅÀÍæejœZö¤?SZH…(ÍÔº+NɸÔM^ƒ)œ& q<Žoƒ:8Ä4¾ Ò•d:~AIaí6¨G³{¯Åhc}{u˜­ ™ÜÁ6àö–Ñ}ÓÛw„¯±"üʄцðkϧU³þwó)IÈu“$žAä(Gåȶ'6ÿ¾Z@bZ‹7P`Ѳ„v€}F*<Àf÷h Æà²þ™7YXP[x昞\á8)ìÙ8Jë‹E~âH/g‹<À®< z½È/¤N\\+Ö5¢õ2v¨KAäÆmÿ²(Àv¯\O?®ý¶˜óYÔ¼ùt%mñƒ`Ëé¿[å1ÝüÌn.Ý7Kh¬ŠçòtUØ¡µxÞ§õBÎæºuùÄ>¿ððþ­¶ÏKõªÂ¿ÐXÖíyUcùÖþ^ë /FØÂ<û—øKŒg‰ºhe$ŽCšÏôŠ0ß&(žPºxóóîîO‚î®= endstream endobj 1061 0 obj << /Length 1431 /Filter /FlateDecode >> stream xÚÕXKoã6¾ï¯0Ћ¼H´zKF‹ t‹-ЛomaÐm«®HmßÎЖeûH·E/!5ä¼du\%«Þ$¼~·}óîý&[mâM•U«ía•¥u\”Ū*ë8ËËÕ¶[ýívÊö;'>Êõ}™•~Ùö$»±—;m:&¿ÅíÝú×í~Ÿ¦ñ¦œÕ§?ø%)“· KŠ[U¤qSäKx¯¸Ð'£:–­ðÀ;ú^à|ïÞÍÄN€–ÄeS®î3€M‚Ýžàä<)"7ˆu–DŸÖiÉÁŠÉeÔ픥%©Ã`Xžˈ.¤Aºqв£¯ýñ]8¡}¿íGFuë”Ññú¾¨óèƒ#ie¯ðh…û´ˆ7E1·Å íÙh«öªWŽÉò*2ZýqY^Gh &Z¥¶ã ƒ˜p$çNx&Ò:#y§£M/EÇb "4­ |ždZ9ì9Çx÷Ê¿Å‹0šiÝ’S=hUD`í4‰ñxB­*gk2Ÿ–³QÚùW?èÒƒacŃ$ÖÙX…¶%:Æeà”ná2fàS„îˆÞžTßÍÕ-†kÙÅëû£ËŒqm1b/<ó\5 ·¬,£ƒé{³†˜}TúÈ$ŽúäƒÁX¤€´D´PÈeeåß&z •;ÑN9Vé¤m¥î„vá9x”ã ¢OÅû—#²7 ¤‰ô»”-$r”¥AÌ«§PǑ̈ª‹»; v'‚€ÒŒÇs'œìXn…‰”§|ÀW‹£À7‰`~Qò%ËäÆîÌ ~LÐ÷éVÒ{a ¥ŒåÉH(6ÌÄB-H7×°ò·QB¬ÞDÕ¥„õ¦„Ú;­q_)Ýöc(±ß@é}7+½ñéÛ×´€gô];º¬¼XΫ&®‹l©š§Ùmzåi>I/x–^("ˆgA§—DâêŽTú'bŸ#‘|ŽtŸHº$†§¾œ\×d™Äá%æbæ£nÉ[ÿ\üH¡·œ%çØTk’YK fPG¥±†#æ‘n(–‚†S»Hƒb‘ÑŠ4ô Lntu *ÜÀ·' Q+°D׆ˆÞ¾ÇÔ”æÀó=ƟƇÌQYûYbӉ̤Ä’áë/¾nšæ…wùm-œÅ9Ûª˜eq~u×ÝüêÜ‚ýPC •Ï Š‹[®GñöT—ù´Ù#¸…&‘P/÷k{2Cˆ;î©žþÕrSÿ½rS½¶Üt²—Nþ7ç'c½ŸjonK[߬`õ.ifQS_šCÝ?ѧL´0yût0Ãà91ϳè YóÀ(­°Òú¨ÚD' ýÏ4r‰<䮋$ºCØŠJZs©vMô p|M7OÖi,R¸u†˜ft´ç²·!CÀuK8dë‡K(•Â ×sâã®ÁîìÅ&îc¿©}({³55çrs10ììÉŒ>½šš löžYAê }”ZnSS×W¨Æ¾Ö`á­¤jYcàÓÎr@oA½4éf¾eÖÓ!S6k.¦Ë“œGE`ߎŠ 7A ¼Ù36Œþgˆâ¤ POëìÍm8ç—nŽ¥ñ¶•ðÐrT×hÒ·í‚cÚ^J H=… Óž®âößl0ù÷Æô/”(;¶Ç.TÆ?Q\>JyþãL–<g²$†@‚ã ô K´ø`’… ƒ‚´J"œÅc· ÒŽˆ4ž{ÆR„Âø“a>óËjv)˜ýÓÍp±2óÙùÿ5éz»ïøß R}©öSOÞ&}6ð6ÓÁ/Ñ«£/À {‰Ç[úö…·I¯7îBÒdìmB¾{sÕ}lˆ%÷ŸE{ãñUZqÞ€nQÇMFªiYÍ„¾ß¾ù ÷<ý endstream endobj 1066 0 obj << /Length 614 /Filter /FlateDecode >> stream xÚÝVM›0½çWXê%T á; V=TêVêµ¹uW–Nb-Ø›]í¿¯6 ùØt»ê‰1ö<Ï›yÃà‚%pÁ÷‘{àùu6šÜ¦>H4öc0[o9±ç8š:~Y~?šMŽ-;ò£ñg‹ ÏV8o )˱³úbÝÏ~HHÛóœ42nÊ“pI£Zõüôëû|wÎBT%…ªQÉïÜÈm½BÏIÂ`ßµ=¹V™7‡ã~P¡líØÚ2ï“òžÜ†I'vœ8Óж/½D#þÄ–t|´¼hŒkTXvàcŠ²Äs…¹6WÈò]sÒl®0©µÉÊU‹p¼hh&£ÆqÁÌ¡ß ®Ÿ ]ê•Ê¢¹^ªŸœ•gÙ‚À†ÊÃê ¢Åâ¬vÙ‘#ÚnÿuN¹×lJT]‡Êï­ ÕP.¿B8?¤C•árŽë·Ê´r3V ¥CjÓ˜1ÙM$ÇT\-Âs„ mTŒ_ £Ã!”ˆ¡ÈÏ¥xê¨Ø¡¸wzlôbxuýZýãºlšÿÛ&~e•ø¹D.,O÷Š!Š˜6åq Æ*ØŽ³Ó?OöêAü·v.Ëë6ÙPÑÚ×&ªË”ä70 ®.ÂY>%¥ñ»NtªpÎ`ûnÔùUíýì'®§ °ƒÀI¦Fö¢iÏåÛlôä# endstream endobj 1072 0 obj << /Length 2452 /Filter /FlateDecode >> stream xÚÝZ[oã¸~ϯ0Ч˜pÄ;…¦@§@Š“·…¡ØJ"Œm¹’¼™é¯ïwHÚ±:É®‰èƒaŠ¢Î'žû9T1{˜³¿^ñÿÏ·W?—bV²Ò3»½Ÿq«™á|f´eBêÙíjöÓ¼é׋~ùX¯öëz±mWõâ®Ú®õ°¨úaq·oÖ«E»švÛ-tqýóíßfŠ3§äì†sVêHh± Rßêzw}£…~I8Lÿž† Äÿà)Ýœ'õÐüR¿NÊS(ÆÏžÙOÿ÷3Tßê·÷óaô&æ<ý¸ô2ñáç üøøY¹‰ÝǬ³Áw‘îí# §æ÷ûí’ŽD­“Úâ<¡5W¹½ú×Çl1ã3ÁK¿F[Ô³åæ꧟‹Ù 7±&K7{òK73ÁJWb´ž}¹úgB±„L*ãI +èW d£˜uyeÖN½p^¢º’‰RgA-ƒÆ¨¤f/Q%—Ì2ªä†YÌŒPa§ P)YáxPiXa'’ÝUË:¡­Â?(]WûnÛU:žõÃö~roWu×¢˜ßÇ $“'F94Õúú†—ųzù+¢Eÿž H d1¼=̽b/\ æÌë# 0K@êP_ÍíE\-4+¹ô¤$woŒT¦šYs˜ª#§ FZâ‰È‚ŠÈãôôŒ½”–I›SX¯Ý4i. †eTP8U#Ízíõö%°6ˆ;& °.™“ú½¥¡ËÂfAÖÐea&È>Î%`¥`Ï¢ÈZjVÚT»TU÷ ÏÈ•ý“tå¼Â˜üHˆCس‘¯† % çÂåà‹֛̈/ç \<šGA°rªKd­CW5Û¡O™9GÒeÛZ*V;ßìöCÊ­YºÍ²kmÜš9ÏïN†`äd¼1Ç¡Á‰¿ é®ö#C˜2®ö˺‡6ÃYÎ?žj¶ázÕlêm\”¯,Â4 ßÕ«H¾ ÿwî«’Ìâ&U8[Á…ÅFΛûøOofļ‡OD¡R²ºö„ÁÑҖljgåðÏ>5ãw{ž^|>¦hF9m5Ä»ýr…<‹g”U|í]½= ; ÆôC…«>\ª®VO^ÕOœ¾*&¼õûÁzÿ®»6Œü<9ÿº¯«—‡X¡çTP›§Þ“8÷ýšë¹/À‡ºóa†€‹g0ßB³»0Eòµ!ؤ>…1¨`®Âõ-®âÃQåâ£û>Éf¯z‰C¶.çÿXï‡öfÝàpó ÝݵÖäa8ó¿·C|"°í„Èé~Ŧúæ+ª~ñüŠ·áâsÛÈ´á^.?×Õ~蚺KUãýðƒ¸!ŒY“0ˆáõ,èN} k ¨Ûp8GwÂcbUß{æí×Èšß‚ "¡é}_“vK£çŸRÑ\èàW^ Ha•QpæŽ9dkeÃ’)-=)c#Oª>™ —¾çT –K>]·í.ªànuPEÝ­r :üØ%+VÉt©Ÿe*O)-bŽ™zrï‡|ÙúRš‚å«ÂäkœñI)øe9„iµ'eAê¼0yIIŠÊ*P2XÒ Sд0C†ET¤=Âð1*lÐÛßKJTrü˜~HHÊþƘ3Lë2ËÛ»’iT–o Š:NfÑYÀ†„~ $ôVª,êA='ü&[ÚM³Lɉ3é.”“t”gyù’Ö¿CLª€‚Ù,º¡P?cß#&%©ýk³ "ŸæS×±ßvízÕØæ …ØLÂ[j¦¸|Ñ…?_œ’¯/ÎQœ)k^ g…^1 ( !¤ÑcдÄx)ý‰BÔÒÀ3ˆ1j_ï*d©˜Ï2ž«b$ì3å4-¥•ÜÄlƒM]mCM‹ú\¹÷ýÞüèÓ—Û0x¨·1m«Xûp+öó 6Ôfܹõ ”FÕD-â#7Ïtq Ä_ .;Ó¬DQ× ÊñI<‘¼«‡§Úglº|B"|د«.L„íÐÈo‡§ÛÚ…<Áßñ9öˆ^Ó·ëj¨S´BÃÚ!¾Oìà”¾ïOƒ> ÄRˆ0JÏœJI‚8úÅï)ñžöØ9ƒíks÷ ku>G½îV99è›@¯õe'S¤`Ÿïr˜—æY€F\Ÿir#Ø; ö@ìd5BMw¹tD’ï¿Uq:ê3cÔM½¹ eÐ4ËFX¥,#®‚_¥,ã7Ý^7t쬲€RN_ˆ1h:P;Å\™E™ò 7kÚëk„tYfQ&Ía SÔ3UÌ´`‹{ž¨wÓ`BÇxoÔ)&ê6sY•b¢† - þæ©0ÞžâÛŸaõ÷Ì™°$~¨ ˜²D™"ǘiÛ¦`¹ïå˜F2kùóœå‹Rƒ)<jéPÓ—cÔô)4Gö(Üå’;Vp;†øn÷Çft”–p7”²Ê7ŽH¾Ä¥•½ïXržA\PHvß#.-Pí‰ â¢#TjqŒ0ë®;g“Èku(ðÇ'‡±§Ymc×Ó?í»—ír¹ïz:]áC#,é2wÔ•¥/¨âê]ì_Ó½‡–ÒíÐ<í"åÇ–ªOc¸#µÐ*=&áõ*L߇—9ö\±0}bJ‚ÚµÍjO§±BŸ~BWÇS’>^ï»ÐóÅ8VÅI†ÎB;üK2/¨›•æ¿63'=(&æM h^Z¦!óÑG^¿k¶Ëõþð‘Ùa:GŸ±Ç?¥X’ürîøµYª/þò{¹e»êïƒÿ0Žóø÷‚+Ï_^Âsž ÓOïÞ÷ñàªÝTÍÖó" ÿXA‡ê¿†õ÷]åÍÉsãxõ¿ü(4ld÷´Øì×C³¨îï/ØézWùÒù¿/d›Ý쫇úTÈñ*Í“ƒ!/ê fè]ƒêÞ¸v£GYÿóÚu endstream endobj 1077 0 obj << /Length 2049 /Filter /FlateDecode >> stream xÚÝZKo举ûWÈ¥Ä¾Ø ‡v‚Í-ˆo;CÓͶ…‘¥Ž¤ÏüûT‘RwKfÛ=kN‚ìI|ÖGëIŠ÷-þ~EÏ|¾½z÷Þñ§¹.n·3ŠhÆ ­ áB·›â·ÕŸªf]ï7þúFqµúkÕ×ïúõƒßìk×´Oþvýñö@ò†1âÔ8íîFÞÝW_ƉXÛ7UÛÜõ~ˆMNÍÃq3úwÛª|wwø*¦JF¬)ÜÏÞ3z#6û )=ãMq3Ñæ@›Ùì¬82áù†ï÷e· û ¥?Âv«ÍÙÝ>–Ýç°ÙêìôÝ{iOüF[b$Ÿoóö¦ aVÛ¶®Ûk ñT5÷ؤWÛ}³@hû8b]6±ðÉÇþ}ï7±ehã·ý4”U{atXÃLÉ8•Ä2`Ú$îáD~¹½ú÷¶Ò‚B;¢¨!ΩbýxõÛGZl ˜M„³ÅSùXp⬃R]üëêŸ †ã\ eœŽ˜ûz¨¨Î%]XI9QÂÎaƒö?‡•ÜnMXÁ 7z»{J`JA¸˜RÁųÜnÒÇÀººÃÉÿdDÙ´ŒÜn —ú™i|¾¦(¡ÊÒiBå[v” ()Ð>öâ¡1ãÂn3 ZP+稩3cN£(XÁçg”‚sAèâÛQ9×$œÓ è9q„R7ÉIÛ%ÄBjó¢á&Êx†•qy‘` Bdrœ’ @A/O©Ü¥fá< ëü®ó½o†-7hÓ«v¿»²ª²Ž•É{ô±Úù›à|n˜c„‰ÉýŒ*]—šz®h0õá‹Ž Á&ëÒXœzYóû¼¬>ïeƒ QÖîé¥ë{-tÂÀºmõõØñœd~'}Œ>. aqY96øœäß ~mƒ(åyö”þ÷ç•c;¯ƒ:ÿN¿ÿ4tÞÿWNç’÷W0‹ÌÑh×ûºì®%ň„SÍöƒß„¢Š(¦^ñ@Æè‚kJçosAà†ÁŸ )¤èÄŠ„‚PËI•Y€sqbxÿUR"•È‚ ª„S›¡‚$%@Db‚eÕŠ-0£¦’ILPgˆ¶öÒ“•ÀcÆ]dL[ Ÿ %fd:ˆ%¤dVé9ì¹ÜR2M³h”̩Åé&âlÅÑy¤”Ÿè¥_–¥r"g‰Òê;r".AwµÎ‘!)£ÍkâÉ X•62lWšrÚðpÈ0Í€Ê9ŽsÔ¤ááòv4@%äíšÍAÏYn$¤Æ, ®Á{ÎKÏV—µÉ,€Ëzq´ç*鈄l0ªâaüœÍO©û'ð>JgÁÔ™šcž½€ƒœGŒ¤Ÿl)Æg,!ÌÝhyÊf“Šv4ˆº{1ØÁ{ E³,^â‘;y©\JHWC„’¼º[jDÚæ mÊÛQ(–웣„"yLŽ€5ªÕ«&GA «mTÈjc/=[ \1ÊÛ‘5p™Qs‘ÑÑRAŒ’Åi a—4}s ¡Àœ™‡ïü°ï _áB¬JüÈULñ¦þË5S+;Ûnã»psjã”xI…Mû.æ‘€¯ý£o†~R±Ôùrý0›'W÷'@#͘z¢~ðÝcÕøM*üô-&R"a¡lÖ¾Ú®'0ê·ËT+yÕg †¿˜iA’ǘ Toô‰Œ0HD9—A^uŠx?šY0¼ ] ŸÉ´ò„gA…Ä›Z6G=“i"LLˆ‡…²sÌó™xma³àBt*¸¹ôl¥×¨³ cÚfÔyºÓI™¼ýE’3}*7› '”u=iV¼;Õëps1é:–×mÓT'%œ:£;ßC@ò* ±áL¼à³lôƒQöæW-Þ‡ÁHúz†lBfžטèõNqÓúˆy*§6*æ©Ì™9j:Ã(­ÊÊäZrÁâxi—V“X3Ä¥g«©„p@æ@ÖÔ‰ò¹p@ÐZ‘Vèðš3ƒ=ŒoI³‹ÙU¶àgùâƒmøâr4i¹=>ý`åÀâPÃÛSÊщ‡jtÛö8u’„Ö¶CiV7ÌF΃…DHŸŠÐ¼­~Ýb ¡§H–0°6 ÿ"è〲Azßb—Çò×]ÙôU qL Ùãå­pH¬Y=¬>TÇ1U[·m9YxáJÝiã#Úêô±ÞÓ¸‹ X8,k~ˆàö`ƒCïoÁΕ4ã8=¬ K»²¿R`k)œþ|Íñäã¯P-SK9À£üŠ>Ý,òû±ü›Û¦þ›F>Ç清ÁœÅþÀÙØ[mcì¸÷±ééšÑU»¯7Óà!¶—£Ë`§.Ãâ×!Šû@™Hˆ¼"ÎÆøõH/2™êÑQÅG îÐr,þÇ"ía‘Ò™¼×TïQh±§B™FÄ­Á¬¶眉…CÜ:Íœšc}É9èBÎä£Hâ8ðÛ#Ò6uxQb5?†êP> Õ5ŸBu(=ùn QAx™…"jn6ö-V†McðŽ%?Í /ºð}(¯9=&HÑûqÊþ}¶Ð‘Ñ,µ{\—1q ð†ÇÚ(Ha€ž"Q3-– ç`ɆK‰ùðªÙM€“Eq,êUõJ“^…ÖvöF]0-‰€Øæ‚yû`ÊÍø=ñß endstream endobj 1081 0 obj << /Length 1660 /Filter /FlateDecode >> stream xÚÍXKÛ6¾ï¯Ћ·¨¹|SD‹ 4r+º·$0d‹^ ±%W’³É¿ïCÙ’¬Ín»jÓ“(r8ÎpæÒä!¡Éo74~¹¿¹{cyb‰Õ\'÷Û„ AŒN­ áB%÷yònQ4ûÛ÷oo~½¿ùó†ÁNš°„)J¨2RåæpóîMrX|›P"lš<ÒC‰M-ŒöÉ7¿O U‚P©‡B›ÍÎ姽›l‘é<’mJ¤I.«|B*g°Íª9¤rî)äPêƒk'„ K¸á³•œpÍF‡|Z·µ›²ÖX8˜y§œ¼Ü¹‚Kb)›C°à†Á@ð©,ªrBª’DËY„ ÍGè½Ì»72í_JX ¬"É—Û%W¢¯ÅÁ¦*Û¬(áGÚEø¤»ejñ¹uåÒ3L–Þ«T&KƈUÝáz#¯Ü58ì´;‡ƒÆíݦuyüÃ@ +ÈÓ{¿®KÔà˜•M.F‡Ô³Æ;³‹à øâ±³ññ…µÎK,º¹OÞ³‘«Å&‹ëkÙ¯}ˆ'Âß© æû}‘]l«ý¾º…½~Í«N‡:oO%*|. ÝwÞ’‘T ˆ;àÁ8|W”›ý ræRœŸ ZÜu÷{åm#»Ÿ§¯V@¹z(>Åþ/\Ï•¿.aêû©}žnÀ©sj庳}O Û;•Ý—ýѹãEö€g”ï‡ÀˆýˆN°zÖŒããêpÚ·Å*Ûnÿ±=½š¶H½Â¢Q˜/uJŒäCÏSÈU›íqXžkWã¸ÚÆï©í¦ÖY™ãèà‡\ (@½ÔµRSˆs6‹\-ˆCÁO€#i)ÑÆÎ"Õ ¢u:;Ž–BÁϨ¾fŬ#ˆéÕ?øëê_æ ëNÅŠ÷_¼¢lŸÈ͘ñ»™ÜÛÝ·Lö*½>6s HQ»öT—¸ÔvÛSBÚm›n:k;âl³юˬ¡ê~±ªñ©Í%6§“}¨->Ê׺yý³M·Ø©Ù‡ÜHÛDêάÿDj\;)ô× E^À¸ùëïâ¢'tÿ*‚Ÿ¼?ÿ5#^|;„ŒR⇡}£I¨`ôxÏ áû@-·$©¶¯ëña†VÚÓgªÒ™D Y ‰º­ê&&ÿA£œá_ITx%ðßáa†©®ÃÚ³“r‘í÷¸¤Â¥Â z¹]ŠZ FÀèÑÕ‘:Ëó€A€¥°pºvì(YwEO/J‡HvW8³Ën9Õ WÖ‹¥^øw’=ô\¸GûÆ(’|àìù-HöñÌ&–ÄëCó UÃŽN¡]“Ø›²øèôÌ;7ú a5@@hÏ(D{0qj‚­0 ç+©ê*?m"ø¡ð BŸj.6ÃRp¦éÌ…µ~^œÆø ‘+£Ö”‹‚ÊñFðì¢OŽÿ﬋f¶8VrÊQ£þ–?zÜahÅÕë²ЈÐT|µ®HSdÂ)” ‘¾®GT ½,h =ƒ}¶KQÐJAÞšC²ÒD©‘ä®´\5 œ3Ê á¼;œWá7Ær b‹dS[Δÿ÷#ýCÂ)pó2hU”«ÛÕ1«Û"»,¾àí¬Í>ºçáÕO›0d€eçw³Ë‹YO%j½3¸?…&"k E3GÌ4ì€(ý àjäT endstream endobj 1085 0 obj << /Length 771 /Filter /FlateDecode >> stream xÚÕWKoœ0¾çW õU ` jÕC¥¦jÏ{k*䀬““Ç¿¯Íؼ’Õ¦i»mN¶güyÆÌ7Ÿ…oU–o}>ñõøq{rv¥Væe J¬íÎ ¢ÔÛÈJâ‡ÂØÚ–Ö7{[ÓÎqQÙ»ž‚¶ V”u„ íÂ00â Ø¾ƒÅ%f¥6·%Ù5Ì.üØõ`íŠ,H'ÌÉ‚8AlW„ƒásíjwÀ\£#»¢*ê­‚æ|ß~µÜ ò²(’càe±¾ˆ:…âÆqÃÙ]Q“²oˆç¸?•—$ÚÞ_ N†Ehó¶¤`fç2ê`‚{ª]ê“ ¨®ë¯áˆPºXE †;È×GèýL-†KøËô1+ê–«³Pì¡:OíëiƳó ÍŠ^…–‹/28ë eEÓ«dcy‡÷´kÎÌÉÕÉ^ýá©ò\îÌ+z«jµÀùí›öÑÞ”­,÷½P|p&ßǾ:XMO÷g¾:€ ›RÞ)ôª-ÜD¶E„–ŸP·…,Ŭ-äjj ¹ÀºXc[ÈÅLUù^L¥„™î9nËÉŠeO àX¶Íó/Í2¸:>!â„ØÑF~|>ôLqÆŠ1ä@sN„Q6ãD8ç„ra°œP¶ ßG*˜vŒH;"4„P¦µìÌÑqlK=KüÌþ²À$¾å´¢lP?i"ìJÜH9.€\7­’c­:J¸f¼žÒ6<>éËVDwN ÓØ4 Ãõöké Rù”¦­Lì–‘W¡{‡h^õ˜—O³<9Šê™Ž yC¨—©Ý ú;:÷R$‘ט__æh©Q:üʯ"ýbõ×@Z&¨Ò £s¯ÿ¡ëÈž°‚üç.oh·|ﺑ–»_”þø—ÿéGx^_NMï¾j†Ðt¸0 ScÈ…aìn¹±jˆî–pì¤_t5Yke8=«Ž¨Ç¢¦MÉ [öŒüÛË<õô£ÌKÓ®$ÁbÓ§íÉOyø endstream endobj 1089 0 obj << /Length 1676 /Filter /FlateDecode >> stream xÚÍËŽÛ6ð¾_! »X3"õ¢Ð¢ÀhôVÄ·$0´×V+K®»I¿¾Ã™¡,Ù2²i¶iO 9O΃#ßÛy¾÷æÆ¿²þ¼¾yõ:U^*ÒXÅÞúÁ“I$b)½8J„ "o{ïßÕ¶ìs³\E*ZüX´å«v»7y_šMUçFìZ~Xÿ ,WRŠ4b²ÍNnvÅ#Ú¯ ¡¿¿ÀovMÝßû‘lC)tÌñî²?>ÃÛ‚·×•›2(r¦Bùð *È,õ«×¡yik‘„Ê[)à(5q\ï‹v¹ "½xè«mWÔ}U×Ôy¿5¸›.2Æ›¥ŒYÕGIq"¢õÞtOÆðG·7ÄbÛ7©ºs¢¬Ê™ºkÑæ• E†SËѪDÇŒ¡A›¼µˆ4h»¬B­í~ý@kFK{̶†À§¢Û3·þX2²ÈAFñÞ÷•iÈ“0Sa(Â(…KA•ÐßöØÍ/ë›?o$à}Oz¡ê'‰éDÄiìm7ï>ø^›pŸ"Hµ÷„Gž©¶ìJïíÍo3qú À1² Ó„ÄÂ}_Þ­ „L”Ó¬«£Ø°º)vE••ä_ì‚dêß¼>döú”ö¦4pDK_ÎÛé¢1Ùvï†Ì$¸¿4…Pb9IÆ÷;p‰Œ<æþQ œ±ûçòÀ%%‰ù– ­[F æì̱jj§&àQ¯®nÚs.¼O!Š'ä¿÷m‡*Û“5aóñ‚  ÆêÆ|È2HÏz♀e²œöP•@Ÿè†ûCô`ìŒóc6.°wÕõMEç—P²²ç­c]ÐåZ õœ{)eýtÑf†8_ý”’ÜOO‡úcž¡Ob¸<Ó†²öŒª¨Ž}wâ}   …0‚AëÝ Åv_”,Å:ÈíÍè_kñSù‰ƒÍÕ2µ³6 ãÐ÷oìÕÎÑNoÖ¼àú 'õÁ*êÃ{_3©AuÐîŒáª,AN7Î;Sµ}c¸$ª0rçׄ™©)ÑÁ¦OôõT”6Rt…˜÷!u)lá#ky¥¥[K>G:,WrÁj)ÊKíj wo×ìLeš ˆ>1°A&fŘã@pßµpSÑåÅDîb,Ñ\W pW±m]ù¡’quPœ×°f´yýÆ"8¿·µÝ͢Ýf%º 6mGÏk ¨Ê¶V:Ñ·"’úpò¡.K:8ìÙ¦ºšéj®0€-šwñÊ9oüœÀÞü³Nüe/œ¹«º|õXnÐ_ßþésèË®Ø<Ú{GâÃãðöñV×µøBÓãÏ›¾Ék ŽÿýÏ{ûqÞỨ%Ó%’§¤ìž–Ðô‘5K©»ÞÕ)›¡3Åž¬‰ôuÛ½mH@w÷Ðao´RÀS·güO©‹g8u¯> Û˜c™mh¬R°N«V¼¶ctÕamÙ9]¬Ð±Ò®Ü2Ž k䟴Õn;p{ƼÉÊë¥êŽ¥òÕ *?vÓÉ/Jg˜«3c]ÎëŒEñãýYµDÅBC›šÄÂ7Ÿ–0y¬¡ÿ}Ú´Å_¦2çÂ{§R2vjÒÙ8qlë#–óMk:4ŒK‚e]­ßÜvY2@·WmÇ®i¦×êZ|vt¬Çî‹ô8I˜+ùŸ1t_ýB², ^êüôÓÀž¸18Äd ŒWèÍ8Ðö÷4–ÚCM]"³î$mFñ³[‚,&ˆ”ŒPvÌmám”»íŽô¬ûl©|fa1öç—›Û,qµÝ×͉:74ÖWŠ ðBûÑðק˜«A ȤLE©¯É M„¯%²‚twu(›ª@è@¾„ØЖe5•:okj鋤”žJ‚zô²švÙq1´ThÍEDÆjB:ÿ ä³&D endstream endobj 1094 0 obj << /Length 1607 /Filter /FlateDecode >> stream xÚÍXÝÛ6 Ï_a`/¹¡QmÙò6 XvØÞ¶å­-ÇQ.F+µœÞnýH‘rìœo½bסO‘IŠ¤øñ£”0¸ Âà—EÈ¿¯Ö‹—o’<(D‘Ê4Xïƒ(ŽE–æAª2!c¬wÁÛ¥9õµioVq,—ö¤«ú]Jm‘-ïº?莸°"j_7šH1'­{Ý•½é,«:˜s³£õ–÷Ùªl´§Ý³®«òJA¬þ[[q³RJ-Ýß¼_ÿçYE‘(ûŒ›€üòM!ÇÇKDæ K2¨„¯×‹‹ÈaQ ò… ÒD‰$+‚ê¸xû> vÀ+".òàΉ)Š¼€Uü¹ø¢95—¡DâTÉœŒÚC½ïg¬…Èâä9¬ÊPŠLÆ«'S·3V¥,Àš|«±IM¬Rî]&U&s‘æʧÁ——Tɲ¶ø«–V÷/h‰dž«$Ña« —eÇla,"·ÉЯíË®'~éå"3gù´nþÖŽµR$É”û3j—Û²ÝѪ5;M«ªl™É{jꞖ஡Uw…Kþhµe?¯UZZžmÝÞòÆ«Ý›¦17R-ïÞþÜVBç÷ÐÜþ÷:O©È‹"XI8VÄyú®n«æŒ'Q øÇÚ6/muлs£7èŽ8ü4×c› HnnëO¼¿&ûˆüýúO»qzªÐéN"‘'ñœ¾üð¸|Á"X¸8 º£fÊo•æ"Kä4k p±ì´=7=7…\{D7äpŽÒKÚ‹eeÚ¾¬[K_”%@„ìl?AE$"hôÐ7æ\ƒD¹YêevõQ·ÌVÌžŒôÞeöx?cv%e"buUÏî3ý™ˆ(’ÞüÝpW²E\Ômë0_F$^b1‘íô¨. (9 8ð×^ÐÃ’ Ó+r ËnMq~ÜP³MÔÔØ-Ÿn"µÔ¾é·lv€|4g뛶¬p²<€t7šèÌqÌ•€4HÚ2áhP9féu.ÏR¤®Ñå ˜¶ð”tQ Ùó¶ï´&jgLïç%àÚTÒyIP7ƒeèú0ãÛù€™ºýðl(óå‡ñ(e¡¼¤ .e¡¿7ávT¬-ñ¸Â€‰Ã)¥µç£WѯÃá0ª!–§*g“mu0í&å\î³EB¨¥ŒŠ´vó&Êh¾­÷‚\V°rm6f‘·ºDɪÝüŸÛkË£¦m€˜5_€^Ú9û3UäœöÓÖc¸b>„J¥D˜ ýDÆ"¹@¤G”¡}LWßÖmÙ0Nú¤®YÅ©Hÿ継Ûû°•L·Óݦ„‹U÷Œ#{l:}\Á¹…|oàNÈ›÷uC~<¡3_È®{²h€1ü’tKcu!w'u£a^‘ˆäJEz§Ëê0S=2Rž%Ÿ+ŸD¤rT>®y ÆêkS¶ìk»¿ŸêP¬‘Œ¦!¤ðÌXÊ¡²ù6£¼QZºNLSUŽâðƒxÙue{ëÆ+|íMGøî£FkTƒFœé.¼15tÕÂ]†0‰=ž”˜»`'Ð Pí/‡sÕ™Z;|Û“’DçJbïE"É‹Äá¦@ Ìã€äjœ¤áïàÆ«Æ)Kú´úãY·{ÃwP™$ˆP¶Þ6÷sÕi?m xXÜBDw'xÁ¸w fïpQXˆ4+>Ly6¼­Z¶4\“à£2§Ú¥ M]f~”}_b󲌹’Pn¦2ñŸ•O»o†¢¸t¦œ}eú?­¼¿xgëüó RÓÐ? êwµßƒæ¤«~ŠõàuÝÑr¨5x òðS¢¸~ þ¡ûsç€=u)W<ùè9ÀáP>*C?1Ê÷Dv‘½°Ç‘UÃÈSØht¶”[ %mx©bË]ïôHÄù$¢2ÇJ¼G»\[¾ZPZê GZ<`†ŽWØlrB ã Øêª<».vÙ4ÄqàHed§ÈC–Ž Ä(PN/¥[*ý¿ Õù¬déð2¸ê±éðõ9ó¹þo®OÁû~³Õ€¸ú+Íà/Tà<Æp°zÜ™/ŒAúï1øš×ÿ‚QMMÚ1EZ¼@[æ\RQOv¼^/þéžÒÚ endstream endobj 1098 0 obj << /Length 2612 /Filter /FlateDecode >> stream xÚ­Y[oë¸~ϯ0Ч8æá]ZØ¢»íî[Û¼í.ÆfbáÈ’W’OšþúÎpHݬœdѼXIÍ çú Í7O¾ùû Ï¿ÞÝ|þA盂VÚÍÝãFèœeBn¬É˜TfswØü¼½;–ÝíNi±}¼Ôû¾ljz+ëη}X’Ûþèo½ûéó…œÒã’e\·@é©u=m›±•3F¤]}ë}âÐ74BòÄgXÜ7uïʺ¬ŸÖ Ëìȸn~¯fJ¦=ÝeLÌ\è‰+(¾Þìdž3!Õf'+LÔ¿fûüñûKï·;Y˜íƒlZc»ý…^Ö4¿w]œmW—LfEªì*ÜtóýÝÍo7¨!¾i%SÊn¬6LÃÞýéæç_ùæ‹?m8SE¾y[OÉŠ‰U›ßü“ >c'­˜@JæQû£?\*ÍXñŒeöC+ÁYf挓•LjDS̬š1|rÁtÌ1>€+è˜s1ã½ãÚ%•`*|GÛ4-9 ë[š½Ê^eÖ½j‡.c…™;îªs Ã7ÙÆ*ÅŒÔÿÏÁ…QŒkH¡“½á]¢UçùÈÁj Îëî%|V˜à*%îÐs®¯ø—ÔË”ú¶’¬”s¶ä'+)Ï2aæþuí.–q)ÞÊœr Ä OfJza&·mÓô8ôy˜[õÌ̲LË7 DÎrc‡L}l.ÕÈ?D⮦wJÆ»˜®³ŒYͽ¾÷uG5LåQ:¥ŠíóÑ·ž&©ØÀàÐœ\YÓ:H?_$NjÅ6ÔÉéž_8W¡–Àâ¹m—}O ‰š«ªHþâç\}òó¹à(+0R¯«RYfÄ»Ì&¦fã"šMšd6àÍs'÷BS®ê=Ä%G¯IMé»@U&ªzë+òußÑGxtœíÓrüZæ¹ì 2SËâ“m“A[ï1L ecTÁ©PøD]uaø˜þ¡½2–«âÑaÇ"{Ép\x)ÿ>¶ÍåéHÓŽæ:ÿÛÅ×{ÿ ^…ù(¬Ÿ¡jœÛÒõñkŒ” “W\Gáüø ¥U˜ŠÚùõrÉe¬©¯ée·Íˆå]‹QóKlu0µ1×DœŠIî8¬ÎvåËÝ;!…¸Ææs ü¸ê –|GKÈA\Iþ€åCóxêŽ^ ù-ƒßá=’é-5‘|›ºçØÃòÁ¯5'¿F5=—åKóAÐÍ!c¶ÀðäFoËGzFm«mwvû€ …Ïd‚ÆßB)~¦Cý6³Zm°4ÇíTJÔ¶Aù¾†^·­Ü™V£óúMç§,ÕÈr–jÐf(·|”àVNŒ_OҌԕ–fY ŒyeØt ðU©Îid¢‡Wȶ¶¶k"ƒ45¹5¤²í†xp±þŽ:Fç@âO§ÒcÁÏ«’Æ“M§Eõðy½Ð¬Ðz.п|i‘Bnƒ¹¡4ÂæBaÍczʼnνªReEd­0“ÅÛ3œ}ð4çèÁ.®> stream xÚÍYËŽã6Ý×W˜k³ù¦ˆ2Àd0Ù R»t`¨l¹Ki[òXr 5_?璴ʲew:¥N²EQ÷ðqç^òìCƳÝñôüÇÃÝ»ï½Ì<óVÚìa g˜"³Æ1©Lö°Ê~šUífq¨«¦^ËeÙ¶‹ª^7‹e³Ýºr±Þ4Ïï¹á÷??üiÁr­²¹Ì›ôûbAºâcy?7ÒŒ‹‹Ÿþ{ N|MòÞ}¯ó“ÙÍmÎœ–>™Ä?³Ò0ct¶ÜÞýô3ÏVøøCÆ™òyö†n3É|îÑÚd?Þýgd%÷L(D©ã„åŽÀ*ÃòÜM«r–;;„»9‚ë8Ë×)œ¸â†½<>©˜áòxÍã/岋G·*Ûå¾z,ÛøÚ´­ê±•–ÚûrStØÐö+¼[†“òÍ…‚óCõk›Ã~ yJä½j÷RÒ§zE 7+â{»|*W‡M ¥Ììù©Ú$!avÔhݸÆI…Mt75Nåœi‰£˜²÷o9•+¦… ¢ôM}Ó‚3aÍ "Tç”ÁØ©kÆóüüÔiÿVå<ž›ââôÙ¹5Bx÷œû²=lºªþ@¯"ve½*ëeÿ¹?Tz ‡zò¿œµ‡Ç¶ìÒçf}&=êÛ… 9[7ûØ=X>…Yó4]§[7¤œ¼W7j?ß >+Úø²nõŠ…_…f^Ÿ-÷»zD‘0ÐyS‘„ó,ÏŒsÌ©7Y²È%sA¢Œº­Hä䌚V É a{Õqi â&ÁÕŽio‡¸7—¶¯Ç@nGÍ–û²èÊUpBn¶mVÕ{Îeß±lvU¹ŠCƒJ«gë}yì;´A‹©7ú;ô­›M2 „&ÏMbÓÜ#H>ÇÿH¥õ2(iP«>¬Ÿ—q0Ææ“àù·ª^n«™¿†½#3fOßt|É?T¿þ†H>f#ãDb½o¶ ²¼ßÉ"¶Å.a&!‘;dóëb~Çnr!¸”ÅöÐv‹hýÓ¡¯®ŸÅíýNit[ìß–â寶+§3úståH.Æ·Ä~ñ-9âíæu:î~Ð)}Q5±ŸáL†súã7äå7lÆDzÜ}vbukõa³™ró&VôÏO‰ÙÃðc#Z›^ÊDG_F˜÷HkôíäÑêúHé×obÕà LJi±Mþ6ó Ö^Oë!"—CØkLIϸ•Sà*%Nrˆ{ä`g¨†R»I@EÒ뇠¤—˜NbD> ¨C¦¯Ü”ôñÔK&ðÓ Þ0!δ)å'—¶£@­uŸ¯šhuÓ¥×à9¤§ªE>4ý.Œç³žOÒKÊ”ùŒˆHl˜O¦Çý¸é *Ü|Êö¼`a` êm6 ™@®%‘såþvú£$G秀UÈ-<2©ìUÓ3†y‘O‚kræ¹â^1½Pª°“ †R…¢ŽÛ¯ãj PÍ%³è€¼,H ušDŸ4ì÷ ó–éé¾\T$ã(Rmr<—gµ‘PÅ`÷sëlŠoN £¤2Ælß(M… )glE[F#+žË‚"=µš:¡@Ý$ M÷D‘6 Y§ŸŸÊ6 îóO¤¼ØeèOìE’Ñ–cT!¸-,Òäý¾lwM½ i­>FdúFK ŽTG)w©—f¾vés¹Ýu/±oU®CÍå°¡ÝÉáZ~¬¶Õ¦Øo^î­™ÑEêÍZO~Bëä',lò“«»8j ñsòWFÙó² Ù²†µtå~[ÕAÿñþHtÚ¥ò)ulŠæÑ:z|ž•†íǼ tævµ\€)l†¥ªØÛB\»e Q¢nÆyÊVÜ$¨q€ õõj˜w°Tå'Á¥ê0q€;n1š 䓬VsdDТêh˜×0‹Dm PŒ·‚žh÷™ÑhÃŒí£n3¦štó¾¢.²Ü‘2¼!OŒÝEC2ù¦B¨¹Id ¯EEz ¼îx™‘ç`Áç–8Ecb0I5"Pú˜§±¯_ûk\´û‹:ŠrÒÌþ]Çþ]±ïªåÔï^s"~*—7å›Sùó1˜n !çävPæjVìËØŸüŒ';ŠÌß«ž¾9ÙvŒq½/*Aªé¢ç×{af%˜k]Õˆ¾-¾… $t<#¢Füx„®ãùP›V%k¦Q¯çCÝñJŠÆÕG„þ=Ç¢Åpí'÷®tóO LW›qýh,±%ժ܇)â=Ó…>Ü׆?ëbóÒVgXðá ðEséC©!LAX3cù?Vh³W endstream endobj 1107 0 obj << /Length 1760 /Filter /FlateDecode >> stream xÚÍYKoã6¾çWèÅ)b.ߔТ@ t‹.z)šÛva(kK©%'»ÿ¾3$m‹ ídµÛ“©!9EÍ7/Óì6£Ù/4üþt}ñæ­Ì³‚šëìz•1™Ãx¦•!\¨ìºÊÞÏ®ïìåœtÖîúû]Æ«Ë×ïÞ¼-ø`»RD ºÝ¾º[ãš‹Ÿ¯/þº` ¥Ë8§°F8 ËÍÅû4«`ò]F‰(òìÑ-Ýdœy£uöÇÅïþ°ç‚H>:쮩Û&«(a†O«ašÅ°åri».›+Â$›7Ï ãEŒ[7«ö)ª Ѳ˜U0N´01ê²Ý€!Ø°,H5°â$¯Öí£·»Èl9,erow˲ñ6zìÖ^25ûTnêÆV^R6a°ÚZÆlÎ%#y.²9c¤P{sêêæöræ3ë‘8Xµëu{ÉÕìñ0·Ú5Ë ¯#îNèˆh£WC @€X›åzW„ÍßwÞàË’»Üéh|¬Å,n뇰Ÿœå/6å½}{”¡¢Å­í›]×/*{o›Ê6Kû'UÔißè)ÄGkïÇî#x ‚ö¿ÂÓz¾ü¨åçÿì¤úõ—Ú´‹®Ýmÿÿwú5ÚìÖë3zF'EJ¾àp}ùѾôp#w1×å$ è¢f¶µë¹¼êw[ç7¸Èg7ŸQ¯È‰ùù¨§¬)2™sBaók€ÖDqªàj q>ê‚pc&-4èvïŽGA€br5ª€lÁ£‚)'@…!T‹I@%%TñYž@ÕŒ(Ã&AÕ’¨Ñý`Š•$>H0;gµ¶óF[µ›²nBXƒ Dª<¦]ÛmzX.”Á\~sÿŽNâ]DçÅ}ë…A«äAñ!5?’˹Üó '¼ÂG^á\’W£˜—$Sø­ÀÂ$Gù«>ƒ¼ŽJøpùyb1SSèI`ÁtL.cØ4±8•DP9*§U$BM ³l•³I@9¸.cBLJ`JHèT1 ¦T.#@Ÿã+žò ³Å=\Ry`@(‡Ü¯§“lƒ^Ð öœr¬dàŹÑq‚Dã@™= bƒ3ƒRŸ‹‚‰æE.¥EQH$ÃŽ°RÌî·sÖ‡ºÝ…©a ƒýAZúÇnwÓÙ8 ·~Ë<•õ ¦L[+()ôù€É` ¸A)$Ü{•°œh0"TE¡<0¥¯`§€…RZŽPOÐZÃ.9 ¦Gr©! Nk(T2†M³\M°ñ5j¡\ã+BMÒ\©ƦULC&c·+EMS@… 3Mq\Û¦BO‚ n›ã8`žä8½àU §eª6÷é0Õ®£ÐåÊ “&pEƒ äŽÏ(|FòETÈ”7utDüÆ1¿q‰ç7Î~'¢øõ]‰‰ð WÞÿÔÎEÑÙ²mzHJ:?ÝßµõÃàª`z aÁ^SÕúߦ Ô´­oð|ØCôË[R6xâÏ^è¼¢ÓV r!ÿ»ÐPÀcõÄC©ð[{É ÒÏ×®·ý€víûצ·ÛU™DCŽ`6ì•üè7„f¶Ý"%Q#WÁsµÓˆ¨Õ‹:ÿ{¿mÝêjÀ­¯Þ.¢_Üm½ÿ|o+» ýæ÷ì:ºn¤÷d‹µ}°ëÅOŒI†óm]í[Œõ¶ë¯üÃ@ÜYðpÕ¡÷xú,ùéfn8€ûwçØ$H%\êò‹Û¤Çö0ºí«Èo˾ ¬Yì:»½zr²áÕøÉUs•rÇËÝ”ŸŽç/mn¿à>ªêåíøRž*ÉÕé¿]N^©ƒ¿úœ¤²áE»îª_ôEÜPþrþQK=y-gÌzžâiêcŽZÿÆ?¡{ÿ¯xäsp®àáçRº6©ÓδŽ¶@¸ø3×Åã endstream endobj 1112 0 obj << /Length 3697 /Filter /FlateDecode >> stream xÚ­[Ëoó6¿…N·Qù~ §.°]´‡›[[Š-'ÂgK®$7›ýëwfH=MÛ-âSdŠš!‡óøÍ ÃV¯+¶úçváïߟ¾|÷£+Ÿy#Ìêi·âVg†ó•Ñ6R¯ž¶«_Öe»n»¼{xÔBӯݾ~ÞÕM‘oÞ~eš=?ãè×¢8Îç„_ßl‹cûíÃoO?¯Ïœ’«GÎ3¯“ä‘Ü7» þð‘r—-Fʇü8þ6ŽWñûéí/-2ÉÔœ×u¹¿}>µE LÞà(òdoÐégf§v6ñZþ‘ÜÄ Ð×¢{®êç¶>5›7.23%xCÞçr¹±ÌqSã7Eqé âßý¨ÜD¥…Éœ÷ðXqX=½!©õzwª6]YWáÙ.jYë@Q{-Á9_þñôå÷/FÙŠ¯„`0ǯ´‘™ufµ9|ùå7¶ÚÂËŸW,“Þ­Þiêa%2ï<<íWÿùòï„æ $Œ#RÚÙÀ4ßlŠ¶Mðŵ)w¾ÚeVš9ß²ÚÕ ®ŽeB›»pu2J͹nêÃñÔçŒ%ˆY–ܱ1«%cÒ¤sÍ*S†÷ p,ð8‡6èMÈÀu§|A ‹j[T›"(¹à*ãÒÎm'¯òýG[¶|ÃLÐD!ýº’ >ºA)Ûð3oâ0õmêê0²I]sÚtq¸'VV ÉH¬nú—eÞJOãá½4ݼê–ÖÏææYGá)·è%ô+ã2!FRÌ(¬P³u}ê`‰1â™ò  Ôˆ~'ÒÈ5.‡6õ~_l:” Wa8O1ç6SL_·b'hŽ6ƒ?¥Öæ+¢d¿nÄ–&­º[´ÄœmoÃK¥fÀl82ðÒÒ³õû[¹y ÒÜäQœ/E}ˆ²p|M}zSó¨åÌfšÛùùmò=…¨VçÇ"<8뾕[˜ãáT¸†ÏôgäÃိSDÊs÷‚ÑZ£îÁWÀ [-ç|/øVé3aÅ]¸*‘ ð[óÝî÷õ&¥&ãzðqà“,SÑøàìòæ»õëéPTŸãä%èXÉ›àÈÄ[…oŠ8³§Ò–Õ×0”oƒÎp©2£6OçšeÁíóKQYeDL¤ÿ”’[PW¢ÝÕ_8[)â Üø]O|qR–eb*cüSe!œYP&3Ç£Ù"œKÇ"í†s ìÿºu a§+wq4xOÛ‹&DuŸ|4Ls©bëˆ8¹Anf~:(>nÉ°_ò RåfIð…|hÅSV¯aZ`Äûƒ}@¼ûÀõ:ŽÖͶhÂÌz) Ïyµ /ãnpˆvS Ê”RÒŒiÄ2“`#¥^W§Ã q‘Œ ¤…ã½îÅŸÝf8é½$—c/ýgÛm±›Ñ&Æq|9œ Þ½åm*²vÇ"»À%ø1tUÓ ¥ÏO&‰À®l0õXfm a‹ójÅ­ÍœûÞELÂõ(pMñ¼#퀌½—Ý[xêÞѬê0¥×bا·‹èОŽÇ}I4¼-² ì{]&õÁ E±<çaNz8TÇW[àKÒš]Ee_½Õ§}kŠîÔTa<~ëa8°$þ©Š¶ KÒj½/F%Þ㎼à]Ä8*¡í8µ?A]œ}1  F%G¤(Äú§* ó¦+7§}M–÷E5HÍðˆËôpºUB0t*öRÌ–Cv¶ð&cÏ$lJË`Sðw_×Ç6ôz‡}*‹~¾Ï:’Ö®ËÁ ×s¾€!a!ÙZÖ™ŒfÓv%Á‡ÂŠ>•Éh™1X$’‚8{]a8d£L˜»ð…@ PÌø^Èd˜Ï´T÷à*¸€ð%»ÝnS…8ZÜ…©ä™1½¬3 xâ©ÎŒv4¬‚¦Ñ=ã~DzÛr97ªçœþàˆ¤ù óP¿yÊ÷¢‹=Ú¥ˆŒùA÷G…B5wM.ü+!.{!˜šœXøG vzðbÎQŽUëÕ‚+"òlhàpÚwå㈧òý‰Ð#¾ŒØg y#½°<ׄlšC Fy`ç6 œl¦ô­cXÑN{îÔ,˜ Ćx²íŠfX £Ê•°=p…m}ÈûA†¶G¦ÖÏ6çÔ”Z<¸l1¤ÈXˆIœ€„€_±/bŠ?]V9 ò×ÏLJ<'á …4`õ |8ZÍÂ1™P¾–†eþ~Æ1,_["%•¿žCƒïs±‹ˆÉX篠^$°¨Xqå"TGqÞhÓhȔĘ ‰^Ÿ…·}.º™W¯ñ‘Ž¶7æÉסÝž–-ÂÊ ã’]«€ Ô/û, (y¿½•í·üø¬È~‰ðªÍñi[‚®´±| ö×gòa£0F¾‹™ M}ŒWW ÔÜo“Êäú‚ÚA4tL^GkX\úiä§TM0“9P1$¥¤»Ö ÃpÂß…/öÊ ©˜ñ½{ ˜5Zø“Iaæ\±—6,˜>$g“î‚ž¨—k ©½¨ê.Œ’CŽ…“Ðß@íÃLë¸/7e×çZ¡œ 5ÈU-óÐM– ”éãß6üÈâØa I¿_>Rb:77rÇ3!A0î“=E8I)Ènô Lƽº_ AÒê9ß´ZIÅ2 ñú\8Ïç\/7þ£üŒø?ç{©ï7«g1ÏÔ ùDJx„-@|¥ëú—“¦ ýîûazø;ëiáOŠ?þBOK`Ñžù« *=(1ê‹È¬°ŸxgVw·%7í&(I°‰{G4H/}‡íH/Ô 1d‰–1„žc›“÷½,«êð7‚Bí ô±Zò‰Í_âë]}ªâP %ªƒ=[¥ qÑÔ¯ÒCÝ"LjŠxbŒº‰ž™ôsôª„¬¯ÝªY[(ƒâ`Í°ggòVA˜s2UP±,v¾ 5ª©X6m ú!sÆñ:é_Í´uÁ¿ÂPRaa1æ“þÕƒï°Dʘ…å/½+h#3÷àŠÕîõœëk(Ò.˜J@mNÝ…) ;eåœi•tè Ð:¿ Oe±Ä¦ô ‰C^Åý»Ð©‘¼gËÕÐOÓ¡¹§ÃÕ0zn½X¸žV]—NKyºKs³ÄÀå ³÷ráоã#Q¸šä»øjS7fp2mÜE=î&ìÚrºý0Û5î?€´f×Ô|‚¬Ü`Ù•ù¾üy0x™7 Æ&|ý Aˆ~‘02è‡`Ó5ŠX‡A ‡cG +×0þÔ/ %ÂÇô„ç¨8†NˆÍˆ&QéE÷žð¸€å½U×ÖèÑ%ˆ.Šö:  EªÉ)qÕáBj£!”݃)º4€'s®áŠhÊ»âr†TðÞCÇ&9 ˆ:t~ ¦Åj …·wa2èDÑ`*ýHpTkR4/§íá)ŸÄ¡Uɱ½KõI ÈÈÁîB÷ˆŽ[†Äw²eKq°oÖÕcÐÓDȃ‡™3gC ؽX6Áíôw€4â¸dõghÐÃCïN`}µÎYßØ™É~MÛe*ØVœC²„çèÒp.ð ófWV¾ºv\ƹý™sû“ÂÎ7-ÌÌÐ-à²ã1´>Ääª<¾6|FNJ ÷0f3pqÌò0ó¥®÷EéSé3á%&•aÓ†Ê0(}È{‘A~§j³^ÓåÇŽŽÒ ¥ÁºI¶%3mn¡T°ÃqÎ(OlXKA5]agU8±lý‹xEß  ]Ä !´ÇjĬãEK=4 Jt¾OÝô‘ãÃê&×%Ò}!­ôqÔ®‡J4þtëâ÷p”Ç 6Ü÷^º·’b9w3×_vãìTë[gV_wÞØç‚ísãéè>Õ13™ÔžH±þòXÚyCn—9ëîÂU1P»àzÑyC¢c)'=»rˆŽðÑáRÇ<õö1Ùv×KÿžczrÙHüXj¥’¿6H7RÊײŠ† ãz„ë+ç!AÑVþ%†ãõ7¹ã²XE¿]¬´E/].ÜÕû}ð|}•ì%VÇÀºb|$Vl°z;Iun¾Þ6ÖR,}Psüî W| ¬Êö-Þÿ1ý%#¯Óõ¯2{½"4Þ%åzB‚ô¹ª(Þ$%:â/ÔÐÕ³Þ™Á6ÐÓxÉ àb™lXjù^o8Àg÷'=£–qbƒKÃÉ)~š£âŠÚÅSŽ«Ì“€Bý M&ñ ÐL2ÈÿÈ,oÛzS†‹Ì¨Û‡âP7£ãæúIZáÝG‰Ê‰màXíâÆÎ&$þ½ˆ| endstream endobj 1116 0 obj << /Length 2229 /Filter /FlateDecode >> stream xÚµ]ä¶í}…¾Ìvt’ü%£A€íW >%ÁÁãÑì:ë±çdû6{¿¾ü=öŒwséMŸ$‘II$ER÷ ~º‘~üqsóöI‚Ld‰N‚Í>Pa(ÒÄIœ ÆÁfü¼z_wÖåEW6õíZÇrõTv<ë,O>4· ëÊÞªxõ¶bmßç…½ýuó·ï"3‘'ƒµ2’ ¿õ®¬ïoסÒÌ';{´õ΂hµ*<,¯óê¹-Û;Xj³zòཱིŸz[wÕ3¯kkwž[Ãã4iÜáIľ©ªæVÇp°A|”ù5&•Èbx âvgfõS‰›>ã‰Q¿0JW9ÉÊÙ*çûÂÕÖvOÖúE[Ö<+ñZ‘ªåu^ï˜É±éàe^ùMïèä {ö®9øÝKÊsוE_åˆByb¥³Õ®9äeWe«§‡¼c’²e4ߪ¼í4ÕëŒÙ¨£ŠÆ9Û›zÇ7Šüš%m^ )EÒß‹'¼àšC™®Þw /òÚ“6Û•Û2|k\€tü{” *Ãññ‘.ßýÖ·Œ €­õfÏãä„çC.¨>} § ˜¹ƒY5ŽaùˆäO À¶ç™a+NêÕ†Ý ,À5]Ó=Ë‚ôÀíxªßóñò$eˈ}ÿå˳—æ\þ¼¤ê.ïò_¤ ÙÈÑÂÕ܇0ë,cžü8¸òîã÷|!4ÊÞoÝæí@Hï# \žÛ1 ž§í˜\2§J&Þ±Èàd8x̦VK2€PFp£ß9Fmý^¾&Â}GjVÓw¼hjOÛ8æv g#ÈžÇQ•s;бY £Ñd'ÕY:7“ ƒ±BÔ¹²`øâûýÀ/Xr|CzvÀÀºf׳ˆÄó»e2púÄ:/ãÊ‚Æ­­lá]‹ÃØ×5‰loµ\õž LH³º»™sÀÜLß Q˜p6ºÚ²gÍ]¾%ŸOV›[.9ú÷‚úù¶òù7ŒcpÇÅàdruÈëòØsA,ª¦³«È3‘À­ÌäÒó\J5J¨0½ŠT ¥“¹T4þ ¡¡”"Rñ5„—&"Í…Ž¶ui8Q,Œ‡÷oá[­vl4ôg˜¦U•aœ p ‰—6F‹¬êÜÖ/O®b)d × ×žªì[N®âPÈ(!V1°zÕ¸”‰…ÔÉUä#$>ÞTî Æ%3‡Ñ5¤j¥E 7“Z4‡#$ ‚£L¤axÁ±©ÖsÁøw-—$0ƒqQ=„©…£ç¾l}Nƒ cЦ¶yá ‡1l®£’áOeU1lk‡R‚l”>i¡cu–]Ô(òÙŠPk,˜m8K ^LŒ4'f˜o9+Óp|Šieµ— gµlã?Fð¬ÍPÈb‚æ†Pó)³ºï>GñÈžŽ3;ó:ü¼Ü4¿n-þ!XÅ\–Œy}aïœ@†u0§SÀ8>ØL=Ø’ÂcEÌêÛÒC®úÑ=”nçsöù¡2_ºæ‘Ú,¾&8+Uˆ´ñ”ƒ€i]ÂÞå.”chK5¿‘>W'R¬Näû44™¨ËcÞRUˆ´\ú_dÝ)¸ÏdY*4†hÌR “ú¦NRG Y¥ÀêÕhµ¸Ð*¾ŠÜ0ÿשÜåh‚;¦¢¯ ˜Té¹ÔåT"½Îõ¦†(f_K#85öï=›Á–Æ°NQJ›TÈ$:Ï`OûÚ÷•,û)[=bœízW3,@“*ÇÛìØ1ŒƒoŠUö‘¢4Òã ~Ÿ{/˜‘ñ©­³ 8nøÚpðÍØøPOÍŸI|Äê±CD½é6¯$°_ã{Q\ûÿÖÃÁÉ#cüÉO' …Ke6¥o†¹ÓCd¤h‰Àmƒ`œñáa2vŽ;š3,÷vL:õ ø_lBcæÝN“Îù-µ;_jœ¦SÎ ¸;ë[«Ø§nC‚-ÜæFˆk=8QKí_îÓx,o€þ1¿Øùd±rö4!·KjÆ455²a–3êôVØ ¯Øxj¯Å¤-fg§öÍ]ú©/uœâÔŸ„Û@>ëë<óÂÏÐEï°o¨“±ï‘NS14Z_àÜ;â‚c§cvôÏÿ|ø°”J‘i5 Èó‡E~ô²×”P§ÂÀh¨# %þ¶È.!†EÄJ«YÈ‹çÙQ)”Òlã\l|kºÈàl6qçC` ŸešÎ-hï,û³ôŸ9Lʺb!.ûvlB}MƒªýªÕÐÖ¸F*}¹érÙ’:ƒ~¤Ø÷§»-“v7Žˆå+ݨ·CœâÍÿCKéOÇÑä+Zm_s¼ÿ‹†uSÛ?­ßR+pÔnbr3Ç1R$àš¤¨CBÌUbf[ÀÏÿ ™+¯€ endstream endobj 995 0 obj << /Type /ObjStm /N 100 /First 968 /Length 1411 /Filter /FlateDecode >> stream xÚÝšßo7 ÇßýWèqÛƒNEQ‚ý±t6 hò°-ÈCšC°À.èþû})»˜c_ûì¹u$æÉI}D騻Ԛ\pµ’K ê(ÛguQ*>³ãÀŽBÀ÷œM`'l-Ù‰G\ŽÉ¾€ aA\YôQWÑJƒI¬Á,*Z›9"G‘ÑŸ`+jµ/!q4}t¤$Å$èŠäň šØBm6 ¡­k„ñ¢CD{5Ý@¸ªÙlà2RëŠx#aˆÄÁŘ,úHª…®q1ÔXÁbÃosÀhÉ-4ü‰Y͘Ù(Ü$8¨±Å|UÍ.‹c²@ãXs6=æd£ )8–¤&Eǹáâ ©ñBˆ\¨I˜Úì%Ø«bœSq)¨I\"%ø€©Zˆ™KæMæ¸ù›íjx$»”©I°¢Í‡$±2ì•bÞ2¬ÔÒìU'ÍG'$6ò¬Nbóä‘XmD€#‹±¾H2´dË W ™ ²ùÕìræ*c€HÍr±D+f2—Ö£ºœÚ|”ä²´TA9‹Y)liña¹D“€3WjöR6•ËüPÅ)U³8“ùÀÊ->dŒ¶tÄXT,Å‘¬ZxX)*Ö³ïT™”œ®#²´ÓR,Í1¾Ò’Ò²¢µ’¹ [;ÑàÇf['Hô’Øz`vJ2Ö­d›"‚©¢Â£³³Q÷Ê]UÜ[×ýöû¶Œ¼‚¾ñ0:y¼¿¿={fº®{9½ŸÎ.>ÜÜŽ/º¼¹™Ïdz‰[ZøñãüõÅüf>vÔFÝùt2wgg®;‡¤ëBïù1wvãÝ›ÙôöbÎnÇmëiM¿Žßßݼ˜~tW –«Zã5ÜÜÌÐ×YRšÞÒ|C Ç@°2jð ,Uútñ/œXú‘í:›¸Ópܲ nÙˆ=Àg>ÆŠ]ËݲƒaRèY¶‚‰Îq“fÝ…fݤI<öáãà<AÙ$H<œ ¥>U^ä=î|§°öÔ=–]–ž1’GAq:#oŒ4œ`Œ;|ª¼¼eõTšƒŸ»¬±]Ù ‡ãÔœ²μ μÎÿÐÆýHE¿|+„Ó¢ò9ÐT0õLE>Ž^n®A9@½É=§-¡ðòæþ|2™ÂÚÕâ´kñ¬¹m £îâñݼ]ÿr7ùkÔ½˜ÎÞgÍ8]w?u?w/¯ @¸¶xn1’”“ÏH?)â#ŽÔ©d/8âÀå•2ôž7J®{=½œ:LÌwïÐùn:ñäÅó÷çɼɗ<)uç¹ô÷›¶Ô“Ë\w›¶U&éø¹|ˆìM=õRâ=0¤> stream xÚÍYßä¶ ~ß¿Â@â)2:ý°d- 4@¯H€ ²o¹`áµµ3n=öIJo“üõ%EyÆözs·¸)Ї;ËMRÔÇOÔ,þ~ÇÃó›û»wïså,7ÒD÷O‘H53BDF§L*ÝWÑñÃC횇CýÑîöZêßz놾.‡ºkIøÇ•ôÁžÎï¸æ»Ÿî¿‹Á²DE{!X®v‡â?3»§âì¹nìK‹0"þä­ì_7ÓŽMó–ðžzkßÝK³^2 Ðd,Md´—`Idd ¾ÄÉ»¿Ýßý|' ó<‘0šq."çÌh•§»âQ“ßEœ©<‹ž½ê)’,Ïr5ÑwßomšIYž{K‰–äsé ßR&¤¼…o)s&„X:o»Ö¢×wï“l¡Ë2‘€1¯T´é¬ÖÂdšO:›™“YÂ’\Ý$ú,eI&ß:•`ÜĹJ2føʹ¯š­ÜeŒ'ú’»@)r»³-뢡—²pÖÑ°{ÚÈm 5-Åïæ6I9ÚÜbyIª˜€??·Z ØüôεJ˜4fé¼nÏã°•[¨Ð ya™Û' cô’ ¶ËZsÆ5¬eróEe­ì¹ñ¦’<ýœº†ðDšÝ¹ ^Y:­®K„¼âj·—šÇÖ9ÛÎæ× øy¬wÀ™ñ¿¢I’_ _Në-0z“½`Ö©ûFVÇ g‡‡±…S«wW¦—œåÀ|ë|p盾hvúNž‡ØðS(\žHÓ¿¯½ÝL1“™ »[Aì_ÕöQTÝ©¨Û7†q9ƒV›³OR–AÕ/òö|´½-ÜÒ•†“áü˹×ÑýE(ãÀšJ°Ÿq€Ô7ñm€"T¾ôý;ôk’ÿ9Ä…†NßñeŸõˆosk|ƒe C1H–"7Ãé)k‚i¦à(äœÇ?”G[MÝ.Ÿ_sÎ!HØ[h9üw÷G8XUj⧱õù.šáE•ue_?ÚŠ^ë–žÃá€#gCg觃ð©¨û&Xhí3 °÷ñƒS¦ƒ_7>þÌÓ6>ÆY"Ë#î"ûDM}­T ñ?ÔmÙŒUèjÿ [ðÎQ†,;þeËáVÿ?}ÚàÅgsxµ‡²kð탃ñ 0l/“on÷¬N·†òU"ÜjÍi¿³ä²ß”¨ SÉ'(lÂmI |d_ÖO'L+¡)¡C”—doСapàß±ɡŒ²¥ãy~_¶Â8ø®•â,Ëòµk’ ·°<¿ãT0že¯'{!ìýÍ eÑv†Fç¹F¡p’(„¢§•ÁløÈ®N½p8CCí>p.±±§© sбm·ŒÌöŽí •vg_QÝoU𵶤Vñ…7¤–!”¶/ˆöPNÜNSO]OÂçc]IVdæ„îØME3A²T…ÏÚ0]ÙÍH϶­l[ú,‰ Œ ÏÖ§Eäñ8ÈáZ䟗 15 Έo[š8ýP—cSô»„Ç_ƒ’<„¼Á|ežòKRˆ6’9¸„‚ÆërÝý'IUo6ûIu±¤…+ÅõìÂ/ùT¡Wƒ|áiÈà¾`)¤r2šÎ Þk7¡, æÙ“ÂTD‹oƒ¶' 3‘ ¦uU›¬„"õÕþw@ À×/uÙúâ tsíÉÏ«ç맮·y²ª8jL6G? 昇W„‚ ÃŽž€±Ÿ N "‹×tù÷kºÔ‹t¡¤ì€Yê}€ÔF°“1¹`zJ ÎüfûŽFÔqJCƒàT·Pd¿E Tše r±¯8½ ÎýŒmÖã’`4PÓ?ºÞ.ŒͪI-æ—ìÊ]uƒ?UPæà’5±"Laóø«sØ÷‘²‘^ÛѼ±©BÉz W˜p¾¼®¥â°[ź8“5q}ÖáZ1€»®hŒ…J“áùò@¥‰åA8cVæ$Ôˆ™­F,•tÕž_{#aດ5ÂB‹p÷7ùB nÿ4Â%t endstream endobj 1127 0 obj << /Length 1451 /Filter /FlateDecode >> stream xÚÍËnÛF𮯠ÐC©ÀÚì›$ZH¦@oE ôM®-6|(|Äv¾¾³;KZ”YÙI”:AËÙÙyÏîÌÐà: Áï+êÿ=_½|-ã !‰æ:8¿ ˜$Òq UD¸PÁy¼ +“ÖÝzÃEöÛ´·«(L󼨯ºk›Û¢*ú;üÌÍÎÔ¹©3Ó!n•úSZöá×\…iYä¸Û5åÐMÝ‘õFP¾B¬þnWdié)¬™ o7ëwç€ ÆH¢¼˜iµ+-a.›­iÝ’ƒÄE‡ÀÝÖÔM¿¿Q*@i²lh†¸ÜðXñ«á²3½?r…°~ëÙì›à΋RNv‰“p›ºEÖ ZÓõm‘Y#àþ'£Ù¥mZ™Þ´kIÃ3€%qxÕ´:PQ$ÀÌcxù:a{æRIcˉó–2X³8ˆÁûɈ“¦î‘¸Ó;žâ ÷òXe7\q¢e4×¹·ê%<¼´’%,üdÚæÌúغ(=Ôëx èÐzàht[5éŽZð>Øp#/º>õ_ÜsfËS¯G Ã‚‡XXFà˜CÑ¢á¹Ã¢K+¿Z¶6ò‰}‰µ-›ÿݤ†0©7Öv.?’ðo R@ºI´×& †LûãZ©°ÃƒiyÝ`4n˜^]üÚ¢ßVVMAÇpÖ MQgÅhV›¥Îz°˜ºE¬!dÓ¢î;ØúM]zœ>}¿f4ÄŒR!à67ËšÁ) Xùàí VŽÏ`ò÷¦î0AEÁŠWCYnò¢Bwi´Ë¶&JCQ&I"åœò«Ú;ï;O+ï—¢+-Îê·óÕ‡•õ( XÀ¢p¢@Epo‚O³jõæ rØé‰HâàÆ¡V'Il\­þÄ«wÎ-æ„1íH)™ ÓQò‡œ9—D©“pæ<ŽjÎyß±#V%DÆ“išËLnd DZã­8BCÖ›.”X¢à®‹ÝP¦Ó†1†©„kqp¸ð´nnʲ±Ç †Œó|ùÇÃÚŠdþޘݓ˜wPc?¡ugôô·W¦©/ò¦‚õ4‚ÛbO‚¡Ÿ^¸'À±È,ªò?øD±ß½¹í?[™£î9›‰¡P™Œq/ÇsZ㣭ààAø–æx4BªÔ§Á‹=q¾•Uô“bdzA¿ÃÌ%zΈ™jˆgÊ CËìËóÌ÷ D®+\¾·¬šDûb#V^ÖPÇÞÆW­9q2NÊÔGCUÆçÆùÖ•D*`0eZ.”œ’%ØÑ’“S¨ÖÔ`‚Š¯*ü%Š3GŠ©ÇJNèíÍNÂY)°úœñã'Ú*Nf­KH^Þ-XÕ:Cñ£V•” Ž:n’ è°£§ZUJxÎ2&±ÐGÍ:g®¨†Ó'a®(¬ÕÚM½Àrúà“ð„&ˆR9ç‰%âRRŠ„B§­2›)0;…éqQT»¦3¸†všNÛɲhß–®§Óéx¨³M4—aá8ÝAî´©v®mÎ4`á*l63#v<‘àma·lg³8Jrc¢…¶5"·­pbÈ?¡ÀÞü«ÚÖˆ’(’ŽK¿Côuì$œ9Ó„ƒÓgœF;$â4Ì£ˆ~¨¶é˜&‚h&NÂ4ÑDSþ@cÛ,Ä»°·ÁéØ2w³Ñ¥„®Ûøé'ÎedØíLV\ùQ¦ôbMâ'|”ñy(ÎÞF+7d±D.0MÕºqÃ&ŽÝqsX»¸4¸•vÝPÙ Ý­L¸mJEnwëÏLSŸSã±N%d¿ qäQ;Ãý ð¬Kß endstream endobj 1131 0 obj << /Length 2368 /Filter /FlateDecode >> stream xÚÝZ[oë¸~ϯЧXóð~A‹Û¢[ì¾ÍÛî"mÅÖÖ–\INšýõáE·(ÎYÄŠ¾D䜒óÍ…ÍöÍþvGã÷Ïw_¾“6sÄi®³‡§Œ AŒ¶™V†p¡²‡]öãª~º_s£WÝ¡v{(v—cAîךÕC¢?]ªmWÖÕýÏ?|ùÎñ1cΈ0Äz–e{ÄIw}¸û×*ÍXÆ #RH/\‚ðíéîÇŸi¶ƒÁ2J„³Ù‹ŸzÊ8qÖAë˜ýãîïaqÜH"¹˜î#©ýV²`šX-n!Y0G¬âSÉÛºj»&/«®]n ð¼É¶…¥Ä™ù¶‹nA¨ƒšßB¨¤”p5•ùœË]Ù½K˜˜˜”DÁúhMq>æÛÂK¶Œjd¶†¯S‘W4;³z¾çj•{Ê®8Õ®¨€Á7@±ruÊÏç²ÚÇáúgÚű8ñüarl,ŒFŸlsAiE”Hã]}…»ïu‡¼ ­öP_Ž»°9Î,¡p®“Ím`o‚²Þ6w¡›?uE³ ªÑD:sMSN”>¥Ÿ‚òkøÔŒXª®ÃÓ1¸Ë4øÅå§àé$aÌzV‚ O¡‰Rö’…pDI3•|ž€mn²mDŠÖóm/ÁS‚CrÊÜD(8$'Õ|Çeµ-=rl¤ ;š˜jÕ5ç4¢’¹ +?2%`v%'ØÀÚk ‹мbêtÓTËž=ˆ³‡MiM¸åsç‚PeŽ&¨ú6¢ÒÓTb·«÷ì» ½—²;,(Î'Ò¸¤×÷ ŠÃE°¤ßnåSøžë¶-7>¶rèzì"ýZl¥œX ×À+©%F€AQG4û¤A1b ‰¬$û¼RÖõm$Cˆaj&ù*xSpç7®À}C’3Ûöx•€§ÕM„ žON…ž›úßåi9º®%… Îê÷ ‹a Kñ``ä»Sà 6®ŽÈÂøt ¸Êú\êj45CBàNÙó7À•D§¤@qËÕ€[l#n=mÀ-v‹2 6Lyª›b·‚X!®áVq[G†y…äÍñuJJXŽÔwb:cÔA]»!ª‡SsÖ³Ték¼º§œgÆÏQl ùL¤ç¼¡ð¬”t9 HI‰c·‘¬qt&ùz¤ç’PÈ`o \pC(Ÿo{1— øM„J0PÊÞìòe0…|1*@™$Ä-„K 6ÃùTøµ2$ ý^`@öRàìdCž0+ œß2¦ÀJ®¾í®¯µ£µ¡_¶ai]ãŒò¸.BRO§J¾ ô` À^݃ÿ| , uÑña[7MÑžQï]=)ªÖ†~¿mÞ•íO”òb‡N™ËUI â›êª<æs´Sœ¸Uuµ^Rü×¢©}5ÏÁ‡„â…¢*åz@IÀmB·¨ÚKãB褢GøÄ(F0%ßBk“W»È÷)­ˆl‡ÀûeÛåU2:õü5nôÿx5dz—€F†ØU°ûñ¼‰«º‹”ã1ÌÅè¹U“A=¿®È{dI0§·¤Åó 1–»©NHð:a%Û®ØÁ=@…‚&+øØÜÁ³¯Ž85Û)ßÔO*G9>Ì¢¼~þ¢¢ýù9î ¾zpa/÷h]»_ºU‡6IuožØœ2PCrÌê8XWq°)ŽùHxѲ…™éÐäÕ>. ;ˆ «:}p®=kô€àP½{=—[¼Aœi#u›·‰ÅS¤Œof¦„ Àkò— Ä;ú`Q5®|YR¼nv^_ÁgV"d-ÝKá±£Çy„a(mõ²à»‰cÏe ›÷ @Í#ÃcíψÎm=±÷ÓN‹–ÓÇ°Æ'? lÊ€(ÄHóEš2ñ6€N‹|¸·Á¶`|8'?ëT7q>:ªXïñlBvçz×ÔQÂÌ;ÀðË¡ô.Hé±]p,dÐë™ ¬Øyì±ož¤ì$ö ÷tÉ=Ùô`ÔVy“ÛÖŸO[,r2dœO-äç(ý{µ=^vKi­ÅDdH¶sDð¾]ÈLEíèéuÁÀGÜKÛ¡n´š¶Ô~;@ôÛow¨Û¸hò±þƒU­0 ²°+Æ}éV/ T()ÍŽücê#ìœJ’¯Fo0„Œò&òOÄh¨£™*„×0X/ßÒ •­ ï'³½G³"Þ¿Hcü*§m^…Æ&®Î›M ¦×”>SÕ[T0Mz}×YrÇÐù5÷Jù'C!We#Üñ¨5Ì›ePìM5s^8%F ÖçPaN lS YÔÑ;…>•€Vʹ£TÊ%pVÕ•Ml¬CŽ-Oá;q¹Lë}X}©ç¼éÊíå˜7÷’âË ŠÈÃgºÞ?þøVÈ÷KNå¥ôIX „9>qMC¹:9 ¬Óiã­#uj塇zÔ—n2T 5"“ÄÉY‰øíâ >£ð¥šççC‰bì3¥³œPe<+¬>ª ¡,ƒ¨} Éœca;“<« çoÊš¡èßüâS¬±=þƯ…à Cº—Ög‹þá°¯ËëÙú1,Õ“ëS‚09{»ñ(ô÷Ùÿn—¾o戕h€Ú†Õ¿K‘a­@êáj¿ô¿Þþ´·ÇG˜ô¸/Ÿãì]*Pâñ”Ÿé÷‹).ÌK¬Ggú¸/ºÇTþDõ‹“®o%ÿ³(΃ä%ŽQ‰v ÜØÂѽÏï7ìDÅNFÏÝÿÛ›Q_µ™Þ›ÿ_]ÑÛ] ÄÿÒþæï°Ú#ùŒ)›˜¹OJ/vÐÃ0{:_º”íäÓW͘‘@˜ÛvéÉñ©©Oai#Ã{©ò«âO’KbÐ] þvü^ŒôÑ{ñlb åé^rCœw!¯‚  Û)Î u xÒI´IÊr¹±mÊM07£¼Ÿ„§Žþ°}]ó¶¥Oæƒ_>•"Rp“†i>”…xÂ<+&£]x‹_kaæ&R­%L¹©ÔåçH|„7*ðEP˜©ÐhØKï øÈ“ÝÂr¢…žív”_¼ý!F/â _í¶¾4ù_d¾"úbqDòoŒ¿#~ÓzŒs¢$ËÖB«£Õ3Ã&kàÿC;O´ endstream endobj 1136 0 obj << /Length 877 /Filter /FlateDecode >> stream xÚÍW[oÓ0~ﯰÄK‹Ïvb'ˆ$†Ä Bôm›ª,q[‹ÜHÜQøõÇN×kÝS|9þÎññç“ÏÍAÄ}ß—W1C1Žh¬;^T³På´jŠDCàv ÿv@^·s8‚Íý[œt>Ú Ûn¥´»ëìà>"†v —{òøí (æ˜bk‰õlñ ɘ›cü¹6¡·ÆzÅÏþ»EÒ‹Å¥ú•*Ó|‘¹#| gxÙ'Ïßí;öŽÄ:ч^Ù:÷‹K ³œNUªàŒe²IõÒqZ¼t^€‡+!o/D¹' ÙÉ:äýorR‚e©'Z6Åþ ÄÏÊÁž7/­lTš_¦ð¥íù©²Ï#'»§v .‚‡»¤Ì&™¬õüE\‘ ê4t¨àØ+¡4©L–©<ÿ592¤g¾&u®L7Éeö.ÉÁhijf#ÉgU£ô¼8*žÊ©ŠgԉǪ4zèü÷åè æfMËlHªN8Ò-áxCh¸µhCeAË÷{•µŠfÁ‡ñàûÀ0‚(¢q€©Ï ÌR¥Åàú–  &¡Þc?ŽÐδ@ t›v9ú:øbßibÊhTçêì®S3 ƒS8e4Ä@l8íceL×ãóqÄ¢>%?±GœFð¤Y©×N=YnD38ArPǽtWFŽ ѵ“ÔЖFc§ÒÍè¹!µmIÛøSpáŽ.Øι™vZ÷#ó:€_ú]îÜÁïÍ6 K µÝtƒa¦ Y¶½œ†ù1öÉûá=¼„C(é"·Ï3ñð1³I#ípYi;’'͈Fð¸iz d²­eªna=¦ÝC¾0AˆË³™qy^g=2qaˆ<ŸaNhÈ6¬€}¿?L0Å endstream endobj 1141 0 obj << /Length 2453 /Filter /FlateDecode >> stream xÚÅZM“ܶ½ï¯˜#§* ßäQN${SJR‘Öåƒí—ƒÙae†“¯•_ŸºÁ!¹”V.Q•ËÓhöî× pÓÍã&Ý|“RûÝýÍ«·*Ûä,7Âlî÷®3f¬Þm™zs¿Ûüœ”E½½•©Jºê±®~IS’þøÑ eRÕeëŠÎ¡Jp(îÎÎíPÖìQDc`§<¸ÝåXÕ8PÇòr,úª! ¢¦GO¡Ç®Ùþzÿw˜÷-ç,×4·së¶B'¿o¹N\݃²I“ý¥CÛ:Gp]êÖD˜üÜU'WwØ±í­‘yòå¿{kÅñâ¦OßrlO®¨;ìö‡¢G¥þP‘¬9‡wX˜ç®q #tšÔMªîÛfw)þ|h.õŽtü:ø6¬˜ïà´Úªx8’¤i±=mqr½£Ÿeã<ü«·9m+l%³ÚÀ¤Âd~I¹A­Éæg°åyÔ)+XNXPüåÕ[#Fú(Y.2xS =·³§&(Г2¢'„9ß¼¹¿ùí†ÃPºáž+Æ¥Ø.™ÎóMyºùù×t³ƒAX\&ólóTOÁòÌÏû¸ùpóï%§Î-ã‚S qOÅÏ!W,³j HÁ-ËŒC–àk=ÄÍ®æ̳ ®VÌ€ÏpÁ5NÁ#os OÃfACc÷Ás…QÑsCßÕû¦-ƒ¿I~îåèÐ^…~-¹7†eJþy—C£U=Ç$Žðì§5xN-Z‡ïÈ­fi&(ø Æ“ir,Ú-Ï’Ç-2Äp{Þ’äÞ3ªSqDéèE½¬$C:¢…ýaá¼z´öŒ(½p Êz@x¥#m …´éE46¥M?0¡M/´é5m‰§Í zF”~8åîJ”K46¦MÅ•§M‘é1múŸÁ´ž6}K´)2Ý)ÓD›A=®!ô‰(¡‡»–© Q‚| JÿdýéÕÔ“ýû$7à™,_›3Á¤áß”µ€¸\ƒ½)ˉ:yæXýwÜ ÕÐBBîHå º,;Œcc!"Yq½ u„ùzÑq|?Ê:×ÿz‚{7 ±âx¤Að¤úKëÝ£v%ÖáçéÜÔÈAÁbñvvîìê«ËÅ~l‹óðZ'Ck LRÄI6qÚQâA 4?N €ìà }¸eœxÇkÄJtâ<¡è+Ïm4YôK­BP‚—Êb£ ¬ Dý‰^äOUX5iê°b +ÎgÌ+‚Uqy¼(DPô€ÈêfG²j?¨wn„x»4Eš†ÈdòàŽMà(è÷žÌ2A„ ½agý¯ÑÎzýagq´ v0sn*ÉÓÁµî:¼07|9,åvD4U7"œö‚;ö9~ÀXGz0ß„”2Bv zð¦R0K§êô v°,å| d¡Ò)jXô…ÊÉ?¢WA4 ¡Õ¾?Pa‘*&l>)ŸîöÑQ0“‰Q&“I”!!‰œ'O%»5(ÃùÃÒ±"ÿó/ÚÝT¼ä¦OÔ"U¦7Øûܾÿ!Ày⺮h?nN€`4¹ÿuÅÎ3(”UO5Šò?} ð'E7óF•0ï0L-0òÆUtnº®‚3 ¡:[˜aë|º÷Ë ½>têËö ´‡P½ÁïPe@fAʛЉnäöjä©ÚÁ–Nž§1¤­.Tx"ùi« ¬w _o‰õ«kYEÌÜDòÆ·­`v•#ÚÞ7‘œ+_ÈZO“6½q6fŸ=!‚ªeL "åÌ‚¾H*¿NóZPË.D&˜*Õ,}oJñbµ àx¨Í:ÐÚ0­çÐT-Ì"B _™œîF¦ßIµ‚4±VgøP+H;8²41z¡Ã6:¼¤Ä JÑË‘¼<ØÎ’qáMø{l{Œbo¦¢gëé5G<Á8,¬…˜Yò¥˜ÎìËî>³PvI›2Í¿jO„ʘRÚ›’œ¿˜ròÒÈ>ʼnòr†@×F­*9¼®È§ C‚˜g“œñ|¸o¹–©·|O¡“CAEì{,ž¥!ؤ¹ëE.`B^²ƒ„L@ÅaÈ_"7ðºb~P 8˜~yÅòm4R ¯ržñ–”¤=j.þvlá¶'ƒ=ZUðìl†ZB®.«ëaáê šgõ*mƒ‚ÝŠžâ¥Q†$¥”"’òc>1û±’7šh° Pz–½£Ço¥• ËsjºÅ£ÂäÊA®Mã&¶®(t‹9Ç]ÑW¿‰Ÿ£SùuiFUsQ½xªþöU³ÈS–¥«\7zS†¼óÆòc¦Ö@ 7ŽVNQËâH÷8·Ú3Rö¼|*²€ÝB?ʨ|1GzY(9ý“ÞýB§Ávä~Bȱû“ññCüEÄû=1¹Sôâxi¹Tºr1äaΓf0åK\™‡KBÒÙ·Í ÍâQŒ‚Çã9„þXÒ¶?§ÖÑ”¦zbúÁÚÆ—Oô2X‚Ø_S„Í‚l~½ÄÔñs‡ëÈicD \=Ðà¡ØŠt(H½¤@m8Ÿps¡ôoêÛ¾ÅÒµ · ÜÑïæ£Ã‰@¦i¨7Âðx‡8îP°[pp…Úå|,J·›FAáüç‹Þ͹cè œWš>yôÓc7žvÿï&Àvj³UȲSÇÍ€\›¶êtïÓŒšf’î?lD> stream xÚµ]oã6ò=¿B@_äÚË‘Ñ¢ÀÐ-ö€phÞÚ"e:*K®$7›ûõ7ádÉQœlã¾XÃ!9CÎ÷Ð<ºxôã ßÝÞ|ü”™Hfµ–Ñí.J±Ôd‘Ñ)“JG·Ûè—X0Í’ÕZpÎãþ|»ZKÍã]íÚ¼/›zõÛí¿?~J²È2k¤A2”ÊÎtvóÃíÍ7°<‘4°Æ&‘ Ë’$*ö7¿üÆ£-LÂù`*‹ýÒ}$™Í,@UôóÍÉhgìd*˜ý#)“„;ë`™glmÆÀƯÁVqÁ„”s¶ ê%ûÔÌX1ÈãH.±¤}< EZ‘#õè`™0á-³ ò÷¦TF™)Æás‹¬›”:õ†‡_¯f©Íh•ˆlv§ÉJÁ8Ĉ‹:EÁƒK–ìÞ¥Ó„q›zRÆ^T©âT™^ƒ«â ‰™q}A£“‰¤‘ø°*^‚ I7ˆ9ÁÀu¾”Esß懇²'¿ÂJ·é\‰ä• KëºCS/•ˆ¸Üç÷a6èúW®y?|^g<þ¼£•#•6¯‡-ÍŽ¾Ë:—J2•&u®2É%"m9³ê}•Aš‘žRª.»q"$)]i¾)´s}Aç–ñ1¨MÝ•÷F’£WÚb’Š—|‚"Åû¦u„¯ jê€êyá0N¯·0íòâ!,ܘë¦[Mámåã.p‡ÃJõ4dš L0eäÅ!¾´›²oóö‰†dªZÇ`TI–ÆŸ{ÂwͱÚ¼qô­Š]|Œ]< ÖÇg™Pó†-1X6€ âÄbÃ̧ô,qi¯H45][S†Ý…ÁÉî“©¢Ø„½N¦ÒïÿÜ&¤†LwòšÈ>‚‹?œ8xàÜw5ÖJŸ®HaÀ€i5¿á k™ /k™IJ n‹ZáIüŸ†f·e …­h]EUZØ×?:WÓÅ'À‚aôe^Ñà$AÏ3^Ñ´pÕ4ÛKjZPÈ$õHûÈ!&zDÐH °gÓ·ãmÚ@®<'7Iš8¤2u‘/@í„óÂÉGAC™ë ß¼ëŽ{4®‡Œo¡x˜múœL:nßiB‡ácÙ?xµœÓg³’<>–•Wd¦¡bvD]’ff«hØ•ûƒ·j„Ǻ±›ù[†j(Y§§îÞ—¤$¡IXC¹‹FŒ½ч˜[ÊÁ)à÷ 3M@@‹{ È­M U´EðE/á^xâÓ¸h¥Û„°ƒàÀc‡^³ «c9ÔøUÕ ±>†<ÌÇN óZÛžáû,@.…Ž¡sù¦¬‹ê¸(ðcÞõw¯ª‡ï—tw«îîË?Ã&{õîJ¹¦@ÉzrÃ1¦4q}Ñ »B¡KZ]ZÿõgصÍþL¥w_ú‹G!Ò}þû„tçú@ « LãiùHfJòwç/“ôð›ŽV±²~«Ôœûji]>ÚY~YC›”BQ4³ÊÛå =e™ëÔÉbÙÊÍØLçíJ@t:b˜QÔ‚H¨ ŽÝ¬ò‰9ͱ€°^éˆÇpF¨ÿ¹¶!\Q‘3Û ÎqÉ`+ê—ìV¢kÑ Åh(æÓl.ÅGª€¬  BùFyÀRÀ`ŒÏš(z¥yöIFJc®ß×»ƹõ¤R>ÔU]¿ÔJ&¡Ë¹S«™ÌÌœ)™ÙóšÄÁ•¹[—zζn¶nkb˜†üs ®‰eºøW a \Sê[¯Á{ÒD̹ŽÕÒsg áÔõ'¾ñU«w ee< Z5ÔWPž½-ýq„¢³!&÷†¾>·Rò1ÌÂä¥Ü{)ø›´PÕ‹Ž‘Â¥ÓW‚ê úû>Í@¨6 ”jqÑ1RVzžØ‘)!æ TÔö²òu ÉTÁÁÓÞiÊÚzH*µ—òŠ‚ $³ä*LSË 5Ι¾è?–Erþ‘Ó{vÒCœK!y@Ÿ=o¾üØâZýŸÌÜ&YÆG©YŠ¼p©ñ©2ü{¡Bg±@3mÓ×è‰=4 (b>•µ¯“Œö¯ºJÿ„™–}çª!}W¤BWäÞÖŽ5‡c£ãçè5Û²ðºdSÆ΋߿©ÿI¿¾ÿ1— |_,Ñ8AýÇKßPR¿¡ÚÿðrwvÖ¾ŒÔÃœNñW™É=—ðÚÝïöùá︿yùþþõÎ?•- ÀÿI8 ¸™b0kü L†c}¦†~´½Ñ.Ñ^ÿƒ0,Þä=ŽóøÐ6×ö¥xÒ<ü=Aš t=@G¨æ†G›fÓCwÛá çÜSÎ#&a âæ:Q,!ïˆ4™­‚HûÝu endstream endobj 1155 0 obj << /Length 1502 /Filter /FlateDecode >> stream xÚÍXKoÛF¾ûWèE.¢Í¾hQ ’½Ñ- Z¤m"©ŠtRÿû~»+Ú¢LÉJ´y\´+rvf8ß<—f7Íþº Ö?g/ß8ž9â4×Ùì:cFÍX¦•!\¨lVdï&¿TõbyW”—SÅÕä÷ª]¾ÌÛŽÜþqùaö7M#Nm‰Ëún A7ݼnŠrÞݯˑÇ7e^½§Šn’+Åå|îÏ|,ËõSñɯ~ ì7Ïäåiw¾iª-1’gSžÌFž³[eŽN¢b~×\Ç5¯ãúêí,n¢¿«Ú-iýx&Q(")‡e‚(¨ë‰.^Ï.þ½`xJ3– JA#2›hª³ÅêâÝšx “álö9®2NœuØ-³·ÿŒ`&¨=¬$5Q(ì3"”9¢-K"”s¢µ †z*UJ¬K"UÂŒJ½n6#¨38²{ÀàÅL’(p$+ð‘iìe5ÑÒ<‡8aS•TÇÍ) Inˆ”:‰T×FîH­®Ç0¡fçaðé4æÒ’è}ïÇÈRœRI„ÂÇœ’§`¤§4Ir†¢¦ßËWËfñq&® SGCi*‘Î,Üg·GñbŠªL¦r‘bç|S‚Põ¬$<ŒÓŽ¸d ¡†ÁåPè8^̉PÌRHušXÁ‡RWùf.”Ù£ÕçÆ!7JŒ0GÊûL èÎ8³§Àĵ†ƒ'‰qÄó)0q‡`¶I`â@Ü™=˜îÚr¬@qHåQE.§‚ÚÉ«z.P2y.¡<Å'% ú„І" %qaQÎœ‚–pŠ0¦“Hu–0ª†RtžÒõlÊõ¦l˺C;È¥˜äqÙE£iy(¦ƒlè?‡øvÕ£,9Q\E™9РSÖ ¹Ñç%E|'鎕:Žo°Ê¥É™D>Üz &…&B›$Rr?@HoG|ºYpÆ¿âhX{<Ç“¡ÄÒÇîfqpI‰¾.\TÂŒ›¼k6I/+1;äò*ÖU÷-ÕÓç©·@üÔÖ[ü@ív¸ŒjwÕ÷ãêé”êùSWM³¹­÷šTí¼(oÊÚ‡Â÷¿¶oº$ÑZŸœ ¦E­3!Ñ»pqVeÂp§ñž•«#Eó¥Ï  „r #`À=<ªÚ±#æXD^[å&ü/B‰ëqÜfëë>ko×íÙõ }‡ò…5IÿS.îzña¾èBõó™¿^”'¥õ©Œ—½oó%yý+³Ruý3$¥Ca¿Õ•ºþÚ‰z(‚‚>/—mùKË3fJ®Ýw}Tw7!Sw¾¬"ï±>d@Øè·Õ²Ø$FýŒÏ©Š1»ûù)ÍŸ1x´Ûòþ†ÜK»9 c±vkMfÔàªÃÿ4-È* endstream endobj 1159 0 obj << /Length 2296 /Filter /FlateDecode >> stream xÚÅZMo#7½ûW4°9qøý $@f`/‹ø–†ÆjÛBä–V’g6ÿ~_5)Y”¨–q³§¦š»êU±ªHÞ<5¼ùÇ OÏîn>~ ² ,Xi›»ÇFhÏœ5ŽIeš»ióËh¶žßþv÷ÓÍw7ÿ¾ø'oD#¬aœ‹~¤Æȇ—›_~ãÍ?5œ©à›¯ýЗF²àZóæ盕@­c!䘓õ¦€é5“.TÁô³>íÓöUrÈÄ»¨RæœÍQ_&«ß ¨J1LTe™ô:G}j –F2ãTPc˜±â€ISÂüøIû}UH¦ŒÆTýU»y]uëÛ±|´yncc6m»ÍìWÎe»ŠoCHŒ,NŸkZ f¹ÛÎ_$³†ù*\Öd¹ˆÌbÜû* Ê3îÜ%dÖ&0lT ²xs ™5 Wp]†Ëƒº€Ì†+¦¼¬j¸eʉ²€è Óf\ãÈÉKu¶$Fpdå5@½ïÓö ´¥8Ùs P…Ïð^–]òiÞrAÚÁùÑÎe} $¨·¯ó µ]Üñ®ßñ\,ÛÕ„¢–"Œ ™·6·Õ¢úAãÄ[™$ìÆÑBåuÆꙥ]Ôa‹‘êLÙ#p[Ù“:=e¬Øp…®*¡ÍeŽZ®(æ+ê_‹¨b<³j€1dÓÆŸ°iA©½gŒgºŽR•Ú%JUÕ×Qªòî"¥B H>ª(UÙË#¥–=pè+§µÚª ¼2CÅ„},ûDuJ€¿Pþ0™¿¶Ñ¼á0ø›e”J÷‘2µú|ÏÃÀ˜Þ=ORž=Û¤FLRR÷d:‘?™ÌãïåŠ\ÌfÖ^–žH ‹ )”wïIOì©ôd±JNRoÕü¤—f!mŸ\Cw?Y=Ñ"ÞõçKûø ýZ|H½ÛO].Ö礂‰Ö›É測qÿ¸Xµ ç¾Ëk´ïª‘|(‰-_Á|óØÑÒ©y†SÔúpRr_ðÝÊ=4g’R¡' J ©¡ba–Ñ,È@e÷ ç 4‘ñ+T@L§ û§v×x¨p=æöLa³\Ü—ý¬©©ãFe1œ;@D'·V@Ô†‰DŠ-bO×Bý áž8sœ™^‹CŠ%äp†íéà@Þ饾6Ù5ødšÊÊ¡Ã8âyíj€*Nå#›ƒžÈ°e` b®ª$S„3Ô¢é(í#ý*€0‘ƒ–Œ‡*®ÖW¤<±ãM¥E6 ÏÄ[ݧÌb:²ˆ‰ätGaÉG㔑Îx80‡Hï»AnÚüë ·Â²%ò/ϸ*ÖðLa££©¬ªÛtYS‚Û2ÝÇq‰"?„f·c%x<íË3o1z^åÙ^˜è8÷Ë>»Ùt^¿ùø‰ÖÞ§z£¸(e¥}‚T¡±ì`ß©ŠUŸ¶ý\. qN«#'PÎN‘ØG-±Nøx©¦ ¨·jòOí¦ZÉù'<ªæÒE†.žfðF‰kzß¹a rç,ÒԇΈê°;>îó•nÙ,©ó¸¶'ã‹Ís¡7Ýë™tÛ›;Û²#UGRér²9¼½sD=Ø6Ò:¼À˜K¨7.°ñU¡§s0y õj n©·:H½ [êeŸš¨w=a«µU@i«C ÏÔ É[p:^œe¼êÃãaÆ“··ûŒ‡ü߯ˆ¥Œ7J¥û'è\· LÜÿk`ìí¹OE7ÿ#úœþxd±{öÃmCÕ"s¸³$ ¢ }µÞ”Íi{¯.Ùëf•ŽNõò÷˜0ŽU²/šŠzÎÛW Ðd^èyÕÀLÖ•c®þW~}QºÆ&b$ýuëMÐÑv‘'{žjúÂÙl”ð_vVE endstream endobj 1163 0 obj << /Length 1416 /Filter /FlateDecode >> stream xÚÝš[s£6Çßý)x„™Z‘„.ЗÎ4M:Ýi§—õÛî>£ÄLmHo²ûé{„$G8‹gµÓN_‚ÒùƒÎïëÝE8úy®?®ׄ(G¹ "ZÝF$M‘Y$¸D4åѪŒÞÅU·M>¬Þ,®V‹‡®8"áa.‡– Z®w‹wpTÂÃ7FižECÓ]DQžåPÚFožTå)ÂLŒU‹®?¡*r”B‹ ª’¢”²±jsB4KQšÑ0¢™@©$G¢í ÑÄhD”bŒ9òªÚvju8\\³Ìë´dI–FKÂQÎLŸ_›»j] 4\\Cåskàs0ã}Ï‘=æ n“%4î‚ãFߤqÑ&$‹ïö;U÷J–)“ñj£LËN­›º|ÙÐ<]µyÔÔÛO¦êÆvT åñGý§Øî‹^Y•{ƒÍ0ðµ IKPÎí½Ç˜¶–àø…ÎT÷¹Þê)`HÑјŽ=±¤ åX‚ÔÑYñ…s$ _`‹‘YñBÕÅ—¯:_!D]|ù¢»âi’t*‘È…%˜>¿OÕn¿3ÞxÕÞ>ðª+[sÝ5­2¥#‚ÂÀ%¤fxï h[œå3@¢jA©NDÔ‚0ÝUõ|,Uýã •(ËÒ0€-‘±9„Puøª“„uø¢ÀÁ¾;;%\nŠúκ¸«îêàžÅa"Ãx”ÁOþ φPužõU'=BÔyvô©eyn„¿ŒîoËLD8 âq&à“x:ÃãAT­ÇGªS"j=>íö7gGòO•ÂúÖu)u3Ô÷˜¤'&±`Cf±ªUõZb‡a”±³ØI1¢™ÃØ™œÃNUÇŽ¯:ÉNQÇŽ/ºÛoÏÍ´M¹_÷ÿVÆHsËBÄëÚ¥t†×ƒ¨Z¯T§¼DÔz}$ZVÏÎWO…szY KÁª«šZ/SÁó«MaVÝw‰Í ­êöÛÃSsý»n´Çz¼ˆ¼qóG[_Õ½JïT›pg‰gˆó0[7ÚVÊÅ–B¨:–|ÕI–Bˆ:–|Ñ[ÓH–b˜¸æAT)™U&ùåQÌFYë/B—´|º^€m)n›}]{&S í°ÓÑ–åÚØHx\ô¦¿¾WNBï¡ÔUÿ)߀_J!PÃà ¦XNæà@ÔÑë‹NÒ@ÓÁëkÞOÂûõ¢v}Ñ3Ø%_ïãF¹¹{Zªº<+×M½|ñÐ8à e4ÌNŸ¶%蜾 ªè‘êÐAD-Ñ#ÑI¢C¨:¤GªíùéxWTXÛÿ?ÔpÍy˜$­mÉ9SŒ ¢ŽiOtéšiOóó$ÑDD{¢íÙ9úêa_lÇ´}V­-ZmëéLF¾°ÜΙkãͨÇÑSψžq|èWûé9A’‹sH‡áÀy˜}YJ¸wξlU‡º¯:ÉzQǺ/:œñ¹ ¿„>U.ø Þ\µE?ìÊÃ]©†)¨9÷ã¨î7­R¦øâÜ‘Óø—[ÓÜ0žÏz˜š—§ƒúPχÀÈDÜ·{¥³y.´ýÚVJ™|^/BåÀ+Ô)]º]cªl{ñ|2 eÿÅàKÅñïа}¬:£È_Õ9ñ¾V5ÅlP®º·)TmiŠÇ¢’šc[ý̽\ŠSXÕ–“}MÍ®ød æ(W—n¬1—£¶iËïJlÎw¥[†Kâ9PâcÊÓÇ»Òæ2è­]f»ÖVápâ«Vr=ž÷jíÿ–níªg œ¦­n£ñ&GR?F0¢ŒºüW$yyüC²$Xÿ˜›ÛïííúDú™ ®mÿÊ&ÁËqæ‹ “PÍ¥ ÿ~ m‰”£Fþ½ÕÂZ endstream endobj 1167 0 obj << /Length 1489 /Filter /FlateDecode >> stream xÚÍYÛŽÛ6}÷Wè‹ÝÆ\Þ/hQ ’ A¢ß’`¡Ø\[¨-o$9›ü}‡­E¯âx[íËš’sÄ9ägë/'øä÷—Åäê!¤0ÈH*‹ÅMACJêB …(ÅbU¼™Vívönñjò|1ù0!0¤ #,”Éaär7yó+è|U`ÄŒ.îüÐ]A‘ÑZÛâõäQTÁæ2E-ÛnUÄ`DTE£ü¼??„Ÿ·X`šs¿¦yœ›¬¬„a$ñ² ¨ÉÉÁÒŠõ¨•ÛSOŸ¡“Ó”žÂ¹ÐHi€3H(zÊ ÅÕYDιš\ r9@£Æ% ç4.f”¸Ó~¸\Þx˜òܪûmì¶tZ÷b)G«È,¹„Y¦‘Z²P ¾ü^@mÔžÛ!êYns€öäA·öÑß®ßlÛb»M­ÿpÁo¯ùß’uÌYX_œÐKXÏÚ³>D=ËzОõ!è¶ËÂú·¢˜K¨RY(v¾0|0¾NqÔHq‚zŽâ, ‘âtýøƒý²±pUiþóÍ,–³<ă/Åù%Äç@퉢ž%>hOütÝå"þ[±Ì ¼6YXv¾ø%7², ‘ä!è9Ž³`FŽ‡˜Ër»}4ÉOTHnõÒ‘êž„÷„\ŽÅCúãlõa÷Þoíó °%éæ°‹ûTäaFA E‚Þ§£ûIX’ÖÓéG_n8¦0⠣ΕäêÌ~`O%EPm<µŸn›‘\‡‚3¡áˆ1¬cÌwûÆöá„ã+¸„33«x_ ‰Ÿ G–DÌ yÀ˜BVEŽóüÓãßåØ‚GSÊ—ÁÒØ[È(ᱪ×Gß#éí CfÇcjWÙU®µ ,ª¾ˆ¼¤š•µ—•!êY]ÉÚëJ²ÔåÒ]ó--µ«z(Ø,M(„¨èÉUV8é++ê~Óº¶Û´aR²i‡]ãÒB1\sÄye@a…c'1ùw‡\"Œ™wÅñ¹Tz5$(ÇÂ¥ò æ—„…#¢ÌPX|ëq/,AN@"•>)Ôô{Þ>–¨ñBøJÕŒˆé§`m'-œï6«SGq7ø¦ß ^häqÀ@h”'ÁB3Ó•D}pïñ± Ðùå†*ƒ Ê¡6TArO/¹Ääb“€ž›˜QkÌõûìŸ\c égûö½Öpæ®1þã æPR xÜ”ÑÞÝÍd5qîP}ž¸š)uõO×ÕvÍaÙü‡ÙÄJ°Ÿ¿‰–ºÜ¥¾¾ss²3ï_ÖeS§C˜K¶î1Xé…K"à V”À¥!JÆwU½ÜàèúìO°Ÿ¯`{¡ÍÏcÇêúú¯×ÕÇ8Ü=U«XÄu0õÚ‰ÐõÚvÐã*ÁÞw)6æì/koÎúùÑ¥kº2ñ#¢6—®DEÓÕüi!JõIô*W=¯œ’ô¾¿Ÿøÿž¸ˆ~>™óôõ"f´‰Ž]f*‘6&¾Ëæ.¯3týO uáZgŽsA¸A»Â‰BZÇâQ:Âô71×q endstream endobj 1171 0 obj << /Length 837 /Filter /FlateDecode >> stream xÚÍV]oÓ0}ﯰÄK37¶cÇ CBÖ·1Eiã¶ÖÒ¤ËGËþ=þHK²¶#-EÚSÛ÷ÜëësîµæÀŸ^óý0Œ®9! f`<ˆ0 &Œp;ü^8ˆó•(*)JÇÅÔæ3û}3.»ñ—æö;ºq ØGû¸ˆCo`_ÉlšÖ‰p\Šéð­,ÓQ\VpñNã) !Ò&µMò<µ›õŸÚ‰_«"’e$ê8ýéQϘî|µì£HÛÜ ±ÚG°3Wzˆ^rÞÓ«Ð 0ºöyëð.ã0ð1p1‚˜ úq!¦÷6‰²IfµqJ­Eè¤È)Wqm“arþi }¿›–ƒý Qz4Ä'Ê‚üK+Aª]z>3Pr~¼!B¢Þ9—p`H°ßu:©ešj` "u¡Më%:cÈ=Guì<ÕÍŠ|­{=¬º_Ç€®Ö½wbH299"™lÑ’ G”‰ùY=¢ge:óêâ$Ñ¥ Êgÿ38zvp—ˆê¹·ú_ñ…ÏTÖ“Kt‚u¦e¾ {jÕÅN)ådªL»8„œ7ok„Uó“­ endstream endobj 1177 0 obj << /Length 898 /Filter /FlateDecode >> stream xÚÝXMsÓ0½çWè˜2dÑê[Ã`àÆt<&vÓ ®l·¥ÿž•¤IpB b(9YVl=½}owåp6eœ½ðåõÕxðẫ7°ñC«Á 2£-©Ù8cŸ†I2«‹d:»Ë/FZèa¸Kë&É¿/ªnæÙæT’Íî>sÍ/.Çï™BpJ²"x½µ^“~Ý¿^âóvþG/ Ú¾líßÃñœD*ùöh™O«:;µÒ2{RE¥”4×yù4´ŠÇk^›Ró*É‹:?7¡òó«~E~v•¯hú)™ÿ—ÒôüTšžŸJéd’×õ©J¥U•>ü6­¤˜ÕÍjSe6£Df7I‹âTÉ®nËI3›—'ÑK«éíM^6_¼Qnã?2¬l$hutÝêãkZV >\í¡{qëè¯5p‹´¯ö ÂÏ ^ßa–3dBpzF2T$í|r3øtÉYF?!Þ±ûöÑ&À;O£‚}|èùÐB7Ø.…« áPé , ¦ ¥ßÆlúÔHpÚEA5†ìbw˜fYEéò3°ä ¸¶1€%·À•Ùž_õx‰,Ú•ô“´ìÌòeišt±(fyÖÝ4óådŸ‡}=juÐCJpÜÄ ¨„ëÕR¤> stream xÚÍYKÛ6¾ûWèE.bF|“hC¦hnmÝS²%ï ‘-W$ûï;|H6½²×[»›žÄ¥©ïÎŒ†ßp“è.J¢_'‰þ<Ÿ¼~ÇT¤‘DDóu„)ER¨Hp‰åÑ<‹>Ä«¢^uE;žÄ_¦˜ÇyÝÕ¶q3Õzúiþþõ;M€$CR‰(šÒ,™ü2Ÿü=Á0›D8"„!E¥¥b@µÚL>|J¢ ~|%ˆj}µK7AZi•ÑŸ“ßÕ!)V§M;Bʘ݄”I„’æßvõ«PHrV‰‘Àøh«ÛÌ… Œ¥BX‘>Ú ¤¤<'JÀ&®oa<%i&/ˆeVˆ›2Žá—ĉ $»IvP¡‘¤GÙQÕcaJ¸Á+÷MÕy³ËWm1%ÜqåÃTðY£“£ïøˆ{F†¸¢Ñ K¤)qÈ?ÛUÙeùtÆô Äú5¸~±ìŠ2C÷o 0€Í0†h ÷Êb«wÅÿ’ù˼c½gg~ì§,Œýa±®«Í¢ÉÛ O,*ÃH1ê¡ù!ôç<ß…ÐÇcÛñ«À°àí6ý|`0ú÷7þɾ9;Íþ¯6¶ûºH×ëÞ›#õ¯îÒS»»¼Ïs€3á\èÅå€Cj°Ù½ˆViY¾LüÅÿ1þûí?}þ¢t”Ì@gHF|ݧv~x„ˆØH§èáA…Q"tü¼AˆÒA"Œƒ`2Ƚ·# qµˆ5©u¶É8«6ia%ÌŽ JP3t Ø¥œ¤A@”êAmÆAÀuL<©šLÙ< ÓÜW]é÷¼ªjsºWÎ2n«À§Õ}žÍ\v‚‰Ò•f¥Ðq³KW~8ê3ŽÁg´7ÂeácS‰@˜nCÓÈ Ÿ5Üv»ž®ÈÎpAê)¬žð­BtŸk½ ]› ­å¾ `ŠÆYÕ5¹·/µ3Ê{ÔLÔuúà†Ë¼ØÞùY[àû—œ5àhMm[xÜ!)¯»-¨²jëþêÁ`hªEžóXÂâßÖnrxí€ þêÃCk¼Y`$ÞæMÛ¯ªó25TF*m°<«íÄÞ…Š1ÅIÜÿ ù4R\ê|Y—oÍ»ø¶þi sãjížÎjlòÍ2¯ÝØÈÑâc’kL,‚Õ YÓí]~ŒTxìacr¿±Ç¬#gBÓÖݪíêÜéâÐ ˜°fÀÓ™WI†Î4üq0ÃJlg†•Ôfð½²ÐgóþµuU–•‘â_]¼Í”O߯RO¹ô¯øl4ä•{nª¬X{kaõãÔ' ä>~¢ÐAÁgF´2ýõU ŠB:‘‰«s­˜âk~ Je:RPöØqMW²¯Iu=”"†^Ðõ\ßï؆ÃEµ[¤õݲ <Ø`Íð•ÿuëû˜]Õ\¬ŽàœE—k„?ò]éjÒá×’ÖS¬â»nãÊÆ©« yËäpžŠ(ïo#< ì±°µ`ä¬fˆ¨ý)[5§®8†£ jÁˆu1>À€cÆ`8?/Û°’ iäKf[·lÚ¢íÚ|QdÍm2îÂô*²E[=2.#æ¯ç‹Q¬÷õsLµ@Ä=w˜ ’sŽ(V×Ýšì¥ ãs…P¤ 7!¥IÐ\é©»CŒˆ¼ ©€/ŠëtŸT#•¼ŒÅ-¨)8³#jHâqáÌ÷Ÿ}í Sã’¦í³¬ÎÍ­Ø7#jüU´™¯O# Ù}¾>ÍÌåä±Ò¶‚ñÃ.A¦ J>›©XÁðfD+¹Æ‰XQ”(i¡° g2k¨· % ’žÈT(ñJ±›°s/MCÖbô’›À‡DN/{„Á`ßl9åFq&Ž[VŒÕ!ÌhiöáuånĨ ÓÃ\Êâb=˜R{c¬¦V|ƒ ûûÜÈt+Ðd«0ùþjŒø¦’†ª—Jgi›ºŸ¬ð4SFxš‰´mSÓ@ºY#>íìè%CXžÏ_ •Ê¬Á#rñª‹xbË ‘ä¬âä 1S-nÀ Õ“cÒm•åc …AWü¿Äº®Z¶ÐPô5Bn¾oX@ÇÀ'‚*G“nÆ*†ù_Êþê`¼bHøÌ <±år]Å%‰ðóƒ ¢õM85ݦBÒS4a× ÝU{Içê´H:ÓgDCò‘q,‚Mÿq[¿ endstream endobj 1186 0 obj << /Length 1349 /Filter /FlateDecode >> stream xÚåXÛŽÛ6}߯лˆ¹¼_Т@R$E‹E}HC‘åµ[r$9»û÷^ì5mYëdU4@ŸLQ£9œá™Ã¡qr“àä—+|æ÷Åôêú•¡‰AFR™L QIB)¢L$Óyòvô]Qf«í<O£‹fu6-Zþ4~?ý MAFãÙ ÞÏnŠÏÁÜ>õ¬¬v¾?œš5y;K˲jÓ¶¨ÊwX`畤9ërݦÏ»¶Ãgç—[ÌÃW>ùÁ}?9¿‚8¸½—(¬› Â’‡N?æù¦7¬ýÒ®_q}°e©‘â4™PðI”÷ù"mŠl<¡6uQ¶Ey㟲´ôƒyx׋ª^çsÿ¸mö¦í2˜,ªÕªÃ:n÷ïÛ2³5È®è„XG¬¢ic õ@¤rqåõAòÃŒÿu)Ìï6õS*v¼‰éôÈžYÀðaÀþR:]V Ã€a‰¯£âeaeË´>ª›œY[Íš¶þªÚ8—çKjãuUb§óÏ–Öi™íèÿÿ)›Åj3kï7y`Ö:ÍꪗVy¹]Çû<øI;ê©–^:R){õ=¨¹ P%üÅGÊ¿ÕGÉ׆sñwÓïAµqÌÂÓ°iŠìKøR#¿‘Ô‹o-3¦Wãƒ`þ½,VV);”tÊA뽋Hr|©a‰îSXŠ“é—Ó«OWfqBÊ$˜è}_œ­¯Þ¾ÇÉ^BlˆÁç·ÎtP040Z%o®þìh±)ƒ±rž0 DÐ;0…DT˜A0…A²ºý=Í'eˆp¹ÏFW¾l{‹_ßü~ºv†5’ìoäñÚ_ýñ×ëçÓ\Τz\.á*t´Q?w$LÒ.Ï:²Å‘"òˆ]G.ˆêîmÖéýu=o«mëç\K¿ÏßLý›v™¶^0(ÇEâJ[§ÇòÆö" ZקÈQµðþôãf›-ýÛ´é„À2%Þ/s±ªªzÞ #ˆéÞ”„åÞ`½ãXœílÒrÞµ (Jþà'½ëòZCv6¨s1J©Þêg+ öZ?‰T’!ǃõ„AOÎW?Óa.†ÀÔ ÌcÌjÓi8ÂðéF9¨Ò5Š' 6ZÉAþXD¾€N1¹FŒ™!PpÝêÍ!ª+©®“ŠAÁæGõé–õG öEnî6aÞ•fU]çͦ*çî0sfáUêšMžï0¦YW­huXPÝ"E¬‡8HÅfˆ•sbûÇwˆ3¸Vƒ€28ôè®9B…Í4f2ri-ŽÈxN´AŠ  n(RôˆŽá¼íR¡Ax,M–ÚF˜réDá”2Ì6Z´—4DC‡lIÝ?SO‰ˆèÅ,gÀQ}ÇÅÐÒXÎ<“(%bÌó½+Sû ƒ‹¡Ï\>&bt·ùlü½ÂNÞ.s÷?Ϭk‹¸xh‡¬…mœªíjî?kh¡ÂŒíJÜ ˆ¸ëÂÆ B:¾ :e‡6Â+;èÔ¨Î?m‹Úz²ÓAçíÐþ½†iY„Œ&’éÑ˦Éá“®V÷c):[*G®|躺õ+¸*%„ÄÉ•:"jœ+JDŸ¼KhàZ6(¨6†þ3íDT‚ ]‘ > stream xÚÕZÛn#¹}÷WÈ‹¼°8$‹W$° 2Á.’,6ã·ÍÂ嶥Œ¬v¤öÌÎßçTwËeª­Yqä©ol².§ªHÊÑÃHŽþz!û럮/Þ½zEtÚ®ïGŠHxFÎz¡ÉŽ®ïF?›ååÏ×ß_üåúâ? Ê‘)+…´¾miÐröxñÓÏrt‡ß¤ FŸÛ¦#-bˆ¸[Ž>\ü˜µ$¤q)ètÓd@]„%@½¤M ºªïª j$ ANÒ)ê}½®¦³ùk`M‚Ñ%€5y!I c mPLëɘbÖOHç¹"¶¤=ÚÛ[j¾<µj}÷Þ„ý¶ZeÐYÛèó¢™w4&œôÛFYW …t®Äð‰4¼Êœ &2AP£$«àUúm=‘ƒÏDUÓYA>æõt€à31A Q„àSÔ§õb•°QN8*b”†Håãt¶®sVàóvkpÓÍåDE9¾^Í&Üz4!E"JM”ÑnE·¨W]ËéúR…ñÃócµjDÆ ZÛAƒÖ môl¬0PÒ9þˆÁjßö¤ÃëÀ‡¬E áC"ÝÇÌ»¶àWç‹€Bµ’ygôÅ°5섲z««ŒŽŒ°Pð çHSbØ$]ÛâMýf=aþÚ¹ôCÆ lP¤+Þ›q7ÇqP¤£"˜žS$}šM¤^¿ºË…"ÈÍÇA³0$…sE$f :Ko›†1øÉè"˜-H`ÆaÊÌÓ3¿§.°¸Ï † L E £&œF³xRºïZO´ °•Œ©@wäÌ ©¨@‚µ†¦yð9I-´áü-,,ÈÈ» #—Žýýÿüû·×Üæ²®. Ï^³ûçŒÀ`–´‹O­™Ý^j9~ÞÚÜrY_j;þÜ=2‘¶7›ú±êîªKeÇ¿4ëi÷8«Wͺ^òƒ7óuýŒdeü0ï^dMx¢"j¤Þ‰á×¢Z ëb‘Z]!ù;¡-€¹-E÷0$¥*¢ÔðT•}Q: ÖOœGn2AÀ•/±§¾ýw5Cv9!éÇ×ó’TmdÿšïÕx¥¶7·U÷q†"·©îº—Ï›Åê¡{ßÌ«îÝ}½µªþ›ÚÏz•D˜Ëz7m’û²¦±½¾JÁÛ~¢¥ˆZwÿn±š-ŸÁ Ô?À´ÞAÕbþÇQ¦P77ø~ó°øÔ7ç'´¾iu³\ûé›ÜÿÙö7ìH³I+ùó¬ù¥ïwx©~_t nh ³úé £ýc+¬×°«êémØþi7…ÉñWÏËeI‰Þ¯«ê„‰4ÓÕ×Oä••íf¶oX¿­lªí›çMµ.=Ç«Sm­í£Z÷ó0¾IF¥¾zdiOW9«-;£×fÜfÝï|{ÕݪwýÛí쮎t¦õ›æÿÛ ‚r^îh#Ý  ›ˆýÿ7‘äß!ADrž°Ê5Jr„к\ÞNgùI¡ñîõí—LŒP. ¯ö ~C63ÒçåµZ(äaÜ“ j¨À Ò¬˜è—çÌ#Ù“ŽA¨`  ’TBy“¢îeOk S×p²F).[ÀkL”é]L'…;MÀPK—€DÍC!¦˜ì0¹âÎK{‹e;ád“=äó¼ZõY¤Л5©SVœt~â‚…sO»Kçñ|Wßw×ÝNBêe¨Tüp¹­É¢^à2¿é3÷r«Ü“×np+Ç'CL˜“>=²ªêÁ'ÊA iSÔãvàý Ó­ªênÓë¬î®·½.»Xr‡êÅkÕ³jû¬ŠF«ò__²µ©'ÌÑ~Emª_Ò”{ò^P›ÀìKÓóÚô|Ômiš eWÚT{]×h¡Jq³ìÊ+8¶„€úŠ' X‡ tˆ%P£jWóÔ~9üÀ­ü>˜}zåM¦-½ò=ÓkJ¡í6Twé(”ï˜Bùz„BaHv8S1–C E‚/Ï댮¦Ây›bæ)ÔJ)T4@­Q:EÓˆ•Q˜CR뉡¤%Rmm·¢ƒç‘‚"Æÿ¨›þ}3Ÿ69 kÞ‚ÑÃQÒK4LœœêÌ“$‚ mà j0L"ÛPÒàèhSÐ#›[ ÁY™¨'u’RÔüîA(ø·(ºA¥ Û[¼XÿrÔb¹ì Ä$ûB’{‰àu®#eQ7¼tÄ4´µ¹ª3Î]ç×=y#ñãÅäpPec;놷N@ÚQAÞš÷ÏŠ¯Îˆ(¡ ½¸Á˜Î™k,É%¡)䱈£¸þ,Êç"{ã>êñn1YJà"n“Ñ}Ü|Hõfó1Á<Äì}‚„‰™Þ˜¨ÄLO”¢žÓ·GZ:ˆÙ«mˆ_ÌæGêž7B¶FJJHÕh.²ì ®b oŽ”©1(.íLlH;0*g¡çƒ:>N¦²Š<Ü’FMiJ¸'on…#&ûzKbñ‡Û `ÜhûÌðŠ·†ÜÞ¦a40¦å—® ›_WÕ¦ÛÂW–jßgŠ|=–)r`×ê#yhƒjP«®€<ó¸Jp`ž­>’„æ‘%Äe¥u PÌJ©4K6|B¯È4ù|… žv,ê~]?öiÑ̇qk—úñS»‚Ã7ù,qÉ[a|¤ŠÙHLYª·­É Æ°J@ò øKVʇñ’×CT>JŒtkõh–ÇAǘ-Š}Ül–g¥WÏÇ´pB4ï [BÆeŠx5RXÒ9ÍQ´ÞQt·)…ù[u¸í¨&ÿê…^{Ý绪©Ö‹U¨É÷EõËâÝ]ÝývÛ??oÚßö½înèdÚÔëM×¹å²oÜJ¯GîzïŽ~ F2köß~¸¾ôfü«Ï~ð¦Þ¦™6»-¾ýTÞîÛó†'7¸aùêìF¿58Cw=Àl>Ýn^~š.ßØÎÿ·?ƇóÇøúLÃùÙÕC¼F™ßRT’_`äÿuRBN endstream endobj 1194 0 obj << /Length 1246 /Filter /FlateDecode >> stream xÚÍXÝo¤6ß¿©/l•ulƒÁîÇIiÕœîÔêÔfßr"À&¨,P`³‰ªþï{ÌîB¨²©6º{H<ŒÇóñóØžYêÜ9Ôy?£vüi9;¿ô¥£ˆ xà,Wó% wî g™:×îò>›/xHÝ‹«%u“—]ÖàGUOšbÈn‘{[¥OH•UšYfÜOUò§¥óŽ¶ÂÜ6{.’ÄeYu–oçÛx•Ý›åGgÁ|¢|FF”°NWë¼ë²”Ì"”îåœ ·‡=Ÿº™þxŒ×u‘'`n¬õœ_*~õ9eô­`µâ¥ÝËèHA¡§ÜmÞÝ£±ª´,D³ÅŠ¢çuVÌNµ›¦©6eš¥(`4b´œoîm'e%ܼœÇO¯÷ôÃÕ¯ZföËrö׌—:ÌaR½÷žG÷d=»¾¡N sJ<%­‘\;œ(©€*œ«Ùï˜FCì'Œ*£ÊãÖÅËOüv±|n–sŸP©Na—óöCíþ<±o²»Ç‚hÔ|÷Á3y‡ÜÍŒ‹9ƒ-Ðÿâ§gM"ž…Ô2ŸÙf]——wÈ4™­¹«ª(ª9 ¹Ÿ«êDŒö´Ë«’¼èèàŽÂö‘¾‹aÿ<\›·EÔv1$•{ú«ªµ¾6×¢¸…¿b ±DÆýÈDý™ ª%“î—} Ô™qogáÀ=X‡bqKÙ÷È@4‰:r÷:Gv&Î/epüÎ å6üOhãUàIH\ýM^&ÅFRmüpå\;z»É‹”Ü¿3qÒ/âmVGqSmê:k¢[}Àu°Ï1öjGÛŽÀ^ýëœÿáÔK‰MÝd+p Nó‡7HÅãáxɽú|·Ž 4{¬‹*ï¢2káæ@ÄÛ×Aþ&yp¿N” wðöÕQRµÉ}–nŠìk8%GúôÆÈ´I\d ÙäPU}9s„?ÁÛ"㺲¢Í¾è­ñ‚Ï/ÿfÕ|¡Wú'vêžÚàð©ÕO´ Ô PùLY8Z3¨Ô€òv¥82Q¶†P$úPG2A$ ^Y?ËùêFÏh ˜EåvΩ«ƒŸ°¬|¡b>…e eCÓø.OWÌŠ…§°«+fEÅЮ)&Ì F˜”'1+|ÂÂp„´~ol5,ˆ EOrœ~Ÿ•Ywº–†–­¨ªZSÔzk˜øb!»»×gJsÈã¼µÕªŸ¶Šh´²²kÍ;m š>è½Î4ËsãÒª¨íÔÄiŽKÓ¯¡0ti¶Ù„’¢má<á6{@@§êt†UŃi 4Ûø¦ïœB·)BQ÷ê—É[¤ð¤ÚíÈÜ!¦Ç µÒr¯~¢zÙÖ,@í|0_ëXw8"pc@=¶LèÙõ£#Ù™]¾6 ©0 )² æ@ô[¤Ù2ˆÍãÁ¾K׃.}é­‰‡ j¡ÐT…¦{^·iJÓžéy۳ÓÇ(Q¡ß_1py“ £‚tµ2g¨ â3sgz…1ôID_3Ó,Bͳ„Û’!lKr]ÞàE»x‡ãß8\\磉ã;¨íb~´wûð“QjË‚‡&‚ß·XÚ£=ª›*ÝèßCr˜§ˆHAsK¤´Î3é¤àVùl endstream endobj 1199 0 obj << /Length 2140 /Filter /FlateDecode >> stream xÚÕYKÛF¾Ï¯à)à`G~“àÖ‹°…ÈÁñ–¨&)“R&Fÿ¾U]M ›¢5 7ÀžºYlÖ×z|¬æÉ]“_ñ/´ÿ¼½úúµ“‰cÎJ›Ü®É93"O¬É˜T&¹]%ïÓuÓ^/Œ4é/ÜðªÞÓÃ’Sû=5üÛXü] _}EmMÍß÷ãGþ£ÿÐÄõ‡ÛŸÁ™¶"YÁœ sz…sYró-úúµÎë Lq,¤bÒ:úæçûÀ¥áéþ¾¤N³ÛWMV]xyhërÞ×7£/ÖÍfÓ\ÃüªúŽD¯ÞÝÆîʺl‹=(™ìúh˵`¹Va¦ù ;¾­jü 6þ&ì8íÒ »hÎa³D :éN2.fvÎÅ_H«Âú¾P!§B\ËbÔO“N áõØ ‚™4d6øïQ¢Iýl¹ëÈ p@àhðÿÕÿ¼Œã«€Ä+!©FVz>¾r\©%¾‚*{—Ä×@C|bž¯/‡<Æ×!æñuÔ>¾Q§Óï œL¦_H¾9wç#üyZLö3Lþ<Ó˜œËs5 (’<OÛ…ÎèfTX™p—˜…’àÿ*ŸU ¦e£¶OšÅcÚ=WÕŽGšæ×ÙÜe hÝ e Ô$ÌÅU9€CUcˆ‚õ¦©¦Œ[¦¤™[‚ù(¡#ìºìúzÛˆ:³³vX?ÆÄ›ÝêUGÔÈ!I‰‹)ïªínS­‘C9ykUõlž?'qI¶¼×G²5µai¾ï ƒØÙ4ÍΓF%Ók’íŠv_-›¢E6¬P£lËmƒçBäÌÏ”Ÿ°·ÇiIKEè™´hKùeø9€ôãç~\I‚õµài±Ü?oêð¹Ÿ4V&›^áqM õK!ñ}Ʀê%½®M\é8ûð×äA„3iµµ!¤Ãܦ۲¨}‰_Ò¤¨Æv¨ëw=hé°%\|&\ß-º ‚ýyzWÆâ£âPŽ”³©ëô{cxpž6º %ç‡A¹º¯,?Y¯žªÅaHåϬÅE…íaáŠàí¨,Þ-ïËÕaS^Rñ^ ‰.ռ߿½yóŠÒ‹¨ý“šWï«›_G¯¢oB9<®‚Wñã[jŠzEÅn ¾œÉØ”F~ßPó×ÔmƒäÀ7!&D 5ÉîÙ—¡V[­ïÞÄ—&ülÕþE·o/»(¸QL#ŠÑÆŽäϺš¸é¿ýâMdH ÿw7Aîï;Kñ÷æ…gùEf–IfÝÿì¾I Håjb†š´¾˜˜ÍˆÙù®m»éË&>Ïrñ²‰ÇË]6}NXo›>Ü6I Éó9DC«f‹W0¾_nÊmYïѬ„ÄbÒíª;òMR/vºbÛ÷ú|äŸv Ø1ú¯ e²ãgt?Ó]Açã$K¢üì™Éò@ÜE¸ÔOÚ¢î5ÁCÓ®0ù“Ü̇X &,è”t‡Z{M@KŠ6Ö¾ª&Ò:þÑ;¥Ÿ“Ö˶DwF•=”ÎÑ!×Ó \A(:RÉOhø±“ãb ^{¸´+ý¾êþâ.ô¨Cá:! zÖ¡¾¨q#~Ã÷ãó´;´e¯Â?è ÍÈ ŽÖý£uLÕ·¦,­›=uŽ; }2/@,4C|&)莺ž|CL+ókÉtÊèé–¶ 5…öЕëÆ´’ö,]ÁÕyoÐ8ah×r™§ØÒL Ó€ùµÔ¥ †ÎÉG]W±³ wŽ–TŒ‚šó ÐÛp˜ÁÄ„«ºÆù(ÝßÔB'º©Õ*íî›ÃfEïîA!êÆ>ÝñB‡Nµë¥xúØó "3À7øBc«nzVðOSl¨bH+ÅÞ°í«Œk¥Úã] ¯Úkcð¨t,ßX: ª ¯¨Ií¾ÅÊGà×½¦bjÒ“,:Ê1a¶ÃúP`—"7Ñ(ˆìÿáaa¢ endstream endobj 1204 0 obj << /Length 2626 /Filter /FlateDecode >> stream xÚÅZ[ܶ~ß_¡G à¡y‰ìÆ6pã´»A 8~ÐÌhvÔh¤éH“Í¢èï9¼h%­¼µ±ò$Š¤ÎG‘ß¹J4¹KhòýýÂõííÕë÷–'–XÍur»O8¥D1“h•.Tr»K>¥ÿY­Wé›OågßZÿÙ_?ÑÏò­·sc¾ñßÕçÛ^¿—f³–Œ)’5WÄRáaºCQ¯Ö‚rlù‡FkŠÉaánvÙV8çêÝíÕ¿¯ôÒ„%œQ"¨N´`D žlWŸ>Ódƒ?$0dMrï¦N¬±Ðª’›«¿Íí„[éD –˜·Ý (·D±¨àDe| º¹”ÕnVY"8_Vs"öÅÜ»f†(k5 ˜1èö\ä]ñWÀi(m–ÀL¥²1nUäûžrI¨Í"å¶yUmòí¯ž¤»¢ÝžËM±Ã[–nŠªYÝïýè1ð;¿ÉšÁûÚÌB®J?ŠD \™´»/·Å+hkš6õ¶ð½ûæŒ,-òíÁwíšc^Öä ™Þ]WÖwAÄ¡l}«9ueS‡'ëör.Ú8%ïb+@ôï…ë¤a*ªÎÁU¾õ¸äÇebË_7Mwð-¿Êðx×À>ŠóJ©”¸ã6èõ{=<54áPÖ ®<¬áʲÉ3£SòÐgT”eÀÉe2¢­þFúŒÀX&€6N’jx ]qšÎk)³’pÆA¶`“)C·Å)?ç*«0$“j l;ròÚÍ¥ÞµžÝFªÜ`Ð¥¾ d2Ê´=ÛòJyï¥'¶Œ]w×ø¾K[øŽÝåx.oZ›½÷Ý,fì &mÊq€zêmÀ“008U×7fÎÖ(ÂÀ)°ÄæF‰CgN”QôÍÍíÌ¡RI$µK€rš¹ù#з?_ønŽK’0il[6†½y÷Ó›¿¿¹½þøã ¶¥„Še°-ð”O°ß~üùÇïnfœD'”fKà ž *8½þëO®ÿr};ãx$X Éç#.E ¦L¢¢§¦mË3Ë0TOU¹-;a^%1‚Q†¹Þ«˜TÞfKtl/çsQwþfWÁq”qÒ}é±x:ÍÜ…©Q5aÞX5©ñª “‚j”^5¡·lç4uÍ…WM.\àð¬jZˆS¨&p0/Rˆ8Ðu€$mŸÕL–€ä”fÇ_ÒK™¹ÀhTE]\4B}N-D*»4„ìDÊ ôµ¼šäÙ°àÔ$ÓcØwÿ|V)¹™h%4ÄFÂœCãÜt#ç„Ø‰× Mós¢ŠSéï^c¸•clñF–yYå›*L êˆWè ꈑWï)éHÿ¸° |Ö7ÛÏÙ¨ (gûú¨ëåÀ1è"·ó crT´åÔî\BÒá)ú1o±QÀ¥í£…ÕfpÁàýÁ‡ânÔÛ~èE“æzƸ´ú½Hƒ®Çç7ŽeÚú å»Íp];?#—ÈYÏ\ç˜VìMÝ»þVMsjÿ@ºJ¥ ûfÓ2ÇW©àxìWÓu àÀ×!rts”…xÄè%9çDgj„\Tmø*gsƒl”¨Nrƒl@U¸ ùj¨ªÆT…þ(rLU|²ñ×mSÑ.Û.ÌßØ.ïŠY¢BÔµÑàÆÄÖ½”7½ç¼ÞŠoàª^œ«Ô¡á*HbúȺr$ëúkØúrèž­Ch Ò3dµô‘¬ÆNÈ ƒd…QOVèõd…ž!Y¡ß‰„î1Y-õd…!Yqþ¾ïž¥ê®Ä¥=!ë®lÿu©·nŒø˜6pÀN.‰…,6Q‘žAÁhú½_s«;OÌAn€þ»K JnW™LÏ+fÒ¢ˆyÈdßqÕv>ìøµKXºÍNAËy÷ ‡â>„œ¥ûssô­Ü_ÚÇUÀ]w.\Mò˜Ù°ppm˜à#//»;7•G<Äú“°B¤ßﶔŴ õÊ¿ ëÒ2zU™–õ®D©¿•»K^ù¾ÁjáÎ¥Y«5¼DX ôù€§]¢ô²žÈÞäuª›]uÛfÍy^Ø›ÇÓk‹Pgד:;¾g°>¿Ï \,N€ôˆ0E•Æ…%PÁÊZ9!“Sþ™oWH¦þsi0ÎJXBpd¨ÞT©Õ`Nœ§ÂDQ=¬´B-”òV ¿5a´s†u7ÝÁùl:£ƒMèh‹ªØ:¿(„H7¾·¬·ÕeçJx›ûKSëÞÚ£ÄNxcï9æcf5œ1^³P©.…ïFU§§¦-£ÔÎ3âì~øÑáàÝÀáà-¢”õä ïqtßk¨óc˜ïÓ>µ¶“8Â{‘™ÓÓ¦O^ÍH’DÑ~Bô5sÎZLôî܇¸O¿upÖ{€à¨fÖ$‡9:ŠzâÃúkävàðŸf–dúy—#wùWø™øe_|1#Ek®pSùÿs9 šµ²ï%äyÞåHHH $K Bf”£Î»°GD@à²*x/¡Ùd—çL?¸¢¥]TCF(ÌtÖöKpr–g‹€‚“³LOöw>[VGj½™&NJŽa£ÒÍh+l2û‘vR‰þèêׂso»\cWL•Š6tE{ÏãÏ ÐØ„ŽÇ\xçŸs-àxð'aúÝÀÃÔáÉÞãÝÀ£”h„ 9_R “9¥‚ÈYrá?8¹®ºð-—ß»|ú=¬Žî\`¯c]ßÄÚ(LDç㧱æîP9Äëaò±Èk_~‡ MXËÒ±f˜OÇ_-òpÝ7±4ð¤ÀÄû8VËÌÔ§|©¼sþAãþç+-Âw:lÅj¶cßx¿„ 96¹ìƒJÞúOØ:æ¿â>†ùøSJ„Ä„[y0"Ê\µcøsI{ÊCé¿›œNEËÌe?¦øà|bÍÂgWn0|Ž uF:fµ›[ "$Ò¯kP‚c¾?çäÇSår@w¤ç)ƨ€âÒóáÁ% 6 ùèZ{cáSn£G³Àâü”¤† endstream endobj 1209 0 obj << /Length 1179 /Filter /FlateDecode >> stream xÚíVKoã6¾çW{’±CRïÝvhŠí¥‡5ÐC6Y¢c2)èÑl°ÈïCÙ’¬4Mnz1GÙáp¾™¦Þ½G½ß®è3ë/۫뛜{9ÉžxÛ½Ç)%1˼$N co[y·~¥…T6AÌcÿÝw\‹[y‡’Û ¸üø®Ò}âÂèGv¯tÃõéÝænû;ä0FòØåUd]}°;Œ’(aóí®<ˆj¨Å˜øíEæÁ'\Aq‘Þyï=sª§»Õ4tÓK­ºe}z}”åí·»é ®o¢lRmØ!!¼€3ÂR†áúƒØ<¦þ^×µÞ€ïƒT÷¨úùË…Y×(íœõ½P¢-zQ™s.^À1’E¡;Ýë3ýJc*U¥À¡3¢X.PcË÷ãDc(~¿*Á£åþ|òàÓ,ÀÉs^ùÝÔ#˜8|´ÁŠËÚYã-ò:«@ItNIÎ=÷´†ò¬Úå?ÂvB[ƒÔ¢x(TõÃØíÂnìj§n…x5àìÿ±~óXw¢)̘ýwûû³•´-=éh:ËÅìFÈ_E¯kúÒ`®„|Zó´çäKÇ·Nôg`ž…¾ÒŽ²u›æ6,uyÛb%z–磙Òk¡XBìlƦ\ E$IF;ÙaŠ]#Jù•R.,ÏäÌô¦!¤Œ».#lI\Z&‚Ïcñˆ–M«W7H9…«†Òu°+ÒÜþÄgÝÈaøÑŠn¨ûÎ;§N-´¡h¢’æ¶#CÉl4®ocS´8dGSÈ.#!ç¢dÏYíN~1a1G¿?m¡Â8‡˜r ™e«Kè¢Äa–`a‰-¬&…5Ÿ8úFêšZöçä…líÜ)ˆµ¾žœ 5âÙôÍàI…êlÆfJªq£‘¢j3Ô¨0ñ¾mX쟂Š ,¤FÑC=!´Eôøv™XYÖ• |žæ0966H6#X-Â*ÌÁxz9ô£ÕîÑYœ™ìM= k»oµ0˜"<—ÔÈÐ =ªÒÄß`Ÿ}À&Œý^¨Ê F6W£*6œú™-+geÁÁ!íÜ#Ð臢Å8±)†¬ÄÌ1òKÝÂD4ZUö©0{µÖMGÖü"ÜLu§Ï.Ù#¦„füe" I–†£^ÿ…Qc4#YÂç³6¨^¼·MOB7i<‰N-ê.È,IÜÉHaÉ™Â6ó[TÙiÃÒDÓL …ÞwéR›Zô¢~\ãÖ˜¤ÙÉÔÝÒe,0aÀÏt„ãIž0’F|ŽÚ_óÙ<~VÓœÐÿŸ{ÔÛÛÇ#]ƒ€a:¹“À¨C²=1è‡9N¬|hÅhVô«|2Àø!çîŽØŠœ!ÙºÑ\ ‚oõv“Y>7[z×#myá¬aÔdQ/"–GÕnØT[wÐC]¡¶h„ââ_€9#ü¢ª¤é¾»¾•Mp” “NݼšÕždLN·T…Â~¨á(+ŽÐÎܤR6Ãi„•Ä&NÀcðo J¡çyN²ÌM ËÒ™Õ¯Û«¿&÷2 endstream endobj 1213 0 obj << /Length 1964 /Filter /FlateDecode >> stream xÚíMÛ¸õ>¿BÈÉîØ I‘¹i ¤@·ÈÞŠÎm2Y’gÈ’+ÉIgùïûÈ÷$[²âx>ì=‘"ß÷§Íƒç€ÿºã´þãáîíÊ–ÙHFÁÃ6Ê°XÈ Ò1“¡²àqñð’/Ÿ~zû£•§ † %‡)ÚºL:‚¡ -“ÑWﻢ®–kEð×Ä-z±):üÞÕMNÕRñÅç¥ä‹ºü¼z‘gl¹µY|èðUR–õRêÅBÖ½ÐÛC›7tT÷ôÇ#ÑhÑ$ÕsŽ˜ê­ã>XÇ’…* ÖB0«Imú’g‡ÒAÊh‘»¼jQøüìè'å!oñ{ÛÔ;·Ó‹vìy6à8©2Ü<79°ÑL;Á¸\¼Ï²Âé^¾.­À…œä’ƒ\°Û%¯žc>áuŸ§Åö9HpÉ ² 8±ŒÒLÁŽ,ó‘‹pÆ|šÙØô0y“W!îê]‘Îa{Çaÿâí JÉbÙß·ù>iÇ! %‹Bs-¢CÕÔe‰¼¥/u‘æ¸ßÖ^[ªW îÝ Ã/ ßKTÑÑÙ令¨ŠêC„ å‘¶Ý{g:*(ëÐÑzÝiRºí †›4ié\ÍŸtó‘¥8ãÆ\ZFEÓÐ ½ŒÄHÝ“ë»Ãí¡$Öº¢Ì[Ü¢Óºk'QÌ£Ì1 ÕXfÿÌ»kˆ2KŠ4 UB»*ϳ–kÛäø}jã]Ùo²|Ÿ£âÆ—YÔŠ3ŠCsŒÃ>v(S M’ŽrÌo1èxàP‡Š8„5Ùx:'7ðÐE@Ú¿Ô-Áö,ª‹p1fQðŇ /@].­­ç"¸+ÒC ÷û\ôÛ\Ò@FÙ')m¹uÞ‰lÄ´½Ê…”²gÙÙ  I£zkžLpùÒ$û½7 @í’=Ý ‚¬vQ4âÕÅRÄxhÇrä1*qLŒàY˜áe†ÍIHÂ=ų?Ç5ËA黢ê!6¯xžT¸ÃŒ÷^§eá*ïi&ì¤ÂzÑ‘Áz¨ªdç)EüÄÕô`6·%gÓhg·ÎæÎðñÏyS¯‡8ÄÄ6 (ÿP åUá"¬ltäÄyˆ—-äŠEb"r§/Ô}9rg¹SͳøsÎ gF Œ:ט/ÁB3€­fi·pÞ¹F˜”ba¬‡„0Ç“žôĽfX ™cU¹(]–ö¥õÑc´¢›¤lkÜmHEmÞ¡r%XEãìžMžvÐ,A„r¨¶T¯§òkPäI»êY¾ûçÃÝïÜ)D 9ÀD&Кi‚tw÷øă .!ÌYhMðŃî À¬q¡Zÿ¹û7öÑc‡ât{T±´“&òœ²LÚø&”µbÒDcÊ.mÍPA^®oB5†ÖcDuCA1¦r@-Ô-¨BÿÁ ì©îòÝ&ofè†#oBA‹‰uÑI'DÁ:º M˜È4TêÍ“D5¡k´ªö&„mÌbeÆ„“vFX%$™›x±1ãrâÅe]ïg¨‚1´º‰+%ôñcªÐËÏåIÉÚO|OÀ‡žÒœa‘‰Ç‰êÛ¸¼Ù·nï[·¡V‰ŸLBþ{·+Z\O{÷½y=Ãp©Ì¹h­¾A[‡ üÐñL|±à©ã¼ú­‚gMò·+¸¿ǽ´ÿµBÒ”)ÝÆ7Ó‘úV÷õ@^7Jžÿ¸¢`ØR-Ý¿Á&'ÒºêÀªkª­Ðò³®ìÙ•àþçM6Õ¸nèеER†ßI>Õ¸l~È VMæÈ÷~Bˆ±çƒÕ»Èÿ’ݾÌýÜ 8ñž¦ ˜B£JLƒILƒ­‡ÄÁÖâ¯1&Û)DAh’áÅ>ÁœÐÔ2#D×ÐÕy¿öbcJÓÞC¯¶º)ž‹Ê‡¯“Qc y…Ѻ­‡ß´¼î†ßëúõ,Y2N„ŽËPSä¹øa¹†\¶xó ®ï‹Õ§'ÜÓÇå¯Ãîqã'‚Ë=.ŸÆà‚Óû¯oæf¡ô¥(³Ðüœ©HÌÿ¨Ösù8Ãæúï¸>n!û7¹æÅ[Áaðu…ëG*O‰RÄ(ó^…øÓwO„»„³˜à¸Û|}z3àë+%ÇÆ=zÕ¡ÛºÁ‹®ð1c-¡‹O÷^T§^7ôº”LK¦æïÆÇG˜\Ü÷N—ç¶.Òó4Řæz 5åA\Ń¾Èƒñ ˆÔ_z)ßy| G¡åÄÝå˜M(‡ó†ï–\d=½o¾óx.çZhYy• áEAÅAëó‚ÌÏJ^–lâFïÝT®úLjé{aD~ÿ«ÈY‰£2âŽ\‘Xáþ ݾ$îw;ü=cúpHÜÒ¢rú[óÿIüÏÄ¡ =@Ÿ¶gíÄžÔÜ=>Nq&«Í*]eOm-x²|3±÷¼‰ xroïáѽ½è×T"üíõX‰~§£ÿ2z8ýORJð„ש¡˜Ñ˜÷ ¦ endstream endobj 1217 0 obj << /Length 674 /Filter /FlateDecode >> stream xÚåWÁŽÚ0½óÑž $ÆãÄÆ^¶•¶R·RÏH=d9JPHdÕŠoÀÅ& PEí¶=Ù±gžŸÇoƶ¾YØúÜÁªý8î ž±Œ0k<·€3„‡ÄbtˆˆK­qhùÝy¶é9”Ðî3¦8Nsù1ò}/<Ò‡Ô87Æûj 0Ý×ÞdüÅŒ<–€m^ªW}e縤Áª˜ÜHh@­ô®Üëè€Gjà•žu®g1Ò×;çìEL\GÚm$ '¤‰ÂcŠ´ÛLªI»7‘~Ü“»tÞ[KJŽ Èåä´áÔÅó‚V¿I±¬ât|A3*‚Nó)Æ2ÂoQ`5…êÉWî¬5z€¸çêæ»Ã¾*:zÁ5pcÅü-¥òOËŸý/ò§‘ü)A.ö*ä?xòøÉÂ)vÈ…(ZŒ!ÒðkãnÔsÅÝUð]vòE”Ê^†qgi$jî%ÝdIr´“8M£Í*Ûæò3ɲµìesÓr›%A…òklò=Óã˧lçÆ$ó0[qz/r÷*ÛG?¶—ÙWSF󲤡ÑNiif½òßÝi¥Ì„Eœ„÷µ‰·-¢ð%‰J–~Mçƒlýy¶ÍA¸8(EìÔ¡?ƒëVªºu¯^^Æ×cÆF“m9°›ÜÕ?²õ^g[ã<•\|ßÄ ì©=³ÃIãYlÀSã¼ãX¸ôE¿pê‹3!ŒÊ½+R'™¾[r’Š1“q4ôˆž„y¦²eš’¾9!Hy\7ÖÿôG¡»O3kã§àB¤ôvÃü¬÷ø&?ý:Ga·£V¸¸­ x­ ÐVPX+(Ã#ÊIîk%„ãâyÀ‹Üˆs®ÊšË§qç|b”. endstream endobj 1223 0 obj << /Length 1914 /Filter /FlateDecode >> stream xÚíYKãD¾Ï¯ˆÄ%¤§_n·ÅC‰E !„vv5ò:‰…cÛÙÇÿNUWÛqg<ÙY68¥ÕõUW×Óá‹û_|ÅÃï··W7Ï2¹ÈXf¤YÜnR¤L'za’”I•,n׋ߗ߼à /äç׫D&KÁé÷Sú)ý~F?hÅ×/o„•,Kþ—ìÈe%8Ó&fõ×dGÄ[›¦%ˆVÖ}Ìþ+úY<†û"&ûò:ÁO? „åõB}€L2’éT!œ®/ ÉÀÏ¿áä 殬‘óñƒâWç5/8'ÝG2>¼çJ$ÌdO»¨:{Q1¹¨Œù 'ßsQ1ÑQøÙ›©ºYl¼…šØ§Ìj5g üIÚá‘vFSäñզǟdzæÜÿGÌ?ùßüÿ}æŸH¦¸Ž­Î›ÿÍ3k&™eô¸)0 |Ÿß^¯d—߻ڵy_65ÍÞ㸣 ‚?/¶n}¨­ü”ïoži;AŸ³ÌXâÿ°S$Î;‡#³l6´â‘ýÀôí¡ l$9te}O¬£Ü(´aZ‚g]vÒ\}w{õç•€U¾ ™I–.4·,%»«ß_òÅ6!0•ÙÅOº[H–Ù FÕâùÕ/s™8˘ "«vè,Uæ"  Œ¢r::þ‰y„\ôÁ@ë‚/oAu"Y¾#EyÐè«AÛ®§E×QÛ~°iªŠŒcÜÛj’™¿6?i\N¤_ÙŒIM‚„‡!öRÖEu€B9ží´xç/Ŷ_ÏÙÆÝPÝÝ—¯Ã!œg†¤;s.¢»ƒ«ÞÀÌåDE¢™¢õùgЂ}þ¸´ñùC °wèÕtþ(åë“—\xv-cÅÝúg1öèÔ8!¿« ˆÌè8&#ÇÁÝz.aJÅTjÎ;Žµ@“BºSLƒ~TÆL +9T^!s9Ó2!Ì%`èN@Á>%®¢ã=¨;[®›]>èËüí·eÐ?]Ä[WQ©äñäÆäI Q¬3¬öyסeÔ‡!!åBtÖ"4ZM¢À2ƒ0ø1•ÒÂs=H15š‹ BMdD!>R>é g“]4M@ai:_H­'_°°1‘V…huèPpÉ»>¬Ô®óu®QŸƒûiŸD˜`:Š_(”m:fé·3âj¸ø(­` Ó˜'Ðý39H¦Ža à@¶‡NmS- Á‡hPÉj5º~·mU¸]ëV¡²„P&“줫v-ÖuÖÇ1%Ó¡„L„ÇÛ¾Íiº/]áˆÄwyxd ìbn¢Ä\ªP-„ ¸¯Òé²ìéè n¾€þ ¥f„˜pÑñu&_¿ióýÞ¿hªŽ1ÜÏÊðKJÇmâŠCoÓ½É]”å!¼çÌ1•Ã„Š3ÀRÙõ㙡]å šî±8W”î•‚ôT;ZÀ/ø»kZG[Ý>/œWªAK°_ç;×…³Zz³-‹- ×®wí®¬‹ñÔPŒ‹i ±’I=Úõ .ÔŒ±%`’v qE¤Ýœ4û`yX†H×gT~®tjHÇŠ›åk¬Róêà/ÃâëÄsÀµwû²È«êíäU×G64a©&­ ,­LLMª›y­±K¢÷­Ö~_•®CÓ—}‘jø$"U0[9\ mYppþxÀÁÂ@ OÀ‘s²4Ê>HiYª 0z(­˜1'Õéeˆ BAÓ•Afürº=Ur+ÙBEW€èPƒv ú Òz`ý¨´+½¥Ì< }e‚8ê=IÈ¥G!Ìâ`³8ž8’¢øBIÇÇ…ñ®> stream xڥˎÛ6ðž¯ð-v×VH½,5m€-Ðí5rp…,Ñk¦ZÑälŒ ÿÞÎP¯hIs‡óà¼È™‘XÜ/Äâ‚×ßv/^½ “Eꥱ/vÇ…Œ/ÞF‹8Úz~-vÅb¿Üt³ÚøévÙœ³\!/*£ícϪ \­Ê¬Õ¦"ÒAµJUDjWR, QL¥[èU5 ‘•D±Šoµ #úÎj³ºÛý¶o¤ôÒˆí;_Z GQg€µ:תQUÛо=1¡ÉOª¸”¼ë3—¡õñ¤óÓDМێ|-µâ£³ªèYgÌ3—ÖZ„ÒY„bd!’¬"$4êœÕ?$äeÖ`(¢D.ߟt©mª¦­/y««{̈Ps&DnêZ͆¬9›ª AZ·ɾ"¢9«\ÂÇŒ"¥’»¨}‘hà#×@dÀí» Þ«J3¦&ü£.KÖU_;å3²Æ>I\Hx‡6ñ` óéŠ`UªÎ<ìÚSÖ”Õ|ÄSßWö¶¢¨F^½Måà!øQê%IfYs>×è¹D^ºMªA)iS†÷=Ûøqä%qÀÆÄýç‘â`ªòÊ16=så#x„;ëòõ~X4-VwŸÊeš™ÃB;v&•A§|1ŒîªÈ\icu(SÎ0"ŠÖ¶V:'Ö8biª{{-aòWçqú©Ytp`w¬ÍÃœÙünåR¡Ÿá½æºÅP#nàJ$ûlA®6€n¯gÛ‚›KÃØXWAþò¡À­`Ã,ô,@’ªZÁ›c '>Øq½®ÈU1¾þ(ï$$é[~•™}«[ÎNöp.š“&¶®éÂztÒÖ—Ò{Ö,<{(?é>`X8¤ÀŠË2vº#ÒÐg~¬m­³êþRf59HÕÆ^hO«‚øö5ëÐùjˆ©{€éÂÇ ´uýØ­P‹üA• ¥—„P>|£ðÉ¢/Ð ·{½þxGðÏ´Z~ù•V `ƒc1´ÜÐòqÌ.Ëÿ;Sî6#K²Äžø©­?°¸ ¾Kc1 Úê«´®Ä,6¹pK·)º¢Æ ÄîG£À°Ã Ê¦c¬z‘¹èZÚ÷f x2›7´î±/îõ+)îlsÜDpý]©B‹}‘z¾ŒÆwñÒeÈQ2¾IïW0)hè4E +;lÕdxy¦äBBP6!¶4´º^üßÛW„Î`85öVÜäì!{,^Ñ}$&„GÀ”ØðÂ… c9©Äó:å¼N9Ö¹étMmÏÚ0Nð&ø#$kúÉ9ùšnLìÉÈ»ä$•ÚÎm›érb»X?¡jÄ—¢+¯ç˜ÓûµÓØâôÛ"<ë¶|Æí`Öíç½N×.“þ4Oû|›ŸœÞ[´"÷×οîÜékM/Nâñc}7ü7À!ƒ ,N#¶ "D€® âÆ`lÏKㄆ«9´ÐŠ‹ÙzÜ ITËqKK7^ná/-»òè<|Ê“Þ)fçf?pc³mû)I©+1¸¶žvOÅœ&@2%¸¿§n”j÷sE¿¤Â:eÏ¢9QŸ°~eå…†êK# ð¨nZ¢ºš¼±¶;‰‚™¥ ‰{ð£øýRCT{ÇàLäÁÉM6sÀÐ4ä±-³û¿²€® ¢eNõÑ\êö4wCGfl}j¦°æ+ý'ü༅({5`…Ðik ²C€!ü1d|G €Ôx Bá/™«Rö Ž·‘Ç+#OÌ7nsÿË4DÿX[ÞgëÃ:_“ÎÜO‘Û‹¼ß‹»Íøt rç­RŸuƒÿLÈux9ßÀ¥ÈÖR^Ž»x´õ¢ Ÿœ7é òÞ¤_upª2›$ñR9é ßì–œq+^Lªä¼“‰±³vÆØÁ¸1HÓøµGÞ«`€¿Á.©‰ü¾{ñ:Ô¾‘ endstream endobj 1232 0 obj << /Length 923 /Filter /FlateDecode >> stream xÚíWQOÛ0~çWä1݈ñÙ‰“ †Ä¤1i¯TÚCA“I ”&Uàaâ¿ÏÎ9iB[`L{ØKÏ9Ÿï¾;vÏÔ¹u¨óí€ZùezptîGNLbÁ„3½q ˆˆG!a> stream xÚÍVKsÛ6¾ûWðHMBàI“™´Sw’kts|€EÈ”8$U×ÓÉï Ò"MÅqrÉE»öñ-´4¸ hð×õëïÛ‹Ë«´ 8áyœÛ}À²’äEäYAâ$ ¶UpÞ«ºÞDqÁÃFü½a4”ö« ûc'Q>Ä€;¡7, PáNmâ,üÇJ¤ÆóÊ4Bù}ߊ‡z¼ÂèúÁCµ­ž&Â[*}W{ÓÚ˜Ö››í'ˆ,bŒðÌ{?¬bFá:¹S_(e…@˜Ü«Éd›ž¢éF÷ª’ªO@{S×ÆšÞƒ{wÕdJï¸^^ñø$Ç)#eš`G8Mð¦ÿ6Q€âZÝà.zë$xƒ Åå·w¸*ÿ‰ £o]Œ’4gó4Ü®@¿b/Çõ«½bA8 Mç1}Ü?Ÿ7ÓÊhÜ«þi~.OBîe+:1Èëo¾Ì"¡ŸçÃç-n<Ÿawëµï¤–öꟈé\iÅšQ ?ìíZìM‡ÁZ5¥üØùrúZƒéL> stream xÚ½YKã6¾÷¯°;sø)ìbd±Ln‹ô-4Ô2Ý­-9ztÏüûT±(Yr«=3hï^L©\ª"‹õøŠäÉC“Ÿoxº½yÿÁ¥IƲT¦Éí.J1›º$5–Ie’ÛmòÛêCYùÍC“ð]o¤á«ÕU׬…[Õ{"ÔkÁWOøã¢üøë-=üì+ßä]YWëßoyÿA»‰>žl„c 0(úÉ·åÖ·ë2bÕ}Qî¾”Õ¾ËU÷è颮ÚgÓENÆÈ!WǼɾóMû6]åQw&'º%¬ÕIsÊËvL7ÿ¾½ùóF•'"QxœIRå˜5&)7¿ýΓ-üùK™Ê\òX‰d™ËàiŸüzó2íLr)sVQÆDÓæm÷R©æŠ‰T]C©æ)FΕÞ÷å~»°2c©ƒ=êûÿú¢‹&'&Å%ãà!X6ÊC³[·ê[ôe³UW¥@?AAâÓZšUÞ”ußÒ¿9nqØDø·Þ‘6Áòpr ð~lê·-[oÒ,]}ŒÔ"oý\ ÀIóùlÉ}ú" tæNöÒA¬cÚÙ‹þ!%ØUæ ÍŒoØ*©3JQ©¾äR[p\q¥†3'æ:G÷8Ój-3éU”:Fss­U½õ ñ‡þ–ºkhUÜ00jÝ5õaA«L™±WY«‚ 2©™km‹G¿í÷Këµ°^n®¢Ùj–ez®ù_–fcàCÎÔÂÆ@tju¨ÛŽ"ïE ê(H“²LØyx=cȿIJ°£qÌøR¶4vMÝ?<ÒË')U}ĘláQ¿#jYýZ˜Õçã~R‚òû‰OøãY˜,4›Í¦óãv[¢Ô|a&ùZò˜žÊ}~ór‚Áø°«÷ûyŸCi ¤¾ é¤ óËë0ž»?Ô,óqf3KÓü[Yû"`c@ò? ×¼‡Ð¿ ¡Èÿ¹”Çîî€ëî¡|ŠáÛø ‘~˜}—ŽyìÄw×úî®ì0¿ÖMû‰>ѼO-éëò?.è‹Ö}÷ú|çß—Û»}‰Þ¾žÎCü}ÁO7)D-离 •`Ø……Ln43ÙåD. N! ‡,,²7¥7)!{dAäó yŠ²ƒäv ¸cÆÎt¾–ÇÁˆ)·WÑjADffZÁ¡t:¨XN_Eg˪™ÎÑq| ãÞçCì¶ä3Õ™AìÒDRMcÄŸô’9+ ³Qä– y–t†ù,x"yž¦]Q8"U¢–Ž7Õá4BQ*f·„ýgzœG:²Œˆï¤Ì"¾CJ9FÃS\­>îâ—Á¬ÈPûŽÇ¢d•ƒ„ Qf‰{B©3¿ h¿"ÎQVÕ6dô\€ësÚÐ…š£ßûƒ=‚Ì4è!j÷4OöÒ¬ÚǺdžÏ÷ÑòøÝ>}ÎÃŒlN~³-AI äI¹>ý?Y5¾óÂ/fÇ{,AÁTпThx€ÝÛ² iEÝ4¾=ÖÕÖW…'Ú8qx‡oò¶í~$vÏ>^Æ©¶‘³Š\ƒ¥pa >î–Ê­ÈéqKL‡´4Vuü{qo35ì-pä}’O«4Šè´ŸÀC‘ö¢†rpl}1Ž4ø´°0ðæMIG ìÈ‚$ ’¾FbG°ÿgO SRŽüƒòD¦3g¥vtº¼”z™RŽ:5@45†Y`­€’Zz9 C†Ð¢¡¹€Sma«•!^ñï(ÈŽ†ŸjÔ´æÛ…­8sä唆YÊ“4l{SJƒ=àªP”qß·È&êãbÄ ®3ÁÇjñ‰‹tA°cRŽô'Îe§wëXUô¡$A5P8Äèîì˜äßçÅÀ©ñh7GP¡ù ó5` !¯´gÈÁþ9â 9Áßt,­ÇT& ô¼i&@¥%Ò)¦À{JD ‹ˆ¢2Ãø¹X•¡êjc†ŽÕM׈æa¨[a€U÷M´XGš>¦ex9ÐÅh9ƒÇŠxæŒ ¢Ú"X^w?c¦=%þI³¼m[eNf§‰½fv‘‰‰«àÛ ŸG‡Ã—€×ñ'‡#í-=SÿŠOèxïY9œª¡]añxª?|]SøN…X^˜±Ï < ËâÁÉ: W+ñJͲ–i5f 7\›±I'ôÛÇXËèÔŽP­È=ø+ñ€;Lœç³[*£ÒR—{‡p ùR´’oj§š,ˆ2 õµ6OÜU”jÇœ²s¥¯Ÿ®ˆ¢9X¼è¬$¥˜ïÿíÚáU_èp}¸oÁ§ ÚÛ瘟ôìÒß1è[·#m‡¶L`Íç…jXîäƒZ–â&&¨8íÂDÊ |ø0™À&cŸ ã©> stream xÚÝZËnÛFÝû+¸”ƒh:ïºj¶hwE¼k ƒ–興,¹• ßsgH[¤HÕ‰&-š‡Ãá=œ¹¯s¯Ä‹w/~¹âíõÇ›«ï~²,Xi‹›ûB8ì…5ŽIeŠ›eñǬޯoË}s{w¨×ËÛ}ÕÜ–ÍmU.V·ËíCYoÞrïÿ¼ù­Ð‚y­Š¹,˜öåÛ[z½)ßW×s#M_Xšzǯ£>öö»úÃàíÍvÙμ"ôW÷ôâ‹>äH Ï|Æûªzü¬MØôö‡mÝ-:ì«}éët?òäû(aî³Þ¾ì0Ž¿bìëOõwWÝowUÒ!Fÿ²ŸöüyªûvŽ¿¼oªÝuúÿ¦ûØ‹ôgþîóPîÞE Òê}S6iá@Ycçút"ôa¯O¿êUÉ‘K}-Øo!%}±¿ûYû#¢iœoŠ¹„Xá“Ø›¾[;[”ëõ]¹xŸî  ¸Ùݧ$ªÇ9†2à ;ÕÒš«Ÿn®þº˜å…(¤Ö,¨BZ\¸+WüÉ‹%žagL_|Œ+ É‚'YëâÍÕï#Gj‡Ï Q”ƒ¨ˆ‰sÁÄ É}P똮šu  Úe §fú°¤‹P%“RçUÂ2)Ôà€Ç0%(¦“Y0gõ )Œ€Á\*0ëû ‰¸‹RQ­¬×ëäwGþR-““ ·¤Én ð1£ãû=nÁæÒ†ÙonҀ⻞+ë[gÄ\çŒût›¼ƒQoŸÊÍYw$sÁúBœ’—š ‰ QÎÈ3þ¨p†d¢0LTú>æ„;* iÎgµcׇwG/ ¨785=Økä/§¸Z¸.ÇÕ’§0pŒ;î“©Ñ©,Ö¤‘'œXùÓ©G Ï¢Okæåf9â s%SÒœÓMÃ7P®æ,{É&„QŒkE¹p.E ‹Ï£ŸÔIìT÷A'|B„À¸S9`%—ŒS$9†õ I £@‘”E ¶ùãñðŒCXT¤N‘ävÜ#™ YŒI:š60¦IàÆr”ò)G)÷œ£0—r&㎧|›‹ð¬ËEܶ¹ßr.wÉ–áU&0ï5AVÖE`eŸ“#ÍQ£¹eõجæ´øèqWÍ·»%Ô¨ù lV;û¸ª×­”fU¥uûj±Ý´â:0Û‚¹#0Û‚¹Ø~Üî›Û˜ö,ƒž½©7‹j$ªÀiƒöçù.¢'G–ÈÜ_hìX`íH´ÞŸ%¼*0éUPæDtŠðâ<8Åì °ð>@&Þ3BÌ pj~°Õ‰«$8 Q€Ëq•´‰#ãN^Ô<ÎÙ,¨Hsάi"œ8ÔûGeœ‚‹ç ÂywJq>z'M¦0‚™X'ö«4Ddaø¦×³rÑ óÝ©<{ß싦BÝ;Ÿ™ÕMzÒ­ßnÒZ={,÷ûèéxZnƨ°W îž ƒ•jÊ›Ü0¡.¦¥š('²– ½á2 ¨1ÌÑ}òÔJarÂUíE¾.ÀQ“@uÝýĶD˜ýºIS宩‡uÙQ"š¬ïÓ‹)âb@m¾ôhEÖMSåz¿M£ýcµ¨‰ù$<=)±’ý)'È´pq‹Ã÷H™ò"§LfT”DÜá\u©<3NåEj¬èƒNRi)žr^«OÊÚœû¾B©7CÊq‘¤’î\—18Ž0t¿(ã€'^Ž ÄÝ]]]SïöZ˜YT¦ïwÛ‡¨ÔW¦Q—ûâãm’׬èg†ñÔ½ÅÝT8ãŸQSè»,ªwU1IB¼ *΀ÙÅ=ÌñhF…úû@¨ÒVôÝxIŒ &EL¢s‚‡Áá¾<–ÅŠ§¥ƒ£Ž#ÝÆŽ# F;ŽÞ"vØóYÑÁyu3RN3©^bF*p$•f¤`F Ìh¢Š}3«3 jª5ÌÀŽF“¢Fágt;Ò¨ûŒltªÙM˜, Î1Æ;‘ ¨s%|PC+îú ôËã(Í´È*ôãåxË‘ª&}þÇ0~ë8LXú~Y€ã`¤:ŠæEðÒàUP±“}Щæ““2¬9ÑGo(ÃÙSLàýà|'Z(’œòY`aoŽøð1ìD«QNê,ÆD¿\ÒÆz¨.!5CuÝï5*™z¨Fž»p²ý=Œ¦^#ME©q.6iê¹]@e»5ýš.qW©ÀÁ±wU™ºJŠYÍ*‡²…ã]k“Ö¶p˜Û/VÕò[Š¼ÅŒ+b§3‰ÂÌæñФgýwš]E4]{ÙVΘ;ÓYLG#B*FéÚ –®ƒn(M »¡’‡®J›U;躡4îÀügƒQÿ3W÷×BD)Í”Gé¢óíßD0½E°Ä¿?=¹½ endstream endobj 1120 0 obj << /Type /ObjStm /N 100 /First 983 /Length 1552 /Filter /FlateDecode >> stream xÚÝZMo7½ëWðØöÀ%gÈ0ä£N ´@çÐÖðÁq„"h ¶ ¤ÿ¾o¸q+Yk@Zm¬¤i–‡o†Ã¥bŒÅcL. ¾‰\ÔjBr¤ê"ZÙ#EÇRL—IM(N(›¨YáàJàr5Dû©ºÚ 3C³ÌŒj–V˜[¹$“ð‘ØŒ%|äb¿&Œ/ņ4eeÂf´¨YIì(#Áç¦SqD6ZŽ˜Ìpªš—);JÑ:dtÈjSÈâHÔ<Ë0§±`ˆ #Å<‹+•[…TlfBŽ HÉ ²_¡³I€-q“ŠãL6 ÉÔ|pÅÆPX)Íy Î%[¨p©6]©Žk2¯T\ ÚôŠK±·’]¢h–áPê,ìR2\c ŠAU 'Ñf “F³¬“fó§È +µQŠËÌ—Ê.L2–=¸ÕÐü«ä2¦9kë™ÑÅE,…Ë g¨dØhƒ…yHÑåƒI M0{“‘`öÄָŶFeI1ÍЦrµ6èIh¿&£^2)BJíWqRŠùrK-6¦¯ÁÈJ ³Ææ S²5' NS TÑlÜ"(kn>ÔrZš÷XP­p2ÚÂkÍfË]B±¾ x1ˆ!!"L’¸Â¬”*XkË®ä6„¾Ò[©®¨š÷¢´1"`*ýŠR«ÙêQ’ºJ¹YI®rˆ³““Y÷Â#¬3¢ûµë~ûý 5¯`£Hõ¶Ö‹Û.fOž˜¶ëž/?,¯Ï>^^Í÷}^]®Vóë…£þñÇO«—g«ËÕÜÅÖ0ëN—‹•;9qÝ)&m‹ÕôN-öôî aÐÇ0R÷êzyu6_¹s˜qêº7óO+wçD÷æïs÷Ïù þ,VóÅêÆrHshÖ½žß,o¯¯æ7}6jm¿Îß½¿|¶üäÎÄÐJèò½-±Õ¦øy„ Ñ:(Ô@Ñ=b“!åAÄšd— \Ãé‚ØV¤†œï,#DZÕlóØÊN؈Ö&Åþƒa¾qÀ¤ŽÇ„Ããc²N§5ÒŒÇD¶1á´&ÝÓÅb kç}`þܶ)̺³Û·«öüËûÅ_³îÙòúÝüºÝOÝÏÝós›¸0®0¤3Ÿ©¹Ul1Ùû\³çX ö´at溗Ë7K‡eùîæöí ú¾_.|ôÙÇï ›UË{d ȳYÉWÄ×£d «F$ ¦Œ ²Dˆ> "R8n–Ø@kŠ”‘ÒhÚ5æ°©Ÿm+i§Œ“|Æä©60”²Ï±=°¢/ç¹’À$“Ô¨a†r õ¸ûþ;}MÛ˜TIå=²ô¦ò]ÞMž$>NpmdäÍsâé:PgV=Û#×™SDa›|v+°@äþAÚo²ê¥[3¢8>“ö¯qûËÒ Sª¥Rûápe÷œÌÁg»ÒWõ‘åñÞI²ŠO àƒxÈŽ+r¼ý- ªßÏÆš}.iø’±úô¯~ãøЦ>QV§2@LŸýæ7}åH¼}D%ÞñˆJŸïáÖ1á#Q'! $r΀"_(Ólÿi€6iOÚ¬çøþNoªÔNå.9"$2lÀԶ˞€â¹îQSÜ#£n*÷/_>Ž_xXø4>4ÒWüúæÈiÑc endstream endobj 1250 0 obj << /Length 3555 /Filter /FlateDecode >> stream xÚÅ[[ã¶~ß_a /ž¢£ð.- ¤@S´‚Ù>%ÁB¶53j<–+ÉÙÌ¿ïw)ÛÒÈÚÐ'S$u>Š<÷C‹ÕóJ¬þöA¤ß¿|üðÕ7ƯBœr«O+©u–;¿r6Ï”¶«»ÕëºÙ•ÍƒµëìáQ µþ¾:lˇG¥òu÷’Ûb¿ßÛŸéÉ­Û²‹Ý›·‡Ÿ>þã«o‚ºQ6ó"ǘ|ÕîiÒ‡¿~üðß½b%W*Çgx! Ù¾~øá'±Úað+‘éàWŸyêëJeÁ´ö«ï?ü+~ÓNå>óV¿©h» Ð`3iÔ" ÁgRË!èæTíwïaµ2™÷K j•cוã=¦1™´Ë€š»–>µ|ª›r7™Tù"¸^eRÚ!nYl_Þ£¡3§í¨F¸Ì©7½ÍÏ‘ÑÒ¤t&½¼ðùETÊ]”MùHï­Up™Ðnõ(el"Ë[ø¨¼Nr†#qëëï?ÆÆ¡Þñ ‰è)¶Ý oñi[Ú®9m»r÷ô¹®º8ÒÏ?mË+3Rµ+]õ£ ÂÏ=õÓÔbhùb¸nZé o×_ï÷˜›Û³‚hãcûRŸ¢,Œ•ƒh÷›öÝ¿¿ývzg;ï슺‰„%ždlׇøûô ź¨ö§¦_ÖGþ =WÊ®yv]&—ã2m¬®2,æ‚î´ÊÜÇ\:Ó:0)­æT•‘lèU*sÒ AϪj¼ñÐ¥á¼ñÛ"íð¦Œl¬ežåø€;œ˜¹´sÕô fhÊ¢+cß¡¤ø<±÷ÐÛ*7ófëѤf•Ì,ß=[K|>SÒùœ‘€ºs",iEf1ÿ³üõØL3|°ç½¨7ÿ)·]7ðÔV‡ç‰í³° ù<çjã²\-ñ)‘,O»2»}ÚÙ,¤o¾ÓyÌȘ·L,,{õº*,{1™:´‘Œ*¨2c–58¥õô©©_'@aØs»È™pznäôøyÒB),èd–û¡<OOâð¨!øB õLÝL)p‘]›à !SØH@¥Ê»T©t®¦eRFÎéoéœ&³¨‡›A¼q zCæx¯—€URA¿¨!,Yù Tm@Z.‚ªóLû!è´ (âÊ_z?B’•ƒ”q‹`" zÄJ¯§}WMh7 îí°°Î™ËGÌ4-ƒ3/®@gxw-¥Òç0pðj•5“\º²íØÛ´"9±hü­<”MÑUõ”Fî¥Ç„x¼8 O«ÖìV»éDrY$_¤I]uìé}êcwÆõËÂàçª{©#p¨ñ<Æ_»8ÂŽ1¿^cRgÜPÌLCp8Ûôú!~?ûKiÕ5†iÕ°ì»ÿhÄ5îâC´÷ÜŒKzݯå”òÓ"æ .i"!á.(èïû‚^h"øDI;7h(ø°&ñ>!èÍ@Á§ÌÕ>…Âr$öÕ"Xðªu,àÔiõ§sÏVa T/³«!j»})w§}9åö $q‹ è "¿Ç)ù‡¯‚5&N:¶½2¡¨~¶‰Y÷RøBŒ9 –&Å)ÔúAš‹n >–5tb z¤c9Çã•œËXNÈ¡¿ë³ÎWêì°̓ôëçÓ+ÂðH;ÅÌŒºI«*¦ôed#gCVH‚@mCÝuDa™‘r.b5žcÛ -Ej~ˆykO9$µ£³?' ø¹ëÇšâðœ²4 ÁºÆæ£'¼ C|á=«c“õ%+w­üG 4:˃ŸVbD¾Wb2`IåiQF­{tÒÆÔÚ<(±&>ãTë¿âKÇ¢éªíiÒF¬)£)ÒWÒhÚ!’cuI¿EÜç91;øþÏMq<²RÐ+ÛGg”ŸŠw÷™Oôìê×¢J£¼Ó<Ȇ=3¤Î:/l±3Uöâ"bÛÓd#Q®3­®7bÉ©Œ§ËÍèÊ~L\N+Î,»SsàÕáiZ¯YÁÂ7›:®åÊ…ó¾OÒ "yÏ”l˜Ë÷¡Ì—€„‡¢á\CÞRiØ aÝ pÉ¿}žThŽœ½$ÂQ ût 9'º&3ælÍ6e ¡\¬ü™(ƒÄ5ǦØö… U„±oUmK’LÓs¡ç÷‹Àš˜˜À›zwÚv“ž|FÅR¼Z$ÕMéòz¿‹=¤nÖñÜ]¿¦®ã7E8V嶌MR±º¿¯iANL.¢A¦ É;3UA;Û+¢tà·Ø·uj‘iü…Ä©¨öņÅÝrkÚ†Km2{É‘ÜȘÌ(Dšá¾º’ò9ŽM2©|¶˜…ÝؘÐêYaˆy3Ür™´jÀ:_èGô%U-ÔžD¨–èÿ®:l÷'*ÂZÉŸ°¯_á3?1löòç)»ýéf}z®~I/ÑëŽO$ÊÜõ{ê;ÓùSñ©çªw2U]`F~\$ýsY/¤ÏdinSôQ‰ß¦3\bbç/,/Nû¿-rLg¸Ð¦l»¦Úv¿ay]ñsù…åýáöáßæ@’ßCëüQc ¿4‡p׌BÁySGeC¸4´'`îª0@ªSB?wB\, ¯1‘‚ÞªjhÅ…À%`5…ë£otÓ”EÐæì" –Âu3sÔ,Ü:ù.×-$÷¾Eü!^ç°©ØÇËðj¯Í¦<Ñý j$ÓŽvŽoiMØ%¾6¢Ö徤¸.=1j|~©¶/±I ÔJA zÒÝÕ__Q붫øŽš‡²Ü%jœ•Á/ÇHxÿ9Ö(Œ[ïbÛÇk’ÛSÓPœ9aO¯ƒI+5;²‘é»`R÷ñöV˜Ú—Õ”,jÒ”×éQ›o7PFé¥nÓpÕ¥ªFŸÙ ùb_×ÇvjÅ%lJ3ýºÏ>R£ÿH<¸õ±®bÓ&ÊWyƒ©ñ|)­ð3ίڕ‘@:«Á‹—¯¶—¯žXaÑ_NŠ~_¡Ùžà°“$üú»t„»ª)·] «oõaWÆ;„|ÄÝç²<ŒîU‡ã©Kr èrã|îýý¥IOªÏõwžGfÊ=tW{zåuê ú»@—ì šõ¦Ãpìù}†ýZ„?e¿pÃ>—“v¥rÁÕÒ»JtñÄ0)R3þBMô" p¤¼WCÐ[±²§[vjXO·ì†¨“ZØÅߘFXìš‚Δ9R>{ ä”Ð"37þÆ„v¼ˆEùœK3exÞ×9%çºJÙm¢.Í"°Ödšdïvž‰‚ðƒ«›tl/)›@æ;žn±ÛUä.ûÄ8ÎrbpTBkŠ×’óó)ç!ѨvmlÄŠ‚è“ó"² 5v¼Š6ºEüÊa<³Oã‹«|5=Mæ«eõÜ—.é†L‘ÈÁÁÂÝ—¿Ò¶“‡³B/ªefÐ3½Ádt!Oµ¬“Tš NâVI†E0=•ëýô¶!¶Š.]-‚Œ= zŒ|Ó•ÉQ€tqp)œŠÕemRŠ1"¨›6Ž³Û~‡ðía§wo±·z1(‚ék~Ôo4ÑìÞÕ¥ÞCÝÅΦܿMyï1—H„Å–zb$q5RŸ:öÅ©óZr/“}?9œË]i¼ŸÎã1C>˜g\äœÆ&å|äÚO§=¸`“¯d€N0w)XÉR0øfînƒä’]”k6fzCÎ Näz X,`D°Óy ¿×ÊE@éžïèSçëSTKZ>Ù­xÎòÝ=˜°·øpå¾ðsL–ïOå嚢5Cf“²ºP®AXˆ´†K+‘™ƒÍB¬¿¦·Ç}µM¬ý~m`MEù ¤3¾ÞwÆç— &6ð;Æ7òÆw™Bfƒ¾þßÅ©•SiL¹~- üCÌ”Pyþôœþmž"½XÄŸ}µiŠæÊyðçŒÊù@<‘+ 4‡®6Æõ§Rú7E[mSí\ò½²a*àzs¸ZŸ ×AÓzbW¤F]œ }æ} «ØWÝ[«Ÿ&K|ˆH„úÂîî¥>§ ?\ò ¼¡o±oÓ¯ðXnã?žvýääIÇ'2ÌÐTé²çuÁEÂj„Ì8cc±.óCç7æ´XsºÌb“¾ÏÎ/Öó(0Z‹J“ÿù€™õþíÛjó[Ñ,5Ýt!ßÌìÀ~ðè(Á &AAüyùÔô endstream endobj 1255 0 obj << /Length 1603 /Filter /FlateDecode >> stream xÚ­XK“Û(¾ûWè(WÍÄ1[µImn[ñ-ÉÈØV" GM&¿~dáQ&S_ ‚¦»éÇ×qrLpòvƒÃø×nóêM.Bâœ&»CBCRä‰àQÆ“Ý>ù$Ù~Ú½{õ†²$gåB³‘®ì*Gµù{·ù¶!°Š Î"ža ‹zóáNö°÷.Áˆ©<ù>RÖ C<—0«’÷›½rW∢ Œµ;Ûêádö­m §\ š©ÛH§\¡˜DÒ;]Ÿ+ã£h¢T8ê{B ì=ÉXô qŒ0‡[±Iþ¤’©\ÅJFB ggbdÅùs „9RÙMdSœ#Å®d/Í“å jˆ3®ä9½þº%85ÝöžRšj7°¥â~9l—ÍyèÃR³´mÙôÓñf¢ëÍ–ðôhZOd*S›&µ§¸ô–‚ÃdtuPèd€ŠÉ…wnA¥åÁoEhÊÎ ¤=lOÑöžažî&61¦m×ûÂVCÝ„³ã(.íÐûÛ-Ï›{Óغlto[Ìßß“ºÛàøºrfýî~ôƒcÆIj¾ ° SšöÖ/§.ÉÒþÛË‚È°Qئ×e85ÖSÅv†³uθ BN&œÖ~øÏÑšÂߎ×+ÓûÓÚ5~šv…½E`ÝmöÈGVŒap˜B’ü‚^ô…èÅe†˜$·A/ÇŒH’³<¯‡\RêùØ ‡„"·ÀÇ*S×êEÉ Ze‚¬%¯ÌCðÀr?̦„…©^P=¾7!`OœÍ_‡B,§ݹµÇVמó¡µõS2$CgóÑò\•Ÿ×$€“ø,a_v} t§C_:0±ƒ*°¸2ŠÖb_û¡3ý2Ô©Ë#à§d¹fN–y.dzÓv1«ªlÌÌÃåbÙ'ÕƒŸÝ“pdÈ,‡>®¦ý­V’.Ò‘AÊ:ݨý4lË"|ÏXhÂ'ðs°RØÉdék•C}œ£è#&bÅ 9Ô(ÍE™ƒ{/„/ ´<Ÿný¼l‚»°@ “5¨§"­ôÐ0ó=VŠqïw?›ƒmÙùp0±?2šN77`3Â,¦¡*ÀÎŒõ0/ƒ¸‹:#¦þ( Ûç˜yé$ᕇbPÖCØ"¥dä"·¹Èiòº[KBÉØ.^C€„¾á♡mÁ7c€œ½õ•\@‰×;igBý^¹²4v ×þÞD&ñ•Y9Ì’±»Àöµîï|é‚/–\Ôˆ/CV´öC}䇫󮚴ÞðÎëÍsk {amÉ„œ–·©-Ž$Öó;ã›HŸ:ãHúšåÏÛôÆYMëõͱšøœÞø²§Þ8’(Ê®ŒÁtÎÀÂÖÜcJb&—Ü'¡²Àbgë°í*…@7·aÔk8,ÀŠþ‡™šhš Â~þ}\éò7dv¨ŠÎ»WUñ04…«œîd9O¦3­_ ×Ê®ºIXðÝä´éƱù­ Q•û6t³va ØÅØ\8[¹ð¸ß­ ºtsÃ@9âòqj®ðhQAìPí–…ºæQëêX(a#Wtž‹aÙ 1ŒÇ)dÀM0Ì1Ãê’Ÿ½=›•ì„JÜF4ÍàIŸ³HtWèf%.ÀsÀð»Þ.]Õœéwë(t$OÚ^­ˆ0)¡kU/ À\èöFVù­y*ÜB°„ËI$øÆ…ÛfdÑÖO 2˜³ª.•zñØÄxXKˆé‚«‰pOAŒòÇùÀ_š™‚8ºÑ{‘AÑȧYa÷æhVsåÍx—DI—nè ÀÍ¡2®‘Âù´êÞ¾íìÝBîßã1÷–ð?Ú³C¼Î´¦ÒIºé”@ŸDÈ“¦ch@qÆ0Á‹ž²LÀóºÇ Šãï,çþ°’ò:êÆKýòÖyúúý.¹{ÄC0\¹î}9vñ=–éϘìm­}ý¢Ó?QÄoz!¼ã—ý¡™ûvï‹ct´ Ke­Æ½Z:÷æÛú«(ºý¦·«…¦’W¢ËSu%Ç¢ Ë•éÇ|›ÿh†#ƒ÷zfƒ@PL†LS2"ƒpøÁ®X endstream endobj 1259 0 obj << /Length 2051 /Filter /FlateDecode >> stream xÚÝZKsÛ6¾çWÐ7iR¡X¼áLMÝvÚé¡ãøԦŢculÙc)“¦¿¾ ‚%JbíIµÄ.vßî~$-Þ´øé­?_]=ûöG£ F‰RLW7pN´2…4ŒHPÅÕ¢øcòýíüqS>MgLÒ ›þyõ‹¿Mm4¸Ûh1–þ†ŸïïÊûrµ™o–+ßE¹™/ïÖíÝ ŠÕwKkq7#0¥tòºÜ¬ýÝóÕ¹,ïªE«…ÚT+ZbSõ‚Œ¦jû/Ê7”²Õ²3U8%îë*éoSF'woËÅÓüÎ_GÝø$j¬Ô€pŽãøW¥æ;¿7a÷ Ç@7v².7þ–hUD´k¾žÎ¤Ð“åÚß1÷õvJÿëýªÚ—ûúpã?ßÎ×ËëVIå+t 0B¥(fÄJÕ(ð@d4g­/½€’‘PQ(b„ŽWq­æÆ "¬)f†X^j™Ù­ Ôê Ó¢)E„Vh7®(ú—bè7]BßøH–óë)ÈÉ­ÿå\ä>?Ü.ÃË×ó:5Þ–þóiÊõ¤|ôkÌå²ÎÀ÷ëåê]•Þ f…B÷pÙøï •1V!X#³ªu^c^ožœUóåª M”ŒG_ã¥(#%a»@èÜ iˆ„$º²¶î÷¬.j4@Ö[¨Ó$ô„"ZrD†Nê,cf%×ía­52A¬PYgQõ÷B O¢¯³m‘Ñ¥‰b¦ˆ*Ú}Ñî×Ù©îˆê³LxãM­­œvp•1™©ÉÑBœT×椶äÜ» ÊôܳäÜ·û¾É˜á`¦ø;³¼°Û±î ªØ›y&L†E6@xO˜xáÓfb36‚8mþ'k4X8Ùè踔ùäDµ¡Õç™Ì’X(URr¢ýx]q ¢0»í´+<Ϩ0ÄØÖ!¯²Ä“dÛV&ÙÝ*´m.2*œ‘< J¢Bq“¨ˆV0D¶É|ÝÕî@0™YÂ×¹Z†öA‹âïj+ytì˜jƒñ"ãˆwP!­+ÏÄ‚ñ’–W—´l"ieè=5B>r¢ .à÷­šNHÊÈ ,³@|j½¼ÈÖwÐXU®*ÙäU´1ì :ìL²³UfgÜÚ†ì"·39†Œ´³6®e®­¢î̵ßäÔ¡ö±¾M›c6@¢äqŽ‘]Ó礼Ž\~H`áØñ=ÍïËvºx¸ÇF-î+çÃÇ‹‡£ƒ_q@4PM·y 9ObÏÎá O®²ñ²®) ¤²'ÒŠ} •Ò±%¹¨5sˆ:P®Awnr³h7ß’¨\Ýæª*N–Zcç3ßUsNÑ[Cu½‚»ðÁ͘„-´mÓ¾‰;Nj‚šjRs?7·uOßy‘UBà´ q>¢ÆÜXƒƒ²TI+ihß¼–ÅULd*7n{[Þq·¾‘%[®¨èÔ!I'%e€‚½³Ù×1ËíŽ9ò|Ô1ÓÓ1‹®þÏ@élŸ€ßh‹”ç;Ñ‹q@ïˆ:wô.ôâ»)Ž†KÙ T %õ.žÃà‘9žƒ1˜<Õzrc0žNÙ†áÒËWgˆ± JñgÇv¸‹5Ûáþ¨Ž^zÛj&œ¿mÌpx&„òz¢oè#¼$Pa¦±d„ÂNú'TòièË^èÞGH‚3m SqA¸íÍÇÇ2s^ÿx‡b'T '= b 4zÅ&‘Ùe‘ºFnÔ …øBÏ3ê8e’ævKDºX£(PŠ·¢+]1åâäã%BbÊ]®ˆ)w½ª{m'Ä”ûÃSž3ÒLj¶Qu˲Už[‹«B­ØZFUí°„†„©’aF¿ìÑø˜\ÍAöÍÕSyçjÄ¡\ š‘Ònᮡ—ä „Îr“BäâaÊØeã°1¹³Í‰ð1§ U˜Û½$š‚ƒ?ªl:t%FIù lÊ;‰9–?°éÿÍ~Ey´}T!{$B})ÉrK%¬ —ÚKw 3›bvö$c¶éÌþš‰@}*c0° 4»™@ŽAtDFØØo1ÑÉb[稌*S‚RM%•£PjDj‘m¼RœË?ïã.ѱÈ,Š‘¨(õù˜E5³øv¶‡YT§3‹cñ©jµ¨Q‹°E1C¨Eq,µ8tlg€#jž_ä¦épS~Qvð”'5“ØwÕ?.ì#wöL‹ÖØýO„ƒevO‹,†šxTݶ†IN[Ì-†íJÒÞ¡a©£O“ÙÌÅ“¸©öИ«ÈŽÆFUjAtJT^úD%«ÃyJ™ŒQ[†í„{yJõð”¾[ƒ^mÃxÊËlÏ<ªùÉþá<%ÆSÂPš’VoY @BÙ!á°çÞ¿¡ÝP?V¡yØsó„Þ { +žy–Ì(>÷„χ{êDÜÓî ÆÖ“êŸÌЈoElz°Mc1W-Á´xÑ1PöcD€ u A]±Ww;ŸÓ°êu©(‰óðK›Ør×4ÃßzßûúÌõ7ùŠnçKÓ-'PÿQÒ‰eËFê…sï…ž%ÞAÙL° ûð"[ Aî%úXÎçIQKtu…-‰Íö # ¿Äå”| c«¦]›Á AZ\㦠q ñνuÍL3k¢›~¸zö/ë †´ endstream endobj 1277 0 obj << /Length 3141 /Filter /FlateDecode >> stream xÚí[K“Û¸¾ûWhoRí &Þ€7›ª8Ç›ì!5ã\gS”Ä™aJC*¤4¶÷קñ PÐk<³YWrR@ý@£ûC“Mn'Ùä/²Ñóõ»/ß(1ÑH "&ïn&˜R$…š.¡|òn5ùûôûâ}–‘ªÜ–u5›žM ÂH¸×÷Ï®òê¶p?ë÷ÌÝãªXçæ3 Â³¼ûSÏúåÍB¾‚ Æ0tYŽ?[ø^‹é•ùèåAZÂU%q iN;‚¿9à&–ð!”)9¡H`鈪‰¸V“y@õ•£b*2"п'ÍÀŒ!­pÈlÈvQGDžÄ)vD+O„"‚᫯£P„…îV=Á ­@&w.%,Õ¢p†ÎÝ£™Q9õs†fsÆäôÝ]‘Ð[ D3Öñj¬ìó›S‚Wl2Ç&ÅûSç#WîQ¶î¹½ó>´©×ŸîŠU3Ã|š¯][ ±/…c1™U/KBÌÀiz§ðn¥²Èkï­ûÚDk#’õmÂe¬ç!¿É¥šÞ¤†’¨§ûØë5ö™9F ”=kÄNr2Ù'-œ©Ó‹!yä8 PèY ˆ@ Œ‰cÎÌ’ÉÀ -Õ¿œ tʃdçY°=Ç ò¬€SN¹g…WÎ &T& 9ÞEvÐ4†íðm‚(Èñ£ƒÈq©À1RŸC””§´'O¸ðeÌÈ‹`ʧ@…ê*ä'P¡1q¿ôJ‚wIô3˜å©æ€>É\'ç€sñ¥!s &ª¤Q¹Pù÷¥×K‡ÆÉ`†ù’&”'ä.šVÓ¢Zú<m+\ŸQ0Ë‚mF\0£* õa»ÆOTÌΊm'£ £'¡~äÅÇ+fgA}r¼b&NUÌÔ±Šl¨À×ö*f`éÜ=F3š‰®bföBM}*¬~­¼CaWå°1j$Ëj Ç×ù“’¶>f_†•¨ÃfRT°Ò2œ\ó™èi®¬ Ú1­ÂóÊ=,愧­!óŽ0­£‚ãRÒs\Û…ÅÌFŒû|†3ˆðÇ R¬‹û¢Úzj‡•CA—u3#Ùtî¦ Œ(QñÎűl7uµ*«[®ëû¼ôá¡cñMÂÈR#nvr€º%—ç˜)ö_ÃÓ˜éPØŒjâr yR4’Z3l¶S=Õ¥ p,5ë¥>X?âQÅL&‹’Ôx"8ìÁð¡ ø.¡Š9èqM°ã@º"¹WÜó*<ÊȦÈe@hK`"³Þ bpWJDd6ÇÀsz]ÞoÖ>¾Ý­× ƒevá×Ñ&ÄHíƒO6mëûb[ÞÛÈÍ»¶¸Ù­Ýû¶vÏ»Ü,ösŒP¸r×ÑÂʶÜá}‘·åÒ7»09¹Ùëk|ˆ÷îrOº¬«-Ä/…ÿ¶œîÛDi” s€ãĸãÄX?¼Í júÆ|êúø´±=ö ~Á§¶|¯.¬™Q†þ¡¬w­kXÞÕ¥Í 0ôëÝz庾ÙÉÖ÷›Ý¶ˆFd6‹t|;(2VTŸ±Þ¾ðç£1 ŸÞÁ|š³#hô€ö²ÚZ²ÛÂ6°^ͺ=VEªÀ{¨Šòª(>|¼Ç!åmmæäC1ÌLc¤ïÂ8‰=/Ô³lSî‰é~¹.wMYaý ø  Ãú¥ÀÓªÞº¦v·ÙÔÍÖµæ•kŒ†#°ëª7EÓyüt¹ (ŠÐµÜ 7®§ôœVåÊXU°¾%´ü\xxâUˆ”½1¤yÙXM°ð»)ª6ði×e=žÞƒ™ImÁoN¸´{á-Túíʆfo©ÂjAètaVñnë:Ëîé‰óuëÅ$Õ§õCz˜Ú[=”ÞÜJ€ñvH½²F±E8r A¬\–É7Ŧ)Zð¿’5þµÝåkJð©Ñr§%N)x:§¡†ü÷®llQš­ ðçüÐê4Ì—ÝX‘kQçZ–ŸðÎD½qm[ùfÓÔ\u()¡‚Ÿ4¥<âS † ̪›_åk“ðlw‰L¦(âŒí§»QÒ$´OwËlkV3aÞË`ì÷à!m—L)KXu­14FRÑØ®X/Ü4Rá|Óüj²ægÞºn;c¦ÁÙ²Z®w-Œ?ÿP¶…ƒÜ†¨½)Ú­£ô‰È¼ZÜ0¹ïøµË¦\8~bºøäša!ΓIhÛ@æ²`™².¥7æMᛚ¼j!/ÙXÖš´ Öð#‡ƒ˜<¢(«ÍÎ ‚ÛìÆaòJÏô¾È«=þýÇ~^¢{#>hÀÓ%ÐaÍÚ¥JLú(ò{µË‡„~¸¥@:sZº;ßWíîvõ¯»ý8T™x•Ã¯zo$.¦¢QWµ¯|èYç¶<àÖª=Èǽ0AÍ Æ¤ñWÖþèXIÄH¿È‘»>ᡲ‡ÜRUŒëb{úÆ…iÛÓ·L`SÂè°Á Xßõ 1•I” wFRµ]Íå:µA΀±‡Ö‚ïAk[69®Š û…˜¹5¤À¢d\r¨\¸}®öwJ Tïå)ƒ€? ÷ Îä!½Ý†EEPÖo]'7m ºÃKeb(¼dx)ÀŸr}(·w¾¢ìÕ̦ŒÉõE ûr:Ú,EûÌh¯tÖ}Žê`!tP,X‘Ó«`˜ O6C‰¨) ˜ –8³ðhÛO‚mâ>T¤Ô¡ú.¦{´òÌTñS AÀ@¼«Úª.¨ »í¶m¿íÚ `)œhóëñ7÷š²Ë¾MMl¨¹†)LŸY‚xtáD%.(íN">»nòóR~¢jï`xÒçE¼ _%œ@Ú£ wá埉ð;7×HÝy7×òó0?€õ%ƒ¤p– SÉc™¿:𻃆LDàhJ÷"ðÇd ëÄ-Ò¨R5Ô˜^'„á0êraÚk_&(x}ŸƨC/æç¤0b«_Ÿ¨‹-Ó“MXJ–Ñ™"1á,¼ endstream endobj 1294 0 obj << /Length 3019 /Filter /FlateDecode >> stream xÚË’ã¸í>_Ñ·¨+mF"õ *µ‡ÙšìdS“ÔT¶+9ds-¶­YòJòöx¿>Rf÷$9™Iñ–ã»ã]|÷ñ]Ì¿ß?¾ûÃ:¿KR¡Ò\Þ=>Ý%J‰"×wyV©²»Çúî_‘ê~—Äq}¾O⨪³™†æp¿“YýØMæhš|îõGØrnºãý¿ÿBW$¢Ì2{E|·“©Yé‘‹„Ñ*:__SÓwt<Õw¥(s™óéD  Ðz²%=IG Ѓ`K.ÃLügñ¦ºÂ·')µpÂ(Fú½Ž¦¦ÑÔÓïØ·¿"rCÓsÕáìæ/Ú·æ̇Ÿ›éÔX,ÑVDõt‚ã*SÑ¡gZ¿NQÿD ~Ç¥oo'SUKÎ}mZq¿ËAJ6ƒypQFφ–«Ï«¦ko4F fœÜDYxm.¦«Mw0!"«®jo#JBåj+2%e™ÈpVu5 ,ö<ÞΗëden×éçÚ5¿\ s²L7Uö­-ì©gì$–¨î¦¦j—¿\+Xý9Ž%ò&Kýz/Q!š b9¥Àï# Ûjš¬¢–EÔ_ÌÀ÷âÒ© ¾7†Aôø³D!èÐ_;b ÁÞ¨i­é:€h…õ4Fúâtˆä2¯‡V¤¥þ}mÍ„ó„„Œ 7µ¥†ð ú8ÔÑ?î“$‰ÌP÷}[± Ð&BúºƒÇ=Þ oÛ¸««éUÍE;?ôPeñ×/YuëPaq¶}d>b »” ÃNr)Ò8I\c°þ$yé÷Kâ.ÉÁƒÀ6¢4{Y¤kÏ€€•g@À³õo#MP¯†qâ³ç =·U ‹,À„T©ÈTêüÜ\>5û*J«™Ò2zß檵œTö6–Q©c¡ódý$Àà©GšTÌŠ*Ëè²ä\m|¢Ý°âv̜à Åm\ómQ…ø.J¡’Â1´¯ÐðþK€ó4‰gõÛ)-ÆŽøTR‰4-Ö|®•Zeu8GFw¨ÐÌ­³‚'¬ˆº~"À¾É‚èäÛïî³,âU{ìpágt±:‹öHà•‘ÐÉ""Rµ![9šÎºë%x‘kgƒÚHSkÛNNB.TæÑ?ï5I_óNàS±£wó‹á¤éÆK3F°¿”Â^&¥ª›ãˆa4ms89çŒ!#QRDxþ©fhˆÎ­3Á=È ™2‘°Dn£óu8éún·ÔL<»ÒLÜ´ÔÌ%™l×.Æ’íCæR¦éš‘ÑŒ@È!)Œ)mÛ£-=³¶ƒ×5ô8ÍmøÄ{P°zu£]ƒ9@ä¡%Æ&£úZ1h´¶aã-ͦˆ¡ý¼o:2isvVŠ?öç~À'ËÁ±^§‘FQcˆÓãahö†fcæg¦Y«–‡úËÔœ›ß¬~ŽÖBJ „¸ˆÙïwZ Y#½Qu¹@`¨i‚™ÒϹ‚·üJ㺚:NdpW›ÀôKGòïXqÆŠ #^u"3ð?v=€ÒÈ©âVuPv!ºQ?(*óÙ@¥KÊp0YËéyB—»ý}ǛȕjÍŽX­úåÑÒż¡‰Ày›,ÀJÿF^´1§f@²Hn%À„ÏÖ‰$®x™¦eÂàPÛ²=Æ,XDkô T4iÆQ: ­]@¿?‘•ÑóüB¼Vh‘%z.$.©øpu ÅOÖê¾Òä¯dq¯– èQù¥1®¡zu4@»Â_Ÿ¨X.¬K¥_PC‡m.%øµ¶9ž&Ì°qKÝpLL–¹J©„*’9Ö%*@h&ÊB»= «ÝD(É»ßÐtU,Ñ*^FÝ 8L²ÿ"c’nÏÃÒ5"á$VäráÌ(Ù(”ÈáWí=œL1?¶²t¾@cuæÑ‹´¶ÙìÖ¦S5y5­íoi&ÞÔt‡ÁæD Š>}æ;\6ðÉŠ‘¤oXÉ.]Ë%íˆ]TiÎUH|²©öùÜÚã—Î㣕©ÔÕrΙ|‘Pš\¢è›‘ –!€¬8­KÏîÜa+9B÷Rv\e¹Z³oí¥yº…s±B%Ëd샙Zód ˆ©h(c.`àŠë+¡è<5‡:¨˜MëäëÐ1hÎ(KŒaÃ"­ ø4ôg>æœ,¹æá Ihqô7ÓŽü¸;&zÅ#’|ÌÙ ŠsÎ ·!Š ¤?»)ea¬0ב;m Äyn€{燇9r±MŒ ^ÐÕp:‚ùn ’!íôi%º³Î4°O›f"Ñþ©Þ~S¥|‚Ýõæ:;\v2訷Šújq¦rßp5hô®¦î­{È0cáB ê Q$åÚ¥|\è…¯’SU¿šåÊtáVó-ZÀ3z)0¶M–dWÚùC½©ÁBnCB–^¾ï}<›·ä"Ö^R_ "U^L¿`Т€¹«¥hC.WtYÌYI ~ßK)iŠ(gzXÙ¡\è½–³3ùÁÊTQ„’H[Ê:OÍ!Pr™éÙ¶UV5ɺßñ’$ËEgIn_9õ’ô…–÷pꎶô|ófàË?ñ-ð‚¥H /ÛïBj‹bëÿ§–yö––r£$áxýº¼.„.Ð…JØÌf|黚rÔžÊyB,Œ3õ•):ÿ{t|Ч‹p“I8ÂB~‘5E 6ZÂz7.ã£JdØ (!`ç+v·½È’ÈW7’Èhà¾$ 8pu`„‘j¥®äBk°É'L¹‚5¬¬bér^r–æK5¹1ónŒj6öV¶JEÁH`¿l†3ƒl‚Ÿ»vò‹cÈæ”(ËoØÜúöz¦z3Í]½©|½ ]X eR€”6¹ŠoÉR{p5kTäÀwȽše®Y|€êæhŸÅmK™ uõ ‹&KÉl¶7Œ›Æ£õ&ØÓ`‹w¤0.¡p¨ë •Ëý`ätè’9ïP~&TI¤`°±ú_BÞ¡áδFéßh°7“ë\1™ï9"R‰«I³Ü¸d9»­WÛ›P*‚-ÈrÓNXeü¹þf†‘ùÀˆJEÎÅÖØýŒ§Ê¶Áp\›®?CÎ7¹Zþbxàž>Ï°ùšJ—¼#‚ÊæøvLJÑ^yjÓQ{•Ua _¹ èµKÛ›SÔ@À35#f*lû#Ðk¨|¡„ Õ86G²€þf†žáƒÂ¥Zx‹Qm+xçá<~™»¤9çÆEeÓEƒg!¸•ÄrãZ héÔŽÅM^¢ùZ¢y±Ì,ìrE`ÞÕÔ… éÊ *,6O!ˆ©³…ËÅy¾î +Ì—L´¢Ÿ¿ôEod¸É³a-žIá†O„œS©l)C“wÆ…>ÈÈìÔù;Ë22ÛT¾wKËl6‹¹Á…ƒ–{%odBþ){1ninØ.î²îE€ï°ãâT ¶g‰}_[Ñ©Ûb™sƒd¶-/4§TÚZÜè®p°79#xx½‘:S¹o3äüÞYtÑl `Û‚9Ö„ÌesÀ&ô \üôè>”¥V9ð÷8þD‚xN¶—`ÿ5ÁNkXµéž­P²á/š¾í1ºÈJ_`“Yv>Œ“ì즡¿O´o„øó«Œð»eKÊö-l ¡³Ù\‚/í÷èaMmzÆ]¨-ÍPèNÍáÚV¾³Ëöü®"Ð&^[ÑÑw^8YYn ãӥЙFC0‰NæÇwJªŸÌ5Ž÷äPQû¨Óo‘e¹IÕW™§y– y,t×@²Y(M› ØÙiQJɺ %1T~rX縘¨²Û%"-³·Qé»Å¦CU*UÕ¦‰ç+Tö{YÌ«n4ONBÿŸÈ»S¼rˆT(`ƒzÂô0~ןßý|$h endstream endobj 1309 0 obj << /Length 3956 /Filter /FlateDecode >> stream xÚÝ]sä¶íÝ¿båÉ™I‘"§“L›L’¹N§éMï­íƒnW¶•¬¥$÷rýõR"µ\ûâ¤IÛ™ó‰ €€Ürw·+wß\•þûÅÛ«O¿®ÌÎ2«…Þ½½Ýq)Y­ÍN«š ©vo»¿ÿ¼ªhŽíõ?ÞþñÓ¯µˆÉŒ0›ƒü{Y–d«H3)ëÓ@²lÍ*#Àûn¾¿¾Š }öÃññ¡§2á2vÍ»c›YÉ:ufÚ/šÙZ„P¬ÒvwÃYÍê» B³Òî" éqï‘šï›9³²4Lð°p“YX³RÔ¹…­Œ¦QL/üy;Ë8ùµJv}#¹,þÚõûK$L)_ÆË7˜é³Ï.`V­Ò rÒ ™äf# ÉJ zå" Ÿdf0L)ÆŒT‚À‰ú\(µÚL‚ÎLUÜ_2¬1¬T»Ã,ì­êÈ”wÂâW{•g°Ydã» A+­Ù VÖÕe™„Yâmê.LUÇÛ´ÏNUÁ6e¦J6S°J&;Ê32›lègYœ¤­^¤gø$¤9^ïndÅA6‘5°Ê­ù¾½²è[4ï©2Q%±%®å}wPGs¼æ%ðþk>8`UìïàQ·™xÁÔ5‚ u¥cÛü"óà°.3û(”vÖX <ÿ±ÛwcsºïöÍñøÁI¥™ ÞN3Ö ½Û‡¶Ÿ©³ëé»LoÿäÕZ'G&å¢Ø?^Ø+±j>L[Ç—bœüêP?wƒÇÁíÇr {eXm7B|÷ØŒM?·-K)EðuLuÇ\hx†9ûÐõð‡àWt° GÝ6óص#5qk ŽÅýV¦xí!‡ñÐŽÉ6i¿Mˆ™Q„™Ñ…×)h =‡vnG@Âêоn6/›ܬ¸]Áfœ±y¤Š“KC2Ñæuûn^h5¨•È‰¹íÀ¹ŒP‘‹!u džªÞ>LT;´¸‡=É2© u cw×õŽ™PKÉ5¡°áIöMío¢I̪Û)€çZsTúê(]XÎtA’v(ü«Þù¥q¦ý<ŒT聆lŽž»±mf”:£`Þ>”Z*,b+xkt5N‡x; FÍ ÛˆÁiÂYÃðýä§ôßÛáxô¢À뫯Þ^¡Q.w|'K8>­Ú)ê¿Û?\ý°ú›s«¯J8ëŒÚ½ßa3ö0ƒÍkéŽK çüP.¬Ý p­êº;QC‹­ÕnlwW·»«7n\X× 4»Í´’¸.gÐáÿâòþ!ÇÓÎ?!+žË¬q÷›µ[Öz°‰&‚q°7<ßê#Ê,.á<Ô%0CqÅ4˜_˜ÅE%‰«ÎØF»S²dÂøßi7Bú¶/C›8ži? îg{ïñÐxvã9²0$Ç5ð&k8D~ׄU0Gý ×Tµ2õ/2Üø"Ã…ûý–k &Y®?6<[ØsNpVsY âðST@1ã@ŠJ0;¤±´¸–:üš»)o¢ë„çÛ "ÀxøÎè ØívÂ:1OØùÄ- PhÕ—­‹¡Ò]‰Ð<£L†ªÍe9¼f c®-‰k ÷gn ¶.hžh@ ‹’&™æ—÷ñ¥T £ÁP • ÒJ] 2@ Õ M”ku¾ˆLÅþWߧè^3¦»¼(¾é~©ø–.YõbñÕµ='0Í€”&%ðuN|q®K.h>)¾U¥þjŠB' žÛ¥é«/ 0B 5_³àêãÕô¥\×?G€ö$Ý*¡û]N€c¨-Ýuý"ù•`ëÌËåW3UeèÛÈ/ÀuJß¹¯äçÊÓ¡™‘_ôNÄ™OêÏÿõø_Fö›ñÞE¿Y|ôË©îªFi‘DÄWKóš5]åÎç{Ë@iQ`ßQÊ›#‹5$¿¾áE–S÷y. SXÊFa Bâ& 1eèwí¾yœp†ºr¡&~)ª#b°|ïéö¾P<aG 45ïl$¤0½lDñz¦>GÍ&º1~«Uˆ ã¥×lX@í<Ó"!ªlýT¦Ýc(õ'\Ú=a…K!4Ä I{ß–vJÓÜž¨Úf0ÇR;†±}1íæ¾-qˆ14×0.3øB”RÀêšRX;CÆâZ«Â£òú–šl IŸK+B©¶ü{AÆW±J%V—h))ùYFÙƲJ2 ˜Nä:¤KÏ 1ŽítúeQ`àšƒ-å²À2àw*Ey„ ŵ`r½%hV’;!ö£Ò˜ruDÕÅÐ{Qã`®K‘ËNJ[ (6T¼o\~UT¢@R°É |ú,Àʆ8Ìë–´ëüÉæ~øà+§è.P•`(Ýí…úÛãäK]4i.ÓJÌå;v@¬­ª4Çç’€°'{§\Xr9-^§flÚyìöÔî“ȲPr¿¹Ð>uw}:réÚý47˜¬ÅæͨôÐ| Â¡=µhqÔàg ”Ü$èzz'jí\«‚± θ6V%òàF9WÇz¯úa¦Bwü_ 0¿Œì)õ™ýòæisÔàåÊj5UÀZÑ6œ<~¢óÝÝ­}‹*÷¾›œ1h—‡ï©CµÄqÄ#E¶ü•ÏÊ#®¸°Ñ¯[å¼·Á=y€c'Ã7h%>isYŸ*áî:Êø3}¾ÞIJO=`Ò?ΣҌ¾+œ&0,Ìãw¡USÖ¸=%ù ù)ÆP'Œ±@” Pì|“G¡= ®ò‘ ²Å%ŒZ6Ìc¦¸!üÁÅ`œå²,‹o†‡aôë}ù8O»ˆÔ¦ýà·d¯E|צe¸úÃŽwè;ÈÃ#])_Ù¹ûdÜêÓv?øqt$Ôæ’Z“­éüÆB¸q¤Öý0Œ `>¦‹Ê/bŠÜhâÅØ ên"±’2QÕ]¿õûã£wîD EĦ fY¯Ç#k‡×u~=s-èúÐö#‡Ì ZÊ”Vëû.óOQÌrŒ«É‰Ã ¯²)ùàA?ͨHúჴ­n¿c®Ì*XºÇ7eñ§6÷&ˆkÅ8˜§ô¥JB‹vôO¼2V7÷ÝswÐë“›4ÀbàɘSÖñWñ³ž}ÿS½y•“<º1.Ùêî³Xè‹&ó$yúð»Ì °“ož2%8 Ï¿p+çîkVÚIwTÁ(V±—]™³ó‡pY/˜& €\/þuÑHlõ‰¸;Ô]ŸSÌ%”Ÿ{‚Àã'ºëíl”Hy£'e‰ÿâ²ä¨‹ïh Aî±vÇ$4᳚é*ÖxYØ0±¾Ãê=W}À‡Ø¡© áœ0h xêB8—MñÕC\cˆ 'jG©žaEü2,rD3»S1­å/±;æ£Qº êµãHj”5ã%Ãkêgt}™â6ûh̬3<«ë§ ±œuYÓIû'YÓŠ·ïàî#žbi=)eD¡{Äââý~h[ÃÁÍ[Õ‰šè S"öox ÇD¥Ï}§Ý°rã@Kz¯`Cò ÜäpÒ&ÀT%~]³9+ìú^Äúì—÷¼1)"mñ%ènwp‰?QÆ›X4nѶís@Ü9þëÛ¡œY}öNìˆÅ´dex}È>cÕ˜²\~KBhŽå6«Ä,Êãv=çjûƒ;ž=›Åe3ú+P“= Ý#Öê.ïˆdª;ÕSÎ@b¤^Qø·žé;w°&ü\&œ$,)¢—)t™Ù’?R×ÉxŸç²íŽ>gj‹ÛÇ~ïcˆÒ®‰›E ö¬äçÛt¾1Oàx—ÅQVuÇÛ±Ùûø€U[º§!Û<œK¯ 1‘Ë÷Öjk$\[軜,©±‰¾„C­×Ø¢V±ÅÃê´>‰Oï%«š™ÕOÜç¦6`ê–qwgTFwÓgÎHÍ—ÃeÍ´%á‰_ËY,øj>rÑAŠÇ¯è4„ óQßlû*èßI;>éc}ŒWæaoõ/eo_â"\“5¸2Ñœ ]ºèó ^õëo!F®¥*¾u—!Ï'õz“¡–› ؼÛÁ·ù{4‰O,ïDêÄáj h6BLY14fíMU™3ÕIõ즰Oÿšq1M¨|Š`å|~M 5U.´³âÌlaùIü™l—Ëm†) ÌÅoçüo|"Ã,>‘Qÿ‹:Z?«£5ý<êLGÓ³5þYÙúƒ¢í1)o‚;Y¯NþÇ(þÁ¹ -?×P¶Ê<¬¤'ÿæ™Ûi¢ë&¨ÖÅap±‡9SâŽjI…vºU€vˆM`š(É"BË’üCOIaV¸;ú‘ŸÙ-– (Wâ-Wáç"Ôâ} % K;®s9äËèGÃ)ôöÚ”Å@}ŽKåòóƒÒÿü ÄÝãÃã‘huËÒͳŠnô^åPoüÅD¸tÈè™!j8”÷CæX7™Š§âkëüß›­"e½ÍK?¸ÔÿÖäüœÜçñgóS΃µšY[ÿ¿8{¢%q—dÍ^ÙŠÞ¡Ä·té•fUUÞçv—l›t‚:äå—ÁÀ e¾¯ÇÎ["AAÃóÕÛ«Àh© endstream endobj 1316 0 obj << /Length 3775 /Filter /FlateDecode >> stream xÚ¥ZÝ“¤¶ß¿bg+·2’ ¤üà¤r.§rù\WlWŠØr ÌÁà½ó_Ÿnu «Ý;'OI´¤þüu‹d÷¸KvßÞ$üüýýÍWoÓbg…ÍT¶»ØI­Ež»ÌäBi³»¯v?ì›ñöNÙ~êšSÝ~¢·ªþ1ITWWôzàî멦ƱïÆëP6Ý•?OnºÿÓWo3µ^/“"3 vãVú1QéíNSh%<ߦÁ|!í§ÃÒÒ¦ûM "EaWt S+²Õ$-´,üœK„ŠFÛ9‚¹Í–9Ñm¢f³ë1v¡•¸ñœ˜ e ±çTr‘+û|GÁÉ‚É7 !köOÍõYP'Âæj³â†ZbçWp>÷Nßy +ÚÝÆV¬ªîúsÓ•×~€/d±ï"RÊ”°6÷Ô"Ëg"IS?¡ìª¸â3ÏyŒI…-æC dˆÝ×Ѿ.Cy¼6Çù¤R>!ôÿ|«Ì¾šòÐÖ±E“D˜tfó"ñ ª‹eU-2™Ó$¯>2P±¬0»»Õ¬¯#b·`éî.‰7\gHté>ùn™Ó¸_Xu¿ Ó¹(ôF(ÁvR¡” è3×­¹®‚Õ~Ñ€TH#7vº±Á•6Q.›ýM„@Úñð"ZgåÚ0Å0ãÑA¡VëõœëE›Fçge¾oÀ«ÖeÅVUdBêV…p§MNjª báIš‹Ô¦‹ŸYÔ²ÕÂÙcS;oŽÄÁTm^$ßw5Ó_Ñ;,žUVÿ™àM+Ç~¨šî‚JfÐê2ìï=ɱyìh"­FGr'7àvµî-Ý’)l¬ÎÔrcÏ Ù©Óõ^ÓÍ^ὫÝö°Õsס¦gU#Õ¦£ pš‘úž×ŒþÃîîÒ͵Áu~¾•fÏ Lâþ“È· |LßRc÷ÿ:Õxö$ÙõBd([êtg‚'0d¬ÉYÕ8ã#œ„F€æ•»¨cí¬FêrbÁo˪ª+ðnZjwìkxRs¾ôƒãëzç;û& t«Ü °³¦â® %Kíjº´Í±¼Ö£ÀE’ý?êc ÇA>Ú‡©ÇÇÇ}øìþÖ\þÜÄB?@˜"Ÿ­½lGÞâñTßSóÁhŒÓñô|‡Þ‘ˆ¿ŸˆT¥hsÂjpÄ•Ð øùdÿ—ú±yKwžåd¿ïÞw=¾?ù³9óÄÆ»òcsn~)Qè‘c £ pü´Ø„“U®Xh¹Ü_ŸpO½—¶<¢Xq é¨ât”‡yìÑQiûâý™f<-ôç¯&·w4Øûs¯¬2pñùŒŸ>FÎÃþg¿XÎÇéìü‚÷`Æ>ø|ãÒО:§Ì· Ãk³ú-è“ò›6èÁêÐJ:'Ôõr¢ð ƒÃ¢Ð~ú3÷–çK[S›,¤êØi•©Ì6§ *DÄlF_GhX¡¼™Dùe´~dd¬ž‰£hÈæó>>ðÂsdKO¼Zxž ›ê/æ9F"´˜ì[&%'£ôTøü¶?÷Ã'ž5]G±²ýýmA:Œk'8´D¢®õêÖú&æXß‚ô¯CS£¹ƒoÂ<@Zëð®Êöß\.uW5‘˜Ý#”ƒønæeèÁ;†Á›cL™œ¯UèRúÐ<Òà¥Ê3èMy…±ü ªP¢P³ßEãn¶`^&v=•WZ—`ý~ï|Í ²¥0ºÖ, Ó.†á³ìø9Cãº<Ý·åp Pã‘ç=_ØÛMçpÓ¸`­s„È„GÜ(,%÷Ônûþ=é¼Ã…;¦ØÔûÇ¡¼œÀõ¶m46B¸mÎN/òde¡ÎyDó…Ò•¿æ–É5sólÿTÓ c].&@»YÎ&ý’Å?Æàæl7ΛN⛆€àÂK¸ëg©‚dØþbª©|t·šsDwZçBç&Œåï"ô¤‚¬Ân óÆ©%©übnƒÖ˜Ä2Ä8ëݯ–¯»_°˜$—ŸcÏg3)˜.e,“ }l"7Ïž¥žÓ:ŤGÂr‚\¯A8r%P'tC=^ú®y¨:{ˆ Kž :0Àl‚NXSXfÉ_Â{¿¼‹&&ib‹qÞF§R<Zë˜ZOÁNªû#œ ªQB{‡ÀÖ@½àÙ:ê†'ØO¾ôW‰ÍalìÛÉ#äD’á4Jp†‹5…7Q\{N \7¦ã$˜IôêøzŸÀ‹CÁð  ¦^0~HbEG0œIz‘ÉÒ0! Ú¿: #’3Pê5Fhc_'Xµ²³<‘IMø¯"¢X×Æ«ðàT,Û€ƒ{ŠtÙÂø†4ºy :.4âÇx—ö9.Œ7Ò¾~\)òÅŠ(¯ÑœÝAã—zèßÌ6Üñ¹®<“ÐDÍÎ'ôCšÓ±ÕêíÀmTf¦TF© ™ùWøjxjF*/YÖ^ˆ¬ØÐr¶J¹ÖBìwU×¹"¡>C&Kq£NLá¬vd¿FS'¿€ç ßáÖºÍf4z ÌšÛ ,ùî!ˆ¦‡æ±é|Ìü~óL/§r¤FIC?u•O ú˵9OgÆ 0 ìÊÔžî ÷·`1gË“A¤~–òRªQ "8ǪÊfmÉ+1L Ï_‹©€þ’™ÄÏñDÁ¬ó·ŸycŽ%”Á)MA.Ò‡\ÇÂwS¬ø/”<ÄÔf7b^Û嶤ªuú,ëÅ„Zºo ¼Ι.<–ŒA誶æDºé| ‚rz XÖ½¸¹üÄ_óóØŸ/I|q‚YÁ¨m:‡5ˆðÈRþ¥hö.oAºK–÷BÀ-Ö•Œ/Mp%²MT%’–… ¶|¡vNÛ šIb7³Qøø²R|%6Õ½9ü‹4—ogÍÁ7”Ø{9Øý¶*ÉƬf3S(·ÔÚu’Á¦«ö”[auÃû”9óÈ©8¿Ô+TàA4–­`MðÃ%ç¢8#VWR9 ›åê庒zQgçoŠp«$%\…Þœ~Ù?¢¿©­¨¹*îa,Ñ ÈJKžØtôûsM-i´G›Úe?mª| Njs%±½*f ?:˜Æ{õ°~ya©+“Š$ÙÜÕœ4èÅIë<|MÛÇéŠÀ %Ð5{n| 3µWžËü#Mî|'Ⱥá”~slæùæ_©¾è¶Ñ½ìØ!§%µCºˆ û¯§¡ŸOô²¦‰sIÇ,•#P¾£0Ÿa¼Vjñ§+9¢Æ[dŒóÈ°È⦠ïãxØä‰/ ¤ÕòûP. —–@¸NÒM6€[Áí"ÀÁä ª°é:e8|b(TºšÀs¹D*õç@ÜÌ,j =W˜‡½WT¨hÆæÐ2ê¢%Ó%£ÀÎHQ¦E4§â]–‰To®-I=¬ ¬:ñQÊzÄV·®ÝsÍÍەعÄï÷Q›2Àü3jcµ9ÔÇ«TÏãÄÈôù%×æB.rå%uôÊ+M²×â U°b÷›„< .'¿Ž‰Æåì’wCRì¿ã{Šñä½ãä;dŽÕï—2 ¿‘áõ„–ŒN<•¾°¦-Çà9ÇKœ°F£86N\èÑÖUÁ&¦@ .’j]ÙŸðÇÈ•E2¯èž!\±é\IàÈ_c´ªwÑŠØÔú˜f¸¾ºF1¼Y A(Îæ»äRº˜V¯íŸ‡cæoÈ2ý%毗¬v¨?LË/‘.íVE¸«§,¨žËÎ1˨4ZV —ôΨÉgÐG•7çŒÈ?8\êÁvp›ùòŸÂPcçÂTè"L]` ð\ƒ¿[ò9a'êÀºÐ ]~~Ù j(e¨¨»Òú믈p7—a ݶ¾ ±Ê³fî)æžÂ|¢Þ'n_êcó0§‡T9ÖK–\sÉŸxÊË¥w˜Ô1Ò1mEÀïñ¨·UŒ‡šúÖ0ÓçåìDÚŽ<`N7¢´JŽ¼î“)‹×“r²ë|]FÄ6÷MKŽ½‡ÓÊÙý…54ya×e3X-Pr_‹GñÆß?QA„/Æá¹Ò|嫧üùÓ²\ÃS‰!GÙ>LmlÇÞRN|ãʱsrΰç "ú–­y¹hx¶C¶§UêÎ6ã‚ã‹Z€jÚjǶzÞ&z´Å×eeð|p®rpu±?÷#žð>ÿNäzW²©Ç¹Áõ‡œ;!ˆ+xƒ@ïÉO¬Û¦ï9 ¯ÖL0"²>È þpMI20g‡¹(ˆ¹‹glmówå>Ž“C}i¦<–€!@tómþÊ[ãhÔ[o6ÝŒm,¼¢+Ö¿o9‡èà½ÜW½ûYZt6h@€qºÔT¬|“ûØýY£QÌÜ·ªÒˆŽ”¾x.+†š} Óg5Ät©!®ËS¹°euãðåDhÈ—1é¼>¬b›_yÏ;•ùÿ2*³ÀƒìË(û]Š‚Ó¦knú¸hÐUÓ±fJO„“³Ä‰ ®\‰Èîߢ6õL%Tîb.äдÍÕÕtäúßÅàÇ+-ò¥Öù+r{#½åoC±€Š¥˜ì,êæ÷7n0+JvrìT’¤V€> stream xÚ­YK“Û¸¾ûWèHUFX AòËn<®Må°•Û:ŠÂŒ°¦H…'¿>ÝèDih]µ'€x4Ðï¯Átó´I7Þ¥Üþüðî§û¬ÜT¢2Êl7RkQ˜rcòB(o›?’ç­L“úe»Ó©N\·ýÏÃ?º¯Ôb›N…* ÐôëÝØÒškÒ¥(Ò*¬é‰œÝÊ<ùrì8ºî‰ÆjjöŽ¿ÏõPŸìd‡xßNGK~žÎó$¶»Ì”ÉûÏHÑÆ5ýüt\¹10'²ºñ©þ„r°ãåtزÁ!M¶ÙI)ªœE6Â…·;•©äà¶*O>»Ñí]릕I=Žóé<¹¾£UÔJâ <ó8²`Çë‘ÚÁ6¶›h q<Œ@gAº+,—úEàç7wþ—Û¯°­¥Ð¥Ëî"}"ÊÏ®m™o™ °+¶áúƒ}ìd"YyÖIÓ\·í Ÿ‡þ07¼¨îxñ0ôuÝ#µ$ Ú°oí‰GçÁó ]Ð<õÔîyÃÜíû¹;؃ Á8éž 9L7;UŠ\–tk%´È·;™¦iòÛ°•ebϾé6Ë×B`†)üÊjœŽn$y¶AízéeÉs0;6ƒÛó×Ø“‘€1 u7‚ÜNõtQât¬YèõÀ;¼€`}SóT}>·ÎXW£ê®!SMo”Å2ìEQâÃÜuÞ!ý¨;ñp«™ºAÅRÿ{£;[rm >öê?»éH½ý©Ø&šy/ʺ´2"Ǽô=rdë…7ÁÞ_Ž¶ù¬‰OùøLö¸øûÿÂ%ÝäÀ¿ªÔ¢¢³Þ9ÛÁÙÎ '‹Ïûº…¸'×Õ튻Ið•Uo»DÜB†eGrpá±GVŸ»p¢782 -#¡QïÐSÛõ¼ ®ŽE£!^ÈseV‰T±1°\Ÿm‹º“’B‘Œ>7Ò(Ÿ‰À# }Ló´ë»]¿GêŸ]?í JZg!¾½lMî#ˆ¬'¬ðÝò†4‹zƒ7oD@`ìÛÙ»ÃÝšõî· Ü|Â`¬€ë&ouO”+Ô…†Ï:ꚦ´ÈÞL_¹0•\DEˆÞ¯9„¸‡§~LS5Œ|·¨ˆ˜ÚTò¸´`hÈ‚}6ëh(&©*!‹âšýhx;U˜E|„Øu¸zBQPÊ€ñšT'•Á5+û{¯N²¢@æîIŸö®#Â&ÏuÔpnu4wŸ:¶bÌšeAÖP3¨C(NļP?H¯4 ÎBÄd„Hîb5°äy5,ÖíˆgiÉB÷#/vðT×`6Ä/{‰&þ»>õÄh–™ßqe“0pîaˆ7ì_ø¨þ†6ë›—we¯­ÙšåÂP3‘©,ØéÇTšc.ÜÅÈÔáYJ%ǹmAj“‡#ÕíXÚt<Ñç<¢î±‡y[º)H–ߧ0d`/¤½°·£ö÷ ñ“pAݽmÉjPq"80F_kꗅЪ ´Ê¬JÅTBkùÃbj(êyž¡%uƒ7?øf kÁí.€ Në…Á!n}úÆÎ~ˆ·?ÎO|àÞv#ÈÄÇ!òluH˜cxQˆü&$,ÑgÔ€¬(zDHÄéð/CZ1Ì+yG…u#@×1­ß½7!¯üoã,¼®dè¯d~cW”­(ËòG”Ý@š÷©ˆ{¨´ù½ c4@ C.*“‘¶¸°€šfÉ/Lk´²›…§SÏ{CAæ¦Ü·Ër!Uñ l£åša'ö›ý7 ˆ¹=P5†í`O‹ÀTV@Nîêî'Þ¬s(1Ð\È>a×!J€NdbžÅôÃv8A1îï‘z¿µÈ_j„ˆw<¸”+®$†ßŠµ›-3q ±"uÌZb–½éRÿiºªÿ*ÒÈWh@ñWU*_©y ¶)Ý9Êú{ækŒ–nyühµ X3o±V|k1Ö鿆7±œ”P@÷Í"ú‚‚ ¡t.`ÒÜ”ÎsƒpШ…КX®• 榖×Ù‰§È1 –Ç-nAsöØOg&ùw(™aþ¦d6_+™s¥)¿ÃWU,™ A Ñ€ý<·ªR°AÞ:±5Ó2RÜín´ëü[Ç›±Š—¶wS¬á¾§ðYDY]f„j±« ôãXHB~+N~øÇeWÀ¨ä7›2 ðL4FèàLåòš4Dê·UÕV—AÙ^êŸIñVusd]”¥€ô|— ê Þ*éÃr…o/n žÏ ÐøœaI¡³ä׉§FÞKÚÇí>¤¶–¾ígÀSvÅ÷•Ä}Xá|?Í«tçŽ+Dsµ|˜Ö€‘0*ºðßVƒI™G¹Ê×b­DY©kãFû¸·õ …_؉Ú¡¦Ö€ûÀàÑn0äÙ/iztÂ5>»áæÅ{ìí4Òë]Ê(‹äÉ3Öl(™Œ!A¸¾Aùþ ­ðpâÇÂâƒÛ±Dd…v{%bD¬p©ðÓ6ûU`Äó2ùà^±\wW·b:ŽíØëÛÏ\H@@dI¶P q·ïø¦ XsGé{½ :ó4ÚzðxÔÀ@Ý6ý0ØñÜ3jÀyoô— Ë[ã4—þKŠ Tì§î+5Ì.[dìÛµ'3çÏÂVÀÿ³CÌ„”2±*~C2ú¡ @TgY@tñ†}zš\í„Ÿ­/àªû&d %‘¹¹ÉžXH¶€H=ˆÓPhj¨Ú0¦ìOû´¸±kèa TÐŒ¤à¿çqoélTU°Õ lýÆ ³” ºŠÏ7ØïR_@AòªÂ$g}0U$7œòjõ“×è;Z¨oŽýh»ëà ×™ýûTŸÌªðªŽ[¼Æë˜g]NNoy¯ÞJQMõŒ¯>µQû„&U¯œ®éŸ†ú|ŒÂ”>ü½‹ÿ"‹UFÒ?ìƒìç¶fœ@¸ ZO@ ô^.‰ul½e¨¾a  Œ›è÷êÍ쵡3ÙMü7ùbA%¤,!M”YÁ)8dgê’ÓÀäÊ¥u^ÁMôuf+„r‘•ºþ¹ÂR&RÀíJ¤E~ý²¤’‰ªÄ\$@àW÷¹!•Wùf±èË*)|NY#u›E¯Hý}QçêªZû°´‚ yÈ(ˆ5H}Ex9“ÅU¦ßºØÝ×.EzGx™Ã oYÐÁ„^Àìát¦gƒ‘¾¼‘.wÿ¢ÑèQðð®Ln2ˆ¾ æ]U ©Ù¤Þ]-zÿðîÿnx‰ø endstream endobj 1337 0 obj << /Length 4149 /Filter /FlateDecode >> stream xÚí<]ãÆ‘ïó+ø¨A¬¾þfÁg;Nàà‚³±‹{‰ó@i83L(R%;óﯪ«I6©ÖH;;Þ»Øf³X]ÝõÙUÕóì)ãÙŸîxx~óñîßþ¨]V°ÂJ›}|Ì„R,·.³&gR™ìãCö×Õö¹lŸª‡ûµ4|Uöô|욦»—fõkÿ·¾ûîã¢<™Ô‚ ­3+Ës›mww?g°èŸ2¿ògªp&û5C0~aÁÓh-`u-L¶–’Ù¼"3’qY(iÔq2;TÙÝcv÷£Ÿ7¬L%ŒaMÁþÇÛÝlŽ´ŒÃR~Ê´Ç‘büùÇ /ôã°ˆªÒ¬p¦3coØLjáÜ2¡²µ“Âñú²&Ò—Ìs¦`hµd…*H_DÖ–¡Ä<ìÛ&™tâF˜|g¼/±FÀûúÌ(Iœ‘4#m®ƒºm¥4êmQŠÏR©pÌÈ«: X3ò„N¿IÈâ*Lþ/á½Ãÿq¦ÓARI¥}éô,Ü8Éœ,Œ†Å.q/wÌZá2m™,lžŽ6~žû¤`£ ¦”¸lâϱyÆ+¥lSXÁ¬sŸc›šÃJ^±MÍ5Äa÷ÿ$Þ|Á¸toy^8ƒÆ^‹8Ûµþ,¥*tâšR¬œkg”TZ©AasŽjýy~ÞôWH#¬ÕŸ@ ÓFfŠ3a\H¬¢8È·…‰iÍ[­æÇèŸ`g¦\3¦ qSøK…„%Ñ4A2-s–ŽHg2ÌÙ)0GZÓϘ`î<¿Ä$¹y3wɹ6gÜ:æ$@bî¾Gî¼Àïrå¼2%r°`EGw&ƒ°^R'i¸÷4™…Tcÿ0NdäD3wɤF{{ƒÐyÁÔ>ÚéKB‚©< (^š?“f 4Ñ™YÔ¸Å3Þçþ÷…ýhÎtÚ"®/ûQšë›ýèªu½ßFA…š_á; Å|ŸûÎé=øž,ÝW«×õ6Èá„W,% ]1•‰Ô{ÛÊŠÓB‘=—ÉÀ¶«‚ˆD̾´¨Žø‰ ›’ƒ“¥p¶5½'êuOĽx‚]Ø@[±ûµVzõqØB¹ß7õ¶<Ö]v69 ‹¸Ê€íî‡t»ý¡ê{šk8lÕð¾ªèeS…TÈ µ;5á·݆„*% m5üá±;ÐàP킬Q± ;<Ô[zŸì‘¼ %Ÿä…­ñ=´‰þ+ JÎr‹=O±£Øë6ì÷ÃËwòBo±m½DÏÕ†)7¾¬µ!‘úÐ퀌ÍiÓT»þ+´Á|ÕvÇr㾟»> ¡ŠðùÍËÓC¡ä%ef?—è ¿ ÌRIm×4a3rۮ퇲K $zp€ó¬‹Ï­`s!Ç“³–vÅ”ãéAæ†'dNçmù>AÈ03ù‚7·s¯‚SÂŒD~G³’EÂsrVØe¶y±Šø}‚‚fb2°&ö@¹ñ`]÷Xÿ?Ò¤‚¤ebÚÉC‹@6aGuJ†\EÆ®’r-r7àT"‡QŸà¬u¡Þ&o þpoQev±d® …¿ÀøƒÖôê¶ì+okvBÙ”½Á°VÙš6/ô 3 È‘Ú§¦Zb'6¾ÆÆv÷b-ŸåL^¼— îúÿX\6 à qYr¦¹ã2ˆÊA†Ùt>uØñ™€3ç€QüçEÿ—¹^ØÂl›ª9žO±Lê¬LÕ²v¡CóN§·û¤Óœ5+þºEá¼lú®9ƒ…7 (L²KÌ}cº]$«ý ¸>†%¥(EV*Ô~Di|;†X`¡í *& %úŶJh¯š#û¾d¾ù5óŸm¾22_ ÞëÍ7Œ’<¨ýœT¯™äË:RÜzÂ`—ú‹šÝµ¤Q/¬Nq½ú¶ e$U‡¾š—²³'¯bag»DŒÃ‘X´—g{#™’1(rÒñAŠŸì›Î[¢xí!]IÏÍ-’6ïž“ÿ@®Öƒ±Èª_øÙìòŽ×&™`¹S¯Ž9S“\)ÿ¢u¤Gaµƒ«ö¡ÿ”`0 9"ÇNêTÈ»²û|AÞoeKƒÐØ€&oøÜ7§'ÿC||æÃg,ÛŒ×ó°aoH\«U ña<Öa†d[î“A–ÓgÊÿÍœCŸÉ{‘À~_•‡@ût ^ ŒÇ·ÝéÐWsrÓn°ã”²§z·ohKÔ!!…ÞЦùÁ·á†lÙÏý»N÷­Bçéܘø¬½âOJªEp@m?¨•¨ï,jznQR‡o‡nG“(ãrÑ}¨Ê !4shYí>¦G+4ë œÚG ‰ÝL2Sù2OR¥¯Q„‚7*ø¢¯§MSõ6Ðóê’ƒ%`ê‡ú³SñçgúŠpƒdø“”jÞäÛ€«±â¢ÆÔ_ªº÷êC€ä\ÿžjÍœjü÷=v8zº®)©®G‰*SˆGT•ÁóÔû  ¨ß‰Pþ\ö ;o ãûæ…že°vÙN€(‡‡ªí+brN©‹Õß«Ãêà‹%ºVÎÖ®êGš7(Û†”ÔÒÙcÕ¢¶7o£ë¦Åiˆ·C‹pQgÖ¾vŠŃ›H´7”šÊúÊÕ CPZy1©]ƒ£Ð†‡ï‹Æ$|ì¸':¬4~e¡øÚœª€ 6È\dBÊ×XqL ' y䆊›‰9Â7¡_IýF86»`‘h§`¾¼†gRŸ³æ[;¦ßË|™Ê‡éšö,‰+ úZGX˜2·ú@·Cz ÇÑ Bxœ"•wÆÝñâàuñb`<ñw©œ RM ™–dUÒc42‡’ÚÚ‰…ÿ@³L›E~&“ùsqÆÚ2—w¯æòøäé×&êÂW9wÅܲB“Ÿ‘!ô…ž%=¦Íâg) ‹Ø Ì^60 Ÿ5XÀòêHÖ“Z|¾dó›%ûŽ,]6á©þØ%¯ò @T·[‹üÍxŠâ€â@®0=¢p%!œùËDâsjm‡Z¢ÛÔ‰Eøq€Ré1]§j3¿*įÝüÔ°«Sû–j“Ö_?YÈvðœ8é{žÑbm§ûŽŠ;žû…ý§¿P€ÿgž‡ `L·˜ˆo)ùòÍOíè‰ÓªÃìË@4d»õ¶{:”ûgØ@C|ïúÞ˜Kíû/°oºå¤öCèKØÐà H ¨pu|B"Ž$9l°}h|¦îÁóS„Gu~.7Ñ:0e#8ìŸþéžamGït7‹eqb‡ê‘²Ç<œÖ‡:TCÒÆÂö9§\}Ý@)pz 3öQ®?G§ïÏ^}ðeSUäk‹¤êž5ø”¬BùÒ°¯W¡_Q½áïSðþ2>*ýUu¾¿Ta@y(ŽÆ *q[]‡æïÓP×@½¶²ÛÁŒ©0¢=Kº9¦Ýá/§ÆJ|ÁA1?ø_>ôGªŽº-Ê V¿V}»›§ã½Í24–I9Šç‡zÿŸõ&AÂõTïÏš*`•}XK|­×e"tæ‚ c>åGm࣯ÆË ß°9TUÔßûŽnÔö8ŒÝܶ{óëaâÐñÍ%—Hý/ÎÁ"ú}çHú w|„K9ü‚Þ‰ (hnt €›²'ÿ’>FŽdÔÌ‚ÂÔpÍå)VqT·aû’\büCÀᯙrøÑø£Ç`’ëÖwïþ„è- endstream endobj 1349 0 obj << /Length 3277 /Filter /FlateDecode >> stream xÚÍÛŽì4ò}¾¢÷--qBì܉]  V{³âxHwÜ39ÛIš8a¾~ë–[·ç̱g÷a&N¹b»Êu¯Žv»h÷Õ]$ÏÏîï>þ21»",2íîO;Çaž™]–æ¡ŽÓÝ}µû.ÊÃÙ–ãþÎUðT<ªÛʶoê¶,ƒ\ýІû7q®ƒ/Ê£àu'~Ö ^ÛUÖñ°)Ÿ§å†¾«Æ#¡DÝ«4øyèKžýi¯Ó ìk<Š›>Øÿpÿg äRa‘N‡}„bÇ®d‘ Ð÷Ö]º¶ªÛ ?kA}°=ª÷û©vu×: (W‘P„³À:y뽕Ñ6;öõ;¡xÎëºó8À.€MôËG—²—íEs–[ #½úÊ•Cí¾"M» <Ÿo¿®jÜY0ºö áRâMãè%žùØ Ô¦à¯p€¼†%:¾IXòãDZtk·™ù É°ý3¿Y8[×ÔÇòÌïO{`)“$Nðì-rضÝææ O?‚×¢{ã´ñà#ƒvèÆsHYò‰Ø)|jàÆš´€¡¥c(o€ï£4êÚó3<O¡Dõ-oóYK¾jü†èÀ¥íàdÙ¶šÐ촆 ¯…GþøËB¯45Öi˜Æ@¿vgÆÙjsf…špB"üMœ¨Pk%ôg<÷uë¸ä|%€®_ÙÈ„),%83µtÇfº—EÎF×ó ßeÎR`ï>1‚¡uËЪvoÇö8°Ž’ä0BÛõ ËLœ`,§:Ìs³½ðûG1EpÒñ<¬-UˆÍÕ+;ôõq¶P‹• „¾{”†%>I#èn¶{-ʳëxœØ'Ñ$öƒ­øû¡›>=bºHªåVªPé²4øW ”#Úäóó ±J6z¿ÚÚ‰éÑl aÞË]œ˜¸‹ÈÈ]Y®ôša4€f¼n Æ»å'[¬Ë¹“­…,Lñàê_,ƒx*›¦Ò[¢3°4_ËÚ®kd…cé¬CÒfnòj¸·Pþˆ'|Å€{,ÑzÌR†—#—D¶0.e]Éý¶ˆö¼˜+˜­åîÝxpöÇÎðîb{Vr´Ry¾²RìÛ èa›(B\pcöXƒMöQp"õIAžÇÁÕÙ(Œn›áì'øv$ƒ 0>t+oD#̃%IO¯4"ÕW‘^kP#èàðÁÓÖf7,á6Ïõ¿€7© ËFA÷ÿºZåbéæbiž¼)9Iœ&Ir<oÑËž—sÙ¶%¸k§å8ByÁ’wÃódlÀðYòƒì*9¿láMßµV'~BÄ4«aOÚÀKç\MÞßVFáfu¯a?“F»¢ƒƒ·y’k›=ÞÊp!¡ÄñÉã”*B“ª+ÿp÷ÅýÝwvj§3ÀÌ.t©|wlî¾û!ÚU0 ‡ ãÂìžµÙé°0ŒÎ»oîþÉêf;PŠÐ9,¥B£ oz©/~§¤Ì|0–h â‚|!Õ¡÷ƒzé‘Ârð);xÐÍŠ3Q‰ã,ÛrôóBËv˜ î-—’8Œsõª5ÙìhÙWÄÊUGAœ*8,AÐÖ(!„¬«Úƒ*nE 0È:à@ 1 8‰è0f#Bóu”x'a·ˆào`€ô…)æXQ|êÜØØé„dÓñ³iqÖWà"ªÉoò$GÖN{A£ßsžË3E˜/¬l½tª%äy‹Á‡gÂÞ¾@Xö_!L.“34” [NîOY‰ÄV8¹“ÎƆ›œ–äŠaàêæÂr›R”ÏÞVãå\)ôp¬€èFﶯÑÌÒ¡n8ÉWßµGÙƒ< ,¬¢t}n9f it…³!õï˜y<ÕÎJä^r<ïËqšÃ«²Gœ˜sótÊŠi¢›W¸eˆN¢0ÉÞÉÉVÔS‚Áª…[õ•ílǯ¶•ó¡_E <[‰8عô„Ψ†lΚ¨é‚6a:•~0ÎÁmEQ|Žý°Ÿ¥Xu¿/ÀÓsãò–,L:L˜™U3 6ØŒ¤$ÇDKy–'¤³£’篺‹ji’âlkmåÞñóÒsDõXÄ©ÝjAÀ³n­ç=»ª ’Œþ¦žÇù˜?¯ “¥ðôr–“¬²JZÌ—@n29šsA{¶ w|ñt5½b–ìÓx^ ²‡X%.SÆÊ f–áæA^•º|E¥jNmáeà’2¿l»»?Ê”Ãä Trâs=È:«Šu¬¥š‚pÉ6ߘR«ÈŸW-«ŠJ¼J.]©—rÜð€£™Š7X”ÃöÍ‘ZÜjêœÝÔêdMŸ’¥ÂîWû¦eB÷iP^…àT#¬xÀ"«ÁþÖ¤Rf3Xœ³DyA2Ë0²‡m'Çãy 3;±TD G¶Å¾„MÓçp…2‡ÅŠ£tYs8Õ·{Ã]9˜sÿ.Ť,DÞ_¶4òóì¹4õ/óoÒ™%ø«²@© Ü# «éwÃs6-–ŸYÌV_¶*äx imSÓFU펣ó7Â*þ ×%H®Ëúìæn=§2µ›ÐÅch’«Å²ü]üÍ‘Í·{4¥C –ÕºWƒ’OÑÿ`}©i¸Ðœ¢~a#“_H·t:Òa^ù9Ì~Ž¿]é¦NWfÑÉçò1Ñ\¢e«SwäFRæ–â°ïêùÇ:1:é`›„åO¿òHä7@q`›Ë ø Âôã½þñNL‘§ž~n…x²V,k%äy=þéz¢… Ä`2ðù9À6ÁMy¢åèÆvâMúL½ óböÜO²)¯IrùÍÉGü"•dÄ(ré(¦ào¦®ÎÁž;Š© Ü]µ¥€Òúì™!ÍFú¦Å3 êøs{ˆ¿[~rp™\gÌ5÷Ê#±ZbnúòØœ½5"l%ê:Ƭƞc¶D",?+äÈ3‘vøD00h$ÞÏ?fÜ©, c“`C$T“BŠ³Áúâþî?9ƒ©• endstream endobj 1354 0 obj << /Length 2855 /Filter /FlateDecode >> stream xÚZK“㸠¾ï¯ðQ]YkEJ¢¤c²Él&ªTÒU9dsev›5²äè±½Þ_¼¨—å$“ô(?ÀÞÑá‡o"yþæõ›ï>%ù¡ £Íáõí â8ÌL~0iê8=¼žÿÚ·—cœê |ùçë¾ûT¨å&Ô:iÄùc¤ 3­¤æ «ð|9•ŸœUÁ­ìWuÙ½$Qð-³,p¢Èp±Ìµ–áåê4ø ÿ”õX¶gÖ¡õF°ü¶wƒcV!:5ãõd;´àpÔI˜˜øpT*,R¿°†.ò o¯–G¸7ø•z!ÝZ× =Ž³ lÎ2ßò³äGCš¿¿€’k-h’µ`ù+ÂR];¸¬04²À›-{wrµîdG´¶öc€O°ÕÚ3îMóÞédùýf»·¶»Ú3JšgÁç7¦—uÍŒ|ÉÃfãA k'MÛŸX‹6|gÛÔwþU“…Ú=#ª‹­¾ƒÎÐFT œì´D ÷…gÉŒO·y¼)òJLJƒÞ]ø")2\Ãäªìír#[´ûÁÉvlÙÙÁÏ6 >¹¤Ý_LŠþ¯ãŒ–Õq̶ê8 :Úf$±&jùù‹íZþ÷•„ «5ã  4E¡t¿¥QFbœª˜Æñ¥|ÑѼÙ@9Yt^Um]Ûj SO£ànŠø|Bxé˜ajøxQQ â—¾NônYÎûP!Þ]ˆw³wïÇÙÞlsvÍ;ËQøá²d= ÕŒõ “o›É£Hw½Ì¢.!-¡’°H’õ:çÀSÊðhè`>ø¥/º6ß]/¼ç3Z…C>1ãÏ…¾8òéäóÔ|þéäà®­ÅÒ•¿4¥Á=åÙë î÷õÖ‚: $töÚ¢|̘?b“¯R y²hþº³¸˜;ÛŽŒÊï Ž„çTV_@ w|]ïD…‹pÂÞ8 Ÿ½S¥èLŸ·’…•ß²Š¥O…“ªÈöá8ã%A¡Ù¿ÝWbâu.¡ fÿÃb˜O |xÂÉ¢>ó%%Ðvdùj;²‡íÈü™Ã`Úf|ÛLO.‘Þ%dÚT.ôkÎEÄ¿9dæ©Úë­¶ƒå„îeñùó*>Üß`“xð;Y„3'OÇ·;~A‘€$€D‘$ Ãl i>OÍQVmÛA¨3FÀYh3³¸á¸w úÈ€ád 0qä”khveؽ³à$³ÛœOÙÆx5a°Þ ,7‚‚*† z9*‚ ‚¨dN²ž_0OZ{Cá{8@œh‘ÆÀØÉ.|Ee¿“ÙÆž·> ‰!¡^BÂ$ ³$öxïTv?¹¦ý²ƒ æ3cȹYpU®ÃH`S˜jQþûKë*»Öþ{ ²²__ 'ÝuÅ?.®ºHvnùù·Ü;ªávå! aZð¯¶â‹]i‰–XÅ G‰b íÀaÌÑ ¸NÑáz~ƒ-¾£gÛA ÄPMöÐ` f* ®…×è(*<.½Xr/º0‚B™³EéLêÝ{Cø2Ÿð¥‰Â,£‹ $‰©eØ{ò’hwy½º%7߈òg†d<¯´Aù43‚p ÁÜ8ô6c‘ç X³tÚžŒ>¯­§ÀA6Éýˆþ±(à+‰2Ù œûnÛÏêÒ¶ý.Ìó®9Þ‹†^x¿ÈNÑmÀ$‰¹p/Ä¢,4ÆøÈù‹»ýÉv¼ª¹<š*¯‘cD—¼ÒÅŽë¡Îbê©äÀ^èÀGEʤQyêÛ²Œ³õî/’âP¾à Â$K7Ƚµ{E$¨©óÿ^DNufå,Ü^pØ \GT2Â=–Œ(¸©q'TrBì™—ïf #·Ê!ÑRYeÏ4ÌRP1ûš:—täEÈaA¶-ɽ¢Ù½ˆÌUFd¼‹Á¨·ˆ‡{©D#ªxƒÁfD:¹e8rxF¥N’÷ÊF$<±^®ÒÿÃFº d±þ ™’ïïHBŒGmoŸÀfªhWÆô¡øÒ¡RkÃ?ïÞ9QhŠ)\_ïh®RàQž‘˜¬5ù‡¼1"J–» d*6‘:E³zRßRE‚Óè‡=9/‰8çÝ|rL Å˱Ç)ŽÕ¦Âz¶ä‰tw'ip…3P·‰S,JI¡þ §?§9‡É ¥|Á¥wmC¾<^ý‡gƧØüd/Ž@â³8Z¤&|õdù”¡˜by°w–˜ °X’€zõP’*¬(É.4_Ÿ÷ `²ôZ»æ¸_J.ïU€Èx¯bãFç=¨2cô6Þ"!dɘø=§ÛÑ=—¸ãµßD”Æ€# éäÇÀu-wûE{=¿$LV-¿x'ØҰȦt © ³±&OŒµšÚ\8Áíµ„K@½Ú²!pŒSrôÚwŸ´ žej•›ÿA½üA=ò)ZÊ2NŒiNt$þ¸hž„&)¾*sR¬iyTÁ®’–œìrºi?¾rJ7zusë'3øÇ$3v”nv%LC£¶šôM-Tß+ÿ2¬³<ô‰Œö Ýh_«¨­*RÀètßIÔ÷zŽ\ çå‹Òà˜ÆiðgÆn:õ…ãÖœò= Ôܳc„VÓ‚ÕHÄÖ@¤ÂÊYŽD]„ºÌF:_H¹Dj»á"‰Z”^%j ô½Ò&Z×4¿ËZJ¼ ìÏòI±ôÚ"Ìf×þÕŽÐ"Ôzbø¡…¿Ky42šØlóÑa¤ôªØá2]!fÇÇ¢5¥Fšï/{|¿áCäÉ°oÁìÔmç,Sçtë¦z\äÁï:®¼œû:Çı{ b_EàÀV—Æýk”WÂ¥1¢cXþñáÄŲYŠ¯¨j`áðkN‹¦_8ýÑ×sP¡ô¦˜>áv°—RÖ?yaë‰;ÿ:¸nbá‚Òöâb%›z ™ïi™Ñj+@RØåà :)$|ÛÍžÇæ\â¯({i„ËÁûò—³é—5'ß («j¼ŽµýEŸ Üt1øuú‘|Á‰šÔšþ‡ÃA™0YØ Ê%ÈŠëw¯ßüDÐ, endstream endobj 1366 0 obj << /Length 3044 /Filter /FlateDecode >> stream xÚ•Z[Ûº~?¿bm VxѵOMŠ$M{P´ ¤@ÓYÖÚldÉÑ%Ÿ_ß¹Q–´Ú³Ø—%5$‡Ãá\>ŽWÝïÔݧ_”´ïïyû1Lï² ‹M|wÿp§Ã4H´¹‹£$06º»?Üýgóùa»³ÆnúSÉKÞæç²/ÛŽ¿Ïù•;{™P—[mŽÛh“÷nk¢Íü.ßÀh¨‘O½àØ?aᎋMdjëŠoܺòÀ=7áóßû¿Ýítda­²HÄ?ç4-R›>ßWe>ð‡ë¸Í/—ÊCœÑHK‚A§hêžó³¶»X«Íý‰V†™ˆ “¦¢N87žÇÐvÂo¨Û²ÊûÉ~(·šKÌ»'Zv€Îtø|h›3÷Æ©rJ$ñ)QÜÄnþÑô4Ï´Ýi¸þr=Ï&a¡­!äÜ´å÷Áµå¹¬…þд~KX³"õTF­Y•Ð’M@ûÕ ç&D;0ñf¿5 ž‡´‡¦ì¸—WUƒ¶óÈŸ¼?tºæ,,‹æ@=ÒA ÜÛ™™Øµ‰ o™Du]Å“æÆ1¬’9 ¿0³›Ïkì4xIû™¿¹Ë¯n¿ÂÐêÀ¦#C9õh«ÖDÀ%™+Ql­Å[°ÉL§6æË2_JÒ‰Ra^ò+ØEa]öe‘³Îl,V„T28 Ì6NØ”‰¡¬ s›A,¦ë]Ì kU]#½Ë¥Ì1\àªñNfæN&#Þ„q‡5Ÿþèj0ë6ŽP­&ÎÈ~LŒÖæãNqfqiZr6Ú_¹ý”sî~U‘2JeÐjaôxj&œšö6žES3cY.Z‚ÐÄßNÎqD½Ñ„¶Ù=™Ž°úìjP¹IA-çKEþ1“öIÕº1k±ÎFóûí×5cNƒ0çà9ßçÇ:GÃBÆeÏm^ÜñHñ’su¾í¸Ý—uùU)S¸¼b z9ñ9¸S =NN2rX>œÈµÓ6 T–Î5—¹v†0У—µ¤Ü×ÂMÓÀzŠ¤z` ¥£Â“¸™Íûœ³ˆ\*/%oí=*³7Ž®v=üéXmƒ4þãèþ7ós?¹s0þ›£ãò 0~úÈ–ð.°ñmpG‘wüÖæ•ûݳ€c;aýÏò0´íSaÑ«Ó N™Ë=9jÁ¹| ᆠ#3poǦuýéÌ㜙q`Ýp ¬5/Dá4ˆ²ÈÏ¡¨¬J|ï*×_y‡âTßØy2NcH=Î {90ŒµxàÑ%„yÞå;€¬‰þò—¦ù†_!; PÙY€ ³L£ÃÀ§M=$à7}À¼™aâ± ÉV’– Ë‚í«Ô«aŸ·?\ ò<ÕWQ|Ël3ƒâ ÛÀ]&Ñü°|©6šÉ Ÿ$³ 7|Ó®­®LoN-ú…±“LC«¤=岜³4’tB€í©Ì¨4m¾l1 ñÐA[ÂUûÏVö¤èb1ÜÂV?ðOユ§LÛ‘·(³y'«»Æï•w YnZ_ _äk1Þ|ècž@P‚gšƒPË3Ú$ј^â' ' I`‚.é(‰ö eª$@%Q†KäF9T°"ùþ-ÐÄ+ÄnXáä/•¸›£zÆuΞôÌóî3¾&•ñnSÚûzöÆ@9V\H¢Â¿8}%tí€ÏDNH`1›Eä§m©h2k_cŒáy‡i.‘8Ô|'A÷ Þ>¨ÂÇ眛㤚R?ÿ°˜D ±ºùÑ,AÀ¹;!Í$±™D<‡0¶—Eå÷À8²j„”cúBJƒn%‰·/§bóž71d1É»šÒ/-›%Š¢ ” ³Z¥ä wÀ4 7ŠÛiȹ-Ó‘9+§ó””$€à ¤Z¡Æâ ®,x»„YúÚ€…Œ‹æ¼Ç÷ ò§{€Vã´0»¥?Puyëðõ‚Ö…Ùæ±JldÝ¢÷».À*†4o¸NõX ­9_†^>ä%ÿÌ9UDå¿×žØQ`¦Ðd·æ/2 ˆ½ 4î,UO©0YØsÎɤ.'õ ¹Ñê¹Ñ2ÅùJÒRÕs"Žd88 68GŠŠ0 …&#ú"×Wbؘ*`Ò£cÇ>àÆKTSJîÜ¡ô,ü´¡m©Š‰ùâùOwÎýÃwk»Ä«—mU`TöjÜlñ®1ÄG™äT U®›Þ®¯!ä•¢º ËÅ’|€ÂÐy(üéjY0æD<ÀìÈ~¶3gaºV|6 ±(‚(oLHS~L«•ÆŒö…C°{Zv"cnÜGÉÙ[$¦éñ #Ej"GfÒs•s¶aEJ%HoÞÙ7”˜Ï¶g³¨„µm6aÁ…˜«'³û)94å$º $½‡K(ó˜„Sraž×+Å1«ÁïÓ1î;˜{$×®•dÅ"\>5Ù0Møj‹ÕÙ¯ ²ÆLžßæð¦“-ÉŒ3=š1Íj*MËÚAÄõb“äÏpøŠIÿ.ýàЋâ³'q ÃÅsôψr Z꧿þŽ .Ö›ù÷;ydà<ãBŠÖײЗ]Ï=Bxyuñ›$ßNW«°Ã–Ècb耙՜‘êÎB&W‹Õm^^ôòÜÊnð Ê°ÉXIÅ1‰#‹]šõZ©üÀʤÙLô?­Ob ÙŒz¹¸Kåö;„ÚE»£ÒÖ<²µPc0ÝÞMoVXÃËG‡Ër÷NBä.±»c’„Ì“Ÿ‰t`Ì1Ç;€)zYj©`€Úz—šÝÑæ61±ZÛŒ=ŠÆs‹ ,c.„¼$yñG9}ûAx¢mNB*ñ ¥Ÿñ40%1Ä‹µ2 ¥F%³Iîù?jZð› endstream endobj 1252 0 obj << /Type /ObjStm /N 100 /First 967 /Length 2376 /Filter /FlateDecode >> stream xÚÅZßo¹~×_ÁÇ^RÎðpIê´h®0’ ×6ȃbo!ŠÖä"ùïû W›³lÉYÉ›ÜCjwHg¾~C.y)ÆòLɆÿ“°¡ †rÁ ÉÆsP 1œ½6¢‘Œ>!›àñ&zºÅh"¥ %gbÄILr:D`“B"›BÚˆèîHe0§Ãcґɉ¾ÃP$Ú/â'•*Uš •ÐÊú'¢3k ¬#ù€âu”„1¨ºú"]c‚\ªã©úY0Q†X®ÃeŒT˜1E‚DQY_Øx_UÁú¼è˜>yã£×ÉÞ¦X'ã‹«ÃHNWàK4ì»gÁ0×Q02©+à(ªTκ«¢07®}“§j`T#žª.Á«Yõ‘8(P õ'Áé`Å£%qB I¬Ã‚»Ô­LÎ@ úã_p‚U³Kha™xàÍ®E&;mA.¨í¾ I'eBdâµk.jzŠ@]ö Ô® P£E&r©oƒ‰Xò˜!†\Å€™èuŸÐ‚qÑÊ&&ÊX„÷h©…™!Wº–3‰Ô" S¥Î÷Xg¢€š®‚¾XtœMÊ\ÑRÐRG3LŸŠ/e§¢¦f(–×AùìY'â2GUJ¢ÉRW (åˆ?ê–ëÂ`Ýœ¤vMh)žJä’oÌײ~¸kýÀ§[¿Wuõw…;{"Ƭ&ŒaÒˆtøŠJKÊVç@i—lF^& üÛ˜xLìzéCœÛ‡Š]¼Ñ|(ÊP¤ Hî.(ò1 ÈGb´ädS*Åj¶&ÍY¬ð`iE5‡I{Î6y( Bby°°¶PþnàÄNÏ]&¹ŽÓ³X©’ÿŠhÞ¦Ô3%h>r/é•~ôc°î·} TÃÞÒ]€§p:Àûåø®ðàD6îuç>é‚Uv8LZ€‡„q¿4ügâ€=â,ñ‡@eÇÍ»8Œ¢›¸ ŽJbi/À:Êžý¾ z˜'ƒªÈ]P¨¦¿,—-F{ÝQzÕ§2úmƒû†l¹o”Ø? }ãë“Ô7rß(}¯þUé6–[K¬ÊL¦/¯ßnêïçóåÇÉôq»ºlVu!ôfú·éߧOðʾѵ_Àj(‡lšÕ@!0-ªîŠDÈýR‘ñÒLŸµ¯Z4þéb¾iìY3»Þ¬æÍ*ç«Ùjö©Á‹ŸÔ%£èE‰l®eA²¥€G„Ô £d‹|z¯^…ÆÓõª@#DÌÊõÕR,$±ðöa=·×‹fó¢)yO›çm³šA#yõaÕ4ÑHÓæMØƬܹØâ•e%ÔØ)Ûd¯Jëë·ktž·K {Ú4¦}œ…YØë‘ Áª­Cq®1˜Ý½öÙ,šwê±°žºZÌß}1Ê$[åü½V}”}S«6‹u»1wW.Ç2&,éAžuZìz¶™ã×Ç#º“ÈW}|*VÏNק²¯ÂGÆ]áoUE{¥…m‰e 4lÙáûÑÀÃg;\ï0[ƒ²±»[è*8™²“Fqb«\-ºˆøT.‹¬Æ ô…À¢Ôëz;~·„·õj `OòÝN¾vkÀ›@Øáü÷T˜»•Â ü ˜®ÿ.`HNŒeW®'ÙÛ ¡ß !µëá<ögX+€‰SùqŒ—±ÑBêŒÎ꽋öAÝS­`Ùùq)/<éµÔuz©Q¬PÑk$ëc LñŸ®›ù˜¢pDLí ÷ç™Î&ïÿ€˜Ú-ÒwrðN´ýžªO"·PÖ›”“ƒÈ»mìø¦ß]æÈ ÷µ" ùˆ!‘bõ>H"Êûóï–6þüiL>Q6#v@ƒ@©= Rœšm)rtèTìù#¸Ç-áþÀ %~Î¥ê¸èü@i¥æz;LZYkò帀9©Œs~É|÷üR¯E ݉ î#ˆûýˆûýˆ¹oȸGD(ÇD/wõ'tÇŽzíKzR}ªyÙxGn1¿ÀzæðàxÅ"C«†Ï%[½Ú`˹®xdÊCŠÅ8ž6:«¨6 ¼Oº« ‡LÌ9Xqiˆ6eÄ,„tH i(ƒ:èÖt¨·Ö(;ì×f¾FàiiþáéˆUÒ²^Ê÷ú0¶N½©®O¾“ùˆsü[ÂÛDÇ©‹J3« Ë@ið6ã÷Kt»yêp>;ÄnÓßL•7æOÎz²§Z“tzÖ“íQ¹~;1&o²À„mÂ\ô…õ#›œ|ƒ7Œy:rÍõN#D¿ñÑCA $—‡ÖrLý(ûnGÛd 4e¥;ôc¶ùÌøPXœŒð°‡Âo2Cóï¿Jׯq†Iû‘‚Ã÷óÑá:ÈËFI6qO¥åôd³½–¯_LuØ“®Ø“®mò‹bT¹z _ @#Öc$ÔYä=÷³Ù¢ÑƒørÕ¬Öír¶3!B hÉ!1Åš‘"iÕ‹D%á°NççÏG$2J`É¥þ›Ø¬LÔY(xX‰'mû‘‚ôü½ùGÏ4e¨Wt6ëå€ÞTÀJþÒ}õ­RåÊýc¶ZQIqöîÝ|9æÕÉöðˆ YôÛT_Ýå·îÞÌÞ.PϯgGÿ €J endstream endobj 1384 0 obj << /Length 2342 /Filter /FlateDecode >> stream xÚ­XI“ܶ¾Ï¯è#[Ó a!@P‰]e)¶«©¬”º’ƒ¬§3 —ÉÖh’ÊÏ{xàÒ#ŽU©ò –o_ÈWw+¾úùŠc|½»zùS.W9Ë4«ÝíJÊŒq‘®Œ¶ÌÊ|µ;¬>&ïýé­¿Yo…ä<¹)ÚϾnþ?}W®?í~yùSjg0Bh¦D€ý¹§C—o¥L¨áÈ38– +†3w7팒,³v8óþý[~â«ìý²âLåvõNV+i ËÓæåêÃÕß–0ãZü?AÊ—leÀ—ÌV&MYjU¤üè®YoSÎE²{³Þ*!e’媊L«9Bš1•Žþ~Av†)5Èó¼Zoe&òÄÕ¡ò´NT&«ç¥•rfòìâ´$"£N“y–&¦€•‘(¦a*·°Ì-Î%Ë™H­Êñ¸€u ÞÛ Árm" EŠ€a®&DÁgˆ|†˜]"ꈘŽˆ2HÌ™˜‘˜/“˜ñe@=‘(@Ãø ÐÌÓoSh&@>ÚËÙ¥XÌF@®&!ÊlFb:Cœ‘ˆç—í"¢˜ÑÖ—Ų¢s@Ì,O~ýõàôŽvmM²™ó@ªHÓDÊEâ>81²5ÇŸ!N}“Ý›æ\ºÞ£ß¦%‡­rˆ‘¥¯Ý¢žÃ|г^D=øèýbæUËôãÂ,¸¿eRåS.{¼J¢Ck,0ˆ²lf,Á)…ªK»gãƒæ–e‰ÿø 9L¦‘Úº_`ZÀ«Y:pôreˆlrØïÎZˆÈ(”šÌ&Uñe4ôÁ eSJ5°)î/õp¿oªSéÖB'€¢x&—€ÉËŸiw• ¦y¾“€ Ø­Á®‹›-Es K¼BSâÉx¸h}×Ô´ÓÜÒøã$ÆAnõÃÖn­tâ+×]<7>»ÍÀ1@È`• ³˜ÜwG‡ï°#.Û®§G{G3‘ì‹.ð=ÝàÉmS–ÍZêäÁ×w´wp'W\½wŠº(»áæ©m€ÁŠn7­¿óuÑwoÛ¦§O^E&‡<‰s¼wûž>~ãšÿ}-ɵÇ"¨êîH["Ï5l úêE¼ò°BŠŽ>@ÃÕ¹öû¢w‡x0>sŽ'ni|]´à¯ÞÕdzï^-&èÉ`ÿ< ºt_‚¡hØhøx/6÷ò}l¿‹^l¼ÜxµñéÆë7Ÿm¼Ýø|ã§_Ñ høów4ÂÕ{d(5ø¨¹ápÊÒPÔ‡eç¿<(ç^’65D¢eB„|JŠÛˆ2€Œ Ó¹×ò…W[y¾ðé6½¶/¼ÞÚka^x³EA× ®dç¯ \²[“^Ãó/|>j¯¥†«‚ƒNÍwêŽܪkcè¹ÿþiÑ›žÄž­€¹4—*ß}r²|™©™ÕÁÙ5LªÂ×4óuwòmýn›–nvMO‡(0¿Þœz_ù‡[ð>€‹ŒX’AbKB¢HFݹ}ƒÂÆù]ÛœO4Å'qŒ±=bCGÓ¢ —Åà’D… Îã"ÖáÜ’³g;×èúl½5 ñí) ÁG‰sÒÀ¼Íy NÒt^G‹!Œ„µ1ø–v‚áämãöÇÚµt ã„iƒÈIe$O¶Õ¨Æ£}P]C{KOñg ÛÅ|Þ4eŒMxÙ¤‰ëi,J†5Ð3,Ü „ÃäÁµñIg!HÁµCë1Y!nã$Juƒ_YòsS5í#í@úèhvÊ<Äs]åêEúÁ2á˜ØBG¦¡q0ßèìðÌXÃ0Ò÷î8îÛ±5òŽ<@6¡Õh–¸Œ–È,Od–áö ¯›¦m)W¹•{¯ïn.{Áƒì)zAŽ¶Ùeh‚Š1zª‹_”aÒ,Õl*àLE[¶\´N(­{¬*×£ÂðëàúÁÃS·4~˜/¢k©Vyò5T£¾?6ç~Žt¼µ‚™=Ñ4nðè÷¹IÚsM.}¨7°"Š1ÖBCV‚ `EC5„¾•åÉeI›ÏÁK ? Œjü ñµ S¬Þôp)øMd,ªãe ž-ãòR"¾Þ—ç`, Œ‹–(cr¼¶#߀õà˜JB ßÝŸkä…{ºi«`Ð0‡_¡ðôRcˆÒÈâSè°*šž˜¼/ÆpµàÄCè:‹š&7ŽÆ®)é…}û¸ KïbÃô“hjPý¢û.ÈÚ*h«F³Ž?“¾–·J™ž~Å4Ä|êXt}U¤¹ýI V,A³F=)KHŒ!ÊÙ|È9Ô¬h‡8C¸h~ÒZù§&”w°Eb…É”¿qµ¡ñÆ ßqá¢GÀ '»7L6þpôe¼Ì$>¿˜äàqÌP2^-¨£§ÕÈ IKd22£ ;•‹¡ÖhEbšÃÝe…I(aôôoé÷]M<§1|ñÐP+²ÂôI­›ØctçÉû‚‰YÜzGˆ­m×M½ícªóh踇vQúþ1âŠ}ìQiÜ¥dŠ›5S¸ÕøX1MýÉbÊè±.F!j¡†ÊŽiUAÓIiWCZ]r ­Ø$ägZmž÷ ;•’øhïÚ ;*ò[›·½ki*8ç±·‚î]É'\;÷C<ü-öyfÞšA=3—Ëøo&ú2 RôèÛæpÞ»¯¼·YOç®8\>?;w»X† ¡+:> stream xÚÝ[Ks䶾ûWè8*k`¼A”ãC’Š]N%)Wy+9Ä9P#Jâ†CÊäÌjõïÓŸƒ™‘Ö²v+—ñh|ýD“_Ü]ð‹¾âñÿOï¾úæ{]xæ­´ïn/„RÌÙìÂǤ2ïn.þ½j‹KiV.…YyUÜ\®e–­v÷ùKJEWPãCÛ\WŶ£›¦ÞåeM¶y#<ÅZÓÔ©{Ún‹][Ý0n_Ïã«×qô›bWlv´·ÚwëËÿ¼û+ìd-ó&®¶¬ï๠ËÂB¶j°Û7ß{1Ù¨2L ï†w~áÂQ§52 ïû”uAãÂjï››8ô-µý ë*›š%S̰˵²rõcÝ/¦ìèiG]¯ æäê1úÐ ëUò8PSWì´wœ÷¼ÖŠicç;ß ]Ùmá -úÒ|uŸwÔT7;*\EMÏÊíLÈ žŠ®MËÕõ¥ä«ýn>šèGã«î¾A`<ÖÔg¿-;"?<… í«]œ¸¬SGØçô0|•?¹;2{'P“´çØáÛÄš 3tø˜XÁl„NÀsØ4‰ ÃœÖËé´»»¤å®‹ÚåO§2s,Seß'ÈÙ²»ûåk˜%Î&Æœãù,`O{Ë âçö7²˜lY`G'ÔÜä™jÇøžšñ>æó]bž >Hõmþq$ÆVœi§¿h;ãÿS3¿v6È·ISvâ×r’âdW*ŸÏæ:*D³À5½+ê¢Í+t½¬XUÅ.A-þ©†n“ ãrÀÉw‰!<“_¬~âtÿÎ/Ï ÆÍ AØs!ùìÄ&‚˜¸%)èY&²1ôSÐYæô½]¬øBêÝ, ƒŸïc`b¿¹§~Ñî™öìÊ»’´â€_¸ü ‡ÖTFo^)Á`)ËÈ1Y[°ÔòîFyòE°÷¬†=C‰¼¼|³ V"4PNEú…¾±¡ k7<>Ü’†S™^@d¶)à@º2–ÓŸ¸¢HkÁ'UE…™»tÑYæôbóã ²Q¯ê¦^?4]9õAÑ Ü—`¸@§²»J5¸ÙòII€Œ %OIÁaËê5Ðò FÇl©6èÆQPÜf5˜©ôõ3óü}R cææyReŒXà6?¬ø±Üݧt5˜Î/FY‘¥Îw‰Ïh\í̶qÌ{ ´È´£~?%”/ÖóRÎdXÆ'²#c_¥É<â}Ê;½æ@ sgæÒøˆ.ŸûR záKm’C¡XN 5#£tèù¹§ƒÇ3róÀ‹fõ¯ËŒ¯Š(Û2[Š¶èt 3jÉáµ£»‚•Ñ]IÍ3;êê]’…œw3´…QÑ0; Ä&˜ô(7‹ytRnrñ4Z+­r ¨¼Ï¤mÌ = á¼ÙSƸ³fz‡ç ð$«|ñ 3ϲÌ.üàà3+?Dó±<æ§ì_ôž)áNØõ•Sø:}aÀÔ­Íå}]íD*¤ 7—«1é•–Ý’ÛSè&×{ŒøgcøÕk4¢¦~¡Bzâ!B PçöQ´~ W¤@ Na,ÙY )_ACž5’Ѽt§Uä!™BóÙ¹̧€b¡c— 8®dÝ)«™¥âQCÇlafñ—ÓE¿X¡µI%J$Cž€œä–ÂbøPá'Šmh¢ÕAÆÞ]û.n ,^öoò}+cÌqò5’Õ¾V˜J °2®“ßFÀYFs^»%©·xëŸÓŘ©I9ƒü£Ý)iŒ ágç,zg¡£QξÜcëkÁVÌåÝYu7‰=qŠQp&ä"?$ÚAke €;„X¡„·jøß'¬`M÷W|˜.”Ú¼îð7bƒé!E|J "P(ª²÷q¤§ðY$gçî@¿†¤–þù0©%^x ¡`ÌʉÿqnÍãÜ &¦¶scFÎþ-›}|e˜%Ðå‡ÉéÕñí©â§5O^¤£_^1Ë≦DÓ–w@ŒŠDJÌ ¡!Ó›d< ,…NøÇÄ:¶å±ÓiA&Ÿ%‘$ˆoÕ§èˆ%‡É¹ŽIRv·O1¿LöùerjÒ²ÞÆEˆÅ1ÿx›Thƾ…ò>S×,ógyÐóA*ñ«1‰Jz“õ °Ëÿ‹ê)%ðÚkŒPí’&„‘KoóÄhÆ!åã-\BG9fŒ;uÎ’ÍÏðŽXN–÷"y™LäÔ‡-ÀC2 •Ô”KofäôT0f¦&€ eßÞaÀ$F®V?—õ&y½­˜í°6‰å ØÓ`žlþ³^hæŒ?åÇ8æÜ+È $Éž!'ÀmIw›ä`ïå‹L0´ý±¬^Úsó‰ģ§|%•"¾‚‰ïcF@0’(™{–Ì·§¢¸I¯³¸{‰'ü,Ïò,nÞ8¾ù™y¡ÍøÿÍ.a¯®1Õ2+î[ÿUÛâ¾)7áû¨äÛfüg@C0&¡í¡ÚßÝ‘a5J6?¸0à"ªÓч‰£wLºjL˜®ÉßS¦:qÏØüeIÞ¤à@)w°“Eîík-™êmýã¹Ð ZOæèdîÀl]!wà U`¯u½ìƒ?ƒw¥{ÖvEõt îRrnu7wÔéyät^„”Fo-p²„ì/d¡a òCeâ Â4ë½³ÉÛƒw&é‚Qž‹#À;SïLú#Þ™“`N©Oº&;Å·4~³$Lˆ›É˜ƒ -EÞ=õQqÎ\¶H{ïŽ'“×õóD¼9.â “|vÇó\mrÄ}=©¹ðfuª¹¾>“Ñ’¾ÔÑ#PDÉðÕuCð˜'ÀYßñ´±p/ÑK6Zäçý4JòŒ§%¹öÓcÚë‘VŸö"íÈ–g¤‘~ iô&žÊ'H#"39)ÎÇíxÿe»rú"Âaè‰êã×nPÁ¯Ýì}’¹/ÖÂktŠáõ>~´2càó,µy€¨Âÿ”•gËÅù´h=ÿlF¿»ÂÚð9®ÕûpÃöm;\ýÿŽÒ|¡¤#üƒE(ob§œ’õoÊ¥¦!™3Ÿ|´¬» ˆ†èZø’2L2óJðõ.Ãc¢½íŠ±ÖEa7¨-¦ ]éë¹ läá‚ÐÅÏ †Ái ð<~ÑYœŒ÷µeü3O}À÷ëú­«2º¶$ö»‡ €Mnó/4p<°峂ˇ—Êa$ç—kš1¯Šn3$÷ÏN³`%pw”?qÒ^ !@‘Þ4M•“ЉOá$çÑ~5¬ªQ¤mHòU°‡¿7½ø€äeÕQ屬âgŠ×½˜» iÈXJö‰Â°àáãÚ auHè¸{pï#É$÷³ny÷Õÿ‡jSm endstream endobj 1404 0 obj << /Length 2772 /Filter /FlateDecode >> stream xÚÕZYoÉ~÷¯ ßH¬ÙéûÈØ›ÝÀI€  ÄÎÈI³"g–ôïSÕÝsô°yøzÈ çª©®ªþêÒÉÝ„NþúŠÆã»Å«ßýlõ„I"¤æ“Åí„ AŒ¶­ áBM7“SNÔlÎ(¥ÓÅÌÈ馨·Õ®š1:ý„?ålÎþ¸j¶ûÍŒY¸ñŸÅßgFœRž3̹$\¹Ž'a‘ëûzçßknöË]ÕÔøz'¤çãˆÓ\G6ÌÐsùKù‘R^Wþ-/E䋧©¢ÿœq:mPʧrn7·áX„ÃU¹*ðu f£…,Ì4'LpxäWþG¹ƒ÷µš^eÁ|=-(ª¨kIy 0l@a‰°¦%øw €å4qFX$Є š™@TgÖ1„‚DóÕë@%íPrN´b‡Òô‹Iâ,.ÖKä‰@Ä5›€} D7‘ˆ ˆ`)X4.õC†‹ 6¦†vÖ°Œ˜Ì5a2nòu,]„Ãf&Ì4nZ|Pßà‰ž>äld‰áŸ»Àa¼sF$ê©>R®:CÍ(Áe"'–Ñm.„i40£DêhÇÄǽêSô¦z¿¾Ä2ƦoÂÝ}Y·”˜PqÓazd„w8TÛp¼ SÞDØ¢”঎P´:wD›ˆ«£¨”„±h‰hqK“”€¦ù€ê]´ª¢’N!Bh¢XÜhë…¡~ói”âÏí=N¸å™{шìßuB§Ëñû}f«ì¶C×QˆÛ`¹0MªÛÖô-üoY¢dçjÊ8£ÕäIŒhC´T•“½H€ ¸¥ÝR)Óf¼­CäÕÉ0£“ M@ÎT¿¥G°¯OéÅqÒ„`×Y2ÑŽ)"\¿æÀߎØ2º¶‚×h²Ëih¤ ø¡Èòv-E!ÒgÒA’‡æ‚¼æOå§ÒïÓÑ¥ùókKkîÒDÅx>QA¶§g¢#ºâ™DeÏ%*MŒº(Q s6Qño–¨ÔW%*E þ Q¥qØH‚ñv ¾BáCa^ë;œÅÀæµaFX| Ï6´·jõ‚|A¬HrùÙ¸ ¹Lö£Û(_tíëÓ.W«\æ Ù p½Mɯ‚ ¸&RÌœsb\ÞMúT£=’Tc¾1Õ¨ó©†æ"Ù‡ ’)”•RΈîâhx´8 ìÊ%¥¼$ÛªDœ$Æ`‡&Ⱥ9hÜì9Z!Æ«·«]¹© 3®0)€ëË *ª7xŒ1«£b2^¬‹—pr]f‹ªöõ}²Ö  9È…©õû1ÈÁß(éš”q¾<žt?d°Õ¦‘lÛ;õé2YI ž7~Ó‰}±¥¯š8–Ê­Ø,6ÀIÅÎfUHÞj 7&TÞ¦-D V™.ÝÙUõÒ×ù2¢Or¨tö¨"^àX„Ãc³z¹/o6Å*v ƒNAFˆÂI݄㪩ï|- ¤×å1N^l¨ÇxkºSî¨éßQØrå¡­Å4t‰ÀsE æœ^¢-Þ„Êý).º,êx§ªeg†»².£>è¶e$lêUÔfÙ¬÷»Vüø~ñø¸iž«u1oKÞ$é©­´ízx’3;ÜfE$uÓ_ïËMYlã¡Ö6j Ç 5œ e:Í#·Nf¸Ø×7 âY· ¹PŒOVÕC¬ „ÓwåªÜmŠp…BàÑ 'ˆ”ºh}|¿Ÿ7¨kP¸—Å/ ”rÓÅ}yV­$w+Õq½Dz=J&¢œypâOÁƒ#.,¤Ç`€Ÿ ³0žõºÀE'–eÌëºÈ±ÈÖ׶o·ûå}`ºC3dôpDq~>–&£˜ç„IJȱ<§%¢oY»™>SãB3ýËmk­ýÆ{RbLSQïZ=«m,Û@7 ¬@&sðŒ*œ‡H×Þ=à=gt j¦mu½*Óƒ"Ùr·÷.7sþÈ;̘†[JŒù’­Hì©E%;-°´Z Zg°XÝJB©ùmÓ»r¹ÕÍb™ø„ñdôxlâAaZ¢!žÁL±T©HIÞ 9e¬¢ dïû‹E¦w¾LÛ÷„GÒr~±aC¶Z–D  •ã(ÉüŒª6˜¤¤^^ÕwáÒ{<Ž,·|\‡c°¦4y!Ë.†·2–“”pãÎÅ(;ˆQÈë)ò¼mV«W}J$²Óm±.£âšÁFQŸø”šnAüßõ;_6ÊàJð¤ûxåsj3.܆ýp'ÀXa¦|³Ý…»}Bò$‘Ë*o!Á´¸öKF-#3r•ÌHna㳃DN¨S©½²ãOÒ7"—ŒQâì<š(™:nšß:nöcW~,6°›ÐOäBµÔ FçyÙXCm'Äí¦YØoÊí~qï/Cb#'g4LÃUš?=ëÇUÙÏgÄ©iŠ†’··à[„œ £hƒjõ©ò5èMœN#oˆŠè"”Õ/1&¨ƒ3 tPkÔ ˜ ìqÜB?‘¤d!éªN¼Ûü “w©à9‹Ý/ñ:?¹}bÎÈ ý€´£aJ²»ØñQ?<é~nz—m˜x?ŽÁ‚ÎJ¨Ç¢5fsŸ¯Ûþ@otZ€ fæí@Âç÷ع>†“Û&Ò›ë*a6/ɨ½jGæη§5ñl42OºÓ³¹çœ¯›×h›…T~ÆÙÓ˜è7< N¬9­Íáxmˆ¥.Õå·Ìû’}éû—Ž A)Ž2÷*GJ†ô!LŸ5æŒâ|?qÀŸc•å<´>»ñO6êp0’2ŒŠ¯Œ2g%úfã%˹Ü.ßhj/…Ʊ‘·ýnÇŠ“£ü§(%ÌÈ2£=ì-“šòïê­X¶ˆ±§°$sKð?íåÿj§ƒÏ±÷ÙaôùúM%U¥Î…/~.|™QøJÿ´1ç”A€À4g‰íÿ¹Áã?7~t#¾j Ç·XìCåìÿÔ‘öoƒêy°§àSú°z6àJž‚ÓRü<#äñ¿º€oK »Ý7¹EÛWBSNøtÛ¬ã­íc¹ œ}7*ún´íÉU;±êtGz%Ή짶W—|2;Ò ˆ¤E¬¢hqBõ¤+‹­ŸØcIÄÜô—ºUÑkZ­Ú14 ž-Ö²~¸…•è±þYA’§z@€ï¿iÊȹn"c4`„ÀݧjwnW»m¹ºõrèãsE(d*ÁNÏæ¥=?-23-º¥è¿+¸»ªáÙNÆ°ʾžmo ¡ÉµÐíSs¹NLȬÙ]ÿg#èñ³ V|_½Ã·Ùa….¦ïëX’óPl¾{¶¥MjgGŠ”ÉoÑTS™þó ý6Y·ß ê¦ž—ëÇÝKßdÒ j1.;G©¸¯-ŽýýCŒzíÁä«Ú¦\ÿ S@,ÿšœ@8Ñr§}R™®˜ žÖΚØÅŽ¦uïã$3Ž^Ð)¹ bqÄÂãz8¾”q|)|³»Ûì—‘¼Oýô3Á®ëpv$x2bûêWý9RÛD¦ä3ÜNæ øOEë ›Øæ×™ Ÿh7v§ØuÂîZñA]¢ªþAŽë¢ûFW!õàÙÁ'i¹0ø‡áÐ ¨_ÀÑ5g8cN/&L£«KÿW.kÛ”ÍhBõÓâÕÿ}óò endstream endobj 1423 0 obj << /Length 3667 /Filter /FlateDecode >> stream xÚÕÛŽã¶õ=_á¼yµÂ‹HJ R š"mQí-š´€ÖÖÌ(k[®$wvþ¾çð)Ó3ïl<‰¢(òðÜ/$[Ü-ØâŸ1÷üöíg_~—‹2+µÐ‹·· .eft±ÐÊdBªÅÛÍâÇåC³ÝÞ¬$cËu»ï›MÝݬDY.ëj}Oýí-õ ÷5u¼«úfM}]½­†~¤/Íþæßoÿôåwe.kòL–€² þ†D•3¨Üd}³;lij³iöwž}MmG»¶ó=ny./ŠL•ãì?1.¨¬4ÆéëÁÁ0Ø+É‹ŒI±Xqž•Ê¡®‚E _nÚ]·íz[ïêý@/ð³}V]×ܵüß WËÚõ¹1•û±ÙUwubŽj¿Á önOÛĉï]ãö†³eµöëÝûYûvçFXâÑ/}m÷ÂâM¤P–geq Âòr¹«±Q•¶Ôõ®¦gu8l›zC/ˆFbBj¿Ü»WæpÒg7+ÍÌò­Ý)~hú7Ð0ùò¡¦ÇÏ8!B`©Çì·Œ÷=q»Ò- M“À‡fçæ„~LÝÕûµ›“±Ìò²œæd’ÉT1ÂüšƒP¢€ìõžöÕ쇺ëk‹køàäÀ"\žiÁµÓCVG(¶ìª½U"Ê)m…³6=µ²Ø÷‡f¸÷cÚ~ú-!­²üI6Ô+ÆÀmÔÉ(NŠ2z:+°d¦†=ÁV@ºì¿N [~îo ¨9GiI`u¤—ybEfH#ȹðTTÌâ\f ü«à$…%€Ãä3,Íà(Ô8àó\À#5SË€1xí bD[ñÊEÆLkâ}‚‰q°|ùÄÜŠ”~Ê*àHéÈXx§x+»ÌŠr6ô‡ÅQjFòBG$çl$yŸ@µÎt>0Ÿ£ ,–·‰™8¸B“þ˜Êd&/gT‹§@ªüõøÜ?0e ?,Ól®‰`(Y# ¢YŽ¸ÝvT“XOe‚å‹` A&F2ŸÖú×8Ë´ñQ¸ÖOL¨‘E" äH.–à4 êQ…ð8F〕AJT'ö¯œvÝþg¶•3s®gªŸ•Å"BR`ÊClæ`©³EÒ&•&žM±Ï¡R23ˆ&I3:ZN\÷UŠɤÄüí1âßsò˜Ï„h6/Gù‘LEÔ‰þç~ãÿLRßÚ>PyQFHŒ9©Ì„Àm‰R=ËMüYný| úO~´×o`fÑfðŸcÏüYö<…´ Ôéû„›LŽÌô»¤ÏПÑǣѺK™Ø籕ÉVF†™ýžÜ„æ&Ü»4<éb¿T.s0\‘”Skû`šäÔaËEbÐZ·»yW¶Û5’Q—°Ä¯ 3Üê)õÄc×ôl˜¡Ÿs)ŠÐ¿cåò¯íPÏw;npܽ³™h“O \!Xœ(V±§{‰ 0ðÞÔk±ˆy_×Z|ßÚh¬b‡Û €Uí\«êiÈøiÚ¤"ÿŸ6äFð5™È×Z¼È·fÅò÷Û¾¥õöŽ Š¨@ˆ.À#ÉyŒé¾qœ"l2ÅŹ\ÚøzSwÇ žRoðK¾l¹ik7Ö¡KB¸? „±´9x>Ü7˜:ÂÏm·ñ_jê‚ũáQ&* 9ðmùòÊîô‚ËÚ´ž!¢uñ yªÎ7¶Û÷þP»pjp#ï ¨<øP©Þ¹Ñ}<ͦq5.¾ tXfÁϽÌó˜ïoǵÇRèÐâr!P—x34£ÜmëÁ‡‰gÄÒ0a×tÆB©ÈBEö#²P·iï±åÞ#O4³÷¬Œ0t—d=£ÆýOö'†I0Ø›z N°tÎ¥73—~FÔ%ws—:Ø$Õ$‡8vŒz3òæ)o{¦Ù¶ fŒê~žDÌÏ`JÐQàÁŠ§#À|æqž0D>cˆÈ%E~(~‹qݧ`‚“¸®ˆÖzA\73MF‰žTx¡2%Ío;º¸Î9OÒs®´|ð¨^EqiNv&N‘¿L\dN”ü“‡)ü©0B Sq˜¢. S˜òú“åÎ÷®êpèÚÍ®rþtaÄp¬#×æÝl‡uÛ`@Ý÷õ~hÀxW¡†ó\aŒõU˜òŽ:ôXwz¾­ÁÔ÷ï«Te¨Æ±þÞfÔ°00V’K³’Jÿ¢•/8i7³ÎÏ82œƒÞ×òUÜù“\Iïàí(ä¥B#tið•@äë ¬á•êA§ÁÖõìºXˆâ.P€Saú¶ífÓw5–DÆZµ0#µÇ•u8_ý€—¬œ¶Ý{÷FµhàC “o¨'YS– çüÅÑIb"“)ˆngÅý1çXC¦ásή<àh€Öä¿ÐÑ!ùÛ×/KZÏìøÄ«¿à #þÚ'ŒæÎÉtìâsC±"J^Ò_Ãñ'ŽrrüÇ…ŠçŽ ©ºŠšðqÏKë9!ϯÅñÔX0ê‹{Ø*ÁÓÜÊ¡¼\»~•À4„ ‚Ìâˆú\€ãS”ÂçhKÆ6Q°È3%žuÊ«òE³p²:QغÝUcÏ3 .Í€Ò ‘)fÇ>ÚöU½Ûå*@’—ÿÀ<â¸a¼oÝî³—ø¡¥ž¡zɺi8"qÔq²å¸w >=¦ôüy Ìòn0S>2ð./åÇlšþçã~m«0¿ÝLN¨°‡ã@}&ÌV¡c:Ç„?ÞâqÆT1œÝÞ£Év¾Pú[,2zy´beÀâz#mtxÓÞîÃOtgÔøSÔI—Dõ2PÿÝüä€1éË[ì³Ñ¿PÒ¾ÝE¤_¥9§FFGÄb ÃÊ/ í\â…À懖n¶)WµVA%?á€C˜ëOxHRùC’ŠŽ„Ö#pwµ¯¥+O-õc*7UáÑÄ0€ ÔxLöÿŸõÆËÝ #2†K™gL:º ΣAxûÙÿ5²âž endstream endobj 1438 0 obj << /Length 2875 /Filter /FlateDecode >> stream xÚÝ[[oãÆ~ϯPÚ‰&s¿ì" [´E (Ф¸½æ®.Ie½ýõ=s!9C$Ê–´/&EgÎå;—9sŒgfxö§¯p¸þpûÕw︞d$•³Û»a )©gR(D™˜Ý®f?Í?î›öfA%›[{¥óÝC[mªÿmµÛ¢›ãz~{_úwõnY®öué?Y•Í²®Þ—+ÿó}¹ÞÝP1ÿì¾!x¾Û¯Ã[øvµ_†‰ê²Ù¯ÛÆ¿iï‹Ž†:¼‡ÿºý 0² ˆ]—…£V‹yÑ„ër¹¯‹¶J9áów7DÌwµ×T›‡uµ¬Ú/7RÌ¿…‡†Ï?Û4ŸÿŒ1­‡Ùšý¦ô÷¸Ûîüu¹Û6m]TÛð¼ÚZâ¾{gH$]ª âÂÉŽT˜žøQ’Î$2Ši;J"ŽåŒ!I”‡ÃT<\K¤´ñ#*?"Q¥@JØiˆ¢aÐö†ãù¯7$¾þÕ ¡ì´µ¿¾8q‚`iJR©–vÀcմ嶭Šõú |(èü—}¿­˜œ~±ÓÃ|uU¼_—…|÷ç¥ÿâsµ^û»ºl÷õÖÕîü³§-ãåáÐ:Xàu»òÊÝÝùí}Õø'M¹ @朵 ¥ª½ßíÛðe†(øjD Lˆ(1,<”àÝÒ™Ž½Yª»0‰%/Cõ€&ǶDÂIRøt4É硉cíÐÄü "Pv·[‹nìg½o™-„@`Ì …Ã⥃~ZŒÁˆ¶‹‡¢.6e[WK?o,‚ŽàÈOqË{Ò0ù{ºcö±V0 qøÞ“àGiMÇÑb z̈[!bD'ío2³h$ú÷Ë -qÊs´€Â†Y@‚Æ´üŒ©È¬fÁ¼[gTF@ð’‘S¤àBFŠb„""AS” i´N³šz¿î­î/Ô˜BØ0¿¬ý‘’]h/¥` ô¤Æ &£1«|s%¥´јx¦Æ(FDóTcú¤Æ*“åm˹¯7à™ÚÊÚ©÷ü^e›êÑýZMÒ äF¦ ò:—ú§2£ÇÜÀ ‰!ˆ–ùC:971ò7’ÓnÀ‡¼zM-I܃óSf:…‹ ÅEÛÒnÀ?Âm‘-€]Õ°É8™ƒªÞÛÜÆ2Þ"ßSþTŽ¨zŽ"¯² ±õÌhÔ› µ6Pªs*Ͼ‘UH˜5^ë˜Y°sXž°3Ž×ú&Ã}–N$z¤¨‘ºµ‡A)U5awä2…¡R•~Ì¿³.Œ«ƒÕ\«™¸ë¸¤6}÷Ô¸OF¼ì âý·©^üHTúËÉÙ ¬¦î£ø”B2á}ËÑr <6Qxìœðä)ái ¬Þ4l²g`Ó\kC| -/½!æSJ¸Ï´‚\†;rzTöÂ{“+s$!L*$¨‰ëÀ…`fOŠlô¡)’®[›ãºsYiÏåmÑe¨ÃÈx§šì–0}ì5tƒ¿nµ]•¾ø#};\#âê4¿ö¯ï²¥!ª$Ó_õÜÄ×Äñ®À üÑ0·íùiƒ¸›û¾G¢“´» E :è«bõ— ®”HWMN•s©-àðSÙ‰=Åñì&’Ò6[°Æ¹ˆFÙóq¥®Q³U8NªP‰º ´HòP°(Øé.ˆBš ÜgÈ|À°Û^yÉIf®¦@ ã:>±›vøG2 „}—õ$R²=‚Q¶ê¥IH{—Õ©M @N[ÉYAZªgH1»³ÀˆKrœ`ÈŒÁX Ò2Èñ÷ÙÓÜ•p°ÐoÆëôUØ[4ˆ/–C{N­&®¡[ðKpãÐKL@¯{¹øåŽ,!Áì>LÒÿa÷fÓÝ•m:yµ-Ù몭|+1tSDRŒ†ôÓÑxp”¯"DÑ-WFR¸S‘ö„+u±Ëª5$»ß°æq~“ä¨!üà#›Ý!à´çówÕÖõû´ˆ3´gDêuìëuì5îðr\¯<³-Îî„™™®uÝÞùˆIÚ¿ÇgŽŒÙ)§«\“/î[ÌÃ"ÔÐ#ZÖ³õ˜ÄÙ®v›ÂùMCó}ÎŒóÃ`4Îý°ˆŽð¦¡ùz´i8T$'ˆ™èDg8ˆ}p©³JLrïke*¹CM-ÆÒiiU¯VQcæLE-"÷é%5[À#kãYw¬‡”ꬱ ópÔv¾`™tRª7:~0JMª,Fb8W>®Ïîí°pŒë<µ8ïeLÚ2jhîìÏbÝìrq*{‘:ë+s´ÏFÏ0mó-^ߥ@€Õÿºk­“¦}H |^ÝuO\ï£]¡þ?ì5jÀ³?Ó`d?؆7~2‚<¨]M¶X‡_åºxì» f âà£<<`€ Ó‹bJ‘ãÚí¹Ö¯ðį$ð€<ŽÏ2G)Š<i\9Sìäòtž@mÞVùrý—hT®CÊö²Mõåi`¾½R1y*ÜÀþÈ\Ø„Ÿ/”,&´4Z#Úg¦¶×ŽÀCeÜ|hs_8k²%ÀÖÿGYû¡bÜVKŸŸsêëeîe05~Øe44×ÿÄþçø\Ýý¯¡É˜o¿ú/ív³ endstream endobj 1450 0 obj << /Length 3361 /Filter /FlateDecode >> stream xÚí[[sÛ¸~ϯÐ>Uš¸¸L7™ÙînÚô¡ÓκӇlºCÓtĬ$zD:v¦ÓÿÞs(H²'ëvúb œóáÜ“ÙÛ™ýñ ñ¿8{òÍKafy–+¦fg—3Êy¦•™)©3Æåììböz^·‹%—r^-¨œße÷ž ›×Y•=]¼9ûó7/sL"UF…ì×F¨,×Üà˜œðÙ’fºÝ~ æÑb zžXŒÒŒå¼_ì¯n„bÁb@Ñ3ž)ªÝ ’ ˆÌ–*Ó&¨‰ aYN LC5sƒ²Å^Í_m:ݪǩ,ÚÊBD¡³Â>5ØU»®.+?ª¹L°LÏŒ=;?B“ ¢>G?ég2*Ç3ãѼ1Ï ÷ø§z}Í=œmÿ욇Åõ§â¶…ýT®võ;oqu­3ü`Ìsé·’æFe’ÌÏVÀ»qàB¢2û-X‡œDôå_šÎ®Gç«fÁäü¦Â¿ýŠð‚qz1¦õ¼hÝØ«¦ÞvÕ…{ß\w®÷üƒûý¡r/~ÚTþ òÂ%H‹Ÿª¾t¯¬D$”ÕD л×ó*±TZa$ I÷„lê[ˈ'°]:™¡™9rPxIj»]lµèŽ¸% ½í­14Šóçs踮«]SV×;û(æ›âƒëß6k”Íæ꺫&3mš¶s_eyí ?®Ð –‘"P ª0ˆAò~̶Ÿî è»õLsB2jT¼ÿõÆzžóÑ͆!T&Õ€ï¯ ÁH¾¯·‘J:½MD1µ\‡FñÕ’çl~Sw)ÃÎ tÂbdò eòq>&S‚H3ÍÙà‹ äÞ]ÈK_Ð\¯A™ƒŒ fPÛðÛõ7 d´­/Põ°ßÉ tom<ùv[ÚÕ£†ºQ£˜; Asp:Þgœ×Ë7|D¤Õj×Z”XQÇÞÆýbW±síºg‰ÆEÕ–»úÊË 9ž1 Ìò/.÷‹¾PÙi>¿YÕkÏÝÿmWÍõú¢‡ íªÂã˸†˜]îãk÷-6`2èG±^§d71`õw¸X׸ºäóöº\¹V°‹6¢&óW{ãâi0'ë¶é¿JÅÌâ"îcKʺÚúEºf$à ),Ù­š¶Ú£ÏcE X˜bu^•ÅµýT`0Øœéà{÷Ò )sG„Ð@7„©Èdšª»J’®FÐúP‚ÇùŸüÜï“ "ám2öf¨ÓŠ¥¦[4ƒNr1ˆÇy‚ ™ÉÑ<ä¢MÐIà!.Ä„‹ÈÄD\”I6Y(ä鈲AÖˆ“P»áq´p!}`Æ%\­A/„Q‘X‹·}îû­isþBÀÞ ±‹Ús‡ °ùè”Íÿ@˜Š¦$. žò¤P-Ž…±¿¡aÇuòã$Ö?Ö€ˆO¶òô¸ý˜(“u+tjÇíG“ dT7Îæ¯.³A,Šöø­îP›€¢³1+Á³Zm*º®¨m›å«mgSØë­ÍuõÔ›$æa߇o Bâ•ug”¿œ~M s|ÌçmÁ<åî÷`¦‰/m¨‰¶Ùø®j]m*›UâSºP/%ì‹~ä¦7ÃS3ÿFqž7WÂÖªX@²å¡Ø—K¥°öú_`x÷B7iÆ çÛdDþÉâÍœ‹hc—\ŒL5ö@¢(2Ãö‚ŸbäÁ/Ò1œàr<€LŒ¹z76\ÊÖr›d¸ÌgwÌ× ¡%wìÝëøæñE;÷Oœ oíUù ³#„¥ª<¶ö€€m®°Ü:£hŒ·ý¤ª}>Ow4>ËæÍRq<> 9 â‘Œ(áAzÁˆ¯0t¯]ÏàðZ÷¢Ijs!Ží®ÔMq%+œÝ–pö€pKýè 0ÈAíqÙ6Ûeµ¹ê>,”Ä.£*<Öá2½™Ù$TQT†çc©2V&;ïÀ€<(úÛƒļq[ŸÏv7üÁ» §ÑL‘ª7P š’Ò&hvæ‹hDdÒ’“6è‚›ãzÃ=WÓ1B½‘ÂIXÝO˜“F…O÷:嶋~q™¿·MF3{f+¯ÌV–íÉ¢<´dìz´ew•€øˆ)”€”œ»sðX3q/ÐM0[‚öæÊõÖ”IîÎWý{__`yÍ´vŸ:Ž¦ 3÷®”·N>íỂ‹ ¢Gqa2vè~ è¿Rêñy8Ay©<ÃöÈq8VŒ¸ ÷<ëÂé©æáJ\ê³h‹ßN›j2F/ØÞK6y\ÕjÎ1-µá áóë¶Þ¾uÍnµ«*×0×ui¡l]Êþ¾ÄT¤ØýZ´¿s†m ,(ã6;5¶³'Íø©]°íñCÒÂÏ)ËXxxwgéw…oá‚š¨™#ÝL"ãó ¢TW@+ ïñÇ[³®Àozøõ!Ûø™‚ß-•F:<=óÖÕÖ SÂ8ÁUh€B¿«J¯Ï†§­•ÁË¿ºŠäom|qXìŠMÕU; ¿Kn­–ù„Ì=AÌOçÖãÁ5K’¡ÄèÛÄ–ððF˳K¼;ª0® 5ç¬×³ og(NȤ½yü€“Ç~Håôu[úi_u6Ó+¶«L4Û™6B‘‰º[Ûi:ùÿxÉ@ßyGŽ›–ç)}Š‹áÁ Ïª tÂÔd•àà„YBÎ<„,³S²¬Ë2Ó™R"‹¿»l‘Q¼}½s ôÞ ÙvQb °²ÊÜ^gÄ×7î6£ýÄÞ6ÅÖx‘Qÿ8ؽ©o«‹qD·³‘‡«V@߇Ô³ bk'EO*¦òÿ@¦G%L×ÅéˆèƒìI G aÈuU\ êþ.5Ì!&½ ¸B~Ù¬×ÍÛ*xvh/ÆŠ?óxoñtú½ï+×M{í숓™0™úÿÁÁ‚ƒ$3AÀØ$ÿ÷e ŒOIRíÿÞŒƒN²}h-–ú?ŸI;Yëq;òÈÖÿ3ièõèNïË„]-Y ËÁÓ0ñ#µ©Ëàújü£äv4>Mž:B¤Ãp*ÄžBǣΠørTy§h¯.ñ*®ÿ·(ƒß?ÝTƒE¶®š/zÈ®Ds®·O±Ñ*7É«-€O§ºÑ1Ýx-¨'(³mÜéá7ùct¶M!ƒäXO…>æÓõðô\Ο=w¿¯·o\cùÂýþË÷ãÿ8`ƒú×î§ýÌ?ºŸ~2æ~þm­þ?]è羟¬\6ÕåeÝ—°ç‡ߥŒ#ñ\ùAýÖøªÅÀ!1,ží]Ñ=Û'ïõëò—²í<"å/SÌ^×Ì¿«ù›¡š»ßoŸ»†?¼µ7AÔ¤ÀµÿQ‰u;l~í‘æñu}JЇ5ĆÄæÊË«ÂE›ªÛÕ¥ ¢@΋÷ûþ“¨ºSe2AÍýä;.„Ä—süw\n ¢Îw¸Tkøädz'ÿÛ× endstream endobj 1459 0 obj << /Length 1574 /Filter /FlateDecode >> stream xÚíXKsÛ6¾çW¨7©6<ùpâª$if2™ŒnÎc(‰²ÙJ¤BÒŽ<ü÷.ð´¨NzëÁ".»‹o¿]On'xòû3<ðümñìùÛˆN"ùÔŸ,6 üpâ‹Q&&‹õäfúaæ *¦W×êù·zÜÄ—ËÏjè½ÒSúýÇ',ðkø!/fŸÀ^!(ZßÜR¸Ê“Í&]¥IV•jæÃÀºzLæ=“¥P„0W2q1cÁ4‘rGîZ¾ê…,R+µ[E\]›us³úº*«Kýåkv乞¸j%Ôà•ö«Gœ­Õ€Ixõ:€'ý|ŸÌ8žÞÆUšÝÎ<*ð´ºKÊD Ár¥€¾Ã@œ„ ¨Öð ß±M€8§Ls&Rimº¤Y•3‚§e²ê¶ÿžVwZ(BQ£pþÚ±%ÁˆûÄ嘣ó(H‘’¹¨C'êÂïçwC62À×Ș:¼øÒ[a¡Nƒù‡.<—âù;ÓêïE¼— åß}&ßÔü¼N(5þU=¤È:ßu/}ù÷jçæÏQïNgÔw ª|YÅivFbñ¼:™K)ÕßRf¥UÊÔó嵕fœÒ¿JÄtòxQ›gv2ꉔZéÚ ¼<™Ï/Gæ³×ÚÚÅjq§ƒï÷ÅŒ‹i~Hwãy¦¦7y¡i…¤§0 ‘è§7&Ž]}ı8/×æ(¢ÌdK ´e¾½—fjþÖ¸jáæëEO ­Qœ–-ý °ÝØ`:F_Št \Ä:ÀÔ>äf¢¡lb·4hyê‘o®ÓTÿV!Íâíöq&ZŸ†ìwûû*YÎÇ8>ŠÖüëG@¦|ÂOµç…Ã*@ã¯'5?G‡æ1/Lü(â’ÖtëÃåúÑf†›ÃåÑÜáD/@¸O»ïܼ§øÑÜ}5îíìF¼ÌUÌõÉÿp²®åûâˆÓ ^ÿØÑ~c„ü^ÄYïû Ã/NË@²~Ë—2©”¬Š/Ì,µXU$±"_©²TR[š´AZç<3V­ÛžËú:HÆOçPg«š±¦5‡¶ .°º´íCÿF [7é¡&386ÁÓ¸>—¬-…ÖW$»\êy?Éüñüm蛼Qãºv¼ÛoµŠ ‹·›ÝŠÆi¯ÒïtÝxÒz§n|[UíjœrH›P¤¡üãŽ)D¡àökQFšŸF S¾q¥Bo[®_Àž œn\WŒZÁƒS¥¤ÓäPA Z‰G§ µ*c"­‰™š¨ß¿²–”º¦@ ¨®ÙˆGºN`‡*†¢PLzB/fñƒ!¥ÐòbZ‰ƒ}Ú×z¥œ \Î`èz£ÎNgˆµ-ëo{í²„ë5ÙØi?cA#C;É“j»pW¯­¼xw=_&„( mT„#n@å!=d ltLØøˆ°µÉNNyÝ)±Rs;Ñ,s}?{WšZ±·ôb2Q?a*Á0pæ`ÈÊW$,GiÏä֙ݴ Õ•ëË(AˆÍ Úö»N]ÿ†¢ÀΡ =C³@]ÅðÙJ«UÕXÖµMS š[£Q Tm,±£eÓk¸êërM2×ê1p¦RÞžËWT¢±E%]T~bEc*‚8·"ˆ1AüôŠ ÆTñEpcàéŠ ~~E8/l#H°W¾85P:¾s;ƒÍm3º»qqhpq¯i6¯“¤î%)G( C :ÂEoÏþbÒ á endstream endobj 1465 0 obj << /Length 2955 /Filter /FlateDecode >> stream xÚÕ[[oÛÈ~÷¯Ð-@cëéÜ/ òÒ"-¶O›Ô@înZ¢cmdR+J±½¿¾g.g¨‘HÙrš¾Xäðp8çþ3c<ù4Á“¿_àðû—ë‹?ÿÍð‰AFR9¹¾Æ’z"…B”‰ÉõlòSq}W]^1®Šê’ââqÞ®«z=/‹';,‹ß6%ÜÿŒ1­fžðK¹š—7‹ªõÓ²öã7a¢Ye©kO.‹yx¼®V÷á•æ6 m¿½,W—Då}T—°¬g—¿\ÿø¹"Ö­€ \”­%fYĬ¦@¯á=”’þ½Ÿ1až”ƒQL[R ¶”ˆƒ¸!’hB‰” “ˆè'’""2ˆ`>!aø¶£úC ¢G¦¾Rˆ¶]Æ»•ÅßdL÷Ž†f¥1bKð} ˆu®‘Ø=¯íó‹÷׿]Ã2¡œ!¦ÉD2Š0p2½¿øé<™ÁC:¼«'Žô~BP0¸\LþyñÁ›W²X*8â”N$¥H*ÿI•‘ë#zB1Hz²?fVN¢š‚Z"a{è©š<¥Ùr9ZÉäR²Ü®žP²<¦dƒ0Ì÷µÌ„FœË±ZfǴ̤A\¥Z´ŒYV˱îbB¦J~ã\<[# wEÂ[u +W¤ÌAsp†ˆÈ….ʵ D«K1ð¶ñ¿~ø&ü®ý`¹¶1Í”6ò@Ü*ým/|RüÉ>0ÅÃÝ|Qe¸&ø–ã-V¤ÆÑgŠg™X½ö«ïâ¹eAÜ…ð{}7oƒFX‹4þÚN‰,Ö›U¸º¯Êº ƒwå:cåŠ!Cw±Le„‘–‰Ê*ºïÅ,–É»ŒZ/fÝçža=œsMðcºì$ä5NCVd‰†`Àiˆxû‚ÛåÆØœìî;{[ͧaÒ¦n×~x^¯­ýQÖÙˆ <‘ š*Ò%`j3²ó¸Åú¡ñc錭,;ÿEÝÔWéZ¬ý`ãA…¥˜6+ÿB»¼¼"ESÏæõ'x¤pñ!#oª(„ËÈ1¦ &øÍ™>•Hzæa…û¾ì Yp9c-b 2bÏ.R|§±ïìZuq›Y+ITk—šY"Cºcç1kô\ì¬ðmfŽˆ [‚ß3ë€O¨Xb$Ót>¼ã)à È]‘AfX'î§<3”fæ!ëp’‹S˜ùÕ+Èä‚,…ü¡O†8‡0 4‰¼k–êФ6f “³ˆìsVèµ Ëô6+tcv÷MvÑ…ÁÏYŸ‰³™$á–dçˆPβPVQÓ7¿>NÚ‰ê]'ILúÞ˜&ÙYL.œ[Ívÿ6kœé6XÏ’5¼"ô8~¦¡ÇÖflQð9˃ƪÇC¢LÈ&E©Gç6MêäÙ>8 šÓC²ƒ·ÏST0åd ‰)‹³‰ÅBüd,Ôš‘Ø>g¿Y͸2eÏî¤TÇ|Ç JÎ9™’S"‘̆ÜHøyÿ€ZwKð)ÙiÇH.¢^1(o9dSGxèOü¸ºÌÔüZM×&aZ4›µ¿ðX “ÂuWÊ…6å®øØúÁªž6³Ý áEZ,ªúÓú.L{ë'Û=\–ë»ÖÂFB‹Ù6 ‡ú€Êþx*ß,*§ë\{&€Æº¯ç_*ߣ™.švá1ƒ'Ž{‰ƒa~ÜÙTgã6”i› Oí*õWcD34O„}iB£FÛàw¹)°õt €W€8b ħBœ´:íÅÚmÐ[gpÌäRL)ˆ9¹$ÿÓð,¹B 䊽hõ‚T‘š@/¬õ”å¨Óל@`b¦‡•+Ÿ§|NØÃS¯šKÄzâ}¥uDyf†`¯H½6qšW–2ÖƒM÷2Z ¡nciL÷f ”\Ø|áî\È]=¸F.æŸêfhÛæ>\Íï—›í¨oGl[v`Q•+׸žµ~ªuã‡Êð¤ià .çÙÓéfUNm’zº”¶éå;$ÊúT2òµïc„%ÙŽFÙV.Orº©móäη!Äö³î0ÉM ^UÓÆ~ü‹ýS­|[?m»*ëmóRè¬ZùLîf3,Ë•o6†OÌë\.}êm—ÕtîðÜ<8=¶C¯ÏéžÍ_ö$ òô7Ž5›Á“ÕÀ€_ý@µÎEF‚î¥x°oâýÅä ш*çið’Ž$gÀXúìè>f>©‘îÌ<„|-…ü6møŽ@¥0€€&8 JDæ!…ѽä¡Òõ’1ÿ{Çuþ•Î²k†w®"¢0$€+ñ‚NpPfŠè%š‚f•ñý1Ó#E¾É‰?iItòïãÂNþ‡Ìá°LpN&‰C뢆Ó^hM#'DVP!K]å¡JÝn”Ïq V@3>·]VlZËYãl{[¯{Ø:ø‘u[>èµjÒ‘}Ì.k5f!"òWÿY¯…Oõ9ÜV¹mÂR)mâ:“³;ÐagY‡Ÿ$BI=?E"‰çwÞÄ–“o›…Q³ùmf†¤]ù˜YG·]½ÇŒbF 1C{ñáeÌŒ†£<$Yʾ«ž5nîuPø3LiO.fDl%/V!y…¿gtÀ €FéS{F½/½eZ^ ˆ0s°C˜wå‡áÛSÂWiyÒܸ"hÞlZ_Åq_²ñ¢Ý,a™ÕÚß5·¹]ð|®OY§­m˜*nlçr¦. 1÷E%ïW™Ü›XX†û]?-ÈߞVÎá=m= 4w•¯.ýœ®ôÃ+»-½Ý’ÇØ5’Ó¢m*µ›€ô6m5Û–e=軵7õ®XËti¬²ÛáûÁþ°N¼—0ÏmÏ"Qñ^‚«œw'{Q jûBŽ¾,ï—‹ÀE¶zs¤›án×á¯y,G”N ®¬„,§Ì¡îrZfðÑ[m‡ºÆzÜa6⨀:*0~w=W8eçÇ^¹¬kæ²Swƒùí±ñûÜÞZ¦?ûüï!¡óÓŽ4äT«„½}qdã‹÷è^©JNí¦ûZTÚ:£×ü×¥¡EpÖ»òK•³0[š]«Äëô‚ö|›=sGhà Pî°‡Ž‰^ÕšÉ1¤wrÅrÀåè¨øcì÷Mz¶F {zÔ~wG„oè¢mlÆ7Ú÷UutÒw0µDëìùs;î2®ö'%í”»N*Ü<”O—B8Xa”o×Àhs³.·oí¦¿m‹æa÷Ùr¹ô½ó«\ßö¾ìº=Äæ.r»£»PâïóÛÙŒ'°9œ°eH1çÍ°áîIMö¥6öìßiçv@{,“n>ºhƒ¤è•+?„ݯ|;~»Qfé=_Lu¶è8ÐÍ£ïcO0Üæ³=5§œê­‡öÏó¡IŠ×éç)\èkHcǽôßyFôë`Éó—Fìk€QsÊ‘Àg‚Qaœ³&þ0Ûµÿ‹AÅiÅÎ9¶Ðä¨-´Á’l#ás;‡ÿèëÄŒ!ã<¨w†Ó@ûvuÆÒÝ! ¶öfÖá_ç(É;ï¯/þ ÆÛðE endstream endobj 1474 0 obj << /Length 3371 /Filter /FlateDecode >> stream xÚí[Ks䶾ûWŒo£ò Æûa×’”Ú¸*•rt³“*j†#Ñ‘2‡­òëÓx8 g´»åÝ${Aj4þúÁ«»^ýù ž¼ùâëï _d$•«›ÝŠ0†”Ô+)¢L¬n¶«ŸÖE½½º¦¯ŸJÿln»¢ª}»»Åãc{Åźy[=]ÕÔWÿ¸ùËJ`Døêšb$x ç>|ý½¤Ñ¼ )®'7àK ¨ôzçÇAÄŸB¬ö3ØI–À&¢ó6 `ÑŽ¸àý€o38"‚ôž3\³A2+’k1®(³Š˜",FNÓHdÓýb˜å˜éâÌŠ)2D¯®£Q—.{:噹’eÎu‰€~Éò£†¥ŸÕ™Ÿ1n "xØkš%BÌÀÅ?3\D©~—H¦HÂbS©œg8ˆÍ9†¿Ê2Œy†áXðRª¥%k¤Ø9=¸hÅrºbžåWb2=¯dŽß¯²üŠœâ&˜5ãËÅöÂ}æH(“¬ú.s¢r˜ë› 3×Ô845œov©Þ4õ¡Ú–­»mºûœ¾€Fq°Àif ¬±„7Žû1v0ÿ§t)œ_B/¥«Rº§ÒµÖ@`$Q©㧶%õj¡: Q‚® aˆhó»£<‡Bì3 e—MßÅúüO£Ð3ÉbÆ$Ÿ¡y~g ªµÊÁ½ ÈbsV]ŸƒnuNmùgè~‰žœ@7}oè¾x?äV‹Èͨ%!S°ùkÓ•W;¸2|}ßL±þ`7!Äw3@±¢ƒ–Ъ¾Õ?ëføTúÆCs]Åfsl-½¢ ß Ï!ñ )&H«HšDf çÞÖ=½“Ø.ðÒ3¼)B×møæöÚƒ/Å1jAÄa¡¹Ü¢«k2¹ñD,v7Ç}ˆ4ŒýoÆ3†æ2à¦Æ|ÐÍÿ?ÈÝ/‰g?hÒš9cøßj’"ÖrD£ÎAÞç4Á‡ô5¦¸4Š…ßzêÁK¤ÁH@l•—/ˆ]]PõŸîËͯU}ç­þwo‹MW—‡CfÅ D#©B ycaQí )I9NÕÃ& «t“•¥ÑƒíšÖÓíú º¶€0»«®(¶EÙпÙ7‡c[f¦$,3`æÇa{rá®L¶(a dîÕu4ÊÁ¬ü60áÃÜrzŸý$òK¹éœ\ݨc׃±„ÓÒ£q < ³~,Úâ¡ìÀ)9]“€c4Ú…_3Ü‚ã0ªÃ®m<Ñ@ýüF0<£»þCð0ÂRÇ€rvààfjv~¢q=ݳ§ìz”@ ŸlŸl‘Ž3¹E3¤K2àÕp*ׯêMN7Þ°ËWéý?³öþl¥ó¶W¯ƒ—ÅÀ·c6Å»Y©ÄAœŒ2²È‰9Y¨—ËâUN‘ ¥ÏÇÑr=Uû½ç¼ØßrºÏðºè׉äÒ%Ž‘—Q5D92ŒO÷_p +ÓxÞX#ç›O÷%¨gN£´ÿG&¾±Ó^iÖmy8î;»ýOz]Ü`ͤóù.è¯KkìЮñ=QvÞº'4~Ȧ8”ß¿-Ëzë-0¼:ÏFD|NspÚ˜M$7±[J²HsàÃèdlž7ûj“óaØ@èUÐtNj'Bv³–˜Âv2²Ì«…”ø°I B¿†Ö^¢8HûØF’õÆîgÚõW»¼9ãä½!@M <KÐˇ)÷åCYwžÁžáª;”ûÕI×*Qî@ AgïÂêÄE¢”%¬þLÏŠ\¾Ë›[Ö8f ¶X¤?™ Ü-C&!Øô`êAÃl¤É±ÍŸç,¸RfIEÀØ($!RHTÎéŠÍŽÚp’Œj£U½=nRÂv=«BDmÓÖ€a ü"n4€›¥¦+;2ð§Øû-AG…Ûò¾8ðð¸/-åÀÖìþ3ÇldÏkwnaâV¦~§ÂÄ{°aÔëìùÜ×3û«‹B?…"µ1ÔKšñÅH„Á)ÿ3xvºÙÄ‘Æ©|¾-`0ˆqÖLR£X€OA¾‰TN‘uá½ö8Û ï€|eÛ=_Iá4ÐaÎ ðØæË0ÌÇ2z?ó¯µw©jÿꔞÎ0ZÆBÿ,";Ð’´ì¸zÿì[¾óª(¦¦3-Ÿ-bUü6¸Š?›îŒ.º._³”©$§UÈhÔëlô‘ÝPþK¢Çs%Qz†™Ü=âhÔ—™¹Ò»Ïn²_² Sr©r:¹Fz9·3Zh¶ê ÞÒR^B!¡õòU1L¦…þÉ‘ã.é ʧ'j²R™µ|&Bçá ð3w#˘€ß…áÉ ÛDÓ¼ž©Ð³e§GŽžü]¶žÕ×mÈÏÄl—¤ÇÖ/t°ñ¶Œzº²Þ:G‚í§ª»·-¼~,|‹¬÷e}×ÝBVbÍiR£üíØçzGŸÌ'þàJyL†Ä c6l€8ç໫ðtÁ Éǽû©‘ýpïc˜tTT9º¥oŒ©„ª{öòU@ÊA÷Ä’Ô¼½ËBª>,O2Lí™îï¾I ºMÒqˆ5© Hkÿ 5k§ìkƘ!jôé çÐ×Ǿ6•îî?§”Ó<ö©¢ðï6Ô¶]OeÏ–O  ¡œ;¬‡«yx’™-Úrw´ÊÀUŸãÚä6]‡©û·9¼0,aˆ‡²¤Í\cBö{-…S}øšÍDÇHÉeÅ~âä™LÝSŸ9X‚#}¾8¦3uâ‰5Æ\%uâÙ☤æ\q …ˆW3ÈÌ..ŽØl[hfª\²x•Æp/e¦T&©/Às¡`ï>g7š`ÄÈ»ìÃI½žü‚D ½ c!Rãu|“ñNÊlÅ“œÝTªÍò¦²ñvÌܦ’¤â)û$¼­þ:á²uwlƒ˜Ê¢£ô"Iò1™¨Ø0óë6ºó¡Ëé/{&Év‘n˦©; >_»/ðD­lú›3°˜•+‚Bóé¾qÙoÎÁi]þæo~l³Ew9ÖÆ6MÓn«ºèÜ ˜Ä_ŀƿ˶ñ“ùÈÆ 0oñ:ÂËHÄÿCuèyOo–9ã§×ojÿyHSk{br¨lvÓ–üû«.˜ø<9<7Ƕ…/>IÖe»kÚÿ⯖»Vi/ÛV6Ëm¯‹K1¨öß^MLë(D%>5lkWÛ0wî´sŠ”"—i•<{•8e“­p „;qAY|ôŽ~€kƒÙ‘ñµ·ÀšóT³dd:ú ^"%+„3W£+ÒNé€XݸËC|¸©Àú;slzKÏuõÿ·Ù—EëüOÄ7¢ BÏ©õç(ºEƒT©’©[Ô—«†;K·÷T^Lƒˆäxz‹Ìe¦›nø¿O±o_+—›¶‚D‡_ʃ-[ØÜ´x<)ê“9èïn¾ø€Èúv endstream endobj 1487 0 obj << /Length 3355 /Filter /FlateDecode >> stream xÚí[K“㶾ûWLN‘â/¤]¾$±SŽ«’ªdªr°“*ŽÄ‘è•HIy¼ùõéF7øh^;»§\F žF?¾n`ÄÕîJ\ýå Á¿¼ùâ«ï3{%e’§©ºº¹»’Z'ÎfW6u‰ÒéÕÍö꧕JÒĬ¯¥bõçrÓOMWÕ»õ¿oþúÕ÷¹™0Î*˜ÞüõY¬!£¸KU÷ÍúZ¥bÕõíZf«¦Þ>Pͦ©ërÓ—Ûð +×eÝw4­É®ò$·Êâ¬×Rº$M-²và'ÿáFZ±ê÷%ªútî©Ø–‡¢¯šzØÆ8W&‘¥‹MÌVƒ%œ¶ÐÑŒýœkœÕ^¿+×*]ýº–éªl‹n'_Ý]µ™ÓÒr &rSðL·¼SÑöUqðÂÚmـ«ë,ƒ³“È ä5Ñ;Ç´e@¡ØlÎm±Abp™³.§SÛüV‰A¾êXpç[îS¡NBÛÚRííúų:÷(%~PQ/&¾ö$‹±´ZÎÁoYlöTé’_SÉðŸƒdPçøTô%t·é*Y_“®¾G:›–'ÆߊãéP¾[_kû¹‹H‚ÊU¢^ˆB.']r¶Aš¿Ì%­ “Mr§3ì`AÚp"10Î÷’Ô iœÆ&©–W“N?E× /ZKÅ”Iëv9(~n?þØmâf,ëS7L ¨²%J*²8ÊÁ¥—&ç¡à\LÌ®FéLg¢2£S×Ó«I§wä ª¤LÞÅDFƒŽÚ9•£*/W7‰”Ì€/£‚ãÙI¯¸ÒKaš§×š±ì£M2Ó‹Zʪ:qÑ*€xè7¦E½€›.i‰ô åBÄD¬ó+†ŽŸ“ð‹¦GZû‰5[ð`|¤˜Äýr=é—&Âe3&}Ñ–Þ¤>X¡É53^©Äæs³4C-Ú™Õßš XÚÕž¼ÈK®ðÆϹÁkH†qP”´­.`\iM¢Tú~[§éóü¶z&dÏðÛðØ“~ÛŒÆ7Ñc±#ˆðøØUlú3Ckäbƒq‰SŒ<ýqhŒ("ÆÖsùÛ°Ò¾+_‹ò<7.ôÓo»²§rT3SŠ©^æÔUtóBäS§~aó8¯ýx pS™ér ÛLJ°Í°ÝÃB[ú8 ? krÆÇ»#‡PSqÿ×Áã:“ …Òq8uaÚ5A$&[¦sËpÛô1L¥ šé›ðÃÍ0Õ»ÎƹWöƒåìŒýœW§Ú®§)Ÿ¨æ2¸Ì`aãži`^Ê^ÛKÈ£T8bœ}<@Ü„·JA$â¶Ôv³G¥Õ‚ØmY`ɱӆ*Œ×±bWÖ˜{¨þ‹A36 DZa’|ðÕ^J±¡ðŽª|Fƒ›12ÇÆcZa@MuýýZŠUÃëúô†'Z 1fáè&)0²>o¿à²ÀÞž7œ:€šÁ›M2ÔqÈøÏI¾½*Ž£Õjק=Mt_y„Ê‚{oªÄêBbbSv rBúêf{‘,08=QnwaPÙß—e -°ëâtu·`ªÅRÌ¡ËcÆ¿ŠXºô£qÈåcËCÖf¶Ü/–SÓå¢éŒcõÛìm¶X]–Û.€. l ãsתGB’ &´O±B?É P•ÍXÁV¥kŽlåÐgtˆ8@>nÈk`xÛ½ Q[†:ú-x5ÜKÛ£š'Ú¼=Ø01²¸'óòƒ«ÍrUªdtM€t„žk©@È2@Ýà8mÀ,Õ©…°Üf±F"vÅê16W)‘\˜2ß}YoË-‡æʬN[¶]4Áh¦Õƒ°ÌD NS) „k‘¤Æ',P/ZhùÕ‰tŠ:yÌ¡Âm@Øž?Iúœäû%a2ÇÍyêݲ‘šq–è.«ÄÈGªFX€¿w#1³t ×™!*7©y$*ÇVBSÓÉzÖüêÅdiªâ8ƒûGã~_ù—Q˜¿^©H[ÀÅ´ÞÒ4m_ÔœÅeh’­º}s>pyÓ´mÙ?ùÛ{Cœ8|žšC³«6þâ *<‘ŒÏ2  &‚In†Ú²9js…Dg—«Õ?^ê릊_ÅB'Šî«ÃJ§¶Ùž7e”´q?´”ÏÛ2MzF°ž¬d[ eÀ—pˆ5ýg¥£Ô£Yˆ¢ÍaKZKZ+ÏÊC÷¡RŽh944õ5pþ‚(’H)H!aœÆc%˜É¬o&KMëÚ—›÷ÝŒX;à8PA0‰VŠ¨ƒ*¨±f€¿X=F ÐÂTx íM™dSÉJøSÎEÏSMM?îR9: lã˽M_—Óâ70aú©lïšöèÚ*:Cøå H«¦&GYùðŠcºoA‚U.R±íÜÒ=/,ræɼÆAÅ-¶£õo1µpc¢?¼•ŽÏPLµ 9ª$¾Yh­Z.ƒ8z*û3„ßcѾÇcò†õʘ„írÊ÷#äóYLák÷¾:Â=3DÙ僋n¸ëI㡈Ÿ›ÍßòpˆO·‡rñ¥LÐ=I\0ŠÚ(›åªnH¹Œ"c5O¢û ÀQÑr` Klµ¥:3(Lù‡“ÆrâÐ-äÄQ¶³ÔK–ŸLˆLÂÕh„ý ïBHÏ–÷L;sÎû&íÂ:»j«Ý¾§º=0šòjëžÈƒ$C&ÒÃÉû1ýP¼åŽ ÄÃvdº±¥Ö8J;à/û»:”w=§ÅÙ©¥@•¥Aæœû0ˆÜ¡ˆÄ2½h€a|ÇI©ßÿÁ™;°þT‚$-¤ÚŸømo¶À§³$@M0ô5fì¿?IŽC@ }/'ð•r‰~ç?/„hYfÏÂùVëW…³ Í&Ú©§ø6Ž .ݼËÉÍ»VƒTÊѽfBUÝ„;k“dùâÚäíöPQxrN e&ÈM6=ßÀ8#ÓƒÊz@•2`Ÿ#VŒÚ†ÕKÅôCîÂ’%Œ¢ƒ'…QD†Xý6ÅÖ{½/PY¦ó‘:šŠŸ˜‡Z¾ÓöL Ë$±ÐmÞ‡³°KË}xà Dðbâ~Äà$óœœ$Öy5õ ýÞòÀÁ¢â¾¤Üœ ÂoðþXµ/Q8&kã"ÓµÉõ‰¸ˆ¹3¶ `3B´Xo‰,Ãt\bˆÉè?‰9ìÀgʳxÉ`x2xÆnO‚ó±Ĭw' [eÇùUøðŽ)HÜBPöýþJá÷BºõhT¡LF5ã§GôPT­· YÀf§–òzþ·¡>÷å8Y,òSÖýÜÛ *"h1A Åx½°;·h»·âÃcHÿJq4/b–AøŽ^ŠÑ,øÒ-ÆÎo¨ÒDè!Qø'ÐñÊGu2g‰ÃB»Ö•ø ¢¯©ø·DmäÉ|Î,£‰Ã}K‰‰Øk£7’A§óƒÄ`2‹” ŸÑõ÷c‰&bW°µÔY’¹Eî"§ÍH÷’“’møq­QCÂÓÍ’O§8$Tyn 4œÃŒ=¥“Ú$?þ˜N ý²[äøM«Ì³§ÓEžÍ<󡙉Þä˜Ùc%Ï{oøhÖ¥^âdÈŸ¼è&oá`]ª¦WGñòIŽðîbzw’g‹n-“Cæï·HNŽ3]ÞÃÏe4‘éàÅ?DÉ0³t_ü0'¯uË*Àò›±OmF¿t3‹“±zàé—ÑgÅé°ya· ˆb|…Ï•äñ7cÎä#7”‰ê™òÍvùê*BÅüéÒTJ¥ˆsc’ÞE3þ)>ÏpCô‚ûaõõú¤êµPëž­QnLÞâ~n|Ní[L¢”|†ò »QQå@?Þ˜ý'Ês§bÓWïf¢ ob Òg[=Aeûzà–ÿL" †‚¢ó«P%ç°ï»›/þ á²6 endstream endobj 1373 0 obj << /Type /ObjStm /N 100 /First 987 /Length 2566 /Filter /FlateDecode >> stream xÚÅZM¹½ëWð˜ä@‘,~Æëuf$Œ#Hbø 7líÊ’£Ñöþú¼G©gÕÒHjizÆÍ°»‹d±Xõꃴ“2ÊŠ+Ê在bñ=þ$ü²(W"߈ò™o’WQ„ RbßUq앳²&å^ÒIàÇ̵U” Îñ½br›¹öåcŽœ)ãO±õ+F)!-üŒá¤Ù¡å ¦(ïMÝ*'žS€wç3»ÐEÇU€{—–!ø˜-;sIÞD…‰+UB+Y¶²BïÄDl Fë1 ~eä<„jCàG§¼3ì y¼$™ÇžvÅ£ORßEnCm%Œ%s.«`C¥CK Y±Eï ጠûá!Ž*+. [Q…L)zÈ8äPÇCßRGÁ΄R— eˆ6’?1ØÃQ Ðè=¶Û‹S1p÷=4;[[EÅIçÑ£n(Ö…VàWïT2U´A2³yV©ï Z [­1‡O*9á(‚w®®È•‚©ü¡oônÀȉzå!°T*/Áªlj *[WyÉhÅú-)sD£²/KÍAêׄV&WГœr#ª\,¥!8t·ØR[ ö@ëñØm0ÀPÀâ e…) ÄƯE•TG†ta ƒC³òÜeC•tX:ZUOh&f½Å´ªpi&Ò\<Í×d—F/^ŒÆ¯Ô[Xn€…ÿ¤Æÿú÷hè:H\Cnó»ÙìÝè»ïK%BâÒ“Ú9¯#Ö¼M­Æ?,f‹åõçÉM£dÝçõdµj–såÖþ²úñz5Y5ÊÖ£ñÕb¾R/^¨ñ¶Êd*ÝD,PÓ̓ÇƉ+Dì=-v=x¿^.n®›•z‹‰_]©ñ›æËJÝ/æÍ×Ï 9úÐŒÀé|ÕÌW·–:ÍhüSs»¸[Þ4·kªïþѼŸN^.¾¨·/"ÔºöM–è BoׄßÏç Œöv¡ä§bè¦ÚFÜ4`E›7©mÜ¿)-©öëD£ñõÝÏ«úü÷éü×Ñøåbù¾YV&í»ñ_Æÿ€ðöŽëºDœµ¨ $²:Cm]rº@ÃD:•ºïë6\«ñ‹7 …­ÿÃÍtÕè6Ë“æÃG[JxýñÕ)è 9¢¬~縣iEâ¶Øk˜‚.0i ¢­•9ºEÏébþ'íÓcÙh"—جlV\ÐîîR;#‡Es ±L—ðYñÓt>ý4ým:ÿ0[ð :`§Z¶|ÊXv<Ívìýb1æ5à-4_>7Ëi3‡fÇ\…Àüªvt”`’ø)6Ùüm™£f9h’+^‹¬5Ëÿxèªý`îå×ïÁ–5³é ì{  NßÉ0Âe§iî°tpƒÐ¢¸L'ôÝ '‰P,ú+—µöNtõ3R4¼õ³‰g‡«Rt„ã¶6jQ@„ ͺ&ËÅLU–å ç¸MŒèR ¢'Ú^Nåuëj |Obk°ÀÔ“Ñ™Ž;^ú‘~·ãj»N˜ažÝwµ'|±ß-aßï¹Üïf»qœå¾áçA»ö‹ì£º…H…°§™!&xÖø”ö»$1ꌉŸkfTÕ‘"*¦£±3r÷ó† Öq@Oàa·ž èhk§ ç¢)ôõez;Û³ÛâÏ°Û.ñ&L ´çÉÂÔm£8¦"`²ý€U!¶¶™¶“áSx”]y³Ï2ñìeWˆ÷쪴‘iÙD¦Ì˜7 ;dˆjá—,ôI¯,ÐÐè¾á§‚=¢þ­™Í¾">7³ÅíÝr@§DOÌСtÑp¡Ô.dè:Dû-X² K°bO20zú$dæˆ^6³fuû넶6 €LÑDrÁeh5ƒ–ÄG ¯r>;4elzÛýñÚîcLÚ–Ü—ÌÆ$}©] PŽ  ÕE‹ ¯ôe;[-àÄØ%j–8|Nˆ˜Rϱ‰^ÙÂÃÔ–s gt÷m¬ìÀ#k#n“CCÛm¬ÜÅÑ-ˆ½Fìè³Ã(ë|kд¡mĶ±)°Æ·ysßh1×™!c† ,5zÄ·%ùj¾±O0߶ùïÝd>í f Ä!²jkØ£A‚ÿ‘AMxV^\!jxuò0‹`›à<ÉÉiVdÀ–¾ùue©Ü'ÿä©ìsÃü}ºŸC­EXxëc…"÷ìì*Ù ‚Y– Ø‚9(OqùôNÅËXLöX%F¨i¥> Màñ<€‰îXZV†´$ðBU¡›àIœJI§…öü°sgøámbñ¢YxÇ©-2¨ÿ"˜x(ËîPcMZxàê$'©ÅÔôDDF±O— l;´Ž£:üw¹ó˜É:,x…hB­¾ÖcQDß,I8({¶=xIC:O³†Èõ$ABRxö‡#õ€äý,@ÒèÓ%ÞDê†î¡œ vêSŒ†Zå{Ž’©úÄ؉%"ÛwdêÁ÷àÚñLhSí96LµVÆS‹7Ø:¸UAö›Ÿ§xÒEɃ•”\ìÂi'#èâé Ì>€úümS‚p›aÈ‚ŠÇ>bÚ(gÍm ¡˜#µ‹ë›Ëé/ÿk–È ãð1d8Õl°ãŒl2 1÷…bh8rmæÍdùËdnKrÃGø¼²›ß㵜ÃÉÿÅ7 endstream endobj 1503 0 obj << /Length 5185 /Filter /FlateDecode >> stream xÚí_sÜƱÅßõ)6oTÙc0üQ®óàT䪼EWUyp’*†¢ÄU(Ê¡ä8®[÷»ßÁb·{z§É9”¶á딫lîªyˆs0 ÌÀbÍæͦÙ|û¤©¼úô³Ùøï&7øiÓÅÎuß\¾{òÏMR}»ÙIŸ4.LcÜü¸™ËÚýôóCӆ޼ˊmt!Ó´¹Ù<ùï¾qÉ(ý>ÿØý£Ð^¾›•ÞMSÛæÝ,÷SŒ)¢‹Óíf÷‹ùÿþå9ÿöõæO»ˆ¼øÑ…®d¾0¹|€ò‘Ö&_׺Ø6^æ‹Á M7@ùHk“/ö®ŸB”ùúÁÃè$imò û~D¾±uMôÊGZ›|ctM×™oê]ÛvÓˆä#­M¾ir­Ã(òy¿ÛåÅ6 ½.Œƒ?ŠØv.~衈$6ŠØ.öMìeÄ0º¡‹‹Hb£ˆw󛣈±u“#‘Ä'H=tŽ*()µ6ùr”Ð{%¥Ö&_Ž*()µ6ùr”P@I©µÉ—£„ŠJJ­M¾%TPRjmòå(á@‰"6êar”p@‰"6Š˜£„«J±U?¡„«JñI#R˜£„ŠJJ­M¾%TPRjmòå(¡÷JJ­M¾%TPRjmòå(¡"€’Rk“/G ””Z›|9Jx§P¢ˆz˜%\P¢ˆ"æ(á*€ElÕOg(á*€E|ÒˆÔÃä(¡"€’Rk“/G ””Z›|9J¨ ¤ÔÚäËQBï””Z›|9J¨ ¤ÔÚäËQBE%¥Ö&_ŽÞ©”(b£&G W”(b£ˆ9J¸  D[õÓJ¸  DŸ4"íÁ9J¨ ¤ÔÚäËQBE%¥Ö&_Ž*()µ6ùr”P@I©µÉ—£„Þ()µ6ùr”P@I©µÉ—£„wj%ŠØ¨‡ÉQÂU%ŠØ(bŽ®(QÄVýt†®(QÄ'H{HŽ*()µ6ùr”P@I©µÉ—£„ŠJJ­M¾%TPRjmòå(¡"€’Rk“/G ½PRjmòå(á@‰"6êar”p@‰"6Š˜£„«J±U?¡„«JñI#Ò˜£„ŠJJ­M¾%TPRjmòå(¡"€’Rk“/G ””Z›|9J¨ ¤ÔÚäËQBE%¥Ö&_ŽÞ©”(b£&G W”(b£ˆ9J¸  D[õÓJ¸  DŸö&3ú|ÅÝÀTEn.ÅFÅ ÁTEî.ÅFÅ=ÁTEn .ÅFÅmÁTEî .ÅFÅÁTEn .ÅFÅÍÁTEî.ÅFÅýÁ¼Ÿ#7+j«nGÜ"ÌeäaEm•RÜ%Ìeä6aEmÖ…ç7 s¹SXQŸ6%µ  UДb£ˆ4TE@SŠ" ÐPM)6Š(@CU4¥Ø(¢ UДb£ˆ4TE@SŠ" Ðð~Ž€FQ[u;4\F@£¨­R Ðp¢6ëÂsÐp¢>ñ°™C69¾ñP…8b£ˆrˆã¡ q,ÄFå(ÇCæXˆ"ÊŽ‡*4Ò±E”cUh°c!6Š(‡;ªÐxÇBlQŽx¤ýòXª­º9è‘ÊШÇRm•RŽ{¤24ð±T›uábè#•¡±¥Ú~3ƒŠ”ðì´”Úc&O*Öã‘Ô~3yR±¤+ a&S®Ö²v…ÌìJU !iWÀÌ®T’Ö(aŒnj†p”ª@BÒ%L½D36ÃQBª Ik”pì\;eBª Ik”p]×ñ(!U„¤5šòÄ·®ošI&äj=!kíGZÓ©Gv¥Ô~ 5yÖaWJíÇY“gv¥t…AÖd ÀNÑ®0Æš]ë°S´+ ±f×:ì­QÂvìZ‡¢5J˜ÃŽ]ë°S´F sرkvŠÖ(a;v­ÃNÑMÊ’ÃŽ\Ø)Zû±àt«»Rj?œ<ë°+¥ö#Áɳ»RºÂ0p2`§hWήuØ)Ú³kvŠÖ(a;v­ÃNÑ%ÌaÇ®uØ)Z£„9ìص;Ek”0‡»Öa§h¦ÉaG®ì­ýhuú:¤»Rj?X<ë°+¥öcÕɳ»RºÂ@u2`§hW§Î®uØ)Ú†©³kvŠÖ(a;v­ÃNÑ%ÌaÇ®uØ)Z£„9ìص;Ek”0‡»Öa§h&¶ÉaG®ì­ýxzúb½»Rj?œž<ë°+¥ö£éɳ»RºÂPz2`§hWIÏ®uØ)ÚÒ³kvŠÖ(a;v­ÃNÑ%ÌaÇ®uØ)Z£„9ìص;Ek”0‡»Öa§h¦ÞÉaG®ì­ýˆºE«»Rj?àŸ<ë°+¥öãýɳ»RºÂ`2`§hWëÏ®uØ)Ú†ú³kvŠÖ(a;v­ÃNÑ%ÌaÇ®uØ)Z£„9ìص;Ek”0‡»Öa§h&ÊaG®ì­ýœ|¯ovŠÖ~R6­óNÑÚÏJÀ¦uâ)Ú&%`W€yšx…Y 2Û:õ4ñ Ód¶uîib£Œ9ø2Û:ù4±QÆ}™m}šØ(c¿Ì¶N?Ml”1Ç_f[çŸ&6šÒ( ÛÔÄkÌŸ@#I–Ú5¦O W‚¥vÙÈ `©]eê²E0¨ˆW™9}*âU&N`_„ŠØ*¤ !û$TÄV! Ù@¡"¶ )XȾ ±UHCö`¨ˆ­fd4$_„†ŠxIhÄ"@ÃR»Æä аԮ1Ź4,µ«Ìï@¶ ñ*Ó;°/@CE¼Êìì ÐP[…4d_€†ŠØ*¤ !û4TÄV! Ù ¡"¶ )hȾ ±Õ´Q‚†ä‹ÐP¯1ŒhXjטˆ‚\–Ú5æ¡ W€†¥v•I(È¡¡"^e öh¨ˆW™‚‚}*b«‚†ì ÐP[…4d_€†ŠØ*¤ !û4TÄV! Ù ¡"¶šÛJÐ|*âÓ†¤M]а\3ù ¢a©5J(hH® K­QBACrhXjJ’-BCElRÐ}*b«‚†ì ÐP[…4d_€†ŠØ*¤ !û4TÄV! Ù ¡"¶ )hȾ ±QHICòEh¨ˆO’¶"AÃÑ»¶!"4,µF  É a©5J(hH® K­QBIC²Eh¨ˆ­B ²/@CElRÐ}*b«‚†ì ÐP[…4d_€†ŠØ*¤ !û4TÄV! Ù ¡"6 )iH¾ ñiCÒ$h8E×¥¢a©5J(hH® K­QBACrhXjJ’-BCElRÐ}*b«‚†ì ÐP[…4d_€†ŠØ*¤ !û4TÄV! Ù ¡"¶ )hȾ ±QHICòEh¨ˆO’Ö]ÌrÝL®÷­Gh¨hŠ‰®É˜éºÔ%s]“+0Ùu©5J(§»&[d¾kElRÌx;À”׊Ø*¤˜ôš}Y¯±UH1ï5û_+b«bêköæ¾VÄV!Åì×ì L­ˆ­BŠ °Ù˜[…”s`“/2 ¶">íÔ¥´XAÃ6¸aŒ¢a©5J(hH® K­QBACrhXjJ’-BCElRÐ}*b«‚†ì ÐP[…4d_€†ŠØ*¤ !û4TÄV! Ù ¡"¶ )hȾ ±QHICòEh¨ˆO²íÝ0tሆapS'ˆ†¥Ö(¡ !¹4,µF  É a©5J(iH¶ ±UHACöh¨ˆ­B ²/@CElRÐ}*b«‚†ì ÐP[…4d_€†ŠØ*¤ !û4TÄF!% É¡¡">mÈ®qS7 G4Œ­ó¡ ô@ÀBk”P>ðàŠ<°Ð%”O<¸",´F  x°…ž XŠ­BÊg’/òpÀRlR>|‘ç–b«ò ä‹<"°[…” $_ä)¥Ø*¤|N ù" ,ÅV!å£ÉyV`)6 yô´Àƒ/ô¸ÀR|ÚiS÷­÷¤aß»ÐÄ¢a©5J(hH® K­QBACrhXjJ’-BCElRÐ}*b«‚†ì ÐP[…4d_€†ŠØ*¤ !û4TÄV! Ù ¡"¶ )hȾ ±QHICòEh¨ˆO²OÝïÔÅ#Žë†ÉC4,µF  É a©5J(hH® K­QBIC²Eh¨ˆ­B ²/@CElRÐ}*b«‚†ì ÐP[…4d_€†ŠØ*¤ !û4TÄV! Ù ¡"6 )iH¾ ñ‰Üüà#Nëc!–Z£„‚†ä аÔ%4$W€†¥Ö(¡¤!Ù"4TÄV! Ù ¡"¶ )hȾ ±UHACöh¨ˆ­B ²/@CElRÐ}*b«‚†ì ÐP…”4$_„†Šø¤!Ó·»ŸÍæͦÙ|ûħŸÉ;i»É ~Úœ'ž»ù.ß=ùæ哯žwãfrSßö›—¯S¬ÞM~Øt¡w]ZÕ—¯6ß=ß¾ùáîêéy›³ÖùgOσoÎ^^ïKwW7·ïo—½¾{ÿny÷‡_¼ûþ†þ.ºáé__þ‘’^¿z>s‡œ§fNY7çí”Ö®_¼¼Þ~Ø›= Ù0<üæÃõû÷¥7wO}<»øþz{yqsóÓ^·ÿåó§]<›×h·$Z+·¬ÕŸŸNí¡z}ñ¯«9òfnº0·á˜ÎìýéÅü›]ë¥Â8gïÓ<Î 5_T}›­aŸ>¾q“‰þÒø~щ–œïûÔDÚ Â®Ý/Æ »!mW™èk%Óä|Ó¼^“ :7µãAð—&6JààFOÿ½±.†ƒà·Ê:ç£?~RctmÈbèíÛŒñ ù²´ë…¡V&¯Œl×¾§ùB±]¤xµ5¦Ñ?¶5Ž#¤CA4Â=ÍåSÇÔÓRÞª>ÄéhMÄ"7t·gÛ)+3¥î®=jÏ£…´m¹ Dl¥“ºŒÔ3Sd Í'Þ³&cuM²?ݓ«BI|£.=oëo” çmˆÎÏ=@Ú”ºî:Š¢_šlú%ÿk¿´j¿Tíü¯“YǤïÍécèÑ®©û%vMAl¥-Ãñ™ÚwMé8/Úq˜÷û›«‹»t¼ãÙ—Ë!˜Ö½tM:~ Ã,´;‹Ÿt˜udwÔ¥ÖmkÑ:uuíÔcV±˜t60ßÇ¢‹ÛWûÃî÷Ê&twúùÃB[éÏ‚Oþó¾ý¤<Ü(ß)†)R;=®EZeCê$çé›þ¸×O{/m^¿t>åš´OåÝ¡è/Ó¾Î+ÎS¿šv ÃXl:½C7W)Á+Ì=Qïj$m[‰ Q^4Ò=K0 ý`#®”¥ÕéŸ0ËòLœ¶õ<õÖâtLÿHûzy_/NýÇ£eÈÎ%º&жñû÷·¶¯®îÒOýÙÇÝU†ôæèÄ?U¯,Ù¾¹þ¸ÿÝëåõ›«›«þq±üëjÿÛ‹·¼™û¤¶i¦D›ÐŒå¥$içýúËÝe€ó}ÐóÄ¿)îwûEûýÝü§ï_ýpyõ ¹Üкã‹(ÅuË‹ý›¿ï%¯®>\Þmÿ~0¸ø )ú“¶‹é§~ÿëÓpègèr¼äzµ]ºwíH~Ü~¼^6†vw‡ŸÐU¡O?ºÿC»­$¿I™‡Q=oòƒ Õ3™\{ÍVé)R1tüž/à³Nš<°*ãñªø£Sž€ž°„{ΙÚUã­zb–mUêÅ0<æd¦½ç`°?Š!\DkòAʽ Ú—rîÅá#VµØŸÂÃûS–â5ñGÛÆãVÅ7óã¬jQôs }nâ¼~{ÏçÖ=âsó«®ìãzÂ>íoþá«g“wíð9—Ï~íÀÖühUú©¶.ÇÖg à1׬þºhÿËè¢m{×nÕÞµûy{W{.švÑá×.ú—|ŒíOuŒ]DèNò½D_éãûStñáÿEßWºøv:Eߢ»ùyLÞÖ8þCŽÂOñÁ͘h?ï˦æ¯x'ùmÓrí­ós®6»@—*ó½Dóåµ®9û¸Üz”ŠG—èRåõû»åÍ­Ò×Ì·FFþæðëÚ1ÅP;¦˜/6ÃÙ7ï?^/®CëÆ4}¸cDîAêÝØžä*áBa_Ž…Ï·3\» .&$ª_ŽÝó µÁuØ4جBkýÕ¯ä®x1ww 7¤]4í¡Ëõüý—&?^o/绯—ë½åú‹å‹‰üòü¿®î¶¯÷÷þða{û†ÿpI"Žb³ë€Ýÿ‡ËK%）xjæË‹›ËR·óþîÙ}7Pæç~®ŸæÎnp]¿ïì^ø§ç±gϾ^^¿»ýëòæüwËëÿìëÛ/ßýæ»íŠÏ–—íòò_û¥µËËÛý./Ýò²Û”¿¹âÀâù£ñÃàÆäGóV5ÝŠåø#Ó·ªéÿþvÙT›íg4Õ—o¿o*5•Þ8=Þ8Ô8òy¸©ÂçlU>5–·j¬R¼kº1LfÛ•SÓi¦óYÔa§tËË‹åªR¾¤*HÕî¼dYt£,³ý”e¶´Ì¬[‘ç€}·ÃÜ|_ö˜ºø¥o÷ò‹Ý?¼|ò;( endstream endobj 1515 0 obj << /Length 2997 /Filter /FlateDecode >> stream xÚÍZÝsã¶÷_ÁGº=!ø$€¾õ¦¹4m§mÏô!é-Ñ6ŠTEê|þﻋ¿t´ÏÒÔºÎ$Ä.ö·ß Ì“û„'ß]ñ/Œþå‰H„ÍXfl¢µf^šd½½úO»¾KÂÖ+Δw&yLpù‡ð/¾gÖ[.pY:¦tæ’~Ü&WF3a¬Iâh’*¹ú©§ãVÈ„ÆdÇ~ù3ÂõÉ$3žË ¶q`¿Ì- ,s+%0Çuü¿ß­†—wÉAðŽ7Ü« Ní'p˜ƒ³¸VI_/úg„ÝÆ5×$ºeÎàŸ1å÷‰ŽI§¹MwL{®`My&¼õ@k™±™öÉúâÛq‰ôâ £š…à€V{²FÊ·~yê\BdLr°M’9ÆaMÔ/ …¡&”MØJho¡9Èl¬M¨¼æ΃HJKmæ0¡7Kä—GJJ–§ÒéEÄŸzÙ(Ãé~¶D{B(ˆ{+õÜÕ„ÔÌJ®¦Á@ =D¨Œ9eÌ2ˆd­­jù_)ñút°Dû€êŽéé,S ´—A ³ ¦G¦2 xdvjªÌ0áôTÙP¨%0<ËP#íW€9(;ÊãÎ1Ô@û–F›eО1ç®ÙçüѹNÏùK´_ç¨îÓ“þí… X vÜeG¦r‚i©ŒœÚÊ+f RÏ4n%ËôÂçXk¤ý PGGü9Öh/ÁÃ…GÚìÈZ’{f-WSkI)˜ƒÙTã’CzË”=ÇZÚ·„:DÔ¬@ƒ§8oµ™t#ÃÒ¤ÑL¸3öÜnd‰þò`'w“»‘ÚË ˜W­Ñ8c72,5zÔ÷y5z‰þ+ •~z^ ½„YíÅ8½v-Ð^Â,¡bœžÐhß øÌ‘$Lj-'a3YÃÆ*¦Qg‡ÍýåÑNÓÃföBfa3ŠqzØ,Ð^Â,lF1N›Ú7…0t?ó°‘Ž<›„͸4„ †’ã2Ü‚Ï ›Eúÿ)Zø¯ÿÿpµê¹ZM~ºzsõÍím~s—H¸³z¿oÌÐÞl’ŸÓåýa_\¯¤á©dò×+%xzó—öE•weSÓÓݾÙÒìÛOùvW t`Þëßü峟־ùàõD‚•SLhŸ¬à3†$ø)ƒ¨ tj¸1£8T‡ú°KÑ®;Ë2w‘qÓ:AU–¥ÝC±¿V6-îqÙ¦·½Þ6×òc±¡GØô˜‡}q¡¬i^?ÑÂ.ïØõ*3>ý¤&¶ýA4i‘´öØÄãò¶\ÓIAºlß!@§ÀÑz‚ù^ÈÎdéCþ1În3Í¥´õSEIÚý¨(ØײqÓ/\d‹ õàÒü»Úa?²†›»éq¿[8 PCü}á,»tÖ¥ ÉE6FÍŽËëÍóÖ|c¬{ñJ î4•ÉgÌãßÀ<ò²ÐÄIæi›çͤȉÎgþJÛ?çP³ÉhK\sJ Ò¶Êô–ÝCsè@ø¦ˆvÃRýŽœÇæPmbC4žËØåqŒyÊnGQú©ÜNº¨_†÷ˆx´ºTŒîB(’D+€€Ò1#\ôVè¶ÌõJpÎÓâiù¾ ÂFUMoš-X¢í%ì!äõ}ѲôfŸœ(´V™ÿ<Š&­\¿g%Ë¢h7½çÕ}³Uo§¾,ÒŸÀA ø€8dÜÞ¶‡-Š„ÝCÞáLŽaQÖ»Cƒ§oH?÷V°/¤\ñ’Ôžigú G!'ï‹|ˆ¨<Š³°„[B=#‡šÐðŒ r <òº}¸6\Û@+eK/iDÇ ×6u~‹}tXF5좆pûÝJ%0ì^)Ô´Û|…øÛB=ˆ¢¼ƒ(÷åµ4éGôÚ¢Žˆñof¼;Jn·Py Í•ôÑ¿pîBüá (NÇm˜> þÜàIÐççAŒpŒO¥ý3!gIå^Ƭ²ÁòAÍpnN‚ôV‚•€–z/j{™ƒËÁ PWD/ ʼŸ£¿-ºÇ¢À0ö2LuÚ[iÅÜèaÐì¨a ~ƒï÷{0JäHáúŽLŠŒ'uÁp6õ|®+hBù†ùCSm‚ëi~÷í0G¬!Wº†zSkÏ\&Ëft‡®¤ ¢†Ü¸+êMQ¯ zw¿Ïwô*H¶¯› å~“£Is°$U‘Uow1Grb'AïB+P?²˜¾;»g‘â=@‚T¾”±¸(!¨¸à$ŽÀe6ICð.c"Ö|EJÇõ²£«ð¦ ‰ Vê&òÝæ¿aÞ-è©-ê6NC ÀX5ÍoDG’Eg‘îûV½Â[ÜÔ[Ö½@½;’ÃZÈ~æè:YvÅ~pt£ÆEq dG#ÏðÝÀ‘|ƒ\ÈôïäÑrJé{'—Þ Û=M—‰zÛlÊ_8—!ùÂó‡*ÔѧÍê_×+\ûW¾s“ÚpgÐ…H?ÏËíC,Ø–’;ŽØM”E\ Í‚í+%,Ì<žƒg£§Ùè›ÈaóÛ›fME"0¢ñ¯·¨B/lCwc£âPxŸ­ûöØb+²ä½±%WTJ ²™’Ö×UÓÒ7xhvÑÂø(áB@÷¸c“¯&БkCã$âcü´ƒ»‰Ó¼"„7}ºld/»¶¨îBò‘/eznB|IŒyÕ64ƒæ«-CQħ ¯‡Ã‹®XGšMÙþÚ”uÿ4t9È&t90ºœéb­å€çZ=ˆ¦:¯ÈC«– ×£»Ùß‚ù¹‹–„Iì_$÷/õ/N©érLŒUî62ÏiˆUÏh–Š¨Q îëÛ‚Å MÎÀ¾]!çÑS¸:æ•<’v,~WédálÉ´¢ë–.ÒgA— `ø÷ËñÔ?-\ò𠬚*dSЈ—Ä‚;¼˜JÕë|°ìè{Ïébz}ÔG=§)ûEMÉ™LèÜ W7Ð÷o£"¨ã¥†s~¿pŽfø‡Ë|v­Ÿ!Ê ìø)"Ò®vc ëçÚyû%÷³g¹Ÿ‹Òwp8‹Ó¾íH¬¶+v4+£p!¯Àóý¾9ÄW f¼˜ö*È7Ãu|n&c ,Í‘fô¾~†à×gÜb àm[E’ä$㮿'Æ~ÁIyx^8¬q·]¸Â5ˆôû;Z&ÃHüYoÀT`¤˜°o×+ʶkée‰szš@XB:¬†Cã…‹ œp(â*VËAˆ…Ì=¹rJ/ÙÖ½.†+'bò>ý~°,Ûp–ŽÅ”JC˜>[ €oÏ’T“¾†wQV$i—D^ypn/M8A„5GŽßõZ†G*jØE&Åæ~ÊoéstoF½2\ôK9(Ùìë^×åë‡Ðbˆ £äáKξÙíKhœz(å>ŠJq=üb—ɤ…ˈR0Š˜™„Ÿíúöæê¿p‹úD endstream endobj 1532 0 obj << /Length 3377 /Filter /FlateDecode >> stream xÚå]“Û¶ñý~uÓˆÁ7Á¤/M'N“tÚ&¾Nlw†'ñNœP¢Ž¤jûßw_)œîlߤñ˜´Ø]ì Éî3’ýpE߇+ _’ÑŒržJgJñ\SšmöWoÞ‘l ?þ”‘¼(‹ì½Ýg\(ʼnmöúꗀ컛«¯_i••y©˜Ênî2*hÎD¦¤È¥–ÙÍ6{³úS{ßõ͸Û_¯™$+úÍõ»›Ÿ¾~%t4O¹”š7»ÚÂî»mó–VomÿUÛ]S²ú¸]ÿëZ“UÕ»ªmíoÕœLwg¿?_3¹ªÛö£íÖ£‡Îmã-‘„–¥Ú@ƒ"gaußߤ¤%INXñ9Òº$5 3X¦É5/¬~<OcBT̪ˉê›ËÙ›5ùüZ·ÕØt‡ÁN/E4]ȼÔÚOÿ5@¨¼,¸F•+š­i.`Ôl¹(XA}eåI,¬bñúX^pOò-a"ÁW™ë ÿ£ûÇ|ÛÌ|›ZXNeËCC‘¢ôL²@I`ó0ìBakÊY.„‚ÍKé ýï§1­2NsBÄE•ýó¸­Foæýý:/'\—õ'/è[<‹ †ÓfgÉ»ÊyI]ù1ÏRJlT§^†#s´écÕ€œÇ:GoÛ¦¯7FЀµÔ9Å\Çjܹiw}·OY‹Ê)¸ñÜàîÆ.ƒˆularãh^¼µ_š‹iÞ÷Õqg€¡M’ƒUð‡†Ê/-& 'R:*¸õ½®Oñ ~¤‚ùô gU¹žxf‰Eip“ ¹7$ái:geùl_=$˜(rZª)b’äcÚ1軄H@?…|l Q]B0Ö%ƒE΢:/uˆê$+€k0MÔ}ŸTEšƒÈ¤Æ8ŸÉo¶øyOû ÑÅ,÷`&Ü«K“™×:‹Ãߥ´»29sQzF’ƒ£* ô‡_$[\Q¤xšY­T@Œ¶œØâ Í%qÁh¥ÛPcg]ØKÛÿ—F+_Âh/Û¬*sÆ%ج;{Âf!Ì ù ›U"WÌÙ¬HpÅao”üSÃËÃÿ¹¦4dÁ…Î$µ¨'40J•OkJ2€Ó–¨Lp™·˜Bgs—Nµ4_xÓ,¦ ŽÂ^òÕ#™R´‰¬YÁÑÌVö@Èd®Jú Ï×Æ>© ¶ÐCBÞ%€37ê'Ä †ªµxZÜ`ø¬pâV ¾Á5ן•üÌ$dr‰8ùy4ŒË§ˆ¥©Íì¿ÌdÛÔ$gP ×1!CâNLñ\bú>±¥ÉxûHsGŠY"ø–ДìÁ‹•ü4Ñ÷‰uBÂ#KãÍ",”&Ø‚MHÍÖù…BSÏšþý…–ÖT*W„¤E÷{jJ§45ŒHîMà /Ägfn2I¼ŽL)4b'J:à ß3è0;Öæ=& AìW‚¨±€#‘_MPá%+ÁÝ#Âx= ÖÆÔ8Û¤Àã3þê6,jw 9ÛìÈš.sˆÐJ §Q Š„.?¯~\O¿Þe¿˜íqaëˆ <ŬИà;/ÉVÒ¾4Ì“elÎrwú¢ì¥7 nOüq…žÃ¾(@òMÆðNàþûÎLÜ>&\ÀBaS2¢cÞ ‚·Fö›­Ý×/ç½è:üR\RçÃuXIäI NÚ K׶aÿ¹+8ŸùÒk€ó¿Ob×>‹]Gi¬)ÌjC>æ ÝÂX^5÷§+ûœ¬Xο¹^sBÜU&.P GÍ­ãеÍÖþXõ}‡5µ÷ƒ¹…4cÔ_ †æ~7ºßîì7¦I-fÿÓwu[Ão•íÕn¢½öäöÚÎI¥¿õÄÚn|ƒRÜ]T3º‹”±¯C36È箩\¹[ŒMÛ ÈÄìR °Á^Ž§/ƒÍÂ÷c³©`/¼~t·!Ç ‡OmÕ_ â/[M ‹ïÛ:Uápº¢zQë{ü©¥nÕà„Uÿñ¬cño bX÷ž•qÎ.}ÌzÑœÌE¶ewÆþ´“µZœ¯tbÑ^‘F5|–äP€Å®#¨K·kZÚ«˜5‡âú3nÏÊ\¼L\WÌÎùü/5ˆ)ÓƵ–É5x¡"È5åE+ð„`lº;òD/Šbµn'`;K+Ì›[93»V¼wŒ‰BÀŽJˆ¦Ê½%Œ%è XCyny19ÅåŒÜ1A7“2&÷串HÊ°àÏ v@èDO-Ÿ=kùìy˧—W¿öC²â¯D‰ï ¤àϪ§‰ç³ë– ®bý6áFk§"‰ØàK¤s¥êx4M¨ž=G.FgZº° ý¾OýÁ¶ml€Æé`74aÜ iý„áÔŽÍá>½(lGš~ù£ŽÄ8[z5,XLîÀ¯ß Pw—¼-Ç*—–µˆMc@nï÷9¾(bt¾;}oß%PÛSÝû}ºVlÌð{΂fÃÔâ–aÆ€m øþºíº£#ãðÏ´J­VÙêdo ¤µKq•*Lb^DcRÏ®ÇÎs¼iOÛÚvü{#™Ê½œ`J䜉¹dïqº`=›àà˜„^~6ÁKþÔ³ ªøSZÓm0$VÇnš[ã]ÀÞ0V®å3äÙ\AA£²Ÿ÷»¦­Ýtëxþ`[O,o“Š‚^âSAj]<½Ö‹ODfïš0' ÅêoÝX{nÍSáUhW`<|®8 ‰Å[Ƹ•öšÔ“‰1îÙ~…GæŒ ;Æбᬠ›Ž RÂàÆúît¿³ºêÛ¦îm'N íÈêä› ™‹/º·Xx ç³ËÈrëöÎò°«œœA¹ å\ηµ±@| O¶ Sm6]¿…ðl,LÄ``·`+›î4¸_|Èr}³àkc,œF”61£ 6a†¡c2jŽÖ²Y èìø{|ÙÚí,Wžk@"Ôj8…·ñö?¯˜®p×ᘸ9˜MSF‹ã Åê48éЫTÎ úÌ«K1¿š½àÈ ™z¼G¶)Ï+rÍÕç¼²yxŒªŽ©nºýñdÔ‹Fm£Œq`®v2íTØE­û)î±Fªž$íVe­Î2JÏÖ£b«¿6‡Ú¶TnÙø‹=wÖÓ~ÎaJÚÐhà+ƒŒw–·íûM~;Öýp¬7qRàæÛˆf°ßºŒócÛlTÊì—–Ò`D·mûÄdy4½íF&p(12„ Ê­‡+~wÕ5#!CA ë¸ø[p\ì4‡€Ã ÕÞµ"-¨¥"”€äSÒOÓÆK¶ºÙ¡€ÆÃ6±é^`ÑÆ}>b®›"ilOǶÙTfÃ`n›0‘VŒ"0/ ó2ÂæÆ(§áTÙ—ÑŒšƒ}½ïPlVv[;xûÑMíª¶6˜†š>–^£ê;‡6W”.¢1¿š„2­Pï8ÌçÀ8Ö¸¯µZl)X»‚@v&æ™ö­Ûv‡Í£€Ãj>ÚΦj¼Ô–g0•×XŸ×:†±Õ9•„ÅÛ±vIÑ/ %ÙÛW½(m+6ièëÍ©ÔOÛšê€t–ƒ`U»7;Ú®ÞÀ¦zƒ;:,0ŒõíE—‘½h@ÓèàaºŸí¾o }hMƤ‰5&¬ìWÞÖ£)zÂ]U, ·m³Î)/—œà€cbŒÞ:9ÔˆáCµ-Hç~6®ßÈä{8Åõ݇f_…2ô’€•;ÂUë•âØ—îèÿ‚±ŒÄL –Rû‡ÎCçž_Ç<“ðªr5¥ <_x»ŽÄµ))Ø£Ô‡ CºÅ!,/“çÛ¸ŒOP†¦ÙIsá •˜qñb•;…«eúB-Ó¥?0ôêZÀ†q²³íoÔM¿³Ý¸¦)\MSøš&ŸÕ4¿Z¬bžþAþ'ìÑ]kWÓböNü×ÿ>àÆ¡ endstream endobj 1551 0 obj << /Length 3270 /Filter /FlateDecode >> stream xÚí[Ý·Ï_¡¾Iȳü&mãÔ©[  }pÚbOÚ»[[ÖªÚ•/þï;CrWäŠú:ßA§¥¸³äp¾8¿!ULî&Å䇯ŠðüîÍWß¼²bb‰ULMÞÜN(çD+3QRÆåäÍbòvº™q=­Ö›™Óf±W‹Ù5“Å´^ùç+|Qßm=ïc„“Ù5§ÅôÍ}Ýú>ÿ~Yvu¾œ—¡q>[Tí|Sßô3”íìßoþþÍ+Åb‰RtrÍ(áZxo=™0™ –X¦#ø¹…§I–ˉ¡ª§ù%ðd!yOðmfA¨¤=Á§,‚ñˆ šY‘"…‘=Í2ƒP§fg,FŽ£(b57=+brM‰°A³,³dN,0]°ìt.ž›+Y×Þ\çè]VÊZÅâáž aÖŽx¶4"ЄÚaQ/2³XB‹A—,3…$ÂŒ40Z‡Rº'øOfKÓÓ!MæÑ’År}‘KìRny¢Ù Qž5kØ£Ìdo9<³œÃÊáÔ;Ñ×ÙåHùìÚ=:ÝÈË™<°LÑÓÙ1¢e>âü€×Ò‚H:ŒôßÌ0׬€HRH°0!.Ö4&vŽ1 ë£gÓHÊÅik1Çô”x×Ó;ψÛÈy>å¹åæÒȵgUô ã槌[}vH¢ÇVšìç8!{¦X£íg™ÏÅ gîx'£ÍX!üIõq:})}Œó<)Näy°V=èì.›{±ÝòÇ ×\hØ…ŒO•'ü±é0}6fÚÝ—]ß ]‹æCéuh7·£—ÛõCé²rÌ·gèøÉ RøÕfY®[ßóPw÷£a63*§åêi«Smê»ûn˜ V˼¦”X™ Œ~n^hq 5ýXÏ+ßœà$my¿ÞÌX1Ývþ¥_=~àfÅ®~õØF–ð¹ª`0Ž£ÜŸ5]1öø#uÝ…®æa•¬AõkHð§Á‰( ,AÇÀ¾¼õÏð’N›ÀMÑ@)a)@©dŒÖÿðbr_D³·~@‡°Â~ÄÛ¦ÇiØ À+£‹u¹éjœØ1Aêuou¡4-¨)3ý)³;QÊ ¥ÆïO" é‰I+šDDn=L©ì¨Œex2(Íæ =°DȨàÓö5çø/Û° g¡Ðx¸¯»Ðô,@ãfYÎÑÄÞûŸ‹¦k{à“íc_x`íÊI²<Ü2†Þ®«yW¬–ŸfRNV~½©—Kßwå1ðC€Æ÷åG¯+j`/æ‡1ÿ™‚&Š¿È„FÈÒQDT/2‘+Ùr€X$‚§yÜ™LÑ'aêW^OR Y =QNíƒ4+h»þ2Ò8€÷¥}„0ž'#ý² <·2A%ÎÏ–~>úý %¤'‹êÙRþ˜„4 ëFƒ¼èc;=´Ûp{Nd¿¡È.¾hqWœSÜOSÜçwÅïÅÝCð<¹(`‰g.î^'¹žYͯ œþ^Ü=RÜ…Ö.Ën¼Äpó¨­ƒ>ÍÖñí© 6[cX»`iÖk„ÑŒ¤Ÿ‹‚ùZDç;¬Vñ‚ýÙ=n׋²óÇòlêjA‹ óåvQùζn]ò¸¯½‘Ó*«Òs`ª2ìa5eó'BÉ1½jˆöÉPcM*tarå×çKCп(Û{¿x &à/B<„OV -ua¨á`¡d-ÑT§õÂp7¢Ó•£}ð?²ä„Q›’©e‘d]ý ÍÍǺٶËOþgª…mªP®w¾lZoUÂJã;k4¬B#­š.Pã÷}Åq¨Wa'h´Õ¼Yõ/ã é#DY‘úˆw^ÅÝÔø\4® ©ÂäØåêa®åJœð¬²~U`ñBÇòã5aÜœ:8¸kÁó…¬$‚PRؽêæ¡Q!.õÁNœe¾ ¨’Åôo̓3#W%§­šÛ|@Ê%ùÙêàQþëÖ³?ü•Óý¤&ND‘b/CŽûÛŠNñÄ aù¹Aâ˜êö¤Œâ44Üôµ{)±8ì"E$ð§«÷I ™ q­˜~9öNÿ1úæPgF"wz ÅŽƒfSßÕ«réåÏ ˆß;dq—¸Âå,$ôTÿÛ¾³ñÏìÎ\p"(Ë&2ãàn’àþ6ØÍ/ ì‡6’³æÚyûe»È3MfNïÌ{[ñDÈS0s¹+5‚pË°pC$5ðIÔìš1ÌÁ¶ $’Õªëõü²ù°ÞvCPá<2°Ö(÷6.éx‹¯uÑš.^ oUø\7m[ß,¡}ÐضÕívéÛ.vp;;¥7ill¼Ì„5ô‰~Nç á‡svåOñ|Wæ\ë¦lëy¸Œ¼ íï2Î7A$°ªèDÆ¿w'bóí@=ÍÔ·¹ˆi Á/2*OÀè®ìÖ;`éa ØlrÃÃv رÿøC¾©Ý~­øC¹n¯rx‡ŒPŽ6à ŸîÏ®/TgáÁÍa_EEš¬¯š"Î`”Áj®2ãgE"×QŽçäÎÛÓJHÿˆ!âÒ£$g¤ÇÈS©c. ‘htТ Û>'wÅjGñ\Iy^>¡àð2¾H12Ò—£z™1ª§¦ûKÆ…ƒÉš-~‰õŠH+\ÑQ •TùÒ8f`ÚøX7Á¾Ø‰± öQAÓÍàFS¼Ñƒp¸ àòôõzÓ”óûÐßø§ûO<Ûí|^µ-$<Wñ4$ö›í¼v©˜ƒÍex] #ºËT…ì!5@º}·]Í»0€‡ÜÑûÒ¥xw[Lhry°¯ 2atìÌmпÛ>°Ú¹ò&‚sonŦZoª3*—ÿa—»r•þg[¯îúW}žâ>\ö5TÆ,Â-r•[^Ëj\ÑKs7¤>{"˜½¾õ¯‚ž …k¬ôâûf¹p7˜´í·y ºù†Bö|W¼È½·Ú~¸Á+[øIfÜ©'ö—œîe¯Se¹¯žˆ$¯«D‡¼7¡cSõÖaÆ/ Ç^U(Ÿ‚Mlp¸Lvsi!ÓkôéXUƒ/‰E£C ‡-€ßáÅé>S¾lgP„Ǭ¼ÍÄMŒ’×®\ÆwEØ>}šQ=àt˜T=tÂNdˆ ðj°×#qéœãOò=‰fÝ‚…Ô«. •Íí˜ÛëåóHp$)b$Þù¨^¬¢Øõk¼¯ê¸BÝ} u$¦‰•1¢a z•ÎgõÔ{öpé5cD:þ;Ö÷Yæ©ÐS,›þkfüÅV—A—Kßëg ±@cm2ÂÐj\†4»#˜—™™•§®€aB:‡(ÎÂC£cq¶ v‡„c¿6f„÷Ž©Õpjþu­ ±‘WgæÌC§`óûì0,=Ìpæ¯õnG vm u™žøÍŠ³ÞÓ1Ö»ƒ,ÿ¦õ5vÀÍ-ÿsu\¤úðy¹p)àuD…‡t\Lÿ›F…EÇTÕy^Ê%ñ 4\ ¹õÜgHãß…K9r”‚Jþ…9]ž‹XûÓ!›0ÂSEÜu§IEmd8¦x¯ÕgÖÄq¯U§/ï\èµN!þš8è*ÜÇÚQvts9”BñÁeX¸Z.}&ùRÆ )øÞ°ú÷Yž¢R}ɹ캲ÿƒñPÙø8s¦¶ ?‹ôÈ!M+B.*‹]¡¤çÕ'u©AüE)ÛWMʘÚæîèšrqø/HÑø « BuDø}þž…ÝKý0ìîÖä•'ü¸`=üÜŠ—u8@0`c)Õ_ß|õÕí Q endstream endobj 1566 0 obj << /Length 3202 /Filter /FlateDecode >> stream xÚí\Is¹¾ûWðHUD ö%.WeÆΤ<©Ê!QUvmªeöL‹­°ÉÑèßç=½ \DI–äè"Bh4ððÖï ÐÉ× üí ¿?½ùági'Ž8Íõäìb„ FÛ‰V†p¡&gç“OÓbY¯óìüd&¨›Vð«ìô3U”?ŒœÌ¤ÕÓ³K§7WÅ<+Ë›­¦§'ÿ9û凟ìÀ8áNÃð¾ë¡ÉJ¸vM‹ë¢,ÃÈ_rüµÓ,ü[¯WÅ|Ë›«|UçëÐÀ“ˆ/TëE(W—)Z¤%–©f¤¶M4qFXl¢ µv2cDBu`F‚bEã“^£l¹µÊ–‰#VÊ}ãš½ãr"…é%ño”DŽ/Lf‚ "$Χ¢D׋|•_T+ä¨ãÓež#½NL×U¨™/òùo±j‘­C%p1+–¡6Ì*a†_óPçùUÐ{,ÀúX'\M?ajÎ˪Þ4ƒg«X{•­â@БŸ¬æ½ÉÒáÞ'ø¡‰T­j¡‚¦xO³G±Þ‰]¬›K¹KÑ aÐgG.; JSœœUö¬äÎDæ`)ÈK«¼Þ”ëÿÑÓ‹èxlо³^Ô¡ˆ¢ñUÕXX[æ˯h*Ø϶q©Õ­­ü–%œËn:\%¦Œ%Ó´a½9{-Àñóÿn²2¨.w‚0iFª Ê‹³T´ÕJ¬ôZ‰•Q+±íÙô"eþÔåܺ 1CÕš¡`lúñ"Pµ¬Ö§-ÑË@U$Ÿs¯òË|¹†Yû'ÙÕÕªÊæ‹ðxž-áõðäKÞ¶( °XÏ$Æ,a\ ™¦=†N¿ö„I˜/ªbÞ0)Å ®ÚÊûóGÇmŸ?(¦„<À¸>Ø`H3N´‘qþ:<û½Tµ:ÏW}Ï&BAö¥Ì‡OVùU™Íóe¦ì؈ ücN¢™i €Šä´gÜkøå&aKLkZCù}]àyNš`"x„DïP4n'j`„Ñv²õ¢Ú”çC‰ƒ¾×ù²•yp1šeÔÐzÀ$ËÍ9¾ÅL" ”†#ôˆÉ#Ÿγiâ&ô¶ ­ìè-ˆ,6@ç)d0 Xoæ‘Ü·¡ôñÒÓ±ËtXâ–‚¸õw 9‚ø€ ™ šBmÎ •ð‡øÌœÓó`Ûø¬În³ˆXXGbý¦N;[©ÇØ™ŒÄÖeï’ÇhÛÁìÌ5ÇAðÂBQ ú”ÔV.Z›M>ðXX~ÿT}õ@Éy0;ýrÂét³Œ¿Bäx ð&%–Ë<[6õÙºalb®s‡±E˜špµS–¨¢Nî–¦ê¸wiŽÀ©ì¤dd‰£âÝrζgMò°ThN×!!žq‹l-–1õLýÅQ2ÝÈ4cCG߇4´î‚ý¼@ y{& =o–0Ò` c®B]±MÈ„Šób•Ï×ís ÈÍXÔž0×”®ç,|¹Ip 1Ÿè;‡4< câK eÀñÐbyæŸö´þËP‘Ç?UqÞ$‹Ö&0Ó7 ?1™NP( ½n·ê-jÅÐá»Ìë‹-Q^GWÀô0CÝji Ë#¡‰N#B©=q€ïVÚlGÜ£sC{Xë°À8Xæ†B¼ŽIù"úº¸Pƒé|S÷êä+¯ ÈP)$„ ÉľR½èçé×1±Tç%|·Ò|¿_Ž¡~Q[áRZ1ߔ٠ÝÎi¨,."3S¼÷’2@I<Å@;\gÉqÁ&Á< ø[ì‚ðªnR~€eÓ‹ÏÝ¢I^àÊ.Ä¿­éª@Æ"OãT ó4Γԋ.-L; maf;é¸jÎåýi—D+6  ™t†»#\ÁÖÁF씉Oá^³ðD`õ€ðq,39| œê ¿Pè…Eó5õñëOˆˆ_ ~Nû‰ñ{âïl}ánžØãaþ’ñ°ù†MïÄÃR®d/86°'då¶Ø ø1«%¯¨û±}}bÅ÷•¯Cö¸,¼:ÜÃ] °€·Áb³?'¿»QÆ»ù™ä„™˜³ŒûûÕÒ©†Ÿ¬ª«|µ¾lôÈn£gQ•çõé–]¢ô׎000ÜT¾s/Èø½ yŸ½ ãOÇà^Ú= Òfõb/ôxbXÐßja°›åòÏ”¦¿O‘Ìàdl3™'àøx UŒ¿M‰„dìQ ScÉýf-Ø`jÝÒÍ C 3ƒ*d@q®Ù9}tÇý*žÈØïd``TöÖ'9(kUd­êY+ê2Iëö¤P‚4äž™¿ŒœpsíÕýAÎåžf³öåæ\©DÌQ1uP¢ ö% ÌA_©LA=©Š!z‘ªïS_o͸P¦œÇÌBÆa¯E™¿Ë݃ÛÕýp»%–º»àvõ0(ò!£Ã¯ÜÝBtò•îǧbj4†ÄTùX,íÃ-Ú™Cb±¹ß×GˆD5N“;ùØ_Ý!LÊç·PsÊݳs5ü j¢£a^w3ßÍ”ˆÊÿS K„Šâ¶Q3Ä¡·Ê }ªÕ¬@ —´¶­ÖÙ;¬Ö= Îz Õº¸ôˆXý²4a'NO.ªsmˆÔ6âtÖ6Vt·­Xn[±þ@y«âM$P‰hk®c£ë¼Cb¹nÚÅêp±U¨ôu­hòá…Iø¤»0É·«Z:Â]à*åèöŠÛ÷’ùäÂ*3YîD9ÙœjŸGàcŸGXݤ#P…—1Å¢?K¿ñEÆ‚¿}ËêxT¤.Fk†÷£ù· Íñ§ëÔ™õ"šÆƒðeèÙ­T<Ÿ®šÃÔÙ|MNf ÇéÇ <Ïn™¿™#ž‰oÙíë|^-c'É«ÛTBüÇßÞ£ô蔌oÖÞ?Ð]ÆËÙ`FÑx¼P1s“áp·¿ª§9Zïh§Ž†Cžä/ð…|ž×u¶*Pº††Q/áèl…»x?´¨c›ŽÞãóp?@Ý;|òÒpgA¾ªw]©…·4¨G¸æà o/vœ(Zˆ_áÒst< ð¶Ñ_ÏÞüJù endstream endobj 1580 0 obj << /Length 2831 /Filter /FlateDecode >> stream xÚíZݓܶ ÷_±}Û›Þ2â‡HÉ<¤MÒ¦mÚŽs>ØéŒN«»•­•Ö’6—ë__€ >¨åÞmÛ“Ìä‰E?@ŒV÷«hõÇ‘kó⳯½âœ¥q,V7w+.%3:YéØ0!ãÕÍvõz-XÌÌÕ†GQ´þ¢¾úþæÏŸ}Šùg±bð%µóÿ¾/î3šæS—œÉdœ¶©ÊwW,•‚ÑŽ’}X+a‰JÌ÷ …SâI6Ø¿G œ«ä!jÞ~¨ë<Õ'œ3îÛ}-¡Ç ¿ ¡%aÂò5/=슶9Ó„¥’?eI¨­ÑÔ›Üc“‰öÜ%XP‚m ñ¼³!Í>#4 x*©Xœˆ…kð×L«Ñn®4`‚Q‹ãèQÉQag˜=)áÛPûÈGÖ:1s°ÏꞞʺ·0ë~Pé&ïžQèÝP77&|e x”`ê PU :ef’&(oÄÌä öÙ#Ѿ-BnF‚þG¹ypóUšLúßHû"«ËúžèjB~{kav°ì¨­j‡ƒÕ ̺mŽ“q4oÚ¶èM½Ej}¤Âʈµ¥ÃJÐszBv'ØÃ]¹/«¬E蚃6gÀ¤ôÅ6%éú»c¾#²ˆH±=‹Šéu>ÌC¸kçßö€­ Ç+€ X)p|Ü7‰¤b¯»¾ÄÚ¡¸±^W "¬«OxIÒCgÐ1t­Ž;ê[~ ¥£ mð«‚k˜ô™HÏ}lv;š]ш*È(§ÀqãB¤ÍSPÁŠ™ï†ŽÝ‰A©Ns%:g @è‚vù!5 W¡íì¾^ ë(]í'IÄ°^ê»ÜïÄG…w^¼Ã0zo¼TŒÇ£y„"“„ˆ'ò»€@s€Êâ å‘Z8² žÆ T¶0D#Ò‹H#bõŒ GõŒåÆ.@ÒŒ‘sâþdœ;iô  ›<tãç€núÐåÏ]=ÕÓ@7YÍ&=tùsHW„–;Aºr¾Ü9¤Ë/Dºê¤«.Eºê¤«> Ò}*µ€/sŒëa5LñA?JøN™BGÄ×Û†jا  o©‹[*jÙ^ 0‡ãc`±¤¨aÀuÔ¶X+Ü*e¿ˆ7ÝÉzÁ"ÜP™…#FÕµªºQdš‡²îPäeVÑCžu‹ÐGD[?šŠ¥H¥T°,Î×lPDS‘-õ¨ÂDc¶378mgð-A¬a —NXZc¦­ "š½¾1zç× 7!ž³…¶Ž·]_œŽê…Ž¶e÷öXç}çëh|¿Ø“/úÅû¢Þ^OC®‹«fŽ•ù¡] à8ÂDÌ] Zv56*ŠêòáƒÕS¹+hïe[àº22ëÒÖòÌð¨ ILVåÇÊÕ¹ð{÷>£×û¬®‡U¦Àås;Õ^-vfgƒ~aË+§ È›¬6ééuWæß/ÕH0. „@ÎpÜg·ó ^»b¥ÕsÏ,ò/LThØq•TÐœÀ"º/ƒH‰§óÂ#àtb L™*>Ù²7¦Ù•sÕäºÕðß ^ý€ãYutÿ)Ú†zc î±ÉS˜Í<•2€z¦ò¦ÛbLø`‚ïnæQß9Ø’ìÚ/ÙO1'€@A-âÓæŸÍÜÔÍÜÌ/+s‹>Zæ&É? N27yq¢z.sÓ¿þ¡øõÅ'øCÊÛ +¥ÆÏ̾±•JM÷¤4'÷ðåCAïúl¸A‚£Y 3*bÉd‚_†kåñTêu%R0÷P¹…vǪ¢Q<#®ÀW‚¹ÿß–ë;j!­ ñsMnîU@­øfôb¯ƒŽRN•RHEƒ"39ýO9WMM¦j*ÅUÅ™‹ôÍUCÞÛ€v€vÖúñASZƒNAÛew½éÝט¯àU,YÌÕsðJ_¯ÌÏ^!I$Ý~=ä»"G]BNйk|Teì?¥mioƒØï•3n¼ü$Áo«“ëD‡†îº¤†ð´Þ% ã.a˜á†ñ/a¼ í ¢Ù_¿Ÿ²;?[ðŠ¾‰IN#ø"J$é‰Áñ…H H®¹ƒ¨¿ È é Š$õd^ð›@l“ŒC$žÝb1ëºv“šcí®äw-5®Ø‚;ŸA‚ðE'ÏèBkù»-ÿ».BXj–eÎÅÏ¢*ŠZà"¹…8ˆMÞíI<×wÌ8Vn ËYžÔš ·?ªOI¼:è9«Õó:è«*¸ÿ¿ÝÿœE7çÌÖ`FÀãÿÑl½íp qÙ8J—¿ý,k„$³Ý좃 Ÿ\õòx2öê|3ÞA‹†TÇ/qëÿ´œÇÖYkK.²¶Y P—øHõ‘}äe¶Æ?‘±É°±-09d;߬ϟ˫ÎYš YÚâúM ëY¼¸ÛÛ]SméÈTâåáPL³Ä•„Þ¬¯n^üqWK endstream endobj 1605 0 obj << /Length 2041 /Filter /FlateDecode >> stream xÚ•XIsÛƾûWðf°*Î `|“µDѳb•¤Äy/ÎG$ÊØ -+¿>Ý3 Š”A§Þ5K÷4f¾ÞÉgëŸýü†ÓøþþÍò"gR³$MÄìþq&”bIœÎL’0£ôì~5û3z_<”E³î²v3&zžÿuµ2ŽË Î,³±Œ½ Áb‘ÌF°”’“­ë¬Ë~š/T*¢[æ'<º™ !" c¢k?êè²(KbÌêU íÞ`yaÅþµdƤpÿ­Ï\¨Àup-ÃÒdÇ“Õ®,3úðýÆé7øƬ«²°Ó”Ï·ê²@ýP==±¼gÛºh;V ˶-—wÂ0ïn ÷I§ÑŸ’'Mê>¤8ãBÂ$aVÉÿnØ4[„UØèÌã/yt‚p6W1`ÎãèŠ-.æ ¤ Öí37\rÎaD¿Î¾UVz?dC‘‚CT¿µYÝM=¢§÷^©xÊR¹Cï—z ‘Wsi"6©XšªC oð~YçÕV–>. XU7×&jæ‚Gë@«X ÈtäT3-Õ‹õ®ðY?Ñ¡>KK­}pD_Øcè[ËTœ|þ×¢n¾ ÀZÐáah˜ü‡6>ákšfÕ‡%a¬ÆcmW”#Þ@¾Û4ݦ€ÝÔ{X­]íp§^‡õã¶Î‘Nb›Î#*4³Zžä¦e6€Ú\xyÛõ@Ó®y(]ÕOiÏ‚›'f„TæOT®××Ù°¡é]“ÓLÄS*©Ù©„4aM‚š°‰…£‰ˆt~Ô lÌ’dtEšp¥ú/™—˜€&ü$‡ÀÑì¹ ’?Í­ŒFJGó/‘¼îpÿ„èރ”ôfIW(ÿ´©ÚmÐr G“½bqTCp~EÆREyÙôÛŽÍc³0@4iðRïQ&Â%‡ *| —“*`RÙ‘§¦‚Axo^ƒbýÆ°mK¢u®ôfسp…_ê cBA@“£ÜÓ§çˆbñ–Ûw0³Éè¹s«ù¿Œ·æÐÿQ´êDú«DhqCus•D«°€âºúÅK€ñ´©çquNg=A]°7]1²l‡¢*þö"šÞŒªìBy‘$¦²g òí¡e¿w]YÔ´¸tÅÊ•è:i´¦Í¶%w±)ú€àvt$ˆ 5ª¢ùâwïm ,[‡¨)R±ÍÞÂß·—0gÇ™<êS@f‰~åRÍ| ÎjïåóTQ|ƒÉ~CG·nåÁƒ-ôaá1ÏRTHUç#Ä°Õvná‚`¼,·{´‚ÆË› 0ip 2¨¶»Ürþ™“âjuˆÌí\óèãÍÜBìº}k§’¤ó’ª2k#À]Ú¨)·úBj#¡f`—ß_*QLès}pù° –ÎüÚ ®S|%Ž!€x¯ƒËÝå…7Ú‰‚J!%ä«ûë12É,‘cV5)³izÃ1›:°V”ÈA{?ÂcLÛ7˜çõÊ¡(¨5îP ˆ!3˜%l_g]¾Ã'祥BFŸNÏïÃn¾üÜ}X=d½[…©‚Àš=ô`ó!ìbìêÀ¢2¢ bu4öæͶC6FÈ•«‡žÜïdKàÊÊ™~àFX)`æFlôèV<ýP:m|½u¥!¿H£ûy¢}hãèv Ÿë Ÿ¯ˆxI„s?&`'Y÷HR¼7âæ1µgÜ@ù”wM߇5¹§ ³'Ûõ¶H!xö¤|EáÿxúB¤F´¹ ÂÒLB¥R{ÍÁ(1è“C:Ymó—³Y¹†hm0–<•Î?5à4¨zE…gGgEŸoûžÖ)õ­ë茵ÞR¹ýiÄô_¨D¡LÅD‰<¿Õ{Y½ë‹áyeî«Ëfè‚!øeöP’•eÃD¢[qЂ,—J²žu®u9kºõ²]æO%þVm»„g°ÍP•qDB!T¼ßx%~ØwH+¡à‡f|æB?ð¡q¡ûï¾baïdìBΨܿÌ’§ž¶o‰ïÒU”^XÎ;ñ’g¾]¯‹ºݾŒÇ}8Ùô›b•…ïP¦é;WY}Ü„·Ðñí ßB«Ø9o¼<úRÔ«>ì¢aãøÊù¾1ŽÓIŠZ^H馱þarÕJÉÃNóŒÄ]åK2?%áû){³½nÒ_"QЮòýZ MŸKƒÙLÈ#—á¯Ý~(ÝcïË4üÝ€“Ÿ}’F¿º²Ñ6C+»WD}Oã]öml|`ENkÆ;C5s‡é§x|~‡õ_ì» `„ìÒt® ,à€(ƒbm`¹&@<îøè·Æ?J'¯J±—˜{ÐûÎN¯C½fäT%)±–>ò¯ƒŠ š‚Nü¿Êè©fŠ[&¨a…ÈK^­×Óùý›a÷ü¤ endstream endobj 1494 0 obj << /Type /ObjStm /N 100 /First 997 /Length 2815 /Filter /FlateDecode >> stream xÚÅZ]o[7}÷¯àcûÂË~/ŒIÛt‹Ýbƒ8 ìn,WMª–×–‘ôßï9”(Kñ‡d÷Ú™÷^^rîp朙!%äbœ‘+~Ø(Îh6ÄU6¼‰©5ŠÉNF19dÞ¨&WFu¦ø†šRüEScF¼ ÚëøÑÂ^%àGûc˜åಋ|OK¶pYJb ?Õ+[xPs9(Á¨dÊQ“QùµmCE‡ïH¾µŠÑ\ÚxxZGÉÆ»ÄÉů‘ñãÛ(Q’ñ˜s8ô‹ÃLjFmÝŠñËÅ£Åo‰^Œ/± ­¹À§šMÊRg‚oo(ž†ÌQ Ù\Â'äÐîJný¢Áüüp-&b|ÎeÐÊ{>üçyôó…óúd"&a+£ÅåÄ1æð­Ì7°Æ1µ‘1@LT}Ää1;Îëñ4G~QD«¶V1‰ðið&i»‚I‹ŽV4 ¯ah)¥åÙ¤"”*ªI5BÿPkvŽâá[² /ð^åp)šì›Ð\Ž­…yrjŠ„ês.S¤B{kâ%S\[Sh½¨¶~F˜ÚÓjJ3ž˜`˜)ðs“趙Þ¨í„~5SªìLuÒæh%¾ Vº4ÐÚ¼É|çÅ*Ö¬T¨¥ÙRFçšø#8Ø›˜ÞiÓ­Õ͘‡ƒ8¾+E+ UBqi9;Fqæ$‰áªoÐ¥O%˜¦ˆOÎ&Í0ÑÄd’šÔüXÉ% oÿ8›šáÅéé|q0]~X´ë¿Ÿœþv0¼œŸÿ<=ç?ß¾\¸÷Ûéñ¼ƒŒ6ÃP}ͶBCð'+Ð^pÅÂlÑï…9<4Ñ~˜¿›á;óÕô—“ÅÉüÔª6}m¾ùæÿþ¼,ðG[±¤ð( t0>ë±>›dYDÇFC¶tr,¯õ°MÉ&ø¶wÎÂT÷FFÔŒw¶Åcb˜…Õjë$?¶bÐÜErµ„"@²-™ªÖÖ`·6߬—ã“ÅÔþã÷éÇÉ'³ãMY¾Ã€¦íÌ3üëßÿ1âÕf‹Üpz9›½¿£³oOX¬²«w­6Àã“S ¿»3@‰ô…Ÿ¹§R<Œe[3|;ŸÍÏÎ&ÇSã—＞,ÓóS£ËËï?/~8ZLS*7†WóÓESã+Lãe5Õ+`ªh./ÙoýF‘duo$\®.°4š´÷ÒçÞ˜NZ=R2b»€äÃëóùñÑ q¿{e†·ÓÏ ó~Û†^O>Nð}§‹ééâ‚<Ü£©\Ì/ϧK^o÷~šþ|2y9ÿlšu%˜s® {y=9ÇÛŒTÒ²c³Ì LÜ" ÊÓ‹eqŪQZãýX-#0­õ$ý­•„¬Ö›=ìóä÷³Ù´9XxŠØŒ(8o ƒ*"0 ,XõFQ~9ùxyNId'f§~ïÞ3 ~Woz¸)9g¹%²_ïXk~çØ.U³‰9YV€wô†ä`"¦Hºkh‡•P)º[ò;É&w«»GÈw2hí± [û&³›ùkqŒâ°ÔöÁC”ëC¨´'§¡¡¡!õF3]íÅ“ƒ•âIJp¹]Å?b®Ê7´gÜb(P |( Óé'“CªÌt Z[_‘2«*Kn{ÔÓý˜»±qŽuàôÌ‚Tâ®±Ot÷`ŸíΫ”ªdHqGïà’­ ,¹AÆÄÎÛrH7ár EX»ª7åZ_”7@öÁHšÒu$]J¼Ic–kHz½/v@ÓúQGÒØÓ³¸~Ô8õ„m¥—±Ð63d’†¶ÞÓ¨6mçu ,BAþ9RÓ^‹¬rƒ½xÛNÅ@@ͳˆJø*Beyå]Šˆ´5øø,ŒerX5°#t rR¬Àð¶#WÙÙ˜[ò‚U!)q—Ù¡‹S ×jOKÛêïļ€¾¿©ŠuÄXM †}k̼UYåñ<ÀªáI)ŒŸ¥Õ–Až{ÇLæ¡ž©I,ß‚g )—X\@æ¨å¾ËÔhµ‡ù{1öf瀰Aè>¢HÙѱ1Ú8[-þ9¶ën¥ìítg” §¸ë¼ÜN >—S/w¦žáä~'¯ïtÊβsgêœÇ¬„rÃK5 ©«ç†&ILš¬>ÊóÐMF€]²¥f¸¥<XYA]Ggf'F ôyÊ€²pÏ¥Š,–ðba}âyh&¶¢G`¡©¨Ö!WÒÃý£oÖ}í"ï7ñô%ôRÛéXQÕ}¤³¸4Eœäxè)ãò «glDõ”Ôƒ[B±%hccž«ÕX¹Éú˜áÀõÍfa„„µ´ã–Œ”¸GÊtðF ¹Þƒm¶;ï8¶Õ[ Âadþx êïÔØÕiŽ½yHxW‹î-!5¹FKÉù‡ÓR?;ƃµK¦){Jçž²~Ô³ÄÒ³ÄÚ³ÄÚ·õjgµÚY­vV«}ä~\%ök±ö‘WXnæ¹Ûì^6²(׎¨­ãñžE­ãñ•+5O^¶†Í‡£áŸo~äÿ¯~],Îþ2 Ÿ>}²ÇöòôäìÜž,†³³Ùðõ-Nº[:|¤C …`]ÄÓØ@¿<á.«üåñ¤»=2ò§®…í[“WÂ^‡3˜+«…#VEWRžØ¢v)B•[«nK)¤>‚0¯‚H`-rˆâÊ]ºXWØþ~ã8à endstream endobj 1633 0 obj << /Length 2600 /Filter /FlateDecode >> stream xÚ¥YIwÛȾûWð”€ï™˜Þ°å&K²GÉÒåø0ž¶EÌ`,N”_Ÿªîj @eürU½TW}µµØêiÅVÞ°¿ïÞüô^Å«ÄOB®¾­¸ |«0ˆ|!ƒÕÃnõ«÷^§Cßæº]+æ½]o8cw·æœ{þzÊûÊÆ“8†_N$à^Ú¦¥†¥™¥åU¯‘ü[BÓÖO0¥Ì«'ýÛÃÇŸÞ'j"¤+ ²9îÏ®îQ„[\,½{áf{ȃ eäÙo;­6BÆ~œ$« ç~ÐUn›õ&¼¯"TkǸÅìóºªtQèõFÌ 3SM$üPDN¼±Äë¾¥%J~¦Æp.`‘÷«`ÌqÙ8¿áæ/l±ÚÄ‘DäüDÊeÕ‹(9h^DNó 'Í‹HziŸ~eLÖkxÿ²ÓÒ*-ž»¼³3êoDmÛôÙ’Òjgi]–ikÇ­þ¦[]eº[´N”øN#W`ܶ2ªL 2A¨ü Œç&øˆbÕC‹³ŒJŒ4ð{·Žˆd ¦ î\æ¯9óž,ÏÀÅisÁPÀ݉¥øÔRÆP€,@Qª¹™Ä)ãðùpá×­£xx°ŽŒ…³Ž Þ…Îtù¨[2ÎØ֥Ƒô4©˜O¯ Éá&<\¸o ž:ÎÉr]õvë®.´Fg÷ïkKî÷t`ºp`¢üäàpåÀJÓiÙ^ïôÅÍCög~FsûƒÏ?ºD°Æ‘w—¶½]]©Š>ß奮:‹%Cí°„B>çÁ2 ÍÊ9à€`‡g¿R-à6ö nûÙ€ÈôƒÁ†á†2N‡J0 qÂBDâIüA\L½¿ˆ)?úú{‡\yçuN½#ªñuC6lé½K»¾ û‚‚K)ÎÛÖÅwsUäwÏ]¯ËÎrP•H\Â’äÊWÿA0­Kù‘ çZGÁò ÅÒi‘÷9Æ%£Ì‡uÄ<í«móôÑÚ¸.'¤ö“ê„Eÿ! òòYÖ§véUõ­nË´'GHƤB;i'/Ý„'~¨Fÿ%•qiÒ·Š’J…¯©#!&G6ÀÛB­a†»‚=¾¬aœ? €9³}ìݤ]aÁ1›j™wÃӞȗ†y÷u×é–ˆàÊÍÝîweZÏ&|`\ÐÊ/O(ƒÒ¬î{Ë¢ô‚Q‡#À'Ny¹’GÞƒI4<önK[õ­´'²ÀK³ Q·öÛƒS‹ü±M[ç|f—¹k#©Õ˜fȽ¥TKÞk&ŠPn67ú PÀ‰éd`@ý%§>eAN,ªœXPYÐ(ÚYPŽ„.‰t° ”s ,(É‚ò¥åhÁÇ †¯Z'ÊZ'Á‘‘57Î92N:Ä`ÈnKFÂuèê8ybÈ`!þ/£DñÄ(P6jĨv _é v R5,ú&ú·,§ÚlRz?¬eàµ).ýä²–—u7´Ú.¶¸„ŽhsÒµ †UÞã ¨¯ þ5ûÎŽ­x1÷òÞQš¦ ¬`r"®*û{îo~&ÒÏCZ=á6é"`ŸmºKŸa‹-à~¦ïÒJ·¿kývÉ‘î>èÂxd‹µ—K/Ð3"½OyVé@ð?‚­¢i’:ÆÝZ2ê÷r×ù¶fZüIì‡cx¾†›ÁJìðÉ#Òµ5+ ²É l÷˜×Y¤ªñìN3忬 %´œ¸ ÔÔ•9ƒLŠû½e•žH2˜«Û?º}ÝÐôëó»ó¿'~Р0Êǵ`ÞÐévŸ×su“HŸ·g&vÇœqÁÓÐõ6=r-ç['fsœF•l¦õDî–R\@ŽãÓ[Øð…’i»gRŽyù¥%"î+9Ö×:ëÓŽÓêOuïÒz^YèÑ¥eù,:ª¯AÇøB€ùv‹ M¦—«ëóôÜ4T¿pš<­¶M J€m[×aõ lýx8Ž\U&ÄÈc÷(ÆJPÈWŠõ8óJðbÇÔ=˜÷Å€ Aµ "ò¼I\À½¦ ‹oû´·mQî0¸I«¼Á ;²  u›×»<3±‰ÆðkzB!”UÏ}ÝP)ÎYŒ]ÌÌ>7õNF‰w6‰<–‚&þ.tî´äð:™apÛ@—ÿÇlµ`oˆ~"ÆÞ”Ž¿ÛÓà‚~á*°5ê2Œ1ç8œÑêÙ=¹ÈLÂ@¯>s_‰ÌjæC¡€?ŽEuíu=ä{½À‚‰‡b`¬ÕÉê0|ð×p¢ q"NdDm›ŒoK×Éìj¯ô°fg¤bÚá °_¸Ê Þ…«ºÌM˜‚éùÛúßy鬈sÈëé=m)C5)™„^‰¨øôƒ ò:›Árì“ û&…Ο˜ñÚ¹.ß4£T-«–—)ähÌoøqU-ɦѪ?0'¥-æk¤õñDŽ9‰V…ÀB‘y–ZÆÿÌ>*€Ê~ô‹œÒNo·±E =¶ !Ä,”iJ ¹$à1þ±Î±‡ÌnˆiË îb{GM’ñ \BÜØí4}mm£Náêöâr»YlsÂÈç3¿‚Ø©ä«Àå±ð™yØ™ ÷“. SÅ,Hħ @ø`~¹{!f§¢Z áßPIô¼[å˜?p7sw4K±ß!Äaá” #\AKƧ×Åe&Œàà‚äíí³² %ß@úÊK[Ì—œ%èÅGÒ¿[OŸçg4€¬Ž*Wøù#¯ Ûlßæ¿ÓycĦ¢’c‰‡§”CÝ#ÆìÕ~Ý>Û•Æ3á÷:¯4¾ã˜â0…žf!OÜSï´ ˆ_%ÁÔ°þc½¯ìè î µnBâüÍõðÒ瑘k}K%o¤"-?¤A6÷ù¨>¨Nî}Tcl/Œƒ±ŸÃ뛼¶b‰‹´¡Yy·Y_z(œ~£K£Uœ\O=ÜpŸíoVUïÞM—Cm^™b?°¡T1ÿw 2zl=ì«¥ã@ÑSŠòšÉ?cpµ Þö MQ<=~ãW¯«Çåä9fŠ[4»ÀqubM^}³ÿ¸1%Ð -oR¯£ blžü“ú¢±Ìt| PX¼}®l`÷´Qè—Tuõ1§ƒæùÙörëþ˜«·º ÿ‚¸©­é"Ø_Ì£+Í›‹ç@…r òÁê*òcêi¡4›M¹|xó_÷Ùé¥ endstream endobj 1643 0 obj << /Length 1151 /Filter /FlateDecode >> stream xÚVKsÛ6¾ûWðHÍXžÙ›ìØ»q›‰Ôæç@Sˆ„"9 ”ÄýõÝ%@”ÈÓœ@î.÷ñíîÒd—Ðä÷ úÊyµ¾XÜÊ<)H‘ñ,Yo&¹J2¥ *Yo’éz–Ó´tŸËör6çš§ï œ™N©¢¬ÐNEoLïëù#¥Ü Ey:˜ÒUuP—í&<4¶q0ع²ŸôÍ®sÖ×ûÌ>­ï·…<ÊŽg‚Aîc^«»åCøì~ÆUÚ\[6Áe×âçɜ˜HÁ“9c¤P±žënß¼mw`«hÊB¤ ­^ac‘—ñ ™=rž±ŒBÕ¬ J§9ÓŸÐÑO 'ó,#2Ф"8ügÆKÛt]SšSé΀o­ót.3-BLJ³€mÀ‚wŠQÀbÊð©t_mÛ}9SŠd$—b2ŒQ¾bLã @á(á|ŒÌÓåLK0DKÛ”O [×íÏå!áY1ù¯½ï[,"ú9%Jä§èoê½)=i_ô®ûl*?,¦ gJ`™†ZùAôsÒ×@g9'‚e¿„»Tň»Ÿ÷"Š—½³MœoT/[> stream xÚí[Mo7½ëWð_ºùý±ØñÚ`0,/°‰ ƒ,Olm0g¿ïU7»[ãѨeÏh÷85SÍ.’¬bU‘C™³ÒÊ„\”qLÑÊÆLÆ(¯-«‚‹dœŠ‰ÂÅ«¬™ J÷ ø\RÆúp­¸TXƃ QC.ú„. Ѳq/“c†\ÇƳCWžµrŠ,Ãc±†0Q­Ät„ÖVSÄi. ‚²F–‘ †Ý:pDUÖ¢Ð2PKÎ(›”ám š\QNgd¢ÑÊY|ãs.°†±ÊùÌèÜEËÆ+—‚'”ËYjDÎ!˜¤¼4pYyË鎯÷Ö¢4ÜlÂ>¶g­òÙ²=ë”/íá1hÎZ´Ak¥F¤z¤FRÁN³Í*ð\Q!Eƒ> ]h,jrx[8,˜%êø¢NÔÌ#¥>’GÕ‡Fª<Ãl´Ô‘UÑiêãÌêÃ{pÔ»ƒÊ£Ç#4ƒ2ϱ9|D±©èÐr `Z˜7´”044ËÉò,ˆŽðQ¥x–¹ ’¦]E<&ëÉ¡­äpI¥@6•b¥•²¨£NEÔàiÃTg,0àCýÙd˜T–éu0Žl'ÂÙ‰!x”¹HÕø¨²ÂQç`¤å¬2m jDNy„Må\8Øcq4÷K*Á çT¡~ÀyUJW†Îµ§Fb@û:yŽ‰V  Z¤±›@EEjßtÕ¢áòÓùèøø¨}óÇõBµO¯®–ë£öäÓÛµ<ÿýòê×£öÙrõn±:Õ\ýgíßÚÛN ôÙQûzq±V§®äÆc€.‡SOûmTåJhŠ{ªŽU{¢Ú—Ë7KÕ>Wß]Ÿ¿_4X~OÔ÷ßáÿoGáMnh :ÏAaöˆÂåÆ–É\„ÐXçæ ({D€~a@‘Bƒ…8…Õ@áæ (‚oàdw Ðú1®Gb=Ì£ìá0=ˆ:÷ƒÈw‚ØÖ+X<Ô^­N†_¶¡4tfÞt‹—t åúÈ8Ú§ÇÇÒCûôb}¹¼jOÚ¾þ‘ô݇õúú/m{ùnq~Ó¬׋‹f¹zß^·ÿùHzw}Ý–¢›ëß>>Ù÷œ èûIÑß9iiÿš3Å5©ŒF óhRx4#®(Ð{Žq@arlûw¹{n$saBlÞÍž‹çꉓGÛ¯Uû¯Ÿ~FÌ´ B0Âuh\}úøñl‡°áÜHž)\j"rÆ™ÒX9©ÌEâS‚[‹ÄûŒU9Sq´±q.çuã‘Δ6XHðFó¤-”œ4Í“6ðeöt#¯o4ž©´jX~\®N®Ï/Èó¤Î«óõz±ºBö'ý¼~y²>_/”‘‚£öÅòj-&ø"ÓãÇNרد¸hêƒe8ªÈÌáhø í«Õòâd»GÇÏ_¨öÍâóZÝ^J¯`ÞG@zµ^\­o˜B T®˜›å§ÕÅâ¦Ë]¥ì‹w—çÏ–Ÿ•,2nR±X5¯ÎW¨e”zAY 7èXvÄ#›ž±•)=cªŒ©2¦ÊW_™P™X™T™\™Ú²­-ÛÚ²­-ÛÚ²­-ÛÚ²­-ÛÚ²­-Û®å³ýæ|HÿÔÓó!Qný>r†1 èSŒ(Ìþó€¢wÎ3P„Ì…±Ã¶f˜ ‹P»G—Š:÷£8@¸ LXô´C6@ E¯‘ÀØÀ¦×H¦ñ»˜CÌEEQçâ~î(¬mBSÊ€8v¦Q‡H)=RJ;gЮÁ®ÿ±AÝd7n}4È|v-sé‚—ˆwæ¾êÓa‰Ä4ìS‘4<€¼ŸºÏó ‡©à9é€Sœƒ"îE ûE \ŸsPìñüb8Qª'õDé^ö'JE=QºÅ!N”*Šz€q? ûÿp–c࿶ÖcŽãçýî¸~€Ãë±I4£Ó²\Áé±A€Ðc±¾,>ú¹DÆ‚…Q'XÀqgŠss côvDá}SJœ}¼&ûSgp.q[¸žK, 3WÚ•†?c͔֥3œ)b‚AÚ¹Òwžl•6¥Iaî(}.MŽsGyç ÉVaxièi¦ôÝ'$Û¤-Ì8ä¹Â°¶”ç±Æ7¹Ìm“a€ø$·ÏDÆ“[$÷ƒŒJµ×ï¹^½«NíóÅï—‹×/Ÿ©ÝÇ&~˱‰ÿ†cW.\=”ð•qõtÂÕÓ WO'\=÷ðz¯Ç»¶æ)~]®}ÿñ?û3OG,ÜbfŠ' •cNà&݃ÿY-n>ü¶8_7W‹u{½ZþÝÜ´oÏW¿_^-mŸ|5RàyJ€8åÇ„’d¿ŽPòhH¿é !Nâßü1£pÀ4j?îå"‘ ;ÊþU_0i<“}í~Ø×æºG1Ý]»øu?µ}=Šè^Žöµ þÜçÙ{| þ!‰PF┑øe$Û¤·Öf.îmYÃá¢ÞøKÀî¨wÊà‚¥Å[20+,¯Óî^« sÏò €“Ïú/h S“þ³)Ožò¤FdP8e¤º‹ŠÉB»dBO›åÙ§iëÀî¡—¼  &¢VÎÃ÷=G¿•ä=|vÈI%ºÄ˜„„7FñÚyg‡×dê»ÜóIœXê“çûú®À¹U>ò'àSÞ$r=q¿>%›…dòÖ²+¤Ú ±#èS(¸Ž6Úái„äÞ¥/ái^#¨yG‰E¢¢NeP/ ͽD–åÁÞ=/¶¹« ,“^Gã‚㵉ˆ÷ÈŸ‚\oƒi&î{i¶¢é]xýLqD>1Å,±€rNí¦ÙòB›¥tÇ¥:‡lèˆfï‘©Jl9 òSŸVÉ'¡ÍEDÕ»A’ @ïºVåߟô@êÜ ¥d:·(×ïv›™ËŽŒ´KnŽ[®V&Xʳòõê/Þ;¹-è&®Ü ‰-åÎÙrEÒ®x!!n'ndŒEå{"žî®¡ŠâXálµW¼-Ëû†)a½Þ‹,X¥YË’‘†t‘,µ3ͼðÈ‹¥Δ·q `Ѽ‘¸I !¤»œrur¶:/^3"®'‹–aëTOú¨Nk†çd‘0æÐ ŸýHr“©Ì4r ‘ŒQø,Å­uŠ‘[dSîêõrC½žgôªm³¼‚ yæÖG@!ºš à'ÊÑ á;˯y·è$ñÖc=ð©¯ÓM·ÜÃ{žl#MnL”Ë{ººÏOlÚêÒ²ßíÒ&OÝþ»“qµô-©Þùõ×ðš~¤l½Fü.׊‰NUFŽ\¢šÄ]­Ë{ãÅ5÷vtì¢ÍIûu&ÙC•çŸæ‹ÚÛ¨$KÖj±¡I®4Íy_o9ÕÚ¦²C~Õ[ËSÉ~ÚŒy‘y÷ï-¡ŽMòSï‡ïéØ íË'V4ŽsÞ·_Û F~“¤Oi+Èwðf¢‰Š=Θ¤ õ‹gªÂaX¡W[¯ö’õ`„Pe»Ò/¢x¯J§¨eoP•]Ë\ŸfIe;ù?ãòÿ žW­Wg@ é BÒà,g@#ï7³ÈÁéèÞ#lzvñ­Þ€m Doàô+¶Æž~õŠ/ïcÍ°#âó$FÉÎiÒŽ dÚhµÉæ¶;±sý÷´|¨ÓóC𙫺äÝäÝÔmàý6]ö!qC—Ñ«ÎIÎÕ%ÿ0cpì:ßëØÙÃתrÈ#˜ÃõDœüû£GÚßÒ¤¤½&§½~Oþ€½çÓ–qWŒÓ9ÙÐ$vZºËàò6Ç.Ñ£7šì ú4…ãžêpa²7]{²Ý&©ûžkÞ¤¿©k§Š6]»”M]û±a ® endstream endobj 1662 0 obj << /Length1 772 /Length2 1246 /Length3 0 /Length 1798 /Filter /FlateDecode >> stream xÚuR{8Tûv¢ìmŸv9nI—eG¹YËŒÑÌÙ.3¥áhÅÈŒ™e¬ÌÍ̄̚íT(aã‘ËÉ-[Gi%ÚmçˆH$œÔ!ÇHDe+"œ…ìçìösžõÏï}ßï÷ûÞïý–±!ÓGå‰àbŠƒ,A EÁÔ06Þ'…9("íç 0€¬ðo‚ ÀA1DÁLVæÅË8üå Њˆ VHà x`>"ÒÀ/?ï, i•çÉ%kÚ X*Ú&XSSkÉ‹J€b÷ä+G&˶~§r„ˆ@ùÿuoá¡€ æ!ráçª3Ê \ªˆ/€p•BdÌc"(7ädð*Xă¥D3Å2d9àgšg Á2`ýIr£óæõiBl@ €Î<ø¹XˆE·öGÆ…E(°w óàUÂê‹xŸÇ€…»þÃÉÑ…a¾²ÂÉQÄó°²&©”£ÔCÖ@ ˜u+°añ–"1Š]$r4K5–7A>p…[…ÖËPð+&¼D —­¿õÄä "ÔS)ù5Úe“+ZŨT {#<4èKTŠ(|AK„0ûÖN~¿šF+ÂpÖ6Î ${!@"#~SÇ•K¥Xz+ÿ–ÜD°¥Ã°æjt¶‹¹Ž:~3ê³¥TƒPÜp󆾪ؤ£÷ÏY£»;.…T¿Ho ¡±yÅ[šÒ™Ï c·‡˜Mζ(X5Y§zÓœrQÇûC´7¸¼Æ¿Ôðá<ñV~«Mzìæëd÷í›Ø¾j¾{R¼Û?FÛÜ#¼¸>ry¡Jö‡<‚÷› Ó ÐjNÕøº¸£†Fèã¬ÍßÿIê›!÷t>ܺ°.Êfׂ³öØ…VV ‰Rc`¯éq2›¼Ý}}“ÎášD~³úÄ’º“ó‰…=…•}}/ýršr¼ÙÎ#Ü~wŽÛRšNÉN¿]døË+¤8V’÷÷Tã>³ p¾~RÍ–!/¬sy÷\ÛÅZZï>|8’£ùC¦…ŽÙÖú/»bF •ö’†3ßÀ “MI©´c•xÚ»r ˳/N™á­ýw‡dMƒs!·¼|ÔôÜâÛxBßÙó¹$½zúƒ‘Ñ£²<_3GR§Ù×µ$¹ó1Ô<6•â·pˆDJü6¼kØK-÷»âfËFé±Ú³'ñ-Ô¢Sû¯ùœ%—Ù&©Ð—þûÍÉ„§Š[w¾\Hl±Î+7±PÝõóRŠÈ4´ÁÐkâݺçãl@W²Ÿ!¼¨é|£*í.µ·^óíÌ…ÚÎlÍE½Å{KZ)ÉÚ÷Χú°=»7;toÔ?¿Ô£2lu»¤¶âÌÉ®4JB4ûo‹×>I¢ ñöåÔ]ì?Ë'½;lèö™êûèÈ€²÷ó‚V%3 7ø¾¸¶Sb΋šÊéöΩGmÝcæt­j“Ê+‰9eÞWƒƒfÂu¿ªàèì„4{£–[¬5Ù7o¡þámäÉ­¥Îx=‘´ª¸´ùepâ »ƒµ%}mÞ7 þv•söCÃÄ †æXH}ZÏàŽ·™YÂ;®v*½]íëK…i‡²ž¶{{JS{ô^Åî°ÅüÊ.õQð£s²*š •nsP6¸ÿi”ßõ¬BQÔŸeÛÛã¦Y|Îs‹Ë?½hˆp² b~ôndL¶ÊÕ¯Ë캳ý¹ùþrÊ帴¡3Êdá>Û½aFò9(óá×2ëÙL;ÜPÑx°[Ì>I¨Öw÷CNshÑçtüær2ƒ üÿ ú4™¿¬ÞÈZï¸Þï€k-{1kx(Š¾ÑÁÎ[‹ýºàŠÿºÅÔ°¨²¹<ŸŠ4œ~Ë¥ì9Y3h¹ðõÆ—…Ón¶?·ÇE){”Ý:_¹®‚™ÕÖ/y´ôkW†×Ö9‘¯ÓØ©ä²ØÝ¿¤53/×åVé–'2Gö¹QɯÌ;‰²kÄc¡_¼¢ó‰P‡›ù£™êé{@¢Ñ·ôo ¿Á’EmÓš6)ò‰ú1ÞâyaeúÙÌñ Q;JXÛ¿n46¤•Îìi»u¤0@)T¿ÈÖÉÚüÇ¿$¤zj°£miÖÏ©‡B¿žÑš”ØìOoÑñvç³=<ž%ä€|ó‘o´zŠóKLÉ‹…‰¤hzbM»¿½À¹¡:åäÕÒpêàæ¤Ö­u;_ý zì@po.¸¥Z“vpÓ¸ªªðC—©ÿÓád%¾Š¶ì›´ûÑÖÓ ÏwN}cø¤ž¼?{º0Õæï¬À‡7ê ¾Ê³¹ã«Çr€¹¾r· âŠN_íVˆcÁ½EuïÓó†] ¶MèU92þ `#l endstream endobj 1665 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ïî> 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 1669 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!¬†+·º™> 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Ç¥Õ©> stream xÚ}”uXTkׇQ¤C %•M73C -] %J)3À3Ä€´R !‚H#‚tH7Hˆ„HIHHˆ(Rßèy‡÷¼×õ]ûŸ}¯µö³~+žÍËi`,ª‚ÀØ 51h¬(D ,`½m°X@B LÉ˫掄cQ´:‹” â ˆ$H p,ä/z„0S=O¸ý¯°¸$ ...%E)([,`ƒ´G¡)A¿Î×AÛaô/;ÂÓõoŸÒ݃ $)´³€@Ú¾ótvÖ‡» ߺþÇ wA9ûü?7‘({,  ‡D <]þíÕÁÂQ¶*h{g$þË„òÐDy#(¬­€u÷Dþe¾F ÝQh¤Æõ«%€( þ—ÏÄeë„FzxRÿqéc°([‚6Óÿ”H¨PÐ2Ðý·¤ ¡wŸ÷°E¢±€Ìߌ@þeÿ‰Fü» „îþnÈ\Í\[_Wø¯!þöi m1Ú—‚pww¸%€H ðƒ(‚voéM($†Æ` Ÿ®žØÀãNùkFÒP¤ûËô›dÀÈàÉJ ø?$€lþ!Üá¶NH¬3Òû]âÝý÷hþ8díúÕ\âŽCþAè/ró„;Ÿ @v§ÆþJ ‡?()E W$úTÁ†:…„ÒœN!¡¶ÓÉZ]þAAë©£ u˜SHPæz ÊÜN!A™û)$Èð8…„îcO!A•ç)$¨ò:…UwÿA yŸB‚*ŸSHPåûÿ{• à(4ÖÄÇõÏ…øµ[¿òcÝ1NÈ›(Öátˆœ0Oo °˜0*ð¯çï7«ÿÝUUUŒ·Ÿ¨¸ áÉHRP0 - ø¯8[OwwÂÒÿþWþo¶C®*é´¥œÅØʇ:V„6î•©°ÝýÔO:;׌{dÖ!…åËôsÐ%{ª5ì¦j(fîK2Ï04êÏ&ôuï­·e[jÐL¢v–H£sAuC4«g«ÍyaµNÂ-Ð}‹3¼|ÞÚâœüÍÑÃ0év‰å’¥œ£fesÙ5ÀÈݹÀ™È†VIo^;ûÐŒ“gÛkfy!†ÞÝ≧‰Î£³¡ÒÜG:ŒŸ,@åz­Â1¢­, 3Dé÷¯®l÷̵=Úéa¤?LZïîZ¢Ë£ØmÝ)úUS72Ý´taJeÃÖ ‡µ ÕùB€³Æê• ¥F_ ±üí_K‰ŽÕàž·¬_ËÀW¹¶ö_&öO»OÍS—îYÀ‚ÜÚ_ìÕ§%S®#ó¹My¶5»¯O,Qì­cS©®ÿ„,•ãžF˜Ö`œbz$ÈñIv¯Áúe Ñ:^¸è´¶¬…#ÄÁ–j=XTÂvzóÄq“Ú±;P”k°ÞP2{!FôZYÿ}ÜðD.hËà5I÷?>Ÿv^*½O‰âŽÐùC×”aFYm„Œ–ítt¼|©»¡§t ‘œS1Á2—¦Ä]µñÊúc^c$¿òÒÀáì«qñ=õÜD™ÍE»Î'Ñø¸àû¤hŒðœD†Àqá5šVÅŠ’ù¨aÇ©gøz+›{¹Is0ºÌQÉ*Ä'†’“òÎ;Öž5µî½Zà_c¤yõ‹+e µ.áö(oë\ø›tMI«Ë¥Ux^Üœ>†–§»ƒ×›pI”DK;AÝÚqćËARÁj&‚ÉÞ„'›ŠTÈÎUä‚}ÜGæ¼kÇq‰\ž±^ŒQàõNChâB1vÎBÚYλ¯ÐÙLnÒË7½Žk\´8œv‘^_üìѵÎ9æ¡‘ÓcÓê º¹D0–—O–c3*™#Ãò ì˜ìÈ È0îF3ƒ·×ïλ=[3J±MÐê3ÄJ¦a%=<‡ÇAŽµˆ€á¿Û÷ ÅÙ8Ï–Ÿ‰L\^÷ŸÜçmcs“Ô æ>™S¬°øΓµmAÛö®E¬é\Œ8¹ÏPÄ´†MTˆcÝ"í¬‡.gËaW)‚‰³@ÖºÒî@#†Nå;·iøÝ ÕX~¡XüÎ%!ž¢´þ0b³ÝWòTòKé[··vø±¡­ñ¨¯çfP+Xê[iÖטώ=á‹zMM¾èa¥ž’‰n0«fø¾J‚£ ÍuX¹Bª8^39 ñ‰æbÔ¼M+f‘A­¬­”>æf¥eŠëÕEî›ÌúKôG‚)·ojúf‚sŸ<*Œ ‰Ì{ÎXc¶:ßwc¹lpƒOH”:%%þüç#%£LwÅ{Ô5d…o¨‘RúzI±As ý÷^ ö“îAé÷s]nôñ¯4§ã‹Ò¸ƒ3Ð%²ç™GÇi˜GMÓR`Ó±/òüˉâ?%¿Ì• ¡e—]Z ¿ÁÚOEôö‚ÑINlXv‚¤‘Z«A‰A9èY ­F{ؘµ!q©aÅÉY ¾!N†”W6ÝD¾ÊAŠÉ?äðÏ—¦ ±W[Ž}º—ì¯QÀ59[?ÃâM²E/wT§æy›àº¶âËŠ·ÃuaO8nÜa|žY¼ŸÝžÌª5©U‹“­ §]#/æ7Φþøú6¾fšííÙ÷&:~þèLX¨°OÉøªfE䳋=¢A9 Âm4ÇWä–Šê ‰ÕYbu‡Æ/†ˆŠÂ&¹fH¯ÉThÝà×Wµ…» ííשp‘HŠ¡ë¦ë-‹fa½#ï¦Ú¢Ö]ëï¿ðl¬½? jŒö9Sôðf–‚“” ‡^Ó(†F‰n1]€ß]PÔÅ™žªÒ*‰ ?$’¹TÇØçÍÎÑð€ÛèÓJô¼ÑÒ,;À?îoOt¥Q*dð,¯~òJØÁ·o0a¿ëÀ£`CñÂÓµ…ÝÌr‘¹SW¹$<½_Góm¿Ãÿ®ŸÛù™áuïŽÔÇ–o$×n<~e^å×\Y;ýáaæÔg÷aþì†qØŒM¶vKÏä·“¾Ä½40ôá+ì“=ÁóáªvKÂÞ‹Bc7´6“ /‡lí¦>14z\&6r_Ž¼Œ7+XÇ÷U”]ob}jÕ–#{ŽY•*W‘hÛûŠüŽóA"âî{Å?꓾úŒ>k£— i±Šûz·~«ò"^]FJ·«ˉ{Š7¯¡ë¥e AjñÖXÎúxNk­jñÝLa- UÛEÖ_ΗO$·•äsñúÀÔðRøÓ§]hµg"Xü&É'-co¼šŸ3;P‡kÔ1¯{14ƒ5&;œ¾cúVðL• ©ùÙ‡|:|_-Œ»Ý]YíYúÂu“ø˜%!v/›” ÞçÓãX«QT7‹cÛëÕ¯ÞýSy8¹kn¹2EWS§S5ƒ[ñ‰²—3VØ1;;Œ7q ƃÝËÏ‹ôC ¾5N8t®íî 1©%ËÒVkd© ”„•Ñy݆0ˆGÛ4)Ü6½@•–²Ñéѫ墳ÕR³ Æòh‘ëÍ4öóô¸ó¾qôì Û\bƳò)2úÚë, ;òöLæÌDxƒH9¤—§‰hS:ÔÔú’-8¢âœ¾µ–y]Stò1•ªò·«nVÁŠœÇR ØØ~áÔÎzöñ£˜äQÙŒe2ƒCù’'eÑgÞZÈNvßßr©õV"%î”SÈÒiwx×~ËÍec&άV{ÒÏ­b(’IÅÐlG|—ËêS5 :8t4ÑŠžtè.•ºÞɨ[ÒõtE Ø×ï1çÈEΪžŒžw3æklÝx3²jÄtñnR§èL“Óìû,¦[äP'>´›ý‘ºåpŸB”™Ø×!Mòj}س¥ì¢]"¥¤lSù,5ý[¹~¶G›Ä'ω#°ài™gêuoÓõ@ÖMª:j ²?¦Ç_ÜPY•5¯cD-ÒÛ«áh[q^úêõN¶×º˜(x¤ ‡Î[e$-Ø[ ¯ HãÕ¶oR„Ÿ ¤Kˆ²¿ÀZ£‘+ {·úè¡Ùy)ß=[Ð瓵ÜrÈcÔ·’ˆ/$¼ÅþQL#²Æ<°‚ï™1$ó£wÕÀñ[ž¾üõ"žû@üåÎIáPKûõak¿0}[n.Ý’;o\D“ÏåW ·¢ðÓžÉ!r#.ÀÏáp•rí5w¿—^‰óû0ˆ#ò:© ^?k#Äa©÷9øcƉÙüþÖtÆ—4m’ä01n+H†aÂþ…”߶ÂÄ£á…B‰…áh¨f½å¹ȧEÜOU_¿£K¤*[ ðeÖdÃÕ¿Z›¤•.éåÞ~Ý¢²—’9=S ÛᨠWþ©ÿI^#þ ΂Æv•y??µ€û k‰8Rà¡×­ž1騋{¢|¦¢"7¢’ú>h7•xxê\ðL~–]2v±f#ëMo÷Hµ…É„È]õ¤Ù°ñrGªÀ6L÷ÜV–xI«–³èùÔ[D¹ê+xÓϹbՕ¦޽„íÑÏfGŽ1»ÓUç{•¯=»¨ Sã¢ljÏ?ùô#Û…’æ ‡Uõ0NÍüãmFLÖÂxrP¿_éRå“û^åjÇŒcMÂ3uš3Ù.}«m+©]b—RÖ–½QYa.êŽC㙯[ÔÊE‘c»†•_Ÿ'N§âϸÝáØzîoùÈ*[sˆM]IZ­*À+Au•þmˆ-nXª¤£©+õƒuï¹+’J‚;{G·v¥†¬GS©#vuø> †ç™Ì± utÆ2UÀÜ®®Hðj×—È@­—`s" ßÇÖï*i¾yOݳXÓ'ÎÉ%žÍÀñ‘}dN-Ç刞ÖQËõÓñø¯ÏUg·ŒJ?Vï¯ê>~‘BV­òàÏÚo€éÍq‹û"ÊLV$iÇtƒºú Y°Ùºs-àÏøÃŽ|»mTùMJˆTàMzÊ·ŠT[A}ŠÍiG||)^dC_ƒ›‹©v"­Ï“‡2Ž'¯[Ùû…bžǶmP¨D­Uâï²)“E1™ßf Ö˜¸7;WD* òãq¹ŠÔ€çE¥©ÇÙšŠQÝ©ÛÁú-‹ÄŸôƒåÔÏ(œ„‹Ì·¹Õù²ë@_DblGГÔy„]ž¢ýŽW¯ùÔè*W„=£"ù»â»E“ÖÂ0m“Ê­Wõhç÷ KúIÆKû#Ñ2PèÛ¾~¿ù´[/Š'?=•h4|~ù„öghÿù½>§^¿Š‡½`'빿ð¡®+±ÉÝ´&+—û•Fkø¯ z˜<ª¹ïÎÕÕhšz":IÞƦŒôWmÛ¤€³{ä\}õIO%TEîÄž®‰m`ÁÓØe,6ÄCŸ§øþÞ¾„æ§Êyâj²[þb|^š‡þl…a:%‹B×9‹ß1žÛXî ±$˟ƒNÌ"UËx¯^©Í(%o¸b´wÁ±ùÁm%KÎ *Õõï7 MñE½ö,¸=­ïó–o¦m,g=ÕHÏ•W öæ·îÏh¤ngt(Ä9¶]ÊãAy”g}œ/’§xÉûqXÍ6hR´&yQKÚlïd^w›Z/Ä’¿w~ÿ’Ú²l'påN÷D?Xïç2Çù† ÛYÍcÜD¡®‡äÙ,pA— Õå¦rk·z¡uQÉ‹BÊf‡ò=;Á;JQTÐ& +³nzÇ’”Z2Ï>lŒcL%…ˆ6.ÙùAÊ2ÒÄÒV³tûŒÇgmï „`ßÒoÜ’3.4Î\÷ˆ\øÅ—Ræ=sùi’!¸J%OÚyínnŸé¥š¡‡¤÷W£Bá‘J×RO&-½Ž¢üB¯PX–ãSUÒ¬§œ±*Ó%n7g¾¦fF|ꩨk „ §óFÙ·x‘/êZÉ“¬ÂÄõa—4žÊ–~Ôµx:¾nÇä!ÅP0‹ â–÷=ÌÓÛôcEprâå`%¹‚uƒD,¬‡´C¦¢YÍœÈ|Ö!'¤¢å:Ý-F!#…¨IKÖˆ1×ü«Mno¾ Ý“‰þ.ç–×›xqçb’\‹ê&Þ~Qgøµ‘ 黟è»ld× c‡O¢rh0±Ã¢ýý»\f]y¬“`ëm‡µ.ðù±ÍrxLýû™ÍJ±,´û­ÒIÍâš‹O~6ó¿´¦¹e^Àº§¥~ÿde™5|0Ír¯ãËCæ{%ÚÊ+í3æJ »&:\ÂÔÿ¥Ì6 endstream endobj 1675 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 1677 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 1679 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 1681 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 1683 0 obj << /Length1 2110 /Length2 9189 /Length3 0 /Length 10340 /Filter /FlateDecode >> stream xÚuxuXÚö6„„¤ 0tà ÒÝŒ€tÃCÇÐH#"­4ˆ¤€’ÒÝÝH7"-ùçÜ{ðÜßó=óϼk­½ÞU{mzj°»„…£DÖÑÆâ `ž0€›ˆIO/å1…A¤Ma!ˆ‹ÄÃɦ08‚«ÀÍ´TÜ\M­~[¹x\ AA &`5‡Ì VPLÎßî, ¾¿ånNÿÕ¹C\\á$&8)3Niáè`ç°€XÂϹÙÙ©šÚCL¿Ãú?ZS{¨×ÿ_¯ ZYÃL* ¨›ýÿj`¦vPs +;ø·ê* õ„X€¡0skÌÅ ò·ø¥ƒÄÅê;ºBÀÿG§i 5·u€¸ºxÿ£Ru„AÍá¡iý'Ax~l9°òÿ±‡Wî¿þL]Í!0€À±äo׋ÿ­¼¶Հ󥄦š’ë_üK%ã`îhu°pñòL]\L½0ñ|@(^§ÄoÑ߈À)ù€øœRHÀ)ý€œ2ÿ ~ €Söœrˆ À)ÿ€¸œ ήô€àìÊήò€àìªήö€³ƒœOýÁù4€SóÁÙ_> 8Ÿö‚óé< 8Ÿî?Hniúâ†[šÚ;ÁÀÞ·ÿJyàQ˜ºÂ .PWÛ‡ƒpS³7135·uµ3uµþG â‚Glæbj±ƒXÂþóþGìò×Àÿãô·Øû—½ ÷?òÿ9OÅüÄ ÈÜÑ>¹ÿÎó[boÿàï{Àiñ„SB<À›ùßo½³›©ÝGà©Z>Çf uÿÃÇoµ£›Ëà&Váz«ß‹ ò§ <Ї²ñÀËcíåd qøÃ.ƒþá‘Úüá]´ýÂ+ñ1ូ!.Gðï}6…:À4½œþy•~/ø¿0èo¬sq´…hC-`Öš¨˜Âo³§>¿„Àߟÿ~3ü¿†¤¤£§;/ü!ƒ/A^øBâçá{õ/3s7øÁþz­áα%þ\B žs̹iGóç!6U!—äì›ChË«Íñº]á¼0†™lkeôt¹qgI‹2ÒðlÑë±i_r–ÃËaOƒ¶÷KÉòY0™®uÉ#öœ¾_'mVJ G2«þ”ˆuüo^Pàšè£è3¾Õž¾ åoçÞ.ßÊ¿mvÝÖÜØ>œãQ'“Ãb$2›÷‘¢t©éVaýºx±O\ôSÝ4^ŽÜ"…ðÓÞ*î%Ž¼æê7 mtdoõ{J°„`'ºsr×·Ú–h¢„v¶A ÙêqaàPýÌÜcHòýQ¶³œ²’XŸI'gTð«š"–ÆF€Ì.%Þ'õÃcûá'„;)S7“^Ó]š“_Ÿ“‡]¾­aºÔW tnÿxÙð! óRDk£Ew*Û£6·…z^zàè÷K-è ´U‘®UëhÛÇý(!Ų¨ÊTQõ5FÁ="&£-§ó©—ð+u‹ëÉ ;·ùâñ½Í1¶M;Íhà é„àe¼XvÅŠ¡€ˆs@ªPàŒÀ}Í1Ó÷7Ãÿ o怆1 îÓ»qBAyN xº²ô¼³óógå#±k™´üªÑð§#o2Äh«†MCÈÎ6LkÕŸï|[ã)¡©#½³Â^«0#²ìJIx€†áàȺÊÅtW¢~Ü*RU¾½§³ù–—Ð`hæÿ!e5ÞQ™4:MbÅ–kn,-¥צIˤ_´Ø÷m­º¬èwW2L?leü§Óô­«aƒgøM)»Û‘ÂÏ"¿*¢Mó(xtl"ê]OÞX¨` ÔêZo%yžµ½ þ&Y×ÆÞ¹ÊfÐWNþÜ7ƒ/}×îÑ®˜†ÐbÇ #àÐ]¸åG©ˆÇ€va½†*®-ÙÚ¾‹+Þëòj¼Hîg¾Šúl>Âl¼Õ?ä5éçyL.'B³ñ8ÿðü±àM®ÿ,=â…oVz?Áp¸+…Ë o3cŸ¨©Ä6¶ó°(u©´’A¡0RêtA‚•VáŠòáÍ}Õ(:È0ç}håÂãC§¡»«“v€¿Ú¯XsêJ*,Bì- 7)cv½/1]_¢)O¿¶ÑuèõÛpìû%vHm9•Õ㕵¨®Yÿìû¥´oŒÍ]©7MêjD3uÅ · ŸNU2ãâ-ÃÇG“HŒnÀ¸­B‚fÏ*Ÿr\9¯7oص7dMR—žÇºƒ‹l®)ú„ŽƒÅ²a—'›MŒKL/ÚÇ4¤¸s^m†Kh¿õ¥M-Õp]–¶fôGên^ÐüÙ‹ÞŠ£ÿóڨʆÝMÌ+ç±8^Wl”Fjä¡”¨MMU»ÚÇ*oÛRTò‘…x]#¿¾:L¸rcÖÇV Ø~ŸGŸéâ1rzJ¹ªóž½©Ú·ããÄ3Å^}ò DÆ5‰Bû ›«4çœî×Çâè餡ØÆÞŠ! ¼…3£KÇ+¬F¨úÒ†{¼—ý¯q"w. L‡ Š¨ï>; º­|³é·È‚$'F£ÒÛ29®á^1…æª &–áŽE^e!|fwµþžä6èȇññ¿ÝYlA€¯æMž$uoaK¡ò‹é~jÈ.®Ì7X àût¸@ ÑÃÂœغýz¨ÛyÊñÃÕà‰Àµµ:fñtŠbI´ôÁÛyI€ó\°]spÕòX4™¨P¹¿»4%€x ¬´µÒ±¤ÒJ™ÄÝuŽ@Œ¥;{ÀA›\–F,Gý•ïþôYnÊ8sV¨¦bƒn}Å‹Jˆ:bx’Ϊ²ô¶xoðân»è”´é®F (æ™/áѢ㨥d1 }‹Í©–Ö¤Âd¸¤à8“SÓwµŸ°ýâÈPg~v±Jñü+T7åu…J/ ¸À<Žƒ©­C¥ÚšÛaA¡½5ÊHnÍßvbwI>µ¿ì+¡hSæˆ!ª€²(HrУerÏÙÞt“Ëø!7®±zY¦º5G¤´B?s›äÜ—B«‡kD1}ÙGª&æîNýúëöå×ô íFw‰撛ä#£ÜÊ :wñ®Tä‚ù ò48.úu15Ï€FoŒ-7wL´³h{Ù?‹ ¿œù©ÃfQÊ£lɨŒN1v3t´óF0¶BÈ%ä…á\VüܳÅFùATgÇ—xfׄÈÊß½6Gô‚‘Õ%ÇMG­jõ žV7#§ŒV¤g# tI?q÷‰øq–ÞÕ,Ú²¡ôdÐáZ²V‰xìÕý€)@K]Ÿ#8Kɺ&Õç®3v·=^ ]+¤ØŽòS[|ƒpnx¬‰Ü2ÓýšgÄ\|ÍöµT§õeƒ `DVcU»^ Ÿ©—‡%Œ7F(ex±MoWòyª¥>ò ×S/6ÚÉ:‘¦_>ªfØ­Ó,³6ÏFaÌJº÷Ñé™jZµmçG4–é8¶ }—.n RÞ0t÷¶_«g"çNŸûc&µ¤¦ØF/e X÷œÃHÅšñ1$‹òã7)8ªaæƒSOJ w}Bü?(D½lXâM|LUä÷’ì똅 ûù ÙÏõ>þœbÚ&ªµ£¹sj ã#©V Šžæ5ha‰S|K¥ç{ô£~çFŒÕIŠu2Z1[Í<7_¾\Ç!XÆæðLUºçj™EäªHì!¥-#Û^T[órÉÖ»MÓCR~]¼¶|O\Mžƒ—S]fÉÄ8Ô5»¿Ñ^Dè=Ï mbÞË ¯èùع~]lðfEùMÝ%XËç¢T¢§.×ŬyGa4ãqKϤ&òVµ¾ý°Œ›SÈHVÖ0Eçit C¬G0³ƒÙc¥OUæ*€LX}ºÍ¬Àݹ¾sqôfe,T'´òD+ÞìÅú°a_Ò.ãé =!]³ŸŽ¾š;a:†ßúx<Xã¼íßóÀwø5uajÝùZ:³‘kZP ­¨šŸ&!£÷:óùgv/t5$¦É<}ÕûYÓçàªå¥iÝtD½Îƒ†GŸ¼Ÿ§l} b4Ì‘h}ªÛ^Qµœý¨FoHóKkˆ“w@(kWÏUˆ¢)mâŠçE­[àN$ê(øʸ6T¦1€/[|*\;pÆf*¬..«ÂÔ’'Zå‚m›šŽÃï››!kT€*§f‡¹AgmSº_/i³¹è´tøÄl'ªj'«cpUbL†*ñIÔ€™×µW°®øN“p—‚'¤€ b ü‰-OÀ(Œâ3RF›—HT)…ã)¿j‚=qKJ„¤æO#šÍn|‘-*ª³2“ ì¦ë½mã(ß6GAA«°óZªÐ{–pî€ÇTB¥ü¼÷£#Jwdð”ìÙÇ Gr¿y íܽÿħ̰·ÌØ„2Ü/: †.oѕ˨ Í,Ô¥jGoñëÈG™Á…u™r “ÕiºÈH?Kdµß9ã÷ï*:ŒIH¸çð¯ÈêunK±ør”²±ÕO¬6É‘_dqmg‘D ¼š%¼Áúîl£ïwQÐÝlS÷ò¹œUŽª’øü}=é“Ϥ»¹£h2K“@V¤ŒxmÉ壒 ÑÖmñ®§—ý Bn‡bskË7¡KM^TÁ)Ó9´4 !a×WƤ²£3ÇÔ4ÈÐ*@¥Év#.ëü®ÁSU®¾UÎ÷†‹LdmI¤‰P”&'±ù„ëƒËG%3eY[6 YAŸëePʾxž=:Ùb}×p{$θ³fb{ #nˆVdûbã"üEáþ6=úìšã cÏÄÖêµr-òtÐÞœ!ã]²4¦‡w·—Lý ÕÅ'î¡«bKb?.{BѾtÊÈÏWr@ú•ÍtíÒ}bny0¾²>Ã+¯›/|Ò²ùFÑ== uX2J-s1ʬwCl\§VhIݳI¤ã¸àÛ7 yBhŠmôXÉÇ^ÇŠÆGþòë~ÞC×…¯ŽD ·•©í_œ®`o"~ ¹J¨kôíÄb.™¥dz§ãÓÚ6ºéâgÜæWQóEC¯¹Lœud%\KôùEò†8‹2Éæ–"_W:vjO]š{Ö{‡X§ú~AQ£G‰ªJBåèàIvˆ½Sú‡A²r„HSb„VfõB@¥0¸ [5ñ¦·³7dG[š£—¬fh9Úw Vu¹[IâïdøÚ%·ÌªÀ#›rtxž}jm„)›–Èð6¿ê}÷>UO.'&¤µÀ=á Ó¶Ä|ô‡fÕ»L¶Hp¤%­jʃü9[¡ƒ|Úšúê#AÔîOšª²Ú§8»F¼ ‰èpÍã£ÜæÌ3Eè¶:ÉW‹´ÔËËóŸœjW’ÊPlô}å9Ã; ìçDzìqíy©»ä„Fý<2Ï @¼¨êE-Ð0_n–”n&“7³û†:œVŠFdgÒSÖSâä2 "ûõk“²(]ÛTq–(=¶¦á#¿Ÿ6`,‘û1 õ# ¶°Ø3ØMÃÒî'VÔ¬Yбñö,íœg.07eq± öšrÑíËïRºú]×»]c7‘#xÖjŸ–pxœsYóq¸ïÒùèõ¬­£N†|wùNÈЄØД±Qœ¹`|~9ñ¹Ì8Cç1³fñ$…óˆ©ÿžË§á~·ãø4Œ2Fâ móÖµwTl×­8\leF$y[!‰Oõ\jÌ|ƒŸ,¬_Âò“uä’Ñ“—¿Ò÷}! ø~°˜¸Î|#r»O òûµÌìɉY—’¬}Fš¶W j'Ü>^cM‘FI¾hjSlÙr2ÒÇîY·ôSÐ:K´éV æW‚32ñ.gþ°"d¶Ó-ë®nÓ¼@#G¶Å‚,€'ÁÐÜÓó†áù8IÄ›Áƒw¾1†ŒlÎó^zùóq]ï«aAo»^U&¢Çß&æb¯«Ž”BúÙ¦ô쩦§t˜P2P›_ 7RÊHÚ_T ÛÍuã/§o¶L^à·¯UÝ­¬{»Î´Àš¤¨Ý@̲-OWõ&ÈÕ´t…áSl™j5Kýœu+AæTt_Þš˜“æ(98/u<ÚÃÇ#S`²øÛóHÁúoÎV]Gþ¡9he²*K*N¾Ëß,0 ¥©S=dzÇ3<Ò–]=­¬MMØ4JÊ^Úœý¼'JÜ„,®ds•ï=¿0ÂLßänËní› ˆâü0þ„Î×-Ý,¶ÑãÄ~K„A3ç×¥ÒQú3ÇÞSþK®ñÏ;ÌË=oõÞYÉÜ_Ýî›fâ’ V#`)C¤­råZO_«¼¸Ù\KÔãk*Pó¢º×½¡ö<[¼˜½ÕÐ"@ÕQ/Š° £gMTØ\]+>~¦ïdÀ§sÏ2õ–ü ŸÃ£¡º¹³i.Ð ®óJ%zLꌉ±žîVPV&Ì1-¥¨ É†Té9K™/0 ž3|v•"l±f6¨ë)n˜> êÌÚCmæL@Ì¿«Ê`Äœ6ýÖ3BÅ’º¥–J )h¿|nN˜ûîWШæ&±g >Ö:U¶…Ttý (ÙÖ~Þåf‹–Ÿ¥Â•â¸Þòì©%‰[#„U nE¢Ñßè.èyº¨_DÕ!òøÌw5«/´jÛ‚˜Â5ãÚ’#1]›òRâåŠk ‚‰EËåë»^™®Ü©4ÂêŒÂ:Bx¦@Ïšû›Öæ³m)7QŠ4öy¯eí…BĘÿB| ~Òþœ+Ëé‘þÔv*ûãWÊ<é'þúìžÕ@"ä2„(‰0ó–Çó÷þ/º%ZÙzÍæÉÇ$Vã1;Œ…T×eߔݠt÷ï ¿âÑhÔ´JË©Ñ{2ê;:Zz2 ˆâ-ËÚØå®3ÅÜ©Cøvè.¥Ùû”fäijVß˵"µËü®£‘2€?"ÚN¾¥¢J,¾PQÞw·¾p¯ëð‹hnä$ßÄ"E›ç@T×4‹;}prêµñå„êÊ°ÍR&ð´r[5ÕÐ)” ŽüDÏïOLM[Ï’Û|¾ØçÃhÒàΕ:Ô‚¯?Îo-9Šª1öÅ›¨>gô¦¡KÓûì÷ñ»ù'{oäHºX¤ê0Ÿø™‰ý|{¦uØš_HÿÑ&#®ÏjÃ*— k)ƒ*¤Qˆ*“žJ;gÕ#<5¼ù8’ð©­õi%j4g„»‡u‹r”2¶óûš³¤²+Á‘#tl_@OÑoø¦°eÄ“TÁäÞµ=C‘ÐÑ`ƒ¾ .Ü#¾ÙC\ø¸pšÑ4b¿yñ8b_û"rósnV=ŠªžÚýò‰¡‰¤…JEn>!ÓŠyÚ$Ôð#{¶¦Q[á–>S°È¼"ïJ®ÏÛš°x«°5õ:©öä Ç4•m3–¦Ƕݡ&¶6,,¦Õ/=ßr³”ÃP‚kBo»×dQÑ’UÔ„¥¯ˆí‚À [ýˆx=ä˜j¢À¦·š~_Å<Ÿ9BZô€Œ7šBD[LÈ}t+`è×â0X„ÝsZïµîA—К®Ó!oxíÇÚÕŠ[ÛD Ž._|÷¹ÄgìsÀµ«!’9«÷Ý“#™ü!ÝïÃ0;ñv™ÖË@FØ ëWÞÔd¯q±ïæ©é‡ßÅŸ”vš…ºL¹y·¼ën—õúAQfuà/Ã¥¹|Ï*9ä$='Ü´³íq'eÆs§ªò™?÷'SFV_›Û{êQû { øaf/^åu,Ç©ÎV7œQL—È/„Ëd%‘ã8ïñŠjÀ*E%b‰5l3†—™É™n[·ÃÓ—/±Ükhê=­X”Yê>ÉÊ\¼œ#{-þ]Ë–o¤},ÐÉ°ö~g/6˜^{­&"Ü€óD H630ö]ÎâÀ¶í4& È÷dEËwÞãŧ —ý+Zë–0óŽ¹m Ž «D­®E`m•Ó£2†Œ–v¯¤¹­7êÞ·Q*!$`o/× Ë’žÐg™/4v‘¥?Þåm]½ßxll‹õt€ÉÖ­Ò³ â=9˜t¾YÀí j§NL" Ì[ÂÁW£©ÒKV"#Å¿ã`þw©Àâhµ1TBIµÏèT˜ ©>»ÊhÌGª]~afÔ¹öq à&±”áÜ*ó; ^Ð{­MƒO5Êa¹€’ù‰ëSD ÖÖ'ãTno–™=sèÞŠ…¼áU”ždŒ ÄH9Ǽ=úkè’@9—cÓ qî4dÅšR|‘«{qÀø“ ÀKKµ "­5qþŠMÀÉvhe&ÀDEðÝÞ¼ŒÁ™§ÊŠøóÚâm:1~zÔ  `½^ôÛnõ^ö-s:Û/AC„5sJÜÔðY¦‰¡“:üh/«+¼<A¯ÔÒêÐõx“ÑWXüîRÚ ÈBõt¿ú+O'cnñ^^¶Kkœjy‘‚j9¤>ôN§)8¿+lu».)ägvï|z‹ÁóK`£¼-<6ƒ9'¥CüÈ™©aF¿D!¥ú€ šà§@¯Á’¿³|ÛŸþõt¢X<ƒ«2Üáz¦RS#I?´dXé®D;Þ§ùKe¾u¹Z@õ²Mq{_¶S÷œ«2F;’ù¸$1!ß,Sµ³Ù/@èqËÀ˜ &‰RÊW¤gßY+æG¸XG•øü ªštÕDkø‘<ñur%õþÀ×Õ!Ñ8¤ÇAÉ버Ɨd0^a·ä T÷¨áñ•!ì[{ßì€õÊ`î4ÛàS<œPVÎ~Ò+ÁÏú$Ä!·‘E¢t蟘²Zz¢=çíK}7RËŒ§šôœwCW9yåƒýDD´ŠêûPD–’Â`–Qs^Õ§¦šhLtùÁ‚ÛØ ]¡X“ôý6©=®ÀkÛÁ1¢õ:°ž€eÝ\†Ò9"ÓªXIš]Ï9ÛS>‚•s*ÆνBío/:ÄŠÞTúÞ*ä~PýNˆ½-9È!ƒUe5AšÏÑš§q}Ó*”•=§4;&¨‡rqŒ)Ù–5‹DL?¶Ó³¯ÒY\¸¼œÿF…¦·0l(¢¹à94b­{‹w;9™ëKÙ¿X˜ÌPE¾w5@ƧqË=“KX¹“¹ðêÝÎÎ5½9Þ Ýo} SµpÛ鬄ƒ¦0æ_ž=fÞ"ô¦8õ¾ŸŒ²ï¯ñUØÈZH4[5«£û©’ˆÄ¦¨ƒ–ЮfÔ|áòˆÇ¹rea»³AH]¬6)þ™s¿Sȵ«!Û“Z§Y›&§¯N_«ïïaÿ$ã]sƒ^é)Tn®y[g ²RäZ'õgûœ­WáXBSúÅv³<˜(~-*òÖljEpj³tÜ2î Qqf.*T¼4ŒMðM>&®:šº°÷8n)8ˆžÁs&Æ/ƒí|ᥓÐß+ÞK"úª_s­†óÆÐxCÔN\ÁÌ°>ÐÕX”¨§¡n Ý"M²>5Z uýE[k†K Z™G=A‚ÏŒé³)Ïs}´'¡þ|XL: rômµ“E2t¯ØÅiÆæSÌXµX ̸RæxlõJû:ñ“ŒaTäÛòíéh˨÷‘uñU7+fi~¶”Vâµ,c@rL{ˆ§„Fl¢`ÂU¸m„á9_U€#tú’¸4šÜ>MÔ÷“ªå .qá—SÂ(|1g8q¸Oé¾×“4'^¬ªäŽ™}F™+£Œ`·\Ë_;ÿ¾™Ñ9éUeÜEioèuÞl]…ô¶Ôsá´¥_;7°3:&ø)¿r]Э6šXNùT¡g-òê\¸"„ÞHvXï¶?/–ÖÏ@be49ã«¢.v~×C‚µ+¨Ñ0Q¿íU7˜œzQM8;’ÙâhÑixÈúüuê75ÍzBÖ=æ¿~# h1õù³ØìvûQi¼¯¼Jáí^~'Ý4Õòz'B ÔQuÃ30$/”-õªÖGG8ïléÒ`\ º.:,€í 3Cr4m|„†À=’Ãæ“ÈèÁói•Æ±v‡ì-\˺f–Ôe û¾I}îÛ „Íj’$Ým"Û2ò-§`³ßp@8˜ó+JHÁãÝo÷ܦu£>¿=]aë©™¬qd £íþö¶vkñls¥Ã»—1ó´ÐvéÑ¥‚=æêÜÓèWhJwÎêƒLéõÜ›–O#ýóŸnÄÄæWõ  ìÄrœ°Ç-¢2žF¬Ádü@w»î4Ú/ÔY=öÛ@òsûG&æqc汇lò‡ðõh½µóK ZÖV'p(Þ’7á̱Ç8ø.k4µAÅÂÈžvŒ:*A‚Åp )yÔ‘þ¤&n1áª÷pZqw‡_îⵊHeçàRl¯´(ñœ«ÓAãz=ÿÒ=ÆÛ|–_úìúHsMšì;¿Îyú–AŒ¨æ3F 1óÓü!½Yþxu¯€ÕzÅ’ÀOD4wžlÍñS0<9|DÝ™,9v÷åô8Ëç”KAðOߪ¢æŸÙ+ϱ m3À~VÊ´WJ˜v jYï0§a qÓåp) ÓMÚ ~Š<$ú¶£6[àzÖS³Jšn‚¶o×ýï÷5[À©Cd¢½ÄÑ.Æ›qäÖ-{ÙÅ­ ›:A¾á6t[6ÿ‘  endstream endobj 1685 0 obj << /Length1 1166 /Length2 5212 /Length3 0 /Length 5977 /Filter /FlateDecode >> stream xÚuSu\”[»¥¤”ÆAQº»af€!fb‘n$%”’.¥S@¤»$¥‘ð¢çžsîwÎwïïÞk=û‰µ×~Ì ¥Ë% †Û@žÀaH.>n^q€ÔÙÆÝMצƥ±sÜ‚BÖxëA‘NÑ·„¼+Ä …ì‘·¼ž½;@ÝÚÀÏ àãçâ»]ó üwh¹BáÞ-âê…ÝR p»3†ÔuG œ °Ä îî ‚¸‰lo;ûwU€<r…ÚÙ#¬ú:†lœ#|bbbÔŸ @ⵃ˜o'8âW¥ÛO!0ˆëmÓà_±Z¶ÖŠ`(ò׸V{$!Îðµ†ÜbÜn¶Ü0’‡í¶QEXîü+Þ/Í ®ÐíP(žêæƒ{Â|þÛBaàß#Ý<ú0¨‹;DYáƒo!¼¿1; ÄËÏ+ÆË€¸ ^ {ž_%õPÈo’ïl ûù à€­µ“Äj ¹ýáù¸Y{@HWwˆŸÏÿ%þs‡ÇÇCAH€ ÄîöþÎ~ ClÿØ«[#]¡^S^n^^>ï¯ï¯•ùí…‚á0'ÔßáÖμ’¡¢š"Ç?gÿ+JN~›’‹ODÀÅ/*të”ÛŒbBÿÌø—êðÕ²†þoŸ¼§T†ÙÂbŒs«ãŸ#y@\Ýn½ `ýmc6Àæ×€#¡ €õoë˜ñ ñÞºæöÇ÷_-õü5Ö?kŒ\°¨˜àØ9#+i"µŸø$G(ä?úYy`Cc\("Þ<ÐÂÿþIU¦½•372‹e㈧ÿf©‡}Œ›21žnž€ˆ’r(@HÍYb„K“>žó©i„µ‡@tŠKfµmSæù(rÁ»03‹‘Ò] çéÒÊìym?ßdÓÜöÈÎ<:¸›¼±öÓEºÁ„3Åüó¾¯òíͪ˫ýhfôhÚ´þð²Ä@ üÃ7_e]˶·iÂO_Ô :ˆÉ¾“ܯ¶"ƒú7—Æe$à>ü–I·1¤»oqhÁ|‡S«èô“Ï$õêU‰°\í]ãköO¥§“°‰êb5hÄL«×Cõ(zT“M¦;߆îÅ~“(K@åiH;ìÔ”–ɽ£€yo×Ìõ½¤iÏ…NA03˜ãÑøí®þg#oˆqº=‹!8"ææl–ÒÓ­ñ•¨óËÝ…ð½üñy;Àó¬èpL‚ ´we‰”‚7¥RíþÂNE†I_„ÂzNÜeˆê–®H¿¯zâAZ.`¥rì]`“ Ôè×À4`©H¸^lv¯:s– CpÎ|Ò €Éä³ÛâV¶áÐÙ¿v’f>¥T볬&þ‚=?ô2$<¾ŽÂê¹(rr›ô3O)Q,ÊÄ"€¤,L–Ú!+¢º`øÚ·µœ/}Cv7b%Bêxƒ@Ö½UÎX\ÎN¤lB‡Œ³þÑö!Å9ßÇ´¾ZiQ“OîzJ^¡ŒûUu ˜(ïjOo±½í}§ºÀ(îÌ°š”à͹r¡FVÀ¨ƒ’«8áZÃφ]»¡ä%K…¨s;ïɪŒd -!ksttZ@0²ÆV|Æ^Êô¢±?²²Jú¢ÕÐ@hì6Ío6 6®À·¨î'g´Œ2ÒóÞ.™Ö”q¤uNþ®]˜½>VÆ#ÁJkŽ-ÀÜe¨¾¼sÌ}:K€å€Zéâ`FA⨶Kߦ–øk-ùÈ ãCô-¼s<Ê‚ëË ´X|TOJ]ý¾ÍŒ&ÎÐý7´ ÛCwÓz,Äõõ—œ|ƉþÖ ÆóG«gXÆâÓ%Rn-q5öXæ›ÓùöV†f ÍB©¿¶èνp–XQr˜Ï¸¨OÏ79'Y mš¿²•0–žÀ…ÆÒUäúÍÅ·;sø |ö½àcÚȤ¢/Ø ¥8ü|»y¹ÞksŒÞÓµÓM[¿Xñc&›4¡Éƒñ‘ÍÚ TkïØ/OeÐÐUß½´{{ÙÍtCJÖfGq•¢àÂÙÜÏÃk‰}æ³Ö¯ƒÂrÏBUܨ6A‰V5ﱫ¢6HŸØ‹ù§1á®n6&Æ(á%÷Ÿ«{H=I#w´%ö „®)ž?ÀÄ(²%>+¦g¦HCtjU³ë›FËn‰Ê0ûùQ'SëÅsyíºIÅíK}el¶©Æ°\ô&ÆËç°æýŒ2uOz[ý•õâârxë 1VÙœ+½¤¢Ùr_æ¯h' ÜŽÝa dÅ}x÷˜¹©q@ ü*á”|ú¸^xšLó2"É0¯÷‰óDNTrÞ½4…ƒ‰ŸY#”æ ãt}éoÍê¹y¾&›SN2³Ò‘h㸃Ÿ,Ó”¿F%ûöªœ›ˆ³'¢^Š¬Î¨uѤ,þ„0ݱÈA”%]­21ÎX[ÈL]EÒBíšìÍÛs(›æêF´ãØg,åïç|ÅÊ7xÞmüfÎ[òäCóFƘšP‹¶(µbÝljÊkjð£í%XVkLÅù˜Üt•n`ûLMÓRNâ ¶©=ÉoÊœœh×Õµ # “3gý*_C3hxÚº¬ÛnCeGûHÙÍÔéø¦·û¡Fܶõ«rjQê÷y ,; ŠÔ½ÕMÂŒ\š‡þÏÒ¯Ò2Cõ_U"$Ž×ÒB»å?>þfîâBaν«–YɦºA}V'¬¯ÍÆB®M:j¯”"å2]•â>±´@%rËqY¸~/4Л³àŠÎ&¶³¡ò­x›ÕcÅ„Æ erѱ÷ÙÞÀ_%Ê*•C±-hTbXœñÖìRn“°.OÀ]ŠKO>F”QCÛ` á”X6¨Kæxnú*Á}r€21GcÑè;ƒQ¸MbÀ—¯86Y€’B®ÉjäyçJ‡ß§£L·DöÔ(¾†Ë–*¯–¥‡[àËùúŽ=ìð‡Cšßˆø|M#ÞÒf…ô§:+ÌaJ0&\>Î|óZvwíPåg*`’­”‘³,‰yXÞ”XhÉèÂgÑNË¡4ÙÆx©°¶AeE– °®3•¶¿>QÓÔóx yýîÍ㻑\õ”-ºgËÓÕ¤»óÆÉyk¾G¸‰«ñö´³MS1ñùxo,îe=TU~åñþ[«ÜÕ½Ùà>1 Ö÷&ðu5þ]긞I‹£3¯´`æÝ §Ï˜XhÞ¼û!' ãpÜì°rÃyðM®Yäèûr™ÌŵÎÇå (­Bx¹§2üüBbuÈgÂùnE>=7£«]ße?¥c·=)ƒãxE=nÀÙH)K¶F"RÚ™?-–ªžBÔ9~Q!l¯rUJ\°~¯û-ÐBÕŒ&Ú~M¨ÙQP’i×ÁÌ–íqT^t²¶OõV"f¿Q›í±MR.úRIk gtv1ͪBҚЕó¬ÖcÕO÷;k"ÎÍוõ™üÉ"ÌÁªu´:þ,e ®u#gB9~Ý5_ rEü Vf) 5_ÚwïìZŠü‰XŒT5R‚” ò2ÖàµJœR¥Žúy~ž)¦·´`s¶µìädHdµ·ZÙ+f67®@_êIâNâgÂu¢Q)ú µÞøÑ ßmå‚s²xíc̶Æ'ƇìU­dQÝu…wÚòpЙ]s×5Áã¾%G*í²5*^[é´ÝÆe2þaFÀOÆðL‡7\¡#H˜«> [ÿúØAڬƠMóÇîñø‡@Ƈ^° ëV¼“ z¦Èð‹Wþį‡ÐT`çMUÚô&KÜûdXŸzôTÉÎ T(KŸeQ¼§Í(fe7ïÈøÒpæßë.X¶ùØ ÒTÒýöãÙððg¸Ë&ŠÈžW<£– ½ç:Ýÿã3ú ¢›†5=RH?Wë Pݾx ÉÉ zîÕÈ'ÛÅ ÓÌý¯+¡eÃJ]EVóè!J¶Å¤f3)Ë“fÛw@¢4C…Èým9 Ÿïå¹Pq¯òM”¤_ÊfXFOI7U Î4N":t‘™ø“‘÷óì•ò:rZ¯íõ×Õ3¨ë.Î)¾¨x²ZŽ—,^Lq´HU²|4]=e-…„emDØNÝÐzF¸ðD‘V¿ ä¡ï׬ÉlÝòÙ7{lˆCÒk°Jyf!‚'gáºSov\É–=$—zDêé÷Ü=>0W’нsëúl‰Š” >Ø \x<¢Õ¬™”ØàY1-Eª(¯9M[íßöŽ½sÞL^…%…F/rÍþÒð“èÕÆbÿùòFY›fªÌKžŠ¾Շʩ‚WΪ Þ_m:ëÿ‘¯òÖ}ö„­½~QÙ>^÷ðõ,Zrc–>gC¿ –mlzHÆÑÖQ2´µï¾ÙKÇ¡¥Ä§Læo›†Å1ú¢!Í5Óy ì‘êÒò¶ í’ú½ŽVÈp¨§ß’ó¢O^¾fô_§çyÛ©ÍØX•¤Ì²›ˆWÅ›ñu‘úº°p³ØίùåðaÄ[Šb…¼›Ç¥u‰OBæ;ü2Èã"e¤wÍú‹wW®Äû _=vúÂ-} CÉÏž}a}Gß}I,ö¥Ò#¡Å%SÌÃæfK3œ€¼ Ûpíü4BÛ%NÁ.ÇHßüáÛV31†6Õ8øk‘ó<'xЫº<”4ý¡£~ðú-ƒ/æÂt¼)~ŠYH÷‹k6eôœ0ƒçúŠ ^0fšC®<ó8_žÉå"K·Ú‚àh,ÒIÑN]ò¼íW-˜íò»ÓKÀ|#iÅ>¨ÈÃÇù¢Êå¿< ¸H>[+<×O†(¿ŒYêh¦q¼SØCØ©ˆvñ$‚—‚ƒëõµšÚLD21*Á/ƒÙˆ‡gå£P»OˆÑÚT®ôJŽ=À#Eoñ¨a‹WO?¿·7 £"r¼eµGgGº¤¿(e‚NˆðÔÿ>Húšú¾u¸@ÞjîMDŒ×Ψ6mÉkÄhG¡å™×^=³ýúZ²—Œô“Ž~]¨Sb•"DVyÇ–º~¸ŽÈ7ýíÓ¸–Éôñ†êøÞms—Âl³üâ/Üøߌðg»ùDm¹RØÜp*>=Åad}äw0?*'çÄâ4ñz¾ÒßWÙŽ¼_KËX¡$Ö?J-+o¤s|ÏùëÈio×7MoÄO7:º5\øïª$N`;AIìKÎð3-4µVÈØsÿ\VÉ0/3ÌÉœF–Z}§ ”— ´£JŠgÇ‚&)W£Ê_{ÆFmî V¹éÙ Ææ/WΨììu§ƒ?ÓVBÅ1ôŸß©Gz ¤”|ÁлšÜÖ»º¤jÔ}îÓ躄¼|¤ÜO[—Ðp}·Ù¨Ø…3Ù*|Íelz.­…ÚèËv6W¤þÊÒtšöHäØö¡ä;¥w,Œ‹owÉ‹ø©wCöußᛜãw3eÀ›Ñ\6{ùs‡ÄÁˆàtiÐèYiÿú‘X­oŃϥ #hSËËó† ÇKEþ³8Õ’áG€ÕY!îjºhWŽÑÇÕÉ‘½ç¢§ÌÛ:óõ&{¥_2¢¿™âó<<#öMá©Ö² ÷«¶¹»ÓXæ ¶ž07,gxP\|’ïéeÕØNPï0vlør¤©€B©B°º–Z¤‘¼²ÅhïSdüK™Q—†?¥ÚvßÑ'ö—üŠU—rž€K’[Ýó\^_Â\¬¯ÁÀé¯GÑeXÛw Ïr½äã–uUìõ6Smà†M‹e«(̈³·h™ùdN^ð•ua\κgg ¥ÈqqNˆõ¯ã.Ï9g“ˆ”GUôÖµPñ³ôÞ™èˆ×FkmV LN!ŽDZ®Ó|™C÷út·Ÿ Å“ðõýë”<‰ÊQIÌ¥‡O=ß%!NÛÄjC‘øç^ŽœªôÇ›†WW\ëâAIý@Ü(¡™´Ï9%œkväÔ?9ŸÇŒo••§câ×vS*Mª^á’sà 󬋊³ÿnà•×•ò¶p#3¿+MHx9÷ô vo×ÅüÓÏ98HçT½©Òä½\ïØ:ËkEåwpßT»«]Ùq¨¼²qLr4W,Fg.tlB¼”{&/ Æ¿«È u{[lyAU¿í(`î!°Hõ2•/™0eyÏX€f–Àëí\®z Lñ â+œ³¸ù€ULXfã<ò$ÞŒ<çëkzÁäòFX¹-có/f9Áå3ià5€"®óÈHa¹²–y¸ßƒ¼YŸ¹Ltq0X¤Š G톂¨.A\¨‚?ƒlûQ*p,0[•LB2Mmµ3³½5uÇDÍ÷K›-Îà_¶¹:« Ÿx’³Zÿ—i–¡>ž·húljiÚJ¢Ù‘ÉN¯)í:†ã$up*6SØž4Z=¢­‰C]‹ÚË`øÍï‘“´TV¼£Zí\¾ô+Õ 9×ñíÅuÌ¬Ô þ¢8Ïn¹¢¹É³-Dï äáÉŸ§R™—·` }P9µZƒJK9Ý¿b°ðŸé;&Ö‰§|šUÐx†Œ]Ó˜írî8ó}ÉâIÄo!Ž~æzw¶»ïÆÙèSý¶ÎO½9Â(ñ®üTz½oG%ñz"÷vÏGwi‚ig|€°Ï½q½Lì’ìÕÒ²±²qg&h¦a” W„ßé«MxHÍŸ_ë6ÞÉs3æÜkY*¸¹£¶£º°Fï ºH˜y†õ(‡ =IF¡EW8XɤMéni£g¥˜Â(zHÖ¿Obkêd¯ð¯`;!ù.݃ ÷Yã5¡‹Œ2^ó‹û,½*î¡KŸ¨f—O $Yeó¥^e虎ìyÝ£RJ˜ä½K0m¯•HÆcÞ1;ÞÐè­Yx‘Ùƒßc©’çI‘´¶'vžø3Üí°i‹F°¶VŒ$®¿ƒ0zr̓…?6“×i4 (•+IΡ"˜jÅÕét—˜è/ Í:é2µå¼öYžCݽ*$ÕÉ®œšÙ¶6èÉB“ûðèVô†fìªJ4‚EJ=Mɯµ±T·:î/~”b¿Â²\ÙyÄ1ÜMã‹ëÜAó_eу“Ÿ+Â[¥CÃ؉›!YÂ!#@ØÆ\5wè£ýÚFå|32¥v$Ù÷4ÂçAµQ> stream xÚ­·cxeíÖ&WT±*\±mÛ¶U°¢ªØª bÛ¶m«bÛ¶uêÝ»»¿¾öéó§Ï÷c^×|ï1îñŒµ&9±’*½°™½ PÂÞΙž™‰ `ekââ¤bo«`Ï-G/4³ü•³Ã““‹:­ìíÄŒ<M @ h `a0sssÓDíAnŽV–Î*uMjZZºÿ’üc0qûŸš¿žNVvŠ¿/?€6ö [ óßÿ׎ª@ ÀÙ0·²D•´¥$T’ êI ÐÑØ äbbce ³2Ú9©æöŽ›¦övfVÿ”æÄð7–°ÀàšZýuºšAÿ¨è  £­•“Óßw€•ÀÂÑØÎùoœíVv¦6.fÿø+7·ÿ £ý_ Û¿º¿Á”ìœL­@΀¿Y•Ä$þÓÙÒØùŸÜNVÕ{ó¿–fö¦.ÿ”ô/Ýß0µÎÆVvNg «ó?¹L€3+'±Ûß܃­þÃÅÉÊÎâ¿ÐÆŽf6@'§¿aþÆþ§;ÿU'à«Þ²qû—·ý¿¬þ+g' 9<3Ëßœ¦Îs[XÙÁ3þ3+Òvæöf¦ËÍ\@ÿS÷èø¯Qý33ÔA›ÙÛٸ̀æðŒ öÎS¨þïXføï#ù¿âÿ‚ÿ[èýÿGîrô¿]âÿ¿÷ù?CK¸ØØ(Ûþ€ïÀß%clø»gr€‹íÿËÅØÖÊÆíÿËé?­5ÿF+bocöŸ:igã¿-¶³øK Ó¿…VNV®@3%+gSK€¹±Íß~ýK®ngt´±²þåõ_-Ð331ý‡NÍÒÊô»Ý?°ÿ[´3ûOø©úxF%am MÚÿÃrý—¡Òß!pVsýÅö?J‘·7û_‡ˆˆØ»<è™9¸ô¬lÌïÞ_@ÜL^ÿ‡”ÿ Äü_gycgG+W€îߺ™˜ÿUýÿxþë¤ÿaÄíLíÍþUgc;³¿“ö¿ÿ¨M]ÿü¯Ëÿ·êÿyþ×Ì®@Søå{SÞ@ëä´çjì¬Áq1ÝÞnfÈÁ PQZ~®o¥}—Orèw™Ñ[UCý$ÏG‹Ûü è}O†f¸ˆ²+x‘ƒïEJÝ“‹ºNÑÆI»ïÏhPô5åT3ÂãrNnJ‡ƒIc{\YÅ ð †`²Õöò‘Ú—ôG®/ÙÉÛ4©6 ³¥ ­:ïä”"îèñ²dhp ëºg63 Žœ×Û;á„8ÞÙÍÈñ®Îôúå'L}Ĥ#³,ÊcÖК*o^±Nã“ÆØG[¡Å°=_Uùpk+Ÿ á¯!bûP(¦ìRu4S#éÕÔß?OVJ\ý¢ÝýÙà 2rðÿ‡“‰±Z†µ¼º™ê—E7ú¯c0z"¨bYW¶èw~ö„©|¿ov…7“Ôýp`Ç]Ï18H0÷9”vªûÒ•ß0² ÌJV)ì5Q¤x}Û¢ Î¥OHr&\6÷Š;ÕÕÆ°ÉP2d6ŒÐoL,õˆÖïŠ-ìá‚’¼·,úÊ?G+ÖpnðØ“V+ )û‰ZwåôëŸüxŸ‹ßÆžÁñç ¦åhω>$Ee,þ†÷L¯âü¥ö_•Ac4Ü«ì].X´8Ù&˜?Ü =Ø}ëX™àÛVyCIÉÙçIÉÇ„s =˜’µ4ίòlŠV h Ù‡«jþn~.üiøŠaÎxEf6êa ÒÃξ3´ó 5{rø‘ßÕ—[úº wøÁv¥ÿR;gÀךžÇŠ¡šQò°’b58‡3XN¶ùó9­/åÖÔ_Àm=û a&†ËÉP¦!mh¤7ã žpóòаÊÀ•ûÅ9:Ãé¤Í®×®k\`yÎîèuóLÿCç÷]LƒgztÕ¦9§$‚ïØV£Xþ€`mÚñu¸%Má‡y×0#(©|Ô6µð®î^¹ázý‚…^÷q´•Âþ•Í´Âo6xÅƤå'íOnÍì^ì?˜­®È1™K}AÆÑÔF‰çŬ?c­ñøiªWpÉ„š»DTW2AE>Ä÷¢Ün†¬`ª°¾[pIàövëéþÚR¥Aº¬ïº/µ q½8]X›ùf^1ôF·“|úILŸI–Î2“Eûö%Ý_–|¯\¡;ÃÑîCŠM–ñ•öjÚª\%'ÁZ"äyH-,i1éz,ëZ¢¡À¡H™N¾;,½ë|òŠ sÓ1Sœeßé«°OÔïN²*uOÚ±{¨.K‹$aoÞ_ÓÃKDÌZk"ªåGaÛ”úa usŠ0.Á#Û¿­`a>¹íðëºY§°qg¤ëS(;dóS×cøÎjY]w?àåÄÝhYNvÉ—8/‘×j§i—“KcAä¼»µžT/—VwÖ}¹MD ½–E2(¦0Nü"[jîHúy“Ô G߆ãdòÚi8Wæ;P‘ëÒ a;ÊUÌkÕùÞÆg‡¼Vi‡ 'f66‡¼á¨]ßZû+<¼ñç.(;I£ýh˜ý^)¶rfó±š(4z`o8sn¹~y£NøZ&3_M·‰? {¶ÐYõ¶lr²tO®xv°ËÏðùÙ¸Nò'`d®ŠLaqù£¯u(G°ÌŒöFw-©{ìz/Sl†éˆjq÷}MÖu1'È)Øð§|çË)qpÖqŠt”à+â4Øû¤`¼­—¯Îñª’4ãì“sp-jÐ&›çm燌ßgù—T™Uá–X¬ì¡ÁúÝá©äéfÆ?¥è:è(¦‘—¾¢QÕôÔIs<ë æ#“ü†v5‹*rhzÁ…‚î7q£Ó!†V¹‡BM“ËÌßG>H¿¼­Ù‡=aàüo\컕Gì˜>+WÉj $b'~Çè£fëm“å±™¡¼W%v.­âbÚe™ÐJ°Càë=´]ô…¯Ê»¦Ä\²ÛDZUÄè—ê¦ÓLO˜¢©8³MÕdX›úgeùï\¸ÙIÇš[ççÔ(ƒ¶ö-ÁOÒÒu ÛkÄÞaDiþá¿õ7PD ãËÏç@vˆDVÔ…¥`Kí¬Ôq^;ºØÃTPËnF“%KL|oêÔ«î Ù¤‚§)ô““D¯{Aœû⛽óÖ ]r_2…¶sr*’$³¬ªëˆà!®mrŠ²¥éª{‡wåQF“áÅ(Ç ñ|»Š<£ïä1ÿ·.cêåKȉ'lí߬€bøKФ3Víè¾b1„‘&sB( ÒÖ7Ÿ/RDê>™rÝ¡4§JŒߢ>Íï…jL¿ÖƒE0Àê34}ýÆzÔ÷Â#5Û1ç¿]­(š’B†âÈŠ=&-êuœLe[ßZ¸ »j\Þ~naà!¤ÿYn£¸ŽÝG [Í6`ðGYø2,i@y~ìZ#±rfú€Ÿ5í{™0èY“/Ý•½;Oÿn¦ídÑ´ÏDÞãýøÜLÑ®ºì!Ô Š/Îz®/­Þ/ G|žëwæ¨WO|?ô€X"‡%I(å!$¡îZ~JuŽm¬?¢:ä!»ç|Lj47þ¹–ƒÕö;“M¦èƒúUʹ5œ—@V6%ú•Æ0óí©FaÌd´d¤¶lßs¬x@¨v¯$X-¶@3°":¤ Ýb•0#þü‚®ÏH-tnøõñÝÉ$`hž Ó;«YK+ÌlÆÊò» Â^`eñÆ ƒÐèù¯~0Ê¥Ô/-f´'ç` ñ9ÉnœÔÖþù°•Þáç9ÙDW{‰Ã²Ëii % œõÐ,‹m®uB]Ô¡¥&Ƽ۞{ý‹Q‰,©em¯ÌvLÐ òèqîñ>œÂ÷혃.aW|—1pv›jb…KÍ¢H¹)F–úZ•ÉÈ‘*¢çŸ6_ßh/Y˹tÃðߊ!¶û⹆äî•nUŠŽà€z»Š©}zš D¹ø11 áÞ ãÛÇsÃëDÝ=ÇÃéš½®0Zà XlC¶ñÚ®Ú7rS—ŒHÈÏ2­c‘#Æ µ¢J’8ÁY†<’Ü}ë‡çö9Ć1#E]FÜnóé²zÅÉüÏź1¿ï68 ¯­dÎ"kÑÏÙ·¤Å‘bHB›¥šÎ£Ù€š57 þS©ÚZŽ’“k¡"ñýÜ-iEø0€ m?Ó{r:¼L©¦>ŒJìþÞjLoËeyN¯ -ߥ4ëdÁ(GÄmQ•­ýü‡ü ëpÚn^ÕQÝXYè{ »?t£'fmmäUÌU¹à½Ï¼î±ŠU…¦æÎK9/u®µ{ {ýRÅ!w­P¨ÕÌž“ánŒ¦† Ò%†%7,9^ÈË-,bˆÅwd¯Ñ{‚YöQ1íšÅÏX*è^ÜæÔÅõ>²ÖÜ¡˜tï˜CÆ¢ŽÏ²ÜY&`¸ðB1q}Ä°â û‹;_yˆ!/¦g^†7¬Ä·TêÐN¯+LëuéAOß ¸Ùj&Ãj8¡lNòÒ²5Oé ‹³¤ŒüO;%Ô~¦Ašu›¼‰„"-—$ßûH~ dµD¼ëYÇU3 hO½ØyqߟEý¤ò+¤ÜÂй¿Õ¿åe3Bò©â~u½â°InDÌŒ¤³ ‹XûZ2Ýë¿ÄÝ%ŠP©Â, \H?ð8Œ‰È9V¹ôøEYãLâ_¤¦,™£õ·±åÿ±áiì ;Ÿ±ÙzÀù>ã?|½Žéº³‘d]ÑTTPûrIÔÈD/µ·ßð½(î· Ð*¸±µc=Êqv¢%òÏa Ó¦ÊûF= —ñ1>ž6ä%‰J¹ñ“RBM {‰>c³©³ÔÚœ†ŸùxÚ]©Ež¤‚šÃ.žèèµ.›JÄ5˜}h8Ž›ª™lïÁqÛ?ÓV%# Qf1ÀÆgs ɲÆqd›2åÁ8ä"úÎcv/·ûÛE2蚀yC 5Û²Á™™ïG±çJ\®×Žj80nº¥ÕÄÌ÷))×A¾ )]ܤu§äÌí¬ÙÄÞÏ%^YryRê ¢c°fŒ7@g6?*2N¨Ö¾HrøX/ß»ŒëíÁŽY¼Ïi=T3²ezQÒuÑo|<Ю'(†*u.Xe»g` N1…xôa¨jÎÖâ´Æó¹-Áf\V˺DK&×jñixáÚwîËtíHšÁ/cÍžšf™X´¸¼iyl‡x–ªj-"ØêÑÛsPŽq"ÇRƒ 5®$E_ôÉ·L}˜ä¸¤ÎI­Ñb‹¹úüþ€U…ŠŠÊ' UÝ×V©[gØÚ.k´ŸvÊ×ÙZ5"j&Î6wC™4!má.;qŸ~!<"Nœg~>ÖÌ_$V;¸ d³‹©¦!³å×,`ð‚é&[OqAõŽÅõ«Àw0—f©ÊÀ:-«·Û<«‡ºÜ!\dÓ`ÉáH7 ÆüQ;:vÐì<~¨‹~µÎÖ>»C'ý¬Tuä¯.³Tï{-›‘ª;㊾ùhÊY¸x’NËr[9.^$CI6< `Oº š~4€L@< Íñ‰a3›ÛAd„ñK€ØŒøºÐî=~¾UÆLŒUê¾aǬD$XÅ5™èb+­ª¢œÿÖ¹t1ØÀF†ԶǵMÓ*V¤£fÄÉ#컈­±çR ?®÷O2ðì®ýòùõ5Õ3¢ŠA¤^ôG<Ó†1! ÁbžãÝ¢GTÒüQ„r&lt3Á#œ=šƒQ6¾imª^O棥1WØ0µ@Î>£¨JŸfMßÔšNìÍŠ¢Š… Ä›s,ƒv)Œ€dâl‚ä‹cTÛ}û–Žî× d¾¨DÒœª`õfa7´}]»€º`f<(;O}'ªf >5>ŒVJ½h¡¨F\Õ¶}HKGib¾y6sÏ4 ž-*ŠmØH©Wdf^ˆÝEJ!ì HÛõBÔ"WÕɺ·P4â¬ù<¾ÁtåõB—À¡+$´`¶{·A{Øì3ƒÒÝsÙ×L‹Bfl°µ}Ñ~©ìßݽö½)AÄ ÈAáB×öZ¥`:Ž3Z˜)FÛPv‰QÄœ-ªmæ'Ö7þ\X_h^:,ÀxÜ÷Ÿâ%ÞÌhuªÜ²¨¬I›nÜ%4oóÛ…Vʤž¸’ØðgD¾–ŸšÁÇœºŠ·QÉ¡˜ ™XüXZ¢¡uÇâF.‰‰@Û%U_XÊ}ôÒÇ(‘=̤qºïKɃõ¢ù\u Ú[“ÝcöuI'c쉯»Ç%¸"ŒÛÜPå"ª ’€E\‰~è8ywuü3ñ$`]kdÓó.üBŒk |'3(hZ¦¥jS“ØÊØ]ý=iØVŒk¾IY‰{îüA…Îà•kk‘9·t½ &Ü8}ƒÍÑL Ê|ߟˆ”^mUÿäþÐñùEQg|7­+B§"´=‘ìfס›Fí÷”Ô{P¥<³ÕR:áÝQWäë©ŒºÁ7"´Ûx´N{|¯guV{‘NÞÙë«(¤[ª 4(T}ü”;WµÒ †š5:SED¦¡¦È7oXrS@¯ØÜòät “ª¼„X œfñn  䮞ÍþF­,®Ä®¦çB;“t0ccïõô6N¬H“:GrA ÷0ùËî›*ÝÇH‘—­:¼TÔµ BØLâ”êIƃõ¤_Ê…€fè¼O’´g9s>C§6>ãS0ú³”L¢2Ï,Ešâu™+±ë nlÍqÔ n›õôëµÁ„¾¦SÃÏ…»!­ÊÎOÁšY‘Ö#[½xZG~ÜÄ×Sa_¹‘%Bz§¿PT“¢ñØtHIÃ~ºžýꇑÓw¿É~ÉU‰˜,Ÿ‰Ô\ÇNjåJïmz?pÅ,ÿVÈU‹ü¤cÉÍû­š'~×õý·'"êL›1»†ya³Ì7â©qìàüDˆ¤t¬%e¹ü’…ž)8vg.z ™èÅ#áðÖ©A£¥P+ÇĦq „ÜåKÅÉq3µˆÅPÓÔw.ÌG±ª¤Åžé4r…6=è;‹jÂß«£Û?TP. T‹ËS¢2a7So'²ýȘ=Ž Èf˜‰L³*úr JŽ¸äZ‚ ÕöݵùË S¡ç懠ÀçÄlúÄ[¥¿ð©•ž>î_Z{³èó¯„}Ös§ åÔÓ\§¥«²ú‹’à2„ÕôyžÂ뎅%ºèœ"Ûeó„»÷˜1çøC8Eµ#0¯‘yüðíkûâuØç0çcaÊyöáðQ"œ\”áá"hõjF´vžú­:ÂþIßpÝ”n¬ÒùºÓ]‰{­fû刌Åçºæ5û~q®î²Ø‘Õ¾hãbJvÚ¾}j¹¬øXV¹Vo‡Ð8bp\𳘬† Ý€‰ÇÇ™“AýsÒ e–ô2X¬_Gj Dt¦(°àÞ{ -üaѤ~²·-<ª`\I³…$QIÇúXO¢žÝ4c€*ý°ã 7€Ãf¶EœŠiÃÓ ¦%«‰ÆTi[¨‘1Zu£·2Ç{æ^9ýкlöÍgí{2ÓÉmÒ2UDæAØÇ%!AmZ¨ƒôâœA ù×ýR¯0Ì:û³rÒ·G¥S“ MeOª_*Lšrb›cL÷Q®Ä§TÔ¿¡ãôŸÇœ±`®2 ©²«ó—´5JcNEä÷ƒ^o°Þ–a>^¿áÓŒu<²n¹ÛìE^¯«£¤žXee-Pô¸eFí*¨¢GpÓ9žéj¬ªïKJDûÒ?pjŸžÉô}КX]t„xØ­œ½)4ÆÚíÃø+lN+µ¤ì`¡!M5ál´Êdn³Ò ëðêl²r<Úy{pL>…ïØŽÜ.%O»`ìc@Œ\3ÖS~Q·Ð…/»­ëk¡ƒµO…mó3Î tm’Ò=¶Æ#’ÖýŽÓFÅeU.î§Q­û•2ŒÛ—gôSÕ »ë6 ªaè“åô‹»Ýæƒ+ç ù†zw@ëå˜æÝÐUH¦})“ª`,L©%l=Š¾Dˆnر¾Üô냤%ö¹øàê3r.–4qx—¢pEúc<¹põí–àñߟO-õÌïÛòâ(Gj‚Ћ fî1n,ˆîQNÒ3¢I¹ÉtßôôÈ#›aÙÇ%dW+³Åc·F~>§V"ôÎBõuë¬q8>'»G󘤭vŠwª¤ ³­îµ  5ãƒ-–HCk‚®'lgõ¢—ˆo¸ ¡ÉC¤Ëΰaÿ©R+¿%Âœ2ÛÏ–éôN«+5ÁÚ+M™Ì=ÜÚ.…ŒnÄìmLC ¦Ëw' ß7Ä6\VÊÉŽ”Ñ+—pUÇÊÿH¤ÀÄ£¯ôô~“­ÿþÆ{s„r1­X6×KQOÏ}†©éH=³07& SÝLî¨7ŽmͲ‘Ö0éW4™ûÀö¦¾¼˜†}3[6d´Õ] edÿ단)qf‘$M¨œE´…Žo-?·$‰IÝ—Q—oìõ\˜$\J)dRøiè¼ÙË)¥<&Ø”Ø"ZpJÚ[~àÑç”3AŒŽ„‚7ðúg˜pÂ#C#tB%— '.˜=´2îH¼8¡ò|¡*e§ì2'²è•m­›õÆb+ŽëFøÓY¶pQ«ë6µÎrkÆ6 žD0?Øçô¥PÈöþB)¾½¿%«Ii«¯hK'+ŸÏÄ[ì33fcaS̯d [É€d–cÁp ¹™Ú¼H‡±úpíu­ù„hA,³ï9ó-”÷=ÂTâmùÉHÐ_ V¯ßжz%SK3cDèá 4×É¡H¬°f¬:„®#±†ç‘jÌ+[•j,#CÌÙJñSÀºcûÆN¹DÛhÛê¦Æ`Ï»ƒÅ¿fŽd3á½—ÚH&Î7æZIØâb¨»Þ°ßÅYä3‰=i)݈÷è;ÌÅ­Pó‡šôõÿ©Å¤ãuyQPtK%Båé{·VÊþ™˜Rã£âf!m3?îÖ¢g r„Œ"¸Íw@³«À‘ò‡q»Çní«Óšyÿ.Læu÷:ÿf7i°§)rRlˆ¿™ŠíÄþ¼ñî¾Ð§cÀôçÔ›Æ*³þW ø@ã%™ NÂÓ3»I /O@†F žÃÝ.ÔÇNªT•a¬݈ÿ&>`›(36ƒÎ«| ÂÖGŽîˆà½DÃ(èªq üõ4–GiµTÁóz•dIÑ·¹«"”á†â·ÉïâÇ&†…"[|–—xp!58\EW!8Ó©Âì;Ÿb,ºx]>Ú¢ˆ…¨¡[9wîpc°Â5÷¡OŠVAÝÉP;BÔjòÖÅð\m>œóyݱ¼ö¯H\Lg²ÚÇKä©´|Ç ,çôŠüB¥K~4„,”ºÒç¸Êê*’iÌ¥#–…>¥WDÒÃrü^# e›.F8Ë•f0 ÃzI¿õñŒ°Æ"]vL¥’6\&)Ê3o?¬…6Šzr;èäGz·‚A!=ã k­)™¹n~½ºí^¼yù䟼/Héùv+pÒÁýþq@cÐ8£†¾+¹äO…I!ÑJnÎ#PÖò•xT¹›ÖŠ… Ÿ‡YšÁ*YÃWyëL\ó¥‚fös#‹†ýé),jãâa«#ÿ2PÙï–†ã™VvøÙ¢2¨krÉ ?ÚiO,ÊL€91§šè;ž†BwÖ C` ’fB:ªžãï…¹ÃÔLÜÊâ?í)G¨_•bšÅ'Ûµ[Ü„­]8§ ÝI…å§Ð™®5V!™Z?¨jyÁ:m®ò®óÀ-c¬ÑXÙg ¥]!¡È\ú:sTèsO*ÞÆŠtºº‹…Émª§lx›t]ÝŒp%âUÞÛr q×_ÛÂZãµá%)³ð%#„~ø×G œ¯›À[‘ÈØu“ ÞáâáòÚU/ÛpávsäWy»-ƒWd3üÚ’v—¶Ž£'è³å½È3 äY ‹"6&d±9p83ÕXí¾(|u³ÑnÏÃ$©îGÄL¸qƒµÏó¿œÑVpåìM™{se+U2J£…2‚ìÉR ´e¾6KßN3T+ \Ù tEÉÎIÿú€]5F¹v¼c-}jŽ—z¢¾›Çi¯…®;U°“È¥[ýÙȦëÊœÅq$±Ôîmš /˜„"zùçÛ;í)ÕÖ-ÃQ š“Ì~€Z \·:ÈY]¡õÊ4l𞻃£hFÝé“$ûOð~wèUáêËi³åŠOHø¦©ú )t´"﵄ˆÎœ]ÔëÍ…¶aW g„_Tñ–¿J€{«;u®á#Ow†àÙÄùñóPeľÕúŒÿÊnû7i°?ƒ¶ÏàÃ!š›+[´är²5¾]wš¤¼Ç“…©/¡‡±¹Ê ÅgÔ¢d@hÙ v±@ö2ýc²wö=yôX¹å4œÚ‹Ð[ öȵßs8ÿé¦:ç—[À¯ÙéëSÆV'Ô•ürýHHª)î&_´°ÆåJt!Ø#÷k »…Ñ_“éü"Ò1l3(:Ç@“ôª1O2›$q/Ý÷\Ëí£}°*js«šrûö…éZc B£‡'aù¿å¢Ý  C}0vý›sÎjIE/-CƒÒÉY¼ÞsXdý%Oßu«“¡#¼¯Û{Yò›…T#/¢­ªdúÂË!9Š§«zˆ·ïIñÇ]ïTÀJz­â íIr&Ü·üö—A¦8H!Þ{èØ”²-—×Oî/\|›·‹w×HcÑêÔ¼Z®¬Y4Ý9'ª=œœ¦+À? fÁ#V"@ژЛÏiµ¸$bôGAtxvâ.î̬Ë7Gï/¥V&2Ù¹&¢+ãƒ?C.¬{¿A$°ŒÁ“A¦FJÃêŒÔõ›GgiÐÎõZ“­§æçæÛW>Sòõt“6ˆ×›¯ìÄ®©ð®ãÿÄPï@à¶ÔoðE@["7_¤ w_AHuŠgù^¸ûZe[V¡ç€ßâš;pYå¾~NVíGªG/+wbå=r!fõ²# Ü$~û¼}kE* Š°´åϹGø-·„+Ù³Ÿ—â>A".P—ð}uƒVDxý™M—/iOÄ9’,ä Yþ‚míØÀ¥,¯X™ÛíkyºT¡êâÑídÑäOS ÏƒÊ^Ê 9BSwù%|ïÖá¯öEEÈ?†Fº=Ërø_ÃZVñÇà‰³ù“Q—q 2{/ïgD„—»€<Ásˆ·\ѦHO®¼/]švÚ,†®VDžtTȾT“ÃRöO÷ºr›eÔ?³LI´Y‰²¬+Wpnj}Üò’‚»­l‘äädef§%›®srYß\ Ð³•Wƒ´nð¥os~nµ~b9Ø™­nøLé†8g1@W\GUؘ¿pš~U~í+§š¹ éãê Yñ-¼”ìîŸ` 4ª/JÒ!Û1VÄÖó`‹QÀd¾ªœ69£”2u>ظ@èJõ®hÖŸ<°’œp¯·ÍMa¡Xƒ·wL¦TnãHÄò;]ÍvÉ+Q|"gI 9€Ç¡v•à¤ ¾÷eäÍ}ÔX«N% üTQfHÝ–%zÔ0ÆýäàÒë&=dé&Í^> §µvI_ç'3„C"-ܺöówŠ#qHfÜØýV9f©—°QJkh÷2O4hxä[eζMœâBBr5Ež‡Îqì˜;j8²T9C˜÷{H¦NX*¢¯Â‚ŒÏ7YÂVÕeª/²F§cY §=QF:“X&Êà!–<¶µ´}‹h‘Aôõ‘- ÀpÉÜ¡ÏR^9¿á ¨`îqLu ¨b©J†r¸B¿Ô7X&0í °UþþKU¹¯÷PìòÓh kÏ´ïÍ•¥ú´LpYÕ]¬³U)¨EÊßxbìŒärÚ3¬5ád¸º‹sö~Ö+Ô[ øÎ%Ë#˜‹?y%‰zKoi³¿N23ãøóµZ’¬¤39#æGs;µÑàKe4må¸ãi°ŽK?eÜcê6ÚšÙÓú±™±k7·kTüNœµ S ®½l^T'þýy½q ƒ þäênBXQ}GÙ#Uqô÷á#‰…i–ˆêæ,]ï@‚v—¶!V‡€¡±.7u¡U(ÊoGçNÑ—Ž}aÓߌ8Ô¶ß\iy:#Ë̈“æLRhmQ(¼1'ø( Vïÿ~z¨Õ¿½e5 {Jœ/%Â>’7Ùé٠عW¥¿öôÈÊz#û’ó–fšÜ]=PÞ£X$ë$ŠÓúg­|R§òXu~Iß ¶¼' ï5E9G<€êG¾I*o";Gnñg/A·ÀK†H8ÒÞèün°Ò®ÂßMzª‰ó.Dùñ}êå/·ok¯¨&EIÌÛÖÆ4žçIq}ü ÝæF•tNMA“óÍž_ÁAzÜ1*Ýs`c#.éùÏH;|Atª­¡ÞådÆ`aÜ‹æó‘èX´f‹1¼[:.öŒ¥ǶR0‚æaU¸ÚàÞq¡7î•EiþqÍ\ÒbÜ‚?Zõv’{b׃ßd4`(¢Š÷¶åÑá¦çc~û ±¶ºvo4‹ÐÞT¾´$?‰³¢pM)¾u±HaX ³ÛšcY±Ä•ð×*î§g×ûMЇÏÙ{­»#KBƒS*Ka¯›è÷š‹È•MþT¯ó'Ïþù1Ô.}T“¯kp]ô˨v†å™/!öÉXA|ÝBŒWqBO˜ö§—œŒµÔM)ŒKµés C9aŒBe%—Ÿ˜qÁaÔ;œµ÷£²®À ¼OŒR*koÇ¥.@k#¨ª…zéÒùÆÎ6„}‚F•&œGîœÈçNÀ *æÊ°%Ë o_b»¾ ®²®ó @&vëýÄŸI3U`Ýçç]²¯JŒ”c¤ kGû‹þ§ûâfÊåÆi]o¯‘º8I( Ÿ7üvÈЩM6ã훀AÑöÍ]~Â*ŠV]ìDét¥“„ß½s…Oüzéb&Ư~BÜ~ÖõèW_¦Â’ÎKä ožî¿èM¬ƒ¢çäƒé‹«V€èõ+­hŠúg='‘"f/r9 ¯åP»Æª¥±Ö~á3úR‘ †KMè3Ù›HW¹z\šuæã{°…ï ÊœhÃíŽXŪ†õ•—€f%V*jƒh=]š@°à›* ³éíJúbeáªg/ ¢O‹Î·ö5GbýªòE½×d‰N Lœâ¨F”)žP¡ ·#†7d–Ä„ù%èH Aï»Îš]#>Cè—³cUKlôv^9ù*Í7=ÞåPﶞ>y'šK\Æ®ÞyøWð•m¬Þ´y‡„ÆÃ`xrN„†¼ôN'x È6y—âóÕ«7þV¼Õ/ÁO]2yfî>f®) ®-sméίê‰GÑ—Fö~ßY»“­šå‡óè ﮹PôÚoø‘ô¡í¿K,…•Ç%U%ßØo¾^/_"òÆ/¾³Y «]·B5ha·Xø0)øa2… ²Ð{ôךc³´“Út8€ÕOnä’଴gF¬¨?èÒ|wÓý^ßI£˜Ê¨½†jTˆ[Ç 0«(”öÇ„}_Ÿ´·…‰‰ƒêɽ"µ>kUÙ¤£U—ÆÈõ(N ·VŸ_t0éÈ:òfµzH¹Ã9¼ª-(oCDƒ§†Ú›±4Dì®`!]ãìªÑ´+󸻩ÙÝAQÕÃ2æ_Ã÷gÊÀ“a›Ô…áɵ ÞŸìÕ(LY„o¤.q^îóã}nE¤©´ÛkµwÝãóí€Ýµ –éò†þâWnëÙÀsXµun$ö\w‡Q©ú”˜Ëœæ‘TtY]eÛð—ùÑÕ o/›Ü.m‡V¹‚MãÕ¨ äÝýùÐÜqŽN¦Dps«º˜âæB¡uïóË´Ho²¨ÌϦÞo(AÖ0$ý„ièô?Ã’…RTƒH—qÖ¾L´x®óš<å&+@€r #­¿-ÝÎî4CÞ¤œá›rî‚—¹ÖÎå4 þžkÎ= 5gt§3u ú ØÞ¯ûˆ±hR‡\LyÁŸ¶¬Ú-‰µcäµ6Ç-œ|`«w>c~nvÿ&{QTŒœI) 11ˀȕK† 1H³)P•:½ëŒŸ<õ´[; É!Éã^ÍAç¸ÌMe¦±‚‘ô[ϨV$_=Ç=eî È~xƒÀ{öh"6Ç– ÝÛÓïx­Úèêjf=r8UGZ1Î8|ê­Â÷ÌhÀÓxÎeÜ º`£1ùvÏãg^n2–©" XI²‡6c"n˜Aká©)ÍÌ{¨T.‚Jsô¯©AS môrmÈ"áHyݹƒ2·_Ùeö>XíÂÂ(ýKñš¢Å%Ã/ÏäÉÔ²JÐìJKÃ9Ákˆbïüt™ƒB„ý覜…6…|K©¶h»¥Yk§;'<Øn½×µöÙ¸:rq}eÏ0þTkX0ö#9>º{î¨+r6JÁÀnojàrÇjóÇPcIÜòÚ2UÝJ¤˜ÂÕ{ ”a舽 ÕËâŽüªÈŸ„ÖÔþ–“ů•`¼ dÞ?!|S ¶éƒãIY÷/QcnlAg)Äd €2&:¤Â”‹AN§ }Z]ïñƒcÇê?z‰+B¥jÞ©m~x©+¥‡Ñ=¸†þ±ÆÛ§Ý1©Æ¬x[;pÏÊ*Kß@r:ú‰qr¹¡NÕ“ìW™c“Njg'íb¹¨g½IL1šD¦¶Y9]½ì2ó@<5í×JØð–ANQÕ›j +æÊù«‰vôÏ|ea«¼´ µïðUfù•èXWý¡tЦ±BÚJÇ QA¯YÐþ­ìÆ"|ÆÚòË/ý–ÆBr‡ÒøAþz½äO®_NÎ1 ÚWg’§H¤òKò6æjÓ¡Í©ÜW%¤¡(‚(ø™f‰e_Š·¼û+Í=‘Î`ö(—ݾòVužrC5©V÷‘æíŒ[ÿH ÆÈ£ ’kÚ:ö;º\ ¸å&ìíξƒö¾6[åFèÖ„¶Žá‡ö¬ ötèÌ`2ÓÜÍ‚¯¥É÷ÃøävýL¯ÃÑAž”)ú¯ìÔQþn£ÿo¼«·Ê®æ¼uQSи…“bp -SÙëʦ(ÿv£{¡+òéäâèLjw´±Á1Ñ/óö­§]'K¢c÷¢Ù£Øú™ ‚†ÒÉBC3&Ëd7”iÛÿetén3àdì–ƒÆçÖÇ6fß/¦˜O@¬kÎ ‚öÌ á{UzE‰6Ò¯Š>‚FmR{úy[`3úÜئÅô=ĘEy2F Õø@ËÉþ«\Ó»‰µÊνì>õ"‘ëp§l!iÅ©¹ô7C`¥þ6©aô’;NiËXêp’;†ãŒb¬_¶ "ŠM—0$–y35ëéëZp<7»Ž®íÅþöõËéë`)¦ÎŽ×[3‚KKl5G¯”\¦Ž0EñøW&&ì\mçu¬?ô‰žü¶Ã‰s«/¡‘q±F¢_“9'û÷ľéÎu1SBÞÖ?ðéÂZt£ÕS èͪÙ`ÁŸãÓ: 3$—=—z'šŒÄ… àHᮑJÆ¿Ó9€L6“zšë Rð²µÅÅJúX ÈÃ)˜a£0x÷>’Ê™×PX3/«4sï×¾‘=í‰p·@ÖJ =K‘Ö±pDx)yæê"t 0­´pžZXL$‹å‡ƒ4L*?Ë£výdνíi€–²ùÜ«1‰E™c#ê°x‡m㾎Š†Â‰aŠnŸÿ7ÀôQkñêB˜X«ð qò'u¤W±Šß›þÈÆV ¹În á4Ô‡{Á×úRñ8O读ÑkÖ\¹ V‚fîW…±½©ž(CH»»Û®€)`0æ´fÊ[»[€…š‹6 ‰g+Ìã©ÀIèðé;Âð:X©þÀ!ºòKÓ+ÏPTúèðÜ9hï¾E(6Ãu!M'qIïý‘œAo‹Üo“ôüW…›úÊà›–ÇYû•ü0?˜šð%´À³0¶fçÍ%¦|€…ûxbSNØ¢²°¶U’é\­à329YM?N_ËáŽPéÔ±!V¹v<·µB‘êïz¹ GSÕúÄÌjÊ‘wÇ,ÊÓFbùT¸'ñ£2 ä±e¸ã½½ûC¿qª¼œX<‚–ëF»ü$YÐ׺Èz&@‹ay«G³«W^`Ö»b‡DQ*·žÅ™òÕÙ«žØzä–´Àg…•æÄÚ_Ž|ζ&"š¸WÕ›G±BJµ38M¥{5ª‹ t oO˜Y3»Ík<÷7dÌÕÀÔXy÷wüø€è-m^ÿr³>;Sú{2£Ê=„jJ`/@¡‰–ˆ±Y›+eÀÙ–övKT÷ùsD™îˆF~!zW™ ÷¦L¥BŠ‘[­”Z¾{tn™CPøÓ|£q—‡«"1þ…²Y–„vy³c^᧭Rí¥‹¨V\Þâ/ׄ”n1O“Q%0{.†¾€bK³zåPóx£„è0çÇO[˘N=1ž»ú‰8¥Ò´ÌË÷s±>Ý|qÎ ò†5dÆÁT«ŒM-õ$„WŒ3zªf¿ˆèÞ“0>9ÿÆÓkÜØúf>mHiVWa¨†ŽdÝ#íJüüþû4úãvúö3÷–z¬Re„¹(uRÑBKÑŸµ$-3dà†aÔ’·çâJ/ˆ‚ýeEËõÝÛjŒc˜©ÿö·1g#¼C ™Ð4ÈHœ2ëðrÇä ¢’}GJ\!±-’âVÔˆ®R2»ûÿkj<} ÖU“ÅØÑDapçõˆ#‚Þ^É÷š6éJó»W͉à< z¸{ÎHê¤æžÛ|àh¶ ^Z†iÕòGø]-[PÖ¼á¤ùìÌ4pÙ¡"Ù}`j¸%íŸÞèKµñÞŠ\Yh}á…[¯˜ªŒ¾²õVQÉ3>pF’ºïíÔÛ²ÅþÛœ¨©–Î…B5!ÈTå*E½|C`t)/ËÒZf"ÛŠí6|‹ ê"⟱éׄp²ÛÝã=E3ÜJ}Eyð³ûˆSáuçô"‡›æBÜbžé*Ö[¤Z=(Ÿ9+BÕ+Q¹'4â`{ÈŽç_Â!ú]ÐBD"'&pô“¥£É½6´òXȧ×ãoŠÖ Áý:_fÉ„˜}ן‹ëá´EÒœNé†)ÃD[¤Œc‡z{Á¥šè†Ò~¥˜Æ'®ßÝ ™ý7ó¸J;”UQ€§ßÚ5œV¾²=Û#n8äµG9¼àg·¼¤Öò¨ VI–Iöͺ¸BèP[Ê‹…tmxò4UW\L›’ƒ´©gw—žïÃElv¹ÐÆv¤¾T>%0¯Ã­9+Œã¾¦Ìÿ¾hùlAêWÍ‹YRØ•Q&ÒsçÁóë‹f©9™hziàé7aº·ÞcEí?Þx·m—Woòn–ìÁ¨ÀÆÙ¾yú7Á“£À›ôýÄ´l|#é‹êÑxuW!y"h ë0‚¦<+‡šÙŽ]è1F·b¿NMõCdiJãZUÝô<¸¦0(ª¥®I3J<oèéçv»÷wcÀG12›ÛCâLˆÀaû:ZÑ÷Ъ* hÌŒ(±wÍû ^lèa¶Sn«€¨ÄqMLÚ±¥¦`‚ Tß” ¸ƒzGaõ32ÚµSmáàYyëo ÷ ÙtðÄgG Å6óØä_J¤É%ÙO›,ÕEŽú–o¼ìîBj`N·eÙ‚R&pI¯ËýfQ”ƒppdÔ˜šC í9ç«&Âm7ˤ´ã,…±5»Nüe¢1²iO$¢¿¾GŠ éåŠÌÀ¿{­×Û¾4y|ÜuE¼ºmPÑÏØb‘å"¦jŠ¿M€ù3TGñÎ{õ={®z:Ý8K‘1°5½³^á×P£®£Œz]"„? ùÊöAôel}X(ìÀjyVå†åx¥oõçSïmuDåxèѾ]jÄb ”×Içñ•‘t™›5¤¿Ù&•ÓKñ{ä/Dp—÷}Ùí„ïÏÅU‰Ÿ/ ‹eÖˆeuèBh¦“ ƒ¯+¾RŒƒnCý̯Âýâ<:HúA8¹dêk!·55Òð0>Ü€ê(…h>n3sB”WúNJ,Ú_#L-öJ]]ｦæñ¼±Û˃\é]˜šŽit^Sµ…æav ”¡ ¹á˜Sp[Ï­UËïEó¹IÚ!*ÖeÊWú%G ,[ô·\I@òwýgë’>¼Ýì¯/ßœÃ=–Œò†Är0Ó(îŒej&åu‚NÒ“åžËt/é}詬šÜ=’vXcü‹íØ#‰¬8Ò‘JÕá×Ù0Á7`ìQ›·oÀë#¼mï*´_u9ùÑ9ÜÖ‰ÁGy ?lQQ8+HÇÈñØP/˜¿€‰ÂO\·µ|Ws½ÒØUk&_ôÛ^]~ý?ÂÐì endstream endobj 1689 0 obj << /Length1 1630 /Length2 19256 /Length3 0 /Length 20106 /Filter /FlateDecode >> stream xÚ¬·ctem·&œ¤bUŒŠvlÛ¶mîìØNÅN*¶ŠmÛNUP±mû«ç}O÷éq¾î?ÝçÇcÝ×Ä5ï9Ö"'VR¥6µ7IØÛ¹Ð330ñ,mM\Uìmì¹åèU@殀¿rvxrrQ'±‹¥½˜± ˆ  2ˆ€3777<9@ÔÞÁÓÉÒÜÂ@¥®¢IMKK÷Ÿ’L&žÿCó×ÓÙÒÜ@ñ÷Å dcï` ²sù ñí¨ \,@3K@TQI[ZA@%© ÙœŒmJ®&6–@€œ%dç ¢˜Ù;lþ}ííL-ÿ)Í™á/–°3ÀàìZþuyAÿ¨è '[Kgç¿ïKg€¹“±Ë߸Ø,í€6®¦ÿ$ðWnfÿ¯„œìÿZØþÕýS²wvq:Y:¸þFU“øwž.Æ.ÿÄv¶ü«Ø›ýµ4µºþSÒ¿taþj]Œ-íœ. —b™€¦–Î6Æžcÿsp²üW®Î–væÿ™À dnìdjrvþ óûŸîüg€ÿ¥zcÏyÛÿËêæ`éâ ²1c€gfùèò7¶¹¥<ã?³"mgf`fú·ÜÔÕáèÜ@NÿjÕ?3Cý7 cS{;O€)È žQÁÞåoHÕÿË ÿ}$ÿ7PüßBð ½ÿoäþWŽþ—KüÿzŸÿ+´„«‚±íßø÷Žü]2Æv€¿{ øgÑØ;ýÿ|Œm-m<ÿO^ÿÕZôïtÿ`Ò.ÆÛ"lgþ—&¦ -%,=@¦J–.@ €™±ÍßžýK®ng r²±´ýåö_mÐ331ýš…%ÐÚîØÿ­Ù™þ× þÒõ¯üÕå¤%Uhÿ7 ö_†JÁEÍÓáonÿQ¼½éÿ<ü#"bïð¢gæàгp1ÿ½âfaóùß„üóžå]œ,=ºëfbþWõÿñüçIÿ¿ÀˆÛíMÿUc;Ó¿Óö?ÿ¨®NNIþ×ø[õÿ8ÿkîA ~eÑÈl•–™îR‹;<)¦ÛßËüe8ÄágƒZQµ}_Zøw…Ñ[MCã4ÏG›çï‡÷=šýÑ^,ÊžÐE>¾)u_ê:E'í~ £ÁO¤ôSÍ(¯Ë_r›:LûÛ“Ê*%oÐÓ¬N°—Ôþ¤nþdȾÀÔúXÌN”F0´Ú“SŠÄ£ÇÊÁ±‘á¡žk¨¾=<ÚœX8r^clßäâ$O#§»àÔ‹§såï¬ÍjÔDu÷ïx¯‹®Dd÷1[èÌé笄æŸÂà»LB‹&±²îa¡1,E tDã¢3j2u‹Ò§ËÎêxÒ¬3—¹c,#%ÓH‹Ø7>P5¨„¤eê„Æ›Ji0q¡¤+kkDòÏp²Õ}$@Žªõ+OÚ*Ž6èpñ!„åï«RK¨Ë>U¢æ·üBÍ|àþãΑIHHÛ*”æ4êæE¥Œ-Fp‡ïDÊz#–Hù”Uåüð Œ`ZSLj»ìÅ.9ë nªÔºm#O”t.ù­÷m²AKnWwš8{ Ò‚ ÑÌa£lÉ6¬gð¶T÷9X©,œ@ŒBž/[²Îé;ò/“š¡ÆF:ÝÈ#½­ ¼¬v‘”Ìž;I¼™€‡K6¬ 7Aõü”q¤PÖÈ 1Cµh2cà÷†ŒæL6Ç2ÕZpõÞH]³ú§üⶱ&ËÛ~roSk0¢¯~Iîkym‘ä»pÞnn™¿ãòr«0Iw»¿»ö6y%ƒckÏë94¤;¬Í¸Ag­¦ÄY™X« 4S ÁÑÕ¦º”›dðÊÆÈ“bÄü1Ö±ÀyNËÙSGÝLÞ}XŒ4ó.?>Ïo»/ohÍΛûâPòkŠxTð|ÿ¶ÛŠÚ‡Ù„Ú@/Z7W‹¦W‰çé ) êDó‘,Lç6°OÊk¤”Áè©I¿šŠGl¼vÈ¿ ‚XJç5·„,õ C^)ž€ÍUý©FèpÄV&é½Y(èõ¬ê÷øÚkÿÕ‰<µK4<—ÐÙŠÃØxÈÄXK.¡)Œ”äl?ñZ IöiÒ¿ SÌzÖY.H•²CÐsïö–ê@æéËé~Ešü¬IÚÇZ½aLèìXµAQÒG ­itü0l«—çÇnÔ‡¾¡œcšqÝ[ Þõ]|Ÿôi°OÔlª‡/àÓ©@µ¹Ñ½_Æ„ÍyøË GTöUÁsì"çõ'Š$]ôû/;ž¬TŠ6Ø­.¾µcšk³À7Þî–*Èn9ðÒĘހ:™6:Cü:Mç+†“-õwÒÛPör ì—ñiçªÚB¡‹Ø ê´­¨n K,MÁØ……4Ê=jòÕ²Ž£T}9¨Å *qžë艚CßAŠåèŽ ýá|š‹'¼ !é>¨ˆz-!Q¨œožÐm’y5À_úþ·}Iïp–¸ø¾ ϲg™ßh_¾0Ô£åº{?‡P+å™È'ˆ•Ûpp*´h)rÒ~ Û%œ@kjBb e&i¢t—q©`^pÁ²&&>7ã~Æ žq¨AÍ}Vç~w`Òš êåÍ÷6þcgÁ‘HöýºôeÒís°w% U*@‘pò›Eºá¤³bö÷ólسР¡rn̈"Ä™w)†í¶2yÈ*ÔèKó¦!mœ)V`5Ëþ` |äI°¹”F§'±ÆèÀë;’“\Ý”¯x©%ÔHÀßïµá3Û'Øq×#fúnªWÔó>}ÞÆåÏrû<H1r )kyѪ%o5þþ±!TÂ]ò'þx!í£ï1œ6Âaƒ/.¸4i—4DJT{Ò‘w+¶tÒíhg7öûÛ qY¹ #µËXGO«¶†`ìɯ.Qœ2«R“A§en§–Õ#˜(ÇEé;31S¿ÒŠ_ì·Uâ„TØê„åjºŒ ¾¯ùVÚGÂütüO:zqŠO<›BTàÌôñÒ¤Ž4²ûOQ+u®ýÅ41ˆ[ÍÖF‘`-Îøäï+ÛD-ÏvPÈ«nùœ”H2uÚ¨¿,g^uçÁ2d“ÌY0¥÷ 6)—ÿìv6ªö‰¨Â¦HO µ~é¸<ÐQüñ¦¢æøz¸L”pªÖRÐDN9ÇÙ¤Ä"+Ò•¹‰ÿqøb Qʉ=ê‡?ÅðçÌì4n‚hR ‰ Ëç·ž§9™ÔÍ€bë7õƒpÛ±"|Ntê[ÎÚœK"în:ëwÍgˆ)O~¾½¬å JËo´l”@ÿåM¦åqªï´ˆŽmP"µ§7e°lÎ'íƒÄ·]Êû²%3SY"qaÄ ®Ï¡×)º£,¥ÁÌbö0—hª|V} ’_5¾1ÞYnÍê§O¾«ÉjPz£%K®‹ E¡ç››ˆì0ïë4¢¦Ê™ÈË¿F÷RS;´í[æÏA•òTÉXÖž7­&:—]y½Lÿ½/?B®œ ÿö0(>>ã&¿VâbæÙü,(ÁÉ5G.§š™Eš½Ã%1ãcø :¦5 YKúéH¶?AÙƒ²w9ˆý^‡Cï#ªúq‡ªÿ,é0_šs·Ý¬ïÞ´å‡{{†ïq;Æ€ükŸ½ë¢_ä퇤!5vKØI7ÂÅ"ÝVF>«öx3ñ2!Á¢bxÄϲ¢¡ž«ú)¶3{òÓó½Ã,CŽß1î¯çüMbeaíùØ«^HDf‹AöêšwÁ4<øNÃõòœÑF<¾—±ƒ#&Ï?ja!„ <",~²œ‡¢ölÿêd†S|oM2°vÍy .`ï k¹±AtÉù-Ë5Ø«¿ú'7ÔXIã ÎöAâ÷mÚd*ö•¢õ+ßàÔ¾ñÌIh¹¿Íƒ·ë¸b™3º¨S*¼¨9¢Æž*ÌŒÜ5¹¢8,¤ß“Tæ†êrö—¼ ÅW†„o¢ã1 "G öBUäz;ñÐl˺&8¾èF§||3 þ»ªuú™\næRösòýÓÌH,硾n»ü5~þQDå!ü»UØâò±p¿Ûr$_©§ÕF#”¼Ï°¡R,[ZH·WF°ï~XIèÑ?h|[N¶ÒÖ܇èû#¤Ëæº'¢´ËîÜÉÍ~£—ôi4Û p„MFXm~o7önD:º/?¹n’rÕ Ý'Ó_¤4‰½SñÐYøžØMS²Ô?UkP²LÓ†£gRÄJ+ Ÿ[RYºFâÞÈo.Ç—³*&½þ›·d˜ì\RÉŠH¿ØÀŽ9ªpõ”Òqqš¤vï&Œ¾®.-ýÇîŒ'g|`ïjÎrh§· -Ìõ[ºÇNóñ™ª¶§^mXS}dVzóBº»²IQp0Bæ÷e”fxlÄ‘gÆØ •ï%{Ö?c@S¾­,¸ÏïöË©>|yó2¯ç’‚øÒk!{JxÐ\VzÈ¢ £¹Ìë±P!E´ 8Æ ˜ êÛ¿7ÝMýú àz`;X§ÃÛ~—½ùöfÙ—E¸~=kØî© ŒJö3¥ÉpHE2ÓÑÉèA¤´QÕêÍûÅ\»hááü¨Üþ!ø¶spz†¥`›hvãZÓ‡ :lŒÞë Ñ>€˜%± +}éÜ߈.ñ Âè¶4ž’mãҌӨ¹„ÒßZnÅ¥:A¨‰ ¯Ö]/+ Ù©8¬£Ä÷¬´ZzDô±¥—O­M—$f–åNš­ u2x?ëƒ`‹9¨ùNÉ ¡±¯` K– äåˆôEž<EìÄÉ¿·­±åq°³DÀñm=òÇúÖ›å÷!2­.¤I²éív{(ÿÞ–Ì?^Õå—#å¹p3%Ö%5E°®þf¦#Q[#Íà;¨wƦñ³»´Ý”NØêcéúçCÓyˆ9U%‡'˜ß¹œ ßJ^û`™“I8$ ´:%QèÍóQ åÒ?¬=}Ü´tÍ0úÄÏÆM)¼ß]1^îV4À£–joàâU@Ó[ªIíÇmÊà3¥·ÄŠšØÌÇ%2§—‡xÖŸ²á] ¼Í§x®å8K]VH…Ùöuï9h , pu7ȬŒ³[—9hTbc²©LÉÖc‰¡ÝõÁ…ÄŽð( 默úD)†“Ž+nzzˆ¼7c϶ܤ¦¨|±²é‡ük?Ád ö¸š(ÝiüZ ð”ã _¬!vOJQ"ù벋 ±OÎYiÌ Ja0¤UUfŠn¢âÐÇ:Té’¢á/wvò2côv[£3ÆïàÃ_ÝÈlôD¥š¶™xDQbm›œT/›é`~?—†Çã_©çEõøbÁ““¥ñ}FOTí¢ä^=÷¹§ȦÐÌò@öÊZˆ@åÝ<íÂEYëkk£ãžd‹aW‰"&k1²¶>Lñ»GZ~Æcß=Žø ä¸Á?j µIb½Û´©Y®sËaÒ.sõ³³©$AÎ_º«ûØ‘µ£_fu ››)Ç÷쵌¸+f*g¿ÀîAvq´o\ë2Üêèé¿ígÎ`Zn§´v¯}—˜xdµ°Øí½\Ã$¿¸²5¤VÓýI ÎBÎýÖ Ö5hö>ò}ãt€æQ†ùz £ÑŒÖô~Šeì3‘9JÒÒ¦³•yqÿ³†ZU@%Jm‰u™9~s¶j¾‘÷6§¯{n†Cº Lç ÁËI TýãÔ$qZ´ž¹ËdVõÀñü¡µÀoÛxzåçEÛ™oç¢.W`¤¦Q{#C Ô1x¤$GΟÅpæ®´!<3»â#1ÅÉCÌÌ?.MN õâ ó&ßRn…å#íÞaG¿÷+þ‚¿×©J+×ÐÐ؇‘ŸV·59#Zärt%Û0!ñªM>AõǤ¦xR¢ƒÆÜ:ÅR?ž¨-³}$ `ÒxúŽ¬XÁåý} ̾ö>r<4Z“[ uqÒA·’Áx…¶Ÿ‚¹ópø¦²<)¼õwèQ3´¼G%YuL:€z“”oìMžƒ«C0cºÉÏóÂXk¬[ç/¿ð$¼³GÜWpd,¦‰Mï hˆ+9®åWq!nÌÂÕä?Lâä¾ÚÕ¡yº -о•E!X»¤ylîBe-Ììïžñ’ª®BJK‡¼s+‰C:C™ÃSNŽF_¨ªK©Md‘ÜÝL‰)ë–n½Ú®Û-"£”H,­“½üá|!3DPzÍiŒéÂIò ‰±w{‡ÝN+ïZ#X×ÓP}’A¼N/¡³eÂqr+s™PÞ»±Nl!bm8ÜœÖZÒÞ£`²8ÔĈu¼Æ†€!;Jeü}}70½B± s4ì;®ô ÏkLù[G®º¼ÖœOŒ½Yå*$Ž¯ó£åJÁY)ÁkÍœ žÔÌ´„¸Ú ÃFN±] /:ƒkËjOÖ¨”ÜV3õiC ! £Ô1éS³îɲf›½j7 ã‹š¦YÒþ‰þ‘?Ôí\ Æ€oÍ­ïHÄìTw[´¼åNDT³˜=é‘$Vb˜JSu|!é‚YÅ¢õº`±ø÷­±ÝÏ©"è.\ûX¤ÓÈÄýnÀ²ì‹¸½ YpêVÌ…çq¯i€XȆá%·=G ¦Ç5÷SÓÕONÁpíþšh ù°;æ¸#ãJ¢qìc­´CŦéôËTe¸·UŽ¹Ú½|oH]¾*XìJ¸Ùrï+.enhµM”5¯¾LãL¥)ò7O=OuÍœäÜY+mÜ+äµìdÉhßxê—ˤª“™DdsáåÎÁ!ƒÃ¯ä®Ùõ ‘‰¼’$ý\rCøž‘xð55†wúÕWí$wC*ƒFÐm°úQ²ÂLhð.ºóåXA‡KÏ„° Ùâ;Ä>K'Ù¶¸-T]KR¨k.J½ö>•ØìÆqÓ;¬7éÖ1DRäÊþÏÇáåƒ&7íú@"ЈE1”ßËö³Ì* § ²s)8_jÛ0CÚŸùªÃ×ëf­âíïŸfFEb|wIØeÃboc#\Iñ}*lÚæ-çzaêõÁžåÔ´•ºÐÌb×9'Æ]³¨·:ǯì9íjÝwGÚ¸yÈÈ´ÈàgbN¨8g¢[LÏÊ>‹'ÕõÙ-\ö¬5¡Së.¢Gz±èb¹ãAFÄNÜŽ%6óz˜Âx½ÃŠ{¤MA¼3t?ËO×SÉGIÅr溓ƒ7¬µCÿ/ËW`£aTÏÝÍö*zuãd"­u ½ó²EgÔc àFÉJ¾ºQ»nËÙŸ´tì-&¼öó'ûõÀ‚;½¦¼Ö¹jú!³–)£1œ^£é÷ ‚Í+á{åvÎu0ü¢;T:У³Ô6!¥±˜mãÍ;ƒH`qÄãÎö!<Ìîh¦¯–†Cæ¢hsÔ™¶BŒ-pÍUwo.ÉlHÉŸgË0a¼Üj>­¤‘“?XÇU¥gÖAu—ìÞT‹tgùh3D¿¥]¶Â˜]e9ëÎðõÏ)½‘¤Âƒ¥sÔ¹ÊÜ­ÁÕ!½'\œiŒO‰Xƒ²z¢à€?{lP ¤+ózlÓT‹ ‰6k„ÈEE¢Þ*Èb*ðe¼<ƒÔÅYéQ¥–^÷Q»›ªÓŠjnÆýÀ\›fuîX˜ûM| þp!]Xzh»’Ä>e„¨í]÷»È4`Éëe¨±ŒÂ"x^ÿšàš¹Þ~KI¶õÕ'\Ÿ I\/õìŸÿÔ~ nuÓÃ2RM€Â‹Žç©Ì»)©J‹÷º¨£€C )Ý?pòº’ÓÌ,ÝÖRådhY¦µF§ÂHýÊ“+.w#ƒ¥.øЋ6˜¯œÁbŒ);Jìd‰õÃî¥ÅˆRæ=~ú ³ýÐN5‡ |‡%ŠÓ¸Y†‰³ð‡ç¤£sÿÀê#Ã:Zr]m¨…2¤Ébù¹A·ê¦œ€äÀÄÇs8©ðA'/€et ÑxòWÛÄ‚ffhÓB½Éy"+…äþ:?…á‚éÏóU»)„&;«ú6E¨:?âǽG¾kø¿ëGqˆÉv¥Š½V#3I•™>}–Ã[í»GÒæîût,!ÈÓjGêPpWÄ€X-ý.Á@CH }±/ ò©jĤ ŸßUX9£Ãmô÷†·V‘à©Y“åG6 )*b{qçЙ›³{-r?NÌR-ñítøϾÌÝ+ëY`“ÍëÃKm”—ð÷eï˜)â’wQ01øޯɽÐôvdÿb_jüÂ\oÃèÓîú2v"eô.\YÔ—EúŽci š‚~‘ ª)ŸãEYÓ,Èæ±+Ú·1‘6!Ü~¨øLÙ|µTV-GUNùyIÐAëüFYZØÞ8Î…†'Ê•Æxoá÷´Ï'U:>¬ú<›UÜ 6lˆ­ïSͲfƒ¹De>äP’‚M¸°Z²®òND»ªX›)‡y´—Uôµ!]‹wüB²´ÝimR ÕwáSLD“d” ¬ÅÁï8Zä(û*-ÎÍßKRvD˜d2møÒV§Ü£žÍÌ`³7ÿkÊ°¾èº|VÅRºû™vƒ Mâ5ü¹ —ˆég鋈«k©Á ]ÉwzpNÎ?†¡]÷ ±c…zÈ+$÷GIâ4ŽPŸ&œŸ}º*ṮÔÝß"ƒDæNéÔÐeãd‘`¬ëák§¹L§(ígÝ‘h®$P]öËG¼î&GÛxcU9é)‹³n¶½AË?µ$½nT½\5)ãÀªn©è˜« Q'¤›ÈF¬Û ßJ«¨'#þ¸øÝo7ò¬µ¯´—&™$îJÀÙµ÷Æé PDe3déM…ÅîRñ9}½O$¨ºâ/úñbüÆàF¹Š…i”c̾SÕÞY]'Ë6_èzžgŒÉ$@ãýâåòøˆj‹¢M 7ÅIèÖ҉ѻÛËf:ýáqÙ—Ÿ|ªE³•b«¿øž”›þ&sÒáþÇ4šo“?þÊJ¸¦•ã7œ”ÑýaoÕ«S¾ØoRA‰½…e¦ãñ öî„4ÓPîOM¬'lÓØeŒ âÄoÐ º9ʹ´îq=E/¶qí 2¾˜Æз{G³äͨ‹ìþìÚ¨p‘ÒÏçúVª~Ý™†×’z  såA’Ò&æep“þäÓdRë°Í²S:ö~­¨8ybÙ.³kSÏ¥2F!X!&Ui½£ËÛµc¬!|Únä`$õði=‹»%ÅýÌß”Lpº|ß¡Ç•”›^É>¢vªárì!Wb_HÖÁL¤Uq¤F-8®kE Š:9pxY7ªL±w~GÊŒq½ÀKåy4ðñí\$göƒoì‚…R"ŽÑþp"B†—p 7Ήַ¨èwèt&¼ÂÙeBS ê–bu¹('Rs*¿¶9 ü¶+ÒDñ‡0 ¹V’j‚Z7Ì‹‹ãSÅèï‚Ëï 6Ñ:bóîa õÂ5ν* «‡÷eüù„oÛ³ùÔA>óîE{ƒ8Ÿ…¬@“ˆj©þI]%Êš&\MsÄ#àù3¬Ç ðÖJl"®çÑËg¡¾`ÓžÇL5 ‚‹Ì4¶ŠËvd•ªÏûUÌê«Ì„ëX¡Å¡¤ÁÊìßÙ.áÎãÈæ²´w0þo^Ó€?8á  ¾ SÌôôüŠ9º”qY`!Ê¥RªîªX½?Æ~ÃÁv­^Päºqî‹»yoßíT¢b#째F<õò-:S,Zq8tó;%sÊ$GA-t¢÷°“´×O² mîÆ꘻Ʌˆ‚žî-:Éšé†É³ záXtG4á4 àÈLµ«‚_¬´ä.2„ð¬áZ’ÙukìÇ-fÙĹ“Ê>{7g·0[YÖ–Y’Ó1“¼á×þXœ™žJP}:Ñ \[-,’Çn2ñ6D4“¿H œšÊ® ÷ÖÜQ8“é’CÕ§PäJïˆ'tñ´qº…L¾áçæ¯ÐZ_† ÌÆ2µsõS»EÀ§¨‘]àToÓ(ð„|”é7F¢Éz´$“,0ëðÞœÎ{+Q'rÑ”†<÷GÌ™°¹â䜃@ÜŸHêYéöò‚~báL¹bƒ°¦e¹_>KŒ¯²µµéM^çjÀÖn+Æ’Fû\¢»×vÍÍÚÞšuäš韋sRåRnƈ¨Yß? ³Œý0‰³Ö¥â‚Žam+nẤH P¡…Jñ½1 <›-Ù+mšÇÀ…g†3MÊN¬kÇ@± Ø Ú¹Œ ¶b„«É…ÓFœþjé줋]·‹ªüÌî C¸½ôH=]X²ª#MKMÔ«S8[ NÿÚs€oZÃóÚ+‡×S-ÎÇ `/ùwÛXp=&•Ôy¸|,5žy3 }Iuñ˜?œRòÏÜV€‡MŸ7¸<–’î[Ÿ—vU{Â÷véö‘_Oi«ü-Eºð¶ŽÑj<©jÍ~8à,þ^YñMìSóW@!ÆA¶ØkJwþUg ЕÿQ¸ã×ð uã±Jì’-µ=$$õ]~ËçËAæë(V¹X)£—ÈT“^Äg D¼Ù8jâ»4,Mí%Dˆ‰º5V)L’ßJˆ'ÍñþœçnCÐÓÖ›)ψ黟¾¦¦ºL…K['Ÿæ÷±÷Í1˜ök\#™uz¬jag°%zQ~Ó½è™3¨¼;?…¥­ ±í9mo·Ö2ÛßKawLÔHÆú“€QÜù¢A»*P¬Ø›ì£u^Ktõ« í6©È2‰aV¡á)À¤ást*Ð’«t1~\8(ŒE6àBë‹£/&AŽÐZ“㬜px…ªäjÙ@G”ì–Ú@ð¡°¨döîÍrFÚ7HLþ}qûye¶8]”A«¢êBÖ? ü”ù ‡uª”–Äóô<&­h´Ö!wÑË…šSx~ej5ÆÖ¨|…ÕKqœ„IËåWõ˜9d—Ê©[¥ ç9 º’Rž~Z ÅÜÒ9­œ!éLÅz0`YñÎ'µ3#vf—OŠ‹=CÅD²ßrD¹‚q7ÚE´ï»<˜ò³šÙgÎs_ 4õ­5+äDòLŽ_â¹ –ñdJjÊ«¡hû{w3ò|Ïú+ÝSýÝ ¯ÏJ«¤Ü×faFiÇÎQŸ´„P'"iùú¾Ü-‡éS‚¡Ú¬âýü«SGo÷f!8<‚äÛΟ˜T¨Ú£F©uàBu˶wõg¼º9ìrB†0O2B«är!ì5¨¤¯,äH•fÑ&”s£Ä„,§ 6mä´Ñ”§—ë0z£Y€dô­Æð9M®oµÑ1Ä‹ýƒ$Ð~Ô#ß{9š â£òPôH¥LýîƒfvVsœé€þ­<•ë¯ƒ#µCA±óö?‰v[PXFGÕb\œû”v˜»ß²†­}ñ[zëÒL:Q>¦E‰OšÀÔÉÙè\„wL;²úmA9O'åQð|ìñ])Upî ü\š‡öÝ·voãx½‹¦ B³üÅN`8ÓñÚòíð›dÛvŒÔ}Wñr.ÃVèGˆeßÈ*^:_ßؘ3bŠ0Þ):×JMKSÍž_|¬Û™±ì‰td{OÑ©ú/#;:]_OÍÌ¥Ó³¬ðö ¶HŒÛè_9›ÆqÅš£¥¦¯g=ŸG(Wn³0[XL!•µ½•Cw7å'“t7~XÅß«BÎŽg°Á6MôÅô)¶cR9FÁ„?h왋Öa4u¹ ¿„Ñöj’UF|C/Åç—´o•¨¸˜íŠÜ·1ë…¡ƒ¯=PdcQjOfSÓ“àÛ …’qFCÙd/dhlFO1¯ eÑð¿’I˜µ³ œ™0tc~WÝg¢Ì‘o[?ŽÚ]XYºµ{7BÌ­IØ5˜TÆÇÛã`ó$hi h ñBîâzWÔn¸5¶úy¿KVœèy •Hõ쳦1!Sé€JiÁÖ==6Sa!“Јã#]£ZEÛ˜À:P˜‚ã€ÆÐËÕ*áÍ­·×<í¿^ßJ-@t8›œ˜iÉÆ‹SomþâªúþH½Ñ«RÇž ³ gÖà)ÉÓ|z*Vn³?Ù¦¬n`x¶ü{=?@êGçÁ|­ÿ„;ç9ça“¢–è.˜Ä‘û‹ÅôÒEB4YÕÒgt:ÎwéQ#z9« LCEÑBdEò`–uWH)Agm¡U±ªÑ‰ž‰ªD]$3Íô4o, Øü‰lß/D³‹Æ=p|"õS>hŽ¡ÑPâ+AùȜؔpâé"ÝüJÉÓµäѦµêÞ«€žã‚•h¼óûô±Ï9È0–|4ÃgRôˆ1g44åÝo™!U€Ùt Ú Ú7µŒø óÄÛ[š¬8t>htï¥uÕðe:r`bÐ2 莼ºèBì¬øãhïüÜL}RàwA'Ï~¿vçà•¶^vƒ•ûBì–ÇuPbýUoµó®€¯óÍ­ žï¸*|u*«„É»{tL§Š×8_è½µl컚ˆk9_uzÁˆCO¡${."Iërô°Ý$¼sÀÿÊ ˆjøMVî_FCÔÄhz©-ƒ þç1ò›ŒmÊ®'XFE!S’›õ$wÖNG^²&†^ XJóÖdå'mF»E›´&Ðwèºjð C$£õ%ð€|íW?D¬›÷D†V<)l£´|N£œˆ"³“5NƒÙ+ÊD:JÏZØšAì^ð &j]ÁMÜNÏbتONÐ:Ð.õ->¯Àp$YWTªjÓ{¥%¥ ¤Œ½ÊÜqFATu7ɪŠQ‡õ¨K_=We e 6æÁD8w¾ðº?ÑUöôVÈÁ8sGjã#<¶ŠR( A%ÿÁU®ŽÔ(oIÙ"ÞËSœ¦§yaG¼b¤vÁk€~* &î×M6×rkñ”4AP$àfNž½C0rÉM97®E¥i ½hÓ÷sªƒ`Ãq‰5Cå†Ë³g/ Ïy_2+„º,ƒ57¢èR”Lg»?I#­ÂàžD¡§±ã_ªäWª@$«‹\,ì=±Ÿ€^0š‹ã“è ÔÓk4F$É>Ô¹J´O‡û°µ°Œ¿íໜ'ñp).¾{bá;#v_Tý¨¶÷Nµ*£6Øõb’Ì S‡r®ÝÎMÑü=šãkÛhпŠ…Í}4Ár_UiÊ™V4áµòaèÒ£eæ‚ç§m9GgÁôÄàºê´Œ½}ק,=-,J },H—9ÁÉv¨ÊЬ@++ KÍÅçÒL¸!íùå©‹µ¨òT?Ž „ŠÎÚ[i•H-?Jë94=ÿöC©¡Uàà,GêW SÎfNþ°ÃãOö ¦ÕøÁ¼v*ÎÞÔcÓD™8œ݃Þí\zÜÀgÚ›@Þ?¯X<­@(ó×™o‡R´‘8t6©¾¯Ïé›ÐiÉ¡$䓳#‚€Ò ® Œ 6v¸cªú¿VP¯†Ë-†zâ‘>}c¹£ýO·nóÄÓ%ļ8ôÓ‘¹ÐçÜæ¢sĵ1MZBåM¡ ëü{Õ³Dœ»óéÕ º^`£Äw=$[Û½‚Çfív;€ºƒ%¾0=–JW‘Žç DQ O+ÁðÁw4çå•.QYpŠ±]”eLN)ïlNjÔ!TíÒºB¶ƒÆÍËÇÄÞDzA°Zn'å¹ô‘Þ×Ò客\—Ûή(íÀ v»}žLO˜ò#ç²¢pþ¼Ž?È_Ï@佄·¥òá1¨ýGÄ·¦‘éÖ.ž+>+°T®YuNñÍ8‘hñ áQÈ‹@oEªtº$xQËØ ÖOÑäßá’¨?Ï~ülëM¹*|—nÅyã7¬q_®b6Í^%Š5×üŒ`ÌLk¯”%ò@ì“L¼š%² Ã2­f8_BX —ˆ¤[bw*ïi†:d=Uû7ØG‰âù"­!2a iñ¯wIîøT¡ViæÒñ9ˆòÄÁŠƒè)ÅN+u?D™‹_ˆÅÎOü ÷£Ϻp ³Ž+#&³ƒ8óŽŽDý¡ ±Q$±\N’ý™›‰ §9Õ§—KµcgB'íºµ£P>_jT1-eER\àïdÚÑüDÄŸª8öÃd¹uw§@øÎ 3S–%<;ûJXsŠÀN é‘Z^äÙ–o~ž!-ê•Ú†ùvIkMsÁ!'>†F¢c²b^ý¼Ìi 8FPÇ¿§/p]…zY…i|±ú¥ ¥lF— »Ñz@QM)2Uºa¹\GU¢ Prd‡ª@,%wÛnz;B«yçÑ‚¥¹¥­¸,ª0• ¨{¿xŒ¤is$r01®F&);š¼Ûž×¹´ÞÞE0[…<Ìï'üu‰cxÃ6E4å¢àzyZÏ"iï< ¿aÝCυцkÐ7‘j‘צ“±¦Û?@¾$¤>zä3X÷G,û&†(!Ö|_Ddkk†8É&ª¨6× ã¦‹¦¬Ü¯.(–ÈãÁîq<ø¡š»C¼ÉÚ¶\iq¥@é27ê åàêGݴ˘^ý•¬?m©Ù£1ÒSœ¯nú;Ò•¥ SUÏ¿·4bDO‡ÿ|mb…{iv ¶v‰WÚF<{?ó:3AGM¥óy'a=–Œþµ:c—’ðs@û/ÅÐâ*€V…Ñ1Þïé9]Gö¼/ž…áXY·°Šì•’mÙ„0Ž·÷R¬°ŸOSÔ…ú&£´Œ¨‚Néöâ3_øøÞ½«Èc5oHsN5£<Ž¾ÆË7€‹”kyVþÿŠè¾=“:—õ:=µ¿<¾¡íÁÄ@ø•Moe•|›_!ù<¢ÁjeÜðRÊä=e¨ƒ ÜRŸÒlžó²¿NjÖÌ…æ¸N8ÛB†3ùâÅXÂÉ||«P]ÐÆqÉ]ÈÕÿs±Ódƒ秇 ©`ûžŒáyâCCƒ±‚AWØ°zp66Ù.AûÕQQð¯ÅðGYÁÅåÜ; †xí•Sé1¤5^3ù/tͺ̉Ü kцz϶ƒI$ÛÃÅgHµ”+NrûŸ¶ŽÖå­~úS†"~W/äi` 2¯:/ÖñÖ¡SÊ;âgò@øiÀWwñþ3›.™²…ç‡P-B甯Bâh¾R»>rZcH ½;XbŸV)ÑXÓ‘3½vÀ‹æt1%yˆJ8Z5ëX0O¼Zô#àз+,b»ë»D‚­–ùSŽ‘Ø“Bã,EÙ¥ÒeÙšÉ~R —…‰¸öÉÇeG<ôþõ‘‚Ûˆz6€øÝî‡G0>ùm9oðÔ=AÂÃDí‰7bµY½&VÕügRÞÎl”V\3— ÛAö-ÄHZÕÇŽ–à’Ê„éÀäïýJŒPšG9 ‘íi½ÝÛºï‡Éøš&Lª‡ ¶Žn:lnxãòO•ñõÊš£oÜáײjE2ÝÂöà #¿°‘zyÖË„Áâ*E-ü5z\.pc#qóy•åÅ=Àøâ!èŒÁØûD­ÏFñ˜Kñ@J)á ×HÈ ýü";«4Ó¿š›n·¥Œt1¿¸2«gïà[ÚÃYžñêÙÀZ„nu±øÞò,#¯öm kr%“E§_hÙn¨O¿­6ê+\è7<~–Ô{žŒØN2nÄ5¨Ÿ»«Û$°~Ý_0Ëßd;™”14Ø)–²ÅhäþßI–X§„d{ZBM¿¹‘®»8\½i«» Ñ C M·`ÕN×~Hô7JjUê–ÐOÈb²IïÂøéâ9;…7©?ͪðg³—•¹dœzdÓ¥!\GâÏsœÒ™KÂw³02V(^;pëÏÉ“ºTŠE[ØuU&ŸosfÒCòhàÞ?Ÿ×¾ø2è@rF ²_y€`BFšèN%mÖÕóï!)7„÷ë\Œˆfº°Á韣‰ú7„¶§ä—ÁÉHBýNPUBéd¯q•b ¡Ú0:Êßb¿I1„ø—Xnµ5‚î;UÌNª¦„©ed0fš™ ΦÁ}Íj»§ëÙÞ$äÞ8>ºz ×seͶjÁ~Ffë3(!ä>ñ-!—*ѨŽ»¾Ì]Ÿ¼wçb÷ ë&¤ìÛ4SÃGåÖù³C¦†÷ǦPŽÎ‹­–µKí¹½ã݉?ˆôĘ(möò €… ãKU\½—bÑJÊMÚÙŒìäï‰o!¼ØSaÊ<׿Æ[ÛmV: ýÙ ´xÃigvì~ÉÖECZ ™ ÅPåÓŸ³Ül¬ ëPD$aBÌàô|áIw”LÁê–,M§yBD ´ÈË Ý×€Wà}´‹ z†Û„ðŽ2ö(êä€[é.v<Otð}Ò‡AÖçjï–‚†oreb3J—%ÂE1½ûnsÃX9ld4ûð±S8¤D›™¡_@b‘ÝÕ ;ô 2¢(c•þ»ñ(Î6Ÿ‘Ê*ÝI>sÎg0Ü’äpÅqቌUEršde¦¹³y½¹¸ÇÀU§tßi8Ã?Á)GG¿ljŸô°%ðL’Л:•n"¿Z#’£,¤ý ݦlé¦sÅ9Y’ë½#ÁÑò+ÄV[Àe’%bϳ*Š¶÷K¡Ì7Hl$"šv©‡m Ù£2EH]XŽÜKÊPƒ(’rbÞ‡bæò›ó!OÿPuØtr9M-xn…ÇÛ ˆ/@©žG;9õcÉFL4S%±/¿a¨ì“WOÝñ‚ª–Þp[ÇxÄã %ëÀÅ !;P¹lÔÜc|Ÿ”…&Po¹7À7ÂûZ)]½šC$IS¬æÄU?Öšá¤?ø»ªŸ–ðëLä&“-¸éµÔ£ôïÈFtüs²ÑÝ0`þ¹ñãlœËì ”ue ⮎sd+ÜÌ'ŽClÈu¢8ö‡e4‹øXæ•ØëP-º/QïàufÚëûªTó"Ô6ªõÖö¢/åP)PíÌjl§C©ÄN òÛ³Þ#¸Ób`dÇ‘8íé¶#W9L`|½ú49• ÿéLŠkþ!|$! À…Bàù’ËîT½<ÌŒ}.Ø?ż0ææ!(·/fÔþénóùákÖE0þ‰{tõ åN…òõ7æoéÅèP!Yg΄•M#^iä½™5u#7(y)'· ¡7þORV9å\:\`s‹ú_ŒƒœÎ÷‡ÃðÆÁŽ¡(5žäÇ´\W)‚Ú8†Ûá¨òF»^gNn ÓZ• ÿH¶I'¦ |F ×è¿¥'É®ºHd\"ÐÆÁ$~X&æ*¡4:N“ª-¹1gÇ »¯iÐ.õà‰ýþÇL§E¶ª¢I“ªóZC ·liýôj/ÑYz1LªÊÃö%ƒÛ§°L›ÐÙý+Z k)b‘‡Ð~;^ùûS¦#jI–I´ÇÀ) iêW{æçÏ K%BíL´Í^ø œÓE5æNézþ’uÃ-ð½‡ìY¨¤·¤o¹6¾þúÀñÝÚ¾V|àCÐÕJËØ &E³«„&Þ@îÍqþæÏá`Õ"É^o‡¥Ø§Ø½ŒüM†!'GN;{%xVžªóÁ± Öñn¸4S9¦'i½í¦§Uüô’Ù¡Î!·GI@¸“­¾Åª ¹ÈBl†ùJ5%V²_f„fͱ‘h3‰ÑOýæ·Ú²,k|+ ³KÛŽ6|ˆ9³6Þ¾;þ§Ÿ7ÉXîË; ²õ(¹ÏÔ°&’23âZ‘ñÅñ¦M‰Ènà^ZCóQüº_d5ü8.õ݃ÁÿP2±¸õ‚Êvì2Æ 1W0e~ûöã?²ÂH¿Ì‹Êg.‘ý"ʺ˜0R Ÿ+ÙÚq²ÒÜ_Ê‘ì4êg Æè¹¾×I&<€ðÛ‰[bÏdÉbã…°~‡ÆàPu]ÖÈrÛ âË&½po:ÿ:·Eð„gŠîãáê\Œ c|¤ŒG¤ÓE¶8æ×­Ì⣠Öøm½XæíõÖ±ÍbÎ)7N¼©JœåJ0·ƒáë_ççÑó5 K#ž @Z ì·5òsuŽxÞˆ&xvJç7%_{oX?4óYZáPv±ŠÁ³ê{Ê/»9¹®ö†ÖkÅ ÅÆÂχT\âÉ‘­PSC2âzL軋ÄU|xɆ]6",µØâÆRPS‰ºžC¦çÌtýâwþêËûpqòTfQì}æÇô#Bþ7æ®gŽêvž~þ›Ãþ^TåYñæžKTöaáLÊ´/IqN9k²G§ò`¾q‚2ÁàÕ“yë• ÈÖÔæ_tÂb öÜY$E%‘«¿yU+¾Ìî!ÿ UîÖ´á¾ã2{d}**æy94“žd—­<»÷OlkãŸÙ‰zúVîŽ[4q¤,)ªì‘ë³DR¼<òÓ3¼äœÒ%²*Àó¶ØÌÄaÔ3ë·†Ÿ8è£Ð;RøŸYî¢c[åš,(SþÔ~üƒ)Ž~T²/Œ¿×Ùõl•÷ÿÀ÷´|Ä­æ!·bKûUZÅ˱BD¥à¹‹‹BÐs„3—iNe´Þ2âý²|:”¯é`ÄCä–néL ô–á9ð^›çbV9¯ ¶eð„]¢ø,cSmåw!|¾š¬ßÚ©šòS{¿¸ä‡Ÿ§GŽÑ\ˆ±â°;Ô°ÄuΤîqC<ĺº" pXÀýx†žDR=ÎB•Á¢—Œ>׌ýúÿ¿‚ }òâ†îJWÐÆÊ5‡i•l¶}ØšôôÈŠŽ93Æ,2×T{™ ñ¬N›×™’¤¯íc¥€Jþ#fQ“××t¦ù/a´‘lYh}¥/ÓNô#ýN ­á—5lç®{åFt^ïüîW6äø/¾ˆàÔ»åŽÎhy¿Cú22ñ-¤æ|„tJ O'©‡¿ ÌI‰%¶ºÜp4ÇË}f‹Âs¿×S§ŽÈè@Y=œUãªa3ºQ;µdÉû¢åšhõ˜[‘‹Pˆ8ì€ÄÓª úží–÷ë>à¢|)~‡t0¦m쿉=Å–m¤+M$]WaeDçÎì´Šº£ÚGM®RO\–kcˆŠ“Jr€»ú”‰ô™³%ħJeP¼sls2÷ˆ‚YD·ô0¼{$v‹ÇN¢`?í½t¢E&žê…+¥åÆã(÷‡ŠyB2Füú·ö}âóhaZIº17¯xë(ö”ˆMhÐä\ë»”/IÈf¸¡µ;îRŸ, ýq?_žÓ8rƒ %èrÕ†š6+¨Ðàyw0@ëFÏú‚ìòy?S’ð„P²+_„ÜcLCß-¥¥´|Á Òà—˜¡gæ¼emE!›Aœ—Ð?¥G&Ù’‘`ÏÂô®þË@{³zU#äð(¸BëØ6"O¹†¶¦Du¥—Í_²ü{®t§Ùc`ÏÚYâUÝ fª=)C¹fb$#ú+,\Õ›AfÒ» B,˜ÎULé?x7Ÿ~l‹ßÖw¯%¯©.6«-Kor+³•À‡`]aDe( :ÄG¼ì¶¹Z[:q§~ðÔK°£ïu|ˆB2úØ×¢à…칡ýÀlq¦Ìå<.Žiê+Ú,¨¡3Ã8†ƒ5äm™”jàU4þÆj©' …5Ò#ÍVGç2JØ`*Áú¼.é98ts'úø4o#j;ËtLïª-÷CA­Ó-ß(Æ ð¸â¦n72‹æÛ’¬«Î èÑòÃüËW¼¡Þ^`,’ˆƒx¾2~ÁÊPó‚ß3ÀI¤c÷F:-ã‰g œ7¢ö”›‰Ÿ›FÆXtùT¢¸Þ´‰£bT/üN„å½0ÍZB¸àPä$`G¯t•A÷”šl}š¡uYÍEé2/I/âÔi¨HkvtþÇå׌T÷à$'{³Y.&è=sïàQ·>ì-[5¦3HÐO˜I)riLƒîJàà:ýv­ özëærVïzDzáTä8 Af™ô—’'é! ¼ml‚»ä‡GJ¦ø¥³dû£¸l‹¬5€9G4¨«w{_D¿í\ôË›Œ¦¹ž?”£5?Ü<â3Åy²Êê”õI´bMhïÑú³ÒB \¾s·ô§ “âÖÁ ñ{:«XÙ¡`JnäWuz‘ù‰‚³áã7<‰š­¡r!T¤'>i>óù¹TÁ`ÝE ׄ¬åçO,–qâÊÔ5R¾,™Êã Є¡ªu†‹*÷ÞŒtcÒb“'´²Ñç3kKî?ÑCžª#1æ¢ÚÔV`NÇ׉@mƒ›K ¶¢pã²âsËð É¹U»Ï9æû÷6ñ>çYÅ”æm{Á…3Àá1QP悬ý~e8(€itËlb¤¢8He/3†Swsù»îX «[Çãe­¬Ý]#‹?jêÒBÄ'Ò$ _Ü)fq0îÏmbÍ;Jn›uE“«[·Æ¢Ôj‹bœØDÈS?;ÉHRpRò^þ¨ÀM•#TõtA*JµLüyÓƒóØpA™»ÍÜÚ游oÅn›JÎç±1s ìû¯PJé—jF?êÔ …š¶Z° Vâ§ö¾ûu„J¢9Ò „¦uCQgÑ{eÉ7ïyá÷2\:)ì"$.žì>M:’cçkÝ›­ aÛ—Æn6xE8w¯ÊübˆÔ›k31Û èéá”jX>ÚÊ×\™«+ª@ý "¸olŒcÌ=3gc6dg€¯^Œ“š:'Rªlù—Ë{ÖêR=nkMbco>^vxô– ºGO[V‚R *b&C סH¾q[`‹íJÇöŒÁ+¸Be…7t Âð»OÌŽ8Ë86¥øcÚ†‹/SŽÁ„  ]”𣠞K2q+NðÅã è|ÕVG¾RˆÚ·R„TpI¥ä„« 9¨û„(c¼áÞ®"ŸG]‘Š4·Å’=Ðv«ã*@tS™^êqþ K‚šˆÅ§† *ìˆt6ÐQŠyãƒ@²Õ3Èœ¥Àl‰›h“à=ñÃÄ Wég¾ÜOØMît,6Áqpãî|A6â„n}óO[¿æÆ€Ç< ÓbtɦÀ>„èw5¡K©À‚ÎM¤†?Û ôŽ‹’$gOðuØÝþèU8S@¿¡oÚOÐVC±â8èk9Š¬Ÿ”‰‘ÌGÎtdƒtæ½c[V?ˆýuÓRñ© ªÙJI Ak7÷—µk°"9m*ñIËc¢ÙSn/EEÞ«»$õQ™¾‹ ê–tï:ÁLj³6°pNVPP&^ðOCõzî'õû™'«»ÆÖXð@Źv&ºîIáæI…±Á€kE&Q‡-³ CÑîx€Zµ.Eñ Ðe–ÙvA‹WVþôsÔá66Q›V¡»³|ˆ‚/€ Øá÷>Ù?Îý}±êÎ'Ò­>f ‡‘$vpåžËìÑð¶ƒéF1¸Áª±nÚ|ìçÚ‰TÀŒ: žŸi›3°±J9òËÚ Õl<ÛV›¤3Ȥļd§Bd§¨ó ŒGÓàü4W–#©z,F‡·n-N¿± Ìñ¢4”j烚õË{V¿ Ü~ Ûí6X\¶çñ¢Ðû䘆rÃU½µ`Q¼6 ¼ùíò"f²ž[_g²0’êF8ÿøUç‡g¼/E;Ýãc!ØJ 5åÙî}ÉE ü–8v?þÈÆÒ‰MjžÐž´³ÐTrÙý| hþ´UT“'ø® Ïõœ¯8ñ^TPÓC¢˜>O6;б¹Z¤—^•dy4dböfWw„ųFßJ$XÝCÕ«N'·öÀ¬Tn·«FˆpcÃ^M žRM2÷(o#:ú šZ_<‚¾âÕ†¹E6~ˆ$P™Œ ý$Æ6t,¶oÙµÞeeÒ•-­ ) ÛžÂIœ¦œfÛœü ä/ _V\P†Ç „H"Š?`3ššÊ)ÕîKmãßÒ4!0j™Òφ!l{r“N* d;ÏH:X@ç„Su[ŠøÄtóÄø SñÜÎ ¿h’aEž$tåM´7ïL¥+lÃõFWp…ãç4•,¶©Æ2}ƒ¥¸¬Jþ-RõÂb/Œ„1Ò¦Ê#üÔ(ì÷¸A¯w˜µ‡¼€ žìfßÍmwqÂZvø÷w4åÖ¯MSƒŸ^4†ŒA“øŽBa¥t# ©YäšlL.$×C‘y9H¯ñx É¥1W#'Ãmx&ê5¶f„YPUŽj†YrÝ{€wX‡ÃÎ,rŸ„D6TÜa…2}—èA,<î mˆXQÃAª\ßYsH€Í[í› ëHåß^×fpoë6‡3ü7ôÔ®ƒ¢&öYV–É,Ý«*Ï“­R Ë·Þ›ÝÛ*O-®æ™Äò×R5Ì€…£ùžÞ|‘ù”;=ÖþÐ*]'‚Ò^5ÖÙÀâÏ»{ )-ÏÓ90{ô@–‡zõ=$¦ j˜YÙw«Š¯YN+”:D_DqÞ§¬ Ze©” ‰â¥sÀ­*±Ý¤ „ EQ݉“P"l‰‘Š±ÿ˳"ÿšæŽ°¨5;?3å??S· %&ÐäcŸ¸ª‰aZÂ^ ”Ü?#2üuàŒA§»ùGAÿn«¸/`ÛF¾QEwSôV„¨'Ó1ûzVsg@‘xà'ÏÛÜ}“±ŸÇ>ô‹©WLé[EcNÍd;5Z/ÿDIªÅŒýÌÑ•R m®¿Bæñ!ɦ+€÷„‰céÙ&ðÚˆBìèʯ̣([8UŒýv0°]JòÓe^š^¥zKý÷]¼¨¬Á(X­µS³¤j ˜RJ¶àØùYAŽµ?Ù¬"Q’);ËÔ?lJ8ÏÞŒ¬Õ=–Ãak"˜>Pý^ô¡0A#ÜæüXѹfn÷Yk“Ä÷‰†HÁ{®­çϨavÁÇÖí¬$´mVØeèô$p4vd"Xâ¨Ëf¥Ô:¹˜2m sƶÌØOÜ>Ö4€ÏM/r¬OÂPùÙý=}÷LÚ>ølpëÍwTÅ$ ‹µ~a˜ÅzrîúožÕCý1 {‰J{ endstream endobj 1691 0 obj << /Length1 1647 /Length2 15840 /Length3 0 /Length 16684 /Filter /FlateDecode >> stream xÚ¬¸ctem·&ÛvvlÛ¶mg§bÛ¶+fŶm«bUR±“¯ž÷íÓ§ÇùºÿtŸ{uÏkò¾æœcEA¢¬Æ bî` ”t°we`adæ(ZÙ™º¹¨:Ø):ðÈ3¨¿¹É¸šØþbpbÎ@W+{qW /@ hšXY,<<×Kò»ºœÌšG¿¦TT Kß¡g:Ùœa®ŸhÈÜ‹0È‘¾›¥7Äcv¡4 ÕŸ_P&Ÿ>=R Ž ÷Þ@öâÓåÅÃRð™`O='Iqõ2v¾o4û„|uçrƒ÷@ôAÏüp# ´'Ípûé½ðÂ@ÝYv<£/šîÒ¸nÙÄì}=ro)&@'}Ïâò ”¬'‹3 »ýƒr8À÷€ÌLºC'«‘Õí®ðи–†è+ÉDÍ–u)ãykR e¢ÍnÙÊ'¹A­ºI˜ ¯ö(ê¦ÒrꇑT˜»ê:5R8×K\× ×ßXb/A•xú–U4¾‹åq*]ê«0ª> ÆjBæ˜ÿzFúxé,ªZ«fÁ$xþs³ˆ¹´Êz=æÖû½Á’KúûŒ*Fz!ú‚ŸáL5¨ïè ÓS+KKm‘¸é]ï‰ØN7NEÞç\h 'ØUr?­ð[ªÊýÑ„V\ìŸÚÒ_°(ËýD‰ú¹{ùÊLÁÒwFìs±6AÓªFlìÆÙÕàõ0ùJsZ…tÜËHÄïÆcðÒíK`¤‹Ö x?Æ0¢Kü±ôZq0Ùwát|¦ _âWÄ?ya‹ðëqz;›"É(^„ðkém9šbüÊE‡Ê«- ½J_ëøêfReณ¡J#ÂÉFÀâç4ì‰8ÓÕ[9¦[n>•ì¾ï§R/‹ž±ê¯íƒñ»w\e”$ðº9-AóRð@äÁ[¢~Ÿ¨Tš¼žEkV[{×ÑŽN¢Võ{5äÎÌ”P(¬ qG·Ë~ÿqc‹T@{^HLwdWÓT/ÖëIÜŒ‰§@žØ[´ÄÃóT ßÂÃ[ÁD[Gducî6$®vj[õÔÈaxÕ໩ÖÉc1pùmd˜ÿiìÈÙ9H:·.„…š@2Ï÷²lúZQÂ7°"i¼â&ÇÉs¹Ý†袠ÎÞŽÞ©uujqCÞͱ,k4¿ÞÛýÎÊ—é_£ìèëk :#¡z_¯ ögÝ©¢!7t; éÒëO÷(¾‹ÿ´¬qaÆx?A7Ú ˜‘›%¡À¢ù ›/%uôq]ÕW$8a/f#p«è7RÃå÷åÒˆq* Æ…’êjÃ^‡iäÊã= êj*äŸE/²+eê`âmW£!il«Ú&ù•lôw\î:;¼¥x˜8)ÉŽÖ$gØÄGoäà>¢­ñdÁ(6ø]½npÍú1Ò#$ù5?-¯&89We¨+O/V.ÜÖ%lhûaÏÝ “ ÈTŠÏ¸ûD|Q†yÓ\Þý<¬/½T?Ç:–¬e±ãáï_å‰(„\ù9fÛpªy¸íw~ØÛ.϶ÀYª7ÿFêÐÀÖr˜‰ÿ4q2AÒȶñ3aÛQŸÙ¨¬²°‘žéñJî“F&Ëg›94”ñ42RÙiеŽø” ÿ¦˜9 ˆ3åv*Í@6´¤È@¨Ò\ú|nöˆ¡Šû2b2åî9Á§ÉËPÎåEû‘¾ RZ¿™+/(ô­Rö˜ë1Hd‘Q: íeŒ5ƒœ…ñ†jV&„AH6~ÅÛÜ- ªEÏ”í±B•Vì¸3 ’Õ.Mî xç]¡Ù•1ó˜lïvUw%ê0æ‹%Y6¥ëÔ{@Ÿaᨺ³˜Ó2{°Kϧþ‚¯Â¬s?Ýò‹2!»k,œ ûEÉ{ôNve#Ë€} 9hÉŽd¼ÂdªûNØ ú| q¢ôyxK槷 ‹`w1ÆfÅ ‹¾¿šJƘdÔt™EF“¾"ðˆËÏ̃kÊ݇PXóØ£ažT|ÔòƒqЮõe[ o ¼ú¡ŠÞÈHø:a÷¹cª¢í‘ÄÂd°:V†MlÄ\”Ü´Œ8§£îÒœczcȈÖn™ K$ ÃÚ}ú´àÉœ­ÉÉÀÍ" ཪæ+†¬×¶IŽr0K!vyô'}ìƒ$Ó0õî;11 %ûr‘Ô•BXP/£ýZYêl&e^̉´æÌ7H»êÀ(ÿR¤Fʬ a$(ª‡4Ò.,ãEõ¯ ï•Þ²¥>ˆ<¿` 5™õ,cÁF;ºPÓÇ>ŸÊöûýœT.”lN-ª .ão°á9OÕ½#fe uÈœG¸ngš»*KHlÓã{Ê×VþÐ÷Hhîuû.»P4ËÆm½dÎPÊŠú÷÷’ÍHün"‚äp¹üÜËlÊ}Î^~±”½îV’mÓ)Ì Ñ¯ðñcGœæ4õ ¢ƒ@kÒÎœn¥5 ÒÐõ)ÿ#bZTEˆ¸ÂUüiÕ;{-»¶B%öòºü±kç„Ð<û¢øþƒ7ã\»Ùôl*ì[=äóréž\jç òóô临”KFDUºb¶¿‹Pgíwjt0yÅÝ÷øÂiðëÜ!½Oq²ªì%©í¶„‰X‡ö‰Šñ´ðIÒ.g++ßÐŒª6„×ËêX)Nì0ÔÖµcÌ*Z¤Ì)›IJqµ`™®'š¬¨CR'Õ¡³KqIHÊE›¬½ùx5ß1û—Õc ²å°ºk¿v¹©/QZð»ÊÀczô3ŽË^”¿PôðQ0:¸¸o 8Åþ8Ü !:ã%~Ô¬eÙaÅBÚ²­¸ï÷1©@øúóÞªÅ÷/ÖÌÐtRþßç &§àÖß2yˆ<»üS…¬‡Û[ôçc8²ÑZ./"ÈWKßüƒüoeJUq2Æ1%6|TlâuCS~´'ÁTK¬7ã‰Q‚Àw\Þ«Ü“çwEÖeªÁf:M«Z½mFP0¾v ÁÀzê(-Òîlp¸ö.u^‘¶€Æ´î³È«Þ¬U 0›^ðKΰ½Ô³ ö5CÓèÒŽÒ(o•¤)€ÊcdAyOH?œçµRdD͸Ó"cn.cÁ’VÞrZXïcoàÒnú†+àtˆ‰.¦¾~ŸbšglE›œ:ÄÉú."òœiŽ„°ŸHN¯…PŒŽàŽé%c Ut¬¢îµp³€¬ÒÏx,ç™WÔ·ßiü|û ¯ÆÎ!n™È<+W›q ·6Kñר'Zä°Ø¤ùmÿ÷±­K(¬ÒÇ&]®¹¥¢r1)Èò°àõ|u¾þ—ƒªH¿â“h±CÝ@ï+"^ñ˜³9g¢ÅøŽŒÌ ÎõµÞ1Ó&šh ­nho4 ï·P¯w-2‰.º°úDý§í¼y,b>øu0†opëôÈñŸ¦.Üg7ÏVäkþ&4ëìå ¯”x_¬7RuÖyWB§1`ôÈn/¨Ô‰d<,íOçH¢„aâžT‘•>ûp ÝÂM#òw‘çíns¹ùœ˜é?|ÑÍG™´Û7ƒÚ·‰òø½+Xb8ö¿Gô^Ikÿ˜Ø/J‚²ãŸ×Ø©ª¹,ûœMñ;}bîažz@çBU¡_$·w†$Gi§2çÎ ƒûnb›ür6‡k·4\¾TÝ>³ÝrÑMÒ@‘z¤ ?8‡‰MüõîÑ~K‡òÈBäÖoQ]7|‡ÍÃ+·Çèþ™Ú ÷€l~ì¨É’Q– ;C›‚\þIpÌ+È)-ö JÜZZJ÷,üaÍÖóUêñµBÞ F$ó‡qR]"KBYuo(æÇ Ú—¥?dû"s•Zù½C†0ˆ$‡!¦ 4’¾×%sp"Ð×ÒØ´ÒŽÌZ9\0´p¯-«´š‰PÝkY%Ûµ±BýfÂê ]—Ã{@ Ç ' ë÷½œŽ™/þªÕàSˆ ®¨ƒ•®ûÛí,ÿÒsŠ¸0šGšH½ì#  ùïBæ-gB»Ô bÁÚ¸_ø#ôerueÜVªj~Ï&“z<˜ÙWÐÒ™ÒHcÛÔúZ@hJ0'°8õçþÞÝ- SBÞ*‚Ú a¨’‰ßê*ÏÑ'¶UUP+mz®ÀGi‰- Vºev7ó!3lk0²ñØ€Iá™· -™ïõYiÌP_°0çØ©Ch_Éaè.îœr•Ú»9¾Ö¤ÂuoŒ)ºïG¡Vd/QŽ;ÊœÝ9ê;v±o„ó+ñu7u¦?¢“ È.‘7¢]†¢§³Z#«ç>u™€áÖÐa3‘à•Éf¹fýBæÖ$ _B›:šoì ÁŸ2Q[õº3PØŒÛä^Ý?£[í EJïCœL­‚‚édpÀ“£­ð×Ö- rkj숳­âbüjðo·¢ï3:öUáL@þ®¹xyQS¼Ò¹áζˆV‘æE,Ý{§fð†Y[´3$ó•¯Ç˃àÒ¡hèY·iEÛìÂãìdzj¿áÊ´ÚU:ÖÊißj^~7úÄ‹ÃþÜ„*¬ÂÛnÜ!bo;[¨IS­co¶úöz÷ˆ¶ÒùàZ•ºå²`uvÜ ¶|ì!€˜?¥úžŒÇ"r)[væ³úaí¨šU¾pir âÛrƒ7õS&AØglÁÿòH æ7cüÎá=– óqŠ0ˆ¤pÈVj \\ý…<»£ ‚ֈܣÜyüjçDìB0Ç? ~;¤jÓ¢—p!Få³ljë†ü×>øÛœESíŽ(¸ôo E#Œ¬Ext9Ï£µsÒÌ›ÓPêIZ¥zñ.AÈ™ã+#°Fô— ­‹™séSã¿ôñ{<_Pk\Pwˆh®ä}ò•@W[h꺤8í9@¤Þ÷¯©ÅŸñ·§á7ËõÈh˜*äùOž¶bÞù Êé¯w+,‚>›ú”¢šñÏ4enD¶piì1V×éd°¬tf³ ëlÜÜ'–,S“-psj]­ª½6eŒco£¤5µ ¶Ð£ÞÌíJ¯YûGE¾e¬ç_Â_™íoyèG˶·.|jT%Ai¡ÒóÃæ1=6ü爇°7DÇÊ ð÷kus`bMÆ43àp÷Åv£kõã/è]M$B Jµ"ljç÷Kôå ~î2´*ȯœ©oSß+Si½â\²ÄÊ|™e›X='gÁóup“Ö|_GÙn$ò‘“Kåïç™%‡"I¸`[g»y‡LÙGÙ–¿¢F»Gk|:ÚAÆiËA– ÷_pêo—Å*#ÛçÉÖÐ|ä¾’ÊJø€ÍÛ0Ý×ÏñqZéÉ kßòo -¨–pí*ênYôRJf"駞`¤¿D'mQŽöq¶wÜE@q è°*tG(Ç%7ÜNî@;í-€ï:ó9àbý¢b Ë°óY\îº5h-ð¿ žíûms€ç`.èAŠƒcÁ¬v‚ø[1ä/ ÄÜž‰%nrªHŽâ@ëz"¥ä vòK‹Œ²>E£u[°Fa·l&Í_úY…0(K®Äíf[aJNë)ǘë¤.á­/CÑöÔ»'â|ç¬ `ƆËR¤×1Ù.KMŒ¨»r{"+Ê}M©·Ë-€&;WüÅn2¹Ü®øj¨€©$’@ø8ѧÑ)Ûûß}§°›ˆ›ØÇÚ‚µR ‡"7 ¹_r’œncž¢I_ÃÉÿ¤ÏÝ€/_(eØ=™é|.Âï`7A×Eó¹s¬3¸†Ó²‚„tÆÍýˆŠ Í°]æÝQ2—´“{Xñäx$EPs†›T%/5«·WusüÕÙâΙ—9¾ê1ÒP2/’åEOLY»c¹"ØÌ'Ì*ÊÙ´¹°^Ì~È9è>éëÍ:[å5Ð_Åèn+u9ÊYñ:{±üR5x yD¹ûèÐQ'|I¹Õ± |ÚÿÓU0¼Vû£5EdœæJˆ‚ïF$þRI݆EÓîá°äëRKyï—•{öbÖàx4àÁ\¹ý#†ãÒëü϶¥¹hÖF zg½dm¢¬þwJªÚö“ˆQDt¸Pš?¼ªîd® ÂsÚôÊTª‰Ä=!ŠL~É‘6V'CݧVíMèó"5‡Å  ñƒ`%°°¨~㬊Ù¾Ìßëïâ>XƒÀÞ+êQ7ù±¼1›'VáÚ9pÿhÖ±}ðb\ãÏÆœkBT ] ù4Éóe1çò„J 7 ûžxAQûäOKå³7¯ñ.«¤rˆÀAtˆ¼4U’8SSOΑˆPJ¬×.x¶e®u^â?¯}ñ-Ð^{{ÃbÓYÅRüàTaKÌFeÇþ¾¢åºö®`†½|&\•=⃊쎑if‹ŒLŒK*?ÜîŽ(ɉ2ô‘@Š ý™srœû$×4"ñrr ?Èo»ñ!£5ÁöxgILÞ 1%yý@æo'œ¦e#-¨E󴀬–À×î¿ô)·Ð¼­è6Úñ[&´Â n–àò$Ï7Žû#x’q¡F{çѬNeaa²$·Ë[ vº•!•ÿÕr<í½CR‹›íZÞóÊ:ÌŠùâaD¿b×èfRC §­Ö¦'¾Ð~þÑm½ÍS éKóyÐÐ]û­q}+ÜzçZß ™yp5A?rQÿ›Pi”{±UŠ5ZÉÎÈ|b\ØFu›±¦NÐ؉^†´FVêÖ&@…š9$ÙvÔÓe¥Ž”HÆ“4Äà±`壻ôM&r®XÉ›™kšøW%>+\b* âîoWÉÿyC¦Ý·¸ÔÛ(@„1>irI©Œ‰ç€mè¤xˆS[n‹n_`k>»_–Sór²q²§°Ý^LÞË: èY –á+ÅÏ£î¼lº¼37hxHŸ20[Gk*¡;Q=¢÷Äå¦sl®qP ˜;ÚFÚd³ßz¹ß–sI¸9\“Mì+NBÑÓáA˜Wdž‹†ÃqAˆí5{PHsšh~ÚàEéM5)è/Gtž+»óKPðHÅBÓ£ÃàåÌíÄi#%}KËŽ2|7ÿ ™Žð`•e(/MufYlûÌm4DW)üÙê@z&ò&ã4Óè)í#I”ã‚UŽ§¯G>Sb{¼óKõ÷)+Φh÷ÙÌT7T_ !0Âò.-«Óu|‡î|hY]¨š7<×ôÀ8³)z_A¯lÀIÃ…pJ¤©ÎÒÒöFHeAo«`ÓYìHØQœÿÆ“£¶¶(e:#n¶[[°jT;[:[Žd0;xî!ÜÁ ªð*0 Îh÷ VÕô-ôÑÔîÝõÒZƒ[„¬4×Ïÿ½+^©\©—­„Bxmv°k¬gHª¬$«ÄÁÕkýÞ«™ìj¬å³h™æO¬Ó"š÷“(²eÐdZ§y»ñ‚bø–÷÷…Iý§PtÒnÉ „‹ÀŠ·“ÚH—-¹ RÃv}j5²#aP©ŽÀ1Ûˆæôh#[ׄæYnkÈÀÑAAíçV\wj.Y°äŽÇ‘¥>-oЗ¤d£ú±IöcÁt6ÊoV‰ w²Ópƒ@[.þ&:õ³ÌÃÔ1óÌkÀ²+\ –¼¢Û (R[>ž¢Á–Ò÷œ.‰õ=ë'ÁF”€( -Èx”]Ú¬ÅìR¬ï×ý2<ì¶ßþ ›2°n[qÄúGÝŸß<펔 þh/ÃÛÃR·E·x¬±þˆ JißÚãfÈFñøçMvõ¥$ÖEŽŠ]ën¸äŒðoò?QÇ^¥2Ðù80f2Ȥ±Xf~Jào±fïAͨ#Ö}¬Ûì30ƒ£1”MUëøÒf!S£ ʦœæ]ÔZ·éÛ&J *iXœè„)~Ø!gÆZ¡ˆF0è§8ƒ#<üì‹ë´u­²lDpÍj­¼ÄöÒ +j‘ƒ×ÍÜ8šOö^=þ¢Îü©S!" Ïy¶S„ÂOQÔ—ãI¡ù0º”Œý ßë4…¯#4½šIÜ—!F•ŽÑ 7­_(;{HÃÜJÔîJžñps …c=”´¸|íS«ù\Ã8Ò^Ù)¸$<¦im*c·^Ö,š8ïó¼J¬Ÿ¬¦Cka,a4§òu~kñª!Ÿ/dÄyy'4—ÿŽ-熒{Ó½oáfË$Kqš_0"­tñ” ‚å'=¬½´ù“&v€<µš:E?E¶c³@ˆ[Lm^“D3à=1U0êÁ3p¶ÂK’´p¦ê<ëð$Mé6œïely 3Œô¦æKÞ}]fëóPôÀ};Œ OOÄgx©[Ãw­"ˆÕ›À6º[ræ%)¬ŸVÈ5-¦pR:ÜÍé# çž*ÒÅayâãÆt}'ÙÜe­ï~²§×LžW–÷í×Aû~YS 龇K;CSƒòË$ÎiC¿ó#}ê…^ëjUlšö6‘ìÜ|ÛÌÀ²‚Eóöq‹ì’=å²qíE\ ×.aÚÃÂìbt_YPÚ×í§ÁüàH÷4ú£˜—êbék4n›ÀÌtÊ2d© ŠhB&:ˆñ'Ù¯ÝÀbÓÑuTuƒÖŠ9 -Œ·z‚Žm×€2­WžÑ_“›áœ¡·Êx6ït¶¤ÞÜ¥ ¥*y§ÔµŸ‰[!@–ådƒ¬Jxx?ÅÇè/׊9_ʇEç¨K·26ýédªgaœ‰¾¢êYð·Y¨O˜ÚF>Å:/6ÞÓIpŽÔgºïž¶1U¸»ìW¤ø½žº^Å„’n¬”2eðšR‚)Ûƒ~u´ÈVt $†}ên•9ÿ½:šn6¥\´ìò Ù±}ðfâ¿Ñ¢Ù,|­§Gò.júYÂóCÃ&‡ÂÝâŠ]WÏt\Ò'Mù[aëkÁ­îGš»‘V¥ŠXlbß,J½ìÚ»·BêJG=&蜻úã©QFŸ÷ èOl|Þ”áMV‡þ•BÆ‚:³%ƒ€»¤ñ4dÙWHÿ],PÅÇÁÒ”Þ¡á»aä±íV¾ ß»/ L([“š\¾¾”ËÍôò,c‰ '}û<6×5ûWBßiÀÙô»ôÏ g¶Å‰üÆûÃ…Þ0Wâ& µœÄ»¼·¸ŽÑ7×=^$.¥RõƵûÚìv§ù$ÖD€wTñ"ÝóÊ/2Ôþ⋸ĺ‹sHå¿o™«S4a»qÌ éV‰Ë²XdïÅ3—ÜÂ.=˜?t<ìŽú­+S÷K¼ûòä½Ùxõ‘50jL´.em‘ÙEÆ%´Ó-%øú®¨)BùzÑëæt$ã–b‘ÌîR†ÆÄ້YÔ:‰,Àè&Õ|¬‘¤ïûcÊq?H\Fîn?ÏqjÅ¥i·4g²«Â¬JI~Ú²M§äŽŽ`á«6¬7\4ü>¢âŸ ëHœŒ?ªy ÓúýË`&K‹PŸ„$LòË0È!ÅÝÁ>ÜàÏ|Ü¥çWpp-÷Ž ®PÂä“N€Ü§–(T£>Ês ±ê`zøÒœ¹¦Z™Õ{÷ÜgQ¾±&mÒî-xÈŸ8‡ §–^öº¡}¦( #G7'×î÷ëC£:| UÎT$‡Ëº[“›ÙUE»~ë ) ³*è»×Éùªò :nêHU‡-Ií±Ð»Ìv.ù(Ít/jÂI9`7t¯íE1«³{Ýp6÷׃Iå`þšM úX°¤a8^â¿[¨3½ePSßØòBâSWøÕ«·G~t öø@Q½ÀcG~À=Ö™æ° ݬLROoš£@u™$aî ¶àÓ_)Õÿ g$ud –¦å§S ¼°gÃfq+¯Û~ó)z é>¯<ÚðÚß\Y“äû“ÖàZ¡4½[&+6[hÍ“1þm’|ŒÝ2–Øà¦ÉÞnEKª"p f¿* pRT=füSeq9TÃçÔ óçµñ9ÑN×Fî |„~3·Ö×: ÿÃׄº_VÃ>–áJŸkûg÷‡ŽßÏ ½5Ù*^T«núø!vG½«ÚŒ¶ß ,½çúåOŘ!ÃÔ†ÙÑ\V¨ÀòöÏ•¿t¬´•N«&Ë‘ìE›¶ÊÌ_´ƒûEÐ ÕõÎÄ:öá„)e-$exzOñe†bío ¦\Ai{Üìœ÷µw ö+Y®8A¹ÑYþ²`ÃlbžÕ¨À/B9Œ° +ýæ˜É=¦~nEB6Ê©ßs€ç2ð ¦%Ð'ÀŸ:ûaF Ä#–Zƒ²u`³V±ZNøþR|D©ô²þôãzK¡Ìç½þ¼!n»t"Aóz¬’?êwqDùÅᯜ¦bßWƒÌöÀƽ|£1&ÌU¬ì dEe·Vî±ø ³3õ9Wâ3VpU¼¯àÉþ ¯ÑÇáEÇÉ樮>"&^õf_»»´bV}w´üÅå˜Ö÷ —g…¦+\¥æmšYÉ.(^a‘³¸†˜ÓmðêW)JGAß´¯¦göPå6r÷—¯£èx}iÑ£&•Å©ŸïüäŸì´Òi;1—gGÌŠXmw¡âñ)ÀèÇ·9ºšR~kåMå°Pm(úÈÛv>h7DÕ¢/iùz›n¤¨~­Â.C. [=òX#¦ƒï¼Å"Æ-KÃÍê/ïqìHF/9É*hT¶½†qHOk§¿%¡òNÎ'ed«4Êþø’‰–UyeQ”Þ©é°ãoƒkAÏï‚Ë<ª å[ PÞ¤Z0ì 5¢hyK¦#fã»å¯¦eB$¸~Í[H¼—üfþIàÀOxG%¤ .E–]Ì–fý´õ…\åBžÕÔ üõéÇ'âÜ)Í'_í ¾½(ØU঒*'×æ\´Úâ K1= ¾ô5 ª!†1¬\3óFc¨ÌH @ïÂÙLïšÌù.¹£[z¯(þX ½ÛºTËð‹:ÞóÞ »/Tù¡½K#á0ú:«œ·ðB¦"OZ%K§m´Û’×;”s-_‘S-iÒAM€µ%êÊ#ëà¦DoéBsz:¸ˆÕHý,h8/¨µ«¾äé/ZÁ¥¯E*ÁÍÌN VÖ ñ€gGÜ×+¬T³¢ãšÖ¤»ûš¡ëµ‡ò]†}ATf$e¯RµUd›ÏÕðöq/R…2CqZËê|ÈBüº¶]¼aú ›Ù !åp”æ˺±Ô“âݲÒ+¡5ÚU(,¿yÀ¸„¿ˆÿ yÀÍ[ìÑÖ Áµãöüú‚‘oõh+èî"Ðr]ßêÔƒ!q˜.ü‰wvl53MlÈ;|,)†%»#þŽT4™â5…z†KŸ_AÜR©Â¤%©¢Ã9易!l¯­qÝeOÃÌŽ ¼?Eô¤ái¨JÝûFYM¼¹•™²V¸:ªìKÞ(1)ºq£Ñ²É¯;ªlÝi,QˆœßNBûa¢ ½JpÍ b²Â8ë“6±ûÙ¹ƒ‡Á³Ú¦ƒ¿`ã3Òªq(ûo^68øŸõÛ“/kÍÈye("wgãÑ1š}•dû4qPU*±•3]À´'²e ´k.‹U“vñÂÈ_‰ïî9‹(J`ÀþѦ'·#¼cšÍ3k4 nT(<)¹=žzD…{B¬ ‚öÏÆJp›÷Ú4Øz0ošˆPq‚½óàáflH;“Ö »ÊÖL„#zsaŒ#ÍþAë˜U6}ÐäÞwöÛ†9i;¤›šÜ?0zÍ‘NéÙ[:QLÔ‡×:†P5:sL{³ØRaÙNˆ$Øó À Œ¨ˆñ|mÙì —”“Y(I ØÿZ…*þA ß‹¤WÚ´¿åÈ `Å÷íÕ¤¤ê¨c› »…ât«ÿ,å…‹ûÞ+T&ï ÔÖV¼ª8W!SØG =“T0h0^@Ÿ+RSÉ),Âp¿‚çÅ.½ —Ò°>“:qÍ‘Øl9”èNKŽˆÜã1ûiø†¥œ, ÝÛm{70e;£¦rê/ö,ögCI‰•|% qÝt¾[ùÆÕ •lô´¿.WÉóTÓÏAðãïïºëcˆ¸§¨ƒà[%ÀñðBÿõ™Úá›$ÏñjxhI­ßËñGRª0r‘Ö´X,°ƒ[׬uÎ\_ŒÞ|qáHŒ@èôd?_×äÅg2k‚B¡Ù{ø1¥Ï«–³¿ ÉÂÔ|ïK—Þ-¤ÁI,O³u1ö¸¡yΔŽ‚ýÁò¥]äâgÊJ•þpèó'!€8Ü¥ã A+Y®*EÛ¼æÓGæ±s~5\4r8n²[V±ZnÓ™àF¡æ˜ÔXÕF‘§ßWaK Ÿº,BU[x8*ÁQ¾'7=3ȯðgaÆY ´º¯Y1Äâ¬;ÒÛPûñ5õšR!jdž!'p­ªe–ÕPTT?Îãã…`•{±*œ [©JI’Å3•üP?€ç®ù¨ÒŠÑ›žë-­@O,ÓtDUku ×2²LA4O •^¢¼¸ï£ÀT@àR!Þô“ŽÒ)8½±ÛüêE‡;.®ƒ"ÀÜÆôÏ%7 ñÝs¸è1šP¼ãùJ6À=Ï€^®,øâ“7Øf ÞÏo!ù‚½§F_ßjÏŽO‘œÐp.ë·¾±ªOЭms-Ø`ï~æóÝxZÌFÀ5½O"ù–ÊšQÌü{…ý žU¹ÖŽ©v›ŽÄGÁë÷”3Jþ±ÃÅFUä§ð¡ ½:@¸Y;¿Çˆ/ĵˆþaA§m©æz-_¤SʬÐ>l£Â.õM³íl²ú‰™ï·J`î9ëÜr|@WáŸ7aå¾o/Ä—³l!*îCå[UýxÒ¯‚Á˜l_#Êѯ¨jÂÓjž–:¼w‹M¾œÏ¡ÝV¿C¬RÄU'·Øä•_ÔcÁÒ‰„3rcë²ðÀYäµ`cì3²zò;Šñ,·™P;SÞiÞLùTÑsI•ÜYU( 4ÒLÌáìý˜™Î”–<)yqÕx^X‡8Î4d. Q£QSy’DÄž¿YæË”~’…ýþ¥{Ê%…vÿÙPÓ™0=$ÌïTìp5 §Ã†ã×Wp+(Ä@ëÈmZ ŸY(²ÎAßzϯô`‰ÿ-(xîç’™ô)©þp/;JéQÅ@íhÎúFàÿ4ZS#ò}jÞ7oåoõ…m` ¾Ã– rðIYÔÑßB\P’ùºØ^Åÿ“Ëœ+~¸xã‰Y;!YdW‰¸tb,i#hsFX<Ê($SˆWj¡E&ÝÓícNu‚-Þˆ§>^‹57ÔX²ìrås¢Ë*¤Â3ÌÎÚ§ë'ª½ŠJÕ"ÍÛꉛ ô”\âéiÐŒ–~‰$ ÷ Ù¤¦¸š¹.lkÿK÷òì¡ Ȥ€Ð¸eÀ–¿¬GŹC7b?ÿE—[…ñ J…óùÄ*.BÉË0ùWlJ¨¼LrâilÿΛ ?2Ô†“3‡¬gÃ7ª§ºã’ ç:º“ÓÚg±0!tÆuñÔ.œuH/OB  þAòh¢óqâ(ÿ#ÆÔš]Âå^xËÇo5ªÔëwð!¡þ®âÓ #K©ã¥{ë6ΗU‹&ÝÎØ}6ÝOãø[D‰ÄèÊ}[b’V —+ïÞy$…‘°8¹É9FœKwö/Âp(¢6ñ鯛»Æœ'ÏÁ@¦XÝï…ë5Ö‡š1‚6’zÇ}ÇÏ2„ Cñ ß#%k°õ–­f²ûÖD•HU2ñp•—ª©1à£37ûY±–{”´HèŽCÒŒÜÅzÌ´Že{ÕI>r4ø½ýøm细öÖuhÿ9ÝÙ¢^@¶Ý{R*~þ ¸ñ²–²Öà]Yšõ:¡ç×É)â^¾ü¹G´‡s&bŸÌ;à㪶uß—¹p¤eÍqƒµ2UûržJIjC & ºpC-@›Ã²’:FVÿÓ|Œ £@ƒd©“zæ®±0aÄ*PqtT‹äºM <¾“éÛ¨TLJûúå~_ÿ!ih"‘”yg|5Iõq>üÙ©‡üâ/1ŒÁ ñ ×ÜDƒ$¯<$`QõÓvj‚©ž¼²‹b—Ï-2üý›Gm"sþ!]4Ñ5ðBà4½ –™Ð™G˜d°[E¹ÿ==½l© ]Í´Ö¨êF-žÒ á™ÖJ¦û1¾‰ŒiídXâ¼J”h6¸sý+ˆÌ…ù—Óyƒ“½fhZœu¨’…»€‡¶iÂÑP*ùÓ;8–ðEoò{0º òÆã±î ‚×áìÝô+ÕÜ5®(nÿ,éw*‹"œ‚ZÚÊTÌ8LVÙ9Ò…áù÷HNÏ\á®U7X1öa?•5š\ ˆ±E¶‘Z² pÍ1Þa7±ö›F2­Á›]!8x‰Qó5‰ëQÎ*ÿb¯W<µáý)ýuBK£`ö}F#5’6Ü~Ó<"©“ùŽ²3 ½IÄJ ïƒÑ[®ßž©2ªF2(TȺ""äÍ?`í©áýP˺κÝ4ßªÚ {»Qn. `ñ¥øÀ¶ó7“O‡&Æ*¦bÎ,Wx Íí«¹|ìî+x vâ¯}Ý÷Ì”Ið&°%—Ï' Ùìg]ÚÚY;ëÛ~1F+Dÿª£¶Ó’ì”AMMdîò§¦kýÓÀÝ×-“5ƒîÏÇ㺓†YÆI_’Lr‹¸§‰ù³ºy~¾«¼øçF¯»½:¬ HgÆÍcí/,ÆP šeï%£²¼Ò¡ ʬáb¥à i²NŸåüã÷m¹¦D '7°ƒ'e{M¥á¶> x—'¨ã¹’nÊð=q˜/•›SpýèFÚ<.Ó»"j«_LÕNíj º08S ’ÛbdÛúiïØ´|±+é ïÖÙíN¿ú¶ÿelÂýbço¬RüV¢>ý™ð™ž«ðkøŸ‰)/¾ÅÆ(® ã×ôô诖ý4â6jêX $x•Nõ¶vØñ|y ,ŽM¢£ÃRQbVŽ;ùš+—]È“¼öW%·Ü$^$žÔµ\›"ûú&0:ÒÜÀ/üŸ, ×RÉ@A€¢ SÆnÀ1bê‘É`ø}mAñäa2âï~8 iO¤†æ:ÅHuÕ³|ÑÏ°uãpM¹pW×BïL XBððnz7Ad¨¥^Ü* ‚æÿ¤éIÕÌ~£b‚¾?g½Ä²ƒ¹§ùyôæÓL/9•¤R>iù;˜V=Ä]Šs+@{&Åu+ÄÈz £ÏÞ¸µ;küâ¤] ‡¸iµ?H˜vŸ*—/HM÷ÐÇ©›¢ï´.øɼjøIô[U´OOÖ1¡.a ͇ ôto e€×GºŽB«œåBMú8@ÓÈbéX[$ôAí653 âa 4¸Ìg+¨¦ìgÿ‘^Ÿõ\`;»ÊG:Åͺ»¦àQÙ|ÑÆ$‘œXeè‰â¡I(õŽ/8#íçPÇ(º};%DéD¤ç…fMŸþ§¬#)g°äyœþç‰Q;@öðyGÑ}„0Œüž¥½ÐèÀ‰”âZ8l µ³ýiÕ‰w£{;ÿNhúRO¯ ²çE ?fRÄóÚÆ61çÈÔ뛆žÍF°ø/´£Ú˜ò-5Óšü(¢Ã«p ¨gQ@‚ž•âJÇqw³ÿŸì8¬Ð•GÅ_F*ŒK5"»X*è"kþÕs£w9Võ WÖP°<_U~ýµQà—áŸiáu÷®÷²~·/¢ß'~²#§™~=·ÄŒ·m1·†2Õá2™” >nH ‹Üói¢ýgvä4 T&Þt¥p ÍÔ«¥Ûó:v©/ó!ös:©þF¹Ï\§ìPk»‘^*SŽ6³QýÌ"Ük»›+Y/(Rb¼g51¡V\¾°-†‰¤Ýsd¿º²­þ¨fˆµ‘_’²16ëѦ¶Ñí£LQÉ­ï¢ãæücá†òã$ÝôbbhbNš1/u ^¯îYÞ- Ä`—¹zÂ&ÈG¿¡#n+ñ¤; 鈤›+MGtž6˜@7~?a…¿Íè<:“ò¦© ¬Û;ôZÑJ^C@#bù§’uâ׌[±È„æl/Tá:’çwÖ.0.;a3vtVïÚÂoß²ÇO.J=9S©úPäQdâ­@Ô½ÄÓÒj/c“~xI|²*ƒ®÷vÁ˜8b§‡ˆ›˜Hy´§¸(FÁãõÂ#L4IÆOÅ·¿y ^¶½[ýP9L¯õú3Êw¬sJrBÞ¨†(¹„âŠ:¦'I£ÜÌàÂY±ð¾ÿòn²ÓðÞƒ¿S~ÅÆPÆ $%q.^‘Ò4ÜàO&Œ3äç¯ul_:‚L|ð·g‰2}Ò˜S ÿ;›Ë…dšfiôÔÖD‰ôl®êp¢+8«vÊøõvÙ•#Î*BL}TPC 1\™Dö«} /nÅê ”etP =`”Õ ºTuÊÊ'DPoØט¾Þ?¿î >ùÁ²è"&)p[:'Õ j} ¯ B¼üÏNäÉ$:É’TðÙŒ¦°Ä4/qi°âPŠ{K 5É›‘ÿF¤˜¡™”[[_3øŽ ‚FqvŸ5±½À^äN˜ðÚw“õÌbQì›5CÇ}I­’ VƒæõýSM7×$#›@€õ}ï.ÏZ£³Ö~wõ¯%~üŒ–¾…ˆçqFéã`¨–åLjSF2²6tZ{î!o]¯¤òjÊüÉ ÷œÜHôðþ¯vŠ4®Dºû]–”]Œ¬ S¬OŒ«‹v‚ßÅHd¤i·ücÎLÕ=žÊ§ F¸~áýeÑâà˜‹ÃT¦CigU±ï§©?!æ)l/²ÆËc:Ü­ÅZ+¦l~“z·Í ´ºçéTUFw’bˆÆnjFûöé+—šˆhüÅzÑÈ,©£,jZ$ê†áYW'h@ ⃳eñÉýÕ‘÷ë§]ùâ]8~ÖMHZâ/i ‚){C„65;GöJ}6ú9"SÛô_òÑïò±h[J„ÇYUö«ªhºÑñ‹@/‚”d!Ã*k)ïí­ñ¾F'ô¢RízQðÃ'™ÎQϺчëì\k$½c_Ðe‚ÅÑÄÕn–¬{"‰:’¿[XG`&¾fÊáz¢L{Ù¦ðuÛ· ¼˜Ñ4Ú ®6Õ/`¸¿&wAN(“Oñá 9†p:ŒJ”ΠǤõV*%-·|ÃÍ¿èù‘U7. ¸w~à:˜ö;cª‡Z‰!Ñ2@åkݱà±È¼ÿ°ÔlS ?Úax©X&’Œ=!©àeΗÞÞÜ{sG‘ +²ŽÚD ˆ¼ àÒT×´€<ƒÎjoiÚct¦ú½7pTûí©è×G°[!ÚÙåè¹(ã{‡Ñ矢EZ§J‚ÓP¤‡šˆäíZd¢“é@“ÁÝ=Mœƒ!:Ö² /h+Ïê$ÖD•Ç…»N¡C²KQ·ÂÚñ8콄÷~t_^ÞÇ„Ù~—Ž‡ø/é©æ-ì{‚‹Ù¡àI¥‘©v8@ánïõ—k¸P,þ„bd \RbÏŸ£½ÜèÖòšè’ECLW&Â,ÿ{P7¾ÑÞšM`PO¨ÞÉ49õðsLbKÚç>ß!¼¹â`Wê¦]Ø’¦šNÜAs–’ùv‚^Þä„FmpM³@ê›*¦ bç˜'óE›ŽÚŽr:(È‚ ú¤e0•ûàݸP …±ïá¯õíOÛ-#±H®è?ƒjOrŠËõxðî°'Iÿ@ž#s“Û¨Ó„Â!0îݯڤ´@Ô5d'³Laé^jÚ8p²¢ú2AòþŠ›å´&À 4ºt/m½Ÿd{¸¸oäi'ë¡}ñëëô7±ùCC@z‰°™+²‰ÿµ|d”“EqÜðÄ[:Ö·(— ÞÁmâ]·uw6Äg/Ž q¨o(qLÿÅ]kZ6´èT幩ռ«8ÐD??í8ôsΕÒñf¿Í™ôàùš»`Ïj×N œ_®.]i*§X|[jZU¦ßÈÀþ$£ü}æyÇ|í÷ú!9¦×=yæ´[ 9{êêûþ(¦Ûo$(Tƒc톭–"=ƒíÿoûŠ,ö}ý²íþµwÿ­Å"šJDTŠ#È+嘛öæ–k šQ endstream endobj 1664 0 obj << /Type /ObjStm /N 100 /First 984 /Length 3665 /Filter /FlateDecode >> stream xÚ­[[o·~÷¯àã9( .ï$P°;ÉIâÄN›¤.ú Ûk{[Ý"­R»¿þÌ,‡Ú‹.öJ ‘Ü]Î7÷™¥da­bÖZ&3ƒÏ´À‰Ë˜•xËIæMuE3‘y3Ë„r gž‰à%Ì|ƤÉð,¥þfšÉ p¯·L™ ÉyÏ” @ʆŒiY] ’i§¨ #C‡1ÞáL2ã„bZf¼Ì:¸¬;PV2›1%,pkÃD‹ Ð ³Æ¦,nP€PÖ¤ˆÛ‚7pO3'ÂœTÕMÃÜ8Pnê€4sVß …s" ÛÌyøÐ:0¤öó™N3P—Še™—R3h^I,(æµ´V¢J¥N=óVz`00ï$#x¯€¤@s»Š Ú…)ÚZ¡° %¤Æ ÝVjã¤E@‚kÀ ü[ZÜn5ú7ÊéÀפÁÍ`y&5îð°O¢e€O  âfàRa¤d`A¡€ã‰²‚?†Þ5HŒ4¥@)p‡†à’hpBx.Ãàß0SyÈ4ʧ¸@­(oàšKa~þù€ÿú8Í?ŒË—ùüzVLËÉì ZŸ Fpçëû×'oßÿ4+®àòpp7g:Þ?>ž<°?Aw‡è!öÀ ð£ùu>.YvÀ_ ¦¯óâî¾Z }ºþ¦ ‹ë£ñÝ0Çå§2}F{ð¯ô¼¶°xq?˜}ÊKö~{ ÿ‡|:\ÌÿÑO Ø ‰HBbº8øå—g óùÕù›ËÏ•0£b½8”Àòî9ò€ôvƒHN7%’M‰Ãéý€ßäÃrБÈô’èåû·/ŽQ¢Mò€Ç‡˜w x¹»}\ÖF¯š§Xg×G˜‹“‹ów'(ÌFë@,JH•u¬|–uܼÙ(P´Îõd4ð»Y>(óæó9Ÿæ³brÃçÃÁü¾#jè#ê×÷oÎÏQÔÙzI!#‚ ë˜Mín¶–”&kJù½ç߃a2aŠ²uBâí!áå‹Ë×gï~‚P+Ëõ"B†ƒpƒ©Ó[‹I·)¤5ºaOàã9’†–=ßñ|À¯øÕlpýw^óÛ2Ígø<¿æ7.î:Ë»– ÷ÓúŽß'“ÙòñjUßNîŠëÁp0¾¹)æÓáà1]™ÌÒ…é`–úrqÕZ”õÄ_Îûj¾d®^]µWec‘($ÌBÊb2N-/À£àGãÆ­jQ]þùøf^ ý:Ö«<œœ¼>ýý#8ØüqC Jvª–MoAh1œjsR4ƒÐlJ7Fnô°|0¾kF`½ŒA8˜Í&ÿÐt)·˜ÿ ººçWƒYí} ãW‹á0‡àÍ‹a¥ªÛå<Þ‡ #à—ç£iù8‡'ó‡ËÃ<ùVïR²‰ ßã¢|„ \›ç×h·ªÄûµÖžÇGƒé¼œðQ1†,:Z Ëb:|ä“i>&nc A=Î ŸÎŠQÎgùí0˜/®Ë„T9~~ôÁ°ã½Jë«W_./¾VŽ°¡Ó³1´–RùvãÍX§cûœfAotƒs~ÉÇ“2ÊšëŠÕ«Œž}¾8>ýP‰u½¡cÀBªTÕ8ë–nTR ¯o ¹tØO®ëÉp2ŽŽ‡¶`¾Wõüíè×o/A°MÅÓPíÔÐéfØÚÐ2–”ýkg»÷>âǺ/ù ?å¯økþ†¿…zúžŸñPU/ø'þ+ÿá_ùïPc£):+„D a,»äUC±!Œ7WåJ©ÔˆU:Æ5Õé[ˆ ~;YÌ b§6­Q¹ÿªjwÕ·a㜣+`°¸Ã‚öâÓ:å7R7F)ê,5|UOô[äó*4¿-&e~s5Œ“¸[ƒy>*"Ïóü;01/b+MCy?Ës^þ3öa1¾.®'³¼î$ø¿ùlÒqš^íÄ‹×_N >+FW‹ù§ÁøÝáE~·ØØI{ƒMÀÓ€Fû%ZíWµ¬Ûi¡ŸáBFª¶ ¡½·ù@X²,Ú´ÓoýÕè·Hû•fI‹Øz=v´Ô«&~<:ûýô iéb2:›„w‡ïó›M¯ðÒ~XJ@÷Ä kÄškÇ.ïfã‹n¶c°/Ãí3\W160*Z±ËXx*PõßÈ­“3·Ýx«ïö*P¿}x÷æÕEÇ*[Ü­‚§Ñ*R7­bÚV1-÷õýß“Vò¿-fÁ‹ÆÿÛGß+¾¿ÂPËõ[·CÞéœJ¯ ë'¾zª?~ûÄw~%Þ²&:¾QÔèYôöqà ºßŠ.[¾ û£wΠV‚y%ZtÓC^‡þð³¢øÇÓºéy¶ ïwH­ôÇSº¥ü–é×Hÿqp—Ï¡,°¹=€õ [Ùê;òŠòÛ⛲ø%SBÅÑÐ:7Sñ;¦â9óŸ;¨¨Kè÷ˆh¨¤c:Kc¼®…ÜD‹È©–’FG•ÑHk½ˆ&"1Öa$PK –îÇ’½#ˆ#µÄ³O¦=y‹M7Œ{ØD‡HÜ ÙÀD0#¡ˆn‚97Šˆk"Nj4ämƘ=@ IbIKkR£qcjGX»ñDÕh³ŒFGAk±‡$VDέÔ4FÎ-©ÑªèV‹=@4qlˆc“Ön ,FþŽ ŽÔO¹uŽŒZ Fãï©z˜&þ‰¸,ªÅ A£¡1Jä¤ÞD¥iŒ6qäÊŽ\Ù™lCÄÉŽlà(û:ÊÒ®gnƒP:qžÀ(»@’„æ3±;ˆÏ¢:<¥/h-35{Þ+"Nñàc<ÀhhŒ’ú˜¥Ÿ b[ ”Ú=Ù“-<ÙÂ;saJížláÉžÒL 42½;H Ô¨Æª”R|†Æ=$ ”£ÅG øÒM0ûHB]I ›²I ›²IØÇ&lÈ&l(>ª/HhÒ/]v"#tšxšPK•í¥ ‘ÑYš$L0MÂŒ/î»BÙ„`¦KêrIŸžéY’;P>±[œ‰•˜¦b(A%~š&‰0õ—0IÏè}l%t"LE&$§° ܦgzö™¾ • "¨LÃ$ÉàÉ9EÒ­èYªÛPø‹ÐŠŒ¤d$$U!©DàmÓÄí¥H©a®P€ ‰'{¦£T²ŒLš”I]*É©’ë(©ö€RI•V™•"Mùt%ì#•N¶J¯RBS¡:éM'ɵíÚP.AQƒ(LŠ\“²¢Iö4O·Xf3”IZ2Ô K¯>ÂR?/òO¾ª†4.ËÚïÒô®L²hêy’Ò4Ý'wD1䆒!³d,:Œ`öé¸ÅÑ{#Õ8ꆽÊ{*^^™=P¼¥^Š4¨ƒ$c ûÁÛ=Pª¿X *š*†]VŒ”ùDJxO{Ù6,‘¼K¦Ê#éÍ¡ú« aÕO%<鯱D'zRи'é@–m’-B6e­ô^–:îes´¬SËtñ|¦»XOú%äÿåã¤ß¥ð}å°ãÖꤌQ-Ń2&Ó×6dµå΢æp—òÃL©¬y¦³’³ü;ß ÑvSo—­íTwh·´ÙºÝb¹;£¯ß¾E9ËÊêÏKViѹwEKo¥%[´ÖñEgØ­l-:ò$ZÆ®¡¥kk»•–nÑ’ëhÕÚÖ[µ­³&­ÎÁ,Ѫu¯6èžv¯Ó¶ªµ­tÇmB“Õ<@®#×ÔMו©#xÚm¥eZ´Ô*-‘Þ—‘–ZO«Úøêì–ËÝ>lómúÁXòíV8-ÙŒá$[™þ0 äÿQeë  endstream endobj 1704 0 obj << /Type /ObjStm /N 100 /First 930 /Length 3490 /Filter /FlateDecode >> stream xÚ}ZÛŽÇ }߯èǬÉu¿†ÇŠƒ ²#XFòÁxÕÚ{vG™ì|}xØ=]Åéª~ˆ5Íb±ÙE²7:ÅA :Ù!†AÇÞѺ÷CP´îõ•½Ñ.’?hg‡ä4ÙÊCÖ‘þõCfÛ$S™þcH¨q‚±ô?~²2Ó é9on´¢EÊtr¤0dRgF ä‹Nô@ÞèÌ@GeÉ5rGNrÇo7äŽ1. 䎱„Ü16¥Ü1¾‘ž·j wLPz wLˆ†8L¤rÇ$n“µ¾!l&È‘iÉ‚—ÁðCª†p‹´EE Ž¬Ñ¯0ØÀ”“—6f‹_‰Nrê†~åÁi ™&4F2æ‚C°´\†ùH*^[˜¼e^èpï£Â¯0øx¾&^MC0 gØà4ôˆÁVBd=c†ù4rŽPð/b’øÀ/?DgøW –ü ÇËE@:Ãä!)b_Gb5 +D^rˆh$àÉì¥X¥hq.±—²*äŽâÓh[6ì¥C¶È‚HÔe(õ"r €(#ÔSÂ*rP)CÀ»2)‚”Jìž#ö”çTwô¬"»Uò8ŽhÅô¸„œ ú†sŽÂ¢±ÍÓ’vHúHiƒulƒE™}œ®³a]:ͨȺyÏÔù€× ±.=Sæ±.fBò7_}uóåOûóa¤ÜNô®þxóå7ôÓO?ßíNãÓ™ßÜéù4~æ×™Ÿ~§5z#ðôõ×–+¶tÛÖ´›/ˆÕnµìŽñj·²”X™"w¦§ïö§çsAùvGOH ~úöøBf^ù«c('Zy¢÷µï±å-½¼—Ý!oí5`܃k[¡D!øM[" M\¡D!è-[^Ä$´bJL|lÛšwÛÆn_øõ’ßXã°^„ð‹Cx¡«B_‚ஂ`…³®åž+´;¿¹[Ðî[´»B»Ó[¶¬ ½«ÐncÛÖ¼»E»-´Û>íÒ—1°"³¿—¸ëóJ ŒŒtÜ´\5%Æom°­˜£7Li€6ª·L M+ºDCÛ-Sº65c¼2UˆV[D+qáèÖ…£ íj‹v%h×-ÚU¡]mОëªÅºZXϤgÁ¹jpžÊóã¹&<7øÎ ÝiƒíT“\— ›6˜åµU]KqM,‹:Û*³¥ÊÆ ŽcÍqjP\JgÜ 8ÖÇÅ¥†† ŠEmÕÏR>ÃÅ¢v¶Jg©œaƒbQ6[U³M¿A±¨Ÿ­òYª§ß Ø×ûÅ¥Bº Š]M±oP\J¥Û XÔÉV™,UÒmP,Jd«B–iÛO;¬–â¸Q¯Š¨²4ZYÍUm,¥ñª2šº¡m• R¯Ê¢ÀÖªƒ¥ ^UAÑtÕ Kg4“ƒ×þ]Uµìý£ê m–Ȫ_‘ÍN³Ê/w{ëÄy:‘ ¥èe„?úêr\’³3Ìm·´¯…}y@¸ðÃîq|þý§o÷Ç·û§ñµ~­oѳþPË ËÃJnYWrÇò´’{–ç•<@>½A?ìýãþ¼F&7ü|íÆ›ãÝ«÷çÝé|Kù2»ð·óøˆ­v*_ºEsìj‘fQ¨DÛL%°ÄkŒÕ±µ4–;lO•=A®Ä‚S5ÐA !1JUI2KÌ5ªË‰¥¤qy÷qøÌÄ$;0ÃëíÝÃîÓy<}ÁLj%tÊ„(¤Ð R‚ŠégQ)®ÀÞíÏãë?ÇÇ£”úþý_ßLÞ´<Æóóo;ZgN¦÷²x|¡ÕÇ ­RõÒ÷F£´:ìïèÍÚïÎ#tœ©t¾=Ó9ëýã§ÃøHZ»óþøµX›z3¾=Ž' p?=œF¶3µ¢µËMg:ÚL¼ß?Žg`þ4žžO»ö^@¡Ëãã3YòÏ@½ÿø£©u¾wq69KéËù´O ³Kˆµ”>íN‰îØBS+›Ç—ÃyÏfr“†–'#m*þº;ŒòŠ j4ßN:Ç°ûø‘›c¦ëåñpøƒbîÇç—ÓÈ©SÇþûqÿLi‰˜¼{xéa›ËœZ—K…×~„Iç¤>=|`úC“…†-mþñ8Þïþs·; .מ–û_ð²¤õ»wo™¨:ðïïNû_?ÄV œPµ/ïÇû‡=Ü û'Bÿ¿ýÓ=LäúøiwúuGx£a,¶ém xµ­íã?ÇÓ‡ãñ°ïGdôø;µŸîÆgfµŽ§TÍûgΈ¥Ê­?PÔýÒTñ¯ãñÞûüpĵN'ÔÜý²;}Þ?{¥^~E.7ô‡ñãk3Q3µë+ç·<© ¬h¸,¶íä–…A  £z&) ,ÌR!Œ«·¶ÂQ©váâ0IÕ¦ÍÄÏ%'¡g¡SA 9Ô wüï _»•zl­LÅ=ö¤Õ†~©À‡]RD.M‰®ZKÜyÛZâö(4 r‡›¹IJ«R¿ÂºÚ¶íÞDr ¨DR¹ õWšoÛ+-=½<þB=ß«éÖ´iðiwÏ=¨‰®Ы½Äg–(]qѾdW³Ä GQ_ažW I¢,D”é’g³ÈC$\Q”Ék!Šùkœåì¢×˜`A¢¡˜§àk‘i ð˜‚Ø­…¸ÛRŒ|é¶ÒëàØ’pW_JØÊ"ª¸êR–˜Á֥͜E„!+Óˆ³‹^`†‘=l j ±•eÖ ‘ð­@¾ÚH²±|ù¶Òëà3D"b+[Á© I4ÄVv3Ør‚S÷]jÄÙE¯dˆÉÆð '2Âð§ '¢oô4·k#(Š=˜,WXèÝ`‚h)ÑkQ Ðé‘Nñv°bhA›D5E“•jãZF£Ø+¦˜¢¨=h®£ª]Gsu­}†Æ>Š C[;—a(öf!LQÜWh¨£­}O Gˆž(.0ôòQ\`èäcç‹Ëü“z]šþ(2 tý$:ø(2 ý{†î=Š Cïc»¥¥¥^)B›ÅG Ô&QfдGQ"ѲGq§¡a"çЮÇÜ.Ei)E¹WŠÐÙG1Q£UNâÛúô$¦itéIÌ1èÑ“:ø.lÚß.òrççF)zïð‹/ø뻽ÜòEŠÿOÈ¥q(R4`—I¦HQ‰.sa‘âF¹8T¤¨2k&¡ÍÀÿC¸þ endstream endobj 1795 0 obj << /Author()/Title()/Subject()/Creator(LaTeX with hyperref package)/Producer(pdfTeX-1.40.14)/Keywords() /CreationDate (D:20150727134621+02'00') /ModDate (D:20150727134621+02'00') /Trapped /False /PTEX.Fullbanner (This is pdfTeX, Version 3.1415926-2.5-1.40.14 (TeX Live 2013/Debian) kpathsea version 6.1.1) >> endobj 1760 0 obj << /Type /ObjStm /N 35 /First 342 /Length 1344 /Filter /FlateDecode >> stream xÚXM7 ½ûWè÷°–Hê X,4hM“¢§`³É`aÀûѵ}è¿/©17kI3Î~¤Ä÷Þh$]ôÙXãbpÆ%’ †,ï“d"Ä›Œ Æ9EãЖqœ %âÚòÊÅÈ3g'Ùè 8‰ÀÆ¡ŸDd 9™/zÃÓ,„P°h¦ºdÐg/Q6pd &DÆ’3˜Qˆ&0d§ ¹)"CPØ'oQ˜¦`ˆPø1qò(ÝR2 ƒ” Eï¸G¶†R›˜å Ý2oƒŒÍl”+ 2qäýêúzµù4<Œ{óåÝ~üzØ>=þtåÂÚtìöŸæ õX£‰Qv¯B³ P¡°æVOVJ z»Ú|Ü>l ™³êÛÕÍMŸ78™ŠêÜ6¤ŵñР´6bz©õ5ÊÄ’³³Ä…ÍYõq¶Ö9[»©À¹†³À.U0Š»5I´R‹M­˜ò<ù¸>/Ÿ' sÅú¹"¸vIàj˜-v¶­f4ÖcñËÃ,}átV¾@¿˜ìëÕŽb2¿ÖÌì±YídKm½lȸöžÄ/Äyï…ÑYù;žµ@8AÓ‰Uþr,¿eÈïOßÆÍ?ûQË øq¸wûëëͧãÃþ‹åà¯Í‡›§Á-SØ|~ß—‡i`ZaÂì}Þ¶v endstream endobj 1796 0 obj << /Type /XRef /Index [0 1797] /Size 1797 /W [1 3 1] /Root 1794 0 R /Info 1795 0 R /ID [<62C3C60CEFC045E53FA3AA370C1E74FF> <62C3C60CEFC045E53FA3AA370C1E74FF>] /Length 4448 /Filter /FlateDecode >> stream xÚ%š}p×yÆ÷ݽ÷ $$BH€>@€Hè„X ú!W@“©Çã:í$ãÚ}ó5vê&uó9ž¤uOÛëÄžàÆqS'u=×iÈÎ:Ù4›ÔÓº7so±ÓÄöäcl7µ»¿‡ûÇoÎyÞ½{ÏžóœÝ³ï¹Ž“þí»®“ñ‚c`Ìuœ´cŽS帎]«L´ü4.Ú´NªH¡­Eë š´V´vªe`ÚN´6ª«A9Ú.´ÝT+@%Ú^´]T×€µh‡ÐvR­ëУµR­ëÑzÑZ¨n5h\[~Õ`ÚZ3ÕZP‡6‡¶j=ØŒv­‰ê°mmÕЈ¶ŒÖHUäìGÓ!:i3šÚ¼•ªÔ‚vM§×ÅìD»ˆ¶™ª:b7Ú45M˜ô®;u­Žª íš.Kƒ—t§­GÛDµ ìso)¦.Ù$Z± ­†j78ˆ¶ MÝÙ¡É멽hëÐ4}àZ Ú:ªý`­MÃ8†Ð¶¢­¥: FКÐdQpm;Z%Õc` M×+û㮓ʦÐÊ©ž>š~WÖ›“‰VòÐVQ= ¦ÐÔ²í)pM}¡zL£­F“ågÀ,Z9ZŠê8‹V¦érÌ£U¡¹Tσ4õŸ¦ÚpMýâP]KhÌÜUªËàZÚª—AmÚ Uá ZZ–*'“É^õ+‡À¾Ò‚ÐEãλD•Ö‡)´i4~7äÊà Ú<ÚUz-Lú*iméñ° æ.Re´ÂJ´z4®7d¤Ãµh rn*. ס5£ÑW! ×£íF›§Š;ôËhôsˆ³ÃÄòé8ƒv–*³"¬Cۆƅ̨p3Ú0Ú,Ufc¸mñ ™Éa#÷In‚¹iªLöÛCÈ[,¹ 1Z!·–pÇm:ŽÛWÈt¹á…Lâ[dÈÔ ¹©†LØp/`š†û“3<˜’áAÀD ¦_Ø ˜táÀT ,L«p0™Â£€)rÓÇ3%d„Ì°ÕœÌ]ŒÏ%¨;™`á`j„§"To¨›ÔêXõ¸†Bc¤ÁÓ¨j¸åDΑ¥ä5™‹†Ø6ÄÔáUî±z(УÈz¥;e@†›4§ü6}ƒ©›cÜrµæ<ö¦´jPnNýÓª2CsÜrz`09s[(é9£‡Ãzsš·êà @ÇmzœÔ=êÍéªÖqz~è,zj4ž׶™3ðŽá1qMnW©ì0gêEy8\ãέ tƒsÎeí{@Ðd¯§´}à 9‹_×7zÀ8bÎ{Û¤õƒa0hÎ|YÚÇÁˆ9ï{KݶSòÁ¸9¼Zà$˜0'÷=i“à ˜2çc¥§Á 8¦ÍùøŠÎrz=ÅÁ0oÎçTô<¸.šó¥›¿»Ä7Ô§Y°d•Ëæä—uÈžœø%HîuOüZ`f­ºüçž9O–TÅMk• cη&¤a© ¬6ç™OJcé°. *Íyö9iº)ì „¹‚*sþ¥B<à— ñÐwê¤á¡Ó͹q«4Œ`š ÎœIc@œl1çG¥á¦@ ŒFsþ--Mw3-&Ô‚íæÄ hÑ¡Eroúɘ´V€¥‚]漸Kš_ø*Ø 0W€›‚vs^ uð>Vó,!˜tÁA€¹‚^ÐmNñæ8,è3çgÒX°äÔl ˜óê« \ ›óÆŸJcà¨9¿™‘v ŒL7çÍï*€ ƒ)˜ð›ã‹ Lœ2KDÚiZ .™Óf«QOgÁ<˜3[s³wñi°0fpÞ¬úQ°h€'ƒ%³z.XYzÈÒ.›mý¨JX4¸jöDC4;vÜ¢*«‘Ü.JëAH›íYÑ («ÌzT‚*PaÖ‡kÀZ°¬3ù¥Õ`#¨5f~£›ÀfPgvªIšžÎ»)5€-fÓ*°lfs¥mM 4›-X@—ÕjvµKÚN %ìn³÷LHk{@‡ÙïRZ'-P`?Økvûý t9ñ 8`vÇ] tƒÃ Çì®w¤ý ×ìî/IëGÁ€Ù‡ï–6†øIõÚ0£à88fvÿŒæ"§K˜ãfŸSàðÁ˜4{à5N‚3 ±ãç“v̂ĉ~JÚ 8>ü igÁE°`ö·?“vtPZ‹fÔ+°dÂKfýZÚep¬˜]ÿkiWx7À§‘cöT3ZdæîïV ÃEžÙÓêسFi€ë¢2³gw+ ',¯NŒÊÍž»¨@À˜Ñ³çÏIÓ½%žüÞ7¥áÉÿE‰¿ÿ°4,ÕƒZ³þ…´:€õ¢Íf?Þ/m ?Ži"ü5˜½+КA“ÙK‹ÒplÔ v˜®Kìvšû¤aÖˆŽÚÌ^^-‘Žô2Õiöóvi{øqi¸3ê2{ý†3˜QbÌ_Ÿ”†1#Œ%Æ|³JÆŒpb„;£Äo?¯À0’%ÏÒpg„#l ››:¢À(Íè↼BŸFÇÌ]u³wÇvŒÆÍ]û®4,aÇhÂÜšÿ’6 °c4ený&i§vŒÎ˜ÛðiiÓ;F³æ6½!wçœ.ÛFçÌmy\y€m£swʉÑ€c£EsÛ¤áØÇF—ÌÝ3+ ÇF86Z1·ëæÈ\á*]à˜{若ıҌLn?Õ2à™Ûû÷Š¦@9XeîÀ¸´Õ` ¨0whTZ%XÖš;2,­ lÕ掽.m=ØjÌWÚF~œè¥zPkîÄ u`+ØlîÉi[À6Ð`îÌkÒA3h2wîÒ¶ƒV°ÃÜùǤµ€Ý`§¹ ¿‘F%×M©´™{ñ†í`/è47ûi{€º©ËÜßûWiÊðª¿tÀÜ÷ÞìSï0è1÷–œ4Þü—x­_ê5÷Öû¥õñãúî è7÷öYxÕ_â=~iÈÜ?ü‘´ap ŒšûP¯õKã`ÌÜ;¾)í8˜'̽ó!i>˜“æþIA™“\¥3à”¹÷ô)pÌ‚is?4$mœsæ~,–v,€ysï}RÚy°.˜ûñH».%sï¿4R>9u‰?# cq]1qÝ JÃuÅ]  $Ö{q­zWò§´›ûÒ·À‰EîHÅ=æÿRN,*Ë´ÏÜW~! 'Áb·¹¯MHSÒI'=dKÓUöƒ>sßü€4-%û()…”Ü'ß¹¬N,*…4 0\qØ<«Uô(¹ %“p]q̼òÿS×q]ñ„y¦¥áº"®+Nš·¹QÚI€áŠ§Ìkø#iZT*ã…ëŠÓæµÜìN\WÄRÅ9óÚ_•†ëŠ¬Ÿ‹øª¸`^Ïí \ج¸hÞà}Ò–À2X—Í{Jr/­ T€ÕæÝþiå` X*Í»s§kAتÍûà+°l›ÀfPcÞ½¢µ@ëÉrF$˜²—AØbÞ÷踭  4š÷¹¯IÛv€íæ=ô–´f°´˜÷7?”Ö :À.ó¾ú[i»Ah{A§y_û„¢z€RÚºÌûúŠûÀApÀ¼§º¥uƒÃ Ç¼¾!íè½æ}÷Ϥõ#` ˜~[ýÐ8Oþøô×ÁÊ^&žüé;  ñäË?—¦d&™ÊlâÉ_¾"í$ S™=ÈEfw¾ñŸŠ’®Ì΀s qâ[(@~2Kò1;o)¥ýSÙó´e˜Ò"¸`)ïw Ì.YoÉRe?U€ dVÖ[±TõóÒ”mTÆбTÓmÊ1š¥ž¸[¥J¶ÔÞ‡UUƒ”ÖXª§W6+UÓ–Í[””@Ä/%¬Wª®¤$[Â9¥íƒ”0M©ÔYjPc^ª¸³¤µ#i×\5U¹à«Ò.€}Jا„}J”ðKi›¥&[tÒ=ÿ•:Hvƒƒ€6û¤6|R§>¿æ³\ðkc^ÂC¥–šÕ©p]©`¤F*áœÒaK½§L‡ôó]öDüªŒVI—}JC–zŽx­4Ž“!5Jx¨„¯JJƒcŸ’’߸¤tÂR÷´é§€2àgè&|êoä‹}µj(Ñ­,ö¬¥þüº¾‹×Jç¦)%Fúâ (³¹JÊgs()c½䜫´4 ¸_•.Y*ï;T¹¹ùì¢øl;ùì/ø½ª,ÝóÉ€2 L´RÏ@ ç5`#ØR–zºW_SêY¹æj@vßgYëP%‘¼\ H/×Xê;×õ5Ò†þ %òÅË  lm`‹¥~ôYÜv€Ð v­á´§¡U :@'Øö‚}`?8tåí–*|K§ïA8ºÀapôƒ0&ÀIpôY구N5†.ÇÀ›ÆÁià[êí_è»S`œâbH«û꿳`œ±ôª›?4 ÔçÀ˜³ôÚŸ(:΃‹`,e,½ù:ø¨ö]!up°@œø –7V,½û€Æp1ΉåLËIs¿Èz}hØ'Æ/qÐ&Þˆ±T\aé‘Z7ÅŒeÌ~EŒ-bí>Ôƒ-3ÄÚiØj,}ö+ú.FŠµ-Á>˜¯Â/1~‰w݇ÅíNòy—¾ŠqNŒ7b,7[:û¸NŠ›bÜã¦oÄX*ÆR1–ŠñPŒ‡b<ëzqNŒsbœ㜘~Ž±E|ØÒ·Ôé1MŒ_b c_Å>Àk1¶ˆ1\ŒKbÌÏ|µô]S:Õ)€¹bÌëâ¡«Äx#Æ1¦‰/lÏXú¾&ÓÄd‰}]Âe°d«4ªزòIÁùìúlúlùlú$9|™=>Ÿ-Ÿ'“ÏCÄgŸÎ×Ð^²ô§?¤“ÊkYK?yŸª @ûGdk}*¹Ÿ­-Ÿ½"¿°uî³WîsSðYbûm èéBRÌgéâ³è³ùç³à³åìÝ©ë-ýwƒúñà˜“€·' hš²Õí·ôãÿ o°¢õÙùñÙ_õÙãóYølûdž|6©}6È|u±^ˆx'ñ™ˆ>;q~¬v¯ý«–~öŸ´>u¬làˆcéýªš¥¿ÿ¢J®¥ÿ}“Jž¥ ×TJYú•‡TJ[úw—TÊX¦ò}*•Y¦ñŠJ«,Óú¿*­¶Lç•Ê-söu•*,së³*UZ櫨´Æ2oF%'¹ã€þËÑW9m|Ña9:,§×M:,G‡å´æ?ce“¼>dòúÛC‘g(òÚý§Ûó¬ò¬òì¾æõWý@Và:¯m|îüyž«ùA@2Ͻ3?Ð 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.4/isl/doc/chicago.sty0000644000175000017500000002714012413256472013334 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.4/isl/doc/CodingStyle0000644000175000017500000000375312554427055013354 00000000000000This document describes some aspects of the coding style of isl, which is similar to that of the linux kernel and git. The general rule is to use the same style as that of the surrounding code. More specific rules: - every line should have at most 80 columns - use tabs for indentation, where a tab counts for 8 characters - use single spaces around binary operators such as '+', '-', '=', '!=' - no space after unary operators such as '!' - use a single space after a comma and a semicolon (except at the end of a line) - no space between function name and arguments - use a single space after control keywords such as if, for and while - use a single space between the type of a cast and the value that is being cast - no whitespace at the end of a line - opening brace of a function is placed on a new line - opening brace of other blocks stays on the same line - the body of a control statement is placed on the next line(s) - an else appears on the same line as the closing brace of the then branch, if there is such a closing brace - if either the then or the else branch of an if has braces, then they both have braces - no parentheses around argument of return keyword - use only C style comments (/* ... */) - no comments inside function bodies; if some part of a function deserves additional comments, then extract it out into a separate function first - no #ifs inside function bodies - variables are declared at the start of a block, before any other statements There are some exceptions to the general rule of using the same style as the surrounding code, most notably when the surrounding code is very old. In particular, an "isl_space" used to be called "isl_dim" and some variables of this type are still called "dim" or some variant thereof. New variables of this type should be called "space" or a more specific name. Some old functions do not have memory management annotations yet. All new functions should have memory management annotations, whenever appropriate cloog-0.18.4/isl/doc/SubmittingPatches0000644000175000017500000000417412413271702014551 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 - send a single patch per mail, e.g., using git-send-email(1) - 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. Revisions: - add the revision number inside square brackets to the subject line (e.g., use --subject-prefix='PATCH v2' when creating the patch) - recall the major issues discovered during the previous review and explain how you addressed them or why you disagree. Do so either in a cover letter, between the "---" and the diffstat or in a separate message. cloog-0.18.4/isl/doc/implementation.tex0000644000175000017500000023521612413256472014752 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.4/isl/doc/Makefile.in0000644000175000017500000003254212554427647013257 00000000000000# Makefile.in generated by automake 1.14.1 from Makefile.am. # @configure_input@ # Copyright (C) 1994-2013 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@ am__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)' am__make_running_with_option = \ case $${target_option-} in \ ?) ;; \ *) echo "am__make_running_with_option: internal error: invalid" \ "target option '$${target_option-}' specified" >&2; \ exit 1;; \ esac; \ has_opt=no; \ sane_makeflags=$$MAKEFLAGS; \ if $(am__is_gnu_make); then \ sane_makeflags=$$MFLAGS; \ else \ case $$MAKEFLAGS in \ *\\[\ \ ]*) \ bs=\\; \ sane_makeflags=`printf '%s\n' "$$MAKEFLAGS" \ | sed "s/$$bs$$bs[$$bs $$bs ]*//g"`;; \ esac; \ fi; \ skip_next=no; \ strip_trailopt () \ { \ flg=`printf '%s\n' "$$flg" | sed "s/$$1.*$$//"`; \ }; \ for flg in $$sane_makeflags; do \ test $$skip_next = yes && { skip_next=no; continue; }; \ case $$flg in \ *=*|--*) continue;; \ -*I) strip_trailopt 'I'; skip_next=yes;; \ -*I?*) strip_trailopt 'I';; \ -*O) strip_trailopt 'O'; skip_next=yes;; \ -*O?*) strip_trailopt 'O';; \ -*l) strip_trailopt 'l'; skip_next=yes;; \ -*l?*) strip_trailopt 'l';; \ -[dEDm]) skip_next=yes;; \ -[JT]) skip_next=yes;; \ esac; \ case $$flg in \ *$$target_option*) has_opt=yes; break;; \ esac; \ done; \ test $$has_opt = yes am__make_dryrun = (target_option=n; $(am__make_running_with_option)) am__make_keepgoing = (target_option=k; $(am__make_running_with_option)) 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.in $(srcdir)/Makefile.am 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_detect_gmp.m4 \ $(top_srcdir)/m4/ax_detect_imath.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 CONFIG_CLEAN_FILES = CONFIG_CLEAN_VPATH_FILES = AM_V_P = $(am__v_P_@AM_V@) am__v_P_ = $(am__v_P_@AM_DEFAULT_V@) am__v_P_0 = false am__v_P_1 = : 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_GEN_1 = AM_V_at = $(am__v_at_@AM_V@) am__v_at_ = $(am__v_at_@AM_DEFAULT_V@) am__v_at_0 = @ am__v_at_1 = SOURCES = DIST_SOURCES = am__can_run_installinfo = \ case $$AM_UPDATE_INFO_DIR in \ n|no|NO) false;; \ *) (install-info --version) >/dev/null 2>&1;; \ esac am__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP) 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@ 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@ MP_CPPFLAGS = @MP_CPPFLAGS@ MP_LDFLAGS = @MP_LDFLAGS@ MP_LIBS = @MP_LIBS@ 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@ 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: ctags CTAGS: cscope cscopelist: 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 \ cscopelist-am ctags-am 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 \ tags-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.4/isl/doc/mypod2latex0000755000175000017500000000031712413256472013371 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.4/isl/doc/isl.bib0000644000175000017500000002417312413256472012446 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.4/isl/doc/user.pod0000644000175000017500000131205112554427055012662 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 or 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 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 =head3 Changes since isl-0.12 =over =item * C has been replaced by C. Some of the old functions are still available in C but they will be removed in the future. =item * The functions C, C, C and C have been changed to return an C instead of an C. =item * The function C has been removed. Essentially the same functionality is available through C, except that is requires setting up coincidence constraints. The option C has accordingly been replaced by the option C. =item * The function C has been changed to return an C instead of a rational C. The function C has been changed to return a regular basic set, rather than a rational basic set. =back =head3 Changes since isl-0.14 =over =item * Objects of type C can no longer contain two or more C objects with the same domain space. =item * The function C now consistently computes the sum on the shared definition domain. The function C has been added to compute the sum on the union of definition domains. The original behavior of C was confused and is no longer available. =item * Band forests have been replaced by schedule trees. =item * The function C has been replaced by the function C. Note that the may dependence relation returned by C is the union of the two dependence relations returned by C. Similarly for the no source relations. The function C is still available for backward compatibility, but it will be removed in the future. =item * The function C has been deprecated. =item * The function C has been renamed to C. The original name is still available for backward compatibility, but it will be removed in the future. =item * The C AST generation option has been deprecated. =item * The functions C and C have been renamed to C and C. The original names have been kept for backward compatibility, but they will be removed in the future. =item * The C option has been replaced by the C option. The effect of setting the C option to C is now obtained by turning on the C option. =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 by default C 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. When configuring with C<--with-int=imath>, C will link against C, a library for exact integer arithmetic released under the MIT license. =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 Optionally get C submodule To build C with C, you need to obtain the C submodule by running in the git source tree of C git submodule init git submodule update This will fetch the required version of C in a subdirectory of C. =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 By default, 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. C is not needed if you build C with C. =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. =over =item C<--prefix> Installation prefix for C =item C<--with-int=[gmp|imath]> Select the integer library to be used by C, the default is C. Note that C may run significantly slower if you use 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). =back =item 3 Compile make =item 4 Install (optional) make install =back =head1 Integer Set Library =head2 Memory Management Since a high-level operation on isl objects 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. When applied to a C, the returned pointer needs to be freed using C. =item C<__isl_null> C<__isl_null> means that a C value is returned. =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. This annotation may also be used on return values of type C, in which case the returned pointer should not be freed by the user and is only valid until the object from which it was derived is updated or freed. =back =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); The user can impose a bound on the number of low-level I that can be performed by an C. This bound can be set and retrieved using the following functions. A bound of zero means that no bound is imposed. The number of operations performed can be reset using C. Note that the number of low-level operations needed to perform a high-level computation may differ significantly across different versions of C, but it should be the same across different platforms for the same version of C. Warning: This feature is experimental. C has good support to abort and bail out during the computation, but this feature may exercise error code paths that are normally not used that much. Consequently, it is not unlikely that hidden bugs will be exposed. void isl_ctx_set_max_operations(isl_ctx *ctx, unsigned long max_operations); unsigned long isl_ctx_get_max_operations(isl_ctx *ctx); void isl_ctx_reset_operations(isl_ctx *ctx); In order to be able to create an object in the same context as another object, most object types (described later in this document) provide a function to obtain the context in which the object was created. #include isl_ctx *isl_val_get_ctx(__isl_keep isl_val *val); isl_ctx *isl_multi_val_get_ctx( __isl_keep isl_multi_val *mv); #include isl_ctx *isl_id_get_ctx(__isl_keep isl_id *id); #include isl_ctx *isl_local_space_get_ctx( __isl_keep isl_local_space *ls); #include isl_ctx *isl_set_list_get_ctx( __isl_keep isl_set_list *list); #include isl_ctx *isl_aff_get_ctx(__isl_keep isl_aff *aff); isl_ctx *isl_multi_aff_get_ctx( __isl_keep isl_multi_aff *maff); isl_ctx *isl_pw_aff_get_ctx(__isl_keep isl_pw_aff *pa); isl_ctx *isl_pw_multi_aff_get_ctx( __isl_keep isl_pw_multi_aff *pma); isl_ctx *isl_multi_pw_aff_get_ctx( __isl_keep isl_multi_pw_aff *mpa); isl_ctx *isl_union_pw_aff_get_ctx( __isl_keep isl_union_pw_aff *upa); isl_ctx *isl_union_pw_multi_aff_get_ctx( __isl_keep isl_union_pw_multi_aff *upma); isl_ctx *isl_multi_union_pw_aff_get_ctx( __isl_keep isl_multi_union_pw_aff *mupa); #include isl_ctx *isl_id_to_ast_expr_get_ctx( __isl_keep isl_id_to_ast_expr *id2expr); #include isl_ctx *isl_point_get_ctx(__isl_keep isl_point *pnt); #include isl_ctx *isl_vec_get_ctx(__isl_keep isl_vec *vec); #include isl_ctx *isl_mat_get_ctx(__isl_keep isl_mat *mat); #include isl_ctx *isl_vertices_get_ctx( __isl_keep isl_vertices *vertices); isl_ctx *isl_vertex_get_ctx(__isl_keep isl_vertex *vertex); isl_ctx *isl_cell_get_ctx(__isl_keep isl_cell *cell); #include isl_ctx *isl_restriction_get_ctx( __isl_keep isl_restriction *restr); isl_ctx *isl_union_access_info_get_ctx( __isl_keep isl_union_access_info *access); isl_ctx *isl_union_flow_get_ctx( __isl_keep isl_union_flow *flow); #include isl_ctx *isl_schedule_get_ctx( __isl_keep isl_schedule *sched); isl_ctx *isl_schedule_constraints_get_ctx( __isl_keep isl_schedule_constraints *sc); #include isl_ctx *isl_schedule_node_get_ctx( __isl_keep isl_schedule_node *node); #include isl_ctx *isl_band_get_ctx(__isl_keep isl_band *band); #include isl_ctx *isl_ast_build_get_ctx( __isl_keep isl_ast_build *build); #include isl_ctx *isl_ast_expr_get_ctx( __isl_keep isl_ast_expr *expr); isl_ctx *isl_ast_node_get_ctx( __isl_keep isl_ast_node *node); =head2 Return Types C uses two special return types for functions that either return a boolean or that in principle do not return anything. In particular, the C type has three possible values: C (a positive integer value), indicating I or I; C (the integer value zero), indicating I or I; and C (a negative integer value), indicating that something went wrong. The C type has two possible values: C (the integer value zero), indicating a successful operation; and C (a negative integer value), indicating that something went wrong. See L for more information on C and C. =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_negone(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); __isl_null isl_val *isl_val_free(__isl_take isl_val *v); They can be inspected using the following functions. #include 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); isl_bool isl_val_is_zero(__isl_keep isl_val *v); isl_bool isl_val_is_one(__isl_keep isl_val *v); isl_bool isl_val_is_negone(__isl_keep isl_val *v); isl_bool isl_val_is_nonneg(__isl_keep isl_val *v); isl_bool isl_val_is_nonpos(__isl_keep isl_val *v); isl_bool isl_val_is_pos(__isl_keep isl_val *v); isl_bool isl_val_is_neg(__isl_keep isl_val *v); isl_bool isl_val_is_int(__isl_keep isl_val *v); isl_bool isl_val_is_rat(__isl_keep isl_val *v); isl_bool isl_val_is_nan(__isl_keep isl_val *v); isl_bool isl_val_is_infty(__isl_keep isl_val *v); isl_bool 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 isl_bool isl_val_lt(__isl_keep isl_val *v1, __isl_keep isl_val *v2); isl_bool isl_val_le(__isl_keep isl_val *v1, __isl_keep isl_val *v2); isl_bool isl_val_gt(__isl_keep isl_val *v1, __isl_keep isl_val *v2); isl_bool isl_val_ge(__isl_keep isl_val *v1, __isl_keep isl_val *v2); isl_bool isl_val_eq(__isl_keep isl_val *v1, __isl_keep isl_val *v2); isl_bool isl_val_ne(__isl_keep isl_val *v1, __isl_keep isl_val *v2); isl_bool isl_val_abs_eq(__isl_keep isl_val *v1, __isl_keep isl_val *v2); The function C checks whether its two arguments are equal in absolute value. For integer Cs we additionally have the following binary property. #include isl_bool 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); __isl_give isl_val *isl_val_inv(__isl_take isl_val *v); __isl_give isl_val *isl_val_2exp(__isl_take isl_val *v); The following binary operations are available on Cs. #include __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. =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); =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 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 a value indicating that some error has occurred. In case of functions returning a pointer, this value is C. In case of functions returning an C or an C, this valus is C or 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 isl_stat 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); __isl_null isl_id *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_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 similar 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); __isl_null isl_space *isl_space_free(__isl_take isl_space *space); 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. 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 isl_bool isl_space_is_params(__isl_keep isl_space *space); isl_bool isl_space_is_set(__isl_keep isl_space *space); isl_bool isl_space_is_map(__isl_keep isl_space *space); Spaces can be compared using the following functions: #include isl_bool isl_space_is_equal(__isl_keep isl_space *space1, __isl_keep isl_space *space2); isl_bool isl_space_is_domain(__isl_keep isl_space *space1, __isl_keep isl_space *space2); isl_bool isl_space_is_range(__isl_keep isl_space *space1, __isl_keep isl_space *space2); isl_bool isl_space_tuple_is_equal( __isl_keep isl_space *space1, enum isl_dim_type type1, __isl_keep isl_space *space2, enum isl_dim_type type2); 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. C checks whether the given tuples (C, C or C) of the given spaces are the same. That is, it checks if they have the same identifier (if any), the same dimension and the same internal structure (if any). 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_aff_get_space( __isl_keep isl_union_pw_aff *upa); __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); __isl_give isl_space * isl_multi_union_pw_aff_get_domain_space( __isl_keep isl_multi_union_pw_aff *mupa); __isl_give isl_space * isl_multi_union_pw_aff_get_space( __isl_keep isl_multi_union_pw_aff *mupa); #include __isl_give isl_space *isl_point_get_space( __isl_keep isl_point *pnt); The number of dimensions of a given type of space may be read off from a space or an object that lives in a space using the following functions. In case of C, type may be C, C (only for relations), C (only for relations), C (only for sets) or C. #include unsigned isl_space_dim(__isl_keep isl_space *space, enum isl_dim_type type); #include int isl_local_space_dim(__isl_keep isl_local_space *ls, enum isl_dim_type type); #include unsigned isl_basic_set_dim(__isl_keep isl_basic_set *bset, enum isl_dim_type type); unsigned isl_set_dim(__isl_keep isl_set *set, enum isl_dim_type type); #include unsigned isl_union_set_dim(__isl_keep isl_union_set *uset, enum isl_dim_type type); #include unsigned isl_basic_map_dim(__isl_keep isl_basic_map *bmap, enum isl_dim_type type); unsigned isl_map_dim(__isl_keep isl_map *map, enum isl_dim_type type); #include unsigned isl_union_map_dim(__isl_keep isl_union_map *umap, enum isl_dim_type type); #include unsigned isl_multi_val_dim(__isl_keep isl_multi_val *mv, enum isl_dim_type type); #include int isl_aff_dim(__isl_keep isl_aff *aff, enum isl_dim_type type); unsigned isl_multi_aff_dim(__isl_keep isl_multi_aff *maff, enum isl_dim_type type); unsigned isl_pw_aff_dim(__isl_keep isl_pw_aff *pwaff, 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); unsigned isl_union_pw_aff_dim( __isl_keep isl_union_pw_aff *upa, enum isl_dim_type type); unsigned isl_union_pw_multi_aff_dim( __isl_keep isl_union_pw_multi_aff *upma, enum isl_dim_type type); unsigned isl_multi_union_pw_aff_dim( __isl_keep isl_multi_union_pw_aff *mupa, enum isl_dim_type type); #include unsigned isl_union_pw_qpolynomial_dim( __isl_keep isl_union_pw_qpolynomial *upwqp, enum isl_dim_type type); unsigned isl_union_pw_qpolynomial_fold_dim( __isl_keep isl_union_pw_qpolynomial_fold *upwf, enum isl_dim_type type); Note that an C, an C, an C, an C and an C only have parameters. The identifiers or names of the individual dimensions of spaces may be set or read off using the following functions on spaces or objects that live in spaces. 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. #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); isl_bool 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); isl_bool 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); #include __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_bool 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_name( __isl_take isl_local_space *ls, enum isl_dim_type type, unsigned pos, const char *s); isl_bool 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); #include const char *isl_constraint_get_dim_name( __isl_keep isl_constraint *constraint, enum isl_dim_type type, unsigned pos); #include __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); isl_bool 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); const char *isl_basic_set_get_dim_name( __isl_keep isl_basic_set *bset, enum isl_dim_type type, unsigned pos); isl_bool 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); #include __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); isl_bool isl_basic_map_has_dim_id( __isl_keep isl_basic_map *bmap, enum isl_dim_type type, unsigned pos); isl_bool 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_id *isl_union_map_get_dim_id( __isl_keep isl_union_map *umap, 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); isl_bool 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); #include __isl_give isl_multi_val *isl_multi_val_set_dim_id( __isl_take isl_multi_val *mv, enum isl_dim_type type, unsigned pos, __isl_take isl_id *id); __isl_give isl_id *isl_multi_val_get_dim_id( __isl_keep isl_multi_val *mv, enum isl_dim_type type, unsigned pos); __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); #include __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_multi_aff *isl_multi_aff_set_dim_id( __isl_take isl_multi_aff *maff, 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_multi_pw_aff * isl_multi_pw_aff_set_dim_id( __isl_take isl_multi_pw_aff *mpa, enum isl_dim_type type, unsigned pos, __isl_take isl_id *id); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_set_dim_id( __isl_take isl_multi_union_pw_aff *mupa, enum isl_dim_type type, unsigned pos, __isl_take isl_id *id); __isl_give isl_id *isl_multi_aff_get_dim_id( __isl_keep isl_multi_aff *ma, enum isl_dim_type type, unsigned pos); isl_bool 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_multi_aff_get_dim_id( __isl_keep isl_pw_multi_aff *pma, enum isl_dim_type type, unsigned pos); __isl_give isl_id *isl_multi_pw_aff_get_dim_id( __isl_keep isl_multi_pw_aff *mpa, enum isl_dim_type type, unsigned pos); __isl_give isl_id *isl_multi_union_pw_aff_get_dim_id( __isl_keep isl_multi_union_pw_aff *mupa, enum isl_dim_type type, unsigned pos); __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_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_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_union_pw_aff * isl_union_pw_aff_set_dim_name( __isl_take isl_union_pw_aff *upa, enum isl_dim_type type, unsigned pos, const char *s); __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_set_dim_name( __isl_take isl_union_pw_multi_aff *upma, enum isl_dim_type type, unsigned pos, const char *s); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_set_dim_name( __isl_take isl_multi_union_pw_aff *mupa, enum isl_dim_type type, unsigned pos, 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); const char *isl_pw_multi_aff_get_dim_name( __isl_keep isl_pw_multi_aff *pma, enum isl_dim_type type, unsigned pos); #include __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); __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_union_pw_qpolynomial * isl_union_pw_qpolynomial_set_dim_name( __isl_take isl_union_pw_qpolynomial *upwqp, enum isl_dim_type type, unsigned pos, const char *s); __isl_give isl_union_pw_qpolynomial_fold * isl_union_pw_qpolynomial_fold_set_dim_name( __isl_take isl_union_pw_qpolynomial_fold *upwf, enum isl_dim_type type, unsigned pos, const char *s); 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 functions. #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); #include int isl_local_space_find_dim_by_name( __isl_keep isl_local_space *ls, enum isl_dim_type type, const char *name); #include int isl_multi_val_find_dim_by_id( __isl_keep isl_multi_val *mv, enum isl_dim_type type, __isl_keep isl_id *id); int isl_multi_val_find_dim_by_name( __isl_keep isl_multi_val *mv, enum isl_dim_type type, const char *name); #include 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); #include int isl_map_find_dim_by_id(__isl_keep isl_map *map, enum isl_dim_type type, __isl_keep isl_id *id); int isl_basic_map_find_dim_by_name( __isl_keep isl_basic_map *bmap, 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); int isl_union_map_find_dim_by_name( __isl_keep isl_union_map *umap, enum isl_dim_type type, const char *name); #include int isl_multi_aff_find_dim_by_id( __isl_keep isl_multi_aff *ma, enum isl_dim_type type, __isl_keep isl_id *id); int isl_multi_pw_aff_find_dim_by_id( __isl_keep isl_multi_pw_aff *mpa, enum isl_dim_type type, __isl_keep isl_id *id); int isl_multi_union_pw_aff_find_dim_by_id( __isl_keep isl_union_multi_pw_aff *mupa, enum isl_dim_type type, __isl_keep isl_id *id); int isl_aff_find_dim_by_name(__isl_keep isl_aff *aff, enum isl_dim_type type, const char *name); int isl_multi_aff_find_dim_by_name( __isl_keep isl_multi_aff *ma, enum isl_dim_type type, const char *name); int isl_pw_aff_find_dim_by_name(__isl_keep isl_pw_aff *pa, enum isl_dim_type type, const char *name); int isl_multi_pw_aff_find_dim_by_name( __isl_keep isl_multi_pw_aff *mpa, enum isl_dim_type type, const char *name); int isl_pw_multi_aff_find_dim_by_name( __isl_keep isl_pw_multi_aff *pma, enum isl_dim_type type, const char *name); int isl_union_pw_aff_find_dim_by_name( __isl_keep isl_union_pw_aff *upa, enum isl_dim_type type, const char *name); int isl_union_pw_multi_aff_find_dim_by_name( __isl_keep isl_union_pw_multi_aff *upma, enum isl_dim_type type, const char *name); int isl_multi_union_pw_aff_find_dim_by_name( __isl_keep isl_multi_union_pw_aff *mupa, enum isl_dim_type type, const char *name); #include int isl_pw_qpolynomial_find_dim_by_name( __isl_keep isl_pw_qpolynomial *pwqp, enum isl_dim_type type, const char *name); int isl_pw_qpolynomial_fold_find_dim_by_name( __isl_keep isl_pw_qpolynomial_fold *pwf, enum isl_dim_type type, const char *name); int isl_union_pw_qpolynomial_find_dim_by_name( __isl_keep isl_union_pw_qpolynomial *upwqp, enum isl_dim_type type, const char *name); int isl_union_pw_qpolynomial_fold_find_dim_by_name( __isl_keep isl_union_pw_qpolynomial_fold *upwf, 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); isl_bool 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); isl_bool 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); #include __isl_give isl_local_space *isl_local_space_set_tuple_id( __isl_take isl_local_space *ls, enum isl_dim_type type, __isl_take isl_id *id); #include __isl_give isl_basic_set *isl_basic_set_set_tuple_id( __isl_take isl_basic_set *bset, __isl_take isl_id *id); __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); isl_bool 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_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_tuple_name( __isl_keep isl_basic_set *bset); isl_bool isl_set_has_tuple_name(__isl_keep isl_set *set); const char *isl_set_get_tuple_name( __isl_keep isl_set *set); #include __isl_give isl_basic_map *isl_basic_map_set_tuple_id( __isl_take isl_basic_map *bmap, enum isl_dim_type type, __isl_take isl_id *id); __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); isl_bool 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); __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_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); isl_bool 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); #include __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_reset_tuple_id( __isl_take isl_multi_val *mv, enum isl_dim_type type); isl_bool isl_multi_val_has_tuple_id( __isl_keep isl_multi_val *mv, enum isl_dim_type type); __isl_give isl_id *isl_multi_val_get_tuple_id( __isl_keep isl_multi_val *mv, enum isl_dim_type type); __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); const char *isl_multi_val_get_tuple_name( __isl_keep isl_multi_val *mv, enum isl_dim_type type); #include __isl_give isl_aff *isl_aff_set_tuple_id( __isl_take isl_aff *aff, enum isl_dim_type type, __isl_take isl_id *id); __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_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_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_union_pw_aff * isl_multi_union_pw_aff_set_tuple_id( __isl_take isl_multi_union_pw_aff *mupa, enum isl_dim_type type, __isl_take isl_id *id); __isl_give isl_multi_aff *isl_multi_aff_reset_tuple_id( __isl_take isl_multi_aff *ma, enum isl_dim_type type); __isl_give isl_pw_aff *isl_pw_aff_reset_tuple_id( __isl_take isl_pw_aff *pa, enum isl_dim_type type); __isl_give isl_multi_pw_aff * isl_multi_pw_aff_reset_tuple_id( __isl_take isl_multi_pw_aff *mpa, enum isl_dim_type type); __isl_give isl_pw_multi_aff * isl_pw_multi_aff_reset_tuple_id( __isl_take isl_pw_multi_aff *pma, enum isl_dim_type type); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_reset_tuple_id( __isl_take isl_multi_union_pw_aff *mupa, enum isl_dim_type type); isl_bool isl_multi_aff_has_tuple_id( __isl_keep isl_multi_aff *ma, enum isl_dim_type type); __isl_give isl_id *isl_multi_aff_get_tuple_id( __isl_keep isl_multi_aff *ma, enum isl_dim_type type); isl_bool isl_pw_aff_has_tuple_id(__isl_keep isl_pw_aff *pa, enum isl_dim_type type); __isl_give isl_id *isl_pw_aff_get_tuple_id( __isl_keep isl_pw_aff *pa, enum isl_dim_type type); isl_bool 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); isl_bool isl_multi_pw_aff_has_tuple_id( __isl_keep isl_multi_pw_aff *mpa, enum isl_dim_type type); __isl_give isl_id *isl_multi_pw_aff_get_tuple_id( __isl_keep isl_multi_pw_aff *mpa, enum isl_dim_type type); isl_bool isl_multi_union_pw_aff_has_tuple_id( __isl_keep isl_multi_union_pw_aff *mupa, enum isl_dim_type type); __isl_give isl_id *isl_multi_union_pw_aff_get_tuple_id( __isl_keep isl_multi_union_pw_aff *mupa, enum isl_dim_type type); __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_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_union_pw_aff * isl_multi_union_pw_aff_set_tuple_name( __isl_take isl_multi_union_pw_aff *mupa, enum isl_dim_type type, const char *s); const char *isl_multi_aff_get_tuple_name( __isl_keep isl_multi_aff *multi, enum isl_dim_type type); isl_bool 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); const char *isl_multi_union_pw_aff_get_tuple_name( __isl_keep isl_multi_union_pw_aff *mupa, 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. To keep the names of all parameters and tuples, but reset the user pointers of all the corresponding identifiers, use the following function. #include __isl_give isl_space *isl_space_reset_user( __isl_take isl_space *space); #include __isl_give isl_set *isl_set_reset_user( __isl_take isl_set *set); #include __isl_give isl_map *isl_map_reset_user( __isl_take isl_map *map); #include __isl_give isl_union_set *isl_union_set_reset_user( __isl_take isl_union_set *uset); #include __isl_give isl_union_map *isl_union_map_reset_user( __isl_take isl_union_map *umap); #include __isl_give isl_multi_val *isl_multi_val_reset_user( __isl_take isl_multi_val *mv); #include __isl_give isl_multi_aff *isl_multi_aff_reset_user( __isl_take isl_multi_aff *ma); __isl_give isl_pw_aff *isl_pw_aff_reset_user( __isl_take isl_pw_aff *pa); __isl_give isl_multi_pw_aff *isl_multi_pw_aff_reset_user( __isl_take isl_multi_pw_aff *mpa); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_reset_user( __isl_take isl_pw_multi_aff *pma); __isl_give isl_union_pw_aff *isl_union_pw_aff_reset_user( __isl_take isl_union_pw_aff *upa); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_reset_user( __isl_take isl_multi_union_pw_aff *mupa); __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_reset_user( __isl_take isl_union_pw_multi_aff *upma); #include __isl_give isl_pw_qpolynomial * isl_pw_qpolynomial_reset_user( __isl_take isl_pw_qpolynomial *pwqp); __isl_give isl_union_pw_qpolynomial * isl_union_pw_qpolynomial_reset_user( __isl_take isl_union_pw_qpolynomial *upwqp); __isl_give isl_pw_qpolynomial_fold * isl_pw_qpolynomial_fold_reset_user( __isl_take isl_pw_qpolynomial_fold *pwf); __isl_give isl_union_pw_qpolynomial_fold * isl_union_pw_qpolynomial_fold_reset_user( __isl_take isl_union_pw_qpolynomial_fold *upwf); Spaces can be nested. In particular, the domain of a set or the domain or range of a relation can be a nested relation. This process is also called I. The functions for detecting, constructing and deconstructing such nested spaces can be found in the wrapping properties of L, the wrapping operations of L and the Cartesian product operations of L. Spaces can be created from other spaces using the functions described in L and L. =head2 Local Spaces A local space is essentially a space with zero or more existentially quantified variables. The local space of various objects 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); #include __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); 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_bool isl_local_space_is_params( __isl_keep isl_local_space *ls); isl_bool isl_local_space_is_set( __isl_keep isl_local_space *ls); __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); __isl_null isl_local_space *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 isl_bool 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 functions described in L and L. =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); 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); __isl_null isl_basic_set *isl_basic_set_free( __isl_take isl_basic_set *bset); __isl_null isl_set *isl_set_free(__isl_take isl_set *set); __isl_null isl_union_set *isl_union_set_free( __isl_take isl_union_set *uset); __isl_null isl_basic_map *isl_basic_map_free( __isl_take isl_basic_map *bmap); __isl_null isl_map *isl_map_free(__isl_take isl_map *map); __isl_null isl_union_map *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_constraint_alloc_equality( __isl_take isl_local_space *ls); __isl_give isl_constraint *isl_constraint_alloc_inequality( __isl_take isl_local_space *ls); __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_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_take 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); 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_constraint_alloc_equality(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_constraint_alloc_inequality(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_constraint_alloc_inequality(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). __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_set *isl_set_from_multi_pw_aff( __isl_take isl_multi_pw_aff *mpa); __isl_give isl_map *isl_map_from_multi_pw_aff( __isl_take isl_multi_pw_aff *mpa); __isl_give isl_union_map *isl_union_map_from_union_pw_aff( __isl_take isl_union_pw_aff *upa); __isl_give isl_union_map * isl_union_map_from_union_pw_multi_aff( __isl_take isl_union_pw_multi_aff *upma); __isl_give isl_union_map * isl_union_map_from_multi_union_pw_aff( __isl_take isl_multi_union_pw_aff *mupa); The C argument describes the domain of the resulting basic relation. It is required because the C may consist of zero affine expressions. The C passed to C is not allowed to be zero-dimensional. The domain of the result is the shared domain of the union piecewise affine elements. =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 isl_stat isl_union_set_foreach_set( __isl_keep isl_union_set *uset, isl_stat (*fn)(__isl_take isl_set *set, void *user), void *user); isl_stat isl_union_map_foreach_map( __isl_keep isl_union_map *umap, isl_stat (*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 isl_stat isl_set_foreach_basic_set(__isl_keep isl_set *set, isl_stat (*fn)(__isl_take isl_basic_set *bset, void *user), void *user); isl_stat isl_map_foreach_basic_map(__isl_keep isl_map *map, isl_stat (*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 or the number of basic maps in a map can be obtained from #include int isl_set_n_basic_set(__isl_keep isl_set *set); #include int isl_map_n_basic_map(__isl_keep isl_map *map); 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); isl_stat isl_basic_set_foreach_constraint( __isl_keep isl_basic_set *bset, isl_stat (*fn)(__isl_take isl_constraint *c, void *user), void *user); int isl_basic_map_n_constraint( __isl_keep isl_basic_map *bmap); isl_stat isl_basic_map_foreach_constraint( __isl_keep isl_basic_map *bmap, isl_stat (*fn)(__isl_take isl_constraint *c, void *user), void *user); __isl_null isl_constraint *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. isl_bool isl_constraint_is_equality( __isl_keep isl_constraint *constraint); It is also possible to obtain a list of constraints from a basic map or set #include __isl_give isl_constraint_list * isl_basic_map_get_constraint_list( __isl_keep isl_basic_map *bmap); __isl_give isl_constraint_list * isl_basic_set_get_constraint_list( __isl_keep isl_basic_set *bset); These functions require that all existentially quantified variables have an explicit representation. The returned list can be manipulated using the functions in L<"Lists">. The coefficients of the constraints can be inspected using the following functions. isl_bool isl_constraint_is_lower_bound( __isl_keep isl_constraint *constraint, enum isl_dim_type type, unsigned pos); isl_bool isl_constraint_is_upper_bound( __isl_keep isl_constraint *constraint, enum isl_dim_type type, unsigned pos); __isl_give isl_val *isl_constraint_get_constant_val( __isl_keep isl_constraint *constraint); __isl_give isl_val *isl_constraint_get_coefficient_val( __isl_keep isl_constraint *constraint, enum isl_dim_type type, int pos); 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. __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. For set inputs, they should be a permutation of C, C, C and C. For map inputs, they should be a permutation of C, C, C, C and C. =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 __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_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); 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. isl_stat isl_set_foreach_point(__isl_keep isl_set *set, isl_stat (*fn)(__isl_take isl_point *pnt, void *user), void *user); isl_stat isl_union_set_foreach_point( __isl_keep isl_union_set *uset, isl_stat (*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 isl_bool isl_point_is_void(__isl_keep isl_point *pnt); =head2 Functions Besides sets and relation, C also supports various types of functions. Each of these types is derived from the value type (see L) or from one of two primitive function types through the application of zero or more type constructors. We first describe the primitive type and then we describe the types derived from these primitive types. =head3 Primitive Functions C support two primitive function types, quasi-affine expressions and quasipolynomials. A quasi-affine expression is defined either over a parameter space or over a set and is composed of integer constants, parameters and set variables, addition, subtraction and integer division by an integer constant. For example, the quasi-affine expression [n] -> { [x] -> [2*floor((4 n + x)/9] } maps C to C<2*floor((4 n + x)/9>. A quasipolynomial is a polynomial expression in quasi-affine expression. That is, it additionally allows for multiplication. Note, though, that it is not allowed to construct an integer division of an expression involving multiplications. Here is an example of a quasipolynomial that is not quasi-affine expression [n] -> { [x] -> (n*floor((4 n + x)/9) } Note that the external representations of quasi-affine expressions and quasipolynomials are different. Quasi-affine expressions use a notation with square brackets just like binary relations, while quasipolynomials do not. This might change at some point. If a primitive function is defined over a parameter space, then the space of the function itself is that of a set. If it is defined over a set, then the space of the function is that of a relation. In both cases, the set space (or the output space) is single-dimensional, anonymous and unstructured. To create functions with multiple dimensions or with other kinds of set or output spaces, use multiple expressions (see L). =over =item * Quasi-affine Expressions Besides the expressions described above, a quasi-affine expression can also be set to NaN. Such expressions typically represent a failure to represent a result as a quasi-affine expression. The zero quasi affine expression or the quasi affine expression that is equal to a given value or a specified dimension on a given domain can be created using #include __isl_give isl_aff *isl_aff_zero_on_domain( __isl_take isl_local_space *ls); __isl_give isl_aff *isl_aff_val_on_domain( __isl_take isl_local_space *ls, __isl_take isl_val *val); __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_nan_on_domain( __isl_take isl_local_space *ls); Quasi affine expressions can be copied and freed using #include __isl_give isl_aff *isl_aff_copy( __isl_keep isl_aff *aff); __isl_null isl_aff *isl_aff_free( __isl_take isl_aff *aff); 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 coefficients and the integer divisions of an affine expression can be inspected using the following functions. #include __isl_give isl_val *isl_aff_get_constant_val( __isl_keep isl_aff *aff); __isl_give isl_val *isl_aff_get_coefficient_val( __isl_keep isl_aff *aff, enum isl_dim_type type, int pos); int isl_aff_coefficient_sgn(__isl_keep isl_aff *aff, enum isl_dim_type type, int pos); __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); They can be modified using the following functions. #include __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_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_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_si( __isl_take isl_aff *aff, 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); Note that 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. =item * Quasipolynomials Some simple quasipolynomials can be created using the following functions. #include __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_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); Recall 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. Quasipolynomials can be copied and freed again using the following functions. #include __isl_give isl_qpolynomial *isl_qpolynomial_copy( __isl_keep isl_qpolynomial *qp); __isl_null isl_qpolynomial *isl_qpolynomial_free( __isl_take isl_qpolynomial *qp); 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 isl_stat isl_qpolynomial_foreach_term( __isl_keep isl_qpolynomial *qp, isl_stat (*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); __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. =back =head3 Reductions A reduction represents a maximum or a minimum of its base expressions. The only reduction type defined by C is C. There are currently no functions to directly create such objects, but they do appear in the piecewise quasipolynomial reductions returned by the C function. See L. Reductions can be copied and freed using the following functions. #include __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); To iterate over all quasipolynomials in a reduction, use isl_stat isl_qpolynomial_fold_foreach_qpolynomial( __isl_keep isl_qpolynomial_fold *fold, isl_stat (*fn)(__isl_take isl_qpolynomial *qp, void *user), void *user); =head3 Multiple Expressions A multiple expression represents a sequence of zero or more base expressions, all defined on the same domain space. The domain space of the multiple expression is the same as that of the base expressions, but the range space can be any space. In case the base expressions have a set space, the corresponding multiple expression also has a set space. Objects of the value type do not have an associated space. The space of a multiple value is therefore always a set space. Similarly, the space of a multiple union piecewise affine expression is always a set space. The multiple expression types defined by C are C, C, C, C. A multiple expression with the value zero for each output (or set) dimension can be created using the following functions. #include __isl_give isl_multi_val *isl_multi_val_zero( __isl_take isl_space *space); #include __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_union_pw_aff * isl_multi_union_pw_aff_zero( __isl_take isl_space *space); Since there is no canonical way of representing a zero value of type C, the space passed to C needs to be zero-dimensional. An identity function can be created using the following functions. The space needs to be that of a relation with the same number of input and output dimensions. #include __isl_give isl_multi_aff *isl_multi_aff_identity( __isl_take isl_space *space); __isl_give isl_multi_pw_aff *isl_multi_pw_aff_identity( __isl_take isl_space *space); A function that performs a projection on a universe relation or set can be created using the following functions. See also the corresponding projection operations in L. #include __isl_give isl_multi_aff *isl_multi_aff_domain_map( __isl_take isl_space *space); __isl_give isl_multi_aff *isl_multi_aff_range_map( __isl_take isl_space *space); __isl_give isl_multi_aff *isl_multi_aff_project_out_map( __isl_take isl_space *space, enum isl_dim_type type, unsigned first, unsigned n); A multiple expression can be created from a single base expression using the following functions. The space of the created multiple expression is the same as that of the base expression, except for C where the input lives in a parameter space and the output lives in a single-dimensional set space. #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_union_pw_aff * isl_multi_union_pw_aff_from_union_pw_aff( __isl_take isl_union_pw_aff *upa); A multiple expression can be created from a list of base expression in a specified space. The domain of this space needs to be the same as the domains of the base expressions in the list. If the base expressions have a set space (or no associated space), then this space also needs to be a set space. #include __isl_give isl_multi_val *isl_multi_val_from_val_list( __isl_take isl_space *space, __isl_take isl_val_list *list); #include __isl_give isl_multi_aff *isl_multi_aff_from_aff_list( __isl_take isl_space *space, __isl_take isl_aff_list *list); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_from_union_pw_aff_list( __isl_take isl_space *space, __isl_take isl_union_pw_aff_list *list); As a convenience, a multiple piecewise expression can also be created from a multiple expression. Each piecewise expression in the result has a single universe cell. #include __isl_give isl_multi_pw_aff * isl_multi_pw_aff_from_multi_aff( __isl_take isl_multi_aff *ma); Similarly, a multiple union expression can be created from a multiple expression. #include __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_from_multi_aff( __isl_take isl_multi_aff *ma); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_from_multi_pw_aff( __isl_take isl_multi_pw_aff *mpa); A multiple quasi-affine expression can be created from a multiple value with a given domain space using the following function. #include __isl_give isl_multi_aff * isl_multi_aff_multi_val_on_space( __isl_take isl_space *space, __isl_take isl_multi_val *mv); Similarly, a multiple union piecewise affine expression can be created from a multiple value with a given domain or a multiple affine expression with a given domain using the following functions. #include __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_multi_val_on_domain( __isl_take isl_union_set *domain, __isl_take isl_multi_val *mv); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_multi_aff_on_domain( __isl_take isl_union_set *domain, __isl_take isl_multi_aff *ma); Multiple expressions can be copied and freed using the following functions. #include __isl_give isl_multi_val *isl_multi_val_copy( __isl_keep isl_multi_val *mv); __isl_null isl_multi_val *isl_multi_val_free( __isl_take isl_multi_val *mv); #include __isl_give isl_multi_aff *isl_multi_aff_copy( __isl_keep isl_multi_aff *maff); __isl_null isl_multi_aff *isl_multi_aff_free( __isl_take isl_multi_aff *maff); __isl_give isl_multi_pw_aff *isl_multi_pw_aff_copy( __isl_keep isl_multi_pw_aff *mpa); __isl_null isl_multi_pw_aff *isl_multi_pw_aff_free( __isl_take isl_multi_pw_aff *mpa); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_copy( __isl_keep isl_multi_union_pw_aff *mupa); __isl_null isl_multi_union_pw_aff * isl_multi_union_pw_aff_free( __isl_take isl_multi_union_pw_aff *mupa); The base expression at a given position of a multiple expression can be extracted using the following functions. #include __isl_give isl_val *isl_multi_val_get_val( __isl_keep isl_multi_val *mv, int pos); #include __isl_give isl_aff *isl_multi_aff_get_aff( __isl_keep isl_multi_aff *multi, int pos); __isl_give isl_pw_aff *isl_multi_pw_aff_get_pw_aff( __isl_keep isl_multi_pw_aff *mpa, int pos); __isl_give isl_union_pw_aff * isl_multi_union_pw_aff_get_union_pw_aff( __isl_keep isl_multi_union_pw_aff *mupa, int pos); It can be replaced using the following functions. #include __isl_give isl_multi_val *isl_multi_val_set_val( __isl_take isl_multi_val *mv, int pos, __isl_take isl_val *val); #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_multi_union_pw_aff * isl_multi_union_pw_aff_set_union_pw_aff( __isl_take isl_multi_union_pw_aff *mupa, int pos, __isl_take isl_union_pw_aff *upa); As a convenience, a sequence of base expressions that have their domains in a given space can be extracted from a sequence of union expressions using the following function. #include __isl_give isl_multi_pw_aff * isl_multi_union_pw_aff_extract_multi_pw_aff( __isl_keep isl_multi_union_pw_aff *mupa, __isl_take isl_space *space); Note that there is a difference between C and C objects. The first is a sequence of unions of piecewise expressions, while the second is a union of piecewise sequences. In particular, multiple affine expressions in an C may live in different spaces, while there is only a single multiple expression in an C, which can therefore only live in a single space. This means that not every C can be converted to an C. Conversely, a zero-dimensional C carries no information about any possible domain and therefore cannot be converted to an C. Moreover, the elements of an C may be defined over different domains, while each multiple expression inside an C has a single domain. The conversion of an C of dimension greater than one may therefore not be exact. The following functions can be used to perform these conversions when they are possible. #include __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_from_union_pw_multi_aff( __isl_take isl_union_pw_multi_aff *upma); __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_from_multi_union_pw_aff( __isl_take isl_multi_union_pw_aff *mupa); =head3 Piecewise Expressions A piecewise expression is an expression that is described using zero or more base expression defined over the same number of cells in the domain space of the base expressions. All base expressions are defined over the same domain space and the cells are disjoint. The space of a piecewise expression is the same as that of the base expressions. If the union of the cells is a strict subset of the domain space, then the value of the piecewise expression outside this union is different for types derived from quasi-affine expressions and those derived from quasipolynomials. Piecewise expressions derived from quasi-affine expressions are considered to be undefined outside the union of their cells. Piecewise expressions derived from quasipolynomials are considered to be zero outside the union of their cells. 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 [n] -> { [x] -> ((1 + n) - x) : x <= n and x >= 0 } represents the number of points in the map [n] -> { [x] -> [y] : x,y >= 0 and 0 <= x + y <= n } The piecewise expression types defined by C are C, C, C and C. A piecewise expression with no cells 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_multi_aff *isl_pw_multi_aff_empty( __isl_take isl_space *space); A piecewise expression with a single universe cell can be created using the following functions. #include __isl_give isl_pw_aff *isl_pw_aff_from_aff( __isl_take isl_aff *aff); __isl_give isl_pw_multi_aff * isl_pw_multi_aff_from_multi_aff( __isl_take isl_multi_aff *ma); #include __isl_give isl_pw_qpolynomial * isl_pw_qpolynomial_from_qpolynomial( __isl_take isl_qpolynomial *qp); A piecewise expression with a single specified cell can be created using the following functions. #include __isl_give isl_pw_aff *isl_pw_aff_alloc( __isl_take isl_set *set, __isl_take isl_aff *aff); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_alloc( __isl_take isl_set *set, __isl_take isl_multi_aff *maff); #include __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_alloc( __isl_take isl_set *set, __isl_take isl_qpolynomial *qp); The following convenience functions first create a base expression and then create a piecewise expression over a universe domain. #include __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_pw_aff_nan_on_domain( __isl_take isl_local_space *ls); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_zero( __isl_take isl_space *space); __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_range_map( __isl_take isl_space *space); __isl_give isl_pw_multi_aff * isl_pw_multi_aff_project_out_map( __isl_take isl_space *space, enum isl_dim_type type, unsigned first, unsigned n); #include __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_zero( __isl_take isl_space *space); The following convenience functions first create a base expression and then create a piecewise expression over a given domain. #include __isl_give isl_pw_aff *isl_pw_aff_val_on_domain( __isl_take isl_set *domain, __isl_take isl_val *v); __isl_give isl_pw_multi_aff * isl_pw_multi_aff_multi_val_on_domain( __isl_take isl_set *domain, __isl_take isl_multi_val *mv); As a convenience, a piecewise multiple expression can also be created from a piecewise expression. Each multiple expression in the result is derived from the corresponding base expression. #include __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_pw_aff( __isl_take isl_pw_aff *pa); Similarly, a piecewise quasipolynomial can be created from a piecewise quasi-affine expression using the following function. #include __isl_give isl_pw_qpolynomial * isl_pw_qpolynomial_from_pw_aff( __isl_take isl_pw_aff *pwaff); Piecewise expressions can be copied and freed using the following functions. #include __isl_give isl_pw_aff *isl_pw_aff_copy( __isl_keep isl_pw_aff *pwaff); __isl_null isl_pw_aff *isl_pw_aff_free( __isl_take isl_pw_aff *pwaff); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_copy( __isl_keep isl_pw_multi_aff *pma); __isl_null isl_pw_multi_aff *isl_pw_multi_aff_free( __isl_take isl_pw_multi_aff *pma); #include __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_copy( __isl_keep isl_pw_qpolynomial *pwqp); __isl_null isl_pw_qpolynomial *isl_pw_qpolynomial_free( __isl_take isl_pw_qpolynomial *pwqp); __isl_give isl_pw_qpolynomial_fold * isl_pw_qpolynomial_fold_copy( __isl_keep isl_pw_qpolynomial_fold *pwf); __isl_null isl_pw_qpolynomial_fold * isl_pw_qpolynomial_fold_free( __isl_take isl_pw_qpolynomial_fold *pwf); To iterate over the different cells of a piecewise expression, use the following functions. #include isl_bool isl_pw_aff_is_empty(__isl_keep isl_pw_aff *pwaff); int isl_pw_aff_n_piece(__isl_keep isl_pw_aff *pwaff); isl_stat isl_pw_aff_foreach_piece( __isl_keep isl_pw_aff *pwaff, isl_stat (*fn)(__isl_take isl_set *set, __isl_take isl_aff *aff, void *user), void *user); isl_stat isl_pw_multi_aff_foreach_piece( __isl_keep isl_pw_multi_aff *pma, isl_stat (*fn)(__isl_take isl_set *set, __isl_take isl_multi_aff *maff, void *user), void *user); #include isl_stat isl_pw_qpolynomial_foreach_piece( __isl_keep isl_pw_qpolynomial *pwqp, isl_stat (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp, void *user), void *user); isl_stat isl_pw_qpolynomial_foreach_lifted_piece( __isl_keep isl_pw_qpolynomial *pwqp, isl_stat (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp, void *user), void *user); isl_stat isl_pw_qpolynomial_fold_foreach_piece( __isl_keep isl_pw_qpolynomial_fold *pwf, isl_stat (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial_fold *fold, void *user), void *user); isl_stat isl_pw_qpolynomial_fold_foreach_lifted_piece( __isl_keep isl_pw_qpolynomial_fold *pwf, isl_stat (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial_fold *fold, 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. Similarly for C and C. A piecewise expression consisting of the expressions at a given position of a piecewise multiple expression can be extracted using the following function. #include __isl_give isl_pw_aff *isl_pw_multi_aff_get_pw_aff( __isl_keep isl_pw_multi_aff *pma, int pos); These expressions can be replaced using the following function. #include __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); Note that there is a difference between C and C objects. The first is a sequence of piecewise affine expressions, while the second is a piecewise sequence of affine expressions. In particular, each of the piecewise affine expressions in an C may have a different domain, while all multiple expressions associated to a cell in an C have the same domain. It is possible to convert between the two, but when converting an C to an C, the domain of the result is the intersection of the domains of the input. The reverse conversion is exact. #include __isl_give isl_pw_multi_aff * isl_pw_multi_aff_from_multi_pw_aff( __isl_take isl_multi_pw_aff *mpa); __isl_give isl_multi_pw_aff * isl_multi_pw_aff_from_pw_multi_aff( __isl_take isl_pw_multi_aff *pma); =head3 Union Expressions A union expression collects base expressions defined over different domains. The space of a union expression is that of the shared parameter space. The union expression types defined by C are C, C, C and C. An empty union expression can be created using the following functions. #include __isl_give isl_union_pw_aff *isl_union_pw_aff_empty( __isl_take isl_space *space); __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_empty( __isl_take isl_space *space); #include __isl_give isl_union_pw_qpolynomial * isl_union_pw_qpolynomial_zero( __isl_take isl_space *space); A union expression containing a single base expression can be created using the following functions. #include __isl_give isl_union_pw_aff * isl_union_pw_aff_from_pw_aff( __isl_take isl_pw_aff *pa); __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_from_aff( __isl_take isl_aff *aff); __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_from_pw_multi_aff( __isl_take isl_pw_multi_aff *pma); #include __isl_give isl_union_pw_qpolynomial * isl_union_pw_qpolynomial_from_pw_qpolynomial( __isl_take isl_pw_qpolynomial *pwqp); The following functions create a base expression on each of the sets in the union set and collect the results. #include __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_from_union_pw_aff( __isl_take isl_union_pw_aff *upa); __isl_give isl_union_pw_aff * isl_union_pw_multi_aff_get_union_pw_aff( __isl_keep isl_union_pw_multi_aff *upma, int pos); __isl_give isl_union_pw_aff * isl_union_pw_aff_val_on_domain( __isl_take isl_union_set *domain, __isl_take isl_val *v); __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_multi_val_on_domain( __isl_take isl_union_set *domain, __isl_take isl_multi_val *mv); An C that is equal to a (parametric) affine expression on a given domain can be created using the following function. #include __isl_give isl_union_pw_aff * isl_union_pw_aff_aff_on_domain( __isl_take isl_union_set *domain, __isl_take isl_aff *aff); A base expression can be added to a union expression using the following functions. #include __isl_give isl_union_pw_aff * isl_union_pw_aff_add_pw_aff( __isl_take isl_union_pw_aff *upa, __isl_take isl_pw_aff *pa); __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); #include __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); Union expressions can be copied and freed using the following functions. #include __isl_give isl_union_pw_aff *isl_union_pw_aff_copy( __isl_keep isl_union_pw_aff *upa); __isl_null isl_union_pw_aff *isl_union_pw_aff_free( __isl_take isl_union_pw_aff *upa); __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_copy( __isl_keep isl_union_pw_multi_aff *upma); __isl_null isl_union_pw_multi_aff * isl_union_pw_multi_aff_free( __isl_take isl_union_pw_multi_aff *upma); #include __isl_give isl_union_pw_qpolynomial * isl_union_pw_qpolynomial_copy( __isl_keep isl_union_pw_qpolynomial *upwqp); __isl_null isl_union_pw_qpolynomial * isl_union_pw_qpolynomial_free( __isl_take isl_union_pw_qpolynomial *upwqp); __isl_give isl_union_pw_qpolynomial_fold * isl_union_pw_qpolynomial_fold_copy( __isl_keep isl_union_pw_qpolynomial_fold *upwf); __isl_null isl_union_pw_qpolynomial_fold * isl_union_pw_qpolynomial_fold_free( __isl_take isl_union_pw_qpolynomial_fold *upwf); To iterate over the base expressions in a union expression, use the following functions. #include int isl_union_pw_aff_n_pw_aff( __isl_keep isl_union_pw_aff *upa); isl_stat isl_union_pw_aff_foreach_pw_aff( __isl_keep isl_union_pw_aff *upa, isl_stat (*fn)(__isl_take isl_pw_aff *ma, void *user), void *user); int isl_union_pw_multi_aff_n_pw_multi_aff( __isl_keep isl_union_pw_multi_aff *upma); isl_stat isl_union_pw_multi_aff_foreach_pw_multi_aff( __isl_keep isl_union_pw_multi_aff *upma, isl_stat (*fn)(__isl_take isl_pw_multi_aff *pma, void *user), void *user); #include int isl_union_pw_qpolynomial_n_pw_qpolynomial( __isl_keep isl_union_pw_qpolynomial *upwqp); isl_stat isl_union_pw_qpolynomial_foreach_pw_qpolynomial( __isl_keep isl_union_pw_qpolynomial *upwqp, isl_stat (*fn)(__isl_take isl_pw_qpolynomial *pwqp, void *user), void *user); int isl_union_pw_qpolynomial_fold_n_pw_qpolynomial_fold( __isl_keep isl_union_pw_qpolynomial_fold *upwf); isl_stat isl_union_pw_qpolynomial_fold_foreach_pw_qpolynomial_fold( __isl_keep isl_union_pw_qpolynomial_fold *upwf, isl_stat (*fn)(__isl_take isl_pw_qpolynomial_fold *pwf, void *user), void *user); To extract the base expression in a given space from a union, use the following functions. #include __isl_give isl_pw_aff *isl_union_pw_aff_extract_pw_aff( __isl_keep isl_union_pw_aff *upa, __isl_take isl_space *space); __isl_give isl_pw_multi_aff * isl_union_pw_multi_aff_extract_pw_multi_aff( __isl_keep isl_union_pw_multi_aff *upma, __isl_take isl_space *space); #include __isl_give isl_pw_qpolynomial * isl_union_pw_qpolynomial_extract_pw_qpolynomial( __isl_keep isl_union_pw_qpolynomial *upwqp, __isl_take isl_space *space); =head2 Input and Output For set and relation, C supports its own input/output format, which is similar to the C format, but also supports the C format in some cases. For other object types, typically only an C format is supported. =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 Objects can be read from input using the following functions. #include __isl_give isl_val *isl_val_read_from_str(isl_ctx *ctx, const char *str); __isl_give isl_multi_val *isl_multi_val_read_from_str( isl_ctx *ctx, const char *str); #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); #include __isl_give isl_aff *isl_aff_read_from_str( isl_ctx *ctx, const char *str); __isl_give isl_multi_aff *isl_multi_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); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_read_from_str( isl_ctx *ctx, const char *str); __isl_give isl_multi_pw_aff *isl_multi_pw_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); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_read_from_str( isl_ctx *ctx, const char *str); #include __isl_give isl_union_pw_qpolynomial * isl_union_pw_qpolynomial_read_from_str( isl_ctx *ctx, const char *str); For sets and relations, 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); __isl_null isl_printer *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); int isl_printer_get_yaml_style(__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_set_indent_prefix( __isl_take isl_printer *p, const char *prefix); __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); __isl_give isl_printer *isl_printer_set_yaml_style( __isl_take isl_printer *p, int yaml_style); The C may be either C, C, C, C or C and defaults to C. Each line in the output is prefixed by C, 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). The YAML style may be either C or C and when we are printing something in YAML format. 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_val( __isl_take isl_printer *p, __isl_keep isl_val *v); #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); #include __isl_give isl_printer *isl_printer_print_multi_val( __isl_take isl_printer *p, __isl_keep isl_multi_val *mv); #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_multi_aff( __isl_take isl_printer *p, __isl_keep isl_multi_aff *maff); __isl_give isl_printer *isl_printer_print_pw_aff( __isl_take isl_printer *p, __isl_keep isl_pw_aff *pwaff); __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_multi_pw_aff( __isl_take isl_printer *p, __isl_keep isl_multi_pw_aff *mpa); __isl_give isl_printer *isl_printer_print_union_pw_aff( __isl_take isl_printer *p, __isl_keep isl_union_pw_aff *upa); __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_union_pw_aff( __isl_take isl_printer *p, __isl_keep isl_multi_union_pw_aff *mupa); #include __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); __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, C and C, the output format of the printer needs to be set to either C or C. For C and C, only C is supported. In case of printing in C, the user may want to set the names of all dimensions first. C also provides limited support for printing YAML documents, just enough for the internal use for printing such documents. #include __isl_give isl_printer *isl_printer_yaml_start_mapping( __isl_take isl_printer *p); __isl_give isl_printer *isl_printer_yaml_end_mapping( __isl_take isl_printer *p); __isl_give isl_printer *isl_printer_yaml_start_sequence( __isl_take isl_printer *p); __isl_give isl_printer *isl_printer_yaml_end_sequence( __isl_take isl_printer *p); __isl_give isl_printer *isl_printer_yaml_next( __isl_take isl_printer *p); A document is started by a call to either C or C. Anything printed to the printer after such a call belong to the first key of the mapping or the first element in the sequence. The function C moves to the value if we are currently printing a mapping key, the next key if we are printing a value or the next element if we are printing an element in a sequence. Nested mappings and sequences are initiated by the same C or C. Each call to these functions needs to have a corresponding call to C or C. 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); Alternatively, a string representation can be obtained directly using the following functions, which always print in isl format. #include __isl_give char *isl_space_to_str( __isl_keep isl_space *space); #include __isl_give char *isl_val_to_str(__isl_keep isl_val *v); __isl_give char *isl_multi_val_to_str( __isl_keep isl_multi_val *mv); #include __isl_give char *isl_set_to_str( __isl_keep isl_set *set); #include __isl_give char *isl_union_set_to_str( __isl_keep isl_union_set *uset); #include __isl_give char *isl_map_to_str( __isl_keep isl_map *map); #include __isl_give char *isl_union_map_to_str( __isl_keep isl_union_map *umap); #include __isl_give char *isl_multi_aff_to_str( __isl_keep isl_multi_aff *aff); __isl_give char *isl_union_pw_aff_to_str( __isl_keep isl_union_pw_aff *upa); __isl_give char *isl_union_pw_multi_aff_to_str( __isl_keep isl_union_pw_multi_aff *upma); __isl_give char *isl_multi_union_pw_aff_to_str( __isl_keep isl_multi_union_pw_aff *mupa); =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. isl_bool isl_basic_set_plain_is_empty( __isl_keep isl_basic_set *bset); isl_bool isl_basic_set_is_empty( __isl_keep isl_basic_set *bset); isl_bool isl_set_plain_is_empty( __isl_keep isl_set *set); isl_bool isl_set_is_empty(__isl_keep isl_set *set); isl_bool isl_union_set_is_empty( __isl_keep isl_union_set *uset); isl_bool isl_basic_map_plain_is_empty( __isl_keep isl_basic_map *bmap); isl_bool isl_basic_map_is_empty( __isl_keep isl_basic_map *bmap); isl_bool isl_map_plain_is_empty( __isl_keep isl_map *map); isl_bool isl_map_is_empty(__isl_keep isl_map *map); isl_bool isl_union_map_is_empty( __isl_keep isl_union_map *umap); =item * Universality isl_bool isl_basic_set_is_universe( __isl_keep isl_basic_set *bset); isl_bool isl_basic_map_is_universe( __isl_keep isl_basic_map *bmap); isl_bool isl_set_plain_is_universe( __isl_keep isl_set *set); isl_bool isl_map_plain_is_universe( __isl_keep isl_map *map); =item * Single-valuedness #include isl_bool isl_set_is_singleton(__isl_keep isl_set *set); #include isl_bool isl_basic_map_is_single_valued( __isl_keep isl_basic_map *bmap); isl_bool isl_map_plain_is_single_valued( __isl_keep isl_map *map); isl_bool isl_map_is_single_valued(__isl_keep isl_map *map); #include isl_bool isl_union_map_is_single_valued( __isl_keep isl_union_map *umap); =item * Injectivity isl_bool isl_map_plain_is_injective( __isl_keep isl_map *map); isl_bool isl_map_is_injective( __isl_keep isl_map *map); isl_bool isl_union_map_plain_is_injective( __isl_keep isl_union_map *umap); isl_bool isl_union_map_is_injective( __isl_keep isl_union_map *umap); =item * Bijectivity isl_bool isl_map_is_bijective( __isl_keep isl_map *map); isl_bool isl_union_map_is_bijective( __isl_keep isl_union_map *umap); =item * Position __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 isl_stat 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 * Dependence To check whether the description of a set, relation or function depends on one or more given dimensions, the following functions can be used. #include isl_bool isl_constraint_involves_dims( __isl_keep isl_constraint *constraint, enum isl_dim_type type, unsigned first, unsigned n); #include isl_bool isl_basic_set_involves_dims( __isl_keep isl_basic_set *bset, enum isl_dim_type type, unsigned first, unsigned n); isl_bool isl_set_involves_dims(__isl_keep isl_set *set, enum isl_dim_type type, unsigned first, unsigned n); #include isl_bool isl_basic_map_involves_dims( __isl_keep isl_basic_map *bmap, enum isl_dim_type type, unsigned first, unsigned n); isl_bool isl_map_involves_dims(__isl_keep isl_map *map, enum isl_dim_type type, unsigned first, unsigned n); #include isl_bool isl_union_map_involves_dims( __isl_keep isl_union_map *umap, enum isl_dim_type type, unsigned first, unsigned n); #include isl_bool isl_aff_involves_dims(__isl_keep isl_aff *aff, enum isl_dim_type type, unsigned first, unsigned n); isl_bool isl_pw_aff_involves_dims( __isl_keep isl_pw_aff *pwaff, enum isl_dim_type type, unsigned first, unsigned n); isl_bool isl_multi_aff_involves_dims( __isl_keep isl_multi_aff *ma, enum isl_dim_type type, unsigned first, unsigned n); isl_bool isl_multi_pw_aff_involves_dims( __isl_keep isl_multi_pw_aff *mpa, enum isl_dim_type type, unsigned first, unsigned n); #include isl_bool isl_qpolynomial_involves_dims( __isl_keep isl_qpolynomial *qp, 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. #include isl_bool isl_set_dim_has_any_lower_bound( __isl_keep isl_set *set, enum isl_dim_type type, unsigned pos); isl_bool 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. #include isl_bool isl_set_dim_has_lower_bound( __isl_keep isl_set *set, enum isl_dim_type type, unsigned pos); isl_bool isl_set_dim_has_upper_bound( __isl_keep isl_set *set, enum isl_dim_type type, unsigned pos); =item * Space To check whether a set is a parameter domain, use this function: isl_bool isl_set_is_params(__isl_keep isl_set *set); isl_bool isl_union_set_is_params( __isl_keep isl_union_set *uset); =item * Wrapping The following functions check whether the space of the given (basic) set or relation range is a wrapped relation. #include isl_bool isl_space_is_wrapping( __isl_keep isl_space *space); isl_bool isl_space_domain_is_wrapping( __isl_keep isl_space *space); isl_bool isl_space_range_is_wrapping( __isl_keep isl_space *space); #include isl_bool isl_basic_set_is_wrapping( __isl_keep isl_basic_set *bset); isl_bool isl_set_is_wrapping(__isl_keep isl_set *set); #include isl_bool isl_map_domain_is_wrapping( __isl_keep isl_map *map); isl_bool isl_map_range_is_wrapping( __isl_keep isl_map *map); #include isl_bool isl_multi_val_range_is_wrapping( __isl_keep isl_multi_val *mv); #include isl_bool isl_multi_aff_range_is_wrapping( __isl_keep isl_multi_aff *ma); isl_bool isl_multi_pw_aff_range_is_wrapping( __isl_keep isl_multi_pw_aff *mpa); isl_bool isl_multi_union_pw_aff_range_is_wrapping( __isl_keep isl_multi_union_pw_aff *mupa); The input to C should be the space of a set, while that of C and C should be the space of a relation. =item * Internal Product isl_bool isl_basic_map_can_zip( __isl_keep isl_basic_map *bmap); isl_bool 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 isl_bool isl_basic_map_can_curry( __isl_keep isl_basic_map *bmap); isl_bool isl_map_can_curry(__isl_keep isl_map *map); Check whether the domain of the (basic) relation is a wrapped relation. isl_bool isl_basic_map_can_uncurry( __isl_keep isl_basic_map *bmap); isl_bool isl_map_can_uncurry(__isl_keep isl_map *map); Check whether the range of the (basic) relation is a wrapped relation. =item * Special Values #include isl_bool isl_aff_is_cst(__isl_keep isl_aff *aff); isl_bool isl_pw_aff_is_cst(__isl_keep isl_pw_aff *pwaff); Check whether the given expression is a constant. #include isl_bool isl_aff_is_nan(__isl_keep isl_aff *aff); isl_bool isl_pw_aff_involves_nan( __isl_keep isl_pw_aff *pa); #include isl_bool isl_qpolynomial_fold_is_nan( __isl_keep isl_qpolynomial_fold *fold); Check whether the given expression is equal to or involves NaN. #include isl_bool isl_aff_plain_is_zero( __isl_keep isl_aff *aff); Check whether the affine expression is obviously zero. =back =head3 Binary Properties =over =item * Equality The following functions check whether two objects represent the same set, relation or function. The C variants only return true if the objects are obviously the same. That is, they may return false even if the objects are the same, but they will never return true if the objects are not the same. #include isl_bool isl_basic_set_plain_is_equal( __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2); isl_bool isl_basic_set_is_equal( __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2); isl_bool isl_set_plain_is_equal( __isl_keep isl_set *set1, __isl_keep isl_set *set2); isl_bool isl_set_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2); #include isl_bool isl_basic_map_is_equal( __isl_keep isl_basic_map *bmap1, __isl_keep isl_basic_map *bmap2); isl_bool isl_map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2); isl_bool isl_map_plain_is_equal( __isl_keep isl_map *map1, __isl_keep isl_map *map2); #include isl_bool isl_union_set_is_equal( __isl_keep isl_union_set *uset1, __isl_keep isl_union_set *uset2); #include isl_bool isl_union_map_is_equal( __isl_keep isl_union_map *umap1, __isl_keep isl_union_map *umap2); #include isl_bool isl_aff_plain_is_equal( __isl_keep isl_aff *aff1, __isl_keep isl_aff *aff2); isl_bool isl_multi_aff_plain_is_equal( __isl_keep isl_multi_aff *maff1, __isl_keep isl_multi_aff *maff2); isl_bool isl_pw_aff_plain_is_equal( __isl_keep isl_pw_aff *pwaff1, __isl_keep isl_pw_aff *pwaff2); isl_bool isl_pw_multi_aff_plain_is_equal( __isl_keep isl_pw_multi_aff *pma1, __isl_keep isl_pw_multi_aff *pma2); isl_bool isl_multi_pw_aff_plain_is_equal( __isl_keep isl_multi_pw_aff *mpa1, __isl_keep isl_multi_pw_aff *mpa2); isl_bool isl_multi_pw_aff_is_equal( __isl_keep isl_multi_pw_aff *mpa1, __isl_keep isl_multi_pw_aff *mpa2); isl_bool isl_union_pw_aff_plain_is_equal( __isl_keep isl_union_pw_aff *upa1, __isl_keep isl_union_pw_aff *upa2); isl_bool isl_union_pw_multi_aff_plain_is_equal( __isl_keep isl_union_pw_multi_aff *upma1, __isl_keep isl_union_pw_multi_aff *upma2); isl_bool isl_multi_union_pw_aff_plain_is_equal( __isl_keep isl_multi_union_pw_aff *mupa1, __isl_keep isl_multi_union_pw_aff *mupa2); #include isl_bool isl_union_pw_qpolynomial_plain_is_equal( __isl_keep isl_union_pw_qpolynomial *upwqp1, __isl_keep isl_union_pw_qpolynomial *upwqp2); isl_bool isl_union_pw_qpolynomial_fold_plain_is_equal( __isl_keep isl_union_pw_qpolynomial_fold *upwf1, __isl_keep isl_union_pw_qpolynomial_fold *upwf2); =item * Disjointness #include isl_bool isl_basic_set_is_disjoint( __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2); isl_bool isl_set_plain_is_disjoint( __isl_keep isl_set *set1, __isl_keep isl_set *set2); isl_bool isl_set_is_disjoint(__isl_keep isl_set *set1, __isl_keep isl_set *set2); #include isl_bool isl_basic_map_is_disjoint( __isl_keep isl_basic_map *bmap1, __isl_keep isl_basic_map *bmap2); isl_bool isl_map_is_disjoint(__isl_keep isl_map *map1, __isl_keep isl_map *map2); #include isl_bool isl_union_set_is_disjoint( __isl_keep isl_union_set *uset1, __isl_keep isl_union_set *uset2); #include isl_bool isl_union_map_is_disjoint( __isl_keep isl_union_map *umap1, __isl_keep isl_union_map *umap2); =item * Subset isl_bool isl_basic_set_is_subset( __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2); isl_bool isl_set_is_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2); isl_bool isl_set_is_strict_subset( __isl_keep isl_set *set1, __isl_keep isl_set *set2); isl_bool isl_union_set_is_subset( __isl_keep isl_union_set *uset1, __isl_keep isl_union_set *uset2); isl_bool isl_union_set_is_strict_subset( __isl_keep isl_union_set *uset1, __isl_keep isl_union_set *uset2); isl_bool isl_basic_map_is_subset( __isl_keep isl_basic_map *bmap1, __isl_keep isl_basic_map *bmap2); isl_bool isl_basic_map_is_strict_subset( __isl_keep isl_basic_map *bmap1, __isl_keep isl_basic_map *bmap2); isl_bool isl_map_is_subset( __isl_keep isl_map *map1, __isl_keep isl_map *map2); isl_bool isl_map_is_strict_subset( __isl_keep isl_map *map1, __isl_keep isl_map *map2); isl_bool isl_union_map_is_subset( __isl_keep isl_union_map *umap1, __isl_keep isl_union_map *umap2); isl_bool 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 Every comparison function returns a negative value if the first argument is considered smaller than the second, a positive value if the first argument is considered greater and zero if the two constraints are considered the same by the comparison criterion. #include int isl_constraint_plain_cmp( __isl_keep isl_constraint *c1, __isl_keep isl_constraint *c2); 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. #include int isl_constraint_cmp_last_non_zero( __isl_keep isl_constraint *c1, __isl_keep isl_constraint *c2); This function can be used to sort constraints that live in the same local space. Constraints that involve ``earlier'' dimensions or that have a smaller coefficient for the shared latest dimension are considered smaller than other constraints. This function only defines a B order. #include 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. #include int isl_pw_aff_plain_cmp(__isl_keep isl_pw_aff *pa1, __isl_keep isl_pw_aff *pa2); The function C can be used to sort Cs. The order is not strictly defined. The current order sorts expressions that only involve earlier dimensions before those that involve later dimensions. =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 #include __isl_give isl_space *isl_space_reverse( __isl_take isl_space *space); #include __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); #include __isl_give isl_union_map *isl_union_map_reverse( __isl_take isl_union_map *umap); =item * Projection #include __isl_give isl_space *isl_space_domain( __isl_take isl_space *space); __isl_give isl_space *isl_space_range( __isl_take isl_space *space); __isl_give isl_space *isl_space_params( __isl_take isl_space *space); #include __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); #include __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_params( __isl_take isl_basic_set *bset); __isl_give isl_set *isl_set_params(__isl_take isl_set *set); #include __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_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_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); #include __isl_give isl_union_set *isl_union_set_project_out( __isl_take isl_union_set *uset, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_set *isl_union_set_params( __isl_take isl_union_set *uset); The function C can only project out parameters. #include __isl_give isl_union_map *isl_union_map_project_out( __isl_take isl_union_map *umap, enum isl_dim_type type, unsigned first, unsigned n); __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); The function C can only project out parameters. #include __isl_give isl_aff *isl_aff_project_domain_on_params( __isl_take isl_aff *aff); __isl_give isl_pw_multi_aff * isl_pw_multi_aff_project_domain_on_params( __isl_take isl_pw_multi_aff *pma); __isl_give isl_set *isl_pw_aff_domain( __isl_take isl_pw_aff *pwaff); __isl_give isl_set *isl_pw_multi_aff_domain( __isl_take isl_pw_multi_aff *pma); __isl_give isl_set *isl_multi_pw_aff_domain( __isl_take isl_multi_pw_aff *mpa); __isl_give isl_union_set *isl_union_pw_aff_domain( __isl_take isl_union_pw_aff *upa); __isl_give isl_union_set *isl_union_pw_multi_aff_domain( __isl_take isl_union_pw_multi_aff *upma); __isl_give isl_union_set * isl_multi_union_pw_aff_domain( __isl_take isl_multi_union_pw_aff *mupa); __isl_give isl_set *isl_pw_aff_params( __isl_take isl_pw_aff *pwa); The function C requires its input to have at least one set dimension. #include __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_pw_qpolynomial_fold * isl_pw_qpolynomial_fold_project_domain_on_params( __isl_take isl_pw_qpolynomial_fold *pwf); __isl_give isl_set *isl_pw_qpolynomial_domain( __isl_take isl_pw_qpolynomial *pwqp); __isl_give isl_union_set *isl_union_pw_qpolynomial_fold_domain( __isl_take isl_union_pw_qpolynomial_fold *upwf); __isl_give isl_union_set *isl_union_pw_qpolynomial_domain( __isl_take isl_union_pw_qpolynomial *upwqp); #include __isl_give isl_space *isl_space_domain_map( __isl_take isl_space *space); __isl_give isl_space *isl_space_range_map( __isl_take isl_space *space); #include __isl_give isl_map *isl_set_wrapped_domain_map( __isl_take isl_set *set); __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); #include __isl_give isl_union_map *isl_union_map_domain_map( __isl_take isl_union_map *umap); __isl_give isl_union_pw_multi_aff * isl_union_map_domain_map_union_pw_multi_aff( __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_set_wrapped_domain_map( __isl_take isl_union_set *uset); The functions above construct a (basic, regular or union) relation that maps (a wrapped version of) the input relation to its domain or range. C maps the input set to the domain of its wrapped relation. =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 * Constructing a set from a parameter domain A zero-dimensional space or (basic) set can be constructed on a given parameter domain using the following functions. #include __isl_give isl_space *isl_space_set_from_params( __isl_take isl_space *space); #include __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); =item * Constructing a relation from a set Create a relation with the given set as domain or range. The range or domain of the created relation is a zero-dimensional flat anonymous space. #include __isl_give isl_space *isl_space_from_domain( __isl_take isl_space *space); __isl_give isl_space *isl_space_from_range( __isl_take isl_space *space); __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); #include __isl_give isl_local_space *isl_local_space_from_domain( __isl_take isl_local_space *ls); #include __isl_give isl_map *isl_map_from_domain( __isl_take isl_set *set); __isl_give isl_map *isl_map_from_range( __isl_take isl_set *set); #include __isl_give isl_multi_val *isl_multi_val_from_range( __isl_take isl_multi_val *mv); #include __isl_give isl_multi_aff *isl_multi_aff_from_range( __isl_take isl_multi_aff *ma); __isl_give isl_pw_aff *isl_pw_aff_from_range( __isl_take isl_pw_aff *pwa); __isl_give isl_multi_pw_aff *isl_multi_pw_aff_from_range( __isl_take isl_multi_pw_aff *mpa); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_from_range( __isl_take isl_multi_union_pw_aff *mupa); __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_from_domain( __isl_take isl_union_set *uset); =item * Slicing #include __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_fix_val( __isl_take isl_set *set, enum isl_dim_type type, unsigned pos, __isl_take isl_val *v); #include __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_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); #include __isl_give isl_pw_multi_aff *isl_pw_multi_aff_fix_si( __isl_take isl_pw_multi_aff *pma, enum isl_dim_type type, unsigned pos, int value); #include __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); Intersect the set, relation or function domain 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_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_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_map *isl_map_order_le( __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_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_ge( __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); Intersect the relation with the half-space where the given dimensions satisfy the given ordering. =item * Locus #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_set *isl_pw_aff_pos_set( __isl_take isl_pw_aff *pa); __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_union_set * isl_union_pw_aff_zero_union_set( __isl_take isl_union_pw_aff *upa); __isl_give isl_union_set * isl_multi_union_pw_aff_zero_union_set( __isl_take isl_multi_union_pw_aff *mupa); 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 set containing those elements in the domain of C where C is non-negative. The function C returns a union set containing those elements in the domains of its elements where they are all zero. =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); __isl_give isl_union_pw_multi_aff * isl_union_set_identity_union_pw_multi_aff( __isl_take isl_union_set *uset); Construct an identity relation on the given (union) set. =item * Function Extraction 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); A piecewise multiple quasi affine expression can be extracted 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 to an C, these properties need to hold in each domain space. A conversion to a C additionally requires that the input is non-empty and involves only a single range space. #include __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); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_from_union_map( __isl_take isl_union_map *umap); =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, relation or functions by trying to combine pairs of basic sets or relations into a single basic set or relation. #include __isl_give isl_set *isl_set_coalesce(__isl_take isl_set *set); #include __isl_give isl_map *isl_map_coalesce(__isl_take isl_map *map); #include __isl_give isl_union_set *isl_union_set_coalesce( __isl_take isl_union_set *uset); #include __isl_give isl_union_map *isl_union_map_coalesce( __isl_take isl_union_map *umap); #include __isl_give isl_pw_aff *isl_pw_aff_coalesce( __isl_take isl_pw_aff *pwqp); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_coalesce( __isl_take isl_pw_multi_aff *pma); __isl_give isl_multi_pw_aff *isl_multi_pw_aff_coalesce( __isl_take isl_multi_pw_aff *mpa); __isl_give isl_union_pw_aff *isl_union_pw_aff_coalesce( __isl_take isl_union_pw_aff *upa); __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_coalesce( __isl_take isl_union_pw_multi_aff *upma); #include __isl_give isl_pw_qpolynomial_fold * isl_pw_qpolynomial_fold_coalesce( __isl_take isl_pw_qpolynomial_fold *pwf); __isl_give isl_union_pw_qpolynomial * isl_union_pw_qpolynomial_coalesce( __isl_take isl_union_pw_qpolynomial *upwqp); __isl_give isl_union_pw_qpolynomial_fold * isl_union_pw_qpolynomial_fold_coalesce( __isl_take isl_union_pw_qpolynomial_fold *upwf); 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. isl_stat 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 #include __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); #include __isl_give isl_union_set * isl_union_set_remove_redundancies( __isl_take isl_union_set *uset); #include __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); #include __isl_give isl_union_map * isl_union_map_remove_redundancies( __isl_take isl_union_map *umap); =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 #include __isl_give isl_basic_set * isl_set_unshifted_simple_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_from_set_list( __isl_take isl_set *set, __isl_take isl_set_list *list); #include __isl_give isl_basic_map * isl_map_unshifted_simple_hull( __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_from_map_list( __isl_take isl_map *map, __isl_take isl_map_list *list); #include __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. In case of C and C, the constraints are taken from the elements of the second argument. =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 #include __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); #include __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); These functions drop any constraints (not) involving the specified dimensions. Note that the result depends on the representation of the input. #include __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. =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 __isl_give isl_val *isl_basic_set_max_val( __isl_keep isl_basic_set *bset, __isl_keep isl_aff *obj); __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); Compute the minimum or maximum of the integer affine expression C over the points in C, returning the result in C. 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_val( __isl_take isl_map *map, __isl_take isl_val *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 #include __isl_give isl_space *isl_space_wrap( __isl_take isl_space *space); __isl_give isl_space *isl_space_unwrap( __isl_take isl_space *space); #include __isl_give isl_local_space *isl_local_space_wrap( __isl_take isl_local_space *ls); #include __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); #include __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); #include __isl_give isl_union_map *isl_union_set_unwrap( __isl_take isl_union_set *uset); #include __isl_give isl_union_set *isl_union_map_wrap( __isl_take isl_union_map *umap); The input to 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. =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. #include __isl_give isl_local_space * isl_local_space_flatten_domain( __isl_take isl_local_space *ls); __isl_give isl_local_space * isl_local_space_flatten_range( __isl_take isl_local_space *ls); #include __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); #include __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); #include __isl_give isl_multi_val *isl_multi_val_flatten_range( __isl_take isl_multi_val *mv); #include __isl_give isl_multi_aff *isl_multi_aff_flatten_domain( __isl_take isl_multi_aff *ma); __isl_give isl_multi_aff *isl_multi_aff_flatten_range( __isl_take isl_multi_aff *ma); __isl_give isl_multi_pw_aff * isl_multi_pw_aff_flatten_range( __isl_take isl_multi_pw_aff *mpa); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_flatten_range( __isl_take isl_multi_union_pw_aff *mupa); #include __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. #include __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); #include __isl_give isl_multi_aff *isl_multi_aff_lift( __isl_take isl_multi_aff *maff, __isl_give isl_local_space **ls); 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. =item * Internal Product #include __isl_give isl_space *isl_space_zip( __isl_take isl_space *space); #include __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); #include __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 #include __isl_give isl_space *isl_space_curry( __isl_take isl_space *space); __isl_give isl_space *isl_space_uncurry( __isl_take isl_space *space); #include __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); #include __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 Change the order of the parameters of the given set, relation or function such that the first parameters match those of C. This may involve the introduction of extra parameters. All parameters need to be named. #include __isl_give isl_space *isl_space_align_params( __isl_take isl_space *space1, __isl_take isl_space *space2) #include __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); #include __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); #include __isl_give isl_multi_val *isl_multi_val_align_params( __isl_take isl_multi_val *mv, __isl_take isl_space *model); #include __isl_give isl_aff *isl_aff_align_params( __isl_take isl_aff *aff, __isl_take isl_space *model); __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_aff *isl_pw_aff_align_params( __isl_take isl_pw_aff *pwaff, __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_union_pw_aff * isl_union_pw_aff_align_params( __isl_take isl_union_pw_aff *upa, __isl_take isl_space *model); __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_align_params( __isl_take isl_union_pw_multi_aff *upma, __isl_take isl_space *model); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_align_params( __isl_take isl_multi_union_pw_aff *mupa, __isl_take isl_space *model); #include __isl_give isl_qpolynomial *isl_qpolynomial_align_params( __isl_take isl_qpolynomial *qp, __isl_take isl_space *model); =item * Unary Arithmethic Operations #include __isl_give isl_multi_val *isl_multi_val_neg( __isl_take isl_multi_val *mv); #include __isl_give isl_aff *isl_aff_neg( __isl_take isl_aff *aff); __isl_give isl_multi_aff *isl_multi_aff_neg( __isl_take isl_multi_aff *ma); __isl_give isl_pw_aff *isl_pw_aff_neg( __isl_take isl_pw_aff *pwaff); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_neg( __isl_take isl_pw_multi_aff *pma); __isl_give isl_multi_pw_aff *isl_multi_pw_aff_neg( __isl_take isl_multi_pw_aff *mpa); __isl_give isl_union_pw_aff *isl_union_pw_aff_neg( __isl_take isl_union_pw_aff *upa); __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_neg( __isl_take isl_union_pw_multi_aff *upma); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_neg( __isl_take isl_multi_union_pw_aff *mupa); __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_multi_aff *isl_multi_aff_floor( __isl_take isl_multi_aff *ma); __isl_give isl_pw_aff *isl_pw_aff_floor( __isl_take isl_pw_aff *pwaff); __isl_give isl_union_pw_aff *isl_union_pw_aff_floor( __isl_take isl_union_pw_aff *upa); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_floor( __isl_take isl_multi_union_pw_aff *mupa); #include __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); #include __isl_give isl_qpolynomial *isl_qpolynomial_neg( __isl_take isl_qpolynomial *qp); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_neg( __isl_take isl_pw_qpolynomial *pwqp); __isl_give isl_union_pw_qpolynomial * isl_union_pw_qpolynomial_neg( __isl_take isl_union_pw_qpolynomial *upwqp); __isl_give isl_qpolynomial *isl_qpolynomial_pow( __isl_take isl_qpolynomial *qp, unsigned exponent); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_pow( __isl_take isl_pw_qpolynomial *pwqp, unsigned exponent); =item * Evaluation The following functions evaluate a function in a point. #include __isl_give isl_val *isl_pw_qpolynomial_eval( __isl_take isl_pw_qpolynomial *pwqp, __isl_take isl_point *pnt); __isl_give isl_val *isl_pw_qpolynomial_fold_eval( __isl_take isl_pw_qpolynomial_fold *pwf, __isl_take isl_point *pnt); __isl_give isl_val *isl_union_pw_qpolynomial_eval( __isl_take isl_union_pw_qpolynomial *upwqp, __isl_take isl_point *pnt); __isl_give isl_val *isl_union_pw_qpolynomial_fold_eval( __isl_take isl_union_pw_qpolynomial_fold *upwf, __isl_take isl_point *pnt); =item * Dimension manipulation 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 functions below can be useful to add new parameters, assuming C and C are not sufficient. #include __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_insert_dims( __isl_take isl_space *space, enum isl_dim_type type, unsigned pos, 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); #include __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); #include __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_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_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); #include __isl_give isl_basic_map *isl_basic_map_add_dims( __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); #include __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); #include __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_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_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_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_aff *isl_aff_add_dims( __isl_take isl_aff *aff, enum isl_dim_type type, 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_pw_aff *isl_pw_aff_add_dims( __isl_take isl_pw_aff *pwaff, enum isl_dim_type type, 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); __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_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_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_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_union_pw_aff *isl_union_pw_aff_drop_dims( __isl_take isl_union_pw_aff *upa, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_drop_dims( __isl_take isl_union_pw_multi_aff *upma, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_drop_dims( __isl_take isl_multi_union_pw_aff *mupa, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_aff *isl_aff_move_dims( __isl_take isl_aff *aff, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, unsigned n); __isl_give isl_multi_aff *isl_multi_aff_move_dims( __isl_take isl_multi_aff *ma, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, unsigned n); __isl_give isl_pw_aff *isl_pw_aff_move_dims( __isl_take isl_pw_aff *pa, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, unsigned n); __isl_give isl_multi_pw_aff *isl_multi_pw_aff_move_dims( __isl_take isl_multi_pw_aff *pma, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, unsigned n); #include __isl_give isl_union_pw_qpolynomial * isl_union_pw_qpolynomial_drop_dims( __isl_take isl_union_pw_qpolynomial *upwqp, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_union_pw_qpolynomial_fold * isl_union_pw_qpolynomial_fold_drop_dims( __isl_take isl_union_pw_qpolynomial_fold *upwf, enum isl_dim_type type, unsigned first, unsigned n); The operations on union expressions can only manipulate parameters. =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 #include __isl_give isl_local_space *isl_local_space_intersect( __isl_take isl_local_space *ls1, __isl_take isl_local_space *ls2); #include __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_basic_set *isl_basic_set_list_intersect( __isl_take struct isl_basic_set_list *list); __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); #include __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_basic_map *isl_basic_map_list_intersect( __isl_take isl_basic_map_list *list); __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); #include __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_intersect( __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2); #include __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_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); #include __isl_give isl_pw_aff *isl_pw_aff_intersect_domain( __isl_take isl_pw_aff *pa, __isl_take isl_set *set); __isl_give isl_multi_pw_aff * isl_multi_pw_aff_intersect_domain( __isl_take isl_multi_pw_aff *mpa, __isl_take isl_set *domain); __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_aff *isl_union_pw_aff_intersect_domain( __isl_take isl_union_pw_aff *upa, __isl_take isl_union_set *uset); __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_union_pw_aff * isl_multi_union_pw_aff_intersect_domain( __isl_take isl_multi_union_pw_aff *mupa, __isl_take isl_union_set *uset); __isl_give isl_pw_aff *isl_pw_aff_intersect_params( __isl_take isl_pw_aff *pa, __isl_take isl_set *set); __isl_give isl_multi_pw_aff * isl_multi_pw_aff_intersect_params( __isl_take isl_multi_pw_aff *mpa, __isl_take isl_set *set); __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_union_pw_aff * isl_union_pw_aff_intersect_params( __isl_take isl_union_pw_aff *upa, __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_intersect_params( __isl_take isl_union_pw_multi_aff *upma, __isl_take isl_set *set); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_intersect_params( __isl_take isl_multi_union_pw_aff *mupa, __isl_take isl_set *params); isl_multi_union_pw_aff_intersect_range( __isl_take isl_multi_union_pw_aff *mupa, __isl_take isl_set *set); #include __isl_give isl_pw_qpolynomial * isl_pw_qpolynomial_intersect_domain( __isl_take isl_pw_qpolynomial *pwpq, __isl_take isl_set *set); __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_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_pw_qpolynomial * isl_pw_qpolynomial_intersect_params( __isl_take isl_pw_qpolynomial *pwpq, __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_union_pw_qpolynomial * isl_union_pw_qpolynomial_intersect_params( __isl_take isl_union_pw_qpolynomial *upwpq, __isl_take isl_set *set); __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); 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. The list passed to C needs to have at least one element and all elements need to live in the same space. The function C restricts the input function to those shared domain elements that map to the specified range. =item * Union #include __isl_give isl_set *isl_basic_set_union( __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2); __isl_give isl_set *isl_set_union( __isl_take isl_set *set1, __isl_take isl_set *set2); #include __isl_give isl_map *isl_basic_map_union( __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2); __isl_give isl_map *isl_map_union( __isl_take isl_map *map1, __isl_take isl_map *map2); #include __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_set *isl_union_set_list_union( __isl_take isl_union_set_list *list); #include __isl_give isl_union_map *isl_union_map_union( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2); =item * Set difference #include __isl_give isl_set *isl_set_subtract( __isl_take isl_set *set1, __isl_take isl_set *set2); #include __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); #include __isl_give isl_union_set *isl_union_set_subtract( __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2); #include __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); #include __isl_give isl_pw_aff *isl_pw_aff_subtract_domain( __isl_take isl_pw_aff *pa, __isl_take isl_set *set); __isl_give isl_pw_multi_aff * isl_pw_multi_aff_subtract_domain( __isl_take isl_pw_multi_aff *pma, __isl_take isl_set *set); __isl_give isl_union_pw_aff * isl_union_pw_aff_subtract_domain( __isl_take isl_union_pw_aff *upa, __isl_take isl_union_set *uset); __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_subtract_domain( __isl_take isl_union_pw_multi_aff *upma, __isl_take isl_set *set); #include __isl_give isl_pw_qpolynomial * isl_pw_qpolynomial_subtract_domain( __isl_take isl_pw_qpolynomial *pwpq, __isl_take isl_set *set); __isl_give isl_pw_qpolynomial_fold * isl_pw_qpolynomial_fold_subtract_domain( __isl_take isl_pw_qpolynomial_fold *pwf, __isl_take isl_set *set); __isl_give isl_union_pw_qpolynomial * isl_union_pw_qpolynomial_subtract_domain( __isl_take isl_union_pw_qpolynomial *upwpq, __isl_take isl_union_set *uset); __isl_give isl_union_pw_qpolynomial_fold * isl_union_pw_qpolynomial_fold_subtract_domain( __isl_take isl_union_pw_qpolynomial_fold *upwf, __isl_take isl_union_set *uset); =item * Application #include __isl_give isl_space *isl_space_join( __isl_take isl_space *left, __isl_take isl_space *right); #include __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_map *isl_map_apply_range( __isl_take isl_map *map1, __isl_take isl_map *map2); #include __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_union_map *isl_union_map_apply_range( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2); #include __isl_give isl_union_pw_aff * isl_multi_union_pw_aff_apply_aff( __isl_take isl_multi_union_pw_aff *mupa, __isl_take isl_aff *aff); __isl_give isl_union_pw_aff * isl_multi_union_pw_aff_apply_pw_aff( __isl_take isl_multi_union_pw_aff *mupa, __isl_take isl_pw_aff *pa); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_apply_multi_aff( __isl_take isl_multi_union_pw_aff *mupa, __isl_take isl_multi_aff *ma); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_apply_pw_multi_aff( __isl_take isl_multi_union_pw_aff *mupa, __isl_take isl_pw_multi_aff *pma); The result of C is defined over the shared domain of the elements of the input. The dimension is required to be greater than zero. The C argument of C is allowed to be zero-dimensional, but only if the range of the C argument is also zero-dimensional. Similarly for C. #include __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. =item * Preimage #include __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_set *isl_set_preimage_multi_pw_aff( __isl_take isl_set *set, __isl_take isl_multi_pw_aff *mpa); #include __isl_give isl_union_set * isl_union_set_preimage_multi_aff( __isl_take isl_union_set *uset, __isl_take isl_multi_aff *ma); __isl_give isl_union_set * isl_union_set_preimage_pw_multi_aff( __isl_take isl_union_set *uset, __isl_take isl_pw_multi_aff *pma); __isl_give isl_union_set * isl_union_set_preimage_union_pw_multi_aff( __isl_take isl_union_set *uset, __isl_take isl_union_pw_multi_aff *upma); #include __isl_give isl_basic_map * isl_basic_map_preimage_domain_multi_aff( __isl_take isl_basic_map *bmap, __isl_take isl_multi_aff *ma); __isl_give isl_map *isl_map_preimage_domain_multi_aff( __isl_take isl_map *map, __isl_take isl_multi_aff *ma); __isl_give isl_map *isl_map_preimage_range_multi_aff( __isl_take isl_map *map, __isl_take isl_multi_aff *ma); __isl_give isl_map * isl_map_preimage_domain_pw_multi_aff( __isl_take isl_map *map, __isl_take isl_pw_multi_aff *pma); __isl_give isl_map * isl_map_preimage_range_pw_multi_aff( __isl_take isl_map *map, __isl_take isl_pw_multi_aff *pma); __isl_give isl_map * isl_map_preimage_domain_multi_pw_aff( __isl_take isl_map *map, __isl_take isl_multi_pw_aff *mpa); __isl_give isl_basic_map * isl_basic_map_preimage_range_multi_aff( __isl_take isl_basic_map *bmap, __isl_take isl_multi_aff *ma); #include __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_give isl_union_map * isl_union_map_preimage_range_multi_aff( __isl_take isl_union_map *umap, __isl_take isl_multi_aff *ma); __isl_give isl_union_map * isl_union_map_preimage_domain_pw_multi_aff( __isl_take isl_union_map *umap, __isl_take isl_pw_multi_aff *pma); __isl_give isl_union_map * isl_union_map_preimage_range_pw_multi_aff( __isl_take isl_union_map *umap, __isl_take isl_pw_multi_aff *pma); __isl_give isl_union_map * isl_union_map_preimage_domain_union_pw_multi_aff( __isl_take isl_union_map *umap, __isl_take isl_union_pw_multi_aff *upma); __isl_give isl_union_map * isl_union_map_preimage_range_union_pw_multi_aff( __isl_take isl_union_map *umap, __isl_take isl_union_pw_multi_aff *upma); These functions compute the preimage of the given set or map domain/range under the given function. In other words, the expression is plugged into the set description or into the domain/range of the map. =item * Pullback #include __isl_give isl_aff *isl_aff_pullback_aff( __isl_take isl_aff *aff1, __isl_take isl_aff *aff2); __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); __isl_give isl_pw_aff *isl_pw_aff_pullback_multi_pw_aff( __isl_take isl_pw_aff *pa, __isl_take isl_multi_pw_aff *mpa); __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_multi_pw_aff * isl_multi_pw_aff_pullback_multi_aff( __isl_take isl_multi_pw_aff *mpa, __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); __isl_give isl_multi_pw_aff * isl_multi_pw_aff_pullback_pw_multi_aff( __isl_take isl_multi_pw_aff *mpa, __isl_take isl_pw_multi_aff *pma); __isl_give isl_multi_pw_aff * isl_multi_pw_aff_pullback_multi_pw_aff( __isl_take isl_multi_pw_aff *mpa1, __isl_take isl_multi_pw_aff *mpa2); __isl_give isl_union_pw_aff * isl_union_pw_aff_pullback_union_pw_multi_aff( __isl_take isl_union_pw_aff *upa, __isl_take isl_union_pw_multi_aff *upma); __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_pullback_union_pw_multi_aff( __isl_take isl_union_pw_multi_aff *upma1, __isl_take isl_union_pw_multi_aff *upma2); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_pullback_union_pw_multi_aff( __isl_take isl_multi_union_pw_aff *mupa, __isl_take isl_union_pw_multi_aff *upma); These functions precompose the first expression by the second function. In other words, the second function is plugged into the first expression. =item * Locus #include __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_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_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 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 function C returns a set containing those elements in the shared domain space where C is lexicographically smaller 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_map *isl_pw_aff_eq_map( __isl_take isl_pw_aff *pa1, __isl_take isl_pw_aff *pa2); __isl_give isl_map *isl_pw_aff_lt_map( __isl_take isl_pw_aff *pa1, __isl_take isl_pw_aff *pa2); __isl_give isl_map *isl_pw_aff_gt_map( __isl_take isl_pw_aff *pa1, __isl_take isl_pw_aff *pa2); __isl_give isl_map *isl_multi_pw_aff_eq_map( __isl_take isl_multi_pw_aff *mpa1, __isl_take isl_multi_pw_aff *mpa2); __isl_give isl_map *isl_multi_pw_aff_lex_lt_map( __isl_take isl_multi_pw_aff *mpa1, __isl_take isl_multi_pw_aff *mpa2); __isl_give isl_map *isl_multi_pw_aff_lex_gt_map( __isl_take isl_multi_pw_aff *mpa1, __isl_take isl_multi_pw_aff *mpa2); These functions return a map between domain elements of the arguments where the function values satisfy the given relation. #include __isl_give isl_union_map * isl_union_map_eq_at_multi_union_pw_aff( __isl_take isl_union_map *umap, __isl_take isl_multi_union_pw_aff *mupa); __isl_give isl_union_map * isl_union_map_lex_lt_at_multi_union_pw_aff( __isl_take isl_union_map *umap, __isl_take isl_multi_union_pw_aff *mupa); __isl_give isl_union_map * isl_union_map_lex_gt_at_multi_union_pw_aff( __isl_take isl_union_map *umap, __isl_take isl_multi_union_pw_aff *mupa); These functions select the subset of elements in the union map that have an equal or lexicographically smaller function value. =item * Cartesian Product #include __isl_give isl_space *isl_space_product( __isl_take isl_space *space1, __isl_take isl_space *space2); __isl_give isl_space *isl_space_domain_product( __isl_take isl_space *space1, __isl_take isl_space *space2); __isl_give isl_space *isl_space_range_product( __isl_take isl_space *space1, __isl_take isl_space *space2); The functions C, C and C take pairs or relation spaces and produce a single relations space, where either the domain, the range or both domain and range are wrapped spaces of relations between the domains and/or ranges of the input spaces. If the product is only constructed over the domain or the range then the ranges or the domains of the inputs should be the same. The function C also accepts a pair of set spaces, in which case it returns a wrapped space of a relation between the two input spaces. #include __isl_give isl_set *isl_set_product( __isl_take isl_set *set1, __isl_take isl_set *set2); #include __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_map *isl_map_product( __isl_take isl_map *map1, __isl_take isl_map *map2); #include __isl_give isl_union_set *isl_union_set_product( __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2); #include __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_product( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2); #include __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_product( __isl_take isl_multi_val *mv1, __isl_take isl_multi_val *mv2); #include __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_product( __isl_take isl_multi_aff *ma1, __isl_take isl_multi_aff *ma2); __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_product( __isl_take isl_multi_pw_aff *mpa1, __isl_take isl_multi_pw_aff *mpa2); __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_product( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_range_product( __isl_take isl_multi_union_pw_aff *mupa1, __isl_take isl_multi_union_pw_aff *mupa2); The above functions compute the cross product of the given sets, relations or functions. 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. #include __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); #include __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_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); #include __isl_give isl_union_map * isl_union_map_flat_domain_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); #include __isl_give isl_multi_val *isl_multi_val_flat_range_product( __isl_take isl_multi_val *mv1, __isl_take isl_multi_aff *mv2); #include __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_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_multi_pw_aff * isl_multi_pw_aff_flat_range_product( __isl_take isl_multi_pw_aff *mpa1, __isl_take isl_multi_pw_aff *mpa2); __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_union_pw_aff * isl_multi_union_pw_aff_flat_range_product( __isl_take isl_multi_union_pw_aff *mupa1, __isl_take isl_multi_union_pw_aff *mupa2); #include __isl_give isl_space *isl_space_factor_domain( __isl_take isl_space *space); __isl_give isl_space *isl_space_factor_range( __isl_take isl_space *space); __isl_give isl_space *isl_space_domain_factor_domain( __isl_take isl_space *space); __isl_give isl_space *isl_space_domain_factor_range( __isl_take isl_space *space); __isl_give isl_space *isl_space_range_factor_domain( __isl_take isl_space *space); __isl_give isl_space *isl_space_range_factor_range( __isl_take isl_space *space); The functions C and C extract the two arguments from the result of a call to C. The arguments of a call to C can be extracted from the result using the following functions. #include __isl_give isl_map *isl_map_factor_domain( __isl_take isl_map *map); __isl_give isl_map *isl_map_factor_range( __isl_take isl_map *map); __isl_give isl_map *isl_map_domain_factor_domain( __isl_take isl_map *map); __isl_give isl_map *isl_map_domain_factor_range( __isl_take isl_map *map); __isl_give isl_map *isl_map_range_factor_domain( __isl_take isl_map *map); __isl_give isl_map *isl_map_range_factor_range( __isl_take isl_map *map); #include __isl_give isl_union_map *isl_union_map_factor_domain( __isl_take isl_union_map *umap); __isl_give isl_union_map *isl_union_map_factor_range( __isl_take isl_union_map *umap); __isl_give isl_union_map * isl_union_map_domain_factor_domain( __isl_take isl_union_map *umap); __isl_give isl_union_map * isl_union_map_domain_factor_range( __isl_take isl_union_map *umap); __isl_give isl_union_map * isl_union_map_range_factor_range( __isl_take isl_union_map *umap); #include __isl_give isl_multi_val * isl_multi_val_range_factor_domain( __isl_take isl_multi_val *mv); __isl_give isl_multi_val * isl_multi_val_range_factor_range( __isl_take isl_multi_val *mv); #include __isl_give isl_multi_aff * isl_multi_aff_range_factor_domain( __isl_take isl_multi_aff *ma); __isl_give isl_multi_aff * isl_multi_aff_range_factor_range( __isl_take isl_multi_aff *ma); __isl_give isl_multi_pw_aff * isl_multi_pw_aff_range_factor_domain( __isl_take isl_multi_pw_aff *mpa); __isl_give isl_multi_pw_aff * isl_multi_pw_aff_range_factor_range( __isl_take isl_multi_pw_aff *mpa); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_range_factor_domain( __isl_take isl_multi_union_pw_aff *mupa); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_range_factor_range( __isl_take isl_multi_union_pw_aff *mupa); The splice functions are a generalization of the flat product functions, where the second argument may be inserted at any position inside the first argument rather than being placed at the end. #include __isl_give isl_multi_val *isl_multi_val_range_splice( __isl_take isl_multi_val *mv1, unsigned pos, __isl_take isl_multi_val *mv2); #include __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_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_union_pw_aff * isl_multi_union_pw_aff_range_splice( __isl_take isl_multi_union_pw_aff *mupa1, unsigned pos, __isl_take isl_multi_union_pw_aff *mupa2); =item * Simplification When applied to a set or relation, 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. When applied to a function, the gist operation applies the set gist operation to each of the cells in the domain of the input piecewise expression. The context is also exploited to simplify the expression associated to each cell. #include __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); #include __isl_give isl_basic_map *isl_basic_map_gist( __isl_take isl_basic_map *bmap, __isl_take isl_basic_map *context); __isl_give isl_basic_map *isl_basic_map_gist_domain( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *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); #include __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); #include __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); #include __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_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_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_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_multi_pw_aff *isl_multi_pw_aff_gist_params( __isl_take isl_multi_pw_aff *mpa, __isl_take isl_set *set); __isl_give isl_multi_pw_aff *isl_multi_pw_aff_gist( __isl_take isl_multi_pw_aff *mpa, __isl_take isl_set *set); __isl_give isl_union_pw_aff *isl_union_pw_aff_gist( __isl_take isl_union_pw_aff *upa, __isl_take isl_union_set *context); __isl_give isl_union_pw_aff *isl_union_pw_aff_gist_params( __isl_take isl_union_pw_aff *upa, __isl_take isl_set *context); __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_gist_params( __isl_take isl_union_pw_multi_aff *upma, __isl_take isl_set *context); __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_gist( __isl_take isl_union_pw_multi_aff *upma, __isl_take isl_union_set *context); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_gist_params( __isl_take isl_multi_union_pw_aff *aff, __isl_take isl_set *context); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_gist( __isl_take isl_multi_union_pw_aff *aff, __isl_take isl_union_set *context); #include __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_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 *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_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 * 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); __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); =item * Binary Arithmethic Operations #include __isl_give isl_multi_val *isl_multi_val_sub( __isl_take isl_multi_val *mv1, __isl_take isl_multi_val *mv2); #include __isl_give isl_aff *isl_aff_add( __isl_take isl_aff *aff1, __isl_take isl_aff *aff2); __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_aff *isl_pw_aff_add( __isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2); __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_aff *isl_union_pw_aff_add( __isl_take isl_union_pw_aff *upa1, __isl_take isl_union_pw_aff *upa2); __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_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_multi_aff *isl_multi_aff_sub( __isl_take isl_multi_aff *ma1, __isl_take isl_multi_aff *ma2); __isl_give isl_pw_aff *isl_pw_aff_sub( __isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2); __isl_give isl_multi_pw_aff *isl_multi_pw_aff_sub( __isl_take isl_multi_pw_aff *mpa1, __isl_take isl_multi_pw_aff *mpa2); __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_aff *isl_union_pw_aff_sub( __isl_take isl_union_pw_aff *upa1, __isl_take isl_union_pw_aff *upa2); __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_multi_union_pw_aff * isl_multi_union_pw_aff_sub( __isl_take isl_multi_union_pw_aff *mupa1, __isl_take isl_multi_union_pw_aff *mupa2); C subtracts the second argument from the first. #include __isl_give isl_qpolynomial *isl_qpolynomial_add( __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2); __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_add_disjoint( __isl_take isl_pw_qpolynomial *pwqp1, __isl_take isl_pw_qpolynomial *pwqp2); __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_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_qpolynomial *isl_qpolynomial_sub( __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_sub( __isl_take isl_pw_qpolynomial *pwqp1, __isl_take isl_pw_qpolynomial *pwqp2); __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_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); #include __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_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_union_pw_aff *isl_union_pw_aff_union_add( __isl_take isl_union_pw_aff *upa1, __isl_take isl_union_pw_aff *upa2); __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_union_add( __isl_take isl_union_pw_multi_aff *upma1, __isl_take isl_union_pw_multi_aff *upma2); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_union_add( __isl_take isl_multi_union_pw_aff *mupa1, __isl_take isl_multi_union_pw_aff *mupa2); __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); 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. This in contrast to the C function, which is only defined on the shared definition domain of the arguments. #include __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_down_val( __isl_take isl_multi_val *mv, __isl_take isl_val *v); #include __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_val( __isl_take isl_pw_aff *pa, __isl_take isl_val *mod); __isl_give isl_union_pw_aff *isl_union_pw_aff_mod_val( __isl_take isl_union_pw_aff *upa, __isl_take isl_val *f); __isl_give isl_aff *isl_aff_scale_val(__isl_take isl_aff *aff, __isl_take isl_val *v); __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_aff *isl_pw_aff_scale_val( __isl_take isl_pw_aff *pa, __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_pw_multi_aff *isl_pw_multi_aff_scale_val( __isl_take isl_pw_multi_aff *pma, __isl_take isl_val *v); __isl_give isl_union_pw_multi_aff * __isl_give isl_union_pw_aff *isl_union_pw_aff_scale_val( __isl_take isl_union_pw_aff *upa, __isl_take isl_val *f); isl_union_pw_multi_aff_scale_val( __isl_take isl_union_pw_multi_aff *upma, __isl_take isl_val *val); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_scale_val( __isl_take isl_multi_union_pw_aff *mupa, __isl_take isl_val *v); __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_multi_aff *isl_multi_aff_scale_down_val( __isl_take isl_multi_aff *ma, __isl_take isl_val *v); __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_multi_pw_aff *isl_multi_pw_aff_scale_down_val( __isl_take isl_multi_pw_aff *mpa, __isl_take isl_val *v); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_scale_down_val( __isl_take isl_pw_multi_aff *pma, __isl_take isl_val *v); __isl_give isl_union_pw_aff *isl_union_pw_aff_scale_down_val( __isl_take isl_union_pw_aff *upa, __isl_take isl_val *v); __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_scale_down_val( __isl_take isl_union_pw_multi_aff *upma, __isl_take isl_val *val); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_scale_down_val( __isl_take isl_multi_union_pw_aff *mupa, __isl_take isl_val *v); #include __isl_give isl_qpolynomial *isl_qpolynomial_scale_val( __isl_take isl_qpolynomial *qp, __isl_take isl_val *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 * isl_pw_qpolynomial_scale_val( __isl_take isl_pw_qpolynomial *pwqp, __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 * isl_union_pw_qpolynomial_scale_val( __isl_take isl_union_pw_qpolynomial *upwqp, __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_qpolynomial * isl_qpolynomial_scale_down_val( __isl_take isl_qpolynomial *qp, __isl_take isl_val *v); __isl_give isl_qpolynomial_fold * isl_qpolynomial_fold_scale_down_val( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_val *v); __isl_give isl_pw_qpolynomial * isl_pw_qpolynomial_scale_down_val( __isl_take isl_pw_qpolynomial *pwqp, __isl_take isl_val *v); __isl_give isl_pw_qpolynomial_fold * isl_pw_qpolynomial_fold_scale_down_val( __isl_take isl_pw_qpolynomial_fold *pwf, __isl_take isl_val *v); __isl_give isl_union_pw_qpolynomial * isl_union_pw_qpolynomial_scale_down_val( __isl_take isl_union_pw_qpolynomial *upwqp, __isl_take isl_val *v); __isl_give isl_union_pw_qpolynomial_fold * isl_union_pw_qpolynomial_fold_scale_down_val( __isl_take isl_union_pw_qpolynomial_fold *upwf, __isl_take isl_val *v); #include __isl_give isl_multi_val *isl_multi_val_mod_multi_val( __isl_take isl_multi_val *mv1, __isl_take isl_multi_val *mv2); __isl_give isl_multi_val *isl_multi_val_scale_multi_val( __isl_take isl_multi_val *mv1, __isl_take isl_multi_val *mv2); __isl_give isl_multi_val * isl_multi_val_scale_down_multi_val( __isl_take isl_multi_val *mv1, __isl_take isl_multi_val *mv2); #include __isl_give isl_multi_aff *isl_multi_aff_mod_multi_val( __isl_take isl_multi_aff *ma, __isl_take isl_multi_val *mv); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_mod_multi_val( __isl_take isl_multi_union_pw_aff *upma, __isl_take isl_multi_val *mv); __isl_give isl_multi_pw_aff * isl_multi_pw_aff_mod_multi_val( __isl_take isl_multi_pw_aff *mpa, __isl_take isl_multi_val *mv); __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_multi_union_pw_aff * isl_multi_union_pw_aff_scale_multi_val( __isl_take isl_multi_union_pw_aff *mupa, __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); __isl_give isl_multi_aff * isl_multi_aff_scale_down_multi_val( __isl_take isl_multi_aff *ma, __isl_take isl_multi_val *mv); __isl_give isl_multi_pw_aff * isl_multi_pw_aff_scale_down_multi_val( __isl_take isl_multi_pw_aff *mpa, __isl_take isl_multi_val *mv); __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_scale_down_multi_val( __isl_take isl_multi_union_pw_aff *mupa, __isl_take isl_multi_val *mv); C scales the elements of C by the corresponding elements of C. #include __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_qpolynomial *isl_qpolynomial_mul( __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_mul( __isl_take isl_pw_qpolynomial *pwqp1, __isl_take isl_pw_qpolynomial *pwqp2); __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); =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. #include __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. #include __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. #include __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. #include __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, but are otherwise equivalent to the corresponding functions returning a basic set or relation. #include __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); #include __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_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_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); The following functions return the lexicographic minimum or maximum on the shared domain of the inputs and the single defined function on those parts of the domain where only a single function is defined. #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); =head2 Ternary Operations #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. =head2 Lists Lists are defined over several element types, including C, C, C, C, C, C, 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); __isl_null isl_set_list *isl_set_list_free( __isl_take isl_set_list *list); C creates an empty list with an initial capacity for C elements. C and C add elements to a list, increasing its capacity as needed. C creates a list with a single element. Lists can be inspected using the following functions. #include 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); isl_stat isl_set_list_foreach(__isl_keep isl_set_list *list, isl_stat (*fn)(__isl_take isl_set *el, void *user), void *user); isl_stat isl_set_list_foreach_scc( __isl_keep isl_set_list *list, isl_bool (*follows)(__isl_keep isl_set *a, __isl_keep isl_set *b, void *user), void *follows_user isl_stat (*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 Associative arrays Associative arrays map isl objects of a specific type to isl objects of some (other) specific type. They are defined for several pairs of types, including (C, C), (C, C) and. (C, C). Here, we take associative arrays that map Cs to Cs as an example. Associative arrays can be created, copied and freed using the following functions. #include __isl_give isl_id_to_ast_expr *isl_id_to_ast_expr_alloc( isl_ctx *ctx, int min_size); __isl_give isl_id_to_ast_expr *isl_id_to_ast_expr_copy( __isl_keep isl_id_to_ast_expr *id2expr); __isl_null isl_id_to_ast_expr *isl_id_to_ast_expr_free( __isl_take isl_id_to_ast_expr *id2expr); The C argument to C can be used to specify the expected size of the associative array. The associative array will be grown automatically as needed. Associative arrays can be inspected using the following functions. #include isl_bool isl_id_to_ast_expr_has( __isl_keep isl_id_to_ast_expr *id2expr, __isl_keep isl_id *key); __isl_give isl_ast_expr *isl_id_to_ast_expr_get( __isl_keep isl_id_to_ast_expr *id2expr, __isl_take isl_id *key); isl_stat isl_id_to_ast_expr_foreach( __isl_keep isl_id_to_ast_expr *id2expr, isl_stat (*fn)(__isl_take isl_id *key, __isl_take isl_ast_expr *val, void *user), void *user); They can be modified using the following function. #include __isl_give isl_id_to_ast_expr *isl_id_to_ast_expr_set( __isl_take isl_id_to_ast_expr *id2expr, __isl_take isl_id *key, __isl_take isl_ast_expr *val); __isl_give isl_id_to_ast_expr *isl_id_to_ast_expr_drop( __isl_take isl_id_to_ast_expr *id2expr, __isl_take isl_id *key); Associative arrays can be printed using the following function. #include __isl_give isl_printer *isl_printer_print_id_to_ast_expr( __isl_take isl_printer *p, __isl_keep isl_id_to_ast_expr *id2expr); =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); __isl_null isl_vec *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. int isl_vec_size(__isl_keep isl_vec *vec); __isl_give isl_val *isl_vec_get_element_val( __isl_keep isl_vec *vec, int pos); __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_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); 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); __isl_null isl_mat *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. int isl_mat_rows(__isl_keep isl_mat *mat); int isl_mat_cols(__isl_keep isl_mat *mat); __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_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 Bounds on Piecewise Quasipolynomials and Piecewise Quasipolynomial Reductions The following functions determine an upper or lower bound on a quasipolynomial over its domain. __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. =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. isl_stat isl_vertices_foreach_vertex( __isl_keep isl_vertices *vertices, isl_stat (*fn)(__isl_take isl_vertex *vertex, void *user), void *user); isl_stat isl_vertices_foreach_cell( __isl_keep isl_vertices *vertices, isl_stat (*fn)(__isl_take isl_cell *cell, void *user), void *user); isl_stat isl_cell_foreach_vertex(__isl_keep isl_cell *cell, isl_stat (*fn)(__isl_take isl_vertex *vertex, void *user), void *user); Other operations that can be performed on an C object are the following. 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. 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_multi_aff *isl_vertex_get_expr( __isl_keep isl_vertex *vertex); void isl_vertex_free(__isl_take isl_vertex *vertex); C returns a multiple quasi-affine expression describing the vertex in terms of the parameters, while C returns the activity domain of the vertex. Chambers can be inspected and destroyed using the following functions. __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 Schedule Trees A schedule tree is a structured representation of a schedule, assigning a relative order to a set of domain elements. The relative order expressed by the schedule tree is defined recursively. In particular, the order between two domain elements is determined by the node that is closest to the root that refers to both elements and that orders them apart. Each node in the tree is of one of several types. The root node is always of type C (or C) and it describes the (extra) domain elements to which the schedule applies. The other types of nodes are as follows. =over =item C A band of schedule dimensions. Each schedule dimension is represented by a union piecewise quasi-affine expression. If this expression assigns a different value to two domain elements, while all previous schedule dimensions in the same band assign them the same value, then the two domain elements are ordered according to these two different values. =item C An expansion node maps each of the domain elements that reach the node to one or more domain elements. The image of this mapping forms the set of domain elements that reach the child of the expansion node. The function that maps each of the expanded domain elements to the original domain element from which it was expanded is called the contraction. =item C A filter node does not impose any ordering, but rather intersects the set of domain elements that the current subtree refers to with a given union set. The subtree of the filter node only refers to domain elements in the intersection. A filter node is typically only used a child of a sequence or set node. =item C A leaf of the schedule tree. Leaf nodes do not impose any ordering. =item C A mark node can be used to attach any kind of information to a subtree of the schedule tree. =item C A sequence node has one or more children, each of which is a filter node. The filters on these filter nodes form a partition of the domain elements that the current subtree refers to. If two domain elements appear in distinct filters then the sequence node orders them according to the child positions of the corresponding filter nodes. =item C A set node is similar to a sequence node, except that it expresses that domain elements appearing in distinct filters may have any order. The order of the children of a set node is therefore also immaterial. =back The following node types are only supported by the AST generator. =over =item C The context describes constraints on the parameters and the schedule dimensions of outer bands that the AST generator may assume to hold. It is also the only kind of node that may introduce additional parameters. The space of the context is that of the flat product of the outer band nodes. In particular, if there are no outer band nodes, then this space is the unnamed zero-dimensional space. Since a context node references the outer band nodes, any tree containing a context node is considered to be anchored. =item C An extension node instructs the AST generator to add additional domain elements that need to be scheduled. The additional domain elements are described by the range of the extension map in terms of the outer schedule dimensions, i.e., the flat product of the outer band nodes. Note that domain elements are added whenever the AST generator reaches the extension node, meaning that there are still some active domain elements for which an AST needs to be generated. The conditions under which some domain elements are still active may however not be completely described by the outer AST nodes generated at that point. An extension node may also appear as the root of a schedule tree, when it is intended to be inserted into another tree using C or C. In this case, the domain of the extension node should correspond to the flat product of the outer band nodes in this other schedule tree at the point where the extension tree will be inserted. =item C The guard describes constraints on the parameters and the schedule dimensions of outer bands that need to be enforced by the outer nodes in the generated AST. The space of the guard is that of the flat product of the outer band nodes. In particular, if there are no outer band nodes, then this space is the unnamed zero-dimensional space. Since a guard node references the outer band nodes, any tree containing a guard node is considered to be anchored. =back Except for the C nodes, none of the nodes may introduce any parameters that were not already present in the root domain node. A schedule tree is encapsulated in an C object. The simplest such objects, those with a tree consisting of single domain node, can be created using the following functions with either an empty domain or a given domain. #include __isl_give isl_schedule *isl_schedule_empty( __isl_take isl_space *space); __isl_give isl_schedule *isl_schedule_from_domain( __isl_take isl_union_set *domain); The function C described in L can also be used to construct schedules. C objects may be copied and freed using the following functions. #include __isl_give isl_schedule *isl_schedule_copy( __isl_keep isl_schedule *sched); __isl_null isl_schedule *isl_schedule_free( __isl_take isl_schedule *sched); The following functions checks whether two C objects are obviously the same. #include isl_bool isl_schedule_plain_is_equal( __isl_keep isl_schedule *schedule1, __isl_keep isl_schedule *schedule2); The domain of the schedule, i.e., the domain described by the root node, can be obtained using the following function. #include __isl_give isl_union_set *isl_schedule_get_domain( __isl_keep isl_schedule *schedule); An extra top-level band node (right underneath the domain node) can be introduced into the schedule using the following function. The schedule tree is assumed not to have any anchored nodes. #include __isl_give isl_schedule * isl_schedule_insert_partial_schedule( __isl_take isl_schedule *schedule, __isl_take isl_multi_union_pw_aff *partial); A top-level context node (right underneath the domain node) can be introduced into the schedule using the following function. #include __isl_give isl_schedule *isl_schedule_insert_context( __isl_take isl_schedule *schedule, __isl_take isl_set *context) A top-level guard node (right underneath the domain node) can be introduced into the schedule using the following function. #include __isl_give isl_schedule *isl_schedule_insert_guard( __isl_take isl_schedule *schedule, __isl_take isl_set *guard) A schedule that combines two schedules either in the given order or in an arbitrary order, i.e., with an C or an C node, can be created using the following functions. #include __isl_give isl_schedule *isl_schedule_sequence( __isl_take isl_schedule *schedule1, __isl_take isl_schedule *schedule2); __isl_give isl_schedule *isl_schedule_set( __isl_take isl_schedule *schedule1, __isl_take isl_schedule *schedule2); The domains of the two input schedules need to be disjoint. The following function can be used to restrict the domain of a schedule with a domain node as root to be a subset of the given union set. This operation may remove nodes in the tree that have become redundant. #include __isl_give isl_schedule *isl_schedule_intersect_domain( __isl_take isl_schedule *schedule, __isl_take isl_union_set *domain); The following function resets the user pointers on all parameter and tuple identifiers referenced by the nodes of the given schedule. #include __isl_give isl_schedule *isl_schedule_reset_user( __isl_take isl_schedule *schedule); The following function aligns the parameters of all nodes in the given schedule to the given space. #include __isl_give isl_schedule *isl_schedule_align_params( __isl_take isl_schedule *schedule, __isl_take isl_space *space); The following function allows the user to plug in a given function in the iteration domains. The input schedule is not allowed to contain any expansion nodes. #include __isl_give isl_schedule * isl_schedule_pullback_union_pw_multi_aff( __isl_take isl_schedule *schedule, __isl_take isl_union_pw_multi_aff *upma); An C representation of the schedule can be obtained from an C using the following function. #include __isl_give isl_union_map *isl_schedule_get_map( __isl_keep isl_schedule *sched); The resulting relation encodes the same relative ordering as the schedule by mapping the domain elements to a common schedule space. If the schedule_separate_components option is set, then the order of the children of a set node is explicitly encoded in the result. If the tree contains any expansion nodes, then the relation is formulated in terms of the expanded domain elements. Schedules can be read from input using the following functions. #include __isl_give isl_schedule *isl_schedule_read_from_file( isl_ctx *ctx, FILE *input); __isl_give isl_schedule *isl_schedule_read_from_str( isl_ctx *ctx, const char *str); A representation of the schedule can be printed using #include __isl_give isl_printer *isl_printer_print_schedule( __isl_take isl_printer *p, __isl_keep isl_schedule *schedule); The schedule tree can be traversed through the use of C objects that point to a particular position in the schedule tree. Whenever a C is use to modify a node in the schedule tree, the original schedule tree is left untouched and the modifications are performed to a copy of the tree. The returned C then points to this modified copy of the tree. The root of the schedule tree can be obtained using the following function. #include __isl_give isl_schedule_node *isl_schedule_get_root( __isl_keep isl_schedule *schedule); A pointer to a newly created schedule tree with a single domain node can be created using the following functions. #include __isl_give isl_schedule_node * isl_schedule_node_from_domain( __isl_take isl_union_set *domain); __isl_give isl_schedule_node * isl_schedule_node_from_extension( __isl_take isl_union_map *extension); C creates a tree with an extension node as root. Schedule nodes can be copied and freed using the following functions. #include __isl_give isl_schedule_node *isl_schedule_node_copy( __isl_keep isl_schedule_node *node); __isl_null isl_schedule_node *isl_schedule_node_free( __isl_take isl_schedule_node *node); The following functions can be used to check if two schedule nodes point to the same position in the same schedule. #include isl_bool isl_schedule_node_is_equal( __isl_keep isl_schedule_node *node1, __isl_keep isl_schedule_node *node2); The following properties can be obtained from a schedule node. #include enum isl_schedule_node_type isl_schedule_node_get_type( __isl_keep isl_schedule_node *node); enum isl_schedule_node_type isl_schedule_node_get_parent_type( __isl_keep isl_schedule_node *node); __isl_give isl_schedule *isl_schedule_node_get_schedule( __isl_keep isl_schedule_node *node); The function C returns the type of the node, while C returns type of the parent of the node, which is required to exist. The function C returns a copy to the schedule to which the node belongs. The following functions can be used to move the schedule node to a different position in the tree or to check if such a position exists. #include isl_bool isl_schedule_node_has_parent( __isl_keep isl_schedule_node *node); __isl_give isl_schedule_node *isl_schedule_node_parent( __isl_take isl_schedule_node *node); __isl_give isl_schedule_node *isl_schedule_node_root( __isl_take isl_schedule_node *node); __isl_give isl_schedule_node *isl_schedule_node_ancestor( __isl_take isl_schedule_node *node, int generation); int isl_schedule_node_n_children( __isl_keep isl_schedule_node *node); __isl_give isl_schedule_node *isl_schedule_node_child( __isl_take isl_schedule_node *node, int pos); isl_bool isl_schedule_node_has_children( __isl_keep isl_schedule_node *node); __isl_give isl_schedule_node *isl_schedule_node_first_child( __isl_take isl_schedule_node *node); isl_bool isl_schedule_node_has_previous_sibling( __isl_keep isl_schedule_node *node); __isl_give isl_schedule_node * isl_schedule_node_previous_sibling( __isl_take isl_schedule_node *node); isl_bool isl_schedule_node_has_next_sibling( __isl_keep isl_schedule_node *node); __isl_give isl_schedule_node * isl_schedule_node_next_sibling( __isl_take isl_schedule_node *node); For C, the ancestor of generation 0 is the node itself, the ancestor of generation 1 is its parent and so on. It is also possible to query the number of ancestors of a node, the position of the current node within the children of its parent, the position of the subtree containing a node within the children of an ancestor or to obtain a copy of a given child without destroying the current node. Given two nodes that point to the same schedule, their closest shared ancestor can be obtained using C. #include int isl_schedule_node_get_tree_depth( __isl_keep isl_schedule_node *node); int isl_schedule_node_get_child_position( __isl_keep isl_schedule_node *node); int isl_schedule_node_get_ancestor_child_position( __isl_keep isl_schedule_node *node, __isl_keep isl_schedule_node *ancestor); __isl_give isl_schedule_node *isl_schedule_node_get_child( __isl_keep isl_schedule_node *node, int pos); __isl_give isl_schedule_node * isl_schedule_node_get_shared_ancestor( __isl_keep isl_schedule_node *node1, __isl_keep isl_schedule_node *node2); All nodes in a schedule tree or all descendants of a specific node (including the node) can be visited in depth-first pre-order using the following functions. #include isl_stat isl_schedule_foreach_schedule_node_top_down( __isl_keep isl_schedule *sched, isl_bool (*fn)(__isl_keep isl_schedule_node *node, void *user), void *user); #include isl_stat isl_schedule_node_foreach_descendant_top_down( __isl_keep isl_schedule_node *node, isl_bool (*fn)(__isl_keep isl_schedule_node *node, void *user), void *user); The callback function is slightly different from the usual callbacks in that it not only indicates success (non-negative result) or failure (negative result), but also indicates whether the children of the given node should be visited. In particular, if the callback returns a positive value, then the children are visited, but if the callback returns zero, then the children are not visited. The ancestors of a node in a schedule tree can be visited from the root down to and including the parent of the node using the following function. #include isl_stat isl_schedule_node_foreach_ancestor_top_down( __isl_keep isl_schedule_node *node, isl_stat (*fn)(__isl_keep isl_schedule_node *node, void *user), void *user); The following functions allows for a depth-first post-order traversal of the nodes in a schedule tree or of the descendants of a specific node (including the node itself), where the user callback is allowed to modify the visited node. #include __isl_give isl_schedule * isl_schedule_map_schedule_node_bottom_up( __isl_take isl_schedule *schedule, __isl_give isl_schedule_node *(*fn)( __isl_take isl_schedule_node *node, void *user), void *user); #include __isl_give isl_schedule_node * isl_schedule_node_map_descendant_bottom_up( __isl_take isl_schedule_node *node, __isl_give isl_schedule_node *(*fn)( __isl_take isl_schedule_node *node, void *user), void *user); The traversal continues from the node returned by the callback function. It is the responsibility of the user to ensure that this does not lead to an infinite loop. It is safest to always return a pointer to the same position (same ancestors and child positions) as the input node. The following function removes a node (along with its descendants) from a schedule tree and returns a pointer to the leaf at the same position in the updated tree. It is not allowed to remove the root of a schedule tree or a child of a set or sequence node. #include __isl_give isl_schedule_node *isl_schedule_node_cut( __isl_take isl_schedule_node *node); The following function removes a single node from a schedule tree and returns a pointer to the child of the node, now located at the position of the original node or to a leaf node at that position if there was no child. It is not allowed to remove the root of a schedule tree, a set or sequence node, a child of a set or sequence node or a band node with an anchored subtree. #include __isl_give isl_schedule_node *isl_schedule_node_delete( __isl_take isl_schedule_node *node); Most nodes in a schedule tree only contain local information. In some cases, however, a node may also refer to outer band nodes. This means that the position of the node within the tree should not be changed, or at least that no changes are performed to the outer band nodes. The following function can be used to test whether the subtree rooted at a given node contains any such nodes. #include isl_bool isl_schedule_node_is_subtree_anchored( __isl_keep isl_schedule_node *node); The following function resets the user pointers on all parameter and tuple identifiers referenced by the given schedule node. #include __isl_give isl_schedule_node *isl_schedule_node_reset_user( __isl_take isl_schedule_node *node); The following function aligns the parameters of the given schedule node to the given space. #include __isl_give isl_schedule_node * isl_schedule_node_align_params( __isl_take isl_schedule_node *node, __isl_take isl_space *space); Several node types have their own functions for querying (and in some cases setting) some node type specific properties. #include __isl_give isl_space *isl_schedule_node_band_get_space( __isl_keep isl_schedule_node *node); __isl_give isl_multi_union_pw_aff * isl_schedule_node_band_get_partial_schedule( __isl_keep isl_schedule_node *node); __isl_give isl_union_map * isl_schedule_node_band_get_partial_schedule_union_map( __isl_keep isl_schedule_node *node); unsigned isl_schedule_node_band_n_member( __isl_keep isl_schedule_node *node); isl_bool isl_schedule_node_band_member_get_coincident( __isl_keep isl_schedule_node *node, int pos); __isl_give isl_schedule_node * isl_schedule_node_band_member_set_coincident( __isl_take isl_schedule_node *node, int pos, int coincident); isl_bool isl_schedule_node_band_get_permutable( __isl_keep isl_schedule_node *node); __isl_give isl_schedule_node * isl_schedule_node_band_set_permutable( __isl_take isl_schedule_node *node, int permutable); enum isl_ast_loop_type isl_schedule_node_band_member_get_ast_loop_type( __isl_keep isl_schedule_node *node, int pos); __isl_give isl_schedule_node * isl_schedule_node_band_member_set_ast_loop_type( __isl_take isl_schedule_node *node, int pos, enum isl_ast_loop_type type); __isl_give isl_union_set * enum isl_ast_loop_type isl_schedule_node_band_member_get_isolate_ast_loop_type( __isl_keep isl_schedule_node *node, int pos); __isl_give isl_schedule_node * isl_schedule_node_band_member_set_isolate_ast_loop_type( __isl_take isl_schedule_node *node, int pos, enum isl_ast_loop_type type); isl_schedule_node_band_get_ast_build_options( __isl_keep isl_schedule_node *node); __isl_give isl_schedule_node * isl_schedule_node_band_set_ast_build_options( __isl_take isl_schedule_node *node, __isl_take isl_union_set *options); The function C returns the space of the partial schedule of the band. The function C returns a representation of the partial schedule of the band node in the form of an C. The coincident and permutable properties are set by C on the schedule tree it produces. A scheduling dimension is considered to be ``coincident'' if it satisfies the coincidence constraints within its band. That is, if the dependence distances of the coincidence constraints are all zero in that direction (for fixed iterations of outer bands). A band is marked permutable if it was produced using the Pluto-like scheduler. Note that the scheduler may have to resort to a Feautrier style scheduling step even if the default scheduler is used. An C is one of C, C, C or C. For the meaning of these loop AST generation types and the difference between the regular loop AST generation type and the isolate loop AST generation type, see L. The functions C and C may return C if an error occurs. The AST build options govern how an AST is generated for the individual schedule dimensions during AST generation. See L. #include __isl_give isl_set * isl_schedule_node_context_get_context( __isl_keep isl_schedule_node *node); #include __isl_give isl_union_set * isl_schedule_node_domain_get_domain( __isl_keep isl_schedule_node *node); #include __isl_give isl_union_map * isl_schedule_node_expansion_get_expansion( __isl_keep isl_schedule_node *node); __isl_give isl_union_pw_multi_aff * isl_schedule_node_expansion_get_contraction( __isl_keep isl_schedule_node *node); #include __isl_give isl_union_map * isl_schedule_node_extension_get_extension( __isl_keep isl_schedule_node *node); #include __isl_give isl_union_set * isl_schedule_node_filter_get_filter( __isl_keep isl_schedule_node *node); #include __isl_give isl_set *isl_schedule_node_guard_get_guard( __isl_keep isl_schedule_node *node); #include __isl_give isl_id *isl_schedule_node_mark_get_id( __isl_keep isl_schedule_node *node); The following functions can be used to obtain an C, an C or C representation of partial schedules related to the node. #include __isl_give isl_multi_union_pw_aff * isl_schedule_node_get_prefix_schedule_multi_union_pw_aff( __isl_keep isl_schedule_node *node); __isl_give isl_union_pw_multi_aff * isl_schedule_node_get_prefix_schedule_union_pw_multi_aff( __isl_keep isl_schedule_node *node); __isl_give isl_union_map * isl_schedule_node_get_prefix_schedule_union_map( __isl_keep isl_schedule_node *node); __isl_give isl_union_map * isl_schedule_node_get_prefix_schedule_relation( __isl_keep isl_schedule_node *node); __isl_give isl_union_map * isl_schedule_node_get_subtree_schedule_union_map( __isl_keep isl_schedule_node *node); In particular, the functions C, C and C return a relative ordering on the domain elements that reach the given node determined by its ancestors. The function C additionally includes the domain constraints in the result. The function C returns a representation of the partial schedule defined by the subtree rooted at the given node. If the tree contains any expansion nodes, then the subtree schedule is formulated in terms of the expanded domain elements. The tree passed to functions returning a prefix schedule may only contain extension nodes if these would not affect the result of these functions. That is, if one of the ancestors is an extension node, then all of the domain elements that were added by the extension node need to have been filtered out by filter nodes between the extension node and the input node. The tree passed to C may not contain in extension nodes in the selected subtree. The expansion/contraction defined by an entire subtree, combining the expansions/contractions on the expansion nodes in the subtree, can be obtained using the following functions. #include __isl_give isl_union_map * isl_schedule_node_get_subtree_expansion( __isl_keep isl_schedule_node *node); __isl_give isl_union_pw_multi_aff * isl_schedule_node_get_subtree_contraction( __isl_keep isl_schedule_node *node); The total number of outer band members of given node, i.e., the shared output dimension of the maps in the result of C can be obtained using the following function. #include int isl_schedule_node_get_schedule_depth( __isl_keep isl_schedule_node *node); The following functions return the elements that reach the given node or the union of universes in the spaces that contain these elements. #include __isl_give isl_union_set * isl_schedule_node_get_domain( __isl_keep isl_schedule_node *node); __isl_give isl_union_set * isl_schedule_node_get_universe_domain( __isl_keep isl_schedule_node *node); The input tree of C may only contain extension nodes if these would not affect the result of this function. That is, if one of the ancestors is an extension node, then all of the domain elements that were added by the extension node need to have been filtered out by filter nodes between the extension node and the input node. The following functions can be used to introduce additional nodes in the schedule tree. The new node is introduced at the point in the tree where the C points to and the results points to the new node. #include __isl_give isl_schedule_node * isl_schedule_node_insert_partial_schedule( __isl_take isl_schedule_node *node, __isl_take isl_multi_union_pw_aff *schedule); This function inserts a new band node with (the greatest integer part of) the given partial schedule. The subtree rooted at the given node is assumed not to have any anchored nodes. #include __isl_give isl_schedule_node * isl_schedule_node_insert_context( __isl_take isl_schedule_node *node, __isl_take isl_set *context); This function inserts a new context node with the given context constraints. #include __isl_give isl_schedule_node * isl_schedule_node_insert_filter( __isl_take isl_schedule_node *node, __isl_take isl_union_set *filter); This function inserts a new filter node with the given filter. If the original node already pointed to a filter node, then the two filter nodes are merged into one. #include __isl_give isl_schedule_node * isl_schedule_node_insert_guard( __isl_take isl_schedule_node *node, __isl_take isl_set *guard); This function inserts a new guard node with the given guard constraints. #include __isl_give isl_schedule_node * isl_schedule_node_insert_mark( __isl_take isl_schedule_node *node, __isl_take isl_id *mark); This function inserts a new mark node with the give mark identifier. #include __isl_give isl_schedule_node * isl_schedule_node_insert_sequence( __isl_take isl_schedule_node *node, __isl_take isl_union_set_list *filters); __isl_give isl_schedule_node * isl_schedule_node_insert_set( __isl_take isl_schedule_node *node, __isl_take isl_union_set_list *filters); These functions insert a new sequence or set node with the given filters as children. #include __isl_give isl_schedule_node *isl_schedule_node_group( __isl_take isl_schedule_node *node, __isl_take isl_id *group_id); This function introduces an expansion node in between the current node and its parent that expands instances of a space with tuple identifier C to the original domain elements that reach the node. The group instances are identified by the prefix schedule of those domain elements. The ancestors of the node are adjusted to refer to the group instances instead of the original domain elements. The return value points to the same node in the updated schedule tree as the input node, i.e., to the child of the newly introduced expansion node. Grouping instances of different statements ensures that they will be treated as a single statement by the AST generator up to the point of the expansion node. The partial schedule of a band node can be scaled (down) using the following functions. #include __isl_give isl_schedule_node * isl_schedule_node_band_scale( __isl_take isl_schedule_node *node, __isl_take isl_multi_val *mv); __isl_give isl_schedule_node * isl_schedule_node_band_scale_down( __isl_take isl_schedule_node *node, __isl_take isl_multi_val *mv); The spaces of the two arguments need to match. After scaling, the partial schedule is replaced by its greatest integer part to ensure that the schedule remains integral. A band node can be tiled using the following function. #include __isl_give isl_schedule_node *isl_schedule_node_band_tile( __isl_take isl_schedule_node *node, __isl_take isl_multi_val *sizes); isl_stat isl_options_set_tile_scale_tile_loops(isl_ctx *ctx, int val); int isl_options_get_tile_scale_tile_loops(isl_ctx *ctx); isl_stat 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 node is created to represent the point loops and it is inserted between the modified band and its children. The subtree rooted at the given node is assumed not to have any anchored nodes. 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 node can be split into two nested band nodes using the following function. #include __isl_give isl_schedule_node *isl_schedule_node_band_split( __isl_take isl_schedule_node *node, int pos); The resulting outer band node contains the first C dimensions of the schedule of C while the inner band contains the remaining dimensions. The schedules of the two band nodes live in anonymous spaces. A band node can be moved down to the leaves of the subtree rooted at the band node using the following function. #include __isl_give isl_schedule_node *isl_schedule_node_band_sink( __isl_take isl_schedule_node *node); The subtree rooted at the given node is assumed not to have any anchored nodes. The result points to the node in the resulting tree that is in the same position as the node pointed to by C in the original tree. #include __isl_give isl_schedule_node * isl_schedule_node_order_after( __isl_take isl_schedule_node *node, __isl_take isl_union_set *filter); This function splits the domain elements that reach C into those that satisfy C and those that do not and arranges for the elements that do satisfy the filter to be executed after those that do not. The order is imposed by a sequence node, possibly reusing the grandparent of C on two copies of the subtree attached to the original C. Both copies are simplified with respect to their filter. Return a pointer to the copy of the subtree that does not satisfy C. If there is no such copy (because all reaching domain elements satisfy the filter), then return the original pointer. #include __isl_give isl_schedule_node * isl_schedule_node_graft_before( __isl_take isl_schedule_node *node, __isl_take isl_schedule_node *graft); __isl_give isl_schedule_node * isl_schedule_node_graft_after( __isl_take isl_schedule_node *node, __isl_take isl_schedule_node *graft); This function inserts the C tree into the tree containing C such that it is executed before (in case of C) or after (in case of C) C. The root node of C should be an extension node where the domain of the extension is the flat product of all outer band nodes of C. The root node may also be a domain node. The elements of the domain or the range of the extension may not intersect with the domain elements that reach "node". The schedule tree of C may not be anchored. The schedule tree of C is modified to include an extension node corresponding to the root node of C as a child of the original parent of C. The original node that C points to and the child of the root node of C are attached to this extension node through a sequence, with appropriate filters and with the child of C appearing before or after the original C. If C already appears inside a sequence that is the child of an extension node and if the spaces of the new domain elements do not overlap with those of the original domain elements, then that extension node is extended with the new extension rather than introducing a new segment of extension and sequence nodes. Return a pointer to the same node in the modified tree that C pointed to in the original tree. A representation of the schedule node can be printed using #include __isl_give isl_printer *isl_printer_print_schedule_node( __isl_take isl_printer *p, __isl_keep isl_schedule_node *node); =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. =head3 High-level Interface A high-level interface to dependence analysis is provided by the following function. #include __isl_give isl_union_flow * isl_union_access_info_compute_flow( __isl_take isl_union_access_info *access); The input C object describes the sink access relations, the source access relations and a schedule, while the output C object describes the resulting dependence relations and the subsets of the sink relations for which no source was found. An C is created, modified, copied and freed using the following functions. #include __isl_give isl_union_access_info * isl_union_access_info_from_sink( __isl_take isl_union_map *sink); __isl_give isl_union_access_info * isl_union_access_info_set_must_source( __isl_take isl_union_access_info *access, __isl_take isl_union_map *must_source); __isl_give isl_union_access_info * isl_union_access_info_set_may_source( __isl_take isl_union_access_info *access, __isl_take isl_union_map *may_source); __isl_give isl_union_access_info * isl_union_access_info_set_schedule( __isl_take isl_union_access_info *access, __isl_take isl_schedule *schedule); __isl_give isl_union_access_info * isl_union_access_info_set_schedule_map( __isl_take isl_union_access_info *access, __isl_take isl_union_map *schedule_map); __isl_give isl_union_access_info * isl_union_access_info_copy( __isl_keep isl_union_access_info *access); __isl_null isl_union_access_info * isl_union_access_info_free( __isl_take isl_union_access_info *access); The may sources set by C do not need to include the must sources set by C as a subset. The user is free not to call one (or both) of these functions, in which case the corresponding set is kept to its empty default. Similarly, the default schedule initialized by C is empty. The current schedule is determined by the last call to either C or C. The domain of the schedule corresponds to the domains of the access relations. In particular, the domains of the access relations are effectively intersected with the domain of the schedule and only the resulting accesses are considered by the dependence analysis. The output of C can be examined and freed using the following functions. #include __isl_give isl_union_map *isl_union_flow_get_must_dependence( __isl_keep isl_union_flow *flow); __isl_give isl_union_map *isl_union_flow_get_may_dependence( __isl_keep isl_union_flow *flow); __isl_give isl_union_map *isl_union_flow_get_must_no_source( __isl_keep isl_union_flow *flow); __isl_give isl_union_map *isl_union_flow_get_may_no_source( __isl_keep isl_union_flow *flow); __isl_null isl_union_flow *isl_union_flow_free( __isl_take isl_union_flow *flow); The relation returned by C relates domain elements of must sources to domain elements of the sink. The relation returned by C relates domain elements of must or may sources to domain elements of the sink and includes the previous relation as a subset. The relation returned by C is the subset of the sink relation for which no dependences have been found. The relation returned by C is the subset of the sink relation for which no definite dependences have been found. That is, it contains those sink access that do not contribute to any of the elements in the relation returned by C. =head3 Low-level Interface A lower-level interface is provided by the following functions. #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); __isl_null isl_access_info *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); isl_stat isl_flow_foreach(__isl_keep isl_flow *deps, isl_stat (*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. =head3 Interaction with the Low-level Interface 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); __isl_null isl_restriction *isl_restriction_free( __isl_take 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 #include __isl_give isl_schedule * isl_schedule_constraints_compute_schedule( __isl_take isl_schedule_constraints *sc); The function C can be used to compute a schedule that satisfies the given schedule constraints. These schedule constraints include the iteration domain for which a schedule should be computed and dependences between pairs of iterations. In particular, these dependences include I dependences and I dependences. 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 validity dependences. That is, all dependence distances over these dependences in the scheduled space are lexicographically positive. The default algorithm tries to ensure that the dependence distances over coincidence constraints are zero and to minimize the dependence distances over proximity dependences. Moreover, it tries to obtain sequences (bands) of schedule dimensions for groups of domains where the dependence distances over validity dependences have only non-negative values. Note that when minimizing the maximal dependence distance over proximity dependences, a single affine expression in the parameters is constructed that bounds all dependence distances. If no such expression exists, then the algorithm will fail and resort to an alternative scheduling algorithm. In particular, this means that adding proximity dependences may eliminate valid solutions. A typical example where this phenomenon may occur is when some subset of the proximity dependences has no restriction on some parameter, forcing the coefficient of that parameter to be zero, while some other subset forces the dependence distance to depend on that parameter, requiring the same coefficient to be non-zero. When using Feautrier's algorithm, the coincidence and proximity constraints are only taken into account during the extension to a full-dimensional schedule. An C object can be constructed and manipulated using the following functions. #include __isl_give isl_schedule_constraints * isl_schedule_constraints_copy( __isl_keep isl_schedule_constraints *sc); __isl_give isl_schedule_constraints * isl_schedule_constraints_on_domain( __isl_take isl_union_set *domain); __isl_give isl_schedule_constraints * isl_schedule_constraints_set_context( __isl_take isl_schedule_constraints *sc, __isl_take isl_set *context); __isl_give isl_schedule_constraints * isl_schedule_constraints_set_validity( __isl_take isl_schedule_constraints *sc, __isl_take isl_union_map *validity); __isl_give isl_schedule_constraints * isl_schedule_constraints_set_coincidence( __isl_take isl_schedule_constraints *sc, __isl_take isl_union_map *coincidence); __isl_give isl_schedule_constraints * isl_schedule_constraints_set_proximity( __isl_take isl_schedule_constraints *sc, __isl_take isl_union_map *proximity); __isl_give isl_schedule_constraints * isl_schedule_constraints_set_conditional_validity( __isl_take isl_schedule_constraints *sc, __isl_take isl_union_map *condition, __isl_take isl_union_map *validity); __isl_null isl_schedule_constraints * isl_schedule_constraints_free( __isl_take isl_schedule_constraints *sc); The initial C object created by C does not impose any constraints. That is, it has an empty set of dependences. The function C allows the user to specify additional constraints on the parameters that may be assumed to hold during the construction of the schedule. The function C replaces the validity dependences, mapping domain elements I to domain elements that should be scheduled after I. The function C replaces the coincidence dependences, mapping domain elements I to domain elements that should be scheduled together with I, if possible. The function C replaces the proximity dependences, mapping domain elements I to domain elements that should be scheduled either before I or as early as possible after I. The function C replaces the conditional validity constraints. A conditional validity constraint is only imposed when any of the corresponding conditions is satisfied, i.e., when any of them is non-zero. That is, the scheduler ensures that within each band if the dependence distances over the condition constraints are not all zero then all corresponding conditional validity constraints are respected. A conditional validity constraint corresponds to a condition if the two are adjacent, i.e., if the domain of one relation intersect the range of the other relation. The typical use case of conditional validity constraints is to allow order constraints between live ranges to be violated as long as the live ranges themselves are local to the band. To allow more fine-grained control over which conditions correspond to which conditional validity constraints, the domains and ranges of these relations may include I. That is, the domains and ranges of those relation may themselves be wrapped relations where the iteration domain appears in the domain of those wrapped relations and the range of the wrapped relations can be arbitrarily chosen by the user. Conditions and conditional validity constraints are only considered adjacent to each other if the entire wrapped relation matches. In particular, a relation with a tag will never be considered adjacent to a relation without a tag. An C object can be inspected using the following functions. #include __isl_give isl_union_map * isl_schedule_constraints_get_validity( __isl_keep isl_schedule_constraints *sc); __isl_give isl_union_map * isl_schedule_constraints_get_coincidence( __isl_keep isl_schedule_constraints *sc); __isl_give isl_union_map * isl_schedule_constraints_get_conditional_validity( __isl_keep isl_schedule_constraints *sc); __isl_give isl_union_map * isl_schedule_constraints_get_conditional_validity_condition( __isl_keep isl_schedule_constraints *sc); The following function computes a schedule directly from an iteration domain and validity and proximity dependences and is implemented in terms of the functions described above. The use of C is discouraged. #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); The generated schedule represents a schedule tree. For more information on schedule trees, see L. =head3 Options #include isl_stat isl_options_set_schedule_max_coefficient( isl_ctx *ctx, int val); int isl_options_get_schedule_max_coefficient( isl_ctx *ctx); isl_stat isl_options_set_schedule_max_constant_term( isl_ctx *ctx, int val); int isl_options_get_schedule_max_constant_term( isl_ctx *ctx); isl_stat isl_options_set_schedule_serialize_sccs( isl_ctx *ctx, int val); int isl_options_get_schedule_serialize_sccs(isl_ctx *ctx); isl_stat isl_options_set_schedule_maximize_band_depth( isl_ctx *ctx, int val); int isl_options_get_schedule_maximize_band_depth( isl_ctx *ctx); isl_stat isl_options_set_schedule_outer_coincidence( isl_ctx *ctx, int val); int isl_options_get_schedule_outer_coincidence( isl_ctx *ctx); isl_stat isl_options_set_schedule_split_scaled( isl_ctx *ctx, int val); int isl_options_get_schedule_split_scaled( isl_ctx *ctx); isl_stat isl_options_set_schedule_algorithm( isl_ctx *ctx, int val); int isl_options_get_schedule_algorithm( isl_ctx *ctx); isl_stat 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_serialize_sccs If this option is set, then all strongly connected components in the dependence graph are serialized as soon as they are detected. This means in particular that instances of statements will only appear in the same band node if these statements belong to the same strongly connected component at the point where the band node is constructed. =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 options is set, 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_coincidence If this option is set, then we try to construct schedules where the outermost scheduling dimension in each band satisfies the coincidence constraints. =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 this option is set then the function C will treat set nodes in the same way as sequence nodes. =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 tree or a schedule map. In case the schedule given as 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 schedule tree or the image elements in a schedule map only specify the I in which the corresponding domain elements should be visited. No direct relation between the partial schedule values or the image elements on the one hand and the loop iterators in the generated AST on the other hand 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_alloc( isl_ctx *ctx); __isl_give isl_ast_build *isl_ast_build_from_context( __isl_take isl_set *set); __isl_give isl_ast_build *isl_ast_build_copy( __isl_keep isl_ast_build *build); __isl_null isl_ast_build *isl_ast_build_free( __isl_take isl_ast_build *build); The C argument is usually a parameter set with zero or more parameters. In fact, when creating an AST using C, this set is required to be a parameter set. An C created using C does not specify any parameter constraints. More C functions are described in L and L. Finally, the AST itself can be constructed using one of the following functions. #include __isl_give isl_ast_node *isl_ast_build_node_from_schedule( __isl_keep isl_ast_build *build, __isl_take isl_schedule *schedule); __isl_give isl_ast_node * isl_ast_build_node_from_schedule_map( __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 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, C or C. An C represents a for node. An C represents an if node. An C represents a compound node. An C introduces a mark in the AST. 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); isl_bool 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); isl_bool 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_id *isl_ast_node_mark_get_id( __isl_keep isl_ast_node *node); __isl_give isl_ast_node *isl_ast_node_mark_get_node( __isl_keep isl_ast_node *node); C returns the identifier of the mark. C returns the child node that is being marked. #include __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 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); isl_stat isl_ast_node_foreach_ast_op_type( __isl_keep isl_ast_node *node, isl_stat (*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 Equal to zero iff the remainder on integer division is zero. =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. =item C An array access. The number of arguments of the C is one more than the number of index expressions in the array access, the first argument representing the array being accessed. =item C A member access. This operation has two arguments, a structure and the name of the member of the structure being accessed. =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 __isl_give isl_val *isl_ast_expr_get_val( __isl_keep isl_ast_expr *expr); Return the integer represented by the AST expression. =head3 Properties of ASTs #include isl_bool isl_ast_expr_is_equal( __isl_keep isl_ast_expr *expr1, __isl_keep isl_ast_expr *expr2); Check if two Cs are equal to each other. =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); __isl_null isl_ast_node *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); __isl_null isl_ast_expr *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_address_of( __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_pdiv_q( __isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2); __isl_give isl_ast_expr *isl_ast_expr_pdiv_r( __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_and_then( __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_or_else( __isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2) __isl_give isl_ast_expr *isl_ast_expr_eq( __isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2); __isl_give isl_ast_expr *isl_ast_expr_le( __isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2); __isl_give isl_ast_expr *isl_ast_expr_lt( __isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2); __isl_give isl_ast_expr *isl_ast_expr_ge( __isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2); __isl_give isl_ast_expr *isl_ast_expr_gt( __isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2); __isl_give isl_ast_expr *isl_ast_expr_access( __isl_take isl_ast_expr *array, __isl_take isl_ast_expr_list *indices); __isl_give isl_ast_expr *isl_ast_expr_call( __isl_take isl_ast_expr *function, __isl_take isl_ast_expr_list *arguments); The function C can be applied to an C of type C only. It is meant to represent the address of the C. The function C as well as C are short-circuit versions of C and C, respectively. #include __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( __isl_keep isl_ast_build *build, __isl_take isl_pw_aff *pa); __isl_give isl_ast_expr * isl_ast_build_access_from_pw_multi_aff( __isl_keep isl_ast_build *build, __isl_take isl_pw_multi_aff *pma); __isl_give isl_ast_expr * isl_ast_build_access_from_multi_pw_aff( __isl_keep isl_ast_build *build, __isl_take isl_multi_pw_aff *mpa); __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_expr * isl_ast_build_call_from_multi_pw_aff( __isl_keep isl_ast_build *build, __isl_take isl_multi_pw_aff *mpa); The set and the domains of C, C and C should correspond to the schedule space of C. The tuple id of C or C is used as the array being accessed or the function being called. If the accessed space is a nested relation, then it is taken to represent an access of the member specified by the range of this nested relation of the structure specified by the domain of the nested relation. The following functions can be used to modify an C. #include __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); Replace the argument of C at position C by C. #include __isl_give isl_ast_expr *isl_ast_expr_substitute_ids( __isl_take isl_ast_expr *expr, __isl_take isl_id_to_ast_expr *id2expr); The function C replaces the subexpressions of C of type C by the corresponding expression in C, if there is any. 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); __isl_give char *isl_ast_expr_to_str( __isl_keep isl_ast_expr *expr); 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); __isl_null isl_ast_print_options * 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. isl_stat isl_options_set_ast_iterator_type( isl_ctx *ctx, const char *val); const char *isl_options_get_ast_iterator_type( isl_ctx *ctx); The AST printer only prints body nodes as blocks if these blocks cannot be safely omitted. For example, a C node with one body node will not be surrounded with braces in C. A block will always be printed by setting the following option. isl_stat isl_options_set_ast_always_print_block(isl_ctx *ctx, int val); int isl_options_get_ast_always_print_block(isl_ctx *ctx); =head3 Options #include isl_stat 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); isl_stat isl_options_set_ast_build_prefer_pdiv(isl_ctx *ctx, int val); int isl_options_get_ast_build_prefer_pdiv(isl_ctx *ctx); isl_stat 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); isl_stat isl_options_set_ast_build_group_coscheduled( isl_ctx *ctx, int val); int isl_options_get_ast_build_group_coscheduled( isl_ctx *ctx); isl_stat isl_options_set_ast_build_scale_strides( isl_ctx *ctx, int val); int isl_options_get_ast_build_scale_strides( isl_ctx *ctx); isl_stat isl_options_set_ast_build_allow_else(isl_ctx *ctx, int val); int isl_options_get_ast_build_allow_else(isl_ctx *ctx); isl_stat 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 AST Generation Options (Schedule Tree) In case of AST construction from a schedule tree, the options that control how an AST is created from the individual schedule dimensions are stored in the band nodes of the tree (see L). In particular, a schedule dimension can be handled in four different ways, atomic, separate, unroll or the default. This loop AST generation type can be set using C. Alternatively, the first three can be selected by including a one-dimensional element with as value the position of the schedule dimension within the band and as name one of C, C or C in the options set by C. Only one of these three may be specified for any given schedule dimension within a band node. If none of these is specified, then the default is used. The meaning of the options is as follows. =over =item C When this option is specified, the AST generator will make sure that a given domains space only appears in a single loop at the specified level. For example, for the schedule tree domain: "{ a[i] : 0 <= i < 10; b[i] : 0 <= i < 10 }" child: schedule: "[{ a[i] -> [i]; b[i] -> [i+1] }]" options: "{ atomic[x] }" the following AST will be generated for (int c0 = 0; c0 <= 10; c0 += 1) { if (c0 >= 1) b(c0 - 1); if (c0 <= 9) a(c0); } On the other hand, for the schedule tree domain: "{ a[i] : 0 <= i < 10; b[i] : 0 <= i < 10 }" child: schedule: "[{ a[i] -> [i]; b[i] -> [i+1] }]" options: "{ separate[x] }" the following AST will be generated { a(0); for (int c0 = 1; c0 <= 9; c0 += 1) { b(c0 - 1); a(c0); } b(9); } If neither C nor C is specified, then the AST generator may produce either of these two results or some intermediate form. =item C When this option is specified, the AST generator will split the domain of the specified schedule dimension into pieces with a fixed set of statements for which instances need to be executed by the iterations in the schedule domain part. This option tends to avoid the generation of guards inside the corresponding loops. See also the C option. =item C When this option is specified, the AST generator will I unroll the corresponding schedule dimension. It is the responsibility of the user to ensure that such unrolling is possible. To obtain a partial unrolling, the user should apply an additional strip-mining to the schedule and fully unroll the inner schedule dimension. =back The C option is a bit more involved. It allows the user to isolate a range of schedule dimension values from smaller and greater values. Additionally, the user may specify a different atomic/separate/unroll choice for the isolated part and the remaining parts. The typical use case of the C option is to isolate full tiles from partial tiles. The part that needs to be isolated may depend on outer schedule dimensions. The option therefore needs to be able to reference those outer schedule dimensions. In particular, the space of the C option is that of a wrapped map with as domain the flat product of all outer band nodes and as range the space of the current band node. The atomic/separate/unroll choice for the isolated part is determined by an option that lives in an unnamed wrapped space with as domain a zero-dimensional C space and as range the regular C, C or C space. This option may also be set directly using C. The atomic/separate/unroll choice for the remaining part is determined by the regular C, C or C option. The use of the C option causes any tree containing the node to be considered anchored. As an example, consider the isolation of full tiles from partial tiles in a tiling of a triangular domain. The original schedule is as follows. domain: "{ A[i,j] : 0 <= i,j and i + j <= 100 }" child: schedule: "[{ A[i,j] -> [floor(i/10)] }, \ { A[i,j] -> [floor(j/10)] }, \ { A[i,j] -> [i] }, { A[i,j] -> [j] }]" The output is 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 * c0 + 9, -10 * c1 + 100); c2 += 1) for (int c3 = 10 * c1; c3 <= min(10 * c1 + 9, -c2 + 100); c3 += 1) A(c2, c3); Isolating the full tiles, we have the following input domain: "{ A[i,j] : 0 <= i,j and i + j <= 100 }" child: schedule: "[{ A[i,j] -> [floor(i/10)] }, \ { A[i,j] -> [floor(j/10)] }, \ { A[i,j] -> [i] }, { A[i,j] -> [j] }]" options: "{ isolate[[] -> [a,b,c,d]] : 0 <= 10a,10b and \ 10a+9+10b+9 <= 100 }" and output { 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(10 * c1 + 9, -c2 + 100); c3 += 1) A(c2, c3); } We may then additionally unroll the innermost loop of the isolated part domain: "{ A[i,j] : 0 <= i,j and i + j <= 100 }" child: schedule: "[{ A[i,j] -> [floor(i/10)] }, \ { A[i,j] -> [floor(j/10)] }, \ { A[i,j] -> [i] }, { A[i,j] -> [j] }]" options: "{ isolate[[] -> [a,b,c,d]] : 0 <= 10a,10b and \ 10a+9+10b+9 <= 100; [isolate[] -> unroll[3]] }" to obtain { 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) { A(c2, 10 * c1); A(c2, 10 * c1 + 1); A(c2, 10 * c1 + 2); A(c2, 10 * c1 + 3); A(c2, 10 * c1 + 4); A(c2, 10 * c1 + 5); A(c2, 10 * c1 + 6); A(c2, 10 * c1 + 7); A(c2, 10 * c1 + 8); A(c2, 10 * c1 + 9); } 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(10 * c1 + 9, -c2 + 100); c3 += 1) A(c2, c3); } =head3 AST Generation Options (Schedule Map) In case of AST construction using C, the options that control how an AST is created from the individual schedule dimensions are stored in the C. They 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 C. 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 B 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 =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. In case of AST construction using C, the most prominent way of control is through ``options'', as explained above. 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); __isl_give isl_ast_build * isl_ast_build_set_before_each_mark( __isl_take isl_ast_build *build, isl_stat (*fn)(__isl_keep isl_id *mark, __isl_keep isl_ast_build *build, void *user), void *user); __isl_give isl_ast_build * isl_ast_build_set_after_each_mark( __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. The callbacks set by C and C will be called for each mark AST node that is created, i.e., for each mark schedule node in the input schedule tree. The first will be called in depth-first pre-order, while the second will be called in depth-first post-order. Since the callback set by C is called before the mark AST node is actually constructed, it is passed the identifier of the mark node. All callbacks should C (or -1) 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.4/isl/isl_sample.c0000644000175000017500000010753312554427055012735 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 #include #include #include "isl_equalities.h" #include "isl_tab.h" #include "isl_basis_reduction.h" #include #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; } /* 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_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); 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(isl_basic_set_get_ctx(bset), 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 = isl_basic_set_get_ctx(bset); total = isl_basic_set_total_dim(cone); cone_dim = total - cone->n_eq; M = isl_mat_sub_alloc6(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; if (isl_tab_extend_cons(tab, 1) < 0) goto error; 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 *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); return bounded ? sample_bounded(bset) : gbr_sample(bset); 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) { isl_vec_free(sample_vec); return isl_basic_map_set_to_empty(bmap); } 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(isl_map_get_space(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.4/isl/isl_options_private.h0000644000175000017500000000265612554427055014706 00000000000000#ifndef ISL_OPTIONS_PRIVATE_H #define ISL_OPTIONS_PRIVATE_H #include struct isl_options { #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_coincidence; int schedule_maximize_band_depth; int schedule_split_scaled; int schedule_separate_components; unsigned schedule_algorithm; int schedule_serialize_sccs; int tile_scale_tile_loops; int tile_shift_point_loops; char *ast_iterator_type; int ast_always_print_block; 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; int print_stats; unsigned long max_operations; }; #endif cloog-0.18.4/isl/GIT_HEAD_ID0000644000175000017500000000001112555417256012126 00000000000000isl-0.15 cloog-0.18.4/isl/isl_basis_reduction.h0000644000175000017500000000103412413256472014620 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.4/isl/isl_output.c0000644000175000017500000022147312554427055013014 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 #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); } /* Internal data structure for print_space. * * latex is set if that is the output format. * print_dim (if not NULL) is called on each dimension. * user is set by the caller of print_space and may be used inside print_dim. * * space is the global space that is being printed. This field is set by * print_space. * type is the tuple of the global space that is currently being printed. * This field is set by print_space. */ struct isl_print_space_data { int latex; __isl_give isl_printer *(*print_dim)(__isl_take isl_printer *p, struct isl_print_space_data *data, unsigned pos); void *user; isl_space *space; enum isl_dim_type type; }; /* offset is the offset of local_dim inside data->type of data->space. */ static __isl_give isl_printer *print_nested_var_list(__isl_take isl_printer *p, __isl_keep isl_space *local_dim, enum isl_dim_type local_type, struct isl_print_space_data *data, int offset) { int i; if (data->space != 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 (data->print_dim) p = data->print_dim(p, data, offset + i); else p = print_name(data->space, p, data->type, offset + i, data->latex); } return p; } static __isl_give isl_printer *print_var_list(__isl_take isl_printer *p, __isl_keep isl_space *space, enum isl_dim_type type) { struct isl_print_space_data data = { .space = space, .type = type }; return print_nested_var_list(p, space, type, &data, 0); } static __isl_give isl_printer *print_nested_map_dim(__isl_take isl_printer *p, __isl_keep isl_space *local_dim, struct isl_print_space_data *data, int offset); static __isl_give isl_printer *print_nested_tuple(__isl_take isl_printer *p, __isl_keep isl_space *local_dim, enum isl_dim_type local_type, struct isl_print_space_data *data, 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 (data->latex) p = isl_printer_print_str(p, "\\mathrm{"); p = isl_printer_print_str(p, name); if (data->latex) p = isl_printer_print_str(p, "}"); } } if (!data->latex || n != 1 || name) p = isl_printer_print_str(p, s_open_list[data->latex]); if ((local_type == isl_dim_in || local_type == isl_dim_out) && local_dim->nested[local_type - isl_dim_in]) { if (data->space != local_dim && local_type == isl_dim_out) offset += local_dim->n_in; p = print_nested_map_dim(p, local_dim->nested[local_type - isl_dim_in], data, offset); } else p = print_nested_var_list(p, local_dim, local_type, data, offset); if (!data->latex || n != 1 || name) p = isl_printer_print_str(p, s_close_list[data->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, struct isl_print_space_data *data) { data->space = dim; data->type = type; return print_nested_tuple(p, dim, type, data, 0); } static __isl_give isl_printer *print_nested_map_dim(__isl_take isl_printer *p, __isl_keep isl_space *local_dim, struct isl_print_space_data *data, int offset) { p = print_nested_tuple(p, local_dim, isl_dim_in, data, offset); p = isl_printer_print_str(p, s_to[data->latex]); p = print_nested_tuple(p, local_dim, isl_dim_out, data, offset); return p; } static __isl_give isl_printer *print_space(__isl_keep isl_space *dim, __isl_take isl_printer *p, int rational, struct isl_print_space_data *data) { if (rational && !data->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, data); else { p = print_tuple(dim, p, isl_dim_in, data); p = isl_printer_print_str(p, s_to[data->latex]); p = print_tuple(dim, p, isl_dim_out, data); } 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(p, dim, isl_dim_param); 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_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(" : "floor(("); 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, ")"); return p; } /* Print a comma separated list of div names, with their definitions * (provided that they have a definition and we are printing in isl format). */ static __isl_give isl_printer *print_div_list(__isl_take isl_printer *p, __isl_keep isl_space *space, __isl_keep isl_mat *div, int latex) { int i; unsigned n_div; if (!p || !space || !div) return isl_printer_free(p); n_div = isl_mat_rows(div); for (i = 0; i < n_div; ++i) { if (i) p = isl_printer_print_str(p, ", "); p = print_name(space, p, isl_dim_div, i, latex); if (p->output_format != ISL_FORMAT_ISL || isl_int_is_zero(div->row[i][0])) continue; p = isl_printer_print_str(p, " = "); p = print_div(space, div, 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) { isl_space *space; isl_mat *div; space = isl_basic_map_get_space(bmap); div = isl_basic_map_get_divs(bmap); p = isl_printer_print_str(p, s_open_exists[latex]); p = print_div_list(p, space, div, latex); isl_space_free(space); isl_mat_free(div); 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; } /* Print a colon followed by the constraints of "bmap" * to "p", provided there are any constraints. * The names of the variables are taken from "space". * "latex" is set if the constraints should be printed in LaTeX format. */ static __isl_give isl_printer *print_optional_disjunct( __isl_keep isl_basic_map *bmap, __isl_keep isl_space *space, __isl_take isl_printer *p, int latex) { if (isl_basic_map_is_universe(bmap)) return p; p = isl_printer_print_str(p, ": "); p = print_disjunct(bmap, space, p, latex); 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(p, bmap->dim, isl_dim_in); p = isl_printer_print_str(p, "] -> ["); p = print_var_list(p, bmap->dim, isl_dim_out); p = isl_printer_print_str(p, "] "); p = print_optional_disjunct(bmap, bmap->dim, p, 0); 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(p, bset->dim, isl_dim_set); p = isl_printer_print_str(p, "] "); p = print_optional_disjunct(bset, bset->dim, p, 0); 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 *isl_basic_map_print_isl( __isl_keep isl_basic_map *bmap, __isl_take isl_printer *p, int latex) { struct isl_print_space_data data = { .latex = 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, &data); p = isl_printer_print_str(p, " -> "); } p = isl_printer_print_str(p, "{ "); p = print_space(bmap->dim, p, rational, &data); 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 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; } /* Print dimension "pos" of data->space to "p". * * data->user is assumed to be an isl_basic_map keeping track of equalities. * * If the current dimension is defined by these equalities, then print * the corresponding expression. Otherwise, print the name of the dimension. */ static __isl_give isl_printer *print_dim_eq(__isl_take isl_printer *p, struct isl_print_space_data *data, unsigned pos) { isl_basic_map *eq = data->user; int j; j = defining_equality(eq, data->space, data->type, pos); if (j >= 0) { pos += 1 + isl_space_offset(data->space, data->type); p = print_affine_of_len(eq->dim, NULL, p, eq->eq[j], pos); } else { p = print_name(data->space, p, data->type, pos, data->latex); } return p; } static __isl_give isl_printer *print_split_map(__isl_take isl_printer *p, struct isl_aff_split *split, int n) { struct isl_print_space_data data = { 0 }; int i; int rational; data.print_dim = &print_dim_eq; 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, "; "); data.user = split[i].aff; p = print_space(dim, p, rational, &data); 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_print_space_data data = { 0 }; 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, rational, &data); 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) { struct isl_print_space_data data = { 0 }; if (isl_map_dim(map, isl_dim_param) > 0) { p = print_tuple(map->dim, p, isl_dim_param, &data); 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) { struct isl_print_space_data data = { 0 }; data.latex = 1; if (isl_map_dim(map, isl_dim_param) > 0) { p = print_tuple(map->dim, p, isl_dim_param, &data); p = isl_printer_print_str(p, s_to[1]); } p = isl_printer_print_str(p, s_open_set[1]); data.print_dim = &print_dim_eq; data.user = aff; p = print_space(map->dim, p, 0, &data); 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; } __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; } __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; } __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 isl_stat 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 isl_stat_ok; } 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; struct isl_print_space_data space_data = { 0 }; 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, &space_data); p = isl_printer_print_str(p, s_to[0]); } isl_space_free(dim); p = isl_printer_print_str(p, s_open_set[0]); data.p = p; data.first = 1; 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 isl_stat 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 isl_stat_ok; } 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; } 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 *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) { struct isl_print_space_data data = { 0 }; if (!p || !qp) goto error; if (isl_space_dim(qp->dim, isl_dim_param) > 0) { p = print_tuple(qp->dim, p, isl_dim_param, &data); 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, &data); 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) { struct isl_print_space_data data = { 0 }; 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, &data); 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) { struct isl_print_space_data data = { 0 }; if (!p || !pwqp) goto error; if (isl_space_dim(pwqp->dim, isl_dim_param) > 0) { p = print_tuple(pwqp->dim, p, isl_dim_param, &data); 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, &data); 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) { struct isl_print_space_data data = { 0 }; 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, &data); 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) { struct isl_print_space_data data = { 0 }; if (isl_space_dim(pwf->dim, isl_dim_param) > 0) { p = print_tuple(pwf->dim, p, isl_dim_param, &data); 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, &data); 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. * * *first indicates whether this is the first constraint in the conjunction and * is updated if the constraint is actually printed. */ 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"); *first = 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; int first = 1; 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], "==", &first); 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"); first = 0; } } for (i = 0; i < bset->n_ineq; ++i) p = print_constraint_c(p, dim, bset, bset->ineq[i], ">=", &first); 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 isl_stat 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 isl_stat_ok; } 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; struct isl_print_space_data space_data = { 0 }; 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, &space_data); p = isl_printer_print_str(p, " -> "); } isl_space_free(dim); p = isl_printer_print_str(p, "{ "); data.p = p; data.first = 1; 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 isl_stat 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 isl_stat_ok; } 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; struct isl_print_space_data space_data = { 0 }; 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, &space_data); p = isl_printer_print_str(p, " -> "); } isl_space_free(dim); p = isl_printer_print_str(p, "{ "); data.p = p; data.first = 1; 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) { struct isl_print_space_data data = { 0 }; if (!dim) goto error; if (isl_space_dim(dim, isl_dim_param) > 0) { p = print_tuple(dim, p, isl_dim_param, &data); 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, &data); 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) { struct isl_print_space_data data = { 0 }; unsigned n_div; if (!ls) goto error; if (isl_local_space_dim(ls, isl_dim_param) > 0) { p = print_tuple(ls->dim, p, isl_dim_param, &data); p = isl_printer_print_str(p, " -> "); } p = isl_printer_print_str(p, "{ "); p = print_space(ls->dim, p, 0, &data); n_div = isl_local_space_dim(ls, isl_dim_div); if (n_div > 0) { p = isl_printer_print_str(p, " : "); p = isl_printer_print_str(p, s_open_exists[0]); p = print_div_list(p, ls->dim, ls->div, 0); } 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; if (isl_aff_is_nan(aff)) return isl_printer_print_str(p, "NaN"); 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) { struct isl_print_space_data data = { 0 }; if (isl_space_is_params(aff->ls->dim)) ; else { p = print_tuple(aff->ls->dim, p, isl_dim_set, &data); 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) { struct isl_print_space_data data = { 0 }; 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, &data); 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; } /* Print the body of an isl_pw_aff, i.e., a semicolon delimited * sequence of affine expressions, each followed by constraints. */ static __isl_give isl_printer *print_pw_aff_body( __isl_take isl_printer *p, __isl_keep isl_pw_aff *pa) { int i; if (!pa) return isl_printer_free(p); for (i = 0; i < pa->n; ++i) { if (i) p = isl_printer_print_str(p, "; "); p = print_aff(p, pa->p[i].aff); p = print_disjuncts((isl_map *)pa->p[i].set, p, 0); } return p; } static __isl_give isl_printer *print_pw_aff_isl(__isl_take isl_printer *p, __isl_keep isl_pw_aff *pwaff) { struct isl_print_space_data data = { 0 }; if (!pwaff) goto error; if (isl_space_dim(pwaff->dim, isl_dim_param) > 0) { p = print_tuple(pwaff->dim, p, isl_dim_param, &data); p = isl_printer_print_str(p, " -> "); } p = isl_printer_print_str(p, "{ "); p = print_pw_aff_body(p, pwaff); 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; } /* 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) { isl_set *domain; isl_ast_build *build; isl_ast_expr *expr; if (pwaff->n < 1) isl_die(p->ctx, isl_error_unsupported, "cannot print empty isl_pw_aff in C format", return isl_printer_free(p)); domain = isl_pw_aff_domain(isl_pw_aff_copy(pwaff)); build = isl_ast_build_from_context(domain); expr = isl_ast_build_expr_from_pw_aff(build, isl_pw_aff_copy(pwaff)); p = isl_printer_print_ast_expr(p, expr); isl_ast_expr_free(expr); isl_ast_build_free(build); return p; } __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; } /* Print "pa" in a sequence of isl_pw_affs delimited by semicolons. * Each isl_pw_aff itself is also printed as semicolon delimited * sequence of pieces. * If data->first = 1, then this is the first in the sequence. * Update data->first to tell the next element that it is not the first. */ static isl_stat print_pw_aff_body_wrap(__isl_take isl_pw_aff *pa, 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_aff_body(data->p, pa); isl_pw_aff_free(pa); return data->p ? isl_stat_ok : isl_stat_error; } /* Print the body of an isl_union_pw_aff, i.e., a semicolon delimited * sequence of affine expressions, each followed by constraints, * with the sequence enclosed in braces. */ static __isl_give isl_printer *print_union_pw_aff_body( __isl_take isl_printer *p, __isl_keep isl_union_pw_aff *upa) { struct isl_union_print_data data = { p, 1 }; p = isl_printer_print_str(p, s_open_set[0]); data.p = p; if (isl_union_pw_aff_foreach_pw_aff(upa, &print_pw_aff_body_wrap, &data) < 0) data.p = isl_printer_free(p); p = data.p; p = isl_printer_print_str(p, s_close_set[0]); return p; } /* Print the isl_union_pw_aff "upa" to "p" in isl format. * * The individual isl_pw_affs are delimited by a semicolon. */ static __isl_give isl_printer *print_union_pw_aff_isl( __isl_take isl_printer *p, __isl_keep isl_union_pw_aff *upa) { struct isl_print_space_data data = { 0 }; isl_space *space; space = isl_union_pw_aff_get_space(upa); if (isl_space_dim(space, isl_dim_param) > 0) { p = print_tuple(space, p, isl_dim_param, &data); p = isl_printer_print_str(p, s_to[0]); } isl_space_free(space); p = print_union_pw_aff_body(p, upa); return p; } /* Print the isl_union_pw_aff "upa" to "p". * * We currently only support an isl format. */ __isl_give isl_printer *isl_printer_print_union_pw_aff( __isl_take isl_printer *p, __isl_keep isl_union_pw_aff *upa) { if (!p || !upa) return isl_printer_free(p); if (p->output_format == ISL_FORMAT_ISL) return print_union_pw_aff_isl(p, upa); isl_die(isl_printer_get_ctx(p), isl_error_unsupported, "unsupported output format", return isl_printer_free(p)); } /* Print dimension "pos" of data->space to "p". * * data->user is assumed to be an isl_multi_aff. * * If the current dimension is an output dimension, then print * the corresponding expression. Otherwise, print the name of the dimension. */ static __isl_give isl_printer *print_dim_ma(__isl_take isl_printer *p, struct isl_print_space_data *data, unsigned pos) { isl_multi_aff *ma = data->user; if (data->type == isl_dim_out) p = print_aff_body(p, ma->p[pos]); else p = print_name(data->space, p, data->type, pos, data->latex); return p; } static __isl_give isl_printer *print_multi_aff(__isl_take isl_printer *p, __isl_keep isl_multi_aff *maff) { struct isl_print_space_data data = { 0 }; data.print_dim = &print_dim_ma; data.user = maff; return print_space(maff->space, p, 0, &data); } static __isl_give isl_printer *print_multi_aff_isl(__isl_take isl_printer *p, __isl_keep isl_multi_aff *maff) { struct isl_print_space_data data = { 0 }; if (!maff) goto error; if (isl_space_dim(maff->space, isl_dim_param) > 0) { p = print_tuple(maff->space, p, isl_dim_param, &data); 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) { struct isl_print_space_data data = { 0 }; if (!pma) goto error; if (isl_space_dim(pma->dim, isl_dim_param) > 0) { p = print_tuple(pma->dim, p, isl_dim_param, &data); 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 isl_stat 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 isl_stat_ok; } 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; struct isl_print_space_data space_data = { 0 }; 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, &space_data); p = isl_printer_print_str(p, s_to[0]); } isl_space_free(space); p = isl_printer_print_str(p, s_open_set[0]); data.p = p; data.first = 1; 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; } /* Print dimension "pos" of data->space to "p". * * data->user is assumed to be an isl_multi_pw_aff. * * If the current dimension is an output dimension, then print * the corresponding piecewise affine expression. * Otherwise, print the name of the dimension. */ static __isl_give isl_printer *print_dim_mpa(__isl_take isl_printer *p, struct isl_print_space_data *data, unsigned pos) { int i; int need_parens; isl_multi_pw_aff *mpa = data->user; isl_pw_aff *pa; if (data->type != isl_dim_out) return print_name(data->space, p, data->type, pos, data->latex); pa = mpa->p[pos]; if (pa->n == 0) return isl_printer_print_str(p, "(0 : 1 = 0)"); need_parens = pa->n != 1 || !isl_set_plain_is_universe(pa->p[0].set); if (need_parens) p = isl_printer_print_str(p, "("); for (i = 0; i < pa->n; ++i) { if (i) p = isl_printer_print_str(p, "; "); p = print_aff_body(p, pa->p[i].aff); p = print_disjuncts(pa->p[i].set, p, 0); } if (need_parens) p = isl_printer_print_str(p, ")"); return p; } /* Print "mpa" to "p" in isl format. */ static __isl_give isl_printer *print_multi_pw_aff_isl(__isl_take isl_printer *p, __isl_keep isl_multi_pw_aff *mpa) { struct isl_print_space_data data = { 0 }; if (!mpa) return isl_printer_free(p); if (isl_space_dim(mpa->space, isl_dim_param) > 0) { p = print_tuple(mpa->space, p, isl_dim_param, &data); p = isl_printer_print_str(p, " -> "); } p = isl_printer_print_str(p, "{ "); data.print_dim = &print_dim_mpa; data.user = mpa; p = print_space(mpa->space, p, 0, &data); 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)); } /* Print dimension "pos" of data->space to "p". * * data->user is assumed to be an isl_multi_val. * * If the current dimension is an output dimension, then print * the corresponding value. Otherwise, print the name of the dimension. */ static __isl_give isl_printer *print_dim_mv(__isl_take isl_printer *p, struct isl_print_space_data *data, unsigned pos) { isl_multi_val *mv = data->user; if (data->type == isl_dim_out) return isl_printer_print_val(p, mv->p[pos]); else return print_name(data->space, p, data->type, pos, data->latex); } /* Print the isl_multi_val "mv" to "p" in isl format. */ static __isl_give isl_printer *print_multi_val_isl(__isl_take isl_printer *p, __isl_keep isl_multi_val *mv) { struct isl_print_space_data data = { 0 }; if (!mv) return isl_printer_free(p); if (isl_space_dim(mv->space, isl_dim_param) > 0) { p = print_tuple(mv->space, p, isl_dim_param, &data); p = isl_printer_print_str(p, " -> "); } p = isl_printer_print_str(p, "{ "); data.print_dim = &print_dim_mv; data.user = mv; p = print_space(mv->space, p, 0, &data); p = isl_printer_print_str(p, " }"); return p; } /* Print the isl_multi_val "mv" to "p". * * Currently only supported in isl format. */ __isl_give isl_printer *isl_printer_print_multi_val( __isl_take isl_printer *p, __isl_keep isl_multi_val *mv) { if (!p || !mv) return isl_printer_free(p); if (p->output_format == ISL_FORMAT_ISL) return print_multi_val_isl(p, mv); isl_die(p->ctx, isl_error_unsupported, "unsupported output format", return isl_printer_free(p)); } /* Print dimension "pos" of data->space to "p". * * data->user is assumed to be an isl_multi_union_pw_aff. * * The current dimension is necessarily a set dimension, so * we print the corresponding isl_union_pw_aff, including * the braces. */ static __isl_give isl_printer *print_union_pw_aff_dim(__isl_take isl_printer *p, struct isl_print_space_data *data, unsigned pos) { isl_multi_union_pw_aff *mupa = data->user; isl_union_pw_aff *upa; upa = isl_multi_union_pw_aff_get_union_pw_aff(mupa, pos); p = print_union_pw_aff_body(p, upa); isl_union_pw_aff_free(upa); return p; } /* Print the isl_multi_union_pw_aff "mupa" to "p" in isl format. */ static __isl_give isl_printer *print_multi_union_pw_aff_isl( __isl_take isl_printer *p, __isl_keep isl_multi_union_pw_aff *mupa) { struct isl_print_space_data data = { 0 }; isl_space *space; space = isl_multi_union_pw_aff_get_space(mupa); if (isl_space_dim(space, isl_dim_param) > 0) { struct isl_print_space_data space_data = { 0 }; p = print_tuple(space, p, isl_dim_param, &space_data); p = isl_printer_print_str(p, s_to[0]); } data.print_dim = &print_union_pw_aff_dim; data.user = mupa; p = print_space(space, p, 0, &data); isl_space_free(space); return p; } /* Print the isl_multi_union_pw_aff "mupa" to "p" in isl format. * * We currently only support an isl format. */ __isl_give isl_printer *isl_printer_print_multi_union_pw_aff( __isl_take isl_printer *p, __isl_keep isl_multi_union_pw_aff *mupa) { if (!p || !mupa) return isl_printer_free(p); if (p->output_format == ISL_FORMAT_ISL) return print_multi_union_pw_aff_isl(p, mupa); isl_die(isl_printer_get_ctx(p), isl_error_unsupported, "unsupported output format", return isl_printer_free(p)); } cloog-0.18.4/isl/isl_dim_map.h0000644000175000017500000000244412413256472013057 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.4/isl/isl_ilp.c0000644000175000017500000004052612554427055012236 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 #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) { isl_space *space = isl_basic_set_get_space(bset); isl_basic_set_free(bset); return isl_basic_set_empty(space); } 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 (max ? isl_int_gt(opt_i, *opt) : isl_int_lt(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.4/isl/isl_lp_private.h0000644000175000017500000000142412413270107013602 00000000000000#ifndef ISL_LP_PRIVATE_H #define ISL_LP_PRIVATE_H #include #include #include enum isl_lp_result isl_basic_map_solve_lp(__isl_keep isl_basic_map *bmap, int max, isl_int *f, isl_int denom, isl_int *opt, isl_int *opt_denom, __isl_give isl_vec **sol); enum isl_lp_result isl_basic_set_solve_lp(__isl_keep isl_basic_set *bset, int max, isl_int *f, isl_int denom, isl_int *opt, isl_int *opt_denom, __isl_give 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, __isl_give 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, __isl_give isl_vec **sol); #endif cloog-0.18.4/isl/isl_list_templ.c0000644000175000017500000002760512554427055013631 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. * Always return a list with a single reference. * * 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->ref == 1 && 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; } if (list->n + n <= list->size && list->size < new_size) new_size = list->size; 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; } __isl_null LIST(EL) *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; } isl_stat FN(LIST(EL),foreach)(__isl_keep LIST(EL) *list, isl_stat (*fn)(__isl_take EL *el, void *user), void *user) { int i; if (!list) return isl_stat_error; for (i = 0; i < list->n; ++i) { EL *el = FN(EL,copy(list->p[i])); if (!el) return isl_stat_error; if (fn(el, user) < 0) return isl_stat_error; } return isl_stat_ok; } /* 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; isl_bool (*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 isl_bool 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 isl_stat FN(LIST(EL),call_on_scc)(__isl_keep LIST(EL) *list, int *pos, int n, isl_stat (*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. */ isl_stat FN(LIST(EL),foreach_scc)(__isl_keep LIST(EL) *list, isl_bool (*follows)(__isl_keep EL *a, __isl_keep EL *b, void *user), void *follows_user, isl_stat (*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 isl_stat_error; if (list->n == 0) return isl_stat_ok; 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 isl_stat_error; 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 ? isl_stat_error : isl_stat_ok; } __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.4/isl/isl_mat.c0000644000175000017500000011605012554427055012227 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * Copyright 2014 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 #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; } __isl_null isl_mat *isl_mat_free(__isl_take 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); } /* Is "mat" a (possibly scaled) identity matrix? */ int isl_mat_is_scaled_identity(__isl_keep isl_mat *mat) { int i; if (!mat) return -1; if (mat->n_row != mat->n_col) return 0; for (i = 0; i < mat->n_row; ++i) { if (isl_seq_first_non_zero(mat->row[i], i) != -1) return 0; if (isl_int_ne(mat->row[0][0], mat->row[i][i])) return 0; if (isl_seq_first_non_zero(mat->row[i] + i + 1, mat->n_col - (i + 1)) != -1) return 0; } return 1; } 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 strictly 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; } /* Calculate the product of two matrices. * * This function is optimized for operand matrices that contain many zeros and * skips multiplications where we know one of the operands is zero. */ __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) { if (isl_int_is_zero(left->row[i][k])) continue; for (j = 0; j < prod->n_col; ++j) 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) { int i; set = isl_set_cow(set); if (!set) return NULL; 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; } /* Return a copy of row "row" of "mat" as an isl_vec. */ __isl_give isl_vec *isl_mat_get_row(__isl_keep isl_mat *mat, unsigned row) { isl_vec *v; if (!mat) return NULL; if (row >= mat->n_row) isl_die(mat->ctx, isl_error_invalid, "row out of range", return NULL); v = isl_vec_alloc(isl_mat_get_ctx(mat), mat->n_col); if (!v) return NULL; isl_seq_cpy(v->el, mat->row[row], mat->n_col); return v; } __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.4/isl/codegen.c0000644000175000017500000001522612554427055012206 00000000000000/* * Copyright 2012,2014 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 specified by * the schedule tree or by their image(s) in the schedule map. * * The input consists of either a schedule tree or * a sequence of three sets/relations. * - a schedule map * - a context * - a relation describing AST generation options */ #include #include #include #include #include #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(cg_options, struct options, options_args) ISL_ARG_CTX_DEF(cg_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; } /* Construct an AST in case the schedule is specified by a union map. * * We read the context and the options from "s" and construct the AST. */ static __isl_give isl_ast_node *construct_ast_from_union_map( __isl_take isl_union_map *schedule, __isl_keep isl_stream *s) { isl_set *context; isl_union_map *options_map; isl_ast_build *build; isl_ast_node *tree; struct options *options; options = isl_ctx_peek_cg_options(isl_stream_get_ctx(s)); context = isl_stream_read_set(s); options_map = isl_stream_read_union_map(s); build = isl_ast_build_from_context(context); build = set_options(build, options_map, options, schedule); tree = isl_ast_build_node_from_schedule_map(build, schedule); isl_ast_build_free(build); return tree; } /* If "node" is a band node, then replace the AST build options * by "options". */ static __isl_give isl_schedule_node *node_set_options( __isl_take isl_schedule_node *node, void *user) { enum isl_ast_loop_type *type = user; int i, n; if (isl_schedule_node_get_type(node) != isl_schedule_node_band) return node; n = isl_schedule_node_band_n_member(node); for (i = 0; i < n; ++i) node = isl_schedule_node_band_member_set_ast_loop_type(node, i, *type); return node; } /* Replace the AST build options on all band nodes if requested * by the user. */ static __isl_give isl_schedule *schedule_set_options( __isl_take isl_schedule *schedule, struct options *options) { enum isl_ast_loop_type type; if (!options->separate && !options->atomic) return schedule; type = options->separate ? isl_ast_loop_separate : isl_ast_loop_atomic; schedule = isl_schedule_map_schedule_node_bottom_up(schedule, &node_set_options, &type); return schedule; } /* Construct an AST in case the schedule is specified by a schedule tree. */ static __isl_give isl_ast_node *construct_ast_from_schedule( __isl_take isl_schedule *schedule) { isl_ast_build *build; isl_ast_node *tree; struct options *options; options = isl_ctx_peek_cg_options(isl_schedule_get_ctx(schedule)); build = isl_ast_build_alloc(isl_schedule_get_ctx(schedule)); schedule = schedule_set_options(schedule, options); tree = isl_ast_build_node_from_schedule(build, schedule); isl_ast_build_free(build); return tree; } /* Read an object from stdin. * If it is a (union) map, then assume an input specified by * schedule map, context and options and construct an AST from * those elements * If it is a schedule object, then construct the AST from the schedule. */ int main(int argc, char **argv) { isl_ctx *ctx; isl_stream *s; isl_ast_node *tree = NULL; struct options *options; isl_printer *p; struct isl_obj obj; int r = EXIT_SUCCESS; options = cg_options_new_with_defaults(); assert(options); argc = cg_options_parse(options, argc, argv, ISL_ARG_ALL); ctx = isl_ctx_alloc_with_options(&options_args, options); s = isl_stream_new_file(ctx, stdin); obj = isl_stream_read_obj(s); if (obj.v == NULL) { r = EXIT_FAILURE; } else if (obj.type == isl_obj_map) { isl_union_map *umap; umap = isl_union_map_from_map(obj.v); tree = construct_ast_from_union_map(umap, s); } else if (obj.type == isl_obj_union_map) { tree = construct_ast_from_union_map(obj.v, s); } else if (obj.type == isl_obj_schedule) { tree = construct_ast_from_schedule(obj.v); } else { obj.type->free(obj.v); isl_die(ctx, isl_error_invalid, "unknown input", r = EXIT_FAILURE); } isl_stream_free(s); 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 r; } cloog-0.18.4/isl/isl_bound.c0000644000175000017500000002124112554427055012552 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 isl_stat guarded_qp(__isl_take isl_qpolynomial *qp, void *user) { struct isl_bound *bound = (struct isl_bound *)user; isl_stat r; r = isl_qpolynomial_as_polynomial_on_domain(qp, bound->bset, &guarded_poly_bound, user); isl_qpolynomial_free(qp); return r; } static isl_stat basic_guarded_fold(__isl_take isl_basic_set *bset, void *user) { struct isl_bound *bound = (struct isl_bound *)user; isl_stat r; bound->bset = bset; r = isl_qpolynomial_fold_foreach_qpolynomial(bound->fold, &guarded_qp, user); isl_basic_set_free(bset); return r; } static isl_stat 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 isl_stat_ok; error: isl_set_free(set); isl_qpolynomial_fold_free(fold); return isl_stat_error; } __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 isl_stat 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 isl_stat_ok; } __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.4/isl/isl_map_list.c0000644000175000017500000000065212554427055013256 00000000000000#include #include #undef EL #define EL isl_basic_map #include #undef BASE #define BASE basic_map #include #undef EL #define EL isl_map #include #undef BASE #define BASE map #include #undef EL #define EL isl_union_map #include #undef BASE #define BASE union_map #include cloog-0.18.4/isl/isl_schedule_private.h0000644000175000017500000000243312554427055015000 00000000000000#ifndef ISL_SCHEDLUE_PRIVATE_H #define ISL_SCHEDLUE_PRIVATE_H #include #include #include /* A complete schedule tree. * * band_forest points to a band forest representation of the schedule * and may be NULL if the forest hasn't been created yet. * * "root" is the root of the schedule tree and may be NULL if we * have created a band forest corresponding to the schedule. * * A pointer to "leaf" may be used to represent a leaf of the schedule. * It should not appear as a child to any other isl_schedule_tree objects, * but an isl_schedule_node may point to "leaf" if it refers to * a leaf of this schedule tree. */ struct isl_schedule { int ref; isl_band_list *band_forest; isl_schedule_tree *root; struct isl_schedule_tree leaf; }; __isl_give isl_schedule *isl_schedule_from_schedule_tree(isl_ctx *ctx, __isl_take isl_schedule_tree *tree); __isl_give isl_schedule *isl_schedule_set_root( __isl_take isl_schedule *schedule, __isl_take isl_schedule_tree *tree); __isl_give isl_space *isl_schedule_get_space( __isl_keep isl_schedule *schedule); __isl_give isl_union_set *isl_schedule_get_domain( __isl_keep isl_schedule *schedule); __isl_keep isl_schedule_tree *isl_schedule_peek_leaf( __isl_keep isl_schedule *schedule); #endif cloog-0.18.4/isl/isl_multi_apply_set.c0000644000175000017500000000017712554427055014662 00000000000000#define APPLY_DOMBASE set #define APPLY_DOM isl_set #include #undef APPLY_DOMBASE #undef APPLY_DOM cloog-0.18.4/isl/isl_pw_templ.c0000644000175000017500000013430112554427055013274 00000000000000/* * Copyright 2010-2011 INRIA Saclay * Copyright 2011 Sven Verdoolaege * Copyright 2012-2014 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 #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; } __isl_null PW *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; } isl_bool 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) : isl_bool_error; } __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; } isl_bool FN(PW,has_tuple_name)(__isl_keep PW *pw, enum isl_dim_type type) { return pw ? isl_space_has_tuple_name(pw->dim, type) : isl_bool_error; } 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; } isl_bool FN(PW,has_tuple_id)(__isl_keep PW *pw, enum isl_dim_type type) { return pw ? isl_space_has_tuple_id(pw->dim, type) : isl_bool_error; } __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; } isl_bool FN(PW,IS_ZERO)(__isl_keep PW *pw) { if (!pw) return isl_bool_error; 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; } #endif #ifndef NO_SUB __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_val *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_val *v; 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) v = FN(EL,eval)(FN(EL,copy)(pw->p[i].FIELD), isl_point_copy(pnt)); else v = isl_val_zero(ctx); FN(PW,free)(pw); isl_space_free(pnt_dim); isl_point_free(pnt); return v; error: FN(PW,free)(pw); isl_space_free(pnt_dim); isl_point_free(pnt); return NULL; } #endif /* Return the parameter domain of "pw". */ __isl_give isl_set *FN(PW,params)(__isl_take PW *pw) { return isl_set_params(FN(PW,domain)(pw)); } __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; } /* Convert a piecewise expression defined over a parameter domain * into one that is defined over a zero-dimensional set. */ __isl_give PW *FN(PW,from_range)(__isl_take PW *pw) { isl_space *space; if (!pw) return NULL; if (!isl_space_is_set(pw->dim)) isl_die(FN(PW,get_ctx)(pw), isl_error_invalid, "not living in a set space", return FN(PW,free)(pw)); space = FN(PW,get_space)(pw); space = isl_space_from_range(space); pw = FN(PW,reset_space)(pw, space); return pw; } /* Fix the value of the given parameter or domain dimension of "pw" * to be equal to "value". */ __isl_give PW *FN(PW,fix_si)(__isl_take PW *pw, enum isl_dim_type type, unsigned pos, int value) { int i; if (!pw) return NULL; if (type == isl_dim_out) isl_die(FN(PW,get_ctx)(pw), isl_error_invalid, "cannot fix output dimension", return FN(PW,free)(pw)); if (pw->n == 0) return pw; if (type == isl_dim_in) type = isl_dim_set; pw = FN(PW,cow)(pw); if (!pw) return FN(PW,free)(pw); for (i = pw->n - 1; i >= 0; --i) { pw->p[i].set = isl_set_fix_si(pw->p[i].set, type, pos, value); if (FN(PW,exploit_equalities_and_remove_if_empty)(pw, i) < 0) return FN(PW,free)(pw); } return pw; } /* Restrict the domain of "pw" by combining each cell * with "set" through a call to "fn", where "fn" may be * isl_set_intersect, isl_set_intersect_params or isl_set_subtract. */ static __isl_give PW *FN(PW,restrict_domain_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,restrict_domain_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,restrict_domain_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)); } /* Subtract "domain' from the domain of "pw", assuming their * parameters have been aligned. */ static __isl_give PW *FN(PW,subtract_domain_aligned)(__isl_take PW *pw, __isl_take isl_set *domain) { return FN(PW,restrict_domain_aligned)(pw, domain, &isl_set_subtract); } /* Subtract "domain' from the domain of "pw". */ __isl_give PW *FN(PW,subtract_domain)(__isl_take PW *pw, __isl_take isl_set *domain) { return FN(PW,align_params_pw_set_and)(pw, domain, &FN(PW,subtract_domain_aligned)); } /* Compute the gist of "pw" with respect to the domain constraints * of "context" for the case where the domain of the last element * of "pw" is equal to "context". * Call "fn_el" to compute the gist of this element, replace * its domain by the universe and drop all other elements * as their domains are necessarily disjoint from "context". */ static __isl_give PW *FN(PW,gist_last)(__isl_take PW *pw, __isl_take isl_set *context, __isl_give EL *(*fn_el)(__isl_take EL *el, __isl_take isl_set *set)) { int i; isl_space *space; for (i = 0; i < pw->n - 1; ++i) { isl_set_free(pw->p[i].set); FN(EL,free)(pw->p[i].FIELD); } pw->p[0].FIELD = pw->p[pw->n - 1].FIELD; pw->p[0].set = pw->p[pw->n - 1].set; pw->n = 1; space = isl_set_get_space(context); pw->p[0].FIELD = fn_el(pw->p[0].FIELD, context); context = isl_set_universe(space); isl_set_free(pw->p[0].set); pw->p[0].set = context; if (!pw->p[0].FIELD || !pw->p[0].set) return FN(PW,free)(pw); return pw; } /* Compute the gist of "pw" with respect to the domain constraints * of "context". Call "fn_el" to compute the gist of the elements * and "fn_dom" to compute the gist of the domains. * * If the piecewise expression is empty or the context is the universe, * then nothing can be simplified. */ 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; int is_universe; isl_basic_set *hull = NULL; if (!pw || !context) goto error; if (pw->n == 0) { isl_set_free(context); return pw; } is_universe = isl_set_plain_is_universe(context); if (is_universe < 0) goto error; if (is_universe) { 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)); } pw = FN(PW,cow)(pw); if (!pw) goto error; if (pw->n == 1) { int equal; equal = isl_set_plain_is_equal(pw->p[0].set, context); if (equal < 0) goto error; if (equal) return FN(PW,gist_last)(pw, context, fn_el); } context = isl_set_compute_divs(context); hull = isl_set_simple_hull(isl_set_copy(context)); for (i = pw->n - 1; i >= 0; --i) { isl_set *set_i; int empty; if (i == pw->n - 1) { int equal; equal = isl_set_plain_is_equal(pw->p[i].set, context); if (equal < 0) goto error; if (equal) { isl_basic_set_free(hull); return FN(PW,gist_last)(pw, context, fn_el); } } 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 (empty < 0 || !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 isl_bool 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 isl_bool_error; if (pw->n == 0 || n == 0) return isl_bool_false; set_type = type == isl_dim_in ? isl_dim_set : type; for (i = 0; i < pw->n; ++i) { isl_bool 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 isl_bool_false; } #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_val *FN(PW,opt)(__isl_take PW *pw, int max) { int i; isl_val *opt; if (!pw) return NULL; if (pw->n == 0) { opt = isl_val_zero(FN(PW,get_ctx)(pw)); FN(PW,free)(pw); return opt; } 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_val *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_val_max(opt, opt_i); else opt = isl_val_min(opt, opt_i); } FN(PW,free)(pw); return opt; } __isl_give isl_val *FN(PW,max)(__isl_take PW *pw) { return FN(PW,opt)(pw, 1); } __isl_give isl_val *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; } /* Return the position of the dimension of the given type and name * in "pw". * Return -1 if no such dimension can be found. */ int FN(PW,find_dim_by_name)(__isl_keep PW *pw, enum isl_dim_type type, const char *name) { if (!pw) return -1; return isl_space_find_dim_by_name(pw->dim, type, name); } #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_take PW *pw, enum isl_dim_type type, __isl_take isl_id *id) { isl_space *space; pw = FN(PW,cow)(pw); if (!pw) goto error; space = FN(PW,get_space)(pw); space = isl_space_set_tuple_id(space, type, id); return FN(PW,reset_space)(pw, space); error: isl_id_free(id); return FN(PW,free)(pw); } /* Drop the id on the specified tuple. */ __isl_give PW *FN(PW,reset_tuple_id)(__isl_take PW *pw, enum isl_dim_type type) { isl_space *space; if (!pw) return NULL; if (!FN(PW,has_tuple_id)(pw, type)) return pw; pw = FN(PW,cow)(pw); if (!pw) return NULL; space = FN(PW,get_space)(pw); space = isl_space_reset_tuple_id(space, type); 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) goto error; pw->dim = isl_space_set_dim_id(pw->dim, type, pos, id); return FN(PW,reset_space)(pw, isl_space_copy(pw->dim)); error: isl_id_free(id); return FN(PW,free)(pw); } #endif /* Reset the user pointer on all identifiers of parameters and tuples * of the space of "pw". */ __isl_give PW *FN(PW,reset_user)(__isl_take PW *pw) { isl_space *space; space = FN(PW,get_space)(pw); space = isl_space_reset_user(space); return FN(PW,reset_space)(pw, space); } 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; } isl_stat FN(PW,foreach_piece)(__isl_keep PW *pw, isl_stat (*fn)(__isl_take isl_set *set, __isl_take EL *el, void *user), void *user) { int i; if (!pw) return isl_stat_error; 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 isl_stat_error; return isl_stat_ok; } #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 isl_stat foreach_lifted_subset(__isl_take isl_set *set, __isl_take EL *el, isl_stat (*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 isl_stat_ok; error: isl_set_free(set); FN(EL,free)(el); return isl_stat_error; } isl_stat FN(PW,foreach_lifted_piece)(__isl_keep PW *pw, isl_stat (*fn)(__isl_take isl_set *set, __isl_take EL *el, void *user), void *user) { int i; if (!pw) return isl_stat_error; 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 isl_stat_error; continue; } if (foreach_lifted_subset(set, el, fn, user) < 0) return isl_stat_error; } return isl_stat_ok; } #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; } /* Divide the pieces of "pw" by "v" and return the result. */ __isl_give PW *FN(PW,scale_down_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 (!isl_val_is_rat(v)) isl_die(isl_val_get_ctx(v), isl_error_invalid, "expecting rational factor", goto error); if (isl_val_is_zero(v)) isl_die(isl_val_get_ctx(v), isl_error_invalid, "cannot scale down by zero", goto error); 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_down_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? */ isl_bool FN(PW,plain_is_equal)(__isl_keep PW *pw1, __isl_keep PW *pw2) { int i; isl_bool equal; if (!pw1 || !pw2) return isl_bool_error; if (pw1 == pw2) return isl_bool_true; if (!isl_space_is_equal(pw1->dim, pw2->dim)) return isl_bool_false; 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 isl_bool_error; } #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_space *space; space = isl_space_join(isl_pw_multi_aff_get_space(pma), FN(PW,get_space)(pw)); isl_pw_multi_aff_free(pma); res = FN(PW,empty)(space); 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.4/isl/isl_local_space.c0000644000175000017500000010165312554427055013716 00000000000000/* * Copyright 2011 INRIA Saclay * Copyright 2012-2014 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 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); } __isl_null isl_local_space *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 parameter domain? */ isl_bool isl_local_space_is_params(__isl_keep isl_local_space *ls) { if (!ls) return isl_bool_error; return isl_space_is_params(ls->dim); } /* Is the local space that of a set? */ isl_bool isl_local_space_is_set(__isl_keep isl_local_space *ls) { return ls ? isl_space_is_set(ls->dim) : isl_bool_error; } /* Return true if the two local spaces are identical, with identical * expressions for the integer divisions. */ isl_bool isl_local_space_is_equal(__isl_keep isl_local_space *ls1, __isl_keep isl_local_space *ls2) { isl_bool equal; if (!ls1 || !ls2) return isl_bool_error; equal = isl_space_is_equal(ls1->dim, ls2->dim); if (equal < 0 || !equal) return equal; if (!isl_local_space_divs_known(ls1)) return isl_bool_false; if (!isl_local_space_divs_known(ls2)) return isl_bool_false; return isl_mat_is_equal(ls1->div, ls2->div); } /* Compare two isl_local_spaces. * * Return -1 if "ls1" is "smaller" than "ls2", 1 if "ls1" is "greater" * than "ls2" and 0 if they are equal. * * The order is fairly arbitrary. We do "prefer" divs that only involve * earlier dimensions in the sense that we consider local spaces where * the first differing div involves earlier dimensions to be smaller. */ int isl_local_space_cmp(__isl_keep isl_local_space *ls1, __isl_keep isl_local_space *ls2) { int i; int cmp; int known1, known2; int last1, last2; int n_col; if (ls1 == ls2) return 0; if (!ls1) return -1; if (!ls2) return 1; cmp = isl_space_cmp(ls1->dim, ls2->dim); if (cmp != 0) return cmp; if (ls1->div->n_row != ls2->div->n_row) return ls1->div->n_row - ls2->div->n_row; n_col = isl_mat_cols(ls1->div); for (i = 0; i < ls1->div->n_row; ++i) { known1 = isl_local_space_div_is_known(ls1, i); known2 = isl_local_space_div_is_known(ls2, i); if (!known1 && !known2) continue; if (!known1) return 1; if (!known2) return -1; last1 = isl_seq_last_non_zero(ls1->div->row[i] + 1, n_col - 1); last2 = isl_seq_last_non_zero(ls2->div->row[i] + 1, n_col - 1); if (last1 != last2) return last1 - last2; cmp = isl_seq_cmp(ls1->div->row[i], ls2->div->row[i], n_col); if (cmp != 0) return cmp; } return 0; } 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; } } /* Return the position of the dimension of the given type and name * in "ls". * Return -1 if no such dimension can be found. */ int isl_local_space_find_dim_by_name(__isl_keep isl_local_space *ls, enum isl_dim_type type, const char *name) { if (!ls) return -1; if (type == isl_dim_div) return -1; return isl_space_find_dim_by_name(ls->dim, type, name); } /* Does the given dimension have a name? */ isl_bool 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) : isl_bool_error; } 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; } isl_bool 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) : isl_bool_error; } __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); } /* Replace the identifier of the tuple of type "type" by "id". */ __isl_give isl_local_space *isl_local_space_set_tuple_id( __isl_take isl_local_space *ls, enum isl_dim_type type, __isl_take isl_id *id) { ls = isl_local_space_cow(ls); if (!ls) goto error; ls->dim = isl_space_set_tuple_id(ls->dim, type, id); if (!ls->dim) return isl_local_space_free(ls); return ls; error: isl_id_free(id); return NULL; } __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) goto error; ls->dim = isl_space_set_dim_id(ls->dim, type, pos, id); if (!ls->dim) return isl_local_space_free(ls); return ls; error: isl_id_free(id); return NULL; } __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; int equal; 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; equal = isl_mat_is_equal(ls1->div, div); if (equal < 0) goto error; if (!equal) ls1 = isl_local_space_cow(ls1); if (!ls1) 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; } /* Does "ls" have an explicit representation for div "div"? */ int isl_local_space_div_is_known(__isl_keep isl_local_space *ls, int div) { if (!ls) return -1; if (div < 0 || div >= ls->div->n_row) isl_die(isl_local_space_get_ctx(ls), isl_error_invalid, "position out of bounds", return -1); return !isl_int_is_zero(ls->div->row[div][0]); } 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 < first + n; ++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", goto error); 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; error: isl_local_space_free(ls); return NULL; } /* 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; } /* Move the "n" dimensions of "src_type" starting at "src_pos" of "ls" * to dimensions of "dst_type" at "dst_pos". * * Moving to/from local dimensions is not allowed. * We currently assume that the dimension type changes. */ __isl_give isl_local_space *isl_local_space_move_dims( __isl_take isl_local_space *ls, 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; if (!ls) return NULL; if (n == 0 && !isl_local_space_is_named_or_nested(ls, src_type) && !isl_local_space_is_named_or_nested(ls, dst_type)) return ls; if (src_pos + n > isl_local_space_dim(ls, src_type)) isl_die(isl_local_space_get_ctx(ls), isl_error_invalid, "range out of bounds", return isl_local_space_free(ls)); if (dst_pos > isl_local_space_dim(ls, dst_type)) isl_die(isl_local_space_get_ctx(ls), isl_error_invalid, "position out of bounds", return isl_local_space_free(ls)); if (src_type == isl_dim_div) isl_die(isl_local_space_get_ctx(ls), isl_error_invalid, "cannot move divs", return isl_local_space_free(ls)); if (dst_type == isl_dim_div) isl_die(isl_local_space_get_ctx(ls), isl_error_invalid, "cannot move to divs", return isl_local_space_free(ls)); if (dst_type == src_type && dst_pos == src_pos) return ls; if (dst_type == src_type) isl_die(isl_local_space_get_ctx(ls), isl_error_unsupported, "moving dims within the same type not supported", return isl_local_space_free(ls)); ls = isl_local_space_cow(ls); if (!ls) return NULL; g_src_pos = 1 + isl_local_space_offset(ls, src_type) + src_pos; g_dst_pos = 1 + isl_local_space_offset(ls, dst_type) + dst_pos; if (dst_type > src_type) g_dst_pos -= n; ls->div = isl_mat_move_cols(ls->div, g_dst_pos, g_src_pos, n); if (!ls->div) return isl_local_space_free(ls); ls->dim = isl_space_move_dims(ls->dim, dst_type, dst_pos, src_type, src_pos, n); if (!ls->dim) return isl_local_space_free(ls); return ls; } /* Remove any internal structure of the domain of "ls". * If there is any such internal structure in the input, * then the name of the corresponding space is also removed. */ __isl_give isl_local_space *isl_local_space_flatten_domain( __isl_take isl_local_space *ls) { if (!ls) return NULL; if (!ls->dim->nested[0]) return ls; ls = isl_local_space_cow(ls); if (!ls) return NULL; ls->dim = isl_space_flatten_domain(ls->dim); if (!ls->dim) return isl_local_space_free(ls); return ls; } /* Remove any internal structure of the range of "ls". * If there is any such internal structure in the input, * then the name of the corresponding space is also removed. */ __isl_give isl_local_space *isl_local_space_flatten_range( __isl_take isl_local_space *ls) { if (!ls) return NULL; if (!ls->dim->nested[1]) return ls; ls = isl_local_space_cow(ls); if (!ls) return NULL; ls->dim = isl_space_flatten_range(ls->dim); if (!ls->dim) return isl_local_space_free(ls); return ls; } /* Given the local space "ls" of a map, return the local space of a set * that lives in a space that wraps the space of "ls" and that has * the same divs. */ __isl_give isl_local_space *isl_local_space_wrap(__isl_take isl_local_space *ls) { ls = isl_local_space_cow(ls); if (!ls) return NULL; ls->dim = isl_space_wrap(ls->dim); if (!ls->dim) return isl_local_space_free(ls); return ls; } cloog-0.18.4/isl/isl_tab.h0000644000175000017500000002536012554427055012224 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 #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_rational, 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; 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; int 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_rational(struct isl_tab *tab) 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_insert_var(struct isl_tab *tab, int pos) 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; int 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); int isl_tab_shift_var(struct isl_tab *tab, int pos, isl_int shift) WARN_UNUSED; #endif cloog-0.18.4/isl/isl_range.c0000644000175000017500000003142112554427055012540 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 isl_stat 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 nparam; isl_space *dim; isl_val *opt; int r; enum isl_fold type; nparam = isl_basic_set_dim(bset, isl_dim_param); 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_val_is_nan(opt) || isl_val_is_infty(opt) || isl_val_is_neginfty(opt)) r = 0; else r = sign * isl_val_sgn(opt) >= 0; isl_val_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 isl_stat 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 isl_stat_error; 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 isl_stat_ok; } /* 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 isl_stat 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 isl_stat_ok; } /* 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 isl_stat 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; isl_stat 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 isl_stat 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 isl_stat_ok; error: isl_basic_set_free(bset); isl_qpolynomial_free(poly); data->monotonicity = save_monotonicity; data->poly = save_poly; return isl_stat_error; } static isl_stat 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); isl_stat 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 isl_stat_error; } 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.4/isl/polyhedron_detect_equalities.c0000644000175000017500000000131412554427055016533 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; isl_printer *p; bset = isl_basic_set_read_from_file(ctx, stdin); bset = isl_basic_set_detect_equalities(bset); p = isl_printer_to_file(ctx, stdout); p = isl_printer_set_output_format(p, ISL_FORMAT_POLYLIB); p = isl_printer_print_basic_set(p, bset); isl_printer_free(p); isl_basic_set_free(bset); isl_ctx_free(ctx); return 0; } cloog-0.18.4/isl/isl_polynomial.c0000644000175000017500000032113012554427055013626 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 #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; } isl_bool 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 isl_bool_error; if (up1 == up2) return isl_bool_true; if (up1->var != up2->var) return isl_bool_false; 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 isl_bool_error; 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 isl_bool_error; if (rec1->n != rec2->n) return isl_bool_false; for (i = 0; i < rec1->n; ++i) { isl_bool eq = isl_upoly_is_equal(rec1->p[i], rec2->p[i]); if (eq < 0 || !eq) return eq; } return isl_bool_true; } 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); } isl_bool isl_qpolynomial_is_zero(__isl_keep isl_qpolynomial *qp) { return qp ? isl_upoly_is_zero(qp->upoly) : isl_bool_error; } isl_bool isl_qpolynomial_is_one(__isl_keep isl_qpolynomial *qp) { return qp ? isl_upoly_is_one(qp->upoly) : isl_bool_error; } isl_bool isl_qpolynomial_is_nan(__isl_keep isl_qpolynomial *qp) { return qp ? isl_upoly_is_nan(qp->upoly) : isl_bool_error; } isl_bool isl_qpolynomial_is_infty(__isl_keep isl_qpolynomial *qp) { return qp ? isl_upoly_is_infty(qp->upoly) : isl_bool_error; } isl_bool isl_qpolynomial_is_neginfty(__isl_keep isl_qpolynomial *qp) { return qp ? isl_upoly_is_neginfty(qp->upoly) : isl_bool_error; } 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); } __isl_null isl_qpolynomial *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; } /* Divide "qp" by "v". */ __isl_give isl_qpolynomial *isl_qpolynomial_scale_down_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_zero(v)) isl_die(isl_val_get_ctx(v), isl_error_invalid, "cannot scale down by zero", goto error); return isl_qpolynomial_scale_val(qp, isl_val_inv(v)); 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; } /* Is "qp1" obviously equal to "qp2"? * * NaN is not equal to anything, not even to another NaN. */ isl_bool isl_qpolynomial_plain_is_equal(__isl_keep isl_qpolynomial *qp1, __isl_keep isl_qpolynomial *qp2) { isl_bool equal; if (!qp1 || !qp2) return isl_bool_error; if (isl_qpolynomial_is_nan(qp1) || isl_qpolynomial_is_nan(qp2)) return isl_bool_false; 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); } isl_bool isl_qpolynomial_involves_dims(__isl_keep isl_qpolynomial *qp, enum isl_dim_type type, unsigned first, unsigned n) { int i; int *active = NULL; isl_bool involves = isl_bool_false; if (!qp) return isl_bool_error; if (n == 0) return isl_bool_false; isl_assert(qp->dim->ctx, first + n <= isl_qpolynomial_dim(qp, type), return isl_bool_error); isl_assert(qp->dim->ctx, type == isl_dim_param || type == isl_dim_in, return isl_bool_error); 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 = isl_bool_true; break; } free(active); return involves; error: free(active); return isl_bool_error; } /* 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 #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 isl_val *isl_upoly_eval(__isl_take struct isl_upoly *up, __isl_take isl_vec *vec) { int i; struct isl_upoly_rec *rec; isl_val *res; isl_val *base; if (isl_upoly_is_cst(up)) { isl_vec_free(vec); res = isl_upoly_get_constant_val(up); isl_upoly_free(up); return res; } rec = isl_upoly_as_rec(up); if (!rec) goto error; isl_assert(up->ctx, rec->n >= 1, goto error); base = isl_val_rat_from_isl_int(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_val_mul(res, isl_val_copy(base)); res = isl_val_add(res, isl_upoly_eval(isl_upoly_copy(rec->p[i]), isl_vec_copy(vec))); } isl_val_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_val *isl_qpolynomial_eval(__isl_take isl_qpolynomial *qp, __isl_take isl_point *pnt) { isl_vec *ext; isl_val *v; 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]); } } v = isl_upoly_eval(isl_upoly_copy(qp->upoly), ext); isl_qpolynomial_free(qp); isl_point_free(pnt); return v; 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; } __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 isl_qpolynomial_free(qp); } __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, isl_stat (*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; } isl_stat isl_qpolynomial_foreach_term(__isl_keep isl_qpolynomial *qp, isl_stat (*fn)(__isl_take isl_term *term, void *user), void *user) { isl_term *term; if (!qp) return isl_stat_error; term = isl_term_alloc(isl_space_copy(qp->dim), isl_mat_copy(qp->div)); if (!term) return isl_stat_error; term = isl_upoly_foreach_term(qp->upoly, fn, term, user); isl_term_free(term); return term ? isl_stat_ok : isl_stat_error; } __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_val *opt; int max; }; static isl_stat opt_fn(__isl_take isl_point *pnt, void *user) { struct isl_opt_data *data = (struct isl_opt_data *)user; isl_val *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_val_max(data->opt, val); } else { data->opt = isl_val_min(data->opt, val); } return isl_stat_ok; } __isl_give isl_val *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); data.opt = isl_qpolynomial_get_constant_val(qp); isl_qpolynomial_free(qp); return data.opt; } set = fix_inactive(set, qp); data.qp = qp; if (isl_set_foreach_point(set, opt_fn, &data) < 0) goto error; if (data.first) data.opt = isl_val_zero(isl_set_get_ctx(set)); isl_set_free(set); isl_qpolynomial_free(qp); return data.opt; error: isl_set_free(set); isl_qpolynomial_free(qp); isl_val_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; } __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 isl_union_pw_qpolynomial_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 isl_stat 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 isl_stat 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 isl_stat 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 isl_stat_ok; error: isl_set_free(set); isl_qpolynomial_free(qp); return isl_stat_error; } /* 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 isl_stat 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; isl_stat r = isl_stat_ok; 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 isl_stat_ok; } 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 isl_stat_error; } /* 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 isl_stat 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 ? isl_stat_ok : isl_stat_error; } __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->space->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.4/isl/print_templ.c0000644000175000017500000000123712413256472013131 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.4/isl/isl_map.c0000644000175000017500000116311112554427055012224 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * Copyright 2010 INRIA Saclay * Copyright 2012-2014 Ecole Normale Superieure * Copyright 2014 INRIA Rocquencourt * * 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 * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt, * B.P. 105 - 78153 Le Chesnay, France */ #include #include #include #include #include #include "isl_space_private.h" #include "isl_equalities.h" #include #include #include #include #include #include "isl_sample.h" #include #include "isl_tab.h" #include #include #include #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_is_equal(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_is_equal(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_is_equal(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_is_equal(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; } /* Replace the identifier of the tuple of type "type" by "id". */ __isl_give isl_basic_map *isl_basic_map_set_tuple_id( __isl_take isl_basic_map *bmap, enum isl_dim_type type, __isl_take isl_id *id) { bmap = isl_basic_map_cow(bmap); if (!bmap) goto error; bmap->dim = isl_space_set_tuple_id(bmap->dim, type, id); if (!bmap->dim) return isl_basic_map_free(bmap); bmap = isl_basic_map_finalize(bmap); return bmap; error: isl_id_free(id); return NULL; } /* Replace the identifier of the tuple by "id". */ __isl_give isl_basic_set *isl_basic_set_set_tuple_id( __isl_take isl_basic_set *bset, __isl_take isl_id *id) { return isl_basic_map_set_tuple_id(bset, isl_dim_set, id); } /* Does the input or output tuple have a name? */ isl_bool 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) : isl_bool_error; } 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) goto error; map->dim = isl_space_set_tuple_id(map->dim, type, id); return isl_map_reset_space(map, isl_space_copy(map->dim)); error: isl_id_free(id); return NULL; } __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); } isl_bool 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) : isl_bool_error; } __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; } isl_bool 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? */ isl_bool isl_set_has_tuple_name(__isl_keep isl_set *set) { if (!set) return isl_bool_error; return isl_space_has_tuple_name(set->dim, isl_dim_set); } 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? */ isl_bool isl_map_has_dim_name(__isl_keep isl_map *map, enum isl_dim_type type, unsigned pos) { if (!map) return isl_bool_error; return isl_space_has_dim_name(map->dim, type, pos); } 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? */ isl_bool isl_set_has_dim_name(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos) { if (!set) return isl_bool_error; return isl_space_has_dim_name(set->dim, type, 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) { 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); } isl_bool isl_basic_map_has_dim_id(__isl_keep isl_basic_map *bmap, enum isl_dim_type type, unsigned pos) { if (!bmap) return isl_bool_error; return isl_space_has_dim_id(bmap->dim, type, pos); } __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; } isl_bool 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) : isl_bool_error; } __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; } isl_bool 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) goto error; map->dim = isl_space_set_dim_id(map->dim, type, pos, id); return isl_map_reset_space(map, isl_space_copy(map->dim)); error: isl_id_free(id); return NULL; } __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); } /* Return the position of the dimension of the given type and name * in "bmap". * Return -1 if no such dimension can be found. */ int isl_basic_map_find_dim_by_name(__isl_keep isl_basic_map *bmap, enum isl_dim_type type, const char *name) { if (!bmap) return -1; return isl_space_find_dim_by_name(bmap->dim, type, name); } 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); } /* Reset the user pointer on all identifiers of parameters and tuples * of the space of "map". */ __isl_give isl_map *isl_map_reset_user(__isl_take isl_map *map) { isl_space *space; space = isl_map_get_space(map); space = isl_space_reset_user(space); map = isl_map_reset_space(map, space); return map; } /* Reset the user pointer on all identifiers of parameters and tuples * of the space of "set". */ __isl_give isl_set *isl_set_reset_user(__isl_take isl_set *set) { return isl_map_reset_user(set); } 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? */ isl_bool isl_set_is_params(__isl_keep isl_set *set) { if (!set) return isl_bool_error; 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; } __isl_null isl_basic_map *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; } __isl_null isl_basic_set *isl_basic_set_free(__isl_take 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; } isl_bool isl_map_align_params_map_map_and_test(__isl_keep isl_map *map1, __isl_keep isl_map *map2, isl_bool (*fn)(__isl_keep isl_map *map1, __isl_keep isl_map *map2)) { isl_bool r; if (!map1 || !map2) return isl_bool_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", return isl_bool_error); 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); ISL_F_CLR(bmap, ISL_BASIC_MAP_REDUCED_COEFFICIENTS); } 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; } 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_cow(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); } ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED); 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. */ isl_bool 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 isl_bool_error; if (first + n > isl_basic_map_dim(bmap, type)) isl_die(bmap->ctx, isl_error_invalid, "index out of bounds", return isl_bool_error); 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 isl_bool_true; for (i = 0; i < bmap->n_ineq; ++i) if (isl_seq_first_non_zero(bmap->ineq[i] + first, n) >= 0) return isl_bool_true; 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 isl_bool_true; } return isl_bool_false; } isl_bool isl_map_involves_dims(__isl_keep isl_map *map, enum isl_dim_type type, unsigned first, unsigned n) { int i; if (!map) return isl_bool_error; if (first + n > isl_map_dim(map, type)) isl_die(map->ctx, isl_error_invalid, "index out of bounds", return isl_bool_error); for (i = 0; i < map->n; ++i) { isl_bool involves = isl_basic_map_involves_dims(map->p[i], type, first, n); if (involves < 0 || involves) return involves; } return isl_bool_false; } isl_bool 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); } isl_bool 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); } __isl_null isl_set *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; } isl_bool isl_basic_map_contains(__isl_keep isl_basic_map *bmap, __isl_keep isl_vec *vec) { int i; unsigned total; isl_int s; if (!bmap || !vec) return isl_bool_error; total = 1 + isl_basic_map_total_dim(bmap); if (total != vec->size) return isl_bool_error; 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 isl_bool_false; } } 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 isl_bool_false; } } isl_int_clear(s); return isl_bool_true; } isl_bool isl_basic_set_contains(__isl_keep isl_basic_set *bset, __isl_keep 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 *space; unsigned pos, n1, n2; if (!bmap) return NULL; bmap = isl_basic_map_cow(bmap); if (!bmap) return NULL; space = isl_space_reverse(isl_space_copy(bmap->dim)); pos = isl_basic_map_offset(bmap, isl_dim_in); n1 = isl_basic_map_dim(bmap, isl_dim_in); n2 = isl_basic_map_dim(bmap, isl_dim_out); bmap = isl_basic_map_swap_vars(bmap, pos, n1, n2); return isl_basic_map_reset_space(bmap, space); } 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_dims(__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_map_add_dims(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_is_equal(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; } /* For a div d = floor(f/m), add the constraint * * f - m d >= 0 */ static int add_upper_div_constraint(__isl_keep isl_basic_map *bmap, unsigned pos, isl_int *div) { int i; 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]); return 0; } /* For a div d = floor(f/m), add the constraint * * -(f-(n-1)) + m d >= 0 */ static int add_lower_div_constraint(__isl_keep isl_basic_map *bmap, unsigned pos, isl_int *div) { int i; unsigned total = isl_basic_map_total_dim(bmap); i = isl_basic_map_alloc_inequality(bmap); if (i < 0) return -1; isl_seq_neg(bmap->ineq[i], div + 1, 1 + total); isl_int_set(bmap->ineq[i][1 + pos], div[0]); isl_int_add(bmap->ineq[i][0], bmap->ineq[i][0], bmap->ineq[i][1 + pos]); isl_int_sub_ui(bmap->ineq[i][0], bmap->ineq[i][0], 1); return 0; } /* 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) { if (add_upper_div_constraint(bmap, pos, div) < 0) return -1; if (add_lower_div_constraint(bmap, pos, div) < 0) return -1; return 0; } 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]); } /* For each known div d = floor(f/m), add the constraints * * f - m d >= 0 * -(f-(n-1)) + m d >= 0 */ __isl_give isl_basic_map *isl_basic_map_add_known_div_constraints( __isl_take isl_basic_map *bmap) { int i; unsigned n_div; if (!bmap) return NULL; n_div = isl_basic_map_dim(bmap, isl_dim_div); if (n_div == 0) return bmap; bmap = isl_basic_map_cow(bmap); bmap = isl_basic_map_extend_constraints(bmap, 0, 2 * n_div); if (!bmap) return NULL; for (i = 0; i < n_div; ++i) { if (isl_int_is_zero(bmap->div[i][0])) continue; if (isl_basic_map_add_div_constraints(bmap, i) < 0) return isl_basic_map_free(bmap); } bmap = isl_basic_map_remove_duplicate_constraints(bmap, NULL, 0); bmap = isl_basic_map_finalize(bmap); return bmap; } /* Add the div constraint of sign "sign" for div "div" of "bmap". * * In particular, if this div is of the form d = floor(f/m), * then add the constraint * * f - m d >= 0 * * if sign < 0 or the constraint * * -(f-(n-1)) + m d >= 0 * * if sign > 0. */ int isl_basic_map_add_div_constraint(__isl_keep isl_basic_map *bmap, unsigned div, int sign) { unsigned total; unsigned div_pos; if (!bmap) return -1; total = isl_basic_map_total_dim(bmap); div_pos = total - bmap->n_div + div; if (sign < 0) return add_upper_div_constraint(bmap, div_pos, bmap->div[div]); else return add_lower_div_constraint(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); } /* Replace each element in "list" by the result of applying * isl_basic_map_underlying_set to the element. */ __isl_give isl_basic_set_list *isl_basic_map_list_underlying_set( __isl_take isl_basic_map_list *list) { int i, n; if (!list) return NULL; n = isl_basic_map_list_n_basic_map(list); for (i = 0; i < n; ++i) { isl_basic_map *bmap; isl_basic_set *bset; bmap = isl_basic_map_list_get_basic_map(list, i); bset = isl_basic_set_underlying_set(bmap); list = isl_basic_set_list_set_basic_set(list, i, bset); } return list; } 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_add_known_div_constraints(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 *space; unsigned n_out; if (!bmap) return NULL; space = isl_space_domain(isl_basic_map_get_space(bmap)); n_out = isl_basic_map_n_out(bmap); bmap = isl_basic_map_project_out(bmap, isl_dim_out, 0, n_out); return isl_basic_map_reset_space(bmap, space); } 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; map = isl_map_cow(map); if (!map) return NULL; map->dim = isl_space_domain_map(map->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; } /* Given a wrapped map of the form A[B -> C], * return the map A[B -> C] -> B. */ __isl_give isl_map *isl_set_wrapped_domain_map(__isl_take isl_set *set) { isl_id *id; isl_map *map; if (!set) return NULL; if (!isl_set_has_tuple_id(set)) return isl_map_domain_map(isl_set_unwrap(set)); id = isl_set_get_tuple_id(set); map = isl_map_domain_map(isl_set_unwrap(set)); map = isl_map_set_tuple_id(map, isl_dim_in, id); return map; } __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; } /* Create a relation with the given set as range. * The domain of the created relation is a zero-dimensional * flat anonymous space. */ __isl_give isl_map *isl_map_from_range(__isl_take 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; } /* Create a relation with the given set as domain. * The range of the created relation is a zero-dimensional * flat anonymous space. */ __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); } __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; } __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_map *isl_map_empty(__isl_take isl_space *dim) { return isl_map_alloc_space(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); } __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; } 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; } __isl_null isl_map *isl_map_free(__isl_take 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; } 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) { return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max); } 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); 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 (!isl_space_is_equal(map1->dim, map2->dim)) isl_die(isl_map_get_ctx(map1), isl_error_invalid, "spaces don't match", 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; } 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; } /* Return the union of "map1" and "map2", where "map1" and "map2" are * guaranteed to be disjoint by the caller. * * Note that this functions is called from within isl_map_make_disjoint, * so we have to be careful not to touch the constraints of the inputs * in any way. */ __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); } /* Return the union of "map1" and "map2", where "map1" and "map2" may * not be disjoint. The parameters are assumed to have been aligned. * * We currently simply call map_union_disjoint, the internal operation * of which does not really depend on the inputs being disjoint. * If the result contains more than one basic map, then we clear * the disjoint flag since the result may contain basic maps from * both inputs and these are not guaranteed to be disjoint. * * As a special case, if "map1" and "map2" are obviously equal, * then we simply return "map1". */ static __isl_give isl_map *map_union_aligned(__isl_take isl_map *map1, __isl_take isl_map *map2) { int equal; if (!map1 || !map2) goto error; equal = isl_map_plain_is_equal(map1, map2); if (equal < 0) goto error; if (equal) { isl_map_free(map2); return map1; } map1 = map_union_disjoint(map1, map2); if (!map1) return NULL; if (map1->n > 1) ISL_F_CLR(map1, ISL_MAP_DISJOINT); return map1; error: isl_map_free(map1); isl_map_free(map2); return NULL; } /* Return the union of "map1" and "map2", where "map1" and "map2" may * not be disjoint. */ __isl_give isl_map *isl_map_union(__isl_take isl_map *map1, __isl_take isl_map *map2) { return isl_map_align_params_map_map_and(map1, map2, &map_union_aligned); } 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 *target_space; struct isl_basic_set *bset; unsigned dim; unsigned nparam; int i; if (!bmap) goto error; isl_assert(bmap->ctx, isl_space_tuple_is_equal(bmap->dim, isl_dim_in, bmap->dim, isl_dim_out), goto error); target_space = isl_space_domain(isl_basic_map_get_space(bmap)); dim = isl_basic_map_n_in(bmap); nparam = isl_basic_map_n_param(bmap); bmap = isl_basic_map_from_range(isl_basic_map_wrap(bmap)); bmap = isl_basic_map_add_dims(bmap, isl_dim_in, dim); bmap = isl_basic_map_extend_constraints(bmap, dim, 0); for (i = 0; i < dim; ++i) { int j = isl_basic_map_alloc_equality(bmap); if (j < 0) { bmap = isl_basic_map_free(bmap); break; } 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); isl_int_set_si(bmap->eq[j][1+nparam+2*dim+i], -1); } bset = isl_basic_map_domain(bmap); bset = isl_basic_set_reset_space(bset, target_space); 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_is_equal(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_is_equal(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_is_equal(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; } __isl_give isl_map *isl_map_identity(__isl_take isl_space *dim) { return isl_map_from_basic_map(isl_basic_map_identity(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; unsigned offset; 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); offset = pos(set->dim, type); for (i = 0; i < n; ++i) { nonneg = nonneg_halfspace(isl_set_get_space(set), offset + first + i); neg = neg_halfspace(isl_set_get_space(set), offset + 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; } isl_bool isl_set_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2) { return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2); } isl_bool isl_basic_map_is_subset(__isl_keep isl_basic_map *bmap1, __isl_keep isl_basic_map *bmap2) { int is_subset; struct isl_map *map1; struct isl_map *map2; if (!bmap1 || !bmap2) return isl_bool_error; 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; } isl_bool 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); } isl_bool isl_basic_map_is_equal(__isl_keep isl_basic_map *bmap1, __isl_keep isl_basic_map *bmap2) { isl_bool is_subset; if (!bmap1 || !bmap2) return isl_bool_error; is_subset = isl_basic_map_is_subset(bmap1, bmap2); if (is_subset != isl_bool_true) return is_subset; is_subset = isl_basic_map_is_subset(bmap2, bmap1); return is_subset; } isl_bool isl_basic_set_is_equal(__isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2) { return isl_basic_map_is_equal( (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2); } isl_bool isl_map_is_empty(__isl_keep isl_map *map) { int i; int is_empty; if (!map) return isl_bool_error; for (i = 0; i < map->n; ++i) { is_empty = isl_basic_map_is_empty(map->p[i]); if (is_empty < 0) return isl_bool_error; if (!is_empty) return isl_bool_false; } return isl_bool_true; } isl_bool isl_map_plain_is_empty(__isl_keep isl_map *map) { return map ? map->n == 0 : isl_bool_error; } isl_bool isl_set_plain_is_empty(__isl_keep isl_set *set) { return set ? set->n == 0 : isl_bool_error; } isl_bool isl_set_is_empty(__isl_keep 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 isl_bool map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2) { isl_bool is_subset; if (!map1 || !map2) return isl_bool_error; is_subset = isl_map_is_subset(map1, map2); if (is_subset != isl_bool_true) return is_subset; is_subset = isl_map_is_subset(map2, map1); return is_subset; } isl_bool 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); } isl_bool isl_basic_map_is_strict_subset( struct isl_basic_map *bmap1, struct isl_basic_map *bmap2) { isl_bool is_subset; if (!bmap1 || !bmap2) return isl_bool_error; is_subset = isl_basic_map_is_subset(bmap1, bmap2); if (is_subset != isl_bool_true) return is_subset; is_subset = isl_basic_map_is_subset(bmap2, bmap1); if (is_subset == isl_bool_error) return is_subset; return !is_subset; } isl_bool isl_map_is_strict_subset(__isl_keep isl_map *map1, __isl_keep isl_map *map2) { isl_bool is_subset; if (!map1 || !map2) return isl_bool_error; is_subset = isl_map_is_subset(map1, map2); if (is_subset != isl_bool_true) return is_subset; is_subset = isl_map_is_subset(map2, map1); if (is_subset == isl_bool_error) return is_subset; return !is_subset; } isl_bool 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); } isl_bool isl_basic_map_is_universe(__isl_keep isl_basic_map *bmap) { if (!bmap) return isl_bool_error; return bmap->n_eq == 0 && bmap->n_ineq == 0; } isl_bool isl_basic_set_is_universe(__isl_keep isl_basic_set *bset) { if (!bset) return isl_bool_error; return bset->n_eq == 0 && bset->n_ineq == 0; } isl_bool isl_map_plain_is_universe(__isl_keep isl_map *map) { int i; if (!map) return isl_bool_error; for (i = 0; i < map->n; ++i) { isl_bool r = isl_basic_map_is_universe(map->p[i]); if (r < 0 || r) return r; } return isl_bool_false; } isl_bool isl_set_plain_is_universe(__isl_keep isl_set *set) { return isl_map_plain_is_universe((isl_map *) set); } isl_bool isl_basic_map_is_empty(__isl_keep isl_basic_map *bmap) { struct isl_basic_set *bset = NULL; struct isl_vec *sample = NULL; isl_bool empty; unsigned total; if (!bmap) return isl_bool_error; if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY)) return isl_bool_true; if (isl_basic_map_is_universe(bmap)) return isl_bool_false; 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 isl_bool_error; if (contains) return isl_bool_false; } isl_vec_free(bmap->sample); bmap->sample = NULL; bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap)); if (!bset) return isl_bool_error; sample = isl_basic_set_sample_vec(bset); if (!sample) return isl_bool_error; empty = sample->size == 0; isl_vec_free(bmap->sample); bmap->sample = sample; if (empty) ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY); return empty; } isl_bool isl_basic_map_plain_is_empty(__isl_keep isl_basic_map *bmap) { if (!bmap) return isl_bool_error; return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY); } isl_bool isl_basic_set_plain_is_empty(__isl_keep isl_basic_set *bset) { if (!bset) return isl_bool_error; return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY); } isl_bool isl_basic_set_is_empty(__isl_keep 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; } /* Align the divs of "dst" to those of "src", adding divs from "src" * if needed. That is, make sure that the first src->n_div divs * of the result are equal to those of src. * * The result is not finalized as by design it will have redundant * divs if any divs from "src" were copied. */ __isl_give isl_basic_map *isl_basic_map_align_divs( __isl_take isl_basic_map *dst, __isl_keep isl_basic_map *src) { int i; int known, extended; unsigned total; if (!dst || !src) return isl_basic_map_free(dst); if (src->n_div == 0) return dst; known = isl_basic_map_divs_known(src); if (known < 0) return isl_basic_map_free(dst); if (!known) isl_die(isl_basic_map_get_ctx(src), isl_error_invalid, "some src divs are unknown", return isl_basic_map_free(dst)); src = isl_basic_map_order_divs(src); extended = 0; 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) { if (!extended) { int extra = src->n_div - i; dst = isl_basic_map_cow(dst); if (!dst) return NULL; dst = isl_basic_map_extend_space(dst, isl_space_copy(dst->dim), extra, 0, 2 * extra); extended = 1; } j = isl_basic_map_alloc_div(dst); if (j < 0) return isl_basic_map_free(dst); 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) return isl_basic_map_free(dst); } if (j != i) isl_basic_map_swap_div(dst, i, j); } return dst; } 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); } /* Align the divs of the basic maps in "map" to those * of the basic maps in "list", as well as to the other basic maps in "map". * The elements in "list" are assumed to have known divs. */ __isl_give isl_map *isl_map_align_divs_to_basic_map_list( __isl_take isl_map *map, __isl_keep isl_basic_map_list *list) { int i, n; map = isl_map_compute_divs(map); map = isl_map_cow(map); if (!map || !list) return isl_map_free(map); if (map->n == 0) return map; n = isl_basic_map_list_n_basic_map(list); for (i = 0; i < n; ++i) { isl_basic_map *bmap; bmap = isl_basic_map_list_get_basic_map(list, i); map->p[0] = isl_basic_map_align_divs(map->p[0], bmap); isl_basic_map_free(bmap); } if (!map->p[0]) return isl_map_free(map); return isl_map_align_divs(map); } /* Align the divs of each element of "list" to those of "bmap". * Both "bmap" and the elements of "list" are assumed to have known divs. */ __isl_give isl_basic_map_list *isl_basic_map_list_align_divs_to_basic_map( __isl_take isl_basic_map_list *list, __isl_keep isl_basic_map *bmap) { int i, n; if (!list || !bmap) return isl_basic_map_list_free(list); n = isl_basic_map_list_n_basic_map(list); for (i = 0; i < n; ++i) { isl_basic_map *bmap_i; bmap_i = isl_basic_map_list_get_basic_map(list, i); bmap_i = isl_basic_map_align_divs(bmap_i, bmap); list = isl_basic_map_list_set_basic_map(list, i, bmap_i); } return list; } 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 error2; 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); } /* 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); } /* 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; } /* uset_gist depends on constraints without existentially quantified * variables sorting first. */ static int sort_constraint_cmp(const void *p1, const void *p2, void *arg) { isl_int **c1 = (isl_int **) p1; isl_int **c2 = (isl_int **) p2; int l1, l2; unsigned size = *(unsigned *) arg; l1 = isl_seq_last_non_zero(*c1 + 1, size); l2 = isl_seq_last_non_zero(*c2 + 1, size); if (l1 != l2) return l1 - l2; return isl_seq_cmp(*c1 + 1, *c2 + 1, size); } static struct isl_basic_map *isl_basic_map_sort_constraints( struct isl_basic_map *bmap) { unsigned total; if (!bmap) return NULL; if (bmap->n_ineq == 0) return bmap; if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED)) return bmap; total = isl_basic_map_total_dim(bmap); if (isl_sort(bmap->ineq, bmap->n_ineq, sizeof(isl_int *), &sort_constraint_cmp, &total) < 0) return isl_basic_map_free(bmap); return bmap; } __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 -1; 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; } isl_bool isl_basic_map_plain_is_equal(__isl_keep isl_basic_map *bmap1, __isl_keep isl_basic_map *bmap2) { if (!bmap1 || !bmap2) return isl_bool_error; return isl_basic_map_plain_cmp(bmap1, bmap2) == 0; } isl_bool 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); } /* Sort the basic maps of "map" and remove duplicate basic maps. * * While removing basic maps, we make sure that the basic maps remain * sorted because isl_map_normalize expects the basic maps of the result * to be sorted. */ static __isl_give isl_map *sort_and_remove_duplicates(__isl_take isl_map *map) { int i, j; map = isl_map_remove_empty_parts(map); if (!map) return NULL; qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp); 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; } /* Remove obvious duplicates among the basic maps of "map". * * Unlike isl_map_normalize, this function does not remove redundant * constraints and only removes duplicates that have exactly the same * constraints in the input. It does sort the constraints and * the basic maps to ease the detection of duplicates. * * If "map" has already been normalized or if the basic maps are * disjoint, then there can be no duplicates. */ __isl_give isl_map *isl_map_remove_obvious_duplicates(__isl_take isl_map *map) { int i; isl_basic_map *bmap; if (!map) return NULL; if (map->n <= 1) return map; if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED | ISL_MAP_DISJOINT)) return map; for (i = 0; i < map->n; ++i) { bmap = isl_basic_map_copy(map->p[i]); bmap = isl_basic_map_sort_constraints(bmap); if (!bmap) return isl_map_free(map); isl_basic_map_free(map->p[i]); map->p[i] = bmap; } map = sort_and_remove_duplicates(map); return map; } /* 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 isl_map *isl_map_normalize(__isl_take isl_map *map) { int i; 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; } map = sort_and_remove_duplicates(map); if (map) ISL_F_SET(map, ISL_MAP_NORMALIZED); 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); } isl_bool isl_map_plain_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2) { int i; isl_bool equal; if (!map1 || !map2) return isl_bool_error; if (map1 == map2) return isl_bool_true; if (!isl_space_is_equal(map1->dim, map2->dim)) return isl_bool_false; 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 isl_bool_error; } isl_bool 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); } /* 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 basic maps in "map" as a list. */ __isl_give isl_basic_map_list *isl_map_get_basic_map_list( __isl_keep isl_map *map) { int i; isl_ctx *ctx; isl_basic_map_list *list; if (!map) return NULL; ctx = isl_map_get_ctx(map); list = isl_basic_map_list_alloc(ctx, map->n); for (i = 0; i < map->n; ++i) { isl_basic_map *bmap; bmap = isl_basic_map_copy(map->p[i]); list = isl_basic_map_list_add(list, bmap); } return list; } /* Return the intersection of the elements in the non-empty list "list". * All elements are assumed to live in the same space. */ __isl_give isl_basic_map *isl_basic_map_list_intersect( __isl_take isl_basic_map_list *list) { int i, n; isl_basic_map *bmap; if (!list) return NULL; n = isl_basic_map_list_n_basic_map(list); if (n < 1) isl_die(isl_basic_map_list_get_ctx(list), isl_error_invalid, "expecting non-empty list", goto error); bmap = isl_basic_map_list_get_basic_map(list, 0); for (i = 1; i < n; ++i) { isl_basic_map *bmap_i; bmap_i = isl_basic_map_list_get_basic_map(list, i); bmap = isl_basic_map_intersect(bmap, bmap_i); } isl_basic_map_list_free(list); return bmap; error: isl_basic_map_list_free(list); return NULL; } /* Return the intersection of the elements in the non-empty list "list". * All elements are assumed to live in the same space. */ __isl_give isl_basic_set *isl_basic_set_list_intersect( __isl_take isl_basic_set_list *list) { return isl_basic_map_list_intersect(list); } /* 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; } /* Apply "basic_map_product" to each pair of basic maps in "map1" and "map2" * and collect the results. * The result live in the space obtained by calling "space_product" * on the spaces of "map1" and "map2". * If "remove_duplicates" is set then the result may contain duplicates * (even if the inputs do not) and so we try and remove the obvious * duplicates. */ static __isl_give isl_map *map_product(__isl_take isl_map *map1, __isl_take isl_map *map2, __isl_give isl_space *(*space_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), int remove_duplicates) { 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(space_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; } if (remove_duplicates) result = isl_map_remove_obvious_duplicates(result); 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, 0); } __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, 1); } /* 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, 1); } __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 a map of the form [A -> B] -> [C -> D], return the map A -> C. */ __isl_give isl_map *isl_map_factor_domain(__isl_take isl_map *map) { isl_space *space; int total1, keep1, total2, keep2; if (!map) return NULL; if (!isl_space_domain_is_wrapping(map->dim) || !isl_space_range_is_wrapping(map->dim)) isl_die(isl_map_get_ctx(map), isl_error_invalid, "not a product", return isl_map_free(map)); space = isl_map_get_space(map); total1 = isl_space_dim(space, isl_dim_in); total2 = isl_space_dim(space, isl_dim_out); space = isl_space_factor_domain(space); keep1 = isl_space_dim(space, isl_dim_in); keep2 = isl_space_dim(space, isl_dim_out); map = isl_map_project_out(map, isl_dim_in, keep1, total1 - keep1); map = isl_map_project_out(map, isl_dim_out, keep2, total2 - keep2); map = isl_map_reset_space(map, space); return map; } /* Given a map of the form [A -> B] -> [C -> D], return the map B -> D. */ __isl_give isl_map *isl_map_factor_range(__isl_take isl_map *map) { isl_space *space; int total1, keep1, total2, keep2; if (!map) return NULL; if (!isl_space_domain_is_wrapping(map->dim) || !isl_space_range_is_wrapping(map->dim)) isl_die(isl_map_get_ctx(map), isl_error_invalid, "not a product", return isl_map_free(map)); space = isl_map_get_space(map); total1 = isl_space_dim(space, isl_dim_in); total2 = isl_space_dim(space, isl_dim_out); space = isl_space_factor_range(space); keep1 = isl_space_dim(space, isl_dim_in); keep2 = isl_space_dim(space, isl_dim_out); map = isl_map_project_out(map, isl_dim_in, 0, total1 - keep1); map = isl_map_project_out(map, isl_dim_out, 0, total2 - keep2); map = isl_map_reset_space(map, space); return map; } /* Given a map of the form [A -> B] -> C, return the map A -> C. */ __isl_give isl_map *isl_map_domain_factor_domain(__isl_take isl_map *map) { isl_space *space; int total, keep; if (!map) return NULL; if (!isl_space_domain_is_wrapping(map->dim)) isl_die(isl_map_get_ctx(map), isl_error_invalid, "domain is not a product", return isl_map_free(map)); space = isl_map_get_space(map); total = isl_space_dim(space, isl_dim_in); space = isl_space_domain_factor_domain(space); keep = isl_space_dim(space, isl_dim_in); map = isl_map_project_out(map, isl_dim_in, keep, total - keep); map = isl_map_reset_space(map, space); return map; } /* Given a map of the form [A -> B] -> C, return the map B -> C. */ __isl_give isl_map *isl_map_domain_factor_range(__isl_take isl_map *map) { isl_space *space; int total, keep; if (!map) return NULL; if (!isl_space_domain_is_wrapping(map->dim)) isl_die(isl_map_get_ctx(map), isl_error_invalid, "domain is not a product", return isl_map_free(map)); space = isl_map_get_space(map); total = isl_space_dim(space, isl_dim_in); space = isl_space_domain_factor_range(space); keep = isl_space_dim(space, isl_dim_in); map = isl_map_project_out(map, isl_dim_in, 0, total - keep); map = isl_map_reset_space(map, space); return map; } /* Given a map A -> [B -> C], extract the map A -> B. */ __isl_give isl_map *isl_map_range_factor_domain(__isl_take isl_map *map) { isl_space *space; int total, keep; if (!map) return NULL; if (!isl_space_range_is_wrapping(map->dim)) isl_die(isl_map_get_ctx(map), isl_error_invalid, "range is not a product", return isl_map_free(map)); space = isl_map_get_space(map); total = isl_space_dim(space, isl_dim_out); space = isl_space_range_factor_domain(space); keep = isl_space_dim(space, isl_dim_out); map = isl_map_project_out(map, isl_dim_out, keep, total - keep); map = isl_map_reset_space(map, space); return map; } /* Given a map A -> [B -> C], extract the map A -> C. */ __isl_give isl_map *isl_map_range_factor_range(__isl_take isl_map *map) { isl_space *space; int total, keep; if (!map) return NULL; if (!isl_space_range_is_wrapping(map->dim)) isl_die(isl_map_get_ctx(map), isl_error_invalid, "range is not a product", return isl_map_free(map)); space = isl_map_get_space(map); total = isl_space_dim(space, isl_dim_out); space = isl_space_range_factor_range(space); keep = isl_space_dim(space, isl_dim_out); map = isl_map_project_out(map, isl_dim_out, 0, total - keep); map = isl_map_reset_space(map, space); return map; } /* 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; } /* Return the number of basic maps in the (current) representation of "map". */ int isl_map_n_basic_map(__isl_keep isl_map *map) { return map ? map->n : 0; } int isl_set_n_basic_set(__isl_keep isl_set *set) { return set ? set->n : 0; } isl_stat isl_map_foreach_basic_map(__isl_keep isl_map *map, isl_stat (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user) { int i; if (!map) return isl_stat_error; for (i = 0; i < map->n; ++i) if (fn(isl_basic_map_copy(map->p[i]), user) < 0) return isl_stat_error; return isl_stat_ok; } isl_stat isl_set_foreach_basic_set(__isl_keep isl_set *set, isl_stat (*fn)(__isl_take isl_basic_set *bset, void *user), void *user) { int i; if (!set) return isl_stat_error; for (i = 0; i < set->n; ++i) if (fn(isl_basic_set_copy(set->p[i]), user) < 0) return isl_stat_error; return isl_stat_ok; } __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 isl_bool 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 isl_bool_error; isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return isl_bool_error); 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 isl_bool_true; } for (i = 0; i < bmap->n_eq; ++i) if (!isl_int_is_zero(bmap->eq[i][pos])) return isl_bool_true; 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); } isl_bool 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); } isl_bool 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 isl_bool has_any_bound(__isl_keep isl_map *map, enum isl_dim_type type, unsigned pos, isl_bool (*fn)(__isl_keep isl_basic_map *bmap, enum isl_dim_type type, unsigned pos)) { int i; if (!map) return isl_bool_error; for (i = 0; i < map->n; ++i) { isl_bool bounded; bounded = fn(map->p[i], type, pos); if (bounded < 0 || bounded) return bounded; } return isl_bool_false; } /* Return 1 if the specified dim is involved in any lower bound. */ isl_bool 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. */ isl_bool 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 isl_bool has_bound(__isl_keep isl_map *map, enum isl_dim_type type, unsigned pos, isl_bool (*fn)(__isl_keep isl_basic_map *bmap, enum isl_dim_type type, unsigned pos)) { int i; if (!map) return isl_bool_error; for (i = 0; i < map->n; ++i) { isl_bool bounded; bounded = fn(map->p[i], type, pos); if (bounded < 0 || !bounded) return bounded; } return isl_bool_true; } /* Return 1 if the specified dim has a lower bound (in each of its basic sets). */ isl_bool 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). */ isl_bool 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); } /* Is it possible for the integer division "div" to depend (possibly * indirectly) on any output dimensions? * * If the div is undefined, then we conservatively assume that it * may depend on them. * Otherwise, we check if it actually depends on them or on any integer * divisions that may depend on them. */ static int div_may_involve_output(__isl_keep isl_basic_map *bmap, int div) { int i; unsigned n_out, o_out; unsigned n_div, o_div; if (isl_int_is_zero(bmap->div[div][0])) return 1; n_out = isl_basic_map_dim(bmap, isl_dim_out); o_out = isl_basic_map_offset(bmap, isl_dim_out); if (isl_seq_first_non_zero(bmap->div[div] + 1 + o_out, n_out) != -1) return 1; n_div = isl_basic_map_dim(bmap, isl_dim_div); o_div = isl_basic_map_offset(bmap, isl_dim_div); for (i = 0; i < n_div; ++i) { if (isl_int_is_zero(bmap->div[div][1 + o_div + i])) continue; if (div_may_involve_output(bmap, i)) return 1; } return 0; } /* Return the index of the equality of "bmap" that defines * the output dimension "pos" in terms of earlier dimensions. * The equality may also involve integer divisions, as long * as those integer divisions are defined in terms of * parameters or input dimensions. * Return bmap->n_eq if there is no such equality. * Return -1 on error. */ int isl_basic_map_output_defining_equality(__isl_keep isl_basic_map *bmap, int pos) { int j, k; unsigned n_out, o_out; unsigned n_div, o_div; if (!bmap) return -1; n_out = isl_basic_map_dim(bmap, isl_dim_out); o_out = isl_basic_map_offset(bmap, isl_dim_out); n_div = isl_basic_map_dim(bmap, isl_dim_div); o_div = isl_basic_map_offset(bmap, isl_dim_div); for (j = 0; j < bmap->n_eq; ++j) { if (isl_int_is_zero(bmap->eq[j][o_out + pos])) continue; if (isl_seq_first_non_zero(bmap->eq[j] + o_out + pos + 1, n_out - (pos + 1)) != -1) continue; for (k = 0; k < n_div; ++k) { if (isl_int_is_zero(bmap->eq[j][o_div + k])) continue; if (div_may_involve_output(bmap, k)) break; } if (k >= n_div) return j; } return bmap->n_eq; } /* 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. */ isl_bool isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map *bmap) { int i; unsigned n_out; if (!bmap) return isl_bool_error; n_out = isl_basic_map_dim(bmap, isl_dim_out); for (i = 0; i < n_out; ++i) { int eq; eq = isl_basic_map_output_defining_equality(bmap, i); if (eq < 0) return isl_bool_error; if (eq >= bmap->n_eq) return isl_bool_false; } return isl_bool_true; } /* 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. */ isl_bool isl_basic_map_is_single_valued(__isl_keep isl_basic_map *bmap) { isl_space *space; isl_basic_map *test; isl_basic_map *id; isl_bool 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. */ isl_bool isl_map_plain_is_single_valued(__isl_keep isl_map *map) { if (!map) return isl_bool_error; if (map->n == 0) return isl_bool_true; if (map->n >= 2) return isl_bool_false; 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. */ isl_bool isl_map_is_single_valued(__isl_keep isl_map *map) { isl_space *dim; isl_map *test; isl_map *id; isl_bool 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; } isl_bool isl_map_is_injective(__isl_keep isl_map *map) { isl_bool 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. */ isl_bool isl_map_plain_is_injective(__isl_keep isl_map *map) { isl_bool 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; } isl_bool isl_map_is_bijective(__isl_keep isl_map *map) { isl_bool sv; sv = isl_map_is_single_valued(map); if (sv < 0 || !sv) return sv; return isl_map_is_injective(map); } isl_bool 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]); } isl_bool isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset) { if (!bset) return isl_bool_error; return isl_space_is_wrapping(bset->dim); } isl_bool isl_set_is_wrapping(__isl_keep isl_set *set) { if (!set) return isl_bool_error; return isl_space_is_wrapping(set->dim); } /* Is the domain of "map" a wrapped relation? */ isl_bool isl_map_domain_is_wrapping(__isl_keep isl_map *map) { if (!map) return isl_bool_error; return isl_space_domain_is_wrapping(map->dim); } /* Is the range of "map" a wrapped relation? */ isl_bool isl_map_range_is_wrapping(__isl_keep isl_map *map) { if (!map) return isl_bool_error; return isl_space_range_is_wrapping(map->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); } isl_bool isl_basic_map_can_zip(__isl_keep isl_basic_map *bmap) { if (!bmap) return isl_bool_error; return isl_space_can_zip(bmap->dim); } isl_bool isl_map_can_zip(__isl_keep isl_map *map) { if (!map) return isl_bool_error; 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? */ isl_bool isl_basic_map_can_curry(__isl_keep isl_basic_map *bmap) { if (!bmap) return isl_bool_error; 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? */ isl_bool isl_map_can_curry(__isl_keep isl_map *map) { if (!map) return isl_bool_error; 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? */ isl_bool isl_basic_map_can_uncurry(__isl_keep isl_basic_map *bmap) { if (!bmap) return isl_bool_error; 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? */ isl_bool isl_map_can_uncurry(__isl_keep isl_map *map) { if (!map) return isl_bool_error; 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", goto error); 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; error: isl_multi_aff_free(maff); return NULL; } /* 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; } /* Construct a constraint imposing that the value of the first dimension is * greater than or equal to that of the second. */ static __isl_give isl_constraint *constraint_order_ge( __isl_take isl_space *space, enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2) { isl_constraint *c; if (!space) return NULL; c = isl_constraint_alloc_inequality(isl_local_space_from_space(space)); if (pos1 >= isl_constraint_dim(c, type1)) isl_die(isl_constraint_get_ctx(c), isl_error_invalid, "index out of bounds", return isl_constraint_free(c)); if (pos2 >= isl_constraint_dim(c, type2)) isl_die(isl_constraint_get_ctx(c), isl_error_invalid, "index out of bounds", return isl_constraint_free(c)); if (type1 == type2 && pos1 == pos2) return c; c = isl_constraint_set_coefficient_si(c, type1, pos1, 1); c = isl_constraint_set_coefficient_si(c, type2, pos2, -1); return c; } /* 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_space *space; if (type1 == type2 && pos1 == pos2) return bmap; space = isl_basic_map_get_space(bmap); c = constraint_order_ge(space, type1, pos1, type2, pos2); bmap = isl_basic_map_add_constraint(bmap, c); return bmap; } /* Add a constraint imposing that the value of the first dimension is * greater than or equal to that of the second. */ __isl_give isl_map *isl_map_order_ge(__isl_take isl_map *map, enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2) { isl_constraint *c; isl_space *space; if (type1 == type2 && pos1 == pos2) return map; space = isl_map_get_space(map); c = constraint_order_ge(space, type1, pos1, type2, pos2); map = isl_map_add_constraint(map, c); return map; } /* Add a constraint imposing that the value of the first dimension is * less than or equal to that of the second. */ __isl_give isl_map *isl_map_order_le(__isl_take isl_map *map, enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2) { return isl_map_order_ge(map, type2, pos2, type1, pos1); } /* 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) return isl_basic_map_free(bmap); 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_match(bmap->dim, isl_dim_param, ma_space, isl_dim_param); if (m < 0) goto error; if (!m) isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid, "parameters don't match", goto error); m = isl_space_tuple_is_equal(bmap->dim, type, ma_space, isl_dim_out); if (m < 0) goto error; if (!m) isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid, "spaces don't match", goto error); isl_space_free(ma_space); return m; error: isl_space_free(ma_space); return -1; } /* 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); } /* Compute the preimage of the domain of "bmap" under the function * represented by "ma". * In other words, plug in "ma" in the domain of "bmap". * The result is a basic map that lives in the same space as "bmap" * except that the domain has been replaced by the domain space of "ma". */ __isl_give isl_basic_map *isl_basic_map_preimage_domain_multi_aff( __isl_take isl_basic_map *bmap, __isl_take isl_multi_aff *ma) { return isl_basic_map_preimage_multi_aff(bmap, isl_dim_in, ma); } /* Compute the preimage of the range of "bmap" under the function * represented by "ma". * In other words, plug in "ma" in the range of "bmap". * The result is a basic map that lives in the same space as "bmap" * except that the range has been replaced by the domain space of "ma". */ __isl_give isl_basic_map *isl_basic_map_preimage_range_multi_aff( __isl_take isl_basic_map *bmap, __isl_take isl_multi_aff *ma) { return isl_basic_map_preimage_multi_aff(bmap, isl_dim_out, 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_is_equal(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" in "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 the range of "map" under the function * represented by "ma". * In other words, plug in "ma" in the range of "map". * The result is a map that lives in the same space as "map" * except that the range has been replaced by the domain space of "ma". */ __isl_give isl_map *isl_map_preimage_range_multi_aff(__isl_take isl_map *map, __isl_take isl_multi_aff *ma) { return isl_map_preimage_multi_aff(map, isl_dim_out, ma); } /* Compute the preimage of "map" under the function represented by "pma". * In other words, plug in "pma" in the domain or range of "map". * The result is a map that lives in the same space as "map", * except that the space of type "type" has been replaced by * the domain space of "pma". * * The parameters of "map" and "pma" are assumed to have been aligned. */ static __isl_give isl_map *isl_map_preimage_pw_multi_aff_aligned( __isl_take isl_map *map, enum isl_dim_type type, __isl_take isl_pw_multi_aff *pma) { int i; isl_map *res; if (!pma) goto error; if (pma->n == 0) { isl_pw_multi_aff_free(pma); res = isl_map_empty(isl_map_get_space(map)); isl_map_free(map); return res; } res = isl_map_preimage_multi_aff(isl_map_copy(map), type, isl_multi_aff_copy(pma->p[0].maff)); if (type == isl_dim_in) res = isl_map_intersect_domain(res, isl_map_copy(pma->p[0].set)); else res = isl_map_intersect_range(res, isl_map_copy(pma->p[0].set)); for (i = 1; i < pma->n; ++i) { isl_map *res_i; res_i = isl_map_preimage_multi_aff(isl_map_copy(map), type, isl_multi_aff_copy(pma->p[i].maff)); if (type == isl_dim_in) res_i = isl_map_intersect_domain(res_i, isl_map_copy(pma->p[i].set)); else res_i = isl_map_intersect_range(res_i, isl_map_copy(pma->p[i].set)); res = isl_map_union(res, res_i); } isl_pw_multi_aff_free(pma); isl_map_free(map); return res; error: isl_pw_multi_aff_free(pma); isl_map_free(map); return NULL; } /* Compute the preimage of "map" under the function represented by "pma". * In other words, plug in "pma" in the domain or range of "map". * The result is a map that lives in the same space as "map", * except that the space of type "type" has been replaced by * the domain space of "pma". */ __isl_give isl_map *isl_map_preimage_pw_multi_aff(__isl_take isl_map *map, enum isl_dim_type type, __isl_take isl_pw_multi_aff *pma) { if (!map || !pma) goto error; if (isl_space_match(map->dim, isl_dim_param, pma->dim, isl_dim_param)) return isl_map_preimage_pw_multi_aff_aligned(map, type, pma); if (!isl_space_has_named_params(map->dim) || !isl_space_has_named_params(pma->dim)) isl_die(map->ctx, isl_error_invalid, "unaligned unnamed parameters", goto error); map = isl_map_align_params(map, isl_pw_multi_aff_get_space(pma)); pma = isl_pw_multi_aff_align_params(pma, isl_map_get_space(map)); return isl_map_preimage_pw_multi_aff_aligned(map, type, pma); error: isl_pw_multi_aff_free(pma); return isl_map_free(map); } /* 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". */ __isl_give isl_set *isl_set_preimage_pw_multi_aff(__isl_take isl_set *set, __isl_take isl_pw_multi_aff *pma) { return isl_map_preimage_pw_multi_aff(set, isl_dim_set, pma); } /* Compute the preimage of the domain of "map" under the function * represented by "pma". * In other words, plug in "pma" in the domain of "map". * The result is a map that lives in the same space as "map", * except that domain space has been replaced by the domain space of "pma". */ __isl_give isl_map *isl_map_preimage_domain_pw_multi_aff( __isl_take isl_map *map, __isl_take isl_pw_multi_aff *pma) { return isl_map_preimage_pw_multi_aff(map, isl_dim_in, pma); } /* Compute the preimage of the range of "map" under the function * represented by "pma". * In other words, plug in "pma" in the range of "map". * The result is a map that lives in the same space as "map", * except that range space has been replaced by the domain space of "pma". */ __isl_give isl_map *isl_map_preimage_range_pw_multi_aff( __isl_take isl_map *map, __isl_take isl_pw_multi_aff *pma) { return isl_map_preimage_pw_multi_aff(map, isl_dim_out, pma); } /* Compute the preimage of "map" under the function represented by "mpa". * In other words, plug in "mpa" in the domain or range of "map". * The result is a map that lives in the same space as "map", * except that the space of type "type" has been replaced by * the domain space of "mpa". * * If the map does not involve any constraints that refer to the * dimensions of the substituted space, then the only possible * effect of "mpa" on the map is to map the space to a different space. * We create a separate isl_multi_aff to effectuate this change * in order to avoid spurious splitting of the map along the pieces * of "mpa". */ __isl_give isl_map *isl_map_preimage_multi_pw_aff(__isl_take isl_map *map, enum isl_dim_type type, __isl_take isl_multi_pw_aff *mpa) { int n; isl_pw_multi_aff *pma; if (!map || !mpa) goto error; n = isl_map_dim(map, type); if (!isl_map_involves_dims(map, type, 0, n)) { isl_space *space; isl_multi_aff *ma; space = isl_multi_pw_aff_get_space(mpa); isl_multi_pw_aff_free(mpa); ma = isl_multi_aff_zero(space); return isl_map_preimage_multi_aff(map, type, ma); } pma = isl_pw_multi_aff_from_multi_pw_aff(mpa); return isl_map_preimage_pw_multi_aff(map, type, pma); error: isl_map_free(map); isl_multi_pw_aff_free(mpa); return NULL; } /* Compute the preimage of "map" under the function represented by "mpa". * In other words, plug in "mpa" in the domain "map". * The result is a map that lives in the same space as "map", * except that domain space has been replaced by the domain space of "mpa". */ __isl_give isl_map *isl_map_preimage_domain_multi_pw_aff( __isl_take isl_map *map, __isl_take isl_multi_pw_aff *mpa) { return isl_map_preimage_multi_pw_aff(map, isl_dim_in, mpa); } /* Compute the preimage of "set" by the function represented by "mpa". * In other words, plug in "mpa" in "set". */ __isl_give isl_set *isl_set_preimage_multi_pw_aff(__isl_take isl_set *set, __isl_take isl_multi_pw_aff *mpa) { return isl_map_preimage_multi_pw_aff(set, isl_dim_set, mpa); } cloog-0.18.4/isl/isl_multi_apply_union_set.c0000644000175000017500000000021312554427055016061 00000000000000#define APPLY_DOMBASE union_set #define APPLY_DOM isl_union_set #include #undef APPLY_DOMBASE #undef APPLY_DOM cloog-0.18.4/isl/isl_ast.c0000644000175000017500000015616312554427055012246 00000000000000/* * Copyright 2012-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 #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; } __isl_null isl_ast_print_options *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); } __isl_null isl_ast_expr *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: if (expr->u.op.args) 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; } /* 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); } /* Is "expr1" equal to "expr2"? */ isl_bool isl_ast_expr_is_equal(__isl_keep isl_ast_expr *expr1, __isl_keep isl_ast_expr *expr2) { int i; if (!expr1 || !expr2) return isl_bool_error; if (expr1 == expr2) return isl_bool_true; if (expr1->type != expr2->type) return isl_bool_false; switch (expr1->type) { case isl_ast_expr_int: return isl_val_eq(expr1->u.v, expr2->u.v); case isl_ast_expr_id: return expr1->u.id == expr2->u.id; case isl_ast_expr_op: if (expr1->u.op.op != expr2->u.op.op) return isl_bool_false; if (expr1->u.op.n_arg != expr2->u.op.n_arg) return isl_bool_false; for (i = 0; i < expr1->u.op.n_arg; ++i) { isl_bool equal; equal = isl_ast_expr_is_equal(expr1->u.op.args[i], expr2->u.op.args[i]); if (equal < 0 || !equal) return equal; } return 1; case isl_ast_expr_error: return isl_bool_error; } isl_die(isl_ast_expr_get_ctx(expr1), isl_error_internal, "unhandled case", return isl_bool_error); } /* 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) goto error; expr->ctx = ctx; isl_ctx_ref(ctx); expr->ref = 1; expr->type = isl_ast_expr_id; expr->u.id = id; return expr; error: isl_id_free(id); return NULL; } /* 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", goto error); ctx = isl_val_get_ctx(v); expr = isl_calloc_type(ctx, isl_ast_expr); if (!expr) goto error; expr->ctx = ctx; isl_ctx_ref(ctx); expr->ref = 1; expr->type = isl_ast_expr_int; expr->u.v = v; return expr; error: isl_val_free(v); return NULL; } /* Create an expression representing the unary operation "type" applied to * "arg". */ __isl_give isl_ast_expr *isl_ast_expr_alloc_unary(enum isl_ast_op_type type, __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, type, 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 negation of "arg". */ __isl_give isl_ast_expr *isl_ast_expr_neg(__isl_take isl_ast_expr *arg) { return isl_ast_expr_alloc_unary(isl_ast_op_minus, arg); } /* Create an expression representing the address of "expr". */ __isl_give isl_ast_expr *isl_ast_expr_address_of(__isl_take isl_ast_expr *expr) { if (!expr) return NULL; if (isl_ast_expr_get_type(expr) != isl_ast_expr_op || isl_ast_expr_get_op_type(expr) != isl_ast_op_access) isl_die(isl_ast_expr_get_ctx(expr), isl_error_invalid, "can only take address of access expressions", return isl_ast_expr_free(expr)); return isl_ast_expr_alloc_unary(isl_ast_op_address_of, expr); } /* 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 quotient of the integer * division of "expr1" by "expr2", where "expr1" is known to be * non-negative. */ __isl_give isl_ast_expr *isl_ast_expr_pdiv_q(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2) { return isl_ast_expr_alloc_binary(isl_ast_op_pdiv_q, expr1, expr2); } /* Create an expression representing the remainder of the integer * division of "expr1" by "expr2", where "expr1" is known to be * non-negative. */ __isl_give isl_ast_expr *isl_ast_expr_pdiv_r(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2) { return isl_ast_expr_alloc_binary(isl_ast_op_pdiv_r, 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 conjunction of "expr1" and "expr2", * where "expr2" is evaluated only if "expr1" is evaluated to true. */ __isl_give isl_ast_expr *isl_ast_expr_and_then(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2) { return isl_ast_expr_alloc_binary(isl_ast_op_and_then, 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); } /* Create an expression representing the disjunction of "expr1" and "expr2", * where "expr2" is evaluated only if "expr1" is evaluated to false. */ __isl_give isl_ast_expr *isl_ast_expr_or_else(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2) { return isl_ast_expr_alloc_binary(isl_ast_op_or_else, expr1, expr2); } /* Create an expression representing "expr1" less than or equal to "expr2". */ __isl_give isl_ast_expr *isl_ast_expr_le(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2) { return isl_ast_expr_alloc_binary(isl_ast_op_le, expr1, expr2); } /* Create an expression representing "expr1" less than "expr2". */ __isl_give isl_ast_expr *isl_ast_expr_lt(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2) { return isl_ast_expr_alloc_binary(isl_ast_op_lt, expr1, expr2); } /* Create an expression representing "expr1" greater than or equal to "expr2". */ __isl_give isl_ast_expr *isl_ast_expr_ge(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2) { return isl_ast_expr_alloc_binary(isl_ast_op_ge, expr1, expr2); } /* Create an expression representing "expr1" greater than "expr2". */ __isl_give isl_ast_expr *isl_ast_expr_gt(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2) { return isl_ast_expr_alloc_binary(isl_ast_op_gt, expr1, expr2); } /* Create an expression representing "expr1" equal to "expr2". */ __isl_give isl_ast_expr *isl_ast_expr_eq(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2) { return isl_ast_expr_alloc_binary(isl_ast_op_eq, expr1, expr2); } /* Create an expression of type "type" with as arguments "arg0" followed * by "arguments". */ static __isl_give isl_ast_expr *ast_expr_with_arguments( enum isl_ast_op_type type, __isl_take isl_ast_expr *arg0, __isl_take isl_ast_expr_list *arguments) { int i, n; isl_ctx *ctx; isl_ast_expr *res = NULL; if (!arg0 || !arguments) goto error; ctx = isl_ast_expr_get_ctx(arg0); n = isl_ast_expr_list_n_ast_expr(arguments); res = isl_ast_expr_alloc_op(ctx, type, 1 + n); if (!res) goto error; for (i = 0; i < n; ++i) { isl_ast_expr *arg; arg = isl_ast_expr_list_get_ast_expr(arguments, i); res->u.op.args[1 + i] = arg; if (!arg) goto error; } res->u.op.args[0] = arg0; isl_ast_expr_list_free(arguments); return res; error: isl_ast_expr_free(arg0); isl_ast_expr_list_free(arguments); isl_ast_expr_free(res); return NULL; } /* Create an expression representing an access to "array" with index * expressions "indices". */ __isl_give isl_ast_expr *isl_ast_expr_access(__isl_take isl_ast_expr *array, __isl_take isl_ast_expr_list *indices) { return ast_expr_with_arguments(isl_ast_op_access, array, indices); } /* Create an expression representing a call to "function" with argument * expressions "arguments". */ __isl_give isl_ast_expr *isl_ast_expr_call(__isl_take isl_ast_expr *function, __isl_take isl_ast_expr_list *arguments) { return ast_expr_with_arguments(isl_ast_op_call, function, arguments); } /* For each subexpression of "expr" of type isl_ast_expr_id, * if it appears in "id2expr", then replace it by the corresponding * expression. */ __isl_give isl_ast_expr *isl_ast_expr_substitute_ids( __isl_take isl_ast_expr *expr, __isl_take isl_id_to_ast_expr *id2expr) { int i; isl_id *id; if (!expr || !id2expr) goto error; switch (expr->type) { case isl_ast_expr_int: break; case isl_ast_expr_id: if (!isl_id_to_ast_expr_has(id2expr, expr->u.id)) break; id = isl_id_copy(expr->u.id); isl_ast_expr_free(expr); expr = isl_id_to_ast_expr_get(id2expr, id); break; case isl_ast_expr_op: for (i = 0; i < expr->u.op.n_arg; ++i) { isl_ast_expr *arg; arg = isl_ast_expr_copy(expr->u.op.args[i]); arg = isl_ast_expr_substitute_ids(arg, isl_id_to_ast_expr_copy(id2expr)); if (arg == expr->u.op.args[i]) { isl_ast_expr_free(arg); continue; } if (!arg) expr = isl_ast_expr_free(expr); expr = isl_ast_expr_cow(expr); if (!expr) { isl_ast_expr_free(arg); break; } isl_ast_expr_free(expr->u.op.args[i]); expr->u.op.args[i] = arg; } break; case isl_ast_expr_error: expr = isl_ast_expr_free(expr); break; } isl_id_to_ast_expr_free(id2expr); return expr; error: isl_ast_expr_free(expr); isl_id_to_ast_expr_free(id2expr); return NULL; } 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) goto error; node->u.f.iterator = isl_ast_expr_from_id(id); if (!node->u.f.iterator) return isl_ast_node_free(node); return node; error: isl_id_free(id); return NULL; } /* Create a mark node, marking "node" with "id". */ __isl_give isl_ast_node *isl_ast_node_alloc_mark(__isl_take isl_id *id, __isl_take isl_ast_node *node) { isl_ctx *ctx; isl_ast_node *mark; if (!id || !node) goto error; ctx = isl_id_get_ctx(id); mark = isl_ast_node_alloc(ctx, isl_ast_node_mark); if (!mark) goto error; mark->u.m.mark = id; mark->u.m.node = node; return mark; error: isl_id_free(id); isl_ast_node_free(node); return NULL; } /* 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_mark: dup->u.m.mark = isl_id_copy(node->u.m.mark); dup->u.m.node = isl_ast_node_copy(node->u.m.node); if (!dup->u.m.mark || !dup->u.m.node) 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); } __isl_null isl_ast_node *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_mark: isl_id_free(node->u.m.mark); isl_ast_node_free(node->u.m.node); 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; } isl_bool isl_ast_node_for_is_degenerate(__isl_keep isl_ast_node *node) { if (!node) return isl_bool_error; if (node->type != isl_ast_node_for) isl_die(isl_ast_node_get_ctx(node), isl_error_invalid, "not a for node", return isl_bool_error); 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); } isl_bool isl_ast_node_if_has_else( __isl_keep isl_ast_node *node) { if (!node) return isl_bool_error; if (node->type != isl_ast_node_if) isl_die(isl_ast_node_get_ctx(node), isl_error_invalid, "not an if node", return isl_bool_error); 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; if (node->type != isl_ast_node_user) isl_die(isl_ast_node_get_ctx(node), isl_error_invalid, "not a user node", return NULL); return isl_ast_expr_copy(node->u.e.expr); } /* Return the mark identifier of the mark node "node". */ __isl_give isl_id *isl_ast_node_mark_get_id(__isl_keep isl_ast_node *node) { if (!node) return NULL; if (node->type != isl_ast_node_mark) isl_die(isl_ast_node_get_ctx(node), isl_error_invalid, "not a mark node", return NULL); return isl_id_copy(node->u.m.mark); } /* Return the node marked by mark node "node". */ __isl_give isl_ast_node *isl_ast_node_mark_get_node( __isl_keep isl_ast_node *node) { if (!node) return NULL; if (node->type != isl_ast_node_mark) isl_die(isl_ast_node_get_ctx(node), isl_error_invalid, "not a mark node", return NULL); return isl_ast_node_copy(node->u.m.node); } __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_zdiv_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] = ">", [isl_ast_op_member] = ".", [isl_ast_op_address_of] = "&" }; /* 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_zdiv_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, [isl_ast_op_access] = 2, [isl_ast_op_member] = 2, [isl_ast_op_address_of] = 3 }; /* 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_zdiv_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, [isl_ast_op_access] = 1, [isl_ast_op_member] = 1, [isl_ast_op_address_of] = 0 }; 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 || op == isl_ast_op_zdiv_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 an array access "expr". * * The first argument represents the array being accessed. */ static __isl_give isl_printer *print_access(__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]); 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 "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.op == isl_ast_op_access) { p = print_access(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); if (expr->u.op.op != isl_ast_op_member) p = isl_printer_print_str(p, " "); p = isl_printer_print_str(p, op_str[expr->u.op.op]); if (expr->u.op.op != isl_ast_op_member) 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_mark: p = isl_printer_print_str(p, "mark: "); p = isl_printer_print_id(p, node->u.m.mark); p = isl_printer_print_str(p, "node: "); p = isl_printer_print_ast_node(p, node->u.m.node); 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; case isl_ast_node_error: 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. * If the node is an if node with an else, then we print a block * to avoid spurious dangling else warnings emitted by some compilers. * If the node is a mark, then in principle, we would have to check * the child of the mark node. However, even if the child would not * require us to print a block, for readability it is probably best * to print a block anyway. * If the ast_always_print_block option has been set, then we print a block. */ static int need_block(__isl_keep isl_ast_node *node) { isl_ctx *ctx; if (node->type == isl_ast_node_block) return 1; if (node->type == isl_ast_node_for && node->u.f.degenerate) return 1; if (node->type == isl_ast_node_if && node->u.i.else_node) return 1; if (node->type == isl_ast_node_mark) return 1; ctx = isl_ast_node_get_ctx(node); return isl_options_get_ast_always_print_block(ctx); } 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_mark: p = isl_printer_start_line(p); p = isl_printer_print_str(p, "// "); p = isl_printer_print_str(p, isl_id_get_name(node->u.m.mark)); p = isl_printer_end_line(p); p = print_ast_node_c(p, node->u.m.node, options, 0, in_list); 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_mark: macros = ast_node_required_macros(node->u.m.node, 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. */ isl_stat isl_ast_node_foreach_ast_op_type(__isl_keep isl_ast_node *node, isl_stat (*fn)(enum isl_ast_op_type type, void *user), void *user) { int macros; if (!node) return isl_stat_error; macros = ast_node_required_macros(node, 0); if (macros & ISL_AST_MACRO_MIN && fn(isl_ast_op_min, user) < 0) return isl_stat_error; if (macros & ISL_AST_MACRO_MAX && fn(isl_ast_op_max, user) < 0) return isl_stat_error; if (macros & ISL_AST_MACRO_FLOORD && fn(isl_ast_op_fdiv_q, user) < 0) return isl_stat_error; return isl_stat_ok; } static isl_stat 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 isl_stat_ok; } /* 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.4/isl/mp_get_memory_functions.c0000644000175000017500000000056512413256472015532 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.4/isl/missing0000755000175000017500000001533012413256716012027 00000000000000#! /bin/sh # Common wrapper for a few potentially missing GNU programs. scriptversion=2013-10-28.13; # UTC # Copyright (C) 1996-2013 Free Software Foundation, Inc. # Originally written 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 case $1 in --is-lightweight) # Used by our autoconf macros to check whether the available missing # script is modern enough. exit 0 ;; --run) # Back-compat with the calling convention used by older automake. shift ;; -h|--h|--he|--hel|--help) echo "\ $0 [OPTION]... PROGRAM [ARGUMENT]... Run 'PROGRAM [ARGUMENT]...', returning a proper advice when this fails due to PROGRAM being missing or too old. Options: -h, --help display this help and exit -v, --version output version information and exit Supported PROGRAM values: aclocal autoconf autoheader autom4te automake makeinfo bison yacc flex lex help2man 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 # Run the given program, remember its exit status. "$@"; st=$? # If it succeeded, we are done. test $st -eq 0 && exit 0 # Also exit now if we it failed (or wasn't found), and '--version' was # passed; such an option is passed most likely to detect whether the # program is present and works. case $2 in --version|--help) exit $st;; esac # Exit code 63 means version mismatch. This often happens when the user # tries to use an ancient version of a tool on a file that requires a # minimum version. if test $st -eq 63; then msg="probably too old" elif test $st -eq 127; then # Program was missing. msg="missing on your system" else # Program was found and executed, but failed. Give up. exit $st fi perl_URL=http://www.perl.org/ flex_URL=http://flex.sourceforge.net/ gnu_software_URL=http://www.gnu.org/software program_details () { case $1 in aclocal|automake) echo "The '$1' program is part of the GNU Automake package:" echo "<$gnu_software_URL/automake>" echo "It also requires GNU Autoconf, GNU m4 and Perl in order to run:" echo "<$gnu_software_URL/autoconf>" echo "<$gnu_software_URL/m4/>" echo "<$perl_URL>" ;; autoconf|autom4te|autoheader) echo "The '$1' program is part of the GNU Autoconf package:" echo "<$gnu_software_URL/autoconf/>" echo "It also requires GNU m4 and Perl in order to run:" echo "<$gnu_software_URL/m4/>" echo "<$perl_URL>" ;; esac } give_advice () { # Normalize program name to check for. normalized_program=`echo "$1" | sed ' s/^gnu-//; t s/^gnu//; t s/^g//; t'` printf '%s\n' "'$1' is $msg." configure_deps="'configure.ac' or m4 files included by 'configure.ac'" case $normalized_program in autoconf*) echo "You should only need it if you modified 'configure.ac'," echo "or m4 files included by it." program_details 'autoconf' ;; autoheader*) echo "You should only need it if you modified 'acconfig.h' or" echo "$configure_deps." program_details 'autoheader' ;; automake*) echo "You should only need it if you modified 'Makefile.am' or" echo "$configure_deps." program_details 'automake' ;; aclocal*) echo "You should only need it if you modified 'acinclude.m4' or" echo "$configure_deps." program_details 'aclocal' ;; autom4te*) echo "You might have modified some maintainer files that require" echo "the 'autom4te' program to be rebuilt." program_details 'autom4te' ;; bison*|yacc*) echo "You should only need it if you modified a '.y' file." echo "You may want to install the GNU Bison package:" echo "<$gnu_software_URL/bison/>" ;; lex*|flex*) echo "You should only need it if you modified a '.l' file." echo "You may want to install the Fast Lexical Analyzer package:" echo "<$flex_URL>" ;; help2man*) echo "You should only need it if you modified a dependency" \ "of a man page." echo "You may want to install the GNU Help2man package:" echo "<$gnu_software_URL/help2man/>" ;; makeinfo*) echo "You should only need it if you modified a '.texi' file, or" echo "any other file indirectly affecting the aspect of the manual." echo "You might want to install the Texinfo package:" echo "<$gnu_software_URL/texinfo/>" echo "The spurious makeinfo call might also be the consequence of" echo "using a buggy 'make' (AIX, DU, IRIX), in which case you might" echo "want to install GNU make:" echo "<$gnu_software_URL/make/>" ;; *) echo "You might have modified some files without having the proper" echo "tools for further handling them. Check the 'README' file, it" echo "often tells you about the needed prerequisites for installing" echo "this package. You may also peek at any GNU archive site, in" echo "case some other package contains this missing '$1' program." ;; esac } give_advice "$1" | sed -e '1s/^/WARNING: /' \ -e '2,$s/^/ /' >&2 # Propagate the correct exit status (expected to be 127 for a program # not found, 63 for a program that failed due to version mismatch). exit $st # 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.4/isl/configure0000755000175000017500000243140312555106676012352 00000000000000#! /bin/sh # Guess values for system-dependent variables and create Makefiles. # Generated by GNU Autoconf 2.69 for isl 0.15. # # Report bugs to . # # # Copyright (C) 1992-1996, 1998-2012 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 # Use a proper internal environment variable to ensure we don't fall # into an infinite loop, continuously re-executing ourselves. if test x"${_as_can_reexec}" != xno && test "x$CONFIG_SHELL" != x; then _as_can_reexec=no; export _as_can_reexec; # 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 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+"$@"} # Admittedly, this is quite paranoid, since all the known shells bail # out after a failed `exec'. $as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2 as_fn_exit 255 fi # We don't want this to propagate to other subprocesses. { _as_can_reexec=; unset _as_can_reexec;} 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 test -x / || 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 : export CONFIG_SHELL # 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 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+"$@"} # Admittedly, this is quite paranoid, since all the known shells bail # out after a failed `exec'. $as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2 exit 255 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_executable_p FILE # ----------------------- # Test if FILE is an executable regular file. as_fn_executable_p () { test -f "$1" && test -x "$1" } # as_fn_executable_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; } # If we had to re-execute with $CONFIG_SHELL, we're ensured to have # already done that, so ensure we don't try to do so again and fall # in an infinite loop. This has already happened in practice. _as_can_reexec=no; export _as_can_reexec # 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 -pR'. ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || as_ln_s='cp -pR' elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -pR' fi else as_ln_s='cp -pR' 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 as_test_x='test -x' as_executable_p=as_fn_executable_p # 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.15' PACKAGE_STRING='isl 0.15' 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 GMP_FOR_MP_FALSE GMP_FOR_MP_TRUE IMATH_FOR_MP_FALSE IMATH_FOR_MP_TRUE NEED_GET_MEMORY_FUNCTIONS_FALSE NEED_GET_MEMORY_FUNCTIONS_TRUE MP_LIBS MP_LDFLAGS MP_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_int with_gmp with_gmp_prefix with_gmp_exec_prefix with_gmp_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 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.15 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.15:";; 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") --enable-dependency-tracking do not reject slow dependency extractors --disable-dependency-tracking speeds up one-time build --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-int=gmp|imath Which package to use to represent multi-precision integers [default=gmp] --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-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.15 generated by GNU Autoconf 2.69 Copyright (C) 2012 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 || 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 || 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 test_array [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 test_array [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 test_array [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 test_array [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 test_array [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_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.15, which was generated by GNU Autoconf 2.69. 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.14' # 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 as_fn_executable_p "$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; } # 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 ( am_has_slept=no for am_try in 1 2; do echo "timestamp, slept: $am_has_slept" > conftest.file 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 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 if test "$2" = conftest.file || test $am_try -eq 2; then break fi # Just in case. sleep 1 am_has_slept=yes done 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; } # If we didn't sleep, we still need to ensure time stamps of config.status and # generated files are strictly newer. am_sleep_pid= if grep 'slept: no' conftest.file >/dev/null 2>&1; then ( sleep 1 ) & am_sleep_pid=$! fi rm -f conftest.file 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 --is-lightweight"; then am_missing_run="$MISSING " 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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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; } 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 as_fn_executable_p "$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 # 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=1;; 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='\' 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.15' 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"} # For better backward compatibility. To be removed once Automake 1.9.x # dies out for good. For more background, see: # # mkdir_p='$(MKDIR_P)' # 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}' # We'll loop over all known methods to create a tar archive until one works. _am_tools='gnutar pax cpio none' am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -' # POSIX will say in a future version that running "rm -f" with no argument # is OK; and we want to be able to make that assumption in our Makefile # recipes. So use an aggressive probe to check that the usage we want is # actually supported "in the wild" to an acceptable degree. # See automake bug#10828. # To make any issue more visible, cause the running configure to be aborted # by default if the 'rm' program in use doesn't match our expectations; the # user can still override this though. if rm -f && rm -fr && rm -rf; then : OK; else cat >&2 <<'END' Oops! Your 'rm' program seems unable to run without file operands specified on the command line, even when the '-f' option is present. This is contrary to the behaviour of most rm programs out there, and not conforming with the upcoming POSIX standard: Please tell bug-automake@gnu.org about your system, including the value of your $PATH and any error possibly output before this message. This can help us improve future automake versions. END if test x"$ACCEPT_INFERIOR_RM_PROGRAM" = x"yes"; then echo 'Configuration will proceed anyway, since you have set the' >&2 echo 'ACCEPT_INFERIOR_RM_PROGRAM variable to "yes"' >&2 echo >&2 else cat >&2 <<'END' Aborting the configuration process, to ensure you take notice of the issue. You can download and install GNU coreutils to get an 'rm' implementation that behaves properly: . If you want to complete the configuration process using your problematic 'rm' anyway, export the environment variable ACCEPT_INFERIOR_RM_PROGRAM to "yes", and re-run configure. END as_fn_error $? "Your 'rm' program is bad, sorry." "$LINENO" 5 fi fi # 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=15:0:0 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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 struct stat; /* 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 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 whether $CC understands -c and -o together" >&5 $as_echo_n "checking whether $CC understands -c and -o together... " >&6; } if ${am_cv_prog_cc_c_o+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF # Make sure it works both with $CC and with simple cc. # Following AC_PROG_CC_C_O, we do the test twice because some # compilers refuse to overwrite an existing .o file with -o, # though they will create one. am_cv_prog_cc_c_o=yes for am_i in 1 2; do if { echo "$as_me:$LINENO: $CC -c conftest.$ac_ext -o conftest2.$ac_objext" >&5 ($CC -c conftest.$ac_ext -o conftest2.$ac_objext) >&5 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } \ && test -f conftest2.$ac_objext; then : OK else am_cv_prog_cc_c_o=no break fi done rm -f core conftest* unset am_i fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_prog_cc_c_o" >&5 $as_echo "$am_cv_prog_cc_c_o" >&6; } if test "$am_cv_prog_cc_c_o" != yes; then # Losing compiler, so override with the script. # FIXME: It is wrong to rewrite CC. # But if we don't then we get into trouble of one sort or another. # A longer-term fix would be to have automake use am__CC in this case, # and then we could set am__CC="\$(top_srcdir)/compile \$(CC)" CC="$am_aux_dir/compile $CC" 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 10 /bin/sh. echo '/* dummy */' > 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 as_fn_executable_p "$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 as_fn_executable_p "$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 10 /bin/sh. echo '/* dummy */' > 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 as_fn_executable_p "$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' macro_revision='1.3337' 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" as_fn_executable_p "$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" as_fn_executable_p "$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" as_fn_executable_p "$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" as_fn_executable_p "$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 "$withval" = no || with_gnu_ld=yes else with_gnu_ld=no fi ac_prog=ld if test "$GCC" = yes; 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 "$with_gnu_ld" = yes; 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 ;; *) case `"$tmp_nm" -p /dev/null 2>&1 | sed '1q'` in */dev/null*) lt_cv_path_NM="$tmp_nm -p" break ;; *) 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 "$lt_cv_path_NM" != "no"; 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 as_fn_executable_p "$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 as_fn_executable_p "$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 /dev/null 2>&1 | sed '1q'` in *COFF*) DUMPBIN="$DUMPBIN -symbols" ;; *) 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; ;; netbsd* | freebsd* | openbsd* | darwin* | dragonfly*) # 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 $i != 17 # 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"} { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the shell understands some XSI constructs" >&5 $as_echo_n "checking whether the shell understands some XSI constructs... " >&6; } # Try some XSI features xsi_shell=no ( _lt_dummy="a/b/c" test "${_lt_dummy##*/},${_lt_dummy%/*},${_lt_dummy#??}"${_lt_dummy%"$_lt_dummy"}, \ = c,a/b,b/c, \ && eval 'test $(( 1 + 1 )) -eq 2 \ && test "${#_lt_dummy}" -eq 5' ) >/dev/null 2>&1 \ && xsi_shell=yes { $as_echo "$as_me:${as_lineno-$LINENO}: result: $xsi_shell" >&5 $as_echo "$xsi_shell" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the shell understands \"+=\"" >&5 $as_echo_n "checking whether the shell understands \"+=\"... " >&6; } lt_shell_append=no ( foo=bar; set foo baz; eval "$1+=\$2" && test "$foo" = barbaz ) \ >/dev/null 2>&1 \ && lt_shell_append=yes { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_shell_append" >&5 $as_echo "$lt_shell_append" >&6; } 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 "$GCC" != yes; then reload_cmds=false fi ;; darwin*) if test "$GCC" = yes; 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 as_fn_executable_p "$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 as_fn_executable_p "$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 # which 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. # func_win32_libid assumes BSD nm, so disallow it if using MS dumpbin. if ( test "$lt_cv_nm_interface" = "BSD nm" && 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* | netbsdelf*-gnu) 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*) if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; 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 as_fn_executable_p "$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 as_fn_executable_p "$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 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 as_fn_executable_p "$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 as_fn_executable_p "$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 "$ac_status" -eq 0; 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 "$ac_status" -ne 0; 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 "x$lt_cv_ar_at_file" = xno; 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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 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 "$host_cpu" = ia64; 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 # 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 -e 's/^T .* \(.*\)$/extern int \1();/p' -e 's/^$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 -e 's/^: \([^ ]*\)[ ]*$/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([^ ]*\) \([^ ]*\)$/ {\"\2\", (void *) \&\2},/p'" lt_cv_sys_global_symbol_to_c_name_address_lib_prefix="sed -n -e 's/^: \([^ ]*\)[ ]*$/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([^ ]*\) \(lib[^ ]*\)$/ {\"\2\", (void *) \&\2},/p' -e 's/^$symcode* \([^ ]*\) \([^ ]*\)$/ {\"lib\2\", (void *) \&\2},/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 # and D for any global 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};"\ " \$ 0!~/External *\|/{next};"\ " / 0+ UNDEF /{next}; / UNDEF \([^|]\)*()/{next};"\ " {if(hide[section]) next};"\ " {f=0}; \$ 0~/\(\).*\|/{f=1}; {printf f ? \"T \" : \"D \"};"\ " {split(\$ 0, a, /\||\r/); split(a[2], s)};"\ " s[1]~/^[@?]/{print s[1], s[1]; next};"\ " s[1]~prfx {split(s[1],t,\"@\"); print 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 con'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* \(.*\) \(.*\)$/ {\"\2\", (void *) \&\2},/" < "$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 "$pipe_works" = yes; 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 "$GCC" = yes; 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 "x$enable_libtool_lock" != xno && 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 which ABI we are using. 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 which ABI we are using. 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 "$lt_cv_prog_gnu_ld" = yes; 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* ;; x86_64-*kfreebsd*-gnu|x86_64-*linux*|powerpc*-*linux*| \ s390*-*linux*|s390*-*tpf*|sparc*-*linux*) # Find out which ABI we are using. 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-*) LD="${LD-ld} -m elf32lppclinux" ;; powerpc64-*) 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-*) LD="${LD-ld} -m elf64lppc" ;; powerpc-*) 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 x"$lt_cv_cc_needs_belf" != x"yes"; then # this is probably gcc 2.8.0, egcs 1.0 or newer; no need for -belf CFLAGS="$SAVE_CFLAGS" fi ;; *-*solaris*) # Find out which ABI we are using. 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*) 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 as_fn_executable_p "$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 as_fn_executable_p "$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 "x$lt_cv_path_mainfest_tool" != xyes; 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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 $_lt_result -eq 0; 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 $_lt_result -eq 0 && $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 "$lt_cv_apple_cc_single_mod" = "yes"; then _lt_dar_single_mod='$single_module' fi if test "$lt_cv_ld_exported_symbols_list" = "yes"; 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 "$lt_cv_ld_force_load" = "no"; 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 test -z "$pic_mode" && pic_mode=default # 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 "X${COLLECT_NAMES+set}" != Xset; 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 "$GCC" = yes; 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" # 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 x"$lt_cv_prog_compiler_rtti_exceptions" = xyes; 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 "$GCC" = yes; then lt_prog_compiler_wl='-Wl,' lt_prog_compiler_static='-static' case $host_os in aix*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static='-Bstatic' fi ;; 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 "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static='-Bstatic' else lt_prog_compiler_static='-bnso -bI:/lib/syscalls.exp' fi ;; 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' ;; 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 which 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" # 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 x"$lt_cv_prog_compiler_pic_works" = xyes; 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 x"$lt_cv_prog_compiler_static_works" = xyes; 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 "$lt_cv_prog_compiler_c_o" = no && test "$need_locks" != no; 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 "$hard_links" = no; 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 "$GCC" != yes; then with_gnu_ld=no fi ;; interix*) # we just hope/assume this is gcc and not c89 (= MSVC++) with_gnu_ld=yes ;; openbsd*) with_gnu_ld=no ;; linux* | k*bsd*-gnu | gnu*) link_all_deplibs=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 "$with_gnu_ld" = yes; 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 "$lt_use_gnu_ld_interface" = yes; 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 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 "$host_cpu" != ia64; 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 (1st line # is EXPORTS), use it as is; otherwise, prepend... archive_expsym_cmds='if test "x`$SED 1q $export_symbols`" = xEXPORTS; 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 "$host_os" = linux-dietlibc; 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 "$tmp_diet" = no 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' ;; 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 "x$supports_anon_versioning" = xyes; 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 "x$supports_anon_versioning" = xyes; 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* | netbsdelf*-gnu) 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 can not *** 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 "$ld_shlibs" = no; 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 "$GCC" = yes && 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 "$host_cpu" = ia64; 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 $ld_flag = "-brtl" || test $ld_flag = "-Wl,-brtl"); 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 "$GCC" = yes; 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 "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi link_all_deplibs=no else # not using gcc if test "$host_cpu" = ia64; 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 "$aix_use_runtimelinking" = yes; 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 "$aix_use_runtimelinking" = yes; 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 "${lt_cv_aix_libpath+set}" = 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 "x${allow_undefined_flag}" != "x"; then func_echo_all "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; 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 "${lt_cv_aix_libpath+set}" = 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 "$with_gnu_ld" = yes; 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~linknames=' archive_expsym_cmds='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then sed -n -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' -e '1\\\!p' < $export_symbols > $output_objdir/$soname.exp; else sed -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' < $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 "$lt_cv_ld_force_load" = "yes"; 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*) _lt_dar_can_shared=yes ;; *) _lt_dar_can_shared=$GCC ;; esac if test "$_lt_dar_can_shared" = "yes"; 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 "$GCC" = yes; 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 $output_objdir/$soname = $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 $output_objdir/$soname = $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 "$GCC" = yes && test "$with_gnu_ld" = no; 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 "$with_gnu_ld" = no; 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 "$GCC" = yes && test "$with_gnu_ld" = no; 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 x"$lt_cv_prog_compiler__b" = xyes; 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 "$with_gnu_ld" = no; 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 "$GCC" = yes; 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 "$lt_cv_irix_exported_symbol" = yes; 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* | netbsdelf*-gnu) 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*) 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__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; 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 case $host_os in openbsd[01].* | openbsd2.[0-7] | openbsd2.[0-7].*) archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec='-R$libdir' ;; *) archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' hardcode_libdir_flag_spec='${wl}-rpath,$libdir' ;; esac 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 "$GCC" = yes; 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 "$GCC" = yes; 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 "$GCC" = yes; 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 "$GCC" = yes; 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 "x$host_vendor" = xsequent; 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 "$GCC" = yes; 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 can NOT 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 "$GCC" = yes; 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 x$host_vendor = xsni; 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 "$ld_shlibs" = no && 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 "$enable_shared" = yes && test "$GCC" = yes; 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 "$GCC" = yes; 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` 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" else 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 "$host_cpu" = ia64; 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 can not hardcode correct # soname into executable. Probably we can add versioning support to # collect2, so additional links can be useful in future. if test "$aix_use_runtimelinking" = yes; 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%'\''`; test $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=yes 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 "X$HPUX_IA64_MODE" = X32; 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 "$lt_cv_prog_gnu_ld" = yes; 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 ;; # 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' ;; netbsdelf*-gnu) version_type=linux 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='NetBSD ld.elf_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*) version_type=sunos sys_lib_dlsearch_path_spec="/usr/lib" need_lib_prefix=no # Some older versions of OpenBSD (3.3 at least) *do* need versioned libs. case $host_os in openbsd3.3 | openbsd3.3.*) need_version=yes ;; *) need_version=no ;; esac 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 if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then case $host_os in openbsd2.[89] | openbsd2.[89].*) shlibpath_overrides_runpath=no ;; *) shlibpath_overrides_runpath=yes ;; esac else shlibpath_overrides_runpath=yes fi ;; 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 "$with_gnu_ld" = yes; 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 "$with_gnu_ld" = yes; 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 "$dynamic_linker" = no && can_build_shared=no variables_saved_for_relink="PATH $shlibpath_var $runpath_var" if test "$GCC" = yes; then variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH" fi if test "${lt_cv_sys_lib_search_path_spec+set}" = set; then sys_lib_search_path_spec="$lt_cv_sys_lib_search_path_spec" fi if test "${lt_cv_sys_lib_dlsearch_path_spec+set}" = 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 "X$hardcode_automatic" = "Xyes" ; then # We can hardcode non-existent directories. if test "$hardcode_direct" != no && # 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 "$_LT_TAGVAR(hardcode_shlibpath_var, )" != no && test "$hardcode_minus_L" != no; 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 "$hardcode_action" = relink || test "$inherit_rpath" = yes; then # Fast installation is not supported enable_fast_install=no elif test "$shlibpath_overrides_runpath" = yes || test "$enable_shared" = no; then # Fast installation is not necessary enable_fast_install=needless fi if test "x$enable_dlopen" != xyes; 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 ;; *) 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 "x$lt_cv_dlopen" != xno; then enable_dlopen=yes else enable_dlopen=no fi case $lt_cv_dlopen in dlopen) save_CPPFLAGS="$CPPFLAGS" test "x$ac_cv_header_dlfcn_h" = xyes && 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 "$cross_compiling" = yes; 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 "x$lt_cv_dlopen_self" = xyes; 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 "$cross_compiling" = yes; 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 which 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 "$can_build_shared" = "no" && 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 "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[4-9]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && 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 "$enable_shared" = yes || 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 "X$CXX" != "Xno" && ( (test "X$CXX" = "Xg++" && `g++ -v >/dev/null 2>&1` ) || (test "X$CXX" != "Xg++"))) ; 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 "$_lt_caught_CXX_error" != yes; 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 "$GXX" = yes; then lt_prog_compiler_no_builtin_flag_CXX=' -fno-builtin' else lt_prog_compiler_no_builtin_flag_CXX= fi if test "$GXX" = yes; 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 "$withval" = no || with_gnu_ld=yes else with_gnu_ld=no fi ac_prog=ld if test "$GCC" = yes; 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 "$with_gnu_ld" = yes; 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 "$with_gnu_ld" = yes; 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 "$host_cpu" = ia64; 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 "$GXX" = yes; 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 "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi else # not using gcc if test "$host_cpu" = ia64; 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 "$aix_use_runtimelinking" = yes; 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 "$aix_use_runtimelinking" = yes; 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 "${lt_cv_aix_libpath+set}" = 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 "x${allow_undefined_flag}" != "x"; then func_echo_all "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; 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 "${lt_cv_aix_libpath+set}" = 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 "$with_gnu_ld" = yes; 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~linknames=' archive_expsym_cmds_CXX='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then $SED -n -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' -e '1\\\!p' < $export_symbols > $output_objdir/$soname.exp; else $SED -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' < $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 (1st line # is EXPORTS), use it as is; otherwise, prepend... archive_expsym_cmds_CXX='if test "x`$SED 1q $export_symbols`" = xEXPORTS; 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 "$lt_cv_ld_force_load" = "yes"; 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*) _lt_dar_can_shared=yes ;; *) _lt_dar_can_shared=$GCC ;; esac if test "$_lt_dar_can_shared" = "yes"; 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 "$lt_cv_apple_cc_single_mod" != "yes"; 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 $output_objdir/$soname = $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 "$GXX" = yes; 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 $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' else # FIXME: insert proper C++ library support ld_shlibs_CXX=no fi ;; esac ;; hpux10*|hpux11*) if test $with_gnu_ld = no; 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 "$GXX" = yes; then if test $with_gnu_ld = no; 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 "$GXX" = yes; then if test "$with_gnu_ld" = no; 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 "x$supports_anon_versioning" = xyes; 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 ;; openbsd2*) # C++ shared libraries are fairly broken ld_shlibs_CXX=no ;; openbsd*) 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__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; 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 "$GXX" = yes && test "$with_gnu_ld" = no; 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 "$GXX" = yes && test "$with_gnu_ld" = no; 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 $LDFLAGS $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 -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 $LDFLAGS $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 -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 can NOT 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 "$ld_shlibs_CXX" = no && 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 $p = "-L" || test $p = "-R"; 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 "$pre_test_object_deps_done" = no; 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 "$pre_test_object_deps_done" = no; 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 "$solaris_use_stlport4" != yes; 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 "$solaris_use_stlport4" != yes; 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 "$GXX" = yes; 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 "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static_CXX='-Bstatic' fi ;; 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 "$host_cpu" = ia64; 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 "$host_cpu" != ia64; 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* | netbsdelf*-gnu) ;; *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 which 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" # 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 x"$lt_cv_prog_compiler_pic_works_CXX" = xyes; 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 x"$lt_cv_prog_compiler_static_works_CXX" = xyes; 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 "$lt_cv_prog_compiler_c_o_CXX" = no && test "$need_locks" != no; 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 "$hard_links" = no; 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 ;; linux* | k*bsd*-gnu | gnu*) link_all_deplibs_CXX=no ;; *) 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 "$ld_shlibs_CXX" = no && 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 "$enable_shared" = yes && test "$GCC" = yes; 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 "$host_cpu" = ia64; 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 can not hardcode correct # soname into executable. Probably we can add versioning support to # collect2, so additional links can be useful in future. if test "$aix_use_runtimelinking" = yes; 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%'\''`; test $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=yes 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 "X$HPUX_IA64_MODE" = X32; 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 "$lt_cv_prog_gnu_ld" = yes; 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 ;; # 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' ;; netbsdelf*-gnu) version_type=linux 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='NetBSD ld.elf_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*) version_type=sunos sys_lib_dlsearch_path_spec="/usr/lib" need_lib_prefix=no # Some older versions of OpenBSD (3.3 at least) *do* need versioned libs. case $host_os in openbsd3.3 | openbsd3.3.*) need_version=yes ;; *) need_version=no ;; esac 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 if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then case $host_os in openbsd2.[89] | openbsd2.[89].*) shlibpath_overrides_runpath=no ;; *) shlibpath_overrides_runpath=yes ;; esac else shlibpath_overrides_runpath=yes fi ;; 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 "$with_gnu_ld" = yes; 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 "$with_gnu_ld" = yes; 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 "$dynamic_linker" = no && can_build_shared=no variables_saved_for_relink="PATH $shlibpath_var $runpath_var" if test "$GCC" = yes; then variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH" fi if test "${lt_cv_sys_lib_search_path_spec+set}" = set; then sys_lib_search_path_spec="$lt_cv_sys_lib_search_path_spec" fi if test "${lt_cv_sys_lib_dlsearch_path_spec+set}" = 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 "X$hardcode_automatic_CXX" = "Xyes" ; then # We can hardcode non-existent directories. if test "$hardcode_direct_CXX" != no && # 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 "$_LT_TAGVAR(hardcode_shlibpath_var, CXX)" != no && test "$hardcode_minus_L_CXX" != no; 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 "$hardcode_action_CXX" = relink || test "$inherit_rpath_CXX" = yes; then # Fast installation is not supported enable_fast_install=no elif test "$shlibpath_overrides_runpath" = yes || test "$enable_shared" = no; 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 "$_lt_caught_CXX_error" != yes 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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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-int was given. if test "${with_int+set}" = set; then : withval=$with_int; else with_int=gmp fi case "$with_int" in gmp|imath) ;; *) as_fn_error $? "bad value ${withval} for --with-int (use gmp or imath)" "$LINENO" 5 esac case "$with_int" in gmp) $as_echo "#define USE_GMP_FOR_MP /**/" >>confdefs.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" MP_CPPFLAGS="-I$with_gmp_prefix/include" MP_LDFLAGS="-L$with_gmp_prefix/lib" fi MP_LIBS=-lgmp SAVE_CPPFLAGS="$CPPFLAGS" SAVE_LDFLAGS="$LDFLAGS" SAVE_LIBS="$LIBS" CPPFLAGS="$MP_CPPFLAGS $CPPFLAGS" LDFLAGS="$MP_LDFLAGS $LDFLAGS" LIBS="$MP_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) MP_CPPFLAGS="-I$gmp_srcdir -I$with_gmp_builddir" MP_LIBS="$with_gmp_builddir/libgmp.la" ;; esac SAVE_CPPFLAGS="$CPPFLAGS" SAVE_LDFLAGS="$LDFLAGS" SAVE_LIBS="$LIBS" CPPFLAGS="$MP_CPPFLAGS $CPPFLAGS" LDFLAGS="$MP_LDFLAGS $LDFLAGS" LIBS="$MP_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 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 ;; imath) $as_echo "#define USE_IMATH_FOR_MP /**/" >>confdefs.h MP_CPPFLAGS="-I$srcdir/imath_wrap" MP_LDFLAGS="" MP_LIBS="" SAVE_CPPFLAGS="$CPPFLAGS" CPPFLAGS="$MP_CPPFLAGS $CPPFLAGS" ac_fn_c_check_header_mongrel "$LINENO" "imath.h" "ac_cv_header_imath_h" "$ac_includes_default" if test "x$ac_cv_header_imath_h" = xyes; then : else as_fn_error $? "imath.h header not found" "$LINENO" 5 fi ac_fn_c_check_header_mongrel "$LINENO" "gmp_compat.h" "ac_cv_header_gmp_compat_h" "$ac_includes_default" if test "x$ac_cv_header_gmp_compat_h" = xyes; then : else as_fn_error $? "gmp_compat.h header not found" "$LINENO" 5 fi CPPFLAGS="$SAVE_CPPFLAGS" if test x = xfalse; then NEED_GET_MEMORY_FUNCTIONS_TRUE= NEED_GET_MEMORY_FUNCTIONS_FALSE='#' else NEED_GET_MEMORY_FUNCTIONS_TRUE='#' NEED_GET_MEMORY_FUNCTIONS_FALSE= fi ;; esac if test x$with_int = ximath; then IMATH_FOR_MP_TRUE= IMATH_FOR_MP_FALSE='#' else IMATH_FOR_MP_TRUE='#' IMATH_FOR_MP_FALSE= fi if test x$with_int = xgmp; then GMP_FOR_MP_TRUE= GMP_FOR_MP_FALSE='#' else GMP_FOR_MP_TRUE='#' GMP_FOR_MP_FALSE= fi ac_fn_c_check_decl "$LINENO" "ffs" "ac_cv_have_decl_ffs" "#include " if test "x$ac_cv_have_decl_ffs" = xyes; then : ac_have_decl=1 else ac_have_decl=0 fi cat >>confdefs.h <<_ACEOF #define HAVE_DECL_FFS $ac_have_decl _ACEOF ac_fn_c_check_decl "$LINENO" "__builtin_ffs" "ac_cv_have_decl___builtin_ffs" "$ac_includes_default" if test "x$ac_cv_have_decl___builtin_ffs" = xyes; then : ac_have_decl=1 else ac_have_decl=0 fi cat >>confdefs.h <<_ACEOF #define HAVE_DECL___BUILTIN_FFS $ac_have_decl _ACEOF # 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" as_fn_executable_p "$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 as_fn_executable_p "$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` systemlibs=`$llvm_config --system-libs 2> /dev/null | tail -1` if test $? -eq 0; then CLANG_LIBS="$CLANG_LIBS $systemlibs" fi 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 int main () { using namespace clang; DiagnosticsEngine *Diags; new driver::Driver("", "", "", *Diags); ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : $as_echo "#define DRIVER_CTOR_TAKES_DEFAULTIMAGENAME /**/" >>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 _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; std::shared_ptr TO; DiagnosticsEngine *Diags; TargetInfo::CreateTargetInfo(*Diags, TO); ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : $as_echo "#define CREATETARGETINFO_TAKES_SHARED_PTR /**/" >>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; 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 cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "getNumParams" >/dev/null 2>&1; then : $as_echo "#define getNumArgs getNumParams" >>confdefs.h $as_echo "#define getArgType getParamType" >>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 "getReturnType" >/dev/null 2>&1; then : else $as_echo "#define getReturnType getResultType" >>confdefs.h fi rm -f conftest* cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { using namespace clang; CompilerInstance *Clang; Clang->createPreprocessor(TU_Complete); ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : $as_echo "#define CREATEPREPROCESSOR_TAKES_TUKIND /**/" >>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 _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "setMainFileID" >/dev/null 2>&1; then : $as_echo "#define HAVE_SETMAINFILEID /**/" >>confdefs.h fi rm -f conftest* ac_fn_cxx_check_header_mongrel "$LINENO" "llvm/ADT/OwningPtr.h" "ac_cv_header_llvm_ADT_OwningPtr_h" "$ac_includes_default" if test "x$ac_cv_header_llvm_ADT_OwningPtr_h" = xyes; then : $as_echo "#define HAVE_ADT_OWNINGPTR_H /**/" >>confdefs.h 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 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="$MP_CPPFLAGS" PACKAGE_LDFLAGS="$MP_LDFLAGS" PACKAGE_LIBS="-lisl $MP_LIBS" # 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; then gitdir=`GIT_DIR=$srcdir/.git git rev-parse --git-dir` GIT_HEAD="$gitdir/index" GIT_REPO="$gitdir" GIT_HEAD_ID=`GIT_DIR=$GIT_REPO git describe --always` elif test -f $srcdir/.git/HEAD; then GIT_HEAD="$srcdir/.git/index" GIT_REPO="$srcdir/.git" GIT_HEAD_ID=`GIT_DIR=$GIT_REPO git describe --always` 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 --always\`" fi echo '#define GIT_HEAD_ID "'$GIT_HEAD_ID'"' > gitversion.h ac_config_headers="$ac_config_headers 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 { $as_echo "$as_me:${as_lineno-$LINENO}: checking that generated files are newer than configure" >&5 $as_echo_n "checking that generated files are newer than configure... " >&6; } if test -n "$am_sleep_pid"; then # Hide warnings about reused PIDs. wait $am_sleep_pid 2>/dev/null fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: done" >&5 $as_echo "done" >&6; } 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 "${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 "${IMATH_FOR_MP_TRUE}" && test -z "${IMATH_FOR_MP_FALSE}"; then as_fn_error $? "conditional \"IMATH_FOR_MP\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${GMP_FOR_MP_TRUE}" && test -z "${GMP_FOR_MP_FALSE}"; then as_fn_error $? "conditional \"GMP_FOR_MP\" 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 -pR'. ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || as_ln_s='cp -pR' elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -pR' fi else as_ln_s='cp -pR' 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 # as_fn_executable_p FILE # ----------------------- # Test if FILE is an executable regular file. as_fn_executable_p () { test -f "$1" && test -x "$1" } # as_fn_executable_p as_test_x='test -x' as_executable_p=as_fn_executable_p # 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.15, which was generated by GNU Autoconf 2.69. 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.15 configured by $0, generated by GNU Autoconf 2.69, with options \\"\$ac_cs_config\\" Copyright (C) 2012 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_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"`' 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_c_name_address \ lt_cv_sys_global_symbol_to_c_name_address_lib_prefix \ 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\\"\\\`\\\\\\"" ;; *) 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\\"\\\`\\\\\\"" ;; *) eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\"" ;; esac done ac_aux_dir='$ac_aux_dir' xsi_shell='$xsi_shell' lt_shell_append='$lt_shell_append' # See if we are running on zsh, and set the options which 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' TIMESTAMP='$TIMESTAMP' 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" ;; "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"" || { # Older Autoconf 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"` # 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'`; 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 which 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$TIMESTAMP) $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 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 # 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 in which 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 "X${COLLECT_NAMES+set}" != Xset; 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) if test x"$xsi_shell" = xyes; then sed -e '/^func_dirname ()$/,/^} # func_dirname /c\ func_dirname ()\ {\ \ case ${1} in\ \ */*) func_dirname_result="${1%/*}${2}" ;;\ \ * ) func_dirname_result="${3}" ;;\ \ esac\ } # Extended-shell func_dirname implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_basename ()$/,/^} # func_basename /c\ func_basename ()\ {\ \ func_basename_result="${1##*/}"\ } # Extended-shell func_basename implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_dirname_and_basename ()$/,/^} # func_dirname_and_basename /c\ func_dirname_and_basename ()\ {\ \ case ${1} in\ \ */*) func_dirname_result="${1%/*}${2}" ;;\ \ * ) func_dirname_result="${3}" ;;\ \ esac\ \ func_basename_result="${1##*/}"\ } # Extended-shell func_dirname_and_basename implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_stripname ()$/,/^} # func_stripname /c\ func_stripname ()\ {\ \ # pdksh 5.2.14 does not do ${X%$Y} correctly if both X and Y are\ \ # positional parameters, so assign one to ordinary parameter first.\ \ func_stripname_result=${3}\ \ func_stripname_result=${func_stripname_result#"${1}"}\ \ func_stripname_result=${func_stripname_result%"${2}"}\ } # Extended-shell func_stripname implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_split_long_opt ()$/,/^} # func_split_long_opt /c\ func_split_long_opt ()\ {\ \ func_split_long_opt_name=${1%%=*}\ \ func_split_long_opt_arg=${1#*=}\ } # Extended-shell func_split_long_opt implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_split_short_opt ()$/,/^} # func_split_short_opt /c\ func_split_short_opt ()\ {\ \ func_split_short_opt_arg=${1#??}\ \ func_split_short_opt_name=${1%"$func_split_short_opt_arg"}\ } # Extended-shell func_split_short_opt implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_lo2o ()$/,/^} # func_lo2o /c\ func_lo2o ()\ {\ \ case ${1} in\ \ *.lo) func_lo2o_result=${1%.lo}.${objext} ;;\ \ *) func_lo2o_result=${1} ;;\ \ esac\ } # Extended-shell func_lo2o implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_xform ()$/,/^} # func_xform /c\ func_xform ()\ {\ func_xform_result=${1%.*}.lo\ } # Extended-shell func_xform implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_arith ()$/,/^} # func_arith /c\ func_arith ()\ {\ func_arith_result=$(( $* ))\ } # Extended-shell func_arith implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_len ()$/,/^} # func_len /c\ func_len ()\ {\ func_len_result=${#1}\ } # Extended-shell func_len implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: fi if test x"$lt_shell_append" = xyes; then sed -e '/^func_append ()$/,/^} # func_append /c\ func_append ()\ {\ eval "${1}+=\\${2}"\ } # Extended-shell func_append implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_append_quoted ()$/,/^} # func_append_quoted /c\ func_append_quoted ()\ {\ \ func_quote_for_eval "${2}"\ \ eval "${1}+=\\\\ \\$func_quote_for_eval_result"\ } # Extended-shell func_append_quoted implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: # Save a `func_append' function call where possible by direct use of '+=' sed -e 's%func_append \([a-zA-Z_]\{1,\}\) "%\1+="%g' $cfgfile > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: else # Save a `func_append' function call even when '+=' is not available sed -e 's%func_append \([a-zA-Z_]\{1,\}\) "%\1="$\1%g' $cfgfile > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: fi if test x"$_lt_function_replace_fail" = x":"; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Unable to substitute extended shell functions in $ofile" >&5 $as_echo "$as_me: WARNING: Unable to substitute extended shell functions in $ofile" >&2;} fi 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.4/isl/isl_scan.h0000644000175000017500000000115112554427055012372 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 { isl_stat (*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.4/isl/isl_multi_apply_templ.c0000644000175000017500000000417712554427055015214 00000000000000/* * Copyright 2011 Sven Verdoolaege * Copyright 2012-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 /* Transform the elements of "multi" by applying "fn" to them * with extra argument "set". * * The parameters of "multi" and "set" are assumed to have been aligned. */ __isl_give MULTI(BASE) *FN(FN(MULTI(BASE),apply_aligned),APPLY_DOMBASE)( __isl_take MULTI(BASE) *multi, __isl_take APPLY_DOM *set, __isl_give EL *(*fn)(EL *el, __isl_take APPLY_DOM *set)) { int i; if (!multi || !set) goto error; if (multi->n == 0) { FN(APPLY_DOM,free)(set); return multi; } multi = FN(MULTI(BASE),cow)(multi); if (!multi) goto error; for (i = 0; i < multi->n; ++i) { multi->p[i] = fn(multi->p[i], FN(APPLY_DOM,copy)(set)); if (!multi->p[i]) goto error; } FN(APPLY_DOM,free)(set); return multi; error: FN(APPLY_DOM,free)(set); FN(MULTI(BASE),free)(multi); return NULL; } /* Transform the elements of "multi" by applying "fn" to them * with extra argument "set". * * Align the parameters if needed and call apply_set_aligned. */ static __isl_give MULTI(BASE) *FN(FN(MULTI(BASE),apply),APPLY_DOMBASE)( __isl_take MULTI(BASE) *multi, __isl_take APPLY_DOM *set, __isl_give EL *(*fn)(EL *el, __isl_take APPLY_DOM *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(FN(MULTI(BASE),apply_aligned),APPLY_DOMBASE)(multi, set, fn); 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, FN(APPLY_DOM,get_space)(set)); set = FN(APPLY_DOM,align_params)(set, FN(MULTI(BASE),get_space)(multi)); return FN(FN(MULTI(BASE),apply_aligned),APPLY_DOMBASE)(multi, set, fn); error: FN(MULTI(BASE),free)(multi); FN(APPLY_DOM,free)(set); return NULL; } cloog-0.18.4/isl/isl_ast_int.c0000644000175000017500000000057412413270107013076 00000000000000#include #include #include 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); } cloog-0.18.4/isl/isl_arg.c0000644000175000017500000006572712554427055012235 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) { if (arg->offset == (size_t) -1) return; *(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); } /* Data structure for collecting the prefixes of ancestor nodes. * * n is the number of prefixes. * prefix[i] for i < n is a prefix of an ancestor. * len[i] for i < n is the length of prefix[i]. */ struct isl_prefixes { int n; const char *prefix[10]; size_t len[10]; }; /* Add "prefix" to the list of prefixes and return the updated * number of prefixes. */ static int add_prefix(struct isl_prefixes *prefixes, const char *prefix) { int n = prefixes->n; if (!prefix) return n; if (prefixes->n >= 10) { fprintf(stderr, "too many prefixes\n"); exit(EXIT_FAILURE); } prefixes->len[prefixes->n] = strlen(prefix); prefixes->prefix[prefixes->n] = prefix; prefixes->n++; return n; } /* Drop all prefixes starting at "first". */ static void drop_prefix(struct isl_prefixes *prefixes, int first) { prefixes->n = first; } /* Print the prefixes in "prefixes". */ static int print_prefixes(struct isl_prefixes *prefixes) { int i; int len = 0; if (!prefixes) return 0; for (i = 0; i < prefixes->n; ++i) { printf("%s-", prefixes->prefix[i]); len += strlen(prefixes->prefix[i]) + 1; } return len; } /* Check if "name" starts with one or more of the prefixes in "prefixes", * starting at *first. If so, advance the pointer beyond the prefixes * and return the updated pointer. Additionally, update *first to * the index after the last prefix found. */ static const char *skip_prefixes(const char *name, struct isl_prefixes *prefixes, int *first) { int i; for (i = first ? *first : 0; i < prefixes->n; ++i) { size_t len = prefixes->len[i]; const char *prefix = prefixes->prefix[i]; if (strncmp(name, prefix, len) == 0 && name[len] == '-') { name += len + 1; if (first) *first = i + 1; } } return name; } static int print_arg_help(struct isl_arg *decl, struct isl_prefixes *prefixes, 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 (no) { printf("no-"); len += 3; } len += print_prefixes(prefixes); 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, ""); } 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, struct isl_prefixes *prefixes, void *opt) { int i; int pos; pos = print_arg_help(decl, prefixes, 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, ""); } 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, struct isl_prefixes *prefixes, void *opt) { int i, j; int pos; pos = print_arg_help(decl, prefixes, 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, struct isl_prefixes *prefixes, void *opt) { int pos; unsigned *p = opt ? (unsigned *)(((char *) opt) + decl->offset) : NULL; int no = p ? *p == 1 : 0; pos = print_arg_help(decl, prefixes, 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, struct isl_prefixes *prefixes, void *opt) { int pos; char val[20]; int *p = (int *)(((char *) opt) + decl->offset); pos = print_arg_help(decl, prefixes, 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, struct isl_prefixes *prefixes, void *opt) { int pos; long *p = (long *)(((char *) opt) + decl->offset); pos = print_arg_help(decl, prefixes, 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, struct isl_prefixes *prefixes) { int pos; pos = print_arg_help(decl, prefixes, 0); printf("=ulong"); pos += 6; print_help_msg(decl, pos); printf("\n"); } static void print_str_help(struct isl_arg *decl, struct isl_prefixes *prefixes, 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, prefixes, 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, struct isl_prefixes *prefixes) { int pos; const char *a = decl->argument_name ? decl->argument_name : "string"; pos = print_arg_help(decl, prefixes, 0); pos = print_argument_name(decl, a, pos); pos = print_help_msg(decl, pos); printf("\n"); } static void print_help(struct isl_arg *arg, struct isl_prefixes *prefixes, 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], prefixes, opt); any = 1; break; case isl_arg_choice: print_choice_help(&arg[i], prefixes, opt); any = 1; break; case isl_arg_bool: print_bool_help(&arg[i], prefixes, opt); any = 1; break; case isl_arg_int: print_int_help(&arg[i], prefixes, opt); any = 1; break; case isl_arg_long: print_long_help(&arg[i], prefixes, opt); any = 1; break; case isl_arg_ulong: print_ulong_help(&arg[i], prefixes); any = 1; break; case isl_arg_str: print_str_help(&arg[i], prefixes, opt); any = 1; break; case isl_arg_str_list: print_str_list_help(&arg[i], prefixes); 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; int first; 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); first = add_prefix(prefixes, arg[i].long_name); print_help(arg[i].u.child.child->args, prefixes, child); drop_prefix(prefixes, first); 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; struct isl_prefixes prefixes = { 0 }; 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, &prefixes, 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, struct isl_prefixes *prefixes, 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); name = skip_prefixes(name, prefixes, NULL); 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, struct isl_prefixes *prefixes, void *opt) { int i; int has_argument; const char *choice; choice = skip_name(decl, arg[0], prefixes, 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, struct isl_prefixes *prefixes, void *opt) { int has_argument; const char *flags; const char *comma; unsigned val; flags = skip_name(decl, arg[0], prefixes, 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, struct isl_prefixes *prefixes, void *opt) { const char *name; unsigned *p = (unsigned *)(((char *)opt) + decl->offset); int next_prefix; if (skip_name(decl, arg[0], prefixes, 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; next_prefix = 0; name = skip_prefixes(name, prefixes, &next_prefix); if (strncmp(name, "no-", 3)) return 0; name += 3; name = skip_prefixes(name, prefixes, &next_prefix); 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, struct isl_prefixes *prefixes, void *opt) { int has_argument; const char *s; char **p = (char **)(((char *)opt) + decl->offset); s = skip_name(decl, arg[0], prefixes, 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, struct isl_prefixes *prefixes, void *opt) { int has_argument; const char *s; s = skip_name(decl, arg[0], prefixes, 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, struct isl_prefixes *prefixes, void *opt) { int has_argument; const char *val; char *endptr; int *p = (int *)(((char *)opt) + decl->offset); val = skip_name(decl, arg[0], prefixes, 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, struct isl_prefixes *prefixes, void *opt) { int has_argument; const char *val; char *endptr; long *p = (long *)(((char *)opt) + decl->offset); val = skip_name(decl, arg[0], prefixes, 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, struct isl_prefixes *prefixes, 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], prefixes, 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, struct isl_prefixes *prefixes, void *opt); static int parse_child_option(struct isl_arg *decl, char **arg, struct isl_prefixes *prefixes, void *opt) { void *child; int first, parsed; if (decl->offset == (size_t) -1) child = opt; else child = *(void **)(((char *)opt) + decl->offset); first = add_prefix(prefixes, decl->long_name); parsed = parse_option(decl->u.child.child->args, arg, prefixes, child); drop_prefix(prefixes, first); return parsed; } static int parse_option(struct isl_arg *decl, char **arg, struct isl_prefixes *prefixes, 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, prefixes, opt); break; case isl_arg_flags: parsed = parse_flags_option(&decl[i], arg, prefixes, opt); break; case isl_arg_int: parsed = parse_int_option(&decl[i], arg, prefixes, opt); break; case isl_arg_long: parsed = parse_long_option(&decl[i], arg, prefixes, opt); break; case isl_arg_ulong: parsed = parse_ulong_option(&decl[i], arg, prefixes, opt); break; case isl_arg_bool: parsed = parse_bool_option(&decl[i], arg, prefixes, opt); break; case isl_arg_str: parsed = parse_str_option(&decl[i], arg, prefixes, opt); break; case isl_arg_str_list: parsed = parse_str_list_option(&decl[i], arg, prefixes, opt); break; case isl_arg_child: parsed = parse_child_option(&decl[i], arg, prefixes, 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; struct isl_prefixes prefixes = { 0 }; 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], &prefixes, 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.4/isl/isl_schedule_node.c0000644000175000017500000041445312554427055014257 00000000000000/* * Copyright 2013-2014 Ecole Normale Superieure * Copyright 2014 INRIA Rocquencourt * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, * Ecole Normale Superieure, 45 rue d'Ulm, 75230 Paris, France * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt, * B.P. 105 - 78153 Le Chesnay, France */ #include #include #include #include /* Create a new schedule node in the given schedule, point at the given * tree with given ancestors and child positions. * "child_pos" may be NULL if there are no ancestors. */ __isl_give isl_schedule_node *isl_schedule_node_alloc( __isl_take isl_schedule *schedule, __isl_take isl_schedule_tree *tree, __isl_take isl_schedule_tree_list *ancestors, int *child_pos) { isl_ctx *ctx; isl_schedule_node *node; int i, n; if (!schedule || !tree || !ancestors) goto error; n = isl_schedule_tree_list_n_schedule_tree(ancestors); if (n > 0 && !child_pos) goto error; ctx = isl_schedule_get_ctx(schedule); node = isl_calloc_type(ctx, isl_schedule_node); if (!node) goto error; node->ref = 1; node->schedule = schedule; node->tree = tree; node->ancestors = ancestors; node->child_pos = isl_alloc_array(ctx, int, n); if (n && !node->child_pos) return isl_schedule_node_free(node); for (i = 0; i < n; ++i) node->child_pos[i] = child_pos[i]; return node; error: isl_schedule_free(schedule); isl_schedule_tree_free(tree); isl_schedule_tree_list_free(ancestors); return NULL; } /* Return a pointer to the root of a schedule tree with as single * node a domain node with the given domain. */ __isl_give isl_schedule_node *isl_schedule_node_from_domain( __isl_take isl_union_set *domain) { isl_schedule *schedule; isl_schedule_node *node; schedule = isl_schedule_from_domain(domain); node = isl_schedule_get_root(schedule); isl_schedule_free(schedule); return node; } /* Return a pointer to the root of a schedule tree with as single * node a extension node with the given extension. */ __isl_give isl_schedule_node *isl_schedule_node_from_extension( __isl_take isl_union_map *extension) { isl_ctx *ctx; isl_schedule *schedule; isl_schedule_tree *tree; isl_schedule_node *node; if (!extension) return NULL; ctx = isl_union_map_get_ctx(extension); tree = isl_schedule_tree_from_extension(extension); schedule = isl_schedule_from_schedule_tree(ctx, tree); node = isl_schedule_get_root(schedule); isl_schedule_free(schedule); return node; } /* Return the isl_ctx to which "node" belongs. */ isl_ctx *isl_schedule_node_get_ctx(__isl_keep isl_schedule_node *node) { return node ? isl_schedule_get_ctx(node->schedule) : NULL; } /* Return a pointer to the leaf of the schedule into which "node" points. * * Even though these leaves are not reference counted, we still * indicate that this function does not return a copy. */ __isl_keep isl_schedule_tree *isl_schedule_node_peek_leaf( __isl_keep isl_schedule_node *node) { return node ? isl_schedule_peek_leaf(node->schedule) : NULL; } /* Return a pointer to the leaf of the schedule into which "node" points. * * Even though these leaves are not reference counted, we still * return a "copy" of the leaf here such that it can still be "freed" * by the user. */ __isl_give isl_schedule_tree *isl_schedule_node_get_leaf( __isl_keep isl_schedule_node *node) { return isl_schedule_tree_copy(isl_schedule_node_peek_leaf(node)); } /* Return the type of the node or isl_schedule_node_error on error. */ enum isl_schedule_node_type isl_schedule_node_get_type( __isl_keep isl_schedule_node *node) { return node ? isl_schedule_tree_get_type(node->tree) : isl_schedule_node_error; } /* Return the type of the parent of "node" or isl_schedule_node_error on error. */ enum isl_schedule_node_type isl_schedule_node_get_parent_type( __isl_keep isl_schedule_node *node) { int pos; int has_parent; isl_schedule_tree *parent; enum isl_schedule_node_type type; if (!node) return isl_schedule_node_error; has_parent = isl_schedule_node_has_parent(node); if (has_parent < 0) return isl_schedule_node_error; if (!has_parent) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "node has no parent", return isl_schedule_node_error); pos = isl_schedule_tree_list_n_schedule_tree(node->ancestors) - 1; parent = isl_schedule_tree_list_get_schedule_tree(node->ancestors, pos); type = isl_schedule_tree_get_type(parent); isl_schedule_tree_free(parent); return type; } /* Return a copy of the subtree that this node points to. */ __isl_give isl_schedule_tree *isl_schedule_node_get_tree( __isl_keep isl_schedule_node *node) { if (!node) return NULL; return isl_schedule_tree_copy(node->tree); } /* Return a copy of the schedule into which "node" points. */ __isl_give isl_schedule *isl_schedule_node_get_schedule( __isl_keep isl_schedule_node *node) { if (!node) return NULL; return isl_schedule_copy(node->schedule); } /* Return a fresh copy of "node". */ __isl_take isl_schedule_node *isl_schedule_node_dup( __isl_keep isl_schedule_node *node) { if (!node) return NULL; return isl_schedule_node_alloc(isl_schedule_copy(node->schedule), isl_schedule_tree_copy(node->tree), isl_schedule_tree_list_copy(node->ancestors), node->child_pos); } /* Return an isl_schedule_node that is equal to "node" and that has only * a single reference. */ __isl_give isl_schedule_node *isl_schedule_node_cow( __isl_take isl_schedule_node *node) { if (!node) return NULL; if (node->ref == 1) return node; node->ref--; return isl_schedule_node_dup(node); } /* Return a new reference to "node". */ __isl_give isl_schedule_node *isl_schedule_node_copy( __isl_keep isl_schedule_node *node) { if (!node) return NULL; node->ref++; return node; } /* Free "node" and return NULL. * * Since the node may point to a leaf of its schedule, which * point to a field inside the schedule, we need to make sure * we free the tree before freeing the schedule. */ __isl_null isl_schedule_node *isl_schedule_node_free( __isl_take isl_schedule_node *node) { if (!node) return NULL; if (--node->ref > 0) return NULL; isl_schedule_tree_list_free(node->ancestors); free(node->child_pos); isl_schedule_tree_free(node->tree); isl_schedule_free(node->schedule); free(node); return NULL; } /* Do "node1" and "node2" point to the same position in the same * schedule? */ isl_bool isl_schedule_node_is_equal(__isl_keep isl_schedule_node *node1, __isl_keep isl_schedule_node *node2) { int i, n1, n2; if (!node1 || !node2) return isl_bool_error; if (node1 == node2) return isl_bool_true; if (node1->schedule != node2->schedule) return isl_bool_false; n1 = isl_schedule_node_get_tree_depth(node1); n2 = isl_schedule_node_get_tree_depth(node2); if (n1 != n2) return isl_bool_false; for (i = 0; i < n1; ++i) if (node1->child_pos[i] != node2->child_pos[i]) return isl_bool_false; return isl_bool_true; } /* Return the number of outer schedule dimensions of "node" * in its schedule tree. * * Return -1 on error. */ int isl_schedule_node_get_schedule_depth(__isl_keep isl_schedule_node *node) { int i, n; int depth = 0; if (!node) return -1; n = isl_schedule_tree_list_n_schedule_tree(node->ancestors); for (i = n - 1; i >= 0; --i) { isl_schedule_tree *tree; tree = isl_schedule_tree_list_get_schedule_tree( node->ancestors, i); if (!tree) return -1; if (tree->type == isl_schedule_node_band) depth += isl_schedule_tree_band_n_member(tree); isl_schedule_tree_free(tree); } return depth; } /* Internal data structure for * isl_schedule_node_get_prefix_schedule_union_pw_multi_aff * * "initialized" is set if the filter field has been initialized. * If "universe_domain" is not set, then the collected filter is intersected * with the the domain of the root domain node. * "universe_filter" is set if we are only collecting the universes of filters * "collect_prefix" is set if we are collecting prefixes. * "filter" collects all outer filters and is NULL until "initialized" is set. * "prefix" collects all outer band partial schedules (if "collect_prefix" * is set). If it is used, then it is initialized by the caller * of collect_filter_prefix to a zero-dimensional function. */ struct isl_schedule_node_get_filter_prefix_data { int initialized; int universe_domain; int universe_filter; int collect_prefix; isl_union_set *filter; isl_multi_union_pw_aff *prefix; }; static int collect_filter_prefix(__isl_keep isl_schedule_tree_list *list, int n, struct isl_schedule_node_get_filter_prefix_data *data); /* Update the filter and prefix information in "data" based on the first "n" * elements in "list" and the expansion tree root "tree". * * We first collect the information from the elements in "list", * initializing the filter based on the domain of the expansion. * Then we map the results to the expanded space and combined them * with the results already in "data". */ static int collect_filter_prefix_expansion(__isl_take isl_schedule_tree *tree, __isl_keep isl_schedule_tree_list *list, int n, struct isl_schedule_node_get_filter_prefix_data *data) { struct isl_schedule_node_get_filter_prefix_data contracted; isl_union_pw_multi_aff *c; isl_union_map *exp, *universe; isl_union_set *filter; c = isl_schedule_tree_expansion_get_contraction(tree); exp = isl_schedule_tree_expansion_get_expansion(tree); contracted.initialized = 1; contracted.universe_domain = data->universe_domain; contracted.universe_filter = data->universe_filter; contracted.collect_prefix = data->collect_prefix; universe = isl_union_map_universe(isl_union_map_copy(exp)); filter = isl_union_map_domain(universe); if (data->collect_prefix) { isl_space *space = isl_union_set_get_space(filter); space = isl_space_set_from_params(space); contracted.prefix = isl_multi_union_pw_aff_zero(space); } contracted.filter = filter; if (collect_filter_prefix(list, n, &contracted) < 0) contracted.filter = isl_union_set_free(contracted.filter); if (data->collect_prefix) { isl_multi_union_pw_aff *prefix; prefix = contracted.prefix; prefix = isl_multi_union_pw_aff_pullback_union_pw_multi_aff(prefix, isl_union_pw_multi_aff_copy(c)); data->prefix = isl_multi_union_pw_aff_flat_range_product( prefix, data->prefix); } filter = contracted.filter; if (data->universe_domain) filter = isl_union_set_preimage_union_pw_multi_aff(filter, isl_union_pw_multi_aff_copy(c)); else filter = isl_union_set_apply(filter, isl_union_map_copy(exp)); if (!data->initialized) data->filter = filter; else data->filter = isl_union_set_intersect(filter, data->filter); data->initialized = 1; isl_union_pw_multi_aff_free(c); isl_union_map_free(exp); isl_schedule_tree_free(tree); return 0; } /* Update the filter information in "data" based on the first "n" * elements in "list" and the extension tree root "tree", in case * data->universe_domain is set and data->collect_prefix is not. * * We collect the universe domain of the elements in "list" and * add it to the universe range of the extension (intersected * with the already collected filter, if any). */ static int collect_universe_domain_extension(__isl_take isl_schedule_tree *tree, __isl_keep isl_schedule_tree_list *list, int n, struct isl_schedule_node_get_filter_prefix_data *data) { struct isl_schedule_node_get_filter_prefix_data data_outer; isl_union_map *extension; isl_union_set *filter; data_outer.initialized = 0; data_outer.universe_domain = 1; data_outer.universe_filter = data->universe_filter; data_outer.collect_prefix = 0; data_outer.filter = NULL; data_outer.prefix = NULL; if (collect_filter_prefix(list, n, &data_outer) < 0) data_outer.filter = isl_union_set_free(data_outer.filter); extension = isl_schedule_tree_extension_get_extension(tree); extension = isl_union_map_universe(extension); filter = isl_union_map_range(extension); if (data_outer.initialized) filter = isl_union_set_union(filter, data_outer.filter); if (data->initialized) filter = isl_union_set_intersect(filter, data->filter); data->filter = filter; isl_schedule_tree_free(tree); return 0; } /* Update "data" based on the tree node "tree" in case "data" has * not been initialized yet. * * Return 0 on success and -1 on error. * * If "tree" is a filter, then we set data->filter to this filter * (or its universe). * If "tree" is a domain, then this means we have reached the root * of the schedule tree without being able to extract any information. * We therefore initialize data->filter to the universe of the domain, * or the domain itself if data->universe_domain is not set. * If "tree" is a band with at least one member, then we set data->filter * to the universe of the schedule domain and replace the zero-dimensional * data->prefix by the band schedule (if data->collect_prefix is set). */ static int collect_filter_prefix_init(__isl_keep isl_schedule_tree *tree, struct isl_schedule_node_get_filter_prefix_data *data) { enum isl_schedule_node_type type; isl_multi_union_pw_aff *mupa; isl_union_set *filter; type = isl_schedule_tree_get_type(tree); switch (type) { case isl_schedule_node_error: return -1; case isl_schedule_node_expansion: isl_die(isl_schedule_tree_get_ctx(tree), isl_error_internal, "should be handled by caller", return -1); case isl_schedule_node_extension: isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "cannot handle extension nodes", return -1); case isl_schedule_node_context: case isl_schedule_node_leaf: case isl_schedule_node_guard: case isl_schedule_node_mark: case isl_schedule_node_sequence: case isl_schedule_node_set: return 0; case isl_schedule_node_domain: filter = isl_schedule_tree_domain_get_domain(tree); if (data->universe_domain) filter = isl_union_set_universe(filter); data->filter = filter; break; case isl_schedule_node_band: if (isl_schedule_tree_band_n_member(tree) == 0) return 0; mupa = isl_schedule_tree_band_get_partial_schedule(tree); if (data->collect_prefix) { isl_multi_union_pw_aff_free(data->prefix); mupa = isl_multi_union_pw_aff_reset_tuple_id(mupa, isl_dim_set); data->prefix = isl_multi_union_pw_aff_copy(mupa); } filter = isl_multi_union_pw_aff_domain(mupa); filter = isl_union_set_universe(filter); data->filter = filter; break; case isl_schedule_node_filter: filter = isl_schedule_tree_filter_get_filter(tree); if (data->universe_filter) filter = isl_union_set_universe(filter); data->filter = filter; break; } if ((data->collect_prefix && !data->prefix) || !data->filter) return -1; data->initialized = 1; return 0; } /* Update "data" based on the tree node "tree" in case "data" has * already been initialized. * * Return 0 on success and -1 on error. * * If "tree" is a domain and data->universe_domain is not set, then * intersect data->filter with the domain. * If "tree" is a filter, then we intersect data->filter with this filter * (or its universe). * If "tree" is a band with at least one member and data->collect_prefix * is set, then we extend data->prefix with the band schedule. * If "tree" is an extension, then we make sure that we are not collecting * information on any extended domain elements. */ static int collect_filter_prefix_update(__isl_keep isl_schedule_tree *tree, struct isl_schedule_node_get_filter_prefix_data *data) { enum isl_schedule_node_type type; isl_multi_union_pw_aff *mupa; isl_union_set *filter; isl_union_map *extension; int empty; type = isl_schedule_tree_get_type(tree); switch (type) { case isl_schedule_node_error: return -1; case isl_schedule_node_expansion: isl_die(isl_schedule_tree_get_ctx(tree), isl_error_internal, "should be handled by caller", return -1); case isl_schedule_node_extension: extension = isl_schedule_tree_extension_get_extension(tree); extension = isl_union_map_intersect_range(extension, isl_union_set_copy(data->filter)); empty = isl_union_map_is_empty(extension); isl_union_map_free(extension); if (empty < 0) return -1; if (empty) break; isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "cannot handle extension nodes", return -1); case isl_schedule_node_context: case isl_schedule_node_leaf: case isl_schedule_node_guard: case isl_schedule_node_mark: case isl_schedule_node_sequence: case isl_schedule_node_set: break; case isl_schedule_node_domain: if (data->universe_domain) break; filter = isl_schedule_tree_domain_get_domain(tree); data->filter = isl_union_set_intersect(data->filter, filter); break; case isl_schedule_node_band: if (isl_schedule_tree_band_n_member(tree) == 0) break; if (!data->collect_prefix) break; mupa = isl_schedule_tree_band_get_partial_schedule(tree); data->prefix = isl_multi_union_pw_aff_flat_range_product(mupa, data->prefix); if (!data->prefix) return -1; break; case isl_schedule_node_filter: filter = isl_schedule_tree_filter_get_filter(tree); if (data->universe_filter) filter = isl_union_set_universe(filter); data->filter = isl_union_set_intersect(data->filter, filter); if (!data->filter) return -1; break; } return 0; } /* Collect filter and/or prefix information from the first "n" * elements in "list" (which represent the ancestors of a node). * Store the results in "data". * * Extension nodes are only supported if they do not affect the outcome, * i.e., if we are collecting information on non-extended domain elements, * or if we are collecting the universe domain (without prefix). * * Return 0 on success and -1 on error. * * We traverse the list from innermost ancestor (last element) * to outermost ancestor (first element), calling collect_filter_prefix_init * on each node as long as we have not been able to extract any information * yet and collect_filter_prefix_update afterwards. * If we come across an expansion node, then we interrupt the traversal * and call collect_filter_prefix_expansion to restart the traversal * over the remaining ancestors and to combine the results with those * that have already been collected. * If we come across an extension node and we are only computing * the universe domain, then we interrupt the traversal and call * collect_universe_domain_extension to restart the traversal * over the remaining ancestors and to combine the results with those * that have already been collected. * On successful return, data->initialized will be set since the outermost * ancestor is a domain node, which always results in an initialization. */ static int collect_filter_prefix(__isl_keep isl_schedule_tree_list *list, int n, struct isl_schedule_node_get_filter_prefix_data *data) { int i; if (!list) return -1; for (i = n - 1; i >= 0; --i) { isl_schedule_tree *tree; enum isl_schedule_node_type type; int r; tree = isl_schedule_tree_list_get_schedule_tree(list, i); if (!tree) return -1; type = isl_schedule_tree_get_type(tree); if (type == isl_schedule_node_expansion) return collect_filter_prefix_expansion(tree, list, i, data); if (type == isl_schedule_node_extension && data->universe_domain && !data->collect_prefix) return collect_universe_domain_extension(tree, list, i, data); if (!data->initialized) r = collect_filter_prefix_init(tree, data); else r = collect_filter_prefix_update(tree, data); isl_schedule_tree_free(tree); if (r < 0) return -1; } return 0; } /* Return the concatenation of the partial schedules of all outer band * nodes of "node" interesected with all outer filters * as an isl_multi_union_pw_aff. * None of the ancestors of "node" may be an extension node, unless * there is also a filter ancestor that filters out all the extended * domain elements. * * If "node" is pointing at the root of the schedule tree, then * there are no domain elements reaching the current node, so * we return an empty result. * * We collect all the filters and partial schedules in collect_filter_prefix * and intersect the domain of the combined schedule with the combined filter. */ __isl_give isl_multi_union_pw_aff * isl_schedule_node_get_prefix_schedule_multi_union_pw_aff( __isl_keep isl_schedule_node *node) { int n; isl_space *space; struct isl_schedule_node_get_filter_prefix_data data; if (!node) return NULL; space = isl_schedule_get_space(node->schedule); space = isl_space_set_from_params(space); if (node->tree == node->schedule->root) return isl_multi_union_pw_aff_zero(space); data.initialized = 0; data.universe_domain = 1; data.universe_filter = 0; data.collect_prefix = 1; data.filter = NULL; data.prefix = isl_multi_union_pw_aff_zero(space); n = isl_schedule_tree_list_n_schedule_tree(node->ancestors); if (collect_filter_prefix(node->ancestors, n, &data) < 0) data.prefix = isl_multi_union_pw_aff_free(data.prefix); data.prefix = isl_multi_union_pw_aff_intersect_domain(data.prefix, data.filter); return data.prefix; } /* Return the concatenation of the partial schedules of all outer band * nodes of "node" interesected with all outer filters * as an isl_union_pw_multi_aff. * None of the ancestors of "node" may be an extension node, unless * there is also a filter ancestor that filters out all the extended * domain elements. * * If "node" is pointing at the root of the schedule tree, then * there are no domain elements reaching the current node, so * we return an empty result. * * We collect all the filters and partial schedules in collect_filter_prefix. * The partial schedules are collected as an isl_multi_union_pw_aff. * If this isl_multi_union_pw_aff is zero-dimensional, then it does not * contain any domain information, so we construct the isl_union_pw_multi_aff * result as a zero-dimensional function on the collected filter. * Otherwise, we convert the isl_multi_union_pw_aff to * an isl_multi_union_pw_aff and intersect the domain with the filter. */ __isl_give isl_union_pw_multi_aff * isl_schedule_node_get_prefix_schedule_union_pw_multi_aff( __isl_keep isl_schedule_node *node) { int n; isl_space *space; isl_union_pw_multi_aff *prefix; struct isl_schedule_node_get_filter_prefix_data data; if (!node) return NULL; space = isl_schedule_get_space(node->schedule); if (node->tree == node->schedule->root) return isl_union_pw_multi_aff_empty(space); space = isl_space_set_from_params(space); data.initialized = 0; data.universe_domain = 1; data.universe_filter = 0; data.collect_prefix = 1; data.filter = NULL; data.prefix = isl_multi_union_pw_aff_zero(space); n = isl_schedule_tree_list_n_schedule_tree(node->ancestors); if (collect_filter_prefix(node->ancestors, n, &data) < 0) data.prefix = isl_multi_union_pw_aff_free(data.prefix); if (data.prefix && isl_multi_union_pw_aff_dim(data.prefix, isl_dim_set) == 0) { isl_multi_union_pw_aff_free(data.prefix); prefix = isl_union_pw_multi_aff_from_domain(data.filter); } else { prefix = isl_union_pw_multi_aff_from_multi_union_pw_aff(data.prefix); prefix = isl_union_pw_multi_aff_intersect_domain(prefix, data.filter); } return prefix; } /* Return the concatenation of the partial schedules of all outer band * nodes of "node" interesected with all outer filters * as an isl_union_map. */ __isl_give isl_union_map *isl_schedule_node_get_prefix_schedule_union_map( __isl_keep isl_schedule_node *node) { isl_union_pw_multi_aff *upma; upma = isl_schedule_node_get_prefix_schedule_union_pw_multi_aff(node); return isl_union_map_from_union_pw_multi_aff(upma); } /* Return the concatenation of the partial schedules of all outer band * nodes of "node" intersected with all outer domain constraints. * None of the ancestors of "node" may be an extension node, unless * there is also a filter ancestor that filters out all the extended * domain elements. * * Essentially, this functions intersected the domain of the output * of isl_schedule_node_get_prefix_schedule_union_map with the output * of isl_schedule_node_get_domain, except that it only traverses * the ancestors of "node" once. */ __isl_give isl_union_map *isl_schedule_node_get_prefix_schedule_relation( __isl_keep isl_schedule_node *node) { int n; isl_space *space; isl_union_map *prefix; struct isl_schedule_node_get_filter_prefix_data data; if (!node) return NULL; space = isl_schedule_get_space(node->schedule); if (node->tree == node->schedule->root) return isl_union_map_empty(space); space = isl_space_set_from_params(space); data.initialized = 0; data.universe_domain = 0; data.universe_filter = 0; data.collect_prefix = 1; data.filter = NULL; data.prefix = isl_multi_union_pw_aff_zero(space); n = isl_schedule_tree_list_n_schedule_tree(node->ancestors); if (collect_filter_prefix(node->ancestors, n, &data) < 0) data.prefix = isl_multi_union_pw_aff_free(data.prefix); if (data.prefix && isl_multi_union_pw_aff_dim(data.prefix, isl_dim_set) == 0) { isl_multi_union_pw_aff_free(data.prefix); prefix = isl_union_map_from_domain(data.filter); } else { prefix = isl_union_map_from_multi_union_pw_aff(data.prefix); prefix = isl_union_map_intersect_domain(prefix, data.filter); } return prefix; } /* Return the domain elements that reach "node". * * If "node" is pointing at the root of the schedule tree, then * there are no domain elements reaching the current node, so * we return an empty result. * None of the ancestors of "node" may be an extension node, unless * there is also a filter ancestor that filters out all the extended * domain elements. * * Otherwise, we collect all filters reaching the node, * intersected with the root domain in collect_filter_prefix. */ __isl_give isl_union_set *isl_schedule_node_get_domain( __isl_keep isl_schedule_node *node) { int n; struct isl_schedule_node_get_filter_prefix_data data; if (!node) return NULL; if (node->tree == node->schedule->root) { isl_space *space; space = isl_schedule_get_space(node->schedule); return isl_union_set_empty(space); } data.initialized = 0; data.universe_domain = 0; data.universe_filter = 0; data.collect_prefix = 0; data.filter = NULL; data.prefix = NULL; n = isl_schedule_tree_list_n_schedule_tree(node->ancestors); if (collect_filter_prefix(node->ancestors, n, &data) < 0) data.filter = isl_union_set_free(data.filter); return data.filter; } /* Return the union of universe sets of the domain elements that reach "node". * * If "node" is pointing at the root of the schedule tree, then * there are no domain elements reaching the current node, so * we return an empty result. * * Otherwise, we collect the universes of all filters reaching the node * in collect_filter_prefix. */ __isl_give isl_union_set *isl_schedule_node_get_universe_domain( __isl_keep isl_schedule_node *node) { int n; struct isl_schedule_node_get_filter_prefix_data data; if (!node) return NULL; if (node->tree == node->schedule->root) { isl_space *space; space = isl_schedule_get_space(node->schedule); return isl_union_set_empty(space); } data.initialized = 0; data.universe_domain = 1; data.universe_filter = 1; data.collect_prefix = 0; data.filter = NULL; data.prefix = NULL; n = isl_schedule_tree_list_n_schedule_tree(node->ancestors); if (collect_filter_prefix(node->ancestors, n, &data) < 0) data.filter = isl_union_set_free(data.filter); return data.filter; } /* Return the subtree schedule of "node". * * Since isl_schedule_tree_get_subtree_schedule_union_map does not handle * trees that do not contain any schedule information, we first * move down to the first relevant descendant and handle leaves ourselves. * * If the subtree rooted at "node" contains any expansion nodes, then * the returned subtree schedule is formulated in terms of the expanded * domains. * The subtree is not allowed to contain any extension nodes. */ __isl_give isl_union_map *isl_schedule_node_get_subtree_schedule_union_map( __isl_keep isl_schedule_node *node) { isl_schedule_tree *tree, *leaf; isl_union_map *umap; tree = isl_schedule_node_get_tree(node); leaf = isl_schedule_node_peek_leaf(node); tree = isl_schedule_tree_first_schedule_descendant(tree, leaf); if (!tree) return NULL; if (tree == leaf) { isl_union_set *domain; domain = isl_schedule_node_get_universe_domain(node); isl_schedule_tree_free(tree); return isl_union_map_from_domain(domain); } umap = isl_schedule_tree_get_subtree_schedule_union_map(tree); isl_schedule_tree_free(tree); return umap; } /* Return the number of ancestors of "node" in its schedule tree. */ int isl_schedule_node_get_tree_depth(__isl_keep isl_schedule_node *node) { if (!node) return -1; return isl_schedule_tree_list_n_schedule_tree(node->ancestors); } /* Does "node" have a parent? * * That is, does it point to any node of the schedule other than the root? */ isl_bool isl_schedule_node_has_parent(__isl_keep isl_schedule_node *node) { if (!node) return isl_bool_error; if (!node->ancestors) return isl_bool_error; return isl_schedule_tree_list_n_schedule_tree(node->ancestors) != 0; } /* Return the position of "node" among the children of its parent. */ int isl_schedule_node_get_child_position(__isl_keep isl_schedule_node *node) { int n; int has_parent; if (!node) return -1; has_parent = isl_schedule_node_has_parent(node); if (has_parent < 0) return -1; if (!has_parent) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "node has no parent", return -1); n = isl_schedule_tree_list_n_schedule_tree(node->ancestors); return node->child_pos[n - 1]; } /* Does the parent (if any) of "node" have any children with a smaller child * position than this one? */ isl_bool isl_schedule_node_has_previous_sibling( __isl_keep isl_schedule_node *node) { int n; isl_bool has_parent; if (!node) return isl_bool_error; has_parent = isl_schedule_node_has_parent(node); if (has_parent < 0 || !has_parent) return has_parent; n = isl_schedule_tree_list_n_schedule_tree(node->ancestors); return node->child_pos[n - 1] > 0; } /* Does the parent (if any) of "node" have any children with a greater child * position than this one? */ isl_bool isl_schedule_node_has_next_sibling(__isl_keep isl_schedule_node *node) { int n, n_child; isl_bool has_parent; isl_schedule_tree *tree; if (!node) return isl_bool_error; has_parent = isl_schedule_node_has_parent(node); if (has_parent < 0 || !has_parent) return has_parent; n = isl_schedule_tree_list_n_schedule_tree(node->ancestors); tree = isl_schedule_tree_list_get_schedule_tree(node->ancestors, n - 1); if (!tree) return isl_bool_error; n_child = isl_schedule_tree_list_n_schedule_tree(tree->children); isl_schedule_tree_free(tree); return node->child_pos[n - 1] + 1 < n_child; } /* Does "node" have any children? * * Any node other than the leaf nodes is considered to have at least * one child, even if the corresponding isl_schedule_tree does not * have any children. */ isl_bool isl_schedule_node_has_children(__isl_keep isl_schedule_node *node) { if (!node) return isl_bool_error; return !isl_schedule_tree_is_leaf(node->tree); } /* Return the number of children of "node"? * * Any node other than the leaf nodes is considered to have at least * one child, even if the corresponding isl_schedule_tree does not * have any children. That is, the number of children of "node" is * only zero if its tree is the explicit empty tree. Otherwise, * if the isl_schedule_tree has any children, then it is equal * to the number of children of "node". If it has zero children, * then "node" still has a leaf node as child. */ int isl_schedule_node_n_children(__isl_keep isl_schedule_node *node) { int n; if (!node) return -1; if (isl_schedule_tree_is_leaf(node->tree)) return 0; n = isl_schedule_tree_n_children(node->tree); if (n == 0) return 1; return n; } /* Move the "node" pointer to the ancestor of the given generation * of the node it currently points to, where generation 0 is the node * itself and generation 1 is its parent. */ __isl_give isl_schedule_node *isl_schedule_node_ancestor( __isl_take isl_schedule_node *node, int generation) { int n; isl_schedule_tree *tree; if (!node) return NULL; if (generation == 0) return node; n = isl_schedule_node_get_tree_depth(node); if (n < 0) return isl_schedule_node_free(node); if (generation < 0 || generation > n) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "generation out of bounds", return isl_schedule_node_free(node)); node = isl_schedule_node_cow(node); if (!node) return NULL; tree = isl_schedule_tree_list_get_schedule_tree(node->ancestors, n - generation); isl_schedule_tree_free(node->tree); node->tree = tree; node->ancestors = isl_schedule_tree_list_drop(node->ancestors, n - generation, generation); if (!node->ancestors || !node->tree) return isl_schedule_node_free(node); return node; } /* Move the "node" pointer to the parent of the node it currently points to. */ __isl_give isl_schedule_node *isl_schedule_node_parent( __isl_take isl_schedule_node *node) { if (!node) return NULL; if (!isl_schedule_node_has_parent(node)) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "node has no parent", return isl_schedule_node_free(node)); return isl_schedule_node_ancestor(node, 1); } /* Move the "node" pointer to the root of its schedule tree. */ __isl_give isl_schedule_node *isl_schedule_node_root( __isl_take isl_schedule_node *node) { int n; if (!node) return NULL; n = isl_schedule_node_get_tree_depth(node); if (n < 0) return isl_schedule_node_free(node); return isl_schedule_node_ancestor(node, n); } /* Move the "node" pointer to the child at position "pos" of the node * it currently points to. */ __isl_give isl_schedule_node *isl_schedule_node_child( __isl_take isl_schedule_node *node, int pos) { int n; isl_ctx *ctx; isl_schedule_tree *tree; int *child_pos; node = isl_schedule_node_cow(node); if (!node) return NULL; if (!isl_schedule_node_has_children(node)) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "node has no children", return isl_schedule_node_free(node)); ctx = isl_schedule_node_get_ctx(node); n = isl_schedule_tree_list_n_schedule_tree(node->ancestors); child_pos = isl_realloc_array(ctx, node->child_pos, int, n + 1); if (!child_pos) return isl_schedule_node_free(node); node->child_pos = child_pos; node->child_pos[n] = pos; node->ancestors = isl_schedule_tree_list_add(node->ancestors, isl_schedule_tree_copy(node->tree)); tree = node->tree; if (isl_schedule_tree_has_children(tree)) tree = isl_schedule_tree_get_child(tree, pos); else tree = isl_schedule_node_get_leaf(node); isl_schedule_tree_free(node->tree); node->tree = tree; if (!node->tree || !node->ancestors) return isl_schedule_node_free(node); return node; } /* Move the "node" pointer to the first child of the node * it currently points to. */ __isl_give isl_schedule_node *isl_schedule_node_first_child( __isl_take isl_schedule_node *node) { return isl_schedule_node_child(node, 0); } /* Move the "node" pointer to the child of this node's parent in * the previous child position. */ __isl_give isl_schedule_node *isl_schedule_node_previous_sibling( __isl_take isl_schedule_node *node) { int n; isl_schedule_tree *parent, *tree; node = isl_schedule_node_cow(node); if (!node) return NULL; if (!isl_schedule_node_has_previous_sibling(node)) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "node has no previous sibling", return isl_schedule_node_free(node)); n = isl_schedule_tree_list_n_schedule_tree(node->ancestors); parent = isl_schedule_tree_list_get_schedule_tree(node->ancestors, n - 1); if (!parent) return isl_schedule_node_free(node); node->child_pos[n - 1]--; tree = isl_schedule_tree_list_get_schedule_tree(parent->children, node->child_pos[n - 1]); isl_schedule_tree_free(parent); if (!tree) return isl_schedule_node_free(node); isl_schedule_tree_free(node->tree); node->tree = tree; return node; } /* Move the "node" pointer to the child of this node's parent in * the next child position. */ __isl_give isl_schedule_node *isl_schedule_node_next_sibling( __isl_take isl_schedule_node *node) { int n; isl_schedule_tree *parent, *tree; node = isl_schedule_node_cow(node); if (!node) return NULL; if (!isl_schedule_node_has_next_sibling(node)) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "node has no next sibling", return isl_schedule_node_free(node)); n = isl_schedule_tree_list_n_schedule_tree(node->ancestors); parent = isl_schedule_tree_list_get_schedule_tree(node->ancestors, n - 1); if (!parent) return isl_schedule_node_free(node); node->child_pos[n - 1]++; tree = isl_schedule_tree_list_get_schedule_tree(parent->children, node->child_pos[n - 1]); isl_schedule_tree_free(parent); if (!tree) return isl_schedule_node_free(node); isl_schedule_tree_free(node->tree); node->tree = tree; return node; } /* Return a copy to the child at position "pos" of "node". */ __isl_give isl_schedule_node *isl_schedule_node_get_child( __isl_keep isl_schedule_node *node, int pos) { return isl_schedule_node_child(isl_schedule_node_copy(node), pos); } /* Traverse the descendant of "node" in depth-first order, including * "node" itself. Call "enter" whenever a node is entered and "leave" * whenever a node is left. The callback "enter" is responsible * for moving to the deepest initial subtree of its argument that * should be traversed. */ static __isl_give isl_schedule_node *traverse( __isl_take isl_schedule_node *node, __isl_give isl_schedule_node *(*enter)( __isl_take isl_schedule_node *node, void *user), __isl_give isl_schedule_node *(*leave)( __isl_take isl_schedule_node *node, void *user), void *user) { int depth; if (!node) return NULL; depth = isl_schedule_node_get_tree_depth(node); do { node = enter(node, user); node = leave(node, user); while (node && isl_schedule_node_get_tree_depth(node) > depth && !isl_schedule_node_has_next_sibling(node)) { node = isl_schedule_node_parent(node); node = leave(node, user); } if (node && isl_schedule_node_get_tree_depth(node) > depth) node = isl_schedule_node_next_sibling(node); } while (node && isl_schedule_node_get_tree_depth(node) > depth); return node; } /* Internal data structure for isl_schedule_node_foreach_descendant_top_down. * * "fn" is the user-specified callback function. * "user" is the user-specified argument for the callback. */ struct isl_schedule_node_preorder_data { isl_bool (*fn)(__isl_keep isl_schedule_node *node, void *user); void *user; }; /* Callback for "traverse" to enter a node and to move * to the deepest initial subtree that should be traversed * for use in a preorder visit. * * If the user callback returns a negative value, then we abort * the traversal. If this callback returns zero, then we skip * the subtree rooted at the current node. Otherwise, we move * down to the first child and repeat the process until a leaf * is reached. */ static __isl_give isl_schedule_node *preorder_enter( __isl_take isl_schedule_node *node, void *user) { struct isl_schedule_node_preorder_data *data = user; if (!node) return NULL; do { isl_bool r; r = data->fn(node, data->user); if (r < 0) return isl_schedule_node_free(node); if (r == isl_bool_false) return node; } while (isl_schedule_node_has_children(node) && (node = isl_schedule_node_first_child(node)) != NULL); return node; } /* Callback for "traverse" to leave a node * for use in a preorder visit. * Since we already visited the node when we entered it, * we do not need to do anything here. */ static __isl_give isl_schedule_node *preorder_leave( __isl_take isl_schedule_node *node, void *user) { return node; } /* Traverse the descendants of "node" (including the node itself) * in depth first preorder. * * If "fn" returns -1 on any of the nodes, then the traversal is aborted. * If "fn" returns 0 on any of the nodes, then the subtree rooted * at that node is skipped. * * Return 0 on success and -1 on failure. */ isl_stat isl_schedule_node_foreach_descendant_top_down( __isl_keep isl_schedule_node *node, isl_bool (*fn)(__isl_keep isl_schedule_node *node, void *user), void *user) { struct isl_schedule_node_preorder_data data = { fn, user }; node = isl_schedule_node_copy(node); node = traverse(node, &preorder_enter, &preorder_leave, &data); isl_schedule_node_free(node); return node ? isl_stat_ok : isl_stat_error; } /* Internal data structure for isl_schedule_node_map_descendant_bottom_up. * * "fn" is the user-specified callback function. * "user" is the user-specified argument for the callback. */ struct isl_schedule_node_postorder_data { __isl_give isl_schedule_node *(*fn)(__isl_take isl_schedule_node *node, void *user); void *user; }; /* Callback for "traverse" to enter a node and to move * to the deepest initial subtree that should be traversed * for use in a postorder visit. * * Since we are performing a postorder visit, we only need * to move to the deepest initial leaf here. */ static __isl_give isl_schedule_node *postorder_enter( __isl_take isl_schedule_node *node, void *user) { while (node && isl_schedule_node_has_children(node)) node = isl_schedule_node_first_child(node); return node; } /* Callback for "traverse" to leave a node * for use in a postorder visit. * * Since we are performing a postorder visit, we need * to call the user callback here. */ static __isl_give isl_schedule_node *postorder_leave( __isl_take isl_schedule_node *node, void *user) { struct isl_schedule_node_postorder_data *data = user; return data->fn(node, data->user); } /* Traverse the descendants of "node" (including the node itself) * in depth first postorder, allowing the user to modify the visited node. * The traversal continues from the node returned by the callback function. * It is the responsibility of the user to ensure that this does not * lead to an infinite loop. It is safest to always return a pointer * to the same position (same ancestors and child positions) as the input node. */ __isl_give isl_schedule_node *isl_schedule_node_map_descendant_bottom_up( __isl_take isl_schedule_node *node, __isl_give isl_schedule_node *(*fn)(__isl_take isl_schedule_node *node, void *user), void *user) { struct isl_schedule_node_postorder_data data = { fn, user }; return traverse(node, &postorder_enter, &postorder_leave, &data); } /* Traverse the ancestors of "node" from the root down to and including * the parent of "node", calling "fn" on each of them. * * If "fn" returns -1 on any of the nodes, then the traversal is aborted. * * Return 0 on success and -1 on failure. */ isl_stat isl_schedule_node_foreach_ancestor_top_down( __isl_keep isl_schedule_node *node, isl_stat (*fn)(__isl_keep isl_schedule_node *node, void *user), void *user) { int i, n; if (!node) return isl_stat_error; n = isl_schedule_node_get_tree_depth(node); for (i = 0; i < n; ++i) { isl_schedule_node *ancestor; isl_stat r; ancestor = isl_schedule_node_copy(node); ancestor = isl_schedule_node_ancestor(ancestor, n - i); r = fn(ancestor, user); isl_schedule_node_free(ancestor); if (r < 0) return isl_stat_error; } return isl_stat_ok; } /* Is any node in the subtree rooted at "node" anchored? * That is, do any of these nodes reference the outer band nodes? */ isl_bool isl_schedule_node_is_subtree_anchored( __isl_keep isl_schedule_node *node) { if (!node) return isl_bool_error; return isl_schedule_tree_is_subtree_anchored(node->tree); } /* Return the number of members in the given band node. */ unsigned isl_schedule_node_band_n_member(__isl_keep isl_schedule_node *node) { return node ? isl_schedule_tree_band_n_member(node->tree) : 0; } /* Is the band member at position "pos" of the band node "node" * marked coincident? */ isl_bool isl_schedule_node_band_member_get_coincident( __isl_keep isl_schedule_node *node, int pos) { if (!node) return isl_bool_error; return isl_schedule_tree_band_member_get_coincident(node->tree, pos); } /* Mark the band member at position "pos" the band node "node" * as being coincident or not according to "coincident". */ __isl_give isl_schedule_node *isl_schedule_node_band_member_set_coincident( __isl_take isl_schedule_node *node, int pos, int coincident) { int c; isl_schedule_tree *tree; if (!node) return NULL; c = isl_schedule_node_band_member_get_coincident(node, pos); if (c == coincident) return node; tree = isl_schedule_tree_copy(node->tree); tree = isl_schedule_tree_band_member_set_coincident(tree, pos, coincident); node = isl_schedule_node_graft_tree(node, tree); return node; } /* Is the band node "node" marked permutable? */ isl_bool isl_schedule_node_band_get_permutable( __isl_keep isl_schedule_node *node) { if (!node) return isl_bool_error; return isl_schedule_tree_band_get_permutable(node->tree); } /* Mark the band node "node" permutable or not according to "permutable"? */ __isl_give isl_schedule_node *isl_schedule_node_band_set_permutable( __isl_take isl_schedule_node *node, int permutable) { isl_schedule_tree *tree; if (!node) return NULL; if (isl_schedule_node_band_get_permutable(node) == permutable) return node; tree = isl_schedule_tree_copy(node->tree); tree = isl_schedule_tree_band_set_permutable(tree, permutable); node = isl_schedule_node_graft_tree(node, tree); return node; } /* Return the schedule space of the band node. */ __isl_give isl_space *isl_schedule_node_band_get_space( __isl_keep isl_schedule_node *node) { if (!node) return NULL; return isl_schedule_tree_band_get_space(node->tree); } /* Return the schedule of the band node in isolation. */ __isl_give isl_multi_union_pw_aff *isl_schedule_node_band_get_partial_schedule( __isl_keep isl_schedule_node *node) { if (!node) return NULL; return isl_schedule_tree_band_get_partial_schedule(node->tree); } /* Return the schedule of the band node in isolation in the form of * an isl_union_map. * * If the band does not have any members, then we construct a universe map * with the universe of the domain elements reaching the node as domain. * Otherwise, we extract an isl_multi_union_pw_aff representation and * convert that to an isl_union_map. */ __isl_give isl_union_map *isl_schedule_node_band_get_partial_schedule_union_map( __isl_keep isl_schedule_node *node) { isl_multi_union_pw_aff *mupa; if (!node) return NULL; if (isl_schedule_node_get_type(node) != isl_schedule_node_band) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "not a band node", return NULL); if (isl_schedule_node_band_n_member(node) == 0) { isl_union_set *domain; domain = isl_schedule_node_get_universe_domain(node); return isl_union_map_from_domain(domain); } mupa = isl_schedule_node_band_get_partial_schedule(node); return isl_union_map_from_multi_union_pw_aff(mupa); } /* Return the loop AST generation type for the band member of band node "node" * at position "pos". */ enum isl_ast_loop_type isl_schedule_node_band_member_get_ast_loop_type( __isl_keep isl_schedule_node *node, int pos) { if (!node) return isl_ast_loop_error; return isl_schedule_tree_band_member_get_ast_loop_type(node->tree, pos); } /* Set the loop AST generation type for the band member of band node "node" * at position "pos" to "type". */ __isl_give isl_schedule_node *isl_schedule_node_band_member_set_ast_loop_type( __isl_take isl_schedule_node *node, int pos, enum isl_ast_loop_type type) { isl_schedule_tree *tree; if (!node) return NULL; tree = isl_schedule_tree_copy(node->tree); tree = isl_schedule_tree_band_member_set_ast_loop_type(tree, pos, type); return isl_schedule_node_graft_tree(node, tree); } /* Return the loop AST generation type for the band member of band node "node" * at position "pos" for the isolated part. */ enum isl_ast_loop_type isl_schedule_node_band_member_get_isolate_ast_loop_type( __isl_keep isl_schedule_node *node, int pos) { if (!node) return isl_ast_loop_error; return isl_schedule_tree_band_member_get_isolate_ast_loop_type( node->tree, pos); } /* Set the loop AST generation type for the band member of band node "node" * at position "pos" for the isolated part to "type". */ __isl_give isl_schedule_node * isl_schedule_node_band_member_set_isolate_ast_loop_type( __isl_take isl_schedule_node *node, int pos, enum isl_ast_loop_type type) { isl_schedule_tree *tree; if (!node) return NULL; tree = isl_schedule_tree_copy(node->tree); tree = isl_schedule_tree_band_member_set_isolate_ast_loop_type(tree, pos, type); return isl_schedule_node_graft_tree(node, tree); } /* Return the AST build options associated to band node "node". */ __isl_give isl_union_set *isl_schedule_node_band_get_ast_build_options( __isl_keep isl_schedule_node *node) { if (!node) return NULL; return isl_schedule_tree_band_get_ast_build_options(node->tree); } /* Replace the AST build options associated to band node "node" by "options". */ __isl_give isl_schedule_node *isl_schedule_node_band_set_ast_build_options( __isl_take isl_schedule_node *node, __isl_take isl_union_set *options) { isl_schedule_tree *tree; if (!node || !options) goto error; tree = isl_schedule_tree_copy(node->tree); tree = isl_schedule_tree_band_set_ast_build_options(tree, options); return isl_schedule_node_graft_tree(node, tree); error: isl_schedule_node_free(node); isl_union_set_free(options); return NULL; } /* Make sure that that spaces of "node" and "mv" are the same. * Return -1 on error, reporting the error to the user. */ static int check_space_multi_val(__isl_keep isl_schedule_node *node, __isl_keep isl_multi_val *mv) { isl_space *node_space, *mv_space; int equal; node_space = isl_schedule_node_band_get_space(node); mv_space = isl_multi_val_get_space(mv); equal = isl_space_tuple_is_equal(node_space, isl_dim_set, mv_space, isl_dim_set); isl_space_free(mv_space); isl_space_free(node_space); if (equal < 0) return -1; if (!equal) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "spaces don't match", return -1); return 0; } /* Multiply the partial schedule of the band node "node" * with the factors in "mv". */ __isl_give isl_schedule_node *isl_schedule_node_band_scale( __isl_take isl_schedule_node *node, __isl_take isl_multi_val *mv) { isl_schedule_tree *tree; int anchored; if (!node || !mv) goto error; if (check_space_multi_val(node, mv) < 0) goto error; anchored = isl_schedule_node_is_subtree_anchored(node); if (anchored < 0) goto error; if (anchored) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "cannot scale band node with anchored subtree", goto error); tree = isl_schedule_node_get_tree(node); tree = isl_schedule_tree_band_scale(tree, mv); return isl_schedule_node_graft_tree(node, tree); error: isl_multi_val_free(mv); isl_schedule_node_free(node); return NULL; } /* Divide the partial schedule of the band node "node" * by the factors in "mv". */ __isl_give isl_schedule_node *isl_schedule_node_band_scale_down( __isl_take isl_schedule_node *node, __isl_take isl_multi_val *mv) { isl_schedule_tree *tree; int anchored; if (!node || !mv) goto error; if (check_space_multi_val(node, mv) < 0) goto error; anchored = isl_schedule_node_is_subtree_anchored(node); if (anchored < 0) goto error; if (anchored) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "cannot scale down band node with anchored subtree", goto error); tree = isl_schedule_node_get_tree(node); tree = isl_schedule_tree_band_scale_down(tree, mv); return isl_schedule_node_graft_tree(node, tree); error: isl_multi_val_free(mv); isl_schedule_node_free(node); return NULL; } /* Tile "node" with tile sizes "sizes". * * The current node is replaced by two nested nodes corresponding * to the tile dimensions and the point dimensions. * * Return a pointer to the outer (tile) node. * * If any of the descendants of "node" depend on the set of outer band nodes, * then we refuse to tile the node. * * 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) */ __isl_give isl_schedule_node *isl_schedule_node_band_tile( __isl_take isl_schedule_node *node, __isl_take isl_multi_val *sizes) { isl_schedule_tree *tree; int anchored; if (!node || !sizes) goto error; anchored = isl_schedule_node_is_subtree_anchored(node); if (anchored < 0) goto error; if (anchored) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "cannot tile band node with anchored subtree", goto error); if (check_space_multi_val(node, sizes) < 0) goto error; tree = isl_schedule_node_get_tree(node); tree = isl_schedule_tree_band_tile(tree, sizes); return isl_schedule_node_graft_tree(node, tree); error: isl_multi_val_free(sizes); isl_schedule_node_free(node); return NULL; } /* Move the band node "node" down to all the leaves in the subtree * rooted at "node". * Return a pointer to the node in the resulting tree that is in the same * position as the node pointed to by "node" in the original tree. * * If the node only has a leaf child, then nothing needs to be done. * Otherwise, the child of the node is removed and the result is * appended to all the leaves in the subtree rooted at the original child. * The original node is then replaced by the result of this operation. * * If any of the nodes in the subtree rooted at "node" depend on * the set of outer band nodes then we refuse to sink the band node. */ __isl_give isl_schedule_node *isl_schedule_node_band_sink( __isl_take isl_schedule_node *node) { enum isl_schedule_node_type type; isl_schedule_tree *tree, *child; int anchored; if (!node) return NULL; type = isl_schedule_node_get_type(node); if (type != isl_schedule_node_band) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "not a band node", isl_schedule_node_free(node)); anchored = isl_schedule_node_is_subtree_anchored(node); if (anchored < 0) return isl_schedule_node_free(node); if (anchored) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "cannot sink band node in anchored subtree", isl_schedule_node_free(node)); if (isl_schedule_tree_n_children(node->tree) == 0) return node; tree = isl_schedule_node_get_tree(node); child = isl_schedule_tree_get_child(tree, 0); tree = isl_schedule_tree_reset_children(tree); tree = isl_schedule_tree_append_to_leaves(child, tree); return isl_schedule_node_graft_tree(node, tree); } /* Split "node" into two nested band nodes, one with the first "pos" * dimensions and one with the remaining dimensions. * The schedules of the two band nodes live in anonymous spaces. */ __isl_give isl_schedule_node *isl_schedule_node_band_split( __isl_take isl_schedule_node *node, int pos) { isl_schedule_tree *tree; tree = isl_schedule_node_get_tree(node); tree = isl_schedule_tree_band_split(tree, pos); return isl_schedule_node_graft_tree(node, tree); } /* Return the context of the context node "node". */ __isl_give isl_set *isl_schedule_node_context_get_context( __isl_keep isl_schedule_node *node) { if (!node) return NULL; return isl_schedule_tree_context_get_context(node->tree); } /* Return the domain of the domain node "node". */ __isl_give isl_union_set *isl_schedule_node_domain_get_domain( __isl_keep isl_schedule_node *node) { if (!node) return NULL; return isl_schedule_tree_domain_get_domain(node->tree); } /* Return the expansion map of expansion node "node". */ __isl_give isl_union_map *isl_schedule_node_expansion_get_expansion( __isl_keep isl_schedule_node *node) { if (!node) return NULL; return isl_schedule_tree_expansion_get_expansion(node->tree); } /* Return the contraction of expansion node "node". */ __isl_give isl_union_pw_multi_aff *isl_schedule_node_expansion_get_contraction( __isl_keep isl_schedule_node *node) { if (!node) return NULL; return isl_schedule_tree_expansion_get_contraction(node->tree); } /* Replace the contraction and the expansion of the expansion node "node" * by "contraction" and "expansion". */ __isl_give isl_schedule_node * isl_schedule_node_expansion_set_contraction_and_expansion( __isl_take isl_schedule_node *node, __isl_take isl_union_pw_multi_aff *contraction, __isl_take isl_union_map *expansion) { isl_schedule_tree *tree; if (!node || !contraction || !expansion) goto error; tree = isl_schedule_tree_copy(node->tree); tree = isl_schedule_tree_expansion_set_contraction_and_expansion(tree, contraction, expansion); return isl_schedule_node_graft_tree(node, tree); error: isl_schedule_node_free(node); isl_union_pw_multi_aff_free(contraction); isl_union_map_free(expansion); return NULL; } /* Return the extension of the extension node "node". */ __isl_give isl_union_map *isl_schedule_node_extension_get_extension( __isl_keep isl_schedule_node *node) { if (!node) return NULL; return isl_schedule_tree_extension_get_extension(node->tree); } /* Replace the extension of extension node "node" by "extension". */ __isl_give isl_schedule_node *isl_schedule_node_extension_set_extension( __isl_take isl_schedule_node *node, __isl_take isl_union_map *extension) { isl_schedule_tree *tree; if (!node || !extension) goto error; tree = isl_schedule_tree_copy(node->tree); tree = isl_schedule_tree_extension_set_extension(tree, extension); return isl_schedule_node_graft_tree(node, tree); error: isl_schedule_node_free(node); isl_union_map_free(extension); return NULL; } /* Return the filter of the filter node "node". */ __isl_give isl_union_set *isl_schedule_node_filter_get_filter( __isl_keep isl_schedule_node *node) { if (!node) return NULL; return isl_schedule_tree_filter_get_filter(node->tree); } /* Replace the filter of filter node "node" by "filter". */ __isl_give isl_schedule_node *isl_schedule_node_filter_set_filter( __isl_take isl_schedule_node *node, __isl_take isl_union_set *filter) { isl_schedule_tree *tree; if (!node || !filter) goto error; tree = isl_schedule_tree_copy(node->tree); tree = isl_schedule_tree_filter_set_filter(tree, filter); return isl_schedule_node_graft_tree(node, tree); error: isl_schedule_node_free(node); isl_union_set_free(filter); return NULL; } /* Return the guard of the guard node "node". */ __isl_give isl_set *isl_schedule_node_guard_get_guard( __isl_keep isl_schedule_node *node) { if (!node) return NULL; return isl_schedule_tree_guard_get_guard(node->tree); } /* Return the mark identifier of the mark node "node". */ __isl_give isl_id *isl_schedule_node_mark_get_id( __isl_keep isl_schedule_node *node) { if (!node) return NULL; return isl_schedule_tree_mark_get_id(node->tree); } /* Replace the child at position "pos" of the sequence node "node" * by the children of sequence root node of "tree". */ __isl_give isl_schedule_node *isl_schedule_node_sequence_splice( __isl_take isl_schedule_node *node, int pos, __isl_take isl_schedule_tree *tree) { isl_schedule_tree *node_tree; if (!node || !tree) goto error; if (isl_schedule_node_get_type(node) != isl_schedule_node_sequence) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "not a sequence node", goto error); if (isl_schedule_tree_get_type(tree) != isl_schedule_node_sequence) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "not a sequence node", goto error); node_tree = isl_schedule_node_get_tree(node); node_tree = isl_schedule_tree_sequence_splice(node_tree, pos, tree); node = isl_schedule_node_graft_tree(node, node_tree); return node; error: isl_schedule_node_free(node); isl_schedule_tree_free(tree); return NULL; } /* Update the ancestors of "node" to point to the tree that "node" * now points to. * That is, replace the child in the original parent that corresponds * to the current tree position by node->tree and continue updating * the ancestors in the same way until the root is reached. * * If "fn" is not NULL, then it is called on each ancestor as we move up * the tree so that it can modify the ancestor before it is added * to the list of ancestors of the modified node. * The additional "pos" argument records the position * of the "tree" argument in the original schedule tree. * * If "node" originally points to a leaf of the schedule tree, then make sure * that in the end it points to a leaf in the updated schedule tree. */ static __isl_give isl_schedule_node *update_ancestors( __isl_take isl_schedule_node *node, __isl_give isl_schedule_tree *(*fn)(__isl_take isl_schedule_tree *tree, __isl_keep isl_schedule_node *pos, void *user), void *user) { int i, n; int is_leaf; isl_ctx *ctx; isl_schedule_tree *tree; isl_schedule_node *pos = NULL; if (fn) pos = isl_schedule_node_copy(node); node = isl_schedule_node_cow(node); if (!node) return isl_schedule_node_free(pos); ctx = isl_schedule_node_get_ctx(node); n = isl_schedule_tree_list_n_schedule_tree(node->ancestors); tree = isl_schedule_tree_copy(node->tree); for (i = n - 1; i >= 0; --i) { isl_schedule_tree *parent; parent = isl_schedule_tree_list_get_schedule_tree( node->ancestors, i); parent = isl_schedule_tree_replace_child(parent, node->child_pos[i], tree); if (fn) { pos = isl_schedule_node_parent(pos); parent = fn(parent, pos, user); } node->ancestors = isl_schedule_tree_list_set_schedule_tree( node->ancestors, i, isl_schedule_tree_copy(parent)); tree = parent; } if (fn) isl_schedule_node_free(pos); is_leaf = isl_schedule_tree_is_leaf(node->tree); node->schedule = isl_schedule_set_root(node->schedule, tree); if (is_leaf) { isl_schedule_tree_free(node->tree); node->tree = isl_schedule_node_get_leaf(node); } if (!node->schedule || !node->ancestors) return isl_schedule_node_free(node); return node; } /* Replace the subtree that "pos" points to by "tree", updating * the ancestors to maintain a consistent state. */ __isl_give isl_schedule_node *isl_schedule_node_graft_tree( __isl_take isl_schedule_node *pos, __isl_take isl_schedule_tree *tree) { if (!tree || !pos) goto error; if (pos->tree == tree) { isl_schedule_tree_free(tree); return pos; } pos = isl_schedule_node_cow(pos); if (!pos) goto error; isl_schedule_tree_free(pos->tree); pos->tree = tree; return update_ancestors(pos, NULL, NULL); error: isl_schedule_node_free(pos); isl_schedule_tree_free(tree); return NULL; } /* Make sure we can insert a node between "node" and its parent. * Return -1 on error, reporting the reason why we cannot insert a node. */ static int check_insert(__isl_keep isl_schedule_node *node) { int has_parent; enum isl_schedule_node_type type; has_parent = isl_schedule_node_has_parent(node); if (has_parent < 0) return -1; if (!has_parent) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "cannot insert node outside of root", return -1); type = isl_schedule_node_get_parent_type(node); if (type == isl_schedule_node_error) return -1; if (type == isl_schedule_node_set || type == isl_schedule_node_sequence) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "cannot insert node between set or sequence node " "and its filter children", return -1); return 0; } /* Insert a band node with partial schedule "mupa" between "node" and * its parent. * Return a pointer to the new band node. * * If any of the nodes in the subtree rooted at "node" depend on * the set of outer band nodes then we refuse to insert the band node. */ __isl_give isl_schedule_node *isl_schedule_node_insert_partial_schedule( __isl_take isl_schedule_node *node, __isl_take isl_multi_union_pw_aff *mupa) { int anchored; isl_schedule_band *band; isl_schedule_tree *tree; if (check_insert(node) < 0) node = isl_schedule_node_free(node); anchored = isl_schedule_node_is_subtree_anchored(node); if (anchored < 0) goto error; if (anchored) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "cannot insert band node in anchored subtree", goto error); tree = isl_schedule_node_get_tree(node); band = isl_schedule_band_from_multi_union_pw_aff(mupa); tree = isl_schedule_tree_insert_band(tree, band); node = isl_schedule_node_graft_tree(node, tree); return node; error: isl_schedule_node_free(node); isl_multi_union_pw_aff_free(mupa); return NULL; } /* Insert a context node with context "context" between "node" and its parent. * Return a pointer to the new context node. */ __isl_give isl_schedule_node *isl_schedule_node_insert_context( __isl_take isl_schedule_node *node, __isl_take isl_set *context) { isl_schedule_tree *tree; if (check_insert(node) < 0) node = isl_schedule_node_free(node); tree = isl_schedule_node_get_tree(node); tree = isl_schedule_tree_insert_context(tree, context); node = isl_schedule_node_graft_tree(node, tree); return node; } /* Insert an expansion node with the given "contraction" and "expansion" * between "node" and its parent. * Return a pointer to the new expansion node. * * Typically the domain and range spaces of the expansion are different. * This means that only one of them can refer to the current domain space * in a consistent tree. It is up to the caller to ensure that the tree * returns to a consistent state. */ __isl_give isl_schedule_node *isl_schedule_node_insert_expansion( __isl_take isl_schedule_node *node, __isl_take isl_union_pw_multi_aff *contraction, __isl_take isl_union_map *expansion) { isl_schedule_tree *tree; if (check_insert(node) < 0) node = isl_schedule_node_free(node); tree = isl_schedule_node_get_tree(node); tree = isl_schedule_tree_insert_expansion(tree, contraction, expansion); node = isl_schedule_node_graft_tree(node, tree); return node; } /* Insert an extension node with extension "extension" between "node" and * its parent. * Return a pointer to the new extension node. */ __isl_give isl_schedule_node *isl_schedule_node_insert_extension( __isl_take isl_schedule_node *node, __isl_take isl_union_map *extension) { isl_schedule_tree *tree; tree = isl_schedule_node_get_tree(node); tree = isl_schedule_tree_insert_extension(tree, extension); node = isl_schedule_node_graft_tree(node, tree); return node; } /* Insert a filter node with filter "filter" between "node" and its parent. * Return a pointer to the new filter node. */ __isl_give isl_schedule_node *isl_schedule_node_insert_filter( __isl_take isl_schedule_node *node, __isl_take isl_union_set *filter) { isl_schedule_tree *tree; if (check_insert(node) < 0) node = isl_schedule_node_free(node); tree = isl_schedule_node_get_tree(node); tree = isl_schedule_tree_insert_filter(tree, filter); node = isl_schedule_node_graft_tree(node, tree); return node; } /* Insert a guard node with guard "guard" between "node" and its parent. * Return a pointer to the new guard node. */ __isl_give isl_schedule_node *isl_schedule_node_insert_guard( __isl_take isl_schedule_node *node, __isl_take isl_set *guard) { isl_schedule_tree *tree; if (check_insert(node) < 0) node = isl_schedule_node_free(node); tree = isl_schedule_node_get_tree(node); tree = isl_schedule_tree_insert_guard(tree, guard); node = isl_schedule_node_graft_tree(node, tree); return node; } /* Insert a mark node with mark identifier "mark" between "node" and * its parent. * Return a pointer to the new mark node. */ __isl_give isl_schedule_node *isl_schedule_node_insert_mark( __isl_take isl_schedule_node *node, __isl_take isl_id *mark) { isl_schedule_tree *tree; if (check_insert(node) < 0) node = isl_schedule_node_free(node); tree = isl_schedule_node_get_tree(node); tree = isl_schedule_tree_insert_mark(tree, mark); node = isl_schedule_node_graft_tree(node, tree); return node; } /* Attach the current subtree of "node" to a sequence of filter tree nodes * with filters described by "filters", attach this sequence * of filter tree nodes as children to a new tree of type "type" and * replace the original subtree of "node" by this new tree. */ static __isl_give isl_schedule_node *isl_schedule_node_insert_children( __isl_take isl_schedule_node *node, enum isl_schedule_node_type type, __isl_take isl_union_set_list *filters) { int i, n; isl_ctx *ctx; isl_schedule_tree *tree; isl_schedule_tree_list *list; if (check_insert(node) < 0) node = isl_schedule_node_free(node); if (!node || !filters) goto error; ctx = isl_schedule_node_get_ctx(node); n = isl_union_set_list_n_union_set(filters); list = isl_schedule_tree_list_alloc(ctx, n); for (i = 0; i < n; ++i) { isl_schedule_tree *tree; isl_union_set *filter; tree = isl_schedule_node_get_tree(node); filter = isl_union_set_list_get_union_set(filters, i); tree = isl_schedule_tree_insert_filter(tree, filter); list = isl_schedule_tree_list_add(list, tree); } tree = isl_schedule_tree_from_children(type, list); node = isl_schedule_node_graft_tree(node, tree); isl_union_set_list_free(filters); return node; error: isl_union_set_list_free(filters); isl_schedule_node_free(node); return NULL; } /* Insert a sequence node with child filters "filters" between "node" and * its parent. That is, the tree that "node" points to is attached * to each of the child nodes of the filter nodes. * Return a pointer to the new sequence node. */ __isl_give isl_schedule_node *isl_schedule_node_insert_sequence( __isl_take isl_schedule_node *node, __isl_take isl_union_set_list *filters) { return isl_schedule_node_insert_children(node, isl_schedule_node_sequence, filters); } /* Insert a set node with child filters "filters" between "node" and * its parent. That is, the tree that "node" points to is attached * to each of the child nodes of the filter nodes. * Return a pointer to the new set node. */ __isl_give isl_schedule_node *isl_schedule_node_insert_set( __isl_take isl_schedule_node *node, __isl_take isl_union_set_list *filters) { return isl_schedule_node_insert_children(node, isl_schedule_node_set, filters); } /* Remove "node" from its schedule tree and return a pointer * to the leaf at the same position in the updated schedule tree. * * It is not allowed to remove the root of a schedule tree or * a child of a set or sequence node. */ __isl_give isl_schedule_node *isl_schedule_node_cut( __isl_take isl_schedule_node *node) { isl_schedule_tree *leaf; enum isl_schedule_node_type parent_type; if (!node) return NULL; if (!isl_schedule_node_has_parent(node)) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "cannot cut root", return isl_schedule_node_free(node)); parent_type = isl_schedule_node_get_parent_type(node); if (parent_type == isl_schedule_node_set || parent_type == isl_schedule_node_sequence) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "cannot cut child of set or sequence", return isl_schedule_node_free(node)); leaf = isl_schedule_node_get_leaf(node); return isl_schedule_node_graft_tree(node, leaf); } /* Remove a single node from the schedule tree, attaching the child * of "node" directly to its parent. * Return a pointer to this former child or to the leaf the position * of the original node if there was no child. * It is not allowed to remove the root of a schedule tree, * a set or sequence node, a child of a set or sequence node or * a band node with an anchored subtree. */ __isl_give isl_schedule_node *isl_schedule_node_delete( __isl_take isl_schedule_node *node) { int n; isl_schedule_tree *tree; enum isl_schedule_node_type type; if (!node) return NULL; if (isl_schedule_node_get_tree_depth(node) == 0) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "cannot delete root node", return isl_schedule_node_free(node)); n = isl_schedule_node_n_children(node); if (n != 1) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "can only delete node with a single child", return isl_schedule_node_free(node)); type = isl_schedule_node_get_parent_type(node); if (type == isl_schedule_node_sequence || type == isl_schedule_node_set) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "cannot delete child of set or sequence", return isl_schedule_node_free(node)); if (isl_schedule_node_get_type(node) == isl_schedule_node_band) { int anchored; anchored = isl_schedule_node_is_subtree_anchored(node); if (anchored < 0) return isl_schedule_node_free(node); if (anchored) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "cannot delete band node with anchored subtree", return isl_schedule_node_free(node)); } tree = isl_schedule_node_get_tree(node); if (!tree || isl_schedule_tree_has_children(tree)) { tree = isl_schedule_tree_child(tree, 0); } else { isl_schedule_tree_free(tree); tree = isl_schedule_node_get_leaf(node); } node = isl_schedule_node_graft_tree(node, tree); return node; } /* Internal data structure for the group_ancestor callback. * * If "finished" is set, then we no longer need to modify * any further ancestors. * * "contraction" and "expansion" represent the expansion * that reflects the grouping. * * "domain" contains the domain elements that reach the position * where the grouping is performed. That is, it is the range * of the resulting expansion. * "domain_universe" is the universe of "domain". * "group" is the set of group elements, i.e., the domain * of the resulting expansion. * "group_universe" is the universe of "group". * * "sched" is the schedule for the group elements, in pratice * an identity mapping on "group_universe". * "dim" is the dimension of "sched". */ struct isl_schedule_group_data { int finished; isl_union_map *expansion; isl_union_pw_multi_aff *contraction; isl_union_set *domain; isl_union_set *domain_universe; isl_union_set *group; isl_union_set *group_universe; int dim; isl_multi_aff *sched; }; /* Is domain covered by data->domain within data->domain_universe? */ static int locally_covered_by_domain(__isl_keep isl_union_set *domain, struct isl_schedule_group_data *data) { int is_subset; isl_union_set *test; test = isl_union_set_copy(domain); test = isl_union_set_intersect(test, isl_union_set_copy(data->domain_universe)); is_subset = isl_union_set_is_subset(test, data->domain); isl_union_set_free(test); return is_subset; } /* Update the band tree root "tree" to refer to the group instances * in data->group rather than the original domain elements in data->domain. * "pos" is the position in the original schedule tree where the modified * "tree" will be attached. * * Add the part of the identity schedule on the group instances data->sched * that corresponds to this band node to the band schedule. * If the domain elements that reach the node and that are part * of data->domain_universe are all elements of data->domain (and therefore * replaced by the group instances) then this data->domain_universe * is removed from the domain of the band schedule. */ static __isl_give isl_schedule_tree *group_band( __isl_take isl_schedule_tree *tree, __isl_keep isl_schedule_node *pos, struct isl_schedule_group_data *data) { isl_union_set *domain; isl_multi_aff *ma; isl_multi_union_pw_aff *mupa, *partial; int is_covered; int depth, n, has_id; domain = isl_schedule_node_get_domain(pos); is_covered = locally_covered_by_domain(domain, data); if (is_covered >= 0 && is_covered) { domain = isl_union_set_universe(domain); domain = isl_union_set_subtract(domain, isl_union_set_copy(data->domain_universe)); tree = isl_schedule_tree_band_intersect_domain(tree, domain); } else isl_union_set_free(domain); if (is_covered < 0) return isl_schedule_tree_free(tree); depth = isl_schedule_node_get_schedule_depth(pos); n = isl_schedule_tree_band_n_member(tree); ma = isl_multi_aff_copy(data->sched); ma = isl_multi_aff_drop_dims(ma, isl_dim_out, 0, depth); ma = isl_multi_aff_drop_dims(ma, isl_dim_out, n, data->dim - depth - n); mupa = isl_multi_union_pw_aff_from_multi_aff(ma); partial = isl_schedule_tree_band_get_partial_schedule(tree); has_id = isl_multi_union_pw_aff_has_tuple_id(partial, isl_dim_set); if (has_id < 0) { partial = isl_multi_union_pw_aff_free(partial); } else if (has_id) { isl_id *id; id = isl_multi_union_pw_aff_get_tuple_id(partial, isl_dim_set); mupa = isl_multi_union_pw_aff_set_tuple_id(mupa, isl_dim_set, id); } partial = isl_multi_union_pw_aff_union_add(partial, mupa); tree = isl_schedule_tree_band_set_partial_schedule(tree, partial); return tree; } /* Drop the parameters in "uset" that are not also in "space". * "n" is the number of parameters in "space". */ static __isl_give isl_union_set *union_set_drop_extra_params( __isl_take isl_union_set *uset, __isl_keep isl_space *space, int n) { int n2; uset = isl_union_set_align_params(uset, isl_space_copy(space)); n2 = isl_union_set_dim(uset, isl_dim_param); uset = isl_union_set_project_out(uset, isl_dim_param, n, n2 - n); return uset; } /* Update the context tree root "tree" to refer to the group instances * in data->group rather than the original domain elements in data->domain. * "pos" is the position in the original schedule tree where the modified * "tree" will be attached. * * We do not actually need to update "tree" since a context node only * refers to the schedule space. However, we may need to update "data" * to not refer to any parameters introduced by the context node. */ static __isl_give isl_schedule_tree *group_context( __isl_take isl_schedule_tree *tree, __isl_keep isl_schedule_node *pos, struct isl_schedule_group_data *data) { isl_space *space; isl_union_set *domain; int n1, n2; int involves; if (isl_schedule_node_get_tree_depth(pos) == 1) return tree; domain = isl_schedule_node_get_universe_domain(pos); space = isl_union_set_get_space(domain); isl_union_set_free(domain); n1 = isl_space_dim(space, isl_dim_param); data->expansion = isl_union_map_align_params(data->expansion, space); n2 = isl_union_map_dim(data->expansion, isl_dim_param); if (!data->expansion) return isl_schedule_tree_free(tree); if (n1 == n2) return tree; involves = isl_union_map_involves_dims(data->expansion, isl_dim_param, n1, n2 - n1); if (involves < 0) return isl_schedule_tree_free(tree); if (involves) isl_die(isl_schedule_node_get_ctx(pos), isl_error_invalid, "grouping cannot only refer to global parameters", return isl_schedule_tree_free(tree)); data->expansion = isl_union_map_project_out(data->expansion, isl_dim_param, n1, n2 - n1); space = isl_union_map_get_space(data->expansion); data->contraction = isl_union_pw_multi_aff_align_params( data->contraction, isl_space_copy(space)); n2 = isl_union_pw_multi_aff_dim(data->contraction, isl_dim_param); data->contraction = isl_union_pw_multi_aff_drop_dims(data->contraction, isl_dim_param, n1, n2 - n1); data->domain = union_set_drop_extra_params(data->domain, space, n1); data->domain_universe = union_set_drop_extra_params(data->domain_universe, space, n1); data->group = union_set_drop_extra_params(data->group, space, n1); data->group_universe = union_set_drop_extra_params(data->group_universe, space, n1); data->sched = isl_multi_aff_align_params(data->sched, isl_space_copy(space)); n2 = isl_multi_aff_dim(data->sched, isl_dim_param); data->sched = isl_multi_aff_drop_dims(data->sched, isl_dim_param, n1, n2 - n1); isl_space_free(space); return tree; } /* Update the domain tree root "tree" to refer to the group instances * in data->group rather than the original domain elements in data->domain. * "pos" is the position in the original schedule tree where the modified * "tree" will be attached. * * We first double-check that all grouped domain elements are actually * part of the root domain and then replace those elements by the group * instances. */ static __isl_give isl_schedule_tree *group_domain( __isl_take isl_schedule_tree *tree, __isl_keep isl_schedule_node *pos, struct isl_schedule_group_data *data) { isl_union_set *domain; int is_subset; domain = isl_schedule_tree_domain_get_domain(tree); is_subset = isl_union_set_is_subset(data->domain, domain); isl_union_set_free(domain); if (is_subset < 0) return isl_schedule_tree_free(tree); if (!is_subset) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_internal, "grouped domain should be part of outer domain", return isl_schedule_tree_free(tree)); domain = isl_schedule_tree_domain_get_domain(tree); domain = isl_union_set_subtract(domain, isl_union_set_copy(data->domain)); domain = isl_union_set_union(domain, isl_union_set_copy(data->group)); tree = isl_schedule_tree_domain_set_domain(tree, domain); return tree; } /* Update the expansion tree root "tree" to refer to the group instances * in data->group rather than the original domain elements in data->domain. * "pos" is the position in the original schedule tree where the modified * "tree" will be attached. * * Let G_1 -> D_1 be the expansion of "tree" and G_2 -> D_2 the newly * introduced expansion in a descendant of "tree". * We first double-check that D_2 is a subset of D_1. * Then we remove D_2 from the range of G_1 -> D_1 and add the mapping * G_1 -> D_1 . D_2 -> G_2. * Simmilarly, we restrict the domain of the contraction to the universe * of the range of the updated expansion and add G_2 -> D_2 . D_1 -> G_1, * attempting to remove the domain constraints of this additional part. */ static __isl_give isl_schedule_tree *group_expansion( __isl_take isl_schedule_tree *tree, __isl_keep isl_schedule_node *pos, struct isl_schedule_group_data *data) { isl_union_set *domain; isl_union_map *expansion, *umap; isl_union_pw_multi_aff *contraction, *upma; int is_subset; expansion = isl_schedule_tree_expansion_get_expansion(tree); domain = isl_union_map_range(expansion); is_subset = isl_union_set_is_subset(data->domain, domain); isl_union_set_free(domain); if (is_subset < 0) return isl_schedule_tree_free(tree); if (!is_subset) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_internal, "grouped domain should be part " "of outer expansion domain", return isl_schedule_tree_free(tree)); expansion = isl_schedule_tree_expansion_get_expansion(tree); umap = isl_union_map_from_union_pw_multi_aff( isl_union_pw_multi_aff_copy(data->contraction)); umap = isl_union_map_apply_range(expansion, umap); expansion = isl_schedule_tree_expansion_get_expansion(tree); expansion = isl_union_map_subtract_range(expansion, isl_union_set_copy(data->domain)); expansion = isl_union_map_union(expansion, umap); umap = isl_union_map_universe(isl_union_map_copy(expansion)); domain = isl_union_map_range(umap); contraction = isl_schedule_tree_expansion_get_contraction(tree); umap = isl_union_map_from_union_pw_multi_aff(contraction); umap = isl_union_map_apply_range(isl_union_map_copy(data->expansion), umap); upma = isl_union_pw_multi_aff_from_union_map(umap); contraction = isl_schedule_tree_expansion_get_contraction(tree); contraction = isl_union_pw_multi_aff_intersect_domain(contraction, domain); domain = isl_union_pw_multi_aff_domain( isl_union_pw_multi_aff_copy(upma)); upma = isl_union_pw_multi_aff_gist(upma, domain); contraction = isl_union_pw_multi_aff_union_add(contraction, upma); tree = isl_schedule_tree_expansion_set_contraction_and_expansion(tree, contraction, expansion); return tree; } /* Update the tree root "tree" to refer to the group instances * in data->group rather than the original domain elements in data->domain. * "pos" is the position in the original schedule tree where the modified * "tree" will be attached. * * If we have come across a domain or expansion node before (data->finished * is set), then we no longer need perform any modifications. * * If "tree" is a filter, then we add data->group_universe to the filter. * We also remove data->domain_universe from the filter if all the domain * elements in this universe that reach the filter node are part of * the elements that are being grouped by data->expansion. * If "tree" is a band, domain or expansion, then it is handled * in a separate function. */ static __isl_give isl_schedule_tree *group_ancestor( __isl_take isl_schedule_tree *tree, __isl_keep isl_schedule_node *pos, void *user) { struct isl_schedule_group_data *data = user; isl_union_set *domain; int is_covered; if (!tree || !pos) return isl_schedule_tree_free(tree); if (data->finished) return tree; switch (isl_schedule_tree_get_type(tree)) { case isl_schedule_node_error: return isl_schedule_tree_free(tree); case isl_schedule_node_extension: isl_die(isl_schedule_tree_get_ctx(tree), isl_error_unsupported, "grouping not allowed in extended tree", return isl_schedule_tree_free(tree)); case isl_schedule_node_band: tree = group_band(tree, pos, data); break; case isl_schedule_node_context: tree = group_context(tree, pos, data); break; case isl_schedule_node_domain: tree = group_domain(tree, pos, data); data->finished = 1; break; case isl_schedule_node_filter: domain = isl_schedule_node_get_domain(pos); is_covered = locally_covered_by_domain(domain, data); isl_union_set_free(domain); if (is_covered < 0) return isl_schedule_tree_free(tree); domain = isl_schedule_tree_filter_get_filter(tree); if (is_covered) domain = isl_union_set_subtract(domain, isl_union_set_copy(data->domain_universe)); domain = isl_union_set_union(domain, isl_union_set_copy(data->group_universe)); tree = isl_schedule_tree_filter_set_filter(tree, domain); break; case isl_schedule_node_expansion: tree = group_expansion(tree, pos, data); data->finished = 1; break; case isl_schedule_node_leaf: case isl_schedule_node_guard: case isl_schedule_node_mark: case isl_schedule_node_sequence: case isl_schedule_node_set: break; } return tree; } /* Group the domain elements that reach "node" into instances * of a single statement with identifier "group_id". * In particular, group the domain elements according to their * prefix schedule. * * That is, introduce an expansion node with as contraction * the prefix schedule (with the target space replaced by "group_id") * and as expansion the inverse of this contraction (with its range * intersected with the domain elements that reach "node"). * The outer nodes are then modified to refer to the group instances * instead of the original domain elements. * * No instance of "group_id" is allowed to reach "node" prior * to the grouping. * No ancestor of "node" is allowed to be an extension node. * * Return a pointer to original node in tree, i.e., the child * of the newly introduced expansion node. */ __isl_give isl_schedule_node *isl_schedule_node_group( __isl_take isl_schedule_node *node, __isl_take isl_id *group_id) { struct isl_schedule_group_data data = { 0 }; isl_space *space; isl_union_set *domain; isl_union_pw_multi_aff *contraction; isl_union_map *expansion; int disjoint; if (!node || !group_id) goto error; if (check_insert(node) < 0) goto error; domain = isl_schedule_node_get_domain(node); data.domain = isl_union_set_copy(domain); data.domain_universe = isl_union_set_copy(domain); data.domain_universe = isl_union_set_universe(data.domain_universe); data.dim = isl_schedule_node_get_schedule_depth(node); if (data.dim == 0) { isl_ctx *ctx; isl_set *set; isl_union_set *group; isl_union_map *univ; ctx = isl_schedule_node_get_ctx(node); space = isl_space_set_alloc(ctx, 0, 0); space = isl_space_set_tuple_id(space, isl_dim_set, group_id); set = isl_set_universe(isl_space_copy(space)); group = isl_union_set_from_set(set); expansion = isl_union_map_from_domain_and_range(domain, group); univ = isl_union_map_universe(isl_union_map_copy(expansion)); contraction = isl_union_pw_multi_aff_from_union_map(univ); expansion = isl_union_map_reverse(expansion); } else { isl_multi_union_pw_aff *prefix; isl_union_set *univ; prefix = isl_schedule_node_get_prefix_schedule_multi_union_pw_aff(node); prefix = isl_multi_union_pw_aff_set_tuple_id(prefix, isl_dim_set, group_id); space = isl_multi_union_pw_aff_get_space(prefix); contraction = isl_union_pw_multi_aff_from_multi_union_pw_aff( prefix); univ = isl_union_set_universe(isl_union_set_copy(domain)); contraction = isl_union_pw_multi_aff_intersect_domain(contraction, univ); expansion = isl_union_map_from_union_pw_multi_aff( isl_union_pw_multi_aff_copy(contraction)); expansion = isl_union_map_reverse(expansion); expansion = isl_union_map_intersect_range(expansion, domain); } space = isl_space_map_from_set(space); data.sched = isl_multi_aff_identity(space); data.group = isl_union_map_domain(isl_union_map_copy(expansion)); data.group = isl_union_set_coalesce(data.group); data.group_universe = isl_union_set_copy(data.group); data.group_universe = isl_union_set_universe(data.group_universe); data.expansion = isl_union_map_copy(expansion); data.contraction = isl_union_pw_multi_aff_copy(contraction); node = isl_schedule_node_insert_expansion(node, contraction, expansion); disjoint = isl_union_set_is_disjoint(data.domain_universe, data.group_universe); node = update_ancestors(node, &group_ancestor, &data); isl_union_set_free(data.domain); isl_union_set_free(data.domain_universe); isl_union_set_free(data.group); isl_union_set_free(data.group_universe); isl_multi_aff_free(data.sched); isl_union_map_free(data.expansion); isl_union_pw_multi_aff_free(data.contraction); node = isl_schedule_node_child(node, 0); if (!node || disjoint < 0) return isl_schedule_node_free(node); if (!disjoint) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "group instances already reach node", isl_schedule_node_free(node)); return node; error: isl_schedule_node_free(node); isl_id_free(group_id); return NULL; } /* Compute the gist of the given band node with respect to "context". */ __isl_give isl_schedule_node *isl_schedule_node_band_gist( __isl_take isl_schedule_node *node, __isl_take isl_union_set *context) { isl_schedule_tree *tree; tree = isl_schedule_node_get_tree(node); tree = isl_schedule_tree_band_gist(tree, context); return isl_schedule_node_graft_tree(node, tree); } /* Internal data structure for isl_schedule_node_gist. * "n_expansion" is the number of outer expansion nodes * with respect to the current position * "filters" contains an element for each outer filter, expansion or * extension node with respect to the current position, each representing * the intersection of the previous element and the filter on the filter node * or the expansion/extension of the previous element. * The first element in the original context passed to isl_schedule_node_gist. */ struct isl_node_gist_data { int n_expansion; isl_union_set_list *filters; }; /* Enter the expansion node "node" during a isl_schedule_node_gist traversal. * * In particular, add an extra element to data->filters containing * the expansion of the previous element and replace the expansion * and contraction on "node" by the gist with respect to these filters. * Also keep track of the fact that we have entered another expansion. */ static __isl_give isl_schedule_node *gist_enter_expansion( __isl_take isl_schedule_node *node, struct isl_node_gist_data *data) { int n; isl_union_set *inner; isl_union_map *expansion; isl_union_pw_multi_aff *contraction; data->n_expansion++; n = isl_union_set_list_n_union_set(data->filters); inner = isl_union_set_list_get_union_set(data->filters, n - 1); expansion = isl_schedule_node_expansion_get_expansion(node); inner = isl_union_set_apply(inner, expansion); contraction = isl_schedule_node_expansion_get_contraction(node); contraction = isl_union_pw_multi_aff_gist(contraction, isl_union_set_copy(inner)); data->filters = isl_union_set_list_add(data->filters, inner); inner = isl_union_set_list_get_union_set(data->filters, n - 1); expansion = isl_schedule_node_expansion_get_expansion(node); expansion = isl_union_map_gist_domain(expansion, inner); node = isl_schedule_node_expansion_set_contraction_and_expansion(node, contraction, expansion); return node; } /* Enter the extension node "node" during a isl_schedule_node_gist traversal. * * In particular, add an extra element to data->filters containing * the union of the previous element with the additional domain elements * introduced by the extension. */ static __isl_give isl_schedule_node *gist_enter_extension( __isl_take isl_schedule_node *node, struct isl_node_gist_data *data) { int n; isl_union_set *inner, *extra; isl_union_map *extension; n = isl_union_set_list_n_union_set(data->filters); inner = isl_union_set_list_get_union_set(data->filters, n - 1); extension = isl_schedule_node_extension_get_extension(node); extra = isl_union_map_range(extension); inner = isl_union_set_union(inner, extra); data->filters = isl_union_set_list_add(data->filters, inner); return node; } /* Can we finish gisting at this node? * That is, is the filter on the current filter node a subset of * the original context passed to isl_schedule_node_gist? * If we have gone through any expansions, then we cannot perform * this test since the current domain elements are incomparable * to the domain elements in the original context. */ static int gist_done(__isl_keep isl_schedule_node *node, struct isl_node_gist_data *data) { isl_union_set *filter, *outer; int subset; if (data->n_expansion != 0) return 0; filter = isl_schedule_node_filter_get_filter(node); outer = isl_union_set_list_get_union_set(data->filters, 0); subset = isl_union_set_is_subset(filter, outer); isl_union_set_free(outer); isl_union_set_free(filter); return subset; } /* Callback for "traverse" to enter a node and to move * to the deepest initial subtree that should be traversed * by isl_schedule_node_gist. * * The "filters" list is extended by one element each time * we come across a filter node by the result of intersecting * the last element in the list with the filter on the filter node. * * If the filter on the current filter node is a subset of * the original context passed to isl_schedule_node_gist, * then there is no need to go into its subtree since it cannot * be further simplified by the context. The "filters" list is * still extended for consistency, but the actual value of the * added element is immaterial since it will not be used. * * Otherwise, the filter on the current filter node is replaced by * the gist of the original filter with respect to the intersection * of the original context with the intermediate filters. * * If the new element in the "filters" list is empty, then no elements * can reach the descendants of the current filter node. The subtree * underneath the filter node is therefore removed. * * Each expansion node we come across is handled by * gist_enter_expansion. * * Each extension node we come across is handled by * gist_enter_extension. */ static __isl_give isl_schedule_node *gist_enter( __isl_take isl_schedule_node *node, void *user) { struct isl_node_gist_data *data = user; do { isl_union_set *filter, *inner; int done, empty; int n; switch (isl_schedule_node_get_type(node)) { case isl_schedule_node_error: return isl_schedule_node_free(node); case isl_schedule_node_expansion: node = gist_enter_expansion(node, data); continue; case isl_schedule_node_extension: node = gist_enter_extension(node, data); continue; case isl_schedule_node_band: case isl_schedule_node_context: case isl_schedule_node_domain: case isl_schedule_node_guard: case isl_schedule_node_leaf: case isl_schedule_node_mark: case isl_schedule_node_sequence: case isl_schedule_node_set: continue; case isl_schedule_node_filter: break; } done = gist_done(node, data); filter = isl_schedule_node_filter_get_filter(node); if (done < 0 || done) { data->filters = isl_union_set_list_add(data->filters, filter); if (done < 0) return isl_schedule_node_free(node); return node; } n = isl_union_set_list_n_union_set(data->filters); inner = isl_union_set_list_get_union_set(data->filters, n - 1); filter = isl_union_set_gist(filter, isl_union_set_copy(inner)); node = isl_schedule_node_filter_set_filter(node, isl_union_set_copy(filter)); filter = isl_union_set_intersect(filter, inner); empty = isl_union_set_is_empty(filter); data->filters = isl_union_set_list_add(data->filters, filter); if (empty < 0) return isl_schedule_node_free(node); if (!empty) continue; node = isl_schedule_node_child(node, 0); node = isl_schedule_node_cut(node); node = isl_schedule_node_parent(node); return node; } while (isl_schedule_node_has_children(node) && (node = isl_schedule_node_first_child(node)) != NULL); return node; } /* Callback for "traverse" to leave a node for isl_schedule_node_gist. * * In particular, if the current node is a filter node, then we remove * the element on the "filters" list that was added when we entered * the node. There is no need to compute any gist here, since we * already did that when we entered the node. * * If the current node is an expansion, then we decrement * the number of outer expansions and remove the element * in data->filters that was added by gist_enter_expansion. * * If the current node is an extension, then remove the element * in data->filters that was added by gist_enter_extension. * * If the current node is a band node, then we compute the gist of * the band node with respect to the intersection of the original context * and the intermediate filters. * * If the current node is a sequence or set node, then some of * the filter children may have become empty and so they are removed. * If only one child is left, then the set or sequence node along with * the single remaining child filter is removed. The filter can be * removed because the filters on a sequence or set node are supposed * to partition the incoming domain instances. * In principle, it should then be impossible for there to be zero * remaining children, but should this happen, we replace the entire * subtree with an empty filter. */ static __isl_give isl_schedule_node *gist_leave( __isl_take isl_schedule_node *node, void *user) { struct isl_node_gist_data *data = user; isl_schedule_tree *tree; int i, n; isl_union_set *filter; switch (isl_schedule_node_get_type(node)) { case isl_schedule_node_error: return isl_schedule_node_free(node); case isl_schedule_node_expansion: data->n_expansion--; case isl_schedule_node_extension: case isl_schedule_node_filter: n = isl_union_set_list_n_union_set(data->filters); data->filters = isl_union_set_list_drop(data->filters, n - 1, 1); break; case isl_schedule_node_band: n = isl_union_set_list_n_union_set(data->filters); filter = isl_union_set_list_get_union_set(data->filters, n - 1); node = isl_schedule_node_band_gist(node, filter); break; case isl_schedule_node_set: case isl_schedule_node_sequence: tree = isl_schedule_node_get_tree(node); n = isl_schedule_tree_n_children(tree); for (i = n - 1; i >= 0; --i) { isl_schedule_tree *child; isl_union_set *filter; int empty; child = isl_schedule_tree_get_child(tree, i); filter = isl_schedule_tree_filter_get_filter(child); empty = isl_union_set_is_empty(filter); isl_union_set_free(filter); isl_schedule_tree_free(child); if (empty < 0) tree = isl_schedule_tree_free(tree); else if (empty) tree = isl_schedule_tree_drop_child(tree, i); } n = isl_schedule_tree_n_children(tree); node = isl_schedule_node_graft_tree(node, tree); if (n == 1) { node = isl_schedule_node_delete(node); node = isl_schedule_node_delete(node); } else if (n == 0) { isl_space *space; filter = isl_union_set_list_get_union_set(data->filters, 0); space = isl_union_set_get_space(filter); isl_union_set_free(filter); filter = isl_union_set_empty(space); node = isl_schedule_node_cut(node); node = isl_schedule_node_insert_filter(node, filter); } break; case isl_schedule_node_context: case isl_schedule_node_domain: case isl_schedule_node_guard: case isl_schedule_node_leaf: case isl_schedule_node_mark: break; } return node; } /* Compute the gist of the subtree at "node" with respect to * the reaching domain elements in "context". * In particular, compute the gist of all band and filter nodes * in the subtree with respect to "context". Children of set or sequence * nodes that end up with an empty filter are removed completely. * * We keep track of the intersection of "context" with all outer filters * of the current node within the subtree in the final element of "filters". * Initially, this list contains the single element "context" and it is * extended or shortened each time we enter or leave a filter node. */ __isl_give isl_schedule_node *isl_schedule_node_gist( __isl_take isl_schedule_node *node, __isl_take isl_union_set *context) { struct isl_node_gist_data data; data.n_expansion = 0; data.filters = isl_union_set_list_from_union_set(context); node = traverse(node, &gist_enter, &gist_leave, &data); isl_union_set_list_free(data.filters); return node; } /* Intersect the domain of domain node "node" with "domain". * * If the domain of "node" is already a subset of "domain", * then nothing needs to be changed. * * Otherwise, we replace the domain of the domain node by the intersection * and simplify the subtree rooted at "node" with respect to this intersection. */ __isl_give isl_schedule_node *isl_schedule_node_domain_intersect_domain( __isl_take isl_schedule_node *node, __isl_take isl_union_set *domain) { isl_schedule_tree *tree; isl_union_set *uset; int is_subset; if (!node || !domain) goto error; uset = isl_schedule_tree_domain_get_domain(node->tree); is_subset = isl_union_set_is_subset(uset, domain); isl_union_set_free(uset); if (is_subset < 0) goto error; if (is_subset) { isl_union_set_free(domain); return node; } tree = isl_schedule_tree_copy(node->tree); uset = isl_schedule_tree_domain_get_domain(tree); uset = isl_union_set_intersect(uset, domain); tree = isl_schedule_tree_domain_set_domain(tree, isl_union_set_copy(uset)); node = isl_schedule_node_graft_tree(node, tree); node = isl_schedule_node_child(node, 0); node = isl_schedule_node_gist(node, uset); node = isl_schedule_node_parent(node); return node; error: isl_schedule_node_free(node); isl_union_set_free(domain); return NULL; } /* Internal data structure for isl_schedule_node_get_subtree_expansion. * "expansions" contains a list of accumulated expansions * for each outer expansion, set or sequence node. The first element * in the list is an identity mapping on the reaching domain elements. * "res" collects the results. */ struct isl_subtree_expansion_data { isl_union_map_list *expansions; isl_union_map *res; }; /* Callback for "traverse" to enter a node and to move * to the deepest initial subtree that should be traversed * by isl_schedule_node_get_subtree_expansion. * * Whenever we come across an expansion node, the last element * of data->expansions is combined with the expansion * on the expansion node. * * Whenever we come across a filter node that is the child * of a set or sequence node, data->expansions is extended * with a new element that restricts the previous element * to the elements selected by the filter. * The previous element can then be reused while backtracking. */ static __isl_give isl_schedule_node *subtree_expansion_enter( __isl_take isl_schedule_node *node, void *user) { struct isl_subtree_expansion_data *data = user; do { enum isl_schedule_node_type type; isl_union_set *filter; isl_union_map *inner, *expansion; int n; switch (isl_schedule_node_get_type(node)) { case isl_schedule_node_error: return isl_schedule_node_free(node); case isl_schedule_node_filter: type = isl_schedule_node_get_parent_type(node); if (type != isl_schedule_node_set && type != isl_schedule_node_sequence) break; filter = isl_schedule_node_filter_get_filter(node); n = isl_union_map_list_n_union_map(data->expansions); inner = isl_union_map_list_get_union_map(data->expansions, n - 1); inner = isl_union_map_intersect_range(inner, filter); data->expansions = isl_union_map_list_add(data->expansions, inner); break; case isl_schedule_node_expansion: n = isl_union_map_list_n_union_map(data->expansions); expansion = isl_schedule_node_expansion_get_expansion(node); inner = isl_union_map_list_get_union_map(data->expansions, n - 1); inner = isl_union_map_apply_range(inner, expansion); data->expansions = isl_union_map_list_set_union_map(data->expansions, n - 1, inner); break; case isl_schedule_node_band: case isl_schedule_node_context: case isl_schedule_node_domain: case isl_schedule_node_extension: case isl_schedule_node_guard: case isl_schedule_node_leaf: case isl_schedule_node_mark: case isl_schedule_node_sequence: case isl_schedule_node_set: break; } } while (isl_schedule_node_has_children(node) && (node = isl_schedule_node_first_child(node)) != NULL); return node; } /* Callback for "traverse" to leave a node for * isl_schedule_node_get_subtree_expansion. * * If we come across a filter node that is the child * of a set or sequence node, then we remove the element * of data->expansions that was added in subtree_expansion_enter. * * If we reach a leaf node, then the accumulated expansion is * added to data->res. */ static __isl_give isl_schedule_node *subtree_expansion_leave( __isl_take isl_schedule_node *node, void *user) { struct isl_subtree_expansion_data *data = user; int n; isl_union_map *inner; enum isl_schedule_node_type type; switch (isl_schedule_node_get_type(node)) { case isl_schedule_node_error: return isl_schedule_node_free(node); case isl_schedule_node_filter: type = isl_schedule_node_get_parent_type(node); if (type != isl_schedule_node_set && type != isl_schedule_node_sequence) break; n = isl_union_map_list_n_union_map(data->expansions); data->expansions = isl_union_map_list_drop(data->expansions, n - 1, 1); break; case isl_schedule_node_leaf: n = isl_union_map_list_n_union_map(data->expansions); inner = isl_union_map_list_get_union_map(data->expansions, n - 1); data->res = isl_union_map_union(data->res, inner); break; case isl_schedule_node_band: case isl_schedule_node_context: case isl_schedule_node_domain: case isl_schedule_node_expansion: case isl_schedule_node_extension: case isl_schedule_node_guard: case isl_schedule_node_mark: case isl_schedule_node_sequence: case isl_schedule_node_set: break; } return node; } /* Return a mapping from the domain elements that reach "node" * to the corresponding domain elements in the leaves of the subtree * rooted at "node" obtained by composing the intermediate expansions. * * We start out with an identity mapping between the domain elements * that reach "node" and compose it with all the expansions * on a path from "node" to a leaf while traversing the subtree. * Within the children of an a sequence or set node, the * accumulated expansion is restricted to the elements selected * by the filter child. */ __isl_give isl_union_map *isl_schedule_node_get_subtree_expansion( __isl_keep isl_schedule_node *node) { struct isl_subtree_expansion_data data; isl_space *space; isl_union_set *domain; isl_union_map *expansion; if (!node) return NULL; domain = isl_schedule_node_get_universe_domain(node); space = isl_union_set_get_space(domain); expansion = isl_union_set_identity(domain); data.res = isl_union_map_empty(space); data.expansions = isl_union_map_list_from_union_map(expansion); node = isl_schedule_node_copy(node); node = traverse(node, &subtree_expansion_enter, &subtree_expansion_leave, &data); if (!node) data.res = isl_union_map_free(data.res); isl_schedule_node_free(node); isl_union_map_list_free(data.expansions); return data.res; } /* Internal data structure for isl_schedule_node_get_subtree_contraction. * "contractions" contains a list of accumulated contractions * for each outer expansion, set or sequence node. The first element * in the list is an identity mapping on the reaching domain elements. * "res" collects the results. */ struct isl_subtree_contraction_data { isl_union_pw_multi_aff_list *contractions; isl_union_pw_multi_aff *res; }; /* Callback for "traverse" to enter a node and to move * to the deepest initial subtree that should be traversed * by isl_schedule_node_get_subtree_contraction. * * Whenever we come across an expansion node, the last element * of data->contractions is combined with the contraction * on the expansion node. * * Whenever we come across a filter node that is the child * of a set or sequence node, data->contractions is extended * with a new element that restricts the previous element * to the elements selected by the filter. * The previous element can then be reused while backtracking. */ static __isl_give isl_schedule_node *subtree_contraction_enter( __isl_take isl_schedule_node *node, void *user) { struct isl_subtree_contraction_data *data = user; do { enum isl_schedule_node_type type; isl_union_set *filter; isl_union_pw_multi_aff *inner, *contraction; int n; switch (isl_schedule_node_get_type(node)) { case isl_schedule_node_error: return isl_schedule_node_free(node); case isl_schedule_node_filter: type = isl_schedule_node_get_parent_type(node); if (type != isl_schedule_node_set && type != isl_schedule_node_sequence) break; filter = isl_schedule_node_filter_get_filter(node); n = isl_union_pw_multi_aff_list_n_union_pw_multi_aff( data->contractions); inner = isl_union_pw_multi_aff_list_get_union_pw_multi_aff( data->contractions, n - 1); inner = isl_union_pw_multi_aff_intersect_domain(inner, filter); data->contractions = isl_union_pw_multi_aff_list_add(data->contractions, inner); break; case isl_schedule_node_expansion: n = isl_union_pw_multi_aff_list_n_union_pw_multi_aff( data->contractions); contraction = isl_schedule_node_expansion_get_contraction(node); inner = isl_union_pw_multi_aff_list_get_union_pw_multi_aff( data->contractions, n - 1); inner = isl_union_pw_multi_aff_pullback_union_pw_multi_aff( inner, contraction); data->contractions = isl_union_pw_multi_aff_list_set_union_pw_multi_aff( data->contractions, n - 1, inner); break; case isl_schedule_node_band: case isl_schedule_node_context: case isl_schedule_node_domain: case isl_schedule_node_extension: case isl_schedule_node_guard: case isl_schedule_node_leaf: case isl_schedule_node_mark: case isl_schedule_node_sequence: case isl_schedule_node_set: break; } } while (isl_schedule_node_has_children(node) && (node = isl_schedule_node_first_child(node)) != NULL); return node; } /* Callback for "traverse" to leave a node for * isl_schedule_node_get_subtree_contraction. * * If we come across a filter node that is the child * of a set or sequence node, then we remove the element * of data->contractions that was added in subtree_contraction_enter. * * If we reach a leaf node, then the accumulated contraction is * added to data->res. */ static __isl_give isl_schedule_node *subtree_contraction_leave( __isl_take isl_schedule_node *node, void *user) { struct isl_subtree_contraction_data *data = user; int n; isl_union_pw_multi_aff *inner; enum isl_schedule_node_type type; switch (isl_schedule_node_get_type(node)) { case isl_schedule_node_error: return isl_schedule_node_free(node); case isl_schedule_node_filter: type = isl_schedule_node_get_parent_type(node); if (type != isl_schedule_node_set && type != isl_schedule_node_sequence) break; n = isl_union_pw_multi_aff_list_n_union_pw_multi_aff( data->contractions); data->contractions = isl_union_pw_multi_aff_list_drop(data->contractions, n - 1, 1); break; case isl_schedule_node_leaf: n = isl_union_pw_multi_aff_list_n_union_pw_multi_aff( data->contractions); inner = isl_union_pw_multi_aff_list_get_union_pw_multi_aff( data->contractions, n - 1); data->res = isl_union_pw_multi_aff_union_add(data->res, inner); break; case isl_schedule_node_band: case isl_schedule_node_context: case isl_schedule_node_domain: case isl_schedule_node_expansion: case isl_schedule_node_extension: case isl_schedule_node_guard: case isl_schedule_node_mark: case isl_schedule_node_sequence: case isl_schedule_node_set: break; } return node; } /* Return a mapping from the domain elements in the leaves of the subtree * rooted at "node" to the corresponding domain elements that reach "node" * obtained by composing the intermediate contractions. * * We start out with an identity mapping between the domain elements * that reach "node" and compose it with all the contractions * on a path from "node" to a leaf while traversing the subtree. * Within the children of an a sequence or set node, the * accumulated contraction is restricted to the elements selected * by the filter child. */ __isl_give isl_union_pw_multi_aff *isl_schedule_node_get_subtree_contraction( __isl_keep isl_schedule_node *node) { struct isl_subtree_contraction_data data; isl_space *space; isl_union_set *domain; isl_union_pw_multi_aff *contraction; if (!node) return NULL; domain = isl_schedule_node_get_universe_domain(node); space = isl_union_set_get_space(domain); contraction = isl_union_set_identity_union_pw_multi_aff(domain); data.res = isl_union_pw_multi_aff_empty(space); data.contractions = isl_union_pw_multi_aff_list_from_union_pw_multi_aff(contraction); node = isl_schedule_node_copy(node); node = traverse(node, &subtree_contraction_enter, &subtree_contraction_leave, &data); if (!node) data.res = isl_union_pw_multi_aff_free(data.res); isl_schedule_node_free(node); isl_union_pw_multi_aff_list_free(data.contractions); return data.res; } /* Do the nearest "n" ancestors of "node" have the types given in "types" * (starting at the parent of "node")? */ static int has_ancestors(__isl_keep isl_schedule_node *node, int n, enum isl_schedule_node_type *types) { int i, n_ancestor; if (!node) return -1; n_ancestor = isl_schedule_tree_list_n_schedule_tree(node->ancestors); if (n_ancestor < n) return 0; for (i = 0; i < n; ++i) { isl_schedule_tree *tree; int correct_type; tree = isl_schedule_tree_list_get_schedule_tree(node->ancestors, n_ancestor - 1 - i); if (!tree) return -1; correct_type = isl_schedule_tree_get_type(tree) == types[i]; isl_schedule_tree_free(tree); if (!correct_type) return 0; } return 1; } /* Given a node "node" that appears in an extension (i.e., it is the child * of a filter in a sequence inside an extension node), are the spaces * of the extension specified by "extension" disjoint from those * of both the original extension and the domain elements that reach * that original extension? */ static int is_disjoint_extension(__isl_keep isl_schedule_node *node, __isl_keep isl_union_map *extension) { isl_union_map *old; isl_union_set *domain; int empty; node = isl_schedule_node_copy(node); node = isl_schedule_node_parent(node); node = isl_schedule_node_parent(node); node = isl_schedule_node_parent(node); old = isl_schedule_node_extension_get_extension(node); domain = isl_schedule_node_get_universe_domain(node); isl_schedule_node_free(node); old = isl_union_map_universe(old); domain = isl_union_set_union(domain, isl_union_map_range(old)); extension = isl_union_map_copy(extension); extension = isl_union_map_intersect_range(extension, domain); empty = isl_union_map_is_empty(extension); isl_union_map_free(extension); return empty; } /* Given a node "node" that is governed by an extension node, extend * that extension node with "extension". * * In particular, "node" is the child of a filter in a sequence that * is in turn a child of an extension node. Extend that extension node * with "extension". * * Return a pointer to the parent of the original node (i.e., a filter). */ static __isl_give isl_schedule_node *extend_extension( __isl_take isl_schedule_node *node, __isl_take isl_union_map *extension) { int pos; int disjoint; isl_union_map *node_extension; node = isl_schedule_node_parent(node); pos = isl_schedule_node_get_child_position(node); node = isl_schedule_node_parent(node); node = isl_schedule_node_parent(node); node_extension = isl_schedule_node_extension_get_extension(node); disjoint = isl_union_map_is_disjoint(extension, node_extension); extension = isl_union_map_union(extension, node_extension); node = isl_schedule_node_extension_set_extension(node, extension); node = isl_schedule_node_child(node, 0); node = isl_schedule_node_child(node, pos); if (disjoint < 0) return isl_schedule_node_free(node); if (!node) return NULL; if (!disjoint) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "extension domain should be disjoint from earlier " "extensions", return isl_schedule_node_free(node)); return node; } /* Return the universe of "uset" if this universe is disjoint from "ref". * Otherwise, return "uset". * * Also check if "uset" itself is disjoint from "ref", reporting * an error if it is not. */ static __isl_give isl_union_set *replace_by_universe_if_disjoint( __isl_take isl_union_set *uset, __isl_keep isl_union_set *ref) { int disjoint; isl_union_set *universe; disjoint = isl_union_set_is_disjoint(uset, ref); if (disjoint < 0) return isl_union_set_free(uset); if (!disjoint) isl_die(isl_union_set_get_ctx(uset), isl_error_invalid, "extension domain should be disjoint from " "current domain", return isl_union_set_free(uset)); universe = isl_union_set_universe(isl_union_set_copy(uset)); disjoint = isl_union_set_is_disjoint(universe, ref); if (disjoint >= 0 && disjoint) { isl_union_set_free(uset); return universe; } isl_union_set_free(universe); if (disjoint < 0) return isl_union_set_free(uset); return uset; } /* Insert an extension node on top of "node" with extension "extension". * In addition, insert a filter that separates node from the extension * between the extension node and "node". * Return a pointer to the inserted filter node. * * If "node" already appears in an extension (i.e., if it is the child * of a filter in a sequence inside an extension node), then extend that * extension with "extension" instead. * In this case, a pointer to the original filter node is returned. * Note that if some of the elements in the new extension live in the * same space as those of the original extension or the domain elements * reaching the original extension, then we insert a new extension anyway. * Otherwise, we would have to adjust the filters in the sequence child * of the extension to ensure that the elements in the new extension * are filtered out. */ static __isl_give isl_schedule_node *insert_extension( __isl_take isl_schedule_node *node, __isl_take isl_union_map *extension) { enum isl_schedule_node_type ancestors[] = { isl_schedule_node_filter, isl_schedule_node_sequence, isl_schedule_node_extension }; isl_union_set *domain; isl_union_set *filter; int in_ext; in_ext = has_ancestors(node, 3, ancestors); if (in_ext < 0) goto error; if (in_ext) { int disjoint; disjoint = is_disjoint_extension(node, extension); if (disjoint < 0) goto error; if (disjoint) return extend_extension(node, extension); } filter = isl_schedule_node_get_domain(node); domain = isl_union_map_range(isl_union_map_copy(extension)); filter = replace_by_universe_if_disjoint(filter, domain); isl_union_set_free(domain); node = isl_schedule_node_insert_filter(node, filter); node = isl_schedule_node_insert_extension(node, extension); node = isl_schedule_node_child(node, 0); return node; error: isl_schedule_node_free(node); isl_union_map_free(extension); return NULL; } /* Replace the subtree that "node" points to by "tree" (which has * a sequence root with two children), except if the parent of "node" * is a sequence as well, in which case "tree" is spliced at the position * of "node" in its parent. * Return a pointer to the child of the "tree_pos" (filter) child of "tree" * in the updated schedule tree. */ static __isl_give isl_schedule_node *graft_or_splice( __isl_take isl_schedule_node *node, __isl_take isl_schedule_tree *tree, int tree_pos) { int pos; if (isl_schedule_node_get_parent_type(node) == isl_schedule_node_sequence) { pos = isl_schedule_node_get_child_position(node); node = isl_schedule_node_parent(node); node = isl_schedule_node_sequence_splice(node, pos, tree); } else { pos = 0; node = isl_schedule_node_graft_tree(node, tree); } node = isl_schedule_node_child(node, pos + tree_pos); node = isl_schedule_node_child(node, 0); return node; } /* Insert a node "graft" into the schedule tree of "node" such that it * is executed before (if "before" is set) or after (if "before" is not set) * the node that "node" points to. * The root of "graft" is an extension node. * Return a pointer to the node that "node" pointed to. * * We first insert an extension node on top of "node" (or extend * the extension node if there already is one), with a filter on "node" * separating it from the extension. * We then insert a filter in the graft to separate it from the original * domain elements and combine the original and new tree in a sequence. * If we have extended an extension node, then the children of this * sequence are spliced in the sequence of the extended extension * at the position where "node" appears in the original extension. * Otherwise, the sequence pair is attached to the new extension node. */ static __isl_give isl_schedule_node *graft_extension( __isl_take isl_schedule_node *node, __isl_take isl_schedule_node *graft, int before) { isl_union_map *extension; isl_union_set *graft_domain; isl_union_set *node_domain; isl_schedule_tree *tree, *tree_graft; extension = isl_schedule_node_extension_get_extension(graft); graft_domain = isl_union_map_range(isl_union_map_copy(extension)); node_domain = isl_schedule_node_get_universe_domain(node); node = insert_extension(node, extension); graft_domain = replace_by_universe_if_disjoint(graft_domain, node_domain); isl_union_set_free(node_domain); tree = isl_schedule_node_get_tree(node); if (!isl_schedule_node_has_children(graft)) { tree_graft = isl_schedule_tree_from_filter(graft_domain); } else { graft = isl_schedule_node_child(graft, 0); tree_graft = isl_schedule_node_get_tree(graft); tree_graft = isl_schedule_tree_insert_filter(tree_graft, graft_domain); } if (before) tree = isl_schedule_tree_sequence_pair(tree_graft, tree); else tree = isl_schedule_tree_sequence_pair(tree, tree_graft); node = graft_or_splice(node, tree, before); isl_schedule_node_free(graft); return node; } /* Replace the root domain node of "node" by an extension node suitable * for insertion at "pos". * That is, create an extension node that maps the outer band nodes * at "pos" to the domain of the root node of "node" and attach * the child of this root node to the extension node. */ static __isl_give isl_schedule_node *extension_from_domain( __isl_take isl_schedule_node *node, __isl_keep isl_schedule_node *pos) { isl_union_set *universe; isl_union_set *domain; isl_union_map *ext; int depth; int anchored; isl_space *space; isl_schedule_node *res; isl_schedule_tree *tree; anchored = isl_schedule_node_is_subtree_anchored(node); if (anchored < 0) return isl_schedule_node_free(node); if (anchored) isl_die(isl_schedule_node_get_ctx(node), isl_error_unsupported, "cannot graft anchored tree with domain root", return isl_schedule_node_free(node)); depth = isl_schedule_node_get_schedule_depth(pos); domain = isl_schedule_node_domain_get_domain(node); space = isl_union_set_get_space(domain); space = isl_space_set_from_params(space); space = isl_space_add_dims(space, isl_dim_set, depth); universe = isl_union_set_from_set(isl_set_universe(space)); ext = isl_union_map_from_domain_and_range(universe, domain); res = isl_schedule_node_from_extension(ext); node = isl_schedule_node_child(node, 0); if (!node) return isl_schedule_node_free(res); if (!isl_schedule_tree_is_leaf(node->tree)) { tree = isl_schedule_node_get_tree(node); res = isl_schedule_node_child(res, 0); res = isl_schedule_node_graft_tree(res, tree); res = isl_schedule_node_parent(res); } isl_schedule_node_free(node); return res; } /* Insert a node "graft" into the schedule tree of "node" such that it * is executed before (if "before" is set) or after (if "before" is not set) * the node that "node" points to. * The root of "graft" may be either a domain or an extension node. * In the latter case, the domain of the extension needs to correspond * to the outer band nodes of "node". * The elements of the domain or the range of the extension may not * intersect with the domain elements that reach "node". * The schedule tree of "graft" may not be anchored. * * The schedule tree of "node" is modified to include an extension node * corresponding to the root node of "graft" as a child of the original * parent of "node". The original node that "node" points to and the * child of the root node of "graft" are attached to this extension node * through a sequence, with appropriate filters and with the child * of "graft" appearing before or after the original "node". * * If "node" already appears inside a sequence that is the child of * an extension node and if the spaces of the new domain elements * do not overlap with those of the original domain elements, * then that extension node is extended with the new extension * rather than introducing a new segment of extension and sequence nodes. * * Return a pointer to the same node in the modified tree that * "node" pointed to in the original tree. */ static __isl_give isl_schedule_node *isl_schedule_node_graft_before_or_after( __isl_take isl_schedule_node *node, __isl_take isl_schedule_node *graft, int before) { if (!node || !graft) goto error; if (check_insert(node) < 0) goto error; if (isl_schedule_node_get_type(graft) == isl_schedule_node_domain) graft = extension_from_domain(graft, node); if (isl_schedule_node_get_type(graft) != isl_schedule_node_extension) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "expecting domain or extension as root of graft", goto error); return graft_extension(node, graft, before); error: isl_schedule_node_free(node); isl_schedule_node_free(graft); return NULL; } /* Insert a node "graft" into the schedule tree of "node" such that it * is executed before the node that "node" points to. * The root of "graft" may be either a domain or an extension node. * In the latter case, the domain of the extension needs to correspond * to the outer band nodes of "node". * The elements of the domain or the range of the extension may not * intersect with the domain elements that reach "node". * The schedule tree of "graft" may not be anchored. * * Return a pointer to the same node in the modified tree that * "node" pointed to in the original tree. */ __isl_give isl_schedule_node *isl_schedule_node_graft_before( __isl_take isl_schedule_node *node, __isl_take isl_schedule_node *graft) { return isl_schedule_node_graft_before_or_after(node, graft, 1); } /* Insert a node "graft" into the schedule tree of "node" such that it * is executed after the node that "node" points to. * The root of "graft" may be either a domain or an extension node. * In the latter case, the domain of the extension needs to correspond * to the outer band nodes of "node". * The elements of the domain or the range of the extension may not * intersect with the domain elements that reach "node". * The schedule tree of "graft" may not be anchored. * * Return a pointer to the same node in the modified tree that * "node" pointed to in the original tree. */ __isl_give isl_schedule_node *isl_schedule_node_graft_after( __isl_take isl_schedule_node *node, __isl_take isl_schedule_node *graft) { return isl_schedule_node_graft_before_or_after(node, graft, 0); } /* Split the domain elements that reach "node" into those that satisfy * "filter" and those that do not. Arrange for the first subset to be * executed after the second subset. * Return a pointer to the tree corresponding to the second subset, * except when this subset is empty in which case the original pointer * is returned. * If both subsets are non-empty, then a sequence node is introduced * to impose the order. If the grandparent of the original node was * itself a sequence, then the original child is replaced by two children * in this sequence instead. * The children in the sequence are copies of the original subtree, * simplified with respect to their filters. */ __isl_give isl_schedule_node *isl_schedule_node_order_after( __isl_take isl_schedule_node *node, __isl_take isl_union_set *filter) { enum isl_schedule_node_type ancestors[] = { isl_schedule_node_filter, isl_schedule_node_sequence }; isl_union_set *node_domain, *node_filter = NULL; isl_schedule_node *node2; isl_schedule_tree *tree1, *tree2; int empty1, empty2; int in_seq; if (!node || !filter) goto error; if (check_insert(node) < 0) goto error; in_seq = has_ancestors(node, 2, ancestors); if (in_seq < 0) goto error; if (in_seq) node = isl_schedule_node_parent(node); node_domain = isl_schedule_node_get_domain(node); filter = isl_union_set_gist(filter, isl_union_set_copy(node_domain)); node_filter = isl_union_set_copy(node_domain); node_filter = isl_union_set_subtract(node_filter, isl_union_set_copy(filter)); node_filter = isl_union_set_gist(node_filter, node_domain); empty1 = isl_union_set_is_empty(filter); empty2 = isl_union_set_is_empty(node_filter); if (empty1 < 0 || empty2 < 0) goto error; if (empty1 || empty2) { isl_union_set_free(filter); isl_union_set_free(node_filter); return node; } node2 = isl_schedule_node_copy(node); node = isl_schedule_node_gist(node, isl_union_set_copy(node_filter)); node2 = isl_schedule_node_gist(node2, isl_union_set_copy(filter)); tree1 = isl_schedule_node_get_tree(node); tree2 = isl_schedule_node_get_tree(node2); isl_schedule_node_free(node2); tree1 = isl_schedule_tree_insert_filter(tree1, node_filter); tree2 = isl_schedule_tree_insert_filter(tree2, filter); tree1 = isl_schedule_tree_sequence_pair(tree1, tree2); node = graft_or_splice(node, tree1, 0); return node; error: isl_schedule_node_free(node); isl_union_set_free(filter); isl_union_set_free(node_filter); return NULL; } /* Reset the user pointer on all identifiers of parameters and tuples * in the schedule node "node". */ __isl_give isl_schedule_node *isl_schedule_node_reset_user( __isl_take isl_schedule_node *node) { isl_schedule_tree *tree; tree = isl_schedule_node_get_tree(node); tree = isl_schedule_tree_reset_user(tree); node = isl_schedule_node_graft_tree(node, tree); return node; } /* Align the parameters of the schedule node "node" to those of "space". */ __isl_give isl_schedule_node *isl_schedule_node_align_params( __isl_take isl_schedule_node *node, __isl_take isl_space *space) { isl_schedule_tree *tree; tree = isl_schedule_node_get_tree(node); tree = isl_schedule_tree_align_params(tree, space); node = isl_schedule_node_graft_tree(node, tree); return node; } /* Compute the pullback of schedule node "node" * by the function represented by "upma". * In other words, plug in "upma" in the iteration domains * of schedule node "node". * We currently do not handle expansion nodes. * * Note that this is only a helper function for * isl_schedule_pullback_union_pw_multi_aff. In order to maintain consistency, * this function should not be called on a single node without also * calling it on all the other nodes. */ __isl_give isl_schedule_node *isl_schedule_node_pullback_union_pw_multi_aff( __isl_take isl_schedule_node *node, __isl_take isl_union_pw_multi_aff *upma) { isl_schedule_tree *tree; tree = isl_schedule_node_get_tree(node); tree = isl_schedule_tree_pullback_union_pw_multi_aff(tree, upma); node = isl_schedule_node_graft_tree(node, tree); return node; } /* Return the position of the subtree containing "node" among the children * of "ancestor". "node" is assumed to be a descendant of "ancestor". * In particular, both nodes should point to the same schedule tree. * * Return -1 on error. */ int isl_schedule_node_get_ancestor_child_position( __isl_keep isl_schedule_node *node, __isl_keep isl_schedule_node *ancestor) { int n1, n2; isl_schedule_tree *tree; if (!node || !ancestor) return -1; if (node->schedule != ancestor->schedule) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "not a descendant", return -1); n1 = isl_schedule_node_get_tree_depth(ancestor); n2 = isl_schedule_node_get_tree_depth(node); if (n1 >= n2) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "not a descendant", return -1); tree = isl_schedule_tree_list_get_schedule_tree(node->ancestors, n1); isl_schedule_tree_free(tree); if (tree != ancestor->tree) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "not a descendant", return -1); return node->child_pos[n1]; } /* Given two nodes that point to the same schedule tree, return their * closest shared ancestor. * * Since the two nodes point to the same schedule, they share at least * one ancestor, the root of the schedule. We move down from the root * to the first ancestor where the respective children have a different * child position. This is the requested ancestor. * If there is no ancestor where the children have a different position, * then one node is an ancestor of the other and then this node is * the requested ancestor. */ __isl_give isl_schedule_node *isl_schedule_node_get_shared_ancestor( __isl_keep isl_schedule_node *node1, __isl_keep isl_schedule_node *node2) { int i, n1, n2; if (!node1 || !node2) return NULL; if (node1->schedule != node2->schedule) isl_die(isl_schedule_node_get_ctx(node1), isl_error_invalid, "not part of same schedule", return NULL); n1 = isl_schedule_node_get_tree_depth(node1); n2 = isl_schedule_node_get_tree_depth(node2); if (n2 < n1) return isl_schedule_node_get_shared_ancestor(node2, node1); if (n1 == 0) return isl_schedule_node_copy(node1); if (isl_schedule_node_is_equal(node1, node2)) return isl_schedule_node_copy(node1); for (i = 0; i < n1; ++i) if (node1->child_pos[i] != node2->child_pos[i]) break; node1 = isl_schedule_node_copy(node1); return isl_schedule_node_ancestor(node1, n1 - i); } /* Print "node" to "p". */ __isl_give isl_printer *isl_printer_print_schedule_node( __isl_take isl_printer *p, __isl_keep isl_schedule_node *node) { if (!node) return isl_printer_free(p); return isl_printer_print_schedule_tree_mark(p, node->schedule->root, isl_schedule_tree_list_n_schedule_tree(node->ancestors), node->child_pos); } void isl_schedule_node_dump(__isl_keep isl_schedule_node *node) { isl_ctx *ctx; isl_printer *printer; if (!node) return; ctx = isl_schedule_node_get_ctx(node); printer = isl_printer_to_file(ctx, stderr); printer = isl_printer_set_yaml_style(printer, ISL_YAML_STYLE_BLOCK); printer = isl_printer_print_schedule_node(printer, node); isl_printer_free(printer); } cloog-0.18.4/isl/bound_test.sh.in0000755000175000017500000000130712413256472013540 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.4/isl/isl_val.c0000644000175000017500000010357112554427055012234 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 negative one. */ __isl_give isl_val *isl_val_negone(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. */ __isl_null isl_val *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 inverse of "v". */ __isl_give isl_val *isl_val_inv(__isl_take isl_val *v) { if (!v) return NULL; if (isl_val_is_nan(v)) return v; if (isl_val_is_zero(v)) { isl_ctx *ctx = isl_val_get_ctx(v); isl_val_free(v); return isl_val_nan(ctx); } if (isl_val_is_infty(v) || isl_val_is_neginfty(v)) { isl_ctx *ctx = isl_val_get_ctx(v); isl_val_free(v); return isl_val_zero(ctx); } v = isl_val_cow(v); if (!v) return NULL; isl_int_swap(v->n, v->d); return isl_val_normalize(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; } /* Divide "v1" by "v2". * * This is a private copy of isl_val_div for use in the generic * isl_multi_*_scale_down_val instantiated for isl_val. */ __isl_give isl_val *isl_val_scale_down_val(__isl_take isl_val *v1, __isl_take isl_val *v2) { return isl_val_div(v1, v2); } /* Given two integer values "v1" and "v2", check if "v1" is divisible by "v2". */ isl_bool isl_val_is_divisible_by(__isl_keep isl_val *v1, __isl_keep isl_val *v2) { if (!v1 || !v2) return isl_bool_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", return isl_bool_error); 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 "v1" and "v2", return the residue of "v1" * modulo "v2". * * This is a private copy of isl_val_mod for use in the generic * isl_multi_*_mod_multi_val instantiated for isl_val. */ __isl_give isl_val *isl_val_mod_val(__isl_take isl_val *v1, __isl_take isl_val *v2) { return isl_val_mod(v1, v2); } /* 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; } /* Compute x, y and g such that g = gcd(a,b) and a*x+b*y = g. */ static void isl_int_gcdext(isl_int g, isl_int x, isl_int y, isl_int a, isl_int b) { isl_int d, tmp; isl_int a_copy, b_copy; isl_int_init(a_copy); isl_int_init(b_copy); isl_int_init(d); isl_int_init(tmp); isl_int_set(a_copy, a); isl_int_set(b_copy, b); isl_int_abs(g, a_copy); isl_int_abs(d, b_copy); isl_int_set_si(x, 1); isl_int_set_si(y, 0); while (isl_int_is_pos(d)) { isl_int_fdiv_q(tmp, g, d); isl_int_submul(x, tmp, y); isl_int_submul(g, tmp, d); isl_int_swap(g, d); isl_int_swap(x, y); } if (isl_int_is_zero(a_copy)) isl_int_set_si(x, 0); else if (isl_int_is_neg(a_copy)) isl_int_neg(x, x); if (isl_int_is_zero(b_copy)) isl_int_set_si(y, 0); else { isl_int_mul(tmp, a_copy, x); isl_int_sub(tmp, g, tmp); isl_int_divexact(y, tmp, b_copy); } isl_int_clear(d); isl_int_clear(tmp); isl_int_clear(a_copy); isl_int_clear(b_copy); } /* 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? */ isl_bool isl_val_is_int(__isl_keep isl_val *v) { if (!v) return isl_bool_error; return isl_int_is_one(v->d); } /* Does "v" represent a rational value? */ isl_bool isl_val_is_rat(__isl_keep isl_val *v) { if (!v) return isl_bool_error; return !isl_int_is_zero(v->d); } /* Does "v" represent NaN? */ isl_bool isl_val_is_nan(__isl_keep isl_val *v) { if (!v) return isl_bool_error; return isl_int_is_zero(v->n) && isl_int_is_zero(v->d); } /* Does "v" represent +infinity? */ isl_bool isl_val_is_infty(__isl_keep isl_val *v) { if (!v) return isl_bool_error; return isl_int_is_pos(v->n) && isl_int_is_zero(v->d); } /* Does "v" represent -infinity? */ isl_bool isl_val_is_neginfty(__isl_keep isl_val *v) { if (!v) return isl_bool_error; return isl_int_is_neg(v->n) && isl_int_is_zero(v->d); } /* Does "v" represent the integer zero? */ isl_bool isl_val_is_zero(__isl_keep isl_val *v) { if (!v) return isl_bool_error; return isl_int_is_zero(v->n) && !isl_int_is_zero(v->d); } /* Does "v" represent the integer one? */ isl_bool isl_val_is_one(__isl_keep isl_val *v) { if (!v) return isl_bool_error; return isl_int_eq(v->n, v->d); } /* Does "v" represent the integer negative one? */ isl_bool isl_val_is_negone(__isl_keep isl_val *v) { if (!v) return isl_bool_error; return isl_int_is_neg(v->n) && isl_int_abs_eq(v->n, v->d); } /* Is "v" (strictly) positive? */ isl_bool isl_val_is_pos(__isl_keep isl_val *v) { if (!v) return isl_bool_error; return isl_int_is_pos(v->n); } /* Is "v" (strictly) negative? */ isl_bool isl_val_is_neg(__isl_keep isl_val *v) { if (!v) return isl_bool_error; return isl_int_is_neg(v->n); } /* Is "v" non-negative? */ isl_bool isl_val_is_nonneg(__isl_keep isl_val *v) { if (!v) return isl_bool_error; if (isl_val_is_nan(v)) return isl_bool_false; return isl_int_is_nonneg(v->n); } /* Is "v" non-positive? */ isl_bool isl_val_is_nonpos(__isl_keep isl_val *v) { if (!v) return isl_bool_error; if (isl_val_is_nan(v)) return isl_bool_false; 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"? */ isl_bool isl_val_lt(__isl_keep isl_val *v1, __isl_keep isl_val *v2) { isl_int t; isl_bool lt; if (!v1 || !v2) return isl_bool_error; 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 isl_bool_false; if (isl_val_eq(v1, v2)) return isl_bool_false; if (isl_val_is_infty(v2)) return isl_bool_true; if (isl_val_is_infty(v1)) return isl_bool_false; if (isl_val_is_neginfty(v1)) return isl_bool_true; if (isl_val_is_neginfty(v2)) return isl_bool_false; 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"? */ isl_bool 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"? */ isl_bool isl_val_le(__isl_keep isl_val *v1, __isl_keep isl_val *v2) { isl_int t; isl_bool le; if (!v1 || !v2) return isl_bool_error; 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 isl_bool_false; if (isl_val_eq(v1, v2)) return isl_bool_true; if (isl_val_is_infty(v2)) return isl_bool_true; if (isl_val_is_infty(v1)) return isl_bool_false; if (isl_val_is_neginfty(v1)) return isl_bool_true; if (isl_val_is_neginfty(v2)) return isl_bool_false; 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"? */ isl_bool 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"? */ isl_bool isl_val_eq(__isl_keep isl_val *v1, __isl_keep isl_val *v2) { if (!v1 || !v2) return isl_bool_error; if (isl_val_is_nan(v1) || isl_val_is_nan(v2)) return isl_bool_false; return isl_int_eq(v1->n, v2->n) && isl_int_eq(v1->d, v2->d); } /* Is "v1" equal to "v2" in absolute value? */ isl_bool isl_val_abs_eq(__isl_keep isl_val *v1, __isl_keep isl_val *v2) { if (!v1 || !v2) return isl_bool_error; if (isl_val_is_nan(v1) || isl_val_is_nan(v2)) return isl_bool_false; return isl_int_abs_eq(v1->n, v2->n) && isl_int_eq(v1->d, v2->d); } /* Is "v1" different from "v2"? */ isl_bool isl_val_ne(__isl_keep isl_val *v1, __isl_keep isl_val *v2) { if (!v1 || !v2) return isl_bool_error; if (isl_val_is_nan(v1) || isl_val_is_nan(v2)) return isl_bool_false; 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; } /* Is "val1" (obviously) equal to "val2"? * * This is a private copy of isl_val_eq for use in the generic * isl_multi_*_plain_is_equal instantiated for isl_val. */ int isl_val_plain_is_equal(__isl_keep isl_val *val1, __isl_keep isl_val *val2) { return isl_val_eq(val1, val2); } /* Does "v" have any non-zero coefficients * for any dimension in the given range? * * 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 any coefficients, this function * always return 0. */ int isl_val_involves_dims(__isl_keep isl_val *v, enum isl_dim_type type, unsigned first, unsigned n) { if (!v) return -1; return 0; } /* 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; } /* Return the space of "v". * * 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. The conditions surrounding the call to this function make sure * that this function will never actually get called. We return a valid * space anyway, just in case. */ __isl_give isl_space *isl_val_get_space(__isl_keep isl_val *v) { if (!v) return NULL; return isl_space_params_alloc(isl_val_get_ctx(v), 0); } /* 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; } /* Align the parameters of "v" to those of "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. * Note that the conditions surrounding the call to this function make sure * that this function will never actually get called. */ __isl_give isl_val *isl_val_align_params(__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); } /* Do the parameters of "v" match those of "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 * simply returns 1, except if "v" or "space" are NULL. */ int isl_val_matching_params(__isl_keep isl_val *v, __isl_keep isl_space *space) { if (!v || !space) return -1; return 1; } /* 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_DOMAIN #define NO_IDENTITY #define NO_FROM_BASE #define NO_MOVE_DIMS #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.4/isl/depcomp0000755000175000017500000005601612413256717012014 00000000000000#! /bin/sh # depcomp - compile a program generating dependencies as side-effects scriptversion=2013-05-30.07; # UTC # Copyright (C) 1999-2013 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 # Get the directory component of the given path, and save it in the # global variables '$dir'. Note that this directory component will # be either empty or ending with a '/' character. This is deliberate. set_dir_from () { case $1 in */*) dir=`echo "$1" | sed -e 's|/[^/]*$|/|'`;; *) dir=;; esac } # Get the suffix-stripped basename of the given path, and save it the # global variable '$base'. set_base_from () { base=`echo "$1" | sed -e 's|^.*/||' -e 's/\.[^.]*$//'` } # If no dependency file was actually created by the compiler invocation, # we still have to create a dummy depfile, to avoid errors with the # Makefile "include basename.Plo" scheme. make_dummy_depfile () { echo "#dummy" > "$depfile" } # Factor out some common post-processing of the generated depfile. # Requires the auxiliary global variable '$tmpdepfile' to be set. aix_post_process_depfile () { # If the compiler actually managed to produce a dependency file, # post-process it. if test -f "$tmpdepfile"; then # Each line is of the form 'foo.o: dependency.h'. # Do two passes, one to just change these to # $object: dependency.h # and one to simply output # dependency.h: # which is needed to avoid the deleted-header problem. { sed -e "s,^.*\.[$lower]*:,$object:," < "$tmpdepfile" sed -e "s,^.*\.[$lower]*:[$tab ]*,," -e 's,$,:,' < "$tmpdepfile" } > "$depfile" rm -f "$tmpdepfile" else make_dummy_depfile fi } # A tabulation character. tab=' ' # A newline character. nl=' ' # Character ranges might be problematic outside the C locale. # These definitions help. upper=ABCDEFGHIJKLMNOPQRSTUVWXYZ lower=abcdefghijklmnopqrstuvwxyz digits=0123456789 alpha=${upper}${lower} 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" # Avoid interferences from the environment. gccflag= dashmflag= # 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 if test "$depmode" = xlc; then # IBM C/C++ Compilers xlc/xlC can output gcc-like dependency information. gccflag=-qmakedep=gcc,-MF depmode=gcc 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 -ne 0; then rm -f "$tmpdepfile" exit $stat fi mv "$tmpdepfile" "$depfile" ;; gcc) ## Note that this doesn't just cater to obsosete pre-3.x GCC compilers. ## but also to in-use compilers like IMB xlc/xlC and the HP C compiler. ## (see the conditional assignment to $gccflag above). ## 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). Also, it might not be ## supported by the other compilers which use the 'gcc' depmode. ## - 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 -ne 0; then rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" echo "$object : \\" > "$depfile" # 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. ## 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. tr ' ' "$nl" < "$tmpdepfile" \ | 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 -ne 0; then 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 ' ' "$nl" < "$tmpdepfile" \ | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' \ | tr "$nl" ' ' >> "$depfile" echo >> "$depfile" # The second pass generates a dummy entry for each header file. tr ' ' "$nl" < "$tmpdepfile" \ | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' -e 's/$/:/' \ >> "$depfile" else make_dummy_depfile fi rm -f "$tmpdepfile" ;; xlc) # 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 ;; 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. set_dir_from "$object" set_base_from "$object" 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 -ne 0; then rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" do test -f "$tmpdepfile" && break done aix_post_process_depfile ;; tcc) # tcc (Tiny C Compiler) understand '-MD -MF file' since version 0.9.26 # FIXME: That version still under development at the moment of writing. # Make that this statement remains true also for stable, released # versions. # It will wrap lines (doesn't matter whether long or short) with a # trailing '\', as in: # # foo.o : \ # foo.c \ # foo.h \ # # It will put a trailing '\' even on the last line, and will use leading # spaces rather than leading tabs (at least since its commit 0394caf7 # "Emit spaces for -MD"). "$@" -MD -MF "$tmpdepfile" stat=$? if test $stat -ne 0; then rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" # Each non-empty line is of the form 'foo.o : \' or ' dep.h \'. # We have to change lines of the first kind to '$object: \'. sed -e "s|.*:|$object :|" < "$tmpdepfile" > "$depfile" # And for each line of the second kind, we have to emit a 'dep.h:' # dummy dependency, to avoid the deleted-header problem. sed -n -e 's|^ *\(.*\) *\\$|\1:|p' < "$tmpdepfile" >> "$depfile" rm -f "$tmpdepfile" ;; ## The order of this option in the case statement is important, since the ## shell code in configure will try each of these formats in the order ## listed in this file. A plain '-MD' option would be understood by many ## compilers, so we must ensure this comes after the gcc and icc options. pgcc) # Portland's C compiler understands '-MD'. # Will always output deps to 'file.d' where file is the root name of the # source file under compilation, even if file resides in a subdirectory. # The object file name does not affect the name of the '.d' file. # pgcc 10.2 will output # foo.o: sub/foo.c sub/foo.h # and will wrap long lines using '\' : # foo.o: sub/foo.c ... \ # sub/foo.h ... \ # ... set_dir_from "$object" # Use the source, not the object, to determine the base name, since # that's sadly what pgcc will do too. set_base_from "$source" tmpdepfile=$base.d # For projects that build the same source file twice into different object # files, the pgcc approach of using the *source* file root name can cause # problems in parallel builds. Use a locking strategy to avoid stomping on # the same $tmpdepfile. lockdir=$base.d-lock trap " echo '$0: caught signal, cleaning up...' >&2 rmdir '$lockdir' exit 1 " 1 2 13 15 numtries=100 i=$numtries while test $i -gt 0; do # mkdir is a portable test-and-set. if mkdir "$lockdir" 2>/dev/null; then # This process acquired the lock. "$@" -MD stat=$? # Release the lock. rmdir "$lockdir" break else # If the lock is being held by a different process, wait # until the winning process is done or we timeout. while test -d "$lockdir" && test $i -gt 0; do sleep 1 i=`expr $i - 1` done fi i=`expr $i - 1` done trap - 1 2 13 15 if test $i -le 0; then echo "$0: failed to acquire lock after $numtries attempts" >&2 echo "$0: check lockdir '$lockdir'" >&2 exit 1 fi if test $stat -ne 0; then 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. set_dir_from "$object" set_base_from "$object" 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 -ne 0; then 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,^.*\.[$lower]*:,$object:," "$tmpdepfile" > "$depfile" # Add 'dependent.h:' lines. sed -ne '2,${ s/^ *// s/ \\*$// s/$/:/ p }' "$tmpdepfile" >> "$depfile" else make_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. set_dir_from "$object" set_base_from "$object" if test "$libtool" = yes; then # Libtool 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$base.o.d # libtool 1.5 tmpdepfile2=$dir.libs/$base.o.d # Likewise. tmpdepfile3=$dir.libs/$base.d # Compaq CCC V6.2-504 "$@" -Wc,-MD else tmpdepfile1=$dir$base.d tmpdepfile2=$dir$base.d tmpdepfile3=$dir$base.d "$@" -MD fi stat=$? if test $stat -ne 0; then rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" do test -f "$tmpdepfile" && break done # Same post-processing that is required for AIX mode. aix_post_process_depfile ;; 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 -ne 0; then 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/\(.*\)/'"$tab"'\1 \\/p s/.\(.*\) \\/\1:/ H $ { s/.*/'"$tab"'/ G p }' >> "$depfile" echo >> "$depfile" # make sure the fragment doesn't end with a backslash 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|^[$tab ]*[^:$tab ][^:][^:]*:[$tab ]*|$object: |" > "$tmpdepfile" rm -f "$depfile" cat < "$tmpdepfile" > "$depfile" # Some versions of the HPUX 10.20 sed can't process this sed invocation # correctly. Breaking it into two sed invocations is a workaround. tr ' ' "$nl" < "$tmpdepfile" \ | 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" # Some versions of the HPUX 10.20 sed can't process the last invocation # correctly. Breaking it into two sed invocations is a workaround. sed '1,2d' "$tmpdepfile" \ | tr ' ' "$nl" \ | 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::'"$tab"'\1 \\:p' >> "$depfile" echo "$tab" >> "$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.4/isl/isl_hash.c0000644000175000017500000001127012554427055012367 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_config.h" 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; } /* Dummy comparison function that always returns false. */ static int no(const void *entry, const void *val) { return 0; } /* Extend "table" to twice its size. * Return 0 on success and -1 on error. * * We reuse isl_hash_table_find to create entries in the extended table. * Since all entries in the original table are assumed to be different, * there is no need to compare them against each other. */ static int grow_table(struct isl_ctx *ctx, struct isl_hash_table *table) { 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, &no, NULL, 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) < 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]; } isl_stat isl_hash_table_foreach(isl_ctx *ctx, struct isl_hash_table *table, isl_stat (*fn)(void **entry, void *user), void *user) { size_t size; uint32_t h; if (!table->entries) return isl_stat_error; size = 1 << table->bits; for (h = 0; h < size; ++ h) if (table->entries[h].data && fn(&table->entries[h].data, user) < 0) return isl_stat_error; return isl_stat_ok; } 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.4/isl/isl_id_to_pw_aff.c0000644000175000017500000000037012413270107014047 00000000000000#include #include #define isl_id_is_equal(id1,id2) id1 == id2 #define KEY_BASE id #define KEY_EQUAL isl_id_is_equal #define VAL_BASE pw_aff #define VAL_EQUAL isl_pw_aff_plain_is_equal #include cloog-0.18.4/isl/isl_schedule_tree.c0000644000175000017500000022172212554427055014264 00000000000000/* * Copyright 2013-2014 Ecole Normale Superieure * Copyright 2014 INRIA Rocquencourt * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, * Ecole Normale Superieure, 45 rue d'Ulm, 75230 Paris, France * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt, * B.P. 105 - 78153 Le Chesnay, France */ #include #include #include #undef EL #define EL isl_schedule_tree #include #undef BASE #define BASE schedule_tree #include /* Is "tree" the leaf of a schedule tree? */ int isl_schedule_tree_is_leaf(__isl_keep isl_schedule_tree *tree) { return isl_schedule_tree_get_type(tree) == isl_schedule_node_leaf; } /* Create a new schedule tree of type "type". * The caller is responsible for filling in the type specific fields and * the children. * * By default, the single node tree does not have any anchored nodes. * The caller is responsible for updating the anchored field if needed. */ static __isl_give isl_schedule_tree *isl_schedule_tree_alloc(isl_ctx *ctx, enum isl_schedule_node_type type) { isl_schedule_tree *tree; if (type == isl_schedule_node_error) return NULL; tree = isl_calloc_type(ctx, isl_schedule_tree); if (!tree) return NULL; tree->ref = 1; tree->ctx = ctx; isl_ctx_ref(ctx); tree->type = type; tree->anchored = 0; return tree; } /* Return a fresh copy of "tree". */ __isl_take isl_schedule_tree *isl_schedule_tree_dup( __isl_keep isl_schedule_tree *tree) { isl_ctx *ctx; isl_schedule_tree *dup; if (!tree) return NULL; ctx = isl_schedule_tree_get_ctx(tree); dup = isl_schedule_tree_alloc(ctx, tree->type); if (!dup) return NULL; switch (tree->type) { case isl_schedule_node_error: isl_die(ctx, isl_error_internal, "allocation should have failed", isl_schedule_tree_free(dup)); case isl_schedule_node_band: dup->band = isl_schedule_band_copy(tree->band); if (!dup->band) return isl_schedule_tree_free(dup); break; case isl_schedule_node_context: dup->context = isl_set_copy(tree->context); if (!dup->context) return isl_schedule_tree_free(dup); break; case isl_schedule_node_domain: dup->domain = isl_union_set_copy(tree->domain); if (!dup->domain) return isl_schedule_tree_free(dup); break; case isl_schedule_node_expansion: dup->contraction = isl_union_pw_multi_aff_copy(tree->contraction); dup->expansion = isl_union_map_copy(tree->expansion); if (!dup->contraction || !dup->expansion) return isl_schedule_tree_free(dup); break; case isl_schedule_node_extension: dup->extension = isl_union_map_copy(tree->extension); if (!dup->extension) return isl_schedule_tree_free(dup); break; case isl_schedule_node_filter: dup->filter = isl_union_set_copy(tree->filter); if (!dup->filter) return isl_schedule_tree_free(dup); break; case isl_schedule_node_guard: dup->guard = isl_set_copy(tree->guard); if (!dup->guard) return isl_schedule_tree_free(dup); break; case isl_schedule_node_mark: dup->mark = isl_id_copy(tree->mark); if (!dup->mark) return isl_schedule_tree_free(dup); break; case isl_schedule_node_leaf: case isl_schedule_node_sequence: case isl_schedule_node_set: break; } if (tree->children) { dup->children = isl_schedule_tree_list_copy(tree->children); if (!dup->children) return isl_schedule_tree_free(dup); } dup->anchored = tree->anchored; return dup; } /* Return an isl_schedule_tree that is equal to "tree" and that has only * a single reference. * * This function is called before a tree is modified. * A static tree (with negative reference count) should never be modified, * so it is not allowed to call this function on a static tree. */ __isl_give isl_schedule_tree *isl_schedule_tree_cow( __isl_take isl_schedule_tree *tree) { if (!tree) return NULL; if (tree->ref < 0) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_internal, "static trees cannot be modified", return isl_schedule_tree_free(tree)); if (tree->ref == 1) return tree; tree->ref--; return isl_schedule_tree_dup(tree); } /* Return a new reference to "tree". * * A static tree (with negative reference count) does not keep track * of the number of references and should not be modified. */ __isl_give isl_schedule_tree *isl_schedule_tree_copy( __isl_keep isl_schedule_tree *tree) { if (!tree) return NULL; if (tree->ref < 0) return tree; tree->ref++; return tree; } /* Free "tree" and return NULL. */ __isl_null isl_schedule_tree *isl_schedule_tree_free( __isl_take isl_schedule_tree *tree) { if (!tree) return NULL; if (tree->ref < 0) return NULL; if (--tree->ref > 0) return NULL; switch (tree->type) { case isl_schedule_node_band: isl_schedule_band_free(tree->band); break; case isl_schedule_node_context: isl_set_free(tree->context); break; case isl_schedule_node_domain: isl_union_set_free(tree->domain); break; case isl_schedule_node_expansion: isl_union_pw_multi_aff_free(tree->contraction); isl_union_map_free(tree->expansion); break; case isl_schedule_node_extension: isl_union_map_free(tree->extension); break; case isl_schedule_node_filter: isl_union_set_free(tree->filter); break; case isl_schedule_node_guard: isl_set_free(tree->guard); break; case isl_schedule_node_mark: isl_id_free(tree->mark); break; case isl_schedule_node_sequence: case isl_schedule_node_set: case isl_schedule_node_error: case isl_schedule_node_leaf: break; } isl_schedule_tree_list_free(tree->children); isl_ctx_deref(tree->ctx); free(tree); return NULL; } /* Create and return a new leaf schedule tree. */ __isl_give isl_schedule_tree *isl_schedule_tree_leaf(isl_ctx *ctx) { return isl_schedule_tree_alloc(ctx, isl_schedule_node_leaf); } /* Create a new band schedule tree referring to "band" * with no children. */ __isl_give isl_schedule_tree *isl_schedule_tree_from_band( __isl_take isl_schedule_band *band) { isl_ctx *ctx; isl_schedule_tree *tree; if (!band) return NULL; ctx = isl_schedule_band_get_ctx(band); tree = isl_schedule_tree_alloc(ctx, isl_schedule_node_band); if (!tree) goto error; tree->band = band; tree->anchored = isl_schedule_band_is_anchored(band); return tree; error: isl_schedule_band_free(band); return NULL; } /* Create a new context schedule tree with the given context and no children. * Since the context references the outer schedule dimension, * the tree is anchored. */ __isl_give isl_schedule_tree *isl_schedule_tree_from_context( __isl_take isl_set *context) { isl_ctx *ctx; isl_schedule_tree *tree; if (!context) return NULL; ctx = isl_set_get_ctx(context); tree = isl_schedule_tree_alloc(ctx, isl_schedule_node_context); if (!tree) goto error; tree->context = context; tree->anchored = 1; return tree; error: isl_set_free(context); return NULL; } /* Create a new domain schedule tree with the given domain and no children. */ __isl_give isl_schedule_tree *isl_schedule_tree_from_domain( __isl_take isl_union_set *domain) { isl_ctx *ctx; isl_schedule_tree *tree; if (!domain) return NULL; ctx = isl_union_set_get_ctx(domain); tree = isl_schedule_tree_alloc(ctx, isl_schedule_node_domain); if (!tree) goto error; tree->domain = domain; return tree; error: isl_union_set_free(domain); return NULL; } /* Create a new expansion schedule tree with the given contraction and * expansion and no children. */ __isl_give isl_schedule_tree *isl_schedule_tree_from_expansion( __isl_take isl_union_pw_multi_aff *contraction, __isl_take isl_union_map *expansion) { isl_ctx *ctx; isl_schedule_tree *tree; if (!contraction || !expansion) goto error; ctx = isl_union_map_get_ctx(expansion); tree = isl_schedule_tree_alloc(ctx, isl_schedule_node_expansion); if (!tree) goto error; tree->contraction = contraction; tree->expansion = expansion; return tree; error: isl_union_pw_multi_aff_free(contraction); isl_union_map_free(expansion); return NULL; } /* Create a new extension schedule tree with the given extension and * no children. * Since the domain of the extension refers to the outer schedule dimension, * the tree is anchored. */ __isl_give isl_schedule_tree *isl_schedule_tree_from_extension( __isl_take isl_union_map *extension) { isl_ctx *ctx; isl_schedule_tree *tree; if (!extension) return NULL; ctx = isl_union_map_get_ctx(extension); tree = isl_schedule_tree_alloc(ctx, isl_schedule_node_extension); if (!tree) goto error; tree->extension = extension; tree->anchored = 1; return tree; error: isl_union_map_free(extension); return NULL; } /* Create a new filter schedule tree with the given filter and no children. */ __isl_give isl_schedule_tree *isl_schedule_tree_from_filter( __isl_take isl_union_set *filter) { isl_ctx *ctx; isl_schedule_tree *tree; if (!filter) return NULL; ctx = isl_union_set_get_ctx(filter); tree = isl_schedule_tree_alloc(ctx, isl_schedule_node_filter); if (!tree) goto error; tree->filter = filter; return tree; error: isl_union_set_free(filter); return NULL; } /* Create a new guard schedule tree with the given guard and no children. * Since the guard references the outer schedule dimension, * the tree is anchored. */ __isl_give isl_schedule_tree *isl_schedule_tree_from_guard( __isl_take isl_set *guard) { isl_ctx *ctx; isl_schedule_tree *tree; if (!guard) return NULL; ctx = isl_set_get_ctx(guard); tree = isl_schedule_tree_alloc(ctx, isl_schedule_node_guard); if (!tree) goto error; tree->guard = guard; tree->anchored = 1; return tree; error: isl_set_free(guard); return NULL; } /* Create a new mark schedule tree with the given mark identifier and * no children. */ __isl_give isl_schedule_tree *isl_schedule_tree_from_mark( __isl_take isl_id *mark) { isl_ctx *ctx; isl_schedule_tree *tree; if (!mark) return NULL; ctx = isl_id_get_ctx(mark); tree = isl_schedule_tree_alloc(ctx, isl_schedule_node_mark); if (!tree) goto error; tree->mark = mark; return tree; error: isl_id_free(mark); return NULL; } /* Does "tree" have any node that depends on its position * in the complete schedule tree? */ isl_bool isl_schedule_tree_is_subtree_anchored( __isl_keep isl_schedule_tree *tree) { return tree ? tree->anchored : isl_bool_error; } /* Does the root node of "tree" depend on its position in the complete * schedule tree? * Band nodes may be anchored depending on the associated AST build options. * Context, extension and guard nodes are always anchored. */ int isl_schedule_tree_is_anchored(__isl_keep isl_schedule_tree *tree) { if (!tree) return -1; switch (isl_schedule_tree_get_type(tree)) { case isl_schedule_node_error: return -1; case isl_schedule_node_band: return isl_schedule_band_is_anchored(tree->band); case isl_schedule_node_context: case isl_schedule_node_extension: case isl_schedule_node_guard: return 1; case isl_schedule_node_domain: case isl_schedule_node_expansion: case isl_schedule_node_filter: case isl_schedule_node_leaf: case isl_schedule_node_mark: case isl_schedule_node_sequence: case isl_schedule_node_set: return 0; } isl_die(isl_schedule_tree_get_ctx(tree), isl_error_internal, "unhandled case", return -1); } /* Update the anchored field of "tree" based on whether the root node * itself in anchored and the anchored fields of the children. * * This function should be called whenever the children of a tree node * are changed or the anchoredness of the tree root itself changes. */ __isl_give isl_schedule_tree *isl_schedule_tree_update_anchored( __isl_take isl_schedule_tree *tree) { int i, n; int anchored; if (!tree) return NULL; anchored = isl_schedule_tree_is_anchored(tree); if (anchored < 0) return isl_schedule_tree_free(tree); n = isl_schedule_tree_list_n_schedule_tree(tree->children); for (i = 0; !anchored && i < n; ++i) { isl_schedule_tree *child; child = isl_schedule_tree_get_child(tree, i); if (!child) return isl_schedule_tree_free(tree); anchored = child->anchored; isl_schedule_tree_free(child); } if (anchored == tree->anchored) return tree; tree = isl_schedule_tree_cow(tree); if (!tree) return NULL; tree->anchored = anchored; return tree; } /* Create a new tree of the given type (isl_schedule_node_sequence or * isl_schedule_node_set) with the given children. */ __isl_give isl_schedule_tree *isl_schedule_tree_from_children( enum isl_schedule_node_type type, __isl_take isl_schedule_tree_list *list) { isl_ctx *ctx; isl_schedule_tree *tree; if (!list) return NULL; ctx = isl_schedule_tree_list_get_ctx(list); tree = isl_schedule_tree_alloc(ctx, type); if (!tree) goto error; tree->children = list; tree = isl_schedule_tree_update_anchored(tree); return tree; error: isl_schedule_tree_list_free(list); return NULL; } /* Construct a tree with a root node of type "type" and as children * "tree1" and "tree2". * If the root of one (or both) of the input trees is itself of type "type", * then the tree is replaced by its children. */ __isl_give isl_schedule_tree *isl_schedule_tree_from_pair( enum isl_schedule_node_type type, __isl_take isl_schedule_tree *tree1, __isl_take isl_schedule_tree *tree2) { isl_ctx *ctx; isl_schedule_tree_list *list; if (!tree1 || !tree2) goto error; ctx = isl_schedule_tree_get_ctx(tree1); if (isl_schedule_tree_get_type(tree1) == type) { list = isl_schedule_tree_list_copy(tree1->children); isl_schedule_tree_free(tree1); } else { list = isl_schedule_tree_list_alloc(ctx, 2); list = isl_schedule_tree_list_add(list, tree1); } if (isl_schedule_tree_get_type(tree2) == type) { isl_schedule_tree_list *children; children = isl_schedule_tree_list_copy(tree2->children); list = isl_schedule_tree_list_concat(list, children); isl_schedule_tree_free(tree2); } else { list = isl_schedule_tree_list_add(list, tree2); } return isl_schedule_tree_from_children(type, list); error: isl_schedule_tree_free(tree1); isl_schedule_tree_free(tree2); return NULL; } /* Construct a tree with a sequence root node and as children * "tree1" and "tree2". * If the root of one (or both) of the input trees is itself a sequence, * then the tree is replaced by its children. */ __isl_give isl_schedule_tree *isl_schedule_tree_sequence_pair( __isl_take isl_schedule_tree *tree1, __isl_take isl_schedule_tree *tree2) { return isl_schedule_tree_from_pair(isl_schedule_node_sequence, tree1, tree2); } /* Return the isl_ctx to which "tree" belongs. */ isl_ctx *isl_schedule_tree_get_ctx(__isl_keep isl_schedule_tree *tree) { return tree ? tree->ctx : NULL; } /* Return the type of the root of the tree or isl_schedule_node_error * on error. */ enum isl_schedule_node_type isl_schedule_tree_get_type( __isl_keep isl_schedule_tree *tree) { return tree ? tree->type : isl_schedule_node_error; } /* Are "tree1" and "tree2" obviously equal to each other? */ isl_bool isl_schedule_tree_plain_is_equal(__isl_keep isl_schedule_tree *tree1, __isl_keep isl_schedule_tree *tree2) { isl_bool equal; int i, n; if (!tree1 || !tree2) return isl_bool_error; if (tree1 == tree2) return isl_bool_true; if (tree1->type != tree2->type) return isl_bool_false; switch (tree1->type) { case isl_schedule_node_band: equal = isl_schedule_band_plain_is_equal(tree1->band, tree2->band); break; case isl_schedule_node_context: equal = isl_set_is_equal(tree1->context, tree2->context); break; case isl_schedule_node_domain: equal = isl_union_set_is_equal(tree1->domain, tree2->domain); break; case isl_schedule_node_expansion: equal = isl_union_map_is_equal(tree1->expansion, tree2->expansion); if (equal >= 0 && equal) equal = isl_union_pw_multi_aff_plain_is_equal( tree1->contraction, tree2->contraction); break; case isl_schedule_node_extension: equal = isl_union_map_is_equal(tree1->extension, tree2->extension); break; case isl_schedule_node_filter: equal = isl_union_set_is_equal(tree1->filter, tree2->filter); break; case isl_schedule_node_guard: equal = isl_set_is_equal(tree1->guard, tree2->guard); break; case isl_schedule_node_mark: equal = tree1->mark == tree2->mark; break; case isl_schedule_node_leaf: case isl_schedule_node_sequence: case isl_schedule_node_set: equal = isl_bool_true; break; case isl_schedule_node_error: equal = isl_bool_error; break; } if (equal < 0 || !equal) return equal; n = isl_schedule_tree_n_children(tree1); if (n != isl_schedule_tree_n_children(tree2)) return isl_bool_false; for (i = 0; i < n; ++i) { isl_schedule_tree *child1, *child2; child1 = isl_schedule_tree_get_child(tree1, i); child2 = isl_schedule_tree_get_child(tree2, i); equal = isl_schedule_tree_plain_is_equal(child1, child2); isl_schedule_tree_free(child1); isl_schedule_tree_free(child2); if (equal < 0 || !equal) return equal; } return isl_bool_true; } /* Does "tree" have any children, other than an implicit leaf. */ int isl_schedule_tree_has_children(__isl_keep isl_schedule_tree *tree) { if (!tree) return -1; return tree->children != NULL; } /* Return the number of children of "tree", excluding implicit leaves. */ int isl_schedule_tree_n_children(__isl_keep isl_schedule_tree *tree) { if (!tree) return -1; return isl_schedule_tree_list_n_schedule_tree(tree->children); } /* Return a copy of the (explicit) child at position "pos" of "tree". */ __isl_give isl_schedule_tree *isl_schedule_tree_get_child( __isl_keep isl_schedule_tree *tree, int pos) { if (!tree) return NULL; if (!tree->children) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_internal, "schedule tree has no explicit children", return NULL); return isl_schedule_tree_list_get_schedule_tree(tree->children, pos); } /* Return a copy of the (explicit) child at position "pos" of "tree" and * free "tree". */ __isl_give isl_schedule_tree *isl_schedule_tree_child( __isl_take isl_schedule_tree *tree, int pos) { isl_schedule_tree *child; child = isl_schedule_tree_get_child(tree, pos); isl_schedule_tree_free(tree); return child; } /* Remove all (explicit) children from "tree". */ __isl_give isl_schedule_tree *isl_schedule_tree_reset_children( __isl_take isl_schedule_tree *tree) { tree = isl_schedule_tree_cow(tree); if (!tree) return NULL; tree->children = isl_schedule_tree_list_free(tree->children); return tree; } /* Remove the child at position "pos" from the children of "tree". * If there was only one child to begin with, then remove all children. */ __isl_give isl_schedule_tree *isl_schedule_tree_drop_child( __isl_take isl_schedule_tree *tree, int pos) { int n; tree = isl_schedule_tree_cow(tree); if (!tree) return NULL; if (!isl_schedule_tree_has_children(tree)) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "tree does not have any explicit children", return isl_schedule_tree_free(tree)); n = isl_schedule_tree_list_n_schedule_tree(tree->children); if (pos < 0 || pos >= n) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "position out of bounds", return isl_schedule_tree_free(tree)); if (n == 1) return isl_schedule_tree_reset_children(tree); tree->children = isl_schedule_tree_list_drop(tree->children, pos, 1); if (!tree->children) return isl_schedule_tree_free(tree); return tree; } /* Replace the child at position "pos" of "tree" by "child". * * If the new child is a leaf, then it is not explicitly * recorded in the list of children. Instead, the list of children * (which is assumed to have only one element) is removed. * Note that the children of set and sequence nodes are always * filters, so they cannot be replaced by empty trees. */ __isl_give isl_schedule_tree *isl_schedule_tree_replace_child( __isl_take isl_schedule_tree *tree, int pos, __isl_take isl_schedule_tree *child) { tree = isl_schedule_tree_cow(tree); if (!tree || !child) goto error; if (isl_schedule_tree_is_leaf(child)) { isl_schedule_tree_free(child); if (!tree->children && pos == 0) return tree; if (isl_schedule_tree_n_children(tree) != 1) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_internal, "can only replace single child by leaf", goto error); return isl_schedule_tree_reset_children(tree); } if (!tree->children && pos == 0) tree->children = isl_schedule_tree_list_from_schedule_tree(child); else tree->children = isl_schedule_tree_list_set_schedule_tree( tree->children, pos, child); if (!tree->children) return isl_schedule_tree_free(tree); tree = isl_schedule_tree_update_anchored(tree); return tree; error: isl_schedule_tree_free(tree); isl_schedule_tree_free(child); return NULL; } /* Replace the (explicit) children of "tree" by "children"? */ __isl_give isl_schedule_tree *isl_schedule_tree_set_children( __isl_take isl_schedule_tree *tree, __isl_take isl_schedule_tree_list *children) { tree = isl_schedule_tree_cow(tree); if (!tree || !children) goto error; isl_schedule_tree_list_free(tree->children); tree->children = children; return tree; error: isl_schedule_tree_free(tree); isl_schedule_tree_list_free(children); return NULL; } /* Create a new band schedule tree referring to "band" * with "tree" as single child. */ __isl_give isl_schedule_tree *isl_schedule_tree_insert_band( __isl_take isl_schedule_tree *tree, __isl_take isl_schedule_band *band) { isl_schedule_tree *res; res = isl_schedule_tree_from_band(band); return isl_schedule_tree_replace_child(res, 0, tree); } /* Create a new context schedule tree with the given context and * with "tree" as single child. */ __isl_give isl_schedule_tree *isl_schedule_tree_insert_context( __isl_take isl_schedule_tree *tree, __isl_take isl_set *context) { isl_schedule_tree *res; res = isl_schedule_tree_from_context(context); return isl_schedule_tree_replace_child(res, 0, tree); } /* Create a new domain schedule tree with the given domain and * with "tree" as single child. */ __isl_give isl_schedule_tree *isl_schedule_tree_insert_domain( __isl_take isl_schedule_tree *tree, __isl_take isl_union_set *domain) { isl_schedule_tree *res; res = isl_schedule_tree_from_domain(domain); return isl_schedule_tree_replace_child(res, 0, tree); } /* Create a new expansion schedule tree with the given contraction and * expansion and with "tree" as single child. */ __isl_give isl_schedule_tree *isl_schedule_tree_insert_expansion( __isl_take isl_schedule_tree *tree, __isl_take isl_union_pw_multi_aff *contraction, __isl_take isl_union_map *expansion) { isl_schedule_tree *res; res = isl_schedule_tree_from_expansion(contraction, expansion); return isl_schedule_tree_replace_child(res, 0, tree); } /* Create a new extension schedule tree with the given extension and * with "tree" as single child. */ __isl_give isl_schedule_tree *isl_schedule_tree_insert_extension( __isl_take isl_schedule_tree *tree, __isl_take isl_union_map *extension) { isl_schedule_tree *res; res = isl_schedule_tree_from_extension(extension); return isl_schedule_tree_replace_child(res, 0, tree); } /* Create a new filter schedule tree with the given filter and single child. * * If the root of "tree" is itself a filter node, then the two * filter nodes are merged into one node. */ __isl_give isl_schedule_tree *isl_schedule_tree_insert_filter( __isl_take isl_schedule_tree *tree, __isl_take isl_union_set *filter) { isl_schedule_tree *res; if (isl_schedule_tree_get_type(tree) == isl_schedule_node_filter) { isl_union_set *tree_filter; tree_filter = isl_schedule_tree_filter_get_filter(tree); tree_filter = isl_union_set_intersect(tree_filter, filter); tree = isl_schedule_tree_filter_set_filter(tree, tree_filter); return tree; } res = isl_schedule_tree_from_filter(filter); return isl_schedule_tree_replace_child(res, 0, tree); } /* Insert a filter node with filter set "filter" * in each of the children of "tree". */ __isl_give isl_schedule_tree *isl_schedule_tree_children_insert_filter( __isl_take isl_schedule_tree *tree, __isl_take isl_union_set *filter) { int i, n; if (!tree || !filter) goto error; n = isl_schedule_tree_n_children(tree); for (i = 0; i < n; ++i) { isl_schedule_tree *child; child = isl_schedule_tree_get_child(tree, i); child = isl_schedule_tree_insert_filter(child, isl_union_set_copy(filter)); tree = isl_schedule_tree_replace_child(tree, i, child); } isl_union_set_free(filter); return tree; error: isl_union_set_free(filter); isl_schedule_tree_free(tree); return NULL; } /* Create a new guard schedule tree with the given guard and * with "tree" as single child. */ __isl_give isl_schedule_tree *isl_schedule_tree_insert_guard( __isl_take isl_schedule_tree *tree, __isl_take isl_set *guard) { isl_schedule_tree *res; res = isl_schedule_tree_from_guard(guard); return isl_schedule_tree_replace_child(res, 0, tree); } /* Create a new mark schedule tree with the given mark identifier and * single child. */ __isl_give isl_schedule_tree *isl_schedule_tree_insert_mark( __isl_take isl_schedule_tree *tree, __isl_take isl_id *mark) { isl_schedule_tree *res; res = isl_schedule_tree_from_mark(mark); return isl_schedule_tree_replace_child(res, 0, tree); } /* Return the number of members in the band tree root. */ unsigned isl_schedule_tree_band_n_member(__isl_keep isl_schedule_tree *tree) { if (!tree) return 0; if (tree->type != isl_schedule_node_band) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not a band node", return 0); return isl_schedule_band_n_member(tree->band); } /* Is the band member at position "pos" of the band tree root * marked coincident? */ isl_bool isl_schedule_tree_band_member_get_coincident( __isl_keep isl_schedule_tree *tree, int pos) { if (!tree) return isl_bool_error; if (tree->type != isl_schedule_node_band) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not a band node", return isl_bool_error); return isl_schedule_band_member_get_coincident(tree->band, pos); } /* Mark the given band member as being coincident or not * according to "coincident". */ __isl_give isl_schedule_tree *isl_schedule_tree_band_member_set_coincident( __isl_take isl_schedule_tree *tree, int pos, int coincident) { if (!tree) return NULL; if (tree->type != isl_schedule_node_band) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not a band node", return isl_schedule_tree_free(tree)); if (isl_schedule_tree_band_member_get_coincident(tree, pos) == coincident) return tree; tree = isl_schedule_tree_cow(tree); if (!tree) return NULL; tree->band = isl_schedule_band_member_set_coincident(tree->band, pos, coincident); if (!tree->band) return isl_schedule_tree_free(tree); return tree; } /* Is the band tree root marked permutable? */ isl_bool isl_schedule_tree_band_get_permutable( __isl_keep isl_schedule_tree *tree) { if (!tree) return isl_bool_error; if (tree->type != isl_schedule_node_band) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not a band node", return isl_bool_error); return isl_schedule_band_get_permutable(tree->band); } /* Mark the band tree root permutable or not according to "permutable"? */ __isl_give isl_schedule_tree *isl_schedule_tree_band_set_permutable( __isl_take isl_schedule_tree *tree, int permutable) { if (!tree) return NULL; if (tree->type != isl_schedule_node_band) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not a band node", return isl_schedule_tree_free(tree)); if (isl_schedule_tree_band_get_permutable(tree) == permutable) return tree; tree = isl_schedule_tree_cow(tree); if (!tree) return NULL; tree->band = isl_schedule_band_set_permutable(tree->band, permutable); if (!tree->band) return isl_schedule_tree_free(tree); return tree; } /* Return the schedule space of the band tree root. */ __isl_give isl_space *isl_schedule_tree_band_get_space( __isl_keep isl_schedule_tree *tree) { if (!tree) return NULL; if (tree->type != isl_schedule_node_band) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not a band node", return NULL); return isl_schedule_band_get_space(tree->band); } /* Intersect the domain of the band schedule of the band tree root * with "domain". */ __isl_give isl_schedule_tree *isl_schedule_tree_band_intersect_domain( __isl_take isl_schedule_tree *tree, __isl_take isl_union_set *domain) { if (!tree || !domain) goto error; if (tree->type != isl_schedule_node_band) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not a band node", goto error); tree->band = isl_schedule_band_intersect_domain(tree->band, domain); if (!tree->band) return isl_schedule_tree_free(tree); return tree; error: isl_schedule_tree_free(tree); isl_union_set_free(domain); return NULL; } /* Return the schedule of the band tree root in isolation. */ __isl_give isl_multi_union_pw_aff *isl_schedule_tree_band_get_partial_schedule( __isl_keep isl_schedule_tree *tree) { if (!tree) return NULL; if (tree->type != isl_schedule_node_band) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not a band node", return NULL); return isl_schedule_band_get_partial_schedule(tree->band); } /* Replace the schedule of the band tree root by "schedule". */ __isl_give isl_schedule_tree *isl_schedule_tree_band_set_partial_schedule( __isl_take isl_schedule_tree *tree, __isl_take isl_multi_union_pw_aff *schedule) { tree = isl_schedule_tree_cow(tree); if (!tree || !schedule) goto error; if (tree->type != isl_schedule_node_band) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not a band node", return NULL); tree->band = isl_schedule_band_set_partial_schedule(tree->band, schedule); return tree; error: isl_schedule_tree_free(tree); isl_multi_union_pw_aff_free(schedule); return NULL; } /* Return the loop AST generation type for the band member * of the band tree root at position "pos". */ enum isl_ast_loop_type isl_schedule_tree_band_member_get_ast_loop_type( __isl_keep isl_schedule_tree *tree, int pos) { if (!tree) return isl_ast_loop_error; if (tree->type != isl_schedule_node_band) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not a band node", return isl_ast_loop_error); return isl_schedule_band_member_get_ast_loop_type(tree->band, pos); } /* Set the loop AST generation type for the band member of the band tree root * at position "pos" to "type". */ __isl_give isl_schedule_tree *isl_schedule_tree_band_member_set_ast_loop_type( __isl_take isl_schedule_tree *tree, int pos, enum isl_ast_loop_type type) { tree = isl_schedule_tree_cow(tree); if (!tree) return NULL; if (tree->type != isl_schedule_node_band) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not a band node", return isl_schedule_tree_free(tree)); tree->band = isl_schedule_band_member_set_ast_loop_type(tree->band, pos, type); if (!tree->band) return isl_schedule_tree_free(tree); return tree; } /* Return the loop AST generation type for the band member * of the band tree root at position "pos" for the isolated part. */ enum isl_ast_loop_type isl_schedule_tree_band_member_get_isolate_ast_loop_type( __isl_keep isl_schedule_tree *tree, int pos) { if (!tree) return isl_ast_loop_error; if (tree->type != isl_schedule_node_band) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not a band node", return isl_ast_loop_error); return isl_schedule_band_member_get_isolate_ast_loop_type(tree->band, pos); } /* Set the loop AST generation type for the band member of the band tree root * at position "pos" for the isolated part to "type". */ __isl_give isl_schedule_tree * isl_schedule_tree_band_member_set_isolate_ast_loop_type( __isl_take isl_schedule_tree *tree, int pos, enum isl_ast_loop_type type) { tree = isl_schedule_tree_cow(tree); if (!tree) return NULL; if (tree->type != isl_schedule_node_band) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not a band node", return isl_schedule_tree_free(tree)); tree->band = isl_schedule_band_member_set_isolate_ast_loop_type( tree->band, pos, type); if (!tree->band) return isl_schedule_tree_free(tree); return tree; } /* Return the AST build options associated to the band tree root. */ __isl_give isl_union_set *isl_schedule_tree_band_get_ast_build_options( __isl_keep isl_schedule_tree *tree) { if (!tree) return NULL; if (tree->type != isl_schedule_node_band) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not a band node", return NULL); return isl_schedule_band_get_ast_build_options(tree->band); } /* Replace the AST build options associated to band tree root by "options". * Updated the anchored field if the anchoredness of the root node itself * changes. */ __isl_give isl_schedule_tree *isl_schedule_tree_band_set_ast_build_options( __isl_take isl_schedule_tree *tree, __isl_take isl_union_set *options) { int was_anchored; tree = isl_schedule_tree_cow(tree); if (!tree || !options) goto error; if (tree->type != isl_schedule_node_band) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not a band node", goto error); was_anchored = isl_schedule_tree_is_anchored(tree); tree->band = isl_schedule_band_set_ast_build_options(tree->band, options); if (!tree->band) return isl_schedule_tree_free(tree); if (isl_schedule_tree_is_anchored(tree) != was_anchored) tree = isl_schedule_tree_update_anchored(tree); return tree; error: isl_schedule_tree_free(tree); isl_union_set_free(options); return NULL; } /* Return the context of the context tree root. */ __isl_give isl_set *isl_schedule_tree_context_get_context( __isl_keep isl_schedule_tree *tree) { if (!tree) return NULL; if (tree->type != isl_schedule_node_context) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not a context node", return NULL); return isl_set_copy(tree->context); } /* Return the domain of the domain tree root. */ __isl_give isl_union_set *isl_schedule_tree_domain_get_domain( __isl_keep isl_schedule_tree *tree) { if (!tree) return NULL; if (tree->type != isl_schedule_node_domain) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not a domain node", return NULL); return isl_union_set_copy(tree->domain); } /* Replace the domain of domain tree root "tree" by "domain". */ __isl_give isl_schedule_tree *isl_schedule_tree_domain_set_domain( __isl_take isl_schedule_tree *tree, __isl_take isl_union_set *domain) { tree = isl_schedule_tree_cow(tree); if (!tree || !domain) goto error; if (tree->type != isl_schedule_node_domain) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not a domain node", goto error); isl_union_set_free(tree->domain); tree->domain = domain; return tree; error: isl_schedule_tree_free(tree); isl_union_set_free(domain); return NULL; } /* Return the contraction of the expansion tree root. */ __isl_give isl_union_pw_multi_aff *isl_schedule_tree_expansion_get_contraction( __isl_keep isl_schedule_tree *tree) { if (!tree) return NULL; if (tree->type != isl_schedule_node_expansion) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not an expansion node", return NULL); return isl_union_pw_multi_aff_copy(tree->contraction); } /* Return the expansion of the expansion tree root. */ __isl_give isl_union_map *isl_schedule_tree_expansion_get_expansion( __isl_keep isl_schedule_tree *tree) { if (!tree) return NULL; if (tree->type != isl_schedule_node_expansion) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not an expansion node", return NULL); return isl_union_map_copy(tree->expansion); } /* Replace the contraction and the expansion of the expansion tree root "tree" * by "contraction" and "expansion". */ __isl_give isl_schedule_tree * isl_schedule_tree_expansion_set_contraction_and_expansion( __isl_take isl_schedule_tree *tree, __isl_take isl_union_pw_multi_aff *contraction, __isl_take isl_union_map *expansion) { tree = isl_schedule_tree_cow(tree); if (!tree || !contraction || !expansion) goto error; if (tree->type != isl_schedule_node_expansion) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not an expansion node", return NULL); isl_union_pw_multi_aff_free(tree->contraction); tree->contraction = contraction; isl_union_map_free(tree->expansion); tree->expansion = expansion; return tree; error: isl_schedule_tree_free(tree); isl_union_pw_multi_aff_free(contraction); isl_union_map_free(expansion); return NULL; } /* Return the extension of the extension tree root. */ __isl_give isl_union_map *isl_schedule_tree_extension_get_extension( __isl_take isl_schedule_tree *tree) { if (!tree) return NULL; if (tree->type != isl_schedule_node_extension) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not an extension node", return NULL); return isl_union_map_copy(tree->extension); } /* Replace the extension of extension tree root "tree" by "extension". */ __isl_give isl_schedule_tree *isl_schedule_tree_extension_set_extension( __isl_take isl_schedule_tree *tree, __isl_take isl_union_map *extension) { tree = isl_schedule_tree_cow(tree); if (!tree || !extension) goto error; if (tree->type != isl_schedule_node_extension) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not an extension node", return NULL); isl_union_map_free(tree->extension); tree->extension = extension; return tree; error: isl_schedule_tree_free(tree); isl_union_map_free(extension); return NULL; } /* Return the filter of the filter tree root. */ __isl_give isl_union_set *isl_schedule_tree_filter_get_filter( __isl_keep isl_schedule_tree *tree) { if (!tree) return NULL; if (tree->type != isl_schedule_node_filter) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not a filter node", return NULL); return isl_union_set_copy(tree->filter); } /* Replace the filter of the filter tree root by "filter". */ __isl_give isl_schedule_tree *isl_schedule_tree_filter_set_filter( __isl_take isl_schedule_tree *tree, __isl_take isl_union_set *filter) { tree = isl_schedule_tree_cow(tree); if (!tree || !filter) goto error; if (tree->type != isl_schedule_node_filter) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not a filter node", return NULL); isl_union_set_free(tree->filter); tree->filter = filter; return tree; error: isl_schedule_tree_free(tree); isl_union_set_free(filter); return NULL; } /* Return the guard of the guard tree root. */ __isl_give isl_set *isl_schedule_tree_guard_get_guard( __isl_take isl_schedule_tree *tree) { if (!tree) return NULL; if (tree->type != isl_schedule_node_guard) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not a guard node", return NULL); return isl_set_copy(tree->guard); } /* Return the mark identifier of the mark tree root "tree". */ __isl_give isl_id *isl_schedule_tree_mark_get_id( __isl_keep isl_schedule_tree *tree) { if (!tree) return NULL; if (tree->type != isl_schedule_node_mark) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not a mark node", return NULL); return isl_id_copy(tree->mark); } /* Set dim to the range dimension of "map" and abort the search. */ static isl_stat set_range_dim(__isl_take isl_map *map, void *user) { int *dim = user; *dim = isl_map_dim(map, isl_dim_out); isl_map_free(map); return isl_stat_error; } /* Return the dimension of the range of "umap". * "umap" is assumed not to be empty and * all maps inside "umap" are assumed to have the same range. * * We extract the range dimension from the first map in "umap". */ static int range_dim(__isl_keep isl_union_map *umap) { int dim = -1; if (!umap) return -1; if (isl_union_map_n_map(umap) == 0) isl_die(isl_union_map_get_ctx(umap), isl_error_internal, "unexpected empty input", return -1); isl_union_map_foreach_map(umap, &set_range_dim, &dim); return dim; } /* Append an "extra" number of zeros to the range of "umap" and * return the result. */ static __isl_give isl_union_map *append_range(__isl_take isl_union_map *umap, int extra) { isl_union_set *dom; isl_space *space; isl_multi_val *mv; isl_union_pw_multi_aff *suffix; isl_union_map *universe; isl_union_map *suffix_umap; universe = isl_union_map_universe(isl_union_map_copy(umap)); dom = isl_union_map_domain(universe); space = isl_union_set_get_space(dom); space = isl_space_set_from_params(space); space = isl_space_add_dims(space, isl_dim_set, extra); mv = isl_multi_val_zero(space); suffix = isl_union_pw_multi_aff_multi_val_on_domain(dom, mv); suffix_umap = isl_union_map_from_union_pw_multi_aff(suffix); umap = isl_union_map_flat_range_product(umap, suffix_umap); return umap; } /* Should we skip the root of "tree" while looking for the first * descendant with schedule information? * That is, is it impossible to derive any information about * the iteration domain from this node? * * We do not want to skip leaf or error nodes because there is * no point in looking any deeper from these nodes. * We can only extract partial iteration domain information * from an extension node, but extension nodes are not supported * by the caller and it will error out on them. */ static int domain_less(__isl_keep isl_schedule_tree *tree) { enum isl_schedule_node_type type; type = isl_schedule_tree_get_type(tree); switch (type) { case isl_schedule_node_band: return isl_schedule_tree_band_n_member(tree) == 0; case isl_schedule_node_context: case isl_schedule_node_guard: case isl_schedule_node_mark: return 1; case isl_schedule_node_leaf: case isl_schedule_node_error: case isl_schedule_node_domain: case isl_schedule_node_expansion: case isl_schedule_node_extension: case isl_schedule_node_filter: case isl_schedule_node_set: case isl_schedule_node_sequence: return 0; } isl_die(isl_schedule_tree_get_ctx(tree), isl_error_internal, "unhandled case", return 0); } /* Move down to the first descendant of "tree" that contains any schedule * information or return "leaf" if there is no such descendant. */ __isl_give isl_schedule_tree *isl_schedule_tree_first_schedule_descendant( __isl_take isl_schedule_tree *tree, __isl_keep isl_schedule_tree *leaf) { while (domain_less(tree)) { if (!isl_schedule_tree_has_children(tree)) { isl_schedule_tree_free(tree); return isl_schedule_tree_copy(leaf); } tree = isl_schedule_tree_child(tree, 0); } return tree; } static __isl_give isl_union_map *subtree_schedule_extend( __isl_keep isl_schedule_tree *tree, __isl_take isl_union_map *outer); /* Extend the schedule map "outer" with the subtree schedule * of the (single) child of "tree", if any. * * If "tree" does not have any descendants (apart from those that * do not carry any schedule information), then we simply return "outer". * Otherwise, we extend the schedule map "outer" with the subtree schedule * of the single child. */ static __isl_give isl_union_map *subtree_schedule_extend_child( __isl_keep isl_schedule_tree *tree, __isl_take isl_union_map *outer) { isl_schedule_tree *child; isl_union_map *res; if (!tree) return isl_union_map_free(outer); if (!isl_schedule_tree_has_children(tree)) return outer; child = isl_schedule_tree_get_child(tree, 0); if (!child) return isl_union_map_free(outer); res = subtree_schedule_extend(child, outer); isl_schedule_tree_free(child); return res; } /* Extract the parameter space from one of the children of "tree", * which are assumed to be filters. */ static __isl_give isl_space *extract_space_from_filter_child( __isl_keep isl_schedule_tree *tree) { isl_space *space; isl_union_set *dom; isl_schedule_tree *child; child = isl_schedule_tree_list_get_schedule_tree(tree->children, 0); dom = isl_schedule_tree_filter_get_filter(child); space = isl_union_set_get_space(dom); isl_union_set_free(dom); isl_schedule_tree_free(child); return space; } /* Extend the schedule map "outer" with the subtree schedule * of a set or sequence node. * * The schedule for the set or sequence node itself is composed of * pieces of the form * * filter -> [] * * or * * filter -> [index] * * The first form is used if there is only a single child or * if the current node is a set node and the schedule_separate_components * option is not set. * * Each of the pieces above is extended with the subtree schedule of * the child of the corresponding filter, if any, padded with zeros * to ensure that all pieces have the same range dimension. */ static __isl_give isl_union_map *subtree_schedule_extend_from_children( __isl_keep isl_schedule_tree *tree, __isl_take isl_union_map *outer) { int i, n; int dim; int separate; isl_ctx *ctx; isl_val *v = NULL; isl_multi_val *mv; isl_space *space; isl_union_map *umap; if (!tree) return NULL; ctx = isl_schedule_tree_get_ctx(tree); if (!tree->children) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_internal, "missing children", return NULL); n = isl_schedule_tree_list_n_schedule_tree(tree->children); if (n == 0) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_internal, "missing children", return NULL); separate = n > 1 && (tree->type == isl_schedule_node_sequence || isl_options_get_schedule_separate_components(ctx)); space = extract_space_from_filter_child(tree); umap = isl_union_map_empty(isl_space_copy(space)); space = isl_space_set_from_params(space); if (separate) { space = isl_space_add_dims(space, isl_dim_set, 1); v = isl_val_zero(ctx); } mv = isl_multi_val_zero(space); dim = isl_multi_val_dim(mv, isl_dim_set); for (i = 0; i < n; ++i) { isl_union_pw_multi_aff *upma; isl_union_map *umap_i; isl_union_set *dom; isl_schedule_tree *child; int dim_i; int empty; child = isl_schedule_tree_list_get_schedule_tree( tree->children, i); dom = isl_schedule_tree_filter_get_filter(child); if (separate) { mv = isl_multi_val_set_val(mv, 0, isl_val_copy(v)); v = isl_val_add_ui(v, 1); } upma = isl_union_pw_multi_aff_multi_val_on_domain(dom, isl_multi_val_copy(mv)); umap_i = isl_union_map_from_union_pw_multi_aff(upma); umap_i = isl_union_map_flat_range_product( isl_union_map_copy(outer), umap_i); umap_i = subtree_schedule_extend_child(child, umap_i); isl_schedule_tree_free(child); empty = isl_union_map_is_empty(umap_i); if (empty < 0) umap_i = isl_union_map_free(umap_i); else if (empty) { isl_union_map_free(umap_i); continue; } dim_i = range_dim(umap_i); if (dim_i < 0) { umap = isl_union_map_free(umap); } else if (dim < dim_i) { umap = append_range(umap, dim_i - dim); dim = dim_i; } else if (dim_i < dim) { umap_i = append_range(umap_i, dim - dim_i); } umap = isl_union_map_union(umap, umap_i); } isl_val_free(v); isl_multi_val_free(mv); isl_union_map_free(outer); return umap; } /* Extend the schedule map "outer" with the subtree schedule of "tree". * * If the root of the tree is a set or a sequence, then we extend * the schedule map in subtree_schedule_extend_from_children. * Otherwise, we extend the schedule map with the partial schedule * corresponding to the root of the tree and then continue with * the single child of this root. * In the special case of an expansion, the schedule map is "extended" * by applying the expansion to the domain of the schedule map. */ static __isl_give isl_union_map *subtree_schedule_extend( __isl_keep isl_schedule_tree *tree, __isl_take isl_union_map *outer) { isl_multi_union_pw_aff *mupa; isl_union_map *umap; isl_union_set *domain; if (!tree) return NULL; switch (tree->type) { case isl_schedule_node_error: return isl_union_map_free(outer); case isl_schedule_node_extension: isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "cannot construct subtree schedule of tree " "with extension nodes", return isl_union_map_free(outer)); case isl_schedule_node_context: case isl_schedule_node_guard: case isl_schedule_node_mark: return subtree_schedule_extend_child(tree, outer); case isl_schedule_node_band: if (isl_schedule_tree_band_n_member(tree) == 0) return subtree_schedule_extend_child(tree, outer); mupa = isl_schedule_band_get_partial_schedule(tree->band); umap = isl_union_map_from_multi_union_pw_aff(mupa); outer = isl_union_map_flat_range_product(outer, umap); umap = subtree_schedule_extend_child(tree, outer); break; case isl_schedule_node_domain: domain = isl_schedule_tree_domain_get_domain(tree); umap = isl_union_map_from_domain(domain); outer = isl_union_map_flat_range_product(outer, umap); umap = subtree_schedule_extend_child(tree, outer); break; case isl_schedule_node_expansion: umap = isl_schedule_tree_expansion_get_expansion(tree); outer = isl_union_map_apply_domain(outer, umap); umap = subtree_schedule_extend_child(tree, outer); break; case isl_schedule_node_filter: domain = isl_schedule_tree_filter_get_filter(tree); umap = isl_union_map_from_domain(domain); outer = isl_union_map_flat_range_product(outer, umap); umap = subtree_schedule_extend_child(tree, outer); break; case isl_schedule_node_leaf: isl_die(isl_schedule_tree_get_ctx(tree), isl_error_internal, "leaf node should be handled by caller", return NULL); case isl_schedule_node_set: case isl_schedule_node_sequence: umap = subtree_schedule_extend_from_children(tree, outer); break; } return umap; } static __isl_give isl_union_set *initial_domain( __isl_keep isl_schedule_tree *tree); /* Extract a universe domain from the children of the tree root "tree", * which is a set or sequence, meaning that its children are filters. * In particular, return the union of the universes of the filters. */ static __isl_give isl_union_set *initial_domain_from_children( __isl_keep isl_schedule_tree *tree) { int i, n; isl_space *space; isl_union_set *domain; if (!tree->children) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_internal, "missing children", return NULL); n = isl_schedule_tree_list_n_schedule_tree(tree->children); if (n == 0) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_internal, "missing children", return NULL); space = extract_space_from_filter_child(tree); domain = isl_union_set_empty(space); for (i = 0; i < n; ++i) { isl_schedule_tree *child; isl_union_set *domain_i; child = isl_schedule_tree_get_child(tree, i); domain_i = initial_domain(child); domain = isl_union_set_union(domain, domain_i); isl_schedule_tree_free(child); } return domain; } /* Extract a universe domain from the tree root "tree". * The caller is responsible for making sure that this node * would not be skipped by isl_schedule_tree_first_schedule_descendant * and that it is not a leaf node. */ static __isl_give isl_union_set *initial_domain( __isl_keep isl_schedule_tree *tree) { isl_multi_union_pw_aff *mupa; isl_union_set *domain; isl_union_map *exp; if (!tree) return NULL; switch (tree->type) { case isl_schedule_node_error: return NULL; case isl_schedule_node_context: isl_die(isl_schedule_tree_get_ctx(tree), isl_error_internal, "context node should be handled by caller", return NULL); case isl_schedule_node_guard: isl_die(isl_schedule_tree_get_ctx(tree), isl_error_internal, "guard node should be handled by caller", return NULL); case isl_schedule_node_mark: isl_die(isl_schedule_tree_get_ctx(tree), isl_error_internal, "mark node should be handled by caller", return NULL); case isl_schedule_node_extension: isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "cannot construct subtree schedule of tree " "with extension nodes", return NULL); case isl_schedule_node_band: if (isl_schedule_tree_band_n_member(tree) == 0) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_internal, "0D band should be handled by caller", return NULL); mupa = isl_schedule_band_get_partial_schedule(tree->band); domain = isl_multi_union_pw_aff_domain(mupa); domain = isl_union_set_universe(domain); break; case isl_schedule_node_domain: domain = isl_schedule_tree_domain_get_domain(tree); domain = isl_union_set_universe(domain); break; case isl_schedule_node_expansion: exp = isl_schedule_tree_expansion_get_expansion(tree); exp = isl_union_map_universe(exp); domain = isl_union_map_domain(exp); break; case isl_schedule_node_filter: domain = isl_schedule_tree_filter_get_filter(tree); domain = isl_union_set_universe(domain); break; case isl_schedule_node_leaf: isl_die(isl_schedule_tree_get_ctx(tree), isl_error_internal, "leaf node should be handled by caller", return NULL); case isl_schedule_node_set: case isl_schedule_node_sequence: domain = initial_domain_from_children(tree); break; } return domain; } /* Return the subtree schedule of a node that contains some schedule * information, i.e., a node that would not be skipped by * isl_schedule_tree_first_schedule_descendant and that is not a leaf. * * If the tree contains any expansions, then the returned subtree * schedule is formulated in terms of the expanded domains. * The tree is not allowed to contain any extension nodes. * * We start with an initial zero-dimensional subtree schedule based * on the domain information in the root node and then extend it * based on the schedule information in the root node and its descendants. */ __isl_give isl_union_map *isl_schedule_tree_get_subtree_schedule_union_map( __isl_keep isl_schedule_tree *tree) { isl_union_set *domain; isl_union_map *umap; domain = initial_domain(tree); umap = isl_union_map_from_domain(domain); return subtree_schedule_extend(tree, umap); } /* Multiply the partial schedule of the band root node of "tree" * with the factors in "mv". */ __isl_give isl_schedule_tree *isl_schedule_tree_band_scale( __isl_take isl_schedule_tree *tree, __isl_take isl_multi_val *mv) { if (!tree || !mv) goto error; if (tree->type != isl_schedule_node_band) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not a band node", goto error); tree = isl_schedule_tree_cow(tree); if (!tree) goto error; tree->band = isl_schedule_band_scale(tree->band, mv); if (!tree->band) return isl_schedule_tree_free(tree); return tree; error: isl_schedule_tree_free(tree); isl_multi_val_free(mv); return NULL; } /* Divide the partial schedule of the band root node of "tree" * by the factors in "mv". */ __isl_give isl_schedule_tree *isl_schedule_tree_band_scale_down( __isl_take isl_schedule_tree *tree, __isl_take isl_multi_val *mv) { if (!tree || !mv) goto error; if (tree->type != isl_schedule_node_band) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not a band node", goto error); tree = isl_schedule_tree_cow(tree); if (!tree) goto error; tree->band = isl_schedule_band_scale_down(tree->band, mv); if (!tree->band) return isl_schedule_tree_free(tree); return tree; error: isl_schedule_tree_free(tree); isl_multi_val_free(mv); return NULL; } /* Given two trees with sequence roots, replace the child at position * "pos" of "tree" with the children of "child". */ __isl_give isl_schedule_tree *isl_schedule_tree_sequence_splice( __isl_take isl_schedule_tree *tree, int pos, __isl_take isl_schedule_tree *child) { int n; isl_schedule_tree_list *list1, *list2; tree = isl_schedule_tree_cow(tree); if (!tree || !child) goto error; if (isl_schedule_tree_get_type(tree) != isl_schedule_node_sequence) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not a sequence node", goto error); n = isl_schedule_tree_n_children(tree); if (pos < 0 || pos >= n) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "position out of bounds", goto error); if (isl_schedule_tree_get_type(child) != isl_schedule_node_sequence) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not a sequence node", goto error); list1 = isl_schedule_tree_list_copy(tree->children); list1 = isl_schedule_tree_list_drop(list1, pos, n - pos); list2 = isl_schedule_tree_list_copy(tree->children); list2 = isl_schedule_tree_list_drop(list2, 0, pos + 1); list1 = isl_schedule_tree_list_concat(list1, isl_schedule_tree_list_copy(child->children)); list1 = isl_schedule_tree_list_concat(list1, list2); isl_schedule_tree_free(tree); isl_schedule_tree_free(child); return isl_schedule_tree_from_children(isl_schedule_node_sequence, list1); error: isl_schedule_tree_free(tree); isl_schedule_tree_free(child); return NULL; } /* Tile the band root node of "tree" with tile sizes "sizes". * * We duplicate the band node, change the schedule of one of them * to the tile schedule and the other to the point schedule and then * attach the point band as a child to the tile band. */ __isl_give isl_schedule_tree *isl_schedule_tree_band_tile( __isl_take isl_schedule_tree *tree, __isl_take isl_multi_val *sizes) { isl_schedule_tree *child = NULL; if (!tree || !sizes) goto error; if (tree->type != isl_schedule_node_band) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not a band node", goto error); child = isl_schedule_tree_copy(tree); tree = isl_schedule_tree_cow(tree); child = isl_schedule_tree_cow(child); if (!tree || !child) goto error; tree->band = isl_schedule_band_tile(tree->band, isl_multi_val_copy(sizes)); if (!tree->band) goto error; child->band = isl_schedule_band_point(child->band, tree->band, sizes); if (!child->band) child = isl_schedule_tree_free(child); tree = isl_schedule_tree_replace_child(tree, 0, child); return tree; error: isl_schedule_tree_free(child); isl_schedule_tree_free(tree); isl_multi_val_free(sizes); return NULL; } /* Split the band root node of "tree" into two nested band nodes, * one with the first "pos" dimensions and * one with the remaining dimensions. */ __isl_give isl_schedule_tree *isl_schedule_tree_band_split( __isl_take isl_schedule_tree *tree, int pos) { int n; isl_schedule_tree *child; if (!tree) return NULL; if (tree->type != isl_schedule_node_band) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not a band node", return isl_schedule_tree_free(tree)); n = isl_schedule_tree_band_n_member(tree); if (pos < 0 || pos > n) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "position out of bounds", return isl_schedule_tree_free(tree)); child = isl_schedule_tree_copy(tree); tree = isl_schedule_tree_cow(tree); child = isl_schedule_tree_cow(child); if (!tree || !child) goto error; child->band = isl_schedule_band_drop(child->band, 0, pos); tree->band = isl_schedule_band_drop(tree->band, pos, n - pos); if (!child->band || !tree->band) goto error; tree = isl_schedule_tree_replace_child(tree, 0, child); return tree; error: isl_schedule_tree_free(child); isl_schedule_tree_free(tree); return NULL; } /* Attach "tree2" at each of the leaves of "tree1". * * If "tree1" does not have any explicit children, then make "tree2" * its single child. Otherwise, attach "tree2" to the leaves of * each of the children of "tree1". */ __isl_give isl_schedule_tree *isl_schedule_tree_append_to_leaves( __isl_take isl_schedule_tree *tree1, __isl_take isl_schedule_tree *tree2) { int i, n; if (!tree1 || !tree2) goto error; n = isl_schedule_tree_n_children(tree1); if (n == 0) { isl_schedule_tree_list *list; list = isl_schedule_tree_list_from_schedule_tree(tree2); tree1 = isl_schedule_tree_set_children(tree1, list); return tree1; } for (i = 0; i < n; ++i) { isl_schedule_tree *child; child = isl_schedule_tree_get_child(tree1, i); child = isl_schedule_tree_append_to_leaves(child, isl_schedule_tree_copy(tree2)); tree1 = isl_schedule_tree_replace_child(tree1, i, child); } isl_schedule_tree_free(tree2); return tree1; error: isl_schedule_tree_free(tree1); isl_schedule_tree_free(tree2); return NULL; } /* Reset the user pointer on all identifiers of parameters and tuples * in the root of "tree". */ __isl_give isl_schedule_tree *isl_schedule_tree_reset_user( __isl_take isl_schedule_tree *tree) { if (isl_schedule_tree_is_leaf(tree)) return tree; tree = isl_schedule_tree_cow(tree); if (!tree) return NULL; switch (tree->type) { case isl_schedule_node_error: return isl_schedule_tree_free(tree); case isl_schedule_node_band: tree->band = isl_schedule_band_reset_user(tree->band); if (!tree->band) return isl_schedule_tree_free(tree); break; case isl_schedule_node_context: tree->context = isl_set_reset_user(tree->context); if (!tree->context) return isl_schedule_tree_free(tree); break; case isl_schedule_node_domain: tree->domain = isl_union_set_reset_user(tree->domain); if (!tree->domain) return isl_schedule_tree_free(tree); break; case isl_schedule_node_expansion: tree->contraction = isl_union_pw_multi_aff_reset_user(tree->contraction); tree->expansion = isl_union_map_reset_user(tree->expansion); if (!tree->contraction || !tree->expansion) return isl_schedule_tree_free(tree); break; case isl_schedule_node_extension: tree->extension = isl_union_map_reset_user(tree->extension); if (!tree->extension) return isl_schedule_tree_free(tree); break; case isl_schedule_node_filter: tree->filter = isl_union_set_reset_user(tree->filter); if (!tree->filter) return isl_schedule_tree_free(tree); break; case isl_schedule_node_guard: tree->guard = isl_set_reset_user(tree->guard); if (!tree->guard) return isl_schedule_tree_free(tree); break; case isl_schedule_node_leaf: case isl_schedule_node_mark: case isl_schedule_node_sequence: case isl_schedule_node_set: break; } return tree; } /* Align the parameters of the root of "tree" to those of "space". */ __isl_give isl_schedule_tree *isl_schedule_tree_align_params( __isl_take isl_schedule_tree *tree, __isl_take isl_space *space) { if (!space) goto error; if (isl_schedule_tree_is_leaf(tree)) { isl_space_free(space); return tree; } tree = isl_schedule_tree_cow(tree); if (!tree) goto error; switch (tree->type) { case isl_schedule_node_error: goto error; case isl_schedule_node_band: tree->band = isl_schedule_band_align_params(tree->band, space); if (!tree->band) return isl_schedule_tree_free(tree); break; case isl_schedule_node_context: tree->context = isl_set_align_params(tree->context, space); if (!tree->context) return isl_schedule_tree_free(tree); break; case isl_schedule_node_domain: tree->domain = isl_union_set_align_params(tree->domain, space); if (!tree->domain) return isl_schedule_tree_free(tree); break; case isl_schedule_node_expansion: tree->contraction = isl_union_pw_multi_aff_align_params(tree->contraction, isl_space_copy(space)); tree->expansion = isl_union_map_align_params(tree->expansion, space); if (!tree->contraction || !tree->expansion) return isl_schedule_tree_free(tree); break; case isl_schedule_node_extension: tree->extension = isl_union_map_align_params(tree->extension, space); if (!tree->extension) return isl_schedule_tree_free(tree); break; case isl_schedule_node_filter: tree->filter = isl_union_set_align_params(tree->filter, space); if (!tree->filter) return isl_schedule_tree_free(tree); break; case isl_schedule_node_guard: tree->guard = isl_set_align_params(tree->guard, space); if (!tree->guard) return isl_schedule_tree_free(tree); break; case isl_schedule_node_leaf: case isl_schedule_node_mark: case isl_schedule_node_sequence: case isl_schedule_node_set: isl_space_free(space); break; } return tree; error: isl_space_free(space); isl_schedule_tree_free(tree); return NULL; } /* Does "tree" involve the iteration domain? * That is, does it need to be modified * by isl_schedule_tree_pullback_union_pw_multi_aff? */ static int involves_iteration_domain(__isl_keep isl_schedule_tree *tree) { if (!tree) return -1; switch (tree->type) { case isl_schedule_node_error: return -1; case isl_schedule_node_band: case isl_schedule_node_domain: case isl_schedule_node_expansion: case isl_schedule_node_extension: case isl_schedule_node_filter: return 1; case isl_schedule_node_context: case isl_schedule_node_leaf: case isl_schedule_node_guard: case isl_schedule_node_mark: case isl_schedule_node_sequence: case isl_schedule_node_set: return 0; } isl_die(isl_schedule_tree_get_ctx(tree), isl_error_internal, "unhandled case", return -1); } /* Compute the pullback of the root node of "tree" by the function * represented by "upma". * In other words, plug in "upma" in the iteration domains of * the root node of "tree". * We currently do not handle expansion nodes. * * We first check if the root node involves any iteration domains. * If so, we handle the specific cases. */ __isl_give isl_schedule_tree *isl_schedule_tree_pullback_union_pw_multi_aff( __isl_take isl_schedule_tree *tree, __isl_take isl_union_pw_multi_aff *upma) { int involves; if (!tree || !upma) goto error; involves = involves_iteration_domain(tree); if (involves < 0) goto error; if (!involves) { isl_union_pw_multi_aff_free(upma); return tree; } tree = isl_schedule_tree_cow(tree); if (!tree) goto error; if (tree->type == isl_schedule_node_band) { tree->band = isl_schedule_band_pullback_union_pw_multi_aff( tree->band, upma); if (!tree->band) return isl_schedule_tree_free(tree); } else if (tree->type == isl_schedule_node_domain) { tree->domain = isl_union_set_preimage_union_pw_multi_aff(tree->domain, upma); if (!tree->domain) return isl_schedule_tree_free(tree); } else if (tree->type == isl_schedule_node_expansion) { isl_die(isl_schedule_tree_get_ctx(tree), isl_error_unsupported, "cannot pullback expansion node", goto error); } else if (tree->type == isl_schedule_node_extension) { tree->extension = isl_union_map_preimage_range_union_pw_multi_aff( tree->extension, upma); if (!tree->extension) return isl_schedule_tree_free(tree); } else if (tree->type == isl_schedule_node_filter) { tree->filter = isl_union_set_preimage_union_pw_multi_aff(tree->filter, upma); if (!tree->filter) return isl_schedule_tree_free(tree); } return tree; error: isl_union_pw_multi_aff_free(upma); isl_schedule_tree_free(tree); return NULL; } /* Compute the gist of the band tree root with respect to "context". */ __isl_give isl_schedule_tree *isl_schedule_tree_band_gist( __isl_take isl_schedule_tree *tree, __isl_take isl_union_set *context) { if (!tree) return NULL; if (tree->type != isl_schedule_node_band) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_invalid, "not a band node", goto error); tree = isl_schedule_tree_cow(tree); if (!tree) goto error; tree->band = isl_schedule_band_gist(tree->band, context); if (!tree->band) return isl_schedule_tree_free(tree); return tree; error: isl_union_set_free(context); isl_schedule_tree_free(tree); return NULL; } /* Are any members in "band" marked coincident? */ static int any_coincident(__isl_keep isl_schedule_band *band) { int i, n; n = isl_schedule_band_n_member(band); for (i = 0; i < n; ++i) if (isl_schedule_band_member_get_coincident(band, i)) return 1; return 0; } /* Print the band node "band" to "p". * * The permutable and coincident properties are only printed if they * are different from the defaults. * The coincident property is always printed in YAML flow style. */ static __isl_give isl_printer *print_tree_band(__isl_take isl_printer *p, __isl_keep isl_schedule_band *band) { isl_union_set *options; int empty; p = isl_printer_print_str(p, "schedule"); p = isl_printer_yaml_next(p); p = isl_printer_print_str(p, "\""); p = isl_printer_print_multi_union_pw_aff(p, band->mupa); p = isl_printer_print_str(p, "\""); if (isl_schedule_band_get_permutable(band)) { p = isl_printer_yaml_next(p); p = isl_printer_print_str(p, "permutable"); p = isl_printer_yaml_next(p); p = isl_printer_print_int(p, 1); } if (any_coincident(band)) { int i, n; int style; p = isl_printer_yaml_next(p); p = isl_printer_print_str(p, "coincident"); p = isl_printer_yaml_next(p); style = isl_printer_get_yaml_style(p); p = isl_printer_set_yaml_style(p, ISL_YAML_STYLE_FLOW); p = isl_printer_yaml_start_sequence(p); n = isl_schedule_band_n_member(band); for (i = 0; i < n; ++i) { p = isl_printer_print_int(p, isl_schedule_band_member_get_coincident(band, i)); p = isl_printer_yaml_next(p); } p = isl_printer_yaml_end_sequence(p); p = isl_printer_set_yaml_style(p, style); } options = isl_schedule_band_get_ast_build_options(band); empty = isl_union_set_is_empty(options); if (empty < 0) p = isl_printer_free(p); if (!empty) { p = isl_printer_yaml_next(p); p = isl_printer_print_str(p, "options"); p = isl_printer_yaml_next(p); p = isl_printer_print_str(p, "\""); p = isl_printer_print_union_set(p, options); p = isl_printer_print_str(p, "\""); } isl_union_set_free(options); return p; } /* Print "tree" to "p". * * If "n_ancestor" is non-negative, then "child_pos" contains the child * positions of a descendant of the current node that should be marked * (by the comment "YOU ARE HERE"). In particular, if "n_ancestor" * is zero, then the current node should be marked. * The marking is only printed in YAML block format. * * Implicit leaf nodes are not printed, except if they correspond * to the node that should be marked. */ __isl_give isl_printer *isl_printer_print_schedule_tree_mark( __isl_take isl_printer *p, __isl_keep isl_schedule_tree *tree, int n_ancestor, int *child_pos) { int i, n; int sequence = 0; int block; block = isl_printer_get_yaml_style(p) == ISL_YAML_STYLE_BLOCK; p = isl_printer_yaml_start_mapping(p); if (n_ancestor == 0 && block) { p = isl_printer_print_str(p, "# YOU ARE HERE"); p = isl_printer_end_line(p); p = isl_printer_start_line(p); } switch (tree->type) { case isl_schedule_node_error: p = isl_printer_print_str(p, "ERROR"); break; case isl_schedule_node_leaf: p = isl_printer_print_str(p, "leaf"); break; case isl_schedule_node_sequence: p = isl_printer_print_str(p, "sequence"); sequence = 1; break; case isl_schedule_node_set: p = isl_printer_print_str(p, "set"); sequence = 1; break; case isl_schedule_node_context: p = isl_printer_print_str(p, "context"); p = isl_printer_yaml_next(p); p = isl_printer_print_str(p, "\""); p = isl_printer_print_set(p, tree->context); p = isl_printer_print_str(p, "\""); break; case isl_schedule_node_domain: p = isl_printer_print_str(p, "domain"); p = isl_printer_yaml_next(p); p = isl_printer_print_str(p, "\""); p = isl_printer_print_union_set(p, tree->domain); p = isl_printer_print_str(p, "\""); break; case isl_schedule_node_expansion: p = isl_printer_print_str(p, "contraction"); p = isl_printer_yaml_next(p); p = isl_printer_print_str(p, "\""); p = isl_printer_print_union_pw_multi_aff(p, tree->contraction); p = isl_printer_print_str(p, "\""); p = isl_printer_yaml_next(p); p = isl_printer_print_str(p, "expansion"); p = isl_printer_yaml_next(p); p = isl_printer_print_str(p, "\""); p = isl_printer_print_union_map(p, tree->expansion); p = isl_printer_print_str(p, "\""); break; case isl_schedule_node_extension: p = isl_printer_print_str(p, "extension"); p = isl_printer_yaml_next(p); p = isl_printer_print_str(p, "\""); p = isl_printer_print_union_map(p, tree->extension); p = isl_printer_print_str(p, "\""); break; case isl_schedule_node_filter: p = isl_printer_print_str(p, "filter"); p = isl_printer_yaml_next(p); p = isl_printer_print_str(p, "\""); p = isl_printer_print_union_set(p, tree->filter); p = isl_printer_print_str(p, "\""); break; case isl_schedule_node_guard: p = isl_printer_print_str(p, "guard"); p = isl_printer_yaml_next(p); p = isl_printer_print_str(p, "\""); p = isl_printer_print_set(p, tree->guard); p = isl_printer_print_str(p, "\""); break; case isl_schedule_node_mark: p = isl_printer_print_str(p, "mark"); p = isl_printer_yaml_next(p); p = isl_printer_print_str(p, "\""); p = isl_printer_print_str(p, isl_id_get_name(tree->mark)); p = isl_printer_print_str(p, "\""); break; case isl_schedule_node_band: p = print_tree_band(p, tree->band); break; } p = isl_printer_yaml_next(p); if (!tree->children) { if (n_ancestor > 0 && block) { isl_schedule_tree *leaf; p = isl_printer_print_str(p, "child"); p = isl_printer_yaml_next(p); leaf = isl_schedule_tree_leaf(isl_printer_get_ctx(p)); p = isl_printer_print_schedule_tree_mark(p, leaf, 0, NULL); isl_schedule_tree_free(leaf); p = isl_printer_yaml_next(p); } return isl_printer_yaml_end_mapping(p); } if (sequence) { p = isl_printer_yaml_start_sequence(p); } else { p = isl_printer_print_str(p, "child"); p = isl_printer_yaml_next(p); } n = isl_schedule_tree_list_n_schedule_tree(tree->children); for (i = 0; i < n; ++i) { isl_schedule_tree *t; t = isl_schedule_tree_get_child(tree, i); if (n_ancestor > 0 && child_pos[0] == i) p = isl_printer_print_schedule_tree_mark(p, t, n_ancestor - 1, child_pos + 1); else p = isl_printer_print_schedule_tree_mark(p, t, -1, NULL); isl_schedule_tree_free(t); p = isl_printer_yaml_next(p); } if (sequence) p = isl_printer_yaml_end_sequence(p); p = isl_printer_yaml_end_mapping(p); return p; } /* Print "tree" to "p". */ __isl_give isl_printer *isl_printer_print_schedule_tree( __isl_take isl_printer *p, __isl_keep isl_schedule_tree *tree) { return isl_printer_print_schedule_tree_mark(p, tree, -1, NULL); } void isl_schedule_tree_dump(__isl_keep isl_schedule_tree *tree) { isl_ctx *ctx; isl_printer *printer; if (!tree) return; ctx = isl_schedule_tree_get_ctx(tree); printer = isl_printer_to_file(ctx, stderr); printer = isl_printer_set_yaml_style(printer, ISL_YAML_STYLE_BLOCK); printer = isl_printer_print_schedule_tree(printer, tree); isl_printer_free(printer); } cloog-0.18.4/isl/isl_lp.c0000644000175000017500000002225112413270107012044 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 #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; return isl_tab_solve_lp(bmap, max, f, d, opt, opt_denom, sol); } 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.4/isl/isl_morph.c0000644000175000017500000005513412554427055012600 00000000000000/* * Copyright 2010-2011 INRIA Saclay * Copyright 2014 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_morph_get_ctx(__isl_keep isl_morph *morph) { if (!morph) return NULL; return isl_basic_set_get_ctx(morph->dom); } __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); } /* Is "morph" an identity on the parameters? */ static int identity_on_parameters(__isl_keep isl_morph *morph) { int is_identity; unsigned nparam; isl_mat *sub; nparam = isl_morph_dom_dim(morph, isl_dim_param); if (nparam != isl_morph_ran_dim(morph, isl_dim_param)) return 0; if (nparam == 0) return 1; sub = isl_mat_sub_alloc(morph->map, 0, 1 + nparam, 0, 1 + nparam); is_identity = isl_mat_is_scaled_identity(sub); isl_mat_free(sub); return is_identity; } /* Return an affine expression of the variables of the range of "morph" * in terms of the parameters and the variables of the domain on "morph". * * In order for the space manipulations to make sense, we require * that the parameters are not modified by "morph". */ __isl_give isl_multi_aff *isl_morph_get_var_multi_aff( __isl_keep isl_morph *morph) { isl_space *dom, *ran, *space; isl_local_space *ls; isl_multi_aff *ma; unsigned nparam, nvar; int i; int is_identity; if (!morph) return NULL; is_identity = identity_on_parameters(morph); if (is_identity < 0) return NULL; if (!is_identity) isl_die(isl_morph_get_ctx(morph), isl_error_invalid, "cannot handle parameter compression", return NULL); dom = isl_morph_get_dom_space(morph); ls = isl_local_space_from_space(isl_space_copy(dom)); ran = isl_morph_get_ran_space(morph); space = isl_space_map_from_domain_and_range(dom, ran); ma = isl_multi_aff_zero(space); nparam = isl_multi_aff_dim(ma, isl_dim_param); nvar = isl_multi_aff_dim(ma, isl_dim_out); for (i = 0; i < nvar; ++i) { isl_val *val; isl_vec *v; isl_aff *aff; v = isl_mat_get_row(morph->map, 1 + nparam + i); v = isl_vec_insert_els(v, 0, 1); val = isl_mat_get_element_val(morph->map, 0, 0); v = isl_vec_set_element_val(v, 0, val); aff = isl_aff_alloc_vec(isl_local_space_copy(ls), v); ma = isl_multi_aff_set_aff(ma, i, aff); } isl_local_space_free(ls); return ma; } /* Return the domain space of "morph". */ __isl_give isl_space *isl_morph_get_dom_space(__isl_keep isl_morph *morph) { if (!morph) return NULL; return isl_basic_set_get_space(morph->dom); } __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_dump(morph->dom); isl_basic_set_dump(morph->ran); 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.4/isl/isl_sort.h0000644000175000017500000000030512413256472012432 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.4/isl/isl_union_templ.c0000644000175000017500000007627312554427055014013 00000000000000/* * Copyright 2010 INRIA Saclay * Copyright 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 */ #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 *space; 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->space->ctx : NULL; } __isl_give isl_space *FN(UNION,get_space)(__isl_keep UNION *u) { if (!u) return NULL; return isl_space_copy(u->space); } /* Return the number of parameters of "u", where "type" * is required to be set to isl_dim_param. */ unsigned FN(UNION,dim)(__isl_keep UNION *u, enum isl_dim_type type) { if (!u) return 0; if (type != isl_dim_param) isl_die(FN(UNION,get_ctx)(u), isl_error_invalid, "can only reference parameters", return 0); return isl_space_dim(u->space, type); } /* Return the position of the parameter with the given name * in "u". * Return -1 if no such dimension can be found. */ int FN(UNION,find_dim_by_name)(__isl_keep UNION *u, enum isl_dim_type type, const char *name) { if (!u) return -1; return isl_space_find_dim_by_name(u->space, type, name); } #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) goto error; u->ref = 1; #ifdef HAS_TYPE u->type = type; #endif u->space = dim; if (isl_hash_table_init(dim->ctx, &u->table, size) < 0) return FN(UNION,free)(u); return u; error: isl_space_free(dim); 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; } /* Return the number of base expressions in "u". */ int FN(FN(UNION,n),PARTS)(__isl_keep UNION *u) { return u ? u->table.n : 0; } S(UNION,foreach_data) { isl_stat (*fn)(__isl_take PART *part, void *user); void *user; }; static isl_stat FN(UNION,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); } isl_stat FN(FN(UNION,foreach),PARTS)(__isl_keep UNION *u, isl_stat (*fn)(__isl_take PART *part, void *user), void *user) { S(UNION,foreach_data) data = { fn, user }; if (!u) return isl_stat_error; return isl_hash_table_foreach(u->space->ctx, &u->table, &FN(UNION,call_on_copy), &data); } /* Is the space of "entry" equal to "space"? */ static int FN(UNION,has_space)(const void *entry, const void *val) { PART *part = (PART *)entry; isl_space *space = (isl_space *) val; return isl_space_is_equal(part->dim, space); } /* This function is not currently used by isl_aff.c. */ static int FN(UNION,has_domain_space)(const void *entry, const void *val) __attribute__ ((unused)); /* Is the domain space of "entry" equal to "space"? */ static int FN(UNION,has_domain_space)(const void *entry, const void *val) { PART *part = (PART *)entry; isl_space *space = (isl_space *) val; if (isl_space_is_params(space)) return isl_space_is_set(part->dim); return isl_space_tuple_is_equal(part->dim, isl_dim_in, space, isl_dim_set); } /* Is the domain space of "entry" equal to the domain of "space"? */ static int FN(UNION,has_same_domain_space)(const void *entry, const void *val) { PART *part = (PART *)entry; isl_space *space = (isl_space *) val; if (isl_space_is_set(space)) return isl_space_is_set(part->dim); return isl_space_tuple_is_equal(part->dim, isl_dim_in, space, isl_dim_in); } /* Extract the element of "u" living in "space" (ignoring parameters). * * Return the ZERO element if "u" does not contain any element * living in "space". */ __isl_give PART *FN(FN(UNION,extract),PARTS)(__isl_keep UNION *u, __isl_take isl_space *space) { uint32_t hash; struct isl_hash_table_entry *entry; if (!u || !space) goto error; if (!isl_space_match(u->space, isl_dim_param, space, isl_dim_param)) { space = isl_space_drop_dims(space, isl_dim_param, 0, isl_space_dim(space, isl_dim_param)); space = isl_space_align_params(space, FN(UNION,get_space)(u)); if (!space) goto error; } hash = isl_space_get_hash(space); entry = isl_hash_table_find(u->space->ctx, &u->table, hash, &FN(UNION,has_space), space, 0); if (!entry) #ifdef HAS_TYPE return FN(PART,ZERO)(space, u->type); #else return FN(PART,ZERO)(space); #endif isl_space_free(space); return FN(PART,copy)(entry->data); error: isl_space_free(space); return NULL; } /* Add "part" to "u". * If "disjoint" is set, then "u" is not allowed to already have * a part that is defined on the same space as "part". * Otherwise, compute the union sum of "part" and the part in "u" * defined on the same space. */ static __isl_give UNION *FN(UNION,add_part_generic)(__isl_take UNION *u, __isl_take PART *part, int disjoint) { int empty; uint32_t hash; struct isl_hash_table_entry *entry; if (!part) goto error; empty = FN(PART,IS_ZERO)(part); if (empty < 0) goto error; if (empty) { FN(PART,free)(part); return u; } u = FN(UNION,align_params)(u, FN(PART,get_space)(part)); part = FN(PART,align_params)(part, FN(UNION,get_space)(u)); u = FN(UNION,cow)(u); if (!u) goto error; hash = isl_space_get_hash(part->dim); entry = isl_hash_table_find(u->space->ctx, &u->table, hash, &FN(UNION,has_same_domain_space), part->dim, 1); if (!entry) goto error; if (!entry->data) entry->data = part; else { PART *entry_part = entry->data; if (disjoint) isl_die(FN(UNION,get_ctx)(u), isl_error_invalid, "additional part should live on separate " "space", goto error); if (!isl_space_tuple_is_equal(entry_part->dim, isl_dim_out, part->dim, isl_dim_out)) isl_die(FN(UNION,get_ctx)(u), isl_error_invalid, "union expression can only contain a single " "expression over a given domain", goto error); entry->data = FN(PART,union_add_)(entry->data, FN(PART,copy)(part)); if (!entry->data) goto error; empty = FN(PART,IS_ZERO)(part); if (empty < 0) goto error; if (empty) { FN(PART,free)(entry->data); isl_hash_table_remove(u->space->ctx, &u->table, entry); } FN(PART,free)(part); } return u; error: FN(PART,free)(part); FN(UNION,free)(u); return NULL; } /* Add "part" to "u", where "u" is assumed not to already have * a part that is defined on the same space as "part". */ __isl_give UNION *FN(FN(UNION,add),PARTS)(__isl_take UNION *u, __isl_take PART *part) { return FN(UNION,add_part_generic)(u, part, 1); } static isl_stat FN(UNION,add_part)(__isl_take PART *part, void *user) { UNION **u = (UNION **)user; *u = FN(FN(UNION,add),PARTS)(*u, part); return isl_stat_ok; } __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->space), u->type); #else dup = FN(UNION,ZERO)(isl_space_copy(u->space)); #endif if (FN(FN(UNION,foreach),PARTS)(u, &FN(UNION,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 isl_stat FN(UNION,free_u_entry)(void **entry, void *user) { PART *part = *entry; FN(PART,free)(part); return isl_stat_ok; } __isl_null UNION *FN(UNION,free)(__isl_take UNION *u) { if (!u) return NULL; if (--u->ref > 0) return NULL; isl_hash_table_foreach(u->space->ctx, &u->table, &FN(UNION,free_u_entry), NULL); isl_hash_table_clear(&u->table); isl_space_free(u->space); free(u); return NULL; } S(UNION,align) { isl_reordering *exp; UNION *res; }; static isl_stat FN(UNION,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 isl_stat_ok; } /* Reorder the parameters of "u" according to the given reordering. */ static __isl_give UNION *FN(UNION,realign_domain)(__isl_take UNION *u, __isl_take isl_reordering *r) { S(UNION,align) data = { NULL, NULL }; if (!u || !r) goto error; #ifdef HAS_TYPE data.res = FN(UNION,alloc)(isl_space_copy(r->dim), u->type, u->table.n); #else data.res = FN(UNION,alloc)(isl_space_copy(r->dim), u->table.n); #endif data.exp = r; if (FN(FN(UNION,foreach),PARTS)(u, &FN(UNION,align_entry), &data) < 0) data.res = FN(UNION,free)(data.res); isl_reordering_free(data.exp); FN(UNION,free)(u); return data.res; error: FN(UNION,free)(u); isl_reordering_free(r); return NULL; } /* Align the parameters of "u" to those of "model". */ __isl_give UNION *FN(UNION,align_params)(__isl_take UNION *u, __isl_take isl_space *model) { isl_reordering *r; if (!u || !model) goto error; if (isl_space_match(u->space, isl_dim_param, model, isl_dim_param)) { isl_space_free(model); return u; } model = isl_space_params(model); r = isl_parameter_alignment_reordering(u->space, model); isl_space_free(model); return FN(UNION,realign_domain)(u, r); error: isl_space_free(model); FN(UNION,free)(u); return NULL; } /* Add "part" to *u, taking the union sum if "u" already has * a part defined on the same space as "part". */ static isl_stat FN(UNION,union_add_part)(__isl_take PART *part, void *user) { UNION **u = (UNION **)user; *u = FN(UNION,add_part_generic)(*u, part, 0); return isl_stat_ok; } /* Compute the sum of "u1" and "u2" on the union of their domains, * with the actual sum on the shared domain and * the defined expression on the symmetric difference of the domains. * * This is an internal function that is exposed under different * names depending on whether the base expressions have a zero default * value. * If they do, then this function is called "add". * Otherwise, it is called "union_add". */ static __isl_give UNION *FN(UNION,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, &FN(UNION,union_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 isl_stat FN(UNION,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; PART *part2; space = FN(PART,get_space)(part); hash = isl_space_get_hash(space); entry2 = isl_hash_table_find(data->u2->space->ctx, &data->u2->table, hash, &FN(UNION,has_same_domain_space), space, 0); isl_space_free(space); if (!entry2) return isl_stat_ok; part2 = entry2->data; if (!isl_space_tuple_is_equal(part->dim, isl_dim_out, part2->dim, isl_dim_out)) isl_die(FN(UNION,get_ctx)(data->u2), isl_error_invalid, "entries should have the same range space", return isl_stat_error); part = FN(PART, copy)(part); part = data->fn(part, FN(PART, copy)(entry2->data)); data->res = FN(FN(UNION,add),PARTS)(data->res, part); if (!data->res) return isl_stat_error; return isl_stat_ok; } /* This function is currently only used from isl_polynomial.c * and not from isl_fold.c. */ static __isl_give UNION *FN(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 *FN(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->space), u1->type, u1->table.n); #else data.res = FN(UNION,alloc)(isl_space_copy(u1->space), u1->table.n); #endif if (isl_hash_table_foreach(u1->space->ctx, &u1->table, &FN(UNION,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; } /* Compute the sum of "u1" and "u2". * * If the base expressions have a default zero value, then the sum * is computed on the union of the domains of "u1" and "u2". * Otherwise, it is computed on their shared domains. */ __isl_give UNION *FN(UNION,add)(__isl_take UNION *u1, __isl_take UNION *u2) { #if DEFAULT_IS_ZERO return FN(UNION,union_add_)(u1, u2); #else return FN(UNION,match_bin_op)(u1, u2, &FN(PART,add)); #endif } #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 FN(UNION,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 isl_stat FN(UNION,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)); data->res = FN(FN(UNION,add),PARTS)(data->res, pw); if (!data->res) return isl_stat_error; return isl_stat_ok; } /* Update each element of "u" by calling "fn" on the element and "set". */ static __isl_give UNION *FN(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->space), u->type, u->table.n); #else data.res = FN(UNION,alloc)(isl_space_copy(u->space), u->table.n); #endif if (isl_hash_table_foreach(u->space->ctx, &u->table, &FN(UNION,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 FN(UNION,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 FN(UNION,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 FN(UNION,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 lives 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 isl_stat FN(UNION,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, &FN(UNION,set_has_dim), space, 0); isl_space_free(space); if (!entry2) return isl_stat_ok; pw = FN(PW,copy)(pw); pw = data->fn(pw, isl_set_copy(entry2->data)); data->res = FN(FN(UNION,add),PARTS)(data->res, pw); if (!data->res) return isl_stat_error; return isl_stat_ok; } /* 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 *FN(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->space), u->type, u->table.n); #else data.res = FN(UNION,alloc)(isl_space_copy(u->space), u->table.n); #endif if (isl_hash_table_foreach(u->space->ctx, &u->table, &FN(UNION,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 FN(UNION,match_domain_op)(u, uset, &FN(PW,intersect_domain)); } /* Internal data structure for isl_union_*_subtract_domain. * uset is the set that needs to be removed from the domain. * res collects the results. */ S(UNION,subtract_domain_data) { isl_union_set *uset; UNION *res; }; /* Take the set (which may be empty) in data->uset that lives * in the same space as the domain of "pw", subtract it from the domain * of "pw" and add the result to data->res. */ static isl_stat FN(UNION,subtract_domain_entry)(__isl_take PW *pw, void *user) { S(UNION,subtract_domain_data) *data = user; isl_space *space; isl_set *set; space = FN(PW,get_domain_space)(pw); set = isl_union_set_extract_set(data->uset, space); pw = FN(PW,subtract_domain)(pw, set); data->res = FN(FN(UNION,add),PARTS)(data->res, pw); return isl_stat_ok; } /* Subtract "uset' from the domain of "u". */ __isl_give UNION *FN(UNION,subtract_domain)(__isl_take UNION *u, __isl_take isl_union_set *uset) { S(UNION,subtract_domain_data) data; if (!u || !uset) goto error; data.uset = uset; #ifdef HAS_TYPE data.res = FN(UNION,alloc)(isl_space_copy(u->space), u->type, u->table.n); #else data.res = FN(UNION,alloc)(isl_space_copy(u->space), u->table.n); #endif if (FN(FN(UNION,foreach),PARTS)(u, &FN(UNION,subtract_domain_entry), &data) < 0) data.res = FN(UNION,free)(data.res); FN(UNION,free)(u); isl_union_set_free(uset); return data.res; error: FN(UNION,free)(u); isl_union_set_free(uset); return NULL; } __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 FN(UNION,match_domain_op)(u, uset, &FN(PW,gist)); } #ifndef NO_EVAL __isl_give isl_val *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_val *v; if (!u || !pnt) goto error; space = isl_space_copy(pnt->dim); if (!space) goto error; hash = isl_space_get_hash(space); entry = isl_hash_table_find(u->space->ctx, &u->table, hash, &FN(UNION,has_domain_space), space, 0); isl_space_free(space); if (!entry) { v = isl_val_zero(isl_point_get_ctx(pnt)); isl_point_free(pnt); } else { v = FN(PART,eval)(FN(PART,copy)(entry->data), pnt); } FN(UNION,free)(u); return v; error: FN(UNION,free)(u); isl_point_free(pnt); return NULL; } #endif static isl_stat FN(UNION,coalesce_entry)(void **entry, void *user) { PW **pw = (PW **)entry; *pw = FN(PW,coalesce)(*pw); if (!*pw) return isl_stat_error; return isl_stat_ok; } __isl_give UNION *FN(UNION,coalesce)(__isl_take UNION *u) { if (!u) return NULL; if (isl_hash_table_foreach(u->space->ctx, &u->table, &FN(UNION,coalesce_entry), NULL) < 0) goto error; return u; error: FN(UNION,free)(u); return NULL; } static isl_stat FN(UNION,domain_entry)(__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 isl_stat_ok; } __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, &FN(UNION,domain_entry), &uset) < 0) goto error; FN(UNION,free)(u); return uset; error: isl_union_set_free(uset); FN(UNION,free)(u); return NULL; } static isl_stat FN(UNION,mul_isl_int_entry)(void **entry, void *user) { PW **pw = (PW **)entry; isl_int *v = user; *pw = FN(PW,mul_isl_int)(*pw, *v); if (!*pw) return isl_stat_error; return isl_stat_ok; } __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->space->ctx, &u->table, &FN(UNION,mul_isl_int_entry), &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 isl_stat FN(UNION,scale_val_entry)(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 isl_stat_error; return isl_stat_ok; } /* 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->space->ctx, &u->table, &FN(UNION,scale_val_entry), v) < 0) goto error; isl_val_free(v); return u; error: isl_val_free(v); FN(UNION,free)(u); return NULL; } /* Divide *entry by the isl_val "user". * * Return 0 on success and -1 on error. */ static isl_stat FN(UNION,scale_down_val_entry)(void **entry, void *user) { PW **pw = (PW **)entry; isl_val *v = user; *pw = FN(PW,scale_down_val)(*pw, isl_val_copy(v)); if (!*pw) return isl_stat_error; return isl_stat_ok; } /* Divide "u" by "v" and return the result. */ __isl_give UNION *FN(UNION,scale_down_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 (!isl_val_is_rat(v)) isl_die(isl_val_get_ctx(v), isl_error_invalid, "expecting rational factor", goto error); if (isl_val_is_zero(v)) isl_die(isl_val_get_ctx(v), isl_error_invalid, "cannot scale down by zero", 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(FN(UNION,get_ctx)(u), &u->table, &FN(UNION,scale_down_val_entry), 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; isl_bool is_equal; }; static isl_stat FN(UNION,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->space->ctx, &data->u2->table, hash, &FN(UNION,has_same_domain_space), pw->dim, 0); if (!entry2) { data->is_equal = isl_bool_false; return isl_stat_error; } data->is_equal = FN(PW,plain_is_equal)(pw, entry2->data); if (data->is_equal < 0 || !data->is_equal) return isl_stat_error; return isl_stat_ok; } isl_bool FN(UNION,plain_is_equal)(__isl_keep UNION *u1, __isl_keep UNION *u2) { S(UNION,plain_is_equal_data) data = { NULL, isl_bool_true }; if (!u1 || !u2) return isl_bool_error; if (u1 == u2) return isl_bool_true; if (u1->table.n != u2->table.n) return isl_bool_false; 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->space->ctx, &u1->table, &FN(UNION,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 isl_bool_error; } #ifndef NO_NEG /* Replace *entry by its opposite. * * Return 0 on success and -1 on error. */ static isl_stat FN(UNION,neg_entry)(void **entry, void *user) { PW **pw = (PW **) entry; *pw = FN(PW,neg)(*pw); return *pw ? isl_stat_ok : isl_stat_error; } /* Return the opposite of "u". */ __isl_give UNION *FN(UNION,neg)(__isl_take UNION *u) { u = FN(UNION,cow)(u); if (!u) return NULL; if (isl_hash_table_foreach(u->space->ctx, &u->table, &FN(UNION,neg_entry), NULL) < 0) return FN(UNION,free)(u); return u; } #endif /* Internal data structure for isl_union_*_drop_dims. * type, first and n are passed to isl_*_drop_dims. * res collects the results. */ S(UNION,drop_dims_data) { enum isl_dim_type type; unsigned first; unsigned n; UNION *res; }; /* Drop the parameters specified by "data" from "part" and * add the results to data->res. */ static isl_stat FN(UNION,drop_dims_entry)(__isl_take PART *part, void *user) { S(UNION,drop_dims_data) *data = user; part = FN(PART,drop_dims)(part, data->type, data->first, data->n); data->res = FN(FN(UNION,add),PARTS)(data->res, part); if (!data->res) return isl_stat_error; return isl_stat_ok; } /* Drop the specified parameters from "u". * That is, type is required to be isl_dim_param. */ __isl_give UNION *FN(UNION,drop_dims)( __isl_take UNION *u, enum isl_dim_type type, unsigned first, unsigned n) { isl_space *space; S(UNION,drop_dims_data) data = { type, first, n }; if (!u) return NULL; if (type != isl_dim_param) isl_die(FN(UNION,get_ctx)(u), isl_error_invalid, "can only project out parameters", return FN(UNION,free)(u)); space = FN(UNION,get_space)(u); space = isl_space_drop_dims(space, type, first, n); #ifdef HAS_TYPE data.res = FN(UNION,alloc)(space, u->type, u->table.n); #else data.res = FN(UNION,alloc)(space, u->table.n); #endif if (FN(FN(UNION,foreach),PARTS)(u, &FN(UNION,drop_dims_entry), &data) < 0) data.res = FN(UNION,free)(data.res); FN(UNION,free)(u); return data.res; } /* Internal data structure for isl_union_*_set_dim_name. * pos is the position of the parameter that needs to be renamed. * s is the new name. * res collects the results. */ S(UNION,set_dim_name_data) { unsigned pos; const char *s; UNION *res; }; /* Change the name of the parameter at position data->pos of "part" to data->s * and add the result to data->res. */ static isl_stat FN(UNION,set_dim_name_entry)(__isl_take PART *part, void *user) { S(UNION,set_dim_name_data) *data = user; part = FN(PART,set_dim_name)(part, isl_dim_param, data->pos, data->s); data->res = FN(FN(UNION,add),PARTS)(data->res, part); if (!data->res) return isl_stat_error; return isl_stat_ok; } /* Change the name of the parameter at position "pos" to "s". * That is, type is required to be isl_dim_param. */ __isl_give UNION *FN(UNION,set_dim_name)(__isl_take UNION *u, enum isl_dim_type type, unsigned pos, const char *s) { S(UNION,set_dim_name_data) data = { pos, s }; isl_space *space; if (!u) return NULL; if (type != isl_dim_param) isl_die(FN(UNION,get_ctx)(u), isl_error_invalid, "can only set parameter names", return FN(UNION,free)(u)); space = FN(UNION,get_space)(u); space = isl_space_set_dim_name(space, type, pos, s); #ifdef HAS_TYPE data.res = FN(UNION,alloc)(space, u->type, u->table.n); #else data.res = FN(UNION,alloc)(space, u->table.n); #endif if (FN(FN(UNION,foreach),PARTS)(u, &FN(UNION,set_dim_name_entry), &data) < 0) data.res = FN(UNION,free)(data.res); FN(UNION,free)(u); return data.res; } /* Reset the user pointer on all identifiers of parameters and tuples * of the space of "part" and add the result to *res. */ static isl_stat FN(UNION,reset_user_entry)(__isl_take PART *part, void *user) { UNION **res = user; part = FN(PART,reset_user)(part); *res = FN(FN(UNION,add),PARTS)(*res, part); if (!*res) return isl_stat_error; return isl_stat_ok; } /* Reset the user pointer on all identifiers of parameters and tuples * of the spaces of "u". */ __isl_give UNION *FN(UNION,reset_user)(__isl_take UNION *u) { isl_space *space; UNION *res; if (!u) return NULL; space = FN(UNION,get_space)(u); space = isl_space_reset_user(space); #ifdef HAS_TYPE res = FN(UNION,alloc)(space, u->type, u->table.n); #else res = FN(UNION,alloc)(space, u->table.n); #endif if (FN(FN(UNION,foreach),PARTS)(u, &FN(UNION,reset_user_entry), &res) < 0) res = FN(UNION,free)(res); FN(UNION,free)(u); return res; } cloog-0.18.4/isl/isl_dim_map.c0000644000175000017500000001253412413256472013053 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.4/isl/basis_reduction_templ.c0000644000175000017500000002053012554427055015152 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 #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 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++; if (GBR_lp_solve(lp) < 0) 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++; if (GBR_lp_solve(lp) < 0) 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++; if (GBR_lp_solve(lp) < 0) 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++; if (GBR_lp_solve(lp) < 0) 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.4/isl/isl_scan.c0000644000175000017500000001674512554427055012404 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 #include struct isl_counter { struct isl_scan_callback callback; isl_int count; isl_int max; }; static isl_stat 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 isl_stat_ok; return isl_stat_error; } 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.4/isl/isl_ast_graft.c0000644000175000017500000010616512554427055013426 00000000000000/* * Copyright 2012 Ecole Normale Superieure * Copyright 2014 INRIA Rocquencourt * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, * Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt, * B.P. 105 - 78153 Le Chesnay, 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); if (isl_set_dim(graft_0->guard, isl_dim_set) <= depth) skip = 0; else 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; } /* Hoist "guard" out of the current level (given by "build"). * * In particular, eliminate the dimension corresponding to the current depth. */ static __isl_give isl_set *hoist_guard(__isl_take isl_set *guard, __isl_keep isl_ast_build *build) { int depth; 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); } return guard; } /* 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. * If there is only one graft in the list and if its guard * depends on the current level, then we eliminate this level and * return the result. * * Otherwise, we return the unshifted simple hull of the guards. * In order to be able to hoist as many constraints as possible, * but at the same time avoid hoisting constraints that did not * appear in the guards in the first place, we intersect the guards * with all the information that is available (i.e., the domain * from the build and the enforced constraints of the graft) and * compute the unshifted hull of the result using only constraints * from the original guards. * In particular, intersecting the guards with other known information * allows us to hoist guards that are only explicit is some of * the grafts and implicit in the others. * * 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. */ __isl_give isl_set *isl_ast_graft_list_extract_hoistable_guard( __isl_keep isl_ast_graft_list *list, __isl_keep isl_ast_build *build) { int i, n; int equal; isl_ctx *ctx; isl_set *guard; isl_set_list *set_list; isl_basic_set *hull; 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; if (equal || n == 1) { isl_ast_graft *graft_0; graft_0 = isl_ast_graft_list_get_ast_graft(list, 0); if (!graft_0) return NULL; guard = isl_set_copy(graft_0->guard); if (!equal) guard = hoist_guard(guard, build); isl_ast_graft_free(graft_0); return guard; } ctx = isl_ast_build_get_ctx(build); set_list = isl_set_list_alloc(ctx, n); guard = isl_set_empty(isl_ast_build_get_space(build, 1)); for (i = 0; i < n; ++i) { isl_ast_graft *graft; isl_basic_set *enforced; isl_set *guard_i; graft = isl_ast_graft_list_get_ast_graft(list, i); enforced = isl_ast_graft_get_enforced(graft); guard_i = isl_set_copy(graft->guard); isl_ast_graft_free(graft); set_list = isl_set_list_add(set_list, isl_set_copy(guard_i)); guard_i = isl_set_intersect(guard_i, isl_set_from_basic_set(enforced)); guard_i = isl_set_intersect(guard_i, isl_ast_build_get_domain(build)); guard = isl_set_union(guard, guard_i); } hull = isl_set_unshifted_simple_hull_from_set_list(guard, set_list); guard = isl_set_from_basic_set(hull); return hoist_guard(guard, build); } /* 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 isl_stat 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_internal(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 isl_stat 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 isl_stat_ok; } /* 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); 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; } /* 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. * Subsequently remove the guards from the grafts. */ __isl_give isl_ast_graft_list *isl_ast_graft_list_insert_pending_guard_nodes( __isl_take isl_ast_graft_list *list, __isl_keep isl_ast_build *build) { int i, n; isl_set *universe; list = insert_pending_guard_nodes(list, build); if (!list) return NULL; universe = isl_set_universe(isl_ast_build_get_space(build, 1)); 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; isl_set_free(graft->guard); graft->guard = isl_set_copy(universe); if (!graft->guard) graft = isl_ast_graft_free(graft); list = isl_ast_graft_list_set_ast_graft(list, i, graft); } isl_set_free(universe); if (i < n) return isl_ast_graft_list_free(list); return list; } /* 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. */ __isl_give isl_basic_set *isl_ast_graft_list_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 * the generated constraints of "build". In fact, the new guard * may in itself have some redundant constraints. * 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_set_gist(graft->guard, isl_ast_build_get_generated(build)); 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; } /* For each graft in "list", replace its guard with the gist with * respect to "context". */ __isl_give isl_ast_graft_list *isl_ast_graft_list_gist_guards( __isl_take isl_ast_graft_list *list, __isl_take isl_set *context) { list = gist_guards(list, context); isl_set_free(context); return list; } /* Allocate a graft in "build" based on the list of grafts in "sub_build". * "guard" and "enforced" are the guard and enforced constraints * of the allocated graft. The guard is used to simplify the guards * of the elements in "list". * * 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_from_children( __isl_take isl_ast_graft_list *list, __isl_take isl_set *guard, __isl_take isl_basic_set *enforced, __isl_keep isl_ast_build *build, __isl_keep isl_ast_build *sub_build) { isl_ast_build *guard_build; isl_ast_node *node; isl_ast_node_list *node_list; isl_ast_graft *graft; guard_build = isl_ast_build_copy(sub_build); guard_build = isl_ast_build_replace_pending_by_guard(guard_build, isl_set_copy(guard)); list = gist_guards(list, guard); list = insert_pending_guard_nodes(list, guard_build); isl_ast_build_free(guard_build); node_list = extract_node_list(list); node = isl_ast_node_from_ast_node_list(node_list); isl_ast_graft_list_free(list); graft = isl_ast_graft_alloc(node, build); graft = store_guard(graft, guard, build); graft = isl_ast_graft_enforce(graft, enforced); return graft; } /* Combine the grafts in the list into a single graft. * * 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_ast_graft *graft; isl_basic_set *enforced; isl_set *guard; if (!list) return NULL; enforced = isl_ast_graft_list_extract_shared_enforced(list, build); guard = isl_ast_graft_list_extract_hoistable_guard(list, build); graft = isl_ast_graft_alloc_from_children(list, guard, enforced, build, build); 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); 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); } /* 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; } /* Insert a mark governing the current graft->node. */ __isl_give isl_ast_graft *isl_ast_graft_insert_mark( __isl_take isl_ast_graft *graft, __isl_take isl_id *mark) { if (!graft) goto error; graft->node = isl_ast_node_alloc_mark(mark, graft->node); if (!graft->node) return isl_ast_graft_free(graft); return graft; error: isl_id_free(mark); 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". */ __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) { return store_guard(graft, guard, build); } /* 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.4/isl/test_inputs/0000755000175000017500000000000012511231702013052 500000000000000cloog-0.18.4/isl/test_inputs/convex9.polylib0000644000175000017500000000013612413256472015775 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.4/isl/test_inputs/seghir-vd.pip0000644000175000017500000000031012413256472015402 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.4/isl/test_inputs/affine3.polylib0000644000175000017500000000005412413256472015714 000000000000003 4 1 1 0 0 1 -7 4 2 1 5 -4 2 1 4 0 3 -2 0 cloog-0.18.4/isl/test_inputs/gist1.polylib0000644000175000017500000000015512413256472015432 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.4/isl/test_inputs/convex11.polylib0000644000175000017500000000014112413256472016042 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.4/isl/test_inputs/convex12.polylib0000644000175000017500000000024112413256472016044 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.4/isl/test_inputs/test3Deg3Var.pwqp0000644000175000017500000000007612413256472016140 00000000000000[p] -> { [n, m] -> (n + n^3) : n >= 1 and m >= n and m <= p } cloog-0.18.4/isl/test_inputs/affine.polylib0000644000175000017500000000025412413256472015633 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.4/isl/test_inputs/convex7.polylib0000644000175000017500000000006212413256472015771 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.4/isl/test_inputs/application.omega0000644000175000017500000000010012413256472016312 00000000000000{[x]} {[x] -> [y] : y = 2x} {[y]: Exists ( alpha : 2alpha = y)} cloog-0.18.4/isl/test_inputs/max.pip0000644000175000017500000000010512413256472014301 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.4/isl/test_inputs/codegen/0000755000175000017500000000000012554427055014475 500000000000000cloog-0.18.4/isl/test_inputs/codegen/hoist.in0000644000175000017500000000103112413256472016063 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.4/isl/test_inputs/codegen/component3.st0000644000175000017500000000023412554427055017051 00000000000000domain: "{ A[]; B[i] : 0 <= i < 10 }" child: schedule: "[{ A[] -> [0]; B[i] -> [i] }]" child: set: - filter: "{ B[i] }" - filter: "{ A[] }" cloog-0.18.4/isl/test_inputs/codegen/component2.c0000644000175000017500000000011012554427055016635 00000000000000for (int c0 = 0; c0 <= 9; c0 += 1) { B(c0); if (c0 == 0) A(); } cloog-0.18.4/isl/test_inputs/codegen/atomic3.in0000644000175000017500000000032012413256472016274 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.4/isl/test_inputs/codegen/stride5.c0000644000175000017500000000014412554427055016137 00000000000000if (n % 2 == 0) for (int c0 = (n / 2) + 2 * floord(-n - 1, 4) + 2; c0 <= 100; c0 += 2) S(c0); cloog-0.18.4/isl/test_inputs/codegen/filter.st0000644000175000017500000000106412554427055016253 00000000000000# Check proper handling of filters that turn out to be empty on their paths domain: "[n,m] -> { A[i,j] : 0 <= i,j < n }" child: set: - filter: "[n,m] -> { A[i,j] : m < n }" child: schedule: "[{ A[i,j] -> [i] }]" child: set: - filter: "[n,m] -> { A[i,j] : m < n }" - filter: "[n,m] -> { A[i,j] : m >= n }" - filter: "[n,m] -> { A[i,j] : m >= n }" child: schedule: "[{ A[i,j] -> [i] }]" child: set: - filter: "[n,m] -> { A[i,j] : m < n }" - filter: "[n,m] -> { A[i,j] : m >= n }" cloog-0.18.4/isl/test_inputs/codegen/atomic.st0000644000175000017500000000020612554427055016237 00000000000000domain: "{ a[i] : 0 <= i < 10; b[i] : 0 <= i < 10 }" child: schedule: "[{ a[i] -> [i]; b[i] -> [i+1] }]" options: "{ atomic[x] }" cloog-0.18.4/isl/test_inputs/codegen/isolate6.c0000644000175000017500000000162712554427055016315 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) { A(c2, 10 * c1); A(c2, 10 * c1 + 1); A(c2, 10 * c1 + 2); A(c2, 10 * c1 + 3); A(c2, 10 * c1 + 4); A(c2, 10 * c1 + 5); A(c2, 10 * c1 + 6); A(c2, 10 * c1 + 7); A(c2, 10 * c1 + 8); A(c2, 10 * c1 + 9); } 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(10 * c1 + 9, -c2 + 100); c3 += 1) A(c2, c3); } cloog-0.18.4/isl/test_inputs/codegen/unroll7.c0000644000175000017500000000013412413271702016147 00000000000000{ S(0, 0); S(0, 3); S(0, 4); S(1, 1); S(1, 4); S(2, 2); S(3, 3); S(4, 4); } cloog-0.18.4/isl/test_inputs/codegen/mod.c0000644000175000017500000000005312413256472015333 00000000000000if (2 * (n % 100) == 3 * (m % 200)) A(); cloog-0.18.4/isl/test_inputs/codegen/component4.c0000644000175000017500000000022112554427055016642 00000000000000{ for (int c1 = 0; c1 <= 9; c1 += 1) A(c1); for (int c0 = 0; c0 <= 9; c0 += 1) for (int c2 = 0; c2 <= 9; c2 += 1) B(c0, c2); } cloog-0.18.4/isl/test_inputs/codegen/component5.c0000644000175000017500000000017312554427055016651 00000000000000for (int c0 = 0; c0 <= 9; c0 += 1) for (int c1 = 0; c1 <= 9; c1 += 1) { if (c0 == 0) A(c1); B(c0, c1); } cloog-0.18.4/isl/test_inputs/codegen/atomic.c0000644000175000017500000000014012413256472016025 00000000000000for (int c0 = 0; c0 <= 10; c0 += 1) { if (c0 >= 1) b(c0 - 1); if (c0 <= 9) a(c0); } cloog-0.18.4/isl/test_inputs/codegen/roman.in0000644000175000017500000000707612413271702016061 00000000000000# Older versions of isl would get confused on this input due to disappearing # div constraints. [np1, i] -> { S_17[i0, i1, i2] -> [0, i0, 2, i1, 1, i2, 1] : exists (e0 = [(np1 - i)/4294967296], e1 = [(-2 + i + i0)/4294967296], e2 = [(i1)/4294967296]: i0 >= 0 and 4294967296e0 <= np1 - i and 4294967296e0 >= -4294967295 + np1 - i and 4294967296e0 <= np1 - i - i0 and i0 <= 20 and i1 >= 0 and 4294967296e1 <= -2 + i + i0 and 4294967296e1 >= -4294967297 + i + i0 and 4294967296e1 <= -2 + i + i0 - i1 and i1 <= 19 and i2 >= 0 and 4294967296e2 <= i1 and 4294967296e2 >= -4294967295 + i1 and 4294967296e2 <= i1 - i2 and i2 <= 19 and i0 >= 2 - i and i2 <= -1 + i1); S_18[i0, i1] -> [0, i0, 2, i1, 2, 0, 0] : exists (e0 = [(np1 - i)/4294967296], e1 = [(-2 + i + i0)/4294967296]: i0 >= 0 and 4294967296e0 <= np1 - i and 4294967296e0 >= -4294967295 + np1 - i and 4294967296e0 <= np1 - i - i0 and i0 <= 20 and i1 >= 0 and 4294967296e1 <= -2 + i + i0 and 4294967296e1 >= -4294967297 + i + i0 and 4294967296e1 <= -2 + i + i0 - i1 and i1 <= 19 and i0 >= 2 - i); S_24[i0, i1] -> [0, i0, 2, i1, 3, 0, 0] : exists (e0 = [(np1 - i)/4294967296], e1 = [(-2 + i + i0)/4294967296]: i0 >= 0 and 4294967296e0 <= np1 - i and 4294967296e0 >= -4294967295 + np1 - i and 4294967296e0 <= np1 - i - i0 and i0 <= 20 and i1 >= 0 and 4294967296e1 <= -2 + i + i0 and 4294967296e1 >= -4294967297 + i + i0 and 4294967296e1 <= -2 + i + i0 - i1 and i1 <= 19 and i0 >= 2 - i); S_15[i0, i1] -> [0, i0, 2, i1, 0, 0, 0] : exists (e0 = [(np1 - i)/4294967296], e1 = [(-2 + i + i0)/4294967296]: i0 >= 0 and 4294967296e0 <= np1 - i and 4294967296e0 >= -4294967295 + np1 - i and 4294967296e0 <= np1 - i - i0 and i0 <= 20 and i1 >= 0 and 4294967296e1 <= -2 + i + i0 and 4294967296e1 >= -4294967297 + i + i0 and 4294967296e1 <= -2 + i + i0 - i1 and i1 <= 19 and i0 >= 2 - i); S_9[i0] -> [0, i0, 0, 0, 0, 0, 0] : exists (e0 = [(np1 - i)/4294967296]: i0 >= 0 and 4294967296e0 <= np1 - i and 4294967296e0 >= -4294967295 + np1 - i and 4294967296e0 <= np1 - i - i0 and i0 <= 20); S_10[i0] -> [0, i0, 1, 0, 0, 0, 0] : exists (e0 = [(np1 - i)/4294967296]: i0 >= 0 and 4294967296e0 <= np1 - i and 4294967296e0 >= -4294967295 + np1 - i and 4294967296e0 <= np1 - i - i0 and i0 <= 20 and i0 >= 2 - i); S_19[i0, i1] -> [0, i0, 2, i1, 4, 0, 0] : exists (e0 = [(np1 - i)/4294967296], e1 = [(-2 + i + i0)/4294967296]: i0 >= 0 and 4294967296e0 <= np1 - i and 4294967296e0 >= -4294967295 + np1 - i and 4294967296e0 <= np1 - i - i0 and i0 <= 20 and i1 >= 0 and 4294967296e1 <= -2 + i + i0 and 4294967296e1 >= -4294967297 + i + i0 and 4294967296e1 <= -2 + i + i0 - i1 and i1 <= 19 and i0 >= 2 - i and i1 <= -3 + i + i0); S_12[i0] -> [0, i0, 3, 0, 0, 0, 0] : exists (e0 = [(np1 - i)/4294967296]: i0 >= 0 and 4294967296e0 <= np1 - i and 4294967296e0 >= -4294967295 + np1 - i and 4294967296e0 <= np1 - i - i0 and i0 <= 20); S_16[i0, i1, i2] -> [0, i0, 2, i1, 1, i2, 0] : exists (e0 = [(np1 - i)/4294967296], e1 = [(-2 + i + i0)/4294967296], e2 = [(i1)/4294967296]: i0 >= 0 and 4294967296e0 <= np1 - i and 4294967296e0 >= -4294967295 + np1 - i and 4294967296e0 <= np1 - i - i0 and i0 <= 20 and i1 >= 0 and 4294967296e1 <= -2 + i + i0 and 4294967296e1 >= -4294967297 + i + i0 and 4294967296e1 <= -2 + i + i0 - i1 and i1 <= 19 and i2 >= 0 and 4294967296e2 <= i1 and 4294967296e2 >= -4294967295 + i1 and 4294967296e2 <= i1 - i2 and i2 <= 19 and i0 >= 2 - i) } [np1, i] -> { : exists (e0 = [(np1 - i)/4294967296]: 4294967296e0 <= np1 - i and 4294967296e0 >= -20 + np1 - i and np1 >= -2147483648 and np1 <= 2147483647 and i >= -2147483648 and i <= 2147483647) } [np1, i] -> { [i0, i1, i2, i3, i4, i5, i6] -> separate[o0] } cloog-0.18.4/isl/test_inputs/codegen/separation_class.c0000644000175000017500000000131112413270107020073 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(10 * c1 + 9, -c2 + 100); c3 += 1) A(c2, c3); } cloog-0.18.4/isl/test_inputs/codegen/isolate4.st0000644000175000017500000000030412554427055016506 00000000000000# Check that generic options are not applied to isolated part domain: "{ A[i] : 0 <= i < 20 }" child: schedule: "[{ A[i] -> [i] }]" options: "{ isolate[[] -> [x]] : 5 <= x <= 15; unroll[x] }" cloog-0.18.4/isl/test_inputs/codegen/separation_class2.in0000644000175000017500000000043012413256472020353 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.4/isl/test_inputs/codegen/separation_class4.in0000644000175000017500000000144312413270107020351 00000000000000# Check that isl is not confused by the combination of separation classes # and unroll. { S_0[t, i] -> [o0, 1, o9, t] : 4o0 >= -3 + t and 4o0 <= t and i >= 60 and i <= 65 and 6o9 >= 5 + t - 4o0 and 6o9 <= 10 + t - 4o0 and 4o0 <= -62 + t + i and 4o0 >= 59 + t - i and o0 >= 0 and o0 <= 127 and t <= 511 and t >= 0 and 4o0 >= -66 + t + i and 4o0 <= 63 + t - i; S_0[t, i] -> [o0, 0, o9, t] : 4o0 >= -1 + t and 4o0 <= 2 + t and i >= 57 and i <= 62 and 6o9 >= 7 + t - 4o0 and 6o9 <= 12 + t - 4o0 and t >= 0 and t <= 511 and 4o0 <= -57 + t + i and 4o0 >= 58 + t - i and o0 >= 0 and o0 <= 128 and 4o0 >= -61 + t + i and 4o0 <= 62 + t - i } { : } { [i0, i1, i2, t] -> unroll[1]; [i0, 1, i2, t] -> separation_class[[1] -> [0]] : 0 <= i0 <= 127; [i0, 0, i2, t] -> separation_class[[1] -> [0]] : 1 <= i0 <= 127} cloog-0.18.4/isl/test_inputs/codegen/separation_class.in0000644000175000017500000000037012413256472020274 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.4/isl/test_inputs/codegen/stride.in0000644000175000017500000000034712413256472016240 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.4/isl/test_inputs/codegen/component1.c0000644000175000017500000000007312554427055016644 00000000000000{ A(); for (int c0 = 0; c0 <= 9; c0 += 1) B(c0); } cloog-0.18.4/isl/test_inputs/codegen/disjuncts.c0000644000175000017500000000054412413256472016567 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.4/isl/test_inputs/codegen/separate2.c0000644000175000017500000000117412554427055016452 00000000000000if ((length - 1) % 16 <= 14) for (int c0 = 0; c0 <= 1; c0 += 1) for (int c5 = 0; c5 <= 31; c5 += 1) for (int c6 = max(0, 2 * ((length - 1) % 16) + 2 * c5 - 60); c6 <= 30; c6 += 1) { if (length + c5 >= ((length - 1) % 32) + 2 && (length - 1) % 32 >= c5 && 2 * ((length - 1) % 32) + c6 >= 2 * c5 && 2 * c5 + 30 >= 2 * ((length - 1) % 32) + c6 && 2 * ((length - 1) % 32) + c6 == 2 * ((length - 1) % 16) + 2 * c5 && (2 * c5 - c6) % 32 == 0) S_3(c0, 0, (c6 / 2) - ((length - 1) % 16) + length - 1); if (length <= 16 && length >= c5 + 1 && c6 >= 1 && length >= c6) S_0(c0, c5, c6 - 1); } cloog-0.18.4/isl/test_inputs/codegen/isolate3.st0000644000175000017500000000031012554427055016502 00000000000000# Check use of options specific to isolated part domain: "{ A[i] : 0 <= i < 100 }" child: schedule: "[{ A[i] -> [i] }]" options: "{ isolate[[] -> [x]] : 10 <= x <= 20; [isolate[] -> unroll[x]] }" cloog-0.18.4/isl/test_inputs/codegen/separation_class4.c0000644000175000017500000000164412413270107020170 00000000000000for (int c0 = 0; c0 <= 128; c0 += 1) { if (c0 <= 127) { if (c0 == 0) { for (int c3 = 0; c3 <= 1; c3 += 1) for (int c5 = c3 + 58; c5 <= -c3 + 61; c5 += 1) S_0(c3, c5); } else for (int c2 = 1; c2 <= 2; c2 += 1) for (int c3 = max(4 * c0 - 2, 4 * c0 + 6 * c2 - 12); c3 <= min(4 * c0 + 1, 4 * c0 + 6 * c2 - 7); c3 += 1) for (int c5 = max(4 * c0 - c3 + 57, -4 * c0 + c3 + 58); c5 <= min(4 * c0 - c3 + 61, -4 * c0 + c3 + 62); c5 += 1) S_0(c3, c5); for (int c2 = 1; c2 <= 2; c2 += 1) for (int c3 = max(4 * c0, 4 * c0 + 6 * c2 - 10); c3 <= min(4 * c0 + 3, 4 * c0 + 6 * c2 - 5); c3 += 1) for (int c5 = max(-4 * c0 + c3 + 59, 4 * c0 - c3 + 62); c5 <= min(-4 * c0 + c3 + 63, 4 * c0 - c3 + 66); c5 += 1) S_0(c3, c5); } else for (int c3 = 510; c3 <= 511; c3 += 1) for (int c5 = -c3 + 569; c5 < c3 - 449; c5 += 1) S_0(c3, c5); } cloog-0.18.4/isl/test_inputs/codegen/atomic.in0000644000175000017500000000012612413256472016215 00000000000000{ a[i] -> [i] : 0 <= i < 10; b[i] -> [i+1] : 0 <= i < 10 } { : } { [i] -> atomic[x] } cloog-0.18.4/isl/test_inputs/codegen/single_valued.in0000644000175000017500000000033712413256472017566 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.4/isl/test_inputs/codegen/unroll10.c0000644000175000017500000000111612413271702016222 00000000000000if (m >= 1 && n >= 1) { A(0); if (m >= 2 && n >= 2) { A(1); if (m >= 3 && n >= 3) { A(2); if (m >= 4 && n >= 4) { A(3); if (m >= 5 && n >= 5) { A(4); if (m >= 6 && n >= 6) { A(5); if (m >= 7 && n >= 7) { A(6); if (m >= 8 && n >= 8) { A(7); if (m >= 9 && n >= 9) { A(8); if (m >= 10 && n >= 10) A(9); } } } } } } } } } cloog-0.18.4/isl/test_inputs/codegen/isolate5.c0000644000175000017500000000102312554427055016302 00000000000000{ for (int c0 = 0; c0 <= 9; c0 += 1) for (int c1 = 0; c1 <= 1; c1 += 1) { if (c0 % 2 == 0) { A(c0 / 2, c1); } else B((c0 - 1) / 2, c1); } for (int c0 = 10; c0 <= 89; c0 += 1) for (int c1 = 0; c1 <= 1; c1 += 1) { if (c0 % 2 == 0) { A(c0 / 2, c1); } else B((c0 - 1) / 2, c1); } for (int c0 = 90; c0 <= 199; c0 += 1) for (int c1 = 0; c1 <= 1; c1 += 1) { if (c0 % 2 == 0) { A(c0 / 2, c1); } else B((c0 - 1) / 2, c1); } } cloog-0.18.4/isl/test_inputs/codegen/isolate5.st0000644000175000017500000000046112554427055016513 00000000000000# Check that use of isolate option prevents shifted stride detection domain: "{ A[i,j] : 0 <= i < 100 and 0 <= j < 2; B[i,j] : 0 <= i < 100 and 0 <= j < 2 }" child: schedule: "[{ A[i,j] -> [2i]; B[i,j] -> [2i+1] }, { A[i,j] -> [j]; B[i,j] -> [j]}]" options: "{ isolate[[] -> [x, y]] : 10 <= x < 90 }" cloog-0.18.4/isl/test_inputs/codegen/shift_unroll.c0000644000175000017500000000032312413256472017264 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.4/isl/test_inputs/codegen/single_valued.c0000644000175000017500000000011312413270107017361 00000000000000if (2 * ((t1 - 1) % 64) + 8 >= t1) S(-(2 * ((t1 - 1) % 64)) + t1 + 126); cloog-0.18.4/isl/test_inputs/codegen/unroll.in0000644000175000017500000000033412413256472016255 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.4/isl/test_inputs/codegen/shift2.c0000644000175000017500000000401112554427055015754 00000000000000for (int c0 = 0; c0 <= 1; c0 += 1) { for (int c2 = 0; c2 <= length; c2 += 32) { if (length >= c2 + 1) { for (int c3 = 0; c3 <= length; c3 += 32) { for (int c5 = 0; c5 <= min(31, length - c2 - 1); c5 += 1) { for (int c6 = max(0, -c3 + 1); c6 <= min(min(31, length - c3), 2 * c2 - c3 + 2 * c5 - 1); c6 += 1) S_0(c0, c2 + c5, c3 + c6 - 1); if (c2 + c5 >= 1 && 2 * c2 + 2 * c5 >= c3 && c3 + 30 >= 2 * c2 + 2 * c5) { S_3(c0, 0, c2 + c5); if (length >= 2 * c2 + 2 * c5) S_0(c0, c2 + c5, 2 * c2 + 2 * c5 - 1); } for (int c6 = max(0, 2 * c2 - c3 + 2 * c5 + 1); c6 <= min(31, length - c3); c6 += 1) S_0(c0, c2 + c5, c3 + c6 - 1); } if (length <= 15 && c2 == 0 && c3 == 0) S_4(c0); if (c3 >= 2 * c2 && 2 * c2 + 32 >= c3) for (int c4 = 1; c4 <= min(min(31, length - 2), (c3 / 2) + 14); c4 += 1) for (int c5 = max((c3 / 2) - c2, -c2 + c4 + 1); c5 <= min(length - c2 - 1, (c3 / 2) - c2 + 15); c5 += 1) S_3(c0, c4, c2 + c5); } for (int c3 = max(2 * c2, -(length % 32) + length + 32); c3 <= min(2 * length - 2, 2 * c2 + 62); c3 += 32) for (int c4 = 0; c4 <= min(31, length - 2); c4 += 1) { for (int c5 = max((c3 / 2) - c2, -c2 + c4 + 1); c5 <= min(length - c2 - 1, (c3 / 2) - c2 + 15); c5 += 1) S_3(c0, c4, c2 + c5); if (c3 + 30 >= 2 * length && c4 == 0) S_4(c0); } if (c2 + 16 == length && (length - 16) % 32 == 0) S_4(c0); } else if (length == 0) { S_4(c0); } else S_4(c0); } for (int c1 = 32; c1 < length - 1; c1 += 32) for (int c2 = c1; c2 < length; c2 += 32) for (int c3 = c2; c3 <= min(length - 1, c2 + 31); c3 += 16) for (int c4 = 0; c4 <= min(min(31, length - c1 - 2), -c1 + c3 + 14); c4 += 1) for (int c5 = max(-c2 + c3, c1 - c2 + c4 + 1); c5 <= min(length - c2 - 1, -c2 + c3 + 15); c5 += 1) S_3(c0, c1 + c4, c2 + c5); } cloog-0.18.4/isl/test_inputs/codegen/unroll11.in0000644000175000017500000000046412554427055016426 00000000000000# Check that the most appropriate lower bound is selected [t1,t2]->{ S[i,j] -> [i,j] : exists (alpha, beta : 0 <= i <= 1 && t1 = j+128alpha && 0 <= j+2beta < 128 && 510 <= t2+2beta <= 514 && 0 <= 2beta - t2 <= 5 )} [t1,t2] -> {: 125 <= t1 <= 127 and 254 <= t2 < 257} {[i,j] -> unroll[x]} cloog-0.18.4/isl/test_inputs/codegen/unroll10.st0000644000175000017500000000036612554427055016446 00000000000000# Check that all information is taken into account while trying to unroll domain: "[m,n] -> { A[i] : 0 <= i < n,m }" child: context: "[m,n] -> { [] : m <= 10 or n <= 10 }" child: schedule: "[{ A[i] -> [i] }]" options: "{ unroll[x] }" cloog-0.18.4/isl/test_inputs/codegen/shift.c0000644000175000017500000000007112413256472015671 00000000000000for (int c0 = 0; c0 <= 9; c0 += 1) { A(c0); B(c0); } cloog-0.18.4/isl/test_inputs/codegen/component6.c0000644000175000017500000000007312554427055016651 00000000000000{ A(); for (int c0 = 0; c0 <= 9; c0 += 1) B(c0); } cloog-0.18.4/isl/test_inputs/codegen/atomic4.c0000644000175000017500000000005612413256472016117 00000000000000for (int c0 = 0; c0 <= 64; c0 += 1) sync(); cloog-0.18.4/isl/test_inputs/codegen/stride7.c0000644000175000017500000000024312413271702016127 00000000000000for (int c0 = 2; c0 <= 200; c0 += 64) { for (int c2 = c0 - 1; c2 <= 120; c2 += 1) s2(c0, c2); for (int c2 = 122; c2 <= c0 + 62; c2 += 1) s4(c0, c2); } cloog-0.18.4/isl/test_inputs/codegen/gemm.c0000644000175000017500000000023512554427055015506 00000000000000for (int c0 = 0; c0 < ni; c0 += 1) for (int c1 = 0; c1 < nj; c1 += 1) { S_2(c0, c1); for (int c2 = 0; c2 < nk; c2 += 1) S_4(c0, c1, c2); } cloog-0.18.4/isl/test_inputs/codegen/lu.in0000644000175000017500000000127412413271702015357 00000000000000# Check that the stride of the second loop is properly detected [n] -> { S_2[k, j] -> [o0, o0, o2, k, k, j, 1] : exists (e0 = floor((o2)/32), e1 = floor((o0)/32): 32e0 = o2 and 32e1 = o0 and o0 <= k and o0 >= -31 + k and k >= 0 and j <= -1 + n and o2 <= j and o2 >= -31 + j and j >= 1 + k); S_6[k, i, j] -> [o0, o1, o2, k, i, j, 0] : exists (e0 = floor((o0)/32), e1 = floor((o1)/32), e2 = floor((o2)/32): 32e0 = o0 and 32e1 = o1 and 32e2 = o2 and o0 <= k and o0 >= -31 + k and o1 <= i and o1 >= -31 + i and o2 <= j and o2 >= -31 + j and k >= 0 and i >= 1 + k and j <= -1 + n and j >= 1 + k and i <= -1 + n) } { : } { [a,b,c,d,e,f,g] -> atomic[x] : x < 3; [a,b,c,d,e,f,g] -> separate[x] : x >= 3 } cloog-0.18.4/isl/test_inputs/codegen/shift_unroll.in0000644000175000017500000000015312413256472017451 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.4/isl/test_inputs/codegen/omega/0000755000175000017500000000000012554427055015565 500000000000000cloog-0.18.4/isl/test_inputs/codegen/omega/gist-1.in0000644000175000017500000000042012413256472017132 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.4/isl/test_inputs/codegen/omega/m9-1.in0000644000175000017500000000034012413256472016512 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.4/isl/test_inputs/codegen/omega/m7-0.in0000644000175000017500000000040112413256472016505 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.4/isl/test_inputs/codegen/omega/m12-1.in0000644000175000017500000000170412413256472016571 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.4/isl/test_inputs/codegen/omega/fc2-0.in0000644000175000017500000000044312413256472016642 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.4/isl/test_inputs/codegen/omega/wak3-0.c0000644000175000017500000000022712413256472016651 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.4/isl/test_inputs/codegen/omega/stride2-0.in0000644000175000017500000000035612413256472017547 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.4/isl/test_inputs/codegen/omega/wak2-0.in0000644000175000017500000000037012413256472017033 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.4/isl/test_inputs/codegen/omega/iter9-0.in0000644000175000017500000000215312413256472017224 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.4/isl/test_inputs/codegen/omega/m3-0.in0000644000175000017500000000027212413256472016507 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.4/isl/test_inputs/codegen/omega/wak3-1.in0000644000175000017500000000035412413256472017037 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.4/isl/test_inputs/codegen/omega/substitution-3.c0000644000175000017500000000001412413256472020555 00000000000000s0(n + 19); cloog-0.18.4/isl/test_inputs/codegen/omega/wak1-0.c0000644000175000017500000000133212413271702016636 00000000000000{ for (int c0 = a2; c0 <= min(min(a1 - 1, a3 - 1), b2); c0 += 1) s1(c0); for (int c0 = a1; c0 <= min(b1, a3 - 1); c0 += 1) { s0(c0); if (c0 >= a2 && b2 >= c0) s1(c0); } for (int c0 = max(max(a1, b1 + 1), a2); c0 <= min(a3 - 1, b2); c0 += 1) s1(c0); for (int c0 = a3; c0 <= b3; c0 += 1) { if (c0 >= a1 && b1 >= c0) s0(c0); if (c0 >= a2 && b2 >= c0) s1(c0); s2(c0); } for (int c0 = max(max(a3, b3 + 1), a2); c0 <= min(a1 - 1, b2); c0 += 1) s1(c0); for (int c0 = max(max(a1, a3), b3 + 1); c0 <= b1; c0 += 1) { s0(c0); if (c0 >= a2 && b2 >= c0) s1(c0); } for (int c0 = max(max(max(max(a1, b1 + 1), a3), b3 + 1), a2); c0 <= b2; c0 += 1) s1(c0); } cloog-0.18.4/isl/test_inputs/codegen/omega/iter4-0.in0000644000175000017500000000026512413256472017221 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.4/isl/test_inputs/codegen/omega/dagstuhl1-1.in0000644000175000017500000000020312413256472020057 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.4/isl/test_inputs/codegen/omega/ge-1.c0000644000175000017500000000027412413256472016402 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.4/isl/test_inputs/codegen/omega/stride7-0.c0000644000175000017500000000052112413270107017351 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.4/isl/test_inputs/codegen/omega/wak2-0.c0000644000175000017500000000154412413270107016642 00000000000000{ for (int c0 = a1; c0 <= min(b1, a2 - 1); 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(b1, b2); 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(d1, c2 - 1); 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(c1, d2 + 1); 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.4/isl/test_inputs/codegen/omega/gist-0.in0000644000175000017500000000043412413256472017136 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.4/isl/test_inputs/codegen/omega/gc-0.c0000644000175000017500000000005512413256472016374 00000000000000for (int c0 = 2; c0 <= 8; c0 += 2) s0(c0); cloog-0.18.4/isl/test_inputs/codegen/omega/m1-1.c0000644000175000017500000000043412413270107016311 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.4/isl/test_inputs/codegen/omega/ts1d-mp-i_ts-m_b-0.c0000644000175000017500000000535312413271702020756 00000000000000{ for (int c1 = -1; c1 < T; c1 += 1) for (int c2 = 0; c2 < N; c2 += 1) { if (c1 == -1) { s0(1, -1, c2, 0, 0); } else if (c2 == 0) { s0(1, c1, 0, 0, 0); } else if (c2 + 1 == N) s0(1, c1, N - 1, 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(500 * c1 + 1, 1000 * c1 + 4000 * c3 - 3999); c4 <= min(min(N + T - 3, 1000 * c1 + 4000 * c3 - 3000), 2 * N - 4000 * c3 + 3995); c4 += 1) for (int c5 = max(0, -N - 500 * c1 + c4 + 2); c5 <= min(min(T - 500 * c1 - 1, -500 * c1 + c4 - 1), -500 * c1 - 2000 * c3 + (c4 + 1) / 2 + 1999); 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 * T + 4000 * c3 - 4000, 1000 * c1 + 4000 * c3 - 3000), 2 * N - 4000 * c3 + 3995); 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(500 * c1 + 1, 1000 * c1 + 4000 * c3 - 2999); 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(499, T - 500 * c1 - 1), -500 * c1 + c4 - 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(-4000 * c3, 1000 * c1 + 4000 * c3 + 1); 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(1000 * c1 + 4000 * c3 + 1, -4000 * c3 + 2); 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(-N - 500 * c1 + c4 + 2, -500 * c1 - 2000 * c3 + (c4 + 1) / 2); c5 <= min(min(499, T - 500 * c1 - 1), -500 * c1 + c4 - 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.4/isl/test_inputs/codegen/omega/lefur01-1.in0000644000175000017500000000053212413256472017446 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.4/isl/test_inputs/codegen/omega/m4-0.in0000644000175000017500000000033612413256472016511 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.4/isl/test_inputs/codegen/omega/substitution-2.c0000644000175000017500000000006712413256472020564 00000000000000for (int c0 = -3; c0 <= 96; c0 += 1) s0(c0, c0 + 4); cloog-0.18.4/isl/test_inputs/codegen/omega/lefur01-1.c0000644000175000017500000000101112554427055017256 00000000000000for (int c0 = 0; c0 <= 15; c0 += 1) for (int c1 = max(2 * c0 - 15, c0 / 2); c1 <= min(15, c0 + 1); c1 += 1) for (int c2 = max(max(max(1, 67 * c0 - (c0 + 1) / 3), 67 * c1 - (c1 + 2) / 3), 133 * c0 - 67 * c1 + (c0 + c1 + 1) / 3 - 66); c2 <= min(min(1000, 100 * c0 + 99), 133 * c0 - 67 * c1 + (c0 + c1 + 2) / 3 + 132); c2 += 1) for (int c3 = max(max(c2, 200 * c0 - c2), 100 * c1 + (c2 + 1) / 2); c3 <= min(min(2 * c2 + 1, 200 * c0 - c2 + 199), 100 * c1 + (c2 + 1) / 2 + 99); c3 += 1) s0(c0, c1, c2, c3); cloog-0.18.4/isl/test_inputs/codegen/omega/m12-0.in0000644000175000017500000000033212413256472016564 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.4/isl/test_inputs/codegen/omega/floor_bound-1.in0000644000175000017500000000022512413256472020477 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.4/isl/test_inputs/codegen/omega/guard1-0.in0000644000175000017500000000025712413256472017356 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.4/isl/test_inputs/codegen/omega/floor_bound-6.c0000644000175000017500000000014412413256472020320 00000000000000if (m >= 8 * floord(m + 1, 8)) for (int c0 = 4 * floord(m + 1, 32); c0 <= n; c0 += 1) s0(c0); cloog-0.18.4/isl/test_inputs/codegen/omega/lift2-4.c0000644000175000017500000000141212413270107017014 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.4/isl/test_inputs/codegen/omega/code_gen-1.in0000644000175000017500000000037212413256472017735 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.4/isl/test_inputs/codegen/omega/floor_bound-3.c0000644000175000017500000000011712413256472020315 00000000000000for (int c0 = 3 * floord(m, 3) + 4 * floord(m, 4); c0 <= n; c0 += 1) s0(c0); cloog-0.18.4/isl/test_inputs/codegen/omega/gist-5.c0000644000175000017500000000013212413256472016752 00000000000000for (int c0 = 1; c0 <= n; c0 += 12) for (int c1 = c0; c1 <= n; c1 += 8) s0(c0, c1); cloog-0.18.4/isl/test_inputs/codegen/omega/iter7-0.c0000644000175000017500000000010112413256472017025 00000000000000for (int c0 = 1; c0 <= 3; c0 += 2) s0(c0, (-3 * c0 + 15) / 2); cloog-0.18.4/isl/test_inputs/codegen/omega/floor_bound-5.in0000644000175000017500000000031312413256472020501 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.4/isl/test_inputs/codegen/omega/lu-1.c0000644000175000017500000000064012413270107016413 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(c1, c3 + 1); c4 <= min(n, c1 + 63); c4 += 1) s1(c3, c4, c2); if (c0 + 63 >= c2) for (int c4 = max(c1, c2 + 1); c4 <= min(n, c1 + 63); c4 += 1) s0(c2, c4); } cloog-0.18.4/isl/test_inputs/codegen/omega/wak4-0.c0000644000175000017500000000020512413270107016635 00000000000000for (int c0 = max(max(max(max(a1, a2), a3), a4), a5); c0 <= min(min(min(min(b1, b2), b3), b4), b5); c0 += 1) { s0(c0); s1(c0); } cloog-0.18.4/isl/test_inputs/codegen/omega/m4-1.c0000644000175000017500000000015612413256472016326 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.4/isl/test_inputs/codegen/omega/lift1-3.in0000644000175000017500000000103312413256472017206 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.4/isl/test_inputs/codegen/omega/m7-1.in0000644000175000017500000000040112413256472016506 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.4/isl/test_inputs/codegen/omega/stride5-0.in0000644000175000017500000000041512413256472017546 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.4/isl/test_inputs/codegen/omega/p6-1.c0000644000175000017500000000016712413270107016324 00000000000000for (int c0 = -9; c0 <= 9; c0 += 1) for (int c1 = max(1, -c0 + 1); c1 <= min(10, -c0 + 10); c1 += 1) s0(c0, c1); cloog-0.18.4/isl/test_inputs/codegen/omega/p.delft-0.in0000644000175000017500000000055012413256472017523 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.4/isl/test_inputs/codegen/omega/iter9-0.c0000644000175000017500000000040012554427055017034 00000000000000for (int c0 = 1; c0 <= 15; c0 += 1) { if (((-exprVar1 + 15) % 8) + c0 <= 15) { s4(c0); s0(c0); s3(c0); s2(c0); s1(c0); } if (((-exprVar1 + 15) % 8) + c0 <= 15 || (c0 >= exprVar1 + 1 && (exprVar1 - c0 + 1) % 8 == 0)) s5(c0); } cloog-0.18.4/isl/test_inputs/codegen/omega/syr2k-2.in0000644000175000017500000000036312413256472017245 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.4/isl/test_inputs/codegen/omega/ts1d-check0-0.c0000644000175000017500000000111412413270107017775 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(0, -((N + c2) % 2) - N - 1000 * c1 + c2 + 2); 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.4/isl/test_inputs/codegen/omega/lu-1.in0000644000175000017500000000106112413256472016606 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.4/isl/test_inputs/codegen/omega/m8-1.in0000644000175000017500000000044412413256472016516 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.4/isl/test_inputs/codegen/omega/lift2-0.c0000644000175000017500000000050212413271702017011 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 >= 5 && c0 <= 60) s0(c0, c1, c2, c3, c4); } cloog-0.18.4/isl/test_inputs/codegen/omega/m11-0.in0000644000175000017500000000106512413256472016567 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.4/isl/test_inputs/codegen/omega/basics-0.c0000644000175000017500000000023312413256472017245 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.4/isl/test_inputs/codegen/omega/m12-0.c0000644000175000017500000000013612413256472016402 00000000000000for (int c1 = 1; c1 <= n; c1 += 1) for (int c2 = 1; c2 <= m; c2 += 1) s0(1, c1, c2, 0); cloog-0.18.4/isl/test_inputs/codegen/omega/iter8-0.in0000644000175000017500000000075112413256472017225 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.4/isl/test_inputs/codegen/omega/lift1-4.c0000644000175000017500000000103612413270107017015 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.4/isl/test_inputs/codegen/omega/fc2-1.in0000644000175000017500000000071112413256472016641 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.4/isl/test_inputs/codegen/omega/dagstuhl1-0.c0000644000175000017500000000007412413256472017700 00000000000000for (int c0 = 0; c0 <= 99; c0 += 1) s0(c0 % 10, c0 / 10); cloog-0.18.4/isl/test_inputs/codegen/omega/lift2-2.in0000644000175000017500000000103312413256472017206 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.4/isl/test_inputs/codegen/omega/guard1-1.in0000644000175000017500000000025712413256472017357 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.4/isl/test_inputs/codegen/omega/iter7-0.in0000644000175000017500000000027012413256472017220 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.4/isl/test_inputs/codegen/omega/m12-1.c0000644000175000017500000000103312413256472016400 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.4/isl/test_inputs/codegen/omega/m1-1.in0000644000175000017500000000031012413256472016477 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.4/isl/test_inputs/codegen/omega/syr2k-3.c0000644000175000017500000000031712413270107017050 00000000000000for (int c0 = 1; c0 <= min(n, 2 * b - 1); c0 += 1) for (int c1 = -b + 1; c1 <= b - c0; c1 += 1) for (int c2 = max(1, c0 + c1); c2 <= min(n, n + c1); c2 += 1) s0(-c0 - c1 + c2 + 1, -c1 + c2, c2); cloog-0.18.4/isl/test_inputs/codegen/omega/wak3-0.in0000644000175000017500000000035312413256472017035 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.4/isl/test_inputs/codegen/omega/fc1-0.c0000644000175000017500000000034612413256472016457 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.4/isl/test_inputs/codegen/omega/stride1-0.in0000644000175000017500000000024412413256472017542 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.4/isl/test_inputs/codegen/omega/stride6-1.c0000644000175000017500000000013512413256472017363 00000000000000for (int c0 = 2; c0 <= 100; c0 += 2) for (int c1 = c0; c1 <= 400; c1 += 2) s0(c0, c1); cloog-0.18.4/isl/test_inputs/codegen/omega/dagstuhl1-1.c0000644000175000017500000000011312413270107017662 00000000000000for (int c0 = 0; c0 <= 99; c0 += 1) s0(c0, c0 % 10, (c0 + 10) / 10 - 1); cloog-0.18.4/isl/test_inputs/codegen/omega/iter3-0.c0000644000175000017500000000013512413256472017030 00000000000000for (int c0 = 2; c0 <= 8; c0 += 1) for (int c1 = c0 + 1; c1 <= 9; c1 += 1) s0(c0, c1); cloog-0.18.4/isl/test_inputs/codegen/omega/substitution-4.in0000644000175000017500000000027512413256472020753 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.4/isl/test_inputs/codegen/omega/lift1-3.c0000644000175000017500000000077112413270107017021 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.4/isl/test_inputs/codegen/omega/x-1.c0000644000175000017500000000103512413270107016241 00000000000000for (int c0 = 1; c0 <= 11; c0 += 1) { for (int c1 = max(1, c0 - 3); c1 <= min(c0, -c0 + 8); c1 += 1) s1(c1, c0 - c1 + 1); for (int c1 = max(1, -c0 + 9); c1 <= min(c0 - 4, -c0 + 12); c1 += 1) s0(c1, c0 + c1 - 8); for (int c1 = max(c0 - 3, -c0 + 9); c1 <= min(c0, -c0 + 12); 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(8, -c0 + 12); c1 += 1) s0(c1, c0 + c1 - 8); } cloog-0.18.4/isl/test_inputs/codegen/omega/m1-0.in0000644000175000017500000000031012413256472016476 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.4/isl/test_inputs/codegen/omega/fc1-2.in0000644000175000017500000000071112413256472016641 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.4/isl/test_inputs/codegen/omega/iter6-0.in0000644000175000017500000000025412413256472017221 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.4/isl/test_inputs/codegen/omega/lift2-0.in0000644000175000017500000000103312413256472017204 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.4/isl/test_inputs/codegen/omega/code_gen-1.c0000644000175000017500000000055112413271702017541 00000000000000for (int c0 = 1; c0 <= 8; c0 += 1) { if (c0 >= 2) { if (c0 <= 6) 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 = max(5, c0 - 1); c1 <= 7; c1 += 1) s0(c0, c1); } else for (int c1 = 0; c1 <= 7; c1 += 1) s0(1, c1); } cloog-0.18.4/isl/test_inputs/codegen/omega/lu-0.in0000644000175000017500000000106112413256472016605 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.4/isl/test_inputs/codegen/omega/wak2-1.in0000644000175000017500000000037012413256472017034 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.4/isl/test_inputs/codegen/omega/substitution-0.c0000644000175000017500000000021412413256472020554 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.4/isl/test_inputs/codegen/omega/iter6-1.c0000644000175000017500000000010612413256472017032 00000000000000for (int c0 = 46; c0 <= 70; c0 += 12) s0(c0, (17 * c0 - 170) / 12); cloog-0.18.4/isl/test_inputs/codegen/omega/lift2-1.c0000644000175000017500000000103212413270107017007 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.4/isl/test_inputs/codegen/omega/lu_spmd-0.c0000644000175000017500000000053012413271702017435 00000000000000if (ub >= lb) for (int c0 = 1; c0 <= ub; c0 += 1) for (int c1 = c0; c1 <= n; c1 += 1) { if (c0 >= lb && c1 >= c0 + 1) { s0(c0, c1); if (n >= ub + 1) s2(c0, c1); } else if (lb >= c0 + 1) s3(c0, c1, lb, c0, c1); for (int c3 = max(lb, c0); c3 <= ub; c3 += 1) s1(c0, c1, c3); } cloog-0.18.4/isl/test_inputs/codegen/omega/iter8-0.c0000644000175000017500000000016612413270107017030 00000000000000for (int c0 = max(exprVar2 + 1, exprVar2 + 8 * floord(-exprVar2 + exprVar1 - 1, 8) + 9); c0 <= 16; c0 += 8) s0(c0); cloog-0.18.4/isl/test_inputs/codegen/omega/lift2-5.in0000644000175000017500000000103412413256472017212 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.4/isl/test_inputs/codegen/omega/lift1-5.in0000644000175000017500000000103412413256472017211 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.4/isl/test_inputs/codegen/omega/m9-1.c0000644000175000017500000000015612413256472016333 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.4/isl/test_inputs/codegen/omega/floor_bound-5.c0000644000175000017500000000007512413256472020322 00000000000000for (int c0 = 4 * floord(m, 32); c0 <= n; c0 += 1) s0(c0); cloog-0.18.4/isl/test_inputs/codegen/omega/stride6-0.c0000644000175000017500000000016312413270107017352 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.4/isl/test_inputs/codegen/omega/lu_ijk-1.in0000644000175000017500000000041112413256472017441 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.4/isl/test_inputs/codegen/omega/lefur04-0.in0000644000175000017500000000121412413256472017446 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.4/isl/test_inputs/codegen/omega/chosol-0.c0000644000175000017500000000025512413256472017274 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.4/isl/test_inputs/codegen/omega/lefur01-0.c0000644000175000017500000000101112554427055017255 00000000000000for (int c0 = 0; c0 <= 15; c0 += 1) for (int c1 = max(2 * c0 - 15, c0 / 2); c1 <= min(15, c0 + 1); c1 += 1) for (int c2 = max(max(max(1, 67 * c0 - (c0 + 1) / 3), 67 * c1 - (c1 + 2) / 3), 133 * c0 - 67 * c1 + (c0 + c1 + 1) / 3 - 66); c2 <= min(min(1000, 100 * c0 + 99), 133 * c0 - 67 * c1 + (c0 + c1 + 2) / 3 + 132); c2 += 1) for (int c3 = max(max(c2, 200 * c0 - c2), 100 * c1 + (c2 + 1) / 2); c3 <= min(min(2 * c2 + 1, 200 * c0 - c2 + 199), 100 * c1 + (c2 + 1) / 2 + 99); c3 += 1) s0(c0, c1, c2, c3); cloog-0.18.4/isl/test_inputs/codegen/omega/if_then-2.in0000644000175000017500000000053412413256472017607 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.4/isl/test_inputs/codegen/omega/m4-0.c0000644000175000017500000000015612413256472016325 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.4/isl/test_inputs/codegen/omega/wak1-0.in0000644000175000017500000000031712413256472017033 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.4/isl/test_inputs/codegen/omega/iter2-0.c0000644000175000017500000000013412413256472017026 00000000000000for (int c0 = 1; c0 <= 10; c0 += 1) for (int c1 = 10; c1 <= 100; c1 += 1) s0(c0, c1); cloog-0.18.4/isl/test_inputs/codegen/omega/wak2-1.c0000644000175000017500000000223712413270107016643 00000000000000{ for (int c0 = a1; c0 <= min(b1, a2 - 1); 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(b1, b2); 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(d1, c2 - 1); c1_0 += 1) s0(c0, c1_0); for (int c1_0 = c2; c1_0 <= min(c1 - 1, d2); c1_0 += 1) s1(c0, c1_0); for (int c1_0 = max(c1, c2); c1_0 <= min(d1, d2); c1_0 += 1) { s0(c0, c1_0); s1(c0, c1_0); } for (int c1_0 = max(c1, d2 + 1); c1_0 <= d1; c1_0 += 1) s0(c0, c1_0); for (int c1_0 = max(max(c1, d1 + 1), 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.4/isl/test_inputs/codegen/omega/olda-0.in0000644000175000017500000000050412413256472017105 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.4/isl/test_inputs/codegen/omega/floor_bound-0.in0000644000175000017500000000027212413256472020500 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.4/isl/test_inputs/codegen/omega/chosol-0.in0000644000175000017500000000041312413256472017454 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.4/isl/test_inputs/codegen/omega/m10-1.c0000644000175000017500000000053312413271702016373 00000000000000for (int c0 = 1; c0 <= 18; c0 += 1) { if (c0 >= 2 && c0 <= 9) { 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.4/isl/test_inputs/codegen/omega/gist-4.c0000644000175000017500000000013112413256472016750 00000000000000for (int c0 = 1; c0 <= n; c0 += 6) for (int c1 = c0; c1 <= n; c1 += 4) s0(c0, c1); cloog-0.18.4/isl/test_inputs/codegen/omega/ts1d-check-sblock-0.c0000644000175000017500000000101112413270107021164 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(0, -N - 1000 * c1 + c2 + 2); 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.4/isl/test_inputs/codegen/omega/x-1.in0000644000175000017500000000035712413256472016444 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.4/isl/test_inputs/codegen/omega/lefur03-0.c0000644000175000017500000000163212413271702017256 00000000000000for (int c0 = 0; c0 <= 3; c0 += 1) for (int c1 = max(2 * c0 - 3, c0 / 2); c1 <= min(3, c0 + 1); 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(0, c1 - (-c1 + 3) / 3), c0 - (-c2 + 3) / 3), c2 + floord(3 * c1 - c2 - 1, 6)); c3 <= min(3, c0 + 1); c3 += 1) for (int c4 = max(max(max(max(-200 * c1 + 400 * c3 - 199, 250 * c3 + 1), 667 * c0 - 333 * c1 - (c0 + c1 + 3) / 3 - 332), 333 * c1 + c1 / 3), 333 * c2 + (c2 + 1) / 3); c4 <= min(min(min(min(1000, 500 * c0 + 499), -200 * c1 + 400 * c3 + 400), 333 * c2 - (-c2 + 3) / 3 + 333), 333 * c3 - (-c3 + 3) / 3 + 334); c4 += 1) for (int c5 = max(max(max(c4, 1000 * c0 - c4), 1000 * c3 - 2 * c4 + 2), 500 * c1 + (c4 + 1) / 2); c5 <= min(min(min(2 * c4 + 1, 1000 * c0 - c4 + 999), 1000 * c3 - 2 * c4 + 1001), 500 * c1 + (c4 + 1) / 2 + 499); c5 += 1) s0(c0, c1, c2, c3, c4, c5); cloog-0.18.4/isl/test_inputs/codegen/omega/floor_bound-6.in0000644000175000017500000000040012413256472020477 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.4/isl/test_inputs/codegen/omega/wak1-1.c0000644000175000017500000000336412413270107016644 00000000000000{ for (int c0 = a2; c0 <= min(min(a1 - 1, a3 - 1), b2); c0 += 1) s1(c0); for (int c0 = a3; c0 <= min(min(a1 - 1, b3), a2 - 1); c0 += 1) s2(c0); for (int c0 = max(a3, a2); c0 <= min(min(a1 - 1, b3), b2); c0 += 1) { s1(c0); s2(c0); } for (int c0 = a1; c0 <= min(min(b1, a3 - 1), a2 - 1); c0 += 1) s0(c0); for (int c0 = max(a1, a2); c0 <= min(min(b1, a3 - 1), b2); c0 += 1) { s0(c0); s1(c0); } for (int c0 = max(max(a1, b1 + 1), a2); c0 <= min(a3 - 1, b2); c0 += 1) s1(c0); for (int c0 = max(a1, a3); c0 <= min(min(b1, b3), a2 - 1); c0 += 1) { s0(c0); s2(c0); } for (int c0 = max(max(a1, b1 + 1), a3); c0 <= min(b3, a2 - 1); c0 += 1) s2(c0); for (int c0 = max(max(a1, a3), a2); c0 <= min(min(b1, b3), b2); c0 += 1) { s0(c0); s1(c0); s2(c0); } for (int c0 = max(max(max(a1, b1 + 1), a3), a2); c0 <= min(b3, b2); c0 += 1) { s1(c0); s2(c0); } for (int c0 = max(max(a3, a2), b2 + 1); c0 <= min(a1 - 1, b3); c0 += 1) s2(c0); for (int c0 = max(max(a1, a2), b2 + 1); c0 <= min(b1, a3 - 1); c0 += 1) s0(c0); for (int c0 = max(max(max(a1, a3), a2), b2 + 1); c0 <= min(b1, b3); 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(a1 - 1, b2); c0 += 1) s1(c0); for (int c0 = max(max(a1, a3), b3 + 1); c0 <= min(b1, a2 - 1); c0 += 1) s0(c0); for (int c0 = max(max(max(a1, a3), b3 + 1), a2); c0 <= min(b1, b2); 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.4/isl/test_inputs/codegen/omega/stride5-0.c0000644000175000017500000000017012413270107017347 00000000000000for (int c0 = 2; c0 <= min(100, -2 * n + 400); c0 += 2) for (int c1 = 2 * n + c0; c1 <= 400; c1 += 2) s0(c0, c1); cloog-0.18.4/isl/test_inputs/codegen/omega/if_then-0.c0000644000175000017500000000051012413256472017413 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.4/isl/test_inputs/codegen/omega/lu-2.in0000644000175000017500000000106112413256472016607 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.4/isl/test_inputs/codegen/omega/basics-1.c0000644000175000017500000000016712413270107017243 00000000000000for (int c0 = -9; c0 <= 9; c0 += 1) for (int c1 = max(1, -c0 + 1); c1 <= min(10, -c0 + 10); c1 += 1) s0(c0, c1); cloog-0.18.4/isl/test_inputs/codegen/omega/lift2-3.c0000644000175000017500000000127612413270107017023 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.4/isl/test_inputs/codegen/omega/olda-1.in0000644000175000017500000000050412413256472017106 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.4/isl/test_inputs/codegen/omega/fc2-1.c0000644000175000017500000000072512413256472016462 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.4/isl/test_inputs/codegen/omega/gist-2.c0000644000175000017500000000013312413256472016750 00000000000000for (int c0 = 1; c0 <= n; c0 += 256) for (int c1 = c0; c1 <= n; c1 += 8) s0(c0, c1); cloog-0.18.4/isl/test_inputs/codegen/omega/syr2k-2.c0000644000175000017500000000035112413270107017045 00000000000000for (int c0 = 1; c0 <= min(n, 2 * b - 1); c0 += 1) for (int c1 = max(-n + 1, -b + 1); c1 <= min(b - c0, n - c0); c1 += 1) for (int c2 = max(1, c0 + c1); c2 <= min(n, n + c1); c2 += 1) s0(-c0 - c1 + c2 + 1, -c1 + c2, c2); cloog-0.18.4/isl/test_inputs/codegen/omega/lift1-0.c0000644000175000017500000000046712413256472017031 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.4/isl/test_inputs/codegen/omega/lu_ijk-0.c0000644000175000017500000000027412413256472017263 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.4/isl/test_inputs/codegen/omega/wak3-1.c0000644000175000017500000000073712413270107016647 00000000000000{ for (int c0 = a; c0 <= min(a + 9, b); c0 += 1) s0(c0); for (int c0 = a + 10; c0 <= min(a + 19, b); c0 += 1) { s0(c0); s1(c0); } for (int c0 = max(a + 10, b + 1); c0 <= min(a + 19, b + 10); 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.4/isl/test_inputs/codegen/omega/collard-0.c0000644000175000017500000000061212413256472017422 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.4/isl/test_inputs/codegen/omega/syr2k-3.in0000644000175000017500000000041612413256472017245 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.4/isl/test_inputs/codegen/omega/gc-0.in0000644000175000017500000000024412413256472016560 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.4/isl/test_inputs/codegen/omega/m10-0.c0000644000175000017500000000023512413256472016400 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.4/isl/test_inputs/codegen/omega/lu_ijk-0.in0000644000175000017500000000041112413256472017440 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.4/isl/test_inputs/codegen/omega/p.delft2-0.in0000644000175000017500000000250612413256472017610 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.4/isl/test_inputs/codegen/omega/wak4-1.c0000644000175000017500000000020512413270107016636 00000000000000for (int c0 = max(max(max(max(a1, a2), a3), a4), a5); c0 <= min(min(min(min(b1, b2), b3), b4), b5); c0 += 1) { s0(c0); s1(c0); } cloog-0.18.4/isl/test_inputs/codegen/omega/m8-0.c0000644000175000017500000000020512413256472016324 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.4/isl/test_inputs/codegen/omega/lu_spmd-0.in0000644000175000017500000000121012413256472017624 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.4/isl/test_inputs/codegen/omega/m7-1.c0000644000175000017500000000032112413270107016312 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.4/isl/test_inputs/codegen/omega/m7-0.c0000644000175000017500000000020512413256472016323 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.4/isl/test_inputs/codegen/omega/gist-5.in0000644000175000017500000000043612413256472017145 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.4/isl/test_inputs/codegen/omega/m10-0.in0000644000175000017500000000034012413256472016561 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.4/isl/test_inputs/codegen/omega/m2-1.c0000644000175000017500000000035712413256472016327 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.4/isl/test_inputs/codegen/omega/floor_bound-0.c0000644000175000017500000000012012413256472020304 00000000000000for (int c0 = 4 * floord(m - 1, 12) + 4; c0 <= floord(n, 3); c0 += 4) s0(c0); cloog-0.18.4/isl/test_inputs/codegen/omega/lift1-1.c0000644000175000017500000000065112413270107017014 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.4/isl/test_inputs/codegen/omega/lift1-2.c0000644000175000017500000000072212413270107017014 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.4/isl/test_inputs/codegen/omega/m8-0.in0000644000175000017500000000044412413256472016515 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.4/isl/test_inputs/codegen/omega/lift2-1.in0000644000175000017500000000103312413256472017205 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.4/isl/test_inputs/codegen/omega/hpf-0.c0000644000175000017500000000025112413271702016547 00000000000000if (P2 >= 0 && P2 <= 3 && P1 == P2) for (int c0 = 0; c0 <= min(2, -P2 + 4); c0 += 1) for (int c2 = (-P2 - c0 + 6) % 3; c2 <= 3; c2 += 3) s0(c0, c0, c2, c2); cloog-0.18.4/isl/test_inputs/codegen/omega/if_then-5.in0000644000175000017500000000054512413256472017614 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.4/isl/test_inputs/codegen/omega/iter2-0.in0000644000175000017500000000025612413256472017217 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.4/isl/test_inputs/codegen/omega/if_then-5.c0000644000175000017500000000027312413271702017417 00000000000000for (int c0 = 4; c0 <= 100; c0 += 4) { for (int c1 = 1; c1 <= 100; c1 += 1) s0(c0, c1); if (c0 >= 8 && c0 <= 96) for (int c1 = 10; c1 <= 100; c1 += 1) s1(c0 + 2, c1); } cloog-0.18.4/isl/test_inputs/codegen/omega/lefur03-0.in0000644000175000017500000000100212413256472017440 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.4/isl/test_inputs/codegen/omega/code_gen-0.in0000644000175000017500000000037212413256472017734 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.4/isl/test_inputs/codegen/omega/lu_ijk-2.c0000644000175000017500000000044712413256472017267 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.4/isl/test_inputs/codegen/omega/lift2-3.in0000644000175000017500000000103312413256472017207 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.4/isl/test_inputs/codegen/omega/m3-0.c0000644000175000017500000000016712413270107016315 00000000000000for (int c0 = -9; c0 <= 9; c0 += 1) for (int c1 = max(1, -c0 + 1); c1 <= min(10, -c0 + 10); c1 += 1) s0(c0, c1); cloog-0.18.4/isl/test_inputs/codegen/omega/lefur00-0.in0000644000175000017500000000053212413256472017444 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.4/isl/test_inputs/codegen/omega/p6-1.in0000644000175000017500000000027212413256472016516 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.4/isl/test_inputs/codegen/omega/iter1-0.c0000644000175000017500000000005512413256472017027 00000000000000for (int c0 = 2; c0 <= 9; c0 += 1) s0(c0); cloog-0.18.4/isl/test_inputs/codegen/omega/lu-3.c0000644000175000017500000000112512413270107016414 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(c1, c3 + 1); c4 <= min(n, c1 + 63); c4 += 1) s1(c3, c4, c2); for (int c4 = max(c1, c2 + 1); 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(c1, c3 + 1); c4 <= min(n, c1 + 63); c4 += 1) s1(c3, c4, c2); } cloog-0.18.4/isl/test_inputs/codegen/omega/substitution-4.c0000644000175000017500000000001312413256472020555 00000000000000s0(n + 1); cloog-0.18.4/isl/test_inputs/codegen/omega/fc1-0.in0000644000175000017500000000044312413256472016641 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.4/isl/test_inputs/codegen/omega/fc1-1.in0000644000175000017500000000071112413256472016640 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.4/isl/test_inputs/codegen/omega/m8-1.c0000644000175000017500000000032112413270107016313 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.4/isl/test_inputs/codegen/omega/lift2-5.c0000644000175000017500000000144512413256472017034 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.4/isl/test_inputs/codegen/omega/floor_bound-3.in0000644000175000017500000000037212413256472020504 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.4/isl/test_inputs/codegen/omega/gist-3.in0000644000175000017500000000043412413256472017141 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.4/isl/test_inputs/codegen/omega/m2-0.c0000644000175000017500000000033412413270107016310 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.4/isl/test_inputs/codegen/omega/m1-0.c0000644000175000017500000000020012413256472016310 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.4/isl/test_inputs/codegen/omega/collard-0.in0000644000175000017500000000070012413256472017604 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.4/isl/test_inputs/codegen/omega/if_then-1.in0000644000175000017500000000053412413256472017606 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.4/isl/test_inputs/codegen/omega/stride1-0.c0000644000175000017500000000005512413256472017356 00000000000000for (int c0 = 3; c0 <= 9; c0 += 3) s0(c0); cloog-0.18.4/isl/test_inputs/codegen/omega/ts1d-orig0-0.c0000644000175000017500000000036012413256472017673 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.4/isl/test_inputs/codegen/omega/olda-1.c0000644000175000017500000000037212413256472016725 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.4/isl/test_inputs/codegen/omega/lu_ijk-2.in0000644000175000017500000000041112413256472017442 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.4/isl/test_inputs/codegen/omega/stride3-0.in0000644000175000017500000000037012413256472017544 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.4/isl/test_inputs/codegen/omega/substitution-3.in0000644000175000017500000000016312413256472020746 00000000000000[n] -> { s0[19 + n] -> [19 + n] } { : } [n] -> { [i0] -> separate[o0] : o0 >= 0; [i0] -> atomic[o0] : o0 <= -1 } cloog-0.18.4/isl/test_inputs/codegen/omega/stride6-2.in0000644000175000017500000000037212413256472017553 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.4/isl/test_inputs/codegen/omega/lift1-5.c0000644000175000017500000000105412413256472017027 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.4/isl/test_inputs/codegen/omega/iter6-1.in0000644000175000017500000000030212413256472017214 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.4/isl/test_inputs/codegen/omega/x-0.c0000644000175000017500000000103512413270107016240 00000000000000for (int c0 = 1; c0 <= 11; c0 += 1) { for (int c1 = max(1, c0 - 3); c1 <= min(c0, -c0 + 8); c1 += 1) s1(c1, c0 - c1 + 1); for (int c1 = max(1, -c0 + 9); c1 <= min(c0 - 4, -c0 + 12); c1 += 1) s0(c1, c0 + c1 - 8); for (int c1 = max(c0 - 3, -c0 + 9); c1 <= min(c0, -c0 + 12); 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(8, -c0 + 12); c1 += 1) s0(c1, c0 + c1 - 8); } cloog-0.18.4/isl/test_inputs/codegen/omega/m10-1.in0000644000175000017500000000034012413256472016562 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.4/isl/test_inputs/codegen/omega/m2-1.in0000644000175000017500000000040112413256472016501 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.4/isl/test_inputs/codegen/omega/floor_bound-2.c0000644000175000017500000000007412413256472020316 00000000000000for (int c0 = 4 * floord(m, 4); c0 <= n; c0 += 1) s0(c0); cloog-0.18.4/isl/test_inputs/codegen/omega/if_then-0.in0000644000175000017500000000064612413256472017611 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.4/isl/test_inputs/codegen/omega/stride6-0.in0000644000175000017500000000033212413256472017545 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.4/isl/test_inputs/codegen/omega/m11-0.c0000644000175000017500000000076512413270107016400 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(2, -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(30, m - 5 * c1 - 10 * c2 + 5), 8 * c0 + c0 / 2); c3 += 1) for (int c4 = 5 * c1 + 10 * c2 - 4; c4 <= min(5 * c1 + 10 * c2, m - c3 + 1); c4 += 1) s0(c0, c1, c2, c3, c4, -9 * c0 + c3 + c0 / 2 + 9, -5 * c1 - 5 * c2 + c4 + 5); cloog-0.18.4/isl/test_inputs/codegen/omega/gist-0.c0000644000175000017500000000013112413256472016744 00000000000000for (int c0 = 1; c0 <= n; c0 += 4) for (int c1 = c0; c1 <= n; c1 += 3) s0(c0, c1); cloog-0.18.4/isl/test_inputs/codegen/omega/iter4-0.c0000644000175000017500000000014212413256472017027 00000000000000for (int c0 = 2; c0 <= 9; c0 += 1) for (int c1 = c0 + 1; c1 <= 2 * c0; c1 += 1) s0(c0, c1); cloog-0.18.4/isl/test_inputs/codegen/omega/code_gen-2.c0000644000175000017500000000062412413256472017552 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.4/isl/test_inputs/codegen/omega/syr2k-0.in0000644000175000017500000000036312413256472017243 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.4/isl/test_inputs/codegen/omega/ge-0.c0000644000175000017500000000027412413256472016401 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.4/isl/test_inputs/codegen/omega/guard1-1.c0000644000175000017500000000004612554427055017172 00000000000000if ((n - m + 1) % 2 == 0) s0(n, m); cloog-0.18.4/isl/test_inputs/codegen/omega/ts1d-mp-i_ts-m_b-0.in0000644000175000017500000000312012413256472021137 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.4/isl/test_inputs/codegen/omega/stride2-0.c0000644000175000017500000000015012413270107017342 00000000000000for (int c0 = 0; c0 <= n; c0 += 32) for (int c1 = c0; c1 <= min(n, c0 + 31); c1 += 1) s0(c0, c1); cloog-0.18.4/isl/test_inputs/codegen/omega/lu_spmd-1.c0000644000175000017500000000053012413271702017436 00000000000000if (ub >= lb) for (int c0 = 1; c0 <= ub; c0 += 1) for (int c1 = c0; c1 <= n; c1 += 1) { if (c0 >= lb && c1 >= c0 + 1) { s0(c0, c1); if (n >= ub + 1) s2(c0, c1); } else if (lb >= c0 + 1) s3(c0, c1, lb, c0, c1); for (int c3 = max(lb, c0); c3 <= ub; c3 += 1) s1(c0, c1, c3); } cloog-0.18.4/isl/test_inputs/codegen/omega/basics-0.in0000644000175000017500000000034412413256472017434 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.4/isl/test_inputs/codegen/omega/floor_bound-2.in0000644000175000017500000000030712413256472020501 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.4/isl/test_inputs/codegen/omega/fc1-1.c0000644000175000017500000000072512413256472016461 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.4/isl/test_inputs/codegen/omega/iter6-0.c0000644000175000017500000000013212413256472017030 00000000000000for (int c0 = 1; c0 <= 5; c0 += 1) for (int c1 = 12; c1 <= 17; c1 += 1) s0(c0, c1); cloog-0.18.4/isl/test_inputs/codegen/omega/wak1-1.in0000644000175000017500000000031712413256472017034 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.4/isl/test_inputs/codegen/omega/wak4-0.in0000644000175000017500000000067212413256472017042 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.4/isl/test_inputs/codegen/omega/stride4-0.c0000644000175000017500000000005712413256472017363 00000000000000for (int c0 = 18; c0 <= 98; c0 += 5) s0(c0); cloog-0.18.4/isl/test_inputs/codegen/omega/if_then-3.c0000644000175000017500000000040512413256472017421 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.4/isl/test_inputs/codegen/omega/ge-1.in0000644000175000017500000000041112413256472016557 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.4/isl/test_inputs/codegen/omega/guard1-0.c0000644000175000017500000000004612554427055017171 00000000000000if ((n - m + 2) % 3 == 0) s0(n, m); cloog-0.18.4/isl/test_inputs/codegen/omega/x-0.in0000644000175000017500000000035712413256472016443 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.4/isl/test_inputs/codegen/omega/stride4-0.in0000644000175000017500000000026012413256472017543 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.4/isl/test_inputs/codegen/omega/substitution-0.in0000644000175000017500000000023312413256472020741 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.4/isl/test_inputs/codegen/omega/gist-2.in0000644000175000017500000000041612413256472017140 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.4/isl/test_inputs/codegen/omega/lu-2.c0000644000175000017500000000064012413270107016414 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(c1, c3 + 1); c4 <= min(n, c1 + 63); c4 += 1) s1(c3, c4, c2); if (c0 + 63 >= c2) for (int c4 = max(c1, c2 + 1); c4 <= min(n, c1 + 63); c4 += 1) s0(c2, c4); } cloog-0.18.4/isl/test_inputs/codegen/omega/stride6-2.c0000644000175000017500000000013512413256472017364 00000000000000for (int c0 = 2; c0 <= 100; c0 += 2) for (int c1 = c0; c1 <= 400; c1 += 2) s0(c0, c1); cloog-0.18.4/isl/test_inputs/codegen/omega/floor_bound-1.c0000644000175000017500000000007012413256472020311 00000000000000for (int c0 = floord(m, 4); c0 <= n; c0 += 1) s0(c0); cloog-0.18.4/isl/test_inputs/codegen/omega/syr2k-0.c0000644000175000017500000000035112413270107017043 00000000000000for (int c0 = 1; c0 <= min(n, 2 * b - 1); c0 += 1) for (int c1 = max(-n + 1, -b + 1); c1 <= min(b - c0, n - c0); c1 += 1) for (int c2 = max(1, c0 + c1); c2 <= min(n, n + c1); c2 += 1) s0(-c0 - c1 + c2 + 1, -c1 + c2, c2); cloog-0.18.4/isl/test_inputs/codegen/omega/syr2k-1.c0000644000175000017500000000031712413270107017046 00000000000000for (int c0 = 1; c0 <= min(n, 2 * b - 1); c0 += 1) for (int c1 = -b + 1; c1 <= b - c0; c1 += 1) for (int c2 = max(1, c0 + c1); c2 <= min(n, n + c1); c2 += 1) s0(-c0 - c1 + c2 + 1, -c1 + c2, c2); cloog-0.18.4/isl/test_inputs/codegen/omega/m9-0.in0000644000175000017500000000034012413256472016511 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.4/isl/test_inputs/codegen/omega/lefur04-0.c0000644000175000017500000000237512413271702017264 00000000000000for (int c0 = 0; c0 <= 3; c0 += 1) for (int c1 = max(2 * c0 - 3, c0 / 2); c1 <= min(3, c0 + 1); 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(c1 - (-c1 + 3) / 3, c0 - (-c2 + 3) / 3), c2 - (c2 + 2) / 3), c2 + floord(3 * c1 - c2 - 1, 6)); c3 <= min(3, c0 + c2 / 3 + 1); c3 += 1) for (int c5 = max(max(max(max(0, 2 * c3 - 4), c1 - (-c1 + 3) / 3), c2 - (c2 + 3) / 3), c3 - (c3 + 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(-200 * c1 + 400 * c3 - 199, 250 * c3 + 1), 1000 * c0 - 500 * c5 - 501), 667 * c0 - 333 * c1 - (c0 + c1 + 3) / 3 - 332), 333 * c1 + c1 / 3), 333 * c2 + (c2 + 1) / 3); c6 <= min(min(min(min(min(min(1000, 500 * c0 + 499), -200 * c1 + 400 * c3 + 400), 500 * c5 + 501), 1000 * c0 - 500 * c5 + 997), 333 * c2 - (-c2 + 3) / 3 + 333), 333 * c3 - (-c3 + 3) / 3 + 334); c6 += 1) for (int c7 = max(max(max(max(500 * c5 + 2, c6), 1000 * c0 - c6), 1000 * c3 - 2 * c6 + 2), 500 * c1 + (c6 + 1) / 2); c7 <= min(min(min(min(500 * c5 + 501, 2 * c6 + 1), 1000 * c0 - c6 + 999), 1000 * c3 - 2 * c6 + 1001), 500 * c1 + (c6 + 1) / 2 + 499); c7 += 1) s0(c0, c1, c2, c3, c2 / 3, c5, c6, c7); cloog-0.18.4/isl/test_inputs/codegen/omega/stride7-0.in0000644000175000017500000000033712413256472017553 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.4/isl/test_inputs/codegen/omega/lefur01-0.in0000644000175000017500000000053212413256472017445 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.4/isl/test_inputs/codegen/omega/m9-0.c0000644000175000017500000000015612413256472016332 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.4/isl/test_inputs/codegen/omega/dagstuhl1-0.in0000644000175000017500000000021612413256472020062 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.4/isl/test_inputs/codegen/omega/lift2-4.in0000644000175000017500000000103312413256472017210 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.4/isl/test_inputs/codegen/omega/chosol-1.in0000644000175000017500000000041312413256472017455 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.4/isl/test_inputs/codegen/omega/syr2k-1.in0000644000175000017500000000041612413256472017243 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.4/isl/test_inputs/codegen/omega/ts1d-check0-0.in0000644000175000017500000000116712413256472020202 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.4/isl/test_inputs/codegen/omega/ge-0.in0000644000175000017500000000041112413256472016556 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.4/isl/test_inputs/codegen/omega/stride7-1.c0000644000175000017500000000052512413256472017367 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.4/isl/test_inputs/codegen/omega/floor_bound-4.in0000644000175000017500000000031312413256472020500 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.4/isl/test_inputs/codegen/omega/lu_spmd-1.in0000644000175000017500000000121012413256472017625 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.4/isl/test_inputs/codegen/omega/lu-0.c0000644000175000017500000000064012413270107016412 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(c1, c3 + 1); c4 <= min(n, c1 + 63); c4 += 1) s1(c3, c4, c2); if (c0 + 63 >= c2) for (int c4 = max(c1, c2 + 1); c4 <= min(n, c1 + 63); c4 += 1) s0(c2, c4); } cloog-0.18.4/isl/test_inputs/codegen/omega/gist-3.c0000644000175000017500000000013412413256472016752 00000000000000for (int c0 = 1; c0 < n; c0 += 4) for (int c1 = c0 + 1; c1 <= n; c1 += 6) s0(c0, c1); cloog-0.18.4/isl/test_inputs/codegen/omega/iter5-0.c0000644000175000017500000000015312413256472017032 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.4/isl/test_inputs/codegen/omega/lu-3.in0000644000175000017500000000106112413256472016610 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.4/isl/test_inputs/codegen/omega/gist-1.c0000644000175000017500000000013112413256472016745 00000000000000for (int c0 = 1; c0 <= n; c0 += 4) for (int c1 = c0; c1 <= n; c1 += 8) s0(c0, c1); cloog-0.18.4/isl/test_inputs/codegen/omega/if_then-2.c0000644000175000017500000000033612413270107017412 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.4/isl/test_inputs/codegen/omega/ts1d-orig0-0.in0000644000175000017500000000070712413256472020064 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.4/isl/test_inputs/codegen/omega/chosol-1.c0000644000175000017500000000025512413256472017275 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.4/isl/test_inputs/codegen/omega/hpf-0.in0000644000175000017500000000055012413256472016744 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.4/isl/test_inputs/codegen/omega/m2-0.in0000644000175000017500000000040012413256472016477 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.4/isl/test_inputs/codegen/omega/iter3-0.in0000644000175000017500000000024312413256472017214 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.4/isl/test_inputs/codegen/omega/wak4-1.in0000644000175000017500000000067312413256472017044 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.4/isl/test_inputs/codegen/omega/lu_ijk-1.c0000644000175000017500000000027412413256472017264 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.4/isl/test_inputs/codegen/omega/stride3-0.c0000644000175000017500000000015012413270107017343 00000000000000for (int c0 = 3; c0 <= n; c0 += 32) for (int c1 = c0; c1 <= min(n, c0 + 31); c1 += 1) s0(c0, c1); cloog-0.18.4/isl/test_inputs/codegen/omega/gist-4.in0000644000175000017500000000043412413256472017142 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.4/isl/test_inputs/codegen/omega/code_gen-2.in0000644000175000017500000000037312413256472017737 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.4/isl/test_inputs/codegen/omega/p.delft-0.c0000644000175000017500000000025112413271702017326 00000000000000if (P2 >= 0 && P2 <= 3 && P1 == P2) for (int c0 = 0; c0 <= min(2, -P2 + 4); c0 += 1) for (int c2 = (-P2 - c0 + 6) % 3; c2 <= 3; c2 += 3) s0(c0, c0, c2, c2); cloog-0.18.4/isl/test_inputs/codegen/omega/m4-1.in0000644000175000017500000000033612413256472016512 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.4/isl/test_inputs/codegen/omega/substitution-1.in0000644000175000017500000000023412413256472020743 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.4/isl/test_inputs/codegen/omega/iter5-0.in0000644000175000017500000000030412413256472017214 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.4/isl/test_inputs/codegen/omega/p.delft2-0.c0000644000175000017500000000100212413271702017403 00000000000000if (P1 >= 0 && P1 <= 3 && P2 >= 0 && P2 <= 3) for (int c0 = P1 - 1; c0 <= 3; c0 += 1) for (int c2 = 0; c2 <= 7; c2 += 1) for (int c3 = 0; c3 <= 7; c3 += 1) if ((5 * P2 + 2 * c3) % 9 <= 3) { if (P1 >= 1 && c0 + 1 == P1 && (5 * P1 + 2 * c2) % 9 <= 2) { s0(P1 - 1, P2, c2, c3, ((5 * P1 + 2 * c2) % 9) + 1, (-4 * P2 + 2 * c3 + 9) % 9); } else if (P1 == 0 && c0 == 3 && c2 % 4 == 0) s0(3, P2, c2, c3, (-c2 / 4) + 3, (-4 * P2 + 2 * c3 + 9) % 9); } cloog-0.18.4/isl/test_inputs/codegen/omega/lift1-0.in0000644000175000017500000000103312413256472017203 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.4/isl/test_inputs/codegen/omega/substitution-2.in0000644000175000017500000000020612413256472020743 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.4/isl/test_inputs/codegen/omega/code_gen-0.c0000644000175000017500000000025712413271702017543 00000000000000for (int c0 = 1; c0 <= 8; c0 += 1) for (int c1 = 0; c1 <= 7; c1 += 1) { if (c0 >= 2 && c0 <= 6 && c1 <= 4) s1(c0, c1); if (c1 + 1 >= c0) s0(c0, c1); } cloog-0.18.4/isl/test_inputs/codegen/omega/iter1-0.in0000644000175000017500000000017312413256472017214 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.4/isl/test_inputs/codegen/omega/lift1-1.in0000644000175000017500000000103312413256472017204 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.4/isl/test_inputs/codegen/omega/floor_bound-4.c0000644000175000017500000000014312413256472020315 00000000000000if (n >= 3 * floord(n + 1, 3)) for (int c0 = m; c0 <= 5 * floord(n + 1, 3); c0 += 1) s0(c0); cloog-0.18.4/isl/test_inputs/codegen/omega/stride6-1.in0000644000175000017500000000037212413256472017552 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.4/isl/test_inputs/codegen/omega/if_then-1.c0000644000175000017500000000024212413256472017416 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.4/isl/test_inputs/codegen/omega/lift1-4.in0000644000175000017500000000103312413256472017207 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.4/isl/test_inputs/codegen/omega/fc1-2.c0000644000175000017500000000072512413256472016462 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.4/isl/test_inputs/codegen/omega/lefur00-0.c0000644000175000017500000000101112554427055017254 00000000000000for (int c0 = 0; c0 <= 15; c0 += 1) for (int c1 = max(2 * c0 - 15, c0 / 2); c1 <= min(15, c0 + 1); c1 += 1) for (int c2 = max(max(max(1, 67 * c0 - (c0 + 1) / 3), 67 * c1 - (c1 + 2) / 3), 133 * c0 - 67 * c1 + (c0 + c1 + 1) / 3 - 66); c2 <= min(min(1000, 100 * c0 + 99), 133 * c0 - 67 * c1 + (c0 + c1 + 2) / 3 + 132); c2 += 1) for (int c3 = max(max(c2, 200 * c0 - c2), 100 * c1 + (c2 + 1) / 2); c3 <= min(min(2 * c2 + 1, 200 * c0 - c2 + 199), 100 * c1 + (c2 + 1) / 2 + 99); c3 += 1) s0(c0, c1, c2, c3); cloog-0.18.4/isl/test_inputs/codegen/omega/if_then-3.in0000644000175000017500000000053512413256472017611 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.4/isl/test_inputs/codegen/omega/if_then-4.in0000644000175000017500000000054512413256472017613 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.4/isl/test_inputs/codegen/omega/fc2-0.c0000644000175000017500000000034612413256472016460 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.4/isl/test_inputs/codegen/omega/stride7-1.in0000644000175000017500000000034012413256472017546 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.4/isl/test_inputs/codegen/omega/olda-0.c0000644000175000017500000000032412413256472016721 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.4/isl/test_inputs/codegen/omega/if_then-4.c0000644000175000017500000000027312413271702017416 00000000000000for (int c0 = 4; c0 <= 100; c0 += 4) { for (int c1 = 1; c1 <= 100; c1 += 1) s0(c0, c1); if (c0 >= 8 && c0 <= 96) for (int c1 = 10; c1 <= 100; c1 += 1) s1(c0 + 2, c1); } cloog-0.18.4/isl/test_inputs/codegen/omega/substitution-1.c0000644000175000017500000000026712554427055020570 00000000000000for (int c0 = 0; c0 <= 14; c0 += 1) for (int c1 = max(2 * c0 - 12, -c0 + 3 * ((c0 + 1) / 2)); c1 <= min(2 * c0, c0 / 2 + 9); c1 += 3) s0((2 * c0 - c1) / 3, (-c0 + 2 * c1) / 3); cloog-0.18.4/isl/test_inputs/codegen/omega/lift2-2.c0000644000175000017500000000115612413270107017017 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.4/isl/test_inputs/codegen/omega/p6-0.c0000644000175000017500000000023312413256472016326 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.4/isl/test_inputs/codegen/omega/lift1-2.in0000644000175000017500000000103312413256472017205 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.4/isl/test_inputs/codegen/omega/p6-0.in0000644000175000017500000000034412413256472016515 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.4/isl/test_inputs/codegen/omega/ts1d-check-sblock-0.in0000644000175000017500000000071012413256472021366 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.4/isl/test_inputs/codegen/omega/README0000644000175000017500000000036312413256472016364 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.4/isl/test_inputs/codegen/omega/basics-1.in0000644000175000017500000000027212413256472017435 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.4/isl/test_inputs/codegen/component3.c0000644000175000017500000000007312554427055016646 00000000000000{ A(); for (int c0 = 0; c0 <= 9; c0 += 1) B(c0); } cloog-0.18.4/isl/test_inputs/codegen/unroll4.in0000644000175000017500000000144312413256472016343 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.4/isl/test_inputs/codegen/pldi2012/0000755000175000017500000000000012511231702015713 500000000000000cloog-0.18.4/isl/test_inputs/codegen/pldi2012/figure8_b.c0000644000175000017500000000020412413271702017652 00000000000000{ for (int c0 = 2; c0 < n - 1; c0 += 4) { s1(c0); s0(c0 + 2); } if (n >= 2 && n % 4 >= 2) s1(-(n % 4) + n + 2); } cloog-0.18.4/isl/test_inputs/codegen/pldi2012/figure7_c.in0000644000175000017500000000030212413256472020044 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.4/isl/test_inputs/codegen/pldi2012/figure8_a.c0000644000175000017500000000013112413256472017657 00000000000000for (int c0 = 1; c0 <= n; c0 += 4) for (int c1 = c0; c1 <= n; c1 += 3) s0(c0, c1); cloog-0.18.4/isl/test_inputs/codegen/pldi2012/figure8_b.in0000644000175000017500000000023412413256472020050 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.4/isl/test_inputs/codegen/pldi2012/figure7_b.c0000644000175000017500000000024212413256472017662 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.4/isl/test_inputs/codegen/pldi2012/figure8_a.in0000644000175000017500000000022212413256472020044 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.4/isl/test_inputs/codegen/pldi2012/figure7_d.c0000644000175000017500000000040512413256472017665 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.4/isl/test_inputs/codegen/pldi2012/figure7_b.in0000644000175000017500000000030212413256472020043 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.4/isl/test_inputs/codegen/pldi2012/figure7_c.c0000644000175000017500000000033612413270107017656 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.4/isl/test_inputs/codegen/pldi2012/figure7_d.in0000644000175000017500000000030212413256472020045 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.4/isl/test_inputs/codegen/pldi2012/README0000644000175000017500000000012512413256472016525 00000000000000These examples are taken from the "Polyhedra Scanning Revisited" paper by Chun Chen. cloog-0.18.4/isl/test_inputs/codegen/disjuncts.in0000644000175000017500000000044412413256472016752 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.4/isl/test_inputs/codegen/separate2.in0000644000175000017500000000222412413256472016630 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.4/isl/test_inputs/codegen/dwt.in0000644000175000017500000000035212413256472015540 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.4/isl/test_inputs/codegen/isolate1.st0000644000175000017500000000030412554427055016503 00000000000000# Check that the isolate option is adjusted by schedule space scaling domain: "{ A[i] : 0 <= i < 100 }" child: schedule: "[{ A[i] -> [3i] }]" options: "{ isolate[[] -> [x]] : 10 <= x <= 20 }" cloog-0.18.4/isl/test_inputs/codegen/unroll8.st0000644000175000017500000000041712554427055016372 00000000000000# Check that options are adjusted by shifted stride detection domain: "{ A[i,j] : 0 <= i < 100 and 0 <= j < 2; B[i,j] : 0 <= i < 100 and 0 <= j < 2 }" child: schedule: "[{ A[i,j] -> [2i]; B[i,j] -> [2i+1] }, { A[i,j] -> [j]; B[i,j] -> [j]}]" options: "{ unroll[1] }" cloog-0.18.4/isl/test_inputs/codegen/unroll10.in0000644000175000017500000000025112413271702016405 00000000000000# Check that all information is taken into account while trying to unroll [m,n] -> { A[i] -> [i] : 0 <= i < n,m } [m,n] -> { : m <= 10 or n <= 10 } { [i] -> unroll[x] } cloog-0.18.4/isl/test_inputs/codegen/gemm.st0000644000175000017500000000117112554427055015712 00000000000000domain: "[ni, nj, nk] -> { S_4[i, j, k] : k <= -1 + nk and k >= 0 and j <= -1 + nj and j >= 0 and i <= -1 + ni and i >= 0; S_2[i, j] : j <= -1 + nj and j >= 0 and i <= -1 + ni and i >= 0 }" child: set: - filter: "[ni, nj, nk] -> { S_4[i, j, k]; S_2[i, j] }" child: schedule: "[ni, nj, nk] -> [{ S_4[i, j, k] -> [(i)]; S_2[i, j] -> [(i)] }, { S_4[i, j, k] -> [(j)]; S_2[i, j] -> [(j)] }, { S_4[i, j, k] -> [(k)]; S_2[i, j] -> [(0)] }]" permutable: 1 coincident: [ 1, 1, 0 ] child: sequence: - filter: "[ni, nj, nk] -> { S_2[i, j] }" - filter: "[ni, nj, nk] -> { S_4[i, j, k] }" cloog-0.18.4/isl/test_inputs/codegen/atomic2.in0000644000175000017500000000050012413256472016273 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.4/isl/test_inputs/codegen/unroll6.in0000644000175000017500000000130012413256472016335 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.4/isl/test_inputs/codegen/isolate3.c0000644000175000017500000000031112554427055016277 00000000000000{ for (int c0 = 0; c0 <= 9; c0 += 1) A(c0); A(10); A(11); A(12); A(13); A(14); A(15); A(16); A(17); A(18); A(19); A(20); for (int c0 = 21; c0 <= 99; c0 += 1) A(c0); } cloog-0.18.4/isl/test_inputs/codegen/unroll6.c0000644000175000017500000000057312413271702016155 00000000000000{ if (g >= 0 && nn >= 128 * g + 6 && nn >= ((t1 + 127) % 128) + 128 * g + 3) for (int c1 = 393214; c1 < nn - 1; c1 += 393216) A(c1, ((t1 + 127) % 128) + 128 * g + 1, ((t1 + 127) % 128) + 1); if (t1 >= 1 && t1 <= 2 && nn >= t1 + 128 * g + 130 && t1 + 128 * g >= -127) for (int c1 = 393214; c1 < nn - 1; c1 += 393216) A(c1, t1 + 128 * g + 128, t1 + 128); } cloog-0.18.4/isl/test_inputs/codegen/isolate2.c0000644000175000017500000000042012554427055016277 00000000000000for (int c0 = 0; c0 <= 99; c0 += 1) { if (c0 >= 4 && c0 <= 6) { for (int c1 = 0; c1 <= 99; c1 += 1) A(c0, c1); } else if (c0 >= 7) { for (int c1 = 0; c1 <= 99; c1 += 1) A(c0, c1); } else for (int c1 = 0; c1 <= 99; c1 += 1) A(c0, c1); } cloog-0.18.4/isl/test_inputs/codegen/unroll3.in0000644000175000017500000000074312413256472016344 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.4/isl/test_inputs/codegen/filter.c0000644000175000017500000000031712554427055016047 00000000000000if (n >= m + 1) { for (int c0 = 0; c0 < n; c0 += 1) for (int c2 = 0; c2 < n; c2 += 1) A(c0, c2); } else for (int c0 = 0; c0 < n; c0 += 1) for (int c2 = 0; c2 < n; c2 += 1) A(c0, c2); cloog-0.18.4/isl/test_inputs/codegen/dwt.c0000644000175000017500000000023412413270107015342 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.4/isl/test_inputs/codegen/component0.st0000644000175000017500000000013112554427055017042 00000000000000domain: "{ A[]; B[i] : 0 <= i < 10 }" child: schedule: "[{ A[] -> [0]; B[i] -> [i] }]" cloog-0.18.4/isl/test_inputs/codegen/component4.st0000644000175000017500000000027212554427055017054 00000000000000domain: "{ A[i] : 0 <= i < 10; B[i,j] : 0 <= i,j < 10 }" child: schedule: "[{ A[i] -> [0]; B[i,j] -> [i] }]" child: sequence: - filter: "{ A[i] }" - filter: "{ B[i,j] }" cloog-0.18.4/isl/test_inputs/codegen/isolate1.c0000644000175000017500000000022512554427055016301 00000000000000{ for (int c0 = 0; c0 <= 3; c0 += 1) A(c0); for (int c0 = 4; c0 <= 6; c0 += 1) A(c0); for (int c0 = 7; c0 <= 99; c0 += 1) A(c0); } cloog-0.18.4/isl/test_inputs/codegen/component5.st0000644000175000017500000000037412554427055017060 00000000000000domain: "{ A[i] : 0 <= i < 10; B[i,j] : 0 <= i,j < 10 }" child: schedule: "[{ A[i] -> [0]; B[i,j] -> [i] }]" child: schedule: "[{ A[i] -> [i]; B[i,j] -> [j] }]" child: sequence: - filter: "{ A[i] }" - filter: "{ B[i,j] }" cloog-0.18.4/isl/test_inputs/codegen/shift2.in0000644000175000017500000000301512413256472016140 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.4/isl/test_inputs/codegen/separate.st0000644000175000017500000000021012554427055016562 00000000000000domain: "{ a[i] : 0 <= i < 10; b[i] : 0 <= i < 10 }" child: schedule: "[{ a[i] -> [i]; b[i] -> [i+1] }]" options: "{ separate[x] }" cloog-0.18.4/isl/test_inputs/codegen/isolate6.st0000644000175000017500000000046412554427055016517 00000000000000# Example from the manual domain: "{ A[i,j] : 0 <= i,j and i + j <= 100 }" child: schedule: "[{ A[i,j] -> [floor(i/10)] }, \ { A[i,j] -> [floor(j/10)] }, \ { A[i,j] -> [i] }, { A[i,j] -> [j] }]" options: "{ isolate[[] -> [a,b,c,d]] : 0 <= 10a,10b and \ 10a+9+10b+9 <= 100; [isolate[] -> unroll[3]] }" cloog-0.18.4/isl/test_inputs/codegen/empty.c0000644000175000017500000000012512413271702015703 00000000000000for (int c0 = 0; c0 <= 10; c0 += 1) { S0(c0); if (c0 == 5) S2(); S1(c0); } cloog-0.18.4/isl/test_inputs/codegen/empty.in0000644000175000017500000000035012413271702016067 00000000000000# Earlier versions of isl would end up with an empty partial # executed relation and fail to detect this emptiness. [M] -> { S0[i] -> [i, -M] : 0 <= i <= 10; S1[i] -> [i, 0] : 0 <= i <= 10; S2[] -> [5, 0] } [M] -> { : M >= 1 } { } cloog-0.18.4/isl/test_inputs/codegen/mod.in0000644000175000017500000000021312413256472015515 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.4/isl/test_inputs/codegen/unroll2.in0000644000175000017500000000024612413256472016341 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.4/isl/test_inputs/codegen/unroll.c0000644000175000017500000000005412413256472016070 00000000000000{ A(0); A(100000000); A(200000000); } cloog-0.18.4/isl/test_inputs/codegen/atomic2.c0000644000175000017500000000011512413256472016111 00000000000000for (int c0 = ((b0 + 32767) % 32768) + 1; c0 <= 65534; c0 += 32768) A(c0); cloog-0.18.4/isl/test_inputs/codegen/stride6.in0000644000175000017500000000137512413256472016330 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.4/isl/test_inputs/codegen/stride7.in0000644000175000017500000000047012413271702016315 00000000000000# Check that no redundant guards are introduced { s4[a, b] -> [a, 2, b] : exists (e0 = floor((-2 + a)/64): 64e0 = -2 + a and a <= 200 and b <= 62 + a and b >= 122); s2[a, b] -> [a, 2, b] : exists (e0 = floor((-2 + a)/64): 64e0 = -2 + a and a >= 2 and b <= 120 and b >= -1 + a and a <= 100) } { : } { } cloog-0.18.4/isl/test_inputs/codegen/unroll7.in0000644000175000017500000000034712413271702016341 00000000000000# Check that some code is generated. # Older versions of isl would abort on unknown divs. { S[i,j] -> [i,j]: exists (alpha, beta: j=i+4alpha +3beta and 0 <= alpha < 24 and 0 <= beta and 0 <= i,j < 5) } { : } { [i,j] -> unroll[x] } cloog-0.18.4/isl/test_inputs/codegen/component2.st0000644000175000017500000000024112554427055017046 00000000000000domain: "{ A[]; B[i] : 0 <= i < 10 }" child: schedule: "[{ A[] -> [0]; B[i] -> [i] }]" child: sequence: - filter: "{ B[i] }" - filter: "{ A[] }" cloog-0.18.4/isl/test_inputs/codegen/unroll3.c0000644000175000017500000000010712413271702016143 00000000000000if ((t1 + 121) % 128 <= 123) write_shared_A(((t1 + 125) % 128) - 3); cloog-0.18.4/isl/test_inputs/codegen/unroll4.c0000644000175000017500000000162212413271702016147 00000000000000{ write_shared_A(3, ((t1 + 3) % 4) + 1, ((t2 + 31) % 32) + 1); if (t2 >= 1 && t2 <= 2 && t1 % 3 == 0) write_shared_A(3, (-t1 / 3) + 4, t2 + 32); { int c3 = t2 >= 2 && ((t1 + 3) % 4) + 1 >= t2 ? t2 + 32 : ((t2 + 30) % 32) + 2; if (c3 == t2 + 32 || (c3 == t2 && t2 >= ((t1 + 3) % 4) + ((t2 - 1) % 2) + 2)) write_shared_A(3, ((t1 + 3) % 4) + 5, c3); } if (t1 >= 1 && t2 >= t1 + 1 && t2 <= 4) write_shared_A(3, t1 + 4, t2 + 32); write_shared_A(4, ((t1 + 3) % 4) + 1, ((t2 + 31) % 32) + 1); if (t2 >= 1 && t2 <= 2 && t1 % 3 == 0) write_shared_A(4, (-t1 / 3) + 4, t2 + 32); { int c3 = t2 >= 2 && ((t1 + 3) % 4) + 1 >= t2 ? t2 + 32 : ((t2 + 30) % 32) + 2; if (c3 == t2 + 32 || (c3 == t2 && t2 >= ((t1 + 3) % 4) + ((t2 - 1) % 2) + 2)) write_shared_A(4, ((t1 + 3) % 4) + 5, c3); } if (t1 >= 1 && t2 >= t1 + 1 && t2 <= 4) write_shared_A(4, t1 + 4, t2 + 32); } cloog-0.18.4/isl/test_inputs/codegen/shift.in0000644000175000017500000000010612413256472016054 00000000000000{ A[i] -> [2i]: 0 <= i < 10; B[i] -> [2i+1] : 0 <= i < 10 } { : } { } cloog-0.18.4/isl/test_inputs/codegen/lu.c0000644000175000017500000000140312413271702015165 00000000000000for (int c0 = 0; c0 < n - 1; c0 += 32) for (int c1 = c0; c1 < n; c1 += 32) for (int c2 = c0; c2 < n; c2 += 32) { if (c1 >= c0 + 32) { for (int c3 = c0; c3 <= min(c0 + 31, c2 + 30); c3 += 1) for (int c4 = c1; c4 <= min(n - 1, c1 + 31); c4 += 1) for (int c5 = max(c2, c3 + 1); c5 <= min(n - 1, c2 + 31); c5 += 1) S_6(c3, c4, c5); } else for (int c3 = c0; c3 <= min(min(n - 2, c0 + 31), c2 + 30); c3 += 1) { for (int c5 = max(c2, c3 + 1); c5 <= min(n - 1, c2 + 31); c5 += 1) S_2(c3, c5); for (int c4 = c3 + 1; c4 <= min(n - 1, c0 + 31); c4 += 1) for (int c5 = max(c2, c3 + 1); c5 <= min(n - 1, c2 + 31); c5 += 1) S_6(c3, c4, c5); } } cloog-0.18.4/isl/test_inputs/codegen/separation_class2.c0000644000175000017500000000103212413271702020157 00000000000000{ for (int c0 = 0; c0 < -(n % 8) + n; c0 += 8) { for (int c1 = 0; c1 < -(n % 8) + n; 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(7, n - c1 - 1); c3 += 1) A(-((n - 1) % 8) + n + c2 - 1, c1 + c3); } cloog-0.18.4/isl/test_inputs/codegen/hoist.c0000644000175000017500000000223412413271702015676 00000000000000if (ni >= t0 + 1 && nj >= t1 + 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.4/isl/test_inputs/codegen/isolate2.st0000644000175000017500000000037312554427055016512 00000000000000# Check that the isolate option is adjusted by schedule space scaling domain: "{ A[i,j] : 0 <= i,j < 100 }" child: schedule: "[{ A[i,j] -> [3i] }]" child: schedule: "[{ A[i,j] -> [3j] }]" options: "{ isolate[[x] -> [y]] : 10 <= x <= 20 }" cloog-0.18.4/isl/test_inputs/codegen/roman.c0000644000175000017500000000144612413271702015670 00000000000000{ for (int c1 = 0; c1 <= min(np1 - i, -i + 1); c1 += 1) { S_9(c1); S_12(c1); } for (int c1 = max(0, -i + 2); c1 <= -((-np1 + i + 4294967295) % 4294967296) + 4294967295; c1 += 1) { S_9(c1); S_10(c1); for (int c3 = 0; c3 <= min(19, i + c1 - 3); c3 += 1) { S_15(c1, c3); for (int c5 = 0; c5 < c3; c5 += 1) { S_16(c1, c3, c5); S_17(c1, c3, c5); } S_16(c1, c3, c3); S_18(c1, c3); S_24(c1, c3); S_19(c1, c3); } if (np1 >= i && i + c1 <= 21) { S_15(c1, i + c1 - 2); for (int c5 = 0; c5 < i + c1 - 2; c5 += 1) { S_16(c1, i + c1 - 2, c5); S_17(c1, i + c1 - 2, c5); } S_16(c1, i + c1 - 2, i + c1 - 2); S_18(c1, i + c1 - 2); S_24(c1, i + c1 - 2); } S_12(c1); } } cloog-0.18.4/isl/test_inputs/codegen/unroll11.c0000644000175000017500000000016212554427055016235 00000000000000{ if (t1 >= 126) S(0, t1 - 384); S(0, t1 - 256); if (t1 >= 126) S(1, t1 - 384); S(1, t1 - 256); } cloog-0.18.4/isl/test_inputs/codegen/component6.st0000644000175000017500000000045412554427055017060 00000000000000# Check that components are still detected in presence of nested context node domain: "{ A[]; B[i] : 0 <= i < 10 }" child: schedule: "[{ A[] -> [0]; B[i] -> [i] }]" child: context: "[n] -> { [i] : 0 <= n <= i }" child: sequence: - filter: "{ A[] }" - filter: "{ B[i] }" cloog-0.18.4/isl/test_inputs/codegen/component1.st0000644000175000017500000000024112554427055017045 00000000000000domain: "{ A[]; B[i] : 0 <= i < 10 }" child: schedule: "[{ A[] -> [0]; B[i] -> [i] }]" child: sequence: - filter: "{ A[] }" - filter: "{ B[i] }" cloog-0.18.4/isl/test_inputs/codegen/separate.c0000644000175000017500000000013112413256472016355 00000000000000{ a(0); for (int c0 = 1; c0 <= 9; c0 += 1) { b(c0 - 1); a(c0); } b(9); } cloog-0.18.4/isl/test_inputs/codegen/isolate4.c0000644000175000017500000000020112554427055016276 00000000000000{ A(0); A(1); A(2); A(3); A(4); for (int c0 = 5; c0 <= 15; c0 += 1) A(c0); A(16); A(17); A(18); A(19); } cloog-0.18.4/isl/test_inputs/codegen/cloog/0000755000175000017500000000000012554427055015600 500000000000000cloog-0.18.4/isl/test_inputs/codegen/cloog/basic-bounds-2.c0000644000175000017500000000000712413256472020366 00000000000000S1(0); cloog-0.18.4/isl/test_inputs/codegen/cloog/walters2.c0000644000175000017500000000036412413256472017427 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.4/isl/test_inputs/codegen/cloog/reservoir-tang-xue1.st0000644000175000017500000000116212554427055021717 00000000000000domain: "{ S1[i0, i1, i2, i3] : 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 }" child: context: "{ [] }" child: schedule: "[{ S1[i0, i1, i2, i3] -> [(2i0)] }]" options: "{ separate[i0] }" child: schedule: "[{ S1[i0, i1, i2, i3] -> [(2i0 + 2i1)] }]" options: "{ separate[i0] }" child: schedule: "[{ S1[i0, i1, i2, i3] -> [(2i0 + i2)] }]" options: "{ separate[i0] }" child: schedule: "[{ S1[i0, i1, i2, i3] -> [(2i0 + 2i1 + i3)] }]" options: "{ separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/usvd_e_t.c0000644000175000017500000001510512413256472017473 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.4/isl/test_inputs/codegen/cloog/nul_basic1.c0000644000175000017500000000006512413256472017702 00000000000000for (int c0 = 0; c0 <= M; c0 += 2) S1(c0, c0 / 2); cloog-0.18.4/isl/test_inputs/codegen/cloog/lineality-1-2.c0000644000175000017500000000026212413256472020150 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.4/isl/test_inputs/codegen/cloog/vivien.c0000644000175000017500000000500012554427055017157 00000000000000{ for (int c0 = -27 * n + 2; c0 <= 1; c0 += 1) S1(c0 - 1); for (int c0 = 2; c0 <= min(2 * n, n + 29); c0 += 1) { if (c0 >= 3) { 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 if (c0 >= 5) { S4(c0 - c0 / 2 - 2, c0 / 2 + 2); for (int c2 = 1; c2 < c0 - c0 / 2 - 1; c2 += 1) S5(c0 - c0 / 2 - 1, c0 / 2 + 1, c2); } } for (int c1 = -c0 + c0 / 2 + 3; c1 <= min(-1, 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 && c0 >= n + 2) { S6(-n + c0 + 1, n - 1); for (int c2 = 1; c2 < -n + c0; c2 += 1) S5(-n + c0, n, c2); } if (n >= 3 && c0 == n + 2) { S6(2, n); S1(n + 1); } else { if (c0 >= n + 3 && 2 * n >= c0 + 1) S6(-n + c0, n); if (c0 >= n + 3) { S1(c0 - 1); } else { if (n + 1 >= c0 && c0 <= 4) { S1(c0 - 1); } else if (c0 >= 5 && n + 1 >= c0) { S6(2, c0 - 2); S1(c0 - 1); } if (n + 1 >= c0) S6(1, c0 - 1); } } if (n == 2 && c0 == 4) S1(3); } else S1(1); if (c0 % 2 == 0) S3(c0 / 2); for (int c1 = max(1, -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); 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 - c0 / 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.4/isl/test_inputs/codegen/cloog/nul_basic2.c0000644000175000017500000000014012413256472017675 00000000000000for (int c0 = 2; c0 <= n; c0 += 2) { if (c0 % 4 == 0) S2(c0, c0 / 4); S1(c0, c0 / 2); } cloog-0.18.4/isl/test_inputs/codegen/cloog/block.st0000644000175000017500000000043112554427055017160 00000000000000domain: "{ S1[]; S3[i0] : i0 >= 0 and i0 <= 1; S2[] }" child: context: "{ [] }" child: schedule: "[{ S2[] -> [(1)]; S3[i0] -> [(i0)]; S1[] -> [(0)] }]" options: "{ separate[i0] }" child: sequence: - filter: "{ S1[]; S2[] }" - filter: "{ S3[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-mg-interp.st0000644000175000017500000002061712554427055022016 00000000000000domain: "[M, N, O, P, Q, R, S, T, U] -> { S8[i0, i1, i2] : i0 >= 1 and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= 1 and i2 <= -1 + M; S12[i0, i1, i2] : i0 >= R and i0 <= -1 + O and i1 >= Q and i1 <= -1 + N and i2 >= P and i2 <= -1 + M; S5[i0, i1, i2] : i0 >= 1 and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= 1 and i2 <= -1 + M; S10[i0, i1, i2] : i0 >= 1 and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= 1 and i2 <= -1 + M; S6[i0, i1, i2] : i0 >= 1 and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= 1 and i2 <= -1 + M; S1[i0, i1, i2] : i0 >= 1 and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= 1 and i2 <= M; S3[i0, i1, i2] : i0 >= 1 and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= 1 and i2 <= M; S4[i0, i1, i2] : i0 >= 1 and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= 1 and i2 <= -1 + M; S15[i0, i1, i2] : i0 >= R and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= 1 and i2 <= -1 + M; S11[i0, i1, i2] : i0 >= 1 and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= 1 and i2 <= -1 + M; S2[i0, i1, i2] : i0 >= 1 and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= 1 and i2 <= M; S7[i0, i1, i2] : i0 >= 1 and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= 1 and i2 <= -1 + M; S9[i0, i1, i2] : i0 >= 1 and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= 1 and i2 <= -1 + M; S14[i0, i1, i2] : i0 >= R and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= P and i2 <= -1 + M; S13[i0, i1, i2] : i0 >= R and i0 <= -1 + O and i1 >= Q and i1 <= -1 + N and i2 >= 1 and i2 <= -1 + M }" child: context: "[M, N, O, P, Q, R, S, T, U] -> { [] }" child: sequence: - filter: "[M, N, O, P, Q, R, S, T, U] -> { S10[i0, i1, i2]; S6[i0, i1, i2]; S3[i0, i1, i2]; S1[i0, i1, i2]; S11[i0, i1, i2]; S7[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S11[i0, i1, i2] -> [(i0)]; S1[i0, i1, i2] -> [(i0)]; S6[i0, i1, i2] -> [(i0)]; S10[i0, i1, i2] -> [(i0)]; S3[i0, i1, i2] -> [(i0)]; S7[i0, i1, i2] -> [(i0)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S11[i0, i1, i2] -> [(2i1)]; S1[i0, i1, i2] -> [(-3 + 2i1)]; S6[i0, i1, i2] -> [(-2 + 2i1)]; S10[i0, i1, i2] -> [(1 + 2i1)]; S3[i0, i1, i2] -> [(-1 + 2i1)]; S7[i0, i1, i2] -> [(-2 + 2i1)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" child: sequence: - filter: "[M, N, O, P, Q, R, S, T, U] -> { S10[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S10[i0, i1, i2] -> [(i2)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" - filter: "[M, N, O, P, Q, R, S, T, U] -> { S3[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S3[i0, i1, i2] -> [(i2)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" - filter: "[M, N, O, P, Q, R, S, T, U] -> { S6[i0, i1, i2]; S1[i0, i1, i2]; S7[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S1[i0, i1, i2] -> [(i2)]; S6[i0, i1, i2] -> [(i2)]; S7[i0, i1, i2] -> [(i2)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" child: sequence: - filter: "[M, N, O, P, Q, R, S, T, U] -> { S6[i0, i1, i2]; S1[i0, i1, i2] }" - filter: "[M, N, O, P, Q, R, S, T, U] -> { S7[i0, i1, i2] }" - filter: "[M, N, O, P, Q, R, S, T, U] -> { S11[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S11[i0, i1, i2] -> [(i2)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" - filter: "[M, N, O, P, Q, R, S, T, U] -> { S2[i0, i1, i2]; S9[i0, i1, i2]; S8[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S2[i0, i1, i2] -> [(i0)]; S8[i0, i1, i2] -> [(i0)]; S9[i0, i1, i2] -> [(i0)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S2[i0, i1, i2] -> [(2i1)]; S8[i0, i1, i2] -> [(2i1)]; S9[i0, i1, i2] -> [(1 + 2i1)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" child: sequence: - filter: "[M, N, O, P, Q, R, S, T, U] -> { S2[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S2[i0, i1, i2] -> [(i2)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" - filter: "[M, N, O, P, Q, R, S, T, U] -> { S8[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S8[i0, i1, i2] -> [(i2)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" - filter: "[M, N, O, P, Q, R, S, T, U] -> { S9[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S9[i0, i1, i2] -> [(i2)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" - filter: "[M, N, O, P, Q, R, S, T, U] -> { S4[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S4[i0, i1, i2] -> [(i0)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S4[i0, i1, i2] -> [(i1)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S4[i0, i1, i2] -> [(i2)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" - filter: "[M, N, O, P, Q, R, S, T, U] -> { S5[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S5[i0, i1, i2] -> [(i0)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S5[i0, i1, i2] -> [(i1)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S5[i0, i1, i2] -> [(i2)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" - filter: "[M, N, O, P, Q, R, S, T, U] -> { S12[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S12[i0, i1, i2] -> [(i0)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S12[i0, i1, i2] -> [(i1)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S12[i0, i1, i2] -> [(i2)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" - filter: "[M, N, O, P, Q, R, S, T, U] -> { S13[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S13[i0, i1, i2] -> [(i0)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S13[i0, i1, i2] -> [(i1)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S13[i0, i1, i2] -> [(i2)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" - filter: "[M, N, O, P, Q, R, S, T, U] -> { S14[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S14[i0, i1, i2] -> [(i0)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S14[i0, i1, i2] -> [(i1)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S14[i0, i1, i2] -> [(i2)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" - filter: "[M, N, O, P, Q, R, S, T, U] -> { S15[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S15[i0, i1, i2] -> [(i0)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S15[i0, i1, i2] -> [(i1)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S15[i0, i1, i2] -> [(i2)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/gauss.st0000644000175000017500000000065712554427055017222 00000000000000domain: "[M] -> { S2[i0, i1, i2] : i0 >= 1 and i0 <= M and i1 >= 1 + i0 and i1 <= M and i2 >= 1 + i0 and i2 <= M; S1[i0, i1, i2] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= -1 + i0 and i2 >= 1 + i0 and i2 <= M }" child: context: "[M] -> { [] }" child: schedule: "[M] -> [{ S1[i0, i1, i2] -> [(i0)]; S2[i0, i1, i2] -> [(i0)] }, { S1[i0, i1, i2] -> [(i2)]; S2[i0, i1, i2] -> [(i2)] }]" options: "[M] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-loechner4.st0000644000175000017500000000117112554427055021771 00000000000000domain: "[M] -> { S1[i0, i1, i2, i3] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= M and i2 >= 1 and i2 <= M and i3 >= 1 and i3 <= M }" child: context: "[M] -> { [] }" child: schedule: "[M] -> [{ S1[i0, i1, i2, i3] -> [(i2 + i3)] }]" options: "[M] -> { separate[i0] }" child: schedule: "[M] -> [{ S1[i0, i1, i2, i3] -> [(i1)] }]" options: "[M] -> { separate[i0] }" child: schedule: "[M] -> [{ S1[i0, i1, i2, i3] -> [(i0)] }]" options: "[M] -> { separate[i0] }" child: schedule: "[M] -> [{ S1[i0, i1, i2, i3] -> [(i2)] }]" options: "[M] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/dot2.st0000644000175000017500000000067212554427055016745 00000000000000domain: "[M, N] -> { S1[i0] : i0 >= 1 and i0 <= M; S2[i0, i1] : i0 >= 1 and i0 <= N and i1 >= 1 and i1 <= M }" child: context: "[M, N] -> { [] : M >= 1 and N >= 1 }" child: schedule: "[M, N] -> [{ S2[i0, i1] -> [(i0)]; S1[i0] -> [(i0)] }, { S2[i0, i1] -> [(i1)]; S1[i0] -> [(0)] }]" options: "[M, N] -> { separate[i0] }" child: sequence: - filter: "[M, N] -> { S1[i0] }" - filter: "[M, N] -> { S2[i0, i1] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/darte.st0000644000175000017500000000077112554427055017174 00000000000000domain: "[n] -> { S1[i0, i1, i2] : i0 >= 1 and i0 <= n and i1 >= 1 and i1 <= n and i2 >= 1 and i2 <= n; S2[i0, i1, i2] : i0 >= 1 and i0 <= n and i1 >= 1 and i1 <= n and i2 >= 1 and i2 <= n }" child: context: "[n] -> { [] }" child: schedule: "[n] -> [{ S1[i0, i1, i2] -> [(i0 - i1)]; S2[i0, i1, i2] -> [(1 + i0 - i1)] }, { S1[i0, i1, i2] -> [(i0 + i1)]; S2[i0, i1, i2] -> [(2 + i0 + i1)] }, { S1[i0, i1, i2] -> [(i0 + i1 + 2i2)]; S2[i0, i1, i2] -> [(i2)] }]" options: "[n] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/min-1-1.st0000644000175000017500000000041212554427055017144 00000000000000domain: "[M, N] -> { S1[i0, i1] : i0 >= 1 and i1 >= 0 and i1 <= M and i1 <= i0 and i1 <= N - i0 }" child: context: "[M, N] -> { [] }" child: schedule: "[M, N] -> [{ S1[i0, i1] -> [(i0)] }, { S1[i0, i1] -> [(i1)] }]" options: "[M, N] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/constbound.st0000644000175000017500000000133612554427055020251 00000000000000domain: "{ S2[i0, 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] : i1 >= 0 and i1 <= 9999 and i2 >= 0 and i2 <= i1 and i1 >= 50i0 and i1 <= 24 + 50i0 }" child: context: "{ [] }" child: schedule: "[{ S1[i0, i1, i2] -> [(i0)]; S2[i0, i1, i2] -> [(i0)] }]" options: "{ separate[i0] }" child: sequence: - filter: "{ S1[i0, i1, i2] }" child: schedule: "[{ S1[i0, i1, i2] -> [(i1)] }, { S1[i0, i1, i2] -> [(i2)] }]" options: "{ separate[i0] }" - filter: "{ S2[i0, i1, i2] }" child: schedule: "[{ S2[i0, i1, i2] -> [(i1)] }, { S2[i0, i1, i2] -> [(i2)] }]" options: "{ separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/classen.c0000644000175000017500000000647412554427055017327 00000000000000if (m >= 1) { if (m == 1) { S1(0, 1, 1, 1); S8(0, 1); } else { S1(0, 1, 1, 1); S4(0, 1, 2, 2, 1, 1, 2, 2); S3(0, 1, 1, 2, 1, 1, 1, 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 (m >= c0 + 2) { S5(c0 - 1, 1, c0, 1, c0, 1, c0 + 1, 1); S1(c0, 1, c0 + 1, 1); S4(c0, 1, c0 + 2, 2, c0 + 1, 1, c0 + 2, 2); S2(c0, 1, c0 + 1, 1, c0 + 1, 1, c0 + 2, 1); S3(c0, 1, c0 + 1, 2, c0 + 1, 1, c0 + 1, 2); } else { 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); } for (int c1 = max(2, -m + c0 + 3); c1 <= min(m - 1, c0); c1 += 1) { S5(c0 - 1, c1, c0, c1, c0 - c1 + 1, c1, c0 - c1 + 2, c1); S6(c0 - 1, c1 - 1, c0, c1, c0 - c1 + 2, c1 - 1, c0 - c1 + 2, c1); S7(c0 - 1, c1 - 1, c0 + 1, c1, c0 - c1 + 2, c1 - 1, c0 - c1 + 3, c1); S1(c0, c1, c0 - c1 + 2, c1); S4(c0, c1, c0 + 2, c1 + 1, c0 - c1 + 2, c1, c0 - c1 + 3, c1 + 1); S2(c0, c1, c0 + 1, c1, c0 - c1 + 2, c1, c0 - c1 + 3, c1); S3(c0, c1, c0 + 1, c1 + 1, c0 - c1 + 2, c1, c0 - c1 + 2, c1 + 1); } 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 (m >= c0 + 2) { 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); 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); S3(c0, c0 + 1, c0 + 1, c0 + 2, 1, c0 + 1, 1, c0 + 2); } else { 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); } for (int c2 = max(1, -m + c0 + 2); c2 <= min(m, c0 + 1); c2 += 1) S8(c0, c2); } 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 c2 = m - 1; c2 <= m; c2 += 1) S8(2 * m - 3, c2); 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.4/isl/test_inputs/codegen/cloog/lux.c0000644000175000017500000000032712413256472016473 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.4/isl/test_inputs/codegen/cloog/forwardsub-3-1-2.c0000644000175000017500000000055712413256472020503 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.4/isl/test_inputs/codegen/cloog/mod.c0000644000175000017500000000011012413256472016430 00000000000000for (int c0 = 0; c0 <= 3; c0 += 1) if ((c0 + 1) % 3 >= 1) S1(c0); cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-QR.st0000644000175000017500000000436212554427055020435 00000000000000domain: "[M, N] -> { S5[i0] : i0 >= 0 and i0 <= -1 + N; S1[i0] : i0 >= 0 and i0 <= -1 + N; S3[i0] : i0 >= 0 and i0 <= -1 + N; S2[i0, i1] : i0 >= 0 and i0 <= -1 + N and i1 >= i0 and i1 <= -1 + M; S6[i0, i1] : i0 >= 0 and i1 >= 1 + i0 and i1 <= -1 + N; S9[i0, i1, i2] : i0 >= 0 and i1 >= 1 + i0 and i1 <= -1 + N and i2 >= i0 and i2 <= -1 + M; S4[i0, i1] : i0 >= 0 and i0 <= -1 + N and i1 >= i0 and i1 <= -1 + M; S8[i0, i1] : i0 >= 0 and i1 >= 1 + i0 and i1 <= -1 + N; S10[i0] : i0 >= 0 and i0 <= -1 + N; S7[i0, i1, i2] : i0 >= 0 and i1 >= 1 + i0 and i1 <= -1 + N and i2 >= i0 and i2 <= -1 + M }" child: context: "[M, N] -> { [] }" child: schedule: "[M, N] -> [{ S3[i0] -> [(1 + i0)]; S10[i0] -> [(1 + i0)]; S5[i0] -> [(1 + i0)]; S7[i0, i1, i2] -> [(2 + i0)]; S9[i0, i1, i2] -> [(2 + i0)]; S2[i0, i1] -> [(1 + i0)]; S4[i0, i1] -> [(1 + i0)]; S8[i0, i1] -> [(2 + i0)]; S1[i0] -> [(i0)]; S6[i0, i1] -> [(2 + i0)] }]" options: "[M, N] -> { separate[i0] }" child: sequence: - filter: "[M, N] -> { S6[i0, i1]; S9[i0, i1, i2]; S8[i0, i1]; S7[i0, i1, i2] }" child: schedule: "[M, N] -> [{ S7[i0, i1, i2] -> [(i1)]; S9[i0, i1, i2] -> [(i1)]; S8[i0, i1] -> [(i1)]; S6[i0, i1] -> [(i1)] }]" options: "[M, N] -> { separate[i0] }" child: sequence: - filter: "[M, N] -> { S6[i0, i1] }" - filter: "[M, N] -> { S7[i0, i1, i2] }" child: schedule: "[M, N] -> [{ S7[i0, i1, i2] -> [(i2)] }]" options: "[M, N] -> { separate[i0] }" - filter: "[M, N] -> { S8[i0, i1] }" - filter: "[M, N] -> { S9[i0, i1, i2] }" child: schedule: "[M, N] -> [{ S9[i0, i1, i2] -> [(i2)] }]" options: "[M, N] -> { separate[i0] }" - filter: "[M, N] -> { S2[i0, i1] }" child: schedule: "[M, N] -> [{ S2[i0, i1] -> [(i1)] }]" options: "[M, N] -> { separate[i0] }" - filter: "[M, N] -> { S3[i0] }" - filter: "[M, N] -> { S4[i0, i1] }" child: schedule: "[M, N] -> [{ S4[i0, i1] -> [(i1)] }]" options: "[M, N] -> { separate[i0] }" - filter: "[M, N] -> { S10[i0] }" - filter: "[M, N] -> { S1[i0] }" - filter: "[M, N] -> { S5[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-lim-lam6.st0000644000175000017500000000132112554427055021521 00000000000000domain: "[M] -> { S1[i0, i1] : i0 >= 0 and i0 <= M and i1 >= 1 and i1 <= M; S2[i0, i1] : i0 >= 1 and i0 <= M and i1 >= 0 and i1 <= M }" child: context: "[M] -> { [] }" child: sequence: - filter: "[M] -> { S1[i0, i1] }" child: schedule: "[M] -> [{ S1[i0, i1] -> [(i0)] }]" options: "[M] -> { separate[i0] }" child: schedule: "[M] -> [{ S1[i0, i1] -> [(i1)] }]" options: "[M] -> { separate[i0] }" - filter: "[M] -> { S2[i0, i1] }" child: schedule: "[M] -> [{ S2[i0, i1] -> [(i1)] }]" options: "[M] -> { separate[i0] }" child: schedule: "[M] -> [{ S2[i0, i1] -> [(i0)] }]" options: "[M] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/multi-stride2.st0000644000175000017500000000041012554427055020567 00000000000000domain: "{ S1[i0, i1, i2] : 2i1 = -1 + i0 and 3i2 = -2 + i0 and i0 >= 0 and i0 <= 100 }" child: context: "{ [] }" child: schedule: "[{ S1[i0, i1, i2] -> [(i0)] }, { S1[i0, i1, i2] -> [(i1)] }, { S1[i0, i1, i2] -> [(i2)] }]" options: "{ separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/emploi.st0000644000175000017500000000073212554427055017357 00000000000000domain: "[m, n] -> { S1[i0] : (i0 >= 1 and i0 <= n and i0 <= 2m) or (i0 >= m and i0 >= 1 and i0 <= n); S2[i0, i1] : i0 >= 1 and i0 <= n and i1 >= 1 and i1 <= m }" child: context: "[m, n] -> { [] }" child: schedule: "[m, n] -> [{ S1[i0] -> [(i0)]; S2[i0, i1] -> [(i0)] }, { S1[i0] -> [(0)]; S2[i0, i1] -> [(i1)] }]" options: "[m, n] -> { separate[i0] }" child: sequence: - filter: "[m, n] -> { S1[i0] }" - filter: "[m, n] -> { S2[i0, i1] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-fusion2.c0000644000175000017500000000043112554427055021265 00000000000000if (N >= 1) { for (int c1 = 1; c1 <= M; c1 += 1) S1(1, c1); for (int c0 = 2; c0 <= N; c0 += 1) { for (int c1 = 1; c1 <= M; c1 += 1) S2(c0 - 1, c1); for (int c1 = 1; c1 <= M; c1 += 1) S1(c0, c1); } for (int c1 = 1; c1 <= M; c1 += 1) S2(N, c1); } cloog-0.18.4/isl/test_inputs/codegen/cloog/test.st0000644000175000017500000000071312554427055017050 00000000000000domain: "[M, N] -> { S1[i0, i1] : i0 >= 1 and i0 <= N and i1 >= 1 and i1 <= M; S2[i0, i0] : i0 >= 3 and i0 <= N }" child: context: "[M, N] -> { [] : N >= M and M >= 4 }" child: schedule: "[M, N] -> [{ S1[i0, i1] -> [(i0)]; S2[i0, i1] -> [(i0)] }, { S1[i0, i1] -> [(i1)]; S2[i0, i1] -> [(i1)] }]" options: "[M, N] -> { separate[i0] }" child: sequence: - filter: "[M, N] -> { S1[i0, i1] }" - filter: "[M, N] -> { S2[i0, i1] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-pingali4.c0000644000175000017500000000030012554427055021402 00000000000000{ for (int c0 = 1; c0 <= M; c0 += 1) for (int c1 = 1; c1 <= M; c1 += 1) S1(c0, c1); for (int c0 = 1; c0 <= M; c0 += 1) for (int c1 = 1; c1 <= M; c1 += 1) S2(c0, c1); } cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-two.st0000644000175000017500000000040412554427055020715 00000000000000domain: "{ S1[i0, i1, i2] : 2i1 = 3 - i0 and 2i2 = 9 + i0 and i0 >= 0 and i0 <= 1 }" child: context: "{ [] }" child: schedule: "[{ S1[i0, i1, i2] -> [(i0)] }, { S1[i0, i1, i2] -> [(i1)] }, { S1[i0, i1, i2] -> [(i2)] }]" options: "{ separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/classen2.c0000644000175000017500000000211212413270107017356 00000000000000for (int c0 = max(max(max(max(max(max(4, 5 * outerTimeTileScatter), 5 * outerProcTileScatter1), 5 * outerProcTileScatter2 + 1), 5 * outerProcTileScatter1 + 5 * outerProcTileScatter2 - N), 10 * outerProcTileScatter2 - N + 1), 10 * outerProcTileScatter1 - 2 * N + 2); c0 <= min(min(min(min(min(min(5 * outerTimeTileScatter + 4, 10 * outerProcTileScatter1 + 4), 5 * outerProcTileScatter1 + 5 * outerProcTileScatter2 + 5), 5 * outerProcTileScatter1 + M + 2), 2 * M + 2 * N - 6), 5 * outerProcTileScatter2 + M + N), 10 * outerProcTileScatter2 + N + 3); c0 += 1) for (int c1 = max(max(max(max(5 * outerProcTileScatter1, 5 * outerProcTileScatter2 + 1), -5 * outerProcTileScatter2 + c0 - 1), -M + c0 + 2), (c0 + 1) / 2 + 2); c1 <= min(min(min(min(5 * outerProcTileScatter1 + 4, 5 * outerProcTileScatter2 + N + 2), -5 * outerProcTileScatter2 + N + c0), c0), N + c0 / 2 - 1); c1 += 1) for (int c2 = max(max(5 * outerProcTileScatter2, -N + c1 + 2), c0 - c1 + 3); c2 <= min(min(5 * outerProcTileScatter2 + 4, c1 - 1), N + c0 - c1); c2 += 1) S1(c0 - c1 + 1, -c0 + c1 + c2 - 2, c1 - c2, c0, c1, c2); cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-pingali1.st0000644000175000017500000000133412554427055021613 00000000000000domain: "[M, N] -> { S2[i0, i1] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= N; S1[i0, i1, i2] : i0 >= 1 and i0 <= M and i1 <= N and i2 >= 1 and i2 <= -1 + i1 }" child: context: "[M, N] -> { [] }" child: schedule: "[M, N] -> [{ S2[i0, i1] -> [(i0)]; S1[i0, i1, i2] -> [(i0)] }]" options: "[M, N] -> { separate[i0] }" child: schedule: "[M, N] -> [{ S2[i0, i1] -> [(-1 + 2i1)]; S1[i0, i1, i2] -> [(i1 + i2)] }]" options: "[M, N] -> { separate[i0] }" child: sequence: - filter: "[M, N] -> { S1[i0, i1, i2] }" child: schedule: "[M, N] -> [{ S1[i0, i1, i2] -> [(i2)] }]" options: "[M, N] -> { separate[i0] }" - filter: "[M, N] -> { S2[i0, i1] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/mod4.c0000644000175000017500000000031512413256472016523 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.4/isl/test_inputs/codegen/cloog/nul_complex1.c0000644000175000017500000000031512554427055020271 00000000000000for (int c0 = 0; c0 <= 5 * n; c0 += 1) for (int c1 = max(-((5 * n - c0 + 1) % 2) - n + c0 + 1, 2 * ((c0 + 2) / 3)); c1 <= min(c0, n + c0 - (n + c0 + 2) / 3); c1 += 2) S1((3 * c1 / 2) - c0, c0 - c1); cloog-0.18.4/isl/test_inputs/codegen/cloog/lineality-2-1-2.st0000644000175000017500000000066212554427055020522 00000000000000domain: "[M] -> { S1[i0, i1] : i0 >= 1 and i1 >= 1 and i0 <= M and i1 <= M; S2[i0, 2 + i0] : i0 >= 1 and i0 <= M }" child: context: "[M] -> { [] : M >= 2 }" child: schedule: "[M] -> [{ S1[i0, i1] -> [(i0)]; S2[i0, i1] -> [(i0)] }, { S1[i0, i1] -> [(i1)]; S2[i0, i1] -> [(i1)] }]" options: "[M] -> { separate[i0] }" child: sequence: - filter: "[M] -> { S1[i0, i1] }" - filter: "[M] -> { S2[i0, i1] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/constbound.c0000644000175000017500000000042612554427055020044 00000000000000for (int c0 = 0; c0 <= 199; c0 += 1) { for (int c1 = 50 * c0; c1 <= 50 * c0 + 24; c1 += 1) for (int c2 = 0; c2 <= c1; c2 += 1) S1(c0, c1, c2); for (int c1 = 50 * c0 + 25; c1 <= 50 * c0 + 49; c1 += 1) for (int c2 = 0; c2 <= c1; c2 += 1) S2(c0, c1, c2); } cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-fusion1.c0000644000175000017500000000022712554427055021267 00000000000000{ for (int c0 = 0; c0 <= M; c0 += 1) S1(c0); for (int c0 = 1; c0 <= M; c0 += 1) S2(c0); for (int c0 = 0; c0 <= M; c0 += 1) S3(c0); } cloog-0.18.4/isl/test_inputs/codegen/cloog/logo.st0000644000175000017500000000066712554427055017041 00000000000000domain: "[M] -> { S1[i0, i1] : i0 >= 1 and i1 <= 7 and i1 >= -1 + i0; S2[i0, i1] : i0 >= 2 and i0 <= 6 and i1 >= 0 and i1 <= 4 }" child: context: "[M] -> { [] }" child: schedule: "[M] -> [{ S1[i0, i1] -> [(i0)]; S2[i0, i1] -> [(i0)] }, { S1[i0, i1] -> [(i1)]; S2[i0, i1] -> [(i1)] }]" options: "[M] -> { separate[i0] }" child: sequence: - filter: "[M] -> { S1[i0, i1] }" - filter: "[M] -> { S2[i0, i1] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/logopar.c0000644000175000017500000000064012413256472017324 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.4/isl/test_inputs/codegen/cloog/otl.st0000644000175000017500000000577612554427055016705 00000000000000domain: "[M, N] -> { S1[outerTimeTileIter, outerProcTileIter1, outerProcTileIter2, innerTimeTileIter, innerProcTileIter1, outerProcTileIter2] : 5outerTimeTileIter <= -7 + 2M + 2N and innerProcTileIter1 >= outerTimeTileIter - outerProcTileIter2 and 10outerProcTileIter2 >= -2 - N + 5outerTimeTileIter and outerProcTileIter2 >= -1 + outerTimeTileIter - outerProcTileIter1 and 2innerProcTileIter1 >= outerTimeTileIter and outerTimeTileIter >= 1 and outerProcTileIter1 >= 1 and 2outerProcTileIter1 >= outerTimeTileIter and outerProcTileIter2 >= 0 and 5outerProcTileIter2 >= 1 - M - N + 5outerTimeTileIter and 5innerProcTileIter1 >= -1 - M + 5outerTimeTileIter and innerTimeTileIter >= outerTimeTileIter and 5outerProcTileIter1 >= -2 - M + 5outerTimeTileIter and innerTimeTileIter >= 1 and 5innerTimeTileIter >= -3 - N + 5outerProcTileIter1 + 5outerProcTileIter2 and 5outerProcTileIter2 <= 4 + N + 5outerTimeTileIter - 5outerProcTileIter1 and innerProcTileIter1 >= 1 and outerProcTileIter2 <= outerTimeTileIter and 5innerTimeTileIter >= -2N + 10outerProcTileIter1 and 5outerProcTileIter1 <= -5 + M + 2N and 10outerProcTileIter1 <= 1 + 2N + 5outerTimeTileIter and 5outerProcTileIter2 >= -1 - N + 5outerProcTileIter1 and innerProcTileIter1 >= outerProcTileIter1 and innerTimeTileIter >= outerProcTileIter1 and outerProcTileIter2 <= outerProcTileIter1 and outerProcTileIter1 <= outerTimeTileIter and 5innerProcTileIter1 <= 4 + N - 5outerProcTileIter2 + 5innerTimeTileIter and 5innerProcTileIter1 <= 5 + N + 5outerTimeTileIter - 5outerProcTileIter2 and 5innerTimeTileIter >= -2 - N + 10outerProcTileIter2 and 5outerProcTileIter2 <= -2 + M + N and 10outerProcTileIter2 <= 3 + N + 5outerTimeTileIter and N >= 4 and innerProcTileIter1 >= outerProcTileIter2 and innerTimeTileIter >= outerProcTileIter2 and M >= 3 and innerProcTileIter1 <= outerTimeTileIter and 5innerTimeTileIter <= -6 + 2M + 2N and innerProcTileIter1 >= -1 - outerProcTileIter2 + innerTimeTileIter and 5innerTimeTileIter <= 3 + N + 10outerProcTileIter2 and innerTimeTileIter <= 1 + outerProcTileIter1 + outerProcTileIter2 and innerProcTileIter1 <= 1 + outerProcTileIter1 and 2innerProcTileIter1 >= innerTimeTileIter and 5innerProcTileIter1 <= 2 + N + 5outerProcTileIter2 and innerTimeTileIter <= 1 + 2outerProcTileIter1 and innerProcTileIter1 <= innerTimeTileIter and 5innerTimeTileIter <= M + N + 5outerProcTileIter2 and 5innerProcTileIter1 >= -2 - M + 5innerTimeTileIter and 10innerProcTileIter1 <= 3 + 2N + 5outerTimeTileIter and innerTimeTileIter <= 1 + outerTimeTileIter and 5innerTimeTileIter <= 3 + M + 5outerProcTileIter1 and 5innerProcTileIter1 <= -4 + M + 2N and 10innerProcTileIter1 <= 2 + 2N + 5innerTimeTileIter }" child: context: "[M, N] -> { [] : M >= 1 and N >= 1 }" child: schedule: "[M, N] -> [{ S1[i0, i1, i2, i3, i4, i5] -> [(i0)] }, { S1[i0, i1, i2, i3, i4, i5] -> [(i1)] }, { S1[i0, i1, i2, i3, i4, i5] -> [(i2)] }, { S1[i0, i1, i2, i3, i4, i5] -> [(i3)] }, { S1[i0, i1, i2, i3, i4, i5] -> [(i4)] }, { S1[i0, i1, i2, i3, i4, i5] -> [(i5)] }]" options: "[M, N] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/constant.st0000644000175000017500000000141412554427055017721 00000000000000domain: "[M] -> { S4[i0] : i0 >= 0 and i0 <= 1023 and i0 <= 1024 + M; S5[i0] : i0 >= 0 and i0 <= 1023 and i0 >= 1025 + M; S3[i0] : i0 >= 0 and i0 <= 1023; S2[i0] : i0 >= 0 and i0 <= 1023 and i0 >= 1025 + M; S1[i0] : i0 >= 0 and i0 <= 1023 and i0 <= 1024 + M; S6[i0] : i0 >= 0 and i0 <= 1023 }" child: context: "[M] -> { [] }" child: schedule: "[M] -> [{ S2[i0] -> [(-1)]; S4[i0] -> [(i0)]; S1[i0] -> [(-1)]; S3[i0] -> [(-1)]; S6[i0] -> [(i0)]; S5[i0] -> [(i0)] }, { S2[i0] -> [(i0)]; S4[i0] -> [(0)]; S1[i0] -> [(i0)]; S3[i0] -> [(i0)]; S6[i0] -> [(0)]; S5[i0] -> [(0)] }]" options: "[M] -> { separate[i0] }" child: sequence: - filter: "[M] -> { S4[i0]; S1[i0] }" - filter: "[M] -> { S5[i0]; S2[i0] }" - filter: "[M] -> { S3[i0]; S6[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/yosr2.st0000644000175000017500000000074012554427055017147 00000000000000domain: "[M] -> { S4[i0, i1] : i0 >= 1 and i0 <= M and i1 >= 1 + i0 and i1 <= M; S3[i0, i1, i2] : i0 >= 1 and i0 <= M and i1 >= 1 + i0 and i1 <= M and i2 >= 1 and i2 <= -1 + i0; S1[i0, i1] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= -1 + i0; S2[i0] : i0 >= 1 and i0 <= M }" child: context: "[M] -> { [] : M >= 2 }" child: schedule: "[M] -> [{ S2[i0] -> [(0)]; S1[i0, i1] -> [(i0)]; S4[i0, i1] -> [(i1)]; S3[i0, i1, i2] -> [(i0)] }]" options: "[M] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-QR.c0000644000175000017500000000226512554427055020231 00000000000000if (N >= 1) { S1(0); if (N == 1) { for (int c1 = 0; c1 < M; c1 += 1) S2(0, c1); S3(0); for (int c1 = 0; c1 < M; c1 += 1) S4(0, c1); S10(0); S5(0); } else { for (int c1 = 0; c1 < M; c1 += 1) S2(0, c1); S3(0); for (int c1 = 0; c1 < M; c1 += 1) S4(0, c1); S10(0); S1(1); S5(0); } for (int c0 = 2; c0 < N; c0 += 1) { for (int c1 = c0 - 1; c1 < N; c1 += 1) { S6(c0 - 2, c1); for (int c2 = c0 - 2; c2 < M; c2 += 1) S7(c0 - 2, c1, c2); S8(c0 - 2, c1); for (int c2 = c0 - 2; c2 < M; c2 += 1) S9(c0 - 2, c1, c2); } for (int c1 = c0 - 1; c1 < M; c1 += 1) S2(c0 - 1, c1); S3(c0 - 1); for (int c1 = c0 - 1; c1 < M; c1 += 1) S4(c0 - 1, c1); S10(c0 - 1); S1(c0); S5(c0 - 1); } if (N >= 2) { S6(N - 2, N - 1); for (int c2 = N - 2; c2 < M; c2 += 1) S7(N - 2, N - 1, c2); S8(N - 2, N - 1); for (int c2 = N - 2; c2 < M; c2 += 1) S9(N - 2, N - 1, c2); for (int c1 = N - 1; c1 < M; c1 += 1) S2(N - 1, c1); S3(N - 1); for (int c1 = N - 1; c1 < M; c1 += 1) S4(N - 1, c1); S10(N - 1); S5(N - 1); } } cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-mg-rprj3.c0000644000175000017500000000157612554427055021354 00000000000000if (M >= 2 && N >= 3) for (int c0 = 2; c0 < O; c0 += 1) { for (int c2 = 2; c2 <= M; c2 += 1) S1(c0, 2, c2); for (int c1 = 3; c1 < N; c1 += 1) { for (int c2 = 2; c2 <= M; c2 += 1) S2(c0, c1 - 1, c2); if (M >= 3) S4(c0, c1 - 1, 2); for (int c2 = 2; c2 < M - 1; c2 += 1) { S3(c0, c1 - 1, c2); S5(c0, c1 - 1, c2); S4(c0, c1 - 1, c2 + 1); } if (M >= 3) { S3(c0, c1 - 1, M - 1); S5(c0, c1 - 1, M - 1); } for (int c2 = 2; c2 <= M; c2 += 1) S1(c0, c1, c2); } for (int c2 = 2; c2 <= M; c2 += 1) S2(c0, N - 1, c2); if (M >= 3) S4(c0, N - 1, 2); for (int c2 = 2; c2 < M - 1; c2 += 1) { S3(c0, N - 1, c2); S5(c0, N - 1, c2); S4(c0, N - 1, c2 + 1); } if (M >= 3) { S3(c0, N - 1, M - 1); S5(c0, N - 1, M - 1); } } cloog-0.18.4/isl/test_inputs/codegen/cloog/equality2.c0000644000175000017500000000070212413271702017570 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 (c1 <= 1008 && c2 + 1999 == 2 * c1) 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 (c2 == 1 && c1 % 2 == 0) S1(c0, c1, 1, 2, c0, (c1 / 2) + 1, c1 - 999, c0, c1 - 999, (c1 / 2) - 499, (c1 / 2) - 499); } cloog-0.18.4/isl/test_inputs/codegen/cloog/dot.c0000644000175000017500000000022612413256472016447 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.4/isl/test_inputs/codegen/cloog/reservoir-pingali5.c0000644000175000017500000000060012554427055021406 00000000000000for (int c0 = 3; c0 < 2 * M; c0 += 1) { for (int c1 = c0 / 2 + 2; c1 <= M; c1 += 1) for (int c3 = c0 / 2 + 1; c3 < min(c0, c1); c3 += 1) S1(c3, c0 - c3, c1); for (int c1 = max(1, -M + c0); c1 < (c0 + 1) / 2; c1 += 1) S2(c0 - c1, c1); for (int c1 = c0 / 2 + 2; c1 <= M; c1 += 1) for (int c3 = c0 / 2 + 1; c3 < min(c0, c1); c3 += 1) S3(c3, c0 - c3, c1); } cloog-0.18.4/isl/test_inputs/codegen/cloog/block3.c0000644000175000017500000000010512413256472017032 00000000000000{ S1(); for (int c0 = 0; c0 <= 1; c0 += 1) S3(c0); S2(); } cloog-0.18.4/isl/test_inputs/codegen/cloog/4-param.c0000644000175000017500000000053312413270107017112 00000000000000{ for (int c0 = m; c0 <= min(n, p - 1); c0 += 1) S1(c0); for (int c0 = p; c0 <= min(m - 1, q); c0 += 1) S2(c0); for (int c0 = max(m, p); c0 <= min(n, q); 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.4/isl/test_inputs/codegen/cloog/basic-bounds-3.c0000644000175000017500000000005512413256472020372 00000000000000for (int c0 = 0; c0 <= M; c0 += 1) S1(c0); cloog-0.18.4/isl/test_inputs/codegen/cloog/0D-1.st0000644000175000017500000000005612554427055016472 00000000000000domain: "{ S1[] }" child: context: "{ [] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/usvd_e_t.st0000644000175000017500000001150312554427055017700 00000000000000domain: "{ S22[i0, i1, -7 + i0] : i0 >= 7 and i1 >= 5 and i1 <= 9 and i0 <= 10; S21[i0, i1, -7 + i0] : i0 <= 10 and i1 >= 4 and i1 <= 8 and i0 >= 7; S4[i0, i1, -1] : i0 <= 8 and i1 >= 1 and i1 <= -4 + i0; S8[i0, i1, 0] : i0 >= 3 and i0 <= 7 and i1 >= 7 and i1 <= 11; S25[i0, i1, 4] : i0 >= 10 and i0 <= 14 and i1 >= 1 and i1 <= 5; S15[i0, i1, i2] : i0 <= 10 and i1 >= 1 and i1 <= 5 and i2 >= 4 and i2 <= -4 + i0; S6[i0, i1, 0] : i0 <= 8 and i1 >= -4 and i1 <= -9 + i0; S16[i0, i1, -6 + i0] : i0 <= 10 and i1 >= 4 and i0 >= 7 and i1 <= -2 + i0; S7[i0, i1, 0] : i0 >= 5 and i1 <= 0 and i1 >= -9 + i0; S1[i0, 0, 0] : i0 >= 0 and i0 <= 4; S2[i0, i1, 0] : i0 >= 0 and i0 <= 4 and i1 >= 0 and i1 <= 4; S26[i0, i1, 3] : i0 >= 10 and i0 <= 14 and i1 >= 1 and i1 <= 5; S10[i0, 4, 0] : i0 >= 7 and i0 <= 10; S12[i0, -2 + i0, i2] : i0 >= 7 and i0 <= 10 and i2 <= 4 and i2 >= -7 + i0; S23[i0, i1, i2] : i0 <= 9 and i1 >= 4 and i1 <= 8 and i2 >= 0 and i2 <= -7 + i0; S13[i0, i1, i2] : i0 <= 10 and i1 >= 4 and i2 <= 4 and i2 >= -7 + i0 and i1 <= -4 + i0; S20[i0, i1, i2] : i0 >= 8 and i1 <= 4 and i2 >= -4 and i2 <= 0 and i1 >= -6 + i0; S24[i0, i1, i2] : i0 >= 8 and i1 >= 4 and i1 <= 8 and i2 <= 3 and i2 >= -7 + i0; S19[i0, i1, i2] : i0 >= 8 and i1 >= 1 and i2 <= 0 and i2 >= -10 + i0 and i1 <= -6 + i0; S11[i0, -3 + i0, i2] : i0 <= 10 and i0 >= 7 and i2 <= 4 and i2 >= -7 + i0; S14[i0, i1, i2] : i0 >= 8 and i1 <= 4 and i2 <= 0 and i2 >= -12 + i0 and i1 >= -6 + i0; S3[i0, 0, 0] : i0 >= 4 and i0 <= 8; S9[i0, 4, 0] : i0 >= 7 and i0 <= 10; S18[i0, i1, i2] : i0 <= 10 and i1 >= 1 and i2 >= 4 and i2 <= -4 + i0 and i1 <= -5 + i0; S5[i0, i1, 0] : i0 >= 4 and i1 <= 4 and i1 >= -4 + i0; S17[i0, i1, -6 + i0] : i0 >= 7 and i1 >= 4 and i0 <= 10 and i1 <= -2 + i0 }" child: context: "{ [] }" child: schedule: "[{ S8[i0, i1, i2] -> [(i0)]; S21[i0, i1, i2] -> [(i0)]; S9[i0, i1, i2] -> [(i0)]; S10[i0, i1, i2] -> [(i0)]; S24[i0, i1, i2] -> [(i0)]; S15[i0, i1, i2] -> [(i0)]; S12[i0, i1, i2] -> [(i0)]; S7[i0, i1, i2] -> [(i0)]; S6[i0, i1, i2] -> [(i0)]; S23[i0, i1, i2] -> [(i0)]; S22[i0, i1, i2] -> [(i0)]; S16[i0, i1, i2] -> [(i0)]; S17[i0, i1, i2] -> [(i0)]; S25[i0, i1, i2] -> [(i0)]; S18[i0, i1, i2] -> [(i0)]; S26[i0, i1, i2] -> [(i0)]; S5[i0, i1, i2] -> [(i0)]; S2[i0, i1, i2] -> [(i0)]; S4[i0, i1, i2] -> [(i0)]; S13[i0, i1, i2] -> [(i0)]; S3[i0, i1, i2] -> [(i0)]; S14[i0, i1, i2] -> [(i0)]; S19[i0, i1, i2] -> [(i0)]; S20[i0, i1, i2] -> [(i0)]; S11[i0, i1, i2] -> [(i0)]; S1[i0, i1, i2] -> [(i0)] }, { S8[i0, i1, i2] -> [(i1)]; S21[i0, i1, i2] -> [(i1)]; S9[i0, i1, i2] -> [(i1)]; S10[i0, i1, i2] -> [(i1)]; S24[i0, i1, i2] -> [(i1)]; S15[i0, i1, i2] -> [(i1)]; S12[i0, i1, i2] -> [(i1)]; S7[i0, i1, i2] -> [(i1)]; S6[i0, i1, i2] -> [(i1)]; S23[i0, i1, i2] -> [(i1)]; S22[i0, i1, i2] -> [(i1)]; S16[i0, i1, i2] -> [(i1)]; S17[i0, i1, i2] -> [(i1)]; S25[i0, i1, i2] -> [(i1)]; S18[i0, i1, i2] -> [(i1)]; S26[i0, i1, i2] -> [(i1)]; S5[i0, i1, i2] -> [(i1)]; S2[i0, i1, i2] -> [(i1)]; S4[i0, i1, i2] -> [(i1)]; S13[i0, i1, i2] -> [(i1)]; S3[i0, i1, i2] -> [(i1)]; S14[i0, i1, i2] -> [(i1)]; S19[i0, i1, i2] -> [(i1)]; S20[i0, i1, i2] -> [(i1)]; S11[i0, i1, i2] -> [(i1)]; S1[i0, i1, i2] -> [(i1)] }, { S8[i0, i1, i2] -> [(i2)]; S21[i0, i1, i2] -> [(i2)]; S9[i0, i1, i2] -> [(i2)]; S10[i0, i1, i2] -> [(i2)]; S24[i0, i1, i2] -> [(i2)]; S15[i0, i1, i2] -> [(i2)]; S12[i0, i1, i2] -> [(i2)]; S7[i0, i1, i2] -> [(i2)]; S6[i0, i1, i2] -> [(i2)]; S23[i0, i1, i2] -> [(i2)]; S22[i0, i1, i2] -> [(i2)]; S16[i0, i1, i2] -> [(i2)]; S17[i0, i1, i2] -> [(i2)]; S25[i0, i1, i2] -> [(i2)]; S18[i0, i1, i2] -> [(i2)]; S26[i0, i1, i2] -> [(i2)]; S5[i0, i1, i2] -> [(i2)]; S2[i0, i1, i2] -> [(i2)]; S4[i0, i1, i2] -> [(i2)]; S13[i0, i1, i2] -> [(i2)]; S3[i0, i1, i2] -> [(i2)]; S14[i0, i1, i2] -> [(i2)]; S19[i0, i1, i2] -> [(i2)]; S20[i0, i1, i2] -> [(i2)]; S11[i0, i1, i2] -> [(i2)]; S1[i0, i1, i2] -> [(i2)] }]" options: "{ separate[i0] }" child: sequence: - filter: "{ S1[i0, i1, i2] }" - filter: "{ S2[i0, i1, i2] }" - filter: "{ S3[i0, i1, i2] }" - filter: "{ S4[i0, i1, i2] }" - filter: "{ S5[i0, i1, i2] }" - filter: "{ S6[i0, i1, i2] }" - filter: "{ S7[i0, i1, i2] }" - filter: "{ S8[i0, i1, i2] }" - filter: "{ S9[i0, i1, i2] }" - filter: "{ S10[i0, i1, i2] }" - filter: "{ S11[i0, i1, i2] }" - filter: "{ S12[i0, i1, i2] }" - filter: "{ S13[i0, i1, i2] }" - filter: "{ S14[i0, i1, i2] }" - filter: "{ S15[i0, i1, i2] }" - filter: "{ S16[i0, i1, i2] }" - filter: "{ S17[i0, i1, i2] }" - filter: "{ S18[i0, i1, i2] }" - filter: "{ S19[i0, i1, i2] }" - filter: "{ S20[i0, i1, i2] }" - filter: "{ S21[i0, i1, i2] }" - filter: "{ S22[i0, i1, i2] }" - filter: "{ S23[i0, i1, i2] }" - filter: "{ S24[i0, i1, i2] }" - filter: "{ S25[i0, i1, i2] }" - filter: "{ S26[i0, i1, i2] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/tiling.st0000644000175000017500000000036712554427055017364 00000000000000domain: "[n] -> { S1[ii, i] : i >= 0 and i <= n and i <= 9 + 10ii and i >= 10ii }" child: context: "[n] -> { [] : n >= 0 }" child: schedule: "[n] -> [{ S1[ii, i] -> [(ii)] }, { S1[ii, i] -> [(i)] }]" options: "[n] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/dealII.st0000644000175000017500000000120312554427055017213 00000000000000domain: "[T_2, T_67, T_66] -> { S1[scat_0] : (scat_0 >= 0 and scat_0 <= -1 + T_2) or (scat_0 <= -T_67 and scat_0 >= 0); S2[scat_0] : (scat_0 >= 0 and scat_0 <= T_66 and scat_0 <= -1 + T_2) or (scat_0 >= 0 and scat_0 <= T_66 and scat_0 <= -1 + T_67) }" child: context: "[T_2, T_67, T_66] -> { [] : T_2 <= 4 and T_2 >= 0 and T_67 <= 4 and T_67 >= 0 }" child: schedule: "[T_2, T_67, T_66] -> [{ S2[scat_0] -> [(scat_0)]; S1[scat_0] -> [(scat_0)] }]" options: "[T_2, T_67, T_66] -> { separate[i0] }" child: sequence: - filter: "[T_2, T_67, T_66] -> { S1[scat_0] }" - filter: "[T_2, T_67, T_66] -> { S2[scat_0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/rectangle.c0000644000175000017500000000017012413270107017612 00000000000000for (int c0 = 0; c0 <= 2 * n; c0 += 1) for (int c1 = max(0, -n + c0); c1 <= min(n, c0); c1 += 1) S1(c1, c0 - c1); cloog-0.18.4/isl/test_inputs/codegen/cloog/gesced.c0000644000175000017500000000071612413256472017117 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.4/isl/test_inputs/codegen/cloog/reservoir-liu-zhuge1.c0000644000175000017500000000160712554427055021700 00000000000000if (M >= 0 && N >= 0) for (int c0 = -4; c0 <= 3 * M + N; c0 += 1) { if (c0 >= 0 && 3 * M + 1 >= c0 && (c0 + 1) % 3 >= 1 && N + 1 >= (c0 + 1) % 3) S2((c0 + 1) / 3, ((c0 + 1) % 3) - 1); for (int c1 = max(-3 * M + c0 - 2, (c0 + 4) % 3); c1 <= min(min(N - 2, c0 - 2), -3 * M + c0 + 3); c1 += 3) S2((c0 - c1 - 2) / 3, c1 + 2); for (int c1 = max(-3 * M + c0 + 4, (c0 + 4) % 3); c1 < min(N - 1, c0 - 1); c1 += 3) { S1((c0 - c1 + 4) / 3, c1); S2((c0 - c1 - 2) / 3, c1 + 2); } if (3 * M + N >= c0 + 4 && c0 >= N + 1 && ((-N + c0) % 3) + N >= 2 && (-N + c0) % 3 >= 1) S1((-N + c0 + 3) / 3 + 1, ((-N + c0) % 3) + N - 2); for (int c1 = max(max(c0 + 1, -3 * M + c0 + 4), (c0 + 4) % 3); c1 <= min(N, c0 + 4); c1 += 3) S1((c0 - c1 + 4) / 3, c1); for (int c1 = max(-3 * M + c0, (c0 + 6) % 3); c1 <= min(N, c0); c1 += 3) S3((c0 - c1) / 3, c1); } cloog-0.18.4/isl/test_inputs/codegen/cloog/basic-bounds-5.c0000644000175000017500000000003112413256472020366 00000000000000S1(1, floord(M + 1, 2)); cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-stride2.c0000644000175000017500000000007312554427055021256 00000000000000for (int c0 = 2; c0 <= M; c0 += 7) S1(c0, (c0 - 2) / 7); cloog-0.18.4/isl/test_inputs/codegen/cloog/0D-3.st0000644000175000017500000000011612554427055016471 00000000000000domain: "[M] -> { S1[] : M >= 0 }" child: context: "[M] -> { [] : M >= 0 }" cloog-0.18.4/isl/test_inputs/codegen/cloog/1point-2.st0000644000175000017500000000031512554427055017440 00000000000000domain: "[M, N] -> { S1[2M, 2 + N] }" child: context: "[M, N] -> { [] }" child: schedule: "[M, N] -> [{ S1[i0, i1] -> [(i0)] }, { S1[i0, i1] -> [(i1)] }]" options: "[M, N] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/gauss.c0000644000175000017500000000032112554427055017002 00000000000000for (int c0 = 1; c0 < M; c0 += 1) for (int c1 = c0 + 1; c1 <= M; c1 += 1) { for (int c3 = 1; c3 < c0; c3 += 1) S1(c0, c3, c1); for (int c3 = c0 + 1; c3 <= M; c3 += 1) S2(c0, c3, c1); } cloog-0.18.4/isl/test_inputs/codegen/cloog/test.c0000644000175000017500000000056512413256472016646 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.4/isl/test_inputs/codegen/cloog/reservoir-loechner5.c0000644000175000017500000000026412554427055021570 00000000000000for (int c0 = 1; c0 <= M; c0 += 1) for (int c1 = 1; c1 <= M; c1 += 1) for (int c2 = 1; c2 <= M; c2 += 1) for (int c3 = 1; c3 <= M; c3 += 1) S1(c1, c2, c0, c3); cloog-0.18.4/isl/test_inputs/codegen/cloog/forwardsub-2-1-2-3.st0000644000175000017500000000143012554427055021040 00000000000000domain: "[M] -> { S4[i0, 0] : i0 >= 2 and M >= 3 and i0 <= M; S3[1, 0] : M >= 3; S2[i0, 1, i2] : i2 >= 1 + i0 and i0 >= 2 and i2 <= M; S1[1, 1, i2] : M >= 3 and i2 <= M and i2 >= 2 }" child: context: "[M] -> { [] : M >= 3 }" child: schedule: "[M] -> [{ S1[i0, i1, i2] -> [(i0)]; S4[i0, i1] -> [(i0)]; S3[i0, i1] -> [(i0)]; S2[i0, i1, i2] -> [(i0)] }, { S1[i0, i1, i2] -> [(i1)]; S4[i0, i1] -> [(i1)]; S3[i0, i1] -> [(i1)]; S2[i0, i1, i2] -> [(i1)] }, { S1[i0, i1, i2] -> [(i2)]; S4[i0, i1] -> [(0)]; S3[i0, i1] -> [(0)]; S2[i0, i1, i2] -> [(i2)] }]" options: "[M] -> { separate[i0] }" child: sequence: - filter: "[M] -> { S1[i0, i1, i2] }" - filter: "[M] -> { S2[i0, i1, i2] }" - filter: "[M] -> { S3[i0, i1] }" - filter: "[M] -> { S4[i0, i1] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-lim-lam4.c0000644000175000017500000000062612554427055021322 00000000000000for (int c0 = 1; c0 < 2 * M - 1; c0 += 1) { for (int c1 = max(-M + 1, -c0 + 1); c1 < 0; c1 += 1) { for (int c3 = max(1, -M + c0 + 1); c3 <= min(M - 1, c0 + c1); c3 += 1) S1(c3, c0 + c1 - c3, -c1); for (int c2 = max(-M + c0 + 1, -c1); c2 < min(M, c0); c2 += 1) S2(c0 - c2, c1 + c2, c2); } for (int c3 = max(1, -M + c0 + 1); c3 <= min(M - 1, c0); c3 += 1) S1(c3, c0 - c3, 0); } cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-loechner3.st0000644000175000017500000000071212554427055021770 00000000000000domain: "[M] -> { S1[i0, i1, i2] : i0 <= M and i1 >= 1 and i1 <= M and i2 >= 1 and i2 <= i0 }" child: context: "[M] -> { [] }" child: schedule: "[M] -> [{ S1[i0, i1, i2] -> [(i0)] }]" options: "[M] -> { separate[i0] }" child: schedule: "[M] -> [{ S1[i0, i1, i2] -> [(i1 + i2)] }]" options: "[M] -> { separate[i0] }" child: schedule: "[M] -> [{ S1[i0, i1, i2] -> [(i1)] }]" options: "[M] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/youcef.c0000644000175000017500000000017012413256472017151 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.4/isl/test_inputs/codegen/cloog/union.st0000644000175000017500000000035712554427055017225 00000000000000domain: "[M] -> { S1[i0] : i0 >= 0 and i0 <= 100 }" child: context: "[M] -> { [] : M >= 1 or M <= -1 }" child: schedule: "[M] -> [{ S1[i0] -> [(i0)] : M <= 10; S1[i0] -> [(-i0)] : M >= 11 }]" options: "[M] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/constant.c0000644000175000017500000000053012413270107017477 00000000000000{ for (int c1 = 0; c1 <= min(1023, M + 1024); c1 += 1) { S1(c1); S3(c1); } for (int c1 = max(0, M + 1025); 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(0, M + 1025); c0 <= 1023; c0 += 1) { S5(c0); S6(c0); } } cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-mg-interp2.c0000644000175000017500000000105412554427055021666 00000000000000{ for (int c0 = 1; c0 < O; c0 += 1) for (int c1 = Q; c1 < N; c1 += 1) for (int c2 = P; c2 < M; c2 += 1) S1(c0, c1, c2); for (int c0 = 1; c0 < O; c0 += 1) for (int c1 = Q; c1 < N; c1 += 1) for (int c2 = 1; c2 < M; c2 += 1) S2(c0, c1, c2); for (int c0 = 1; c0 < O; c0 += 1) for (int c1 = 1; c1 < N; c1 += 1) for (int c2 = P; c2 < M; c2 += 1) S3(c0, c1, c2); for (int c0 = 1; c0 < O; c0 += 1) for (int c1 = 1; c1 < N; c1 += 1) for (int c2 = 1; c2 < M; c2 += 1) S4(c0, c1, c2); } cloog-0.18.4/isl/test_inputs/codegen/cloog/gesced.st0000644000175000017500000000060612554427055017324 00000000000000domain: "[M, N] -> { S3[i0, i1] : i0 >= 1 and i0 <= N and i1 >= 1 and i1 <= M; S1[i0] : i0 >= 1 and i0 <= N; S2[i0, i1] : i0 >= 1 and i0 <= N and i1 >= 1 and i1 <= M }" child: context: "[M, N] -> { [] : N <= M and M >= 2 and N >= 2 }" child: schedule: "[M, N] -> [{ S2[i0, i1] -> [(N + i1)]; S3[i0, i1] -> [(2N + i1)]; S1[i0] -> [(i0)] }]" options: "[M, N] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/lineality-2-1-2.c0000644000175000017500000000041312554427055020310 00000000000000for (int c0 = 1; c0 <= M; c0 += 1) { for (int c1 = 1; c1 <= min(M, c0 + 1); c1 += 1) S1(c0, c1); if (M >= c0 + 2) { S1(c0, c0 + 2); S2(c0, c0 + 2); } for (int c1 = c0 + 3; c1 <= M; c1 += 1) S1(c0, c1); if (c0 + 1 >= M) S2(c0, c0 + 2); } cloog-0.18.4/isl/test_inputs/codegen/cloog/vivien2.c0000644000175000017500000000432512554427055017252 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 >= 5 && 2 * n >= c0 + 3) { S4(c0 - c0 / 2 - 2, c0 / 2 + 2); for (int c2 = 1; c2 < c0 - c0 / 2 - 1; c2 += 1) S5(c0 - c0 / 2 - 1, c0 / 2 + 1, c2); } for (int c1 = -c0 + c0 / 2 + 3; c1 <= min(-1, 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 && c0 >= n + 2) { S6(-n + c0 + 1, n - 1); for (int c2 = 1; c2 < -n + c0; c2 += 1) S5(-n + c0, n, c2); if (c0 == n + 2) { S6(2, n); S1(n + 1); } } else if (c0 + 2 >= 2 * n) 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 <= 4) { S1(c0 - 1); } else if (n + 1 >= c0) { S6(2, c0 - 2); S1(c0 - 1); } if (n + 1 >= c0) S6(1, c0 - 1); } } else S1(1); if (c0 % 2 == 0) S3(c0 / 2); for (int c1 = max(1, -n + c0); 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 - c0 / 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.4/isl/test_inputs/codegen/cloog/dot2.c0000644000175000017500000000042312413270107016517 00000000000000{ for (int c0 = 1; c0 <= min(M, N); 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.4/isl/test_inputs/codegen/cloog/stride.st0000644000175000017500000000036212554427055017363 00000000000000domain: "{ S2[i0, i1] : 3i1 = i0 and i0 >= 3 and i0 <= 100; S1[25] }" child: context: "{ [] }" child: schedule: "[{ S2[i0, i1] -> [(i0)]; S1[i0] -> [(i0)] }, { S2[i0, i1] -> [(i1)]; S1[i0] -> [(0)] }]" options: "{ separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/tiling.c0000644000175000017500000000016512413270107017140 00000000000000for (int c0 = 0; c0 <= n / 10; c0 += 1) for (int c1 = 10 * c0; c1 <= min(n, 10 * c0 + 9); c1 += 1) S1(c0, c1); cloog-0.18.4/isl/test_inputs/codegen/cloog/basic-bounds-1.c0000644000175000017500000000005512413256472020370 00000000000000for (int c0 = 0; c0 <= 2; c0 += 1) S1(c0); cloog-0.18.4/isl/test_inputs/codegen/cloog/equality.st0000644000175000017500000000054112554427055017725 00000000000000domain: "{ S2[i0, 4] : i0 >= 0 and i0 <= 5; S1[i0, 2i0] : i0 >= 0 and i0 <= 5 }" child: context: "{ [] }" child: schedule: "[{ S1[i0, i1] -> [(i0)]; S2[i0, i1] -> [(i0)] }, { S1[i0, i1] -> [(i1)]; S2[i0, i1] -> [(i1)] }]" options: "{ atomic[i0] }" child: sequence: - filter: "{ S1[i0, i1] }" - filter: "{ S2[i0, i1] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-lim-lam1.c0000644000175000017500000000034712554427055021317 00000000000000for (int c0 = -99; c0 <= 100; c0 += 1) { if (c0 >= 1) S2(c0, 1); for (int c1 = max(1, -c0 + 1); c1 <= min(99, -c0 + 100); c1 += 1) { S1(c0 + c1, c1); S2(c0 + c1, c1 + 1); } if (c0 <= 0) S1(c0 + 100, 100); } cloog-0.18.4/isl/test_inputs/codegen/cloog/iftest2.st0000644000175000017500000000047012554427055017451 00000000000000domain: "[M, N] -> { S1[i0, i1] : (i0 >= M and i0 <= N and i1 >= 1 and i1 <= M) or (i0 >= 1 and i0 <= N and i0 <= 2M and i1 >= 1 and i1 <= M) }" child: context: "[M, N] -> { [] }" child: schedule: "[M, N] -> [{ S1[i0, i1] -> [(i0)] }, { S1[i0, i1] -> [(i1)] }]" options: "[M, N] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-cholesky2.st0000644000175000017500000000156612554427055022021 00000000000000domain: "[M] -> { S3[i0, i1, i2] : i0 >= 1 and i1 <= M and i2 >= 1 + i0 and i2 <= i1; S2[i0, i1] : i0 >= 1 and i1 >= 1 + i0 and i1 <= M; S1[i0] : i0 >= 1 and i0 <= M }" child: context: "[M] -> { [] }" child: schedule: "[M] -> [{ S1[i0] -> [(-1 + 3i0)]; S3[i0, i1, i2] -> [(-1 + i0 + i1 + i2)]; S2[i0, i1] -> [(-2 + 2i0 + i1)] }]" options: "[M] -> { separate[i0] }" child: sequence: - filter: "[M] -> { S1[i0] }" - filter: "[M] -> { S3[i0, i1, i2] }" child: schedule: "[M] -> [{ S3[i0, i1, i2] -> [(i1)] }]" options: "[M] -> { separate[i0] }" child: schedule: "[M] -> [{ S3[i0, i1, i2] -> [(i2)] }]" options: "[M] -> { separate[i0] }" - filter: "[M] -> { S2[i0, i1] }" child: schedule: "[M] -> [{ S2[i0, i1] -> [(i1)] }]" options: "[M] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/min-3-1.c0000644000175000017500000000015212413270107016727 00000000000000for (int c0 = 0; c0 <= min(10, M); c0 += 1) for (int c1 = 0; c1 <= min(10, M); c1 += 1) S1(c0, c1); cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-two.c0000644000175000017500000000001512413256472020504 00000000000000S1(1, 1, 5); cloog-0.18.4/isl/test_inputs/codegen/cloog/singleton.c0000644000175000017500000000002412413256472017657 00000000000000{ S2(); S1(); } cloog-0.18.4/isl/test_inputs/codegen/cloog/stride3.st0000644000175000017500000000031012554427055017437 00000000000000domain: "[m, n] -> { S1[i] : i >= 1 and i <= n and i >= m }" child: context: "[m, n] -> { [] }" child: schedule: "[m, n] -> [{ S1[i0] -> [(50i0)] }]" options: "[m, n] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/logo.c0000644000175000017500000000062412413256472016623 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.4/isl/test_inputs/codegen/cloog/reservoir-lim-lam6.c0000644000175000017500000000030012554427055021311 00000000000000{ for (int c0 = 0; c0 <= M; c0 += 1) for (int c1 = 1; c1 <= M; c1 += 1) S1(c0, c1); for (int c0 = 0; c0 <= M; c0 += 1) for (int c1 = 1; c1 <= M; c1 += 1) S2(c1, c0); } cloog-0.18.4/isl/test_inputs/codegen/cloog/square+triangle-1-1-2-3.st0000644000175000017500000000067312554427055021772 00000000000000domain: "[M] -> { S1[i0, i1] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= M; S2[i0, i1] : i1 >= 2 and i1 <= i0 and i0 <= M }" child: context: "[M] -> { [] : M >= 1 }" child: schedule: "[M] -> [{ S1[i0, i1] -> [(i0)]; S2[i0, i1] -> [(i0)] }, { S1[i0, i1] -> [(i1)]; S2[i0, i1] -> [(i1)] }]" options: "[M] -> { separate[i0] }" child: sequence: - filter: "[M] -> { S1[i0, i1] }" - filter: "[M] -> { S2[i0, i1] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/iftest.c0000644000175000017500000000005512413256472017157 00000000000000for (int c0 = 1; c0 <= n; c0 += 1) S1(c0); cloog-0.18.4/isl/test_inputs/codegen/cloog/iftest2.c0000644000175000017500000000013012413256472017233 00000000000000for (int c0 = 1; c0 <= N; c0 += 1) for (int c1 = 1; c1 <= M; c1 += 1) S1(c0, c1); cloog-0.18.4/isl/test_inputs/codegen/cloog/equality.c0000644000175000017500000000030412413256472017513 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.4/isl/test_inputs/codegen/cloog/0D-2.c0000644000175000017500000000002412413256472016257 00000000000000if (M >= 0) S1(); cloog-0.18.4/isl/test_inputs/codegen/cloog/yosr2.c0000644000175000017500000000047712413256472016747 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.4/isl/test_inputs/codegen/cloog/reservoir-mg-interp.c0000644000175000017500000000510612554427055021606 00000000000000{ if (N >= 2) for (int c0 = 1; c0 < O; c0 += 1) { for (int c3 = 1; c3 <= M; c3 += 1) S1(c0, 1, c3); for (int c3 = 1; c3 < M; c3 += 1) { S6(c0, 1, c3); S7(c0, 1, c3); } if (N >= 3) { for (int c3 = 1; c3 <= M; c3 += 1) S3(c0, 1, c3); for (int c3 = 1; c3 <= M; c3 += 1) S1(c0, 2, c3); for (int c3 = 1; c3 < M; c3 += 1) { S6(c0, 2, c3); S7(c0, 2, c3); } for (int c3 = 1; c3 < M; c3 += 1) S11(c0, 1, c3); } else { for (int c3 = 1; c3 <= M; c3 += 1) S3(c0, 1, c3); for (int c3 = 1; c3 < M; c3 += 1) S11(c0, 1, c3); } for (int c1 = 3; c1 < 2 * N - 4; c1 += 2) { for (int c3 = 1; c3 < M; c3 += 1) S10(c0, (c1 - 1) / 2, c3); for (int c3 = 1; c3 <= M; c3 += 1) S3(c0, (c1 + 1) / 2, c3); for (int c3 = 1; c3 <= M; c3 += 1) S1(c0, (c1 + 3) / 2, c3); for (int c3 = 1; c3 < M; c3 += 1) { S6(c0, (c1 + 3) / 2, c3); S7(c0, (c1 + 3) / 2, c3); } for (int c3 = 1; c3 < M; c3 += 1) S11(c0, (c1 + 1) / 2, c3); } if (N >= 3) { for (int c3 = 1; c3 < M; c3 += 1) S10(c0, N - 2, c3); for (int c3 = 1; c3 <= M; c3 += 1) S3(c0, N - 1, c3); for (int c3 = 1; c3 < M; c3 += 1) S11(c0, N - 1, c3); } for (int c3 = 1; c3 < M; c3 += 1) S10(c0, N - 1, c3); } for (int c0 = 1; c0 < O; c0 += 1) for (int c1 = 1; c1 < N; c1 += 1) { for (int c3 = 1; c3 <= M; c3 += 1) S2(c0, c1, c3); for (int c3 = 1; c3 < M; c3 += 1) S8(c0, c1, c3); for (int c3 = 1; c3 < M; c3 += 1) S9(c0, c1, c3); } for (int c0 = 1; c0 < O; c0 += 1) for (int c1 = 1; c1 < N; c1 += 1) for (int c2 = 1; c2 < M; c2 += 1) S4(c0, c1, c2); for (int c0 = 1; c0 < O; c0 += 1) for (int c1 = 1; c1 < N; c1 += 1) for (int c2 = 1; c2 < M; c2 += 1) S5(c0, c1, c2); for (int c0 = R; c0 < O; c0 += 1) for (int c1 = Q; c1 < N; c1 += 1) for (int c2 = P; c2 < M; c2 += 1) S12(c0, c1, c2); for (int c0 = R; c0 < O; c0 += 1) for (int c1 = Q; c1 < N; c1 += 1) for (int c2 = 1; c2 < M; c2 += 1) S13(c0, c1, c2); for (int c0 = R; c0 < O; c0 += 1) for (int c1 = 1; c1 < N; c1 += 1) for (int c2 = P; c2 < M; c2 += 1) S14(c0, c1, c2); for (int c0 = R; c0 < O; c0 += 1) for (int c1 = 1; c1 < N; c1 += 1) for (int c2 = 1; c2 < M; c2 += 1) S15(c0, c1, c2); } cloog-0.18.4/isl/test_inputs/codegen/cloog/unroll2.st0000644000175000017500000000030512554427055017463 00000000000000domain: "[n] -> { S1[i] : i >= n and i <= 1 + n and n <= 9 and i >= 0 }" child: context: "[n] -> { [] }" child: schedule: "[n] -> [{ S1[i] -> [(i)] }]" options: "[n] -> { unroll[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/wavefront.c0000644000175000017500000000017412413270107017665 00000000000000for (int c0 = 2; c0 <= n + m; c0 += 1) for (int c1 = max(1, -m + c0); c1 <= min(n, c0 - 1); c1 += 1) S1(c1, c0 - c1); cloog-0.18.4/isl/test_inputs/codegen/cloog/mod2.c0000644000175000017500000000011012413256472016512 00000000000000for (int c0 = 0; c0 <= 3; c0 += 1) if ((c0 + 1) % 3 >= 1) S1(c0); cloog-0.18.4/isl/test_inputs/codegen/cloog/esced.st0000644000175000017500000000064612554427055017161 00000000000000domain: "[n, m] -> { S1[i0] : i0 >= 1 and i0 <= m; S2[i0, i1] : i0 >= 1 and i0 <= m and i1 >= 1 and i1 <= n }" child: context: "[n, m] -> { [] }" child: schedule: "[n, m] -> [{ S2[i0, i1] -> [(i0)]; S1[i0] -> [(i0)] }, { S2[i0, i1] -> [(i1)]; S1[i0] -> [(0)] }]" options: "[n, m] -> { separate[i0] }" child: sequence: - filter: "[n, m] -> { S1[i0] }" - filter: "[n, m] -> { S2[i0, i1] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/guide.st0000644000175000017500000000062012554427055017163 00000000000000domain: "[M, N] -> { S1[i0] : (i0 >= 1 and i0 <= N and i0 <= 2M) or (i0 >= M and i0 >= 1 and i0 <= N); S2[i0] : i0 >= 1 + N and i0 <= 2N }" child: context: "[M, N] -> { [] }" child: schedule: "[M, N] -> [{ S2[i0] -> [(i0)]; S1[i0] -> [(i0)] }]" options: "[M, N] -> { separate[i0] }" child: sequence: - filter: "[M, N] -> { S1[i0] }" - filter: "[M, N] -> { S2[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/param-split.c0000644000175000017500000000015312413271702020102 00000000000000for (int c0 = 0; c0 <= (M <= 0 ? 0 : M); c0 += 1) { if (M >= c0) S1(c0); if (c0 == 0) S2(0); } cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-fusion2.st0000644000175000017500000000122712554427055021475 00000000000000domain: "[M, N] -> { S1[i0, i1] : i0 >= 1 and i0 <= N and i1 >= 1 and i1 <= M; S2[i0, i1] : i0 >= 1 and i0 <= N and i1 >= 1 and i1 <= M }" child: context: "[M, N] -> { [] }" child: schedule: "[M, N] -> [{ S1[i0, i1] -> [(i0)]; S2[i0, i1] -> [(1 + i0)] }]" options: "[M, N] -> { separate[i0] }" child: sequence: - filter: "[M, N] -> { S2[i0, i1] }" child: schedule: "[M, N] -> [{ S2[i0, i1] -> [(i1)] }]" options: "[M, N] -> { separate[i0] }" - filter: "[M, N] -> { S1[i0, i1] }" child: schedule: "[M, N] -> [{ S1[i0, i1] -> [(i1)] }]" options: "[M, N] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-lim-lam5.st0000644000175000017500000000202312554427055021520 00000000000000domain: "[M] -> { S1[i0, i1] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= M; S3[i0, i1] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= M; S2[i0, i1] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= M }" child: context: "[M] -> { [] }" child: sequence: - filter: "[M] -> { S1[i0, i1] }" child: schedule: "[M] -> [{ S1[i0, i1] -> [(i0)] }]" options: "[M] -> { separate[i0] }" child: schedule: "[M] -> [{ S1[i0, i1] -> [(i1)] }]" options: "[M] -> { separate[i0] }" - filter: "[M] -> { S2[i0, i1] }" child: schedule: "[M] -> [{ S2[i0, i1] -> [(i0)] }]" options: "[M] -> { separate[i0] }" child: schedule: "[M] -> [{ S2[i0, i1] -> [(i1)] }]" options: "[M] -> { separate[i0] }" - filter: "[M] -> { S3[i0, i1] }" child: schedule: "[M] -> [{ S3[i0, i1] -> [(i0)] }]" options: "[M] -> { separate[i0] }" child: schedule: "[M] -> [{ S3[i0, i1] -> [(i1)] }]" options: "[M] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-lim-lam2.st0000644000175000017500000000170112554427055021517 00000000000000domain: "[M, N] -> { S3[i0, i1] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= -1 + N; S1[i0] : i0 >= 1 and i0 <= M; S2[i0, i1] : i0 >= 1 and i0 <= M and i1 >= 2 and i1 <= N }" child: context: "[M, N] -> { [] : M >= 1 and N >= 1 }" child: sequence: - filter: "[M, N] -> { S1[i0] }" child: schedule: "[M, N] -> [{ S1[i0] -> [(i0)] }]" options: "[M, N] -> { separate[i0] }" - filter: "[M, N] -> { S2[i0, i1] }" child: schedule: "[M, N] -> [{ S2[i0, i1] -> [(i0)] }]" options: "[M, N] -> { separate[i0] }" child: schedule: "[M, N] -> [{ S2[i0, i1] -> [(i1)] }]" options: "[M, N] -> { separate[i0] }" - filter: "[M, N] -> { S3[i0, i1] }" child: schedule: "[M, N] -> [{ S3[i0, i1] -> [(i0)] }]" options: "[M, N] -> { separate[i0] }" child: schedule: "[M, N] -> [{ S3[i0, i1] -> [(i1)] }]" options: "[M, N] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/basic-bounds-4.st0000644000175000017500000000027712554427055020610 00000000000000domain: "[M] -> { S1[i0] : i0 >= 0 and i0 <= 1 + M }" child: context: "[M] -> { [] : M >= 0 }" child: schedule: "[M] -> [{ S1[i0] -> [(i0)] }]" options: "[M] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/darte.c0000644000175000017500000000102312413270107016743 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) - 1); 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) - 1, (-c0 + c1) / 2, c2); } if (c0 >= 1) for (int c2 = 1; c2 <= n; c2 += 1) S2(n, n - c0 + 1, c2); } cloog-0.18.4/isl/test_inputs/codegen/cloog/thomasset.c0000644000175000017500000000060112413270107017654 00000000000000{ for (int c0 = 0; c0 <= floord(n - 1, 3); c0 += 1) for (int c2 = 3 * c0 + 1; c2 <= min(n, 3 * c0 + 3); 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.4/isl/test_inputs/codegen/cloog/christian.c0000644000175000017500000000033012554427055017644 00000000000000for (int c0 = -N + 1; c0 <= N; c0 += 1) { for (int c1 = max(0, c0); c1 < min(N, N + c0); c1 += 1) S1(c1, -c0 + c1); for (int c1 = max(0, c0 - 1); c1 < min(N, N + c0 - 1); c1 += 1) S2(c1, -c0 + c1 + 1); } cloog-0.18.4/isl/test_inputs/codegen/cloog/classen.st0000644000175000017500000001020012554427055017511 00000000000000domain: "[m] -> { S2[coordT1, coordP1, 1 + coordT1, coordP1, 2 + coordT1 - coordP1, coordP1, 3 + coordT1 - coordP1, coordP1] : m >= 1 and coordT1 <= -3 + 2m and coordT1 >= 0 and coordP1 <= 1 + coordT1 and coordP1 <= m and coordP1 >= 3 - m + coordT1 and coordP1 >= 1; S4[coordT1, coordP1, 2 + coordT1, 1 + coordP1, 2 + coordT1 - coordP1, coordP1, 3 + coordT1 - coordP1, 1 + coordP1] : m >= 1 and coordT1 <= -4 + 2m and coordT1 >= 0 and coordP1 <= 1 + coordT1 and coordP1 <= -1 + m and coordP1 >= 3 - m + coordT1 and coordP1 >= 1; S6[coordT1, coordP1, 1 + coordT1, 1 + coordP1, 2 + coordT1 - coordP1, coordP1, 2 + coordT1 - coordP1, 1 + coordP1] : m >= 1 and coordT1 <= -3 + 2m and coordT1 >= 0 and coordP1 <= 1 + coordT1 and coordP1 <= -1 + m and coordP1 >= 2 - m + coordT1 and coordP1 >= 1; S1[coordT1, coordP1, 2 + coordT1 - coordP1, coordP1] : m >= 1 and coordP1 >= 2 - m + coordT1 and coordP1 <= 1 + coordT1 and coordP1 <= m and coordP1 >= 1; S8[coordT1, coordP1] : coordT1 <= -2 + 2m and coordT1 >= 0 and coordP1 <= 1 + coordT1 and coordP1 <= m and coordP1 >= 2 - m + coordT1 and coordP1 >= 1; S5[coordT1, coordP1, 1 + coordT1, coordP1, 2 + coordT1 - coordP1, coordP1, 3 + coordT1 - coordP1, coordP1] : m >= 1 and coordT1 <= -3 + 2m and coordT1 >= 0 and coordP1 <= 1 + coordT1 and coordP1 <= m and coordP1 >= 3 - m + coordT1 and coordP1 >= 1; S7[coordT1, coordP1, 2 + coordT1, 1 + coordP1, 2 + coordT1 - coordP1, coordP1, 3 + coordT1 - coordP1, 1 + coordP1] : m >= 1 and coordT1 <= -4 + 2m and coordT1 >= 0 and coordP1 <= 1 + coordT1 and coordP1 <= -1 + m and coordP1 >= 3 - m + coordT1 and coordP1 >= 1; S3[coordT1, coordP1, 1 + coordT1, 1 + coordP1, 2 + coordT1 - coordP1, coordP1, 2 + coordT1 - coordP1, 1 + coordP1] : m >= 1 and coordT1 <= -3 + 2m and coordT1 >= 0 and coordP1 <= 1 + coordT1 and coordP1 <= -1 + m and coordP1 >= 2 - m + coordT1 and coordP1 >= 1 }" child: context: "[m] -> { [] : m >= 0 }" child: schedule: "[m] -> [{ S7[i0, i1, i2, i3, i4, i5, i6, i7] -> [(1 + i0)]; S4[i0, i1, i2, i3, i4, i5, i6, i7] -> [(i0)]; S8[i0, i1] -> [(i0)]; S3[i0, i1, i2, i3, i4, i5, i6, i7] -> [(i0)]; S1[i0, i1, i2, i3] -> [(i0)]; S2[i0, i1, i2, i3, i4, i5, i6, i7] -> [(i0)]; S5[i0, i1, i2, i3, i4, i5, i6, i7] -> [(1 + i0)]; S6[i0, i1, i2, i3, i4, i5, i6, i7] -> [(1 + i0)] }]" options: "[m] -> { separate[i0] }" child: sequence: - filter: "[m] -> { S2[i0, i1, i2, i3, i4, i5, i6, i7]; S6[i0, i1, i2, i3, i4, i5, i6, i7]; S4[i0, i1, i2, i3, i4, i5, i6, i7]; S1[i0, i1, i2, i3]; S7[i0, i1, i2, i3, i4, i5, i6, i7]; S5[i0, i1, i2, i3, i4, i5, i6, i7]; S3[i0, i1, i2, i3, i4, i5, i6, i7] }" child: schedule: "[m] -> [{ S7[i0, i1, i2, i3, i4, i5, i6, i7] -> [(i3)]; S4[i0, i1, i2, i3, i4, i5, i6, i7] -> [(i1)]; S3[i0, i1, i2, i3, i4, i5, i6, i7] -> [(i1)]; S1[i0, i1, i2, i3] -> [(i1)]; S2[i0, i1, i2, i3, i4, i5, i6, i7] -> [(i1)]; S5[i0, i1, i2, i3, i4, i5, i6, i7] -> [(i3)]; S6[i0, i1, i2, i3, i4, i5, i6, i7] -> [(i3)] }]" options: "[m] -> { separate[i0] }" child: sequence: - filter: "[m] -> { S6[i0, i1, i2, i3, i4, i5, i6, i7]; S5[i0, i1, i2, i3, i4, i5, i6, i7]; S7[i0, i1, i2, i3, i4, i5, i6, i7] }" child: schedule: "[m] -> [{ S7[i0, i1, i2, i3, i4, i5, i6, i7] -> [(i4)]; S5[i0, i1, i2, i3, i4, i5, i6, i7] -> [(i4)]; S6[i0, i1, i2, i3, i4, i5, i6, i7] -> [(i4)] }, { S7[i0, i1, i2, i3, i4, i5, i6, i7] -> [(i5)]; S5[i0, i1, i2, i3, i4, i5, i6, i7] -> [(i5)]; S6[i0, i1, i2, i3, i4, i5, i6, i7] -> [(i5)] }]" options: "[m] -> { separate[i0] }" - filter: "[m] -> { S1[i0, i1, i2, i3] }" - filter: "[m] -> { S2[i0, i1, i2, i3, i4, i5, i6, i7]; S4[i0, i1, i2, i3, i4, i5, i6, i7]; S3[i0, i1, i2, i3, i4, i5, i6, i7] }" child: schedule: "[m] -> [{ S4[i0, i1, i2, i3, i4, i5, i6, i7] -> [(i4)]; S3[i0, i1, i2, i3, i4, i5, i6, i7] -> [(i4)]; S2[i0, i1, i2, i3, i4, i5, i6, i7] -> [(i4)] }, { S4[i0, i1, i2, i3, i4, i5, i6, i7] -> [(i5)]; S3[i0, i1, i2, i3, i4, i5, i6, i7] -> [(i5)]; S2[i0, i1, i2, i3, i4, i5, i6, i7] -> [(i5)] }]" options: "[m] -> { separate[i0] }" - filter: "[m] -> { S8[i0, i1] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/min-4-1.c0000644000175000017500000000007712413270107016736 00000000000000for (int c0 = max(-M, -N); c0 <= min(N, O); c0 += 1) S1(c0); cloog-0.18.4/isl/test_inputs/codegen/cloog/0D-3.c0000644000175000017500000000000612413256472016260 00000000000000S1(); cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-pingali4.st0000644000175000017500000000133212554427055021614 00000000000000domain: "[M] -> { S1[i0, i1] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= M; S2[i0, i1] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= M }" child: context: "[M] -> { [] : M >= 2 }" child: sequence: - filter: "[M] -> { S1[i0, i1] }" child: schedule: "[M] -> [{ S1[i0, i1] -> [(i0)] }]" options: "[M] -> { separate[i0] }" child: schedule: "[M] -> [{ S1[i0, i1] -> [(i1)] }]" options: "[M] -> { separate[i0] }" - filter: "[M] -> { S2[i0, i1] }" child: schedule: "[M] -> [{ S2[i0, i1] -> [(i0)] }]" options: "[M] -> { separate[i0] }" child: schedule: "[M] -> [{ S2[i0, i1] -> [(i1)] }]" options: "[M] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-lim-lam3.c0000644000175000017500000000110612554427055021313 00000000000000for (int c0 = 5; c0 <= 5 * M; c0 += 1) { for (int c1 = max(2, floord(-M + c0, 4)); c1 < min(-((5 * M - c0 + 1) % 2) + M, (c0 + 1) / 3 - 2); c1 += 1) for (int c2 = max(1, -M - c1 + (M + c0) / 2 - 2); c2 < min(c1, -2 * c1 + (c0 + c1) / 2 - 2); c2 += 1) S1(c0 - 2 * c1 - 2 * c2 - 5, c1, c2); for (int c1 = max(1, floord(-M + c0, 4)); c1 < (c0 + 1) / 5; c1 += 1) S2(c0 - 4 * c1 - 3, c1); if (c0 % 5 == 0) S4(c0 / 5); for (int c1 = max(-3 * M - c0 + 3 * ((M + c0) / 2) + 1, -((c0 - 1) % 3) + 3); c1 < (c0 + 1) / 5; c1 += 3) S3((c0 - 2 * c1 - 1) / 3, c1); } cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-mg-rprj3.st0000644000175000017500000000405012554427055021546 00000000000000domain: "[M, N, O, P, Q, R] -> { S2[i0, i1, i2] : i0 >= 2 and i0 <= -1 + O and i1 >= 2 and i1 <= -1 + N and i2 >= 2 and i2 <= M; S4[i0, i1, i2] : i0 >= 2 and i0 <= -1 + O and i1 >= 2 and i1 <= -1 + N and i2 >= 2 and i2 <= -1 + M; S1[i0, i1, i2] : i0 >= 2 and i0 <= -1 + O and i1 >= 2 and i1 <= -1 + N and i2 >= 2 and i2 <= M; S5[i0, i1, i2] : i0 >= 2 and i0 <= -1 + O and i1 >= 2 and i1 <= -1 + N and i2 >= 2 and i2 <= -1 + M; S3[i0, i1, i2] : i0 >= 2 and i0 <= -1 + O and i1 >= 2 and i1 <= -1 + N and i2 >= 2 and i2 <= -1 + M }" child: context: "[M, N, O, P, Q, R] -> { [] }" child: schedule: "[M, N, O, P, Q, R] -> [{ S5[i0, i1, i2] -> [(i0)]; S3[i0, i1, i2] -> [(i0)]; S4[i0, i1, i2] -> [(i0)]; S1[i0, i1, i2] -> [(i0)]; S2[i0, i1, i2] -> [(i0)] }]" options: "[M, N, O, P, Q, R] -> { separate[i0] }" child: schedule: "[M, N, O, P, Q, R] -> [{ S5[i0, i1, i2] -> [(1 + i1)]; S3[i0, i1, i2] -> [(1 + i1)]; S4[i0, i1, i2] -> [(1 + i1)]; S1[i0, i1, i2] -> [(i1)]; S2[i0, i1, i2] -> [(1 + i1)] }]" options: "[M, N, O, P, Q, R] -> { separate[i0] }" child: sequence: - filter: "[M, N, O, P, Q, R] -> { S2[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R] -> [{ S2[i0, i1, i2] -> [(i2)] }]" options: "[M, N, O, P, Q, R] -> { separate[i0] }" - filter: "[M, N, O, P, Q, R] -> { S4[i0, i1, i2]; S5[i0, i1, i2]; S3[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R] -> [{ S5[i0, i1, i2] -> [(i2)]; S3[i0, i1, i2] -> [(i2)]; S4[i0, i1, i2] -> [(-1 + i2)] }]" options: "[M, N, O, P, Q, R] -> { separate[i0] }" child: sequence: - filter: "[M, N, O, P, Q, R] -> { S3[i0, i1, i2] }" - filter: "[M, N, O, P, Q, R] -> { S5[i0, i1, i2] }" - filter: "[M, N, O, P, Q, R] -> { S4[i0, i1, i2] }" - filter: "[M, N, O, P, Q, R] -> { S1[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R] -> [{ S1[i0, i1, i2] -> [(i2)] }]" options: "[M, N, O, P, Q, R] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/lux.st0000644000175000017500000000137712554427055016710 00000000000000domain: "[M] -> { S1[i0, i0, M, i3] : i0 >= 1 and i0 <= M and i3 >= 1 + i0 and i3 <= M; S2[i0, i1, i2, i2, i0] : i1 >= 1 and i1 <= M and i2 >= 1 + i1 and i2 <= M and i1 <= -1 + i0 and i0 <= M }" child: context: "[M] -> { [] }" child: schedule: "[M] -> [{ S1[i0, i1, i2, i3] -> [(i0)]; S2[i0, i1, i2, i3, i4] -> [(i0)] }, { S1[i0, i1, i2, i3] -> [(i1)]; S2[i0, i1, i2, i3, i4] -> [(i1)] }, { S1[i0, i1, i2, i3] -> [(i2)]; S2[i0, i1, i2, i3, i4] -> [(i2)] }, { S1[i0, i1, i2, i3] -> [(i3)]; S2[i0, i1, i2, i3, i4] -> [(i3)] }, { S1[i0, i1, i2, i3] -> [(0)]; S2[i0, i1, i2, i3, i4] -> [(i4)] }]" options: "[M] -> { separate[i0] }" child: sequence: - filter: "[M] -> { S1[i0, i1, i2, i3] }" - filter: "[M] -> { S2[i0, i1, i2, i3, i4] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/youcef.st0000644000175000017500000000075212554427055017366 00000000000000domain: "{ S2[i0, i1] : i0 >= 0 and i0 <= 5 and i1 >= i0 and i1 <= 5; S1[i0, i0] : i0 >= 0 and i0 <= 5; S3[i0, 5] : i0 >= 0 and i0 <= 5 }" child: context: "{ [] }" child: schedule: "[{ S3[i0, i1] -> [(i0)]; S1[i0, i1] -> [(i0)]; S2[i0, i1] -> [(i0)] }, { S3[i0, i1] -> [(i1)]; S1[i0, i1] -> [(i1)]; S2[i0, i1] -> [(i1)] }]" options: "{ separate[i0] }" child: sequence: - filter: "{ S1[i0, i1] }" - filter: "{ S2[i0, i1] }" - filter: "{ S3[i0, i1] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/lu.st0000644000175000017500000000060412554427055016510 00000000000000domain: "[n] -> { S1[i0, i1] : i0 >= 1 and i0 <= n and i1 >= 1 + i0 and i1 <= n; S2[i0, i1, i2] : i0 >= 1 and i0 <= n and i1 >= 1 + i0 and i1 <= n and i2 >= 1 + i0 and i2 <= n }" child: context: "[n] -> { [] }" child: schedule: "[n] -> [{ S2[i0, i1, i2] -> [(i2)]; S1[i0, i1] -> [(i0)] }, { S2[i0, i1, i2] -> [(i1)]; S1[i0, i1] -> [(n)] }]" options: "[n] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/jacobi-shared.st0000644000175000017500000000275512554427055020574 00000000000000domain: "[T, N, h0, b0, b1, g0, g1, g2, g3, g4, t0, t1] -> { S1[i0, i1] : exists (e0 = floor((-1 + h0)/2), e1 = floor((-32b0 + g1)/2048), e2 = floor((-32b1 + g2)/1024), e3 = floor((-15 - t0 + i0)/16), e4 = floor((-31 - t1 + i1)/32): g0 = h0 and 2e0 = -1 + h0 and 2048e1 = -32b0 + g1 and 1024e2 = -32b1 + g2 and 16e3 = -15 - t0 + i0 and 32e4 = -31 - 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) }" child: context: "[T, N, h0, b0, b1, g0, g1, g2, g3, g4, t0, t1] -> { [] : exists (e0 = floor((-32b0 + g1)/2048), e1 = floor((-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) }" child: schedule: "[T, N, h0, b0, b1, g0, g1, g2, g3, g4, t0, t1] -> [{ S1[i0, i1] -> [(1 - g1 + i0)] }, { S1[i0, i1] -> [(1 - g2 + i1)] }, { S1[i0, i1] -> [(t0)] }, { S1[i0, i1] -> [(t1)] }]" options: "[T, N, h0, b0, b1, g0, g1, g2, g3, g4, t0, t1] -> { separate[x] : x >= 3 }" cloog-0.18.4/isl/test_inputs/codegen/cloog/swim.st0000644000175000017500000005376212554427055017064 00000000000000domain: "[M, N, O, P, Q, R] -> { S40[i0, i1, i2] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q and i2 >= 1 and i2 <= R; S106[i0, i1, i2] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q and i2 >= 1 and i2 <= R; S99[i0] : M = 1 and i0 >= 2 and i0 <= P; S83[i0] : M = 1 and i0 >= 2 and i0 <= P; S86[i0] : M = 1 and i0 >= 2 and i0 <= P; S56[i0] : M = 1 and i0 >= 2 and i0 <= P; S124[i0] : M = 1 and i0 >= 2 and i0 <= P; S66[i0, i1] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= R; S46[i0, i1] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q; S64[i0, i1] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q; S22[] : M = 1; S15[] : M = 1; S30[i0, i1] : M = 1 and i0 >= 1 and i0 <= N and i1 >= 1 and i1 <= N; S14[] : M = 1; S12[] : M = 1; S87[i0] : M = 1 and i0 >= 2 and i0 <= P; S110[i0, i1] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q; S73[i0] : M = 1 and i0 >= 2 and i0 <= P; S44[i0, i1] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q; S31[i0] : M = 1 and i0 >= 1 and i0 <= N; S118[i0, i1] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= R; S8[] : M = 1; S125[i0] : M = 1 and i0 >= 2 and i0 <= P; S63[i0, i1] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q; S25[] : M = 1; S51[i0, i1] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= R; S91[i0] : M = 1 and i0 >= 2 and i0 <= P; S84[i0] : M = 1 and i0 >= 2 and i0 <= P; S35[] : M = 1 and O <= 1; S97[i0, i1, i2] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= N and i2 >= 1 and i2 <= N; S75[i0] : M = 1 and i0 >= 2 and i0 <= P; S19[] : M = 1; S50[i0, i1] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= R; S114[i0, i1] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= R; S13[] : M = 1; S72[i0] : M = 1 and i0 >= 2 and i0 <= P; S78[i0] : M = 1 and i0 >= 2 and i0 <= P; S39[i0] : M = 1 and i0 >= 2 and i0 <= P; S102[i0, i1, i2] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q and i2 >= 1 and i2 <= R; S107[i0, i1, i2] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q and i2 >= 1 and i2 <= R; S68[i0] : M = 1 and i0 >= 2 and i0 <= P; S32[] : M = 1; S41[i0, i1, i2] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q and i2 >= 1 and i2 <= R; S69[i0] : M = 1 and i0 >= 2 and i0 <= P; S3[] : M = 1; S100[i0] : M = 1 and i0 >= 2 and i0 <= P; S11[] : M = 1; S76[i0] : M = 1 and i0 >= 2 and i0 <= P; S88[i0] : M = 1 and i0 >= 2 and i0 <= P; S49[i0, i1] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= R; S45[i0, i1] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q; S10[] : M = 1; S80[i0] : M = 1 and i0 >= 2 and i0 <= P; S61[i0, i1, i2] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q and i2 >= 1 and i2 <= R; S67[i0, i1] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= R; S70[i0] : M = 1 and i0 >= 2 and i0 <= P; S29[i0, i1] : M = 1 and i0 >= 1 and i0 <= N and i1 >= 1 and i1 <= N; S60[i0, i1, i2] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q and i2 >= 1 and i2 <= R; S21[] : M = 1; S92[i0] : M = 1 and i0 >= 2 and i0 <= P; S47[i0, i1] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q; S24[] : M = 1; S16[] : M = 1; S105[i0, i1, i2] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q and i2 >= 1 and i2 <= R; S18[] : M = 1; S48[i0, i1] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= R; S5[] : M = 1; S113[i0, i1] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q; S7[] : M = 1; S38[i0] : M = 1 and i0 >= 2 and i0 <= P; S54[i0] : M = 1 and i0 >= 2 and i0 <= P; S109[i0, i1] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q; S23[] : M = 1; S82[i0] : M = 1 and i0 >= 2 and i0 <= P; S59[i0, i1, i2] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q and i2 >= 1 and i2 <= R; S77[i0] : M = 1 and i0 >= 2 and i0 <= P; S101[i0] : M = 1 and i0 >= 2 and i0 <= P; S37[] : M = 1; S71[i0] : M = 1 and i0 >= 2 and i0 <= P; S121[i0] : M = 1 and i0 >= 2 and i0 <= P; S115[i0, i1] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= R; S104[i0, i1, i2] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q and i2 >= 1 and i2 <= R; S94[i0] : M = 1 and i0 >= 2 and i0 <= P; S6[] : M = 1; S43[i0, i1, i2] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q and i2 >= 1 and i2 <= R; S1[] : M = 1; S98[i0, i1] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= N; S55[i0] : M = 1 and i0 >= 2 and i0 <= P; S58[i0] : M = 1 and i0 >= 2 and i0 <= P; S42[i0, i1, i2] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q and i2 >= 1 and i2 <= R; S89[i0] : M = 1 and i0 >= 2 and i0 <= P; S53[i0] : M = 1 and i0 >= 2 and i0 <= P; S111[i0, i1] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q; S52[i0] : M = 1 and i0 >= 2 and i0 <= P; S85[i0] : M = 1 and i0 >= 2 and i0 <= P; S26[] : M = 1; S79[i0] : M = 1 and i0 >= 2 and i0 <= P; S81[i0] : M = 1 and i0 >= 2 and i0 <= P; S57[i0] : M = 1 and i0 >= 2 and i0 <= P; S4[] : M = 1; S123[i0] : M = 1 and i0 >= 2 and i0 <= P; S36[] : M = 1; S65[i0, i1] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= R; S34[] : M = 1; S119[i0, i1] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= R; S9[] : M = 1; S28[i0, i1] : M = 1 and i0 >= 1 and i0 <= N and i1 >= 1 and i1 <= N; S20[] : M = 1; S117[i0, i1] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= R; S112[i0, i1] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q; S103[i0, i1, i2] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q and i2 >= 1 and i2 <= R; S17[] : M = 1; S96[i0, i1, i2] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= N and i2 >= 1 and i2 <= N; S95[i0, i1, i2] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= N and i2 >= 1 and i2 <= N; S62[i0, i1] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q; S90[i0] : M = 1 and i0 >= 2 and i0 <= P; S120[i0] : M = 1 and i0 >= 2 and i0 <= P; S116[i0, i1] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= R; S108[i0, i1] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q; S74[i0] : M = 1 and i0 >= 2 and i0 <= P; S93[i0] : M = 1 and i0 >= 2 and i0 <= P; S2[] : M = 1; S27[] : M = 1; S122[i0] : M = 1 and i0 >= 2 and i0 <= P; S33[] : M = 1 }" child: context: "[M, N, O, P, Q, R] -> { [] }" child: sequence: - filter: "[M, N, O, P, Q, R] -> { S1[] }" - filter: "[M, N, O, P, Q, R] -> { S2[] }" - filter: "[M, N, O, P, Q, R] -> { S3[] }" - filter: "[M, N, O, P, Q, R] -> { S4[] }" - filter: "[M, N, O, P, Q, R] -> { S5[] }" - filter: "[M, N, O, P, Q, R] -> { S6[] }" - filter: "[M, N, O, P, Q, R] -> { S7[] }" - filter: "[M, N, O, P, Q, R] -> { S8[] }" - filter: "[M, N, O, P, Q, R] -> { S9[] }" - filter: "[M, N, O, P, Q, R] -> { S10[] }" - filter: "[M, N, O, P, Q, R] -> { S11[] }" - filter: "[M, N, O, P, Q, R] -> { S12[] }" - filter: "[M, N, O, P, Q, R] -> { S13[] }" - filter: "[M, N, O, P, Q, R] -> { S14[] }" - filter: "[M, N, O, P, Q, R] -> { S15[] }" - filter: "[M, N, O, P, Q, R] -> { S16[] }" - filter: "[M, N, O, P, Q, R] -> { S17[] }" - filter: "[M, N, O, P, Q, R] -> { S18[] }" - filter: "[M, N, O, P, Q, R] -> { S19[] }" - filter: "[M, N, O, P, Q, R] -> { S20[] }" - filter: "[M, N, O, P, Q, R] -> { S21[] }" - filter: "[M, N, O, P, Q, R] -> { S22[] }" - filter: "[M, N, O, P, Q, R] -> { S23[] }" - filter: "[M, N, O, P, Q, R] -> { S24[] }" - filter: "[M, N, O, P, Q, R] -> { S25[] }" - filter: "[M, N, O, P, Q, R] -> { S26[] }" - filter: "[M, N, O, P, Q, R] -> { S27[] }" - filter: "[M, N, O, P, Q, R] -> { S30[i0, i1]; S28[i0, i1]; S31[i0]; S29[i0, i1] }" child: schedule: "[M, N, O, P, Q, R] -> [{ S31[i0] -> [(i0)]; S29[i0, i1] -> [(i0)]; S30[i0, i1] -> [(i0)]; S28[i0, i1] -> [(i0)] }]" options: "[M, N, O, P, Q, R] -> { separate[i0] }" child: sequence: - filter: "[M, N, O, P, Q, R] -> { S30[i0, i1]; S28[i0, i1]; S29[i0, i1] }" child: schedule: "[M, N, O, P, Q, R] -> [{ S29[i0, i1] -> [(i1)]; S30[i0, i1] -> [(i1)]; S28[i0, i1] -> [(i1)] }]" options: "[M, N, O, P, Q, R] -> { separate[i0] }" child: sequence: - filter: "[M, N, O, P, Q, R] -> { S28[i0, i1] }" - filter: "[M, N, O, P, Q, R] -> { S29[i0, i1] }" - filter: "[M, N, O, P, Q, R] -> { S30[i0, i1] }" - filter: "[M, N, O, P, Q, R] -> { S31[i0] }" - filter: "[M, N, O, P, Q, R] -> { S32[] }" - filter: "[M, N, O, P, Q, R] -> { S33[] }" - filter: "[M, N, O, P, Q, R] -> { S34[] }" - filter: "[M, N, O, P, Q, R] -> { S35[] }" - filter: "[M, N, O, P, Q, R] -> { S36[] }" - filter: "[M, N, O, P, Q, R] -> { S37[] }" - filter: "[M, N, O, P, Q, R] -> { S58[i0]; S116[i0, i1]; S120[i0]; S106[i0, i1, i2]; S102[i0, i1, i2]; S114[i0, i1]; S113[i0, i1]; S122[i0]; S83[i0]; S103[i0, i1, i2]; S71[i0]; S50[i0, i1]; S98[i0, i1]; S65[i0, i1]; S82[i0]; S109[i0, i1]; S51[i0, i1]; S60[i0, i1, i2]; S91[i0]; S78[i0]; S101[i0]; S123[i0]; S111[i0, i1]; S97[i0, i1, i2]; S67[i0, i1]; S117[i0, i1]; S88[i0]; S79[i0]; S46[i0, i1]; S56[i0]; S45[i0, i1]; S74[i0]; S49[i0, i1]; S75[i0]; S115[i0, i1]; S119[i0, i1]; S42[i0, i1, i2]; S57[i0]; S62[i0, i1]; S99[i0]; S107[i0, i1, i2]; S100[i0]; S104[i0, i1, i2]; S70[i0]; S89[i0]; S125[i0]; S44[i0, i1]; S93[i0]; S90[i0]; S84[i0]; S105[i0, i1, i2]; S95[i0, i1, i2]; S66[i0, i1]; S77[i0]; S38[i0]; S41[i0, i1, i2]; S92[i0]; S87[i0]; S47[i0, i1]; S108[i0, i1]; S54[i0]; S76[i0]; S112[i0, i1]; S80[i0]; S55[i0]; S39[i0]; S59[i0, i1, i2]; S121[i0]; S86[i0]; S110[i0, i1]; S48[i0, i1]; S68[i0]; S53[i0]; S72[i0]; S85[i0]; S52[i0]; S69[i0]; S61[i0, i1, i2]; S43[i0, i1, i2]; S124[i0]; S73[i0]; S81[i0]; S63[i0, i1]; S118[i0, i1]; S96[i0, i1, i2]; S40[i0, i1, i2]; S94[i0]; S64[i0, i1] }" child: schedule: "[M, N, O, P, Q, R] -> [{ S99[i0] -> [(i0)]; S97[i0, i1, i2] -> [(i0)]; S53[i0] -> [(i0)]; S101[i0] -> [(i0)]; S60[i0, i1, i2] -> [(i0)]; S40[i0, i1, i2] -> [(i0)]; S103[i0, i1, i2] -> [(i0)]; S55[i0] -> [(i0)]; S89[i0] -> [(i0)]; S56[i0] -> [(i0)]; S87[i0] -> [(i0)]; S115[i0, i1] -> [(i0)]; S123[i0] -> [(i0)]; S88[i0] -> [(i0)]; S70[i0] -> [(i0)]; S59[i0, i1, i2] -> [(i0)]; S52[i0] -> [(i0)]; S54[i0] -> [(i0)]; S63[i0, i1] -> [(i0)]; S92[i0] -> [(i0)]; S93[i0] -> [(i0)]; S119[i0, i1] -> [(i0)]; S76[i0] -> [(i0)]; S57[i0] -> [(i0)]; S44[i0, i1] -> [(i0)]; S79[i0] -> [(i0)]; S61[i0, i1, i2] -> [(i0)]; S69[i0] -> [(i0)]; S117[i0, i1] -> [(i0)]; S121[i0] -> [(i0)]; S84[i0] -> [(i0)]; S83[i0] -> [(i0)]; S43[i0, i1, i2] -> [(i0)]; S98[i0, i1] -> [(i0)]; S78[i0] -> [(i0)]; S114[i0, i1] -> [(i0)]; S66[i0, i1] -> [(i0)]; S77[i0] -> [(i0)]; S109[i0, i1] -> [(i0)]; S42[i0, i1, i2] -> [(i0)]; S58[i0] -> [(i0)]; S71[i0] -> [(i0)]; S68[i0] -> [(i0)]; S116[i0, i1] -> [(i0)]; S81[i0] -> [(i0)]; S125[i0] -> [(i0)]; S80[i0] -> [(i0)]; S73[i0] -> [(i0)]; S110[i0, i1] -> [(i0)]; S72[i0] -> [(i0)]; S51[i0, i1] -> [(i0)]; S122[i0] -> [(i0)]; S38[i0] -> [(i0)]; S39[i0] -> [(i0)]; S90[i0] -> [(i0)]; S113[i0, i1] -> [(i0)]; S46[i0, i1] -> [(i0)]; S47[i0, i1] -> [(i0)]; S96[i0, i1, i2] -> [(i0)]; S45[i0, i1] -> [(i0)]; S49[i0, i1] -> [(i0)]; S118[i0, i1] -> [(i0)]; S50[i0, i1] -> [(i0)]; S102[i0, i1, i2] -> [(i0)]; S112[i0, i1] -> [(i0)]; S86[i0] -> [(i0)]; S124[i0] -> [(i0)]; S41[i0, i1, i2] -> [(i0)]; S100[i0] -> [(i0)]; S104[i0, i1, i2] -> [(i0)]; S75[i0] -> [(i0)]; S62[i0, i1] -> [(i0)]; S85[i0] -> [(i0)]; S105[i0, i1, i2] -> [(i0)]; S82[i0] -> [(i0)]; S111[i0, i1] -> [(i0)]; S48[i0, i1] -> [(i0)]; S65[i0, i1] -> [(i0)]; S120[i0] -> [(i0)]; S107[i0, i1, i2] -> [(i0)]; S106[i0, i1, i2] -> [(i0)]; S95[i0, i1, i2] -> [(i0)]; S108[i0, i1] -> [(i0)]; S91[i0] -> [(i0)]; S67[i0, i1] -> [(i0)]; S74[i0] -> [(i0)]; S64[i0, i1] -> [(i0)]; S94[i0] -> [(i0)] }]" options: "[M, N, O, P, Q, R] -> { separate[i0] }" child: sequence: - filter: "[M, N, O, P, Q, R] -> { S38[i0] }" - filter: "[M, N, O, P, Q, R] -> { S39[i0] }" - filter: "[M, N, O, P, Q, R] -> { S40[i0, i1, i2]; S41[i0, i1, i2]; S43[i0, i1, i2]; S42[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R] -> [{ S43[i0, i1, i2] -> [(i1)]; S41[i0, i1, i2] -> [(i1)]; S40[i0, i1, i2] -> [(i1)]; S42[i0, i1, i2] -> [(i1)] }]" options: "[M, N, O, P, Q, R] -> { separate[i0] }" child: schedule: "[M, N, O, P, Q, R] -> [{ S43[i0, i1, i2] -> [(i2)]; S41[i0, i1, i2] -> [(i2)]; S40[i0, i1, i2] -> [(i2)]; S42[i0, i1, i2] -> [(i2)] }]" options: "[M, N, O, P, Q, R] -> { separate[i0] }" child: sequence: - filter: "[M, N, O, P, Q, R] -> { S40[i0, i1, i2] }" - filter: "[M, N, O, P, Q, R] -> { S41[i0, i1, i2] }" - filter: "[M, N, O, P, Q, R] -> { S42[i0, i1, i2] }" - filter: "[M, N, O, P, Q, R] -> { S43[i0, i1, i2] }" - filter: "[M, N, O, P, Q, R] -> { S46[i0, i1]; S45[i0, i1]; S44[i0, i1]; S47[i0, i1] }" child: schedule: "[M, N, O, P, Q, R] -> [{ S47[i0, i1] -> [(i1)]; S46[i0, i1] -> [(i1)]; S44[i0, i1] -> [(i1)]; S45[i0, i1] -> [(i1)] }]" options: "[M, N, O, P, Q, R] -> { separate[i0] }" child: sequence: - filter: "[M, N, O, P, Q, R] -> { S44[i0, i1] }" - filter: "[M, N, O, P, Q, R] -> { S45[i0, i1] }" - filter: "[M, N, O, P, Q, R] -> { S46[i0, i1] }" - filter: "[M, N, O, P, Q, R] -> { S47[i0, i1] }" - filter: "[M, N, O, P, Q, R] -> { S51[i0, i1]; S49[i0, i1]; S50[i0, i1]; S48[i0, i1] }" child: schedule: "[M, N, O, P, Q, R] -> [{ S51[i0, i1] -> [(i1)]; S49[i0, i1] -> [(i1)]; S48[i0, i1] -> [(i1)]; S50[i0, i1] -> [(i1)] }]" options: "[M, N, O, P, Q, R] -> { separate[i0] }" child: sequence: - filter: "[M, N, O, P, Q, R] -> { S48[i0, i1] }" - filter: "[M, N, O, P, Q, R] -> { S49[i0, i1] }" - filter: "[M, N, O, P, Q, R] -> { S50[i0, i1] }" - filter: "[M, N, O, P, Q, R] -> { S51[i0, i1] }" - filter: "[M, N, O, P, Q, R] -> { S52[i0] }" - filter: "[M, N, O, P, Q, R] -> { S53[i0] }" - filter: "[M, N, O, P, Q, R] -> { S54[i0] }" - filter: "[M, N, O, P, Q, R] -> { S55[i0] }" - filter: "[M, N, O, P, Q, R] -> { S56[i0] }" - filter: "[M, N, O, P, Q, R] -> { S57[i0] }" - filter: "[M, N, O, P, Q, R] -> { S58[i0] }" - filter: "[M, N, O, P, Q, R] -> { S60[i0, i1, i2]; S59[i0, i1, i2]; S61[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R] -> [{ S61[i0, i1, i2] -> [(i1)]; S59[i0, i1, i2] -> [(i1)]; S60[i0, i1, i2] -> [(i1)] }]" options: "[M, N, O, P, Q, R] -> { separate[i0] }" child: schedule: "[M, N, O, P, Q, R] -> [{ S61[i0, i1, i2] -> [(i2)]; S59[i0, i1, i2] -> [(i2)]; S60[i0, i1, i2] -> [(i2)] }]" options: "[M, N, O, P, Q, R] -> { separate[i0] }" child: sequence: - filter: "[M, N, O, P, Q, R] -> { S59[i0, i1, i2] }" - filter: "[M, N, O, P, Q, R] -> { S60[i0, i1, i2] }" - filter: "[M, N, O, P, Q, R] -> { S61[i0, i1, i2] }" - filter: "[M, N, O, P, Q, R] -> { S62[i0, i1]; S63[i0, i1]; S64[i0, i1] }" child: schedule: "[M, N, O, P, Q, R] -> [{ S64[i0, i1] -> [(i1)]; S62[i0, i1] -> [(i1)]; S63[i0, i1] -> [(i1)] }]" options: "[M, N, O, P, Q, R] -> { separate[i0] }" child: sequence: - filter: "[M, N, O, P, Q, R] -> { S62[i0, i1] }" - filter: "[M, N, O, P, Q, R] -> { S63[i0, i1] }" - filter: "[M, N, O, P, Q, R] -> { S64[i0, i1] }" - filter: "[M, N, O, P, Q, R] -> { S65[i0, i1]; S66[i0, i1]; S67[i0, i1] }" child: schedule: "[M, N, O, P, Q, R] -> [{ S66[i0, i1] -> [(i1)]; S65[i0, i1] -> [(i1)]; S67[i0, i1] -> [(i1)] }]" options: "[M, N, O, P, Q, R] -> { separate[i0] }" child: sequence: - filter: "[M, N, O, P, Q, R] -> { S65[i0, i1] }" - filter: "[M, N, O, P, Q, R] -> { S66[i0, i1] }" - filter: "[M, N, O, P, Q, R] -> { S67[i0, i1] }" - filter: "[M, N, O, P, Q, R] -> { S68[i0] }" - filter: "[M, N, O, P, Q, R] -> { S69[i0] }" - filter: "[M, N, O, P, Q, R] -> { S70[i0] }" - filter: "[M, N, O, P, Q, R] -> { S71[i0] }" - filter: "[M, N, O, P, Q, R] -> { S72[i0] }" - filter: "[M, N, O, P, Q, R] -> { S73[i0] }" - filter: "[M, N, O, P, Q, R] -> { S74[i0] }" - filter: "[M, N, O, P, Q, R] -> { S75[i0] }" - filter: "[M, N, O, P, Q, R] -> { S76[i0] }" - filter: "[M, N, O, P, Q, R] -> { S77[i0] }" - filter: "[M, N, O, P, Q, R] -> { S78[i0] }" - filter: "[M, N, O, P, Q, R] -> { S79[i0] }" - filter: "[M, N, O, P, Q, R] -> { S80[i0] }" - filter: "[M, N, O, P, Q, R] -> { S81[i0] }" - filter: "[M, N, O, P, Q, R] -> { S82[i0] }" - filter: "[M, N, O, P, Q, R] -> { S83[i0] }" - filter: "[M, N, O, P, Q, R] -> { S84[i0] }" - filter: "[M, N, O, P, Q, R] -> { S85[i0] }" - filter: "[M, N, O, P, Q, R] -> { S86[i0] }" - filter: "[M, N, O, P, Q, R] -> { S87[i0] }" - filter: "[M, N, O, P, Q, R] -> { S88[i0] }" - filter: "[M, N, O, P, Q, R] -> { S89[i0] }" - filter: "[M, N, O, P, Q, R] -> { S90[i0] }" - filter: "[M, N, O, P, Q, R] -> { S91[i0] }" - filter: "[M, N, O, P, Q, R] -> { S92[i0] }" - filter: "[M, N, O, P, Q, R] -> { S93[i0] }" - filter: "[M, N, O, P, Q, R] -> { S94[i0] }" - filter: "[M, N, O, P, Q, R] -> { S96[i0, i1, i2]; S98[i0, i1]; S97[i0, i1, i2]; S95[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R] -> [{ S98[i0, i1] -> [(i1)]; S95[i0, i1, i2] -> [(i1)]; S96[i0, i1, i2] -> [(i1)]; S97[i0, i1, i2] -> [(i1)] }]" options: "[M, N, O, P, Q, R] -> { separate[i0] }" child: sequence: - filter: "[M, N, O, P, Q, R] -> { S96[i0, i1, i2]; S97[i0, i1, i2]; S95[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R] -> [{ S95[i0, i1, i2] -> [(i2)]; S96[i0, i1, i2] -> [(i2)]; S97[i0, i1, i2] -> [(i2)] }]" options: "[M, N, O, P, Q, R] -> { separate[i0] }" child: sequence: - filter: "[M, N, O, P, Q, R] -> { S95[i0, i1, i2] }" - filter: "[M, N, O, P, Q, R] -> { S96[i0, i1, i2] }" - filter: "[M, N, O, P, Q, R] -> { S97[i0, i1, i2] }" - filter: "[M, N, O, P, Q, R] -> { S98[i0, i1] }" - filter: "[M, N, O, P, Q, R] -> { S99[i0] }" - filter: "[M, N, O, P, Q, R] -> { S100[i0] }" - filter: "[M, N, O, P, Q, R] -> { S101[i0] }" - filter: "[M, N, O, P, Q, R] -> { S107[i0, i1, i2]; S105[i0, i1, i2]; S102[i0, i1, i2]; S104[i0, i1, i2]; S106[i0, i1, i2]; S103[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R] -> [{ S102[i0, i1, i2] -> [(i1)]; S103[i0, i1, i2] -> [(i1)]; S104[i0, i1, i2] -> [(i1)]; S107[i0, i1, i2] -> [(i1)]; S106[i0, i1, i2] -> [(i1)]; S105[i0, i1, i2] -> [(i1)] }]" options: "[M, N, O, P, Q, R] -> { separate[i0] }" child: schedule: "[M, N, O, P, Q, R] -> [{ S102[i0, i1, i2] -> [(i2)]; S103[i0, i1, i2] -> [(i2)]; S104[i0, i1, i2] -> [(i2)]; S107[i0, i1, i2] -> [(i2)]; S106[i0, i1, i2] -> [(i2)]; S105[i0, i1, i2] -> [(i2)] }]" options: "[M, N, O, P, Q, R] -> { separate[i0] }" child: sequence: - filter: "[M, N, O, P, Q, R] -> { S102[i0, i1, i2] }" - filter: "[M, N, O, P, Q, R] -> { S103[i0, i1, i2] }" - filter: "[M, N, O, P, Q, R] -> { S104[i0, i1, i2] }" - filter: "[M, N, O, P, Q, R] -> { S105[i0, i1, i2] }" - filter: "[M, N, O, P, Q, R] -> { S106[i0, i1, i2] }" - filter: "[M, N, O, P, Q, R] -> { S107[i0, i1, i2] }" - filter: "[M, N, O, P, Q, R] -> { S113[i0, i1]; S112[i0, i1]; S108[i0, i1]; S111[i0, i1]; S110[i0, i1]; S109[i0, i1] }" child: schedule: "[M, N, O, P, Q, R] -> [{ S110[i0, i1] -> [(i1)]; S112[i0, i1] -> [(i1)]; S111[i0, i1] -> [(i1)]; S113[i0, i1] -> [(i1)]; S109[i0, i1] -> [(i1)]; S108[i0, i1] -> [(i1)] }]" options: "[M, N, O, P, Q, R] -> { separate[i0] }" child: sequence: - filter: "[M, N, O, P, Q, R] -> { S108[i0, i1] }" - filter: "[M, N, O, P, Q, R] -> { S109[i0, i1] }" - filter: "[M, N, O, P, Q, R] -> { S110[i0, i1] }" - filter: "[M, N, O, P, Q, R] -> { S111[i0, i1] }" - filter: "[M, N, O, P, Q, R] -> { S112[i0, i1] }" - filter: "[M, N, O, P, Q, R] -> { S113[i0, i1] }" - filter: "[M, N, O, P, Q, R] -> { S119[i0, i1]; S114[i0, i1]; S117[i0, i1]; S115[i0, i1]; S118[i0, i1]; S116[i0, i1] }" child: schedule: "[M, N, O, P, Q, R] -> [{ S115[i0, i1] -> [(i1)]; S116[i0, i1] -> [(i1)]; S118[i0, i1] -> [(i1)]; S117[i0, i1] -> [(i1)]; S119[i0, i1] -> [(i1)]; S114[i0, i1] -> [(i1)] }]" options: "[M, N, O, P, Q, R] -> { separate[i0] }" child: sequence: - filter: "[M, N, O, P, Q, R] -> { S114[i0, i1] }" - filter: "[M, N, O, P, Q, R] -> { S115[i0, i1] }" - filter: "[M, N, O, P, Q, R] -> { S116[i0, i1] }" - filter: "[M, N, O, P, Q, R] -> { S117[i0, i1] }" - filter: "[M, N, O, P, Q, R] -> { S118[i0, i1] }" - filter: "[M, N, O, P, Q, R] -> { S119[i0, i1] }" - filter: "[M, N, O, P, Q, R] -> { S120[i0] }" - filter: "[M, N, O, P, Q, R] -> { S121[i0] }" - filter: "[M, N, O, P, Q, R] -> { S122[i0] }" - filter: "[M, N, O, P, Q, R] -> { S123[i0] }" - filter: "[M, N, O, P, Q, R] -> { S124[i0] }" - filter: "[M, N, O, P, Q, R] -> { S125[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/sor1d.c0000644000175000017500000000146412554427055016721 00000000000000if (M >= 1 && N >= 3) for (int c0 = -1; c0 <= (3 * M + N - 5) / 100; c0 += 1) { for (int c1 = max(max(0, c0 - (2 * M + N + 95) / 100 + 1), floord(-N + 100 * c0 + 106, 300)); c1 <= min(min(c0, M / 100), (c0 + 1) / 3); c1 += 1) for (int c2 = max(200 * c1 - 3, 100 * c0 - 100 * c1); c2 <= min(min(2 * M + N - 5, 100 * c0 - 100 * c1 + 99), N + 200 * c1 + 193); c2 += 1) { if (c1 >= 1 && N + 200 * c1 >= c2 + 7) S3(c0 - c1, c1 - 1, c1, 100 * c1 - 1, -200 * c1 + c2 + 6); for (int c3 = max(max(1, 100 * c1), -N + (N + c2) / 2 + 3); c3 <= min(min(M, 100 * c1 + 99), c2 / 2 + 1); c3 += 1) S1(c0 - c1, c1, c3, c2 - 2 * c3 + 4); if (M >= 100 * c1 + 100 && c2 >= 200 * c1 + 197) S2(c0 - c1, c1, c1 + 1, 100 * c1 + 99, -200 * c1 + c2 - 194); } S4(c0); } cloog-0.18.4/isl/test_inputs/codegen/cloog/mxm-shared.c0000644000175000017500000000020412554427055017725 00000000000000if (N >= g0 + t1 + 1 && t1 <= 7 && g4 % 4 == 0) for (int c0 = t0; c0 <= min(127, N - g1 - 1); c0 += 16) S1(g0 + t1, g1 + c0); cloog-0.18.4/isl/test_inputs/codegen/cloog/block.c0000644000175000017500000000004612413256472016753 00000000000000{ S1(); S3(0); S2(); S3(1); } cloog-0.18.4/isl/test_inputs/codegen/cloog/basic-bounds-2.st0000644000175000017500000000017712554427055020605 00000000000000domain: "{ S1[0] }" child: context: "{ [] }" child: schedule: "[{ S1[i0] -> [(i0)] }]" options: "{ separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/durbin_e_s.st0000644000175000017500000000250712554427055020205 00000000000000domain: "{ S2[i0, -7, 0] : i0 >= 2 and i0 <= 10; S4[1, 0, 0]; S6[i0, -9 + i0, 2] : i0 >= 2 and i0 <= 10; S1[10, i1, 4] : i1 >= 1 and i1 <= 10; S5[i0, i1, 3] : i1 <= -1 + i0 and i0 <= 10 and i1 >= 1; S7[1, 0, 0]; S8[i0, 0, 3] : i0 >= 1 and i0 <= 9; S3[i0, i1, 1] : i1 >= -7 and i0 <= 10 and i1 <= -9 + i0 }" child: context: "{ [] }" child: schedule: "[{ S6[i0, i1, i2] -> [(i0)]; S8[i0, i1, i2] -> [(i0)]; S5[i0, i1, i2] -> [(i0)]; S4[i0, i1, i2] -> [(i0)]; S7[i0, i1, i2] -> [(i0)]; S3[i0, i1, i2] -> [(i0)]; S1[i0, i1, i2] -> [(i0)]; S2[i0, i1, i2] -> [(i0)] }, { S6[i0, i1, i2] -> [(i1)]; S8[i0, i1, i2] -> [(i1)]; S5[i0, i1, i2] -> [(i1)]; S4[i0, i1, i2] -> [(i1)]; S7[i0, i1, i2] -> [(i1)]; S3[i0, i1, i2] -> [(i1)]; S1[i0, i1, i2] -> [(i1)]; S2[i0, i1, i2] -> [(i1)] }, { S6[i0, i1, i2] -> [(i2)]; S8[i0, i1, i2] -> [(i2)]; S5[i0, i1, i2] -> [(i2)]; S4[i0, i1, i2] -> [(i2)]; S7[i0, i1, i2] -> [(i2)]; S3[i0, i1, i2] -> [(i2)]; S1[i0, i1, i2] -> [(i2)]; S2[i0, i1, i2] -> [(i2)] }]" options: "{ separate[i0] }" child: sequence: - filter: "{ S1[i0, i1, i2] }" - filter: "{ S2[i0, i1, i2] }" - filter: "{ S3[i0, i1, i2] }" - filter: "{ S4[i0, i1, i2] }" - filter: "{ S5[i0, i1, i2] }" - filter: "{ S6[i0, i1, i2] }" - filter: "{ S7[i0, i1, i2] }" - filter: "{ S8[i0, i1, i2] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/stride3.c0000644000175000017500000000006512413270107017226 00000000000000for (int c0 = max(1, m); c0 <= n; c0 += 1) S1(c0); cloog-0.18.4/isl/test_inputs/codegen/cloog/multi-mm-1.c0000644000175000017500000000026512413256472017563 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.4/isl/test_inputs/codegen/cloog/1point-1.st0000644000175000017500000000027512554427055017444 00000000000000domain: "[M] -> { S1[2M, M] }" child: context: "[M] -> { [] }" child: schedule: "[M] -> [{ S1[i0, i1] -> [(i0)] }, { S1[i0, i1] -> [(i1)] }]" options: "[M] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-fusion1.st0000644000175000017500000000112412554427055021470 00000000000000domain: "[M] -> { S3[i0] : i0 >= 0 and i0 <= M; S2[i0] : i0 >= 1 and i0 <= M; S1[i0] : i0 >= 0 and i0 <= M }" child: context: "[M] -> { [] : M >= 1 }" child: sequence: - filter: "[M] -> { S1[i0] }" child: schedule: "[M] -> [{ S1[i0] -> [(i0)] }]" options: "[M] -> { separate[i0] }" - filter: "[M] -> { S2[i0] }" child: schedule: "[M] -> [{ S2[i0] -> [(i0)] }]" options: "[M] -> { separate[i0] }" - filter: "[M] -> { S3[i0] }" child: schedule: "[M] -> [{ S3[i0] -> [(i0)] }]" options: "[M] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/4-param.st0000644000175000017500000000057312554427055017336 00000000000000domain: "[m, n, p, q] -> { S1[i0] : i0 >= m and i0 <= n; S2[i0] : i0 >= p and i0 <= q }" child: context: "[m, n, p, q] -> { [] }" child: schedule: "[m, n, p, q] -> [{ S2[i0] -> [(i0)]; S1[i0] -> [(i0)] }]" options: "[m, n, p, q] -> { separate[i0] }" child: sequence: - filter: "[m, n, p, q] -> { S1[i0] }" - filter: "[m, n, p, q] -> { S2[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/lineality-1-2.st0000644000175000017500000000065612554427055020366 00000000000000domain: "[M] -> { S1[i0, i1] : i0 >= 1 and i1 >= 1 and i0 <= M and i1 <= M; S2[i0, i0] : i0 >= 1 and i0 <= M }" child: context: "[M] -> { [] : M >= 2 }" child: schedule: "[M] -> [{ S1[i0, i1] -> [(i0)]; S2[i0, i1] -> [(i0)] }, { S1[i0, i1] -> [(i1)]; S2[i0, i1] -> [(i1)] }]" options: "[M] -> { separate[i0] }" child: sequence: - filter: "[M] -> { S1[i0, i1] }" - filter: "[M] -> { S2[i0, i1] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/stride4.st0000644000175000017500000000043712554427055017452 00000000000000domain: "[t] -> { S1[i0, t] : exists (e0 = floor((t - i0)/16): 16e0 = t - i0 and i0 >= 0 and i0 <= 99 and t >= 0 and t <= 15) }" child: context: "[t] -> { [] }" child: schedule: "[t] -> [{ S1[i0, i1] -> [(i0)] }, { S1[i0, i1] -> [(i1)] }]" options: "[t] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-jacobi3.c0000644000175000017500000000034712554427055021220 00000000000000for (int c0 = 1; c0 <= M; c0 += 1) { for (int c2 = 2; c2 < N; c2 += 1) for (int c3 = 2; c3 < N; c3 += 1) S1(c0, c2, c3); for (int c2 = 2; c2 < N; c2 += 1) for (int c3 = 2; c3 < N; c3 += 1) S2(c0, c2, c3); } cloog-0.18.4/isl/test_inputs/codegen/cloog/0D-2.st0000644000175000017500000000010512554427055016466 00000000000000domain: "[M] -> { S1[] : M >= 0 }" child: context: "[M] -> { [] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/mod.st0000644000175000017500000000033012554427055016643 00000000000000domain: "{ S1[i0] : exists (e0 = floor((1 + i0)/3): 3e0 <= i0 and 3e0 >= -1 + i0 and i0 >= 0 and i0 <= 3) }" child: context: "{ [] }" child: schedule: "[{ S1[i0] -> [(i0)] }]" options: "{ separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/youcefn.st0000644000175000017500000000110412554427055017534 00000000000000domain: "[n, m] -> { S1[i0, i0] : i0 >= 1 and i0 <= n; S3[i0, n] : i0 >= 1 and i0 <= m; S2[i0, i1] : i0 >= 1 and i0 <= n and i1 >= i0 and i1 <= n }" child: context: "[n, m] -> { [] : n >= 2 and m >= n }" child: schedule: "[n, m] -> [{ S1[i0, i1] -> [(i0)]; S2[i0, i1] -> [(i0)]; S3[i0, i1] -> [(i0)] }, { S1[i0, i1] -> [(i1)]; S2[i0, i1] -> [(i1)]; S3[i0, i1] -> [(i1)] }]" options: "[n, m] -> { separate[i0] }" child: sequence: - filter: "[n, m] -> { S1[i0, i1] }" - filter: "[n, m] -> { S2[i0, i1] }" - filter: "[n, m] -> { S3[i0, i1] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/merge.c0000644000175000017500000000014412413256472016757 00000000000000{ S1(0); for (int c0 = 0; c0 <= 10; c0 += 1) { if (c0 >= 2) S2(c0); S3(c0); } } cloog-0.18.4/isl/test_inputs/codegen/cloog/min-2-1.c0000644000175000017500000000026112413270107016727 00000000000000for (int c0 = 1; c0 <= N; c0 += 1) for (int c1 = 0; c1 <= min(min(M, c0), N - c0); c1 += 1) for (int c2 = 0; c2 <= min(min(M, c0), N - c0); c2 += 1) S1(c0, c1, c2); cloog-0.18.4/isl/test_inputs/codegen/cloog/no_lindep.st0000644000175000017500000000030312554427055020033 00000000000000domain: "[M, N] -> { S1[2 + N] }" child: context: "[M, N] -> { [] }" child: schedule: "[M, N] -> [{ S1[i0] -> [(1 + M)] }, { S1[i0] -> [(N)] }]" options: "[M, N] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/walters3.st0000644000175000017500000000072212554427055017635 00000000000000domain: "{ S2[j, a, b] : 2a = j and j >= 1 and j <= 10 and 2b <= j and 2b >= -1 + j; S1[j, a, b] : 2a = j and 2b = j and j <= 8 and j >= 2 }" child: context: "{ [] }" child: schedule: "[{ S1[j, a, b] -> [(j)]; S2[j, a, b] -> [(j)] }, { S1[j, a, b] -> [(a)]; S2[j, a, b] -> [(a)] }, { S1[j, a, b] -> [(b)]; S2[j, a, b] -> [(b)] }]" options: "{ separate[i0] }" child: sequence: - filter: "{ S1[j, a, b] }" - filter: "{ S2[j, a, b] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/nul_lcpc.st0000644000175000017500000000111312554427055017663 00000000000000domain: "[m, n, p] -> { S1[i, k, j] : 2k = -1 + i and i >= 1 and i <= m and j >= 1 and j <= p; S2[i, k, j] : 2k = -1 + i and i >= 1 and i <= n and j >= 1 and j <= i }" child: context: "[m, n, p] -> { [] : n = 6 and m >= 7 and p >= 7 }" child: schedule: "[m, n, p] -> [{ S1[i, k, j] -> [(i)]; S2[i, k, j] -> [(i)] }, { S1[i, k, j] -> [(k)]; S2[i, k, j] -> [(k)] }, { S1[i, k, j] -> [(j)]; S2[i, k, j] -> [(j)] }]" options: "[m, n, p] -> { separate[i0] }" child: sequence: - filter: "[m, n, p] -> { S1[i, k, j] }" - filter: "[m, n, p] -> { S2[i, k, j] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/basic-bounds-4.c0000644000175000017500000000006112413256472020370 00000000000000for (int c0 = 0; c0 <= M + 1; c0 += 1) S1(c0); cloog-0.18.4/isl/test_inputs/codegen/cloog/1point-1.c0000644000175000017500000000001612413256472017226 00000000000000S1(2 * M, M); cloog-0.18.4/isl/test_inputs/codegen/cloog/classen2.st0000644000175000017500000000226612554427055017610 00000000000000domain: "[outerTimeTileScatter, outerProcTileScatter1, outerProcTileScatter2, M, N] -> { S1[compIter1, compIter2, compIter3, 2compIter1 + compIter2 + compIter3, 1 + compIter1 + compIter2 + compIter3, 1 + compIter1 + compIter2] : N >= 3 and compIter3 <= 3 + 5outerProcTileScatter1 - compIter1 - compIter2 and compIter2 >= -1 + 5outerProcTileScatter2 - compIter1 and M >= 2 and compIter3 <= 4 + 5outerTimeTileScatter - 2compIter1 - compIter2 and compIter2 <= 3 + 5outerProcTileScatter2 - compIter1 and compIter3 >= 1 and compIter3 <= -2 + N and compIter2 >= 1 and compIter2 <= -2 + N and compIter1 >= 1 and compIter1 <= -1 + M and compIter3 >= 5outerTimeTileScatter - 2compIter1 - compIter2 and compIter3 >= -1 + 5outerProcTileScatter1 - compIter1 - compIter2 }" child: context: "[outerTimeTileScatter, outerProcTileScatter1, outerProcTileScatter2, M, N] -> { [] }" child: schedule: "[outerTimeTileScatter, outerProcTileScatter1, outerProcTileScatter2, M, N] -> [{ S1[i0, i1, i2, i3, i4, i5] -> [(i3)] }, { S1[i0, i1, i2, i3, i4, i5] -> [(i4)] }, { S1[i0, i1, i2, i3, i4, i5] -> [(i5)] }]" options: "[outerTimeTileScatter, outerProcTileScatter1, outerProcTileScatter2, M, N] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-jacobi3.st0000644000175000017500000000200512554427055021415 00000000000000domain: "[M, N] -> { S2[i0, i1, i2] : i0 >= 1 and i0 <= M and i1 >= 2 and i1 <= -1 + N and i2 >= 2 and i2 <= -1 + N; S1[i0, i1, i2] : i0 >= 1 and i0 <= M and i1 >= 2 and i1 <= -1 + N and i2 >= 2 and i2 <= -1 + N }" child: context: "[M, N] -> { [] }" child: schedule: "[M, N] -> [{ S1[i0, i1, i2] -> [(2i0)]; S2[i0, i1, i2] -> [(1 + 2i0)] }]" options: "[M, N] -> { separate[i0] }" child: sequence: - filter: "[M, N] -> { S1[i0, i1, i2] }" child: schedule: "[M, N] -> [{ S1[i0, i1, i2] -> [(i1)] }]" options: "[M, N] -> { separate[i0] }" child: schedule: "[M, N] -> [{ S1[i0, i1, i2] -> [(i2)] }]" options: "[M, N] -> { separate[i0] }" - filter: "[M, N] -> { S2[i0, i1, i2] }" child: schedule: "[M, N] -> [{ S2[i0, i1, i2] -> [(i1)] }]" options: "[M, N] -> { separate[i0] }" child: schedule: "[M, N] -> [{ S2[i0, i1, i2] -> [(i2)] }]" options: "[M, N] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/1point-2.c0000644000175000017500000000002212413256472017224 00000000000000S1(2 * M, N + 2); cloog-0.18.4/isl/test_inputs/codegen/cloog/nul_lcpc.c0000644000175000017500000000052712413271702017455 00000000000000{ for (int c0 = 1; c0 <= 6; 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.4/isl/test_inputs/codegen/cloog/gesced3.c0000644000175000017500000000035112413256472017175 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.4/isl/test_inputs/codegen/cloog/mod3.c0000644000175000017500000000025512413270107016514 00000000000000for (int c0 = max(0, 32 * h0 - 1991); 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.4/isl/test_inputs/codegen/cloog/yosr.c0000644000175000017500000000047612554427055016667 00000000000000{ for (int c0 = 1; c0 < n; c0 += 1) { for (int c1 = 1; c1 < c0; c1 += 1) for (int c2 = c1 + 1; c2 <= n; c2 += 1) S2(c1, c2, c0); for (int c2 = c0 + 1; c2 <= n; c2 += 1) S1(c0, c2); } for (int c1 = 1; c1 < n; c1 += 1) for (int c2 = c1 + 1; c2 <= n; c2 += 1) S2(c1, c2, n); } cloog-0.18.4/isl/test_inputs/codegen/cloog/vasilache.c0000644000175000017500000000111412554427055017620 00000000000000{ S1(); S2(); for (int c0 = 0; c0 < N; c0 += 1) for (int c1 = 0; c1 < N; c1 += 1) { S4(c0, c1); S5(c0, c1); } for (int c0 = 0; c0 < N; c0 += 1) for (int c1 = 0; c1 < N; c1 += 1) for (int c2 = 0; c2 <= (N - 1) / 32; c2 += 1) { S7(c0, c1, c2, 32 * c2); for (int c3 = 32 * c2 + 1; c3 <= min(N - 1, 32 * c2 + 31); c3 += 1) { S6(c0, c1, c2, c3 - 1); S7(c0, c1, c2, c3); } if (32 * c2 + 31 >= N) { S6(c0, c1, c2, N - 1); } else S6(c0, c1, c2, 32 * c2 + 31); } S8(); } cloog-0.18.4/isl/test_inputs/codegen/cloog/logopar.st0000644000175000017500000000075012554427055017535 00000000000000domain: "[m, n] -> { S1[i0, i1] : i0 >= 1 and i1 <= m and i1 >= -1 + i0; S2[i0, i1] : i0 >= 2 and i0 <= n and i1 >= 0 and i1 <= n }" child: context: "[m, n] -> { [] : n <= m and m >= 0 and n >= 2 }" child: schedule: "[m, n] -> [{ S2[i0, i1] -> [(i0)]; S1[i0, i1] -> [(i0)] }, { S2[i0, i1] -> [(i1)]; S1[i0, i1] -> [(i1)] }]" options: "[m, n] -> { separate[i0] }" child: sequence: - filter: "[m, n] -> { S1[i0, i1] }" - filter: "[m, n] -> { S2[i0, i1] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/levenshtein-1-2-3.c0000644000175000017500000000137412554427055020652 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.4/isl/test_inputs/codegen/cloog/reservoir-bastoul3.c0000644000175000017500000000021512413256472021431 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.4/isl/test_inputs/codegen/cloog/byu98-1-2-3.st0000644000175000017500000000062612554427055017511 00000000000000domain: "{ S2[i0, 9 - i0] : i0 <= 8 and i0 >= 4; S1[i0, i1] : i1 >= 6 - i0 and i0 >= 2 and i1 >= 3 and i1 <= 6 and i1 >= -1 + i0 }" child: context: "{ [] }" child: schedule: "[{ S1[i0, i1] -> [(i0)]; S2[i0, i1] -> [(i0)] }, { S1[i0, i1] -> [(i1)]; S2[i0, i1] -> [(i1)] }]" options: "{ separate[i0] }" child: sequence: - filter: "{ S1[i0, i1] }" - filter: "{ S2[i0, i1] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-pingali5.st0000644000175000017500000000223412554427055021617 00000000000000domain: "[M] -> { S3[i0, i1, i2] : i1 >= 1 and i1 <= -1 + i0 and i2 >= 1 + i0 and i2 <= M; S2[i0, i1] : i0 <= M and i1 >= 1 and i1 <= -1 + i0; S1[i0, i1, i2] : i1 >= 1 and i1 <= -1 + i0 and i2 >= 1 + i0 and i2 <= M }" child: context: "[M] -> { [] }" child: schedule: "[M] -> [{ S1[i0, i1, i2] -> [(i0 + i1)]; S3[i0, i1, i2] -> [(i0 + i1)]; S2[i0, i1] -> [(i0 + i1)] }]" options: "[M] -> { separate[i0] }" child: sequence: - filter: "[M] -> { S1[i0, i1, i2] }" child: schedule: "[M] -> [{ S1[i0, i1, i2] -> [(i2)] }]" options: "[M] -> { separate[i0] }" child: schedule: "[M] -> [{ S1[i0, i1, i2] -> [(i2)] }]" options: "[M] -> { separate[i0] }" - filter: "[M] -> { S2[i0, i1] }" child: schedule: "[M] -> [{ S2[i0, i1] -> [(i1)] }]" options: "[M] -> { separate[i0] }" - filter: "[M] -> { S3[i0, i1, i2] }" child: schedule: "[M] -> [{ S3[i0, i1, i2] -> [(i2)] }]" options: "[M] -> { separate[i0] }" child: schedule: "[M] -> [{ S3[i0, i1, i2] -> [(i2)] }]" options: "[M] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/uday_scalars.st0000644000175000017500000000070712554427055020546 00000000000000domain: "[n] -> { S1[j, 0, 0] : j >= 0 and j <= n; S2[0, l, 0] : l >= 0 and l <= n }" child: context: "[n] -> { [] }" child: sequence: - filter: "[n] -> { S1[i0, i1, i2] }" child: schedule: "[n] -> [{ S1[i0, i1, i2] -> [(i0)] }]" options: "[n] -> { separate[i0] }" - filter: "[n] -> { S2[i0, i1, i2] }" child: schedule: "[n] -> [{ S2[i0, i1, i2] -> [(i1)] }]" options: "[n] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/largeur.c0000644000175000017500000000013112413256472017315 00000000000000for (int c0 = 1; c0 <= M; c0 += 1) for (int c1 = 1; c1 <= c0; c1 += 1) S1(c1, c0); cloog-0.18.4/isl/test_inputs/codegen/cloog/otl.c0000644000175000017500000000207112413270107016446 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(c0, (M + 2 * N) / 5 - 1), (2 * N + 5 * c0 + 1) / 10); c1 += 1) for (int c2 = max(max(max(max(0, c0 - c1 - 1), c1 - (N + 6) / 5 + 1), c0 - (M + N + 4) / 5 + 1), floord(-N + 5 * c0 - 3, 10) + 1); c2 <= min(min(min(c1, (M + N - 2) / 5), c0 - c1 + (N - 1) / 5 + 1), (N + 5 * c0 + 3) / 10); c2 += 1) for (int c3 = max(max(max(c0, 2 * c1 - (2 * N + 5) / 5 + 1), c1 + c2 - (N + 3) / 5), 2 * c2 - (N + 2) / 5); c3 <= min(min(min(min(min(c0 + 1, c1 + c2 + 1), c1 + (M - 2) / 5 + 1), 2 * c2 + (N - 2) / 5 + 1), (2 * M + 2 * N - 1) / 5 - 1), c2 + (M + N) / 5); c3 += 1) for (int c4 = max(max(max(max(c1, c0 - c2), c0 - (M + 6) / 5 + 1), c3 - (M + 2) / 5), (c3 + 1) / 2); c4 <= min(min(min(min(min(min(min(c0, c1 + 1), -c2 + c3 + (N - 1) / 5 + 1), c0 - c2 + N / 5 + 1), (M + 2 * N + 1) / 5 - 1), c2 + (N + 2) / 5), (2 * N + 5 * c0 + 3) / 10), (2 * N + 5 * c3 + 2) / 10); c4 += 1) S1(c0, c1, c2, c3, c4, c2); cloog-0.18.4/isl/test_inputs/codegen/cloog/rectangle.st0000644000175000017500000000034012554427055020031 00000000000000domain: "[n] -> { S1[i0, i1] : i0 >= 0 and i0 <= n and i1 >= 0 and i1 <= n }" child: context: "[n] -> { [] : n >= 0 }" child: schedule: "[n] -> [{ S1[i0, i1] -> [(i0 + i1)] }]" options: "[n] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/orc.st0000644000175000017500000000161312554427055016654 00000000000000domain: "{ S5[i] : i >= 0 and i <= 14; S6[i, j] : i >= 0 and i <= 14 and j >= 0 and j <= 9; S7[i] : i >= 0 and i <= 14; S4[i] : i >= 0 and i <= 2; S2[i, j] : i >= 0 and i <= 2 and j >= 0 and j <= 11 - i; S1[i] : i >= 0 and i <= 2; S3[i, j] : i >= 0 and i <= 2 and j >= 0 and j <= 11 - i }" child: context: "{ [] }" child: sequence: - filter: "{ S4[i0]; S2[i0, i1]; S1[i0]; S3[i0, i1] }" child: schedule: "[{ S3[i0, i1] -> [(1 + 3i0)]; S2[i0, i1] -> [(1 + 3i0)]; S1[i0] -> [(3i0)]; S4[i0] -> [(2 + 3i0)] }, { S3[i0, i1] -> [(1 + 2i1)]; S2[i0, i1] -> [(2i1)]; S1[i0] -> [(0)]; S4[i0] -> [(0)] }]" options: "{ separate[i0] }" - filter: "{ S5[i0]; S6[i0, i1]; S7[i0] }" child: schedule: "[{ S6[i0, i1] -> [(1 + 3i0)]; S7[i0] -> [(2 + 3i0)]; S5[i0] -> [(3i0)] }, { S6[i0, i1] -> [(i1)]; S7[i0] -> [(0)]; S5[i0] -> [(0)] }]" options: "{ separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/min-2-1.st0000644000175000017500000000055212554427055017152 00000000000000domain: "[M, N] -> { S1[i0, i1, i2] : 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 }" child: context: "[M, N] -> { [] }" child: schedule: "[M, N] -> [{ S1[i0, i1, i2] -> [(i0)] }, { S1[i0, i1, i2] -> [(i1)] }, { S1[i0, i1, i2] -> [(i2)] }]" options: "[M, N] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-lim-lam5.c0000644000175000017500000000043612554427055021322 00000000000000{ for (int c0 = 1; c0 <= M; c0 += 1) for (int c1 = 1; c1 <= M; c1 += 1) S1(c0, c1); for (int c0 = 1; c0 <= M; c0 += 1) for (int c1 = 1; c1 <= M; c1 += 1) S2(c0, c1); for (int c0 = 1; c0 <= M; c0 += 1) for (int c1 = 1; c1 <= M; c1 += 1) S3(c0, c1); } cloog-0.18.4/isl/test_inputs/codegen/cloog/wavefront.st0000644000175000017500000000037512554427055020110 00000000000000domain: "[n, m] -> { S1[i0, i1] : i0 >= 1 and i0 <= n and i1 >= 1 and i1 <= m }" child: context: "[n, m] -> { [] }" child: schedule: "[n, m] -> [{ S1[i0, i1] -> [(i0 + i1)] }, { S1[i0, i1] -> [(i0)] }]" options: "[n, m] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-mg-psinv.st0000644000175000017500000000245212554427055021651 00000000000000domain: "[M, N, O] -> { S3[i0, i1, i2] : i0 >= 2 and i0 <= -1 + O and i1 >= 2 and i1 <= -1 + N and i2 >= 2 and i2 <= -1 + M; S2[i0, i1, i2] : i0 >= 2 and i0 <= -1 + O and i1 >= 2 and i1 <= -1 + N and i2 >= 1 and i2 <= M; S1[i0, i1, i2] : i0 >= 2 and i0 <= -1 + O and i1 >= 2 and i1 <= -1 + N and i2 >= 1 and i2 <= M }" child: context: "[M, N, O] -> { [] }" child: schedule: "[M, N, O] -> [{ S3[i0, i1, i2] -> [(i0)]; S2[i0, i1, i2] -> [(i0)]; S1[i0, i1, i2] -> [(i0)] }]" options: "[M, N, O] -> { separate[i0] }" child: schedule: "[M, N, O] -> [{ S3[i0, i1, i2] -> [(2i1)]; S2[i0, i1, i2] -> [(-1 + 2i1)]; S1[i0, i1, i2] -> [(-1 + 2i1)] }]" options: "[M, N, O] -> { separate[i0] }" child: sequence: - filter: "[M, N, O] -> { S2[i0, i1, i2]; S1[i0, i1, i2] }" child: schedule: "[M, N, O] -> [{ S2[i0, i1, i2] -> [(i2)]; S1[i0, i1, i2] -> [(i2)] }]" options: "[M, N, O] -> { separate[i0] }" child: sequence: - filter: "[M, N, O] -> { S1[i0, i1, i2] }" - filter: "[M, N, O] -> { S2[i0, i1, i2] }" - filter: "[M, N, O] -> { S3[i0, i1, i2] }" child: schedule: "[M, N, O] -> [{ S3[i0, i1, i2] -> [(i2)] }]" options: "[M, N, O] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/lu2.st0000644000175000017500000000140012554427055016565 00000000000000domain: "[n] -> { S2[i0, i1, i2, i1, i0] : i2 >= 1 and i2 <= n and i2 <= -1 + i1 and i1 <= n and i2 <= -1 + i0 and i0 <= n; S1[i0, n, i0, i3] : i0 >= 1 and i0 <= n and i3 >= 1 + i0 and i3 <= n }" child: context: "[n] -> { [] }" child: schedule: "[n] -> [{ S2[i0, i1, i2, i3, i4] -> [(i0)]; S1[i0, i1, i2, i3] -> [(i0)] }, { S2[i0, i1, i2, i3, i4] -> [(i1)]; S1[i0, i1, i2, i3] -> [(i1)] }, { S2[i0, i1, i2, i3, i4] -> [(i2)]; S1[i0, i1, i2, i3] -> [(i2)] }, { S2[i0, i1, i2, i3, i4] -> [(i3)]; S1[i0, i1, i2, i3] -> [(i3)] }, { S2[i0, i1, i2, i3, i4] -> [(i4)]; S1[i0, i1, i2, i3] -> [(0)] }]" options: "[n] -> { separate[i0] }" child: sequence: - filter: "[n] -> { S1[i0, i1, i2, i3] }" - filter: "[n] -> { S2[i0, i1, i2, i3, i4] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/gesced3.st0000644000175000017500000000041312554427055017403 00000000000000domain: "[M, N] -> { S1[i0] : i0 >= 1 and i0 <= N; S2[i0] : i0 >= 1 and i0 <= N }" child: context: "[M, N] -> { [] : N >= M and M >= 2 }" child: schedule: "[M, N] -> [{ S2[i0] -> [(2M + i0)]; S1[i0] -> [(M + i0)] }]" options: "[M, N] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/stride2.c0000644000175000017500000000022112413256472017230 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.4/isl/test_inputs/codegen/cloog/min-1-1.c0000644000175000017500000000015612413270107016731 00000000000000for (int c0 = 1; c0 <= N; c0 += 1) for (int c1 = 0; c1 <= min(min(M, c0), N - c0); c1 += 1) S1(c0, c1); cloog-0.18.4/isl/test_inputs/codegen/cloog/faber.c0000644000175000017500000001527712554427055016757 00000000000000{ for (int c0 = 0; c0 <= 36; c0 += 1) { for (int c1 = -6; c1 < c0 / 14 - 5; c1 += 1) { for (int c2 = -((-2 * c1 + 3) / 5) + 9; c2 <= c1 + 12; c2 += 1) S6(c0, c1, c2); for (int c2 = c1 + 24; c2 <= -2 * c1 + 24; c2 += 1) S2(c0, c1, c2); for (int c2 = -2 * c1 + 30; c2 <= c1 + 48; c2 += 1) S1(c0, c1, c2); } for (int c1 = c0 / 14 - 5; c1 < 0; c1 += 1) { if (c1 >= -3 && 2 * c0 >= 7 * c1 + 42) S7(c0, c1, 6); for (int c2 = max(c1 - (6 * c0 + 77) / 77 + 13, -((-2 * c1 + 3) / 5) + 9); c2 <= c1 + 12; c2 += 1) S6(c0, c1, c2); for (int c2 = c1 - (3 * c0 + 14) / 14 + 49; c2 <= c1 + 48; c2 += 1) S1(c0, c1, c2); } S3(c0, 0, 0); S10(c0, 0, 0); for (int c2 = 1; c2 <= 5; c2 += 1) S3(c0, 0, c2); for (int c2 = 6; c2 <= 2 * c0 / 21 + 4; c2 += 1) { S3(c0, 0, c2); S7(c0, 0, c2); } for (int c2 = max(6, 2 * c0 / 21 + 5); c2 <= -((6 * c0 + 77) / 77) + 12; c2 += 1) S3(c0, 0, c2); for (int c2 = -((6 * c0 + 77) / 77) + 13; c2 <= 12; c2 += 1) { S3(c0, 0, c2); S6(c0, 0, c2); } for (int c2 = 13; c2 <= 24; c2 += 1) S3(c0, 0, c2); for (int c2 = -((3 * c0 + 14) / 14) + 49; c2 <= 48; c2 += 1) S1(c0, 0, c2); for (int c1 = 1; c1 <= 18; c1 += 1) { for (int c2 = -8 * c1; c2 <= min(6, -8 * c1 + 24); c2 += 1) S3(c0, c1, c2); if (c0 <= 34 && c1 == 1) { S3(c0, 1, 7); } else if (c1 == 2) { S3(c0, 2, 7); } else if (c0 >= 35 && c1 == 1) { S3(c0, 1, 7); S7(c0, 1, 7); } for (int c2 = 8; c2 <= min(-8 * c1 + 24, c1 - (6 * c0 + 77) / 77 + 12); c2 += 1) S3(c0, c1, c2); if (c1 == 1) { for (int c2 = -((6 * c0 + 77) / 77) + 14; c2 <= 13; c2 += 1) { S3(c0, 1, c2); S6(c0, 1, c2); } for (int c2 = 14; c2 <= 16; c2 += 1) S3(c0, 1, c2); } for (int c2 = max(-8 * c1 + 25, c1 - (6 * c0 + 77) / 77 + 13); c2 <= c1 + 12; c2 += 1) S6(c0, c1, c2); for (int c2 = c1 - (3 * c0 + 14) / 14 + 49; c2 <= c1 + 48; c2 += 1) S1(c0, c1, c2); } for (int c1 = 19; c1 <= 24; c1 += 1) { for (int c2 = -8 * c1; c2 <= -8 * c1 + 24; c2 += 1) S3(c0, c1, c2); for (int c2 = c1 - (6 * c0 + 77) / 77 + 13; c2 <= 30; c2 += 1) S6(c0, c1, c2); } } for (int c0 = 37; c0 <= 218; c0 += 1) { for (int c1 = (c0 + 5) / 14 - 8; c1 < min(0, c0 / 14 - 5); c1 += 1) { if (c0 <= 46 && c1 == -3) S7(c0, -3, 6); if (-77 * ((-3 * c1 + 1) / 5) + 447 >= 6 * c0) S6(c0, c1, -((-2 * c1 + 3) / 5) + 9); for (int c2 = c1 + 24; c2 <= -2 * c1 + 24; c2 += 1) S2(c0, c1, c2); for (int c2 = -2 * c1 + 30; c2 <= c1 - (3 * c0 + 17) / 14 + 56; c2 += 1) S1(c0, c1, c2); } if (c0 <= 148) for (int c1 = max(0, (c0 + 5) / 14 - 8); c1 < c0 / 14 - 5; c1 += 1) { if (c1 == 0) S2(c0, 0, 24); for (int c2 = max(c1 + 24, -2 * c1 + 30); c2 <= c1 - (3 * c0 + 17) / 14 + 56; c2 += 1) S1(c0, c1, c2); } if (c0 >= 79 && c0 % 14 >= 9) { for (int c2 = max((c0 - 70) / 14 + 24, (c0 - 70) / 14 - (3 * c0 + 14) / 14 + 49); c2 <= (c0 - 70) / 14 - (3 * c0 + 17) / 14 + 56; c2 += 1) S1(c0, c0 / 14 - 5, c2); } else if (c0 <= 69 && c0 % 14 >= 9) { if (c0 <= 41) S7(c0, -3, 6); S6(c0, c0 / 14 - 5, 8); for (int c2 = -((-c0 + 83) / 14) - (3 * c0 + 14) / 14 + 49; c2 <= -((-c0 + 83) / 14) - (3 * c0 + 17) / 14 + 56; c2 += 1) S1(c0, c0 / 14 - 5, c2); } for (int c1 = (c0 + 5) / 14 - 5; c1 < 0; c1 += 1) { if (7 * c1 + 114 >= 2 * c0) S7(c0, c1, 6); for (int c2 = max(8, c1 - (6 * c0 + 77) / 77 + 13); c2 <= c1 - (6 * c0 + 91) / 77 + 15; c2 += 1) S6(c0, c1, c2); for (int c2 = c1 - (3 * c0 + 14) / 14 + 49; c2 <= c1 - (3 * c0 + 17) / 14 + 56; c2 += 1) S1(c0, c1, c2); } for (int c1 = max(0, (c0 + 5) / 14 - 5); c1 < c0 / 14 - 2; c1 += 1) { for (int c2 = max(c1, -2 * c1 + 6); c2 <= min(min(-2 * c1 + 24, c1 - (6 * c0 + 91) / 77 + 15), (2 * c0 - 7 * c1 - 10) / 21 + 1); c2 += 1) S9(c0, c1, c2); if (c1 >= 1 && c1 <= 5 && 14 * c1 + 46 >= c0) S9(c0, c1, c1 + 5); for (int c2 = max(c1 + 6, (2 * c0 - 7 * c1 - 10) / 21 + 2); c2 <= (2 * c1 + 1) / 5 + 7; c2 += 1) { S7(c0, c1, c2); S9(c0, c1, c2); } if (c1 <= 3 && 7 * c1 + 21 * ((2 * c1 + 41) / 5) >= 2 * c0 + 12) S9(c0, c1, (2 * c1 + 1) / 5 + 8); for (int c2 = (2 * c1 + 1) / 5 + 9; c2 <= c1 - (6 * c0 + 91) / 77 + 15; c2 += 1) { S6(c0, c1, c2); S9(c0, c1, c2); } for (int c2 = c1 - (6 * c0 + 91) / 77 + 16; c2 <= -2 * c1 + 24; c2 += 1) S9(c0, c1, c2); for (int c2 = max(c1, -2 * c1 + 30); c2 <= min(c1 + 24, c1 - (3 * c0 + 17) / 14 + 47); c2 += 1) S8(c0, c1, c2); for (int c2 = max(c1 + 24, c1 - (3 * c0 + 14) / 14 + 49); c2 <= c1 - (3 * c0 + 17) / 14 + 56; c2 += 1) S1(c0, c1, c2); } for (int c1 = c0 / 14 - 2; c1 <= 18; c1 += 1) { for (int c2 = max(6, (c0 + 5) / 14 + 1); c2 <= min(min(c1, c0 / 14 + 3), -c1 + c1 / 2 + 18); c2 += 1) S5(c0, c1, c2); for (int c2 = c1 + 6; c2 <= min((2 * c1 + 1) / 5 + 7, (2 * c0 - 7 * c1 + 63) / 21 + 1); c2 += 1) S7(c0, c1, c2); for (int c2 = max(max(c1 + 6, c1 - (6 * c0 + 77) / 77 + 13), (2 * c1 + 1) / 5 + 9); c2 <= c1 - (6 * c0 + 91) / 77 + 15; c2 += 1) S6(c0, c1, c2); for (int c2 = max(c1 + (3 * c0 + 3) / 14 - 40, -c1 + (c1 + 1) / 2 + 21); c2 <= min(c1, c1 + 3 * c0 / 14 - 33); c2 += 1) S4(c0, c1, c2); for (int c2 = max(c1, c1 - (3 * c0 + 14) / 14 + 40); c2 <= min(c1 + 24, c1 - (3 * c0 + 17) / 14 + 47); c2 += 1) S8(c0, c1, c2); for (int c2 = max(c1 + 24, c1 - (3 * c0 + 14) / 14 + 49); c2 <= c1 - (3 * c0 + 17) / 14 + 56; c2 += 1) S1(c0, c1, c2); } for (int c1 = 19; c1 <= 24; c1 += 1) { for (int c2 = max(c1 - 12, (c0 + 5) / 14 + 1); c2 <= min(c0 / 14 + 3, -c1 + c1 / 2 + 18); c2 += 1) S5(c0, c1, c2); for (int c2 = max(max(c1 - 12, c1 + (3 * c0 + 3) / 14 - 40), -c1 + (c1 + 1) / 2 + 21); c2 <= min(c1, c1 + 3 * c0 / 14 - 33); c2 += 1) S4(c0, c1, c2); for (int c2 = max(c1 + 6, c1 - (6 * c0 + 77) / 77 + 13); c2 <= min(30, c1 - (6 * c0 + 91) / 77 + 15); c2 += 1) S6(c0, c1, c2); for (int c2 = max(c1, c1 - (3 * c0 + 14) / 14 + 40); c2 <= min(c1 + 24, c1 - (3 * c0 + 17) / 14 + 47); c2 += 1) S8(c0, c1, c2); } for (int c1 = 25; c1 <= min(42, -((3 * c0 + 17) / 14) + 71); c1 += 1) for (int c2 = max(c1 - 12, c1 + (3 * c0 + 3) / 14 - 40); c2 <= min(min(30, c1), c1 + 3 * c0 / 14 - 33); c2 += 1) S4(c0, c1, c2); } } cloog-0.18.4/isl/test_inputs/codegen/cloog/guide.c0000644000175000017500000000015612413256472016760 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.4/isl/test_inputs/codegen/cloog/forwardsub-2-1-2-3.c0000644000175000017500000000030212413256472020626 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.4/isl/test_inputs/codegen/cloog/mxm-shared.st0000644000175000017500000000323412554427055020137 00000000000000domain: "[N, b0, b1, g0, g1, g2, g3, g4, t0, t1] -> { S1[g0 + t1, i1] : (exists (e0 = floor((g1)/128), e1 = floor((128b1 - g1)/4096), e2 = floor((-8b0 + g0)/128), e3 = floor((-t0 + i1)/16): g3 = 128b1 and g4 = 0 and g2 = 8b0 and 128e0 = g1 and 4096e1 = 128b1 - g1 and 128e2 = -8b0 + g0 and 16e3 = -t0 + i1 and b0 <= 15 and b0 >= 0 and b1 <= 31 and b1 >= 0 and g0 >= 8b0 and g1 >= 128b1 and t0 <= 15 and t0 >= 0 and t1 <= 7 and t1 >= 0 and t1 <= -1 + N - g0 and i1 >= g1 and i1 <= 127 + g1 and i1 <= -1 + N)) or (exists (e0 = floor((g1)/128), e1 = floor((128b1 - g1)/4096), e2 = floor((g4)/4), e3 = floor((-8b0 + g0)/128), e4 = floor((-t0 + i1)/16): g3 = 128b1 and g2 = 8b0 and 128e0 = g1 and 4096e1 = 128b1 - g1 and 4e2 = g4 and 128e3 = -8b0 + g0 and 16e4 = -t0 + i1 and b0 <= 15 and b0 >= 0 and b1 <= 31 and b1 >= 0 and g0 >= 8b0 and g1 >= 128b1 and g4 >= 0 and g4 <= -1 + N and t0 <= 15 and t0 >= 0 and t1 <= 7 and t1 >= 0 and t1 <= -1 + N - g0 and i1 >= g1 and i1 <= 127 + g1 and i1 <= -1 + N)) }" child: context: "[N, b0, b1, g0, g1, g2, g3, g4, t0, t1] -> { [] : exists (e0 = floor((g0)/8), e1 = floor((-128b1 + g1)/4096), e2 = floor((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) }" child: schedule: "[N, b0, b1, g0, g1, g2, g3, g4, t0, t1] -> [{ S1[i0, i1] -> [(-g1 + i1)] }, { S1[i0, i1] -> [(t1)] }, { S1[i0, i1] -> [(t0)] }, { S1[i0, i1] -> [(t1)] }]" options: "[N, b0, b1, g0, g1, g2, g3, g4, t0, t1] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/swim.c0000644000175000017500000000521112554427055016642 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 c0 = 1; c0 <= N; c0 += 1) { for (int c1 = 1; c1 <= N; c1 += 1) { S28(c0, c1); S29(c0, c1); S30(c0, c1); } S31(c0); } S32(); S33(); S34(); if (O <= 1) S35(); S36(); S37(); for (int c0 = 2; c0 <= P; c0 += 1) { S38(c0); S39(c0); for (int c1 = 1; c1 <= Q; c1 += 1) for (int c2 = 1; c2 <= R; c2 += 1) { S40(c0, c1, c2); S41(c0, c1, c2); S42(c0, c1, c2); S43(c0, c1, c2); } for (int c1 = 1; c1 <= Q; c1 += 1) { S44(c0, c1); S45(c0, c1); S46(c0, c1); S47(c0, c1); } for (int c1 = 1; c1 <= R; c1 += 1) { S48(c0, c1); S49(c0, c1); S50(c0, c1); S51(c0, c1); } S52(c0); S53(c0); S54(c0); S55(c0); S56(c0); S57(c0); S58(c0); for (int c1 = 1; c1 <= Q; c1 += 1) for (int c2 = 1; c2 <= R; c2 += 1) { S59(c0, c1, c2); S60(c0, c1, c2); S61(c0, c1, c2); } for (int c1 = 1; c1 <= Q; c1 += 1) { S62(c0, c1); S63(c0, c1); S64(c0, c1); } for (int c1 = 1; c1 <= R; c1 += 1) { S65(c0, c1); S66(c0, c1); S67(c0, c1); } S68(c0); S69(c0); S70(c0); S71(c0); S72(c0); S73(c0); S74(c0); S75(c0); S76(c0); S77(c0); S78(c0); S79(c0); S80(c0); S81(c0); S82(c0); S83(c0); S84(c0); S85(c0); S86(c0); S87(c0); S88(c0); S89(c0); S90(c0); S91(c0); S92(c0); S93(c0); S94(c0); for (int c1 = 1; c1 <= N; c1 += 1) { for (int c2 = 1; c2 <= N; c2 += 1) { S95(c0, c1, c2); S96(c0, c1, c2); S97(c0, c1, c2); } S98(c0, c1); } S99(c0); S100(c0); S101(c0); for (int c1 = 1; c1 <= Q; c1 += 1) for (int c2 = 1; c2 <= R; c2 += 1) { S102(c0, c1, c2); S103(c0, c1, c2); S104(c0, c1, c2); S105(c0, c1, c2); S106(c0, c1, c2); S107(c0, c1, c2); } for (int c1 = 1; c1 <= Q; c1 += 1) { S108(c0, c1); S109(c0, c1); S110(c0, c1); S111(c0, c1); S112(c0, c1); S113(c0, c1); } for (int c1 = 1; c1 <= R; c1 += 1) { S114(c0, c1); S115(c0, c1); S116(c0, c1); S117(c0, c1); S118(c0, c1); S119(c0, c1); } S120(c0); S121(c0); S122(c0); S123(c0); S124(c0); S125(c0); } } cloog-0.18.4/isl/test_inputs/codegen/cloog/gesced2.st0000644000175000017500000000055512554427055017411 00000000000000domain: "[M] -> { S1[i0, i1] : i0 >= 1 and i0 <= M and i1 >= 5 and i1 <= -10 + M; S2[i0, i1] : i0 >= 1 and i0 <= M and i1 >= 5 and i1 <= -10 + M }" child: context: "[M] -> { [] : M >= 16 }" child: schedule: "[M] -> [{ S1[i0, i1] -> [(i0)]; S2[i0, i1] -> [(i1)] }, { S1[i0, i1] -> [(i1)]; S2[i0, i1] -> [(i0 - i1)] }]" options: "[M] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/jacobi-shared.c0000644000175000017500000000036312554427055020361 00000000000000if (((t1 + 31) % 32) + g2 >= 2 && N >= ((t1 + 31) % 32) + g2 + 2 && (h0 - 1) % 2 == 0) for (int c0 = max(((t0 + 15) % 16) + 1, ((g1 + t0 + 13) % 16) - g1 + 3); c0 <= min(32, N - g1 - 1); c0 += 16) S1(g1 + c0 - 1, ((t1 + 31) % 32) + g2); cloog-0.18.4/isl/test_inputs/codegen/cloog/min-3-1.st0000644000175000017500000000041712554427055017153 00000000000000domain: "[M] -> { S1[i0, i1] : i0 >= 0 and i0 <= M and i0 <= 10 and i1 >= 0 and i1 <= M and i1 <= 10 }" child: context: "[M] -> { [] : M >= 0 }" child: schedule: "[M] -> [{ S1[i0, i1] -> [(i0)] }, { S1[i0, i1] -> [(i1)] }]" options: "[M] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/forwardsub-1-1-2.c0000644000175000017500000000022312413256472020467 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.4/isl/test_inputs/codegen/cloog/ex1.st0000644000175000017500000000071712554427055016572 00000000000000domain: "[n] -> { S1[i0, i1] : i0 >= 0 and i0 <= n and i1 >= 0 and i1 <= -15 + n; S2[i0, i1] : i0 >= 15 and i0 <= n and i1 >= 10 and i1 <= n }" child: context: "[n] -> { [] : n >= 25 }" child: schedule: "[n] -> [{ S2[i0, i1] -> [(i0)]; S1[i0, i1] -> [(i0)] }, { S2[i0, i1] -> [(i1)]; S1[i0, i1] -> [(i1)] }]" options: "[n] -> { separate[i0] }" child: sequence: - filter: "[n] -> { S1[i0, i1] }" - filter: "[n] -> { S2[i0, i1] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-pingali3.c0000644000175000017500000000035712554427055021415 00000000000000{ for (int c0 = 1; c0 <= M; c0 += 1) for (int c1 = 1; c1 <= M; c1 += 1) S1(c0, c1); for (int c0 = 1; c0 <= M; c0 += 1) for (int c1 = 1; c1 <= M; c1 += 1) for (int c2 = 1; c2 <= M; c2 += 1) S2(c0, c1, c2); } cloog-0.18.4/isl/test_inputs/codegen/cloog/mode.st0000644000175000017500000000072012554427055017013 00000000000000domain: "[M, N] -> { S1[i0, i1] : i0 >= 0 and i0 <= M and i1 >= 0 and i1 <= i0; S2[i0, i1] : i0 >= 0 and i0 <= M and i1 >= 0 and i1 <= N }" child: context: "[M, N] -> { [] }" child: schedule: "[M, N] -> [{ S1[i0, i1] -> [(i0)]; S2[i0, i1] -> [(i0)] }, { S1[i0, i1] -> [(i1)]; S2[i0, i1] -> [(i1)] }]" options: "[M, N] -> { separate[i0] }" child: sequence: - filter: "[M, N] -> { S1[i0, i1] }" - filter: "[M, N] -> { S2[i0, i1] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-long.st0000644000175000017500000000505112554427055021046 00000000000000domain: "[M, N, O, P, Q, R, S, T, U] -> { S1[i0, i1, i2] : i0 >= 1 and i0 <= -1 + O and i1 >= Q and i1 <= -1 + N and i2 >= P and i2 <= -1 + M; S3[i0, i1, i2] : i0 >= 1 and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= P and i2 <= -1 + M; S4[i0, i1, i2] : i0 >= 1 and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= 1 and i2 <= -1 + M; S2[i0, i1, i2] : i0 >= 1 and i0 <= -1 + O and i1 >= Q and i1 <= -1 + N and i2 >= 1 and i2 <= -1 + M }" child: context: "[M, N, O, P, Q, R, S, T, U] -> { [] : M >= 10 and N >= 10 and O >= 10 and P >= 1 and P <= 2 and Q >= 1 and Q <= 2 and R >= 1 and R <= 2 and S >= 0 and S <= 1 and T >= 0 and T <= 1 and U >= 0 and U <= 1 }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S4[i0, i1, i2] -> [(i0)]; S2[i0, i1, i2] -> [(i0)]; S1[i0, i1, i2] -> [(i0)]; S3[i0, i1, i2] -> [(i0)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" child: sequence: - filter: "[M, N, O, P, Q, R, S, T, U] -> { S1[i0, i1, i2]; S2[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S2[i0, i1, i2] -> [(i1)]; S1[i0, i1, i2] -> [(i1)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" child: sequence: - filter: "[M, N, O, P, Q, R, S, T, U] -> { S1[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S1[i0, i1, i2] -> [(i2)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" - filter: "[M, N, O, P, Q, R, S, T, U] -> { S2[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S2[i0, i1, i2] -> [(i2)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" - filter: "[M, N, O, P, Q, R, S, T, U] -> { S3[i0, i1, i2]; S4[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S4[i0, i1, i2] -> [(i1)]; S3[i0, i1, i2] -> [(i1)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" child: sequence: - filter: "[M, N, O, P, Q, R, S, T, U] -> { S3[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S3[i0, i1, i2] -> [(i2)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" - filter: "[M, N, O, P, Q, R, S, T, U] -> { S4[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S4[i0, i1, i2] -> [(i2)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-stride.c0000644000175000017500000000007312554427055021174 00000000000000for (int c0 = 2; c0 <= M; c0 += 7) S1(c0, (c0 - 2) / 7); cloog-0.18.4/isl/test_inputs/codegen/cloog/union.c0000644000175000017500000000017612413256472017015 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.4/isl/test_inputs/codegen/cloog/block3.st0000644000175000017500000000030012554427055017236 00000000000000domain: "{ S1[]; S3[i0] : i0 >= 0 and i0 <= 1; S2[] }" child: context: "{ [] }" child: schedule: "[{ S2[] -> [(1)]; S3[i0] -> [(i0)]; S1[] -> [(0)] }]" options: "{ separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-pingali6.st0000644000175000017500000000203112554427055021613 00000000000000domain: "[M, N] -> { S2[i0, i1, i2] : i0 >= 1 and i0 <= M and i1 >= 2 and i1 <= -1 + N and i2 >= 2 and i2 <= -1 + N; S1[i0, i1, i2] : i0 >= 1 and i0 <= M and i1 >= 2 and i1 <= -1 + N and i2 >= 2 and i2 <= -1 + N }" child: context: "[M, N] -> { [] : M >= 1 and N >= 1 }" child: schedule: "[M, N] -> [{ S1[i0, i1, i2] -> [(2i0)]; S2[i0, i1, i2] -> [(1 + 2i0)] }]" options: "[M, N] -> { separate[i0] }" child: sequence: - filter: "[M, N] -> { S1[i0, i1, i2] }" child: schedule: "[M, N] -> [{ S1[i0, i1, i2] -> [(i1)] }]" options: "[M, N] -> { separate[i0] }" child: schedule: "[M, N] -> [{ S1[i0, i1, i2] -> [(i2)] }]" options: "[M, N] -> { separate[i0] }" - filter: "[M, N] -> { S2[i0, i1, i2] }" child: schedule: "[M, N] -> [{ S2[i0, i1, i2] -> [(i1)] }]" options: "[M, N] -> { separate[i0] }" child: schedule: "[M, N] -> [{ S2[i0, i1, i2] -> [(i2)] }]" options: "[M, N] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/durbin_e_s.c0000644000175000017500000000072112413256472017772 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.4/isl/test_inputs/codegen/cloog/byu98-1-2-3.c0000644000175000017500000000063612413256472017303 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.4/isl/test_inputs/codegen/cloog/basic-bounds-6.c0000644000175000017500000000001012554427055020367 00000000000000S1(-1); cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-cholesky2.c0000644000175000017500000000057412554427055021613 00000000000000for (int c0 = 2; c0 < 3 * M; c0 += 1) { if ((c0 - 2) % 3 == 0) S1((c0 + 1) / 3); for (int c1 = (c0 + 1) / 3 + 1; c1 <= min(M, c0 - 2); c1 += 1) for (int c2 = -c1 + (c0 + c1 + 1) / 2 + 1; c2 <= min(c1, c0 - c1); c2 += 1) S3(c0 - c1 - c2 + 1, c1, c2); for (int c1 = -c0 + 2 * ((2 * c0 + 1) / 3) + 2; c1 <= min(M, c0); c1 += 2) S2(((c0 - c1) / 2) + 1, c1); } cloog-0.18.4/isl/test_inputs/codegen/cloog/lu2.c0000644000175000017500000000033312413256472016362 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.4/isl/test_inputs/codegen/cloog/backtrack.st0000644000175000017500000000017712554427055020022 00000000000000domain: "{ S1[0] }" child: context: "{ [] }" child: schedule: "[{ S1[i0] -> [(i0)] }]" options: "{ separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/multi-stride.st0000644000175000017500000000041012554427055020505 00000000000000domain: "{ S1[i0, i1, i2] : 2i1 = -1 + i0 and 6i2 = -2 + i0 and i0 >= 0 and i0 <= 100 }" child: context: "{ [] }" child: schedule: "[{ S1[i0, i1, i2] -> [(i0)] }, { S1[i0, i1, i2] -> [(i1)] }, { S1[i0, i1, i2] -> [(i2)] }]" options: "{ separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/walters2.st0000644000175000017500000000070312554427055017633 00000000000000domain: "{ S2[j, 51] : j <= 24 and j >= 1; S2[25, i] : i <= 51 and i >= 1; S2[j, 0] : j <= 25 and j >= 1; S2[0, i] : i <= 51 and i >= 0; S1[j, i] : j >= 1 and j <= 24 and i >= 1 and i <= 50 }" child: context: "{ [] }" child: schedule: "[{ S1[j, i] -> [(j)]; S2[j, i] -> [(j)] }, { S1[j, i] -> [(i)]; S2[j, i] -> [(i)] }]" options: "{ separate[i0] }" child: sequence: - filter: "{ S1[j, i] }" - filter: "{ S2[j, i] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/stride2.st0000644000175000017500000000036212554427055017445 00000000000000domain: "{ S2[i0, i1] : 3i1 = i0 and i0 >= 3 and i0 <= 100; S1[27] }" child: context: "{ [] }" child: schedule: "[{ S2[i0, i1] -> [(i0)]; S1[i0] -> [(i0)] }, { S2[i0, i1] -> [(i1)]; S1[i0] -> [(0)] }]" options: "{ separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/yosr.st0000644000175000017500000000053312554427055017065 00000000000000domain: "[n] -> { S1[i0, i1] : i0 >= 1 and i0 <= -1 + n and i1 >= 1 + i0 and i1 <= n; S2[i0, i1, i2] : i0 >= 1 and i0 <= -1 + n and i1 >= 1 + i0 and i1 <= n and i2 >= 1 + i0 and i2 <= n }" child: context: "[n] -> { [] }" child: schedule: "[n] -> [{ S2[i0, i1, i2] -> [(i2)]; S1[i0, i1] -> [(i0)] }]" options: "[n] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-bastoul3.st0000644000175000017500000000043012554427055021637 00000000000000domain: "{ S1[i0, i1, i2] : 2i2 = i0 - i1 and i1 >= 1 and i1 <= 3 and i1 <= -2 + i0 and i1 >= -6 + i0 }" child: context: "{ [] }" child: schedule: "[{ S1[i0, i1, i2] -> [(i0)] }, { S1[i0, i1, i2] -> [(i1)] }, { S1[i0, i1, i2] -> [(i2)] }]" options: "{ separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/min-4-1.st0000644000175000017500000000034412554427055017153 00000000000000domain: "[M, N, O] -> { S1[i0] : i0 >= -M and i0 >= -N and i0 <= N and i0 <= O }" child: context: "[M, N, O] -> { [] }" child: schedule: "[M, N, O] -> [{ S1[i0] -> [(i0)] }]" options: "[M, N, O] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-pingali3.st0000644000175000017500000000156712554427055021625 00000000000000domain: "[M] -> { S1[i0, i1] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= M; S2[i0, i1, i2] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= M and i2 >= 1 and i2 <= M }" child: context: "[M] -> { [] }" child: sequence: - filter: "[M] -> { S1[i0, i1] }" child: schedule: "[M] -> [{ S1[i0, i1] -> [(i0)] }]" options: "[M] -> { separate[i0] }" child: schedule: "[M] -> [{ S1[i0, i1] -> [(i1)] }]" options: "[M] -> { separate[i0] }" - filter: "[M] -> { S2[i0, i1, i2] }" child: schedule: "[M] -> [{ S2[i0, i1, i2] -> [(i0)] }]" options: "[M] -> { separate[i0] }" child: schedule: "[M] -> [{ S2[i0, i1, i2] -> [(i1)] }]" options: "[M] -> { separate[i0] }" child: schedule: "[M] -> [{ S2[i0, i1, i2] -> [(i2)] }]" options: "[M] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/lex.c0000644000175000017500000000007412413256472016452 00000000000000for (int c0 = 0; c0 <= 10; c0 += 1) { S2(c0); S1(c0); } cloog-0.18.4/isl/test_inputs/codegen/cloog/basic-bounds-6.st0000644000175000017500000000020012554427055020574 00000000000000domain: "{ S1[-1] }" child: context: "{ [] }" child: schedule: "[{ S1[i0] -> [(i0)] }]" options: "{ separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/thomasset.st0000644000175000017500000000067312554427055020105 00000000000000domain: "[n] -> { S1[i, j] : i <= n and i >= 1 and 3j <= -1 + i and 3j >= -3 + i; S2[i, j, 0, p, q] : i <= n and j <= n and j >= 1 and i >= 1 and 3q <= j and 3q >= -2 + j and 3p <= n and 3p >= -2 + n }" child: context: "[n] -> { [] }" child: schedule: "[n] -> [{ S2[i0, i1, i2, i3, i4] -> [(i2 + i3 + i4)]; S1[i0, i1] -> [(i1)] }, { S2[i0, i1, i2, i3, i4] -> [(-1 + i0)]; S1[i0, i1] -> [(0)] }]" options: "[n] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-jacobi2.st0000644000175000017500000000051512554427055021420 00000000000000domain: "[M] -> { S1[i0, i1] : i0 >= 0 and i0 <= -1 + M and i1 >= 0 and i1 <= -1 + M }" child: context: "[M] -> { [] : M >= 1 }" child: schedule: "[M] -> [{ S1[i0, i1] -> [(i0)] }]" options: "[M] -> { separate[i0] }" child: schedule: "[M] -> [{ S1[i0, i1] -> [(i1)] }]" options: "[M] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/cholesky2.c0000644000175000017500000000067312554427055017575 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); 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); } for (int c1 = (c0 + 5) / 3; c1 <= M; c1 += 1) S2(c1, (c0 + 2) / 3); } } cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-pingali2.c0000644000175000017500000000030012554427055021400 00000000000000{ for (int c0 = 1; c0 <= M; c0 += 1) for (int c1 = 1; c1 <= M; c1 += 1) S1(c0, c1); for (int c0 = 1; c0 <= M; c0 += 1) for (int c1 = 1; c1 <= M; c1 += 1) S2(c0, c1); } cloog-0.18.4/isl/test_inputs/codegen/cloog/unroll.c0000644000175000017500000000015012413256472017170 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.4/isl/test_inputs/codegen/cloog/no_lindep.c0000644000175000017500000000001312413256472017622 00000000000000S1(N + 2); cloog-0.18.4/isl/test_inputs/codegen/cloog/lex.st0000644000175000017500000000043512554427055016662 00000000000000domain: "{ S1[i0] : i0 >= 0 and i0 <= 10; S2[i0] : i0 >= 0 and i0 <= 10 }" child: context: "{ [] }" child: schedule: "[{ S2[i0] -> [(i0)]; S1[i0] -> [(i0)] }]" options: "{ separate[i0] }" child: sequence: - filter: "{ S2[i0] }" - filter: "{ S1[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/param-split.st0000644000175000017500000000045412554427055020324 00000000000000domain: "[M] -> { S2[0]; S1[i0] : i0 >= 0 and i0 <= M }" child: context: "[M] -> { [] }" child: schedule: "[M] -> [{ S2[i0] -> [(i0)]; S1[i0] -> [(i0)] }]" options: "[M] -> { atomic[i0] }" child: sequence: - filter: "[M] -> { S1[i0] }" - filter: "[M] -> { S2[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/youcefn.c0000644000175000017500000000030012413256472017322 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.4/isl/test_inputs/codegen/cloog/mod4.st0000644000175000017500000000266012554427055016737 00000000000000domain: "{ S1[j, div41, div42, 2, mod6_a] : 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; S2[j, div41, div42, 2, mod6_a] : 3div42 = 1 + j and 3mod6_a = -2 + j and 3div41 >= 1 + j and 3div41 <= 2 + j and j >= 1 and j <= 10; S3[j, div41, div42, 2, mod6_a] : 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 }" child: context: "{ [] }" child: schedule: "[{ S1[j, div41, div42, mod6, mod6_a] -> [(j)]; S3[j, div41, div42, mod6, mod6_a] -> [(j)]; S2[j, div41, div42, mod6, mod6_a] -> [(j)] }, { S1[j, div41, div42, mod6, mod6_a] -> [(div41)]; S3[j, div41, div42, mod6, mod6_a] -> [(div41)]; S2[j, div41, div42, mod6, mod6_a] -> [(div41)] }, { S1[j, div41, div42, mod6, mod6_a] -> [(div42)]; S3[j, div41, div42, mod6, mod6_a] -> [(div42)]; S2[j, div41, div42, mod6, mod6_a] -> [(div42)] }, { S1[j, div41, div42, mod6, mod6_a] -> [(mod6)]; S3[j, div41, div42, mod6, mod6_a] -> [(mod6)]; S2[j, div41, div42, mod6, mod6_a] -> [(mod6)] }, { S1[j, div41, div42, mod6, mod6_a] -> [(mod6_a)]; S3[j, div41, div42, mod6, mod6_a] -> [(mod6_a)]; S2[j, div41, div42, mod6, mod6_a] -> [(mod6_a)] }]" options: "{ separate[i0] }" child: sequence: - filter: "{ S1[j, div41, div42, mod6, mod6_a] }" - filter: "{ S2[j, div41, div42, mod6, mod6_a] }" - filter: "{ S3[j, div41, div42, mod6, mod6_a] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-mg-interp2.st0000644000175000017500000000537112554427055022100 00000000000000domain: "[M, N, O, P, Q, R, S, T, U] -> { S1[i0, i1, i2] : i0 >= 1 and i0 <= -1 + O and i1 >= Q and i1 <= -1 + N and i2 >= P and i2 <= -1 + M; S3[i0, i1, i2] : i0 >= 1 and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= P and i2 <= -1 + M; S4[i0, i1, i2] : i0 >= 1 and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= 1 and i2 <= -1 + M; S2[i0, i1, i2] : i0 >= 1 and i0 <= -1 + O and i1 >= Q and i1 <= -1 + N and i2 >= 1 and i2 <= -1 + M }" child: context: "[M, N, O, P, Q, R, S, T, U] -> { [] }" child: sequence: - filter: "[M, N, O, P, Q, R, S, T, U] -> { S1[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S1[i0, i1, i2] -> [(i0)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S1[i0, i1, i2] -> [(i1)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S1[i0, i1, i2] -> [(i2)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" - filter: "[M, N, O, P, Q, R, S, T, U] -> { S2[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S2[i0, i1, i2] -> [(i0)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S2[i0, i1, i2] -> [(i1)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S2[i0, i1, i2] -> [(i2)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" - filter: "[M, N, O, P, Q, R, S, T, U] -> { S3[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S3[i0, i1, i2] -> [(i0)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S3[i0, i1, i2] -> [(i1)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S3[i0, i1, i2] -> [(i2)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" - filter: "[M, N, O, P, Q, R, S, T, U] -> { S4[i0, i1, i2] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S4[i0, i1, i2] -> [(i0)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S4[i0, i1, i2] -> [(i1)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" child: schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S4[i0, i1, i2] -> [(i2)] }]" options: "[M, N, O, P, Q, R, S, T, U] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-pingali1.c0000644000175000017500000000034212554427055021405 00000000000000for (int c0 = 1; c0 <= M; c0 += 1) for (int c1 = 1; c1 < 2 * N; c1 += 1) { for (int c2 = max(1, -N + c1); c2 < (c1 + 1) / 2; c2 += 1) S1(c0, c1 - c2, c2); if ((c1 - 1) % 2 == 0) S2(c0, (c1 + 1) / 2); } cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-loechner5.st0000644000175000017500000000116412554427055021774 00000000000000domain: "[M] -> { S1[i0, i1, i2, i3] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= M and i2 >= 1 and i2 <= M and i3 >= 1 and i3 <= M }" child: context: "[M] -> { [] }" child: schedule: "[M] -> [{ S1[i0, i1, i2, i3] -> [(i2)] }]" options: "[M] -> { separate[i0] }" child: schedule: "[M] -> [{ S1[i0, i1, i2, i3] -> [(i0)] }]" options: "[M] -> { separate[i0] }" child: schedule: "[M] -> [{ S1[i0, i1, i2, i3] -> [(i1)] }]" options: "[M] -> { separate[i0] }" child: schedule: "[M] -> [{ S1[i0, i1, i2, i3] -> [(i3)] }]" options: "[M] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/mod3.st0000644000175000017500000000066412554427055016740 00000000000000domain: "[h0] -> { S1[i0, i1] : exists (e0 = floor((32 + 32h0 - i0)/64): 64e0 <= 31 + 32h0 - i0 and 64e0 >= -31 + 32h0 - i0 and i0 >= 0 and i0 <= 999 and i0 >= -2015 + 32h0 and 32e0 >= -999 + 32h0 - i0 and i1 >= 0 and i1 <= 999 and i0 <= 32 + 32h0) }" child: context: "[h0] -> { [] : h0 <= 93 and h0 >= 0 }" child: schedule: "[h0] -> [{ S1[i0, i1] -> [(i0)] }, { S1[i0, i1] -> [(i1)] }]" options: "[h0] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/faber.st0000644000175000017500000000635612554427055017161 00000000000000domain: "{ S2[idx4, idx5, idx6] : 14idx5 <= -84 + idx4 and 14idx5 >= -120 + idx4 and idx6 >= 24 + idx5 and idx6 <= 48 + idx5 and idx5 >= -6 and idx5 <= 18 and idx6 <= 24 - 2idx5; S4[idx4, idx5, idx6] : 14idx6 <= -462 + 3idx4 + 14idx5 and 14idx6 >= -570 + 3idx4 + 14idx5 and idx6 <= idx5 and idx6 >= -12 + idx5 and idx6 >= 6 and idx6 <= 30 and 2idx6 >= 42 - idx5; S6[idx4, idx5, idx6] : 77idx6 >= 924 - 6idx4 + 77idx5 and 77idx6 <= 1140 - 6idx4 + 77idx5 and idx6 <= 12 + idx5 and idx6 >= 6 + idx5 and idx6 >= 6 and idx6 <= 30 and 5idx6 >= 42 + 2idx5; S1[idx4, idx5, idx6] : 14idx6 >= 672 - 3idx4 + 14idx5 and 14idx6 <= 780 - 3idx4 + 14idx5 and idx6 >= 24 + idx5 and idx6 <= 48 + idx5 and idx5 >= -6 and idx5 <= 18 and idx6 >= 30 - 2idx5; S5[idx4, idx5, idx6] : 14idx6 <= 42 + idx4 and 14idx6 >= 6 + idx4 and idx6 <= idx5 and idx6 >= -12 + idx5 and idx6 >= 6 and idx6 <= 30 and 2idx6 <= 36 - idx5; S7[idx4, idx5, idx6] : 21idx6 <= 84 + 2idx4 - 7idx5 and 21idx6 >= 12 + 2idx4 - 7idx5 and idx6 <= 12 + idx5 and idx6 >= 6 + idx5 and idx6 >= 6 and idx6 <= 30 and 5idx6 <= 36 + 2idx5; S8[idx4, idx5, idx6] : 14idx6 >= 546 - 3idx4 + 14idx5 and 14idx6 <= 654 - 3idx4 + 14idx5 and idx6 >= idx5 and idx6 <= 24 + idx5 and idx5 >= 0 and idx5 <= 24 and idx6 >= 30 - 2idx5; S3[idx4, idx5, idx6] : idx4 >= 0 and idx4 <= 36 and idx6 >= -8idx5 and idx6 <= 24 - 8idx5 and idx5 >= 0 and idx5 <= 24; S9[idx4, idx5, idx6] : 14idx5 <= -42 + idx4 and 14idx5 >= -78 + idx4 and idx6 >= idx5 and idx6 <= 24 + idx5 and idx5 >= 0 and idx5 <= 24 and idx6 <= 24 - 2idx5 and idx6 >= 6 - 2idx5; S10[idx4, idx5, idx6] : 7idx6 <= idx4 - 28idx5 and 7idx6 >= -36 + idx4 - 28idx5 and idx6 >= idx5 and idx6 <= 24 + idx5 and idx5 >= 0 and idx5 <= 24 and idx6 <= -2idx5 }" child: context: "{ [] }" child: schedule: "[{ S6[idx4, idx5, idx6] -> [(idx4)]; S8[idx4, idx5, idx6] -> [(idx4)]; S5[idx4, idx5, idx6] -> [(idx4)]; S9[idx4, idx5, idx6] -> [(idx4)]; S4[idx4, idx5, idx6] -> [(idx4)]; S10[idx4, idx5, idx6] -> [(idx4)]; S7[idx4, idx5, idx6] -> [(idx4)]; S3[idx4, idx5, idx6] -> [(idx4)]; S1[idx4, idx5, idx6] -> [(idx4)]; S2[idx4, idx5, idx6] -> [(idx4)] }, { S6[idx4, idx5, idx6] -> [(idx5)]; S8[idx4, idx5, idx6] -> [(idx5)]; S5[idx4, idx5, idx6] -> [(idx5)]; S9[idx4, idx5, idx6] -> [(idx5)]; S4[idx4, idx5, idx6] -> [(idx5)]; S10[idx4, idx5, idx6] -> [(idx5)]; S7[idx4, idx5, idx6] -> [(idx5)]; S3[idx4, idx5, idx6] -> [(idx5)]; S1[idx4, idx5, idx6] -> [(idx5)]; S2[idx4, idx5, idx6] -> [(idx5)] }, { S6[idx4, idx5, idx6] -> [(idx6)]; S8[idx4, idx5, idx6] -> [(idx6)]; S5[idx4, idx5, idx6] -> [(idx6)]; S9[idx4, idx5, idx6] -> [(idx6)]; S4[idx4, idx5, idx6] -> [(idx6)]; S10[idx4, idx5, idx6] -> [(idx6)]; S7[idx4, idx5, idx6] -> [(idx6)]; S3[idx4, idx5, idx6] -> [(idx6)]; S1[idx4, idx5, idx6] -> [(idx6)]; S2[idx4, idx5, idx6] -> [(idx6)] }]" options: "{ separate[i0] }" child: sequence: - filter: "{ S1[idx4, idx5, idx6] }" - filter: "{ S2[idx4, idx5, idx6] }" - filter: "{ S3[idx4, idx5, idx6] }" - filter: "{ S4[idx4, idx5, idx6] }" - filter: "{ S5[idx4, idx5, idx6] }" - filter: "{ S6[idx4, idx5, idx6] }" - filter: "{ S7[idx4, idx5, idx6] }" - filter: "{ S8[idx4, idx5, idx6] }" - filter: "{ S9[idx4, idx5, idx6] }" - filter: "{ S10[idx4, idx5, idx6] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/sor1d.st0000644000175000017500000000724512554427055017130 00000000000000domain: "[M, N] -> { S2[i0, i1, 1 + i1, 99 + 100i1, i4] : i4 >= 3 and i4 >= -193 - 200i1 and i4 >= -194 + 100i0 - 200i1 and 100i0 >= -284 - 3N and i4 <= -1 + N and i4 <= -201 + 2M + N - 200i1 and i4 <= -95 + 100i0 - 200i1 and 100i0 >= -94 - N and 50i0 >= -45 - N and 3N >= -134 - M and i1 >= 0 and N >= 4 and 200i1 >= -192 - N and 200i1 >= -193 - N + 100i0 and 100i0 <= -7 + 2M + N and 7N >= -463 - 2M and 100i1 <= -100 + M and i0 >= 0 and 200i1 <= -204 + 2M + N and 2i1 <= -1 + i0 and 5N >= -75 - 2M and N >= 8 - 2M and 50i0 <= -6 + M + N and 50i0 <= 89 + M + 2N and 100i0 <= -15 + 2M + 3N and M >= 2 and 100i1 <= -5 + M + N and 2N >= -39 - M and 200i1 <= 96 + N + 100i0 and 3N >= 16 - 2M and 100i1 >= -94 - N + 50i0 and N >= 6 - M and 100i1 >= -94 - N; S3[i0, i1, 1 + i1, 99 + 100i1, i4] : i4 >= 3 and i4 >= -193 - 200i1 and i4 >= -194 + 100i0 - 200i1 and 100i0 >= -284 - 3N and i4 <= -1 + N and i4 <= -201 + 2M + N - 200i1 and i4 <= -95 + 100i0 - 200i1 and 100i0 >= -94 - N and 50i0 >= -45 - N and 3N >= -134 - M and i1 >= 0 and N >= 4 and 200i1 >= -192 - N and 200i1 >= -193 - N + 100i0 and 100i0 <= -7 + 2M + N and 7N >= -463 - 2M and 100i1 <= -100 + M and i0 >= 0 and 200i1 <= -204 + 2M + N and 2i1 <= -1 + i0 and 5N >= -75 - 2M and N >= 8 - 2M and 50i0 <= -6 + M + N and 50i0 <= 89 + M + 2N and 100i0 <= -15 + 2M + 3N and M >= 2 and 100i1 <= -5 + M + N and 2N >= -39 - M and 200i1 <= 96 + N + 100i0 and 3N >= 16 - 2M and 100i1 >= -94 - N + 50i0 and N >= 6 - M and 100i1 >= -94 - N; S4[i0] : 200i0 >= -781 - 3N and 200i0 >= -391 - N and 50i0 >= -268 - N and 100i0 >= -392 - N and i0 >= -1 and 200i0 <= 377 + 6M + 5N and 100i0 <= 335 + 3M + 3N and 100i0 <= 190 + 3M + 2N and 200i0 <= -13 + 6M + 3N and 100i0 <= -5 + 3M + N and 3N >= -484 - 2M and N >= -95 - M and N >= -192 - 3M and 5N >= -873 - 3M and 2N >= -189 - 3M and 7N >= -1062 - 6M and 5N >= -771 - 6M and 4N >= -579 - 3M and N >= 3 and N >= 5 - 2M and M >= 1; S1[i0, i1, i2, i3] : i3 >= 4 + 100i0 - 2i2 and i3 >= 2 and i3 <= 103 + 100i0 - 2i2 and i3 <= -1 + N and i2 >= 1 and i2 >= 100i1 and 2i2 >= 5 - N + 100i0 and i2 <= M and i2 <= 99 + 100i1 and i2 <= 50 + 50i0 and i1 >= 0 and 200i1 >= -193 - N + 100i0 and 100i1 <= M and 2i1 <= 1 + i0 and i0 >= 0 and 100i0 <= -5 + 2M + N and N >= 3 and N >= -94 - 2M and M >= 1 }" child: context: "[M, N] -> { [] : M >= 0 and N >= 0 }" child: schedule: "[M, N] -> [{ S2[i0, i1, i2, i3, i4] -> [(i0 + i1)]; S1[i0, i1, i2, i3] -> [(i0 + i1)]; S3[i0, i1, i2, i3, i4] -> [(1 + i0 + i1)]; S4[i0] -> [(i0)] }]" options: "[M, N] -> { atomic[i0] }" child: sequence: - filter: "[M, N] -> { S2[i0, i1, i2, i3, i4]; S3[i0, i1, i2, i3, i4]; S1[i0, i1, i2, i3] }" child: schedule: "[M, N] -> [{ S2[i0, i1, i2, i3, i4] -> [(i1)]; S1[i0, i1, i2, i3] -> [(i1)]; S3[i0, i1, i2, i3, i4] -> [(i2)] }, { S2[i0, i1, i2, i3, i4] -> [(-4 + 2i3 + i4)]; S1[i0, i1, i2, i3] -> [(-4 + 2i2 + i3)]; S3[i0, i1, i2, i3, i4] -> [(-4 + 2i3 + i4)] }, { S2[i0, i1, i2, i3, i4] -> [(i3)]; S1[i0, i1, i2, i3] -> [(i2)]; S3[i0, i1, i2, i3, i4] -> [(i3)] }]" options: "[M, N] -> { atomic[i0] }" child: sequence: - filter: "[M, N] -> { S3[i0, i1, i2, i3, i4] }" child: schedule: "[M, N] -> [{ S3[i0, i1, i2, i3, i4] -> [(i1)] }, { S3[i0, i1, i2, i3, i4] -> [(i4)] }]" options: "[M, N] -> { atomic[i0] }" - filter: "[M, N] -> { S1[i0, i1, i2, i3] }" - filter: "[M, N] -> { S2[i0, i1, i2, i3, i4] }" child: schedule: "[M, N] -> [{ S2[i0, i1, i2, i3, i4] -> [(i2)] }, { S2[i0, i1, i2, i3, i4] -> [(i4)] }]" options: "[M, N] -> { atomic[i0] }" - filter: "[M, N] -> { S4[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/basic-bounds-1.st0000644000175000017500000000022612554427055020577 00000000000000domain: "{ S1[i0] : i0 >= 0 and i0 <= 2 }" child: context: "{ [] }" child: schedule: "[{ S1[i0] -> [(i0)] }]" options: "{ separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/lu.c0000644000175000017500000000031412413256472016277 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.4/isl/test_inputs/codegen/cloog/levenshtein-1-2-3.st0000644000175000017500000000302112554427055021045 00000000000000domain: "[M, N] -> { S5[i0, i1] : 2i1 = -N + i0 and i0 >= 2 + N and i0 <= -2 + 2M - N and N >= 1; S3[i0, i0] : i0 >= 1 and i0 <= N and N <= -2 + M; S7[i0, i1] : 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; S6[i0, i1] : 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; S1[0, 0] : N <= -2 + M and N >= 1; S2[i0, 0] : i0 >= 1 and i0 <= N and N <= -2 + M; S4[i0, i1] : 2i1 = N + i0 and i0 >= 2 + N and i0 <= -2 + 2M - N and N >= 1; S8[i0, i1] : i0 >= 1 + N and 2i1 <= N + i0 and 2i1 >= -N + i0 and i0 <= -2 + 2M - N and N <= -2 + M and N >= 1 }" child: context: "[M, N] -> { [] : N <= -2 + M and N >= 1 }" child: schedule: "[M, N] -> [{ S7[i0, i1] -> [(i0)]; S5[i0, i1] -> [(i0)]; S1[i0, i1] -> [(i0)]; S3[i0, i1] -> [(i0)]; S2[i0, i1] -> [(i0)]; S4[i0, i1] -> [(i0)]; S8[i0, i1] -> [(i0)]; S6[i0, i1] -> [(i0)] }, { S7[i0, i1] -> [(i1)]; S5[i0, i1] -> [(i1)]; S1[i0, i1] -> [(i1)]; S3[i0, i1] -> [(i1)]; S2[i0, i1] -> [(i1)]; S4[i0, i1] -> [(i1)]; S8[i0, i1] -> [(i1)]; S6[i0, i1] -> [(i1)] }]" options: "[M, N] -> { separate[i0] }" child: sequence: - filter: "[M, N] -> { S1[i0, i1] }" - filter: "[M, N] -> { S2[i0, i1] }" - filter: "[M, N] -> { S3[i0, i1] }" - filter: "[M, N] -> { S4[i0, i1] }" - filter: "[M, N] -> { S5[i0, i1] }" - filter: "[M, N] -> { S6[i0, i1] }" - filter: "[M, N] -> { S7[i0, i1] }" - filter: "[M, N] -> { S8[i0, i1] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/basic-bounds-5.st0000644000175000017500000000033112554427055020600 00000000000000domain: "[M] -> { S1[1, i1] : 2i1 >= M and 2i1 <= 1 + M }" child: context: "[M] -> { [] }" child: schedule: "[M] -> [{ S1[i0, i1] -> [(i0)] }, { S1[i0, i1] -> [(i1)] }]" options: "[M] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/gesced2.c0000644000175000017500000000106212413256472017174 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.4/isl/test_inputs/codegen/cloog/orc.c0000644000175000017500000000043612554427055016452 00000000000000{ for (int c0 = 0; c0 <= 2; c0 += 1) { S1(c0); for (int c1 = 0; c1 <= -c0 + 11; c1 += 1) { S2(c0, c1); S3(c0, c1); } S4(c0); } for (int c0 = 0; c0 <= 14; c0 += 1) { S5(c0); for (int c1 = 0; c1 <= 9; c1 += 1) S6(c0, c1); S7(c0); } } cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-loechner4.c0000644000175000017500000000033012554427055021561 00000000000000for (int c0 = 2; c0 <= 2 * M; c0 += 1) for (int c1 = 1; c1 <= M; c1 += 1) for (int c2 = 1; c2 <= M; c2 += 1) for (int c3 = max(1, -M + c0); c3 <= min(M, c0 - 1); c3 += 1) S1(c2, c1, c3, c0 - c3); cloog-0.18.4/isl/test_inputs/codegen/cloog/largeur.st0000644000175000017500000000036612554427055017536 00000000000000domain: "[M] -> { S1[i0, i1] : i0 >= 1 and i0 <= M and i1 >= i0 and i1 <= M }" child: context: "[M] -> { [] : M >= 0 }" child: schedule: "[M] -> [{ S1[i0, i1] -> [(i1)] }, { S1[i0, i1] -> [(i0)] }]" options: "[M] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-tang-xue1.c0000644000175000017500000000045112554427055021513 00000000000000for (int c0 = 0; c0 <= 9; c0 += 2) for (int c1 = 0; c1 <= min(4, c0 + 3); c1 += 2) for (int c2 = max(1, c0); c2 <= min(c0 + 1, c0 - c1 + 4); c2 += 1) for (int c3 = max(1, -c0 + c1 + c2); c3 <= min(4, -c0 + c1 + c2 + 1); c3 += 1) S1(c0 / 2, (-c0 + c1) / 2, -c0 + c2, -c1 + c3); cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-mg-resid.st0000644000175000017500000000245212554427055021620 00000000000000domain: "[M, N, O] -> { S3[i0, i1, i2] : i0 >= 2 and i0 <= -1 + O and i1 >= 2 and i1 <= -1 + N and i2 >= 2 and i2 <= -1 + M; S2[i0, i1, i2] : i0 >= 2 and i0 <= -1 + O and i1 >= 2 and i1 <= -1 + N and i2 >= 1 and i2 <= M; S1[i0, i1, i2] : i0 >= 2 and i0 <= -1 + O and i1 >= 2 and i1 <= -1 + N and i2 >= 1 and i2 <= M }" child: context: "[M, N, O] -> { [] }" child: schedule: "[M, N, O] -> [{ S3[i0, i1, i2] -> [(i0)]; S2[i0, i1, i2] -> [(i0)]; S1[i0, i1, i2] -> [(i0)] }]" options: "[M, N, O] -> { separate[i0] }" child: schedule: "[M, N, O] -> [{ S3[i0, i1, i2] -> [(2i1)]; S2[i0, i1, i2] -> [(-1 + 2i1)]; S1[i0, i1, i2] -> [(-1 + 2i1)] }]" options: "[M, N, O] -> { separate[i0] }" child: sequence: - filter: "[M, N, O] -> { S2[i0, i1, i2]; S1[i0, i1, i2] }" child: schedule: "[M, N, O] -> [{ S2[i0, i1, i2] -> [(i2)]; S1[i0, i1, i2] -> [(i2)] }]" options: "[M, N, O] -> { separate[i0] }" child: sequence: - filter: "[M, N, O] -> { S1[i0, i1, i2] }" - filter: "[M, N, O] -> { S2[i0, i1, i2] }" - filter: "[M, N, O] -> { S3[i0, i1, i2] }" child: schedule: "[M, N, O] -> [{ S3[i0, i1, i2] -> [(i2)] }]" options: "[M, N, O] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-pingali2.st0000644000175000017500000000132112554427055021610 00000000000000domain: "[M] -> { S1[i0, i1] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= M; S2[i0, i1] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= M }" child: context: "[M] -> { [] }" child: sequence: - filter: "[M] -> { S1[i0, i1] }" child: schedule: "[M] -> [{ S1[i0, i1] -> [(i0)] }]" options: "[M] -> { separate[i0] }" child: schedule: "[M] -> [{ S1[i0, i1] -> [(i1)] }]" options: "[M] -> { separate[i0] }" - filter: "[M] -> { S2[i0, i1] }" child: schedule: "[M] -> [{ S2[i0, i1] -> [(i0)] }]" options: "[M] -> { separate[i0] }" child: schedule: "[M] -> [{ S2[i0, i1] -> [(i1)] }]" options: "[M] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/vasilache.st0000644000175000017500000000401512554427055020027 00000000000000domain: "[M, N] -> { S5[i0, i1] : i0 >= 0 and i0 <= -1 + N and i1 >= 0 and i1 <= -1 + N; S8[]; S2[]; S7[i0, i1, i2, i3] : 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; S4[i0, i1] : i0 >= 0 and i0 <= -1 + N and i1 >= 0 and i1 <= -1 + N; S1[]; S3[] : M >= 79; S6[i0, i1, i2, i3] : 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 }" child: context: "[M, N] -> { [] : M <= 3 and N >= 100 }" child: sequence: - filter: "[M, N] -> { S1[] }" - filter: "[M, N] -> { S2[] }" - filter: "[M, N] -> { S3[] }" - filter: "[M, N] -> { S5[i0, i1]; S4[i0, i1] }" child: schedule: "[M, N] -> [{ S5[i0, i1] -> [(i0)]; S4[i0, i1] -> [(i0)] }]" options: "[M, N] -> { separate[i0] }" child: schedule: "[M, N] -> [{ S5[i0, i1] -> [(i1)]; S4[i0, i1] -> [(i1)] }]" options: "[M, N] -> { separate[i0] }" child: sequence: - filter: "[M, N] -> { S4[i0, i1] }" - filter: "[M, N] -> { S5[i0, i1] }" - filter: "[M, N] -> { S7[i0, i1, i2, i3]; S6[i0, i1, i2, i3] }" child: schedule: "[M, N] -> [{ S7[i0, i1, i2, i3] -> [(i0)]; S6[i0, i1, i2, i3] -> [(i0)] }]" options: "[M, N] -> { separate[i0] }" child: schedule: "[M, N] -> [{ S7[i0, i1, i2, i3] -> [(i1)]; S6[i0, i1, i2, i3] -> [(i1)] }]" options: "[M, N] -> { separate[i0] }" child: schedule: "[M, N] -> [{ S7[i0, i1, i2, i3] -> [(i2)]; S6[i0, i1, i2, i3] -> [(i2)] }]" options: "[M, N] -> { separate[i0] }" child: schedule: "[M, N] -> [{ S7[i0, i1, i2, i3] -> [(i3)]; S6[i0, i1, i2, i3] -> [(1 + i3)] }]" options: "[M, N] -> { separate[i0] }" child: sequence: - filter: "[M, N] -> { S6[i0, i1, i2, i3] }" - filter: "[M, N] -> { S7[i0, i1, i2, i3] }" - filter: "[M, N] -> { S8[] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/infinite2.c0000644000175000017500000000024312413256472017547 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.4/isl/test_inputs/codegen/cloog/nul_basic1.st0000644000175000017500000000034112554427055020106 00000000000000domain: "[M] -> { S1[i0, i1] : 2i1 = i0 and i0 >= 0 and i0 <= M }" child: context: "[M] -> { [] }" child: schedule: "[M] -> [{ S1[i0, i1] -> [(i0)] }, { S1[i0, i1] -> [(i1)] }]" options: "[M] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/ex1.c0000644000175000017500000000054212413256472016357 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.4/isl/test_inputs/codegen/cloog/reservoir-lim-lam4.st0000644000175000017500000000157212554427055021527 00000000000000domain: "[M] -> { S2[i0, i1, i2] : i0 >= 1 and i0 <= -1 + M and i1 >= 0 and i2 >= 1 + i1 and i2 <= -1 + M; S1[i0, i1, i2] : i0 >= 1 and i0 <= -1 + M and i1 >= 0 and i2 >= 0 and i2 <= -1 + M - i1 }" child: context: "[M] -> { [] }" child: schedule: "[M] -> [{ S1[i0, i1, i2] -> [(i0 + i1 + i2)]; S2[i0, i1, i2] -> [(i0 + i2)] }]" options: "[M] -> { separate[i0] }" child: schedule: "[M] -> [{ S1[i0, i1, i2] -> [(-i2)]; S2[i0, i1, i2] -> [(i1 - i2)] }]" options: "[M] -> { separate[i0] }" child: sequence: - filter: "[M] -> { S1[i0, i1, i2] }" child: schedule: "[M] -> [{ S1[i0, i1, i2] -> [(i2)] }]" options: "[M] -> { separate[i0] }" - filter: "[M] -> { S2[i0, i1, i2] }" child: schedule: "[M] -> [{ S2[i0, i1, i2] -> [(i2)] }]" options: "[M] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/pouchet.c0000644000175000017500000000075412413270107017325 00000000000000for (int c0 = 1; c0 <= floord(Ny, 2) + 2; c0 += 1) for (int c1 = max(c0 - 1, c0 / 2 + 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, Ny - 1, c2); } cloog-0.18.4/isl/test_inputs/codegen/cloog/iftest.st0000644000175000017500000000036212554427055017367 00000000000000domain: "[m, n] -> { S1[i0] : (i0 >= m and i0 >= 1 and i0 <= n) or (i0 >= 1 and i0 <= n and i0 <= 2m) }" child: context: "[m, n] -> { [] }" child: schedule: "[m, n] -> [{ S1[i0] -> [(i0)] }]" options: "[m, n] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/pouchet.st0000644000175000017500000000147512554427055017546 00000000000000domain: "[Ny] -> { S1[i0, i1, 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 >= 0 and i0 <= 1 and i1 >= 1 + i0 and 2i1 <= Ny + 2i0 and i4 >= 1 and i4 <= 2 }" child: context: "[Ny] -> { [] }" child: schedule: "[Ny] -> [{ S1[i0, i1, i2, i3, i4] -> [(i0 + i1)]; S2[i0, i1, i2, i3, i4] -> [(i0 + i1)] }, { S1[i0, i1, i2, i3, i4] -> [(i1)]; S2[i0, i1, i2, i3, i4] -> [(i1)] }, { S1[i0, i1, i2, i3, i4] -> [(i4)]; S2[i0, i1, i2, i3, i4] -> [(i4)] }, { S1[i0, i1, i2, i3, i4] -> [(i2)]; S2[i0, i1, i2, i3, i4] -> [(i2)] }, { S1[i0, i1, i2, i3, i4] -> [(i3)]; S2[i0, i1, i2, i3, i4] -> [(1 + i3)] }, { S1[i0, i1, i2, i3, i4] -> [(i4)]; S2[i0, i1, i2, i3, i4] -> [(1 + i4)] }]" options: "[Ny] -> { separate[x] : x >= 2 }" cloog-0.18.4/isl/test_inputs/codegen/cloog/dot.st0000644000175000017500000000072512554427055016662 00000000000000domain: "[M, N] -> { S1[0, i1] : i1 <= M and N >= 0 and i1 >= 1; S2[i0, i1] : i0 >= 1 and i1 <= M and i0 <= N and i1 >= 1 }" child: context: "[M, N] -> { [] : M >= 1 and N >= 1 }" child: schedule: "[M, N] -> [{ S1[i0, i1] -> [(i0)]; S2[i0, i1] -> [(i0)] }, { S1[i0, i1] -> [(i1)]; S2[i0, i1] -> [(i1)] }]" options: "[M, N] -> { separate[i0] }" child: sequence: - filter: "[M, N] -> { S1[i0, i1] }" - filter: "[M, N] -> { S2[i0, i1] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/esced.c0000644000175000017500000000014612413256472016745 00000000000000for (int c0 = 1; c0 <= m; c0 += 1) { S1(c0); for (int c1 = 1; c1 <= n; c1 += 1) S2(c0, c1); } cloog-0.18.4/isl/test_inputs/codegen/cloog/block2.st0000644000175000017500000000071712554427055017251 00000000000000domain: "{ S2[i0, 1] : i0 >= 0 and i0 <= 9; S1[i0, 1] : i0 >= 0 and i0 <= 9; S3[i0, 1] : i0 >= 0 and i0 <= 9 }" child: context: "{ [] }" child: schedule: "[{ S3[i0, i1] -> [(i0)]; S1[i0, i1] -> [(i0)]; S2[i0, i1] -> [(i0)] }, { S3[i0, i1] -> [(i1)]; S1[i0, i1] -> [(i1)]; S2[i0, i1] -> [(i1)] }]" options: "{ separate[i0] }" child: sequence: - filter: "{ S1[i0, i1] }" - filter: "{ S3[i0, i1] }" - filter: "{ S2[i0, i1] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/walters.c0000644000175000017500000000063212413256472017343 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.4/isl/test_inputs/codegen/cloog/reservoir-pingali6.c0000644000175000017500000000034712554427055021417 00000000000000for (int c0 = 1; c0 <= M; c0 += 1) { for (int c2 = 2; c2 < N; c2 += 1) for (int c3 = 2; c3 < N; c3 += 1) S1(c0, c2, c3); for (int c2 = 2; c2 < N; c2 += 1) for (int c3 = 2; c3 < N; c3 += 1) S2(c0, c2, c3); } cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-lim-lam2.c0000644000175000017500000000036012554427055021313 00000000000000{ for (int c0 = 1; c0 <= M; c0 += 1) S1(c0); for (int c0 = 1; c0 <= M; c0 += 1) for (int c1 = 2; c1 <= N; c1 += 1) S2(c0, c1); for (int c0 = 1; c0 <= M; c0 += 1) for (int c1 = 1; c1 < N; c1 += 1) S3(c0, c1); } cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-stride2.st0000644000175000017500000000031412554427055021460 00000000000000domain: "[M] -> { S1[i0, i1] : 7i1 = -2 + i0 and i0 >= 0 and i0 <= M }" child: context: "[M] -> { [] }" child: schedule: "[M] -> [{ S1[i0, i1] -> [(i0)] }]" options: "[M] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/square+triangle-1-1-2-3.c0000644000175000017500000000027212413256472021556 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.4/isl/test_inputs/codegen/cloog/basic-bounds-3.st0000644000175000017500000000027312554427055020603 00000000000000domain: "[M] -> { S1[i0] : i0 >= 0 and i0 <= M }" child: context: "[M] -> { [] : M >= 0 }" child: schedule: "[M] -> [{ S1[i0] -> [(i0)] }]" options: "[M] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/walters3.c0000644000175000017500000000016712413256472017431 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.4/isl/test_inputs/codegen/cloog/equality2.st0000644000175000017500000000531412554427055020012 00000000000000domain: "{ S1[i0, i1, 1, 2, i0, i5, -999 + i1, i0, -999 + i1, i9, i10] : 2i5 = 2 + i1 and 2i9 = -998 + i1 and 2i10 = -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 >= 1 and i0 <= 10000 and i1 >= 1000 and i1 <= 1008 }" child: context: "{ [] }" child: schedule: "[{ S1[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10] -> [(i0)]; S2[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12, i13, i14] -> [(i0)] }, { S1[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10] -> [(i1)]; S2[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12, i13, i14] -> [(i1)] }, { S1[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10] -> [(i2)]; S2[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12, i13, i14] -> [(i2)] }, { S1[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10] -> [(i3)]; S2[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12, i13, i14] -> [(i3)] }, { S1[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10] -> [(i4)]; S2[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12, i13, i14] -> [(i4)] }, { S1[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10] -> [(i5)]; S2[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12, i13, i14] -> [(i5)] }, { S1[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10] -> [(i6)]; S2[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12, i13, i14] -> [(i6)] }, { S1[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10] -> [(i7)]; S2[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12, i13, i14] -> [(i7)] }, { S1[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10] -> [(i8)]; S2[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12, i13, i14] -> [(i8)] }, { S1[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10] -> [(i9)]; S2[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12, i13, i14] -> [(i9)] }, { S1[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10] -> [(i10)]; S2[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12, i13, i14] -> [(i10)] }, { S1[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10] -> [(0)]; S2[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12, i13, i14] -> [(i11)] }, { S1[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10] -> [(0)]; S2[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12, i13, i14] -> [(i12)] }, { S1[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10] -> [(0)]; S2[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12, i13, i14] -> [(i13)] }, { S1[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10] -> [(0)]; S2[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12, i13, i14] -> [(i14)] }]" options: "{ atomic[i0] }" child: sequence: - filter: "{ S1[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10] }" - filter: "{ S2[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12, i13, i14] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-loechner3.c0000644000175000017500000000025312554427055021564 00000000000000for (int c0 = 1; c0 <= M; c0 += 1) for (int c1 = 2; c1 <= M + c0; c1 += 1) for (int c2 = max(1, -c0 + c1); c2 <= min(M, c1 - 1); c2 += 1) S1(c0, c2, c1 - c2); cloog-0.18.4/isl/test_inputs/codegen/cloog/multi-stride.c0000644000175000017500000000000412413256472020275 00000000000000{ } cloog-0.18.4/isl/test_inputs/codegen/cloog/stride.c0000644000175000017500000000020412413256472017147 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.4/isl/test_inputs/codegen/cloog/unroll2.c0000644000175000017500000000010112554427055017251 00000000000000if (n >= -1 && n <= 9) { if (n >= 0) S1(n); S1(n + 1); } cloog-0.18.4/isl/test_inputs/codegen/cloog/emploi.c0000644000175000017500000000014612413256472017147 00000000000000for (int c0 = 1; c0 <= n; c0 += 1) { S1(c0); for (int c1 = 1; c1 <= m; c1 += 1) S2(c0, c1); } cloog-0.18.4/isl/test_inputs/codegen/cloog/multi-mm-1.st0000644000175000017500000000073112554427055017770 00000000000000domain: "[M, N] -> { S1[i0, i1] : i1 >= 0 and i1 <= i0 and i0 <= M; S2[i0, i1] : i1 >= 0 and i1 <= i0 and i0 <= M and i1 <= N }" child: context: "[M, N] -> { [] : N <= M and N >= 1 }" child: schedule: "[M, N] -> [{ S1[i0, i1] -> [(i0)]; S2[i0, i1] -> [(i0)] }, { S1[i0, i1] -> [(i1)]; S2[i0, i1] -> [(i1)] }]" options: "[M, N] -> { separate[i0] }" child: sequence: - filter: "[M, N] -> { S1[i0, i1] }" - filter: "[M, N] -> { S2[i0, i1] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-long.c0000644000175000017500000000055212554427055020643 00000000000000for (int c0 = 1; c0 < O; c0 += 1) { for (int c1 = Q; c1 < N; c1 += 1) { for (int c2 = P; c2 < M; c2 += 1) S1(c0, c1, c2); for (int c2 = 1; c2 < M; c2 += 1) S2(c0, c1, c2); } for (int c1 = 1; c1 < N; c1 += 1) { for (int c2 = P; c2 < M; c2 += 1) S3(c0, c1, c2); for (int c2 = 1; c2 < M; c2 += 1) S4(c0, c1, c2); } } cloog-0.18.4/isl/test_inputs/codegen/cloog/mode.c0000644000175000017500000000036712413270107016602 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 = 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.4/isl/test_inputs/codegen/cloog/walters.st0000644000175000017500000000304012554427055017546 00000000000000domain: "{ S2[i, div36, div37, div38] : 3div37 = 2 + i and i >= 1 and i <= 10 and 3div36 >= -2 + i and 3div38 <= 1 + i and 3div38 >= -1 + i and 3div36 <= i; S4[i, div36, div37, div38] : 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; S1[i, div36, div37, div38] : 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] : 3div38 = 1 + i and i <= 10 and i >= 2 and 3div36 >= -2 + i and 3div37 <= 2 + i and 3div36 <= i and 3div37 >= i }" child: context: "{ [] }" child: schedule: "[{ S1[i, div36, div37, div38] -> [(i)]; S4[i, div36, div37, div38] -> [(i)]; S3[i, div36, div37, div38] -> [(i)]; S2[i, div36, div37, div38] -> [(i)] }, { S1[i, div36, div37, div38] -> [(div36)]; S4[i, div36, div37, div38] -> [(div36)]; S3[i, div36, div37, div38] -> [(div36)]; S2[i, div36, div37, div38] -> [(div36)] }, { S1[i, div36, div37, div38] -> [(div37)]; S4[i, div36, div37, div38] -> [(div37)]; S3[i, div36, div37, div38] -> [(div37)]; S2[i, div36, div37, div38] -> [(div37)] }, { S1[i, div36, div37, div38] -> [(div38)]; S4[i, div36, div37, div38] -> [(div38)]; S3[i, div36, div37, div38] -> [(div38)]; S2[i, div36, div37, div38] -> [(div38)] }]" options: "{ separate[i0] }" child: sequence: - filter: "{ S1[i, div36, div37, div38] }" - filter: "{ S2[i, div36, div37, div38] }" - filter: "{ S3[i, div36, div37, div38] }" - filter: "{ S4[i, div36, div37, div38] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/uday_scalars.c0000644000175000017500000000016212554427055020335 00000000000000{ for (int c0 = 0; c0 <= n; c0 += 1) S1(c0, 0, 0); for (int c0 = 0; c0 <= n; c0 += 1) S2(0, c0, 0); } cloog-0.18.4/isl/test_inputs/codegen/cloog/infinite2.st0000644000175000017500000000065612554427055017766 00000000000000domain: "[M, N] -> { S1[i0] : i0 >= 1; S2[i0, i1] : i0 >= 1 and i0 <= N and i1 >= 1 and i1 <= M }" child: context: "[M, N] -> { [] : M >= 1 and N >= 1 }" child: schedule: "[M, N] -> [{ S2[i0, i1] -> [(i0)]; S1[i0] -> [(i0)] }, { S2[i0, i1] -> [(i1)]; S1[i0] -> [(0)] }]" options: "[M, N] -> { separate[i0] }" child: sequence: - filter: "[M, N] -> { S1[i0] }" - filter: "[M, N] -> { S2[i0, i1] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-mg-resid.c0000644000175000017500000000041112554427055021405 00000000000000for (int c0 = 2; c0 < O; c0 += 1) for (int c1 = 3; c1 < 2 * N - 2; c1 += 2) { for (int c3 = 1; c3 <= M; c3 += 1) { S1(c0, (c1 + 1) / 2, c3); S2(c0, (c1 + 1) / 2, c3); } for (int c3 = 2; c3 < M; c3 += 1) S3(c0, (c1 + 1) / 2, c3); } cloog-0.18.4/isl/test_inputs/codegen/cloog/dealII.c0000644000175000017500000000142312554427055017013 00000000000000{ if (T_67 == 0 && T_66 <= -1) { S1(0); } else if (T_2 >= 1 && T_67 >= 1 && T_66 <= -1) { S1(0); } else if (T_2 >= 1 && T_67 >= 1 && T_66 >= 0) { S1(0); S2(0); } for (int c0 = 1; c0 <= min(min(T_2 - 1, T_67 - 1), T_66); c0 += 1) { S1(c0); S2(c0); } for (int c0 = max(1, T_66 + 1); c0 < min(T_2, T_67); c0 += 1) S1(c0); if (T_2 >= 1 && T_67 == 0 && T_66 >= 0) { S1(0); S2(0); } for (int c0 = max(1, T_67); c0 <= min(T_2 - 1, T_66); c0 += 1) { S1(c0); S2(c0); } for (int c0 = max(max(1, T_67), T_66 + 1); c0 < T_2; c0 += 1) S1(c0); if (T_2 == 0 && T_67 >= 1 && T_66 >= 0) S2(0); for (int c0 = max(1, T_2); c0 <= min(T_67 - 1, T_66); c0 += 1) S2(c0); if (T_2 == 0 && T_67 == 0 && T_66 >= 0) S1(0); } cloog-0.18.4/isl/test_inputs/codegen/cloog/cholesky.st0000644000175000017500000000260312554427055017712 00000000000000domain: "[n] -> { S2[i0, i1] : i0 >= 1 and i0 <= n and i1 >= 1 and i1 <= -1 + i0; S1[i0] : i0 >= 1 and i0 <= n; S4[i0, i1] : i0 >= 1 and i0 <= n and i1 >= 1 + i0 and i1 <= n; S5[i0, i1, i2] : i0 >= 1 and i0 <= n and i1 >= 1 + i0 and i1 <= n and i2 >= 1 and i2 <= -1 + i0; S6[i0, i1] : i0 >= 1 and i0 <= n and i1 >= 1 + i0 and i1 <= n; S3[i0] : i0 >= 1 and i0 <= n }" child: context: "[n] -> { [] }" child: schedule: "[n] -> [{ S1[i0] -> [(i0)]; S4[i0, i1] -> [(i0)]; S6[i0, i1] -> [(i0)]; S3[i0] -> [(i0)]; S5[i0, i1, i2] -> [(i0)]; S2[i0, i1] -> [(i0)] }]" options: "[n] -> { separate[i0] }" child: sequence: - filter: "[n] -> { S1[i0] }" - filter: "[n] -> { S2[i0, i1] }" child: schedule: "[n] -> [{ S2[i0, i1] -> [(i1)] }]" options: "[n] -> { separate[i0] }" - filter: "[n] -> { S3[i0] }" - filter: "[n] -> { S4[i0, i1]; S5[i0, i1, i2]; S6[i0, i1] }" child: schedule: "[n] -> [{ S4[i0, i1] -> [(i1)]; S6[i0, i1] -> [(i1)]; S5[i0, i1, i2] -> [(i1)] }]" options: "[n] -> { separate[i0] }" child: sequence: - filter: "[n] -> { S4[i0, i1] }" - filter: "[n] -> { S5[i0, i1, i2] }" child: schedule: "[n] -> [{ S5[i0, i1, i2] -> [(i2)] }]" options: "[n] -> { separate[i0] }" - filter: "[n] -> { S6[i0, i1] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/forwardsub-1-1-2.st0000644000175000017500000000123212554427055020677 00000000000000domain: "[M] -> { S4[i0, i0] : M >= 3 and i0 <= M and i0 >= 2; S1[i0, 1] : M >= 3 and i0 <= M and i0 >= 2; S3[1, 1] : M >= 3; S2[i0, i1] : i1 <= -1 + i0 and i1 >= 2 and i0 <= M }" child: context: "[M] -> { [] : M >= 3 }" child: schedule: "[M] -> [{ S1[i0, i1] -> [(i0)]; S4[i0, i1] -> [(i0)]; S3[i0, i1] -> [(i0)]; S2[i0, i1] -> [(i0)] }, { S1[i0, i1] -> [(i1)]; S4[i0, i1] -> [(i1)]; S3[i0, i1] -> [(i1)]; S2[i0, i1] -> [(i1)] }]" options: "[M] -> { separate[i0] }" child: sequence: - filter: "[M] -> { S1[i0, i1] }" - filter: "[M] -> { S2[i0, i1] }" - filter: "[M] -> { S3[i0, i1] }" - filter: "[M] -> { S4[i0, i1] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/donotsimp.c0000644000175000017500000000022412554427055017676 00000000000000for (int c0 = 1; c0 <= 10; c0 += 1) { for (int c1 = 1; c1 <= c0; c1 += 1) S1(c0, c1); for (int c1 = 11; c1 <= M; c1 += 1) S2(c0, c1); } cloog-0.18.4/isl/test_inputs/codegen/cloog/cholesky2.st0000644000175000017500000000156112554427055017776 00000000000000domain: "[M] -> { S4[i0, i1] : i0 >= 1 and i0 <= M and i1 >= 1 + i0 and i1 <= M; S5[i0, i1, i2] : i0 >= 1 and i0 <= M and i1 >= 1 + i0 and i1 <= M and i2 >= 1 and i2 <= -1 + i0; S6[i0, i1] : i0 >= 1 and i0 <= M and i1 >= 1 + i0 and i1 <= M; S3[i0] : i0 >= 1 and i0 <= M; S2[i0, i1] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= -1 + i0; S1[i0] : i0 >= 1 and i0 <= M }" child: context: "[M] -> { [] }" child: schedule: "[M] -> [{ S1[i0] -> [(0)]; S3[i0] -> [(-2 + 3i0)]; S4[i0, i1] -> [(0)]; S5[i0, i1, i2] -> [(-1 + 3i2)]; S2[i0, i1] -> [(3i1)]; S6[i0, i1] -> [(-1 + 3i0)] }, { S1[i0] -> [(i0)]; S3[i0] -> [(0)]; S4[i0, i1] -> [(i0)]; S5[i0, i1, i2] -> [(i1)]; S2[i0, i1] -> [(i0)]; S6[i0, i1] -> [(i1)] }, { S1[i0] -> [(0)]; S3[i0] -> [(0)]; S4[i0, i1] -> [(i1)]; S5[i0, i1, i2] -> [(i2)]; S2[i0, i1] -> [(0)]; S6[i0, i1] -> [(0)] }]" options: "[M] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/block2.c0000644000175000017500000000011612413256472017033 00000000000000for (int c0 = 0; c0 <= 9; c0 += 1) { S1(c0, 1); S3(c0, 1); S2(c0, 1); } cloog-0.18.4/isl/test_inputs/codegen/cloog/christian.st0000644000175000017500000000050412554427055020053 00000000000000domain: "[N] -> { S1[i0, i1] : i0 >= 0 and i0 <= -1 + N and i1 >= 0 and i1 <= -1 + N; S2[i0, i1] : i0 >= 0 and i0 <= -1 + N and i1 >= 0 and i1 <= -1 + N }" child: context: "[N] -> { [] }" child: schedule: "[N] -> [{ S1[i0, i1] -> [(i0 - i1)]; S2[i0, i1] -> [(1 + i0 - i1)] }]" options: "[N] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-stride.st0000644000175000017500000000031412554427055021376 00000000000000domain: "[M] -> { S1[i0, i1] : 7i1 = -2 + i0 and i0 >= 2 and i0 <= M }" child: context: "[M] -> { [] }" child: schedule: "[M] -> [{ S1[i0, i1] -> [(i0)] }]" options: "[M] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/multi-stride2.c0000644000175000017500000000011312413256472020360 00000000000000for (int c0 = 5; c0 <= 100; c0 += 6) S1(c0, (c0 - 1) / 2, (c0 - 2) / 3); cloog-0.18.4/isl/test_inputs/codegen/cloog/0D-1.c0000644000175000017500000000000612413256472016256 00000000000000S1(); cloog-0.18.4/isl/test_inputs/codegen/cloog/nul_basic2.st0000644000175000017500000000066012554427055020113 00000000000000domain: "[n] -> { S1[i0, i1] : 2i1 = i0 and i0 >= 1 and i0 <= n; S2[i0, i1] : 4i1 = i0 and i0 >= 1 and i0 <= n }" child: context: "[n] -> { [] : n >= 2 }" child: schedule: "[n] -> [{ S2[i0, i1] -> [(i0)]; S1[i0, i1] -> [(i0)] }, { S2[i0, i1] -> [(i1)]; S1[i0, i1] -> [(i1)] }]" options: "[n] -> { separate[i0] }" child: sequence: - filter: "[n] -> { S1[i0, i1] }" - filter: "[n] -> { S2[i0, i1] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/stride4.c0000644000175000017500000000011512413256472017234 00000000000000if (t >= 0 && t <= 15) for (int c0 = t; c0 <= 99; c0 += 16) S1(c0, t); cloog-0.18.4/isl/test_inputs/codegen/cloog/unroll.st0000644000175000017500000000025412554427055017404 00000000000000domain: "[n] -> { S1[i] : i >= 0 and i <= 10 }" child: context: "[n] -> { [] }" child: schedule: "[n] -> [{ S1[i] -> [(i)] }]" options: "[n] -> { unroll[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/backtrack.c0000644000175000017500000000000712413256472017603 00000000000000S1(0); cloog-0.18.4/isl/test_inputs/codegen/cloog/merge.st0000644000175000017500000000052112554427055017165 00000000000000domain: "{ S3[i0] : i0 >= 0 and i0 <= 10; S1[0]; S2[i0] : i0 >= 2 and i0 <= 10 }" child: context: "{ [] }" child: schedule: "[{ S2[i0] -> [(i0)]; S3[i0] -> [(i0)]; S1[i0] -> [(i0)] }]" options: "{ atomic[i0] }" child: sequence: - filter: "{ S1[i0] }" - filter: "{ S2[i0] }" - filter: "{ S3[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/vivien2.st0000644000175000017500000000160612554427055017455 00000000000000domain: "[n] -> { S2[i, j] : 29j >= 1 - i and i <= n and j >= 1 and j <= -1 + i; S1[i] : i >= 1 - 27n and i <= 28 + n; S4[i, j] : i >= 1 and i <= n and j >= 1 + i and j <= n; S5[i, j, k] : i >= 1 and i <= n and j >= 1 + i and j <= n and k >= 1 and k <= -1 + i; S6[i, j] : i >= 1 and i <= n and j >= 1 + i and j <= n; S3[i] : i >= 1 and i <= n }" child: context: "[n] -> { [] : n >= 30 }" child: schedule: "[n] -> [{ S1[i0] -> [(2 + 2i0)]; S4[i0, i1] -> [(2i0 + 2i1)]; S6[i0, i1] -> [(2i0 + 2i1)]; S3[i0] -> [(1 + 4i0)]; S5[i0, i1, i2] -> [(2i0 + 2i1)]; S2[i0, i1] -> [(1 + 2i0 + 2i1)] }, { S1[i0] -> [(0)]; S4[i0, i1] -> [(-i0)]; S6[i0, i1] -> [(2 - i0)]; S3[i0] -> [(0)]; S5[i0, i1, i2] -> [(1 - i0)]; S2[i0, i1] -> [(i1)] }, { S1[i0] -> [(0)]; S4[i0, i1] -> [(0)]; S6[i0, i1] -> [(0)]; S3[i0] -> [(0)]; S5[i0, i1, i2] -> [(i2)]; S2[i0, i1] -> [(0)] }]" options: "[n] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-jacobi2.c0000644000175000017500000000012612554427055021212 00000000000000for (int c0 = 0; c0 < M; c0 += 1) for (int c1 = 0; c1 < M; c1 += 1) S1(c0, c1); cloog-0.18.4/isl/test_inputs/codegen/cloog/mod2.st0000644000175000017500000000032012554427055016724 00000000000000domain: "{ S1[i] : exists (e0 = floor((1 + i)/3): 3e0 <= i and 3e0 >= -1 + i and i >= 0 and i <= 3) }" child: context: "{ [] }" child: schedule: "[{ S1[i] -> [(i)] }]" options: "{ separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-lim-lam3.st0000644000175000017500000000214712554427055021525 00000000000000domain: "[M] -> { S4[i0] : i0 >= 1 and i0 <= M; S3[i0, i1] : i0 <= M and i1 >= 1 and i1 <= -1 + i0; S2[i0, i1] : i0 <= M and i1 >= 1 and i1 <= -1 + i0; S1[i0, i1, i2] : i0 <= M and i1 <= -1 + i0 and i2 >= 1 and i2 <= -1 + i1 }" child: context: "[M] -> { [] : M >= 1 }" child: schedule: "[M] -> [{ S4[i0] -> [(5i0)]; S1[i0, i1, i2] -> [(5 + i0 + 2i1 + 2i2)]; S3[i0, i1] -> [(1 + 3i0 + 2i1)]; S2[i0, i1] -> [(3 + i0 + 4i1)] }]" options: "[M] -> { separate[i0] }" child: sequence: - filter: "[M] -> { S1[i0, i1, i2] }" child: schedule: "[M] -> [{ S1[i0, i1, i2] -> [(i1)] }]" options: "[M] -> { separate[i0] }" child: schedule: "[M] -> [{ S1[i0, i1, i2] -> [(i2)] }]" options: "[M] -> { separate[i0] }" - filter: "[M] -> { S2[i0, i1] }" child: schedule: "[M] -> [{ S2[i0, i1] -> [(i1)] }]" options: "[M] -> { separate[i0] }" - filter: "[M] -> { S4[i0]; S3[i0, i1] }" child: schedule: "[M] -> [{ S4[i0] -> [(0)]; S3[i0, i1] -> [(i1)] }]" options: "[M] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/cholesky.c0000644000175000017500000000037512554427055017512 00000000000000for (int c0 = 1; c0 <= n; c0 += 1) { S1(c0); for (int c1 = 1; c1 < c0; c1 += 1) S2(c0, c1); S3(c0); for (int c1 = c0 + 1; c1 <= n; c1 += 1) { S4(c0, c1); for (int c2 = 1; c2 < c0; c2 += 1) S5(c0, c1, c2); S6(c0, c1); } } cloog-0.18.4/isl/test_inputs/codegen/cloog/singleton.st0000644000175000017500000000017512554427055020075 00000000000000domain: "{ S1[]; S2[] }" child: context: "{ [] }" child: sequence: - filter: "{ S2[] }" - filter: "{ S1[] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-lim-lam1.st0000644000175000017500000000077012554427055021523 00000000000000domain: "{ S2[i0, i1] : i0 >= 1 and i0 <= 100 and i1 >= 1 and i1 <= 100; S1[i0, i1] : i0 >= 1 and i0 <= 100 and i1 >= 1 and i1 <= 100 }" child: context: "{ [] }" child: schedule: "[{ S1[i0, i1] -> [(i0 - i1)]; S2[i0, i1] -> [(1 + i0 - i1)] }]" options: "{ separate[i0] }" child: schedule: "[{ S1[i0, i1] -> [(2i1)]; S2[i0, i1] -> [(-1 + 2i1)] }]" options: "{ separate[i0] }" child: sequence: - filter: "{ S1[i0, i1] }" - filter: "{ S2[i0, i1] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/forwardsub-3-1-2.st0000644000175000017500000000126312554427055020705 00000000000000domain: "[M] -> { S4[i0, i1] : 2i1 = i0 and M >= 3 and i0 <= 2M and i0 >= 4; S1[i0, 1] : M >= 3 and i0 <= 1 + M and i0 >= 3; S3[2, 1] : M >= 3; S2[i0, i1] : 2i1 <= -1 + i0 and i1 >= 2 and i1 >= -M + i0 }" child: context: "[M] -> { [] : M >= 3 }" child: schedule: "[M] -> [{ S1[i0, i1] -> [(i0)]; S4[i0, i1] -> [(i0)]; S3[i0, i1] -> [(i0)]; S2[i0, i1] -> [(i0)] }, { S1[i0, i1] -> [(i1)]; S4[i0, i1] -> [(i1)]; S3[i0, i1] -> [(i1)]; S2[i0, i1] -> [(i1)] }]" options: "[M] -> { separate[i0] }" child: sequence: - filter: "[M] -> { S1[i0, i1] }" - filter: "[M] -> { S2[i0, i1] }" - filter: "[M] -> { S3[i0, i1] }" - filter: "[M] -> { S4[i0, i1] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/donotsimp.st0000644000175000017500000000065612554427055020113 00000000000000domain: "[M] -> { S1[i0, i1] : i0 >= 1 and i0 <= 10 and i1 >= 1 and i1 <= i0; S2[i0, i1] : i0 >= 1 and i0 <= 10 and i1 >= 11 and i1 <= M }" child: context: "[M] -> { [] : M >= 20 }" child: schedule: "[M] -> [{ S1[i0, i1] -> [(i0)]; S2[i0, i1] -> [(i0)] }]" options: "[M] -> { separate[i0] }" child: schedule: "[M] -> [{ S1[i0, i1] -> [(i1)]; S2[i0, i1] -> [(i1)] }]" options: "[M] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/nul_complex1.st0000644000175000017500000000037212554427055020500 00000000000000domain: "[n] -> { S1[i0, i1] : i0 >= 0 and i0 <= n and i1 >= 0 and i1 <= n }" child: context: "[n] -> { [] }" child: schedule: "[n] -> [{ S1[i0, i1] -> [(2i0 + 3i1)] }, { S1[i0, i1] -> [(2i0 + 2i1)] }]" options: "[n] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/README0000644000175000017500000000012712413256472016375 00000000000000The tests in this directory have been adapted from the corresponding CLooG test cases. cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-liu-zhuge1.st0000644000175000017500000000143412554427055022102 00000000000000domain: "[M, N] -> { S3[i0, i1] : i0 >= 0 and i0 <= M and i1 >= 0 and i1 <= N; S1[i0, i1] : i0 >= 0 and i0 <= M and i1 >= 0 and i1 <= N; S2[i0, i1] : i0 >= 0 and i0 <= M and i1 >= 0 and i1 <= N }" child: context: "[M, N] -> { [] }" child: schedule: "[M, N] -> [{ S1[i0, i1] -> [(-4 + 3i0 + i1)]; S2[i0, i1] -> [(3i0 + i1)]; S3[i0, i1] -> [(3i0 + i1)] }]" options: "[M, N] -> { separate[i0] }" child: sequence: - filter: "[M, N] -> { S1[i0, i1]; S2[i0, i1] }" child: schedule: "[M, N] -> [{ S1[i0, i1] -> [(i1)]; S2[i0, i1] -> [(i1)] }]" options: "[M, N] -> { separate[i0] }" - filter: "[M, N] -> { S3[i0, i1] }" child: schedule: "[M, N] -> [{ S3[i0, i1] -> [(i1)] }]" options: "[M, N] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/cloog/reservoir-mg-psinv.c0000644000175000017500000000041112554427055021436 00000000000000for (int c0 = 2; c0 < O; c0 += 1) for (int c1 = 3; c1 < 2 * N - 2; c1 += 2) { for (int c3 = 1; c3 <= M; c3 += 1) { S1(c0, (c1 + 1) / 2, c3); S2(c0, (c1 + 1) / 2, c3); } for (int c3 = 2; c3 < M; c3 += 1) S3(c0, (c1 + 1) / 2, c3); } cloog-0.18.4/isl/test_inputs/codegen/cloog/vivien.st0000644000175000017500000000157412554427055017377 00000000000000domain: "[n] -> { S2[i, j] : 29j >= 1 - i and i <= n and j >= 1 and j <= -1 + i; S1[i] : i >= 1 - 27n and i <= 28 + n; S4[i, j] : i >= 1 and i <= n and j >= 1 + i and j <= n; S5[i, j, k] : i >= 1 and i <= n and j >= 1 + i and j <= n and k >= 1 and k <= -1 + i; S6[i, j] : i >= 1 and i <= n and j >= 1 + i and j <= n; S3[i] : i >= 1 and i <= n }" child: context: "[n] -> { [] }" child: schedule: "[n] -> [{ S1[i0] -> [(2 + 2i0)]; S4[i0, i1] -> [(2i0 + 2i1)]; S6[i0, i1] -> [(2i0 + 2i1)]; S3[i0] -> [(1 + 4i0)]; S5[i0, i1, i2] -> [(2i0 + 2i1)]; S2[i0, i1] -> [(1 + 2i0 + 2i1)] }, { S1[i0] -> [(0)]; S4[i0, i1] -> [(-i0)]; S6[i0, i1] -> [(2 - i0)]; S3[i0] -> [(0)]; S5[i0, i1, i2] -> [(1 - i0)]; S2[i0, i1] -> [(i1)] }, { S1[i0] -> [(0)]; S4[i0, i1] -> [(0)]; S6[i0, i1] -> [(0)]; S3[i0] -> [(0)]; S5[i0, i1, i2] -> [(i2)]; S2[i0, i1] -> [(0)] }]" options: "[n] -> { separate[i0] }" cloog-0.18.4/isl/test_inputs/codegen/unroll8.c0000644000175000017500000000013012554427055016156 00000000000000for (int c0 = 0; c0 <= 99; c0 += 1) { A(c0, 0); A(c0, 1); B(c0, 0); B(c0, 1); } cloog-0.18.4/isl/test_inputs/codegen/stride.c0000644000175000017500000000022512413256472016047 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.4/isl/test_inputs/codegen/unroll2.c0000644000175000017500000000017412413256472016155 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.4/isl/test_inputs/codegen/atomic3.c0000644000175000017500000000017712413270107016111 00000000000000for (int c0 = 0; c0 <= 64; c0 += 1) { if (c0 >= 63) { sync(); } else if (c0 >= 1) { sync(); } else sync(); } cloog-0.18.4/isl/test_inputs/codegen/unroll9.c0000644000175000017500000000023012554427055016160 00000000000000for (int c0 = 0; c0 <= 99; c0 += 1) for (int c1 = 0; c1 <= 99; c1 += 1) { A(c1, 0, c0); A(c1, 1, c0); B(c1, 0, c0); B(c1, 1, c0); } cloog-0.18.4/isl/test_inputs/codegen/hoist2.in0000644000175000017500000000111412413256472016147 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.4/isl/test_inputs/codegen/separation_class3.in0000644000175000017500000000112212413256472020353 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.4/isl/test_inputs/codegen/stride6.c0000644000175000017500000000052112413270107016123 00000000000000for (int c1 = -1024; c1 <= 0; c1 += 32) for (int c2 = max(-((niter - 1) % 32) + niter - 1, -((niter - c1) % 32) + niter - c1 - 32); c2 <= min(niter + 1022, niter - c1 - 1); c2 += 32) for (int c5 = max(max(0, -c1 - 1023), niter - c1 - c2 - 32); c5 <= min(min(31, -c1), niter - c1 - c2 - 1); c5 += 1) S_4(niter - 1, -c1 - c5); cloog-0.18.4/isl/test_inputs/codegen/hoist2.c0000644000175000017500000000022512413271702015756 00000000000000for (int c0 = 1; c0 <= 5; c0 += 1) for (int c1 = t1 - 64 * b + 64; c1 <= min(70, -((c0 - 1) % 2) - c0 + 73); c1 += 64) A(c0, 64 * b + c1 - 8); cloog-0.18.4/isl/test_inputs/codegen/unroll9.st0000644000175000017500000000052012554427055016366 00000000000000# Check that options are interpreted locally domain: "{ A[i,j,k] : 0 <= i,k < 100 and 0 <= j < 2; B[i,j,k] : 0 <= i,k < 100 and 0 <= j < 2 }" child: schedule: "[{ A[i,j,k] -> [k]; B[i,j,k] -> [k] }]" child: schedule: "[{ A[i,j,k] -> [2i]; B[i,j,k] -> [2i+1] }, { A[i,j,k] -> [j]; B[i,j,k] -> [j]}]" options: "{ unroll[1] }" cloog-0.18.4/isl/test_inputs/codegen/separation_class3.c0000644000175000017500000000165612413271702020174 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(0, 2 * c0 - 1); c4 <= min(7, 2 * c0); c4 += 1) for (int c6 = -2 * c0 + c4 + 8; c6 <= 8; c6 += 1) S_0(c4, c6); if (c0 >= 1 && c0 <= 3) { 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.4/isl/test_inputs/codegen/stride5.in0000644000175000017500000000012412413256472016316 00000000000000[n] -> { S[t] -> [t] : exists e : 2 t - n = 4e and 0 <= t <= 100 } [n] -> { : } { } cloog-0.18.4/isl/test_inputs/codegen/atomic4.in0000644000175000017500000000031312413256472016277 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.4/isl/test_inputs/codegen/separate.in0000644000175000017500000000013012413256472016540 00000000000000{ a[i] -> [i] : 0 <= i < 10; b[i] -> [i+1] : 0 <= i < 10 } { : } { [i] -> separate[x] } cloog-0.18.4/isl/test_inputs/codegen/component0.c0000644000175000017500000000007312554427055016643 00000000000000{ A(); for (int c0 = 0; c0 <= 9; c0 += 1) B(c0); } cloog-0.18.4/isl/test_inputs/ex.pip0000644000175000017500000000013312413256472014131 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.4/isl/test_inputs/convex0.polylib0000644000175000017500000000006612413256472015766 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.4/isl/test_inputs/philippeNeg.pwqp0000644000175000017500000000012112413256472016155 00000000000000[N] -> { [i, j] -> ((1/2 * i + 1/2 * i^2) + j) : i <= N and j >= -1 and j <= i } cloog-0.18.4/isl/test_inputs/linearExample.pwqp0000644000175000017500000000021312413256472016501 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.4/isl/test_inputs/basicTestParameterPosNeg.pwqp0000644000175000017500000000007712413256472020621 00000000000000[p] -> { [n, m] -> (n + n^3) : n >= -1 and m >= n and m <= p } cloog-0.18.4/isl/test_inputs/square.pip0000644000175000017500000000010512413256472015014 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.4/isl/test_inputs/application2.omega0000644000175000017500000000015212413256472016403 00000000000000{[x] : x >= 0 && x <= 20 } {[x] -> [y] : y = 2x} {[y]: Exists ( alpha : 2alpha = y && 0 <= y && y <= 40)} cloog-0.18.4/isl/test_inputs/brisebarre.pip0000644000175000017500000000200112413256472015631 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.4/isl/test_inputs/equality4.pwqp0000644000175000017500000000013112413256472015633 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.4/isl/test_inputs/convex1.polylib0000644000175000017500000000037112413256472015766 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.4/isl/test_inputs/fimmel.pip0000644000175000017500000000015612413256472014773 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.4/isl/test_inputs/philippePolynomialCoeff.pwqp0000644000175000017500000000015412413256472020540 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.4/isl/test_inputs/equality5.pwqp0000644000175000017500000000015512413256472015642 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.4/isl/test_inputs/devos.pwqp0000644000175000017500000000015712413256472015042 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.4/isl/test_inputs/basicLinear.pwqp0000644000175000017500000000010412413256472016126 00000000000000[P, Q] -> { [n, m] -> n : n >= 1 and m >= n and m <= P and m <= Q } cloog-0.18.4/isl/test_inputs/basicTest.pwqp0000644000175000017500000000007612413256472015643 00000000000000[p] -> { [n, m] -> (n + n^2) : n >= 1 and m >= n and m <= p } cloog-0.18.4/isl/test_inputs/ex2.pip0000644000175000017500000000010512413256472014212 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.4/isl/test_inputs/tobi.pip0000644000175000017500000000035712413256472014462 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.4/isl/test_inputs/convex13.polylib0000644000175000017500000000041212413256472016045 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.4/isl/test_inputs/philippePolynomialCoeff1P.pwqp0000644000175000017500000000013612413256472020741 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.4/isl/test_inputs/convex3.polylib0000644000175000017500000000007412413256472015770 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.4/isl/test_inputs/basicLinear2.pwqp0000644000175000017500000000011112413256472016206 00000000000000[P, Q] -> { [n, m] -> n : n >= 1 and m >= n and m <= P and n >= -1 + Q } cloog-0.18.4/isl/test_inputs/philippe.pwqp0000644000175000017500000000012012413256472015522 00000000000000[N] -> { [i, j] -> ((1/2 * i + 1/2 * i^2) + j) : i <= N and j >= 0 and j <= i } cloog-0.18.4/isl/test_inputs/cg1.pip0000644000175000017500000000032712413256472014174 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.4/isl/test_inputs/convex6.polylib0000644000175000017500000000031612413256472015772 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.4/isl/test_inputs/product.pwqp0000644000175000017500000000017512413256472015402 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.4/isl/test_inputs/convex2.polylib0000644000175000017500000000066612413256472015776 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.4/isl/test_inputs/convex8.polylib0000644000175000017500000000061212413256472015773 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.4/isl/test_inputs/set.omega0000644000175000017500000000004412413256472014611 00000000000000{[y]: Exists ( alpha : 2alpha = y)} cloog-0.18.4/isl/test_inputs/convex4.polylib0000644000175000017500000000006212413256472015766 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.4/isl/test_inputs/sor1d.pip0000644000175000017500000000061612413256472014553 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.4/isl/test_inputs/convex15.polylib0000644000175000017500000000506012413256472016053 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.4/isl/test_inputs/unexpanded.pwqp0000644000175000017500000000013312413256472016047 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.4/isl/test_inputs/philippe3vars3pars.pwqp0000644000175000017500000000022112413256472017454 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.4/isl/test_inputs/affine2.polylib0000644000175000017500000000011312413256472015707 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.4/isl/test_inputs/boulet.pip0000644000175000017500000000015612413256472015014 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.4/isl/test_inputs/convex5.polylib0000644000175000017500000000012012413256472015762 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.4/isl/test_inputs/negative.pip0000644000175000017500000000013112413256472015315 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.4/isl/test_inputs/philippe3vars.pwqp0000644000175000017500000000015412413256472016510 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.4/isl/test_inputs/neg.pwqp0000644000175000017500000000011412413256472014464 00000000000000[n] -> { [i0] -> i0^2 : i0 >= -20 - n and i0 <= n and i0 <= -1 and n >= 0 } cloog-0.18.4/isl/test_inputs/split.pwqp0000644000175000017500000000006512413256472015053 00000000000000[n] -> { [x] -> -1 + [(x+5)/7] : -n - 20 <= x <= n } cloog-0.18.4/isl/test_inputs/esced.pip0000644000175000017500000000115012413256472014600 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.4/isl/test_inputs/small.pip0000644000175000017500000000007112413256472014626 000000000000000 2 -1 4 4 1 1 0 0 1 0 1 0 1 1 -3 12 1 -2 1 3 cloog-0.18.4/isl/test_inputs/toplas.pwqp0000644000175000017500000000034112413256472015217 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.4/isl/test_inputs/convex10.polylib0000644000175000017500000000022212413256472016041 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.4/isl/test_inputs/convex14.polylib0000644000175000017500000000013112413256472016044 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.4/isl/test_inputs/sven.pip0000644000175000017500000000003512413256472014471 000000000000000 3 -1 2 3 1 1 -4 1 -1 10 cloog-0.18.4/isl/test_inputs/faddeev.pwqp0000644000175000017500000000024312413256472015314 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.4/isl/test_inputs/equality1.pwqp0000644000175000017500000000010612413256472015632 00000000000000[n] -> { [x] -> 1 + [(x+1)/3] : exists a : x = 3a +1 && 0 <= x <= n } cloog-0.18.4/isl/test_inputs/equality2.pwqp0000644000175000017500000000007512413256472015640 00000000000000[n] -> { [x,y] -> x^2 * y : n = 2x + 4y and 0 <= x,y <= 10 } cloog-0.18.4/isl/test_inputs/equality3.pwqp0000644000175000017500000000011512413256472015634 00000000000000[m,n] -> { [x,y] -> x^2 * y : n = 2x + 4y and 0 <= x,y <= 10 and 3 n = 5 m } cloog-0.18.4/isl/isl_bernstein.c0000644000175000017500000003573212413270107013432 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 #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.4/isl/isl_ast_build.c0000644000175000017500000021752712554427055013427 00000000000000/* * Copyright 2012-2013 Ecole Normale Superieure * Copyright 2014 INRIA Rocquencourt * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, * Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt, * B.P. 105 - 78153 Le Chesnay, France */ #include #include #include #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(isl_space_copy(space)); isl_multi_aff_free(build->internal2input); build->internal2input = isl_multi_aff_identity(space); if (!build->iterators || !build->domain || !build->generated || !build->pending || !build->values || !build->internal2input || !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 fields 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; } /* Create an isl_ast_build with a universe (parametric) context. */ __isl_give isl_ast_build *isl_ast_build_alloc(isl_ctx *ctx) { isl_space *space; isl_set *context; space = isl_space_params_alloc(ctx, 0); context = isl_set_universe(space); return isl_ast_build_from_context(context); } __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->internal2input = isl_multi_aff_copy(build->internal2input); 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->before_each_mark = build->before_each_mark; dup->before_each_mark_user = build->before_each_mark_user; dup->after_each_mark = build->after_each_mark; dup->after_each_mark_user = build->after_each_mark_user; dup->create_leaf = build->create_leaf; dup->create_leaf_user = build->create_leaf_user; dup->node = isl_schedule_node_copy(build->node); if (build->loop_type) { int i; dup->n = build->n; dup->loop_type = isl_alloc_array(ctx, enum isl_ast_loop_type, dup->n); if (dup->n && !dup->loop_type) return isl_ast_build_free(dup); for (i = 0; i < dup->n; ++i) dup->loop_type[i] = build->loop_type[i]; } if (!dup->iterators || !dup->domain || !dup->generated || !dup->pending || !dup->values || !dup->strides || !dup->offsets || !dup->options || (build->internal2input && !dup->internal2input) || (build->executed && !dup->executed) || (build->value && !dup->value) || (build->node && !dup->node)) 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)); if (build->internal2input) { build->internal2input = isl_multi_aff_align_params(build->internal2input, model); if (!build->internal2input) return isl_ast_build_free(build); } else { 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); } __isl_null isl_ast_build *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_multi_aff_free(build->internal2input); 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); isl_schedule_node_free(build->node); free(build->loop_type); isl_set_free(build->isolated); 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 "before_each_mark" callback of "build" to "fn". */ __isl_give isl_ast_build *isl_ast_build_set_before_each_mark( __isl_take isl_ast_build *build, isl_stat (*fn)(__isl_keep isl_id *mark, __isl_keep isl_ast_build *build, void *user), void *user) { build = isl_ast_build_cow(build); if (!build) return NULL; build->before_each_mark = fn; build->before_each_mark_user = user; return build; } /* Set the "after_each_mark" callback of "build" to "fn". */ __isl_give isl_ast_build *isl_ast_build_set_after_each_mark( __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_mark = fn; build->after_each_mark_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->before_each_mark = NULL; build->before_each_mark_user = NULL; build->after_each_mark = NULL; build->after_each_mark_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); fprintf(stderr, "internal2input: "); isl_multi_aff_dump(build->internal2input); } /* 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 isl_stat 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 isl_stat_error; } /* Intersect "set" with the stride constraint of "build", if any. */ static __isl_give isl_set *intersect_stride_constraint(__isl_take isl_set *set, __isl_keep isl_ast_build *build) { isl_set *stride; if (!build) return isl_set_free(set); if (!isl_ast_build_has_stride(build, build->depth)) return set; stride = isl_ast_build_get_stride_constraint(build); return isl_set_intersect(set, stride); } /* Check if the given bounds on the current dimension (together with * the stride constraint, if any) 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)); set = intersect_stride_constraint(set, build); 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 and the stride information available in the build. * * 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. * Finally, we intersect build->domain with the updated bounds. * We also add the stride constraint unless we have been able * to find a fixed value expressed as a single affine expression. * * 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)); build->domain = isl_set_intersect(build->domain, set); } 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)); build->domain = isl_set_intersect(build->domain, set); build = isl_ast_build_include_stride(build); if (!build) goto error; } isl_basic_set_free(bounds); 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; } /* 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; } /* Replace the set of pending constraints by "guard", which is then * no longer considered as pending. * That is, add "guard" to the generated constraints and clear all pending * constraints, making the domain equal to the generated constraints. */ __isl_give isl_ast_build *isl_ast_build_replace_pending_by_guard( __isl_take isl_ast_build *build, __isl_take isl_set *guard) { build = isl_ast_build_restrict_generated(build, guard); build = isl_ast_build_cow(build); if (!build) return NULL; isl_set_free(build->domain); build->domain = isl_set_copy(build->generated); isl_set_free(build->pending); build->pending = isl_set_universe(isl_set_get_space(build->domain)); if (!build->pending) return isl_ast_build_free(build); return build; } /* 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; } /* Does "build" point to a band node? * That is, are we currently handling a band node inside a schedule tree? */ int isl_ast_build_has_schedule_node(__isl_keep isl_ast_build *build) { if (!build) return -1; return build->node != NULL; } /* Return a copy of the band node that "build" refers to. */ __isl_give isl_schedule_node *isl_ast_build_get_schedule_node( __isl_keep isl_ast_build *build) { if (!build) return NULL; return isl_schedule_node_copy(build->node); } /* Extract the loop AST generation types for the members of build->node * and store them in build->loop_type. */ static __isl_give isl_ast_build *extract_loop_types( __isl_take isl_ast_build *build) { int i; isl_ctx *ctx; isl_schedule_node *node; if (!build) return NULL; ctx = isl_ast_build_get_ctx(build); if (!build->node) isl_die(ctx, isl_error_internal, "missing AST node", return isl_ast_build_free(build)); free(build->loop_type); build->n = isl_schedule_node_band_n_member(build->node); build->loop_type = isl_alloc_array(ctx, enum isl_ast_loop_type, build->n); if (build->n && !build->loop_type) return isl_ast_build_free(build); node = build->node; for (i = 0; i < build->n; ++i) build->loop_type[i] = isl_schedule_node_band_member_get_ast_loop_type(node, i); return build; } /* Replace the band node that "build" refers to by "node" and * extract the corresponding loop AST generation types. */ __isl_give isl_ast_build *isl_ast_build_set_schedule_node( __isl_take isl_ast_build *build, __isl_take isl_schedule_node *node) { build = isl_ast_build_cow(build); if (!build || !node) goto error; isl_schedule_node_free(build->node); build->node = node; build = extract_loop_types(build); return build; error: isl_ast_build_free(build); isl_schedule_node_free(node); return NULL; } /* Remove any reference to a band node from "build". */ __isl_give isl_ast_build *isl_ast_build_reset_schedule_node( __isl_take isl_ast_build *build) { build = isl_ast_build_cow(build); if (!build) return NULL; isl_schedule_node_free(build->node); build->node = NULL; return build; } /* 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 a copy of the set of pending constraints. */ __isl_give isl_set *isl_ast_build_get_pending( __isl_keep isl_ast_build *build) { return build ? isl_set_copy(build->pending) : NULL; } /* Return a copy of the set of generated constraints. */ __isl_give isl_set *isl_ast_build_get_generated( __isl_keep isl_ast_build *build) { return build ? isl_set_copy(build->generated) : NULL; } /* Return a copy of the map from the internal schedule domain * to the original input schedule domain. */ __isl_give isl_multi_aff *isl_ast_build_get_internal2input( __isl_keep isl_ast_build *build) { return build ? isl_multi_aff_copy(build->internal2input) : NULL; } /* Return the number of variables of the given type * in the (internal) schedule space. */ unsigned isl_ast_build_dim(__isl_keep isl_ast_build *build, enum isl_dim_type type) { if (!build) return 0; return isl_set_dim(build->domain, type); } /* 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 isl_stat 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 isl_stat_ok; } 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); stride = 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 isl_stat_ok; } /* 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 isl_stat 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 isl_stat_error; return isl_stat_ok; } /* 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_constraint_alloc_equality(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[] = { [isl_ast_loop_atomic] = "atomic", [isl_ast_loop_unroll] = "unroll", [isl_ast_loop_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_loop_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 = isl_ast_loop_atomic; type <= isl_ast_loop_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; } /* If we are generating an AST from a schedule tree (build->node is set), * then update the loop AST generation types * to reflect the insertion of a dimension at (global) position "pos" * in the schedule domain space. * We do not need to adjust any isolate option since we would not be inserting * any dimensions if there were any isolate option. */ static __isl_give isl_ast_build *node_insert_dim( __isl_take isl_ast_build *build, int pos) { int i; int local_pos; enum isl_ast_loop_type *loop_type; isl_ctx *ctx; build = isl_ast_build_cow(build); if (!build) return NULL; if (!build->node) return build; ctx = isl_ast_build_get_ctx(build); local_pos = pos - build->outer_pos; loop_type = isl_realloc_array(ctx, build->loop_type, enum isl_ast_loop_type, build->n + 1); if (!loop_type) return isl_ast_build_free(build); build->loop_type = loop_type; for (i = build->n - 1; i >= local_pos; --i) loop_type[i + 1] = loop_type[i]; loop_type[local_pos] = isl_ast_loop_default; build->n++; return build; } /* 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. * * Since the inserted schedule dimension is used by the caller * to differentiate between different domain spaces, there is * no longer a uniform mapping from the internal schedule space * to the input schedule space. The internal2input mapping is * therefore removed. */ __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); if (!build->node) 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); if (!build->node) build->options = options_insert_dim(build->options, space, pos); build->internal2input = isl_multi_aff_free(build->internal2input); if (!build->iterators || !build->domain || !build->generated || !build->pending || !build->values || !build->strides || !build->offsets || !build->options) return isl_ast_build_free(build); build = node_insert_dim(build, pos); 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, the options and * the mapping from internal schedule space to the original schedule * space, if we are still keeping track of such a mapping. * The latter mapping is updated by plugging in * { [... i ...] -> [... m i ... ] }. */ __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; if (build->internal2input) { isl_space *space; isl_multi_aff *ma; isl_aff *aff; space = isl_multi_aff_get_space(build->internal2input); space = isl_space_map_from_set(isl_space_domain(space)); ma = isl_multi_aff_identity(space); aff = isl_multi_aff_get_aff(ma, depth); aff = isl_aff_scale_val(aff, isl_val_copy(m)); ma = isl_multi_aff_set_aff(ma, depth, aff); build->internal2input = isl_multi_aff_pullback_multi_aff(build->internal2input, ma); if (!build->internal2input) goto error; } 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_node_from_schedule_map. * "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, isl_multi_aff_copy(embedding)); if (build->internal2input) { build->internal2input = isl_multi_aff_product(build->internal2input, embedding); build->internal2input = isl_multi_aff_flatten_range(build->internal2input); if (!build->internal2input) return isl_ast_build_free(build); } else { isl_multi_aff_free(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 corresponding 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; if (!isl_set_is_params(set)) 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; } /* Include information about what we know about the iterators of * already generated loops to "set". * * We currently only plug in the known affine values of outer loop * iterators. * In principle we could also introduce equalities or even other * constraints implied by the intersection of "set" and build->domain. */ __isl_give isl_set *isl_ast_build_specialize(__isl_keep isl_ast_build *build, __isl_take isl_set *set) { if (!build) return isl_set_free(set); return isl_set_preimage_multi_aff(set, isl_multi_aff_copy(build->values)); } /* 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_loop_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; } /* How does the user want the current schedule dimension to be generated? * These choices have been extracted from the schedule node * in extract_loop_types and stored in build->loop_type. * They have been updated to reflect any dimension insertion in * node_insert_dim. * Return isl_ast_domain_error on error. * * If "isolated" is set, then we get the loop AST generation type * directly from the band node since node_insert_dim cannot have been * called on a band with the isolate option. */ enum isl_ast_loop_type isl_ast_build_get_loop_type( __isl_keep isl_ast_build *build, int isolated) { int local_pos; isl_ctx *ctx; if (!build) return isl_ast_loop_error; ctx = isl_ast_build_get_ctx(build); if (!build->node) isl_die(ctx, isl_error_internal, "only works for schedule tree based AST generation", return isl_ast_loop_error); local_pos = build->depth - build->outer_pos; if (!isolated) return build->loop_type[local_pos]; return isl_schedule_node_band_member_get_isolate_ast_loop_type( build->node, local_pos); } /* Extract the isolated set from the isolate option, if any, * and store in the build. * If there is no isolate option, then the isolated set is * set to the empty set. * * The isolate option is of the form * * isolate[[outer bands] -> current_band] * * We flatten this set and then map it back to the internal * schedule space. * * If we have already extracted the isolated set * or if internal2input is no longer set, then we do not * need to do anything. In the latter case, we know * that the current band cannot have any isolate option. */ __isl_give isl_ast_build *isl_ast_build_extract_isolated( __isl_take isl_ast_build *build) { isl_space *space, *space2; isl_union_set *options; int n, n2; isl_set *isolated; if (!build) return NULL; if (!build->internal2input) return build; if (build->isolated) return build; build = isl_ast_build_cow(build); if (!build) return NULL; options = isl_schedule_node_band_get_ast_build_options(build->node); space = isl_multi_aff_get_space(build->internal2input); space = isl_space_range(space); space2 = isl_set_get_space(build->domain); if (isl_space_is_wrapping(space2)) space2 = isl_space_range(isl_space_unwrap(space2)); n2 = isl_space_dim(space2, isl_dim_set); n = isl_space_dim(space, isl_dim_set); if (n < n2) isl_die(isl_ast_build_get_ctx(build), isl_error_internal, "total input space dimension cannot be smaller " "than dimension of innermost band", space = isl_space_free(space)); space = isl_space_drop_dims(space, isl_dim_set, n - n2, n2); space = isl_space_map_from_domain_and_range(space, space2); space = isl_space_wrap(space); space = isl_space_set_tuple_name(space, isl_dim_set, "isolate"); isolated = isl_union_set_extract_set(options, space); isl_union_set_free(options); isolated = isl_set_flatten(isolated); isolated = isl_set_preimage_multi_aff(isolated, isl_multi_aff_copy(build->internal2input)); build->isolated = isolated; if (!build->isolated) return isl_ast_build_free(build); return build; } /* Does "build" have a non-empty isolated set? * * The caller is assumed to have called isl_ast_build_extract_isolated first. */ int isl_ast_build_has_isolated(__isl_keep isl_ast_build *build) { int empty; if (!build) return -1; if (!build->internal2input) return 0; if (!build->isolated) isl_die(isl_ast_build_get_ctx(build), isl_error_internal, "isolated set not extracted yet", return -1); empty = isl_set_plain_is_empty(build->isolated); return empty < 0 ? -1 : !empty; } /* Return a copy of the isolated set of "build". * * The caller is assume to have called isl_ast_build_has_isolated first, * with this function returning true. * In particular, this function should not be called if we are no * longer keeping track of internal2input (and there therefore could * not possibly be any isolated set). */ __isl_give isl_set *isl_ast_build_get_isolated(__isl_keep isl_ast_build *build) { if (!build) return NULL; if (!build->internal2input) isl_die(isl_ast_build_get_ctx(build), isl_error_internal, "build cannot have isolated set", return NULL); return isl_set_copy(build->isolated); } /* 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.4/isl/isl_aff.c0000644000175000017500000070063212554427055012207 00000000000000/* * Copyright 2011 INRIA Saclay * Copyright 2011 Sven Verdoolaege * Copyright 2012-2014 Ecole Normale Superieure * Copyright 2014 INRIA Rocquencourt * * 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 * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt, * B.P. 105 - 78153 Le Chesnay, France */ #include #define ISL_DIM_H #include #include #include #include #include #include #include #include #include #include #include #include #include #undef BASE #define BASE aff #include #undef BASE #define BASE pw_aff #include #undef BASE #define BASE union_pw_aff #include #undef BASE #define BASE union_pw_multi_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 defined on the specified domain * that represents NaN. */ __isl_give isl_aff *isl_aff_nan_on_domain(__isl_take isl_local_space *ls) { isl_aff *aff; aff = isl_aff_alloc(ls); if (!aff) return NULL; isl_seq_clr(aff->v->el, aff->v->size); return aff; } /* Return a piecewise affine expression defined on the specified domain * that represents NaN. */ __isl_give isl_pw_aff *isl_pw_aff_nan_on_domain(__isl_take isl_local_space *ls) { return isl_pw_aff_from_aff(isl_aff_nan_on_domain(ls)); } /* Return an affine expression that is equal to "val" on * domain local space "ls". */ __isl_give isl_aff *isl_aff_val_on_domain(__isl_take isl_local_space *ls, __isl_take isl_val *val) { isl_aff *aff; if (!ls || !val) goto error; if (!isl_val_is_rat(val)) isl_die(isl_val_get_ctx(val), isl_error_invalid, "expecting rational value", goto error); aff = isl_aff_alloc(isl_local_space_copy(ls)); if (!aff) goto error; isl_seq_clr(aff->v->el + 2, aff->v->size - 2); isl_int_set(aff->v->el[1], val->n); isl_int_set(aff->v->el[0], val->d); isl_local_space_free(ls); isl_val_free(val); return aff; error: isl_local_space_free(ls); isl_val_free(val); return NULL; } /* 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); } __isl_null isl_aff *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); } /* Return the position of the dimension of the given type and name * in "aff". * Return -1 if no such dimension can be found. */ int isl_aff_find_dim_by_name(__isl_keep isl_aff *aff, enum isl_dim_type type, const char *name) { if (!aff) return -1; if (type == isl_dim_out) return -1; if (type == isl_dim_in) type = isl_dim_set; return isl_local_space_find_dim_by_name(aff->ls, type, name); } __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; } /* Is "aff" obviously equal to zero? * * If the denominator is zero, then "aff" is not equal to zero. */ isl_bool isl_aff_plain_is_zero(__isl_keep isl_aff *aff) { if (!aff) return isl_bool_error; if (isl_int_is_zero(aff->v->el[0])) return isl_bool_false; return isl_seq_first_non_zero(aff->v->el + 1, aff->v->size - 1) < 0; } /* Does "aff" represent NaN? */ isl_bool isl_aff_is_nan(__isl_keep isl_aff *aff) { if (!aff) return isl_bool_error; return isl_seq_first_non_zero(aff->v->el, 2) < 0; } /* Does "pa" involve any NaNs? */ isl_bool isl_pw_aff_involves_nan(__isl_keep isl_pw_aff *pa) { int i; if (!pa) return isl_bool_error; if (pa->n == 0) return isl_bool_false; for (i = 0; i < pa->n; ++i) { isl_bool is_nan = isl_aff_is_nan(pa->p[i].aff); if (is_nan < 0 || is_nan) return is_nan; } return isl_bool_false; } /* Are "aff1" and "aff2" obviously equal? * * NaN is not equal to anything, not even to another NaN. */ isl_bool isl_aff_plain_is_equal(__isl_keep isl_aff *aff1, __isl_keep isl_aff *aff2) { isl_bool equal; if (!aff1 || !aff2) return isl_bool_error; if (isl_aff_is_nan(aff1) || isl_aff_is_nan(aff2)) return isl_bool_false; 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); } /* Return the common denominator of "aff" in "v". * * We cannot return anything meaningful in case of a NaN. */ int isl_aff_get_denominator(__isl_keep isl_aff *aff, isl_int *v) { if (!aff) return -1; if (isl_aff_is_nan(aff)) isl_die(isl_aff_get_ctx(aff), isl_error_invalid, "cannot get denominator of NaN", 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); if (isl_aff_is_nan(aff)) return isl_val_nan(ctx); return isl_val_int_from_isl_int(ctx, aff->v->el[0]); } /* Return the constant term of "aff" in "v". * * We cannot return anything meaningful in case of a NaN. */ int isl_aff_get_constant(__isl_keep isl_aff *aff, isl_int *v) { if (!aff) return -1; if (isl_aff_is_nan(aff)) isl_die(isl_aff_get_ctx(aff), isl_error_invalid, "cannot get constant term of NaN", 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); if (isl_aff_is_nan(aff)) return isl_val_nan(ctx); v = isl_val_rat_from_isl_int(ctx, aff->v->el[1], aff->v->el[0]); return isl_val_normalize(v); } /* Return the coefficient of the variable of type "type" at position "pos" * of "aff" in "v". * * We cannot return anything meaningful in case of a NaN. */ 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); if (isl_aff_is_nan(aff)) isl_die(isl_aff_get_ctx(aff), isl_error_invalid, "cannot get coefficient of NaN", 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); if (isl_aff_is_nan(aff)) return isl_val_nan(ctx); 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); } /* Return the sign of the coefficient of the variable of type "type" * at position "pos" of "aff". */ int isl_aff_coefficient_sgn(__isl_keep isl_aff *aff, enum isl_dim_type type, int pos) { isl_ctx *ctx; if (!aff) return 0; 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 0); 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 0); pos += isl_local_space_offset(aff->ls, type); return isl_int_sgn(aff->v->el[1 + pos]); } /* Replace the denominator of "aff" by "v". * * A NaN is unaffected by this operation. */ __isl_give isl_aff *isl_aff_set_denominator(__isl_take isl_aff *aff, isl_int v) { if (!aff) return NULL; if (isl_aff_is_nan(aff)) 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_set(aff->v->el[0], v); return aff; } /* Replace the numerator of the constant term of "aff" by "v". * * A NaN is unaffected by this operation. */ __isl_give isl_aff *isl_aff_set_constant(__isl_take isl_aff *aff, isl_int v) { if (!aff) return NULL; if (isl_aff_is_nan(aff)) 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_set(aff->v->el[1], v); return aff; } /* Replace the constant term of "aff" by "v". * * A NaN is unaffected by this operation. */ __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_aff_is_nan(aff)) { 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); 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; } /* Add "v" to the constant term of "aff". * * A NaN is unaffected by this operation. */ __isl_give isl_aff *isl_aff_add_constant(__isl_take isl_aff *aff, isl_int v) { if (isl_int_is_zero(v)) return aff; if (!aff) return NULL; if (isl_aff_is_nan(aff)) 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". * * A NaN is unaffected by this operation. */ __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_aff_is_nan(aff) || 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". * * A NaN is unaffected by this operation. */ __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; if (!aff) return NULL; if (isl_aff_is_nan(aff)) 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". * * A NaN is unaffected by this operation. */ __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; } /* Replace the numerator of the constant term of "aff" by "v". * * A NaN is unaffected by this operation. */ __isl_give isl_aff *isl_aff_set_constant_si(__isl_take isl_aff *aff, int v) { if (!aff) return NULL; if (isl_aff_is_nan(aff)) 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_set_si(aff->v->el[1], v); return aff; } /* Replace the numerator of the coefficient of the variable of type "type" * at position "pos" of "aff" by "v". * * A NaN is unaffected by this operation. */ __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)); if (isl_aff_is_nan(aff)) 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); pos += isl_local_space_offset(aff->ls, type); isl_int_set(aff->v->el[1 + pos], v); return aff; } /* Replace the numerator of the coefficient of the variable of type "type" * at position "pos" of "aff" by "v". * * A NaN is unaffected by this operation. */ __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 < 0 || 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)); if (isl_aff_is_nan(aff)) return aff; pos += isl_local_space_offset(aff->ls, type); if (isl_int_cmp_si(aff->v->el[1 + pos], v) == 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_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". * * A NaN is unaffected by this operation. */ __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_aff_is_nan(aff)) { 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); 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; } /* Add "v" to the coefficient of the variable of type "type" * at position "pos" of "aff". * * A NaN is unaffected by this operation. */ __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)); if (isl_aff_is_nan(aff)) 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); 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". * * A NaN is unaffected by this operation. */ __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_aff_is_nan(aff)) { 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; 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); } /* Return the negation of "aff". * * As a special case, -NaN = NaN. */ __isl_give isl_aff *isl_aff_neg(__isl_take isl_aff *aff) { if (!aff) return NULL; if (isl_aff_is_nan(aff)) 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_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; if (!aff) return NULL; 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. * * As a special case, floor(NaN) = NaN. */ __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_aff_is_nan(aff)) return aff; 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) * * As a special case, ceil(NaN) = NaN. */ __isl_give isl_aff *isl_aff_ceil(__isl_take isl_aff *aff) { if (!aff) return NULL; if (isl_aff_is_nan(aff)) return aff; 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; } /* Return the sum of "aff1" and "aff2". * * If either of the two is NaN, then the result is NaN. */ __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); if (isl_aff_is_nan(aff1)) { isl_aff_free(aff2); return aff1; } if (isl_aff_is_nan(aff2)) { isl_aff_free(aff1); return aff2; } 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)); } /* Return the result of scaling "aff" by a factor of "f". * * As a special case, f * NaN = NaN. */ __isl_give isl_aff *isl_aff_scale(__isl_take isl_aff *aff, isl_int f) { isl_int gcd; if (!aff) return NULL; if (isl_aff_is_nan(aff)) return aff; 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; } /* Return the result of scaling "aff" down by a factor of "f". * * As a special case, NaN/f = NaN. */ __isl_give isl_aff *isl_aff_scale_down(__isl_take isl_aff *aff, isl_int f) { isl_int gcd; if (!aff) return NULL; if (isl_aff_is_nan(aff)) return aff; 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) goto error; 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; } /* Replace the identifier of the input tuple of "aff" by "id". * type is currently required to be equal to isl_dim_in */ __isl_give isl_aff *isl_aff_set_tuple_id(__isl_take isl_aff *aff, enum isl_dim_type type, __isl_take isl_id *id) { aff = isl_aff_cow(aff); if (!aff) goto error; if (type != isl_dim_out) isl_die(aff->v->ctx, isl_error_invalid, "cannot only set id of input tuple", goto error); aff->ls = isl_local_space_set_tuple_id(aff->ls, isl_dim_set, 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. */ __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 positive. "rational" should not be set. * * If "aff" is NaN, then it is not positive. */ static __isl_give isl_basic_set *aff_pos_basic_set(__isl_take isl_aff *aff, int rational) { isl_constraint *ineq; isl_basic_set *bset; isl_val *c; if (!aff) return NULL; if (isl_aff_is_nan(aff)) { isl_space *space = isl_aff_get_domain_space(aff); isl_aff_free(aff); return isl_basic_set_empty(space); } if (rational) isl_die(isl_aff_get_ctx(aff), isl_error_unsupported, "rational sets not supported", goto error); ineq = isl_inequality_from_aff(aff); c = isl_constraint_get_constant_val(ineq); c = isl_val_sub_ui(c, 1); ineq = isl_constraint_set_constant_val(ineq, c); bset = isl_basic_set_from_constraint(ineq); bset = isl_basic_set_simplify(bset); return bset; error: isl_aff_free(aff); return NULL; } /* 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. * * If "aff" is NaN, then it is not non-negative (it's not negative either). */ static __isl_give isl_basic_set *aff_nonneg_basic_set( __isl_take isl_aff *aff, int rational) { isl_constraint *ineq; isl_basic_set *bset; if (!aff) return NULL; if (isl_aff_is_nan(aff)) { isl_space *space = isl_aff_get_domain_space(aff); isl_aff_free(aff); return isl_basic_set_empty(space); } 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. * * If "aff" is NaN, then it is not zero. */ static __isl_give isl_basic_set *aff_zero_basic_set(__isl_take isl_aff *aff, int rational) { isl_constraint *ineq; isl_basic_set *bset; if (!aff) return NULL; if (isl_aff_is_nan(aff)) { isl_space *space = isl_aff_get_domain_space(aff); isl_aff_free(aff); return isl_basic_set_empty(space); } 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. */ isl_bool 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; isl_bool involves = isl_bool_false; if (!aff) return isl_bool_error; if (n == 0) return isl_bool_false; 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 isl_bool_error); 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 = isl_bool_true; break; } free(active); return involves; error: free(active); return isl_bool_error; } __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); } /* Move the "n" dimensions of "src_type" starting at "src_pos" of "aff" * to dimensions of "dst_type" at "dst_pos". * * We only support moving input dimensions to parameters and vice versa. */ __isl_give isl_aff *isl_aff_move_dims(__isl_take isl_aff *aff, 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; if (!aff) return NULL; if (n == 0 && !isl_local_space_is_named_or_nested(aff->ls, src_type) && !isl_local_space_is_named_or_nested(aff->ls, dst_type)) return aff; if (dst_type == isl_dim_out || src_type == isl_dim_out) isl_die(isl_aff_get_ctx(aff), isl_error_invalid, "cannot move output/set dimension", return isl_aff_free(aff)); if (dst_type == isl_dim_div || src_type == isl_dim_div) isl_die(isl_aff_get_ctx(aff), isl_error_invalid, "cannot move divs", return isl_aff_free(aff)); if (dst_type == isl_dim_in) dst_type = isl_dim_set; if (src_type == isl_dim_in) src_type = isl_dim_set; if (src_pos + n > isl_local_space_dim(aff->ls, src_type)) isl_die(isl_aff_get_ctx(aff), isl_error_invalid, "range out of bounds", return isl_aff_free(aff)); if (dst_type == src_type) isl_die(isl_aff_get_ctx(aff), isl_error_unsupported, "moving dims within the same type not supported", return isl_aff_free(aff)); aff = isl_aff_cow(aff); if (!aff) return NULL; g_src_pos = 1 + isl_local_space_offset(aff->ls, src_type) + src_pos; g_dst_pos = 1 + isl_local_space_offset(aff->ls, dst_type) + dst_pos; if (dst_type > src_type) g_dst_pos -= n; aff->v = isl_vec_move_els(aff->v, g_dst_pos, g_src_pos, n); aff->ls = isl_local_space_move_dims(aff->ls, dst_type, dst_pos, src_type, src_pos, n); if (!aff->v || !aff->ls) return isl_aff_free(aff); aff = sort_divs(aff); return aff; } __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_LIFT #define NO_MORPH #include #undef UNION #define UNION isl_union_pw_aff #undef PART #define PART isl_pw_aff #undef PARTS #define PARTS pw_aff #define NO_EVAL #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; } /* Align the parameters of the to isl_pw_aff arguments and * then apply a function "fn" on them that returns an isl_map. */ static __isl_give isl_map *align_params_pw_pw_map_and( __isl_take isl_pw_aff *pa1, __isl_take isl_pw_aff *pa2, __isl_give isl_map *(*fn)(__isl_take isl_pw_aff *pa1, __isl_take isl_pw_aff *pa2)) { if (!pa1 || !pa2) goto error; if (isl_space_match(pa1->dim, isl_dim_param, pa2->dim, isl_dim_param)) return fn(pa1, pa2); if (!isl_space_has_named_params(pa1->dim) || !isl_space_has_named_params(pa2->dim)) isl_die(isl_pw_aff_get_ctx(pa1), isl_error_invalid, "unaligned unnamed parameters", goto error); pa1 = isl_pw_aff_align_params(pa1, isl_pw_aff_get_space(pa2)); pa2 = isl_pw_aff_align_params(pa2, isl_pw_aff_get_space(pa1)); return fn(pa1, pa2); error: isl_pw_aff_free(pa1); isl_pw_aff_free(pa2); 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", goto error); return map_from_pw_aff(pwaff); error: isl_pw_aff_free(pwaff); return NULL; } /* 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", goto error); return map_from_pw_aff(pwaff); error: isl_pw_aff_free(pwaff); return NULL; } /* Return a set containing those elements in the domain * of "pwaff" where it satisfies "fn" (if complement is 0) or * does not satisfy "fn" (if complement is 1). * * The pieces with a NaN never belong to the result since * NaN does not satisfy any property. */ static __isl_give isl_set *pw_aff_locus(__isl_take isl_pw_aff *pwaff, __isl_give isl_basic_set *(*fn)(__isl_take isl_aff *aff, int rational), 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, *locus; int rational; if (isl_aff_is_nan(pwaff->p[i].aff)) continue; rational = isl_set_has_rational(pwaff->p[i].set); bset = fn(isl_aff_copy(pwaff->p[i].aff), rational); locus = isl_set_from_basic_set(bset); set_i = isl_set_copy(pwaff->p[i].set); if (complement) set_i = isl_set_subtract(set_i, locus); else set_i = isl_set_intersect(set_i, locus); 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 "pa" where it is positive. */ __isl_give isl_set *isl_pw_aff_pos_set(__isl_take isl_pw_aff *pa) { return pw_aff_locus(pa, &aff_pos_basic_set, 0); } /* 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) { return pw_aff_locus(pwaff, &aff_nonneg_basic_set, 0); } /* 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_locus(pwaff, &aff_zero_basic_set, 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_locus(pwaff, &aff_zero_basic_set, 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 map containing pairs of elements in the domains of "pa1" and "pa2" * where the function values are ordered in the same way as "order", * which returns a set in the shared domain of its two arguments. * The parameters of "pa1" and "pa2" are assumed to have been aligned. * * Let "pa1" and "pa2" be defined on domains A and B respectively. * We first pull back the two functions such that they are defined on * the domain [A -> B]. Then we apply "order", resulting in a set * in the space [A -> B]. Finally, we unwrap this set to obtain * a map in the space A -> B. */ static __isl_give isl_map *isl_pw_aff_order_map_aligned( __isl_take isl_pw_aff *pa1, __isl_take isl_pw_aff *pa2, __isl_give isl_set *(*order)(__isl_take isl_pw_aff *pa1, __isl_take isl_pw_aff *pa2)) { isl_space *space1, *space2; isl_multi_aff *ma; isl_set *set; space1 = isl_space_domain(isl_pw_aff_get_space(pa1)); space2 = isl_space_domain(isl_pw_aff_get_space(pa2)); space1 = isl_space_map_from_domain_and_range(space1, space2); ma = isl_multi_aff_domain_map(isl_space_copy(space1)); pa1 = isl_pw_aff_pullback_multi_aff(pa1, ma); ma = isl_multi_aff_range_map(space1); pa2 = isl_pw_aff_pullback_multi_aff(pa2, ma); set = order(pa1, pa2); return isl_set_unwrap(set); } /* Return a map containing pairs of elements in the domains of "pa1" and "pa2" * where the function values are equal. * The parameters of "pa1" and "pa2" are assumed to have been aligned. */ static __isl_give isl_map *isl_pw_aff_eq_map_aligned(__isl_take isl_pw_aff *pa1, __isl_take isl_pw_aff *pa2) { return isl_pw_aff_order_map_aligned(pa1, pa2, &isl_pw_aff_eq_set); } /* Return a map containing pairs of elements in the domains of "pa1" and "pa2" * where the function values are equal. */ __isl_give isl_map *isl_pw_aff_eq_map(__isl_take isl_pw_aff *pa1, __isl_take isl_pw_aff *pa2) { return align_params_pw_pw_map_and(pa1, pa2, &isl_pw_aff_eq_map_aligned); } /* Return a map containing pairs of elements in the domains of "pa1" and "pa2" * where the function value of "pa1" is less than the function value of "pa2". * The parameters of "pa1" and "pa2" are assumed to have been aligned. */ static __isl_give isl_map *isl_pw_aff_lt_map_aligned(__isl_take isl_pw_aff *pa1, __isl_take isl_pw_aff *pa2) { return isl_pw_aff_order_map_aligned(pa1, pa2, &isl_pw_aff_lt_set); } /* Return a map containing pairs of elements in the domains of "pa1" and "pa2" * where the function value of "pa1" is less than the function value of "pa2". */ __isl_give isl_map *isl_pw_aff_lt_map(__isl_take isl_pw_aff *pa1, __isl_take isl_pw_aff *pa2) { return align_params_pw_pw_map_and(pa1, pa2, &isl_pw_aff_lt_map_aligned); } /* Return a map containing pairs of elements in the domains of "pa1" and "pa2" * where the function value of "pa1" is greater than the function value * of "pa2". * The parameters of "pa1" and "pa2" are assumed to have been aligned. */ static __isl_give isl_map *isl_pw_aff_gt_map_aligned(__isl_take isl_pw_aff *pa1, __isl_take isl_pw_aff *pa2) { return isl_pw_aff_order_map_aligned(pa1, pa2, &isl_pw_aff_gt_set); } /* Return a map containing pairs of elements in the domains of "pa1" and "pa2" * where the function value of "pa1" is greater than the function value * of "pa2". */ __isl_give isl_map *isl_pw_aff_gt_map(__isl_take isl_pw_aff *pa1, __isl_take isl_pw_aff *pa2) { return align_params_pw_pw_map_and(pa1, pa2, &isl_pw_aff_gt_map_aligned); } /* 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; } __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; * * If "cond" involves and NaN, then we conservatively return a NaN * on its entire domain. In principle, we could consider the pieces * where it is NaN separately from those where it is not. */ __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; if (!cond) goto error; if (isl_pw_aff_involves_nan(cond)) { isl_space *space = isl_pw_aff_get_domain_space(cond); isl_local_space *ls = isl_local_space_from_space(space); isl_pw_aff_free(cond); isl_pw_aff_free(pwaff_true); isl_pw_aff_free(pwaff_false); return isl_pw_aff_nan_on_domain(ls); } 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); error: isl_pw_aff_free(cond); isl_pw_aff_free(pwaff_true); isl_pw_aff_free(pwaff_false); return NULL; } isl_bool isl_aff_is_cst(__isl_keep isl_aff *aff) { if (!aff) return isl_bool_error; return isl_seq_first_non_zero(aff->v->el + 2, aff->v->size - 2) == -1; } /* Check whether pwaff is a piecewise constant. */ isl_bool isl_pw_aff_is_cst(__isl_keep isl_pw_aff *pwaff) { int i; if (!pwaff) return isl_bool_error; for (i = 0; i < pwaff->n; ++i) { isl_bool is_cst = isl_aff_is_cst(pwaff->p[i].aff); if (is_cst < 0 || !is_cst) return is_cst; } return isl_bool_true; } /* Return the product of "aff1" and "aff2". * * If either of the two is NaN, then the result is NaN. * * Otherwise, at least one of "aff1" or "aff2" needs to be a constant. */ __isl_give isl_aff *isl_aff_mul(__isl_take isl_aff *aff1, __isl_take isl_aff *aff2) { if (!aff1 || !aff2) goto error; if (isl_aff_is_nan(aff1)) { isl_aff_free(aff2); return aff1; } if (isl_aff_is_nan(aff2)) { isl_aff_free(aff1); return 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 constant. * * If either of the two is NaN, then the result is NaN. */ __isl_give isl_aff *isl_aff_div(__isl_take isl_aff *aff1, __isl_take isl_aff *aff2) { int is_cst; int neg; if (!aff1 || !aff2) goto error; if (isl_aff_is_nan(aff1)) { isl_aff_free(aff2); return aff1; } if (isl_aff_is_nan(aff2)) { isl_aff_free(aff1); return aff2; } 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", goto error); 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; error: isl_pw_aff_list_free(list); return NULL; } /* 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; } /* Do the parameters of "aff" match those of "space"? */ int isl_aff_matching_params(__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); isl_space_free(aff_space); return match; } /* 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_is_equal(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 #undef DOMBASE #define DOMBASE set #define NO_DOMAIN #include #include #include #include #undef NO_DOMAIN /* Remove any internal structure of the domain of "ma". * If there is any such internal structure in the input, * then the name of the corresponding space is also removed. */ __isl_give isl_multi_aff *isl_multi_aff_flatten_domain( __isl_take isl_multi_aff *ma) { isl_space *space; if (!ma) return NULL; if (!ma->space->nested[0]) return ma; space = isl_multi_aff_get_space(ma); space = isl_space_flatten_domain(space); ma = isl_multi_aff_reset_space(ma, space); return ma; } /* Given a map space, return an isl_multi_aff that maps a wrapped copy * of the space to its domain. */ __isl_give isl_multi_aff *isl_multi_aff_domain_map(__isl_take isl_space *space) { int i, n_in; isl_local_space *ls; isl_multi_aff *ma; if (!space) return NULL; if (!isl_space_is_map(space)) isl_die(isl_space_get_ctx(space), isl_error_invalid, "not a map space", goto error); n_in = isl_space_dim(space, isl_dim_in); space = isl_space_domain_map(space); ma = isl_multi_aff_alloc(isl_space_copy(space)); if (n_in == 0) { isl_space_free(space); return ma; } space = isl_space_domain(space); ls = isl_local_space_from_space(space); for (i = 0; i < n_in; ++i) { isl_aff *aff; aff = isl_aff_var_on_domain(isl_local_space_copy(ls), isl_dim_set, i); ma = isl_multi_aff_set_aff(ma, i, aff); } isl_local_space_free(ls); return ma; error: isl_space_free(space); return NULL; } /* Given a map space, return an isl_multi_aff that maps a wrapped copy * of the space to its range. */ __isl_give isl_multi_aff *isl_multi_aff_range_map(__isl_take isl_space *space) { int i, n_in, n_out; isl_local_space *ls; isl_multi_aff *ma; if (!space) return NULL; if (!isl_space_is_map(space)) isl_die(isl_space_get_ctx(space), isl_error_invalid, "not a map space", goto error); n_in = isl_space_dim(space, isl_dim_in); n_out = isl_space_dim(space, isl_dim_out); space = isl_space_range_map(space); ma = isl_multi_aff_alloc(isl_space_copy(space)); if (n_out == 0) { isl_space_free(space); return ma; } space = isl_space_domain(space); ls = isl_local_space_from_space(space); for (i = 0; i < n_out; ++i) { isl_aff *aff; 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; error: isl_space_free(space); return NULL; } /* Given a map space, return an isl_pw_multi_aff that maps a wrapped copy * of the space to its range. */ __isl_give isl_pw_multi_aff *isl_pw_multi_aff_range_map( __isl_take isl_space *space) { return isl_pw_multi_aff_from_multi_aff(isl_multi_aff_range_map(space)); } /* Given the space of a set and a range of set dimensions, * construct an isl_multi_aff that projects out those dimensions. */ __isl_give isl_multi_aff *isl_multi_aff_project_out_map( __isl_take isl_space *space, enum isl_dim_type type, unsigned first, unsigned n) { int i, dim; isl_local_space *ls; isl_multi_aff *ma; if (!space) return NULL; if (!isl_space_is_set(space)) isl_die(isl_space_get_ctx(space), isl_error_unsupported, "expecting set space", goto error); if (type != isl_dim_set) isl_die(isl_space_get_ctx(space), isl_error_invalid, "only set dimensions can be projected out", goto error); dim = isl_space_dim(space, isl_dim_set); if (first + n > dim) isl_die(isl_space_get_ctx(space), isl_error_invalid, "range out of bounds", goto error); space = isl_space_from_domain(space); space = isl_space_add_dims(space, isl_dim_out, dim - n); if (dim == n) return isl_multi_aff_alloc(space); ma = isl_multi_aff_alloc(isl_space_copy(space)); space = isl_space_domain(space); ls = isl_local_space_from_space(space); for (i = 0; i < first; ++i) { isl_aff *aff; aff = isl_aff_var_on_domain(isl_local_space_copy(ls), isl_dim_set, i); ma = isl_multi_aff_set_aff(ma, i, aff); } for (i = 0; i < dim - (first + n); ++i) { isl_aff *aff; aff = isl_aff_var_on_domain(isl_local_space_copy(ls), isl_dim_set, first + n + i); ma = isl_multi_aff_set_aff(ma, first + i, aff); } isl_local_space_free(ls); return ma; error: isl_space_free(space); return NULL; } /* Given the space of a set and a range of set dimensions, * construct an isl_pw_multi_aff that projects out those dimensions. */ __isl_give isl_pw_multi_aff *isl_pw_multi_aff_project_out_map( __isl_take isl_space *space, enum isl_dim_type type, unsigned first, unsigned n) { isl_multi_aff *ma; ma = isl_multi_aff_project_out_map(space, type, first, n); return isl_pw_multi_aff_from_multi_aff(ma); } /* 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)); } /* Add "ma2" to "ma1" and return the result. * * The parameters of "ma1" and "ma2" are assumed to have been aligned. */ static __isl_give isl_multi_aff *isl_multi_aff_add_aligned( __isl_take isl_multi_aff *maff1, __isl_take isl_multi_aff *maff2) { return isl_multi_aff_bin_op(maff1, maff2, &isl_aff_add); } /* Add "ma2" to "ma1" and return the result. */ __isl_give isl_multi_aff *isl_multi_aff_add(__isl_take isl_multi_aff *ma1, __isl_take isl_multi_aff *ma2) { return isl_multi_aff_align_params_multi_multi_and(ma1, ma2, &isl_multi_aff_add_aligned); } /* 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; } /* 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_SUB #define NO_EVAL #define NO_OPT #define NO_INVOLVES_DIMS #define NO_INSERT_DIMS #define NO_LIFT #define NO_MORPH #include #undef NO_SUB #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 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); } /* Compute the sum of "upa1" and "upa2" on the union of their domains, * with the actual sum on the shared domain and * the defined expression on the symmetric difference of the domains. */ __isl_give isl_union_pw_aff *isl_union_pw_aff_union_add( __isl_take isl_union_pw_aff *upa1, __isl_take isl_union_pw_aff *upa2) { return isl_union_pw_aff_union_add_(upa1, upa2); } /* Compute the sum of "upma1" and "upma2" on the union of their domains, * with the actual sum on the shared domain and * the defined expression on the symmetric difference of the domains. */ __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_union_add( __isl_take isl_union_pw_multi_aff *upma1, __isl_take isl_union_pw_multi_aff *upma2) { return isl_union_pw_multi_aff_union_add_(upma1, upma2); } /* 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", goto error); return isl_map_from_pw_multi_aff(pma); error: isl_pw_multi_aff_free(pma); return NULL; } /* 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. * Note that this expression may involve integer divisions defined * in terms of parameters and input dimensions. * * 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 eq; unsigned offset; unsigned n_div; 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); eq = isl_basic_map_output_defining_equality(bmap, 0); if (eq >= 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; offset = isl_basic_map_offset(bmap, isl_dim_out); n_div = isl_basic_map_dim(bmap, isl_dim_div); if (isl_int_is_neg(bmap->eq[eq][offset])) { isl_seq_cpy(aff->v->el + 1, bmap->eq[eq], offset); isl_seq_cpy(aff->v->el + 1 + offset, bmap->eq[eq] + offset + 1, n_div); } else { isl_seq_neg(aff->v->el + 1, bmap->eq[eq], offset); isl_seq_neg(aff->v->el + 1 + offset, bmap->eq[eq] + offset + 1, n_div); } isl_int_abs(aff->v->el[0], bmap->eq[eq][offset]); isl_basic_map_free(bmap); aff = isl_aff_remove_unused_divs(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; } /* Given a basic set where each set dimension is defined * in terms of the parameters using an equality, * extract an isl_multi_aff that expresses the set dimensions in terms * of the parameters. */ __isl_give isl_multi_aff *isl_multi_aff_from_basic_set_equalities( __isl_take isl_basic_set *bset) { return extract_isl_multi_aff_from_basic_map(bset); } /* 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. * * 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. */ 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); ma = isl_multi_aff_floor(ma); 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(map); 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 isl_stat 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 ? isl_stat_ok : isl_stat_error; } /* Create an isl_union_pw_multi_aff with the given isl_aff on a universe * domain. */ __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_from_aff( __isl_take isl_aff *aff) { isl_multi_aff *ma; isl_pw_multi_aff *pma; ma = isl_multi_aff_from_aff(aff); pma = isl_pw_multi_aff_from_multi_aff(ma); return isl_union_pw_multi_aff_from_pw_multi_aff(pma); } /* 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 "aff1" by the function represented by "aff2". * In other words, plug in "aff2" in "aff1". The result is an affine expression * defined over the domain space of "aff1". * * The domain of "aff1" should match the range of "aff2", which means * that it should be single-dimensional. */ __isl_give isl_aff *isl_aff_pullback_aff(__isl_take isl_aff *aff1, __isl_take isl_aff *aff2) { isl_multi_aff *ma; ma = isl_multi_aff_from_aff(aff2); return isl_aff_pullback_multi_aff(aff1, ma); } /* Compute the pullback of "ma1" by the function represented by "ma2". * In other words, plug in "ma2" in "ma1". * * The parameters of "ma1" and "ma2" are assumed to have been aligned. */ static __isl_give isl_multi_aff *isl_multi_aff_pullback_multi_aff_aligned( __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; } /* 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) { return isl_multi_aff_align_params_multi_multi_and(ma1, ma2, &isl_multi_aff_pullback_multi_aff_aligned); } /* 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 isl_stat 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 isl_stat_ok; } /* 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 isl_stat 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 isl_stat_ok; } /* 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; isl_stat (*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 isl_stat 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->space->ctx, &data->upma2->table, data->fn, data) < 0) return isl_stat_error; return isl_stat_ok; } /* 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, isl_stat (*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->space), upma1->table.n); if (isl_hash_table_foreach(upma1->space->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 isl_stat 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_is_equal(data->pma->dim, isl_dim_in, pma2->dim, isl_dim_in)) return isl_stat_ok; 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 isl_stat_ok; } /* 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_is_equal(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; } /* Do the parameters of "pa" match those of "space"? */ int isl_pw_aff_matching_params(__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); isl_space_free(pa_space); return match; } /* 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_is_equal(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 #undef DOMBASE #define DOMBASE set #include #include #include #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_is_equal(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 isl_stat 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 isl_stat_error; if (!isl_space_tuple_is_equal(pma->dim, isl_dim_out, data->mv->space, isl_dim_set)) return isl_stat_ok; 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 isl_stat_error; return isl_stat_ok; } /* 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->space), upma->table.n); if (isl_hash_table_foreach(upma->space->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; } /* Construct and return a piecewise multi affine expression * in the given space with value zero in each of the output dimensions and * a universe domain. */ __isl_give isl_pw_multi_aff *isl_pw_multi_aff_zero(__isl_take isl_space *space) { return isl_pw_multi_aff_from_multi_aff(isl_multi_aff_zero(space)); } /* Construct and return a piecewise multi affine expression * that is equal to the given piecewise affine expression. */ __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_pw_aff( __isl_take isl_pw_aff *pa) { int i; isl_space *space; isl_pw_multi_aff *pma; if (!pa) return NULL; space = isl_pw_aff_get_space(pa); pma = isl_pw_multi_aff_alloc_size(space, pa->n); for (i = 0; i < pa->n; ++i) { isl_set *set; isl_multi_aff *ma; set = isl_set_copy(pa->p[i].set); ma = isl_multi_aff_from_aff(isl_aff_copy(pa->p[i].aff)); pma = isl_pw_multi_aff_add_piece(pma, set, ma); } isl_pw_aff_free(pa); return pma; } /* Construct a set or map mapping the shared (parameter) domain * of the piecewise affine expressions to the range of "mpa" * with each dimension in the range equated to the * corresponding piecewise affine expression. */ static __isl_give isl_map *map_from_multi_pw_aff( __isl_take isl_multi_pw_aff *mpa) { int i; isl_space *space; isl_map *map; if (!mpa) return NULL; if (isl_space_dim(mpa->space, isl_dim_out) != mpa->n) isl_die(isl_multi_pw_aff_get_ctx(mpa), isl_error_internal, "invalid space", goto error); space = isl_multi_pw_aff_get_domain_space(mpa); map = isl_map_universe(isl_space_from_domain(space)); for (i = 0; i < mpa->n; ++i) { isl_pw_aff *pa; isl_map *map_i; pa = isl_pw_aff_copy(mpa->p[i]); map_i = map_from_pw_aff(pa); map = isl_map_flat_range_product(map, map_i); } map = isl_map_reset_space(map, isl_multi_pw_aff_get_space(mpa)); isl_multi_pw_aff_free(mpa); return map; error: isl_multi_pw_aff_free(mpa); return NULL; } /* Construct a map mapping the shared domain * of the piecewise affine expressions to the range of "mpa" * with each dimension in the range equated to the * corresponding piecewise affine expression. */ __isl_give isl_map *isl_map_from_multi_pw_aff(__isl_take isl_multi_pw_aff *mpa) { if (!mpa) return NULL; if (isl_space_is_set(mpa->space)) isl_die(isl_multi_pw_aff_get_ctx(mpa), isl_error_internal, "space of input is not a map", goto error); return map_from_multi_pw_aff(mpa); error: isl_multi_pw_aff_free(mpa); return NULL; } /* Construct a set mapping the shared parameter domain * of the piecewise affine expressions to the space of "mpa" * with each dimension in the range equated to the * corresponding piecewise affine expression. */ __isl_give isl_set *isl_set_from_multi_pw_aff(__isl_take isl_multi_pw_aff *mpa) { if (!mpa) return NULL; if (!isl_space_is_set(mpa->space)) isl_die(isl_multi_pw_aff_get_ctx(mpa), isl_error_internal, "space of input is not a set", goto error); return map_from_multi_pw_aff(mpa); error: isl_multi_pw_aff_free(mpa); return NULL; } /* Construct and return a piecewise multi affine expression * that is equal to the given multi piecewise affine expression * on the shared domain of the piecewise affine expressions. */ __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_multi_pw_aff( __isl_take isl_multi_pw_aff *mpa) { int i; isl_space *space; isl_pw_aff *pa; isl_pw_multi_aff *pma; if (!mpa) return NULL; space = isl_multi_pw_aff_get_space(mpa); if (mpa->n == 0) { isl_multi_pw_aff_free(mpa); return isl_pw_multi_aff_zero(space); } pa = isl_multi_pw_aff_get_pw_aff(mpa, 0); pma = isl_pw_multi_aff_from_pw_aff(pa); for (i = 1; i < mpa->n; ++i) { isl_pw_multi_aff *pma_i; pa = isl_multi_pw_aff_get_pw_aff(mpa, i); pma_i = isl_pw_multi_aff_from_pw_aff(pa); pma = isl_pw_multi_aff_range_product(pma, pma_i); } pma = isl_pw_multi_aff_reset_space(pma, space); isl_multi_pw_aff_free(mpa); return pma; } /* Construct and return a multi piecewise affine expression * that is equal to the given multi affine expression. */ __isl_give isl_multi_pw_aff *isl_multi_pw_aff_from_multi_aff( __isl_take isl_multi_aff *ma) { int i, n; isl_multi_pw_aff *mpa; if (!ma) return NULL; n = isl_multi_aff_dim(ma, isl_dim_out); mpa = isl_multi_pw_aff_alloc(isl_multi_aff_get_space(ma)); for (i = 0; i < n; ++i) { isl_pw_aff *pa; pa = isl_pw_aff_from_aff(isl_multi_aff_get_aff(ma, i)); mpa = isl_multi_pw_aff_set_pw_aff(mpa, i, pa); } isl_multi_aff_free(ma); return mpa; } /* Construct and return a multi piecewise affine expression * that is equal to the given piecewise multi affine expression. */ __isl_give isl_multi_pw_aff *isl_multi_pw_aff_from_pw_multi_aff( __isl_take isl_pw_multi_aff *pma) { int i, n; isl_space *space; isl_multi_pw_aff *mpa; if (!pma) return NULL; n = isl_pw_multi_aff_dim(pma, isl_dim_out); space = isl_pw_multi_aff_get_space(pma); mpa = isl_multi_pw_aff_alloc(space); for (i = 0; i < n; ++i) { isl_pw_aff *pa; pa = isl_pw_multi_aff_get_pw_aff(pma, i); mpa = isl_multi_pw_aff_set_pw_aff(mpa, i, pa); } isl_pw_multi_aff_free(pma); return mpa; } /* Do "pa1" and "pa2" represent the same function? * * We first check if they are obviously equal. * If not, we convert them to maps and check if those are equal. */ int isl_pw_aff_is_equal(__isl_keep isl_pw_aff *pa1, __isl_keep isl_pw_aff *pa2) { int equal; isl_map *map1, *map2; if (!pa1 || !pa2) return -1; equal = isl_pw_aff_plain_is_equal(pa1, pa2); if (equal < 0 || equal) return equal; map1 = map_from_pw_aff(isl_pw_aff_copy(pa1)); map2 = map_from_pw_aff(isl_pw_aff_copy(pa2)); equal = isl_map_is_equal(map1, map2); isl_map_free(map1); isl_map_free(map2); return equal; } /* Do "mpa1" and "mpa2" represent the same function? * * Note that we cannot convert the entire isl_multi_pw_aff * to a map because the domains of the piecewise affine expressions * may not be the same. */ isl_bool isl_multi_pw_aff_is_equal(__isl_keep isl_multi_pw_aff *mpa1, __isl_keep isl_multi_pw_aff *mpa2) { int i; isl_bool equal; if (!mpa1 || !mpa2) return isl_bool_error; if (!isl_space_match(mpa1->space, isl_dim_param, mpa2->space, isl_dim_param)) { if (!isl_space_has_named_params(mpa1->space)) return isl_bool_false; if (!isl_space_has_named_params(mpa2->space)) return isl_bool_false; mpa1 = isl_multi_pw_aff_copy(mpa1); mpa2 = isl_multi_pw_aff_copy(mpa2); mpa1 = isl_multi_pw_aff_align_params(mpa1, isl_multi_pw_aff_get_space(mpa2)); mpa2 = isl_multi_pw_aff_align_params(mpa2, isl_multi_pw_aff_get_space(mpa1)); equal = isl_multi_pw_aff_is_equal(mpa1, mpa2); isl_multi_pw_aff_free(mpa1); isl_multi_pw_aff_free(mpa2); return equal; } equal = isl_space_is_equal(mpa1->space, mpa2->space); if (equal < 0 || !equal) return equal; for (i = 0; i < mpa1->n; ++i) { equal = isl_pw_aff_is_equal(mpa1->p[i], mpa2->p[i]); if (equal < 0 || !equal) return equal; } return isl_bool_true; } /* Coalesce the elements of "mpa". * * Note that such coalescing does not change the meaning of "mpa" * so there is no need to cow. We do need to be careful not to * destroy any other copies of "mpa" in case of failure. */ __isl_give isl_multi_pw_aff *isl_multi_pw_aff_coalesce( __isl_take isl_multi_pw_aff *mpa) { int i; if (!mpa) return NULL; for (i = 0; i < mpa->n; ++i) { isl_pw_aff *pa = isl_pw_aff_copy(mpa->p[i]); pa = isl_pw_aff_coalesce(pa); if (!pa) return isl_multi_pw_aff_free(mpa); isl_pw_aff_free(mpa->p[i]); mpa->p[i] = pa; } return mpa; } /* Compute the pullback of "mpa" by the function represented by "ma". * In other words, plug in "ma" in "mpa". * * The parameters of "mpa" and "ma" are assumed to have been aligned. */ static __isl_give isl_multi_pw_aff *isl_multi_pw_aff_pullback_multi_aff_aligned( __isl_take isl_multi_pw_aff *mpa, __isl_take isl_multi_aff *ma) { int i; isl_space *space = NULL; mpa = isl_multi_pw_aff_cow(mpa); if (!mpa || !ma) goto error; space = isl_space_join(isl_multi_aff_get_space(ma), isl_multi_pw_aff_get_space(mpa)); if (!space) goto error; for (i = 0; i < mpa->n; ++i) { mpa->p[i] = isl_pw_aff_pullback_multi_aff(mpa->p[i], isl_multi_aff_copy(ma)); if (!mpa->p[i]) goto error; } isl_multi_aff_free(ma); isl_space_free(mpa->space); mpa->space = space; return mpa; error: isl_space_free(space); isl_multi_pw_aff_free(mpa); isl_multi_aff_free(ma); return NULL; } /* Compute the pullback of "mpa" by the function represented by "ma". * In other words, plug in "ma" in "mpa". */ __isl_give isl_multi_pw_aff *isl_multi_pw_aff_pullback_multi_aff( __isl_take isl_multi_pw_aff *mpa, __isl_take isl_multi_aff *ma) { if (!mpa || !ma) goto error; if (isl_space_match(mpa->space, isl_dim_param, ma->space, isl_dim_param)) return isl_multi_pw_aff_pullback_multi_aff_aligned(mpa, ma); mpa = isl_multi_pw_aff_align_params(mpa, isl_multi_aff_get_space(ma)); ma = isl_multi_aff_align_params(ma, isl_multi_pw_aff_get_space(mpa)); return isl_multi_pw_aff_pullback_multi_aff_aligned(mpa, ma); error: isl_multi_pw_aff_free(mpa); isl_multi_aff_free(ma); return NULL; } /* Compute the pullback of "mpa" by the function represented by "pma". * In other words, plug in "pma" in "mpa". * * The parameters of "mpa" and "mpa" are assumed to have been aligned. */ static __isl_give isl_multi_pw_aff * isl_multi_pw_aff_pullback_pw_multi_aff_aligned( __isl_take isl_multi_pw_aff *mpa, __isl_take isl_pw_multi_aff *pma) { int i; isl_space *space = NULL; mpa = isl_multi_pw_aff_cow(mpa); if (!mpa || !pma) goto error; space = isl_space_join(isl_pw_multi_aff_get_space(pma), isl_multi_pw_aff_get_space(mpa)); for (i = 0; i < mpa->n; ++i) { mpa->p[i] = isl_pw_aff_pullback_pw_multi_aff_aligned(mpa->p[i], isl_pw_multi_aff_copy(pma)); if (!mpa->p[i]) goto error; } isl_pw_multi_aff_free(pma); isl_space_free(mpa->space); mpa->space = space; return mpa; error: isl_space_free(space); isl_multi_pw_aff_free(mpa); isl_pw_multi_aff_free(pma); return NULL; } /* Compute the pullback of "mpa" by the function represented by "pma". * In other words, plug in "pma" in "mpa". */ __isl_give isl_multi_pw_aff *isl_multi_pw_aff_pullback_pw_multi_aff( __isl_take isl_multi_pw_aff *mpa, __isl_take isl_pw_multi_aff *pma) { if (!mpa || !pma) goto error; if (isl_space_match(mpa->space, isl_dim_param, pma->dim, isl_dim_param)) return isl_multi_pw_aff_pullback_pw_multi_aff_aligned(mpa, pma); mpa = isl_multi_pw_aff_align_params(mpa, isl_pw_multi_aff_get_space(pma)); pma = isl_pw_multi_aff_align_params(pma, isl_multi_pw_aff_get_space(mpa)); return isl_multi_pw_aff_pullback_pw_multi_aff_aligned(mpa, pma); error: isl_multi_pw_aff_free(mpa); isl_pw_multi_aff_free(pma); return NULL; } /* Apply "aff" to "mpa". The range of "mpa" needs to be compatible * with the domain of "aff". The domain of the result is the same * as that of "mpa". * "mpa" and "aff" are assumed to have been aligned. * * We first extract the parametric constant from "aff", defined * over the correct domain. * Then we add the appropriate combinations of the members of "mpa". * Finally, we add the integer divisions through recursive calls. */ static __isl_give isl_pw_aff *isl_multi_pw_aff_apply_aff_aligned( __isl_take isl_multi_pw_aff *mpa, __isl_take isl_aff *aff) { int i, n_in, n_div; isl_space *space; isl_val *v; isl_pw_aff *pa; isl_aff *tmp; n_in = isl_aff_dim(aff, isl_dim_in); n_div = isl_aff_dim(aff, isl_dim_div); space = isl_space_domain(isl_multi_pw_aff_get_space(mpa)); tmp = isl_aff_copy(aff); tmp = isl_aff_drop_dims(tmp, isl_dim_div, 0, n_div); tmp = isl_aff_drop_dims(tmp, isl_dim_in, 0, n_in); tmp = isl_aff_add_dims(tmp, isl_dim_in, isl_space_dim(space, isl_dim_set)); tmp = isl_aff_reset_domain_space(tmp, space); pa = isl_pw_aff_from_aff(tmp); for (i = 0; i < n_in; ++i) { isl_pw_aff *pa_i; if (!isl_aff_involves_dims(aff, isl_dim_in, i, 1)) continue; v = isl_aff_get_coefficient_val(aff, isl_dim_in, i); pa_i = isl_multi_pw_aff_get_pw_aff(mpa, i); pa_i = isl_pw_aff_scale_val(pa_i, v); pa = isl_pw_aff_add(pa, pa_i); } for (i = 0; i < n_div; ++i) { isl_aff *div; isl_pw_aff *pa_i; if (!isl_aff_involves_dims(aff, isl_dim_div, i, 1)) continue; div = isl_aff_get_div(aff, i); pa_i = isl_multi_pw_aff_apply_aff_aligned( isl_multi_pw_aff_copy(mpa), div); pa_i = isl_pw_aff_floor(pa_i); v = isl_aff_get_coefficient_val(aff, isl_dim_div, i); pa_i = isl_pw_aff_scale_val(pa_i, v); pa = isl_pw_aff_add(pa, pa_i); } isl_multi_pw_aff_free(mpa); isl_aff_free(aff); return pa; } /* Apply "aff" to "mpa". The range of "mpa" needs to be compatible * with the domain of "aff". The domain of the result is the same * as that of "mpa". */ __isl_give isl_pw_aff *isl_multi_pw_aff_apply_aff( __isl_take isl_multi_pw_aff *mpa, __isl_take isl_aff *aff) { if (!aff || !mpa) goto error; if (isl_space_match(aff->ls->dim, isl_dim_param, mpa->space, isl_dim_param)) return isl_multi_pw_aff_apply_aff_aligned(mpa, aff); aff = isl_aff_align_params(aff, isl_multi_pw_aff_get_space(mpa)); mpa = isl_multi_pw_aff_align_params(mpa, isl_aff_get_space(aff)); return isl_multi_pw_aff_apply_aff_aligned(mpa, aff); error: isl_aff_free(aff); isl_multi_pw_aff_free(mpa); return NULL; } /* Apply "pa" to "mpa". The range of "mpa" needs to be compatible * with the domain of "pa". The domain of the result is the same * as that of "mpa". * "mpa" and "pa" are assumed to have been aligned. * * We consider each piece in turn. Note that the domains of the * pieces are assumed to be disjoint and they remain disjoint * after taking the preimage (over the same function). */ static __isl_give isl_pw_aff *isl_multi_pw_aff_apply_pw_aff_aligned( __isl_take isl_multi_pw_aff *mpa, __isl_take isl_pw_aff *pa) { isl_space *space; isl_pw_aff *res; int i; if (!mpa || !pa) goto error; space = isl_space_join(isl_multi_pw_aff_get_space(mpa), isl_pw_aff_get_space(pa)); res = isl_pw_aff_empty(space); for (i = 0; i < pa->n; ++i) { isl_pw_aff *pa_i; isl_set *domain; pa_i = isl_multi_pw_aff_apply_aff_aligned( isl_multi_pw_aff_copy(mpa), isl_aff_copy(pa->p[i].aff)); domain = isl_set_copy(pa->p[i].set); domain = isl_set_preimage_multi_pw_aff(domain, isl_multi_pw_aff_copy(mpa)); pa_i = isl_pw_aff_intersect_domain(pa_i, domain); res = isl_pw_aff_add_disjoint(res, pa_i); } isl_pw_aff_free(pa); isl_multi_pw_aff_free(mpa); return res; error: isl_pw_aff_free(pa); isl_multi_pw_aff_free(mpa); return NULL; } /* Apply "pa" to "mpa". The range of "mpa" needs to be compatible * with the domain of "pa". The domain of the result is the same * as that of "mpa". */ __isl_give isl_pw_aff *isl_multi_pw_aff_apply_pw_aff( __isl_take isl_multi_pw_aff *mpa, __isl_take isl_pw_aff *pa) { if (!pa || !mpa) goto error; if (isl_space_match(pa->dim, isl_dim_param, mpa->space, isl_dim_param)) return isl_multi_pw_aff_apply_pw_aff_aligned(mpa, pa); pa = isl_pw_aff_align_params(pa, isl_multi_pw_aff_get_space(mpa)); mpa = isl_multi_pw_aff_align_params(mpa, isl_pw_aff_get_space(pa)); return isl_multi_pw_aff_apply_pw_aff_aligned(mpa, pa); error: isl_pw_aff_free(pa); isl_multi_pw_aff_free(mpa); return NULL; } /* Compute the pullback of "pa" by the function represented by "mpa". * In other words, plug in "mpa" in "pa". * "pa" and "mpa" are assumed to have been aligned. * * The pullback is computed by applying "pa" to "mpa". */ static __isl_give isl_pw_aff *isl_pw_aff_pullback_multi_pw_aff_aligned( __isl_take isl_pw_aff *pa, __isl_take isl_multi_pw_aff *mpa) { return isl_multi_pw_aff_apply_pw_aff_aligned(mpa, pa); } /* Compute the pullback of "pa" by the function represented by "mpa". * In other words, plug in "mpa" in "pa". * * The pullback is computed by applying "pa" to "mpa". */ __isl_give isl_pw_aff *isl_pw_aff_pullback_multi_pw_aff( __isl_take isl_pw_aff *pa, __isl_take isl_multi_pw_aff *mpa) { return isl_multi_pw_aff_apply_pw_aff(mpa, pa); } /* Compute the pullback of "mpa1" by the function represented by "mpa2". * In other words, plug in "mpa2" in "mpa1". * * The parameters of "mpa1" and "mpa2" are assumed to have been aligned. * * We pullback each member of "mpa1" in turn. */ static __isl_give isl_multi_pw_aff * isl_multi_pw_aff_pullback_multi_pw_aff_aligned( __isl_take isl_multi_pw_aff *mpa1, __isl_take isl_multi_pw_aff *mpa2) { int i; isl_space *space = NULL; mpa1 = isl_multi_pw_aff_cow(mpa1); if (!mpa1 || !mpa2) goto error; space = isl_space_join(isl_multi_pw_aff_get_space(mpa2), isl_multi_pw_aff_get_space(mpa1)); for (i = 0; i < mpa1->n; ++i) { mpa1->p[i] = isl_pw_aff_pullback_multi_pw_aff_aligned( mpa1->p[i], isl_multi_pw_aff_copy(mpa2)); if (!mpa1->p[i]) goto error; } mpa1 = isl_multi_pw_aff_reset_space(mpa1, space); isl_multi_pw_aff_free(mpa2); return mpa1; error: isl_space_free(space); isl_multi_pw_aff_free(mpa1); isl_multi_pw_aff_free(mpa2); return NULL; } /* Compute the pullback of "mpa1" by the function represented by "mpa2". * In other words, plug in "mpa2" in "mpa1". */ __isl_give isl_multi_pw_aff *isl_multi_pw_aff_pullback_multi_pw_aff( __isl_take isl_multi_pw_aff *mpa1, __isl_take isl_multi_pw_aff *mpa2) { return isl_multi_pw_aff_align_params_multi_multi_and(mpa1, mpa2, &isl_multi_pw_aff_pullback_multi_pw_aff_aligned); } /* Align the parameters of "mpa1" and "mpa2", check that the ranges * of "mpa1" and "mpa2" live in the same space, construct map space * between the domain spaces of "mpa1" and "mpa2" and call "order" * with this map space as extract argument. */ static __isl_give isl_map *isl_multi_pw_aff_order_map( __isl_take isl_multi_pw_aff *mpa1, __isl_take isl_multi_pw_aff *mpa2, __isl_give isl_map *(*order)(__isl_keep isl_multi_pw_aff *mpa1, __isl_keep isl_multi_pw_aff *mpa2, __isl_take isl_space *space)) { int match; isl_space *space1, *space2; isl_map *res; mpa1 = isl_multi_pw_aff_align_params(mpa1, isl_multi_pw_aff_get_space(mpa2)); mpa2 = isl_multi_pw_aff_align_params(mpa2, isl_multi_pw_aff_get_space(mpa1)); if (!mpa1 || !mpa2) goto error; match = isl_space_tuple_is_equal(mpa1->space, isl_dim_out, mpa2->space, isl_dim_out); if (match < 0) goto error; if (!match) isl_die(isl_multi_pw_aff_get_ctx(mpa1), isl_error_invalid, "range spaces don't match", goto error); space1 = isl_space_domain(isl_multi_pw_aff_get_space(mpa1)); space2 = isl_space_domain(isl_multi_pw_aff_get_space(mpa2)); space1 = isl_space_map_from_domain_and_range(space1, space2); res = order(mpa1, mpa2, space1); isl_multi_pw_aff_free(mpa1); isl_multi_pw_aff_free(mpa2); return res; error: isl_multi_pw_aff_free(mpa1); isl_multi_pw_aff_free(mpa2); return NULL; } /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2" * where the function values are equal. "space" is the space of the result. * The parameters of "mpa1" and "mpa2" are assumed to have been aligned. * * "mpa1" and "mpa2" are equal when each of the pairs of elements * in the sequences are equal. */ static __isl_give isl_map *isl_multi_pw_aff_eq_map_on_space( __isl_keep isl_multi_pw_aff *mpa1, __isl_keep isl_multi_pw_aff *mpa2, __isl_take isl_space *space) { int i, n; isl_map *res; res = isl_map_universe(space); n = isl_multi_pw_aff_dim(mpa1, isl_dim_out); for (i = 0; i < n; ++i) { isl_pw_aff *pa1, *pa2; isl_map *map; pa1 = isl_multi_pw_aff_get_pw_aff(mpa1, i); pa2 = isl_multi_pw_aff_get_pw_aff(mpa2, i); map = isl_pw_aff_eq_map(pa1, pa2); res = isl_map_intersect(res, map); } return res; } /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2" * where the function values are equal. */ __isl_give isl_map *isl_multi_pw_aff_eq_map(__isl_take isl_multi_pw_aff *mpa1, __isl_take isl_multi_pw_aff *mpa2) { return isl_multi_pw_aff_order_map(mpa1, mpa2, &isl_multi_pw_aff_eq_map_on_space); } /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2" * where the function values of "mpa1" is lexicographically satisfies "base" * compared to that of "mpa2". "space" is the space of the result. * The parameters of "mpa1" and "mpa2" are assumed to have been aligned. * * "mpa1" lexicographically satisfies "base" compared to "mpa2" * if its i-th element satisfies "base" when compared to * the i-th element of "mpa2" while all previous elements are * pairwise equal. */ static __isl_give isl_map *isl_multi_pw_aff_lex_map_on_space( __isl_take isl_multi_pw_aff *mpa1, __isl_take isl_multi_pw_aff *mpa2, __isl_give isl_map *(*base)(__isl_take isl_pw_aff *pa1, __isl_take isl_pw_aff *pa2), __isl_take isl_space *space) { int i, n; isl_map *res, *rest; res = isl_map_empty(isl_space_copy(space)); rest = isl_map_universe(space); n = isl_multi_pw_aff_dim(mpa1, isl_dim_out); for (i = 0; i < n; ++i) { isl_pw_aff *pa1, *pa2; isl_map *map; pa1 = isl_multi_pw_aff_get_pw_aff(mpa1, i); pa2 = isl_multi_pw_aff_get_pw_aff(mpa2, i); map = base(pa1, pa2); map = isl_map_intersect(map, isl_map_copy(rest)); res = isl_map_union(res, map); if (i == n - 1) continue; pa1 = isl_multi_pw_aff_get_pw_aff(mpa1, i); pa2 = isl_multi_pw_aff_get_pw_aff(mpa2, i); map = isl_pw_aff_eq_map(pa1, pa2); rest = isl_map_intersect(rest, map); } isl_map_free(rest); return res; } /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2" * where the function value of "mpa1" is lexicographically less than that * of "mpa2". "space" is the space of the result. * The parameters of "mpa1" and "mpa2" are assumed to have been aligned. * * "mpa1" is less than "mpa2" if its i-th element is smaller * than the i-th element of "mpa2" while all previous elements are * pairwise equal. */ __isl_give isl_map *isl_multi_pw_aff_lex_lt_map_on_space( __isl_take isl_multi_pw_aff *mpa1, __isl_take isl_multi_pw_aff *mpa2, __isl_take isl_space *space) { return isl_multi_pw_aff_lex_map_on_space(mpa1, mpa2, &isl_pw_aff_lt_map, space); } /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2" * where the function value of "mpa1" is lexicographically less than that * of "mpa2". */ __isl_give isl_map *isl_multi_pw_aff_lex_lt_map( __isl_take isl_multi_pw_aff *mpa1, __isl_take isl_multi_pw_aff *mpa2) { return isl_multi_pw_aff_order_map(mpa1, mpa2, &isl_multi_pw_aff_lex_lt_map_on_space); } /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2" * where the function value of "mpa1" is lexicographically greater than that * of "mpa2". "space" is the space of the result. * The parameters of "mpa1" and "mpa2" are assumed to have been aligned. * * "mpa1" is greater than "mpa2" if its i-th element is greater * than the i-th element of "mpa2" while all previous elements are * pairwise equal. */ __isl_give isl_map *isl_multi_pw_aff_lex_gt_map_on_space( __isl_take isl_multi_pw_aff *mpa1, __isl_take isl_multi_pw_aff *mpa2, __isl_take isl_space *space) { return isl_multi_pw_aff_lex_map_on_space(mpa1, mpa2, &isl_pw_aff_gt_map, space); } /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2" * where the function value of "mpa1" is lexicographically greater than that * of "mpa2". */ __isl_give isl_map *isl_multi_pw_aff_lex_gt_map( __isl_take isl_multi_pw_aff *mpa1, __isl_take isl_multi_pw_aff *mpa2) { return isl_multi_pw_aff_order_map(mpa1, mpa2, &isl_multi_pw_aff_lex_gt_map_on_space); } /* Compare two isl_affs. * * Return -1 if "aff1" is "smaller" than "aff2", 1 if "aff1" is "greater" * than "aff2" and 0 if they are equal. * * The order is fairly arbitrary. We do consider expressions that only involve * earlier dimensions as "smaller". */ int isl_aff_plain_cmp(__isl_keep isl_aff *aff1, __isl_keep isl_aff *aff2) { int cmp; int last1, last2; if (aff1 == aff2) return 0; if (!aff1) return -1; if (!aff2) return 1; cmp = isl_local_space_cmp(aff1->ls, aff2->ls); if (cmp != 0) return cmp; last1 = isl_seq_last_non_zero(aff1->v->el + 1, aff1->v->size - 1); last2 = isl_seq_last_non_zero(aff2->v->el + 1, aff1->v->size - 1); if (last1 != last2) return last1 - last2; return isl_seq_cmp(aff1->v->el, aff2->v->el, aff1->v->size); } /* Compare two isl_pw_affs. * * Return -1 if "pa1" is "smaller" than "pa2", 1 if "pa1" is "greater" * than "pa2" and 0 if they are equal. * * The order is fairly arbitrary. We do consider expressions that only involve * earlier dimensions as "smaller". */ int isl_pw_aff_plain_cmp(__isl_keep isl_pw_aff *pa1, __isl_keep isl_pw_aff *pa2) { int i; int cmp; if (pa1 == pa2) return 0; if (!pa1) return -1; if (!pa2) return 1; cmp = isl_space_cmp(pa1->dim, pa2->dim); if (cmp != 0) return cmp; if (pa1->n != pa2->n) return pa1->n - pa2->n; for (i = 0; i < pa1->n; ++i) { cmp = isl_set_plain_cmp(pa1->p[i].set, pa2->p[i].set); if (cmp != 0) return cmp; cmp = isl_aff_plain_cmp(pa1->p[i].aff, pa2->p[i].aff); if (cmp != 0) return cmp; } return 0; } /* Return a piecewise affine expression that is equal to "v" on "domain". */ __isl_give isl_pw_aff *isl_pw_aff_val_on_domain(__isl_take isl_set *domain, __isl_take isl_val *v) { isl_space *space; isl_local_space *ls; isl_aff *aff; space = isl_set_get_space(domain); ls = isl_local_space_from_space(space); aff = isl_aff_val_on_domain(ls, v); return isl_pw_aff_alloc(domain, aff); } /* Return a multi affine expression that is equal to "mv" on domain * space "space". */ __isl_give isl_multi_aff *isl_multi_aff_multi_val_on_space( __isl_take isl_space *space, __isl_take isl_multi_val *mv) { int i, n; isl_space *space2; isl_local_space *ls; isl_multi_aff *ma; if (!space || !mv) goto error; n = isl_multi_val_dim(mv, isl_dim_set); space2 = isl_multi_val_get_space(mv); space2 = isl_space_align_params(space2, isl_space_copy(space)); space = isl_space_align_params(space, isl_space_copy(space2)); space = isl_space_map_from_domain_and_range(space, space2); ma = isl_multi_aff_alloc(isl_space_copy(space)); ls = isl_local_space_from_space(isl_space_domain(space)); for (i = 0; i < n; ++i) { isl_val *v; isl_aff *aff; v = isl_multi_val_get_val(mv, i); aff = isl_aff_val_on_domain(isl_local_space_copy(ls), v); ma = isl_multi_aff_set_aff(ma, i, aff); } isl_local_space_free(ls); isl_multi_val_free(mv); return ma; error: isl_space_free(space); isl_multi_val_free(mv); return NULL; } /* Return a piecewise multi-affine expression * that is equal to "mv" on "domain". */ __isl_give isl_pw_multi_aff *isl_pw_multi_aff_multi_val_on_domain( __isl_take isl_set *domain, __isl_take isl_multi_val *mv) { isl_space *space; isl_multi_aff *ma; space = isl_set_get_space(domain); ma = isl_multi_aff_multi_val_on_space(space, mv); return isl_pw_multi_aff_alloc(domain, ma); } /* Internal data structure for isl_union_pw_multi_aff_multi_val_on_domain. * mv is the value that should be attained on each domain set * res collects the results */ struct isl_union_pw_multi_aff_multi_val_on_domain_data { isl_multi_val *mv; isl_union_pw_multi_aff *res; }; /* Create an isl_pw_multi_aff equal to data->mv on "domain" * and add it to data->res. */ static isl_stat pw_multi_aff_multi_val_on_domain(__isl_take isl_set *domain, void *user) { struct isl_union_pw_multi_aff_multi_val_on_domain_data *data = user; isl_pw_multi_aff *pma; isl_multi_val *mv; mv = isl_multi_val_copy(data->mv); pma = isl_pw_multi_aff_multi_val_on_domain(domain, mv); data->res = isl_union_pw_multi_aff_add_pw_multi_aff(data->res, pma); return data->res ? isl_stat_ok : isl_stat_error; } /* Return a union piecewise multi-affine expression * that is equal to "mv" on "domain". */ __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_multi_val_on_domain( __isl_take isl_union_set *domain, __isl_take isl_multi_val *mv) { struct isl_union_pw_multi_aff_multi_val_on_domain_data data; isl_space *space; space = isl_union_set_get_space(domain); data.res = isl_union_pw_multi_aff_empty(space); data.mv = mv; if (isl_union_set_foreach_set(domain, &pw_multi_aff_multi_val_on_domain, &data) < 0) data.res = isl_union_pw_multi_aff_free(data.res); isl_union_set_free(domain); isl_multi_val_free(mv); return data.res; } /* Compute the pullback of data->pma by the function represented by "pma2", * provided the spaces match, and add the results to data->res. */ static isl_stat pullback_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_is_equal(data->pma->dim, isl_dim_in, pma2->dim, isl_dim_out)) return isl_stat_ok; pma2 = isl_pw_multi_aff_pullback_pw_multi_aff( 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); if (!data->res) return isl_stat_error; return isl_stat_ok; } /* Compute the pullback of "upma1" by the function represented by "upma2". */ __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_pullback_union_pw_multi_aff( __isl_take isl_union_pw_multi_aff *upma1, __isl_take isl_union_pw_multi_aff *upma2) { return bin_op(upma1, upma2, &pullback_entry); } /* Check that the domain space of "upa" matches "space". * * Return 0 on success and -1 on error. * * This function is called from isl_multi_union_pw_aff_set_union_pw_aff and * can in principle never fail since the space "space" is that * of the isl_multi_union_pw_aff and is a set space such that * there is no domain space to match. * * We check the parameters and double-check that "space" is * indeed that of a set. */ static int isl_union_pw_aff_check_match_domain_space( __isl_keep isl_union_pw_aff *upa, __isl_keep isl_space *space) { isl_space *upa_space; int match; if (!upa || !space) return -1; match = isl_space_is_set(space); if (match < 0) return -1; if (!match) isl_die(isl_space_get_ctx(space), isl_error_invalid, "expecting set space", return -1); upa_space = isl_union_pw_aff_get_space(upa); match = isl_space_match(space, isl_dim_param, upa_space, isl_dim_param); if (match < 0) goto error; if (!match) isl_die(isl_space_get_ctx(space), isl_error_invalid, "parameters don't match", goto error); isl_space_free(upa_space); return 0; error: isl_space_free(upa_space); return -1; } /* Do the parameters of "upa" match those of "space"? */ static int isl_union_pw_aff_matching_params(__isl_keep isl_union_pw_aff *upa, __isl_keep isl_space *space) { isl_space *upa_space; int match; if (!upa || !space) return -1; upa_space = isl_union_pw_aff_get_space(upa); match = isl_space_match(space, isl_dim_param, upa_space, isl_dim_param); isl_space_free(upa_space); return match; } /* Internal data structure for isl_union_pw_aff_reset_domain_space. * space represents the new parameters. * res collects the results. */ struct isl_union_pw_aff_reset_params_data { isl_space *space; isl_union_pw_aff *res; }; /* Replace the parameters of "pa" by data->space and * add the result to data->res. */ static isl_stat reset_params(__isl_take isl_pw_aff *pa, void *user) { struct isl_union_pw_aff_reset_params_data *data = user; isl_space *space; space = isl_pw_aff_get_space(pa); space = isl_space_replace(space, isl_dim_param, data->space); pa = isl_pw_aff_reset_space(pa, space); data->res = isl_union_pw_aff_add_pw_aff(data->res, pa); return data->res ? isl_stat_ok : isl_stat_error; } /* Replace the domain space of "upa" by "space". * Since a union expression does not have a (single) domain space, * "space" is necessarily a parameter space. * * Since the order and the names of the parameters determine * the hash value, we need to create a new hash table. */ static __isl_give isl_union_pw_aff *isl_union_pw_aff_reset_domain_space( __isl_take isl_union_pw_aff *upa, __isl_take isl_space *space) { struct isl_union_pw_aff_reset_params_data data = { space }; int match; match = isl_union_pw_aff_matching_params(upa, space); if (match < 0) upa = isl_union_pw_aff_free(upa); else if (match) { isl_space_free(space); return upa; } data.res = isl_union_pw_aff_empty(isl_space_copy(space)); if (isl_union_pw_aff_foreach_pw_aff(upa, &reset_params, &data) < 0) data.res = isl_union_pw_aff_free(data.res); isl_union_pw_aff_free(upa); isl_space_free(space); return data.res; } /* Replace the entry of isl_union_pw_aff to which "entry" points * by its floor. */ static isl_stat floor_entry(void **entry, void *user) { isl_pw_aff **pa = (isl_pw_aff **) entry; *pa = isl_pw_aff_floor(*pa); if (!*pa) return isl_stat_error; return isl_stat_ok; } /* Given f, return floor(f). */ __isl_give isl_union_pw_aff *isl_union_pw_aff_floor( __isl_take isl_union_pw_aff *upa) { isl_ctx *ctx; upa = isl_union_pw_aff_cow(upa); if (!upa) return NULL; ctx = isl_union_pw_aff_get_ctx(upa); if (isl_hash_table_foreach(ctx, &upa->table, &floor_entry, NULL) < 0) upa = isl_union_pw_aff_free(upa); return upa; } /* Compute * * upa mod m = upa - m * floor(upa/m) * * with m an integer value. */ __isl_give isl_union_pw_aff *isl_union_pw_aff_mod_val( __isl_take isl_union_pw_aff *upa, __isl_take isl_val *m) { isl_union_pw_aff *res; if (!upa || !m) goto error; if (!isl_val_is_int(m)) isl_die(isl_val_get_ctx(m), isl_error_invalid, "expecting integer modulo", goto error); if (!isl_val_is_pos(m)) isl_die(isl_val_get_ctx(m), isl_error_invalid, "expecting positive modulo", goto error); res = isl_union_pw_aff_copy(upa); upa = isl_union_pw_aff_scale_down_val(upa, isl_val_copy(m)); upa = isl_union_pw_aff_floor(upa); upa = isl_union_pw_aff_scale_val(upa, m); res = isl_union_pw_aff_sub(res, upa); return res; error: isl_val_free(m); isl_union_pw_aff_free(upa); return NULL; } /* Internal data structure for isl_union_pw_aff_aff_on_domain. * "aff" is the symbolic value that the resulting isl_union_pw_aff * needs to attain. * "res" collects the results. */ struct isl_union_pw_aff_aff_on_domain_data { isl_aff *aff; isl_union_pw_aff *res; }; /* Construct a piecewise affine expression that is equal to data->aff * on "domain" and add the result to data->res. */ static isl_stat pw_aff_aff_on_domain(__isl_take isl_set *domain, void *user) { struct isl_union_pw_aff_aff_on_domain_data *data = user; isl_pw_aff *pa; isl_aff *aff; int dim; aff = isl_aff_copy(data->aff); dim = isl_set_dim(domain, isl_dim_set); aff = isl_aff_add_dims(aff, isl_dim_in, dim); aff = isl_aff_reset_domain_space(aff, isl_set_get_space(domain)); pa = isl_pw_aff_alloc(domain, aff); data->res = isl_union_pw_aff_add_pw_aff(data->res, pa); return data->res ? isl_stat_ok : isl_stat_error; } /* Internal data structure for isl_union_pw_multi_aff_get_union_pw_aff. * pos is the output position that needs to be extracted. * res collects the results. */ struct isl_union_pw_multi_aff_get_union_pw_aff_data { int pos; isl_union_pw_aff *res; }; /* Extract an isl_pw_aff corresponding to output dimension "pos" of "pma" * (assuming it has such a dimension) and add it to data->res. */ static isl_stat get_union_pw_aff(__isl_take isl_pw_multi_aff *pma, void *user) { struct isl_union_pw_multi_aff_get_union_pw_aff_data *data = user; int n_out; isl_pw_aff *pa; if (!pma) return isl_stat_error; n_out = isl_pw_multi_aff_dim(pma, isl_dim_out); if (data->pos >= n_out) { isl_pw_multi_aff_free(pma); return isl_stat_ok; } pa = isl_pw_multi_aff_get_pw_aff(pma, data->pos); isl_pw_multi_aff_free(pma); data->res = isl_union_pw_aff_add_pw_aff(data->res, pa); return data->res ? isl_stat_ok : isl_stat_error; } /* Extract an isl_union_pw_aff corresponding to * output dimension "pos" of "upma". */ __isl_give isl_union_pw_aff *isl_union_pw_multi_aff_get_union_pw_aff( __isl_keep isl_union_pw_multi_aff *upma, int pos) { struct isl_union_pw_multi_aff_get_union_pw_aff_data data; isl_space *space; if (!upma) return NULL; if (pos < 0) isl_die(isl_union_pw_multi_aff_get_ctx(upma), isl_error_invalid, "cannot extract at negative position", return NULL); space = isl_union_pw_multi_aff_get_space(upma); data.res = isl_union_pw_aff_empty(space); data.pos = pos; if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma, &get_union_pw_aff, &data) < 0) data.res = isl_union_pw_aff_free(data.res); return data.res; } /* Return a union piecewise affine expression * that is equal to "aff" on "domain". * * Construct an isl_pw_aff on each of the sets in "domain" and * collect the results. */ __isl_give isl_union_pw_aff *isl_union_pw_aff_aff_on_domain( __isl_take isl_union_set *domain, __isl_take isl_aff *aff) { struct isl_union_pw_aff_aff_on_domain_data data; isl_space *space; if (!domain || !aff) goto error; if (!isl_local_space_is_params(aff->ls)) isl_die(isl_aff_get_ctx(aff), isl_error_invalid, "expecting parametric expression", goto error); space = isl_union_set_get_space(domain); data.res = isl_union_pw_aff_empty(space); data.aff = aff; if (isl_union_set_foreach_set(domain, &pw_aff_aff_on_domain, &data) < 0) data.res = isl_union_pw_aff_free(data.res); isl_union_set_free(domain); isl_aff_free(aff); return data.res; error: isl_union_set_free(domain); isl_aff_free(aff); return NULL; } /* Internal data structure for isl_union_pw_aff_val_on_domain. * "v" is the value that the resulting isl_union_pw_aff needs to attain. * "res" collects the results. */ struct isl_union_pw_aff_val_on_domain_data { isl_val *v; isl_union_pw_aff *res; }; /* Construct a piecewise affine expression that is equal to data->v * on "domain" and add the result to data->res. */ static isl_stat pw_aff_val_on_domain(__isl_take isl_set *domain, void *user) { struct isl_union_pw_aff_val_on_domain_data *data = user; isl_pw_aff *pa; isl_val *v; v = isl_val_copy(data->v); pa = isl_pw_aff_val_on_domain(domain, v); data->res = isl_union_pw_aff_add_pw_aff(data->res, pa); return data->res ? isl_stat_ok : isl_stat_error; } /* Return a union piecewise affine expression * that is equal to "v" on "domain". * * Construct an isl_pw_aff on each of the sets in "domain" and * collect the results. */ __isl_give isl_union_pw_aff *isl_union_pw_aff_val_on_domain( __isl_take isl_union_set *domain, __isl_take isl_val *v) { struct isl_union_pw_aff_val_on_domain_data data; isl_space *space; space = isl_union_set_get_space(domain); data.res = isl_union_pw_aff_empty(space); data.v = v; if (isl_union_set_foreach_set(domain, &pw_aff_val_on_domain, &data) < 0) data.res = isl_union_pw_aff_free(data.res); isl_union_set_free(domain); isl_val_free(v); return data.res; } /* Construct a piecewise multi affine expression * that is equal to "pa" and add it to upma. */ static isl_stat pw_multi_aff_from_pw_aff_entry(__isl_take isl_pw_aff *pa, void *user) { isl_union_pw_multi_aff **upma = user; isl_pw_multi_aff *pma; pma = isl_pw_multi_aff_from_pw_aff(pa); *upma = isl_union_pw_multi_aff_add_pw_multi_aff(*upma, pma); return *upma ? isl_stat_ok : isl_stat_error; } /* Construct and return a union piecewise multi affine expression * that is equal to the given union piecewise affine expression. */ __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_from_union_pw_aff( __isl_take isl_union_pw_aff *upa) { isl_space *space; isl_union_pw_multi_aff *upma; if (!upa) return NULL; space = isl_union_pw_aff_get_space(upa); upma = isl_union_pw_multi_aff_empty(space); if (isl_union_pw_aff_foreach_pw_aff(upa, &pw_multi_aff_from_pw_aff_entry, &upma) < 0) upma = isl_union_pw_multi_aff_free(upma); isl_union_pw_aff_free(upa); return upma; } /* Compute the set of elements in the domain of "pa" where it is zero and * add this set to "uset". */ static isl_stat zero_union_set(__isl_take isl_pw_aff *pa, void *user) { isl_union_set **uset = (isl_union_set **)user; *uset = isl_union_set_add_set(*uset, isl_pw_aff_zero_set(pa)); return *uset ? isl_stat_ok : isl_stat_error; } /* Return a union set containing those elements in the domain * of "upa" where it is zero. */ __isl_give isl_union_set *isl_union_pw_aff_zero_union_set( __isl_take isl_union_pw_aff *upa) { isl_union_set *zero; zero = isl_union_set_empty(isl_union_pw_aff_get_space(upa)); if (isl_union_pw_aff_foreach_pw_aff(upa, &zero_union_set, &zero) < 0) zero = isl_union_set_free(zero); isl_union_pw_aff_free(upa); return zero; } /* Convert "pa" to an isl_map and add it to *umap. */ static isl_stat map_from_pw_aff_entry(__isl_take isl_pw_aff *pa, void *user) { isl_union_map **umap = user; isl_map *map; map = isl_map_from_pw_aff(pa); *umap = isl_union_map_add_map(*umap, map); return *umap ? isl_stat_ok : isl_stat_error; } /* Construct a union map mapping the domain of the union * piecewise affine expression to its range, with the single output dimension * equated to the corresponding affine expressions on their cells. */ __isl_give isl_union_map *isl_union_map_from_union_pw_aff( __isl_take isl_union_pw_aff *upa) { isl_space *space; isl_union_map *umap; if (!upa) return NULL; space = isl_union_pw_aff_get_space(upa); umap = isl_union_map_empty(space); if (isl_union_pw_aff_foreach_pw_aff(upa, &map_from_pw_aff_entry, &umap) < 0) umap = isl_union_map_free(umap); isl_union_pw_aff_free(upa); return umap; } /* Internal data structure for isl_union_pw_aff_pullback_union_pw_multi_aff. * upma is the function that is plugged in. * pa is the current part of the function in which upma is plugged in. * res collects the results. */ struct isl_union_pw_aff_pullback_upma_data { isl_union_pw_multi_aff *upma; isl_pw_aff *pa; isl_union_pw_aff *res; }; /* Check if "pma" can be plugged into data->pa. * If so, perform the pullback and add the result to data->res. */ static isl_stat pa_pb_pma(void **entry, void *user) { struct isl_union_pw_aff_pullback_upma_data *data = user; isl_pw_multi_aff *pma = *entry; isl_pw_aff *pa; if (!isl_space_tuple_is_equal(data->pa->dim, isl_dim_in, pma->dim, isl_dim_out)) return isl_stat_ok; pma = isl_pw_multi_aff_copy(pma); pa = isl_pw_aff_copy(data->pa); pa = isl_pw_aff_pullback_pw_multi_aff(pa, pma); data->res = isl_union_pw_aff_add_pw_aff(data->res, pa); return data->res ? isl_stat_ok : isl_stat_error; } /* Check if any of the elements of data->upma can be plugged into pa, * add if so add the result to data->res. */ static isl_stat upa_pb_upma(void **entry, void *user) { struct isl_union_pw_aff_pullback_upma_data *data = user; isl_ctx *ctx; isl_pw_aff *pa = *entry; data->pa = pa; ctx = isl_union_pw_multi_aff_get_ctx(data->upma); if (isl_hash_table_foreach(ctx, &data->upma->table, &pa_pb_pma, data) < 0) return isl_stat_error; return isl_stat_ok; } /* Compute the pullback of "upa" by the function represented by "upma". * In other words, plug in "upma" in "upa". The result contains * expressions defined over the domain space of "upma". * * Run over all pairs of elements in "upa" and "upma", perform * the pullback when appropriate and collect the results. * If the hash value were based on the domain space rather than * the function space, then we could run through all elements * of "upma" and directly pick out the corresponding element of "upa". */ __isl_give isl_union_pw_aff *isl_union_pw_aff_pullback_union_pw_multi_aff( __isl_take isl_union_pw_aff *upa, __isl_take isl_union_pw_multi_aff *upma) { struct isl_union_pw_aff_pullback_upma_data data = { NULL, NULL }; isl_ctx *ctx; isl_space *space; space = isl_union_pw_multi_aff_get_space(upma); upa = isl_union_pw_aff_align_params(upa, space); space = isl_union_pw_aff_get_space(upa); upma = isl_union_pw_multi_aff_align_params(upma, space); if (!upa || !upma) goto error; ctx = isl_union_pw_aff_get_ctx(upa); data.upma = upma; space = isl_union_pw_aff_get_space(upa); data.res = isl_union_pw_aff_alloc(space, upa->table.n); if (isl_hash_table_foreach(ctx, &upa->table, &upa_pb_upma, &data) < 0) data.res = isl_union_pw_aff_free(data.res); isl_union_pw_aff_free(upa); isl_union_pw_multi_aff_free(upma); return data.res; error: isl_union_pw_aff_free(upa); isl_union_pw_multi_aff_free(upma); return NULL; } #undef BASE #define BASE union_pw_aff #undef DOMBASE #define DOMBASE union_set #define NO_MOVE_DIMS #define NO_DIMS #define NO_DOMAIN #define NO_PRODUCT #define NO_SPLICE #define NO_ZERO #define NO_IDENTITY #define NO_GIST #include #include #include #include #include #include /* Construct a multiple union piecewise affine expression * in the given space with value zero in each of the output dimensions. * * Since there is no canonical zero value for * a union piecewise affine expression, we can only construct * zero-dimensional "zero" value. */ __isl_give isl_multi_union_pw_aff *isl_multi_union_pw_aff_zero( __isl_take isl_space *space) { if (!space) return NULL; if (!isl_space_is_set(space)) isl_die(isl_space_get_ctx(space), isl_error_invalid, "expecting set space", goto error); if (isl_space_dim(space , isl_dim_out) != 0) isl_die(isl_space_get_ctx(space), isl_error_invalid, "expecting 0D space", goto error); return isl_multi_union_pw_aff_alloc(space); error: isl_space_free(space); return NULL; } /* Compute the sum of "mupa1" and "mupa2" on the union of their domains, * with the actual sum on the shared domain and * the defined expression on the symmetric difference of the domains. * * We simply iterate over the elements in both arguments and * call isl_union_pw_aff_union_add on each of them. */ static __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_union_add_aligned( __isl_take isl_multi_union_pw_aff *mupa1, __isl_take isl_multi_union_pw_aff *mupa2) { return isl_multi_union_pw_aff_bin_op(mupa1, mupa2, &isl_union_pw_aff_union_add); } /* Compute the sum of "mupa1" and "mupa2" on the union of their domains, * with the actual sum on the shared domain and * the defined expression on the symmetric difference of the domains. */ __isl_give isl_multi_union_pw_aff *isl_multi_union_pw_aff_union_add( __isl_take isl_multi_union_pw_aff *mupa1, __isl_take isl_multi_union_pw_aff *mupa2) { return isl_multi_union_pw_aff_align_params_multi_multi_and(mupa1, mupa2, &isl_multi_union_pw_aff_union_add_aligned); } /* Construct and return a multi union piecewise affine expression * that is equal to the given multi affine expression. */ __isl_give isl_multi_union_pw_aff *isl_multi_union_pw_aff_from_multi_aff( __isl_take isl_multi_aff *ma) { isl_multi_pw_aff *mpa; mpa = isl_multi_pw_aff_from_multi_aff(ma); return isl_multi_union_pw_aff_from_multi_pw_aff(mpa); } /* Construct and return a multi union piecewise affine expression * that is equal to the given multi piecewise affine expression. */ __isl_give isl_multi_union_pw_aff *isl_multi_union_pw_aff_from_multi_pw_aff( __isl_take isl_multi_pw_aff *mpa) { int i, n; isl_space *space; isl_multi_union_pw_aff *mupa; if (!mpa) return NULL; space = isl_multi_pw_aff_get_space(mpa); space = isl_space_range(space); mupa = isl_multi_union_pw_aff_alloc(space); n = isl_multi_pw_aff_dim(mpa, isl_dim_out); for (i = 0; i < n; ++i) { isl_pw_aff *pa; isl_union_pw_aff *upa; pa = isl_multi_pw_aff_get_pw_aff(mpa, i); upa = isl_union_pw_aff_from_pw_aff(pa); mupa = isl_multi_union_pw_aff_set_union_pw_aff(mupa, i, upa); } isl_multi_pw_aff_free(mpa); return mupa; } /* Extract the range space of "pma" and assign it to *space. * If *space has already been set (through a previous call to this function), * then check that the range space is the same. */ static isl_stat extract_space(__isl_take isl_pw_multi_aff *pma, void *user) { isl_space **space = user; isl_space *pma_space; isl_bool equal; pma_space = isl_space_range(isl_pw_multi_aff_get_space(pma)); isl_pw_multi_aff_free(pma); if (!pma_space) return isl_stat_error; if (!*space) { *space = pma_space; return isl_stat_ok; } equal = isl_space_is_equal(pma_space, *space); isl_space_free(pma_space); if (equal < 0) return isl_stat_error; if (!equal) isl_die(isl_space_get_ctx(*space), isl_error_invalid, "range spaces not the same", return isl_stat_error); return isl_stat_ok; } /* Construct and return a multi union piecewise affine expression * that is equal to the given union piecewise multi affine expression. * * In order to be able to perform the conversion, the input * needs to be non-empty and may only involve a single range space. */ __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_from_union_pw_multi_aff( __isl_take isl_union_pw_multi_aff *upma) { isl_space *space = NULL; isl_multi_union_pw_aff *mupa; int i, n; if (!upma) return NULL; if (isl_union_pw_multi_aff_n_pw_multi_aff(upma) == 0) isl_die(isl_union_pw_multi_aff_get_ctx(upma), isl_error_invalid, "cannot extract range space from empty input", goto error); if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma, &extract_space, &space) < 0) goto error; if (!space) goto error; n = isl_space_dim(space, isl_dim_set); mupa = isl_multi_union_pw_aff_alloc(space); for (i = 0; i < n; ++i) { isl_union_pw_aff *upa; upa = isl_union_pw_multi_aff_get_union_pw_aff(upma, i); mupa = isl_multi_union_pw_aff_set_union_pw_aff(mupa, i, upa); } isl_union_pw_multi_aff_free(upma); return mupa; error: isl_space_free(space); isl_union_pw_multi_aff_free(upma); return NULL; } /* Try and create an isl_multi_union_pw_aff that is equivalent * to the given isl_union_map. * The isl_union_map is required to be single-valued in each space. * Moreover, it cannot be empty and all range spaces need to be the same. * Otherwise, an error is produced. */ __isl_give isl_multi_union_pw_aff *isl_multi_union_pw_aff_from_union_map( __isl_take isl_union_map *umap) { isl_union_pw_multi_aff *upma; upma = isl_union_pw_multi_aff_from_union_map(umap); return isl_multi_union_pw_aff_from_union_pw_multi_aff(upma); } /* Return a multiple union piecewise affine expression * that is equal to "mv" on "domain", assuming "domain" and "mv" * have been aligned. */ static __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_multi_val_on_domain_aligned( __isl_take isl_union_set *domain, __isl_take isl_multi_val *mv) { int i, n; isl_space *space; isl_multi_union_pw_aff *mupa; if (!domain || !mv) goto error; n = isl_multi_val_dim(mv, isl_dim_set); space = isl_multi_val_get_space(mv); mupa = isl_multi_union_pw_aff_alloc(space); for (i = 0; i < n; ++i) { isl_val *v; isl_union_pw_aff *upa; v = isl_multi_val_get_val(mv, i); upa = isl_union_pw_aff_val_on_domain(isl_union_set_copy(domain), v); mupa = isl_multi_union_pw_aff_set_union_pw_aff(mupa, i, upa); } isl_union_set_free(domain); isl_multi_val_free(mv); return mupa; error: isl_union_set_free(domain); isl_multi_val_free(mv); return NULL; } /* Return a multiple union piecewise affine expression * that is equal to "mv" on "domain". */ __isl_give isl_multi_union_pw_aff *isl_multi_union_pw_aff_multi_val_on_domain( __isl_take isl_union_set *domain, __isl_take isl_multi_val *mv) { if (!domain || !mv) goto error; if (isl_space_match(domain->dim, isl_dim_param, mv->space, isl_dim_param)) return isl_multi_union_pw_aff_multi_val_on_domain_aligned( domain, mv); domain = isl_union_set_align_params(domain, isl_multi_val_get_space(mv)); mv = isl_multi_val_align_params(mv, isl_union_set_get_space(domain)); return isl_multi_union_pw_aff_multi_val_on_domain_aligned(domain, mv); error: isl_union_set_free(domain); isl_multi_val_free(mv); return NULL; } /* Return a multiple union piecewise affine expression * that is equal to "ma" on "domain", assuming "domain" and "ma" * have been aligned. */ static __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_multi_aff_on_domain_aligned( __isl_take isl_union_set *domain, __isl_take isl_multi_aff *ma) { int i, n; isl_space *space; isl_multi_union_pw_aff *mupa; if (!domain || !ma) goto error; n = isl_multi_aff_dim(ma, isl_dim_set); space = isl_multi_aff_get_space(ma); mupa = isl_multi_union_pw_aff_alloc(space); for (i = 0; i < n; ++i) { isl_aff *aff; isl_union_pw_aff *upa; aff = isl_multi_aff_get_aff(ma, i); upa = isl_union_pw_aff_aff_on_domain(isl_union_set_copy(domain), aff); mupa = isl_multi_union_pw_aff_set_union_pw_aff(mupa, i, upa); } isl_union_set_free(domain); isl_multi_aff_free(ma); return mupa; error: isl_union_set_free(domain); isl_multi_aff_free(ma); return NULL; } /* Return a multiple union piecewise affine expression * that is equal to "ma" on "domain". */ __isl_give isl_multi_union_pw_aff *isl_multi_union_pw_aff_multi_aff_on_domain( __isl_take isl_union_set *domain, __isl_take isl_multi_aff *ma) { if (!domain || !ma) goto error; if (isl_space_match(domain->dim, isl_dim_param, ma->space, isl_dim_param)) return isl_multi_union_pw_aff_multi_aff_on_domain_aligned( domain, ma); domain = isl_union_set_align_params(domain, isl_multi_aff_get_space(ma)); ma = isl_multi_aff_align_params(ma, isl_union_set_get_space(domain)); return isl_multi_union_pw_aff_multi_aff_on_domain_aligned(domain, ma); error: isl_union_set_free(domain); isl_multi_aff_free(ma); return NULL; } /* Return a union set containing those elements in the domains * of the elements of "mupa" where they are all zero. */ __isl_give isl_union_set *isl_multi_union_pw_aff_zero_union_set( __isl_take isl_multi_union_pw_aff *mupa) { int i, n; isl_union_pw_aff *upa; isl_union_set *zero; if (!mupa) return NULL; n = isl_multi_union_pw_aff_dim(mupa, isl_dim_set); if (n == 0) isl_die(isl_multi_union_pw_aff_get_ctx(mupa), isl_error_invalid, "cannot determine zero set " "of zero-dimensional function", goto error); upa = isl_multi_union_pw_aff_get_union_pw_aff(mupa, 0); zero = isl_union_pw_aff_zero_union_set(upa); for (i = 1; i < n; ++i) { isl_union_set *zero_i; upa = isl_multi_union_pw_aff_get_union_pw_aff(mupa, i); zero_i = isl_union_pw_aff_zero_union_set(upa); zero = isl_union_set_intersect(zero, zero_i); } isl_multi_union_pw_aff_free(mupa); return zero; error: isl_multi_union_pw_aff_free(mupa); return NULL; } /* Construct a union map mapping the shared domain * of the union piecewise affine expressions to the range of "mupa" * with each dimension in the range equated to the * corresponding union piecewise affine expression. * * The input cannot be zero-dimensional as there is * no way to extract a domain from a zero-dimensional isl_multi_union_pw_aff. */ __isl_give isl_union_map *isl_union_map_from_multi_union_pw_aff( __isl_take isl_multi_union_pw_aff *mupa) { int i, n; isl_space *space; isl_union_map *umap; isl_union_pw_aff *upa; if (!mupa) return NULL; n = isl_multi_union_pw_aff_dim(mupa, isl_dim_set); if (n == 0) isl_die(isl_multi_union_pw_aff_get_ctx(mupa), isl_error_invalid, "cannot determine domain of zero-dimensional " "isl_multi_union_pw_aff", goto error); upa = isl_multi_union_pw_aff_get_union_pw_aff(mupa, 0); umap = isl_union_map_from_union_pw_aff(upa); for (i = 1; i < n; ++i) { isl_union_map *umap_i; upa = isl_multi_union_pw_aff_get_union_pw_aff(mupa, i); umap_i = isl_union_map_from_union_pw_aff(upa); umap = isl_union_map_flat_range_product(umap, umap_i); } space = isl_multi_union_pw_aff_get_space(mupa); umap = isl_union_map_reset_range_space(umap, space); isl_multi_union_pw_aff_free(mupa); return umap; error: isl_multi_union_pw_aff_free(mupa); return NULL; } /* Internal data structure for isl_union_pw_multi_aff_reset_range_space. * "range" is the space from which to set the range space. * "res" collects the results. */ struct isl_union_pw_multi_aff_reset_range_space_data { isl_space *range; isl_union_pw_multi_aff *res; }; /* Replace the range space of "pma" by the range space of data->range and * add the result to data->res. */ static isl_stat reset_range_space(__isl_take isl_pw_multi_aff *pma, void *user) { struct isl_union_pw_multi_aff_reset_range_space_data *data = user; isl_space *space; space = isl_pw_multi_aff_get_space(pma); space = isl_space_domain(space); space = isl_space_extend_domain_with_range(space, isl_space_copy(data->range)); pma = isl_pw_multi_aff_reset_space(pma, space); data->res = isl_union_pw_multi_aff_add_pw_multi_aff(data->res, pma); return data->res ? isl_stat_ok : isl_stat_error; } /* Replace the range space of all the piecewise affine expressions in "upma" by * the range space of "space". * * This assumes that all these expressions have the same output dimension. * * Since the spaces of the expressions change, so do their hash values. * We therefore need to create a new isl_union_pw_multi_aff. * Note that the hash value is currently computed based on the entire * space even though there can only be a single expression with a given * domain space. */ static __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_reset_range_space( __isl_take isl_union_pw_multi_aff *upma, __isl_take isl_space *space) { struct isl_union_pw_multi_aff_reset_range_space_data data = { space }; isl_space *space_upma; space_upma = isl_union_pw_multi_aff_get_space(upma); data.res = isl_union_pw_multi_aff_empty(space_upma); if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma, &reset_range_space, &data) < 0) data.res = isl_union_pw_multi_aff_free(data.res); isl_space_free(space); isl_union_pw_multi_aff_free(upma); return data.res; } /* Construct and return a union piecewise multi affine expression * that is equal to the given multi union piecewise affine expression. * * In order to be able to perform the conversion, the input * needs to have a least one output dimension. */ __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_from_multi_union_pw_aff( __isl_take isl_multi_union_pw_aff *mupa) { int i, n; isl_space *space; isl_union_pw_multi_aff *upma; isl_union_pw_aff *upa; if (!mupa) return NULL; space = isl_multi_union_pw_aff_get_space(mupa); n = isl_multi_union_pw_aff_dim(mupa, isl_dim_set); if (n == 0) isl_die(isl_multi_union_pw_aff_get_ctx(mupa), isl_error_invalid, "cannot determine domain of zero-dimensional " "isl_multi_union_pw_aff", goto error); upa = isl_multi_union_pw_aff_get_union_pw_aff(mupa, 0); upma = isl_union_pw_multi_aff_from_union_pw_aff(upa); for (i = 1; i < n; ++i) { isl_union_pw_multi_aff *upma_i; upa = isl_multi_union_pw_aff_get_union_pw_aff(mupa, i); upma_i = isl_union_pw_multi_aff_from_union_pw_aff(upa); upma = isl_union_pw_multi_aff_flat_range_product(upma, upma_i); } upma = isl_union_pw_multi_aff_reset_range_space(upma, space); isl_multi_union_pw_aff_free(mupa); return upma; error: isl_multi_union_pw_aff_free(mupa); return NULL; } /* Intersect the range of "mupa" with "range". * That is, keep only those domain elements that have a function value * in "range". */ __isl_give isl_multi_union_pw_aff *isl_multi_union_pw_aff_intersect_range( __isl_take isl_multi_union_pw_aff *mupa, __isl_take isl_set *range) { isl_union_pw_multi_aff *upma; isl_union_set *domain; isl_space *space; int n; int match; if (!mupa || !range) goto error; space = isl_set_get_space(range); match = isl_space_tuple_is_equal(mupa->space, isl_dim_set, space, isl_dim_set); isl_space_free(space); if (match < 0) goto error; if (!match) isl_die(isl_multi_union_pw_aff_get_ctx(mupa), isl_error_invalid, "space don't match", goto error); n = isl_multi_union_pw_aff_dim(mupa, isl_dim_set); if (n == 0) isl_die(isl_multi_union_pw_aff_get_ctx(mupa), isl_error_invalid, "cannot intersect range of zero-dimensional " "isl_multi_union_pw_aff", goto error); upma = isl_union_pw_multi_aff_from_multi_union_pw_aff( isl_multi_union_pw_aff_copy(mupa)); domain = isl_union_set_from_set(range); domain = isl_union_set_preimage_union_pw_multi_aff(domain, upma); mupa = isl_multi_union_pw_aff_intersect_domain(mupa, domain); return mupa; error: isl_multi_union_pw_aff_free(mupa); isl_set_free(range); return NULL; } /* Return the shared domain of the elements of "mupa". */ __isl_give isl_union_set *isl_multi_union_pw_aff_domain( __isl_take isl_multi_union_pw_aff *mupa) { int i, n; isl_union_pw_aff *upa; isl_union_set *dom; if (!mupa) return NULL; n = isl_multi_union_pw_aff_dim(mupa, isl_dim_set); if (n == 0) isl_die(isl_multi_union_pw_aff_get_ctx(mupa), isl_error_invalid, "cannot determine domain", goto error); upa = isl_multi_union_pw_aff_get_union_pw_aff(mupa, 0); dom = isl_union_pw_aff_domain(upa); for (i = 1; i < n; ++i) { isl_union_set *dom_i; upa = isl_multi_union_pw_aff_get_union_pw_aff(mupa, i); dom_i = isl_union_pw_aff_domain(upa); dom = isl_union_set_intersect(dom, dom_i); } isl_multi_union_pw_aff_free(mupa); return dom; error: isl_multi_union_pw_aff_free(mupa); return NULL; } /* Apply "aff" to "mupa". The space of "mupa" is equal to the domain of "aff". * In particular, the spaces have been aligned. * The result is defined over the shared domain of the elements of "mupa" * * We first extract the parametric constant part of "aff" and * define that over the shared domain. * Then we iterate over all input dimensions of "aff" and add the corresponding * multiples of the elements of "mupa". * Finally, we consider the integer divisions, calling the function * recursively to obtain an isl_union_pw_aff corresponding to the * integer division argument. */ static __isl_give isl_union_pw_aff *multi_union_pw_aff_apply_aff( __isl_take isl_multi_union_pw_aff *mupa, __isl_take isl_aff *aff) { int i, n_in, n_div; isl_union_pw_aff *upa; isl_union_set *uset; isl_val *v; isl_aff *cst; n_in = isl_aff_dim(aff, isl_dim_in); n_div = isl_aff_dim(aff, isl_dim_div); uset = isl_multi_union_pw_aff_domain(isl_multi_union_pw_aff_copy(mupa)); cst = isl_aff_copy(aff); cst = isl_aff_drop_dims(cst, isl_dim_div, 0, n_div); cst = isl_aff_drop_dims(cst, isl_dim_in, 0, n_in); cst = isl_aff_project_domain_on_params(cst); upa = isl_union_pw_aff_aff_on_domain(uset, cst); for (i = 0; i < n_in; ++i) { isl_union_pw_aff *upa_i; if (!isl_aff_involves_dims(aff, isl_dim_in, i, 1)) continue; v = isl_aff_get_coefficient_val(aff, isl_dim_in, i); upa_i = isl_multi_union_pw_aff_get_union_pw_aff(mupa, i); upa_i = isl_union_pw_aff_scale_val(upa_i, v); upa = isl_union_pw_aff_add(upa, upa_i); } for (i = 0; i < n_div; ++i) { isl_aff *div; isl_union_pw_aff *upa_i; if (!isl_aff_involves_dims(aff, isl_dim_div, i, 1)) continue; div = isl_aff_get_div(aff, i); upa_i = multi_union_pw_aff_apply_aff( isl_multi_union_pw_aff_copy(mupa), div); upa_i = isl_union_pw_aff_floor(upa_i); v = isl_aff_get_coefficient_val(aff, isl_dim_div, i); upa_i = isl_union_pw_aff_scale_val(upa_i, v); upa = isl_union_pw_aff_add(upa, upa_i); } isl_multi_union_pw_aff_free(mupa); isl_aff_free(aff); return upa; } /* Apply "aff" to "mupa". The space of "mupa" needs to be compatible * with the domain of "aff". * Furthermore, the dimension of this space needs to be greater than zero. * The result is defined over the shared domain of the elements of "mupa" * * We perform these checks and then hand over control to * multi_union_pw_aff_apply_aff. */ __isl_give isl_union_pw_aff *isl_multi_union_pw_aff_apply_aff( __isl_take isl_multi_union_pw_aff *mupa, __isl_take isl_aff *aff) { isl_space *space1, *space2; int equal; mupa = isl_multi_union_pw_aff_align_params(mupa, isl_aff_get_space(aff)); aff = isl_aff_align_params(aff, isl_multi_union_pw_aff_get_space(mupa)); if (!mupa || !aff) goto error; space1 = isl_multi_union_pw_aff_get_space(mupa); space2 = isl_aff_get_domain_space(aff); equal = isl_space_is_equal(space1, space2); isl_space_free(space1); isl_space_free(space2); if (equal < 0) goto error; if (!equal) isl_die(isl_aff_get_ctx(aff), isl_error_invalid, "spaces don't match", goto error); if (isl_aff_dim(aff, isl_dim_in) == 0) isl_die(isl_aff_get_ctx(aff), isl_error_invalid, "cannot determine domains", goto error); return multi_union_pw_aff_apply_aff(mupa, aff); error: isl_multi_union_pw_aff_free(mupa); isl_aff_free(aff); return NULL; } /* Apply "ma" to "mupa". The space of "mupa" needs to be compatible * with the domain of "ma". * Furthermore, the dimension of this space needs to be greater than zero, * unless the dimension of the target space of "ma" is also zero. * The result is defined over the shared domain of the elements of "mupa" */ __isl_give isl_multi_union_pw_aff *isl_multi_union_pw_aff_apply_multi_aff( __isl_take isl_multi_union_pw_aff *mupa, __isl_take isl_multi_aff *ma) { isl_space *space1, *space2; isl_multi_union_pw_aff *res; int equal; int i, n_out; mupa = isl_multi_union_pw_aff_align_params(mupa, isl_multi_aff_get_space(ma)); ma = isl_multi_aff_align_params(ma, isl_multi_union_pw_aff_get_space(mupa)); if (!mupa || !ma) goto error; space1 = isl_multi_union_pw_aff_get_space(mupa); space2 = isl_multi_aff_get_domain_space(ma); equal = isl_space_is_equal(space1, space2); isl_space_free(space1); isl_space_free(space2); if (equal < 0) goto error; if (!equal) isl_die(isl_multi_aff_get_ctx(ma), isl_error_invalid, "spaces don't match", goto error); n_out = isl_multi_aff_dim(ma, isl_dim_out); if (isl_multi_aff_dim(ma, isl_dim_in) == 0 && n_out != 0) isl_die(isl_multi_aff_get_ctx(ma), isl_error_invalid, "cannot determine domains", goto error); space1 = isl_space_range(isl_multi_aff_get_space(ma)); res = isl_multi_union_pw_aff_alloc(space1); for (i = 0; i < n_out; ++i) { isl_aff *aff; isl_union_pw_aff *upa; aff = isl_multi_aff_get_aff(ma, i); upa = multi_union_pw_aff_apply_aff( isl_multi_union_pw_aff_copy(mupa), aff); res = isl_multi_union_pw_aff_set_union_pw_aff(res, i, upa); } isl_multi_aff_free(ma); isl_multi_union_pw_aff_free(mupa); return res; error: isl_multi_union_pw_aff_free(mupa); isl_multi_aff_free(ma); return NULL; } /* Apply "pa" to "mupa". The space of "mupa" needs to be compatible * with the domain of "pa". * Furthermore, the dimension of this space needs to be greater than zero. * The result is defined over the shared domain of the elements of "mupa" */ __isl_give isl_union_pw_aff *isl_multi_union_pw_aff_apply_pw_aff( __isl_take isl_multi_union_pw_aff *mupa, __isl_take isl_pw_aff *pa) { int i; int equal; isl_space *space, *space2; isl_union_pw_aff *upa; mupa = isl_multi_union_pw_aff_align_params(mupa, isl_pw_aff_get_space(pa)); pa = isl_pw_aff_align_params(pa, isl_multi_union_pw_aff_get_space(mupa)); if (!mupa || !pa) goto error; space = isl_multi_union_pw_aff_get_space(mupa); space2 = isl_pw_aff_get_domain_space(pa); equal = isl_space_is_equal(space, space2); isl_space_free(space); isl_space_free(space2); if (equal < 0) goto error; if (!equal) isl_die(isl_pw_aff_get_ctx(pa), isl_error_invalid, "spaces don't match", goto error); if (isl_pw_aff_dim(pa, isl_dim_in) == 0) isl_die(isl_pw_aff_get_ctx(pa), isl_error_invalid, "cannot determine domains", goto error); space = isl_space_params(isl_multi_union_pw_aff_get_space(mupa)); upa = isl_union_pw_aff_empty(space); for (i = 0; i < pa->n; ++i) { isl_aff *aff; isl_set *domain; isl_multi_union_pw_aff *mupa_i; isl_union_pw_aff *upa_i; mupa_i = isl_multi_union_pw_aff_copy(mupa); domain = isl_set_copy(pa->p[i].set); mupa_i = isl_multi_union_pw_aff_intersect_range(mupa_i, domain); aff = isl_aff_copy(pa->p[i].aff); upa_i = multi_union_pw_aff_apply_aff(mupa_i, aff); upa = isl_union_pw_aff_union_add(upa, upa_i); } isl_multi_union_pw_aff_free(mupa); isl_pw_aff_free(pa); return upa; error: isl_multi_union_pw_aff_free(mupa); isl_pw_aff_free(pa); return NULL; } /* Apply "pma" to "mupa". The space of "mupa" needs to be compatible * with the domain of "pma". * Furthermore, the dimension of this space needs to be greater than zero, * unless the dimension of the target space of "pma" is also zero. * The result is defined over the shared domain of the elements of "mupa" */ __isl_give isl_multi_union_pw_aff *isl_multi_union_pw_aff_apply_pw_multi_aff( __isl_take isl_multi_union_pw_aff *mupa, __isl_take isl_pw_multi_aff *pma) { isl_space *space1, *space2; isl_multi_union_pw_aff *res; int equal; int i, n_out; mupa = isl_multi_union_pw_aff_align_params(mupa, isl_pw_multi_aff_get_space(pma)); pma = isl_pw_multi_aff_align_params(pma, isl_multi_union_pw_aff_get_space(mupa)); if (!mupa || !pma) goto error; space1 = isl_multi_union_pw_aff_get_space(mupa); space2 = isl_pw_multi_aff_get_domain_space(pma); equal = isl_space_is_equal(space1, space2); isl_space_free(space1); isl_space_free(space2); if (equal < 0) goto error; if (!equal) isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid, "spaces don't match", goto error); n_out = isl_pw_multi_aff_dim(pma, isl_dim_out); if (isl_pw_multi_aff_dim(pma, isl_dim_in) == 0 && n_out != 0) isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid, "cannot determine domains", goto error); space1 = isl_space_range(isl_pw_multi_aff_get_space(pma)); res = isl_multi_union_pw_aff_alloc(space1); for (i = 0; i < n_out; ++i) { isl_pw_aff *pa; isl_union_pw_aff *upa; pa = isl_pw_multi_aff_get_pw_aff(pma, i); upa = isl_multi_union_pw_aff_apply_pw_aff( isl_multi_union_pw_aff_copy(mupa), pa); res = isl_multi_union_pw_aff_set_union_pw_aff(res, i, upa); } isl_pw_multi_aff_free(pma); isl_multi_union_pw_aff_free(mupa); return res; error: isl_multi_union_pw_aff_free(mupa); isl_pw_multi_aff_free(pma); return NULL; } /* Compute the pullback of "mupa" by the function represented by "upma". * In other words, plug in "upma" in "mupa". The result contains * expressions defined over the domain space of "upma". * * Run over all elements of "mupa" and plug in "upma" in each of them. */ __isl_give isl_multi_union_pw_aff * isl_multi_union_pw_aff_pullback_union_pw_multi_aff( __isl_take isl_multi_union_pw_aff *mupa, __isl_take isl_union_pw_multi_aff *upma) { int i, n; mupa = isl_multi_union_pw_aff_align_params(mupa, isl_union_pw_multi_aff_get_space(upma)); upma = isl_union_pw_multi_aff_align_params(upma, isl_multi_union_pw_aff_get_space(mupa)); if (!mupa || !upma) goto error; n = isl_multi_union_pw_aff_dim(mupa, isl_dim_set); for (i = 0; i < n; ++i) { isl_union_pw_aff *upa; upa = isl_multi_union_pw_aff_get_union_pw_aff(mupa, i); upa = isl_union_pw_aff_pullback_union_pw_multi_aff(upa, isl_union_pw_multi_aff_copy(upma)); mupa = isl_multi_union_pw_aff_set_union_pw_aff(mupa, i, upa); } isl_union_pw_multi_aff_free(upma); return mupa; error: isl_multi_union_pw_aff_free(mupa); isl_union_pw_multi_aff_free(upma); return NULL; } /* Extract the sequence of elements in "mupa" with domain space "space" * (ignoring parameters). * * For the elements of "mupa" that are not defined on the specified space, * the corresponding element in the result is empty. */ __isl_give isl_multi_pw_aff *isl_multi_union_pw_aff_extract_multi_pw_aff( __isl_keep isl_multi_union_pw_aff *mupa, __isl_take isl_space *space) { int i, n; isl_space *space_mpa = NULL; isl_multi_pw_aff *mpa; if (!mupa || !space) goto error; space_mpa = isl_multi_union_pw_aff_get_space(mupa); if (!isl_space_match(space_mpa, isl_dim_param, space, isl_dim_param)) { space = isl_space_drop_dims(space, isl_dim_param, 0, isl_space_dim(space, isl_dim_param)); space = isl_space_align_params(space, isl_space_copy(space_mpa)); if (!space) goto error; } space_mpa = isl_space_map_from_domain_and_range(isl_space_copy(space), space_mpa); mpa = isl_multi_pw_aff_alloc(space_mpa); space = isl_space_from_domain(space); space = isl_space_add_dims(space, isl_dim_out, 1); n = isl_multi_union_pw_aff_dim(mupa, isl_dim_set); for (i = 0; i < n; ++i) { isl_union_pw_aff *upa; isl_pw_aff *pa; upa = isl_multi_union_pw_aff_get_union_pw_aff(mupa, i); pa = isl_union_pw_aff_extract_pw_aff(upa, isl_space_copy(space)); mpa = isl_multi_pw_aff_set_pw_aff(mpa, i, pa); isl_union_pw_aff_free(upa); } isl_space_free(space); return mpa; error: isl_space_free(space_mpa); isl_space_free(space); return NULL; } cloog-0.18.4/isl/isl_farkas.c0000644000175000017500000002466412413271702012714 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. * * 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; } /* Return the rational universe basic set in the given space. */ static __isl_give isl_basic_set *rational_universe(__isl_take isl_space *space) { isl_basic_set *bset; bset = isl_basic_set_universe(space); bset = isl_basic_set_set_rational(bset); return bset; } /* 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. * * If "bset" is (obviously) empty, then the way this emptiness * is represented by the constraints does not allow for the application * of the standard farkas algorithm. We therefore handle this case * specifically and return the universe basic set. */ static __isl_give isl_basic_set *farkas(__isl_take isl_space *space, __isl_take isl_basic_set *bset, int shift) { int i, j, k; isl_basic_set *dual = NULL; unsigned total; if (isl_basic_set_plain_is_empty(bset)) { isl_basic_set_free(bset); return rational_universe(space); } total = isl_basic_set_total_dim(bset); dual = isl_basic_set_alloc_space(space, 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 *space = isl_set_get_space(set); space = isl_space_coefficients(space); isl_set_free(set); return rational_universe(space); } 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 *space = isl_set_get_space(set); space = isl_space_solutions(space); isl_set_free(set); return rational_universe(space); } 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.4/isl/isl_schedule.c0000644000175000017500000007763612554427055013262 00000000000000/* * Copyright 2011 INRIA Saclay * Copyright 2012-2014 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 /* Return a schedule encapsulating the given schedule tree. * * We currently only allow schedule trees with a domain or extension as root. * * The leaf field is initialized as a leaf node so that it can be * used to represent leaves in the constructed schedule. * The reference count is set to -1 since the isl_schedule_tree * should never be freed. It is up to the (internal) users of * these leaves to ensure that they are only used while the schedule * is still alive. */ __isl_give isl_schedule *isl_schedule_from_schedule_tree(isl_ctx *ctx, __isl_take isl_schedule_tree *tree) { enum isl_schedule_node_type type; isl_schedule *schedule; if (!tree) return NULL; type = isl_schedule_tree_get_type(tree); if (type != isl_schedule_node_domain && type != isl_schedule_node_extension) isl_die(isl_schedule_tree_get_ctx(tree), isl_error_unsupported, "root of schedule tree should be a domain or extension", goto error); schedule = isl_calloc_type(ctx, isl_schedule); if (!schedule) goto error; schedule->leaf.ctx = ctx; isl_ctx_ref(ctx); schedule->ref = 1; schedule->root = tree; schedule->leaf.ref = -1; schedule->leaf.type = isl_schedule_node_leaf; return schedule; error: isl_schedule_tree_free(tree); return NULL; } /* Return a pointer to a schedule with as single node * a domain node with the given domain. */ __isl_give isl_schedule *isl_schedule_from_domain( __isl_take isl_union_set *domain) { isl_ctx *ctx; isl_schedule_tree *tree; ctx = isl_union_set_get_ctx(domain); tree = isl_schedule_tree_from_domain(domain); return isl_schedule_from_schedule_tree(ctx, tree); } /* Return a pointer to a schedule with as single node * a domain node with an empty domain. */ __isl_give isl_schedule *isl_schedule_empty(__isl_take isl_space *space) { return isl_schedule_from_domain(isl_union_set_empty(space)); } /* Return a new reference to "sched". */ __isl_give isl_schedule *isl_schedule_copy(__isl_keep isl_schedule *sched) { if (!sched) return NULL; sched->ref++; return sched; } /* Return an isl_schedule that is equal to "schedule" and that has only * a single reference. * * We only need and support this function when the schedule is represented * as a schedule tree. */ __isl_give isl_schedule *isl_schedule_cow(__isl_take isl_schedule *schedule) { isl_ctx *ctx; isl_schedule_tree *tree; if (!schedule) return NULL; if (schedule->ref == 1) return schedule; ctx = isl_schedule_get_ctx(schedule); if (!schedule->root) isl_die(ctx, isl_error_internal, "only for schedule tree based schedules", return isl_schedule_free(schedule)); schedule->ref--; tree = isl_schedule_tree_copy(schedule->root); return isl_schedule_from_schedule_tree(ctx, tree); } __isl_null isl_schedule *isl_schedule_free(__isl_take isl_schedule *sched) { if (!sched) return NULL; if (--sched->ref > 0) return NULL; isl_band_list_free(sched->band_forest); isl_schedule_tree_free(sched->root); isl_ctx_deref(sched->leaf.ctx); free(sched); return NULL; } /* Replace the root of "schedule" by "tree". */ __isl_give isl_schedule *isl_schedule_set_root( __isl_take isl_schedule *schedule, __isl_take isl_schedule_tree *tree) { if (!schedule || !tree) goto error; if (schedule->root == tree) { isl_schedule_tree_free(tree); return schedule; } schedule = isl_schedule_cow(schedule); if (!schedule) goto error; isl_schedule_tree_free(schedule->root); schedule->root = tree; return schedule; error: isl_schedule_free(schedule); isl_schedule_tree_free(tree); return NULL; } isl_ctx *isl_schedule_get_ctx(__isl_keep isl_schedule *schedule) { return schedule ? schedule->leaf.ctx : NULL; } /* Return a pointer to the leaf of "schedule". * * Even though these leaves are not reference counted, we still * indicate that this function does not return a copy. */ __isl_keep isl_schedule_tree *isl_schedule_peek_leaf( __isl_keep isl_schedule *schedule) { return schedule ? &schedule->leaf : NULL; } /* Are "schedule1" and "schedule2" obviously equal to each other? */ isl_bool isl_schedule_plain_is_equal(__isl_keep isl_schedule *schedule1, __isl_keep isl_schedule *schedule2) { if (!schedule1 || !schedule2) return isl_bool_error; if (schedule1 == schedule2) return isl_bool_true; return isl_schedule_tree_plain_is_equal(schedule1->root, schedule2->root); } /* Return the (parameter) space of the schedule, i.e., the space * of the root domain. */ __isl_give isl_space *isl_schedule_get_space( __isl_keep isl_schedule *schedule) { enum isl_schedule_node_type type; isl_space *space; isl_union_set *domain; if (!schedule) return NULL; if (!schedule->root) isl_die(isl_schedule_get_ctx(schedule), isl_error_invalid, "schedule tree representation not available", return NULL); type = isl_schedule_tree_get_type(schedule->root); if (type != isl_schedule_node_domain) isl_die(isl_schedule_get_ctx(schedule), isl_error_internal, "root node not a domain node", return NULL); domain = isl_schedule_tree_domain_get_domain(schedule->root); space = isl_union_set_get_space(domain); isl_union_set_free(domain); return space; } /* Return a pointer to the root of "schedule". */ __isl_give isl_schedule_node *isl_schedule_get_root( __isl_keep isl_schedule *schedule) { isl_ctx *ctx; isl_schedule_tree *tree; isl_schedule_tree_list *ancestors; if (!schedule) return NULL; if (!schedule->root) isl_die(isl_schedule_get_ctx(schedule), isl_error_invalid, "schedule tree representation not available", return NULL); ctx = isl_schedule_get_ctx(schedule); tree = isl_schedule_tree_copy(schedule->root); schedule = isl_schedule_copy(schedule); ancestors = isl_schedule_tree_list_alloc(ctx, 0); return isl_schedule_node_alloc(schedule, tree, ancestors, NULL); } /* Set max_out to the maximal number of output dimensions over * all maps. */ static isl_stat 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 isl_stat_ok; } /* 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 isl_stat 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 isl_stat_error; return isl_stat_ok; } /* 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 the domain of the root domain node of "schedule". */ __isl_give isl_union_set *isl_schedule_get_domain( __isl_keep isl_schedule *schedule) { if (!schedule) return NULL; if (!schedule->root) isl_die(isl_schedule_get_ctx(schedule), isl_error_invalid, "schedule tree representation not available", return NULL); return isl_schedule_tree_domain_get_domain(schedule->root); } /* Traverse all nodes of "sched" in depth first preorder. * * If "fn" returns -1 on any of the nodes, then the traversal is aborted. * If "fn" returns 0 on any of the nodes, then the subtree rooted * at that node is skipped. * * Return 0 on success and -1 on failure. */ isl_stat isl_schedule_foreach_schedule_node_top_down( __isl_keep isl_schedule *sched, isl_bool (*fn)(__isl_keep isl_schedule_node *node, void *user), void *user) { isl_schedule_node *node; isl_stat r; if (!sched) return isl_stat_error; node = isl_schedule_get_root(sched); r = isl_schedule_node_foreach_descendant_top_down(node, fn, user); isl_schedule_node_free(node); return r; } /* Traverse the node of "sched" in depth first postorder, * allowing the user to modify the visited node. * The traversal continues from the node returned by the callback function. * It is the responsibility of the user to ensure that this does not * lead to an infinite loop. It is safest to always return a pointer * to the same position (same ancestors and child positions) as the input node. */ __isl_give isl_schedule *isl_schedule_map_schedule_node_bottom_up( __isl_take isl_schedule *schedule, __isl_give isl_schedule_node *(*fn)( __isl_take isl_schedule_node *node, void *user), void *user) { isl_schedule_node *node; node = isl_schedule_get_root(schedule); isl_schedule_free(schedule); node = isl_schedule_node_map_descendant_bottom_up(node, fn, user); schedule = isl_schedule_node_get_schedule(node); isl_schedule_node_free(node); return schedule; } /* Wrapper around isl_schedule_node_reset_user for use as * an isl_schedule_map_schedule_node_bottom_up callback. */ static __isl_give isl_schedule_node *reset_user( __isl_take isl_schedule_node *node, void *user) { return isl_schedule_node_reset_user(node); } /* Reset the user pointer on all identifiers of parameters and tuples * in the schedule "schedule". */ __isl_give isl_schedule *isl_schedule_reset_user( __isl_take isl_schedule *schedule) { return isl_schedule_map_schedule_node_bottom_up(schedule, &reset_user, NULL); } /* Wrapper around isl_schedule_node_align_params for use as * an isl_schedule_map_schedule_node_bottom_up callback. */ static __isl_give isl_schedule_node *align_params( __isl_take isl_schedule_node *node, void *user) { isl_space *space = user; return isl_schedule_node_align_params(node, isl_space_copy(space)); } /* Align the parameters of all nodes in schedule "schedule" * to those of "space". */ __isl_give isl_schedule *isl_schedule_align_params( __isl_take isl_schedule *schedule, __isl_take isl_space *space) { schedule = isl_schedule_map_schedule_node_bottom_up(schedule, &align_params, space); isl_space_free(space); return schedule; } /* Wrapper around isl_schedule_node_pullback_union_pw_multi_aff for use as * an isl_schedule_map_schedule_node_bottom_up callback. */ static __isl_give isl_schedule_node *pullback_upma( __isl_take isl_schedule_node *node, void *user) { isl_union_pw_multi_aff *upma = user; return isl_schedule_node_pullback_union_pw_multi_aff(node, isl_union_pw_multi_aff_copy(upma)); } /* Compute the pullback of "schedule" by the function represented by "upma". * In other words, plug in "upma" in the iteration domains of "schedule". * * The schedule tree is not allowed to contain any expansion nodes. */ __isl_give isl_schedule *isl_schedule_pullback_union_pw_multi_aff( __isl_take isl_schedule *schedule, __isl_take isl_union_pw_multi_aff *upma) { schedule = isl_schedule_map_schedule_node_bottom_up(schedule, &pullback_upma, upma); isl_union_pw_multi_aff_free(upma); return schedule; } /* Intersect the domain of the schedule "schedule" with "domain". * The root of "schedule" is required to be a domain node. */ __isl_give isl_schedule *isl_schedule_intersect_domain( __isl_take isl_schedule *schedule, __isl_take isl_union_set *domain) { enum isl_schedule_node_type root_type; isl_schedule_node *node; if (!schedule || !domain) goto error; root_type = isl_schedule_tree_get_type(schedule->root); if (root_type != isl_schedule_node_domain) isl_die(isl_schedule_get_ctx(schedule), isl_error_invalid, "root node must be a domain node", goto error); node = isl_schedule_get_root(schedule); isl_schedule_free(schedule); node = isl_schedule_node_domain_intersect_domain(node, domain); schedule = isl_schedule_node_get_schedule(node); isl_schedule_node_free(node); return schedule; error: isl_schedule_free(schedule); isl_union_set_free(domain); return NULL; } /* Return an isl_union_map representation of the schedule. * If we still have access to the schedule tree, then we return * an isl_union_map corresponding to the subtree schedule of the child * of the root domain node. That is, we do not intersect the domain * of the returned isl_union_map with the domain constraints. * Otherwise, we must have removed it because we created a band forest. * If so, we extract the isl_union_map from the forest. * 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) { enum isl_schedule_node_type type; isl_schedule_node *node; isl_union_map *umap; if (!sched) return NULL; if (sched->root) { type = isl_schedule_tree_get_type(sched->root); if (type != isl_schedule_node_domain) isl_die(isl_schedule_get_ctx(sched), isl_error_internal, "root node not a domain node", return NULL); node = isl_schedule_get_root(sched); node = isl_schedule_node_child(node, 0); umap = isl_schedule_node_get_subtree_schedule_union_map(node); isl_schedule_node_free(node); return umap; } umap = isl_band_list_get_suffix_schedule(sched->band_forest); return pad_schedule_map(umap); } static __isl_give isl_band_list *construct_band_list( __isl_take isl_schedule_node *node, __isl_take isl_union_set *domain, __isl_keep isl_band *parent); /* Construct an isl_band structure from the given schedule tree node, * which may be either a band node or a leaf node. * In the latter case, construct a zero-dimensional band. * "domain" is the universe set of the domain elements that reach "node". * "parent" is the parent isl_band of the isl_band constructed * by this function. * * In case of a band node, we copy the properties (except tilability, * which is implicit in an isl_band) to the isl_band. * We assume that the band node is not zero-dimensional. * If the child of the band node is not a leaf node, * then we extract the children of the isl_band from this child. */ static __isl_give isl_band *construct_band(__isl_take isl_schedule_node *node, __isl_take isl_union_set *domain, __isl_keep isl_band *parent) { int i; isl_ctx *ctx; isl_band *band = NULL; isl_multi_union_pw_aff *mupa; if (!node || !domain) goto error; ctx = isl_schedule_node_get_ctx(node); band = isl_band_alloc(ctx); if (!band) goto error; band->schedule = node->schedule; band->parent = parent; if (isl_schedule_node_get_type(node) == isl_schedule_node_leaf) { band->n = 0; band->pma = isl_union_pw_multi_aff_from_domain(domain); isl_schedule_node_free(node); return band; } band->n = isl_schedule_node_band_n_member(node); if (band->n == 0) isl_die(ctx, isl_error_unsupported, "zero-dimensional band nodes not supported", goto error); band->coincident = isl_alloc_array(ctx, int, band->n); if (band->n && !band->coincident) goto error; for (i = 0; i < band->n; ++i) band->coincident[i] = isl_schedule_node_band_member_get_coincident(node, i); mupa = isl_schedule_node_band_get_partial_schedule(node); band->pma = isl_union_pw_multi_aff_from_multi_union_pw_aff(mupa); if (!band->pma) goto error; node = isl_schedule_node_child(node, 0); if (isl_schedule_node_get_type(node) == isl_schedule_node_leaf) { isl_schedule_node_free(node); isl_union_set_free(domain); return band; } band->children = construct_band_list(node, domain, band); if (!band->children) return isl_band_free(band); return band; error: isl_union_set_free(domain); isl_schedule_node_free(node); isl_band_free(band); return NULL; } /* Construct a list of isl_band structures from the children of "node". * "node" itself is a sequence or set node, so that each of the child nodes * is a filter node and the list returned by node_construct_band_list * consists of a single element. * "domain" is the universe set of the domain elements that reach "node". * "parent" is the parent isl_band of the isl_band structures constructed * by this function. */ static __isl_give isl_band_list *construct_band_list_from_children( __isl_take isl_schedule_node *node, __isl_take isl_union_set *domain, __isl_keep isl_band *parent) { int i, n; isl_ctx *ctx; isl_band_list *list; n = isl_schedule_node_n_children(node); ctx = isl_schedule_node_get_ctx(node); list = isl_band_list_alloc(ctx, 0); for (i = 0; i < n; ++i) { isl_schedule_node *child; isl_band_list *list_i; child = isl_schedule_node_get_child(node, i); list_i = construct_band_list(child, isl_union_set_copy(domain), parent); list = isl_band_list_concat(list, list_i); } isl_union_set_free(domain); isl_schedule_node_free(node); return list; } /* Construct an isl_band structure from the given sequence node * (or set node that is treated as a sequence node). * A single-dimensional band is created with as schedule for each of * filters of the children, the corresponding child position. * "domain" is the universe set of the domain elements that reach "node". * "parent" is the parent isl_band of the isl_band constructed * by this function. */ static __isl_give isl_band_list *construct_band_list_sequence( __isl_take isl_schedule_node *node, __isl_take isl_union_set *domain, __isl_keep isl_band *parent) { int i, n; isl_ctx *ctx; isl_band *band = NULL; isl_space *space; isl_union_pw_multi_aff *upma; if (!node || !domain) goto error; ctx = isl_schedule_node_get_ctx(node); band = isl_band_alloc(ctx); if (!band) goto error; band->schedule = node->schedule; band->parent = parent; band->n = 1; band->coincident = isl_calloc_array(ctx, int, band->n); if (!band->coincident) goto error; n = isl_schedule_node_n_children(node); space = isl_union_set_get_space(domain); upma = isl_union_pw_multi_aff_empty(isl_space_copy(space)); space = isl_space_set_from_params(space); space = isl_space_add_dims(space, isl_dim_set, 1); for (i = 0; i < n; ++i) { isl_schedule_node *child; isl_union_set *filter; isl_val *v; isl_val_list *vl; isl_multi_val *mv; isl_union_pw_multi_aff *upma_i; child = isl_schedule_node_get_child(node, i); filter = isl_schedule_node_filter_get_filter(child); isl_schedule_node_free(child); filter = isl_union_set_intersect(filter, isl_union_set_copy(domain)); v = isl_val_int_from_si(ctx, i); vl = isl_val_list_from_val(v); mv = isl_multi_val_from_val_list(isl_space_copy(space), vl); upma_i = isl_union_pw_multi_aff_multi_val_on_domain(filter, mv); upma = isl_union_pw_multi_aff_union_add(upma, upma_i); } isl_space_free(space); band->pma = upma; if (!band->pma) goto error; band->children = construct_band_list_from_children(node, domain, band); if (!band->children) band = isl_band_free(band); return isl_band_list_from_band(band); error: isl_union_set_free(domain); isl_schedule_node_free(node); isl_band_free(band); return NULL; } /* Construct a list of isl_band structures from "node" depending * on the type of "node". * "domain" is the universe set of the domain elements that reach "node". * "parent" is the parent isl_band of the isl_band structures constructed * by this function. * * If schedule_separate_components is set then set nodes are treated * as sequence nodes. Otherwise, we directly extract an (implicitly * parallel) list of isl_band structures. * * If "node" is a filter, then "domain" is updated by the filter. */ static __isl_give isl_band_list *construct_band_list( __isl_take isl_schedule_node *node, __isl_take isl_union_set *domain, __isl_keep isl_band *parent) { enum isl_schedule_node_type type; isl_ctx *ctx; isl_band *band; isl_band_list *list; isl_union_set *filter; if (!node || !domain) goto error; type = isl_schedule_node_get_type(node); switch (type) { case isl_schedule_node_error: goto error; case isl_schedule_node_context: isl_die(isl_schedule_node_get_ctx(node), isl_error_unsupported, "context nodes not supported", goto error); case isl_schedule_node_domain: isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "internal domain nodes not allowed", goto error); case isl_schedule_node_expansion: isl_die(isl_schedule_node_get_ctx(node), isl_error_unsupported, "expansion nodes not supported", goto error); case isl_schedule_node_extension: isl_die(isl_schedule_node_get_ctx(node), isl_error_unsupported, "extension nodes not supported", goto error); case isl_schedule_node_filter: filter = isl_schedule_node_filter_get_filter(node); domain = isl_union_set_intersect(domain, filter); node = isl_schedule_node_child(node, 0); return construct_band_list(node, domain, parent); case isl_schedule_node_guard: isl_die(isl_schedule_node_get_ctx(node), isl_error_unsupported, "guard nodes not supported", goto error); case isl_schedule_node_mark: isl_die(isl_schedule_node_get_ctx(node), isl_error_unsupported, "mark nodes not supported", goto error); case isl_schedule_node_set: ctx = isl_schedule_node_get_ctx(node); if (isl_options_get_schedule_separate_components(ctx)) return construct_band_list_sequence(node, domain, parent); else return construct_band_list_from_children(node, domain, parent); case isl_schedule_node_sequence: return construct_band_list_sequence(node, domain, parent); case isl_schedule_node_leaf: case isl_schedule_node_band: band = construct_band(node, domain, parent); list = isl_band_list_from_band(band); break; } return list; error: isl_union_set_free(domain); isl_schedule_node_free(node); return NULL; } /* Return the roots of a band forest representation of the schedule. * The band forest is constructed from the schedule tree, * but once such a band forest is * constructed, we forget about the original schedule tree since * the user may modify the schedule through the band forest. */ __isl_give isl_band_list *isl_schedule_get_band_forest( __isl_keep isl_schedule *schedule) { isl_schedule_node *node; isl_union_set *domain; if (!schedule) return NULL; if (schedule->root) { node = isl_schedule_get_root(schedule); domain = isl_schedule_node_domain_get_domain(node); domain = isl_union_set_universe(domain); node = isl_schedule_node_child(node, 0); schedule->band_forest = construct_band_list(node, domain, NULL); schedule->root = isl_schedule_tree_free(schedule->root); } 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; } /* Insert a band node with partial schedule "partial" between the domain * root node of "schedule" and its single child. * Return a pointer to the updated schedule. * * If any of the nodes in the tree depend on the set of outer band nodes * then we refuse to insert the band node. */ __isl_give isl_schedule *isl_schedule_insert_partial_schedule( __isl_take isl_schedule *schedule, __isl_take isl_multi_union_pw_aff *partial) { isl_schedule_node *node; int anchored; node = isl_schedule_get_root(schedule); isl_schedule_free(schedule); if (!node) goto error; if (isl_schedule_node_get_type(node) != isl_schedule_node_domain) isl_die(isl_schedule_node_get_ctx(node), isl_error_internal, "root node not a domain node", goto error); node = isl_schedule_node_child(node, 0); anchored = isl_schedule_node_is_subtree_anchored(node); if (anchored < 0) goto error; if (anchored) isl_die(isl_schedule_node_get_ctx(node), isl_error_invalid, "cannot insert band node in anchored subtree", goto error); node = isl_schedule_node_insert_partial_schedule(node, partial); schedule = isl_schedule_node_get_schedule(node); isl_schedule_node_free(node); return schedule; error: isl_schedule_node_free(node); isl_multi_union_pw_aff_free(partial); return NULL; } /* Insert a context node with constraints "context" between the domain * root node of "schedule" and its single child. * Return a pointer to the updated schedule. */ __isl_give isl_schedule *isl_schedule_insert_context( __isl_take isl_schedule *schedule, __isl_take isl_set *context) { isl_schedule_node *node; node = isl_schedule_get_root(schedule); isl_schedule_free(schedule); node = isl_schedule_node_child(node, 0); node = isl_schedule_node_insert_context(node, context); schedule = isl_schedule_node_get_schedule(node); isl_schedule_node_free(node); return schedule; } /* Insert a guard node with constraints "guard" between the domain * root node of "schedule" and its single child. * Return a pointer to the updated schedule. */ __isl_give isl_schedule *isl_schedule_insert_guard( __isl_take isl_schedule *schedule, __isl_take isl_set *guard) { isl_schedule_node *node; node = isl_schedule_get_root(schedule); isl_schedule_free(schedule); node = isl_schedule_node_child(node, 0); node = isl_schedule_node_insert_guard(node, guard); schedule = isl_schedule_node_get_schedule(node); isl_schedule_node_free(node); return schedule; } /* Return a tree with as top-level node a filter corresponding to "filter" and * as child, the (single) child of "tree". * However, if this single child is of type "type", then the filter is inserted * in the children of this single child instead. */ static __isl_give isl_schedule_tree *insert_filter_in_child_of_type( __isl_take isl_schedule_tree *tree, __isl_take isl_union_set *filter, enum isl_schedule_node_type type) { if (!isl_schedule_tree_has_children(tree)) { isl_schedule_tree_free(tree); return isl_schedule_tree_from_filter(filter); } else { tree = isl_schedule_tree_child(tree, 0); } if (isl_schedule_tree_get_type(tree) == type) tree = isl_schedule_tree_children_insert_filter(tree, filter); else tree = isl_schedule_tree_insert_filter(tree, filter); return tree; } /* Construct a schedule that combines the schedules "schedule1" and "schedule2" * with a top-level node (underneath the domain node) of type "type", * either isl_schedule_node_sequence or isl_schedule_node_set. * The domains of the two schedules are assumed to be disjoint. * * The new schedule has as domain the union of the domains of the two * schedules. The child of the domain node is a node of type "type" * with two filters corresponding to the domains of the input schedules. * If one (or both) of the top-level nodes of the two schedules is itself * of type "type", then the filter is pushed into the children of that * node and the sequence of set is flattened. */ __isl_give isl_schedule *isl_schedule_pair(enum isl_schedule_node_type type, __isl_take isl_schedule *schedule1, __isl_take isl_schedule *schedule2) { int disjoint; isl_ctx *ctx; enum isl_schedule_node_type root_type; isl_schedule_tree *tree1, *tree2; isl_union_set *filter1, *filter2, *domain; if (!schedule1 || !schedule2) goto error; root_type = isl_schedule_tree_get_type(schedule1->root); if (root_type != isl_schedule_node_domain) isl_die(isl_schedule_get_ctx(schedule1), isl_error_internal, "root node not a domain node", goto error); root_type = isl_schedule_tree_get_type(schedule2->root); if (root_type != isl_schedule_node_domain) isl_die(isl_schedule_get_ctx(schedule1), isl_error_internal, "root node not a domain node", goto error); ctx = isl_schedule_get_ctx(schedule1); tree1 = isl_schedule_tree_copy(schedule1->root); filter1 = isl_schedule_tree_domain_get_domain(tree1); tree2 = isl_schedule_tree_copy(schedule2->root); filter2 = isl_schedule_tree_domain_get_domain(tree2); isl_schedule_free(schedule1); isl_schedule_free(schedule2); disjoint = isl_union_set_is_disjoint(filter1, filter2); if (disjoint < 0) filter1 = isl_union_set_free(filter1); if (!disjoint) isl_die(ctx, isl_error_invalid, "schedule domains not disjoint", filter1 = isl_union_set_free(filter1)); domain = isl_union_set_union(isl_union_set_copy(filter1), isl_union_set_copy(filter2)); filter1 = isl_union_set_gist(filter1, isl_union_set_copy(domain)); filter2 = isl_union_set_gist(filter2, isl_union_set_copy(domain)); tree1 = insert_filter_in_child_of_type(tree1, filter1, type); tree2 = insert_filter_in_child_of_type(tree2, filter2, type); tree1 = isl_schedule_tree_from_pair(type, tree1, tree2); tree1 = isl_schedule_tree_insert_domain(tree1, domain); return isl_schedule_from_schedule_tree(ctx, tree1); error: isl_schedule_free(schedule1); isl_schedule_free(schedule2); return NULL; } /* Construct a schedule that combines the schedules "schedule1" and "schedule2" * through a sequence node. * The domains of the input schedules are assumed to be disjoint. */ __isl_give isl_schedule *isl_schedule_sequence( __isl_take isl_schedule *schedule1, __isl_take isl_schedule *schedule2) { return isl_schedule_pair(isl_schedule_node_sequence, schedule1, schedule2); } /* Construct a schedule that combines the schedules "schedule1" and "schedule2" * through a set node. * The domains of the input schedules are assumed to be disjoint. */ __isl_give isl_schedule *isl_schedule_set( __isl_take isl_schedule *schedule1, __isl_take isl_schedule *schedule2) { return isl_schedule_pair(isl_schedule_node_set, schedule1, schedule2); } /* Print "schedule" to "p". * * If "schedule" was created from a schedule tree, then we print * the schedule tree representation. Otherwise, we print * the band forest representation. */ __isl_give isl_printer *isl_printer_print_schedule(__isl_take isl_printer *p, __isl_keep isl_schedule *schedule) { isl_band_list *forest; if (!schedule) return isl_printer_free(p); if (schedule->root) return isl_printer_print_schedule_tree(p, schedule->root); 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_set_yaml_style(printer, ISL_YAML_STYLE_BLOCK); printer = isl_printer_print_schedule(printer, schedule); isl_printer_free(printer); } cloog-0.18.4/isl/isl_transitive_closure.c0000644000175000017500000023012612554427055015373 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 #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); 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]; } 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); if (k < 0) goto error; path_c = path->eq[k]; } else { k = isl_basic_map_alloc_inequality(path); if (k < 0) goto error; path_c = path->ineq[k]; } 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; if (!map) goto error; 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 (!set1 || !set2) return -1; if (!isl_space_tuple_is_equal(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; int overlaps; 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); overlaps = isl_set_overlaps(domain, range); if (overlaps < 0 || !overlaps) { isl_set_free(domain); isl_set_free(range); isl_space_free(dim); if (overlaps < 0) map = NULL; 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 isl_bool 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; isl_bool subset; if (!isl_space_tuple_is_equal(data->list[i]->dim, isl_dim_in, data->list[j]->dim, isl_dim_out)) return isl_bool_false; 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 isl_bool_false; } if (!isl_space_tuple_is_equal(data->list[i]->dim, isl_dim_in, data->list[i]->dim, isl_dim_out) || !isl_space_tuple_is_equal(data->list[j]->dim, isl_dim_in, data->list[j]->dim, isl_dim_out)) { isl_map_free(map21); return isl_bool_true; } 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 ? isl_bool_error : !subset; error: isl_map_free(map21); return isl_bool_error; } /* 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; if (!map) return NULL; dim = isl_map_get_space(map); 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 isl_stat inc_count(__isl_take isl_map *map, void *user) { int *n = user; *n += map->n; isl_map_free(map); return isl_stat_ok; } static isl_stat 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 isl_stat_ok; error: isl_map_free(map); return isl_stat_error; } /* 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 isl_stat 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 isl_stat_error; } /* 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.4/isl/isl_version.c0000644000175000017500000000027412413271702013121 00000000000000#include "isl_config.h" #include "gitversion.h" const char *isl_version(void) { return GIT_HEAD_ID #ifdef USE_GMP_FOR_MP "-GMP" #endif #ifdef USE_IMATH_FOR_MP "-IMath" #endif "\n"; } cloog-0.18.4/isl/isl_schedule_read.c0000644000175000017500000004522312554427055014240 00000000000000#include #include #include #include #include /* An enumeration of the various keys that may appear in a YAML mapping * of a schedule. */ enum isl_schedule_key { isl_schedule_key_error = -1, isl_schedule_key_child, isl_schedule_key_coincident, isl_schedule_key_context, isl_schedule_key_contraction, isl_schedule_key_domain, isl_schedule_key_expansion, isl_schedule_key_extension, isl_schedule_key_filter, isl_schedule_key_guard, isl_schedule_key_leaf, isl_schedule_key_mark, isl_schedule_key_options, isl_schedule_key_permutable, isl_schedule_key_schedule, isl_schedule_key_sequence, isl_schedule_key_set }; /* Extract a mapping key from the token "tok". * Return isl_schedule_key_error on error, i.e., if "tok" does not * correspond to any known key. */ static enum isl_schedule_key extract_key(__isl_keep isl_stream *s, struct isl_token *tok) { int type; char *name; enum isl_schedule_key key; isl_ctx *ctx; ctx = isl_stream_get_ctx(s); type = isl_token_get_type(tok); if (type != ISL_TOKEN_IDENT && type != ISL_TOKEN_STRING) { isl_stream_error(s, tok, "expecting key"); return isl_schedule_key_error; } name = isl_token_get_str(ctx, tok); if (!strcmp(name, "child")) key = isl_schedule_key_child; else if (!strcmp(name, "coincident")) key = isl_schedule_key_coincident; else if (!strcmp(name, "context")) key = isl_schedule_key_context; else if (!strcmp(name, "contraction")) key = isl_schedule_key_contraction; else if (!strcmp(name, "domain")) key = isl_schedule_key_domain; else if (!strcmp(name, "expansion")) key = isl_schedule_key_expansion; else if (!strcmp(name, "extension")) key = isl_schedule_key_extension; else if (!strcmp(name, "filter")) key = isl_schedule_key_filter; else if (!strcmp(name, "guard")) key = isl_schedule_key_guard; else if (!strcmp(name, "leaf")) key = isl_schedule_key_leaf; else if (!strcmp(name, "mark")) key = isl_schedule_key_mark; else if (!strcmp(name, "options")) key = isl_schedule_key_options; else if (!strcmp(name, "schedule")) key = isl_schedule_key_schedule; else if (!strcmp(name, "sequence")) key = isl_schedule_key_sequence; else if (!strcmp(name, "set")) key = isl_schedule_key_set; else if (!strcmp(name, "permutable")) key = isl_schedule_key_permutable; else isl_die(ctx, isl_error_invalid, "unknown key", key = isl_schedule_key_error); free(name); return key; } /* Read a key from "s" and return the corresponding enum. * Return isl_schedule_key_error on error, i.e., if the first token * on the stream does not correspond to any known key. */ static enum isl_schedule_key get_key(__isl_keep isl_stream *s) { struct isl_token *tok; enum isl_schedule_key key; tok = isl_stream_next_token(s); key = extract_key(s, tok); isl_token_free(tok); return key; } static __isl_give isl_schedule_tree *isl_stream_read_schedule_tree( __isl_keep isl_stream *s); /* Read a subtree with context root node from "s". */ static __isl_give isl_schedule_tree *read_context(__isl_keep isl_stream *s) { isl_set *context = NULL; isl_schedule_tree *tree; isl_ctx *ctx; struct isl_token *tok; enum isl_schedule_key key; char *str; int more; ctx = isl_stream_get_ctx(s); key = get_key(s); if (isl_stream_yaml_next(s) < 0) return NULL; tok = isl_stream_next_token(s); if (!tok) { isl_stream_error(s, NULL, "unexpected EOF"); return NULL; } str = isl_token_get_str(ctx, tok); context = isl_set_read_from_str(ctx, str); free(str); isl_token_free(tok); more = isl_stream_yaml_next(s); if (more < 0) goto error; if (!more) { tree = isl_schedule_tree_from_context(context); } else { key = get_key(s); if (key != isl_schedule_key_child) isl_die(ctx, isl_error_invalid, "expecting child", goto error); if (isl_stream_yaml_next(s) < 0) goto error; tree = isl_stream_read_schedule_tree(s); tree = isl_schedule_tree_insert_context(tree, context); } return tree; error: isl_set_free(context); return NULL; } /* Read a subtree with domain root node from "s". */ static __isl_give isl_schedule_tree *read_domain(__isl_keep isl_stream *s) { isl_union_set *domain = NULL; isl_schedule_tree *tree; isl_ctx *ctx; struct isl_token *tok; enum isl_schedule_key key; char *str; int more; ctx = isl_stream_get_ctx(s); key = get_key(s); if (isl_stream_yaml_next(s) < 0) return NULL; tok = isl_stream_next_token(s); if (!tok) { isl_stream_error(s, NULL, "unexpected EOF"); return NULL; } str = isl_token_get_str(ctx, tok); domain = isl_union_set_read_from_str(ctx, str); free(str); isl_token_free(tok); more = isl_stream_yaml_next(s); if (more < 0) goto error; if (!more) { tree = isl_schedule_tree_from_domain(domain); } else { key = get_key(s); if (key != isl_schedule_key_child) isl_die(ctx, isl_error_invalid, "expecting child", goto error); if (isl_stream_yaml_next(s) < 0) goto error; tree = isl_stream_read_schedule_tree(s); tree = isl_schedule_tree_insert_domain(tree, domain); } return tree; error: isl_union_set_free(domain); return NULL; } /* Read a subtree with expansion root node from "s". */ static __isl_give isl_schedule_tree *read_expansion(isl_stream *s) { isl_ctx *ctx; isl_union_pw_multi_aff *contraction = NULL; isl_union_map *expansion = NULL; isl_schedule_tree *tree = NULL; int more; ctx = isl_stream_get_ctx(s); do { struct isl_token *tok; enum isl_schedule_key key; char *str; key = get_key(s); if (isl_stream_yaml_next(s) < 0) goto error; switch (key) { case isl_schedule_key_contraction: isl_union_pw_multi_aff_free(contraction); tok = isl_stream_next_token(s); str = isl_token_get_str(ctx, tok); contraction = isl_union_pw_multi_aff_read_from_str(ctx, str); free(str); isl_token_free(tok); if (!contraction) goto error; break; case isl_schedule_key_expansion: isl_union_map_free(expansion); tok = isl_stream_next_token(s); str = isl_token_get_str(ctx, tok); expansion = isl_union_map_read_from_str(ctx, str); free(str); isl_token_free(tok); if (!expansion) goto error; break; case isl_schedule_key_child: isl_schedule_tree_free(tree); tree = isl_stream_read_schedule_tree(s); if (!tree) goto error; break; default: isl_die(ctx, isl_error_invalid, "unexpected key", goto error); } } while ((more = isl_stream_yaml_next(s)) > 0); if (more < 0) goto error; if (!contraction) isl_die(ctx, isl_error_invalid, "missing contraction", goto error); if (!expansion) isl_die(ctx, isl_error_invalid, "missing expansion", goto error); if (!tree) return isl_schedule_tree_from_expansion(contraction, expansion); return isl_schedule_tree_insert_expansion(tree, contraction, expansion); error: isl_schedule_tree_free(tree); isl_union_pw_multi_aff_free(contraction); isl_union_map_free(expansion); return NULL; } /* Read a subtree with extension root node from "s". */ static __isl_give isl_schedule_tree *read_extension(isl_stream *s) { isl_union_map *extension = NULL; isl_schedule_tree *tree; isl_ctx *ctx; struct isl_token *tok; enum isl_schedule_key key; char *str; int more; ctx = isl_stream_get_ctx(s); key = get_key(s); if (isl_stream_yaml_next(s) < 0) return NULL; tok = isl_stream_next_token(s); if (!tok) { isl_stream_error(s, NULL, "unexpected EOF"); return NULL; } str = isl_token_get_str(ctx, tok); extension = isl_union_map_read_from_str(ctx, str); free(str); isl_token_free(tok); more = isl_stream_yaml_next(s); if (more < 0) goto error; if (!more) { tree = isl_schedule_tree_from_extension(extension); } else { key = get_key(s); if (key != isl_schedule_key_child) isl_die(ctx, isl_error_invalid, "expecting child", goto error); if (isl_stream_yaml_next(s) < 0) goto error; tree = isl_stream_read_schedule_tree(s); tree = isl_schedule_tree_insert_extension(tree, extension); } return tree; error: isl_union_map_free(extension); return NULL; } /* Read a subtree with filter root node from "s". */ static __isl_give isl_schedule_tree *read_filter(__isl_keep isl_stream *s) { isl_union_set *filter = NULL; isl_schedule_tree *tree; isl_ctx *ctx; struct isl_token *tok; enum isl_schedule_key key; char *str; int more; ctx = isl_stream_get_ctx(s); key = get_key(s); if (isl_stream_yaml_next(s) < 0) return NULL; tok = isl_stream_next_token(s); if (!tok) { isl_stream_error(s, NULL, "unexpected EOF"); return NULL; } str = isl_token_get_str(ctx, tok); filter = isl_union_set_read_from_str(ctx, str); free(str); isl_token_free(tok); more = isl_stream_yaml_next(s); if (more < 0) goto error; if (!more) { tree = isl_schedule_tree_from_filter(filter); } else { key = get_key(s); if (key != isl_schedule_key_child) isl_die(ctx, isl_error_invalid, "expecting child", goto error); if (isl_stream_yaml_next(s) < 0) goto error; tree = isl_stream_read_schedule_tree(s); tree = isl_schedule_tree_insert_filter(tree, filter); } return tree; error: isl_union_set_free(filter); return NULL; } /* Read a subtree with guard root node from "s". */ static __isl_give isl_schedule_tree *read_guard(isl_stream *s) { isl_set *guard = NULL; isl_schedule_tree *tree; isl_ctx *ctx; struct isl_token *tok; enum isl_schedule_key key; char *str; int more; ctx = isl_stream_get_ctx(s); key = get_key(s); if (isl_stream_yaml_next(s) < 0) return NULL; tok = isl_stream_next_token(s); if (!tok) { isl_stream_error(s, NULL, "unexpected EOF"); return NULL; } str = isl_token_get_str(ctx, tok); guard = isl_set_read_from_str(ctx, str); free(str); isl_token_free(tok); more = isl_stream_yaml_next(s); if (more < 0) goto error; if (!more) { tree = isl_schedule_tree_from_guard(guard); } else { key = get_key(s); if (key != isl_schedule_key_child) isl_die(ctx, isl_error_invalid, "expecting child", goto error); if (isl_stream_yaml_next(s) < 0) goto error; tree = isl_stream_read_schedule_tree(s); tree = isl_schedule_tree_insert_guard(tree, guard); } return tree; error: isl_set_free(guard); return NULL; } /* Read a subtree with mark root node from "s". */ static __isl_give isl_schedule_tree *read_mark(isl_stream *s) { isl_id *mark; isl_schedule_tree *tree; isl_ctx *ctx; struct isl_token *tok; enum isl_schedule_key key; char *str; int more; ctx = isl_stream_get_ctx(s); key = get_key(s); if (isl_stream_yaml_next(s) < 0) return NULL; tok = isl_stream_next_token(s); if (!tok) { isl_stream_error(s, NULL, "unexpected EOF"); return NULL; } str = isl_token_get_str(ctx, tok); mark = isl_id_alloc(ctx, str, NULL); free(str); isl_token_free(tok); more = isl_stream_yaml_next(s); if (more < 0) goto error; if (!more) { isl_die(ctx, isl_error_invalid, "expecting child", goto error); } else { key = get_key(s); if (key != isl_schedule_key_child) isl_die(ctx, isl_error_invalid, "expecting child", goto error); if (isl_stream_yaml_next(s) < 0) goto error; tree = isl_stream_read_schedule_tree(s); tree = isl_schedule_tree_insert_mark(tree, mark); } return tree; error: isl_id_free(mark); return NULL; } /* Read a sequence of integers from "s" (representing the coincident * property of a band node). */ static __isl_give isl_val_list *read_coincident(__isl_keep isl_stream *s) { isl_ctx *ctx; isl_val_list *list; int more; ctx = isl_stream_get_ctx(s); if (isl_stream_yaml_read_start_sequence(s) < 0) return NULL; list = isl_val_list_alloc(ctx, 0); while ((more = isl_stream_yaml_next(s)) > 0) { isl_val *val; val = isl_stream_read_val(s); list = isl_val_list_add(list, val); } if (more < 0 || isl_stream_yaml_read_end_sequence(s)) list = isl_val_list_free(list); return list; } /* Set the (initial) coincident properties of "band" according to * the (initial) elements of "coincident". */ static __isl_give isl_schedule_band *set_coincident( __isl_take isl_schedule_band *band, __isl_take isl_val_list *coincident) { int i; int n, m; n = isl_schedule_band_n_member(band); m = isl_val_list_n_val(coincident); for (i = 0; i < n && i < m; ++i) { isl_val *v; v = isl_val_list_get_val(coincident, i); if (!v) band = isl_schedule_band_free(band); band = isl_schedule_band_member_set_coincident(band, i, !isl_val_is_zero(v)); isl_val_free(v); } isl_val_list_free(coincident); return band; } /* Read a subtree with band root node from "s". */ static __isl_give isl_schedule_tree *read_band(isl_stream *s) { isl_multi_union_pw_aff *schedule = NULL; isl_schedule_tree *tree = NULL; isl_val_list *coincident = NULL; isl_union_set *options = NULL; isl_ctx *ctx; isl_schedule_band *band; int permutable = 0; int more; ctx = isl_stream_get_ctx(s); do { struct isl_token *tok; enum isl_schedule_key key; char *str; isl_val *v; key = get_key(s); if (isl_stream_yaml_next(s) < 0) goto error; switch (key) { case isl_schedule_key_schedule: isl_multi_union_pw_aff_free(schedule); tok = isl_stream_next_token(s); if (!tok) { isl_stream_error(s, NULL, "unexpected EOF"); goto error; } str = isl_token_get_str(ctx, tok); schedule = isl_multi_union_pw_aff_read_from_str(ctx, str); free(str); isl_token_free(tok); if (!schedule) goto error; break; case isl_schedule_key_coincident: coincident = read_coincident(s); if (!coincident) goto error; break; case isl_schedule_key_permutable: v = isl_stream_read_val(s); permutable = !isl_val_is_zero(v); isl_val_free(v); break; case isl_schedule_key_options: isl_union_set_free(options); tok = isl_stream_next_token(s); str = isl_token_get_str(ctx, tok); options = isl_union_set_read_from_str(ctx, str); free(str); isl_token_free(tok); if (!options) goto error; break; case isl_schedule_key_child: isl_schedule_tree_free(tree); tree = isl_stream_read_schedule_tree(s); if (!tree) goto error; break; default: isl_die(ctx, isl_error_invalid, "unexpected key", goto error); } } while ((more = isl_stream_yaml_next(s)) > 0); if (more < 0) goto error; if (!schedule) isl_die(ctx, isl_error_invalid, "missing schedule", goto error); band = isl_schedule_band_from_multi_union_pw_aff(schedule); band = isl_schedule_band_set_permutable(band, permutable); if (coincident) band = set_coincident(band, coincident); if (options) band = isl_schedule_band_set_ast_build_options(band, options); if (tree) tree = isl_schedule_tree_insert_band(tree, band); else tree = isl_schedule_tree_from_band(band); return tree; error: isl_val_list_free(coincident); isl_union_set_free(options); isl_schedule_tree_free(tree); isl_multi_union_pw_aff_free(schedule); return NULL; } /* Read a subtree with root node of type "type" from "s". * The node is represented by a sequence of children. */ static __isl_give isl_schedule_tree *read_children(isl_stream *s, enum isl_schedule_node_type type) { isl_ctx *ctx; isl_schedule_tree_list *list; int more; ctx = isl_stream_get_ctx(s); isl_token_free(isl_stream_next_token(s)); if (isl_stream_yaml_next(s) < 0) return NULL; if (isl_stream_yaml_read_start_sequence(s)) return NULL; list = isl_schedule_tree_list_alloc(ctx, 0); while ((more = isl_stream_yaml_next(s)) > 0) { isl_schedule_tree *tree; tree = isl_stream_read_schedule_tree(s); list = isl_schedule_tree_list_add(list, tree); } if (more < 0 || isl_stream_yaml_read_end_sequence(s)) list = isl_schedule_tree_list_free(list); return isl_schedule_tree_from_children(type, list); } /* Read a subtree with sequence root node from "s". */ static __isl_give isl_schedule_tree *read_sequence(isl_stream *s) { return read_children(s, isl_schedule_node_sequence); } /* Read a subtree with set root node from "s". */ static __isl_give isl_schedule_tree *read_set(isl_stream *s) { return read_children(s, isl_schedule_node_set); } /* Read a schedule (sub)tree from "s". * * We first determine the type of the root node based on the first * mapping key and then hand over to a function tailored to reading * nodes of this type. */ static __isl_give isl_schedule_tree *isl_stream_read_schedule_tree( struct isl_stream *s) { enum isl_schedule_key key; struct isl_token *tok; isl_schedule_tree *tree = NULL; int more; if (isl_stream_yaml_read_start_mapping(s)) return NULL; more = isl_stream_yaml_next(s); if (more < 0) return NULL; if (!more) { isl_stream_error(s, NULL, "missing key"); return NULL; } tok = isl_stream_next_token(s); key = extract_key(s, tok); isl_stream_push_token(s, tok); if (key < 0) return NULL; switch (key) { case isl_schedule_key_context: tree = read_context(s); break; case isl_schedule_key_domain: tree = read_domain(s); break; case isl_schedule_key_contraction: case isl_schedule_key_expansion: tree = read_expansion(s); break; case isl_schedule_key_extension: tree = read_extension(s); break; case isl_schedule_key_filter: tree = read_filter(s); break; case isl_schedule_key_guard: tree = read_guard(s); break; case isl_schedule_key_leaf: isl_token_free(isl_stream_next_token(s)); tree = isl_schedule_tree_leaf(isl_stream_get_ctx(s)); break; case isl_schedule_key_mark: tree = read_mark(s); break; case isl_schedule_key_sequence: tree = read_sequence(s); break; case isl_schedule_key_set: tree = read_set(s); break; case isl_schedule_key_schedule: case isl_schedule_key_coincident: case isl_schedule_key_options: case isl_schedule_key_permutable: tree = read_band(s); break; case isl_schedule_key_child: isl_die(isl_stream_get_ctx(s), isl_error_unsupported, "cannot identity node type", return NULL); case isl_schedule_key_error: return NULL; } if (isl_stream_yaml_read_end_mapping(s) < 0) { isl_stream_error(s, NULL, "unexpected extra elements"); return isl_schedule_tree_free(tree); } return tree; } /* Read an isl_schedule from "s". */ __isl_give isl_schedule *isl_stream_read_schedule(isl_stream *s) { isl_ctx *ctx; isl_schedule_tree *tree; if (!s) return NULL; ctx = isl_stream_get_ctx(s); tree = isl_stream_read_schedule_tree(s); return isl_schedule_from_schedule_tree(ctx, tree); } /* Read an isl_schedule from "input". */ __isl_give isl_schedule *isl_schedule_read_from_file(isl_ctx *ctx, FILE *input) { struct isl_stream *s; isl_schedule *schedule; s = isl_stream_new_file(ctx, input); if (!s) return NULL; schedule = isl_stream_read_schedule(s); isl_stream_free(s); return schedule; } /* Read an isl_schedule from "str". */ __isl_give isl_schedule *isl_schedule_read_from_str(isl_ctx *ctx, const char *str) { struct isl_stream *s; isl_schedule *schedule; s = isl_stream_new_str(ctx, str); if (!s) return NULL; schedule = isl_stream_read_schedule(s); isl_stream_free(s); return schedule; } cloog-0.18.4/isl/config.guess0000755000175000017500000013036112413256716012752 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.4/isl/isl_hmap_templ.c0000644000175000017500000002004412554427055013571 00000000000000/* * Copyright 2011 INRIA Saclay * Copyright 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 #define xCAT(A,B) A ## B #define CAT(A,B) xCAT(A,B) #define KEY CAT(isl_,KEY_BASE) #define VAL CAT(isl_,VAL_BASE) #define xFN(TYPE,NAME) TYPE ## _ ## NAME #define FN(TYPE,NAME) xFN(TYPE,NAME) #define xHMAP(KEY,VAL_BASE) KEY ## _to_ ## VAL_BASE #define yHMAP(KEY,VAL_BASE) xHMAP(KEY,VAL_BASE) #define HMAP yHMAP(KEY,VAL_BASE) #define HMAP_BASE yHMAP(KEY_BASE,VAL_BASE) #define xS(TYPE1,TYPE2,NAME) struct isl_ ## TYPE1 ## _ ## TYPE2 ## _ ## NAME #define yS(TYPE1,TYPE2,NAME) xS(TYPE1,TYPE2,NAME) #define S(NAME) yS(KEY_BASE,VAL_BASE,NAME) struct HMAP { int ref; isl_ctx *ctx; struct isl_hash_table table; }; S(pair) { KEY *key; VAL *val; }; __isl_give HMAP *FN(HMAP,alloc)(isl_ctx *ctx, int min_size) { HMAP *hmap; hmap = isl_calloc_type(ctx, HMAP); if (!hmap) return NULL; hmap->ctx = ctx; isl_ctx_ref(ctx); hmap->ref = 1; if (isl_hash_table_init(ctx, &hmap->table, min_size) < 0) return FN(HMAP,free)(hmap); return hmap; } static isl_stat free_pair(void **entry, void *user) { S(pair) *pair = *entry; FN(KEY,free)(pair->key); FN(VAL,free)(pair->val); free(pair); *entry = NULL; return isl_stat_ok; } __isl_null HMAP *FN(HMAP,free)(__isl_take HMAP *hmap) { if (!hmap) return NULL; if (--hmap->ref > 0) return NULL; isl_hash_table_foreach(hmap->ctx, &hmap->table, &free_pair, NULL); isl_hash_table_clear(&hmap->table); isl_ctx_deref(hmap->ctx); free(hmap); return NULL; } isl_ctx *FN(HMAP,get_ctx)(__isl_keep HMAP *hmap) { return hmap ? hmap->ctx : NULL; } /* Add a mapping from "key" to "val" to the associative array * pointed to by user. */ static isl_stat add_key_val(__isl_take KEY *key, __isl_take VAL *val, void *user) { HMAP **hmap = (HMAP **) user; *hmap = FN(HMAP,set)(*hmap, key, val); if (!*hmap) return isl_stat_error; return isl_stat_ok; } __isl_give HMAP *FN(HMAP,dup)(__isl_keep HMAP *hmap) { HMAP *dup; if (!hmap) return NULL; dup = FN(HMAP,alloc)(hmap->ctx, hmap->table.n); if (FN(HMAP,foreach)(hmap, &add_key_val, &dup) < 0) return FN(HMAP,free)(dup); return dup; } __isl_give HMAP *FN(HMAP,cow)(__isl_take HMAP *hmap) { if (!hmap) return NULL; if (hmap->ref == 1) return hmap; hmap->ref--; return FN(HMAP,dup)(hmap); } __isl_give HMAP *FN(HMAP,copy)(__isl_keep HMAP *hmap) { if (!hmap) return NULL; hmap->ref++; return hmap; } static int has_key(const void *entry, const void *c_key) { const S(pair) *pair = entry; KEY *key = (KEY *) c_key; return KEY_EQUAL(pair->key, key); } isl_bool FN(HMAP,has)(__isl_keep HMAP *hmap, __isl_keep KEY *key) { uint32_t hash; if (!hmap) return isl_bool_error; hash = FN(KEY,get_hash)(key); return !!isl_hash_table_find(hmap->ctx, &hmap->table, hash, &has_key, key, 0); } __isl_give VAL *FN(HMAP,get)(__isl_keep HMAP *hmap, __isl_take KEY *key) { struct isl_hash_table_entry *entry; S(pair) *pair; uint32_t hash; if (!hmap || !key) goto error; hash = FN(KEY,get_hash)(key); entry = isl_hash_table_find(hmap->ctx, &hmap->table, hash, &has_key, key, 0); FN(KEY,free)(key); if (!entry) return NULL; pair = entry->data; return FN(VAL,copy)(pair->val); error: FN(KEY,free)(key); return NULL; } /* Remove the mapping between "key" and its associated value (if any) * from "hmap". * * If "key" is not mapped to anything, then we leave "hmap" untouched" */ __isl_give HMAP *FN(HMAP,drop)(__isl_take HMAP *hmap, __isl_take KEY *key) { struct isl_hash_table_entry *entry; S(pair) *pair; uint32_t hash; if (!hmap || !key) goto error; hash = FN(KEY,get_hash)(key); entry = isl_hash_table_find(hmap->ctx, &hmap->table, hash, &has_key, key, 0); if (!entry) { FN(KEY,free)(key); return hmap; } hmap = FN(HMAP,cow)(hmap); if (!hmap) goto error; entry = isl_hash_table_find(hmap->ctx, &hmap->table, hash, &has_key, key, 0); FN(KEY,free)(key); if (!entry) isl_die(hmap->ctx, isl_error_internal, "missing entry" , goto error); pair = entry->data; isl_hash_table_remove(hmap->ctx, &hmap->table, entry); FN(KEY,free)(pair->key); FN(VAL,free)(pair->val); free(pair); return hmap; error: FN(KEY,free)(key); FN(HMAP,free)(hmap); return NULL; } /* Add a mapping from "key" to "val" to "hmap". * If "key" was already mapped to something else, then that mapping * is replaced. * If key happened to be mapped to "val" already, then we leave * "hmap" untouched. */ __isl_give HMAP *FN(HMAP,set)(__isl_take HMAP *hmap, __isl_take KEY *key, __isl_take VAL *val) { struct isl_hash_table_entry *entry; S(pair) *pair; uint32_t hash; if (!hmap || !key || !val) goto error; hash = FN(KEY,get_hash)(key); entry = isl_hash_table_find(hmap->ctx, &hmap->table, hash, &has_key, key, 0); if (entry) { int equal; pair = entry->data; equal = VAL_EQUAL(pair->val, val); if (equal < 0) goto error; if (equal) { FN(KEY,free)(key); FN(VAL,free)(val); return hmap; } } hmap = FN(HMAP,cow)(hmap); if (!hmap) goto error; entry = isl_hash_table_find(hmap->ctx, &hmap->table, hash, &has_key, key, 1); if (!entry) goto error; if (entry->data) { pair = entry->data; FN(VAL,free)(pair->val); pair->val = val; FN(KEY,free)(key); return hmap; } pair = isl_alloc_type(hmap->ctx, S(pair)); if (!pair) goto error; entry->data = pair; pair->key = key; pair->val = val; return hmap; error: FN(KEY,free)(key); FN(VAL,free)(val); return FN(HMAP,free)(hmap); } /* Internal data structure for isl_map_to_basic_set_foreach. * * fn is the function that should be called on each entry. * user is the user-specified final argument to fn. */ S(foreach_data) { isl_stat (*fn)(__isl_take KEY *key, __isl_take VAL *val, void *user); void *user; }; /* Call data->fn on a copy of the key and value in *entry. */ static isl_stat call_on_copy(void **entry, void *user) { S(pair) *pair = *entry; S(foreach_data) *data = (S(foreach_data) *) user; return data->fn(FN(KEY,copy)(pair->key), FN(VAL,copy)(pair->val), data->user); } /* Call "fn" on each pair of key and value in "hmap". */ isl_stat FN(HMAP,foreach)(__isl_keep HMAP *hmap, isl_stat (*fn)(__isl_take KEY *key, __isl_take VAL *val, void *user), void *user) { S(foreach_data) data = { fn, user }; if (!hmap) return isl_stat_error; return isl_hash_table_foreach(hmap->ctx, &hmap->table, &call_on_copy, &data); } /* Internal data structure for print_pair. * * p is the printer on which the associative array is being printed. * first is set if the current key-value pair is the first to be printed. */ S(print_data) { isl_printer *p; int first; }; /* Print the given key-value pair to data->p. */ static isl_stat print_pair(__isl_take KEY *key, __isl_take VAL *val, void *user) { S(print_data) *data = user; if (!data->first) data->p = isl_printer_print_str(data->p, ", "); data->p = FN(isl_printer_print,KEY_BASE)(data->p, key); data->p = isl_printer_print_str(data->p, ": "); data->p = FN(isl_printer_print,VAL_BASE)(data->p, val); data->first = 0; FN(KEY,free)(key); FN(VAL,free)(val); return isl_stat_ok; } /* Print the associative array to "p". */ __isl_give isl_printer *FN(isl_printer_print,HMAP_BASE)( __isl_take isl_printer *p, __isl_keep HMAP *hmap) { S(print_data) data; if (!p || !hmap) return isl_printer_free(p); p = isl_printer_print_str(p, "{"); data.p = p; data.first = 1; if (FN(HMAP,foreach)(hmap, &print_pair, &data) < 0) data.p = isl_printer_free(data.p); p = data.p; p = isl_printer_print_str(p, "}"); return p; } void FN(HMAP,dump)(__isl_keep HMAP *hmap) { isl_printer *printer; if (!hmap) return; printer = isl_printer_to_file(FN(HMAP,get_ctx)(hmap), stderr); printer = FN(isl_printer_print,HMAP_BASE)(printer, hmap); printer = isl_printer_end_line(printer); isl_printer_free(printer); } cloog-0.18.4/isl/config.sub0000755000175000017500000010535412413256716012421 00000000000000#! /bin/sh # Configuration validation subroutine script. # Copyright 1992-2013 Free Software Foundation, Inc. timestamp='2013-08-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"). # 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 \ | 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 | 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-* \ | 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.4/isl/README0000644000175000017500000000333512413271702011302 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 Whenever you report a bug, please mention the exact version of isl that you are using (output of "./isl_cat --version"). If you are unable to compile isl, then report the git version (output of "git describe") or the version included in the name of the tarball. 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.4/isl/isl_ast_build_private.h0000644000175000017500000003224412554427055015155 00000000000000#ifndef ISL_AST_BUILD_PRIVATE_H #define ISL_AST_BUILD_PRIVATE_H #include #include #include #include #include #include /* 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. * * "internal2input" maps the internal schedule domain to the original * input schedule domain. In case of a schedule tree input, the original * input schedule domain consist of the flat product of all outer * band node spaces, including the current band node. * It may be NULL if there no longer is such a uniform mapping * (because different iterations have been rescheduled differently). * * "options" contains the AST build options in case we are generating * an AST from a flat schedule map. When creating an AST from a schedule * tree, this field is ignored. * * 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. * * The "before_each_mark" callback is called before we handle the subtree * of an isl_schedule_node_mark node. * * The "after_each_mark" callback is called after we have handled the subtree * of an isl_schedule_node_mark node. * * "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. * * "node" points to the current band node in case we are generating * an AST from a schedule tree. It may be NULL if we are not generating * an AST from a schedule tree or if we are not inside a band node. * * "loop_type" originally constains loop AST generation types for * the "n" members of "node" and it is updated (along with "n") when * a schedule dimension is inserted. * It is NULL if "node" is NULL. * * "isolated" is the piece of the schedule domain isolated by the isolate * option on the current band. This set may be NULL if we have not checked * for the isolate option yet. */ 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_multi_aff *internal2input; 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_stat (*before_each_mark)(__isl_keep isl_id *mark, __isl_keep isl_ast_build *build, void *user); void *before_each_mark_user; __isl_give isl_ast_node *(*after_each_mark)( __isl_take isl_ast_node *node, __isl_keep isl_ast_build *context, void *user); void *after_each_mark_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_schedule_node *node; int n; enum isl_ast_loop_type *loop_type; isl_set *isolated; }; __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); unsigned isl_ast_build_dim(__isl_keep isl_ast_build *build, enum isl_dim_type type); __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_multi_aff *isl_ast_build_get_internal2input( __isl_keep isl_ast_build *build); __isl_give isl_set *isl_ast_build_get_domain( __isl_keep isl_ast_build *build); __isl_give isl_set *isl_ast_build_get_pending( __isl_keep isl_ast_build *build); __isl_give isl_set *isl_ast_build_get_generated( __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_replace_pending_by_guard( __isl_take isl_ast_build *build, __isl_take isl_set *guard); __isl_give isl_ast_build *isl_ast_build_restrict_pending( __isl_take isl_ast_build *build, __isl_take isl_set *set); __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); int isl_ast_build_has_schedule_node(__isl_keep isl_ast_build *build); __isl_give isl_schedule_node *isl_ast_build_get_schedule_node( __isl_keep isl_ast_build *build); __isl_give isl_ast_build *isl_ast_build_set_schedule_node( __isl_take isl_ast_build *build, __isl_take isl_schedule_node *node); __isl_give isl_ast_build *isl_ast_build_reset_schedule_node( __isl_take isl_ast_build *build); __isl_give isl_ast_build *isl_ast_build_extract_isolated( __isl_take isl_ast_build *build); int isl_ast_build_has_isolated(__isl_keep isl_ast_build *build); __isl_give isl_set *isl_ast_build_get_isolated( __isl_keep isl_ast_build *build); __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_specialize(__isl_keep isl_ast_build *build, __isl_take isl_set *set); __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_loop_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); enum isl_ast_loop_type isl_ast_build_get_loop_type( __isl_keep isl_ast_build *build, int isolated); __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.4/test/0000755000175000017500000000000012555417257010704 500000000000000cloog-0.18.4/test/checker.sh0000755000175000017500000001572012413255517012564 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_TYPE="$6" ## - "generate" to simply test code generation ## (default) ## - "regenerate" to replace the original file with ## the generated one in the case of a check fail ## !!! USE WITH CARE !!! ## - "valgrind" to test the valgrind output on ## code generation ## - "run" 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_TYPE" = "run" ]; 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; elif [ "$TEST_TYPE" = "valgrind" ]; then echo "generating... \c"; # valgrind --leak-check=full --error-exitcode=1 \ libtool --mode=execute valgrind --error-exitcode=1 \ $cloog $options -q $input > /dev/null 2> cloog_temp; errors=$?; leaks=`grep "in use at exit" cloog_temp | cut -f 2 -d ':'` if [ "$errors" = "1" ]; then echo -e "\033[31mMemory error detected... \033[0m"; cat cloog_temp; result="1"; elif [ "$leaks" != " 0 bytes in 0 blocks" ]; then echo -e "\033[31mMemory leak detected... \033[0m"; cat cloog_temp; result="1"; else result="0"; fi; rm -f cloog_temp; else echo "generating... \c"; $cloog $options -q $input > cloog_temp; diff -u -w --ignore-matching-lines='CLooG' $output cloog_temp; result=$?; if [ "$result" -ne "0" ] && [ "$TEST_TYPE" = "regenerate" ]; then echo -e "\033[31mREGENERATING... \033[0m"; cp cloog_temp $output; fi; rm -f cloog_temp; fi; if [ "$result" -ne "0" ]; then echo -e "\033[31mFAIL: $output has a problem\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.4/test/durbin_e_s.cloog0000644000175000017500000000257412413255517013762 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.4/test/basic-bounds-2.c0000644000175000017500000000017212413255517013470 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.4/test/walters2.c0000644000175000017500000000041312413255517012521 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.4/test/block2.good.c0000644000175000017500000000125312413255517013064 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.4/test/nul_basic1.c0000644000175000017500000000022312413255517012775 00000000000000/* Generated from ./nul_basic1.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.00s. */ if (M >= 0) { for (i=0;i<=M;i+=2) { S1(i,(i/2)); } } cloog-0.18.4/test/multi-stride2.cloog0000644000175000017500000000033412413255517014345 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.4/test/lineality-1-2.c0000644000175000017500000000036512413255517013253 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.4/test/forwardsub-1-1-2.cloog0000644000175000017500000000130612413255517014452 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.4/test/vivien.c0000644000175000017500000000764012413255517012267 00000000000000/* Generated from ./vivien.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.07s. */ 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.4/test/nul_basic2.c0000644000175000017500000000024412413255517013001 00000000000000/* Generated from ./nul_basic2.cloog by CLooG 0.18.1-2-g43fc508 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.4/test/square+triangle-1-1-2-3.good.c0000644000175000017500000000147712413255517015614 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.4/test/gauss.cloog0000644000175000017500000000170712413255517012770 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.4/test/dot.good.c0000644000175000017500000000120012413255517012466 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.4/test/otl.good.c0000644000175000017500000001025312413255517012506 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.4/test/basic-bounds-4.good.c0000644000175000017500000000077512413255517014432 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.4/test/gesced.cloog0000644000175000017500000000123112413255517013070 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.4/test/tiling.good.c0000644000175000017500000000111612413255517013174 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.4/test/classen.c0000644000175000017500000000644712413255517012423 00000000000000/* Generated from ./classen.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.25s. */ 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.4/test/lux.c0000644000175000017500000000065012413255517011571 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.4/test/classen.good.c0000644000175000017500000002654712413255517013355 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.4/test/forwardsub-3-1-2.c0000644000175000017500000000060412413255517013573 00000000000000/* Generated from ./forwardsub-3-1-2.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.00s. */ 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.4/test/levenshtein-1-2-3f.f0000644000175000017500000000116612413255517014116 00000000000000! Generated from ./levenshtein-1-2-3f.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.00s. 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.4/test/basic-bounds-4.cloog0000644000175000017500000000025012413255517014350 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.4/test/iftest2.cloog0000644000175000017500000000112212413255517013215 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.4/test/rectangle.good.c0000644000175000017500000000117212413255517013654 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.4/test/equality2.cloog0000644000175000017500000000514612413255517013566 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.4/test/guide.cloog0000644000175000017500000000136712413255517012745 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.4/test/classen2.c0000644000175000017500000000410512413255517012472 00000000000000/* Generated from ./classen2.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.08s. */ 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.4/test/basic-bounds-2.good.c0000644000175000017500000000073112413255517014420 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.4/test/mod4.c0000644000175000017500000000034412413255517011624 00000000000000/* Generated from ./mod4.cloog by CLooG 0.18.1-2-g43fc508 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.4/test/dot2.cloog0000644000175000017500000000045612413255517012516 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.4/test/constbound.c0000644000175000017500000000052012413255517013133 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.4/test/wavefront.good.c0000644000175000017500000000127312413255517013725 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.4/test/vivien2.cloog0000644000175000017500000000573312413255517013233 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.4/test/donotsimp.cloog0000644000175000017500000000167412413255517013665 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.4/test/dartef.f0000644000175000017500000000316312413255517012233 00000000000000! Generated from ./dartef.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.03s. 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.4/test/logopar.c0000644000175000017500000000056712413255517012433 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.4/test/min-1-1.good.c0000644000175000017500000000113312413255517012764 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.4/test/singleton.good.c0000644000175000017500000000071112413255517013710 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.4/test/basic-bounds-6.good.c0000644000175000017500000000073212413255517014425 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.4/test/block3.good.c0000644000175000017500000000110412413255517013060 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.4/test/1point-1.cloog0000644000175000017500000000030712413255517013211 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.4/test/yosr.cloog0000644000175000017500000000155012413255517012636 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.4/test/min-2-1.cloog0000644000175000017500000000065212413255517012724 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.4/test/esced.cloog0000644000175000017500000000045112413255517012724 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.4/test/equality2.c0000644000175000017500000000076112413255517012703 00000000000000/* Generated from ./equality2.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.01s. */ 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.4/test/dot.c0000644000175000017500000000031212413255517011542 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.4/test/backtrack.good.c0000644000175000017500000000077412413255517013644 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.4/test/check_strided.sh0000755000175000017500000000511712413255517013752 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" "${1:-generate}" cloog-0.18.4/test/rectangle.cloog0000644000175000017500000000046012413255517013605 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.4/test/block3.c0000644000175000017500000000020212413255517012127 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.4/test/lub.good.c0000644000175000017500000000145012413255517012471 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.4/test/4-param.c0000644000175000017500000000053212413255517012221 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.4/test/basic-bounds-3.c0000644000175000017500000000022312413255517013466 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.4/test/0D-1.cloog0000644000175000017500000000003612413255517012241 00000000000000c 0 2 0 1 1 0 2 0 0 0 0 0 cloog-0.18.4/test/min-4-1.good.c0000644000175000017500000000102212413255517012764 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.4/test/iftest.good.c0000644000175000017500000000110712413255517013204 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.4/test/classen2.good.c0000644000175000017500000000550712413255517013430 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.4/test/rectangle.c0000644000175000017500000000026012413255517012722 00000000000000/* Generated from ./rectangle.cloog by CLooG 0.18.1-2-g43fc508 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.4/test/christian.good.c0000644000175000017500000000151312413255517013673 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.4/test/gesced.c0000644000175000017500000000056312413255517012216 00000000000000/* Generated from ./gesced.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.00s. */ 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.4/test/basic-bounds-5.c0000644000175000017500000000022012413255517013465 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.4/test/thomasset.cloog0000644000175000017500000000161112413255517013647 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.4/test/gauss.c0000644000175000017500000000060612413255517012104 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.4/test/stride2.good.c0000644000175000017500000000115112413255517013261 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.4/test/vivien2.good.c0000644000175000017500000003447512413255517013306 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.4/test/test.c0000644000175000017500000000055512413255517011744 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.4/test/stride.cloog0000644000175000017500000000021712413255517013133 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.4/test/0D-2.cloog0000644000175000017500000000004412413255517012241 00000000000000c 0 3 0 1 1 1 3 1 1 0 0 0 0 0 0 cloog-0.18.4/test/square+triangle-1-1-2-3.cloog0000644000175000017500000000055012413255517015535 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.4/test/min-4-1.cloog0000644000175000017500000000041612413255517012724 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.4/test/constant.c0000644000175000017500000000054012413255517012610 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.4/test/lux.good.c0000644000175000017500000000165712413255517012530 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.4/test/4-param.cloog0000644000175000017500000000052712413255517013106 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.4/test/lu.good.c0000644000175000017500000000174512413255517012336 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.4/test/double.cloog0000644000175000017500000000145112413255517013114 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.4/test/donotsimp.good.c0000644000175000017500000000130112413255517013716 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.4/test/lub.c0000644000175000017500000000044212413255517011542 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.4/test/equality.cloog0000644000175000017500000000054412413255517013501 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.4/test/lux.cloog0000644000175000017500000000104112413255517012445 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.4/test/pouchet.cloog0000644000175000017500000000441312413255517013312 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.4/test/lineality-2-1-2.c0000644000175000017500000000045412413255517013411 00000000000000/* Generated from ./lineality-2-1-2.cloog by CLooG 0.18.1-2-g43fc508 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.4/test/vivien2.c0000644000175000017500000000627312413255517012352 00000000000000/* Generated from ./vivien2.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.08s. */ 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.4/test/dot2.c0000644000175000017500000000043612413255517011633 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.4/test/tiling.c0000644000175000017500000000031212413255517012242 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.4/test/basic-bounds-1.c0000644000175000017500000000022312413255517013464 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.4/test/block3.cloog0000644000175000017500000000016012413255517013013 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.4/test/0D-3.good.c0000644000175000017500000000064512413255517012317 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.4/test/check_special.sh0000755000175000017500000000571412413255517013737 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" "${1:-generate}" cloog-0.18.4/test/ex1.good.c0000644000175000017500000000142412413255517012405 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.4/test/lex.good.c0000644000175000017500000000111312413255517012473 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.4/test/min-3-1.c0000644000175000017500000000027312413255517012043 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.4/test/test.cloog0000644000175000017500000000056612413255517012627 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.4/test/singleton.c0000644000175000017500000000017412413255517012764 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.4/test/wavefront.cloog0000644000175000017500000000042012413255517013650 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.4/test/logo.c0000644000175000017500000000055612413255517011726 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.4/test/constbound.cloog0000644000175000017500000000105312413255517014016 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.4/test/equality.good.c0000644000175000017500000000132112413255517013541 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.4/test/basic-bounds-5.good.c0000644000175000017500000000100412413255517014415 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.4/test/iftest.c0000644000175000017500000000024012413255517012252 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.4/test/iftest2.c0000644000175000017500000000032212413255517012335 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.4/test/equality.c0000644000175000017500000000043112413255517012613 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.4/test/0D-2.c0000644000175000017500000000020112413255517011353 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.4/test/yosr2.c0000644000175000017500000000066112413255517012041 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.4/test/walters.good.c0000644000175000017500000000261212413255517013371 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.4/test/min-1-1.cloog0000644000175000017500000000052112413255517012716 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.4/test/wavefront.c0000644000175000017500000000033712413255517012776 00000000000000/* Generated from ./wavefront.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.00s. */ 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.4/test/Makefile.am0000644000175000017500000002234012554423530012647 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/loops \ openscop/union \ openscop/coordinates \ openscop/clay 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 valcheck: test_valgrind 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 test_valgrind: $(TESTS_ENVIRONMENT) $(srcdir)/check_c.sh valgrind ; \ $(TESTS_ENVIRONMENT) $(srcdir)/check_fortran.sh valgrind ; \ $(TESTS_ENVIRONMENT) $(srcdir)/check_strided.sh valgrind ; \ $(TESTS_ENVIRONMENT) $(srcdir)/check_openscop.sh valgrind ; \ $(TESTS_ENVIRONMENT) $(srcdir)/check_special.sh valgrind test_regenerate: $(TESTS_ENVIRONMENT) $(srcdir)/check_c.sh regenerate ; \ $(TESTS_ENVIRONMENT) $(srcdir)/check_fortran.sh regenerate ; \ $(TESTS_ENVIRONMENT) $(srcdir)/check_strided.sh regenerate ; \ $(TESTS_ENVIRONMENT) $(srcdir)/check_openscop.sh regenerate ; \ $(TESTS_ENVIRONMENT) $(srcdir)/check_special.sh regenerate 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) \ openscop/clay_orig.c \ openscop/coordinates_orig.c cloog-0.18.4/test/uday_scalars.good.c0000644000175000017500000000125612413255517014365 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.4/test/lineality-2-1-2.cloog0000644000175000017500000000055612413255517014275 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.4/test/stride.good.c0000644000175000017500000000120412413255517013176 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.4/test/logo.good.c0000644000175000017500000000161212413255517012647 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.4/test/lineality-1-2.cloog0000644000175000017500000000064012413255517014130 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.4/test/gesced3.cloog0000644000175000017500000000061112413255517013154 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.4/test/param-split.c0000644000175000017500000000031012413255517013203 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.4/test/multi-mm-1.cloog0000644000175000017500000000055612413255517013546 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.4/test/darte.c0000644000175000017500000000311412413255517012056 00000000000000/* Generated from ./darte.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.02s. */ 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.4/test/thomasset.c0000644000175000017500000000201412413255517012764 00000000000000/* Generated from ./thomasset.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.02s. */ 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.4/test/0D-2.good.c0000644000175000017500000000067312413255517012317 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.4/test/christian.c0000644000175000017500000000053412413255517012746 00000000000000/* Generated from ./christian.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.00s. */ 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.4/test/lineality-1-2.good.c0000644000175000017500000000145712413255517014205 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.4/test/nul_basic1.cloog0000644000175000017500000000042112413255517013656 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.4/test/min-4-1.c0000644000175000017500000000033312413255517012041 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.4/test/double.good.c0000644000175000017500000000131212413255517013156 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.4/test/dot.cloog0000644000175000017500000000061412413255517012430 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.4/test/0D-3.c0000644000175000017500000000015712413255517011366 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.4/test/darte.good.c0000644000175000017500000002540112413255517013010 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.4/test/yosr.good.c0000644000175000017500000000165512413255517012712 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.4/test/check_fortran.sh0000755000175000017500000000510512413255517013764 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" "${1:-generate}" cloog-0.18.4/test/cholesky.cloog0000644000175000017500000000420012413255517013456 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.4/test/sor1d.c0000644000175000017500000000163512413255517012015 00000000000000/* Generated from ./sor1d.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.13s. */ 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.4/test/block.c0000644000175000017500000000020612413255517012050 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.4/test/gesced.good.c0000644000175000017500000000175012413255517013144 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.4/test/param-split.good.c0000644000175000017500000000114612413255517014142 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.4/test/vasilache.cloog0000644000175000017500000002607512413255517013612 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.4/test/stride3.c0000644000175000017500000000026012413255517012333 00000000000000/* Generated from ./stride3.cloog by CLooG 0.18.1-2-g43fc508 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.4/test/multi-mm-1.c0000644000175000017500000000035612413255517012663 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.4/test/lu.cloog0000644000175000017500000000110212413255517012253 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.4/test/cholesky2.good.c0000644000175000017500000000446212413255517013620 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.4/test/merge.c0000644000175000017500000000026612413255517012063 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.4/test/min-2-1.c0000644000175000017500000000043412413255517012041 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.4/test/vivien.cloog0000644000175000017500000000573112413255517013147 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.4/test/infinite3.cloog0000644000175000017500000000052112413255517013527 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.4/test/iftestf.f0000644000175000017500000000023612413255517012430 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.4/test/param-split.cloog0000644000175000017500000000011012413255517014062 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.4/test/basic-bounds-4.c0000644000175000017500000000022512413255517013471 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.4/test/gauss.good.c0000644000175000017500000000157012413255517013034 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.4/test/lineality-2-1-2.good.c0000644000175000017500000000163612413255517014343 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.4/test/1point-1.c0000644000175000017500000000017012413255517012326 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.4/test/1point-2.c0000644000175000017500000000014312413255517012327 00000000000000/* Generated from ./1point-2.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.00s. */ S1(2*M,(N+2)); cloog-0.18.4/test/otl.cloog0000644000175000017500000000530012413255517012435 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.4/test/nul_lcpc.c0000644000175000017500000000046312413255517012562 00000000000000/* Generated from ./nul_lcpc.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.00s. */ 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.4/test/largeur.cloog0000644000175000017500000000043512413255517013304 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.4/test/byu98-1-2-3.good.c0000644000175000017500000000153412413255517013327 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.4/test/yosr2.cloog0000644000175000017500000000136112413255517012720 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.4/test/gesced3.c0000644000175000017500000000035712413255517012302 00000000000000/* Generated from ./gesced3.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.00s. */ 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.4/test/forwardsub-3-1-2.good.c0000644000175000017500000000172712413255517014531 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.4/test/yosr.c0000644000175000017500000000065612413255517011763 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.4/test/vasilache.c0000644000175000017500000000111212413255517012712 00000000000000/* Generated from ./vasilache.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.02s. */ 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.4/test/reservoir/0000755000175000017500000000000012555417257012724 500000000000000cloog-0.18.4/test/reservoir/lim-lam6.c0000644000175000017500000000045412413255517014421 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.4/test/reservoir/lim-lam2.good.c0000644000175000017500000000157312413255517015347 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.4/test/reservoir/lim-lam3.cloog0000755000175000017500000000543012413255517015301 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.4/test/reservoir/fusion2.cloog0000755000175000017500000000240512413255517015252 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.4/test/reservoir/lim-lam5.c0000644000175000017500000000057612413255517014425 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.4/test/reservoir/lim-lam6.good.c0000644000175000017500000000144312413255517015347 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.4/test/reservoir/pingali4.good.c0000644000175000017500000000134712413255517015443 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.4/test/reservoir/lim-lam3.c0000644000175000017500000000143512413255517014416 00000000000000/* Generated from ./reservoir/lim-lam3.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.01s. */ 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.4/test/reservoir/mg-psinv.c0000644000175000017500000000160012413255517014535 00000000000000/* Generated from ./reservoir/mg-psinv.cloog by CLooG 0.18.1-2-g43fc508 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.4/test/reservoir/fusion2.c0000644000175000017500000000053312413255517014366 00000000000000/* Generated from ./reservoir/fusion2.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.00s. */ 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.4/test/reservoir/two.good.c0000644000175000017500000000115512413255517014542 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.4/test/reservoir/lim-lam4.c0000644000175000017500000000072212413255517014415 00000000000000/* Generated from ./reservoir/lim-lam4.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.01s. */ 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.4/test/reservoir/pingali6.good.c0000644000175000017500000000235712413255517015447 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.4/test/reservoir/pingali1.c0000644000175000017500000000072412413255517014507 00000000000000/* Generated from ./reservoir/pingali1.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.00s. */ 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.4/test/reservoir/stride.cloog0000644000175000017500000000122512413255517015153 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.4/test/reservoir/tang-xue1.c0000644000175000017500000000067712413255517014623 00000000000000/* Generated from ./reservoir/tang-xue1.cloog by CLooG 0.18.1-2-g43fc508 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.4/test/reservoir/lim-lam2.c0000644000175000017500000000054312413255517014414 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.4/test/reservoir/lim-lam4.good.c0000644000175000017500000000204512413255517015344 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.4/test/reservoir/mg-psinv.cloog0000755000175000017500000000615212413255517015430 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.4/test/reservoir/pingali3.good.c0000644000175000017500000000144412413255517015440 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.4/test/reservoir/pingali2.c0000644000175000017500000000045412413255517014510 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.4/test/reservoir/lim-lam3.good.c0000644000175000017500000000335412413255517015347 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.4/test/reservoir/lim-lam1.c0000644000175000017500000000075712413255517014422 00000000000000/* Generated from ./reservoir/lim-lam1.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.00s. */ 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.4/test/reservoir/jacobi3.c0000644000175000017500000000114712413255517014315 00000000000000/* Generated from ./reservoir/jacobi3.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.01s. */ 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.4/test/reservoir/jacobi2.cloog0000755000175000017500000000121412413255517015173 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.4/test/reservoir/pingali4.cloog0000755000175000017500000000223612413255517015376 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.4/test/reservoir/pingali1.good.c0000644000175000017500000000212412413255517015432 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.4/test/reservoir/jacobi3.good.c0000644000175000017500000000241212413255517015240 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.4/test/reservoir/jacobi2.good.c0000644000175000017500000000115112413255517015236 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.4/test/reservoir/pingali1.cloog0000755000175000017500000000337012413255517015373 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.4/test/reservoir/two.cloog0000644000175000017500000000045412413255517014475 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.4/test/reservoir/mg-interp.good.c0000644000175000017500000001634512413255517015642 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.4/test/reservoir/liu-zhuge1.cloog0000755000175000017500000000350412413255517015660 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.4/test/reservoir/mg-interp2.good.c0000644000175000017500000000274212413255517015720 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.4/test/reservoir/pingali2.cloog0000755000175000017500000000221612413255517015372 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.4/test/reservoir/tang-xue1.good.c0000644000175000017500000000200112413255517015531 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.4/test/reservoir/mg-resid.good.c0000644000175000017500000000336512413255517015445 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.4/test/reservoir/cholesky2.good.c0000644000175000017500000000337712413255517015644 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.4/test/reservoir/loechner5.cloog0000755000175000017500000000254412413255517015555 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.4/test/reservoir/mg-resid.c0000644000175000017500000000160012413255517014504 00000000000000/* Generated from ./reservoir/mg-resid.cloog by CLooG 0.18.1-2-g43fc508 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.4/test/reservoir/fusion1.c0000644000175000017500000000034612413255517014367 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.4/test/reservoir/pingali3.cloog0000755000175000017500000000322012413255517015367 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.4/test/reservoir/pingali6.cloog0000755000175000017500000000376712413255517015412 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.4/test/reservoir/pingali5.good.c0000644000175000017500000000231012413255517015433 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.4/test/reservoir/loechner5.c0000644000175000017500000000046512413255517014671 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.4/test/reservoir/loechner5.good.c0000644000175000017500000000134512413255517015616 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.4/test/reservoir/lim-lam1.cloog0000644000175000017500000000174312413255517015277 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.4/test/reservoir/stride2.c0000644000175000017500000000024312413255517014353 00000000000000/* Generated from ./reservoir/stride2.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.00s. */ if (M >= 2) { for (c2=2;c2<=M;c2+=7) { S1(c2,((c2-2)/7)); } } cloog-0.18.4/test/reservoir/mg-rprj3.cloog0000755000175000017500000001437512413255517015337 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.4/test/reservoir/loechner3.cloog0000755000175000017500000000163612413255517015554 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.4/test/reservoir/loechner3.good.c0000644000175000017500000000132412413255517015611 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.4/test/reservoir/loechner4.c0000644000175000017500000000046512413255517014670 00000000000000/* Generated from ./reservoir/loechner4.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.00s. */ 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.4/test/reservoir/cholesky2.cloog0000755000175000017500000000414312413255517015571 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.4/test/reservoir/tang-xue1.cloog0000644000175000017500000000332012413255517015470 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.4/test/reservoir/fusion1.good.c0000644000175000017500000000131212413255517015310 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.4/test/reservoir/lim-lam5.cloog0000755000175000017500000000324012413255517015300 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.4/test/reservoir/liu-zhuge1.good.c0000644000175000017500000000775412413255517015736 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.4/test/reservoir/lim-lam4.cloog0000755000175000017500000000333112413255517015300 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.4/test/reservoir/pingali4.c0000644000175000017500000000041012413255517014502 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.4/test/reservoir/liu-zhuge1.c0000644000175000017500000000225012413255517014771 00000000000000/* Generated from ./reservoir/liu-zhuge1.cloog by CLooG 0.18.1-2-g43fc508 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.4/test/reservoir/fusion2.good.c0000644000175000017500000000170112413255517015313 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.4/test/reservoir/fusion1.cloog0000755000175000017500000000166512413255517015260 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.4/test/reservoir/QR.cloog0000755000175000017500000001652512413255517014217 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.4/test/reservoir/cholesky2.c0000644000175000017500000000125612413255517014707 00000000000000/* Generated from ./reservoir/cholesky2.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.01s. */ 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.4/test/reservoir/pingali5.c0000644000175000017500000000104612413255517014511 00000000000000/* Generated from ./reservoir/pingali5.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.01s. */ 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.4/test/reservoir/mg-rprj3.good.c0000644000175000017500000000706212413255517015375 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.4/test/reservoir/lim-lam2.cloog0000755000175000017500000000337212413255517015303 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.4/test/reservoir/pingali3.c0000644000175000017500000000052712413255517014512 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.4/test/reservoir/jacobi2.c0000644000175000017500000000030312413255517014305 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.4/test/reservoir/mg-rprj3.c0000644000175000017500000000207012413255517014440 00000000000000/* Generated from ./reservoir/mg-rprj3.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.05s. */ 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.4/test/reservoir/lim-lam5.good.c0000644000175000017500000000155012413255517015345 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.4/test/reservoir/bastoul3.c0000644000175000017500000000031412413255517014532 00000000000000/* Generated from ./reservoir/bastoul3.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.00s. */ 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.4/test/reservoir/two.c0000644000175000017500000000020112413255517013602 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.4/test/reservoir/stride.c0000644000175000017500000000024212413255517014270 00000000000000/* Generated from ./reservoir/stride.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.00s. */ if (M >= 2) { for (c2=2;c2<=M;c2+=7) { S1(c2,((c2-2)/7)); } } cloog-0.18.4/test/reservoir/mg-psinv.good.c0000644000175000017500000000336512413255517015476 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.4/test/reservoir/mg-interp2.cloog0000755000175000017500000001370712413255517015660 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.4/test/reservoir/mg-interp2.c0000644000175000017500000000153612413255517014771 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.4/test/reservoir/pingali6.c0000644000175000017500000000113212413255517014506 00000000000000/* Generated from ./reservoir/pingali6.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.01s. */ 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.4/test/reservoir/jacobi3.cloog0000755000175000017500000000371512413255517015204 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.4/test/reservoir/lim-lam6.cloog0000755000175000017500000000221212413255517015277 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.4/test/reservoir/lim-lam1.good.c0000644000175000017500000000247212413255517015345 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.4/test/reservoir/pingali2.good.c0000644000175000017500000000134712413255517015441 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.4/test/reservoir/QR.good.c0000644000175000017500000000753612413255517014264 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.4/test/reservoir/bastoul3.cloog0000644000175000017500000000055612413255517015423 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.4/test/reservoir/pingali5.cloog0000755000175000017500000000445512413255517015404 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.4/test/reservoir/loechner3.c0000644000175000017500000000041112413255517014656 00000000000000/* Generated from ./reservoir/loechner3.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.00s. */ 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.4/test/reservoir/loechner4.cloog0000755000175000017500000000254412413255517015554 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.4/test/reservoir/mg-resid.cloog0000755000175000017500000000615212413255517015377 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.4/test/reservoir/mg-interp.c0000644000175000017500000001014612413255517014704 00000000000000/* Generated from ./reservoir/mg-interp.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.16s. */ 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.4/test/reservoir/stride2.cloog0000644000175000017500000000126712413255517015243 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.4/test/reservoir/QR.c0000644000175000017500000000405212413261116013313 00000000000000/* Generated from ./reservoir/QR.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.07s. */ if (N >= 1) { S1(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); } 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); } 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.4/test/reservoir/loechner4.good.c0000644000175000017500000000142412413255517015613 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.4/test/reservoir/mg-interp.cloog0000755000175000017500000005362212413255517015576 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.4/test/no_lindep.cloog0000644000175000017500000000032112413255517013604 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.4/test/thomasset.good.c0000644000175000017500000000542412413255517013723 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.4/test/levenshtein-1-2-3.c0000644000175000017500000000117112413255517013741 00000000000000/* Generated from ./levenshtein-1-2-3.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.01s. */ 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.4/test/check_openscop.sh0000755000175000017500000000511712413255517014142 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" "${1:-generate}" cloog-0.18.4/test/gesced3.good.c0000644000175000017500000000141412413255517013224 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.4/test/yosrf.cloog0000644000175000017500000000155212413255517013006 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.4/test/min-3-1.good.c0000644000175000017500000000106512413255517012772 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.4/test/walters2.cloog0000644000175000017500000000151712413255517013410 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.4/test/logo.cloog0000644000175000017500000000050412413255517012600 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.4/test/largeur.c0000644000175000017500000000031612413255517012421 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.4/test/forwardsub-2-1-2-3.good.c0000644000175000017500000000145512413255517014666 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.4/test/otl.c0000644000175000017500000000630312413255517011560 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.4/test/test.good.c0000644000175000017500000000162012413255517012665 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.4/test/no_lindep.good.c0000644000175000017500000000104712413255517013660 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.4/test/multi-mm-1.good.c0000644000175000017500000000137312413255517013612 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.4/test/swim.cloog0000644000175000017500000043047112413255517012631 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.4/test/stride2.c0000644000175000017500000000024312413255517012333 00000000000000/* Generated from ./stride2.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.00s. */ for (c1=3;c1<=100;c1+=3) { if (c1 == 27) { S1(27); } S2(c1,(c1/3)); } cloog-0.18.4/test/min-1-1.c0000644000175000017500000000034412413255517012040 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.4/test/gesced2.good.c0000644000175000017500000000271412413255517013227 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.4/test/infinite3.c0000644000175000017500000000050112413255517012644 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.4/test/block2.cloog0000644000175000017500000000237212413255517013021 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.4/test/orc.cloog0000644000175000017500000000516012413255517012426 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.4/test/guide.c0000644000175000017500000000031112413255517012050 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.4/test/forwardsub-2-1-2-3.c0000644000175000017500000000040112413255517013725 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.4/test/forwardsub-2-1-2-3.cloog0000644000175000017500000000144512413255517014617 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.4/test/union.good.c0000644000175000017500000000136312413255517013042 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.4/test/swim.c0000644000175000017500000002643112413255517011745 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.4/test/mode.cloog0000644000175000017500000000057212413255517012571 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.4/test/christian.cloog0000644000175000017500000000212312413255517013623 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.4/test/multi-stride.cloog0000644000175000017500000000033412413255517014263 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.4/test/forwardsub-1-1-2.c0000644000175000017500000000035412413255517013573 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.4/test/ex1.cloog0000644000175000017500000000052612413255517012341 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.4/test/1point-2.cloog0000644000175000017500000000030612413255517013211 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.4/test/forwardsub-1-1-2.good.c0000644000175000017500000000137512413255517014526 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.4/test/emploi.good.c0000644000175000017500000000142112413255517013172 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.4/test/cholesky2.cloog0000644000175000017500000000256312413255517013552 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.4/test/union.c0000644000175000017500000000045612413255517012115 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.4/test/4-param.good.c0000644000175000017500000000142512413255517013152 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.4/test/Makefile.in0000644000175000017500000012310012555417251012660 00000000000000# Makefile.in generated by automake 1.14.1 from Makefile.am. # @configure_input@ # Copyright (C) 1994-2013 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@ am__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)' am__make_running_with_option = \ case $${target_option-} in \ ?) ;; \ *) echo "am__make_running_with_option: internal error: invalid" \ "target option '$${target_option-}' specified" >&2; \ exit 1;; \ esac; \ has_opt=no; \ sane_makeflags=$$MAKEFLAGS; \ if $(am__is_gnu_make); then \ sane_makeflags=$$MFLAGS; \ else \ case $$MAKEFLAGS in \ *\\[\ \ ]*) \ bs=\\; \ sane_makeflags=`printf '%s\n' "$$MAKEFLAGS" \ | sed "s/$$bs$$bs[$$bs $$bs ]*//g"`;; \ esac; \ fi; \ skip_next=no; \ strip_trailopt () \ { \ flg=`printf '%s\n' "$$flg" | sed "s/$$1.*$$//"`; \ }; \ for flg in $$sane_makeflags; do \ test $$skip_next = yes && { skip_next=no; continue; }; \ case $$flg in \ *=*|--*) continue;; \ -*I) strip_trailopt 'I'; skip_next=yes;; \ -*I?*) strip_trailopt 'I';; \ -*O) strip_trailopt 'O'; skip_next=yes;; \ -*O?*) strip_trailopt 'O';; \ -*l) strip_trailopt 'l'; skip_next=yes;; \ -*l?*) strip_trailopt 'l';; \ -[dEDm]) skip_next=yes;; \ -[JT]) skip_next=yes;; \ esac; \ case $$flg in \ *$$target_option*) has_opt=yes; break;; \ esac; \ done; \ test $$has_opt = yes am__make_dryrun = (target_option=n; $(am__make_running_with_option)) am__make_keepgoing = (target_option=k; $(am__make_running_with_option)) 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.in $(srcdir)/Makefile.am \ $(top_srcdir)/autoconf/depcomp \ $(top_srcdir)/autoconf/test-driver 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 am__v_lt_1 = AM_V_P = $(am__v_P_@AM_V@) am__v_P_ = $(am__v_P_@AM_DEFAULT_V@) am__v_P_0 = false am__v_P_1 = : 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_GEN_1 = AM_V_at = $(am__v_at_@AM_V@) am__v_at_ = $(am__v_at_@AM_DEFAULT_V@) am__v_at_0 = @ am__v_at_1 = 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_CC_1 = 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_CCLD_1 = SOURCES = $(generate_test_SOURCES) DIST_SOURCES = $(generate_test_SOURCES) am__can_run_installinfo = \ case $$AM_UPDATE_INFO_DIR in \ n|no|NO) false;; \ *) (install-info --version) >/dev/null 2>&1;; \ esac am__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP) # Read a list of newline-separated strings from the standard input, # and print each of them once, without duplicates. Input order is # *not* preserved. am__uniquify_input = $(AWK) '\ BEGIN { nonempty = 0; } \ { items[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in items) print i; }; } \ ' # Make sure the list of sources is unique. This is necessary because, # e.g., the same source file might be shared among _SOURCES variables # for different programs/libraries. am__define_uniq_tagged_files = \ list='$(am__tagged_files)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | $(am__uniquify_input)` ETAGS = etags CTAGS = ctags am__tty_colors_dummy = \ mgn= red= grn= lgn= blu= brg= std=; \ am__color_tests=no am__tty_colors = { \ $(am__tty_colors_dummy); \ if test "X$(AM_COLOR_TESTS)" = Xno; then \ am__color_tests=no; \ elif test "X$(AM_COLOR_TESTS)" = Xalways; then \ am__color_tests=yes; \ elif test "X$$TERM" != Xdumb && { test -t 1; } 2>/dev/null; then \ am__color_tests=yes; \ fi; \ if test $$am__color_tests = yes; then \ red=''; \ grn=''; \ lgn=''; \ blu=''; \ mgn=''; \ brg=''; \ std=''; \ fi; \ } 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__recheck_rx = ^[ ]*:recheck:[ ]* am__global_test_result_rx = ^[ ]*:global-test-result:[ ]* am__copy_in_global_log_rx = ^[ ]*:copy-in-global-log:[ ]* # A command that, given a newline-separated list of test names on the # standard input, print the name of the tests that are to be re-run # upon "make recheck". am__list_recheck_tests = $(AWK) '{ \ recheck = 1; \ while ((rc = (getline line < ($$0 ".trs"))) != 0) \ { \ if (rc < 0) \ { \ if ((getline line2 < ($$0 ".log")) < 0) \ recheck = 0; \ break; \ } \ else if (line ~ /$(am__recheck_rx)[nN][Oo]/) \ { \ recheck = 0; \ break; \ } \ else if (line ~ /$(am__recheck_rx)[yY][eE][sS]/) \ { \ break; \ } \ }; \ if (recheck) \ print $$0; \ close ($$0 ".trs"); \ close ($$0 ".log"); \ }' # A command that, given a newline-separated list of test names on the # standard input, create the global log from their .trs and .log files. am__create_global_log = $(AWK) ' \ function fatal(msg) \ { \ print "fatal: making $@: " msg | "cat >&2"; \ exit 1; \ } \ function rst_section(header) \ { \ print header; \ len = length(header); \ for (i = 1; i <= len; i = i + 1) \ printf "="; \ printf "\n\n"; \ } \ { \ copy_in_global_log = 1; \ global_test_result = "RUN"; \ while ((rc = (getline line < ($$0 ".trs"))) != 0) \ { \ if (rc < 0) \ fatal("failed to read from " $$0 ".trs"); \ if (line ~ /$(am__global_test_result_rx)/) \ { \ sub("$(am__global_test_result_rx)", "", line); \ sub("[ ]*$$", "", line); \ global_test_result = line; \ } \ else if (line ~ /$(am__copy_in_global_log_rx)[nN][oO]/) \ copy_in_global_log = 0; \ }; \ if (copy_in_global_log) \ { \ rst_section(global_test_result ": " $$0); \ while ((rc = (getline line < ($$0 ".log"))) != 0) \ { \ if (rc < 0) \ fatal("failed to read from " $$0 ".log"); \ print line; \ }; \ printf "\n"; \ }; \ close ($$0 ".trs"); \ close ($$0 ".log"); \ }' # Restructured Text title. am__rst_title = { sed 's/.*/ & /;h;s/./=/g;p;x;s/ *$$//;p;g' && echo; } # Solaris 10 'make', and several other traditional 'make' implementations, # pass "-e" to $(SHELL), and POSIX 2008 even requires this. Work around it # by disabling -e (using the XSI extension "set +e") if it's set. am__sh_e_setup = case $$- in *e*) set +e;; esac # Default flags passed to test drivers. am__common_driver_flags = \ --color-tests "$$am__color_tests" \ --enable-hard-errors "$$am__enable_hard_errors" \ --expect-failure "$$am__expect_failure" # To be inserted before the command running the test. Creates the # directory for the log if needed. Stores in $dir the directory # containing $f, in $tst the test, in $log the log. Executes the # developer- defined test setup AM_TESTS_ENVIRONMENT (if any), and # passes TESTS_ENVIRONMENT. Set up options for the wrapper that # will run the test scripts (or their associated LOG_COMPILER, if # thy have one). am__check_pre = \ $(am__sh_e_setup); \ $(am__vpath_adj_setup) $(am__vpath_adj) \ $(am__tty_colors); \ srcdir=$(srcdir); export srcdir; \ case "$@" in \ */*) am__odir=`echo "./$@" | sed 's|/[^/]*$$||'`;; \ *) am__odir=.;; \ esac; \ test "x$$am__odir" = x"." || test -d "$$am__odir" \ || $(MKDIR_P) "$$am__odir" || exit $$?; \ if test -f "./$$f"; then dir=./; \ elif test -f "$$f"; then dir=; \ else dir="$(srcdir)/"; fi; \ tst=$$dir$$f; log='$@'; \ if test -n '$(DISABLE_HARD_ERRORS)'; then \ am__enable_hard_errors=no; \ else \ am__enable_hard_errors=yes; \ fi; \ case " $(XFAIL_TESTS) " in \ *[\ \ ]$$f[\ \ ]* | *[\ \ ]$$dir$$f[\ \ ]*) \ am__expect_failure=yes;; \ *) \ am__expect_failure=no;; \ esac; \ $(AM_TESTS_ENVIRONMENT) $(TESTS_ENVIRONMENT) # A shell command to get the names of the tests scripts with any registered # extension removed (i.e., equivalently, the names of the test logs, with # the '.log' extension removed). The result is saved in the shell variable # '$bases'. This honors runtime overriding of TESTS and TEST_LOGS. Sadly, # we cannot use something simpler, involving e.g., "$(TEST_LOGS:.log=)", # since that might cause problem with VPATH rewrites for suffix-less tests. # See also 'test-harness-vpath-rewrite.sh' and 'test-trs-basic.sh'. am__set_TESTS_bases = \ bases='$(TEST_LOGS)'; \ bases=`for i in $$bases; do echo $$i; done | sed 's/\.log$$//'`; \ bases=`echo $$bases` RECHECK_LOGS = $(TEST_LOGS) AM_RECURSIVE_TARGETS = check recheck TEST_SUITE_LOG = test-suite.log TEST_EXTENSIONS = @EXEEXT@ .test LOG_DRIVER = $(SHELL) $(top_srcdir)/autoconf/test-driver LOG_COMPILE = $(LOG_COMPILER) $(AM_LOG_FLAGS) $(LOG_FLAGS) am__set_b = \ case '$@' in \ */*) \ case '$*' in \ */*) b='$*';; \ *) b=`echo '$@' | sed 's/\.log$$//'`; \ esac;; \ *) \ b='$*';; \ esac am__test_logs1 = $(TESTS:=.log) am__test_logs2 = $(am__test_logs1:@EXEEXT@.log=.log) TEST_LOGS = $(am__test_logs2:.test.log=.log) TEST_LOG_DRIVER = $(SHELL) $(top_srcdir)/autoconf/test-driver TEST_LOG_COMPILE = $(TEST_LOG_COMPILER) $(AM_TEST_LOG_FLAGS) \ $(TEST_LOG_FLAGS) 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/loops \ @NO_OSL_FALSE@ openscop/union \ @NO_OSL_FALSE@ openscop/coordinates \ @NO_OSL_FALSE@ openscop/clay @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) \ openscop/clay_orig.c \ openscop/coordinates_orig.c all: all-am .SUFFIXES: .SUFFIXES: .c .lo .log .o .obj .test .test$(EXEEXT) .trs $(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 -o $@ $< .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 -o $@ `$(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: $(am__tagged_files) $(am__define_uniq_tagged_files); mkid -fID $$unique tags: tags-am TAGS: tags tags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files) set x; \ here=`pwd`; \ $(am__define_uniq_tagged_files); \ 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-am CTAGS: ctags ctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files) $(am__define_uniq_tagged_files); \ 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" cscopelist: cscopelist-am cscopelist-am: $(am__tagged_files) list='$(am__tagged_files)'; \ case "$(srcdir)" in \ [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \ *) sdir=$(subdir)/$(srcdir) ;; \ esac; \ for i in $$list; do \ if test -f "$$i"; then \ echo "$(subdir)/$$i"; \ else \ echo "$$sdir/$$i"; \ fi; \ done >> $(top_builddir)/cscope.files distclean-tags: -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags # Recover from deleted '.trs' file; this should ensure that # "rm -f foo.log; make foo.trs" re-run 'foo.test', and re-create # both 'foo.log' and 'foo.trs'. Break the recipe in two subshells # to avoid problems with "make -n". .log.trs: rm -f $< $@ $(MAKE) $(AM_MAKEFLAGS) $< # Leading 'am--fnord' is there to ensure the list of targets does not # expand to empty, as could happen e.g. with make check TESTS=''. am--fnord $(TEST_LOGS) $(TEST_LOGS:.log=.trs): $(am__force_recheck) am--force-recheck: @: $(TEST_SUITE_LOG): $(TEST_LOGS) @$(am__set_TESTS_bases); \ am__f_ok () { test -f "$$1" && test -r "$$1"; }; \ redo_bases=`for i in $$bases; do \ am__f_ok $$i.trs && am__f_ok $$i.log || echo $$i; \ done`; \ if test -n "$$redo_bases"; then \ redo_logs=`for i in $$redo_bases; do echo $$i.log; done`; \ redo_results=`for i in $$redo_bases; do echo $$i.trs; done`; \ if $(am__make_dryrun); then :; else \ rm -f $$redo_logs && rm -f $$redo_results || exit 1; \ fi; \ fi; \ if test -n "$$am__remaking_logs"; then \ echo "fatal: making $(TEST_SUITE_LOG): possible infinite" \ "recursion detected" >&2; \ else \ am__remaking_logs=yes $(MAKE) $(AM_MAKEFLAGS) $$redo_logs; \ fi; \ if $(am__make_dryrun); then :; else \ st=0; \ errmsg="fatal: making $(TEST_SUITE_LOG): failed to create"; \ for i in $$redo_bases; do \ test -f $$i.trs && test -r $$i.trs \ || { echo "$$errmsg $$i.trs" >&2; st=1; }; \ test -f $$i.log && test -r $$i.log \ || { echo "$$errmsg $$i.log" >&2; st=1; }; \ done; \ test $$st -eq 0 || exit 1; \ fi @$(am__sh_e_setup); $(am__tty_colors); $(am__set_TESTS_bases); \ ws='[ ]'; \ results=`for b in $$bases; do echo $$b.trs; done`; \ test -n "$$results" || results=/dev/null; \ all=` grep "^$$ws*:test-result:" $$results | wc -l`; \ pass=` grep "^$$ws*:test-result:$$ws*PASS" $$results | wc -l`; \ fail=` grep "^$$ws*:test-result:$$ws*FAIL" $$results | wc -l`; \ skip=` grep "^$$ws*:test-result:$$ws*SKIP" $$results | wc -l`; \ xfail=`grep "^$$ws*:test-result:$$ws*XFAIL" $$results | wc -l`; \ xpass=`grep "^$$ws*:test-result:$$ws*XPASS" $$results | wc -l`; \ error=`grep "^$$ws*:test-result:$$ws*ERROR" $$results | wc -l`; \ if test `expr $$fail + $$xpass + $$error` -eq 0; then \ success=true; \ else \ success=false; \ fi; \ br='==================='; br=$$br$$br$$br$$br; \ result_count () \ { \ if test x"$$1" = x"--maybe-color"; then \ maybe_colorize=yes; \ elif test x"$$1" = x"--no-color"; then \ maybe_colorize=no; \ else \ echo "$@: invalid 'result_count' usage" >&2; exit 4; \ fi; \ shift; \ desc=$$1 count=$$2; \ if test $$maybe_colorize = yes && test $$count -gt 0; then \ color_start=$$3 color_end=$$std; \ else \ color_start= color_end=; \ fi; \ echo "$${color_start}# $$desc $$count$${color_end}"; \ }; \ create_testsuite_report () \ { \ result_count $$1 "TOTAL:" $$all "$$brg"; \ result_count $$1 "PASS: " $$pass "$$grn"; \ result_count $$1 "SKIP: " $$skip "$$blu"; \ result_count $$1 "XFAIL:" $$xfail "$$lgn"; \ result_count $$1 "FAIL: " $$fail "$$red"; \ result_count $$1 "XPASS:" $$xpass "$$red"; \ result_count $$1 "ERROR:" $$error "$$mgn"; \ }; \ { \ echo "$(PACKAGE_STRING): $(subdir)/$(TEST_SUITE_LOG)" | \ $(am__rst_title); \ create_testsuite_report --no-color; \ echo; \ echo ".. contents:: :depth: 2"; \ echo; \ for b in $$bases; do echo $$b; done \ | $(am__create_global_log); \ } >$(TEST_SUITE_LOG).tmp || exit 1; \ mv $(TEST_SUITE_LOG).tmp $(TEST_SUITE_LOG); \ if $$success; then \ col="$$grn"; \ else \ col="$$red"; \ test x"$$VERBOSE" = x || cat $(TEST_SUITE_LOG); \ fi; \ echo "$${col}$$br$${std}"; \ echo "$${col}Testsuite summary for $(PACKAGE_STRING)$${std}"; \ echo "$${col}$$br$${std}"; \ create_testsuite_report --maybe-color; \ echo "$$col$$br$$std"; \ if $$success; then :; else \ echo "$${col}See $(subdir)/$(TEST_SUITE_LOG)$${std}"; \ if test -n "$(PACKAGE_BUGREPORT)"; then \ echo "$${col}Please report to $(PACKAGE_BUGREPORT)$${std}"; \ fi; \ echo "$$col$$br$$std"; \ fi; \ $$success || exit 1 check-TESTS: @list='$(RECHECK_LOGS)'; test -z "$$list" || rm -f $$list @list='$(RECHECK_LOGS:.log=.trs)'; test -z "$$list" || rm -f $$list @test -z "$(TEST_SUITE_LOG)" || rm -f $(TEST_SUITE_LOG) @set +e; $(am__set_TESTS_bases); \ log_list=`for i in $$bases; do echo $$i.log; done`; \ trs_list=`for i in $$bases; do echo $$i.trs; done`; \ log_list=`echo $$log_list`; trs_list=`echo $$trs_list`; \ $(MAKE) $(AM_MAKEFLAGS) $(TEST_SUITE_LOG) TEST_LOGS="$$log_list"; \ exit $$?; recheck: all $(check_SCRIPTS) @test -z "$(TEST_SUITE_LOG)" || rm -f $(TEST_SUITE_LOG) @set +e; $(am__set_TESTS_bases); \ bases=`for i in $$bases; do echo $$i; done \ | $(am__list_recheck_tests)` || exit 1; \ log_list=`for i in $$bases; do echo $$i.log; done`; \ log_list=`echo $$log_list`; \ $(MAKE) $(AM_MAKEFLAGS) $(TEST_SUITE_LOG) \ am__force_recheck=am--force-recheck \ TEST_LOGS="$$log_list"; \ exit $$? check_c.sh.log: check_c.sh @p='check_c.sh'; \ b='check_c.sh'; \ $(am__check_pre) $(LOG_DRIVER) --test-name "$$f" \ --log-file $$b.log --trs-file $$b.trs \ $(am__common_driver_flags) $(AM_LOG_DRIVER_FLAGS) $(LOG_DRIVER_FLAGS) -- $(LOG_COMPILE) \ "$$tst" $(AM_TESTS_FD_REDIRECT) check_fortran.sh.log: check_fortran.sh @p='check_fortran.sh'; \ b='check_fortran.sh'; \ $(am__check_pre) $(LOG_DRIVER) --test-name "$$f" \ --log-file $$b.log --trs-file $$b.trs \ $(am__common_driver_flags) $(AM_LOG_DRIVER_FLAGS) $(LOG_DRIVER_FLAGS) -- $(LOG_COMPILE) \ "$$tst" $(AM_TESTS_FD_REDIRECT) check_strided.sh.log: check_strided.sh @p='check_strided.sh'; \ b='check_strided.sh'; \ $(am__check_pre) $(LOG_DRIVER) --test-name "$$f" \ --log-file $$b.log --trs-file $$b.trs \ $(am__common_driver_flags) $(AM_LOG_DRIVER_FLAGS) $(LOG_DRIVER_FLAGS) -- $(LOG_COMPILE) \ "$$tst" $(AM_TESTS_FD_REDIRECT) check_openscop.sh.log: check_openscop.sh @p='check_openscop.sh'; \ b='check_openscop.sh'; \ $(am__check_pre) $(LOG_DRIVER) --test-name "$$f" \ --log-file $$b.log --trs-file $$b.trs \ $(am__common_driver_flags) $(AM_LOG_DRIVER_FLAGS) $(LOG_DRIVER_FLAGS) -- $(LOG_COMPILE) \ "$$tst" $(AM_TESTS_FD_REDIRECT) check_special.sh.log: check_special.sh @p='check_special.sh'; \ b='check_special.sh'; \ $(am__check_pre) $(LOG_DRIVER) --test-name "$$f" \ --log-file $$b.log --trs-file $$b.trs \ $(am__common_driver_flags) $(AM_LOG_DRIVER_FLAGS) $(LOG_DRIVER_FLAGS) -- $(LOG_COMPILE) \ "$$tst" $(AM_TESTS_FD_REDIRECT) .test.log: @p='$<'; \ $(am__set_b); \ $(am__check_pre) $(TEST_LOG_DRIVER) --test-name "$$f" \ --log-file $$b.log --trs-file $$b.trs \ $(am__common_driver_flags) $(AM_TEST_LOG_DRIVER_FLAGS) $(TEST_LOG_DRIVER_FLAGS) -- $(TEST_LOG_COMPILE) \ "$$tst" $(AM_TESTS_FD_REDIRECT) @am__EXEEXT_TRUE@.test$(EXEEXT).log: @am__EXEEXT_TRUE@ @p='$<'; \ @am__EXEEXT_TRUE@ $(am__set_b); \ @am__EXEEXT_TRUE@ $(am__check_pre) $(TEST_LOG_DRIVER) --test-name "$$f" \ @am__EXEEXT_TRUE@ --log-file $$b.log --trs-file $$b.trs \ @am__EXEEXT_TRUE@ $(am__common_driver_flags) $(AM_TEST_LOG_DRIVER_FLAGS) $(TEST_LOG_DRIVER_FLAGS) -- $(TEST_LOG_COMPILE) \ @am__EXEEXT_TRUE@ "$$tst" $(AM_TESTS_FD_REDIRECT) 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: -test -z "$(TEST_LOGS)" || rm -f $(TEST_LOGS) -test -z "$(TEST_LOGS:.log=.trs)" || rm -f $(TEST_LOGS:.log=.trs) -test -z "$(TEST_SUITE_LOG)" || rm -f $(TEST_SUITE_LOG) 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 TAGS all all-am check check-TESTS check-am clean \ clean-generic clean-libtool clean-noinstPROGRAMS cscopelist-am \ ctags ctags-am 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 \ recheck tags tags-am 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 valcheck: test_valgrind test_run: generate_test$(EXEEXT) $(TESTS_ENVIRONMENT) $(srcdir)/check_run.sh test_valgrind: $(TESTS_ENVIRONMENT) $(srcdir)/check_c.sh valgrind ; \ $(TESTS_ENVIRONMENT) $(srcdir)/check_fortran.sh valgrind ; \ $(TESTS_ENVIRONMENT) $(srcdir)/check_strided.sh valgrind ; \ $(TESTS_ENVIRONMENT) $(srcdir)/check_openscop.sh valgrind ; \ $(TESTS_ENVIRONMENT) $(srcdir)/check_special.sh valgrind test_regenerate: $(TESTS_ENVIRONMENT) $(srcdir)/check_c.sh regenerate ; \ $(TESTS_ENVIRONMENT) $(srcdir)/check_fortran.sh regenerate ; \ $(TESTS_ENVIRONMENT) $(srcdir)/check_strided.sh regenerate ; \ $(TESTS_ENVIRONMENT) $(srcdir)/check_openscop.sh regenerate ; \ $(TESTS_ENVIRONMENT) $(srcdir)/check_special.sh regenerate # 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.4/test/durbin_e_s.c0000644000175000017500000000062212413255517013071 00000000000000/* Generated from ./durbin_e_s.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.00s. */ 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.4/test/mode.good.c0000644000175000017500000000203712413255517012635 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.4/test/byu98-1-2-3.c0000644000175000017500000000061612413255517012400 00000000000000/* Generated from ./byu98-1-2-3.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.00s. */ 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.4/test/iftest.cloog0000644000175000017500000000077212413255517013145 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.4/test/dealII.good.c0000644000175000017500000000147712413255517013047 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.4/test/basic-bounds-6.c0000644000175000017500000000017312413255517013475 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.4/test/dartef.cloog0000644000175000017500000000127612413255517013114 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.4/test/lu2.c0000644000175000017500000000065112413255517011464 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.4/test/basic-bounds-2.cloog0000644000175000017500000000021512413255517014347 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.4/test/levenshtein-1-2-3.cloog0000644000175000017500000000355212413255517014627 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.4/test/constbound.good.c0000644000175000017500000000153412413255517014070 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.4/test/check_run.sh0000755000175000017500000000627312413255517013124 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" "run" failedtest=$?; $CHECKER "RUN SPECIAL" "$special_refactored" "" "cloog" "c" "run" failedtest=`expr $failedtest + $?`; $CHECKER "RUN SPECIAL -sh 1" "$special_refactored" "-sh 1" "cloog" "c" "run" failedtest=`expr $failedtest + $?`; return $failedtest; cloog-0.18.4/test/0D-1.good.c0000644000175000017500000000064012413255517012310 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.4/test/dot2.good.c0000644000175000017500000000132512413255517012560 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.4/test/tiling.cloog0000644000175000017500000000050012413255517013122 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.4/test/lex.c0000644000175000017500000000023112413255517011544 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.4/test/constant.cloog0000644000175000017500000000431312413255517013473 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.4/test/levenshtein-1-2-3.good.c0000644000175000017500000000272112413255517014672 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.4/test/cholesky2.c0000644000175000017500000000220012413255517012655 00000000000000/* Generated from ./cholesky2.cloog by CLooG 0.18.1-2-g43fc508 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.4/test/basic-bounds-1.good.c0000644000175000017500000000076612413255517014427 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.4/test/yosrf.f0000644000175000017500000000057312413255517012132 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.4/test/no_lindep.c0000644000175000017500000000014012413255517012722 00000000000000/* Generated from ./no_lindep.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.00s. */ S1((N+2)); cloog-0.18.4/test/walters.cloog0000644000175000017500000000264612413255517013332 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.4/test/nul_basic2.cloog0000644000175000017500000000133512413255517013664 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.4/test/walters3.good.c0000644000175000017500000000121512413255517013452 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.4/test/lub.cloog0000644000175000017500000000126612413255517012430 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.4/test/union.cloog0000644000175000017500000000020712413255517012770 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.4/test/largeur.good.c0000644000175000017500000000113212413255517013345 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.4/test/isl/0000755000175000017500000000000012555417257011473 500000000000000cloog-0.18.4/test/isl/mod3.cloog0000644000175000017500000000102112413255517013264 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.4/test/isl/mod.c0000644000175000017500000000024312413255517012325 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.4/test/isl/mod4.c0000644000175000017500000000034012413255517012407 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.4/test/isl/jacobi-shared.good.c0000644000175000017500000000203012413255517015164 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.4/test/isl/unroll2.good.c0000644000175000017500000000105112413255517014070 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.4/test/isl/unroll2.cloog0000644000175000017500000000012512413255517014023 00000000000000C [n] -> { : } 0 1 [n] -> { [i] : 0 <= i and n <= i <= n + 1 <= 10 } 0 0 0 0 0 cloog-0.18.4/test/isl/mod2.c0000644000175000017500000000024312413255517012407 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.4/test/isl/mxm-shared.c0000644000175000017500000000036612413255517013621 00000000000000/* Generated from ./isl/mxm-shared.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.17s. */ 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.4/test/isl/mod3.c0000644000175000017500000000037112413255517012412 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.4/test/isl/mxm-shared.cloog0000644000175000017500000003421612413255517014503 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.4/test/isl/jacobi-shared.c0000644000175000017500000000077112413277160014245 00000000000000/* Generated from ./isl/jacobi-shared.cloog by CLooG gmp bits in 0.31s. */ 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) { S1((c0+g1-1),(c1+g2-1)); } } } } } cloog-0.18.4/test/isl/mod.cloog0000644000175000017500000000042012413255517013203 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.4/test/isl/unroll.c0000644000175000017500000000024512413255517013063 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.4/test/isl/unroll.good.c0000644000175000017500000000103612413255517014011 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.4/test/isl/mod2.cloog0000644000175000017500000000036212413255517013272 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.4/test/isl/unroll2.c0000644000175000017500000000024212413255517013142 00000000000000/* Generated from ./isl/unroll2.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.00s. */ if ((M >= -1) && (M <= 9)) { if (M >= 0) { S1(M); } S1((M+1)); } cloog-0.18.4/test/isl/mod4.cloog0000644000175000017500000000041612413255517013274 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.4/test/isl/unroll.cloog0000644000175000017500000000010712413255517013741 00000000000000C [n] -> { : } 0 1 [n] -> { [i] : 0 <= i and i <= 10 } 0 0 0 0 0 cloog-0.18.4/test/isl/jacobi-shared.cloog0000644000175000017500000002733712413255517015137 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.4/test/backtrack.cloog0000644000175000017500000000020412413255517013562 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.4/test/logopar.cloog0000644000175000017500000000063412413255517013307 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.4/test/equality2.good.c0000644000175000017500000000243012413255517013625 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.4/test/durbin_e_s.good.c0000644000175000017500000000330212413255517014016 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.4/test/darte.cloog0000644000175000017500000000127012413255517012740 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.4/test/block.cloog0000644000175000017500000000032212413255517012730 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.4/test/openscop/0000755000175000017500000000000012555417257012532 500000000000000cloog-0.18.4/test/openscop/clay_orig.c0000644000175000017500000000016012554423530014551 00000000000000int i; #pragma scop /* Clay stripmine([0,0],1,4,1); */ for (i = 0; i < 42; i++) { S(i); } #pragma endscop cloog-0.18.4/test/openscop/coordinates_orig.c0000644000175000017500000000010312554423530016130 00000000000000#pragma scop for (i = 0; i < 42; i++) { S1(i); } #pragma endscop cloog-0.18.4/test/openscop/union.scop0000644000175000017500000000464712413255517014473 00000000000000# [File generated by the OpenScop Library 0.8.0] # =============================================== Global # Language C # Context CONTEXT 1 3 0 0 0 1 # e/i| N | 1 1 1 3 ## N+3 >= 0 # Parameters are provided 1 N # Number of statements 1 # =============================================== Statement 1 # Number of relations describing the statement: 6 # ---------------------------------------------- 1.1 Domain DOMAIN # Union with 2 parts 2 # Union part No.1 5 5 2 0 0 1 # e/i| i j | N | 1 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 1 0 1 0 -20 ## j-20 >= 0 # Union part No.2 5 5 2 0 0 1 # e/i| i j | N | 1 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 1 0 -1 0 10 ## -j+10 >= 0 # ---------------------------------------------- 1.2 Scattering SCATTERING 5 10 5 2 0 1 # e/i| c1 c2 c3 c4 c5 | i j | N | 1 0 -1 0 0 0 0 0 0 0 0 ## c1 == 0 0 0 -1 0 0 0 1 0 0 0 ## c2 == i 0 0 0 -1 0 0 0 0 0 0 ## c3 == 0 0 0 0 0 -1 0 0 1 0 0 ## c4 == j 0 0 0 0 0 -1 0 0 0 0 ## c5 == 0 # ---------------------------------------------- 1.3 Access READ 2 7 2 2 0 1 # e/i| A1 [1]| i j | N | 1 0 -1 0 0 0 0 1 ## A1 0 0 -1 1 1 0 0 ## [1] == i+j READ 2 7 2 2 0 1 # e/i| A2 [1]| i j | N | 1 0 -1 0 0 0 0 2 ## A2 0 0 -1 1 0 0 0 ## [1] == i READ 2 7 2 2 0 1 # e/i| A3 [1]| i j | N | 1 0 -1 0 0 0 0 3 ## A3 0 0 -1 0 1 0 0 ## [1] == j WRITE 2 7 2 2 0 1 # e/i| A1 [1]| i j | N | 1 0 -1 0 0 0 0 1 ## A1 0 0 -1 1 1 0 0 ## [1] == i+j # ---------------------------------------------- 1.4 Body # Statement body is provided 1 # Number of original iterators 2 # Original iterators i j # Body expression C[i+j]+=A[i]*B[j]; # =============================================== Extensions hello, world HELLO WORLD I SAID cloog-0.18.4/test/openscop/loops.c0000644000175000017500000000277312554423530013751 00000000000000/* Generated from ./openscop/loops.scop by CLooG 0.18.3 gmp bits in 0.04s. */ /* 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)) #ifdef TIME #define IF_TIME(foo) foo; #else #define IF_TIME(foo) #endif /* Scattering iterators. */ int t2, t3, t4, t5, t6, t9; /* Original iterators. */ int i, j, k, l, m, n; int lbp, ubp; int lbv, ubv; if (N >= 1) { lbp=0; ubp=floord(N-1,32); #pragma omp parallel for private(lbv,ubv,t3,t4,t5,t6,t7,t8,t9) for (t2=lbp;t2<=ubp;t2++) { for (t3=0;t3<=floord(N-1,32);t3++) { for (t4=32*t2;t4<=min(N-1,32*t2+31);t4++) { lbv=32*t3; ubv=min(N-1,32*t3+31); #pragma ivdep #pragma vector always for (t9=lbv;t9<=ubv;t9++) { c[t4][t9] = 0.0; } } } } lbp=0; ubp=floord(N-1,32); #pragma omp parallel for private(lbv,ubv,t3,t4,t5,t6,t7,t8,t9) for (t2=lbp;t2<=ubp;t2++) { for (t3=0;t3<=floord(N-1,32);t3++) { for (t4=0;t4<=floord(N-1,32);t4++) { for (t5=32*t2;t5<=min(N-1,32*t2+31);t5++) { for (t6=32*t4;t6<=min(N-1,32*t4+31);t6++) { lbv=32*t3; ubv=min(N-1,32*t3+31); #pragma ivdep #pragma vector always for (t9=lbv;t9<=ubv;t9++) { c[t5][t9] = c[t5][t9] + a[t5][t6]*b[t6][t9]; } } } } } } } cloog-0.18.4/test/openscop/matmult.scop0000644000175000017500000001005312413255517015012 00000000000000# [File generated by the OpenScop Library 0.8.0] # =============================================== Global # Language C # Context CONTEXT 1 3 0 0 0 1 # e/i| N | 1 1 1 -1 ## N-1 >= 0 # Parameters are provided 1 N # Number of statements 2 # =============================================== Statement 1 # Number of relations describing the statement: 3 # ---------------------------------------------- 1.1 Domain DOMAIN 4 5 2 0 0 1 # e/i| i j | N | 1 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 # ---------------------------------------------- 1.2 Scattering SCATTERING 5 10 5 2 0 1 # e/i| c1 c2 c3 c4 c5 | i j | N | 1 0 -1 0 0 0 0 0 0 0 0 ## c1 == 0 0 0 -1 0 0 0 1 0 0 0 ## c2 == i 0 0 0 -1 0 0 0 0 0 0 ## c3 == 0 0 0 0 0 -1 0 0 1 0 0 ## c4 == j 0 0 0 0 0 -1 0 0 0 0 ## c5 == 0 # ---------------------------------------------- 1.3 Access WRITE 3 8 3 2 0 1 # e/i| A1 [1] [2]| i j | N | 1 0 -1 0 0 0 0 0 1 ## A1 0 0 -1 0 1 0 0 0 ## [1] == i 0 0 0 -1 0 1 0 0 ## [2] == j # ---------------------------------------------- 1.4 Body # Statement body is provided 1 # Number of original iterators 2 # Original iterators i j # Body expression C[i][j] = 0.0; # =============================================== Statement 2 # Number of relations describing the statement: 6 # ---------------------------------------------- 2.1 Domain DOMAIN 6 6 3 0 0 1 # e/i| i j k | N | 1 1 1 0 0 0 0 ## i >= 0 1 -1 0 0 1 -1 ## -i+N-1 >= 0 1 0 1 0 0 0 ## j >= 0 1 0 -1 0 1 -1 ## -j+N-1 >= 0 1 0 0 1 0 0 ## k >= 0 1 0 0 -1 1 -1 ## -k+N-1 >= 0 # ---------------------------------------------- 2.2 Scattering SCATTERING 7 13 7 3 0 1 # e/i| c1 c2 c3 c4 c5 c6 c7 | i j k | N | 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 ## c1 == 0 0 0 -1 0 0 0 0 0 1 0 0 0 0 ## c2 == i 0 0 0 -1 0 0 0 0 0 0 0 0 0 ## c3 == 0 0 0 0 0 -1 0 0 0 0 1 0 0 0 ## c4 == j 0 0 0 0 0 -1 0 0 0 0 0 0 1 ## c5 == 1 0 0 0 0 0 0 -1 0 0 0 1 0 0 ## c6 == k 0 0 0 0 0 0 0 -1 0 0 0 0 0 ## c7 == 0 # ---------------------------------------------- 2.3 Access WRITE 3 9 3 3 0 1 # e/i| A1 [1] [2]| i j k | N | 1 0 -1 0 0 0 0 0 0 1 ## A1 0 0 -1 0 1 0 0 0 0 ## [1] == i 0 0 0 -1 0 1 0 0 0 ## [2] == j READ 3 9 3 3 0 1 # e/i| A1 [1] [2]| i j k | N | 1 0 -1 0 0 0 0 0 0 1 ## A1 0 0 -1 0 1 0 0 0 0 ## [1] == i 0 0 0 -1 0 1 0 0 0 ## [2] == j READ 3 9 3 3 0 1 # e/i| A2 [1] [2]| i j k | N | 1 0 -1 0 0 0 0 0 0 2 ## A2 0 0 -1 0 1 0 0 0 0 ## [1] == i 0 0 0 -1 0 0 1 0 0 ## [2] == k READ 3 9 3 3 0 1 # e/i| A3 [1] [2]| i j k | N | 1 0 -1 0 0 0 0 0 0 3 ## A3 0 0 -1 0 0 0 1 0 0 ## [1] == k 0 0 0 -1 0 1 0 0 0 ## [2] == j # ---------------------------------------------- 2.4 Body # Statement body is provided 1 # Number of original iterators 3 # Original iterators i j k # Body expression C[i][j] = C[i][j] + A[i][k] * B[k][j]; # =============================================== Extensions cloog-0.18.4/test/openscop/coordinates.c0000644000175000017500000000053112554423530015115 00000000000000/* 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)) #ifdef TIME #define IF_TIME(foo) foo; #else #define IF_TIME(foo) #endif for (i=0;i<=41;i++) { S1(i); } cloog-0.18.4/test/openscop/empty.scop0000644000175000017500000000116312413255517014467 00000000000000 # =============================================== Global # Language C # Context CONTEXT 0 2 0 0 0 0 # Parameter names are not provided 0 # One statement 1 # =============================================== Statement 1 # Number of relations describing the statement 0 # ---------------------------------------------- 1.1 Domain # NULL Domain # ---------------------------------------------- 1.2 Scattering # NULL Scattering # ---------------------------------------------- 1.3 Access # NULL Access # ---------------------------------------------- 1.4 Body # Statement body is not provided 0 cloog-0.18.4/test/openscop/union.c0000644000175000017500000000121512554423530013733 00000000000000/* Generated from ./openscop/union.scop by CLooG 0.18.3 gmp bits in 0.01s. */ /* 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)) #ifdef TIME #define IF_TIME(foo) foo; #else #define IF_TIME(foo) #endif /* Scattering iterators. */ int c2, c4; /* Original iterators. */ int i, j; if (N >= 1) { for (c2=0;c2<=N-1;c2++) { for (c4=0;c4<=min(10,N-1);c4++) { C[c2+c4]+=A[c2]*B[c4]; } for (c4=20;c4<=N-1;c4++) { C[c2+c4]+=A[c2]*B[c4]; } } } cloog-0.18.4/test/openscop/empty.c0000644000175000017500000000060612554423530013744 00000000000000/* Generated from ./openscop/empty.scop by CLooG 0.18.3 gmp bits in 0.00s. */ /* 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)) #ifdef TIME #define IF_TIME(foo) foo; #else #define IF_TIME(foo) #endif cloog-0.18.4/test/openscop/clay.scop0000644000175000017500000000323312554423530014257 00000000000000# [File generated by the OpenScop Library 0.9.0] # =============================================== Global # Language C # Context CONTEXT 0 2 0 0 0 0 # Parameters are not provided 0 # Number of statements 1 # =============================================== Statement 1 # Number of relations describing the statement: 3 # ---------------------------------------------- 1.1 Domain DOMAIN 2 3 1 0 0 0 # e/i| i | 1 1 1 0 ## i >= 0 1 -1 41 ## -i+41 >= 0 # ---------------------------------------------- 1.2 Scattering SCATTERING 6 8 5 1 0 0 # e/i| c1 c2 c3 c4 c5 | i | 1 0 -1 0 0 0 0 0 0 ## c1 == 0 1 0 -4 0 1 0 0 0 ## -4*c2+c4 >= 0 1 0 4 0 -1 0 0 3 ## 4*c2-c4+3 >= 0 0 0 0 -1 0 0 0 0 ## c3 == 0 0 0 0 0 -1 0 1 0 ## c4 == i 0 0 0 0 0 -1 0 0 ## c5 == 0 # ---------------------------------------------- 1.3 Access READ 1 4 1 1 0 0 # e/i| Arr| i | 1 0 -1 0 1 ## Arr == i # ---------------------------------------------- 1.4 Statement Extensions # Number of Statement Extensions 2 1 # Number of original iterators 1 # List of original iterators i # Statement body expression S(i); # =============================================== Extensions __b0 __ii0 b0 i b1 # Number of arrays 2 # Mapping array-identifiers/array-names 1 i 2 S # File name clay_orig.c # Starting line and column 3 0 # Ending line and column 9 0 # Indentation 0 cloog-0.18.4/test/openscop/loops.scop0000644000175000017500000001617612554423530014475 00000000000000# [File generated by the OpenScop Library 0.8.4] # =============================================== Global # Language C # Context CONTEXT 0 3 0 0 0 1 # Parameters are provided 1 N # Number of statements 2 # =============================================== Statement 1 # Number of relations describing the statement: 3 # ---------------------------------------------- 1.1 Domain DOMAIN 10 7 4 0 0 1 # e/i| fk0 fk1 i j | N | 1 1 0 0 1 0 0 0 ## i >= 0 1 0 0 -1 0 1 -1 ## -i+N-1 >= 0 1 0 0 0 0 1 -1 ## N-1 >= 0 1 0 0 0 1 0 0 ## j >= 0 1 0 0 0 -1 1 -1 ## -j+N-1 >= 0 0 0 0 0 0 0 0 ## 0 == 0 1 0 -32 1 0 0 0 ## -32*fk1+i >= 0 1 0 32 -1 0 0 31 ## 32*fk1-i+31 >= 0 1 -32 0 0 1 0 0 ## -32*fk0+j >= 0 1 32 0 0 -1 0 31 ## 32*fk0-j+31 >= 0 # ---------------------------------------------- 1.2 Scattering SCATTERING 9 16 9 4 0 1 # e/i| c1 c2 c3 c4 c5 c6 c7 c8 c9 | fk0 fk1 i j | N | 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ## c1 == 0 0 0 -1 0 0 0 0 0 0 0 0 1 0 0 0 0 ## c2 == fk1 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 ## c3 == fk0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 ## c4 == i 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 ## c5 == 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 ## c6 == 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 ## c7 == 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 ## c8 == 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 1 0 0 ## c9 == j # ---------------------------------------------- 1.3 Access WRITE 3 10 3 4 0 1 # e/i| Arr [1] [2]| fk0 fk1 i j | N | 1 0 -1 0 0 0 0 0 0 0 4 ## Arr == c 0 0 -1 0 0 0 1 0 0 0 ## [1] == i 0 0 0 -1 0 0 0 1 0 0 ## [2] == j # ---------------------------------------------- 1.4 Body # Statement body is provided 1 # Number of original iterators 4 # List of original iterators fk0 fk1 i j # Statement body expression c[i][j] = 0.0; # =============================================== Statement 2 # Number of relations describing the statement: 6 # ---------------------------------------------- 2.1 Domain DOMAIN 13 9 6 0 0 1 # e/i| fk0 fk1 fk2 i j k | N | 1 1 0 0 0 1 0 0 0 0 ## i >= 0 1 0 0 0 -1 0 0 1 -1 ## -i+N-1 >= 0 1 0 0 0 0 0 0 1 -1 ## N-1 >= 0 1 0 0 0 0 1 0 0 0 ## j >= 0 1 0 0 0 0 -1 0 1 -1 ## -j+N-1 >= 0 1 0 0 0 0 0 1 0 0 ## k >= 0 1 0 0 0 0 0 -1 1 -1 ## -k+N-1 >= 0 1 0 0 -32 1 0 0 0 0 ## -32*fk2+i >= 0 1 0 0 32 -1 0 0 0 31 ## 32*fk2-i+31 >= 0 1 0 -32 0 0 1 0 0 0 ## -32*fk1+j >= 0 1 0 32 0 0 -1 0 0 31 ## 32*fk1-j+31 >= 0 1 -32 0 0 0 0 1 0 0 ## -32*fk0+k >= 0 1 32 0 0 0 0 -1 0 31 ## 32*fk0-k+31 >= 0 # ---------------------------------------------- 2.2 Scattering SCATTERING 9 18 9 6 0 1 # e/i| c1 c2 c3 c4 c5 c6 c7 c8 c9 | fk0 fk1 fk2 i j k | N | 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 ## c1 == 1 0 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 ## c2 == fk2 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 ## c3 == fk1 0 0 0 0 -1 0 0 0 0 0 1 0 0 0 0 0 0 0 ## c4 == fk0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 ## c5 == i 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 1 0 0 ## c6 == k 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 ## c7 == 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 ## c8 == 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 1 0 0 0 ## c9 == j # ---------------------------------------------- 2.3 Access WRITE 3 12 3 6 0 1 # e/i| Arr [1] [2]| fk0 fk1 fk2 i j k | N | 1 0 -1 0 0 0 0 0 0 0 0 0 4 ## Arr == c 0 0 -1 0 0 0 0 1 0 0 0 0 ## [1] == i 0 0 0 -1 0 0 0 0 1 0 0 0 ## [2] == j READ 3 12 3 6 0 1 # e/i| Arr [1] [2]| fk0 fk1 fk2 i j k | N | 1 0 -1 0 0 0 0 0 0 0 0 0 4 ## Arr == c 0 0 -1 0 0 0 0 1 0 0 0 0 ## [1] == i 0 0 0 -1 0 0 0 0 1 0 0 0 ## [2] == j READ 3 12 3 6 0 1 # e/i| Arr [1] [2]| fk0 fk1 fk2 i j k | N | 1 0 -1 0 0 0 0 0 0 0 0 0 6 ## Arr == a 0 0 -1 0 0 0 0 1 0 0 0 0 ## [1] == i 0 0 0 -1 0 0 0 0 0 1 0 0 ## [2] == k READ 3 12 3 6 0 1 # e/i| Arr [1] [2]| fk0 fk1 fk2 i j k | N | 1 0 -1 0 0 0 0 0 0 0 0 0 7 ## Arr == b 0 0 -1 0 0 0 0 0 0 1 0 0 ## [1] == k 0 0 0 -1 0 0 0 0 1 0 0 0 ## [2] == j # ---------------------------------------------- 2.4 Body # Statement body is provided 1 # Number of original iterators 6 # List of original iterators fk0 fk1 fk2 i j k # Statement body expression c[i][j] = c[i][j] + a[i][k]*b[k][j]; # =============================================== Extensions # Number of arrays 7 # Mapping array-identifiers/array-names 1 i 2 N 3 j 4 c 5 k 6 a 7 b t1 t2 t3 t4 t5 t6 t7 t8 t9 # Number of loops 4 # =========================================== # Loop number 1 # Iterator name t2 # Number of stmts 1 # Statement identifiers 1 # Private variables lbv,ubv,t3,t4,t5,t6,t7,t8,t9 # Directive 1 # =========================================== # Loop number 2 # Iterator name t2 # Number of stmts 1 # Statement identifiers 2 # Private variables lbv,ubv,t3,t4,t5,t6,t7,t8,t9 # Directive 1 # =========================================== # Loop number 3 # Iterator name t9 # Number of stmts 1 # Statement identifiers 1 # Private variables (null) # Directive 4 # =========================================== # Loop number 4 # Iterator name t9 # Number of stmts 1 # Statement identifiers 2 # Private variables (null) # Directive 4 cloog-0.18.4/test/openscop/matmult.c0000644000175000017500000000120512554423530014265 00000000000000/* Generated from ./openscop/matmult.scop by CLooG 0.18.3 gmp bits in 0.01s. */ /* 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)) #ifdef TIME #define IF_TIME(foo) foo; #else #define IF_TIME(foo) #endif /* Scattering iterators. */ int c2, c4, c6; /* Original iterators. */ int i, j, k; for (c2=0;c2<=N-1;c2++) { for (c4=0;c4<=N-1;c4++) { C[c2][c4] = 0.0; for (c6=0;c6<=N-1;c6++) { C[c2][c4] = C[c2][c4] + A[c2][c6] * B[c6][c4]; } } } cloog-0.18.4/test/openscop/clay.c0000644000175000017500000000070212554423530013533 00000000000000/* 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)) #ifdef TIME #define IF_TIME(foo) foo; #else #define IF_TIME(foo) #endif /* Scattering iterators. */ int __ii0; for (__ii0=0;__ii0<=10;__ii0++) { for (i=4*__ii0;i<=min(41,4*__ii0+3);i++) { S(i); } } cloog-0.18.4/test/openscop/coordinates.scop0000644000175000017500000000270212554423530015641 00000000000000# [File generated by the OpenScop Library 0.9.0] # =============================================== Global # Language C # Context CONTEXT 0 2 0 0 0 0 # Parameters are not provided 0 # Number of statements 1 # =============================================== Statement 1 # Number of relations describing the statement: 3 # ---------------------------------------------- 1.1 Domain DOMAIN 2 3 1 0 0 0 # e/i| i | 1 1 1 0 ## i >= 0 1 -1 41 ## -i+41 >= 0 # ---------------------------------------------- 1.2 Scattering SCATTERING 3 6 3 1 0 0 # e/i| c1 c2 c3 | i | 1 0 -1 0 0 0 0 ## c1 == 0 0 0 -1 0 1 0 ## c2 == i 0 0 0 -1 0 0 ## c3 == 0 # ---------------------------------------------- 1.3 Access READ 1 4 1 1 0 0 # e/i| Arr| i | 1 0 -1 0 1 ## Arr == i # ---------------------------------------------- 1.4 Statement Extensions # Number of Statement Extensions 2 # Number of original iterators 1 # List of original iterators i # Statement body expression S1(i); 1 # =============================================== Extensions b0 i b1 # Number of arrays 2 # Mapping array-identifiers/array-names 1 i 2 S1 # File name coordinates_orig.c # Starting line and column 2 0 # Ending line and column 5 0 # Indentation 0 cloog-0.18.4/test/byu98-1-2-3.cloog0000644000175000017500000000163612413255517013264 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.4/test/lu.c0000644000175000017500000000065112413255517011402 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.4/test/gesced2.c0000644000175000017500000000077112413255517012301 00000000000000/* Generated from ./gesced2.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.01s. */ 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.4/test/orc.c0000644000175000017500000000175612413255517011554 00000000000000/* Generated from ./orc.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.01s. */ 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.4/test/stride4.cloog0000644000175000017500000000064712413255517013226 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.4/test/logopar.good.c0000644000175000017500000000205112413255517013350 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.4/test/vasilache.good.c0000644000175000017500000000313412413255517013647 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.4/test/singleton.cloog0000644000175000017500000000011112413255517013634 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.4/test/constant.good.c0000644000175000017500000000170312413255517013541 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.4/test/sor1d.cloog0000644000175000017500000001241412413255517012673 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.4/test/infinite.cloog0000644000175000017500000000052212413255517013445 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.4/test/orc.good.c0000644000175000017500000000433112413255517012473 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.4/test/gesced2.cloog0000644000175000017500000000214712413255517013161 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.4/test/infinite2.c0000644000175000017500000000032612413255517012650 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.4/test/ex1.c0000644000175000017500000000052312413255517011455 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.4/test/basic-bounds-5.cloog0000644000175000017500000000030712413255517014354 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.4/test/basic-bounds-1.cloog0000644000175000017500000000021512413255517014346 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.4/test/basic-bounds-3.good.c0000644000175000017500000000077312413255517014427 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.4/test/classen2.cloog0000644000175000017500000000245712413255517013363 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.4/test/1point-2.good.c0000644000175000017500000000101312413255517013253 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.4/test/pouchet.c0000644000175000017500000000122612413255517012430 00000000000000/* Generated from ./pouchet.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.02s. */ 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.4/test/esced.c0000644000175000017500000000046012413255517012043 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.4/test/walters.c0000644000175000017500000000073412413255517012445 00000000000000/* Generated from ./walters.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.00s. */ 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.4/test/esced.good.c0000644000175000017500000000127312413255517012775 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.4/test/lex.cloog0000644000175000017500000000024512413255517012432 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.4/test/guide.good.c0000644000175000017500000000122312413255517013002 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.4/test/square+triangle-1-1-2-3.c0000644000175000017500000000044112413255517014653 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.4/test/merge.cloog0000644000175000017500000000026412413255517012742 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.4/test/lu2.good.c0000644000175000017500000000175512413255517012421 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.4/test/walters3.c0000644000175000017500000000027312413255517012526 00000000000000/* Generated from ./walters3.cloog by CLooG 0.18.1-2-g43fc508 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.4/test/block.good.c0000644000175000017500000000111012413255517012772 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.4/test/stride3.cloog0000644000175000017500000000210212413255517013211 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.4/test/multi-stride.c0000644000175000017500000000016012413255517013377 00000000000000/* Generated from ../../../git/cloog/test/multi-stride.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.00s. */ cloog-0.18.4/test/stride.c0000644000175000017500000000027212413255517012253 00000000000000/* Generated from ./stride.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.00s. */ for (c1=3;c1<=100;c1++) { if (c1 == 25) { S1(25); } if (c1%3 == 0) { S2(c1,(c1/3)); } } cloog-0.18.4/test/uday_scalars.cloog0000644000175000017500000000273112413255517014316 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.4/test/basic-bounds-3.cloog0000644000175000017500000000025012413255517014347 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.4/test/emploi.c0000644000175000017500000000045612413255517012252 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.4/test/mod4.cloog0000644000175000017500000000166412413255517012513 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.4/test/non_optimal/0000755000175000017500000000000012555417257013223 500000000000000cloog-0.18.4/test/non_optimal/youcef.cloog0000644000175000017500000000070312413255517015452 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.4/test/non_optimal/usvd_e_t.c0000644000175000017500000001137312413255517015114 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.4/test/non_optimal/usvd_e_t.good.c0000644000175000017500000001735512413255517016051 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.4/test/non_optimal/nul_complex1.c0000644000175000017500000000045212413255517015706 00000000000000/* Generated from ./non_optimal/nul_complex1.cloog by CLooG 0.18.1-2-g43fc508 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.4/test/non_optimal/youcef.c0000644000175000017500000000031312413255517014566 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.4/test/non_optimal/nul_complex1.cloog0000644000175000017500000000053512413255517016571 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.4/test/non_optimal/usvd_e_t.cloog0000644000175000017500000001316012413255517015771 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.4/test/non_optimal/nul_complex1.good.c0000644000175000017500000000137612413255517016643 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.4/test/non_optimal/youcef.good.c0000644000175000017500000000143112413255517015517 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.4/test/mode.c0000644000175000017500000000071612413255517011710 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.4/test/0D-3.cloog0000644000175000017500000000005212413255517012241 00000000000000c 1 3 1 1 0 0 1 1 1 3 1 1 0 0 0 0 0 0 cloog-0.18.4/test/vivien.good.c0000644000175000017500000004353112413255517013215 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.4/test/nul_lcpc.cloog0000644000175000017500000000115712413255517013444 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.4/test/uday_scalars.c0000644000175000017500000000033612413255517013434 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.4/test/walters3.cloog0000644000175000017500000000077312413255517013414 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.4/test/dealII.c0000644000175000017500000000067112413255517012113 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.4/test/infinite.c0000644000175000017500000000036312413255517012567 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.4/test/pouchet.good.c0000644000175000017500000000235212413255517013360 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.4/test/infinite2.cloog0000644000175000017500000000052112413255517013526 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.4/test/1point-1.good.c0000644000175000017500000000076612413255517013270 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.4/test/cholesky.good.c0000644000175000017500000000234612413255517013535 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.4/test/donotsimp.c0000644000175000017500000000034612413255517012777 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.4/test/basic-bounds-6.cloog0000644000175000017500000000021312413255517014351 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.4/test/block2.c0000644000175000017500000000025312413255517012134 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.4/test/classen.cloog0000644000175000017500000001217412413255517013276 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.4/test/min-3-1.cloog0000644000175000017500000000036112413255517012722 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.4/test/multi-stride2.c0000644000175000017500000000022012413255517013456 00000000000000/* Generated from ./multi-stride2.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.00s. */ for (i=5;i<=100;i+=6) { S1(i,((i-1)/2),((i-2)/3)); } cloog-0.18.4/test/0D-1.c0000644000175000017500000000015712413255517011364 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.4/test/infinite4.cloog0000644000175000017500000000016012413255517013527 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.4/test/emploi.cloog0000644000175000017500000000212312413255517013124 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.4/test/stride4.c0000644000175000017500000000027012413255517012335 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.4/test/forwardsub-3-1-2.cloog0000644000175000017500000000133012413255517014451 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.4/test/dealII.cloog0000644000175000017500000000221612413255517012771 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.4/test/levenshtein-1-2-3f.cloog0000644000175000017500000000356012413255517014774 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.4/test/infinite4.c0000644000175000017500000000020712413255517012650 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.4/test/check_c.sh0000755000175000017500000000507112413255517012535 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" "${1:-generate}" cloog-0.18.4/test/walters2.good.c0000644000175000017500000000133512413255517013454 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.4/test/iftest2.good.c0000644000175000017500000000125512413255517013272 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.4/test/backtrack.c0000644000175000017500000000016412413255517012706 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.4/test/double.c0000644000175000017500000000035412413255517012234 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.4/test/sor1d.good.c0000644000175000017500000000360512413255517012743 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.4/test/lu2.cloog0000644000175000017500000000104212413255517012340 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.4/test/yosr2.good.c0000644000175000017500000000200712413255517012764 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.4/test/min-2-1.good.c0000644000175000017500000000124512413255517012771 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.4/test/stride2.cloog0000644000175000017500000000021712413255517013215 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.4/test/cholesky.c0000644000175000017500000000116312413255517012602 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.4/test/merge.good.c0000644000175000017500000000126112413255517013006 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.4/test/iftestf.cloog0000644000175000017500000000100112413255517013275 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.4/test/generate_test.c0000644000175000017500000000703112413255517013612 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.4/test/swim.good.c0000644000175000017500000004273712413255517012703 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.4/configure0000755000175000017500000166600112555417251011560 00000000000000#! /bin/sh # Guess values for system-dependent variables and create Makefiles. # Generated by GNU Autoconf 2.69 for cloog 0.18.4. # # Report bugs to . # # # Copyright (C) 1992-1996, 1998-2012 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 # Use a proper internal environment variable to ensure we don't fall # into an infinite loop, continuously re-executing ourselves. if test x"${_as_can_reexec}" != xno && test "x$CONFIG_SHELL" != x; then _as_can_reexec=no; export _as_can_reexec; # 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 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+"$@"} # Admittedly, this is quite paranoid, since all the known shells bail # out after a failed `exec'. $as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2 as_fn_exit 255 fi # We don't want this to propagate to other subprocesses. { _as_can_reexec=; unset _as_can_reexec;} 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 test -x / || 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 : export CONFIG_SHELL # 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 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+"$@"} # Admittedly, this is quite paranoid, since all the known shells bail # out after a failed `exec'. $as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2 exit 255 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_executable_p FILE # ----------------------- # Test if FILE is an executable regular file. as_fn_executable_p () { test -f "$1" && test -x "$1" } # as_fn_executable_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; } # If we had to re-execute with $CONFIG_SHELL, we're ensured to have # already done that, so ensure we don't try to do so again and fall # in an infinite loop. This has already happened in practice. _as_can_reexec=no; export _as_can_reexec # 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 -pR'. ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || as_ln_s='cp -pR' elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -pR' fi else as_ln_s='cp -pR' 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 as_test_x='test -x' as_executable_p=as_fn_executable_p # 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.4' PACKAGE_STRING='cloog 0.18.4' 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 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.4 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.4:";; 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") --enable-dependency-tracking do not reject slow dependency extractors --disable-dependency-tracking speeds up one-time build --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.4 generated by GNU Autoconf 2.69 Copyright (C) 2012 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 || 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.4, which was generated by GNU Autoconf 2.69. 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=4 versioninfo=4:0:0 am__api_version='1.14' # 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 as_fn_executable_p "$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; } # 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 ( am_has_slept=no for am_try in 1 2; do echo "timestamp, slept: $am_has_slept" > conftest.file 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 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 if test "$2" = conftest.file || test $am_try -eq 2; then break fi # Just in case. sleep 1 am_has_slept=yes done 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; } # If we didn't sleep, we still need to ensure time stamps of config.status and # generated files are strictly newer. am_sleep_pid= if grep 'slept: no' conftest.file >/dev/null 2>&1; then ( sleep 1 ) & am_sleep_pid=$! fi rm -f conftest.file 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 --is-lightweight"; then am_missing_run="$MISSING " 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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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; } 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 as_fn_executable_p "$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 # 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=1;; 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='\' 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.4' 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"} # For better backward compatibility. To be removed once Automake 1.9.x # dies out for good. For more background, see: # # mkdir_p='$(MKDIR_P)' # 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}' # We'll loop over all known methods to create a tar archive until one works. _am_tools='gnutar pax cpio none' am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -' # POSIX will say in a future version that running "rm -f" with no argument # is OK; and we want to be able to make that assumption in our Makefile # recipes. So use an aggressive probe to check that the usage we want is # actually supported "in the wild" to an acceptable degree. # See automake bug#10828. # To make any issue more visible, cause the running configure to be aborted # by default if the 'rm' program in use doesn't match our expectations; the # user can still override this though. if rm -f && rm -fr && rm -rf; then : OK; else cat >&2 <<'END' Oops! Your 'rm' program seems unable to run without file operands specified on the command line, even when the '-f' option is present. This is contrary to the behaviour of most rm programs out there, and not conforming with the upcoming POSIX standard: Please tell bug-automake@gnu.org about your system, including the value of your $PATH and any error possibly output before this message. This can help us improve future automake versions. END if test x"$ACCEPT_INFERIOR_RM_PROGRAM" = x"yes"; then echo 'Configuration will proceed anyway, since you have set the' >&2 echo 'ACCEPT_INFERIOR_RM_PROGRAM variable to "yes"' >&2 echo >&2 else cat >&2 <<'END' Aborting the configuration process, to ensure you take notice of the issue. You can download and install GNU coreutils to get an 'rm' implementation that behaves properly: . If you want to complete the configuration process using your problematic 'rm' anyway, export the environment variable ACCEPT_INFERIOR_RM_PROGRAM to "yes", and re-run configure. END as_fn_error $? "Your 'rm' program is bad, sorry." "$LINENO" 5 fi fi # 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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 struct stat; /* 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 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 whether $CC understands -c and -o together" >&5 $as_echo_n "checking whether $CC understands -c and -o together... " >&6; } if ${am_cv_prog_cc_c_o+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF # Make sure it works both with $CC and with simple cc. # Following AC_PROG_CC_C_O, we do the test twice because some # compilers refuse to overwrite an existing .o file with -o, # though they will create one. am_cv_prog_cc_c_o=yes for am_i in 1 2; do if { echo "$as_me:$LINENO: $CC -c conftest.$ac_ext -o conftest2.$ac_objext" >&5 ($CC -c conftest.$ac_ext -o conftest2.$ac_objext) >&5 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } \ && test -f conftest2.$ac_objext; then : OK else am_cv_prog_cc_c_o=no break fi done rm -f core conftest* unset am_i fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_prog_cc_c_o" >&5 $as_echo "$am_cv_prog_cc_c_o" >&6; } if test "$am_cv_prog_cc_c_o" != yes; then # Losing compiler, so override with the script. # FIXME: It is wrong to rewrite CC. # But if we don't then we get into trouble of one sort or another. # A longer-term fix would be to have automake use am__CC in this case, # and then we could set am__CC="\$(top_srcdir)/compile \$(CC)" CC="$am_aux_dir/compile $CC" 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 10 /bin/sh. echo '/* dummy */' > 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 as_fn_executable_p "$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' macro_revision='1.3337' 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" as_fn_executable_p "$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" as_fn_executable_p "$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" as_fn_executable_p "$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" as_fn_executable_p "$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 "$withval" = no || with_gnu_ld=yes else with_gnu_ld=no fi ac_prog=ld if test "$GCC" = yes; 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 "$with_gnu_ld" = yes; 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 ;; *) case `"$tmp_nm" -p /dev/null 2>&1 | sed '1q'` in */dev/null*) lt_cv_path_NM="$tmp_nm -p" break ;; *) 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 "$lt_cv_path_NM" != "no"; 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 as_fn_executable_p "$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 as_fn_executable_p "$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 /dev/null 2>&1 | sed '1q'` in *COFF*) DUMPBIN="$DUMPBIN -symbols" ;; *) 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; ;; netbsd* | freebsd* | openbsd* | darwin* | dragonfly*) # 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 $i != 17 # 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"} { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the shell understands some XSI constructs" >&5 $as_echo_n "checking whether the shell understands some XSI constructs... " >&6; } # Try some XSI features xsi_shell=no ( _lt_dummy="a/b/c" test "${_lt_dummy##*/},${_lt_dummy%/*},${_lt_dummy#??}"${_lt_dummy%"$_lt_dummy"}, \ = c,a/b,b/c, \ && eval 'test $(( 1 + 1 )) -eq 2 \ && test "${#_lt_dummy}" -eq 5' ) >/dev/null 2>&1 \ && xsi_shell=yes { $as_echo "$as_me:${as_lineno-$LINENO}: result: $xsi_shell" >&5 $as_echo "$xsi_shell" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the shell understands \"+=\"" >&5 $as_echo_n "checking whether the shell understands \"+=\"... " >&6; } lt_shell_append=no ( foo=bar; set foo baz; eval "$1+=\$2" && test "$foo" = barbaz ) \ >/dev/null 2>&1 \ && lt_shell_append=yes { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_shell_append" >&5 $as_echo "$lt_shell_append" >&6; } 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 "$GCC" != yes; then reload_cmds=false fi ;; darwin*) if test "$GCC" = yes; 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 as_fn_executable_p "$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 as_fn_executable_p "$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 # which 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. # func_win32_libid assumes BSD nm, so disallow it if using MS dumpbin. if ( test "$lt_cv_nm_interface" = "BSD nm" && 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* | netbsdelf*-gnu) 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*) if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; 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 as_fn_executable_p "$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 as_fn_executable_p "$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 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 as_fn_executable_p "$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 as_fn_executable_p "$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 "$ac_status" -eq 0; 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 "$ac_status" -ne 0; 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 "x$lt_cv_ar_at_file" = xno; 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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 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 "$host_cpu" = ia64; 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 # 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 -e 's/^T .* \(.*\)$/extern int \1();/p' -e 's/^$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 -e 's/^: \([^ ]*\)[ ]*$/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([^ ]*\) \([^ ]*\)$/ {\"\2\", (void *) \&\2},/p'" lt_cv_sys_global_symbol_to_c_name_address_lib_prefix="sed -n -e 's/^: \([^ ]*\)[ ]*$/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([^ ]*\) \(lib[^ ]*\)$/ {\"\2\", (void *) \&\2},/p' -e 's/^$symcode* \([^ ]*\) \([^ ]*\)$/ {\"lib\2\", (void *) \&\2},/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 # and D for any global 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};"\ " \$ 0!~/External *\|/{next};"\ " / 0+ UNDEF /{next}; / UNDEF \([^|]\)*()/{next};"\ " {if(hide[section]) next};"\ " {f=0}; \$ 0~/\(\).*\|/{f=1}; {printf f ? \"T \" : \"D \"};"\ " {split(\$ 0, a, /\||\r/); split(a[2], s)};"\ " s[1]~/^[@?]/{print s[1], s[1]; next};"\ " s[1]~prfx {split(s[1],t,\"@\"); print 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 con'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* \(.*\) \(.*\)$/ {\"\2\", (void *) \&\2},/" < "$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 "$pipe_works" = yes; 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 "$GCC" = yes; 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 "x$enable_libtool_lock" != xno && 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 which ABI we are using. 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 which ABI we are using. 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 "$lt_cv_prog_gnu_ld" = yes; 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* ;; x86_64-*kfreebsd*-gnu|x86_64-*linux*|powerpc*-*linux*| \ s390*-*linux*|s390*-*tpf*|sparc*-*linux*) # Find out which ABI we are using. 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-*) LD="${LD-ld} -m elf32lppclinux" ;; powerpc64-*) 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-*) LD="${LD-ld} -m elf64lppc" ;; powerpc-*) 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 x"$lt_cv_cc_needs_belf" != x"yes"; then # this is probably gcc 2.8.0, egcs 1.0 or newer; no need for -belf CFLAGS="$SAVE_CFLAGS" fi ;; *-*solaris*) # Find out which ABI we are using. 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*) 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 as_fn_executable_p "$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 as_fn_executable_p "$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 "x$lt_cv_path_mainfest_tool" != xyes; 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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 as_fn_executable_p "$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 $_lt_result -eq 0; 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 $_lt_result -eq 0 && $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 "$lt_cv_apple_cc_single_mod" = "yes"; then _lt_dar_single_mod='$single_module' fi if test "$lt_cv_ld_exported_symbols_list" = "yes"; 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 "$lt_cv_ld_force_load" = "no"; 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 test -z "$pic_mode" && pic_mode=default # 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 "X${COLLECT_NAMES+set}" != Xset; 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 "$GCC" = yes; 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" # 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 x"$lt_cv_prog_compiler_rtti_exceptions" = xyes; 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 "$GCC" = yes; then lt_prog_compiler_wl='-Wl,' lt_prog_compiler_static='-static' case $host_os in aix*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static='-Bstatic' fi ;; 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 "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static='-Bstatic' else lt_prog_compiler_static='-bnso -bI:/lib/syscalls.exp' fi ;; 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' ;; 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 which 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" # 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 x"$lt_cv_prog_compiler_pic_works" = xyes; 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 x"$lt_cv_prog_compiler_static_works" = xyes; 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 "$lt_cv_prog_compiler_c_o" = no && test "$need_locks" != no; 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 "$hard_links" = no; 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 "$GCC" != yes; then with_gnu_ld=no fi ;; interix*) # we just hope/assume this is gcc and not c89 (= MSVC++) with_gnu_ld=yes ;; openbsd*) with_gnu_ld=no ;; linux* | k*bsd*-gnu | gnu*) link_all_deplibs=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 "$with_gnu_ld" = yes; 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 "$lt_use_gnu_ld_interface" = yes; 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 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 "$host_cpu" != ia64; 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 (1st line # is EXPORTS), use it as is; otherwise, prepend... archive_expsym_cmds='if test "x`$SED 1q $export_symbols`" = xEXPORTS; 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 "$host_os" = linux-dietlibc; 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 "$tmp_diet" = no 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' ;; 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 "x$supports_anon_versioning" = xyes; 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 "x$supports_anon_versioning" = xyes; 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* | netbsdelf*-gnu) 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 can not *** 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 "$ld_shlibs" = no; 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 "$GCC" = yes && 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 "$host_cpu" = ia64; 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 $ld_flag = "-brtl" || test $ld_flag = "-Wl,-brtl"); 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 "$GCC" = yes; 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 "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi link_all_deplibs=no else # not using gcc if test "$host_cpu" = ia64; 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 "$aix_use_runtimelinking" = yes; 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 "$aix_use_runtimelinking" = yes; 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 "${lt_cv_aix_libpath+set}" = 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 "x${allow_undefined_flag}" != "x"; then func_echo_all "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; 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 "${lt_cv_aix_libpath+set}" = 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 "$with_gnu_ld" = yes; 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~linknames=' archive_expsym_cmds='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then sed -n -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' -e '1\\\!p' < $export_symbols > $output_objdir/$soname.exp; else sed -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' < $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 "$lt_cv_ld_force_load" = "yes"; 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*) _lt_dar_can_shared=yes ;; *) _lt_dar_can_shared=$GCC ;; esac if test "$_lt_dar_can_shared" = "yes"; 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 "$GCC" = yes; 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 $output_objdir/$soname = $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 $output_objdir/$soname = $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 "$GCC" = yes && test "$with_gnu_ld" = no; 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 "$with_gnu_ld" = no; 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 "$GCC" = yes && test "$with_gnu_ld" = no; 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 x"$lt_cv_prog_compiler__b" = xyes; 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 "$with_gnu_ld" = no; 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 "$GCC" = yes; 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 "$lt_cv_irix_exported_symbol" = yes; 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* | netbsdelf*-gnu) 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*) 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__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; 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 case $host_os in openbsd[01].* | openbsd2.[0-7] | openbsd2.[0-7].*) archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec='-R$libdir' ;; *) archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' hardcode_libdir_flag_spec='${wl}-rpath,$libdir' ;; esac 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 "$GCC" = yes; 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 "$GCC" = yes; 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 "$GCC" = yes; 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 "$GCC" = yes; 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 "x$host_vendor" = xsequent; 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 "$GCC" = yes; 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 can NOT 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 "$GCC" = yes; 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 x$host_vendor = xsni; 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 "$ld_shlibs" = no && 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 "$enable_shared" = yes && test "$GCC" = yes; 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 "$GCC" = yes; 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` 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" else 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 "$host_cpu" = ia64; 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 can not hardcode correct # soname into executable. Probably we can add versioning support to # collect2, so additional links can be useful in future. if test "$aix_use_runtimelinking" = yes; 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%'\''`; test $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=yes 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 "X$HPUX_IA64_MODE" = X32; 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 "$lt_cv_prog_gnu_ld" = yes; 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 ;; # 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' ;; netbsdelf*-gnu) version_type=linux 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='NetBSD ld.elf_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*) version_type=sunos sys_lib_dlsearch_path_spec="/usr/lib" need_lib_prefix=no # Some older versions of OpenBSD (3.3 at least) *do* need versioned libs. case $host_os in openbsd3.3 | openbsd3.3.*) need_version=yes ;; *) need_version=no ;; esac 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 if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then case $host_os in openbsd2.[89] | openbsd2.[89].*) shlibpath_overrides_runpath=no ;; *) shlibpath_overrides_runpath=yes ;; esac else shlibpath_overrides_runpath=yes fi ;; 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 "$with_gnu_ld" = yes; 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 "$with_gnu_ld" = yes; 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 "$dynamic_linker" = no && can_build_shared=no variables_saved_for_relink="PATH $shlibpath_var $runpath_var" if test "$GCC" = yes; then variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH" fi if test "${lt_cv_sys_lib_search_path_spec+set}" = set; then sys_lib_search_path_spec="$lt_cv_sys_lib_search_path_spec" fi if test "${lt_cv_sys_lib_dlsearch_path_spec+set}" = 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 "X$hardcode_automatic" = "Xyes" ; then # We can hardcode non-existent directories. if test "$hardcode_direct" != no && # 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 "$_LT_TAGVAR(hardcode_shlibpath_var, )" != no && test "$hardcode_minus_L" != no; 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 "$hardcode_action" = relink || test "$inherit_rpath" = yes; then # Fast installation is not supported enable_fast_install=no elif test "$shlibpath_overrides_runpath" = yes || test "$enable_shared" = no; then # Fast installation is not necessary enable_fast_install=needless fi if test "x$enable_dlopen" != xyes; 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 ;; *) 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 "x$lt_cv_dlopen" != xno; then enable_dlopen=yes else enable_dlopen=no fi case $lt_cv_dlopen in dlopen) save_CPPFLAGS="$CPPFLAGS" test "x$ac_cv_header_dlfcn_h" = xyes && 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 "$cross_compiling" = yes; 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 "x$lt_cv_dlopen_self" = xyes; 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 "$cross_compiling" = yes; 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 which 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 "$can_build_shared" = "no" && 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 "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[4-9]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && 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 "$enable_shared" = yes || 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 as_fn_executable_p "$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 # note: don't check for gcc first since some other compilers define __GNUC__ vendors="intel: __ICC,__ECC,__INTEL_COMPILER ibm: __xlc__,__xlC__,__IBMC__,__IBMCPP__ pathscale: __PATHCC__,__PATHSCALE__ clang: __clang__ cray: _CRAYC fujitsu: __FUJITSU gnu: __GNUC__ sun: __SUNPRO_C,__SUNPRO_CC hp: __HP_cc,__HP_aCC dec: __DECC,__DECCXX,__DECC_VER,__DECCXX_VER borland: __BORLANDC__,__CODEGEARC__,__TURBOC__ comeau: __COMO__ kai: __KCC lcc: __LCC__ sgi: __sgi,sgi microsoft: _MSC_VER metrowerks: __MWERKS__ watcom: __WATCOMC__ portland: __PGI tcc: __TINYC__ unknown: UNKNOWN" for ventest in $vendors; do case $ventest in *:) vendor=$ventest; continue ;; *) vencpp="defined("`echo $ventest | sed 's/,/) || defined(/g'`")" ;; esac 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 : break fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext done ax_cv_c_compiler_vendor=`echo $vendor | cut -d: -f1` 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 as_fn_executable_p "$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 () { #ifndef __cplusplus /* Ultrix mips cc rejects this sort of thing. */ typedef int charset[2]; const charset cs = { 0, 0 }; /* 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 sort of thing. */ char tx; char *t = &tx; 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 sort of thing, saying "k.c", line 2.27: 1506-025 (S) Operand must be a modifiable lvalue. */ struct s { int j; const int *ap[3]; } bx; struct s *b = &bx; 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 { $as_echo "$as_me:${as_lineno-$LINENO}: checking that generated files are newer than configure" >&5 $as_echo_n "checking that generated files are newer than configure... " >&6; } if test -n "$am_sleep_pid"; then # Hide warnings about reused PIDs. wait $am_sleep_pid 2>/dev/null fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: done" >&5 $as_echo "done" >&6; } 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 -pR'. ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || as_ln_s='cp -pR' elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -pR' fi else as_ln_s='cp -pR' 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 # as_fn_executable_p FILE # ----------------------- # Test if FILE is an executable regular file. as_fn_executable_p () { test -f "$1" && test -x "$1" } # as_fn_executable_p as_test_x='test -x' as_executable_p=as_fn_executable_p # 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.4, which was generated by GNU Autoconf 2.69. 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.4 configured by $0, generated by GNU Autoconf 2.69, with options \\"\$ac_cs_config\\" Copyright (C) 2012 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_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"`' 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_c_name_address \ lt_cv_sys_global_symbol_to_c_name_address_lib_prefix \ 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\\"\\\`\\\\\\"" ;; *) 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\\"\\\`\\\\\\"" ;; *) eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\"" ;; esac done ac_aux_dir='$ac_aux_dir' xsi_shell='$xsi_shell' lt_shell_append='$lt_shell_append' # See if we are running on zsh, and set the options which 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' TIMESTAMP='$TIMESTAMP' 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"" || { # Older Autoconf 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"` # 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'`; 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 which 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$TIMESTAMP) $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 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 # 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 in which 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 "X${COLLECT_NAMES+set}" != Xset; 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) if test x"$xsi_shell" = xyes; then sed -e '/^func_dirname ()$/,/^} # func_dirname /c\ func_dirname ()\ {\ \ case ${1} in\ \ */*) func_dirname_result="${1%/*}${2}" ;;\ \ * ) func_dirname_result="${3}" ;;\ \ esac\ } # Extended-shell func_dirname implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_basename ()$/,/^} # func_basename /c\ func_basename ()\ {\ \ func_basename_result="${1##*/}"\ } # Extended-shell func_basename implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_dirname_and_basename ()$/,/^} # func_dirname_and_basename /c\ func_dirname_and_basename ()\ {\ \ case ${1} in\ \ */*) func_dirname_result="${1%/*}${2}" ;;\ \ * ) func_dirname_result="${3}" ;;\ \ esac\ \ func_basename_result="${1##*/}"\ } # Extended-shell func_dirname_and_basename implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_stripname ()$/,/^} # func_stripname /c\ func_stripname ()\ {\ \ # pdksh 5.2.14 does not do ${X%$Y} correctly if both X and Y are\ \ # positional parameters, so assign one to ordinary parameter first.\ \ func_stripname_result=${3}\ \ func_stripname_result=${func_stripname_result#"${1}"}\ \ func_stripname_result=${func_stripname_result%"${2}"}\ } # Extended-shell func_stripname implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_split_long_opt ()$/,/^} # func_split_long_opt /c\ func_split_long_opt ()\ {\ \ func_split_long_opt_name=${1%%=*}\ \ func_split_long_opt_arg=${1#*=}\ } # Extended-shell func_split_long_opt implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_split_short_opt ()$/,/^} # func_split_short_opt /c\ func_split_short_opt ()\ {\ \ func_split_short_opt_arg=${1#??}\ \ func_split_short_opt_name=${1%"$func_split_short_opt_arg"}\ } # Extended-shell func_split_short_opt implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_lo2o ()$/,/^} # func_lo2o /c\ func_lo2o ()\ {\ \ case ${1} in\ \ *.lo) func_lo2o_result=${1%.lo}.${objext} ;;\ \ *) func_lo2o_result=${1} ;;\ \ esac\ } # Extended-shell func_lo2o implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_xform ()$/,/^} # func_xform /c\ func_xform ()\ {\ func_xform_result=${1%.*}.lo\ } # Extended-shell func_xform implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_arith ()$/,/^} # func_arith /c\ func_arith ()\ {\ func_arith_result=$(( $* ))\ } # Extended-shell func_arith implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_len ()$/,/^} # func_len /c\ func_len ()\ {\ func_len_result=${#1}\ } # Extended-shell func_len implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: fi if test x"$lt_shell_append" = xyes; then sed -e '/^func_append ()$/,/^} # func_append /c\ func_append ()\ {\ eval "${1}+=\\${2}"\ } # Extended-shell func_append implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_append_quoted ()$/,/^} # func_append_quoted /c\ func_append_quoted ()\ {\ \ func_quote_for_eval "${2}"\ \ eval "${1}+=\\\\ \\$func_quote_for_eval_result"\ } # Extended-shell func_append_quoted implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: # Save a `func_append' function call where possible by direct use of '+=' sed -e 's%func_append \([a-zA-Z_]\{1,\}\) "%\1+="%g' $cfgfile > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: else # Save a `func_append' function call even when '+=' is not available sed -e 's%func_append \([a-zA-Z_]\{1,\}\) "%\1="$\1%g' $cfgfile > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: fi if test x"$_lt_function_replace_fail" = x":"; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Unable to substitute extended shell functions in $ofile" >&5 $as_echo "$as_me: WARNING: Unable to substitute extended shell functions in $ofile" >&2;} fi 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.4/cmake/0000755000175000017500000000000012511231702010762 500000000000000cloog-0.18.4/cmake/isl-config.cmake0000644000175000017500000000123612413255517013753 00000000000000# Try to find the isl library # ISL_FOUND - System has isl lib # ISL_INCLUDE_DIR - The isl include directory # ISL_LIBRARY - Library needed to use isl if (ISL_INCLUDE_DIR AND ISL_LIBRARY) # Already in cache, be silent set(ISL_FIND_QUIETLY TRUE) endif() find_path(ISL_INCLUDE_DIR NAMES isl/version.h) find_library(ISL_LIBRARY NAMES isl) if (ISL_LIBRARY AND ISL_INCLUDE_DIR) message(STATUS "Library isl found =) ${ISL_LIBRARY}") else() message(STATUS "Library isl not found =(") endif() include(FindPackageHandleStandardArgs) FIND_PACKAGE_HANDLE_STANDARD_ARGS(ISL DEFAULT_MSG ISL_INCLUDE_DIR ISL_LIBRARY) mark_as_advanced(ISL_INCLUDE_DIR ISL_LIBRARY) cloog-0.18.4/cmake/cloog-isl-config.cmake0000644000175000017500000000145512413255517015057 00000000000000# Try to find the cloog-isl library # CLOOG_ISL_FOUND - System has cloog-isl lib # CLOOG_ISL_INCLUDE_DIR - The cloog-isl include directory # CLOOG_ISL_LIBRARY - Library needed to use cloog-isl if (CLOOG_ISL_INCLUDE_DIR AND CLOOG_ISL_LIBRARY) # Already in cache, be silent set(CLOOG_ISL_FIND_QUIETLY TRUE) endif() find_path(CLOOG_ISL_INCLUDE_DIR NAMES cloog/isl/cloog.h) find_library(CLOOG_ISL_LIBRARY NAMES cloog-isl) if (CLOOG_ISL_LIBRARY AND CLOOG_ISL_INCLUDE_DIR) message(STATUS "Library cloog-isl found =) ${CLOOG_ISL_LIBRARY}") else() message(STATUS "Library cloog-isl not found =(") endif() include(FindPackageHandleStandardArgs) FIND_PACKAGE_HANDLE_STANDARD_ARGS(CLOOG_ISL DEFAULT_MSG CLOOG_ISL_INCLUDE_DIR CLOOG_ISL_LIBRARY) mark_as_advanced(CLOOG_ISL_INCLUDE_DIR CLOOG_ISL_LIBRARY) cloog-0.18.4/source/0000755000175000017500000000000012555417255011223 500000000000000cloog-0.18.4/source/pprint.c0000644000175000017500000005013312413261116012607 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 = osl_statement_get_body(stmt); 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; } /* pprint_parentheses_are_safer function: * this function returns 1 if it decides that it would be safer to put * parentheses around the clast_assignment when it is used as a macro * parameter, 0 otherwise. * \param[in] s Pointer to the clast_assignment to check. * \return 1 if we should print parentheses around s, 0 otherwise. */ static int pprint_parentheses_are_safer(struct clast_assignment * s) { /* Expressions of the form X = Y should not be used in macros, so we * consider readability first for them and avoid parentheses. * Also, expressions having only one term can live without parentheses. */ if ((s->LHS) || (s->RHS->type == clast_expr_term) || ((s->RHS->type == clast_expr_red) && (((struct clast_reduction *)(s->RHS))->n == 1) && (((struct clast_reduction *)(s->RHS))->elts[0]->type == clast_expr_term))) return 0; return 1; } void pprint_user_stmt(struct cloogoptions *options, FILE *dst, struct clast_user_stmt *u) { int parenthesis_to_close = 0; 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)); if (pprint_parentheses_are_safer((struct clast_assignment *)t)) { fprintf(dst, "("); parenthesis_to_close = 1; } pprint_assignment(options, dst, (struct clast_assignment *)t); if (t->next) { if (parenthesis_to_close) { fprintf(dst, ")"); parenthesis_to_close = 0; } fprintf(dst, ","); } } if (parenthesis_to_close) 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->time_var_name) { fprintf(dst, "IF_TIME(%s_start = cloog_util_rtclock());\n", (f->time_var_name) ? f->time_var_name : ""); } 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") ; if (options->language == CLOOG_LANGUAGE_C) { if (f->time_var_name) { fprintf(dst, "IF_TIME(%s += cloog_util_rtclock() - %s_start);\n", (f->time_var_name) ? f->time_var_name : "", (f->time_var_name) ? f->time_var_name : ""); } } } 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); } void clast_pprint_expr(struct cloogoptions *i, FILE *dst, struct clast_expr *e) { pprint_expr(i, dst, e); } cloog-0.18.4/source/matrix.c0000644000175000017500000001346612413255517012617 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.4/source/union_domain.c0000644000175000017500000002211712413255517013763 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.4/source/cloog.c0000644000175000017500000001142612413255517012410 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.4/source/statement.c0000644000175000017500000002373312413255517013315 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.4/source/names.c0000644000175000017500000004304612555415543012417 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)) if (fgets(s, MAX_STRING, file)) continue; /* 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.4/source/block.c0000644000175000017500000003143012413255517012374 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.4/source/clast.c0000644000175000017500000020022112413255517012404 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); if (f->time_var_name) free(f->time_var_name); 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; f->time_var_name = 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.4/source/matrix/0000755000175000017500000000000012555417255012527 500000000000000cloog-0.18.4/source/matrix/constraintset.c0000644000175000017500000011047412413255517015514 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.4/source/version.c.in0000644000175000017500000000055412413255517013377 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.4/source/int.c0000644000175000017500000000632312413255517012077 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.4/source/util.c0000644000175000017500000000615412413255517012264 00000000000000 /**-------------------------------------------------------------------** ** CLooG ** **-------------------------------------------------------------------** ** util.c ** **-------------------------------------------------------------------** ** First version: January 8th 2014 ** **-------------------------------------------------------------------**/ /****************************************************************************** * 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 * * * ******************************************************************************/ #include #include #include #include "../include/cloog/cloog.h" /** * cloog_util_rtclock function: * this function returns the value, in seconds, of the real time clock of * the operating system. The reference point between calls is consistent, * making time comparison possible. * \return The real time clock of the operating system in seconds. */ double cloog_util_rtclock() { struct timezone Tzp; struct timeval Tp; int stat = gettimeofday(&Tp, &Tzp); if (stat != 0) cloog_msg(NULL, CLOOG_WARNING, "Error return from gettimeofday: %d", stat); return (Tp.tv_sec + Tp.tv_usec*1.0e-6); } cloog-0.18.4/source/input.c0000644000175000017500000001332012413261116012427 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; } #else if (options->openscop) { cloog_die("CLooG has not been compiled with OpenScop support.\n"); } #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.4/source/isl/0000755000175000017500000000000012555417255012012 500000000000000cloog-0.18.4/source/isl/domain.c0000644000175000017500000015671712555106444013361 00000000000000#include #include #include #include #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_printer *p; isl_basic_set *bset; isl_set *set = isl_set_from_cloog_domain(domain); p = isl_printer_to_file(isl_set_get_ctx(set), foo); if (print_number) { p = isl_printer_set_output_format(p, ISL_FORMAT_EXT_POLYLIB); p = isl_printer_print_set(p, set); } else { assert(isl_set_n_basic_set(set) == 1); bset = isl_set_copy_basic_set(set); p = isl_printer_set_output_format(p, ISL_FORMAT_POLYLIB); p = isl_printer_print_basic_set(p, bset); isl_basic_set_free(bset); } isl_printer_free(p); } void cloog_scattering_print_constraints(FILE *foo, CloogScattering *scattering) { isl_map *map = isl_map_from_cloog_scattering(scattering); isl_printer *p; p = isl_printer_to_file(isl_map_get_ctx(map), foo); p = isl_printer_set_output_format(p, ISL_FORMAT_EXT_POLYLIB); p = isl_printer_print_map(p, map); isl_printer_free(p); } 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); isl_printer *p; /* 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"); p = isl_printer_to_file(isl_set_get_ctx(set), file); p = isl_printer_print_set(p, set); isl_printer_free(p); 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_val *val = cloog_int_to_isl_val(isl_constraint_get_ctx(constraint), row[1 + j]); isl_constraint_set_coefficient_val(constraint, isl_dim_out, j, val); } for (j = 0; j < nparam; ++j) { isl_val *val = cloog_int_to_isl_val(isl_constraint_get_ctx(constraint), row[1 + nvariables + j]); isl_constraint_set_coefficient_val(constraint, isl_dim_param, j, val); } isl_val *val = cloog_int_to_isl_val(isl_constraint_get_ctx(constraint), row[1 + nvariables + nparam]); isl_constraint_set_constant_val(constraint, val); 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) { 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->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) { int ret = -1; isl_set *set = isl_set_from_cloog_domain(domain); isl_val *stride_val = NULL; isl_val *offset_val = NULL; ret = isl_set_dim_residue_class_val(set, strided_level - 1, &stride_val, &offset_val); if (ret != 0) cloog_die("failure to compute stride.\n"); isl_val_to_cloog_int(stride_val, stride); isl_val_to_cloog_int(offset_val, offset); if (!cloog_int_is_zero(*offset)) cloog_int_sub(*offset, *stride, *offset); isl_val_free(stride_val); isl_val_free(offset_val); 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_val *v; unsigned n_div; if (isl_constraint_is_equality(c)) { isl_constraint_free(c); return 0; } v = isl_constraint_get_coefficient_val(c, isl_dim_set, ccs->level - 1); if (isl_val_is_pos(v)) { n_div = isl_constraint_dim(c, isl_dim_div); for (i = 0; i < n_div; ++i) { isl_val_free(v); v = isl_constraint_get_coefficient_val(c, isl_dim_div, i); if (!isl_val_is_zero(v)) break; } if (i < n_div) ccs->can_stride = 0; } isl_val_free(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_val *v; isl_constraint *bound; isl_aff *b; if (isl_constraint_is_equality(c)) { isl_constraint_free(c); return 0; } v = isl_constraint_get_coefficient_val(c, isl_dim_set, csl->level - 1); if (!isl_val_is_pos(v)) { isl_val_free(v); isl_constraint_free(c); return 0; } isl_val_free(v); b = isl_constraint_get_bound(c, isl_dim_set, csl->level - 1); b = isl_aff_neg(b); b = isl_aff_add_constant_val(b, cloog_int_to_isl_val(isl_constraint_get_ctx(c), csl->stride->offset)); b = isl_aff_scale_down_val(b, cloog_int_to_isl_val(isl_constraint_get_ctx(c), csl->stride->stride)); b = isl_aff_floor(b); b = isl_aff_scale_val(b, cloog_int_to_isl_val(isl_constraint_get_ctx(c), csl->stride->stride)); v = cloog_int_to_isl_val(isl_constraint_get_ctx(c), csl->stride->offset); v = isl_val_neg(v); b = isl_aff_add_constant_val(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_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_val *v; isl_constraint *bound; isl_constraint *csl_c; isl_aff *d, *b; if (isl_constraint_is_equality(c)) { isl_constraint_free(c); return 0; } v = isl_constraint_get_coefficient_val(c, isl_dim_set, csl->level - 1); if (!isl_val_is_pos(v)) { isl_val_free(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_val(d, cloog_int_to_isl_val(isl_constraint_get_ctx(csl_c), 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_val(b, cloog_int_to_isl_val(isl_constraint_get_ctx(csl_c), csl->stride->stride)); b = isl_aff_floor(b); b = isl_aff_scale_val(b, cloog_int_to_isl_val(isl_constraint_get_ctx(csl_c), 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_val_free(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_plain_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_val *v; int i; int handle = 0; v = isl_constraint_get_coefficient_val(c, isl_dim_set, cbs->level - 1); if (!cbs->lower && isl_val_is_pos(v)) cbs->lower = handle = 1; else if (!cbs->upper && isl_val_is_neg(v)) cbs->upper = handle = 1; if (handle) { for (i = 0; i < isl_set_dim(cbs->set, isl_dim_param); ++i) { isl_val_free(v); v = isl_constraint_get_coefficient_val(c, isl_dim_param, i); if (isl_val_is_zero(v)) continue; cbs->set = isl_set_split_dims(cbs->set, isl_dim_param, i, 1); } } isl_val_free(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 block; isl_val *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); cst = NULL; for (i = 0; i < n_scat; ++i) { cst = isl_set_plain_get_val_if_fixed(delta, isl_dim_set, i); if (!cst){ isl_val_free(cst); break; } if (isl_val_is_zero(cst)){ isl_val_free(cst); continue; } if (i + 1 < n_scat){ isl_val_free(cst); break; } if (!isl_val_is_one(cst)){ isl_val_free(cst); break; } if (!injective_scattering(scattering)){ isl_val_free(cst); break; } isl_val_free(cst); } block = i >= n_scat; 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_plain_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_plain_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); isl_val *v = isl_map_plain_get_val_if_fixed(map, isl_dim_out, dimension); if (v != NULL) { if (!isl_val_is_nan(v)){ if (value != NULL) isl_val_to_cloog_int(v, value); isl_val_free(v); return 1; } else { isl_val_free(v); return 0; } } return 0; } /** * 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); isl_val *cst = isl_set_plain_get_val_if_fixed(set, isl_dim_set, dimension); if (cst != NULL) { if (!isl_val_is_nan(cst)){ if (value != NULL) isl_val_to_cloog_int(cst, value); isl_val_free(cst); return 1; } else { isl_val_free(cst); return 0; } } return 0; } /** * 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; isl_space *space; isl_set *cube; isl_val *min_v; isl_val *max_v; if (dim == 0) return cloog_domain_universe(state, dim); space = isl_space_set_alloc(state->backend->ctx, 0, dim); cube = isl_set_universe(space); for (i = 0; i < dim; ++i) { min_v = cloog_int_to_isl_val(isl_set_get_ctx(cube), min); max_v = cloog_int_to_isl_val(isl_set_get_ctx(cube), max); cube = isl_set_lower_bound_val(cube, isl_dim_set, i, min_v); cube = isl_set_upper_bound_val(cube, isl_dim_set, i, max_v); } return cloog_domain_from_isl_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_val *v, *m, *gcd, *stride; isl_val *v_copy, *m_copy, *gcd_copy; cloog_int_t c_v, c_m, c_gcd, c_stride, c_factor; CloogStride *s; isl_ctx *ctx = isl_constraint_get_ctx(c);; if (!c) return NULL; v = isl_constraint_get_coefficient_val(c, isl_dim_set, level - 1); sign = isl_val_sgn(v); m = isl_val_abs(v); /* *takes* v. */ gcd = isl_val_int_from_si(ctx, 0); n = isl_constraint_dim(c, isl_dim_div); for (i = 0; i < n; ++i) { v = isl_constraint_get_coefficient_val(c, isl_dim_div, i); gcd = isl_val_gcd(gcd, v); } m_copy = isl_val_copy(m); gcd_copy = isl_val_copy(gcd); v = isl_val_gcd(m, gcd); v_copy = isl_val_copy(v); gcd = isl_val_copy(gcd_copy); stride = isl_val_div(gcd, v); if (isl_val_is_zero(stride) || isl_val_is_one(stride)) s = NULL; else { cloog_int_init(c_m); cloog_int_init(c_stride); cloog_int_init(c_v); cloog_int_init(c_gcd); cloog_int_init(c_factor); isl_val_to_cloog_int(m_copy, &c_m); isl_val_to_cloog_int(stride, &c_stride); isl_val_to_cloog_int(v_copy, &c_v); isl_val_to_cloog_int(gcd_copy, &c_gcd); Euclid(c_m, c_stride, &c_factor, &c_v, &c_gcd); if (sign > 0) cloog_int_neg(c_factor, c_factor); c = isl_constraint_copy(c); s = cloog_stride_alloc_from_constraint(c_stride, cloog_constraint_from_isl_constraint(c), c_factor); cloog_int_clear(c_m); cloog_int_clear(c_stride); cloog_int_clear(c_v); cloog_int_clear(c_gcd); cloog_int_clear(c_factor); } isl_val_free(stride); isl_val_free(gcd_copy); isl_val_free(m_copy); isl_val_free(v_copy); 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_val *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; } v = isl_constraint_get_coefficient_val(c, isl_dim_set, data->level - 1); if (!isl_val_is_zero(v)) data->stride = construct_stride(c, data->level); isl_val_free(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_val *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_val **v) { unsigned n_div; isl_aff *aff; enum isl_lp_result; 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); *v = isl_set_max_val(ccu->set, aff); isl_aff_free(aff); if (!*v || isl_val_is_nan(*v)) cloog_die("Fail to decide about unrolling (cannot find max)"); if (isl_val_is_infty(*v) || isl_val_is_neginfty(*v)){ isl_val_free(*v); *v = NULL; return 0; } *v = isl_val_add_ui(*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_val *v; isl_val *count = NULL; v = isl_constraint_get_coefficient_val(c, isl_dim_set, ccu->level - 1); if (isl_val_is_pos(v) && is_valid_unrolling_lower_bound(ccu, c, &count) && (!ccu->c || (isl_val_lt(count, ccu->n))) ) { isl_constraint_free(ccu->c); ccu->c = isl_constraint_copy(c); if (ccu->n) isl_val_free(ccu->n); ccu->n = isl_val_copy(count); } isl_val_free(count); isl_val_free(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); isl_val *v = cloog_int_to_isl_val(isl_set_get_ctx(set), *n); struct cloog_can_unroll ccu = { 1, level, NULL, set, v }; 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); isl_val_to_cloog_int(ccu.n, n); /* Note: we have to free ccu.n and not v because v has been * freed and replaced in ccu during isl_set_foreach_basic_set */ isl_val_free(ccu.n); 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_ctx *ctx = isl_set_get_ctx(set); 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_val(aff, cloog_int_to_isl_val(ctx, offset)); eq = isl_equality_from_aff(aff); set = isl_set_add_constraint(set, eq); return cloog_domain_from_isl_set(set); } cloog-0.18.4/source/isl/backend.c0000644000175000017500000000137212413255517013462 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.4/source/isl/constraints.c0000644000175000017500000007437712555106444014462 00000000000000#include #include #include #include #include #include #include #include #include #define ALLOC(type) (type*)malloc(sizeof(type)) #define ALLOCN(type,n) (type*)malloc((n)*sizeof(type)) __isl_give isl_val *cloog_int_to_isl_val(isl_ctx* ctx, cloog_int_t c) { isl_val *v; #if defined(CLOOG_INT_INT) v = isl_val_int_from_si(ctx, c); #elif defined(CLOOG_INT_LONG) v = isl_val_int_from_si(ctx, c); #elif defined(CLOOG_INT_LONG_LONG) v = isl_val_int_from_si(ctx, c); #elif defined(CLOOG_INT_GMP) v = isl_val_int_from_gmp(ctx, c); #else #error "No integer type defined" #endif return v; } /* * CLooG'll be dealing in integers so we expect numerator/1 form * from isl_val. Thus get numerator to assign to cloog_int */ void isl_val_to_cloog_int(__isl_keep isl_val *val, cloog_int_t *cint) { assert(isl_val_is_int(val)); #if defined(CLOOG_INT_INT) *cint = isl_val_get_num_si(val); #elif defined(CLOOG_INT_LONG) *cint = isl_val_get_num_si(val); #elif defined(CLOOG_INT_LONG_LONG) *cint = isl_val_get_num_si(val); #elif defined(CLOOG_INT_GMP) isl_val_get_num_gmp(val, *cint); #else #error "No integer type defined" #endif } 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_val *c; int type = EQTYPE_NONE; struct isl_constraint *constraint = cloog_constraint_to_isl(cc); c = isl_constraint_get_constant_val(constraint); if (!isl_val_is_zero(c)) type = EQTYPE_CONSTANT; isl_val_free(c); c = isl_constraint_get_coefficient_val(constraint, isl_dim_set, level - 1); if (!isl_val_is_one(c) && !isl_val_is_negone(c)) type = EQTYPE_EXAFFINE; isl_val_free(c); for (i = 0; i < isl_constraint_dim(constraint, isl_dim_param); ++i) { c = isl_constraint_get_coefficient_val(constraint, isl_dim_param, i); if (isl_val_is_zero(c)){ isl_val_free(c); continue; } if ((!isl_val_is_one(c) && !isl_val_is_negone(c)) || type != EQTYPE_NONE) { type = EQTYPE_EXAFFINE; isl_val_free(c); break; } type = EQTYPE_PUREITEM; isl_val_free(c); } for (i = 0; i < isl_constraint_dim(constraint, isl_dim_set); ++i) { if (i == level - 1) continue; c = isl_constraint_get_coefficient_val(constraint, isl_dim_set, i); if (isl_val_is_zero(c)){ isl_val_free(c); continue; } if ((!isl_val_is_one(c) && !isl_val_is_negone(c)) || type != EQTYPE_NONE) { type = EQTYPE_EXAFFINE; isl_val_free(c); break; } type = EQTYPE_PUREITEM; isl_val_free(c); } for (i = 0; i < isl_constraint_dim(constraint, isl_dim_div); ++i) { c = isl_constraint_get_coefficient_val(constraint, isl_dim_div, i); if (isl_val_is_zero(c)){ isl_val_free(c); continue; } if ((!isl_val_is_one(c) && !isl_val_is_negone(c)) || type != EQTYPE_NONE) { type = EQTYPE_EXAFFINE; isl_val_free(c); break; } type = EQTYPE_PUREITEM; isl_val_free(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 "soft copy" of a CloogConstraintSet data * structure. * * NOTE: this function used to return a "hard copy" (not a pointer copy) but isl * doesn't provide isl_basic_set_dup() anymore and a soft copy works as well. */ 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_copy(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); isl_val *c; struct clast_reduction *r; struct clast_expr *e = NULL; isl_aff *div; cloog_int_t cint; cloog_int_init(cint); div = isl_constraint_get_div(cloog_constraint_to_isl(constraint), pos); 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; c = isl_aff_get_coefficient_val(div, dim.type, dim.pos); if (!isl_val_is_zero(c)) ++nb_elts; isl_val_free(c); } c = isl_aff_get_constant_val(div); if (!isl_val_is_zero(c)) ++nb_elts; isl_val_free(c); 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; c = isl_aff_get_coefficient_val(div, dim.type, dim.pos); if (isl_val_is_zero(c)){ isl_val_free(c); continue; } v = cloog_constraint_variable_expr(constraint, 1 + i, names); /* We are interested only in the numerator */ cloog_int_set_si(cint, isl_val_get_num_si(c)); r->elts[nb_elts++] = &new_clast_term(cint, v)->expr; isl_val_free(c); } c = isl_aff_get_constant_val(div); if (!isl_val_is_zero(c)) { /* We are interested only in the numerator */ cloog_int_set_si(cint, isl_val_get_num_si(c)); r->elts[nb_elts++] = &new_clast_term(cint, NULL)->expr; } isl_val_free(c); c = isl_aff_get_denominator_val(div); isl_val_to_cloog_int(c, &cint); isl_val_free(c); e = &new_clast_binary(clast_bin_fdiv, &r->expr, cint)->expr; cloog_int_clear(cint); 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_val *c; int res; c = cloog_constraint_coefficient_get_val(constraint, v); res = !isl_val_is_zero(c); isl_val_free(c); return res; } int cloog_constraint_is_lower_bound(CloogConstraint *constraint, int v) { isl_val *c; int res; c = cloog_constraint_coefficient_get_val(constraint, v); res = isl_val_is_pos(c); isl_val_free(c); return res; } int cloog_constraint_is_upper_bound(CloogConstraint *constraint, int v) { isl_val *c; int res; c = cloog_constraint_coefficient_get_val(constraint, v); res = isl_val_is_neg(c); isl_val_free(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; isl_val *ival; if (!constraint) val = NULL; dim = constraint_cloog_dim_to_isl_dim(constraint, var); c = cloog_constraint_to_isl(constraint); ival = isl_constraint_get_coefficient_val(c, dim.type, dim.pos); isl_val_to_cloog_int(ival, val); isl_val_free(ival); } isl_val *cloog_constraint_coefficient_get_val(CloogConstraint *constraint, int var) { struct cloog_isl_dim dim; isl_constraint *c; isl_val *val; if (!constraint) return NULL; dim = constraint_cloog_dim_to_isl_dim(constraint, var); c = cloog_constraint_to_isl(constraint); val = isl_constraint_get_coefficient_val(c, dim.type, dim.pos); return 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_val(c, dim.type, dim.pos, cloog_int_to_isl_val(isl_constraint_get_ctx(c), val)); } void cloog_constraint_constant_get(CloogConstraint *constraint, cloog_int_t *val) { isl_val *ival; ival = isl_constraint_get_constant_val(cloog_constraint_to_isl(constraint)); isl_val_to_cloog_int(ival, val); isl_val_free(ival); } __isl_give isl_val *cloog_constraint_constant_get_val(CloogConstraint *constraint) { return isl_constraint_get_constant_val(cloog_constraint_to_isl(constraint)); } /** * 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_val **bound = (isl_val **)user; isl_val *v; v = cloog_constraint_constant_get_val(c); *bound = isl_val_add(*bound, 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); cloog_int_set_si(*bound, 0); isl_val *v = cloog_int_to_isl_val(isl_basic_set_get_ctx(bset), *bound); constraints = cloog_constraint_set_from_isl_basic_set(bset); cloog_constraint_set_foreach_constraint(constraints, add_constant_term, &v); isl_val_to_cloog_int(v, bound); //return the value to bound isl_val_free(v); 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_val *u; unsigned nparam, nvar; nparam = isl_constraint_dim(c, isl_dim_param); nvar = isl_constraint_dim(c, isl_dim_set); for (i = 0; i < nparam; ++i) { u = isl_constraint_get_coefficient_val(c, isl_dim_param, i); u = isl_val_mul(u, cloog_int_to_isl_val(isl_constraint_get_ctx(c), stride->factor)); offset = isl_aff_set_coefficient_val(offset, isl_dim_param, i, u); } for (i = 0; i < nvar; ++i) { if (i == level - 1) continue; u = isl_constraint_get_coefficient_val(c, isl_dim_set, i); u = isl_val_mul(u, cloog_int_to_isl_val(isl_constraint_get_ctx(c), stride->factor)); offset = isl_aff_set_coefficient_val(offset, isl_dim_in, i, u); } u = isl_constraint_get_constant_val(c); u = isl_val_mul(u, cloog_int_to_isl_val(isl_constraint_get_ctx(c), stride->factor)); offset = isl_aff_set_constant_val(offset, 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_val(lower, cloog_int_to_isl_val(isl_constraint_get_ctx(stride_c), stride->stride)); lower = isl_aff_ceil(lower); lower = isl_aff_scale_val(lower, cloog_int_to_isl_val(isl_constraint_get_ctx(stride_c), 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.4/source/options.c0000644000175000017500000004775312413255517013014 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.4/source/mp_get_memory_functions.c0000644000175000017500000000056512413255517016242 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.4/source/stride.c0000644000175000017500000000251412413255517012575 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.4/source/program.c0000644000175000017500000012626212554423530012757 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 #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") ; fprintf(file, "#ifdef TIME \n#define IF_TIME(foo) foo; \n" "#else\n#define IF_TIME(foo)\n#endif\n\n"); } static void print_declarations(FILE *file, int n, char **names, int indentation) { int i; for (i = 0; i < indentation; i++) fprintf(file, " "); fprintf(file, "int %s", names[0]); for (i = 1; i < n; i++) fprintf(file, ", %s", names[i]); fprintf(file, ";\n"); } static void print_scattering_declarations(FILE *file, CloogProgram *program, int indentation) { int i, j, found = 0; int nb_scatnames = 0; CloogNames *names = program->names; // Copy pointer only to those scatering names that do not duplicate // iterator names. char **scatnames = (char **) malloc(sizeof(char *) * names->nb_scattering); for (i = 0; i < names->nb_scattering; ++i) { for (j = 0; j < names->nb_iterators; ++j) { found = 0; if (strcmp(names->scattering[i], names->iterators[j]) == 0) { found = 1; } } if (!found) { // Save a pointer (intentional!) to the names in the new array. scatnames[nb_scatnames++] = names->scattering[i]; } } if (nb_scatnames) { for (i = 0; i < indentation; i++) fprintf(file, " "); fprintf(file, "/* Scattering iterators. */\n"); print_declarations(file, nb_scatnames, scatnames, indentation); } free(scatnames); } static void print_iterator_declarations(FILE *file, CloogProgram *program, CloogOptions *options) { CloogNames *names = program->names; print_scattering_declarations(file, program, 2); if (names->nb_iterators) { fprintf(file, " /* Original iterators. */\n"); print_declarations(file, names->nb_iterators, names->iterators, 2); } } 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"); } #ifdef OSL_SUPPORT static int get_osl_loop_flags (osl_scop_p scop) { int flags = 0; osl_loop_p ll = osl_generic_lookup(scop->extension, OSL_URI_LOOP); while (ll) { flags |= ll->directive; ll = ll->next; } return flags; } static void print_iterator_declarations_osl(FILE *file, CloogProgram *program, int indent, CloogOptions *options) { osl_coordinates_p co = NULL; int i; int loopflags = 0; char* vecvar[2] = {"lbv", "ubv"}; char* parvar[2] = {"lbp", "ubp"}; osl_scop_p scop = options->scop; CloogNames *names = program->names; print_scattering_declarations(file, program, indent); co = osl_generic_lookup(scop->extension, OSL_URI_COORDINATES); if (co==NULL //if coordinates exist then iterators already declared in file && names->nb_iterators) { for (i = 0; i < indent; i++) fprintf(file, " "); fprintf(file, "/* Original iterators. */\n"); print_declarations(file, names->nb_iterators, names->iterators, indent); } loopflags = get_osl_loop_flags(scop); if(loopflags & CLAST_PARALLEL_OMP) print_declarations(file, 2, parvar, indent); if(loopflags & CLAST_PARALLEL_VEC) print_declarations(file, 2, vecvar, indent); fprintf(file, "\n"); } /* * add tags clast loops according to information in scop's osl_loop extension */ static int annotate_loops(osl_scop_p program, struct clast_stmt *root){ int j, nclastloops, nclaststmts; struct clast_for **clastloops = NULL; int *claststmts = NULL; int ret = 0; if (program == NULL) { return ret; } osl_loop_p ll = osl_generic_lookup(program->extension, OSL_URI_LOOP); while (ll) { //for each loop osl_loop_p loop = ll; ClastFilter filter = { loop->iter, loop->stmt_ids, loop->nb_stmts, subset}; clast_filter(root, filter, &clastloops, &nclastloops, &claststmts, &nclaststmts); /* There should be at least one */ if (nclastloops==0) { //FROM PLUTO /* Sometimes loops may disappear (1) tile size larger than trip count * 2) it's a scalar dimension but can't be determined from the * trans matrix */ printf("Warning: parallel poly loop not found in AST\n"); ll = ll->next; continue; } for (j=0; jdirective & CLAST_PARALLEL_VEC) { clastloops[j]->parallel |= CLAST_PARALLEL_VEC; ret |= CLAST_PARALLEL_VEC; } if (loop->directive & CLAST_PARALLEL_OMP) { clastloops[j]->parallel |= CLAST_PARALLEL_OMP; ret |= CLAST_PARALLEL_OMP; if (loop->private_vars) { clastloops[j]->private_vars = strdup(loop->private_vars); } } } if (clastloops) { free(clastloops); clastloops=NULL;} if (claststmts) { free(claststmts); claststmts=NULL;} ll = ll->next; } return ret; } #endif /** * 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; int indentation = 0; char c; osl_scop_p scop = options->scop; osl_coordinates_p coordinates; struct clast_stmt *root; FILE* original = NULL; if (scop && !options->compilable && !options->callable) { #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 coordinates = osl_generic_lookup(scop->extension, OSL_URI_COORDINATES); if (coordinates) { original = fopen(coordinates->name, "r"); indentation = coordinates->indent; if (!original) { cloog_msg(options, CLOOG_WARNING, "unable to open the file specified in the SCoP " "coordinates\n"); coordinates = NULL; } } /* Print the macros the generated code may need. */ print_macros(file); /* Print what was before the SCoP in the original file (if any). */ if (coordinates) { 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); annotate_loops(options->scop, root); print_iterator_declarations_osl(file, program, indentation, options); clast_pprint(file, root, indentation, options); cloog_clast_free(root); /* Print what was after the SCoP in the original file (if any). */ if (coordinates) { 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.4/source/version.c0000644000175000017500000000055112555417255012775 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.4/source/loop.c0000644000175000017500000024652112555415543012270 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)) if (fgets(s, MAX_STRING, foo)) continue; 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.4/source/state.c0000644000175000017500000000205212413255517012420 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.4/README0000644000175000017500000002176312413255517010526 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